3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
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.
9 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
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
28 /* Missing proto on LynxOS */
29 char *gconvert(double, int, int, char *);
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
44 #define ASSERT_UTF8_CACHE(cache) \
45 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
47 #define ASSERT_UTF8_CACHE(cache) NOOP
50 #ifdef PERL_OLD_COPY_ON_WRITE
51 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
52 #define SV_COW_NEXT_SV_SET(current,next) SvUV_set(current, PTR2UV(next))
53 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
57 /* ============================================================================
59 =head1 Allocation and deallocation of SVs.
61 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
62 av, hv...) contains type and reference count information, as well as a
63 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
64 specific to each type.
66 In all but the most memory-paranoid configuations (ex: PURIFY), this
67 allocation is done using arenas, which by default are approximately 4K
68 chunks of memory parcelled up into N heads or bodies (of same size).
69 Sv-bodies are allocated by their sv-type, guaranteeing size
70 consistency needed to allocate safely from arrays.
72 The first slot in each arena is reserved, and is used to hold a link
73 to the next arena. In the case of heads, the unused first slot also
74 contains some flags and a note of the number of slots. Snaked through
75 each arena chain is a linked list of free items; when this becomes
76 empty, an extra arena is allocated and divided up into N items which
77 are threaded into the free list.
79 The following global variables are associated with arenas:
81 PL_sv_arenaroot pointer to list of SV arenas
82 PL_sv_root pointer to list of free SV structures
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
88 Note that some of the larger and more rarely used body types (eg
89 xpvio) are not allocated using arenas, but are instead just
90 malloc()/free()ed as required.
92 In addition, a few SV heads are not allocated from an arena, but are
93 instead directly created as static or auto variables, eg PL_sv_undef.
94 The size of arenas can be changed from the default by setting
95 PERL_ARENA_SIZE appropriately at compile time.
97 The SV arena serves the secondary purpose of allowing still-live SVs
98 to be located and destroyed during final cleanup.
100 At the lowest level, the macros new_SV() and del_SV() grab and free
101 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
102 to return the SV to the free list with error checking.) new_SV() calls
103 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
104 SVs in the free list have their SvTYPE field set to all ones.
106 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
107 that allocate and return individual body types. Normally these are mapped
108 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
109 instead mapped directly to malloc()/free() if PURIFY is defined. The
110 new/del functions remove from, or add to, the appropriate PL_foo_root
111 list, and call more_xiv() etc to add a new arena if the list is empty.
113 At the time of very final cleanup, sv_free_arenas() is called from
114 perl_destruct() to physically free all the arenas allocated since the
115 start of the interpreter. Note that this also clears PL_he_arenaroot,
116 which is otherwise dealt with in hv.c.
118 Manipulation of any of the PL_*root pointers is protected by enclosing
119 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
120 if threads are enabled.
122 The function visit() scans the SV arenas list, and calls a specified
123 function for each SV it finds which is still live - ie which has an SvTYPE
124 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
125 following functions (specified as [function that calls visit()] / [function
126 called by visit() for each SV]):
128 sv_report_used() / do_report_used()
129 dump all remaining SVs (debugging aid)
131 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
132 Attempt to free all objects pointed to by RVs,
133 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
134 try to do the same for all objects indirectly
135 referenced by typeglobs too. Called once from
136 perl_destruct(), prior to calling sv_clean_all()
139 sv_clean_all() / do_clean_all()
140 SvREFCNT_dec(sv) each remaining SV, possibly
141 triggering an sv_free(). It also sets the
142 SVf_BREAK flag on the SV to indicate that the
143 refcnt has been artificially lowered, and thus
144 stopping sv_free() from giving spurious warnings
145 about SVs which unexpectedly have a refcnt
146 of zero. called repeatedly from perl_destruct()
147 until there are no SVs left.
149 =head2 Arena allocator API Summary
151 Private API to rest of sv.c
155 new_XIV(), del_XIV(),
156 new_XNV(), del_XNV(),
161 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
166 ============================================================================ */
171 * "A time to plant, and a time to uproot what was planted..."
175 * nice_chunk and nice_chunk size need to be set
176 * and queried under the protection of sv_mutex
179 Perl_offer_nice_chunk(pTHX_ void *chunk, U32 chunk_size)
184 new_chunk = (void *)(chunk);
185 new_chunk_size = (chunk_size);
186 if (new_chunk_size > PL_nice_chunk_size) {
187 Safefree(PL_nice_chunk);
188 PL_nice_chunk = (char *) new_chunk;
189 PL_nice_chunk_size = new_chunk_size;
196 #ifdef DEBUG_LEAKING_SCALARS
197 # define FREE_SV_DEBUG_FILE(sv) Safefree((sv)->sv_debug_file)
199 # define FREE_SV_DEBUG_FILE(sv)
203 # define SvARENA_CHAIN(sv) ((sv)->sv_u.svu_rv)
204 /* Whilst I'd love to do this, it seems that things like to check on
206 # define POSION_SV_HEAD(sv) Poison(sv, 1, struct STRUCT_SV)
208 # define POSION_SV_HEAD(sv) Poison(&SvANY(sv), 1, void *), \
209 Poison(&SvREFCNT(sv), 1, U32)
211 # define SvARENA_CHAIN(sv) SvANY(sv)
212 # define POSION_SV_HEAD(sv)
215 #define plant_SV(p) \
217 FREE_SV_DEBUG_FILE(p); \
219 SvARENA_CHAIN(p) = (void *)PL_sv_root; \
220 SvFLAGS(p) = SVTYPEMASK; \
225 /* sv_mutex must be held while calling uproot_SV() */
226 #define uproot_SV(p) \
229 PL_sv_root = (SV*)SvARENA_CHAIN(p); \
234 /* make some more SVs by adding another arena */
236 /* sv_mutex must be held while calling more_sv() */
243 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
244 PL_nice_chunk = Nullch;
245 PL_nice_chunk_size = 0;
248 char *chunk; /* must use New here to match call to */
249 Newx(chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
250 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
256 /* new_SV(): return a new, empty SV head */
258 #ifdef DEBUG_LEAKING_SCALARS
259 /* provide a real function for a debugger to play with */
269 sv = S_more_sv(aTHX);
274 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
275 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
276 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
277 sv->sv_debug_inpad = 0;
278 sv->sv_debug_cloned = 0;
279 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
283 # define new_SV(p) (p)=S_new_SV(aTHX)
292 (p) = S_more_sv(aTHX); \
301 /* del_SV(): return an empty SV head to the free list */
316 S_del_sv(pTHX_ SV *p)
321 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
322 const SV * const sv = sva + 1;
323 const SV * const svend = &sva[SvREFCNT(sva)];
324 if (p >= sv && p < svend) {
330 if (ckWARN_d(WARN_INTERNAL))
331 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
332 "Attempt to free non-arena SV: 0x%"UVxf
333 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
340 #else /* ! DEBUGGING */
342 #define del_SV(p) plant_SV(p)
344 #endif /* DEBUGGING */
348 =head1 SV Manipulation Functions
350 =for apidoc sv_add_arena
352 Given a chunk of memory, link it to the head of the list of arenas,
353 and split it into a list of free SVs.
359 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
365 /* The first SV in an arena isn't an SV. */
366 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
367 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
368 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
370 PL_sv_arenaroot = sva;
371 PL_sv_root = sva + 1;
373 svend = &sva[SvREFCNT(sva) - 1];
376 SvARENA_CHAIN(sv) = (void *)(SV*)(sv + 1);
380 /* Must always set typemask because it's awlays checked in on cleanup
381 when the arenas are walked looking for objects. */
382 SvFLAGS(sv) = SVTYPEMASK;
385 SvARENA_CHAIN(sv) = 0;
389 SvFLAGS(sv) = SVTYPEMASK;
392 /* visit(): call the named function for each non-free SV in the arenas
393 * whose flags field matches the flags/mask args. */
396 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
401 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
402 register const SV * const svend = &sva[SvREFCNT(sva)];
404 for (sv = sva + 1; sv < svend; ++sv) {
405 if (SvTYPE(sv) != SVTYPEMASK
406 && (sv->sv_flags & mask) == flags
419 /* called by sv_report_used() for each live SV */
422 do_report_used(pTHX_ SV *sv)
424 if (SvTYPE(sv) != SVTYPEMASK) {
425 PerlIO_printf(Perl_debug_log, "****\n");
432 =for apidoc sv_report_used
434 Dump the contents of all SVs not yet freed. (Debugging aid).
440 Perl_sv_report_used(pTHX)
443 visit(do_report_used, 0, 0);
447 /* called by sv_clean_objs() for each live SV */
450 do_clean_objs(pTHX_ SV *ref)
453 SV * const target = SvRV(ref);
454 if (SvOBJECT(target)) {
455 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(ref)));
456 if (SvWEAKREF(ref)) {
457 sv_del_backref(target, ref);
463 SvREFCNT_dec(target);
468 /* XXX Might want to check arrays, etc. */
471 /* called by sv_clean_objs() for each live SV */
473 #ifndef DISABLE_DESTRUCTOR_KLUDGE
475 do_clean_named_objs(pTHX_ SV *sv)
477 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
479 #ifdef PERL_DONT_CREATE_GVSV
482 SvOBJECT(GvSV(sv))) ||
483 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
484 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
485 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
486 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
488 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
489 SvFLAGS(sv) |= SVf_BREAK;
497 =for apidoc sv_clean_objs
499 Attempt to destroy all objects not yet freed
505 Perl_sv_clean_objs(pTHX)
507 PL_in_clean_objs = TRUE;
508 visit(do_clean_objs, SVf_ROK, SVf_ROK);
509 #ifndef DISABLE_DESTRUCTOR_KLUDGE
510 /* some barnacles may yet remain, clinging to typeglobs */
511 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
513 PL_in_clean_objs = FALSE;
516 /* called by sv_clean_all() for each live SV */
519 do_clean_all(pTHX_ SV *sv)
521 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
522 SvFLAGS(sv) |= SVf_BREAK;
523 if (PL_comppad == (AV*)sv) {
525 PL_curpad = Null(SV**);
531 =for apidoc sv_clean_all
533 Decrement the refcnt of each remaining SV, possibly triggering a
534 cleanup. This function may have to be called multiple times to free
535 SVs which are in complex self-referential hierarchies.
541 Perl_sv_clean_all(pTHX)
544 PL_in_clean_all = TRUE;
545 cleaned = visit(do_clean_all, 0,0);
546 PL_in_clean_all = FALSE;
551 S_free_arena(pTHX_ void **root) {
553 void ** const next = *(void **)root;
560 =for apidoc sv_free_arenas
562 Deallocate the memory used by all arenas. Note that all the individual SV
563 heads and bodies within the arenas must already have been freed.
567 #define free_arena(name) \
569 S_free_arena(aTHX_ (void**) PL_ ## name ## _arenaroot); \
570 PL_ ## name ## _arenaroot = 0; \
571 PL_ ## name ## _root = 0; \
575 Perl_sv_free_arenas(pTHX)
581 /* Free arenas here, but be careful about fake ones. (We assume
582 contiguity of the fake ones with the corresponding real ones.) */
584 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
585 svanext = (SV*) SvANY(sva);
586 while (svanext && SvFAKE(svanext))
587 svanext = (SV*) SvANY(svanext);
593 for (i=0; i<SVt_LAST; i++) {
594 S_free_arena(aTHX_ (void**) PL_body_arenaroots[i]);
595 PL_body_arenaroots[i] = 0;
596 PL_body_roots[i] = 0;
601 Safefree(PL_nice_chunk);
602 PL_nice_chunk = Nullch;
603 PL_nice_chunk_size = 0;
608 /* ---------------------------------------------------------------------
610 * support functions for report_uninit()
613 /* the maxiumum size of array or hash where we will scan looking
614 * for the undefined element that triggered the warning */
616 #define FUV_MAX_SEARCH_SIZE 1000
618 /* Look for an entry in the hash whose value has the same SV as val;
619 * If so, return a mortal copy of the key. */
622 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
628 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
629 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
634 for (i=HvMAX(hv); i>0; i--) {
636 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
637 if (HeVAL(entry) != val)
639 if ( HeVAL(entry) == &PL_sv_undef ||
640 HeVAL(entry) == &PL_sv_placeholder)
644 if (HeKLEN(entry) == HEf_SVKEY)
645 return sv_mortalcopy(HeKEY_sv(entry));
646 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
652 /* Look for an entry in the array whose value has the same SV as val;
653 * If so, return the index, otherwise return -1. */
656 S_find_array_subscript(pTHX_ AV *av, SV* val)
660 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
661 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
665 for (i=AvFILLp(av); i>=0; i--) {
666 if (svp[i] == val && svp[i] != &PL_sv_undef)
672 /* S_varname(): return the name of a variable, optionally with a subscript.
673 * If gv is non-zero, use the name of that global, along with gvtype (one
674 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
675 * targ. Depending on the value of the subscript_type flag, return:
678 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
679 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
680 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
681 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
684 S_varname(pTHX_ GV *gv, const char gvtype, PADOFFSET targ,
685 SV* keyname, I32 aindex, int subscript_type)
688 SV * const name = sv_newmortal();
694 /* as gv_fullname4(), but add literal '^' for $^FOO names */
696 gv_fullname4(name, gv, buffer, 0);
698 if ((unsigned int)SvPVX(name)[1] <= 26) {
700 buffer[1] = SvPVX(name)[1] + 'A' - 1;
702 /* Swap the 1 unprintable control character for the 2 byte pretty
703 version - ie substr($name, 1, 1) = $buffer; */
704 sv_insert(name, 1, 1, buffer, 2);
709 CV * const cv = find_runcv(&unused);
713 if (!cv || !CvPADLIST(cv))
715 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
716 sv = *av_fetch(av, targ, FALSE);
717 /* SvLEN in a pad name is not to be trusted */
718 sv_setpv(name, SvPV_nolen_const(sv));
721 if (subscript_type == FUV_SUBSCRIPT_HASH) {
722 SV * const sv = NEWSV(0,0);
724 Perl_sv_catpvf(aTHX_ name, "{%s}",
725 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
728 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
730 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
732 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
733 sv_insert(name, 0, 0, "within ", 7);
740 =for apidoc find_uninit_var
742 Find the name of the undefined variable (if any) that caused the operator o
743 to issue a "Use of uninitialized value" warning.
744 If match is true, only return a name if it's value matches uninit_sv.
745 So roughly speaking, if a unary operator (such as OP_COS) generates a
746 warning, then following the direct child of the op may yield an
747 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
748 other hand, with OP_ADD there are two branches to follow, so we only print
749 the variable name if we get an exact match.
751 The name is returned as a mortal SV.
753 Assumes that PL_op is the op that originally triggered the error, and that
754 PL_comppad/PL_curpad points to the currently executing pad.
760 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
768 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
769 uninit_sv == &PL_sv_placeholder)))
772 switch (obase->op_type) {
779 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
780 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
783 int subscript_type = FUV_SUBSCRIPT_WITHIN;
785 if (pad) { /* @lex, %lex */
786 sv = PAD_SVl(obase->op_targ);
790 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
791 /* @global, %global */
792 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
795 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
797 else /* @{expr}, %{expr} */
798 return find_uninit_var(cUNOPx(obase)->op_first,
802 /* attempt to find a match within the aggregate */
804 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
806 subscript_type = FUV_SUBSCRIPT_HASH;
809 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
811 subscript_type = FUV_SUBSCRIPT_ARRAY;
814 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
817 return varname(gv, hash ? '%' : '@', obase->op_targ,
818 keysv, index, subscript_type);
822 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
824 return varname(Nullgv, '$', obase->op_targ,
825 Nullsv, 0, FUV_SUBSCRIPT_NONE);
828 gv = cGVOPx_gv(obase);
829 if (!gv || (match && GvSV(gv) != uninit_sv))
831 return varname(gv, '$', 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
834 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
837 av = (AV*)PAD_SV(obase->op_targ);
838 if (!av || SvRMAGICAL(av))
840 svp = av_fetch(av, (I32)obase->op_private, FALSE);
841 if (!svp || *svp != uninit_sv)
844 return varname(Nullgv, '$', obase->op_targ,
845 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
848 gv = cGVOPx_gv(obase);
854 if (!av || SvRMAGICAL(av))
856 svp = av_fetch(av, (I32)obase->op_private, FALSE);
857 if (!svp || *svp != uninit_sv)
860 return varname(gv, '$', 0,
861 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
866 o = cUNOPx(obase)->op_first;
867 if (!o || o->op_type != OP_NULL ||
868 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
870 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
875 /* $a[uninit_expr] or $h{uninit_expr} */
876 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
879 o = cBINOPx(obase)->op_first;
880 kid = cBINOPx(obase)->op_last;
882 /* get the av or hv, and optionally the gv */
884 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
885 sv = PAD_SV(o->op_targ);
887 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
888 && cUNOPo->op_first->op_type == OP_GV)
890 gv = cGVOPx_gv(cUNOPo->op_first);
893 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
898 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
899 /* index is constant */
903 if (obase->op_type == OP_HELEM) {
904 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
905 if (!he || HeVAL(he) != uninit_sv)
909 SV ** const svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
910 if (!svp || *svp != uninit_sv)
914 if (obase->op_type == OP_HELEM)
915 return varname(gv, '%', o->op_targ,
916 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
918 return varname(gv, '@', o->op_targ, Nullsv,
919 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
923 /* index is an expression;
924 * attempt to find a match within the aggregate */
925 if (obase->op_type == OP_HELEM) {
926 SV * const keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
928 return varname(gv, '%', o->op_targ,
929 keysv, 0, FUV_SUBSCRIPT_HASH);
932 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
934 return varname(gv, '@', o->op_targ,
935 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
940 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
942 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
948 /* only examine RHS */
949 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
952 o = cUNOPx(obase)->op_first;
953 if (o->op_type == OP_PUSHMARK)
956 if (!o->op_sibling) {
957 /* one-arg version of open is highly magical */
959 if (o->op_type == OP_GV) { /* open FOO; */
961 if (match && GvSV(gv) != uninit_sv)
963 return varname(gv, '$', 0,
964 Nullsv, 0, FUV_SUBSCRIPT_NONE);
966 /* other possibilities not handled are:
967 * open $x; or open my $x; should return '${*$x}'
968 * open expr; should return '$'.expr ideally
974 /* ops where $_ may be an implicit arg */
978 if ( !(obase->op_flags & OPf_STACKED)) {
979 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
980 ? PAD_SVl(obase->op_targ)
984 sv_setpvn(sv, "$_", 2);
992 /* skip filehandle as it can't produce 'undef' warning */
993 o = cUNOPx(obase)->op_first;
994 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
995 o = o->op_sibling->op_sibling;
1002 match = 1; /* XS or custom code could trigger random warnings */
1007 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1008 return sv_2mortal(newSVpvn("${$/}", 5));
1013 if (!(obase->op_flags & OPf_KIDS))
1015 o = cUNOPx(obase)->op_first;
1021 /* if all except one arg are constant, or have no side-effects,
1022 * or are optimized away, then it's unambiguous */
1024 for (kid=o; kid; kid = kid->op_sibling) {
1026 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1027 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1028 || (kid->op_type == OP_PUSHMARK)
1032 if (o2) { /* more than one found */
1039 return find_uninit_var(o2, uninit_sv, match);
1043 sv = find_uninit_var(o, uninit_sv, 1);
1055 =for apidoc report_uninit
1057 Print appropriate "Use of uninitialized variable" warning
1063 Perl_report_uninit(pTHX_ SV* uninit_sv)
1066 SV* varname = Nullsv;
1068 varname = find_uninit_var(PL_op, uninit_sv,0);
1070 sv_insert(varname, 0, 0, " ", 1);
1072 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1073 varname ? SvPV_nolen_const(varname) : "",
1074 " in ", OP_DESC(PL_op));
1077 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1082 Here are mid-level routines that manage the allocation of bodies out
1083 of the various arenas. There are 5 kinds of arenas:
1085 1. SV-head arenas, which are discussed and handled above
1086 2. regular body arenas
1087 3. arenas for reduced-size bodies
1088 4. Hash-Entry arenas
1089 5. pte arenas (thread related)
1091 Arena types 2 & 3 are chained by body-type off an array of
1092 arena-root pointers, which is indexed by svtype. Some of the
1093 larger/less used body types are malloced singly, since a large
1094 unused block of them is wasteful. Also, several svtypes dont have
1095 bodies; the data fits into the sv-head itself. The arena-root
1096 pointer thus has a few unused root-pointers (which may be hijacked
1097 later for arena types 4,5)
1099 3 differs from 2 as an optimization; some body types have several
1100 unused fields in the front of the structure (which are kept in-place
1101 for consistency). These bodies can be allocated in smaller chunks,
1102 because the leading fields arent accessed. Pointers to such bodies
1103 are decremented to point at the unused 'ghost' memory, knowing that
1104 the pointers are used with offsets to the real memory.
1106 HE, HEK arenas are managed separately, with separate code, but may
1107 be merge-able later..
1109 PTE arenas are not sv-bodies, but they share these mid-level
1110 mechanics, so are considered here. The new mid-level mechanics rely
1111 on the sv_type of the body being allocated, so we just reserve one
1112 of the unused body-slots for PTEs, then use it in those (2) PTE
1113 contexts below (line ~10k)
1117 S_more_bodies (pTHX_ size_t size, svtype sv_type)
1119 void **arena_root = &PL_body_arenaroots[sv_type];
1120 void **root = &PL_body_roots[sv_type];
1123 const size_t count = PERL_ARENA_SIZE / size;
1125 Newx(start, count*size, char);
1126 *((void **) start) = *arena_root;
1127 *arena_root = (void *)start;
1129 end = start + (count-1) * size;
1131 /* The initial slot is used to link the arenas together, so it isn't to be
1132 linked into the list of ready-to-use bodies. */
1136 *root = (void *)start;
1138 while (start < end) {
1139 char * const next = start + size;
1140 *(void**) start = (void *)next;
1143 *(void **)start = 0;
1148 /* grab a new thing from the free list, allocating more if necessary */
1150 /* 1st, the inline version */
1152 #define new_body_inline(xpv, root, size, sv_type) \
1155 xpv = *((void **)(root)) \
1156 ? *((void **)(root)) : S_more_bodies(aTHX_ size, sv_type); \
1157 *(root) = *(void**)(xpv); \
1161 /* now use the inline version in the proper function */
1165 /* This isn't being used with -DPURIFY, so don't declare it. Otherwise
1166 compilers issue warnings. */
1169 S_new_body(pTHX_ size_t size, svtype sv_type)
1172 new_body_inline(xpv, &PL_body_roots[sv_type], size, sv_type);
1178 /* return a thing to the free list */
1180 #define del_body(thing, root) \
1182 void **thing_copy = (void **)thing; \
1184 *thing_copy = *root; \
1185 *root = (void*)thing_copy; \
1190 Revisiting type 3 arenas, there are 4 body-types which have some
1191 members that are never accessed. They are XPV, XPVIV, XPVAV,
1192 XPVHV, which have corresponding types: xpv_allocated,
1193 xpviv_allocated, xpvav_allocated, xpvhv_allocated,
1195 For these types, the arenas are carved up into *_allocated size
1196 chunks, we thus avoid wasted memory for those unaccessed members.
1197 When bodies are allocated, we adjust the pointer back in memory by
1198 the size of the bit not allocated, so it's as if we allocated the
1199 full structure. (But things will all go boom if you write to the
1200 part that is "not there", because you'll be overwriting the last
1201 members of the preceding structure in memory.)
1203 We calculate the correction using the STRUCT_OFFSET macro. For example, if
1204 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
1205 and the pointer is unchanged. If the allocated structure is smaller (no
1206 initial NV actually allocated) then the net effect is to subtract the size
1207 of the NV from the pointer, to return a new pointer as if an initial NV were
1210 This is the same trick as was used for NV and IV bodies. Ironically it
1211 doesn't need to be used for NV bodies any more, because NV is now at the
1212 start of the structure. IV bodies don't need it either, because they are
1213 no longer allocated. */
1215 /* The following 2 arrays hide the above details in a pair of
1216 lookup-tables, allowing us to be body-type agnostic.
1218 size maps svtype to its body's allocated size.
1219 offset maps svtype to the body-pointer adjustment needed
1221 NB: elements in latter are 0 or <0, and are added during
1222 allocation, and subtracted during deallocation. It may be clearer
1223 to invert the values, and call it shrinkage_by_svtype.
1226 struct body_details {
1227 size_t size; /* Size to allocate */
1228 size_t copy; /* Size of structure to copy (may be shorter) */
1230 bool cant_upgrade; /* Can upgrade this type */
1231 bool zero_nv; /* zero the NV when upgrading from this */
1232 bool arena; /* Allocated from an arena */
1238 #define HASARENA TRUE
1239 #define NOARENA FALSE
1241 static const struct body_details bodies_by_type[] = {
1242 {0, 0, 0, FALSE, NONV, NOARENA},
1243 /* IVs are in the head, so the allocation size is 0 */
1244 {0, sizeof(IV), -STRUCT_OFFSET(XPVIV, xiv_iv), FALSE, NONV, NOARENA},
1245 /* 8 bytes on most ILP32 with IEEE doubles */
1246 {sizeof(NV), sizeof(NV), 0, FALSE, HADNV, HASARENA},
1247 /* RVs are in the head now */
1248 /* However, this slot is overloaded and used by the pte */
1249 {0, 0, 0, FALSE, NONV, NOARENA},
1250 /* 8 bytes on most ILP32 with IEEE doubles */
1251 {sizeof(xpv_allocated),
1252 STRUCT_OFFSET(XPV, xpv_len) + sizeof (((XPV*)SvANY((SV*)0))->xpv_len)
1253 + STRUCT_OFFSET(xpv_allocated, xpv_cur) - STRUCT_OFFSET(XPV, xpv_cur),
1254 + STRUCT_OFFSET(xpv_allocated, xpv_cur) - STRUCT_OFFSET(XPV, xpv_cur)
1255 , FALSE, NONV, HASARENA},
1257 {sizeof(xpviv_allocated),
1258 STRUCT_OFFSET(XPVIV, xiv_u) + sizeof (((XPVIV*)SvANY((SV*)0))->xiv_u)
1259 + STRUCT_OFFSET(xpviv_allocated, xpv_cur) - STRUCT_OFFSET(XPVIV, xpv_cur),
1260 + STRUCT_OFFSET(xpviv_allocated, xpv_cur) - STRUCT_OFFSET(XPVIV, xpv_cur)
1261 , FALSE, NONV, HASARENA},
1264 STRUCT_OFFSET(XPVNV, xiv_u) + sizeof (((XPVNV*)SvANY((SV*)0))->xiv_u),
1265 0, FALSE, HADNV, HASARENA},
1268 STRUCT_OFFSET(XPVMG, xmg_stash) + sizeof (((XPVMG*)SvANY((SV*)0))->xmg_stash),
1269 0, FALSE, HADNV, HASARENA},
1271 {sizeof(XPVBM), sizeof(XPVBM), 0, TRUE, HADNV, HASARENA},
1273 {sizeof(XPVGV), sizeof(XPVGV), 0, TRUE, HADNV, HASARENA},
1275 {sizeof(XPVLV), sizeof(XPVLV), 0, TRUE, HADNV, HASARENA},
1277 {sizeof(xpvav_allocated), sizeof(xpvav_allocated),
1278 STRUCT_OFFSET(xpvav_allocated, xav_fill)
1279 - STRUCT_OFFSET(XPVAV, xav_fill), TRUE, HADNV, HASARENA},
1281 {sizeof(xpvhv_allocated), sizeof(xpvhv_allocated),
1282 STRUCT_OFFSET(xpvhv_allocated, xhv_fill)
1283 - STRUCT_OFFSET(XPVHV, xhv_fill), TRUE, HADNV, HASARENA},
1285 {sizeof(XPVCV), sizeof(XPVCV), 0, TRUE, HADNV, HASARENA},
1287 {sizeof(XPVFM), sizeof(XPVFM), 0, TRUE, HADNV, NOARENA},
1289 {sizeof(XPVIO), sizeof(XPVIO), 0, TRUE, HADNV, NOARENA}
1292 #define new_body_type(sv_type) \
1293 (void *)((char *)S_new_body(aTHX_ bodies_by_type[sv_type].size, sv_type)\
1294 + bodies_by_type[sv_type].offset)
1296 #define del_body_type(p, sv_type) \
1297 del_body(p, &PL_body_roots[sv_type])
1300 #define new_body_allocated(sv_type) \
1301 (void *)((char *)S_new_body(aTHX_ bodies_by_type[sv_type].size, sv_type)\
1302 + bodies_by_type[sv_type].offset)
1304 #define del_body_allocated(p, sv_type) \
1305 del_body(p - bodies_by_type[sv_type].offset, &PL_body_roots[sv_type])
1308 #define my_safemalloc(s) (void*)safemalloc(s)
1309 #define my_safecalloc(s) (void*)safecalloc(s, 1)
1310 #define my_safefree(p) safefree((char*)p)
1314 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1315 #define del_XNV(p) my_safefree(p)
1317 #define new_XPV() my_safemalloc(sizeof(XPV))
1318 #define del_XPV(p) my_safefree(p)
1320 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1321 #define del_XPVIV(p) my_safefree(p)
1323 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1324 #define del_XPVNV(p) my_safefree(p)
1326 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1327 #define del_XPVCV(p) my_safefree(p)
1329 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1330 #define del_XPVAV(p) my_safefree(p)
1332 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1333 #define del_XPVHV(p) my_safefree(p)
1335 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1336 #define del_XPVMG(p) my_safefree(p)
1338 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1339 #define del_XPVGV(p) my_safefree(p)
1341 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1342 #define del_XPVLV(p) my_safefree(p)
1344 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1345 #define del_XPVBM(p) my_safefree(p)
1349 #define new_XNV() new_body_type(SVt_NV)
1350 #define del_XNV(p) del_body_type(p, SVt_NV)
1352 #define new_XPV() new_body_allocated(SVt_PV)
1353 #define del_XPV(p) del_body_allocated(p, SVt_PV)
1355 #define new_XPVIV() new_body_allocated(SVt_PVIV)
1356 #define del_XPVIV(p) del_body_allocated(p, SVt_PVIV)
1358 #define new_XPVNV() new_body_type(SVt_PVNV)
1359 #define del_XPVNV(p) del_body_type(p, SVt_PVNV)
1361 #define new_XPVCV() new_body_type(SVt_PVCV)
1362 #define del_XPVCV(p) del_body_type(p, SVt_PVCV)
1364 #define new_XPVAV() new_body_allocated(SVt_PVAV)
1365 #define del_XPVAV(p) del_body_allocated(p, SVt_PVAV)
1367 #define new_XPVHV() new_body_allocated(SVt_PVHV)
1368 #define del_XPVHV(p) del_body_allocated(p, SVt_PVHV)
1370 #define new_XPVMG() new_body_type(SVt_PVMG)
1371 #define del_XPVMG(p) del_body_type(p, SVt_PVMG)
1373 #define new_XPVGV() new_body_type(SVt_PVGV)
1374 #define del_XPVGV(p) del_body_type(p, SVt_PVGV)
1376 #define new_XPVLV() new_body_type(SVt_PVLV)
1377 #define del_XPVLV(p) del_body_type(p, SVt_PVLV)
1379 #define new_XPVBM() new_body_type(SVt_PVBM)
1380 #define del_XPVBM(p) del_body_type(p, SVt_PVBM)
1384 /* no arena for you! */
1386 #define new_NOARENA(s) my_safecalloc(s)
1388 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1389 #define del_XPVFM(p) my_safefree(p)
1391 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1392 #define del_XPVIO(p) my_safefree(p)
1397 =for apidoc sv_upgrade
1399 Upgrade an SV to a more complex form. Generally adds a new body type to the
1400 SV, then copies across as much information as possible from the old body.
1401 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1407 Perl_sv_upgrade(pTHX_ register SV *sv, U32 new_type)
1411 size_t new_body_length;
1412 size_t new_body_offset;
1413 void** new_body_arena;
1414 void** new_body_arenaroot;
1415 const U32 old_type = SvTYPE(sv);
1416 const struct body_details *const old_type_details
1417 = bodies_by_type + old_type;
1418 const struct body_details *new_type_details = bodies_by_type + new_type;
1420 if (new_type != SVt_PV && SvIsCOW(sv)) {
1421 sv_force_normal_flags(sv, 0);
1424 if (old_type == new_type)
1427 if (old_type > new_type)
1428 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1429 (int)old_type, (int)new_type);
1432 old_body = SvANY(sv);
1433 new_body_offset = 0;
1434 new_body_length = ~0;
1436 /* Copying structures onto other structures that have been neatly zeroed
1437 has a subtle gotcha. Consider XPVMG
1439 +------+------+------+------+------+-------+-------+
1440 | NV | CUR | LEN | IV | MAGIC | STASH |
1441 +------+------+------+------+------+-------+-------+
1442 0 4 8 12 16 20 24 28
1444 where NVs are aligned to 8 bytes, so that sizeof that structure is
1445 actually 32 bytes long, with 4 bytes of padding at the end:
1447 +------+------+------+------+------+-------+-------+------+
1448 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1449 +------+------+------+------+------+-------+-------+------+
1450 0 4 8 12 16 20 24 28 32
1452 so what happens if you allocate memory for this structure:
1454 +------+------+------+------+------+-------+-------+------+------+...
1455 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1456 +------+------+------+------+------+-------+-------+------+------+...
1457 0 4 8 12 16 20 24 28 32 36
1459 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1460 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1461 started out as zero once, but it's quite possible that it isn't. So now,
1462 rather than a nicely zeroed GP, you have it pointing somewhere random.
1465 (In fact, GP ends up pointing at a previous GP structure, because the
1466 principle cause of the padding in XPVMG getting garbage is a copy of
1467 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1469 So we are careful and work out the size of used parts of all the
1476 if (new_type < SVt_PVIV) {
1477 new_type = (new_type == SVt_NV)
1478 ? SVt_PVNV : SVt_PVIV;
1479 new_type_details = bodies_by_type + new_type;
1483 if (new_type < SVt_PVNV) {
1484 new_type = SVt_PVNV;
1485 new_type_details = bodies_by_type + new_type;
1491 assert(new_type > SVt_PV);
1492 assert(SVt_IV < SVt_PV);
1493 assert(SVt_NV < SVt_PV);
1500 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1501 there's no way that it can be safely upgraded, because perl.c
1502 expects to Safefree(SvANY(PL_mess_sv)) */
1503 assert(sv != PL_mess_sv);
1504 /* This flag bit is used to mean other things in other scalar types.
1505 Given that it only has meaning inside the pad, it shouldn't be set
1506 on anything that can get upgraded. */
1507 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1510 if (old_type_details->cant_upgrade)
1511 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1514 SvFLAGS(sv) &= ~SVTYPEMASK;
1515 SvFLAGS(sv) |= new_type;
1519 Perl_croak(aTHX_ "Can't upgrade to undef");
1521 assert(old_type == SVt_NULL);
1522 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1526 assert(old_type == SVt_NULL);
1527 SvANY(sv) = new_XNV();
1531 assert(old_type == SVt_NULL);
1532 SvANY(sv) = &sv->sv_u.svu_rv;
1536 SvANY(sv) = new_XPVHV();
1539 HvTOTALKEYS(sv) = 0;
1544 SvANY(sv) = new_XPVAV();
1551 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1552 The target created by newSVrv also is, and it can have magic.
1553 However, it never has SvPVX set.
1555 if (old_type >= SVt_RV) {
1556 assert(SvPVX_const(sv) == 0);
1559 /* Could put this in the else clause below, as PVMG must have SvPVX
1560 0 already (the assertion above) */
1561 SvPV_set(sv, (char*)0);
1563 if (old_type >= SVt_PVMG) {
1564 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1565 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1574 new_body = new_NOARENA(new_type_details->size);
1575 new_body_length = new_type_details->copy;
1584 new_body_length = bodies_by_type[new_type].size;
1585 new_body_arena = &PL_body_roots[new_type];
1586 new_body_arenaroot = &PL_body_arenaroots[new_type];
1590 new_body_offset = - bodies_by_type[SVt_PVIV].offset;
1591 new_body_length = sizeof(XPVIV) - new_body_offset;
1592 new_body_arena = &PL_body_roots[SVt_PVIV];
1593 new_body_arenaroot = &PL_body_arenaroots[SVt_PVIV];
1594 /* XXX Is this still needed? Was it ever needed? Surely as there is
1595 no route from NV to PVIV, NOK can never be true */
1596 assert(!SvNOKp(sv));
1598 goto new_body_no_NV;
1600 new_body_offset = - bodies_by_type[SVt_PV].offset;
1601 new_body_length = sizeof(XPV) - new_body_offset;
1602 new_body_arena = &PL_body_roots[SVt_PV];
1603 new_body_arenaroot = &PL_body_arenaroots[SVt_PV];
1605 /* PV and PVIV don't have an NV slot. */
1608 assert(new_body_length);
1610 /* This points to the start of the allocated area. */
1611 new_body_inline(new_body, new_body_arena, new_body_length, new_type);
1613 /* We always allocated the full length item with PURIFY */
1614 new_body_length += new_body_offset;
1615 new_body_offset = 0;
1616 new_body = my_safemalloc(new_body_length);
1619 Zero(new_body, new_body_length, char);
1621 new_body = ((char *)new_body) - new_body_offset;
1622 SvANY(sv) = new_body;
1624 if (old_type_details->copy) {
1625 Copy((char *)old_body - old_type_details->offset,
1626 (char *)new_body - old_type_details->offset,
1627 old_type_details->copy, char);
1630 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1631 /* If NV 0.0 is store as all bits 0 then Zero() already creates a correct
1633 if (old_type_details->zero_nv)
1637 if (new_type == SVt_PVIO)
1638 IoPAGE_LEN(sv) = 60;
1639 if (old_type < SVt_RV)
1643 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", new_type);
1646 if (old_type_details->size) {
1647 /* If the old body had an allocated size, then we need to free it. */
1649 my_safefree(old_body);
1651 del_body((void*)((char*)old_body - old_type_details->offset),
1652 &PL_body_roots[old_type]);
1658 =for apidoc sv_backoff
1660 Remove any string offset. You should normally use the C<SvOOK_off> macro
1667 Perl_sv_backoff(pTHX_ register SV *sv)
1670 assert(SvTYPE(sv) != SVt_PVHV);
1671 assert(SvTYPE(sv) != SVt_PVAV);
1673 const char * const s = SvPVX_const(sv);
1674 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1675 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1677 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1679 SvFLAGS(sv) &= ~SVf_OOK;
1686 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1687 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1688 Use the C<SvGROW> wrapper instead.
1694 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1698 #ifdef HAS_64K_LIMIT
1699 if (newlen >= 0x10000) {
1700 PerlIO_printf(Perl_debug_log,
1701 "Allocation too large: %"UVxf"\n", (UV)newlen);
1704 #endif /* HAS_64K_LIMIT */
1707 if (SvTYPE(sv) < SVt_PV) {
1708 sv_upgrade(sv, SVt_PV);
1709 s = SvPVX_mutable(sv);
1711 else if (SvOOK(sv)) { /* pv is offset? */
1713 s = SvPVX_mutable(sv);
1714 if (newlen > SvLEN(sv))
1715 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1716 #ifdef HAS_64K_LIMIT
1717 if (newlen >= 0x10000)
1722 s = SvPVX_mutable(sv);
1724 if (newlen > SvLEN(sv)) { /* need more room? */
1725 newlen = PERL_STRLEN_ROUNDUP(newlen);
1726 if (SvLEN(sv) && s) {
1728 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1734 s = saferealloc(s, newlen);
1737 s = safemalloc(newlen);
1738 if (SvPVX_const(sv) && SvCUR(sv)) {
1739 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1743 SvLEN_set(sv, newlen);
1749 =for apidoc sv_setiv
1751 Copies an integer into the given SV, upgrading first if necessary.
1752 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1758 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1760 SV_CHECK_THINKFIRST_COW_DROP(sv);
1761 switch (SvTYPE(sv)) {
1763 sv_upgrade(sv, SVt_IV);
1766 sv_upgrade(sv, SVt_PVNV);
1770 sv_upgrade(sv, SVt_PVIV);
1779 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1782 (void)SvIOK_only(sv); /* validate number */
1788 =for apidoc sv_setiv_mg
1790 Like C<sv_setiv>, but also handles 'set' magic.
1796 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1803 =for apidoc sv_setuv
1805 Copies an unsigned integer into the given SV, upgrading first if necessary.
1806 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1812 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1814 /* With these two if statements:
1815 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1818 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1820 If you wish to remove them, please benchmark to see what the effect is
1822 if (u <= (UV)IV_MAX) {
1823 sv_setiv(sv, (IV)u);
1832 =for apidoc sv_setuv_mg
1834 Like C<sv_setuv>, but also handles 'set' magic.
1840 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1849 =for apidoc sv_setnv
1851 Copies a double into the given SV, upgrading first if necessary.
1852 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1858 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1860 SV_CHECK_THINKFIRST_COW_DROP(sv);
1861 switch (SvTYPE(sv)) {
1864 sv_upgrade(sv, SVt_NV);
1869 sv_upgrade(sv, SVt_PVNV);
1878 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1882 (void)SvNOK_only(sv); /* validate number */
1887 =for apidoc sv_setnv_mg
1889 Like C<sv_setnv>, but also handles 'set' magic.
1895 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1901 /* Print an "isn't numeric" warning, using a cleaned-up,
1902 * printable version of the offending string
1906 S_not_a_number(pTHX_ SV *sv)
1913 dsv = sv_2mortal(newSVpvn("", 0));
1914 pv = sv_uni_display(dsv, sv, 10, 0);
1917 const char * const limit = tmpbuf + sizeof(tmpbuf) - 8;
1918 /* each *s can expand to 4 chars + "...\0",
1919 i.e. need room for 8 chars */
1921 const char *s, *end;
1922 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1925 if (ch & 128 && !isPRINT_LC(ch)) {
1934 else if (ch == '\r') {
1938 else if (ch == '\f') {
1942 else if (ch == '\\') {
1946 else if (ch == '\0') {
1950 else if (isPRINT_LC(ch))
1967 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1968 "Argument \"%s\" isn't numeric in %s", pv,
1971 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1972 "Argument \"%s\" isn't numeric", pv);
1976 =for apidoc looks_like_number
1978 Test if the content of an SV looks like a number (or is a number).
1979 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1980 non-numeric warning), even if your atof() doesn't grok them.
1986 Perl_looks_like_number(pTHX_ SV *sv)
1988 register const char *sbegin;
1992 sbegin = SvPVX_const(sv);
1995 else if (SvPOKp(sv))
1996 sbegin = SvPV_const(sv, len);
1998 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1999 return grok_number(sbegin, len, NULL);
2002 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2003 until proven guilty, assume that things are not that bad... */
2008 As 64 bit platforms often have an NV that doesn't preserve all bits of
2009 an IV (an assumption perl has been based on to date) it becomes necessary
2010 to remove the assumption that the NV always carries enough precision to
2011 recreate the IV whenever needed, and that the NV is the canonical form.
2012 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2013 precision as a side effect of conversion (which would lead to insanity
2014 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2015 1) to distinguish between IV/UV/NV slots that have cached a valid
2016 conversion where precision was lost and IV/UV/NV slots that have a
2017 valid conversion which has lost no precision
2018 2) to ensure that if a numeric conversion to one form is requested that
2019 would lose precision, the precise conversion (or differently
2020 imprecise conversion) is also performed and cached, to prevent
2021 requests for different numeric formats on the same SV causing
2022 lossy conversion chains. (lossless conversion chains are perfectly
2027 SvIOKp is true if the IV slot contains a valid value
2028 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2029 SvNOKp is true if the NV slot contains a valid value
2030 SvNOK is true only if the NV value is accurate
2033 while converting from PV to NV, check to see if converting that NV to an
2034 IV(or UV) would lose accuracy over a direct conversion from PV to
2035 IV(or UV). If it would, cache both conversions, return NV, but mark
2036 SV as IOK NOKp (ie not NOK).
2038 While converting from PV to IV, check to see if converting that IV to an
2039 NV would lose accuracy over a direct conversion from PV to NV. If it
2040 would, cache both conversions, flag similarly.
2042 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2043 correctly because if IV & NV were set NV *always* overruled.
2044 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2045 changes - now IV and NV together means that the two are interchangeable:
2046 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2048 The benefit of this is that operations such as pp_add know that if
2049 SvIOK is true for both left and right operands, then integer addition
2050 can be used instead of floating point (for cases where the result won't
2051 overflow). Before, floating point was always used, which could lead to
2052 loss of precision compared with integer addition.
2054 * making IV and NV equal status should make maths accurate on 64 bit
2056 * may speed up maths somewhat if pp_add and friends start to use
2057 integers when possible instead of fp. (Hopefully the overhead in
2058 looking for SvIOK and checking for overflow will not outweigh the
2059 fp to integer speedup)
2060 * will slow down integer operations (callers of SvIV) on "inaccurate"
2061 values, as the change from SvIOK to SvIOKp will cause a call into
2062 sv_2iv each time rather than a macro access direct to the IV slot
2063 * should speed up number->string conversion on integers as IV is
2064 favoured when IV and NV are equally accurate
2066 ####################################################################
2067 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2068 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2069 On the other hand, SvUOK is true iff UV.
2070 ####################################################################
2072 Your mileage will vary depending your CPU's relative fp to integer
2076 #ifndef NV_PRESERVES_UV
2077 # define IS_NUMBER_UNDERFLOW_IV 1
2078 # define IS_NUMBER_UNDERFLOW_UV 2
2079 # define IS_NUMBER_IV_AND_UV 2
2080 # define IS_NUMBER_OVERFLOW_IV 4
2081 # define IS_NUMBER_OVERFLOW_UV 5
2083 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2085 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2087 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2089 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));
2090 if (SvNVX(sv) < (NV)IV_MIN) {
2091 (void)SvIOKp_on(sv);
2093 SvIV_set(sv, IV_MIN);
2094 return IS_NUMBER_UNDERFLOW_IV;
2096 if (SvNVX(sv) > (NV)UV_MAX) {
2097 (void)SvIOKp_on(sv);
2100 SvUV_set(sv, UV_MAX);
2101 return IS_NUMBER_OVERFLOW_UV;
2103 (void)SvIOKp_on(sv);
2105 /* Can't use strtol etc to convert this string. (See truth table in
2107 if (SvNVX(sv) <= (UV)IV_MAX) {
2108 SvIV_set(sv, I_V(SvNVX(sv)));
2109 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2110 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2112 /* Integer is imprecise. NOK, IOKp */
2114 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2117 SvUV_set(sv, U_V(SvNVX(sv)));
2118 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2119 if (SvUVX(sv) == UV_MAX) {
2120 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2121 possibly be preserved by NV. Hence, it must be overflow.
2123 return IS_NUMBER_OVERFLOW_UV;
2125 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2127 /* Integer is imprecise. NOK, IOKp */
2129 return IS_NUMBER_OVERFLOW_IV;
2131 #endif /* !NV_PRESERVES_UV*/
2134 =for apidoc sv_2iv_flags
2136 Return the integer value of an SV, doing any necessary string
2137 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2138 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2144 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2148 if (SvGMAGICAL(sv)) {
2149 if (flags & SV_GMAGIC)
2154 return I_V(SvNVX(sv));
2156 if (SvPOKp(sv) && SvLEN(sv))
2159 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2160 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2166 if (SvTHINKFIRST(sv)) {
2169 SV * const tmpstr=AMG_CALLun(sv,numer);
2170 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2171 return SvIV(tmpstr);
2174 return PTR2IV(SvRV(sv));
2177 sv_force_normal_flags(sv, 0);
2179 if (SvREADONLY(sv) && !SvOK(sv)) {
2180 if (ckWARN(WARN_UNINITIALIZED))
2187 return (IV)(SvUVX(sv));
2194 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2195 * without also getting a cached IV/UV from it at the same time
2196 * (ie PV->NV conversion should detect loss of accuracy and cache
2197 * IV or UV at same time to avoid this. NWC */
2199 if (SvTYPE(sv) == SVt_NV)
2200 sv_upgrade(sv, SVt_PVNV);
2202 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2203 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2204 certainly cast into the IV range at IV_MAX, whereas the correct
2205 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2207 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2208 SvIV_set(sv, I_V(SvNVX(sv)));
2209 if (SvNVX(sv) == (NV) SvIVX(sv)
2210 #ifndef NV_PRESERVES_UV
2211 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2212 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2213 /* Don't flag it as "accurately an integer" if the number
2214 came from a (by definition imprecise) NV operation, and
2215 we're outside the range of NV integer precision */
2218 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2219 DEBUG_c(PerlIO_printf(Perl_debug_log,
2220 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2226 /* IV not precise. No need to convert from PV, as NV
2227 conversion would already have cached IV if it detected
2228 that PV->IV would be better than PV->NV->IV
2229 flags already correct - don't set public IOK. */
2230 DEBUG_c(PerlIO_printf(Perl_debug_log,
2231 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2236 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2237 but the cast (NV)IV_MIN rounds to a the value less (more
2238 negative) than IV_MIN which happens to be equal to SvNVX ??
2239 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2240 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2241 (NV)UVX == NVX are both true, but the values differ. :-(
2242 Hopefully for 2s complement IV_MIN is something like
2243 0x8000000000000000 which will be exact. NWC */
2246 SvUV_set(sv, U_V(SvNVX(sv)));
2248 (SvNVX(sv) == (NV) SvUVX(sv))
2249 #ifndef NV_PRESERVES_UV
2250 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2251 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2252 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2253 /* Don't flag it as "accurately an integer" if the number
2254 came from a (by definition imprecise) NV operation, and
2255 we're outside the range of NV integer precision */
2261 DEBUG_c(PerlIO_printf(Perl_debug_log,
2262 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2266 return (IV)SvUVX(sv);
2269 else if (SvPOKp(sv) && SvLEN(sv)) {
2271 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2272 /* We want to avoid a possible problem when we cache an IV which
2273 may be later translated to an NV, and the resulting NV is not
2274 the same as the direct translation of the initial string
2275 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2276 be careful to ensure that the value with the .456 is around if the
2277 NV value is requested in the future).
2279 This means that if we cache such an IV, we need to cache the
2280 NV as well. Moreover, we trade speed for space, and do not
2281 cache the NV if we are sure it's not needed.
2284 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2285 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2286 == IS_NUMBER_IN_UV) {
2287 /* It's definitely an integer, only upgrade to PVIV */
2288 if (SvTYPE(sv) < SVt_PVIV)
2289 sv_upgrade(sv, SVt_PVIV);
2291 } else if (SvTYPE(sv) < SVt_PVNV)
2292 sv_upgrade(sv, SVt_PVNV);
2294 /* If NV preserves UV then we only use the UV value if we know that
2295 we aren't going to call atof() below. If NVs don't preserve UVs
2296 then the value returned may have more precision than atof() will
2297 return, even though value isn't perfectly accurate. */
2298 if ((numtype & (IS_NUMBER_IN_UV
2299 #ifdef NV_PRESERVES_UV
2302 )) == IS_NUMBER_IN_UV) {
2303 /* This won't turn off the public IOK flag if it was set above */
2304 (void)SvIOKp_on(sv);
2306 if (!(numtype & IS_NUMBER_NEG)) {
2308 if (value <= (UV)IV_MAX) {
2309 SvIV_set(sv, (IV)value);
2311 SvUV_set(sv, value);
2315 /* 2s complement assumption */
2316 if (value <= (UV)IV_MIN) {
2317 SvIV_set(sv, -(IV)value);
2319 /* Too negative for an IV. This is a double upgrade, but
2320 I'm assuming it will be rare. */
2321 if (SvTYPE(sv) < SVt_PVNV)
2322 sv_upgrade(sv, SVt_PVNV);
2326 SvNV_set(sv, -(NV)value);
2327 SvIV_set(sv, IV_MIN);
2331 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2332 will be in the previous block to set the IV slot, and the next
2333 block to set the NV slot. So no else here. */
2335 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2336 != IS_NUMBER_IN_UV) {
2337 /* It wasn't an (integer that doesn't overflow the UV). */
2338 SvNV_set(sv, Atof(SvPVX_const(sv)));
2340 if (! numtype && ckWARN(WARN_NUMERIC))
2343 #if defined(USE_LONG_DOUBLE)
2344 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2345 PTR2UV(sv), SvNVX(sv)));
2347 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2348 PTR2UV(sv), SvNVX(sv)));
2352 #ifdef NV_PRESERVES_UV
2353 (void)SvIOKp_on(sv);
2355 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2356 SvIV_set(sv, I_V(SvNVX(sv)));
2357 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2360 /* Integer is imprecise. NOK, IOKp */
2362 /* UV will not work better than IV */
2364 if (SvNVX(sv) > (NV)UV_MAX) {
2366 /* Integer is inaccurate. NOK, IOKp, is UV */
2367 SvUV_set(sv, UV_MAX);
2370 SvUV_set(sv, U_V(SvNVX(sv)));
2371 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2372 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2376 /* Integer is imprecise. NOK, IOKp, is UV */
2382 #else /* NV_PRESERVES_UV */
2383 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2384 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2385 /* The IV slot will have been set from value returned by
2386 grok_number above. The NV slot has just been set using
2389 assert (SvIOKp(sv));
2391 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2392 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2393 /* Small enough to preserve all bits. */
2394 (void)SvIOKp_on(sv);
2396 SvIV_set(sv, I_V(SvNVX(sv)));
2397 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2399 /* Assumption: first non-preserved integer is < IV_MAX,
2400 this NV is in the preserved range, therefore: */
2401 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2403 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);
2407 0 0 already failed to read UV.
2408 0 1 already failed to read UV.
2409 1 0 you won't get here in this case. IV/UV
2410 slot set, public IOK, Atof() unneeded.
2411 1 1 already read UV.
2412 so there's no point in sv_2iuv_non_preserve() attempting
2413 to use atol, strtol, strtoul etc. */
2414 if (sv_2iuv_non_preserve (sv, numtype)
2415 >= IS_NUMBER_OVERFLOW_IV)
2419 #endif /* NV_PRESERVES_UV */
2422 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2424 if (SvTYPE(sv) < SVt_IV)
2425 /* Typically the caller expects that sv_any is not NULL now. */
2426 sv_upgrade(sv, SVt_IV);
2429 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2430 PTR2UV(sv),SvIVX(sv)));
2431 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2435 =for apidoc sv_2uv_flags
2437 Return the unsigned integer value of an SV, doing any necessary string
2438 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2439 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2445 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2449 if (SvGMAGICAL(sv)) {
2450 if (flags & SV_GMAGIC)
2455 return U_V(SvNVX(sv));
2456 if (SvPOKp(sv) && SvLEN(sv))
2459 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2460 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2466 if (SvTHINKFIRST(sv)) {
2469 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2470 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2471 return SvUV(tmpstr);
2472 return PTR2UV(SvRV(sv));
2475 sv_force_normal_flags(sv, 0);
2477 if (SvREADONLY(sv) && !SvOK(sv)) {
2478 if (ckWARN(WARN_UNINITIALIZED))
2488 return (UV)SvIVX(sv);
2492 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2493 * without also getting a cached IV/UV from it at the same time
2494 * (ie PV->NV conversion should detect loss of accuracy and cache
2495 * IV or UV at same time to avoid this. */
2496 /* IV-over-UV optimisation - choose to cache IV if possible */
2498 if (SvTYPE(sv) == SVt_NV)
2499 sv_upgrade(sv, SVt_PVNV);
2501 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2502 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2503 SvIV_set(sv, I_V(SvNVX(sv)));
2504 if (SvNVX(sv) == (NV) SvIVX(sv)
2505 #ifndef NV_PRESERVES_UV
2506 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2507 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2508 /* Don't flag it as "accurately an integer" if the number
2509 came from a (by definition imprecise) NV operation, and
2510 we're outside the range of NV integer precision */
2513 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2514 DEBUG_c(PerlIO_printf(Perl_debug_log,
2515 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2521 /* IV not precise. No need to convert from PV, as NV
2522 conversion would already have cached IV if it detected
2523 that PV->IV would be better than PV->NV->IV
2524 flags already correct - don't set public IOK. */
2525 DEBUG_c(PerlIO_printf(Perl_debug_log,
2526 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2531 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2532 but the cast (NV)IV_MIN rounds to a the value less (more
2533 negative) than IV_MIN which happens to be equal to SvNVX ??
2534 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2535 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2536 (NV)UVX == NVX are both true, but the values differ. :-(
2537 Hopefully for 2s complement IV_MIN is something like
2538 0x8000000000000000 which will be exact. NWC */
2541 SvUV_set(sv, U_V(SvNVX(sv)));
2543 (SvNVX(sv) == (NV) SvUVX(sv))
2544 #ifndef NV_PRESERVES_UV
2545 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2546 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2547 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2548 /* Don't flag it as "accurately an integer" if the number
2549 came from a (by definition imprecise) NV operation, and
2550 we're outside the range of NV integer precision */
2555 DEBUG_c(PerlIO_printf(Perl_debug_log,
2556 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2562 else if (SvPOKp(sv) && SvLEN(sv)) {
2564 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2566 /* We want to avoid a possible problem when we cache a UV which
2567 may be later translated to an NV, and the resulting NV is not
2568 the translation of the initial data.
2570 This means that if we cache such a UV, we need to cache the
2571 NV as well. Moreover, we trade speed for space, and do not
2572 cache the NV if not needed.
2575 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2576 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2577 == IS_NUMBER_IN_UV) {
2578 /* It's definitely an integer, only upgrade to PVIV */
2579 if (SvTYPE(sv) < SVt_PVIV)
2580 sv_upgrade(sv, SVt_PVIV);
2582 } else if (SvTYPE(sv) < SVt_PVNV)
2583 sv_upgrade(sv, SVt_PVNV);
2585 /* If NV preserves UV then we only use the UV value if we know that
2586 we aren't going to call atof() below. If NVs don't preserve UVs
2587 then the value returned may have more precision than atof() will
2588 return, even though it isn't accurate. */
2589 if ((numtype & (IS_NUMBER_IN_UV
2590 #ifdef NV_PRESERVES_UV
2593 )) == IS_NUMBER_IN_UV) {
2594 /* This won't turn off the public IOK flag if it was set above */
2595 (void)SvIOKp_on(sv);
2597 if (!(numtype & IS_NUMBER_NEG)) {
2599 if (value <= (UV)IV_MAX) {
2600 SvIV_set(sv, (IV)value);
2602 /* it didn't overflow, and it was positive. */
2603 SvUV_set(sv, value);
2607 /* 2s complement assumption */
2608 if (value <= (UV)IV_MIN) {
2609 SvIV_set(sv, -(IV)value);
2611 /* Too negative for an IV. This is a double upgrade, but
2612 I'm assuming it will be rare. */
2613 if (SvTYPE(sv) < SVt_PVNV)
2614 sv_upgrade(sv, SVt_PVNV);
2618 SvNV_set(sv, -(NV)value);
2619 SvIV_set(sv, IV_MIN);
2624 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2625 != IS_NUMBER_IN_UV) {
2626 /* It wasn't an integer, or it overflowed the UV. */
2627 SvNV_set(sv, Atof(SvPVX_const(sv)));
2629 if (! numtype && ckWARN(WARN_NUMERIC))
2632 #if defined(USE_LONG_DOUBLE)
2633 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2634 PTR2UV(sv), SvNVX(sv)));
2636 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2637 PTR2UV(sv), SvNVX(sv)));
2640 #ifdef NV_PRESERVES_UV
2641 (void)SvIOKp_on(sv);
2643 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2644 SvIV_set(sv, I_V(SvNVX(sv)));
2645 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2648 /* Integer is imprecise. NOK, IOKp */
2650 /* UV will not work better than IV */
2652 if (SvNVX(sv) > (NV)UV_MAX) {
2654 /* Integer is inaccurate. NOK, IOKp, is UV */
2655 SvUV_set(sv, UV_MAX);
2658 SvUV_set(sv, U_V(SvNVX(sv)));
2659 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2660 NV preservse UV so can do correct comparison. */
2661 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2665 /* Integer is imprecise. NOK, IOKp, is UV */
2670 #else /* NV_PRESERVES_UV */
2671 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2672 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2673 /* The UV slot will have been set from value returned by
2674 grok_number above. The NV slot has just been set using
2677 assert (SvIOKp(sv));
2679 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2680 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2681 /* Small enough to preserve all bits. */
2682 (void)SvIOKp_on(sv);
2684 SvIV_set(sv, I_V(SvNVX(sv)));
2685 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2687 /* Assumption: first non-preserved integer is < IV_MAX,
2688 this NV is in the preserved range, therefore: */
2689 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2691 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);
2694 sv_2iuv_non_preserve (sv, numtype);
2696 #endif /* NV_PRESERVES_UV */
2700 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2701 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2704 if (SvTYPE(sv) < SVt_IV)
2705 /* Typically the caller expects that sv_any is not NULL now. */
2706 sv_upgrade(sv, SVt_IV);
2710 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2711 PTR2UV(sv),SvUVX(sv)));
2712 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2718 Return the num value of an SV, doing any necessary string or integer
2719 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2726 Perl_sv_2nv(pTHX_ register SV *sv)
2730 if (SvGMAGICAL(sv)) {
2734 if (SvPOKp(sv) && SvLEN(sv)) {
2735 if (!SvIOKp(sv) && ckWARN(WARN_NUMERIC) &&
2736 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2738 return Atof(SvPVX_const(sv));
2742 return (NV)SvUVX(sv);
2744 return (NV)SvIVX(sv);
2747 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2748 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2754 if (SvTHINKFIRST(sv)) {
2757 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2758 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2759 return SvNV(tmpstr);
2760 return PTR2NV(SvRV(sv));
2763 sv_force_normal_flags(sv, 0);
2765 if (SvREADONLY(sv) && !SvOK(sv)) {
2766 if (ckWARN(WARN_UNINITIALIZED))
2771 if (SvTYPE(sv) < SVt_NV) {
2772 if (SvTYPE(sv) == SVt_IV)
2773 sv_upgrade(sv, SVt_PVNV);
2775 sv_upgrade(sv, SVt_NV);
2776 #ifdef USE_LONG_DOUBLE
2778 STORE_NUMERIC_LOCAL_SET_STANDARD();
2779 PerlIO_printf(Perl_debug_log,
2780 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2781 PTR2UV(sv), SvNVX(sv));
2782 RESTORE_NUMERIC_LOCAL();
2786 STORE_NUMERIC_LOCAL_SET_STANDARD();
2787 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2788 PTR2UV(sv), SvNVX(sv));
2789 RESTORE_NUMERIC_LOCAL();
2793 else if (SvTYPE(sv) < SVt_PVNV)
2794 sv_upgrade(sv, SVt_PVNV);
2799 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2800 #ifdef NV_PRESERVES_UV
2803 /* Only set the public NV OK flag if this NV preserves the IV */
2804 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2805 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2806 : (SvIVX(sv) == I_V(SvNVX(sv))))
2812 else if (SvPOKp(sv) && SvLEN(sv)) {
2814 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2815 if (!SvIOKp(sv) && !numtype && ckWARN(WARN_NUMERIC))
2817 #ifdef NV_PRESERVES_UV
2818 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2819 == IS_NUMBER_IN_UV) {
2820 /* It's definitely an integer */
2821 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2823 SvNV_set(sv, Atof(SvPVX_const(sv)));
2826 SvNV_set(sv, Atof(SvPVX_const(sv)));
2827 /* Only set the public NV OK flag if this NV preserves the value in
2828 the PV at least as well as an IV/UV would.
2829 Not sure how to do this 100% reliably. */
2830 /* if that shift count is out of range then Configure's test is
2831 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2833 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2834 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2835 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2836 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2837 /* Can't use strtol etc to convert this string, so don't try.
2838 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2841 /* value has been set. It may not be precise. */
2842 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2843 /* 2s complement assumption for (UV)IV_MIN */
2844 SvNOK_on(sv); /* Integer is too negative. */
2849 if (numtype & IS_NUMBER_NEG) {
2850 SvIV_set(sv, -(IV)value);
2851 } else if (value <= (UV)IV_MAX) {
2852 SvIV_set(sv, (IV)value);
2854 SvUV_set(sv, value);
2858 if (numtype & IS_NUMBER_NOT_INT) {
2859 /* I believe that even if the original PV had decimals,
2860 they are lost beyond the limit of the FP precision.
2861 However, neither is canonical, so both only get p
2862 flags. NWC, 2000/11/25 */
2863 /* Both already have p flags, so do nothing */
2865 const NV nv = SvNVX(sv);
2866 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2867 if (SvIVX(sv) == I_V(nv)) {
2872 /* It had no "." so it must be integer. */
2875 /* between IV_MAX and NV(UV_MAX).
2876 Could be slightly > UV_MAX */
2878 if (numtype & IS_NUMBER_NOT_INT) {
2879 /* UV and NV both imprecise. */
2881 const UV nv_as_uv = U_V(nv);
2883 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2894 #endif /* NV_PRESERVES_UV */
2897 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2899 if (SvTYPE(sv) < SVt_NV)
2900 /* Typically the caller expects that sv_any is not NULL now. */
2901 /* XXX Ilya implies that this is a bug in callers that assume this
2902 and ideally should be fixed. */
2903 sv_upgrade(sv, SVt_NV);
2906 #if defined(USE_LONG_DOUBLE)
2908 STORE_NUMERIC_LOCAL_SET_STANDARD();
2909 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2910 PTR2UV(sv), SvNVX(sv));
2911 RESTORE_NUMERIC_LOCAL();
2915 STORE_NUMERIC_LOCAL_SET_STANDARD();
2916 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2917 PTR2UV(sv), SvNVX(sv));
2918 RESTORE_NUMERIC_LOCAL();
2924 /* asIV(): extract an integer from the string value of an SV.
2925 * Caller must validate PVX */
2928 S_asIV(pTHX_ SV *sv)
2931 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2933 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2934 == IS_NUMBER_IN_UV) {
2935 /* It's definitely an integer */
2936 if (numtype & IS_NUMBER_NEG) {
2937 if (value < (UV)IV_MIN)
2940 if (value < (UV)IV_MAX)
2945 if (ckWARN(WARN_NUMERIC))
2948 return I_V(Atof(SvPVX_const(sv)));
2951 /* asUV(): extract an unsigned integer from the string value of an SV
2952 * Caller must validate PVX */
2955 S_asUV(pTHX_ SV *sv)
2958 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2960 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2961 == IS_NUMBER_IN_UV) {
2962 /* It's definitely an integer */
2963 if (!(numtype & IS_NUMBER_NEG))
2967 if (ckWARN(WARN_NUMERIC))
2970 return U_V(Atof(SvPVX_const(sv)));
2973 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2974 * UV as a string towards the end of buf, and return pointers to start and
2977 * We assume that buf is at least TYPE_CHARS(UV) long.
2981 S_uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2983 char *ptr = buf + TYPE_CHARS(UV);
2984 char * const ebuf = ptr;
2997 *--ptr = '0' + (char)(uv % 10);
3006 =for apidoc sv_2pv_flags
3008 Returns a pointer to the string value of an SV, and sets *lp to its length.
3009 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3011 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3012 usually end up here too.
3018 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3023 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3024 char *tmpbuf = tbuf;
3025 STRLEN len = 0; /* Hush gcc. len is always initialised before use. */
3032 if (SvGMAGICAL(sv)) {
3033 if (flags & SV_GMAGIC)
3038 if (flags & SV_MUTABLE_RETURN)
3039 return SvPVX_mutable(sv);
3040 if (flags & SV_CONST_RETURN)
3041 return (char *)SvPVX_const(sv);
3045 len = SvIsUV(sv) ? my_sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv))
3046 : my_sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3048 goto tokensave_has_len;
3051 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3056 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3057 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
3065 if (SvTHINKFIRST(sv)) {
3068 register const char *typestr;
3069 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3070 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3072 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3075 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3076 if (flags & SV_CONST_RETURN) {
3077 pv = (char *) SvPVX_const(tmpstr);
3079 pv = (flags & SV_MUTABLE_RETURN)
3080 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3083 *lp = SvCUR(tmpstr);
3085 pv = sv_2pv_flags(tmpstr, lp, flags);
3096 typestr = "NULLREF";
3100 switch (SvTYPE(sv)) {
3102 if ( ((SvFLAGS(sv) &
3103 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3104 == (SVs_OBJECT|SVs_SMG))
3105 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3106 const regexp *re = (regexp *)mg->mg_obj;
3109 const char *fptr = "msix";
3114 char need_newline = 0;
3115 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3117 while((ch = *fptr++)) {
3119 reflags[left++] = ch;
3122 reflags[right--] = ch;
3127 reflags[left] = '-';
3131 mg->mg_len = re->prelen + 4 + left;
3133 * If /x was used, we have to worry about a regex
3134 * ending with a comment later being embedded
3135 * within another regex. If so, we don't want this
3136 * regex's "commentization" to leak out to the
3137 * right part of the enclosing regex, we must cap
3138 * it with a newline.
3140 * So, if /x was used, we scan backwards from the
3141 * end of the regex. If we find a '#' before we
3142 * find a newline, we need to add a newline
3143 * ourself. If we find a '\n' first (or if we
3144 * don't find '#' or '\n'), we don't need to add
3145 * anything. -jfriedl
3147 if (PMf_EXTENDED & re->reganch)
3149 const char *endptr = re->precomp + re->prelen;
3150 while (endptr >= re->precomp)
3152 const char c = *(endptr--);
3154 break; /* don't need another */
3156 /* we end while in a comment, so we
3158 mg->mg_len++; /* save space for it */
3159 need_newline = 1; /* note to add it */
3165 Newx(mg->mg_ptr, mg->mg_len + 1 + left, char);
3166 Copy("(?", mg->mg_ptr, 2, char);
3167 Copy(reflags, mg->mg_ptr+2, left, char);
3168 Copy(":", mg->mg_ptr+left+2, 1, char);
3169 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3171 mg->mg_ptr[mg->mg_len - 2] = '\n';
3172 mg->mg_ptr[mg->mg_len - 1] = ')';
3173 mg->mg_ptr[mg->mg_len] = 0;
3175 PL_reginterp_cnt += re->program[0].next_off;
3177 if (re->reganch & ROPT_UTF8)
3193 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3194 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3195 /* tied lvalues should appear to be
3196 * scalars for backwards compatitbility */
3197 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3198 ? "SCALAR" : "LVALUE"; break;
3199 case SVt_PVAV: typestr = "ARRAY"; break;
3200 case SVt_PVHV: typestr = "HASH"; break;
3201 case SVt_PVCV: typestr = "CODE"; break;
3202 case SVt_PVGV: typestr = "GLOB"; break;
3203 case SVt_PVFM: typestr = "FORMAT"; break;
3204 case SVt_PVIO: typestr = "IO"; break;
3205 default: typestr = "UNKNOWN"; break;
3209 const char * const name = HvNAME_get(SvSTASH(sv));
3210 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3211 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3214 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3218 *lp = strlen(typestr);
3219 return (char *)typestr;
3221 if (SvREADONLY(sv) && !SvOK(sv)) {
3222 if (ckWARN(WARN_UNINITIALIZED))
3229 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3230 /* I'm assuming that if both IV and NV are equally valid then
3231 converting the IV is going to be more efficient */
3232 const U32 isIOK = SvIOK(sv);
3233 const U32 isUIOK = SvIsUV(sv);
3234 char buf[TYPE_CHARS(UV)];
3237 if (SvTYPE(sv) < SVt_PVIV)
3238 sv_upgrade(sv, SVt_PVIV);
3240 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3242 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3243 /* inlined from sv_setpvn */
3244 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3245 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3246 SvCUR_set(sv, ebuf - ptr);
3256 else if (SvNOKp(sv)) {
3257 if (SvTYPE(sv) < SVt_PVNV)
3258 sv_upgrade(sv, SVt_PVNV);
3259 /* The +20 is pure guesswork. Configure test needed. --jhi */
3260 s = SvGROW_mutable(sv, NV_DIG + 20);
3261 olderrno = errno; /* some Xenix systems wipe out errno here */
3263 if (SvNVX(sv) == 0.0)
3264 (void)strcpy(s,"0");
3268 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3271 #ifdef FIXNEGATIVEZERO
3272 if (*s == '-' && s[1] == '0' && !s[2])
3282 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
3286 if (SvTYPE(sv) < SVt_PV)
3287 /* Typically the caller expects that sv_any is not NULL now. */
3288 sv_upgrade(sv, SVt_PV);
3292 const STRLEN len = s - SvPVX_const(sv);
3298 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3299 PTR2UV(sv),SvPVX_const(sv)));
3300 if (flags & SV_CONST_RETURN)
3301 return (char *)SvPVX_const(sv);
3302 if (flags & SV_MUTABLE_RETURN)
3303 return SvPVX_mutable(sv);
3307 len = strlen(tmpbuf);
3310 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3311 /* Sneaky stuff here */
3315 tsv = newSVpvn(tmpbuf, len);
3324 #ifdef FIXNEGATIVEZERO
3325 if (len == 2 && tmpbuf[0] == '-' && tmpbuf[1] == '0') {
3331 SvUPGRADE(sv, SVt_PV);
3334 s = SvGROW_mutable(sv, len + 1);
3337 return memcpy(s, tmpbuf, len + 1);
3342 =for apidoc sv_copypv
3344 Copies a stringified representation of the source SV into the
3345 destination SV. Automatically performs any necessary mg_get and
3346 coercion of numeric values into strings. Guaranteed to preserve
3347 UTF-8 flag even from overloaded objects. Similar in nature to
3348 sv_2pv[_flags] but operates directly on an SV instead of just the
3349 string. Mostly uses sv_2pv_flags to do its work, except when that
3350 would lose the UTF-8'ness of the PV.
3356 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3359 const char * const s = SvPV_const(ssv,len);
3360 sv_setpvn(dsv,s,len);
3368 =for apidoc sv_2pvbyte
3370 Return a pointer to the byte-encoded representation of the SV, and set *lp
3371 to its length. May cause the SV to be downgraded from UTF-8 as a
3374 Usually accessed via the C<SvPVbyte> macro.
3380 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3382 sv_utf8_downgrade(sv,0);
3383 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3387 =for apidoc sv_2pvutf8
3389 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3390 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3392 Usually accessed via the C<SvPVutf8> macro.
3398 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3400 sv_utf8_upgrade(sv);
3401 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3406 =for apidoc sv_2bool
3408 This function is only called on magical items, and is only used by
3409 sv_true() or its macro equivalent.
3415 Perl_sv_2bool(pTHX_ register SV *sv)
3423 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3424 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3425 return (bool)SvTRUE(tmpsv);
3426 return SvRV(sv) != 0;
3429 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
3431 (*sv->sv_u.svu_pv > '0' ||
3432 Xpvtmp->xpv_cur > 1 ||
3433 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3440 return SvIVX(sv) != 0;
3443 return SvNVX(sv) != 0.0;
3451 =for apidoc sv_utf8_upgrade
3453 Converts the PV of an SV to its UTF-8-encoded form.
3454 Forces the SV to string form if it is not already.
3455 Always sets the SvUTF8 flag to avoid future validity checks even
3456 if all the bytes have hibit clear.
3458 This is not as a general purpose byte encoding to Unicode interface:
3459 use the Encode extension for that.
3461 =for apidoc sv_utf8_upgrade_flags
3463 Converts the PV of an SV to its UTF-8-encoded form.
3464 Forces the SV to string form if it is not already.
3465 Always sets the SvUTF8 flag to avoid future validity checks even
3466 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3467 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3468 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3470 This is not as a general purpose byte encoding to Unicode interface:
3471 use the Encode extension for that.
3477 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3479 if (sv == &PL_sv_undef)
3483 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3484 (void) sv_2pv_flags(sv,&len, flags);
3488 (void) SvPV_force(sv,len);
3497 sv_force_normal_flags(sv, 0);
3500 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3501 sv_recode_to_utf8(sv, PL_encoding);
3502 else { /* Assume Latin-1/EBCDIC */
3503 /* This function could be much more efficient if we
3504 * had a FLAG in SVs to signal if there are any hibit
3505 * chars in the PV. Given that there isn't such a flag
3506 * make the loop as fast as possible. */
3507 const U8 *s = (U8 *) SvPVX_const(sv);
3508 const U8 * const e = (U8 *) SvEND(sv);
3514 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3518 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3519 U8 * const recoded = bytes_to_utf8((U8*)s, &len);
3521 SvPV_free(sv); /* No longer using what was there before. */
3523 SvPV_set(sv, (char*)recoded);
3524 SvCUR_set(sv, len - 1);
3525 SvLEN_set(sv, len); /* No longer know the real size. */
3527 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3534 =for apidoc sv_utf8_downgrade
3536 Attempts to convert the PV of an SV from characters to bytes.
3537 If the PV contains a character beyond byte, this conversion will fail;
3538 in this case, either returns false or, if C<fail_ok> is not
3541 This is not as a general purpose Unicode to byte encoding interface:
3542 use the Encode extension for that.
3548 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3550 if (SvPOKp(sv) && SvUTF8(sv)) {
3556 sv_force_normal_flags(sv, 0);
3558 s = (U8 *) SvPV(sv, len);
3559 if (!utf8_to_bytes(s, &len)) {
3564 Perl_croak(aTHX_ "Wide character in %s",
3567 Perl_croak(aTHX_ "Wide character");
3578 =for apidoc sv_utf8_encode
3580 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3581 flag off so that it looks like octets again.
3587 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3589 (void) sv_utf8_upgrade(sv);
3591 sv_force_normal_flags(sv, 0);
3593 if (SvREADONLY(sv)) {
3594 Perl_croak(aTHX_ PL_no_modify);
3600 =for apidoc sv_utf8_decode
3602 If the PV of the SV is an octet sequence in UTF-8
3603 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3604 so that it looks like a character. If the PV contains only single-byte
3605 characters, the C<SvUTF8> flag stays being off.
3606 Scans PV for validity and returns false if the PV is invalid UTF-8.
3612 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3618 /* The octets may have got themselves encoded - get them back as
3621 if (!sv_utf8_downgrade(sv, TRUE))
3624 /* it is actually just a matter of turning the utf8 flag on, but
3625 * we want to make sure everything inside is valid utf8 first.
3627 c = (const U8 *) SvPVX_const(sv);
3628 if (!is_utf8_string(c, SvCUR(sv)+1))
3630 e = (const U8 *) SvEND(sv);
3633 if (!UTF8_IS_INVARIANT(ch)) {
3643 =for apidoc sv_setsv
3645 Copies the contents of the source SV C<ssv> into the destination SV
3646 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3647 function if the source SV needs to be reused. Does not handle 'set' magic.
3648 Loosely speaking, it performs a copy-by-value, obliterating any previous
3649 content of the destination.
3651 You probably want to use one of the assortment of wrappers, such as
3652 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3653 C<SvSetMagicSV_nosteal>.
3655 =for apidoc sv_setsv_flags
3657 Copies the contents of the source SV C<ssv> into the destination SV
3658 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3659 function if the source SV needs to be reused. Does not handle 'set' magic.
3660 Loosely speaking, it performs a copy-by-value, obliterating any previous
3661 content of the destination.
3662 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3663 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3664 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3665 and C<sv_setsv_nomg> are implemented in terms of this function.
3667 You probably want to use one of the assortment of wrappers, such as
3668 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3669 C<SvSetMagicSV_nosteal>.
3671 This is the primary function for copying scalars, and most other
3672 copy-ish functions and macros use this underneath.
3678 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3680 register U32 sflags;
3686 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3688 sstr = &PL_sv_undef;
3689 stype = SvTYPE(sstr);
3690 dtype = SvTYPE(dstr);
3695 /* need to nuke the magic */
3697 SvRMAGICAL_off(dstr);
3700 /* There's a lot of redundancy below but we're going for speed here */
3705 if (dtype != SVt_PVGV) {
3706 (void)SvOK_off(dstr);
3714 sv_upgrade(dstr, SVt_IV);
3717 sv_upgrade(dstr, SVt_PVNV);
3721 sv_upgrade(dstr, SVt_PVIV);
3724 (void)SvIOK_only(dstr);
3725 SvIV_set(dstr, SvIVX(sstr));
3728 if (SvTAINTED(sstr))
3739 sv_upgrade(dstr, SVt_NV);
3744 sv_upgrade(dstr, SVt_PVNV);
3747 SvNV_set(dstr, SvNVX(sstr));
3748 (void)SvNOK_only(dstr);
3749 if (SvTAINTED(sstr))
3757 sv_upgrade(dstr, SVt_RV);
3758 else if (dtype == SVt_PVGV &&
3759 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3762 if (GvIMPORTED(dstr) != GVf_IMPORTED
3763 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3765 GvIMPORTED_on(dstr);
3774 #ifdef PERL_OLD_COPY_ON_WRITE
3775 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3776 if (dtype < SVt_PVIV)
3777 sv_upgrade(dstr, SVt_PVIV);
3784 sv_upgrade(dstr, SVt_PV);
3787 if (dtype < SVt_PVIV)
3788 sv_upgrade(dstr, SVt_PVIV);
3791 if (dtype < SVt_PVNV)
3792 sv_upgrade(dstr, SVt_PVNV);
3799 const char * const type = sv_reftype(sstr,0);
3801 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3803 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3808 if (dtype <= SVt_PVGV) {
3810 if (dtype != SVt_PVGV) {
3811 const char * const name = GvNAME(sstr);
3812 const STRLEN len = GvNAMELEN(sstr);
3813 /* don't upgrade SVt_PVLV: it can hold a glob */
3814 if (dtype != SVt_PVLV)
3815 sv_upgrade(dstr, SVt_PVGV);
3816 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3817 GvSTASH(dstr) = GvSTASH(sstr);
3819 Perl_sv_add_backref(aTHX_ (SV*)GvSTASH(dstr), dstr);
3820 GvNAME(dstr) = savepvn(name, len);
3821 GvNAMELEN(dstr) = len;
3822 SvFAKE_on(dstr); /* can coerce to non-glob */
3825 #ifdef GV_UNIQUE_CHECK
3826 if (GvUNIQUE((GV*)dstr)) {
3827 Perl_croak(aTHX_ PL_no_modify);
3831 (void)SvOK_off(dstr);
3832 GvINTRO_off(dstr); /* one-shot flag */
3834 GvGP(dstr) = gp_ref(GvGP(sstr));
3835 if (SvTAINTED(sstr))
3837 if (GvIMPORTED(dstr) != GVf_IMPORTED
3838 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3840 GvIMPORTED_on(dstr);
3848 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3850 if ((int)SvTYPE(sstr) != stype) {
3851 stype = SvTYPE(sstr);
3852 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3856 if (stype == SVt_PVLV)
3857 SvUPGRADE(dstr, SVt_PVNV);
3859 SvUPGRADE(dstr, (U32)stype);
3862 sflags = SvFLAGS(sstr);
3864 if (sflags & SVf_ROK) {
3865 if (dtype >= SVt_PV) {
3866 if (dtype == SVt_PVGV) {
3867 SV * const sref = SvREFCNT_inc(SvRV(sstr));
3869 const int intro = GvINTRO(dstr);
3871 #ifdef GV_UNIQUE_CHECK
3872 if (GvUNIQUE((GV*)dstr)) {
3873 Perl_croak(aTHX_ PL_no_modify);
3878 GvINTRO_off(dstr); /* one-shot flag */
3879 GvLINE(dstr) = CopLINE(PL_curcop);
3880 GvEGV(dstr) = (GV*)dstr;
3883 switch (SvTYPE(sref)) {
3886 SAVEGENERICSV(GvAV(dstr));
3888 dref = (SV*)GvAV(dstr);
3889 GvAV(dstr) = (AV*)sref;
3890 if (!GvIMPORTED_AV(dstr)
3891 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3893 GvIMPORTED_AV_on(dstr);
3898 SAVEGENERICSV(GvHV(dstr));
3900 dref = (SV*)GvHV(dstr);
3901 GvHV(dstr) = (HV*)sref;
3902 if (!GvIMPORTED_HV(dstr)
3903 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3905 GvIMPORTED_HV_on(dstr);
3910 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3911 SvREFCNT_dec(GvCV(dstr));
3912 GvCV(dstr) = Nullcv;
3913 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3914 PL_sub_generation++;
3916 SAVEGENERICSV(GvCV(dstr));
3919 dref = (SV*)GvCV(dstr);
3920 if (GvCV(dstr) != (CV*)sref) {
3921 CV* const cv = GvCV(dstr);
3923 if (!GvCVGEN((GV*)dstr) &&
3924 (CvROOT(cv) || CvXSUB(cv)))
3926 /* Redefining a sub - warning is mandatory if
3927 it was a const and its value changed. */
3928 if (ckWARN(WARN_REDEFINE)
3930 && (!CvCONST((CV*)sref)
3931 || sv_cmp(cv_const_sv(cv),
3932 cv_const_sv((CV*)sref)))))
3934 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3936 ? "Constant subroutine %s::%s redefined"
3937 : "Subroutine %s::%s redefined",
3938 HvNAME_get(GvSTASH((GV*)dstr)),
3939 GvENAME((GV*)dstr));
3943 cv_ckproto(cv, (GV*)dstr,
3945 ? SvPVX_const(sref) : Nullch);
3947 GvCV(dstr) = (CV*)sref;
3948 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3949 GvASSUMECV_on(dstr);
3950 PL_sub_generation++;
3952 if (!GvIMPORTED_CV(dstr)
3953 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3955 GvIMPORTED_CV_on(dstr);
3960 SAVEGENERICSV(GvIOp(dstr));
3962 dref = (SV*)GvIOp(dstr);
3963 GvIOp(dstr) = (IO*)sref;
3967 SAVEGENERICSV(GvFORM(dstr));
3969 dref = (SV*)GvFORM(dstr);
3970 GvFORM(dstr) = (CV*)sref;
3974 SAVEGENERICSV(GvSV(dstr));
3976 dref = (SV*)GvSV(dstr);
3978 if (!GvIMPORTED_SV(dstr)
3979 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3981 GvIMPORTED_SV_on(dstr);
3987 if (SvTAINTED(sstr))
3991 if (SvPVX_const(dstr)) {
3997 (void)SvOK_off(dstr);
3998 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4000 if (sflags & SVp_NOK) {
4002 /* Only set the public OK flag if the source has public OK. */
4003 if (sflags & SVf_NOK)
4004 SvFLAGS(dstr) |= SVf_NOK;
4005 SvNV_set(dstr, SvNVX(sstr));
4007 if (sflags & SVp_IOK) {
4008 (void)SvIOKp_on(dstr);
4009 if (sflags & SVf_IOK)
4010 SvFLAGS(dstr) |= SVf_IOK;
4011 if (sflags & SVf_IVisUV)
4013 SvIV_set(dstr, SvIVX(sstr));
4015 if (SvAMAGIC(sstr)) {
4019 else if (sflags & SVp_POK) {
4023 * Check to see if we can just swipe the string. If so, it's a
4024 * possible small lose on short strings, but a big win on long ones.
4025 * It might even be a win on short strings if SvPVX_const(dstr)
4026 * has to be allocated and SvPVX_const(sstr) has to be freed.
4029 /* Whichever path we take through the next code, we want this true,
4030 and doing it now facilitates the COW check. */
4031 (void)SvPOK_only(dstr);
4034 /* We're not already COW */
4035 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4036 #ifndef PERL_OLD_COPY_ON_WRITE
4037 /* or we are, but dstr isn't a suitable target. */
4038 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4043 (sflags & SVs_TEMP) && /* slated for free anyway? */
4044 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4045 (!(flags & SV_NOSTEAL)) &&
4046 /* and we're allowed to steal temps */
4047 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4048 SvLEN(sstr) && /* and really is a string */
4049 /* and won't be needed again, potentially */
4050 !(PL_op && PL_op->op_type == OP_AASSIGN))
4051 #ifdef PERL_OLD_COPY_ON_WRITE
4052 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4053 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4054 && SvTYPE(sstr) >= SVt_PVIV)
4057 /* Failed the swipe test, and it's not a shared hash key either.
4058 Have to copy the string. */
4059 STRLEN len = SvCUR(sstr);
4060 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4061 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4062 SvCUR_set(dstr, len);
4063 *SvEND(dstr) = '\0';
4065 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4067 /* Either it's a shared hash key, or it's suitable for
4068 copy-on-write or we can swipe the string. */
4070 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4074 #ifdef PERL_OLD_COPY_ON_WRITE
4076 /* I believe I should acquire a global SV mutex if
4077 it's a COW sv (not a shared hash key) to stop
4078 it going un copy-on-write.
4079 If the source SV has gone un copy on write between up there
4080 and down here, then (assert() that) it is of the correct
4081 form to make it copy on write again */
4082 if ((sflags & (SVf_FAKE | SVf_READONLY))
4083 != (SVf_FAKE | SVf_READONLY)) {
4084 SvREADONLY_on(sstr);
4086 /* Make the source SV into a loop of 1.
4087 (about to become 2) */
4088 SV_COW_NEXT_SV_SET(sstr, sstr);
4092 /* Initial code is common. */
4093 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4098 /* making another shared SV. */
4099 STRLEN cur = SvCUR(sstr);
4100 STRLEN len = SvLEN(sstr);
4101 #ifdef PERL_OLD_COPY_ON_WRITE
4103 assert (SvTYPE(dstr) >= SVt_PVIV);
4104 /* SvIsCOW_normal */
4105 /* splice us in between source and next-after-source. */
4106 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4107 SV_COW_NEXT_SV_SET(sstr, dstr);
4108 SvPV_set(dstr, SvPVX_mutable(sstr));
4112 /* SvIsCOW_shared_hash */
4113 DEBUG_C(PerlIO_printf(Perl_debug_log,
4114 "Copy on write: Sharing hash\n"));
4116 assert (SvTYPE(dstr) >= SVt_PV);
4118 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4120 SvLEN_set(dstr, len);
4121 SvCUR_set(dstr, cur);
4122 SvREADONLY_on(dstr);
4124 /* Relesase a global SV mutex. */
4127 { /* Passes the swipe test. */
4128 SvPV_set(dstr, SvPVX_mutable(sstr));
4129 SvLEN_set(dstr, SvLEN(sstr));
4130 SvCUR_set(dstr, SvCUR(sstr));
4133 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4134 SvPV_set(sstr, Nullch);
4140 if (sflags & SVf_UTF8)
4142 if (sflags & SVp_NOK) {
4144 if (sflags & SVf_NOK)
4145 SvFLAGS(dstr) |= SVf_NOK;
4146 SvNV_set(dstr, SvNVX(sstr));
4148 if (sflags & SVp_IOK) {
4149 (void)SvIOKp_on(dstr);
4150 if (sflags & SVf_IOK)
4151 SvFLAGS(dstr) |= SVf_IOK;
4152 if (sflags & SVf_IVisUV)
4154 SvIV_set(dstr, SvIVX(sstr));
4157 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4158 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4159 smg->mg_ptr, smg->mg_len);
4160 SvRMAGICAL_on(dstr);
4163 else if (sflags & SVp_IOK) {
4164 if (sflags & SVf_IOK)
4165 (void)SvIOK_only(dstr);
4167 (void)SvOK_off(dstr);
4168 (void)SvIOKp_on(dstr);
4170 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4171 if (sflags & SVf_IVisUV)
4173 SvIV_set(dstr, SvIVX(sstr));
4174 if (sflags & SVp_NOK) {
4175 if (sflags & SVf_NOK)
4176 (void)SvNOK_on(dstr);
4178 (void)SvNOKp_on(dstr);
4179 SvNV_set(dstr, SvNVX(sstr));
4182 else if (sflags & SVp_NOK) {
4183 if (sflags & SVf_NOK)
4184 (void)SvNOK_only(dstr);
4186 (void)SvOK_off(dstr);
4189 SvNV_set(dstr, SvNVX(sstr));
4192 if (dtype == SVt_PVGV) {
4193 if (ckWARN(WARN_MISC))
4194 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4197 (void)SvOK_off(dstr);
4199 if (SvTAINTED(sstr))
4204 =for apidoc sv_setsv_mg
4206 Like C<sv_setsv>, but also handles 'set' magic.
4212 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4214 sv_setsv(dstr,sstr);
4218 #ifdef PERL_OLD_COPY_ON_WRITE
4220 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4222 STRLEN cur = SvCUR(sstr);
4223 STRLEN len = SvLEN(sstr);
4224 register char *new_pv;
4227 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4235 if (SvTHINKFIRST(dstr))
4236 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4237 else if (SvPVX_const(dstr))
4238 Safefree(SvPVX_const(dstr));
4242 SvUPGRADE(dstr, SVt_PVIV);
4244 assert (SvPOK(sstr));
4245 assert (SvPOKp(sstr));
4246 assert (!SvIOK(sstr));
4247 assert (!SvIOKp(sstr));
4248 assert (!SvNOK(sstr));
4249 assert (!SvNOKp(sstr));
4251 if (SvIsCOW(sstr)) {
4253 if (SvLEN(sstr) == 0) {
4254 /* source is a COW shared hash key. */
4255 DEBUG_C(PerlIO_printf(Perl_debug_log,
4256 "Fast copy on write: Sharing hash\n"));
4257 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4260 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4262 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4263 SvUPGRADE(sstr, SVt_PVIV);
4264 SvREADONLY_on(sstr);
4266 DEBUG_C(PerlIO_printf(Perl_debug_log,
4267 "Fast copy on write: Converting sstr to COW\n"));
4268 SV_COW_NEXT_SV_SET(dstr, sstr);
4270 SV_COW_NEXT_SV_SET(sstr, dstr);
4271 new_pv = SvPVX_mutable(sstr);
4274 SvPV_set(dstr, new_pv);
4275 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4278 SvLEN_set(dstr, len);
4279 SvCUR_set(dstr, cur);
4288 =for apidoc sv_setpvn
4290 Copies a string into an SV. The C<len> parameter indicates the number of
4291 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4292 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4298 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4300 register char *dptr;
4302 SV_CHECK_THINKFIRST_COW_DROP(sv);
4308 /* len is STRLEN which is unsigned, need to copy to signed */
4311 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4313 SvUPGRADE(sv, SVt_PV);
4315 dptr = SvGROW(sv, len + 1);
4316 Move(ptr,dptr,len,char);
4319 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4324 =for apidoc sv_setpvn_mg
4326 Like C<sv_setpvn>, but also handles 'set' magic.
4332 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4334 sv_setpvn(sv,ptr,len);
4339 =for apidoc sv_setpv
4341 Copies a string into an SV. The string must be null-terminated. Does not
4342 handle 'set' magic. See C<sv_setpv_mg>.
4348 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4350 register STRLEN len;
4352 SV_CHECK_THINKFIRST_COW_DROP(sv);
4358 SvUPGRADE(sv, SVt_PV);
4360 SvGROW(sv, len + 1);
4361 Move(ptr,SvPVX(sv),len+1,char);
4363 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4368 =for apidoc sv_setpv_mg
4370 Like C<sv_setpv>, but also handles 'set' magic.
4376 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4383 =for apidoc sv_usepvn
4385 Tells an SV to use C<ptr> to find its string value. Normally the string is
4386 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4387 The C<ptr> should point to memory that was allocated by C<malloc>. The
4388 string length, C<len>, must be supplied. This function will realloc the
4389 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4390 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4391 See C<sv_usepvn_mg>.
4397 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4400 SV_CHECK_THINKFIRST_COW_DROP(sv);
4401 SvUPGRADE(sv, SVt_PV);
4406 if (SvPVX_const(sv))
4409 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4410 ptr = saferealloc (ptr, allocate);
4413 SvLEN_set(sv, allocate);
4415 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4420 =for apidoc sv_usepvn_mg
4422 Like C<sv_usepvn>, but also handles 'set' magic.
4428 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4430 sv_usepvn(sv,ptr,len);
4434 #ifdef PERL_OLD_COPY_ON_WRITE
4435 /* Need to do this *after* making the SV normal, as we need the buffer
4436 pointer to remain valid until after we've copied it. If we let go too early,
4437 another thread could invalidate it by unsharing last of the same hash key
4438 (which it can do by means other than releasing copy-on-write Svs)
4439 or by changing the other copy-on-write SVs in the loop. */
4441 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4443 if (len) { /* this SV was SvIsCOW_normal(sv) */
4444 /* we need to find the SV pointing to us. */
4445 SV * const current = SV_COW_NEXT_SV(after);
4447 if (current == sv) {
4448 /* The SV we point to points back to us (there were only two of us
4450 Hence other SV is no longer copy on write either. */
4452 SvREADONLY_off(after);
4454 /* We need to follow the pointers around the loop. */
4456 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4459 /* don't loop forever if the structure is bust, and we have
4460 a pointer into a closed loop. */
4461 assert (current != after);
4462 assert (SvPVX_const(current) == pvx);
4464 /* Make the SV before us point to the SV after us. */
4465 SV_COW_NEXT_SV_SET(current, after);
4468 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4473 Perl_sv_release_IVX(pTHX_ register SV *sv)
4476 sv_force_normal_flags(sv, 0);
4482 =for apidoc sv_force_normal_flags
4484 Undo various types of fakery on an SV: if the PV is a shared string, make
4485 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4486 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4487 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4488 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4489 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4490 set to some other value.) In addition, the C<flags> parameter gets passed to
4491 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4492 with flags set to 0.
4498 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4500 #ifdef PERL_OLD_COPY_ON_WRITE
4501 if (SvREADONLY(sv)) {
4502 /* At this point I believe I should acquire a global SV mutex. */
4504 const char * const pvx = SvPVX_const(sv);
4505 const STRLEN len = SvLEN(sv);
4506 const STRLEN cur = SvCUR(sv);
4507 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4509 PerlIO_printf(Perl_debug_log,
4510 "Copy on write: Force normal %ld\n",
4516 /* This SV doesn't own the buffer, so need to Newx() a new one: */
4517 SvPV_set(sv, (char*)0);
4519 if (flags & SV_COW_DROP_PV) {
4520 /* OK, so we don't need to copy our buffer. */
4523 SvGROW(sv, cur + 1);
4524 Move(pvx,SvPVX(sv),cur,char);
4528 sv_release_COW(sv, pvx, len, next);
4533 else if (IN_PERL_RUNTIME)
4534 Perl_croak(aTHX_ PL_no_modify);
4535 /* At this point I believe that I can drop the global SV mutex. */
4538 if (SvREADONLY(sv)) {
4540 const char * const pvx = SvPVX_const(sv);
4541 const STRLEN len = SvCUR(sv);
4544 SvPV_set(sv, Nullch);
4546 SvGROW(sv, len + 1);
4547 Move(pvx,SvPVX(sv),len,char);
4549 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4551 else if (IN_PERL_RUNTIME)
4552 Perl_croak(aTHX_ PL_no_modify);
4556 sv_unref_flags(sv, flags);
4557 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4564 Efficient removal of characters from the beginning of the string buffer.
4565 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4566 the string buffer. The C<ptr> becomes the first character of the adjusted
4567 string. Uses the "OOK hack".
4568 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4569 refer to the same chunk of data.
4575 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4577 register STRLEN delta;
4578 if (!ptr || !SvPOKp(sv))
4580 delta = ptr - SvPVX_const(sv);
4581 SV_CHECK_THINKFIRST(sv);
4582 if (SvTYPE(sv) < SVt_PVIV)
4583 sv_upgrade(sv,SVt_PVIV);
4586 if (!SvLEN(sv)) { /* make copy of shared string */
4587 const char *pvx = SvPVX_const(sv);
4588 const STRLEN len = SvCUR(sv);
4589 SvGROW(sv, len + 1);
4590 Move(pvx,SvPVX(sv),len,char);
4594 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4595 and we do that anyway inside the SvNIOK_off
4597 SvFLAGS(sv) |= SVf_OOK;
4600 SvLEN_set(sv, SvLEN(sv) - delta);
4601 SvCUR_set(sv, SvCUR(sv) - delta);
4602 SvPV_set(sv, SvPVX(sv) + delta);
4603 SvIV_set(sv, SvIVX(sv) + delta);
4607 =for apidoc sv_catpvn
4609 Concatenates the string onto the end of the string which is in the SV. The
4610 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4611 status set, then the bytes appended should be valid UTF-8.
4612 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4614 =for apidoc sv_catpvn_flags
4616 Concatenates the string onto the end of the string which is in the SV. The
4617 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4618 status set, then the bytes appended should be valid UTF-8.
4619 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4620 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4621 in terms of this function.
4627 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4630 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4632 SvGROW(dsv, dlen + slen + 1);
4634 sstr = SvPVX_const(dsv);
4635 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4636 SvCUR_set(dsv, SvCUR(dsv) + slen);
4638 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4640 if (flags & SV_SMAGIC)
4645 =for apidoc sv_catsv
4647 Concatenates the string from SV C<ssv> onto the end of the string in
4648 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4649 not 'set' magic. See C<sv_catsv_mg>.
4651 =for apidoc sv_catsv_flags
4653 Concatenates the string from SV C<ssv> onto the end of the string in
4654 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4655 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4656 and C<sv_catsv_nomg> are implemented in terms of this function.
4661 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4666 if ((spv = SvPV_const(ssv, slen))) {
4667 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4668 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4669 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4670 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4671 dsv->sv_flags doesn't have that bit set.
4672 Andy Dougherty 12 Oct 2001
4674 const I32 sutf8 = DO_UTF8(ssv);
4677 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4679 dutf8 = DO_UTF8(dsv);
4681 if (dutf8 != sutf8) {
4683 /* Not modifying source SV, so taking a temporary copy. */
4684 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4686 sv_utf8_upgrade(csv);
4687 spv = SvPV_const(csv, slen);
4690 sv_utf8_upgrade_nomg(dsv);
4692 sv_catpvn_nomg(dsv, spv, slen);
4695 if (flags & SV_SMAGIC)
4700 =for apidoc sv_catpv
4702 Concatenates the string onto the end of the string which is in the SV.
4703 If the SV has the UTF-8 status set, then the bytes appended should be
4704 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4709 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4711 register STRLEN len;
4717 junk = SvPV_force(sv, tlen);
4719 SvGROW(sv, tlen + len + 1);
4721 ptr = SvPVX_const(sv);
4722 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4723 SvCUR_set(sv, SvCUR(sv) + len);
4724 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4729 =for apidoc sv_catpv_mg
4731 Like C<sv_catpv>, but also handles 'set' magic.
4737 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4746 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4747 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4754 Perl_newSV(pTHX_ STRLEN len)
4760 sv_upgrade(sv, SVt_PV);
4761 SvGROW(sv, len + 1);
4766 =for apidoc sv_magicext
4768 Adds magic to an SV, upgrading it if necessary. Applies the
4769 supplied vtable and returns a pointer to the magic added.
4771 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4772 In particular, you can add magic to SvREADONLY SVs, and add more than
4773 one instance of the same 'how'.
4775 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4776 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4777 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4778 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4780 (This is now used as a subroutine by C<sv_magic>.)
4785 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4786 const char* name, I32 namlen)
4790 if (SvTYPE(sv) < SVt_PVMG) {
4791 SvUPGRADE(sv, SVt_PVMG);
4793 Newxz(mg, 1, MAGIC);
4794 mg->mg_moremagic = SvMAGIC(sv);
4795 SvMAGIC_set(sv, mg);
4797 /* Sometimes a magic contains a reference loop, where the sv and
4798 object refer to each other. To prevent a reference loop that
4799 would prevent such objects being freed, we look for such loops
4800 and if we find one we avoid incrementing the object refcount.
4802 Note we cannot do this to avoid self-tie loops as intervening RV must
4803 have its REFCNT incremented to keep it in existence.
4806 if (!obj || obj == sv ||
4807 how == PERL_MAGIC_arylen ||
4808 how == PERL_MAGIC_qr ||
4809 how == PERL_MAGIC_symtab ||
4810 (SvTYPE(obj) == SVt_PVGV &&
4811 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4812 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4813 GvFORM(obj) == (CV*)sv)))
4818 mg->mg_obj = SvREFCNT_inc(obj);
4819 mg->mg_flags |= MGf_REFCOUNTED;
4822 /* Normal self-ties simply pass a null object, and instead of
4823 using mg_obj directly, use the SvTIED_obj macro to produce a
4824 new RV as needed. For glob "self-ties", we are tieing the PVIO
4825 with an RV obj pointing to the glob containing the PVIO. In
4826 this case, to avoid a reference loop, we need to weaken the
4830 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4831 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4837 mg->mg_len = namlen;
4840 mg->mg_ptr = savepvn(name, namlen);
4841 else if (namlen == HEf_SVKEY)
4842 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4844 mg->mg_ptr = (char *) name;
4846 mg->mg_virtual = vtable;
4850 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4855 =for apidoc sv_magic
4857 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4858 then adds a new magic item of type C<how> to the head of the magic list.
4860 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4861 handling of the C<name> and C<namlen> arguments.
4863 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4864 to add more than one instance of the same 'how'.
4870 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4872 const MGVTBL *vtable;
4875 #ifdef PERL_OLD_COPY_ON_WRITE
4877 sv_force_normal_flags(sv, 0);
4879 if (SvREADONLY(sv)) {
4881 /* its okay to attach magic to shared strings; the subsequent
4882 * upgrade to PVMG will unshare the string */
4883 !(SvFAKE(sv) && SvTYPE(sv) < SVt_PVMG)
4886 && how != PERL_MAGIC_regex_global
4887 && how != PERL_MAGIC_bm
4888 && how != PERL_MAGIC_fm
4889 && how != PERL_MAGIC_sv
4890 && how != PERL_MAGIC_backref
4893 Perl_croak(aTHX_ PL_no_modify);
4896 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4897 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4898 /* sv_magic() refuses to add a magic of the same 'how' as an
4901 if (how == PERL_MAGIC_taint)
4909 vtable = &PL_vtbl_sv;
4911 case PERL_MAGIC_overload:
4912 vtable = &PL_vtbl_amagic;
4914 case PERL_MAGIC_overload_elem:
4915 vtable = &PL_vtbl_amagicelem;
4917 case PERL_MAGIC_overload_table:
4918 vtable = &PL_vtbl_ovrld;
4921 vtable = &PL_vtbl_bm;
4923 case PERL_MAGIC_regdata:
4924 vtable = &PL_vtbl_regdata;
4926 case PERL_MAGIC_regdatum:
4927 vtable = &PL_vtbl_regdatum;
4929 case PERL_MAGIC_env:
4930 vtable = &PL_vtbl_env;
4933 vtable = &PL_vtbl_fm;
4935 case PERL_MAGIC_envelem:
4936 vtable = &PL_vtbl_envelem;
4938 case PERL_MAGIC_regex_global:
4939 vtable = &PL_vtbl_mglob;
4941 case PERL_MAGIC_isa:
4942 vtable = &PL_vtbl_isa;
4944 case PERL_MAGIC_isaelem:
4945 vtable = &PL_vtbl_isaelem;
4947 case PERL_MAGIC_nkeys:
4948 vtable = &PL_vtbl_nkeys;
4950 case PERL_MAGIC_dbfile:
4953 case PERL_MAGIC_dbline:
4954 vtable = &PL_vtbl_dbline;
4956 #ifdef USE_LOCALE_COLLATE
4957 case PERL_MAGIC_collxfrm:
4958 vtable = &PL_vtbl_collxfrm;
4960 #endif /* USE_LOCALE_COLLATE */
4961 case PERL_MAGIC_tied:
4962 vtable = &PL_vtbl_pack;
4964 case PERL_MAGIC_tiedelem:
4965 case PERL_MAGIC_tiedscalar:
4966 vtable = &PL_vtbl_packelem;
4969 vtable = &PL_vtbl_regexp;
4971 case PERL_MAGIC_sig:
4972 vtable = &PL_vtbl_sig;
4974 case PERL_MAGIC_sigelem:
4975 vtable = &PL_vtbl_sigelem;
4977 case PERL_MAGIC_taint:
4978 vtable = &PL_vtbl_taint;
4980 case PERL_MAGIC_uvar:
4981 vtable = &PL_vtbl_uvar;
4983 case PERL_MAGIC_vec:
4984 vtable = &PL_vtbl_vec;
4986 case PERL_MAGIC_arylen_p:
4987 case PERL_MAGIC_rhash:
4988 case PERL_MAGIC_symtab:
4989 case PERL_MAGIC_vstring:
4992 case PERL_MAGIC_utf8:
4993 vtable = &PL_vtbl_utf8;
4995 case PERL_MAGIC_substr:
4996 vtable = &PL_vtbl_substr;
4998 case PERL_MAGIC_defelem:
4999 vtable = &PL_vtbl_defelem;
5001 case PERL_MAGIC_glob:
5002 vtable = &PL_vtbl_glob;
5004 case PERL_MAGIC_arylen:
5005 vtable = &PL_vtbl_arylen;
5007 case PERL_MAGIC_pos:
5008 vtable = &PL_vtbl_pos;
5010 case PERL_MAGIC_backref:
5011 vtable = &PL_vtbl_backref;
5013 case PERL_MAGIC_ext:
5014 /* Reserved for use by extensions not perl internals. */
5015 /* Useful for attaching extension internal data to perl vars. */
5016 /* Note that multiple extensions may clash if magical scalars */
5017 /* etc holding private data from one are passed to another. */
5021 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5024 /* Rest of work is done else where */
5025 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5028 case PERL_MAGIC_taint:
5031 case PERL_MAGIC_ext:
5032 case PERL_MAGIC_dbfile:
5039 =for apidoc sv_unmagic
5041 Removes all magic of type C<type> from an SV.
5047 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5051 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5054 for (mg = *mgp; mg; mg = *mgp) {
5055 if (mg->mg_type == type) {
5056 const MGVTBL* const vtbl = mg->mg_virtual;
5057 *mgp = mg->mg_moremagic;
5058 if (vtbl && vtbl->svt_free)
5059 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5060 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5062 Safefree(mg->mg_ptr);
5063 else if (mg->mg_len == HEf_SVKEY)
5064 SvREFCNT_dec((SV*)mg->mg_ptr);
5065 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5066 Safefree(mg->mg_ptr);
5068 if (mg->mg_flags & MGf_REFCOUNTED)
5069 SvREFCNT_dec(mg->mg_obj);
5073 mgp = &mg->mg_moremagic;
5077 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5084 =for apidoc sv_rvweaken
5086 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5087 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5088 push a back-reference to this RV onto the array of backreferences
5089 associated with that magic.
5095 Perl_sv_rvweaken(pTHX_ SV *sv)
5098 if (!SvOK(sv)) /* let undefs pass */
5101 Perl_croak(aTHX_ "Can't weaken a nonreference");
5102 else if (SvWEAKREF(sv)) {
5103 if (ckWARN(WARN_MISC))
5104 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5108 Perl_sv_add_backref(aTHX_ tsv, sv);
5114 /* Give tsv backref magic if it hasn't already got it, then push a
5115 * back-reference to sv onto the array associated with the backref magic.
5119 Perl_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5123 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5124 av = (AV*)mg->mg_obj;
5127 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5128 /* av now has a refcnt of 2, which avoids it getting freed
5129 * before us during global cleanup. The extra ref is removed
5130 * by magic_killbackrefs() when tsv is being freed */
5132 if (AvFILLp(av) >= AvMAX(av)) {
5133 av_extend(av, AvFILLp(av)+1);
5135 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5138 /* delete a back-reference to ourselves from the backref magic associated
5139 * with the SV we point to.
5143 S_sv_del_backref(pTHX_ SV *tsv, SV *sv)
5149 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref))) {
5150 if (PL_in_clean_all)
5153 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5154 Perl_croak(aTHX_ "panic: del_backref");
5155 av = (AV *)mg->mg_obj;
5157 /* We shouldn't be in here more than once, but for paranoia reasons lets
5159 for (i = AvFILLp(av); i >= 0; i--) {
5161 const SSize_t fill = AvFILLp(av);
5163 /* We weren't the last entry.
5164 An unordered list has this property that you can take the
5165 last element off the end to fill the hole, and it's still
5166 an unordered list :-)
5171 AvFILLp(av) = fill - 1;
5177 =for apidoc sv_insert
5179 Inserts a string at the specified offset/length within the SV. Similar to
5180 the Perl substr() function.
5186 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5190 register char *midend;
5191 register char *bigend;
5197 Perl_croak(aTHX_ "Can't modify non-existent substring");
5198 SvPV_force(bigstr, curlen);
5199 (void)SvPOK_only_UTF8(bigstr);
5200 if (offset + len > curlen) {
5201 SvGROW(bigstr, offset+len+1);
5202 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5203 SvCUR_set(bigstr, offset+len);
5207 i = littlelen - len;
5208 if (i > 0) { /* string might grow */
5209 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5210 mid = big + offset + len;
5211 midend = bigend = big + SvCUR(bigstr);
5214 while (midend > mid) /* shove everything down */
5215 *--bigend = *--midend;
5216 Move(little,big+offset,littlelen,char);
5217 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5222 Move(little,SvPVX(bigstr)+offset,len,char);
5227 big = SvPVX(bigstr);
5230 bigend = big + SvCUR(bigstr);
5232 if (midend > bigend)
5233 Perl_croak(aTHX_ "panic: sv_insert");
5235 if (mid - big > bigend - midend) { /* faster to shorten from end */
5237 Move(little, mid, littlelen,char);
5240 i = bigend - midend;
5242 Move(midend, mid, i,char);
5246 SvCUR_set(bigstr, mid - big);
5248 else if ((i = mid - big)) { /* faster from front */
5249 midend -= littlelen;
5251 sv_chop(bigstr,midend-i);
5256 Move(little, mid, littlelen,char);
5258 else if (littlelen) {
5259 midend -= littlelen;
5260 sv_chop(bigstr,midend);
5261 Move(little,midend,littlelen,char);
5264 sv_chop(bigstr,midend);
5270 =for apidoc sv_replace
5272 Make the first argument a copy of the second, then delete the original.
5273 The target SV physically takes over ownership of the body of the source SV
5274 and inherits its flags; however, the target keeps any magic it owns,
5275 and any magic in the source is discarded.
5276 Note that this is a rather specialist SV copying operation; most of the
5277 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5283 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5285 const U32 refcnt = SvREFCNT(sv);
5286 SV_CHECK_THINKFIRST_COW_DROP(sv);
5287 if (SvREFCNT(nsv) != 1) {
5288 Perl_croak(aTHX_ "panic: reference miscount on nsv in sv_replace() (%"
5289 UVuf " != 1)", (UV) SvREFCNT(nsv));
5291 if (SvMAGICAL(sv)) {
5295 sv_upgrade(nsv, SVt_PVMG);
5296 SvMAGIC_set(nsv, SvMAGIC(sv));
5297 SvFLAGS(nsv) |= SvMAGICAL(sv);
5299 SvMAGIC_set(sv, NULL);
5303 assert(!SvREFCNT(sv));
5304 #ifdef DEBUG_LEAKING_SCALARS
5305 sv->sv_flags = nsv->sv_flags;
5306 sv->sv_any = nsv->sv_any;
5307 sv->sv_refcnt = nsv->sv_refcnt;
5308 sv->sv_u = nsv->sv_u;
5310 StructCopy(nsv,sv,SV);
5312 /* Currently could join these into one piece of pointer arithmetic, but
5313 it would be unclear. */
5314 if(SvTYPE(sv) == SVt_IV)
5316 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5317 else if (SvTYPE(sv) == SVt_RV) {
5318 SvANY(sv) = &sv->sv_u.svu_rv;
5322 #ifdef PERL_OLD_COPY_ON_WRITE
5323 if (SvIsCOW_normal(nsv)) {
5324 /* We need to follow the pointers around the loop to make the
5325 previous SV point to sv, rather than nsv. */
5328 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5331 assert(SvPVX_const(current) == SvPVX_const(nsv));
5333 /* Make the SV before us point to the SV after us. */
5335 PerlIO_printf(Perl_debug_log, "previous is\n");
5337 PerlIO_printf(Perl_debug_log,
5338 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5339 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5341 SV_COW_NEXT_SV_SET(current, sv);
5344 SvREFCNT(sv) = refcnt;
5345 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5351 =for apidoc sv_clear
5353 Clear an SV: call any destructors, free up any memory used by the body,
5354 and free the body itself. The SV's head is I<not> freed, although
5355 its type is set to all 1's so that it won't inadvertently be assumed
5356 to be live during global destruction etc.
5357 This function should only be called when REFCNT is zero. Most of the time
5358 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5365 Perl_sv_clear(pTHX_ register SV *sv)
5368 void** old_body_arena;
5369 size_t old_body_offset;
5370 const U32 type = SvTYPE(sv);
5373 assert(SvREFCNT(sv) == 0);
5379 old_body_offset = 0;
5382 if (PL_defstash) { /* Still have a symbol table? */
5387 stash = SvSTASH(sv);
5388 destructor = StashHANDLER(stash,DESTROY);
5390 SV* const tmpref = newRV(sv);
5391 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5393 PUSHSTACKi(PERLSI_DESTROY);
5398 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5404 if(SvREFCNT(tmpref) < 2) {
5405 /* tmpref is not kept alive! */
5407 SvRV_set(tmpref, NULL);
5410 SvREFCNT_dec(tmpref);
5412 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5416 if (PL_in_clean_objs)
5417 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5419 /* DESTROY gave object new lease on life */
5425 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5426 SvOBJECT_off(sv); /* Curse the object. */
5427 if (type != SVt_PVIO)
5428 --PL_sv_objcount; /* XXX Might want something more general */
5431 if (type >= SVt_PVMG) {
5434 if (type == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5435 SvREFCNT_dec(SvSTASH(sv));
5440 IoIFP(sv) != PerlIO_stdin() &&
5441 IoIFP(sv) != PerlIO_stdout() &&
5442 IoIFP(sv) != PerlIO_stderr())
5444 io_close((IO*)sv, FALSE);
5446 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5447 PerlDir_close(IoDIRP(sv));
5448 IoDIRP(sv) = (DIR*)NULL;
5449 Safefree(IoTOP_NAME(sv));
5450 Safefree(IoFMT_NAME(sv));
5451 Safefree(IoBOTTOM_NAME(sv));
5452 /* PVIOs aren't from arenas */
5455 old_body_arena = &PL_body_roots[SVt_PVBM];
5458 old_body_arena = &PL_body_roots[SVt_PVCV];
5460 /* PVFMs aren't from arenas */
5465 old_body_arena = &PL_body_roots[SVt_PVHV];
5466 old_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill);
5470 old_body_arena = &PL_body_roots[SVt_PVAV];
5471 old_body_offset = STRUCT_OFFSET(XPVAV, xav_fill);
5474 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5475 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5476 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5477 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5479 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5480 SvREFCNT_dec(LvTARG(sv));
5481 old_body_arena = &PL_body_roots[SVt_PVLV];
5485 Safefree(GvNAME(sv));
5486 /* If we're in a stash, we don't own a reference to it. However it does
5487 have a back reference to us, which needs to be cleared. */
5489 sv_del_backref((SV*)GvSTASH(sv), sv);
5490 old_body_arena = &PL_body_roots[SVt_PVGV];
5493 old_body_arena = &PL_body_roots[SVt_PVMG];
5496 old_body_arena = &PL_body_roots[SVt_PVNV];
5499 old_body_arena = &PL_body_roots[SVt_PVIV];
5500 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur);
5502 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5504 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5505 /* Don't even bother with turning off the OOK flag. */
5509 old_body_arena = &PL_body_roots[SVt_PV];
5510 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur);
5514 SV *target = SvRV(sv);
5516 sv_del_backref(target, sv);
5518 SvREFCNT_dec(target);
5520 #ifdef PERL_OLD_COPY_ON_WRITE
5521 else if (SvPVX_const(sv)) {
5523 /* I believe I need to grab the global SV mutex here and
5524 then recheck the COW status. */
5526 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5529 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5530 SV_COW_NEXT_SV(sv));
5531 /* And drop it here. */
5533 } else if (SvLEN(sv)) {
5534 Safefree(SvPVX_const(sv));
5538 else if (SvPVX_const(sv) && SvLEN(sv))
5539 Safefree(SvPVX_mutable(sv));
5540 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5541 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5547 old_body_arena = PL_body_roots[SVt_NV];
5551 SvFLAGS(sv) &= SVf_BREAK;
5552 SvFLAGS(sv) |= SVTYPEMASK;
5555 if (old_body_arena) {
5556 del_body(((char *)SvANY(sv) + old_body_offset), old_body_arena);
5560 if (type > SVt_RV) {
5561 my_safefree(SvANY(sv));
5566 =for apidoc sv_newref
5568 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5575 Perl_sv_newref(pTHX_ SV *sv)
5585 Decrement an SV's reference count, and if it drops to zero, call
5586 C<sv_clear> to invoke destructors and free up any memory used by
5587 the body; finally, deallocate the SV's head itself.
5588 Normally called via a wrapper macro C<SvREFCNT_dec>.
5594 Perl_sv_free(pTHX_ SV *sv)
5599 if (SvREFCNT(sv) == 0) {
5600 if (SvFLAGS(sv) & SVf_BREAK)
5601 /* this SV's refcnt has been artificially decremented to
5602 * trigger cleanup */
5604 if (PL_in_clean_all) /* All is fair */
5606 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5607 /* make sure SvREFCNT(sv)==0 happens very seldom */
5608 SvREFCNT(sv) = (~(U32)0)/2;
5611 if (ckWARN_d(WARN_INTERNAL)) {
5612 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5613 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5614 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5615 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
5616 Perl_dump_sv_child(aTHX_ sv);
5621 if (--(SvREFCNT(sv)) > 0)
5623 Perl_sv_free2(aTHX_ sv);
5627 Perl_sv_free2(pTHX_ SV *sv)
5632 if (ckWARN_d(WARN_DEBUGGING))
5633 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5634 "Attempt to free temp prematurely: SV 0x%"UVxf
5635 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5639 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5640 /* make sure SvREFCNT(sv)==0 happens very seldom */
5641 SvREFCNT(sv) = (~(U32)0)/2;
5652 Returns the length of the string in the SV. Handles magic and type
5653 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5659 Perl_sv_len(pTHX_ register SV *sv)
5667 len = mg_length(sv);
5669 (void)SvPV_const(sv, len);
5674 =for apidoc sv_len_utf8
5676 Returns the number of characters in the string in an SV, counting wide
5677 UTF-8 bytes as a single character. Handles magic and type coercion.
5683 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5684 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5685 * (Note that the mg_len is not the length of the mg_ptr field.)
5690 Perl_sv_len_utf8(pTHX_ register SV *sv)
5696 return mg_length(sv);
5700 const U8 *s = (U8*)SvPV_const(sv, len);
5701 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5703 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5705 #ifdef PERL_UTF8_CACHE_ASSERT
5706 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5710 ulen = Perl_utf8_length(aTHX_ s, s + len);
5711 if (!mg && !SvREADONLY(sv)) {
5712 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5713 mg = mg_find(sv, PERL_MAGIC_utf8);
5723 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5724 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5725 * between UTF-8 and byte offsets. There are two (substr offset and substr
5726 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5727 * and byte offset) cache positions.
5729 * The mg_len field is used by sv_len_utf8(), see its comments.
5730 * Note that the mg_len is not the length of the mg_ptr field.
5734 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5735 I32 offsetp, const U8 *s, const U8 *start)
5739 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5741 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5745 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5747 Newxz(*cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5748 (*mgp)->mg_ptr = (char *) *cachep;
5752 (*cachep)[i] = offsetp;
5753 (*cachep)[i+1] = s - start;
5761 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5762 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5763 * between UTF-8 and byte offsets. See also the comments of
5764 * S_utf8_mg_pos_init().
5768 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, const U8 **sp, const U8 *start, const U8 *send)
5772 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5774 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5775 if (*mgp && (*mgp)->mg_ptr) {
5776 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5777 ASSERT_UTF8_CACHE(*cachep);
5778 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5780 else { /* We will skip to the right spot. */
5785 /* The assumption is that going backward is half
5786 * the speed of going forward (that's where the
5787 * 2 * backw in the below comes from). (The real
5788 * figure of course depends on the UTF-8 data.) */
5790 if ((*cachep)[i] > (STRLEN)uoff) {
5792 backw = (*cachep)[i] - (STRLEN)uoff;
5794 if (forw < 2 * backw)
5797 p = start + (*cachep)[i+1];
5799 /* Try this only for the substr offset (i == 0),
5800 * not for the substr length (i == 2). */
5801 else if (i == 0) { /* (*cachep)[i] < uoff */
5802 const STRLEN ulen = sv_len_utf8(sv);
5804 if ((STRLEN)uoff < ulen) {
5805 forw = (STRLEN)uoff - (*cachep)[i];
5806 backw = ulen - (STRLEN)uoff;
5808 if (forw < 2 * backw)
5809 p = start + (*cachep)[i+1];
5814 /* If the string is not long enough for uoff,
5815 * we could extend it, but not at this low a level. */
5819 if (forw < 2 * backw) {
5826 while (UTF8_IS_CONTINUATION(*p))
5831 /* Update the cache. */
5832 (*cachep)[i] = (STRLEN)uoff;
5833 (*cachep)[i+1] = p - start;
5835 /* Drop the stale "length" cache */
5844 if (found) { /* Setup the return values. */
5845 *offsetp = (*cachep)[i+1];
5846 *sp = start + *offsetp;
5849 *offsetp = send - start;
5851 else if (*sp < start) {
5857 #ifdef PERL_UTF8_CACHE_ASSERT
5862 while (n-- && s < send)
5866 assert(*offsetp == s - start);
5867 assert((*cachep)[0] == (STRLEN)uoff);
5868 assert((*cachep)[1] == *offsetp);
5870 ASSERT_UTF8_CACHE(*cachep);
5879 =for apidoc sv_pos_u2b
5881 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5882 the start of the string, to a count of the equivalent number of bytes; if
5883 lenp is non-zero, it does the same to lenp, but this time starting from
5884 the offset, rather than from the start of the string. Handles magic and
5891 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5892 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5893 * byte offsets. See also the comments of S_utf8_mg_pos().
5898 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5906 start = (U8*)SvPV_const(sv, len);
5910 const U8 *s = start;
5911 I32 uoffset = *offsetp;
5912 const U8 * const send = s + len;
5916 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5918 if (!found && uoffset > 0) {
5919 while (s < send && uoffset--)
5923 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
5925 *offsetp = s - start;
5930 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
5934 if (!found && *lenp > 0) {
5937 while (s < send && ulen--)
5941 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
5945 ASSERT_UTF8_CACHE(cache);
5957 =for apidoc sv_pos_b2u
5959 Converts the value pointed to by offsetp from a count of bytes from the
5960 start of the string, to a count of the equivalent number of UTF-8 chars.
5961 Handles magic and type coercion.
5967 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5968 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5969 * byte offsets. See also the comments of S_utf8_mg_pos().
5974 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5982 s = (const U8*)SvPV_const(sv, len);
5983 if ((I32)len < *offsetp)
5984 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5986 const U8* send = s + *offsetp;
5988 STRLEN *cache = NULL;
5992 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5993 mg = mg_find(sv, PERL_MAGIC_utf8);
5994 if (mg && mg->mg_ptr) {
5995 cache = (STRLEN *) mg->mg_ptr;
5996 if (cache[1] == (STRLEN)*offsetp) {
5997 /* An exact match. */
5998 *offsetp = cache[0];
6002 else if (cache[1] < (STRLEN)*offsetp) {
6003 /* We already know part of the way. */
6006 /* Let the below loop do the rest. */
6008 else { /* cache[1] > *offsetp */
6009 /* We already know all of the way, now we may
6010 * be able to walk back. The same assumption
6011 * is made as in S_utf8_mg_pos(), namely that
6012 * walking backward is twice slower than
6013 * walking forward. */
6014 const STRLEN forw = *offsetp;
6015 STRLEN backw = cache[1] - *offsetp;
6017 if (!(forw < 2 * backw)) {
6018 const U8 *p = s + cache[1];
6025 while (UTF8_IS_CONTINUATION(*p)) {
6033 *offsetp = cache[0];
6035 /* Drop the stale "length" cache */
6043 ASSERT_UTF8_CACHE(cache);
6049 /* Call utf8n_to_uvchr() to validate the sequence
6050 * (unless a simple non-UTF character) */
6051 if (!UTF8_IS_INVARIANT(*s))
6052 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6061 if (!SvREADONLY(sv)) {
6063 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6064 mg = mg_find(sv, PERL_MAGIC_utf8);
6069 Newxz(cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6070 mg->mg_ptr = (char *) cache;
6075 cache[1] = *offsetp;
6076 /* Drop the stale "length" cache */
6089 Returns a boolean indicating whether the strings in the two SVs are
6090 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6091 coerce its args to strings if necessary.
6097 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6105 SV* svrecode = Nullsv;
6112 pv1 = SvPV_const(sv1, cur1);
6119 pv2 = SvPV_const(sv2, cur2);
6121 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6122 /* Differing utf8ness.
6123 * Do not UTF8size the comparands as a side-effect. */
6126 svrecode = newSVpvn(pv2, cur2);
6127 sv_recode_to_utf8(svrecode, PL_encoding);
6128 pv2 = SvPV_const(svrecode, cur2);
6131 svrecode = newSVpvn(pv1, cur1);
6132 sv_recode_to_utf8(svrecode, PL_encoding);
6133 pv1 = SvPV_const(svrecode, cur1);
6135 /* Now both are in UTF-8. */
6137 SvREFCNT_dec(svrecode);
6142 bool is_utf8 = TRUE;
6145 /* sv1 is the UTF-8 one,
6146 * if is equal it must be downgrade-able */
6147 char * const pv = (char*)bytes_from_utf8((const U8*)pv1,
6153 /* sv2 is the UTF-8 one,
6154 * if is equal it must be downgrade-able */
6155 char * const pv = (char *)bytes_from_utf8((const U8*)pv2,
6161 /* Downgrade not possible - cannot be eq */
6169 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6172 SvREFCNT_dec(svrecode);
6183 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6184 string in C<sv1> is less than, equal to, or greater than the string in
6185 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6186 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6192 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6195 const char *pv1, *pv2;
6198 SV *svrecode = Nullsv;
6205 pv1 = SvPV_const(sv1, cur1);
6212 pv2 = SvPV_const(sv2, cur2);
6214 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6215 /* Differing utf8ness.
6216 * Do not UTF8size the comparands as a side-effect. */
6219 svrecode = newSVpvn(pv2, cur2);
6220 sv_recode_to_utf8(svrecode, PL_encoding);
6221 pv2 = SvPV_const(svrecode, cur2);
6224 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6229 svrecode = newSVpvn(pv1, cur1);
6230 sv_recode_to_utf8(svrecode, PL_encoding);
6231 pv1 = SvPV_const(svrecode, cur1);
6234 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6240 cmp = cur2 ? -1 : 0;
6244 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6247 cmp = retval < 0 ? -1 : 1;
6248 } else if (cur1 == cur2) {
6251 cmp = cur1 < cur2 ? -1 : 1;
6256 SvREFCNT_dec(svrecode);
6265 =for apidoc sv_cmp_locale
6267 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6268 'use bytes' aware, handles get magic, and will coerce its args to strings
6269 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6275 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6277 #ifdef USE_LOCALE_COLLATE
6283 if (PL_collation_standard)
6287 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6289 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6291 if (!pv1 || !len1) {
6302 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6305 return retval < 0 ? -1 : 1;
6308 * When the result of collation is equality, that doesn't mean
6309 * that there are no differences -- some locales exclude some
6310 * characters from consideration. So to avoid false equalities,
6311 * we use the raw string as a tiebreaker.
6317 #endif /* USE_LOCALE_COLLATE */
6319 return sv_cmp(sv1, sv2);
6323 #ifdef USE_LOCALE_COLLATE
6326 =for apidoc sv_collxfrm
6328 Add Collate Transform magic to an SV if it doesn't already have it.
6330 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6331 scalar data of the variable, but transformed to such a format that a normal
6332 memory comparison can be used to compare the data according to the locale
6339 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6343 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6344 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6350 Safefree(mg->mg_ptr);
6351 s = SvPV_const(sv, len);
6352 if ((xf = mem_collxfrm(s, len, &xlen))) {
6353 if (SvREADONLY(sv)) {
6356 return xf + sizeof(PL_collation_ix);
6359 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6360 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6373 if (mg && mg->mg_ptr) {
6375 return mg->mg_ptr + sizeof(PL_collation_ix);
6383 #endif /* USE_LOCALE_COLLATE */
6388 Get a line from the filehandle and store it into the SV, optionally
6389 appending to the currently-stored string.
6395 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6399 register STDCHAR rslast;
6400 register STDCHAR *bp;
6406 if (SvTHINKFIRST(sv))
6407 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6408 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6410 However, perlbench says it's slower, because the existing swipe code
6411 is faster than copy on write.
6412 Swings and roundabouts. */
6413 SvUPGRADE(sv, SVt_PV);
6418 if (PerlIO_isutf8(fp)) {
6420 sv_utf8_upgrade_nomg(sv);
6421 sv_pos_u2b(sv,&append,0);
6423 } else if (SvUTF8(sv)) {
6424 SV * const tsv = NEWSV(0,0);
6425 sv_gets(tsv, fp, 0);
6426 sv_utf8_upgrade_nomg(tsv);
6427 SvCUR_set(sv,append);
6430 goto return_string_or_null;
6435 if (PerlIO_isutf8(fp))
6438 if (IN_PERL_COMPILETIME) {
6439 /* we always read code in line mode */
6443 else if (RsSNARF(PL_rs)) {
6444 /* If it is a regular disk file use size from stat() as estimate
6445 of amount we are going to read - may result in malloc-ing
6446 more memory than we realy need if layers bellow reduce
6447 size we read (e.g. CRLF or a gzip layer)
6450 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6451 const Off_t offset = PerlIO_tell(fp);
6452 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6453 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6459 else if (RsRECORD(PL_rs)) {
6463 /* Grab the size of the record we're getting */
6464 recsize = SvIV(SvRV(PL_rs));
6465 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6468 /* VMS wants read instead of fread, because fread doesn't respect */
6469 /* RMS record boundaries. This is not necessarily a good thing to be */
6470 /* doing, but we've got no other real choice - except avoid stdio
6471 as implementation - perhaps write a :vms layer ?
6473 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6475 bytesread = PerlIO_read(fp, buffer, recsize);
6479 SvCUR_set(sv, bytesread += append);
6480 buffer[bytesread] = '\0';
6481 goto return_string_or_null;
6483 else if (RsPARA(PL_rs)) {
6489 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6490 if (PerlIO_isutf8(fp)) {
6491 rsptr = SvPVutf8(PL_rs, rslen);
6494 if (SvUTF8(PL_rs)) {
6495 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6496 Perl_croak(aTHX_ "Wide character in $/");
6499 rsptr = SvPV_const(PL_rs, rslen);
6503 rslast = rslen ? rsptr[rslen - 1] : '\0';
6505 if (rspara) { /* have to do this both before and after */
6506 do { /* to make sure file boundaries work right */
6509 i = PerlIO_getc(fp);
6513 PerlIO_ungetc(fp,i);
6519 /* See if we know enough about I/O mechanism to cheat it ! */
6521 /* This used to be #ifdef test - it is made run-time test for ease
6522 of abstracting out stdio interface. One call should be cheap
6523 enough here - and may even be a macro allowing compile
6527 if (PerlIO_fast_gets(fp)) {
6530 * We're going to steal some values from the stdio struct
6531 * and put EVERYTHING in the innermost loop into registers.
6533 register STDCHAR *ptr;
6537 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6538 /* An ungetc()d char is handled separately from the regular
6539 * buffer, so we getc() it back out and stuff it in the buffer.
6541 i = PerlIO_getc(fp);
6542 if (i == EOF) return 0;
6543 *(--((*fp)->_ptr)) = (unsigned char) i;
6547 /* Here is some breathtakingly efficient cheating */
6549 cnt = PerlIO_get_cnt(fp); /* get count into register */
6550 /* make sure we have the room */
6551 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6552 /* Not room for all of it
6553 if we are looking for a separator and room for some
6555 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6556 /* just process what we have room for */
6557 shortbuffered = cnt - SvLEN(sv) + append + 1;
6558 cnt -= shortbuffered;
6562 /* remember that cnt can be negative */
6563 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6568 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6569 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6570 DEBUG_P(PerlIO_printf(Perl_debug_log,
6571 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6572 DEBUG_P(PerlIO_printf(Perl_debug_log,
6573 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6574 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6575 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6580 while (cnt > 0) { /* this | eat */
6582 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6583 goto thats_all_folks; /* screams | sed :-) */
6587 Copy(ptr, bp, cnt, char); /* this | eat */
6588 bp += cnt; /* screams | dust */
6589 ptr += cnt; /* louder | sed :-) */
6594 if (shortbuffered) { /* oh well, must extend */
6595 cnt = shortbuffered;
6597 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6599 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6600 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6604 DEBUG_P(PerlIO_printf(Perl_debug_log,
6605 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6606 PTR2UV(ptr),(long)cnt));
6607 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6609 DEBUG_P(PerlIO_printf(Perl_debug_log,
6610 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6611 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6612 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6614 /* This used to call 'filbuf' in stdio form, but as that behaves like
6615 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6616 another abstraction. */
6617 i = PerlIO_getc(fp); /* get more characters */
6619 DEBUG_P(PerlIO_printf(Perl_debug_log,
6620 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6621 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6622 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6624 cnt = PerlIO_get_cnt(fp);
6625 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6626 DEBUG_P(PerlIO_printf(Perl_debug_log,
6627 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6629 if (i == EOF) /* all done for ever? */
6630 goto thats_really_all_folks;
6632 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6634 SvGROW(sv, bpx + cnt + 2);
6635 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6637 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6639 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6640 goto thats_all_folks;
6644 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6645 memNE((char*)bp - rslen, rsptr, rslen))
6646 goto screamer; /* go back to the fray */
6647 thats_really_all_folks:
6649 cnt += shortbuffered;
6650 DEBUG_P(PerlIO_printf(Perl_debug_log,
6651 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6652 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6653 DEBUG_P(PerlIO_printf(Perl_debug_log,
6654 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6655 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6656 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6658 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6659 DEBUG_P(PerlIO_printf(Perl_debug_log,
6660 "Screamer: done, len=%ld, string=|%.*s|\n",
6661 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6665 /*The big, slow, and stupid way. */
6666 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6668 Newx(buf, 8192, STDCHAR);
6676 register const STDCHAR *bpe = buf + sizeof(buf);
6678 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6679 ; /* keep reading */
6683 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6684 /* Accomodate broken VAXC compiler, which applies U8 cast to
6685 * both args of ?: operator, causing EOF to change into 255
6688 i = (U8)buf[cnt - 1];
6694 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6696 sv_catpvn(sv, (char *) buf, cnt);
6698 sv_setpvn(sv, (char *) buf, cnt);
6700 if (i != EOF && /* joy */
6702 SvCUR(sv) < rslen ||
6703 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6707 * If we're reading from a TTY and we get a short read,
6708 * indicating that the user hit his EOF character, we need
6709 * to notice it now, because if we try to read from the TTY
6710 * again, the EOF condition will disappear.
6712 * The comparison of cnt to sizeof(buf) is an optimization
6713 * that prevents unnecessary calls to feof().
6717 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6721 #ifdef USE_HEAP_INSTEAD_OF_STACK
6726 if (rspara) { /* have to do this both before and after */
6727 while (i != EOF) { /* to make sure file boundaries work right */
6728 i = PerlIO_getc(fp);
6730 PerlIO_ungetc(fp,i);
6736 return_string_or_null:
6737 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6743 Auto-increment of the value in the SV, doing string to numeric conversion
6744 if necessary. Handles 'get' magic.
6750 Perl_sv_inc(pTHX_ register SV *sv)
6758 if (SvTHINKFIRST(sv)) {
6760 sv_force_normal_flags(sv, 0);
6761 if (SvREADONLY(sv)) {
6762 if (IN_PERL_RUNTIME)
6763 Perl_croak(aTHX_ PL_no_modify);
6767 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6769 i = PTR2IV(SvRV(sv));
6774 flags = SvFLAGS(sv);
6775 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6776 /* It's (privately or publicly) a float, but not tested as an
6777 integer, so test it to see. */
6779 flags = SvFLAGS(sv);
6781 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6782 /* It's publicly an integer, or privately an integer-not-float */
6783 #ifdef PERL_PRESERVE_IVUV
6787 if (SvUVX(sv) == UV_MAX)
6788 sv_setnv(sv, UV_MAX_P1);
6790 (void)SvIOK_only_UV(sv);
6791 SvUV_set(sv, SvUVX(sv) + 1);
6793 if (SvIVX(sv) == IV_MAX)
6794 sv_setuv(sv, (UV)IV_MAX + 1);
6796 (void)SvIOK_only(sv);
6797 SvIV_set(sv, SvIVX(sv) + 1);
6802 if (flags & SVp_NOK) {
6803 (void)SvNOK_only(sv);
6804 SvNV_set(sv, SvNVX(sv) + 1.0);
6808 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6809 if ((flags & SVTYPEMASK) < SVt_PVIV)
6810 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6811 (void)SvIOK_only(sv);
6816 while (isALPHA(*d)) d++;
6817 while (isDIGIT(*d)) d++;
6819 #ifdef PERL_PRESERVE_IVUV
6820 /* Got to punt this as an integer if needs be, but we don't issue
6821 warnings. Probably ought to make the sv_iv_please() that does
6822 the conversion if possible, and silently. */
6823 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6824 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6825 /* Need to try really hard to see if it's an integer.
6826 9.22337203685478e+18 is an integer.
6827 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6828 so $a="9.22337203685478e+18"; $a+0; $a++
6829 needs to be the same as $a="9.22337203685478e+18"; $a++
6836 /* sv_2iv *should* have made this an NV */
6837 if (flags & SVp_NOK) {
6838 (void)SvNOK_only(sv);
6839 SvNV_set(sv, SvNVX(sv) + 1.0);
6842 /* I don't think we can get here. Maybe I should assert this
6843 And if we do get here I suspect that sv_setnv will croak. NWC
6845 #if defined(USE_LONG_DOUBLE)
6846 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"PERL_PRIgldbl"\n",
6847 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6849 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6850 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6853 #endif /* PERL_PRESERVE_IVUV */
6854 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6858 while (d >= SvPVX_const(sv)) {
6866 /* MKS: The original code here died if letters weren't consecutive.
6867 * at least it didn't have to worry about non-C locales. The
6868 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6869 * arranged in order (although not consecutively) and that only
6870 * [A-Za-z] are accepted by isALPHA in the C locale.
6872 if (*d != 'z' && *d != 'Z') {
6873 do { ++*d; } while (!isALPHA(*d));
6876 *(d--) -= 'z' - 'a';
6881 *(d--) -= 'z' - 'a' + 1;
6885 /* oh,oh, the number grew */
6886 SvGROW(sv, SvCUR(sv) + 2);
6887 SvCUR_set(sv, SvCUR(sv) + 1);
6888 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
6899 Auto-decrement of the value in the SV, doing string to numeric conversion
6900 if necessary. Handles 'get' magic.
6906 Perl_sv_dec(pTHX_ register SV *sv)
6913 if (SvTHINKFIRST(sv)) {
6915 sv_force_normal_flags(sv, 0);
6916 if (SvREADONLY(sv)) {
6917 if (IN_PERL_RUNTIME)
6918 Perl_croak(aTHX_ PL_no_modify);
6922 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6924 i = PTR2IV(SvRV(sv));
6929 /* Unlike sv_inc we don't have to worry about string-never-numbers
6930 and keeping them magic. But we mustn't warn on punting */
6931 flags = SvFLAGS(sv);
6932 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6933 /* It's publicly an integer, or privately an integer-not-float */
6934 #ifdef PERL_PRESERVE_IVUV
6938 if (SvUVX(sv) == 0) {
6939 (void)SvIOK_only(sv);
6943 (void)SvIOK_only_UV(sv);
6944 SvUV_set(sv, SvUVX(sv) - 1);
6947 if (SvIVX(sv) == IV_MIN)
6948 sv_setnv(sv, (NV)IV_MIN - 1.0);
6950 (void)SvIOK_only(sv);
6951 SvIV_set(sv, SvIVX(sv) - 1);
6956 if (flags & SVp_NOK) {
6957 SvNV_set(sv, SvNVX(sv) - 1.0);
6958 (void)SvNOK_only(sv);
6961 if (!(flags & SVp_POK)) {
6962 if ((flags & SVTYPEMASK) < SVt_PVIV)
6963 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
6965 (void)SvIOK_only(sv);
6968 #ifdef PERL_PRESERVE_IVUV
6970 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6971 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6972 /* Need to try really hard to see if it's an integer.
6973 9.22337203685478e+18 is an integer.
6974 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6975 so $a="9.22337203685478e+18"; $a+0; $a--
6976 needs to be the same as $a="9.22337203685478e+18"; $a--
6983 /* sv_2iv *should* have made this an NV */
6984 if (flags & SVp_NOK) {
6985 (void)SvNOK_only(sv);
6986 SvNV_set(sv, SvNVX(sv) - 1.0);
6989 /* I don't think we can get here. Maybe I should assert this
6990 And if we do get here I suspect that sv_setnv will croak. NWC
6992 #if defined(USE_LONG_DOUBLE)
6993 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"PERL_PRIgldbl"\n",
6994 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6996 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6997 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7001 #endif /* PERL_PRESERVE_IVUV */
7002 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7006 =for apidoc sv_mortalcopy
7008 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7009 The new SV is marked as mortal. It will be destroyed "soon", either by an
7010 explicit call to FREETMPS, or by an implicit call at places such as
7011 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7016 /* Make a string that will exist for the duration of the expression
7017 * evaluation. Actually, it may have to last longer than that, but
7018 * hopefully we won't free it until it has been assigned to a
7019 * permanent location. */
7022 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7027 sv_setsv(sv,oldstr);
7029 PL_tmps_stack[++PL_tmps_ix] = sv;
7035 =for apidoc sv_newmortal
7037 Creates a new null SV which is mortal. The reference count of the SV is
7038 set to 1. It will be destroyed "soon", either by an explicit call to
7039 FREETMPS, or by an implicit call at places such as statement boundaries.
7040 See also C<sv_mortalcopy> and C<sv_2mortal>.
7046 Perl_sv_newmortal(pTHX)
7051 SvFLAGS(sv) = SVs_TEMP;
7053 PL_tmps_stack[++PL_tmps_ix] = sv;
7058 =for apidoc sv_2mortal
7060 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7061 by an explicit call to FREETMPS, or by an implicit call at places such as
7062 statement boundaries. SvTEMP() is turned on which means that the SV's
7063 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7064 and C<sv_mortalcopy>.
7070 Perl_sv_2mortal(pTHX_ register SV *sv)
7075 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7078 PL_tmps_stack[++PL_tmps_ix] = sv;
7086 Creates a new SV and copies a string into it. The reference count for the
7087 SV is set to 1. If C<len> is zero, Perl will compute the length using
7088 strlen(). For efficiency, consider using C<newSVpvn> instead.
7094 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7099 sv_setpvn(sv,s,len ? len : strlen(s));
7104 =for apidoc newSVpvn
7106 Creates a new SV and copies a string into it. The reference count for the
7107 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7108 string. You are responsible for ensuring that the source string is at least
7109 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7115 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7120 sv_setpvn(sv,s,len);
7126 =for apidoc newSVhek
7128 Creates a new SV from the hash key structure. It will generate scalars that
7129 point to the shared string table where possible. Returns a new (undefined)
7130 SV if the hek is NULL.
7136 Perl_newSVhek(pTHX_ const HEK *hek)
7145 if (HEK_LEN(hek) == HEf_SVKEY) {
7146 return newSVsv(*(SV**)HEK_KEY(hek));
7148 const int flags = HEK_FLAGS(hek);
7149 if (flags & HVhek_WASUTF8) {
7151 Andreas would like keys he put in as utf8 to come back as utf8
7153 STRLEN utf8_len = HEK_LEN(hek);
7154 const U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7155 SV * const sv = newSVpvn ((const char*)as_utf8, utf8_len);
7158 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7160 } else if (flags & HVhek_REHASH) {
7161 /* We don't have a pointer to the hv, so we have to replicate the
7162 flag into every HEK. This hv is using custom a hasing
7163 algorithm. Hence we can't return a shared string scalar, as
7164 that would contain the (wrong) hash value, and might get passed
7165 into an hv routine with a regular hash */
7167 SV * const sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7172 /* This will be overwhelminly the most common case. */
7173 return newSVpvn_share(HEK_KEY(hek),
7174 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7180 =for apidoc newSVpvn_share
7182 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7183 table. If the string does not already exist in the table, it is created
7184 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7185 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7186 otherwise the hash is computed. The idea here is that as the string table
7187 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7188 hash lookup will avoid string compare.
7194 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7197 bool is_utf8 = FALSE;
7199 STRLEN tmplen = -len;
7201 /* See the note in hv.c:hv_fetch() --jhi */
7202 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7206 PERL_HASH(hash, src, len);
7208 sv_upgrade(sv, SVt_PV);
7209 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7221 #if defined(PERL_IMPLICIT_CONTEXT)
7223 /* pTHX_ magic can't cope with varargs, so this is a no-context
7224 * version of the main function, (which may itself be aliased to us).
7225 * Don't access this version directly.
7229 Perl_newSVpvf_nocontext(const char* pat, ...)
7234 va_start(args, pat);
7235 sv = vnewSVpvf(pat, &args);
7242 =for apidoc newSVpvf
7244 Creates a new SV and initializes it with the string formatted like
7251 Perl_newSVpvf(pTHX_ const char* pat, ...)
7255 va_start(args, pat);
7256 sv = vnewSVpvf(pat, &args);
7261 /* backend for newSVpvf() and newSVpvf_nocontext() */
7264 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7268 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7275 Creates a new SV and copies a floating point value into it.
7276 The reference count for the SV is set to 1.
7282 Perl_newSVnv(pTHX_ NV n)
7294 Creates a new SV and copies an integer into it. The reference count for the
7301 Perl_newSViv(pTHX_ IV i)
7313 Creates a new SV and copies an unsigned integer into it.
7314 The reference count for the SV is set to 1.
7320 Perl_newSVuv(pTHX_ UV u)
7330 =for apidoc newRV_noinc
7332 Creates an RV wrapper for an SV. The reference count for the original
7333 SV is B<not> incremented.
7339 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7344 sv_upgrade(sv, SVt_RV);
7346 SvRV_set(sv, tmpRef);
7351 /* newRV_inc is the official function name to use now.
7352 * newRV_inc is in fact #defined to newRV in sv.h
7356 Perl_newRV(pTHX_ SV *tmpRef)
7358 return newRV_noinc(SvREFCNT_inc(tmpRef));
7364 Creates a new SV which is an exact duplicate of the original SV.
7371 Perl_newSVsv(pTHX_ register SV *old)
7377 if (SvTYPE(old) == SVTYPEMASK) {
7378 if (ckWARN_d(WARN_INTERNAL))
7379 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7383 /* SV_GMAGIC is the default for sv_setv()
7384 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7385 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7386 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7391 =for apidoc sv_reset
7393 Underlying implementation for the C<reset> Perl function.
7394 Note that the perl-level function is vaguely deprecated.
7400 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7403 char todo[PERL_UCHAR_MAX+1];
7408 if (!*s) { /* reset ?? searches */
7409 MAGIC * const mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7411 PMOP *pm = (PMOP *) mg->mg_obj;
7413 pm->op_pmdynflags &= ~PMdf_USED;
7420 /* reset variables */
7422 if (!HvARRAY(stash))
7425 Zero(todo, 256, char);
7428 I32 i = (unsigned char)*s;
7432 max = (unsigned char)*s++;
7433 for ( ; i <= max; i++) {
7436 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7438 for (entry = HvARRAY(stash)[i];
7440 entry = HeNEXT(entry))
7445 if (!todo[(U8)*HeKEY(entry)])
7447 gv = (GV*)HeVAL(entry);
7450 if (SvTHINKFIRST(sv)) {
7451 if (!SvREADONLY(sv) && SvROK(sv))
7453 /* XXX Is this continue a bug? Why should THINKFIRST
7454 exempt us from resetting arrays and hashes? */
7458 if (SvTYPE(sv) >= SVt_PV) {
7460 if (SvPVX_const(sv) != Nullch)
7468 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7470 Perl_die(aTHX_ "Can't reset %%ENV on this system");
7473 # if defined(USE_ENVIRON_ARRAY)
7476 # endif /* USE_ENVIRON_ARRAY */
7487 Using various gambits, try to get an IO from an SV: the IO slot if its a
7488 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7489 named after the PV if we're a string.
7495 Perl_sv_2io(pTHX_ SV *sv)
7500 switch (SvTYPE(sv)) {
7508 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7512 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7514 return sv_2io(SvRV(sv));
7515 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7521 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7530 Using various gambits, try to get a CV from an SV; in addition, try if
7531 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7537 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7544 return *gvp = Nullgv, Nullcv;
7545 switch (SvTYPE(sv)) {
7563 SV * const *sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7564 tryAMAGICunDEREF(to_cv);
7567 if (SvTYPE(sv) == SVt_PVCV) {
7576 Perl_croak(aTHX_ "Not a subroutine reference");
7581 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7587 if (lref && !GvCVu(gv)) {
7590 tmpsv = NEWSV(704,0);
7591 gv_efullname3(tmpsv, gv, Nullch);
7592 /* XXX this is probably not what they think they're getting.
7593 * It has the same effect as "sub name;", i.e. just a forward
7595 newSUB(start_subparse(FALSE, 0),
7596 newSVOP(OP_CONST, 0, tmpsv),
7601 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7611 Returns true if the SV has a true value by Perl's rules.
7612 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7613 instead use an in-line version.
7619 Perl_sv_true(pTHX_ register SV *sv)
7624 register const XPV* const tXpv = (XPV*)SvANY(sv);
7626 (tXpv->xpv_cur > 1 ||
7627 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7634 return SvIVX(sv) != 0;
7637 return SvNVX(sv) != 0.0;
7639 return sv_2bool(sv);
7645 =for apidoc sv_pvn_force
7647 Get a sensible string out of the SV somehow.
7648 A private implementation of the C<SvPV_force> macro for compilers which
7649 can't cope with complex macro expressions. Always use the macro instead.
7651 =for apidoc sv_pvn_force_flags
7653 Get a sensible string out of the SV somehow.
7654 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7655 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7656 implemented in terms of this function.
7657 You normally want to use the various wrapper macros instead: see
7658 C<SvPV_force> and C<SvPV_force_nomg>
7664 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7667 if (SvTHINKFIRST(sv) && !SvROK(sv))
7668 sv_force_normal_flags(sv, 0);
7678 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7679 const char * const ref = sv_reftype(sv,0);
7681 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7682 ref, OP_NAME(PL_op));
7684 Perl_croak(aTHX_ "Can't coerce readonly %s to string", ref);
7686 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM)
7687 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7689 s = sv_2pv_flags(sv, &len, flags);
7693 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7696 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7697 SvGROW(sv, len + 1);
7698 Move(s,SvPVX(sv),len,char);
7703 SvPOK_on(sv); /* validate pointer */
7705 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7706 PTR2UV(sv),SvPVX_const(sv)));
7709 return SvPVX_mutable(sv);
7713 =for apidoc sv_pvbyten_force
7715 The backend for the C<SvPVbytex_force> macro. Always use the macro instead.
7721 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7723 sv_pvn_force(sv,lp);
7724 sv_utf8_downgrade(sv,0);
7730 =for apidoc sv_pvutf8n_force
7732 The backend for the C<SvPVutf8x_force> macro. Always use the macro instead.
7738 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7740 sv_pvn_force(sv,lp);
7741 sv_utf8_upgrade(sv);
7747 =for apidoc sv_reftype
7749 Returns a string describing what the SV is a reference to.
7755 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
7757 /* The fact that I don't need to downcast to char * everywhere, only in ?:
7758 inside return suggests a const propagation bug in g++. */
7759 if (ob && SvOBJECT(sv)) {
7760 char * const name = HvNAME_get(SvSTASH(sv));
7761 return name ? name : (char *) "__ANON__";
7764 switch (SvTYPE(sv)) {
7781 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
7782 /* tied lvalues should appear to be
7783 * scalars for backwards compatitbility */
7784 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7785 ? "SCALAR" : "LVALUE");
7786 case SVt_PVAV: return "ARRAY";
7787 case SVt_PVHV: return "HASH";
7788 case SVt_PVCV: return "CODE";
7789 case SVt_PVGV: return "GLOB";
7790 case SVt_PVFM: return "FORMAT";
7791 case SVt_PVIO: return "IO";
7792 default: return "UNKNOWN";
7798 =for apidoc sv_isobject
7800 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7801 object. If the SV is not an RV, or if the object is not blessed, then this
7808 Perl_sv_isobject(pTHX_ SV *sv)
7824 Returns a boolean indicating whether the SV is blessed into the specified
7825 class. This does not check for subtypes; use C<sv_derived_from> to verify
7826 an inheritance relationship.
7832 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7843 hvname = HvNAME_get(SvSTASH(sv));
7847 return strEQ(hvname, name);
7853 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7854 it will be upgraded to one. If C<classname> is non-null then the new SV will
7855 be blessed in the specified package. The new SV is returned and its
7856 reference count is 1.
7862 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7868 SV_CHECK_THINKFIRST_COW_DROP(rv);
7871 if (SvTYPE(rv) >= SVt_PVMG) {
7872 const U32 refcnt = SvREFCNT(rv);
7876 SvREFCNT(rv) = refcnt;
7879 if (SvTYPE(rv) < SVt_RV)
7880 sv_upgrade(rv, SVt_RV);
7881 else if (SvTYPE(rv) > SVt_RV) {
7892 HV* const stash = gv_stashpv(classname, TRUE);
7893 (void)sv_bless(rv, stash);
7899 =for apidoc sv_setref_pv
7901 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7902 argument will be upgraded to an RV. That RV will be modified to point to
7903 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7904 into the SV. The C<classname> argument indicates the package for the
7905 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7906 will have a reference count of 1, and the RV will be returned.
7908 Do not use with other Perl types such as HV, AV, SV, CV, because those
7909 objects will become corrupted by the pointer copy process.
7911 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7917 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7920 sv_setsv(rv, &PL_sv_undef);
7924 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7929 =for apidoc sv_setref_iv
7931 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7932 argument will be upgraded to an RV. That RV will be modified to point to
7933 the new SV. The C<classname> argument indicates the package for the
7934 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7935 will have a reference count of 1, and the RV will be returned.
7941 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7943 sv_setiv(newSVrv(rv,classname), iv);
7948 =for apidoc sv_setref_uv
7950 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7951 argument will be upgraded to an RV. That RV will be modified to point to
7952 the new SV. The C<classname> argument indicates the package for the
7953 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7954 will have a reference count of 1, and the RV will be returned.
7960 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7962 sv_setuv(newSVrv(rv,classname), uv);
7967 =for apidoc sv_setref_nv
7969 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7970 argument will be upgraded to an RV. That RV will be modified to point to
7971 the new SV. The C<classname> argument indicates the package for the
7972 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7973 will have a reference count of 1, and the RV will be returned.
7979 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7981 sv_setnv(newSVrv(rv,classname), nv);
7986 =for apidoc sv_setref_pvn
7988 Copies a string into a new SV, optionally blessing the SV. The length of the
7989 string must be specified with C<n>. The C<rv> argument will be upgraded to
7990 an RV. That RV will be modified to point to the new SV. The C<classname>
7991 argument indicates the package for the blessing. Set C<classname> to
7992 C<Nullch> to avoid the blessing. The new SV will have a reference count
7993 of 1, and the RV will be returned.
7995 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8001 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
8003 sv_setpvn(newSVrv(rv,classname), pv, n);
8008 =for apidoc sv_bless
8010 Blesses an SV into a specified package. The SV must be an RV. The package
8011 must be designated by its stash (see C<gv_stashpv()>). The reference count
8012 of the SV is unaffected.
8018 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8022 Perl_croak(aTHX_ "Can't bless non-reference value");
8024 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8025 if (SvREADONLY(tmpRef))
8026 Perl_croak(aTHX_ PL_no_modify);
8027 if (SvOBJECT(tmpRef)) {
8028 if (SvTYPE(tmpRef) != SVt_PVIO)
8030 SvREFCNT_dec(SvSTASH(tmpRef));
8033 SvOBJECT_on(tmpRef);
8034 if (SvTYPE(tmpRef) != SVt_PVIO)
8036 SvUPGRADE(tmpRef, SVt_PVMG);
8037 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8044 if(SvSMAGICAL(tmpRef))
8045 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8053 /* Downgrades a PVGV to a PVMG.
8057 S_sv_unglob(pTHX_ SV *sv)
8061 assert(SvTYPE(sv) == SVt_PVGV);
8066 sv_del_backref((SV*)GvSTASH(sv), sv);
8067 GvSTASH(sv) = Nullhv;
8069 sv_unmagic(sv, PERL_MAGIC_glob);
8070 Safefree(GvNAME(sv));
8073 /* need to keep SvANY(sv) in the right arena */
8074 xpvmg = new_XPVMG();
8075 StructCopy(SvANY(sv), xpvmg, XPVMG);
8076 del_XPVGV(SvANY(sv));
8079 SvFLAGS(sv) &= ~SVTYPEMASK;
8080 SvFLAGS(sv) |= SVt_PVMG;
8084 =for apidoc sv_unref_flags
8086 Unsets the RV status of the SV, and decrements the reference count of
8087 whatever was being referenced by the RV. This can almost be thought of
8088 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8089 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8090 (otherwise the decrementing is conditional on the reference count being
8091 different from one or the reference being a readonly SV).
8098 Perl_sv_unref_flags(pTHX_ SV *ref, U32 flags)
8100 SV* const target = SvRV(ref);
8102 if (SvWEAKREF(ref)) {
8103 sv_del_backref(target, ref);
8105 SvRV_set(ref, NULL);
8108 SvRV_set(ref, NULL);
8110 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
8111 assigned to as BEGIN {$a = \"Foo"} will fail. */
8112 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
8113 SvREFCNT_dec(target);
8114 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8115 sv_2mortal(target); /* Schedule for freeing later */
8119 =for apidoc sv_untaint
8121 Untaint an SV. Use C<SvTAINTED_off> instead.
8126 Perl_sv_untaint(pTHX_ SV *sv)
8128 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8129 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8136 =for apidoc sv_tainted
8138 Test an SV for taintedness. Use C<SvTAINTED> instead.
8143 Perl_sv_tainted(pTHX_ SV *sv)
8145 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8146 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8147 if (mg && (mg->mg_len & 1) )
8154 =for apidoc sv_setpviv
8156 Copies an integer into the given SV, also updating its string value.
8157 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8163 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8165 char buf[TYPE_CHARS(UV)];
8167 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8169 sv_setpvn(sv, ptr, ebuf - ptr);
8173 =for apidoc sv_setpviv_mg
8175 Like C<sv_setpviv>, but also handles 'set' magic.
8181 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8187 #if defined(PERL_IMPLICIT_CONTEXT)
8189 /* pTHX_ magic can't cope with varargs, so this is a no-context
8190 * version of the main function, (which may itself be aliased to us).
8191 * Don't access this version directly.
8195 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8199 va_start(args, pat);
8200 sv_vsetpvf(sv, pat, &args);
8204 /* pTHX_ magic can't cope with varargs, so this is a no-context
8205 * version of the main function, (which may itself be aliased to us).
8206 * Don't access this version directly.
8210 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8214 va_start(args, pat);
8215 sv_vsetpvf_mg(sv, pat, &args);
8221 =for apidoc sv_setpvf
8223 Works like C<sv_catpvf> but copies the text into the SV instead of
8224 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8230 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8233 va_start(args, pat);
8234 sv_vsetpvf(sv, pat, &args);
8239 =for apidoc sv_vsetpvf
8241 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8242 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8244 Usually used via its frontend C<sv_setpvf>.
8250 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8252 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8256 =for apidoc sv_setpvf_mg
8258 Like C<sv_setpvf>, but also handles 'set' magic.
8264 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8267 va_start(args, pat);
8268 sv_vsetpvf_mg(sv, pat, &args);
8273 =for apidoc sv_vsetpvf_mg
8275 Like C<sv_vsetpvf>, but also handles 'set' magic.
8277 Usually used via its frontend C<sv_setpvf_mg>.
8283 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8285 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8289 #if defined(PERL_IMPLICIT_CONTEXT)
8291 /* pTHX_ magic can't cope with varargs, so this is a no-context
8292 * version of the main function, (which may itself be aliased to us).
8293 * Don't access this version directly.
8297 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8301 va_start(args, pat);
8302 sv_vcatpvf(sv, pat, &args);
8306 /* pTHX_ magic can't cope with varargs, so this is a no-context
8307 * version of the main function, (which may itself be aliased to us).
8308 * Don't access this version directly.
8312 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8316 va_start(args, pat);
8317 sv_vcatpvf_mg(sv, pat, &args);
8323 =for apidoc sv_catpvf
8325 Processes its arguments like C<sprintf> and appends the formatted
8326 output to an SV. If the appended data contains "wide" characters
8327 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8328 and characters >255 formatted with %c), the original SV might get
8329 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8330 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8331 valid UTF-8; if the original SV was bytes, the pattern should be too.
8336 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8339 va_start(args, pat);
8340 sv_vcatpvf(sv, pat, &args);
8345 =for apidoc sv_vcatpvf
8347 Processes its arguments like C<vsprintf> and appends the formatted output
8348 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8350 Usually used via its frontend C<sv_catpvf>.
8356 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8358 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8362 =for apidoc sv_catpvf_mg
8364 Like C<sv_catpvf>, but also handles 'set' magic.
8370 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8373 va_start(args, pat);
8374 sv_vcatpvf_mg(sv, pat, &args);
8379 =for apidoc sv_vcatpvf_mg
8381 Like C<sv_vcatpvf>, but also handles 'set' magic.
8383 Usually used via its frontend C<sv_catpvf_mg>.
8389 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8391 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8396 =for apidoc sv_vsetpvfn
8398 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8401 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8407 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8409 sv_setpvn(sv, "", 0);
8410 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8413 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8416 S_expect_number(pTHX_ char** pattern)
8419 switch (**pattern) {
8420 case '1': case '2': case '3':
8421 case '4': case '5': case '6':
8422 case '7': case '8': case '9':
8423 while (isDIGIT(**pattern))
8424 var = var * 10 + (*(*pattern)++ - '0');
8428 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8431 F0convert(NV nv, char *endbuf, STRLEN *len)
8433 const int neg = nv < 0;
8442 if (uv & 1 && uv == nv)
8443 uv--; /* Round to even */
8445 const unsigned dig = uv % 10;
8458 =for apidoc sv_vcatpvfn
8460 Processes its arguments like C<vsprintf> and appends the formatted output
8461 to an SV. Uses an array of SVs if the C style variable argument list is
8462 missing (NULL). When running with taint checks enabled, indicates via
8463 C<maybe_tainted> if results are untrustworthy (often due to the use of
8466 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8472 #define VECTORIZE_ARGS vecsv = va_arg(*args, SV*);\
8473 vecstr = (U8*)SvPV_const(vecsv,veclen);\
8474 vec_utf8 = DO_UTF8(vecsv);
8476 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8479 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8486 static const char nullstr[] = "(null)";
8488 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8489 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8491 /* Times 4: a decimal digit takes more than 3 binary digits.
8492 * NV_DIG: mantissa takes than many decimal digits.
8493 * Plus 32: Playing safe. */
8494 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8495 /* large enough for "%#.#f" --chip */
8496 /* what about long double NVs? --jhi */
8498 PERL_UNUSED_ARG(maybe_tainted);
8500 /* no matter what, this is a string now */
8501 (void)SvPV_force(sv, origlen);
8503 /* special-case "", "%s", and "%-p" (SVf - see below) */
8506 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8508 const char * const s = va_arg(*args, char*);
8509 sv_catpv(sv, s ? s : nullstr);
8511 else if (svix < svmax) {
8512 sv_catsv(sv, *svargs);
8513 if (DO_UTF8(*svargs))
8518 if (args && patlen == 3 && pat[0] == '%' &&
8519 pat[1] == '-' && pat[2] == 'p') {
8520 argsv = va_arg(*args, SV*);
8521 sv_catsv(sv, argsv);
8527 #ifndef USE_LONG_DOUBLE
8528 /* special-case "%.<number>[gf]" */
8529 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8530 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8531 unsigned digits = 0;
8535 while (*pp >= '0' && *pp <= '9')
8536 digits = 10 * digits + (*pp++ - '0');
8537 if (pp - pat == (int)patlen - 1) {
8545 /* Add check for digits != 0 because it seems that some
8546 gconverts are buggy in this case, and we don't yet have
8547 a Configure test for this. */
8548 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8549 /* 0, point, slack */
8550 Gconvert(nv, (int)digits, 0, ebuf);
8552 if (*ebuf) /* May return an empty string for digits==0 */
8555 } else if (!digits) {
8558 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8559 sv_catpvn(sv, p, l);
8565 #endif /* !USE_LONG_DOUBLE */
8567 if (!args && svix < svmax && DO_UTF8(*svargs))
8570 patend = (char*)pat + patlen;
8571 for (p = (char*)pat; p < patend; p = q) {
8574 bool vectorize = FALSE;
8575 bool vectorarg = FALSE;
8576 bool vec_utf8 = FALSE;
8582 bool has_precis = FALSE;
8585 bool is_utf8 = FALSE; /* is this item utf8? */
8586 #ifdef HAS_LDBL_SPRINTF_BUG
8587 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8588 with sfio - Allen <allens@cpan.org> */
8589 bool fix_ldbl_sprintf_bug = FALSE;
8593 U8 utf8buf[UTF8_MAXBYTES+1];
8594 STRLEN esignlen = 0;
8596 const char *eptr = Nullch;
8599 const U8 *vecstr = Null(U8*);
8606 /* we need a long double target in case HAS_LONG_DOUBLE but
8609 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8617 const char *dotstr = ".";
8618 STRLEN dotstrlen = 1;
8619 I32 efix = 0; /* explicit format parameter index */
8620 I32 ewix = 0; /* explicit width index */
8621 I32 epix = 0; /* explicit precision index */
8622 I32 evix = 0; /* explicit vector index */
8623 bool asterisk = FALSE;
8625 /* echo everything up to the next format specification */
8626 for (q = p; q < patend && *q != '%'; ++q) ;
8628 if (has_utf8 && !pat_utf8)
8629 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8631 sv_catpvn(sv, p, q - p);
8638 We allow format specification elements in this order:
8639 \d+\$ explicit format parameter index
8641 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8642 0 flag (as above): repeated to allow "v02"
8643 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8644 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8646 [%bcdefginopsuxDFOUX] format (mandatory)
8651 As of perl5.9.3, printf format checking is on by default.
8652 Internally, perl uses %p formats to provide an escape to
8653 some extended formatting. This block deals with those
8654 extensions: if it does not match, (char*)q is reset and
8655 the normal format processing code is used.
8657 Currently defined extensions are:
8658 %p include pointer address (standard)
8659 %-p (SVf) include an SV (previously %_)
8660 %-<num>p include an SV with precision <num>
8661 %1p (VDf) include a v-string (as %vd)
8662 %<num>p reserved for future extensions
8664 Robin Barker 2005-07-14
8671 EXPECT_NUMBER(q, n);
8678 argsv = va_arg(*args, SV*);
8679 eptr = SvPVx_const(argsv, elen);
8685 else if (n == vdNUMBER) { /* VDf */
8692 if (ckWARN_d(WARN_INTERNAL))
8693 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
8694 "internal %%<num>p might conflict with future printf extensions");
8700 if (EXPECT_NUMBER(q, width)) {
8741 if (EXPECT_NUMBER(q, ewix))
8750 if ((vectorarg = asterisk)) {
8763 EXPECT_NUMBER(q, width);
8769 vecsv = va_arg(*args, SV*);
8771 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8772 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8773 dotstr = SvPV_const(vecsv, dotstrlen);
8780 else if (efix ? efix <= svmax : svix < svmax) {
8781 vecsv = svargs[efix ? efix-1 : svix++];
8782 vecstr = (U8*)SvPV_const(vecsv,veclen);
8783 vec_utf8 = DO_UTF8(vecsv);
8784 /* if this is a version object, we need to return the
8785 * stringified representation (which the SvPVX_const has
8786 * already done for us), but not vectorize the args
8788 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
8790 q++; /* skip past the rest of the %vd format */
8791 eptr = (const char *) vecstr;
8805 i = va_arg(*args, int);
8807 i = (ewix ? ewix <= svmax : svix < svmax) ?
8808 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8810 width = (i < 0) ? -i : i;
8820 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8822 /* XXX: todo, support specified precision parameter */
8826 i = va_arg(*args, int);
8828 i = (ewix ? ewix <= svmax : svix < svmax)
8829 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8830 precis = (i < 0) ? 0 : i;
8835 precis = precis * 10 + (*q++ - '0');
8844 case 'I': /* Ix, I32x, and I64x */
8846 if (q[1] == '6' && q[2] == '4') {
8852 if (q[1] == '3' && q[2] == '2') {
8862 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8873 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8874 if (*(q + 1) == 'l') { /* lld, llf */
8899 argsv = (efix ? efix <= svmax : svix < svmax) ?
8900 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8907 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8909 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8911 eptr = (char*)utf8buf;
8912 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8923 if (args && !vectorize) {
8924 eptr = va_arg(*args, char*);
8926 #ifdef MACOS_TRADITIONAL
8927 /* On MacOS, %#s format is used for Pascal strings */
8932 elen = strlen(eptr);
8934 eptr = (char *)nullstr;
8935 elen = sizeof nullstr - 1;
8939 eptr = SvPVx_const(argsv, elen);
8940 if (DO_UTF8(argsv)) {
8941 if (has_precis && precis < elen) {
8943 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8946 if (width) { /* fudge width (can't fudge elen) */
8947 width += elen - sv_len_utf8(argsv);
8955 if (has_precis && elen > precis)
8962 if (alt || vectorize)
8964 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8985 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8994 esignbuf[esignlen++] = plus;
8998 case 'h': iv = (short)va_arg(*args, int); break;
8999 case 'l': iv = va_arg(*args, long); break;
9000 case 'V': iv = va_arg(*args, IV); break;
9001 default: iv = va_arg(*args, int); break;
9003 case 'q': iv = va_arg(*args, Quad_t); break;
9008 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9010 case 'h': iv = (short)tiv; break;
9011 case 'l': iv = (long)tiv; break;
9013 default: iv = tiv; break;
9015 case 'q': iv = (Quad_t)tiv; break;
9019 if ( !vectorize ) /* we already set uv above */
9024 esignbuf[esignlen++] = plus;
9028 esignbuf[esignlen++] = '-';
9071 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9082 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9083 case 'l': uv = va_arg(*args, unsigned long); break;
9084 case 'V': uv = va_arg(*args, UV); break;
9085 default: uv = va_arg(*args, unsigned); break;
9087 case 'q': uv = va_arg(*args, Uquad_t); break;
9092 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9094 case 'h': uv = (unsigned short)tuv; break;
9095 case 'l': uv = (unsigned long)tuv; break;
9097 default: uv = tuv; break;
9099 case 'q': uv = (Uquad_t)tuv; break;
9106 char *ptr = ebuf + sizeof ebuf;
9112 p = (char*)((c == 'X')
9113 ? "0123456789ABCDEF" : "0123456789abcdef");
9119 esignbuf[esignlen++] = '0';
9120 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9128 if (alt && *ptr != '0')
9137 esignbuf[esignlen++] = '0';
9138 esignbuf[esignlen++] = 'b';
9141 default: /* it had better be ten or less */
9145 } while (uv /= base);
9148 elen = (ebuf + sizeof ebuf) - ptr;
9152 zeros = precis - elen;
9153 else if (precis == 0 && elen == 1 && *eptr == '0')
9159 /* FLOATING POINT */
9162 c = 'f'; /* maybe %F isn't supported here */
9168 /* This is evil, but floating point is even more evil */
9170 /* for SV-style calling, we can only get NV
9171 for C-style calling, we assume %f is double;
9172 for simplicity we allow any of %Lf, %llf, %qf for long double
9176 #if defined(USE_LONG_DOUBLE)
9180 /* [perl #20339] - we should accept and ignore %lf rather than die */
9184 #if defined(USE_LONG_DOUBLE)
9185 intsize = args ? 0 : 'q';
9189 #if defined(HAS_LONG_DOUBLE)
9198 /* now we need (long double) if intsize == 'q', else (double) */
9199 nv = (args && !vectorize) ?
9200 #if LONG_DOUBLESIZE > DOUBLESIZE
9202 va_arg(*args, long double) :
9203 va_arg(*args, double)
9205 va_arg(*args, double)
9211 if (c != 'e' && c != 'E') {
9213 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9214 will cast our (long double) to (double) */
9215 (void)Perl_frexp(nv, &i);
9216 if (i == PERL_INT_MIN)
9217 Perl_die(aTHX_ "panic: frexp");
9219 need = BIT_DIGITS(i);
9221 need += has_precis ? precis : 6; /* known default */
9226 #ifdef HAS_LDBL_SPRINTF_BUG
9227 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9228 with sfio - Allen <allens@cpan.org> */
9231 # define MY_DBL_MAX DBL_MAX
9232 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9233 # if DOUBLESIZE >= 8
9234 # define MY_DBL_MAX 1.7976931348623157E+308L
9236 # define MY_DBL_MAX 3.40282347E+38L
9240 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9241 # define MY_DBL_MAX_BUG 1L
9243 # define MY_DBL_MAX_BUG MY_DBL_MAX
9247 # define MY_DBL_MIN DBL_MIN
9248 # else /* XXX guessing! -Allen */
9249 # if DOUBLESIZE >= 8
9250 # define MY_DBL_MIN 2.2250738585072014E-308L
9252 # define MY_DBL_MIN 1.17549435E-38L
9256 if ((intsize == 'q') && (c == 'f') &&
9257 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9259 /* it's going to be short enough that
9260 * long double precision is not needed */
9262 if ((nv <= 0L) && (nv >= -0L))
9263 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9265 /* would use Perl_fp_class as a double-check but not
9266 * functional on IRIX - see perl.h comments */
9268 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9269 /* It's within the range that a double can represent */
9270 #if defined(DBL_MAX) && !defined(DBL_MIN)
9271 if ((nv >= ((long double)1/DBL_MAX)) ||
9272 (nv <= (-(long double)1/DBL_MAX)))
9274 fix_ldbl_sprintf_bug = TRUE;
9277 if (fix_ldbl_sprintf_bug == TRUE) {
9287 # undef MY_DBL_MAX_BUG
9290 #endif /* HAS_LDBL_SPRINTF_BUG */
9292 need += 20; /* fudge factor */
9293 if (PL_efloatsize < need) {
9294 Safefree(PL_efloatbuf);
9295 PL_efloatsize = need + 20; /* more fudge */
9296 Newx(PL_efloatbuf, PL_efloatsize, char);
9297 PL_efloatbuf[0] = '\0';
9300 if ( !(width || left || plus || alt) && fill != '0'
9301 && has_precis && intsize != 'q' ) { /* Shortcuts */
9302 /* See earlier comment about buggy Gconvert when digits,
9304 if ( c == 'g' && precis) {
9305 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9306 /* May return an empty string for digits==0 */
9307 if (*PL_efloatbuf) {
9308 elen = strlen(PL_efloatbuf);
9309 goto float_converted;
9311 } else if ( c == 'f' && !precis) {
9312 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9317 char *ptr = ebuf + sizeof ebuf;
9320 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9321 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9322 if (intsize == 'q') {
9323 /* Copy the one or more characters in a long double
9324 * format before the 'base' ([efgEFG]) character to
9325 * the format string. */
9326 static char const prifldbl[] = PERL_PRIfldbl;
9327 char const *p = prifldbl + sizeof(prifldbl) - 3;
9328 while (p >= prifldbl) { *--ptr = *p--; }
9333 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9338 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9350 /* No taint. Otherwise we are in the strange situation
9351 * where printf() taints but print($float) doesn't.
9353 #if defined(HAS_LONG_DOUBLE)
9354 elen = ((intsize == 'q')
9355 ? my_sprintf(PL_efloatbuf, ptr, nv)
9356 : my_sprintf(PL_efloatbuf, ptr, (double)nv));
9358 elen = my_sprintf(PL_efloatbuf, ptr, nv);
9362 eptr = PL_efloatbuf;
9368 i = SvCUR(sv) - origlen;
9369 if (args && !vectorize) {
9371 case 'h': *(va_arg(*args, short*)) = i; break;
9372 default: *(va_arg(*args, int*)) = i; break;
9373 case 'l': *(va_arg(*args, long*)) = i; break;
9374 case 'V': *(va_arg(*args, IV*)) = i; break;
9376 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9381 sv_setuv_mg(argsv, (UV)i);
9383 continue; /* not "break" */
9390 && (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)
9391 && ckWARN(WARN_PRINTF))
9393 SV * const msg = sv_newmortal();
9394 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9395 (PL_op->op_type == OP_PRTF) ? "" : "s");
9398 Perl_sv_catpvf(aTHX_ msg,
9399 "\"%%%c\"", c & 0xFF);
9401 Perl_sv_catpvf(aTHX_ msg,
9402 "\"%%\\%03"UVof"\"",
9405 sv_catpv(msg, "end of string");
9406 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9409 /* output mangled stuff ... */
9415 /* ... right here, because formatting flags should not apply */
9416 SvGROW(sv, SvCUR(sv) + elen + 1);
9418 Copy(eptr, p, elen, char);
9421 SvCUR_set(sv, p - SvPVX_const(sv));
9423 continue; /* not "break" */
9426 /* calculate width before utf8_upgrade changes it */
9427 have = esignlen + zeros + elen;
9429 if (is_utf8 != has_utf8) {
9432 sv_utf8_upgrade(sv);
9435 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
9436 sv_utf8_upgrade(nsv);
9437 eptr = SvPVX_const(nsv);
9440 SvGROW(sv, SvCUR(sv) + elen + 1);
9445 need = (have > width ? have : width);
9448 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9450 if (esignlen && fill == '0') {
9452 for (i = 0; i < (int)esignlen; i++)
9456 memset(p, fill, gap);
9459 if (esignlen && fill != '0') {
9461 for (i = 0; i < (int)esignlen; i++)
9466 for (i = zeros; i; i--)
9470 Copy(eptr, p, elen, char);
9474 memset(p, ' ', gap);
9479 Copy(dotstr, p, dotstrlen, char);
9483 vectorize = FALSE; /* done iterating over vecstr */
9490 SvCUR_set(sv, p - SvPVX_const(sv));
9498 /* =========================================================================
9500 =head1 Cloning an interpreter
9502 All the macros and functions in this section are for the private use of
9503 the main function, perl_clone().
9505 The foo_dup() functions make an exact copy of an existing foo thinngy.
9506 During the course of a cloning, a hash table is used to map old addresses
9507 to new addresses. The table is created and manipulated with the
9508 ptr_table_* functions.
9512 ============================================================================*/
9515 #if defined(USE_ITHREADS)
9517 #ifndef GpREFCNT_inc
9518 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9522 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9523 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9524 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9525 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9526 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9527 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9528 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9529 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9530 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9531 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9532 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9533 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9534 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9537 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9538 regcomp.c. AMS 20010712 */
9541 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
9546 struct reg_substr_datum *s;
9549 return (REGEXP *)NULL;
9551 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9554 len = r->offsets[0];
9555 npar = r->nparens+1;
9557 Newxc(ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9558 Copy(r->program, ret->program, len+1, regnode);
9560 Newx(ret->startp, npar, I32);
9561 Copy(r->startp, ret->startp, npar, I32);
9562 Newx(ret->endp, npar, I32);
9563 Copy(r->startp, ret->startp, npar, I32);
9565 Newx(ret->substrs, 1, struct reg_substr_data);
9566 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9567 s->min_offset = r->substrs->data[i].min_offset;
9568 s->max_offset = r->substrs->data[i].max_offset;
9569 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9570 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9573 ret->regstclass = NULL;
9576 const int count = r->data->count;
9579 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
9580 char, struct reg_data);
9581 Newx(d->what, count, U8);
9584 for (i = 0; i < count; i++) {
9585 d->what[i] = r->data->what[i];
9586 switch (d->what[i]) {
9587 /* legal options are one of: sfpont
9588 see also regcomp.h and pregfree() */
9590 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9593 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9596 /* This is cheating. */
9597 Newx(d->data[i], 1, struct regnode_charclass_class);
9598 StructCopy(r->data->data[i], d->data[i],
9599 struct regnode_charclass_class);
9600 ret->regstclass = (regnode*)d->data[i];
9603 /* Compiled op trees are readonly, and can thus be
9604 shared without duplication. */
9606 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9610 d->data[i] = r->data->data[i];
9613 d->data[i] = r->data->data[i];
9615 ((reg_trie_data*)d->data[i])->refcount++;
9619 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9628 Newx(ret->offsets, 2*len+1, U32);
9629 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9631 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9632 ret->refcnt = r->refcnt;
9633 ret->minlen = r->minlen;
9634 ret->prelen = r->prelen;
9635 ret->nparens = r->nparens;
9636 ret->lastparen = r->lastparen;
9637 ret->lastcloseparen = r->lastcloseparen;
9638 ret->reganch = r->reganch;
9640 ret->sublen = r->sublen;
9642 if (RX_MATCH_COPIED(ret))
9643 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9645 ret->subbeg = Nullch;
9646 #ifdef PERL_OLD_COPY_ON_WRITE
9647 ret->saved_copy = Nullsv;
9650 ptr_table_store(PL_ptr_table, r, ret);
9654 /* duplicate a file handle */
9657 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9661 PERL_UNUSED_ARG(type);
9664 return (PerlIO*)NULL;
9666 /* look for it in the table first */
9667 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9671 /* create anew and remember what it is */
9672 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9673 ptr_table_store(PL_ptr_table, fp, ret);
9677 /* duplicate a directory handle */
9680 Perl_dirp_dup(pTHX_ DIR *dp)
9688 /* duplicate a typeglob */
9691 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9696 /* look for it in the table first */
9697 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9701 /* create anew and remember what it is */
9703 ptr_table_store(PL_ptr_table, gp, ret);
9706 ret->gp_refcnt = 0; /* must be before any other dups! */
9707 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9708 ret->gp_io = io_dup_inc(gp->gp_io, param);
9709 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9710 ret->gp_av = av_dup_inc(gp->gp_av, param);
9711 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9712 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9713 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9714 ret->gp_cvgen = gp->gp_cvgen;
9715 ret->gp_line = gp->gp_line;
9716 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9720 /* duplicate a chain of magic */
9723 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9725 MAGIC *mgprev = (MAGIC*)NULL;
9728 return (MAGIC*)NULL;
9729 /* look for it in the table first */
9730 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9734 for (; mg; mg = mg->mg_moremagic) {
9736 Newxz(nmg, 1, MAGIC);
9738 mgprev->mg_moremagic = nmg;
9741 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9742 nmg->mg_private = mg->mg_private;
9743 nmg->mg_type = mg->mg_type;
9744 nmg->mg_flags = mg->mg_flags;
9745 if (mg->mg_type == PERL_MAGIC_qr) {
9746 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9748 else if(mg->mg_type == PERL_MAGIC_backref) {
9749 const AV * const av = (AV*) mg->mg_obj;
9752 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
9754 for (i = AvFILLp(av); i >= 0; i--) {
9755 if (!svp[i]) continue;
9756 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9759 else if (mg->mg_type == PERL_MAGIC_symtab) {
9760 nmg->mg_obj = mg->mg_obj;
9763 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9764 ? sv_dup_inc(mg->mg_obj, param)
9765 : sv_dup(mg->mg_obj, param);
9767 nmg->mg_len = mg->mg_len;
9768 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9769 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9770 if (mg->mg_len > 0) {
9771 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9772 if (mg->mg_type == PERL_MAGIC_overload_table &&
9773 AMT_AMAGIC((AMT*)mg->mg_ptr))
9775 AMT * const amtp = (AMT*)mg->mg_ptr;
9776 AMT * const namtp = (AMT*)nmg->mg_ptr;
9778 for (i = 1; i < NofAMmeth; i++) {
9779 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9783 else if (mg->mg_len == HEf_SVKEY)
9784 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9786 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9787 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9794 /* create a new pointer-mapping table */
9797 Perl_ptr_table_new(pTHX)
9800 Newxz(tbl, 1, PTR_TBL_t);
9803 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9808 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
9810 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
9814 we use the PTE_SVSLOT 'reservation' made above, both here (in the
9815 following define) and at call to new_body_inline made below in
9816 Perl_ptr_table_store()
9819 #define del_pte(p) del_body_type(p, PTE_SVSLOT)
9821 /* map an existing pointer using a table */
9824 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
9826 PTR_TBL_ENT_t *tblent;
9827 const UV hash = PTR_TABLE_HASH(sv);
9829 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9830 for (; tblent; tblent = tblent->next) {
9831 if (tblent->oldval == sv)
9832 return tblent->newval;
9837 /* add a new entry to a pointer-mapping table */
9840 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldsv, void *newsv)
9842 PTR_TBL_ENT_t *tblent, **otblent;
9843 /* XXX this may be pessimal on platforms where pointers aren't good
9844 * hash values e.g. if they grow faster in the most significant
9846 const UV hash = PTR_TABLE_HASH(oldsv);
9850 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9851 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
9852 if (tblent->oldval == oldsv) {
9853 tblent->newval = newsv;
9857 new_body_inline(tblent, &PL_body_roots[PTE_SVSLOT],
9858 sizeof(struct ptr_tbl_ent), PTE_SVSLOT);
9859 tblent->oldval = oldsv;
9860 tblent->newval = newsv;
9861 tblent->next = *otblent;
9864 if (!empty && tbl->tbl_items > tbl->tbl_max)
9865 ptr_table_split(tbl);
9868 /* double the hash bucket size of an existing ptr table */
9871 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9873 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9874 const UV oldsize = tbl->tbl_max + 1;
9875 UV newsize = oldsize * 2;
9878 Renew(ary, newsize, PTR_TBL_ENT_t*);
9879 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9880 tbl->tbl_max = --newsize;
9882 for (i=0; i < oldsize; i++, ary++) {
9883 PTR_TBL_ENT_t **curentp, **entp, *ent;
9886 curentp = ary + oldsize;
9887 for (entp = ary, ent = *ary; ent; ent = *entp) {
9888 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
9890 ent->next = *curentp;
9900 /* remove all the entries from a ptr table */
9903 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9905 register PTR_TBL_ENT_t **array;
9906 register PTR_TBL_ENT_t *entry;
9910 if (!tbl || !tbl->tbl_items) {
9914 array = tbl->tbl_ary;
9920 PTR_TBL_ENT_t *oentry = entry;
9921 entry = entry->next;
9925 if (++riter > max) {
9928 entry = array[riter];
9935 /* clear and free a ptr table */
9938 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9943 ptr_table_clear(tbl);
9944 Safefree(tbl->tbl_ary);
9950 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9953 SvRV_set(dstr, SvWEAKREF(sstr)
9954 ? sv_dup(SvRV(sstr), param)
9955 : sv_dup_inc(SvRV(sstr), param));
9958 else if (SvPVX_const(sstr)) {
9959 /* Has something there */
9961 /* Normal PV - clone whole allocated space */
9962 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
9963 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9964 /* Not that normal - actually sstr is copy on write.
9965 But we are a true, independant SV, so: */
9966 SvREADONLY_off(dstr);
9971 /* Special case - not normally malloced for some reason */
9972 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
9973 /* A "shared" PV - clone it as "shared" PV */
9975 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
9979 /* Some other special case - random pointer */
9980 SvPV_set(dstr, SvPVX(sstr));
9986 if (SvTYPE(dstr) == SVt_RV)
9987 SvRV_set(dstr, NULL);
9993 /* duplicate an SV of any type (including AV, HV etc) */
9996 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10001 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10003 /* look for it in the table first */
10004 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10008 if(param->flags & CLONEf_JOIN_IN) {
10009 /** We are joining here so we don't want do clone
10010 something that is bad **/
10011 const char *hvname;
10013 if(SvTYPE(sstr) == SVt_PVHV &&
10014 (hvname = HvNAME_get(sstr))) {
10015 /** don't clone stashes if they already exist **/
10016 return (SV*)gv_stashpv(hvname,0);
10020 /* create anew and remember what it is */
10023 #ifdef DEBUG_LEAKING_SCALARS
10024 dstr->sv_debug_optype = sstr->sv_debug_optype;
10025 dstr->sv_debug_line = sstr->sv_debug_line;
10026 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10027 dstr->sv_debug_cloned = 1;
10029 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10031 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10035 ptr_table_store(PL_ptr_table, sstr, dstr);
10038 SvFLAGS(dstr) = SvFLAGS(sstr);
10039 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10040 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10043 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10044 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10045 PL_watch_pvx, SvPVX_const(sstr));
10048 /* don't clone objects whose class has asked us not to */
10049 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10050 SvFLAGS(dstr) &= ~SVTYPEMASK;
10051 SvOBJECT_off(dstr);
10055 switch (SvTYPE(sstr)) {
10057 SvANY(dstr) = NULL;
10060 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10061 SvIV_set(dstr, SvIVX(sstr));
10064 SvANY(dstr) = new_XNV();
10065 SvNV_set(dstr, SvNVX(sstr));
10068 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10069 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10073 /* These are all the types that need complex bodies allocating. */
10074 size_t new_body_length;
10075 size_t new_body_offset = 0;
10076 void **new_body_arena;
10077 void **new_body_arenaroot;
10079 svtype sv_type = SvTYPE(sstr);
10083 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
10088 new_body = new_XPVIO();
10089 new_body_length = sizeof(XPVIO);
10092 new_body = new_XPVFM();
10093 new_body_length = sizeof(XPVFM);
10097 new_body_arena = &PL_body_roots[SVt_PVHV];
10098 new_body_arenaroot = &PL_body_arenaroots[SVt_PVHV];
10099 new_body_offset = - bodies_by_type[SVt_PVHV].offset;
10101 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10102 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10106 new_body_arena = &PL_body_roots[SVt_PVAV];
10107 new_body_arenaroot = &PL_body_arenaroots[SVt_PVAV];
10108 new_body_offset = - bodies_by_type[SVt_PVAV].offset;
10110 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10111 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10115 if (GvUNIQUE((GV*)sstr)) {
10116 /* Do sharing here, and fall through */
10123 new_body_length = bodies_by_type[sv_type].size;
10124 new_body_arena = &PL_body_roots[sv_type];
10125 new_body_arenaroot = &PL_body_arenaroots[sv_type];
10129 new_body_offset = - bodies_by_type[SVt_PVIV].offset;
10130 new_body_length = sizeof(XPVIV) - new_body_offset;
10131 new_body_arena = &PL_body_roots[SVt_PVIV];
10132 new_body_arenaroot = &PL_body_arenaroots[SVt_PVIV];
10135 new_body_offset = - bodies_by_type[SVt_PV].offset;
10136 new_body_length = sizeof(XPV) - new_body_offset;
10137 new_body_arena = &PL_body_roots[SVt_PV];
10138 new_body_arenaroot = &PL_body_arenaroots[SVt_PV];
10140 assert(new_body_length);
10142 new_body_inline(new_body, new_body_arena,
10143 new_body_length, SvTYPE(sstr));
10145 new_body = (void*)((char*)new_body - new_body_offset);
10147 /* We always allocated the full length item with PURIFY */
10148 new_body_length += new_body_offset;
10149 new_body_offset = 0;
10150 new_body = my_safemalloc(new_body_length);
10154 SvANY(dstr) = new_body;
10156 Copy(((char*)SvANY(sstr)) + new_body_offset,
10157 ((char*)SvANY(dstr)) + new_body_offset,
10158 new_body_length, char);
10160 if (SvTYPE(sstr) != SVt_PVAV && SvTYPE(sstr) != SVt_PVHV)
10161 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10163 /* The Copy above means that all the source (unduplicated) pointers
10164 are now in the destination. We can check the flags and the
10165 pointers in either, but it's possible that there's less cache
10166 missing by always going for the destination.
10167 FIXME - instrument and check that assumption */
10168 if (SvTYPE(sstr) >= SVt_PVMG) {
10170 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
10172 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
10175 switch (SvTYPE(sstr)) {
10187 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
10188 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
10189 LvTARG(dstr) = dstr;
10190 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
10191 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
10193 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
10196 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
10197 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
10198 /* Don't call sv_add_backref here as it's going to be created
10199 as part of the magic cloning of the symbol table. */
10200 GvGP(dstr) = gp_dup(GvGP(dstr), param);
10201 (void)GpREFCNT_inc(GvGP(dstr));
10204 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
10205 if (IoOFP(dstr) == IoIFP(sstr))
10206 IoOFP(dstr) = IoIFP(dstr);
10208 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
10209 /* PL_rsfp_filters entries have fake IoDIRP() */
10210 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
10211 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
10212 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
10213 /* I have no idea why fake dirp (rsfps)
10214 should be treated differently but otherwise
10215 we end up with leaks -- sky*/
10216 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
10217 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
10218 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
10220 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
10221 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
10222 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
10224 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
10225 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
10226 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
10229 if (AvARRAY((AV*)sstr)) {
10230 SV **dst_ary, **src_ary;
10231 SSize_t items = AvFILLp((AV*)sstr) + 1;
10233 src_ary = AvARRAY((AV*)sstr);
10234 Newxz(dst_ary, AvMAX((AV*)sstr)+1, SV*);
10235 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10236 SvPV_set(dstr, (char*)dst_ary);
10237 AvALLOC((AV*)dstr) = dst_ary;
10238 if (AvREAL((AV*)sstr)) {
10239 while (items-- > 0)
10240 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10243 while (items-- > 0)
10244 *dst_ary++ = sv_dup(*src_ary++, param);
10246 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10247 while (items-- > 0) {
10248 *dst_ary++ = &PL_sv_undef;
10252 SvPV_set(dstr, Nullch);
10253 AvALLOC((AV*)dstr) = (SV**)NULL;
10260 if (HvARRAY((HV*)sstr)) {
10262 const bool sharekeys = !!HvSHAREKEYS(sstr);
10263 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10264 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10266 Newx(darray, PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10267 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
10269 HvARRAY(dstr) = (HE**)darray;
10270 while (i <= sxhv->xhv_max) {
10271 const HE *source = HvARRAY(sstr)[i];
10272 HvARRAY(dstr)[i] = source
10273 ? he_dup(source, sharekeys, param) : 0;
10277 struct xpvhv_aux *saux = HvAUX(sstr);
10278 struct xpvhv_aux *daux = HvAUX(dstr);
10279 /* This flag isn't copied. */
10280 /* SvOOK_on(hv) attacks the IV flags. */
10281 SvFLAGS(dstr) |= SVf_OOK;
10283 hvname = saux->xhv_name;
10285 = hvname ? hek_dup(hvname, param) : hvname;
10287 daux->xhv_riter = saux->xhv_riter;
10288 daux->xhv_eiter = saux->xhv_eiter
10289 ? he_dup(saux->xhv_eiter,
10290 (bool)!!HvSHAREKEYS(sstr), param) : 0;
10294 SvPV_set(dstr, Nullch);
10296 /* Record stashes for possible cloning in Perl_clone(). */
10298 av_push(param->stashes, dstr);
10303 /* NOTE: not refcounted */
10304 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
10306 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
10308 if (CvCONST(dstr)) {
10309 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
10310 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
10311 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
10313 /* don't dup if copying back - CvGV isn't refcounted, so the
10314 * duped GV may never be freed. A bit of a hack! DAPM */
10315 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10316 Nullgv : gv_dup(CvGV(dstr), param) ;
10317 if (!(param->flags & CLONEf_COPY_STACKS)) {
10320 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10322 CvWEAKOUTSIDE(sstr)
10323 ? cv_dup( CvOUTSIDE(dstr), param)
10324 : cv_dup_inc(CvOUTSIDE(dstr), param);
10326 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
10332 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10338 /* duplicate a context */
10341 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10343 PERL_CONTEXT *ncxs;
10346 return (PERL_CONTEXT*)NULL;
10348 /* look for it in the table first */
10349 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10353 /* create anew and remember what it is */
10354 Newxz(ncxs, max + 1, PERL_CONTEXT);
10355 ptr_table_store(PL_ptr_table, cxs, ncxs);
10358 PERL_CONTEXT *cx = &cxs[ix];
10359 PERL_CONTEXT *ncx = &ncxs[ix];
10360 ncx->cx_type = cx->cx_type;
10361 if (CxTYPE(cx) == CXt_SUBST) {
10362 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10365 ncx->blk_oldsp = cx->blk_oldsp;
10366 ncx->blk_oldcop = cx->blk_oldcop;
10367 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10368 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10369 ncx->blk_oldpm = cx->blk_oldpm;
10370 ncx->blk_gimme = cx->blk_gimme;
10371 switch (CxTYPE(cx)) {
10373 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10374 ? cv_dup_inc(cx->blk_sub.cv, param)
10375 : cv_dup(cx->blk_sub.cv,param));
10376 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10377 ? av_dup_inc(cx->blk_sub.argarray, param)
10379 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10380 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10381 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10382 ncx->blk_sub.lval = cx->blk_sub.lval;
10383 ncx->blk_sub.retop = cx->blk_sub.retop;
10386 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10387 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10388 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10389 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10390 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10391 ncx->blk_eval.retop = cx->blk_eval.retop;
10394 ncx->blk_loop.label = cx->blk_loop.label;
10395 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10396 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10397 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10398 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10399 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10400 ? cx->blk_loop.iterdata
10401 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10402 ncx->blk_loop.oldcomppad
10403 = (PAD*)ptr_table_fetch(PL_ptr_table,
10404 cx->blk_loop.oldcomppad);
10405 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10406 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10407 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10408 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10409 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10412 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10413 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10414 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10415 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10416 ncx->blk_sub.retop = cx->blk_sub.retop;
10428 /* duplicate a stack info structure */
10431 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10436 return (PERL_SI*)NULL;
10438 /* look for it in the table first */
10439 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10443 /* create anew and remember what it is */
10444 Newxz(nsi, 1, PERL_SI);
10445 ptr_table_store(PL_ptr_table, si, nsi);
10447 nsi->si_stack = av_dup_inc(si->si_stack, param);
10448 nsi->si_cxix = si->si_cxix;
10449 nsi->si_cxmax = si->si_cxmax;
10450 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10451 nsi->si_type = si->si_type;
10452 nsi->si_prev = si_dup(si->si_prev, param);
10453 nsi->si_next = si_dup(si->si_next, param);
10454 nsi->si_markoff = si->si_markoff;
10459 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10460 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10461 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10462 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10463 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10464 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10465 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10466 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10467 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10468 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10469 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10470 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10471 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10472 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10475 #define pv_dup_inc(p) SAVEPV(p)
10476 #define pv_dup(p) SAVEPV(p)
10477 #define svp_dup_inc(p,pp) any_dup(p,pp)
10479 /* map any object to the new equivent - either something in the
10480 * ptr table, or something in the interpreter structure
10484 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
10489 return (void*)NULL;
10491 /* look for it in the table first */
10492 ret = ptr_table_fetch(PL_ptr_table, v);
10496 /* see if it is part of the interpreter structure */
10497 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10498 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10506 /* duplicate the save stack */
10509 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10511 ANY * const ss = proto_perl->Tsavestack;
10512 const I32 max = proto_perl->Tsavestack_max;
10513 I32 ix = proto_perl->Tsavestack_ix;
10525 void (*dptr) (void*);
10526 void (*dxptr) (pTHX_ void*);
10528 Newxz(nss, max, ANY);
10531 I32 i = POPINT(ss,ix);
10532 TOPINT(nss,ix) = i;
10534 case SAVEt_ITEM: /* normal string */
10535 sv = (SV*)POPPTR(ss,ix);
10536 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10537 sv = (SV*)POPPTR(ss,ix);
10538 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10540 case SAVEt_SV: /* scalar reference */
10541 sv = (SV*)POPPTR(ss,ix);
10542 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10543 gv = (GV*)POPPTR(ss,ix);
10544 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10546 case SAVEt_GENERIC_PVREF: /* generic char* */
10547 c = (char*)POPPTR(ss,ix);
10548 TOPPTR(nss,ix) = pv_dup(c);
10549 ptr = POPPTR(ss,ix);
10550 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10552 case SAVEt_SHARED_PVREF: /* char* in shared space */
10553 c = (char*)POPPTR(ss,ix);
10554 TOPPTR(nss,ix) = savesharedpv(c);
10555 ptr = POPPTR(ss,ix);
10556 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10558 case SAVEt_GENERIC_SVREF: /* generic sv */
10559 case SAVEt_SVREF: /* scalar reference */
10560 sv = (SV*)POPPTR(ss,ix);
10561 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10562 ptr = POPPTR(ss,ix);
10563 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10565 case SAVEt_AV: /* array reference */
10566 av = (AV*)POPPTR(ss,ix);
10567 TOPPTR(nss,ix) = av_dup_inc(av, param);
10568 gv = (GV*)POPPTR(ss,ix);
10569 TOPPTR(nss,ix) = gv_dup(gv, param);
10571 case SAVEt_HV: /* hash reference */
10572 hv = (HV*)POPPTR(ss,ix);
10573 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10574 gv = (GV*)POPPTR(ss,ix);
10575 TOPPTR(nss,ix) = gv_dup(gv, param);
10577 case SAVEt_INT: /* int reference */
10578 ptr = POPPTR(ss,ix);
10579 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10580 intval = (int)POPINT(ss,ix);
10581 TOPINT(nss,ix) = intval;
10583 case SAVEt_LONG: /* long reference */
10584 ptr = POPPTR(ss,ix);
10585 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10586 longval = (long)POPLONG(ss,ix);
10587 TOPLONG(nss,ix) = longval;
10589 case SAVEt_I32: /* I32 reference */
10590 case SAVEt_I16: /* I16 reference */
10591 case SAVEt_I8: /* I8 reference */
10592 ptr = POPPTR(ss,ix);
10593 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10595 TOPINT(nss,ix) = i;
10597 case SAVEt_IV: /* IV reference */
10598 ptr = POPPTR(ss,ix);
10599 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10601 TOPIV(nss,ix) = iv;
10603 case SAVEt_SPTR: /* SV* reference */
10604 ptr = POPPTR(ss,ix);
10605 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10606 sv = (SV*)POPPTR(ss,ix);
10607 TOPPTR(nss,ix) = sv_dup(sv, param);
10609 case SAVEt_VPTR: /* random* reference */
10610 ptr = POPPTR(ss,ix);
10611 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10612 ptr = POPPTR(ss,ix);
10613 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10615 case SAVEt_PPTR: /* char* reference */
10616 ptr = POPPTR(ss,ix);
10617 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10618 c = (char*)POPPTR(ss,ix);
10619 TOPPTR(nss,ix) = pv_dup(c);
10621 case SAVEt_HPTR: /* HV* reference */
10622 ptr = POPPTR(ss,ix);
10623 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10624 hv = (HV*)POPPTR(ss,ix);
10625 TOPPTR(nss,ix) = hv_dup(hv, param);
10627 case SAVEt_APTR: /* AV* reference */
10628 ptr = POPPTR(ss,ix);
10629 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10630 av = (AV*)POPPTR(ss,ix);
10631 TOPPTR(nss,ix) = av_dup(av, param);
10634 gv = (GV*)POPPTR(ss,ix);
10635 TOPPTR(nss,ix) = gv_dup(gv, param);
10637 case SAVEt_GP: /* scalar reference */
10638 gp = (GP*)POPPTR(ss,ix);
10639 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10640 (void)GpREFCNT_inc(gp);
10641 gv = (GV*)POPPTR(ss,ix);
10642 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10643 c = (char*)POPPTR(ss,ix);
10644 TOPPTR(nss,ix) = pv_dup(c);
10646 TOPIV(nss,ix) = iv;
10648 TOPIV(nss,ix) = iv;
10651 case SAVEt_MORTALIZESV:
10652 sv = (SV*)POPPTR(ss,ix);
10653 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10656 ptr = POPPTR(ss,ix);
10657 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10658 /* these are assumed to be refcounted properly */
10660 switch (((OP*)ptr)->op_type) {
10662 case OP_LEAVESUBLV:
10666 case OP_LEAVEWRITE:
10667 TOPPTR(nss,ix) = ptr;
10672 TOPPTR(nss,ix) = Nullop;
10677 TOPPTR(nss,ix) = Nullop;
10680 c = (char*)POPPTR(ss,ix);
10681 TOPPTR(nss,ix) = pv_dup_inc(c);
10683 case SAVEt_CLEARSV:
10684 longval = POPLONG(ss,ix);
10685 TOPLONG(nss,ix) = longval;
10688 hv = (HV*)POPPTR(ss,ix);
10689 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10690 c = (char*)POPPTR(ss,ix);
10691 TOPPTR(nss,ix) = pv_dup_inc(c);
10693 TOPINT(nss,ix) = i;
10695 case SAVEt_DESTRUCTOR:
10696 ptr = POPPTR(ss,ix);
10697 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10698 dptr = POPDPTR(ss,ix);
10699 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
10700 any_dup(FPTR2DPTR(void *, dptr),
10703 case SAVEt_DESTRUCTOR_X:
10704 ptr = POPPTR(ss,ix);
10705 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10706 dxptr = POPDXPTR(ss,ix);
10707 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
10708 any_dup(FPTR2DPTR(void *, dxptr),
10711 case SAVEt_REGCONTEXT:
10714 TOPINT(nss,ix) = i;
10717 case SAVEt_STACK_POS: /* Position on Perl stack */
10719 TOPINT(nss,ix) = i;
10721 case SAVEt_AELEM: /* array element */
10722 sv = (SV*)POPPTR(ss,ix);
10723 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10725 TOPINT(nss,ix) = i;
10726 av = (AV*)POPPTR(ss,ix);
10727 TOPPTR(nss,ix) = av_dup_inc(av, param);
10729 case SAVEt_HELEM: /* hash element */
10730 sv = (SV*)POPPTR(ss,ix);
10731 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10732 sv = (SV*)POPPTR(ss,ix);
10733 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10734 hv = (HV*)POPPTR(ss,ix);
10735 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10738 ptr = POPPTR(ss,ix);
10739 TOPPTR(nss,ix) = ptr;
10743 TOPINT(nss,ix) = i;
10745 case SAVEt_COMPPAD:
10746 av = (AV*)POPPTR(ss,ix);
10747 TOPPTR(nss,ix) = av_dup(av, param);
10750 longval = (long)POPLONG(ss,ix);
10751 TOPLONG(nss,ix) = longval;
10752 ptr = POPPTR(ss,ix);
10753 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10754 sv = (SV*)POPPTR(ss,ix);
10755 TOPPTR(nss,ix) = sv_dup(sv, param);
10758 ptr = POPPTR(ss,ix);
10759 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10760 longval = (long)POPBOOL(ss,ix);
10761 TOPBOOL(nss,ix) = (bool)longval;
10763 case SAVEt_SET_SVFLAGS:
10765 TOPINT(nss,ix) = i;
10767 TOPINT(nss,ix) = i;
10768 sv = (SV*)POPPTR(ss,ix);
10769 TOPPTR(nss,ix) = sv_dup(sv, param);
10772 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10780 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
10781 * flag to the result. This is done for each stash before cloning starts,
10782 * so we know which stashes want their objects cloned */
10785 do_mark_cloneable_stash(pTHX_ SV *sv)
10787 const HEK * const hvname = HvNAME_HEK((HV*)sv);
10789 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
10790 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
10791 if (cloner && GvCV(cloner)) {
10798 XPUSHs(sv_2mortal(newSVhek(hvname)));
10800 call_sv((SV*)GvCV(cloner), G_SCALAR);
10807 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
10815 =for apidoc perl_clone
10817 Create and return a new interpreter by cloning the current one.
10819 perl_clone takes these flags as parameters:
10821 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10822 without it we only clone the data and zero the stacks,
10823 with it we copy the stacks and the new perl interpreter is
10824 ready to run at the exact same point as the previous one.
10825 The pseudo-fork code uses COPY_STACKS while the
10826 threads->new doesn't.
10828 CLONEf_KEEP_PTR_TABLE
10829 perl_clone keeps a ptr_table with the pointer of the old
10830 variable as a key and the new variable as a value,
10831 this allows it to check if something has been cloned and not
10832 clone it again but rather just use the value and increase the
10833 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10834 the ptr_table using the function
10835 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10836 reason to keep it around is if you want to dup some of your own
10837 variable who are outside the graph perl scans, example of this
10838 code is in threads.xs create
10841 This is a win32 thing, it is ignored on unix, it tells perls
10842 win32host code (which is c++) to clone itself, this is needed on
10843 win32 if you want to run two threads at the same time,
10844 if you just want to do some stuff in a separate perl interpreter
10845 and then throw it away and return to the original one,
10846 you don't need to do anything.
10851 /* XXX the above needs expanding by someone who actually understands it ! */
10852 EXTERN_C PerlInterpreter *
10853 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10856 perl_clone(PerlInterpreter *proto_perl, UV flags)
10859 #ifdef PERL_IMPLICIT_SYS
10861 /* perlhost.h so we need to call into it
10862 to clone the host, CPerlHost should have a c interface, sky */
10864 if (flags & CLONEf_CLONE_HOST) {
10865 return perl_clone_host(proto_perl,flags);
10867 return perl_clone_using(proto_perl, flags,
10869 proto_perl->IMemShared,
10870 proto_perl->IMemParse,
10872 proto_perl->IStdIO,
10876 proto_perl->IProc);
10880 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10881 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10882 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10883 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10884 struct IPerlDir* ipD, struct IPerlSock* ipS,
10885 struct IPerlProc* ipP)
10887 /* XXX many of the string copies here can be optimized if they're
10888 * constants; they need to be allocated as common memory and just
10889 * their pointers copied. */
10892 CLONE_PARAMS clone_params;
10893 CLONE_PARAMS* param = &clone_params;
10895 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10896 /* for each stash, determine whether its objects should be cloned */
10897 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10898 PERL_SET_THX(my_perl);
10901 Poison(my_perl, 1, PerlInterpreter);
10903 PL_curcop = (COP *)Nullop;
10907 PL_savestack_ix = 0;
10908 PL_savestack_max = -1;
10909 PL_sig_pending = 0;
10910 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10911 # else /* !DEBUGGING */
10912 Zero(my_perl, 1, PerlInterpreter);
10913 # endif /* DEBUGGING */
10915 /* host pointers */
10917 PL_MemShared = ipMS;
10918 PL_MemParse = ipMP;
10925 #else /* !PERL_IMPLICIT_SYS */
10927 CLONE_PARAMS clone_params;
10928 CLONE_PARAMS* param = &clone_params;
10929 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10930 /* for each stash, determine whether its objects should be cloned */
10931 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10932 PERL_SET_THX(my_perl);
10935 Poison(my_perl, 1, PerlInterpreter);
10937 PL_curcop = (COP *)Nullop;
10941 PL_savestack_ix = 0;
10942 PL_savestack_max = -1;
10943 PL_sig_pending = 0;
10944 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10945 # else /* !DEBUGGING */
10946 Zero(my_perl, 1, PerlInterpreter);
10947 # endif /* DEBUGGING */
10948 #endif /* PERL_IMPLICIT_SYS */
10949 param->flags = flags;
10950 param->proto_perl = proto_perl;
10952 Zero(&PL_body_arenaroots, 1, PL_body_arenaroots);
10953 Zero(&PL_body_roots, 1, PL_body_roots);
10955 PL_he_arenaroot = NULL;
10958 PL_nice_chunk = NULL;
10959 PL_nice_chunk_size = 0;
10961 PL_sv_objcount = 0;
10962 PL_sv_root = Nullsv;
10963 PL_sv_arenaroot = Nullsv;
10965 PL_debug = proto_perl->Idebug;
10967 PL_hash_seed = proto_perl->Ihash_seed;
10968 PL_rehash_seed = proto_perl->Irehash_seed;
10970 #ifdef USE_REENTRANT_API
10971 /* XXX: things like -Dm will segfault here in perlio, but doing
10972 * PERL_SET_CONTEXT(proto_perl);
10973 * breaks too many other things
10975 Perl_reentrant_init(aTHX);
10978 /* create SV map for pointer relocation */
10979 PL_ptr_table = ptr_table_new();
10981 /* initialize these special pointers as early as possible */
10982 SvANY(&PL_sv_undef) = NULL;
10983 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10984 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10985 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10987 SvANY(&PL_sv_no) = new_XPVNV();
10988 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10989 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
10990 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10991 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
10992 SvCUR_set(&PL_sv_no, 0);
10993 SvLEN_set(&PL_sv_no, 1);
10994 SvIV_set(&PL_sv_no, 0);
10995 SvNV_set(&PL_sv_no, 0);
10996 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10998 SvANY(&PL_sv_yes) = new_XPVNV();
10999 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11000 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11001 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11002 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11003 SvCUR_set(&PL_sv_yes, 1);
11004 SvLEN_set(&PL_sv_yes, 2);
11005 SvIV_set(&PL_sv_yes, 1);
11006 SvNV_set(&PL_sv_yes, 1);
11007 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11009 /* create (a non-shared!) shared string table */
11010 PL_strtab = newHV();
11011 HvSHAREKEYS_off(PL_strtab);
11012 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11013 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11015 PL_compiling = proto_perl->Icompiling;
11017 /* These two PVs will be free'd special way so must set them same way op.c does */
11018 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11019 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11021 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11022 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11024 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11025 if (!specialWARN(PL_compiling.cop_warnings))
11026 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11027 if (!specialCopIO(PL_compiling.cop_io))
11028 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11029 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11031 /* pseudo environmental stuff */
11032 PL_origargc = proto_perl->Iorigargc;
11033 PL_origargv = proto_perl->Iorigargv;
11035 param->stashes = newAV(); /* Setup array of objects to call clone on */
11037 /* Set tainting stuff before PerlIO_debug can possibly get called */
11038 PL_tainting = proto_perl->Itainting;
11039 PL_taint_warn = proto_perl->Itaint_warn;
11041 #ifdef PERLIO_LAYERS
11042 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11043 PerlIO_clone(aTHX_ proto_perl, param);
11046 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11047 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11048 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11049 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11050 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11051 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11054 PL_minus_c = proto_perl->Iminus_c;
11055 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11056 PL_localpatches = proto_perl->Ilocalpatches;
11057 PL_splitstr = proto_perl->Isplitstr;
11058 PL_preprocess = proto_perl->Ipreprocess;
11059 PL_minus_n = proto_perl->Iminus_n;
11060 PL_minus_p = proto_perl->Iminus_p;
11061 PL_minus_l = proto_perl->Iminus_l;
11062 PL_minus_a = proto_perl->Iminus_a;
11063 PL_minus_F = proto_perl->Iminus_F;
11064 PL_doswitches = proto_perl->Idoswitches;
11065 PL_dowarn = proto_perl->Idowarn;
11066 PL_doextract = proto_perl->Idoextract;
11067 PL_sawampersand = proto_perl->Isawampersand;
11068 PL_unsafe = proto_perl->Iunsafe;
11069 PL_inplace = SAVEPV(proto_perl->Iinplace);
11070 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11071 PL_perldb = proto_perl->Iperldb;
11072 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11073 PL_exit_flags = proto_perl->Iexit_flags;
11075 /* magical thingies */
11076 /* XXX time(&PL_basetime) when asked for? */
11077 PL_basetime = proto_perl->Ibasetime;
11078 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11080 PL_maxsysfd = proto_perl->Imaxsysfd;
11081 PL_multiline = proto_perl->Imultiline;
11082 PL_statusvalue = proto_perl->Istatusvalue;
11084 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11086 PL_statusvalue_posix = proto_perl->Istatusvalue_posix;
11088 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11090 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11091 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11092 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11094 /* Clone the regex array */
11095 PL_regex_padav = newAV();
11097 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11098 SV** const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11100 av_push(PL_regex_padav,
11101 sv_dup_inc(regexen[0],param));
11102 for(i = 1; i <= len; i++) {
11103 if(SvREPADTMP(regexen[i])) {
11104 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11106 av_push(PL_regex_padav,
11108 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11109 SvIVX(regexen[i])), param)))
11114 PL_regex_pad = AvARRAY(PL_regex_padav);
11116 /* shortcuts to various I/O objects */
11117 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11118 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11119 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11120 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11121 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11122 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11124 /* shortcuts to regexp stuff */
11125 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11127 /* shortcuts to misc objects */
11128 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11130 /* shortcuts to debugging objects */
11131 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11132 PL_DBline = gv_dup(proto_perl->IDBline, param);
11133 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11134 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11135 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11136 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11137 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11138 PL_lineary = av_dup(proto_perl->Ilineary, param);
11139 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11141 /* symbol tables */
11142 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11143 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11144 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11145 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11146 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11148 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11149 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11150 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11151 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11152 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11153 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11155 PL_sub_generation = proto_perl->Isub_generation;
11157 /* funky return mechanisms */
11158 PL_forkprocess = proto_perl->Iforkprocess;
11160 /* subprocess state */
11161 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11163 /* internal state */
11164 PL_maxo = proto_perl->Imaxo;
11165 if (proto_perl->Iop_mask)
11166 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11168 PL_op_mask = Nullch;
11169 /* PL_asserting = proto_perl->Iasserting; */
11171 /* current interpreter roots */
11172 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11173 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11174 PL_main_start = proto_perl->Imain_start;
11175 PL_eval_root = proto_perl->Ieval_root;
11176 PL_eval_start = proto_perl->Ieval_start;
11178 /* runtime control stuff */
11179 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11180 PL_copline = proto_perl->Icopline;
11182 PL_filemode = proto_perl->Ifilemode;
11183 PL_lastfd = proto_perl->Ilastfd;
11184 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11187 PL_gensym = proto_perl->Igensym;
11188 PL_preambled = proto_perl->Ipreambled;
11189 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11190 PL_laststatval = proto_perl->Ilaststatval;
11191 PL_laststype = proto_perl->Ilaststype;
11192 PL_mess_sv = Nullsv;
11194 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11196 /* interpreter atexit processing */
11197 PL_exitlistlen = proto_perl->Iexitlistlen;
11198 if (PL_exitlistlen) {
11199 Newx(PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11200 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11203 PL_exitlist = (PerlExitListEntry*)NULL;
11204 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11205 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11206 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11208 PL_profiledata = NULL;
11209 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11210 /* PL_rsfp_filters entries have fake IoDIRP() */
11211 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11213 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11215 PAD_CLONE_VARS(proto_perl, param);
11217 #ifdef HAVE_INTERP_INTERN
11218 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11221 /* more statics moved here */
11222 PL_generation = proto_perl->Igeneration;
11223 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11225 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11226 PL_in_clean_all = proto_perl->Iin_clean_all;
11228 PL_uid = proto_perl->Iuid;
11229 PL_euid = proto_perl->Ieuid;
11230 PL_gid = proto_perl->Igid;
11231 PL_egid = proto_perl->Iegid;
11232 PL_nomemok = proto_perl->Inomemok;
11233 PL_an = proto_perl->Ian;
11234 PL_evalseq = proto_perl->Ievalseq;
11235 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11236 PL_origalen = proto_perl->Iorigalen;
11237 #ifdef PERL_USES_PL_PIDSTATUS
11238 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11240 PL_osname = SAVEPV(proto_perl->Iosname);
11241 PL_sighandlerp = proto_perl->Isighandlerp;
11243 PL_runops = proto_perl->Irunops;
11245 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11248 PL_cshlen = proto_perl->Icshlen;
11249 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11252 PL_lex_state = proto_perl->Ilex_state;
11253 PL_lex_defer = proto_perl->Ilex_defer;
11254 PL_lex_expect = proto_perl->Ilex_expect;
11255 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11256 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11257 PL_lex_starts = proto_perl->Ilex_starts;
11258 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11259 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11260 PL_lex_op = proto_perl->Ilex_op;
11261 PL_lex_inpat = proto_perl->Ilex_inpat;
11262 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11263 PL_lex_brackets = proto_perl->Ilex_brackets;
11264 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11265 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11266 PL_lex_casemods = proto_perl->Ilex_casemods;
11267 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11268 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11270 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11271 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11272 PL_nexttoke = proto_perl->Inexttoke;
11274 /* XXX This is probably masking the deeper issue of why
11275 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11276 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11277 * (A little debugging with a watchpoint on it may help.)
11279 if (SvANY(proto_perl->Ilinestr)) {
11280 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11281 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11282 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11283 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11284 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11285 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11286 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11287 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11288 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11291 PL_linestr = NEWSV(65,79);
11292 sv_upgrade(PL_linestr,SVt_PVIV);
11293 sv_setpvn(PL_linestr,"",0);
11294 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11296 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11297 PL_pending_ident = proto_perl->Ipending_ident;
11298 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11300 PL_expect = proto_perl->Iexpect;
11302 PL_multi_start = proto_perl->Imulti_start;
11303 PL_multi_end = proto_perl->Imulti_end;
11304 PL_multi_open = proto_perl->Imulti_open;
11305 PL_multi_close = proto_perl->Imulti_close;
11307 PL_error_count = proto_perl->Ierror_count;
11308 PL_subline = proto_perl->Isubline;
11309 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11311 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11312 if (SvANY(proto_perl->Ilinestr)) {
11313 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11314 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11315 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11316 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11317 PL_last_lop_op = proto_perl->Ilast_lop_op;
11320 PL_last_uni = SvPVX(PL_linestr);
11321 PL_last_lop = SvPVX(PL_linestr);
11322 PL_last_lop_op = 0;
11324 PL_in_my = proto_perl->Iin_my;
11325 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11327 PL_cryptseen = proto_perl->Icryptseen;
11330 PL_hints = proto_perl->Ihints;
11332 PL_amagic_generation = proto_perl->Iamagic_generation;
11334 #ifdef USE_LOCALE_COLLATE
11335 PL_collation_ix = proto_perl->Icollation_ix;
11336 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11337 PL_collation_standard = proto_perl->Icollation_standard;
11338 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11339 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11340 #endif /* USE_LOCALE_COLLATE */
11342 #ifdef USE_LOCALE_NUMERIC
11343 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11344 PL_numeric_standard = proto_perl->Inumeric_standard;
11345 PL_numeric_local = proto_perl->Inumeric_local;
11346 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11347 #endif /* !USE_LOCALE_NUMERIC */
11349 /* utf8 character classes */
11350 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11351 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11352 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11353 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11354 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11355 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11356 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11357 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11358 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11359 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11360 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11361 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11362 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11363 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11364 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11365 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11366 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11367 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11368 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11369 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11371 /* Did the locale setup indicate UTF-8? */
11372 PL_utf8locale = proto_perl->Iutf8locale;
11373 /* Unicode features (see perlrun/-C) */
11374 PL_unicode = proto_perl->Iunicode;
11376 /* Pre-5.8 signals control */
11377 PL_signals = proto_perl->Isignals;
11379 /* times() ticks per second */
11380 PL_clocktick = proto_perl->Iclocktick;
11382 /* Recursion stopper for PerlIO_find_layer */
11383 PL_in_load_module = proto_perl->Iin_load_module;
11385 /* sort() routine */
11386 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11388 /* Not really needed/useful since the reenrant_retint is "volatile",
11389 * but do it for consistency's sake. */
11390 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11392 /* Hooks to shared SVs and locks. */
11393 PL_sharehook = proto_perl->Isharehook;
11394 PL_lockhook = proto_perl->Ilockhook;
11395 PL_unlockhook = proto_perl->Iunlockhook;
11396 PL_threadhook = proto_perl->Ithreadhook;
11398 PL_runops_std = proto_perl->Irunops_std;
11399 PL_runops_dbg = proto_perl->Irunops_dbg;
11401 #ifdef THREADS_HAVE_PIDS
11402 PL_ppid = proto_perl->Ippid;
11406 PL_last_swash_hv = Nullhv; /* reinits on demand */
11407 PL_last_swash_klen = 0;
11408 PL_last_swash_key[0]= '\0';
11409 PL_last_swash_tmps = (U8*)NULL;
11410 PL_last_swash_slen = 0;
11412 PL_glob_index = proto_perl->Iglob_index;
11413 PL_srand_called = proto_perl->Isrand_called;
11414 PL_uudmap['M'] = 0; /* reinits on demand */
11415 PL_bitcount = Nullch; /* reinits on demand */
11417 if (proto_perl->Ipsig_pend) {
11418 Newxz(PL_psig_pend, SIG_SIZE, int);
11421 PL_psig_pend = (int*)NULL;
11424 if (proto_perl->Ipsig_ptr) {
11425 Newxz(PL_psig_ptr, SIG_SIZE, SV*);
11426 Newxz(PL_psig_name, SIG_SIZE, SV*);
11427 for (i = 1; i < SIG_SIZE; i++) {
11428 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11429 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11433 PL_psig_ptr = (SV**)NULL;
11434 PL_psig_name = (SV**)NULL;
11437 /* thrdvar.h stuff */
11439 if (flags & CLONEf_COPY_STACKS) {
11440 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11441 PL_tmps_ix = proto_perl->Ttmps_ix;
11442 PL_tmps_max = proto_perl->Ttmps_max;
11443 PL_tmps_floor = proto_perl->Ttmps_floor;
11444 Newxz(PL_tmps_stack, PL_tmps_max, SV*);
11446 while (i <= PL_tmps_ix) {
11447 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11451 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11452 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11453 Newxz(PL_markstack, i, I32);
11454 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11455 - proto_perl->Tmarkstack);
11456 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11457 - proto_perl->Tmarkstack);
11458 Copy(proto_perl->Tmarkstack, PL_markstack,
11459 PL_markstack_ptr - PL_markstack + 1, I32);
11461 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11462 * NOTE: unlike the others! */
11463 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11464 PL_scopestack_max = proto_perl->Tscopestack_max;
11465 Newxz(PL_scopestack, PL_scopestack_max, I32);
11466 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11468 /* NOTE: si_dup() looks at PL_markstack */
11469 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11471 /* PL_curstack = PL_curstackinfo->si_stack; */
11472 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11473 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11475 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11476 PL_stack_base = AvARRAY(PL_curstack);
11477 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11478 - proto_perl->Tstack_base);
11479 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11481 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11482 * NOTE: unlike the others! */
11483 PL_savestack_ix = proto_perl->Tsavestack_ix;
11484 PL_savestack_max = proto_perl->Tsavestack_max;
11485 /*Newxz(PL_savestack, PL_savestack_max, ANY);*/
11486 PL_savestack = ss_dup(proto_perl, param);
11490 ENTER; /* perl_destruct() wants to LEAVE; */
11493 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11494 PL_top_env = &PL_start_env;
11496 PL_op = proto_perl->Top;
11499 PL_Xpv = (XPV*)NULL;
11500 PL_na = proto_perl->Tna;
11502 PL_statbuf = proto_perl->Tstatbuf;
11503 PL_statcache = proto_perl->Tstatcache;
11504 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11505 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11507 PL_timesbuf = proto_perl->Ttimesbuf;
11510 PL_tainted = proto_perl->Ttainted;
11511 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11512 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11513 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11514 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11515 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11516 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11517 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11518 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11519 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11521 PL_restartop = proto_perl->Trestartop;
11522 PL_in_eval = proto_perl->Tin_eval;
11523 PL_delaymagic = proto_perl->Tdelaymagic;
11524 PL_dirty = proto_perl->Tdirty;
11525 PL_localizing = proto_perl->Tlocalizing;
11527 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11528 PL_hv_fetch_ent_mh = Nullhe;
11529 PL_modcount = proto_perl->Tmodcount;
11530 PL_lastgotoprobe = Nullop;
11531 PL_dumpindent = proto_perl->Tdumpindent;
11533 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11534 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11535 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11536 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11537 PL_efloatbuf = Nullch; /* reinits on demand */
11538 PL_efloatsize = 0; /* reinits on demand */
11542 PL_screamfirst = NULL;
11543 PL_screamnext = NULL;
11544 PL_maxscream = -1; /* reinits on demand */
11545 PL_lastscream = Nullsv;
11547 PL_watchaddr = NULL;
11548 PL_watchok = Nullch;
11550 PL_regdummy = proto_perl->Tregdummy;
11551 PL_regprecomp = Nullch;
11554 PL_colorset = 0; /* reinits PL_colors[] */
11555 /*PL_colors[6] = {0,0,0,0,0,0};*/
11556 PL_reginput = Nullch;
11557 PL_regbol = Nullch;
11558 PL_regeol = Nullch;
11559 PL_regstartp = (I32*)NULL;
11560 PL_regendp = (I32*)NULL;
11561 PL_reglastparen = (U32*)NULL;
11562 PL_reglastcloseparen = (U32*)NULL;
11563 PL_regtill = Nullch;
11564 PL_reg_start_tmp = (char**)NULL;
11565 PL_reg_start_tmpl = 0;
11566 PL_regdata = (struct reg_data*)NULL;
11569 PL_reg_eval_set = 0;
11571 PL_regprogram = (regnode*)NULL;
11573 PL_regcc = (CURCUR*)NULL;
11574 PL_reg_call_cc = (struct re_cc_state*)NULL;
11575 PL_reg_re = (regexp*)NULL;
11576 PL_reg_ganch = Nullch;
11577 PL_reg_sv = Nullsv;
11578 PL_reg_match_utf8 = FALSE;
11579 PL_reg_magic = (MAGIC*)NULL;
11581 PL_reg_oldcurpm = (PMOP*)NULL;
11582 PL_reg_curpm = (PMOP*)NULL;
11583 PL_reg_oldsaved = Nullch;
11584 PL_reg_oldsavedlen = 0;
11585 #ifdef PERL_OLD_COPY_ON_WRITE
11588 PL_reg_maxiter = 0;
11589 PL_reg_leftiter = 0;
11590 PL_reg_poscache = Nullch;
11591 PL_reg_poscache_size= 0;
11593 /* RE engine - function pointers */
11594 PL_regcompp = proto_perl->Tregcompp;
11595 PL_regexecp = proto_perl->Tregexecp;
11596 PL_regint_start = proto_perl->Tregint_start;
11597 PL_regint_string = proto_perl->Tregint_string;
11598 PL_regfree = proto_perl->Tregfree;
11600 PL_reginterp_cnt = 0;
11601 PL_reg_starttry = 0;
11603 /* Pluggable optimizer */
11604 PL_peepp = proto_perl->Tpeepp;
11606 PL_stashcache = newHV();
11608 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11609 ptr_table_free(PL_ptr_table);
11610 PL_ptr_table = NULL;
11613 /* Call the ->CLONE method, if it exists, for each of the stashes
11614 identified by sv_dup() above.
11616 while(av_len(param->stashes) != -1) {
11617 HV* const stash = (HV*) av_shift(param->stashes);
11618 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11619 if (cloner && GvCV(cloner)) {
11624 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
11626 call_sv((SV*)GvCV(cloner), G_DISCARD);
11632 SvREFCNT_dec(param->stashes);
11634 /* orphaned? eg threads->new inside BEGIN or use */
11635 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
11636 (void)SvREFCNT_inc(PL_compcv);
11637 SAVEFREESV(PL_compcv);
11643 #endif /* USE_ITHREADS */
11646 =head1 Unicode Support
11648 =for apidoc sv_recode_to_utf8
11650 The encoding is assumed to be an Encode object, on entry the PV
11651 of the sv is assumed to be octets in that encoding, and the sv
11652 will be converted into Unicode (and UTF-8).
11654 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11655 is not a reference, nothing is done to the sv. If the encoding is not
11656 an C<Encode::XS> Encoding object, bad things will happen.
11657 (See F<lib/encoding.pm> and L<Encode>).
11659 The PV of the sv is returned.
11664 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11667 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11681 Passing sv_yes is wrong - it needs to be or'ed set of constants
11682 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11683 remove converted chars from source.
11685 Both will default the value - let them.
11687 XPUSHs(&PL_sv_yes);
11690 call_method("decode", G_SCALAR);
11694 s = SvPV_const(uni, len);
11695 if (s != SvPVX_const(sv)) {
11696 SvGROW(sv, len + 1);
11697 Move(s, SvPVX(sv), len + 1, char);
11698 SvCUR_set(sv, len);
11705 return SvPOKp(sv) ? SvPVX(sv) : NULL;
11709 =for apidoc sv_cat_decode
11711 The encoding is assumed to be an Encode object, the PV of the ssv is
11712 assumed to be octets in that encoding and decoding the input starts
11713 from the position which (PV + *offset) pointed to. The dsv will be
11714 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11715 when the string tstr appears in decoding output or the input ends on
11716 the PV of the ssv. The value which the offset points will be modified
11717 to the last input position on the ssv.
11719 Returns TRUE if the terminator was found, else returns FALSE.
11724 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11725 SV *ssv, int *offset, char *tstr, int tlen)
11729 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11740 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11741 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11743 call_method("cat_decode", G_SCALAR);
11745 ret = SvTRUE(TOPs);
11746 *offset = SvIV(offsv);
11752 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
11758 * c-indentation-style: bsd
11759 * c-basic-offset: 4
11760 * indent-tabs-mode: t
11763 * ex: set ts=8 sts=4 sw=4 noet: