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 {
1231 struct body_details bodies_by_type[] = {
1234 {sizeof(NV), 0}, /* 8 bytes on most ILP32 with IEEE doubles */
1236 {sizeof(xpv_allocated), /* 8 bytes on most ILP32 with IEEE doubles */
1237 STRUCT_OFFSET(xpv_allocated, xpv_cur) - STRUCT_OFFSET(XPV, xpv_cur)},
1238 {sizeof(xpviv_allocated), /* 12 */
1239 STRUCT_OFFSET(xpviv_allocated, xpv_cur) - STRUCT_OFFSET(XPVIV, xpv_cur)},
1240 {sizeof(XPVNV), 0}, /* 20 */
1241 {sizeof(XPVMG), 0}, /* 28 */
1242 {sizeof(XPVBM), 0}, /* 36 */
1243 {sizeof(XPVGV), 0}, /* 48 */
1244 {sizeof(XPVLV), 0}, /* 64 */
1245 {sizeof(xpvav_allocated), /* 20 */
1246 STRUCT_OFFSET(xpvav_allocated, xav_fill)
1247 - STRUCT_OFFSET(XPVAV, xav_fill)},
1248 {sizeof(xpvhv_allocated), /* 20 */
1249 STRUCT_OFFSET(xpvhv_allocated, xhv_fill)
1250 - STRUCT_OFFSET(XPVHV, xhv_fill)},
1251 {sizeof(XPVCV), 0}, /* 76 */
1252 {sizeof(XPVFM), 0}, /* 80 */
1253 {sizeof(XPVIO), 0} /* 84 */
1256 #define new_body_type(sv_type) \
1257 (void *)((char *)S_new_body(aTHX_ bodies_by_type[sv_type].size, sv_type)\
1258 + bodies_by_type[sv_type].offset)
1260 #define del_body_type(p, sv_type) \
1261 del_body(p, &PL_body_roots[sv_type])
1264 #define new_body_allocated(sv_type) \
1265 (void *)((char *)S_new_body(aTHX_ bodies_by_type[sv_type].size, sv_type)\
1266 + bodies_by_type[sv_type].offset)
1268 #define del_body_allocated(p, sv_type) \
1269 del_body(p - bodies_by_type[sv_type].offset, &PL_body_roots[sv_type])
1272 #define my_safemalloc(s) (void*)safemalloc(s)
1273 #define my_safefree(p) safefree((char*)p)
1277 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1278 #define del_XNV(p) my_safefree(p)
1280 #define new_XPV() my_safemalloc(sizeof(XPV))
1281 #define del_XPV(p) my_safefree(p)
1283 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1284 #define del_XPVIV(p) my_safefree(p)
1286 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1287 #define del_XPVNV(p) my_safefree(p)
1289 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1290 #define del_XPVCV(p) my_safefree(p)
1292 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1293 #define del_XPVAV(p) my_safefree(p)
1295 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1296 #define del_XPVHV(p) my_safefree(p)
1298 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1299 #define del_XPVMG(p) my_safefree(p)
1301 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1302 #define del_XPVGV(p) my_safefree(p)
1304 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1305 #define del_XPVLV(p) my_safefree(p)
1307 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1308 #define del_XPVBM(p) my_safefree(p)
1312 #define new_XNV() new_body_type(SVt_NV)
1313 #define del_XNV(p) del_body_type(p, SVt_NV)
1315 #define new_XPV() new_body_allocated(SVt_PV)
1316 #define del_XPV(p) del_body_allocated(p, SVt_PV)
1318 #define new_XPVIV() new_body_allocated(SVt_PVIV)
1319 #define del_XPVIV(p) del_body_allocated(p, SVt_PVIV)
1321 #define new_XPVNV() new_body_type(SVt_PVNV)
1322 #define del_XPVNV(p) del_body_type(p, SVt_PVNV)
1324 #define new_XPVCV() new_body_type(SVt_PVCV)
1325 #define del_XPVCV(p) del_body_type(p, SVt_PVCV)
1327 #define new_XPVAV() new_body_allocated(SVt_PVAV)
1328 #define del_XPVAV(p) del_body_allocated(p, SVt_PVAV)
1330 #define new_XPVHV() new_body_allocated(SVt_PVHV)
1331 #define del_XPVHV(p) del_body_allocated(p, SVt_PVHV)
1333 #define new_XPVMG() new_body_type(SVt_PVMG)
1334 #define del_XPVMG(p) del_body_type(p, SVt_PVMG)
1336 #define new_XPVGV() new_body_type(SVt_PVGV)
1337 #define del_XPVGV(p) del_body_type(p, SVt_PVGV)
1339 #define new_XPVLV() new_body_type(SVt_PVLV)
1340 #define del_XPVLV(p) del_body_type(p, SVt_PVLV)
1342 #define new_XPVBM() new_body_type(SVt_PVBM)
1343 #define del_XPVBM(p) del_body_type(p, SVt_PVBM)
1347 /* no arena for you! */
1348 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1349 #define del_XPVFM(p) my_safefree(p)
1351 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1352 #define del_XPVIO(p) my_safefree(p)
1357 =for apidoc sv_upgrade
1359 Upgrade an SV to a more complex form. Generally adds a new body type to the
1360 SV, then copies across as much information as possible from the old body.
1361 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1367 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1369 void** old_body_arena;
1370 size_t old_body_offset;
1371 size_t old_body_length; /* Well, the length to copy. */
1373 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1374 /* If NV 0.0 is store as all bits 0 then Zero() already creates a correct
1376 bool zero_nv = TRUE;
1379 size_t new_body_length;
1380 size_t new_body_offset;
1381 void** new_body_arena;
1382 void** new_body_arenaroot;
1383 const U32 old_type = SvTYPE(sv);
1385 if (mt != SVt_PV && SvIsCOW(sv)) {
1386 sv_force_normal_flags(sv, 0);
1393 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1394 (int)old_type, (int)mt);
1397 old_body = SvANY(sv);
1399 old_body_offset = 0;
1400 old_body_length = 0;
1401 new_body_offset = 0;
1402 new_body_length = ~0;
1404 /* Copying structures onto other structures that have been neatly zeroed
1405 has a subtle gotcha. Consider XPVMG
1407 +------+------+------+------+------+-------+-------+
1408 | NV | CUR | LEN | IV | MAGIC | STASH |
1409 +------+------+------+------+------+-------+-------+
1410 0 4 8 12 16 20 24 28
1412 where NVs are aligned to 8 bytes, so that sizeof that structure is
1413 actually 32 bytes long, with 4 bytes of padding at the end:
1415 +------+------+------+------+------+-------+-------+------+
1416 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1417 +------+------+------+------+------+-------+-------+------+
1418 0 4 8 12 16 20 24 28 32
1420 so what happens if you allocate memory for this structure:
1422 +------+------+------+------+------+-------+-------+------+------+...
1423 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1424 +------+------+------+------+------+-------+-------+------+------+...
1425 0 4 8 12 16 20 24 28 32 36
1427 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1428 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1429 started out as zero once, but it's quite possible that it isn't. So now,
1430 rather than a nicely zeroed GP, you have it pointing somewhere random.
1433 (In fact, GP ends up pointing at a previous GP structure, because the
1434 principle cause of the padding in XPVMG getting garbage is a copy of
1435 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1437 So we are careful and work out the size of used parts of all the
1446 else if (mt < SVt_PVIV)
1448 old_body_offset = STRUCT_OFFSET(XPVIV, xiv_iv);
1449 old_body_length = sizeof(IV);
1452 old_body_arena = &PL_body_roots[SVt_NV];
1453 old_body_length = sizeof(NV);
1454 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1463 old_body_arena = &PL_body_roots[SVt_PV];
1464 old_body_offset = - bodies_by_type[SVt_PVIV].offset;
1465 old_body_length = STRUCT_OFFSET(XPV, xpv_len)
1466 + sizeof (((XPV*)SvANY(sv))->xpv_len)
1470 else if (mt == SVt_NV)
1474 old_body_arena = &PL_body_roots[SVt_PVIV];
1475 old_body_offset = - bodies_by_type[SVt_PVIV].offset;
1476 old_body_length = STRUCT_OFFSET(XPVIV, xiv_u);
1477 old_body_length += sizeof (((XPVIV*)SvANY(sv))->xiv_u);
1478 old_body_length -= old_body_offset;
1481 old_body_arena = &PL_body_roots[SVt_PVNV];
1482 old_body_length = STRUCT_OFFSET(XPVNV, xiv_u)
1483 + sizeof (((XPVNV*)SvANY(sv))->xiv_u);
1484 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1489 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1490 there's no way that it can be safely upgraded, because perl.c
1491 expects to Safefree(SvANY(PL_mess_sv)) */
1492 assert(sv != PL_mess_sv);
1493 /* This flag bit is used to mean other things in other scalar types.
1494 Given that it only has meaning inside the pad, it shouldn't be set
1495 on anything that can get upgraded. */
1496 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1497 old_body_arena = &PL_body_roots[SVt_PVMG];
1498 old_body_length = STRUCT_OFFSET(XPVMG, xmg_stash)
1499 + sizeof (((XPVMG*)SvANY(sv))->xmg_stash);
1500 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1505 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1508 SvFLAGS(sv) &= ~SVTYPEMASK;
1513 Perl_croak(aTHX_ "Can't upgrade to undef");
1515 assert(old_type == SVt_NULL);
1516 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1520 assert(old_type == SVt_NULL);
1521 SvANY(sv) = new_XNV();
1525 assert(old_type == SVt_NULL);
1526 SvANY(sv) = &sv->sv_u.svu_rv;
1530 SvANY(sv) = new_XPVHV();
1533 HvTOTALKEYS(sv) = 0;
1538 SvANY(sv) = new_XPVAV();
1545 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1546 The target created by newSVrv also is, and it can have magic.
1547 However, it never has SvPVX set.
1549 if (old_type >= SVt_RV) {
1550 assert(SvPVX_const(sv) == 0);
1553 /* Could put this in the else clause below, as PVMG must have SvPVX
1554 0 already (the assertion above) */
1555 SvPV_set(sv, (char*)0);
1557 if (old_type >= SVt_PVMG) {
1558 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1559 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1567 new_body = new_XPVIO();
1568 new_body_length = sizeof(XPVIO);
1571 new_body = new_XPVFM();
1572 new_body_length = sizeof(XPVFM);
1581 new_body_length = bodies_by_type[mt].size;
1582 new_body_arena = &PL_body_roots[mt];
1583 new_body_arenaroot = &PL_body_arenaroots[mt];
1587 new_body_offset = - bodies_by_type[SVt_PVIV].offset;
1588 new_body_length = sizeof(XPVIV) - new_body_offset;
1589 new_body_arena = &PL_body_roots[SVt_PVIV];
1590 new_body_arenaroot = &PL_body_arenaroots[SVt_PVIV];
1591 /* XXX Is this still needed? Was it ever needed? Surely as there is
1592 no route from NV to PVIV, NOK can never be true */
1596 goto new_body_no_NV;
1598 new_body_offset = - bodies_by_type[SVt_PV].offset;
1599 new_body_length = sizeof(XPV) - new_body_offset;
1600 new_body_arena = &PL_body_roots[SVt_PV];
1601 new_body_arenaroot = &PL_body_arenaroots[SVt_PV];
1603 /* PV and PVIV don't have an NV slot. */
1604 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1609 assert(new_body_length);
1611 /* This points to the start of the allocated area. */
1612 new_body_inline(new_body, new_body_arena, new_body_length, mt);
1614 /* We always allocated the full length item with PURIFY */
1615 new_body_length += new_body_offset;
1616 new_body_offset = 0;
1617 new_body = my_safemalloc(new_body_length);
1621 Zero(new_body, new_body_length, char);
1622 new_body = ((char *)new_body) - new_body_offset;
1623 SvANY(sv) = new_body;
1625 if (old_body_length) {
1626 Copy((char *)old_body + old_body_offset,
1627 (char *)new_body + old_body_offset,
1628 old_body_length, char);
1631 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1637 IoPAGE_LEN(sv) = 60;
1638 if (old_type < SVt_RV)
1642 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", mt);
1646 if (old_body_arena) {
1648 my_safefree(old_body);
1650 del_body((void*)((char*)old_body + old_body_offset),
1657 =for apidoc sv_backoff
1659 Remove any string offset. You should normally use the C<SvOOK_off> macro
1666 Perl_sv_backoff(pTHX_ register SV *sv)
1669 assert(SvTYPE(sv) != SVt_PVHV);
1670 assert(SvTYPE(sv) != SVt_PVAV);
1672 const char * const s = SvPVX_const(sv);
1673 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1674 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1676 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1678 SvFLAGS(sv) &= ~SVf_OOK;
1685 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1686 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1687 Use the C<SvGROW> wrapper instead.
1693 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1697 #ifdef HAS_64K_LIMIT
1698 if (newlen >= 0x10000) {
1699 PerlIO_printf(Perl_debug_log,
1700 "Allocation too large: %"UVxf"\n", (UV)newlen);
1703 #endif /* HAS_64K_LIMIT */
1706 if (SvTYPE(sv) < SVt_PV) {
1707 sv_upgrade(sv, SVt_PV);
1708 s = SvPVX_mutable(sv);
1710 else if (SvOOK(sv)) { /* pv is offset? */
1712 s = SvPVX_mutable(sv);
1713 if (newlen > SvLEN(sv))
1714 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1715 #ifdef HAS_64K_LIMIT
1716 if (newlen >= 0x10000)
1721 s = SvPVX_mutable(sv);
1723 if (newlen > SvLEN(sv)) { /* need more room? */
1724 newlen = PERL_STRLEN_ROUNDUP(newlen);
1725 if (SvLEN(sv) && s) {
1727 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1733 s = saferealloc(s, newlen);
1736 s = safemalloc(newlen);
1737 if (SvPVX_const(sv) && SvCUR(sv)) {
1738 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1742 SvLEN_set(sv, newlen);
1748 =for apidoc sv_setiv
1750 Copies an integer into the given SV, upgrading first if necessary.
1751 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1757 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1759 SV_CHECK_THINKFIRST_COW_DROP(sv);
1760 switch (SvTYPE(sv)) {
1762 sv_upgrade(sv, SVt_IV);
1765 sv_upgrade(sv, SVt_PVNV);
1769 sv_upgrade(sv, SVt_PVIV);
1778 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1781 (void)SvIOK_only(sv); /* validate number */
1787 =for apidoc sv_setiv_mg
1789 Like C<sv_setiv>, but also handles 'set' magic.
1795 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1802 =for apidoc sv_setuv
1804 Copies an unsigned integer into the given SV, upgrading first if necessary.
1805 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1811 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1813 /* With these two if statements:
1814 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1817 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1819 If you wish to remove them, please benchmark to see what the effect is
1821 if (u <= (UV)IV_MAX) {
1822 sv_setiv(sv, (IV)u);
1831 =for apidoc sv_setuv_mg
1833 Like C<sv_setuv>, but also handles 'set' magic.
1839 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1848 =for apidoc sv_setnv
1850 Copies a double into the given SV, upgrading first if necessary.
1851 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1857 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1859 SV_CHECK_THINKFIRST_COW_DROP(sv);
1860 switch (SvTYPE(sv)) {
1863 sv_upgrade(sv, SVt_NV);
1868 sv_upgrade(sv, SVt_PVNV);
1877 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1881 (void)SvNOK_only(sv); /* validate number */
1886 =for apidoc sv_setnv_mg
1888 Like C<sv_setnv>, but also handles 'set' magic.
1894 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1900 /* Print an "isn't numeric" warning, using a cleaned-up,
1901 * printable version of the offending string
1905 S_not_a_number(pTHX_ SV *sv)
1912 dsv = sv_2mortal(newSVpvn("", 0));
1913 pv = sv_uni_display(dsv, sv, 10, 0);
1916 const char * const limit = tmpbuf + sizeof(tmpbuf) - 8;
1917 /* each *s can expand to 4 chars + "...\0",
1918 i.e. need room for 8 chars */
1920 const char *s, *end;
1921 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1924 if (ch & 128 && !isPRINT_LC(ch)) {
1933 else if (ch == '\r') {
1937 else if (ch == '\f') {
1941 else if (ch == '\\') {
1945 else if (ch == '\0') {
1949 else if (isPRINT_LC(ch))
1966 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1967 "Argument \"%s\" isn't numeric in %s", pv,
1970 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1971 "Argument \"%s\" isn't numeric", pv);
1975 =for apidoc looks_like_number
1977 Test if the content of an SV looks like a number (or is a number).
1978 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1979 non-numeric warning), even if your atof() doesn't grok them.
1985 Perl_looks_like_number(pTHX_ SV *sv)
1987 register const char *sbegin;
1991 sbegin = SvPVX_const(sv);
1994 else if (SvPOKp(sv))
1995 sbegin = SvPV_const(sv, len);
1997 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1998 return grok_number(sbegin, len, NULL);
2001 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2002 until proven guilty, assume that things are not that bad... */
2007 As 64 bit platforms often have an NV that doesn't preserve all bits of
2008 an IV (an assumption perl has been based on to date) it becomes necessary
2009 to remove the assumption that the NV always carries enough precision to
2010 recreate the IV whenever needed, and that the NV is the canonical form.
2011 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2012 precision as a side effect of conversion (which would lead to insanity
2013 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2014 1) to distinguish between IV/UV/NV slots that have cached a valid
2015 conversion where precision was lost and IV/UV/NV slots that have a
2016 valid conversion which has lost no precision
2017 2) to ensure that if a numeric conversion to one form is requested that
2018 would lose precision, the precise conversion (or differently
2019 imprecise conversion) is also performed and cached, to prevent
2020 requests for different numeric formats on the same SV causing
2021 lossy conversion chains. (lossless conversion chains are perfectly
2026 SvIOKp is true if the IV slot contains a valid value
2027 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2028 SvNOKp is true if the NV slot contains a valid value
2029 SvNOK is true only if the NV value is accurate
2032 while converting from PV to NV, check to see if converting that NV to an
2033 IV(or UV) would lose accuracy over a direct conversion from PV to
2034 IV(or UV). If it would, cache both conversions, return NV, but mark
2035 SV as IOK NOKp (ie not NOK).
2037 While converting from PV to IV, check to see if converting that IV to an
2038 NV would lose accuracy over a direct conversion from PV to NV. If it
2039 would, cache both conversions, flag similarly.
2041 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2042 correctly because if IV & NV were set NV *always* overruled.
2043 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2044 changes - now IV and NV together means that the two are interchangeable:
2045 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2047 The benefit of this is that operations such as pp_add know that if
2048 SvIOK is true for both left and right operands, then integer addition
2049 can be used instead of floating point (for cases where the result won't
2050 overflow). Before, floating point was always used, which could lead to
2051 loss of precision compared with integer addition.
2053 * making IV and NV equal status should make maths accurate on 64 bit
2055 * may speed up maths somewhat if pp_add and friends start to use
2056 integers when possible instead of fp. (Hopefully the overhead in
2057 looking for SvIOK and checking for overflow will not outweigh the
2058 fp to integer speedup)
2059 * will slow down integer operations (callers of SvIV) on "inaccurate"
2060 values, as the change from SvIOK to SvIOKp will cause a call into
2061 sv_2iv each time rather than a macro access direct to the IV slot
2062 * should speed up number->string conversion on integers as IV is
2063 favoured when IV and NV are equally accurate
2065 ####################################################################
2066 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2067 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2068 On the other hand, SvUOK is true iff UV.
2069 ####################################################################
2071 Your mileage will vary depending your CPU's relative fp to integer
2075 #ifndef NV_PRESERVES_UV
2076 # define IS_NUMBER_UNDERFLOW_IV 1
2077 # define IS_NUMBER_UNDERFLOW_UV 2
2078 # define IS_NUMBER_IV_AND_UV 2
2079 # define IS_NUMBER_OVERFLOW_IV 4
2080 # define IS_NUMBER_OVERFLOW_UV 5
2082 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2084 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2086 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2088 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));
2089 if (SvNVX(sv) < (NV)IV_MIN) {
2090 (void)SvIOKp_on(sv);
2092 SvIV_set(sv, IV_MIN);
2093 return IS_NUMBER_UNDERFLOW_IV;
2095 if (SvNVX(sv) > (NV)UV_MAX) {
2096 (void)SvIOKp_on(sv);
2099 SvUV_set(sv, UV_MAX);
2100 return IS_NUMBER_OVERFLOW_UV;
2102 (void)SvIOKp_on(sv);
2104 /* Can't use strtol etc to convert this string. (See truth table in
2106 if (SvNVX(sv) <= (UV)IV_MAX) {
2107 SvIV_set(sv, I_V(SvNVX(sv)));
2108 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2109 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2111 /* Integer is imprecise. NOK, IOKp */
2113 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2116 SvUV_set(sv, U_V(SvNVX(sv)));
2117 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2118 if (SvUVX(sv) == UV_MAX) {
2119 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2120 possibly be preserved by NV. Hence, it must be overflow.
2122 return IS_NUMBER_OVERFLOW_UV;
2124 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2126 /* Integer is imprecise. NOK, IOKp */
2128 return IS_NUMBER_OVERFLOW_IV;
2130 #endif /* !NV_PRESERVES_UV*/
2133 =for apidoc sv_2iv_flags
2135 Return the integer value of an SV, doing any necessary string
2136 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2137 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2143 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2147 if (SvGMAGICAL(sv)) {
2148 if (flags & SV_GMAGIC)
2153 return I_V(SvNVX(sv));
2155 if (SvPOKp(sv) && SvLEN(sv))
2158 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2159 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2165 if (SvTHINKFIRST(sv)) {
2168 SV * const tmpstr=AMG_CALLun(sv,numer);
2169 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2170 return SvIV(tmpstr);
2173 return PTR2IV(SvRV(sv));
2176 sv_force_normal_flags(sv, 0);
2178 if (SvREADONLY(sv) && !SvOK(sv)) {
2179 if (ckWARN(WARN_UNINITIALIZED))
2186 return (IV)(SvUVX(sv));
2193 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2194 * without also getting a cached IV/UV from it at the same time
2195 * (ie PV->NV conversion should detect loss of accuracy and cache
2196 * IV or UV at same time to avoid this. NWC */
2198 if (SvTYPE(sv) == SVt_NV)
2199 sv_upgrade(sv, SVt_PVNV);
2201 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2202 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2203 certainly cast into the IV range at IV_MAX, whereas the correct
2204 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2206 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2207 SvIV_set(sv, I_V(SvNVX(sv)));
2208 if (SvNVX(sv) == (NV) SvIVX(sv)
2209 #ifndef NV_PRESERVES_UV
2210 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2211 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2212 /* Don't flag it as "accurately an integer" if the number
2213 came from a (by definition imprecise) NV operation, and
2214 we're outside the range of NV integer precision */
2217 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2218 DEBUG_c(PerlIO_printf(Perl_debug_log,
2219 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2225 /* IV not precise. No need to convert from PV, as NV
2226 conversion would already have cached IV if it detected
2227 that PV->IV would be better than PV->NV->IV
2228 flags already correct - don't set public IOK. */
2229 DEBUG_c(PerlIO_printf(Perl_debug_log,
2230 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2235 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2236 but the cast (NV)IV_MIN rounds to a the value less (more
2237 negative) than IV_MIN which happens to be equal to SvNVX ??
2238 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2239 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2240 (NV)UVX == NVX are both true, but the values differ. :-(
2241 Hopefully for 2s complement IV_MIN is something like
2242 0x8000000000000000 which will be exact. NWC */
2245 SvUV_set(sv, U_V(SvNVX(sv)));
2247 (SvNVX(sv) == (NV) SvUVX(sv))
2248 #ifndef NV_PRESERVES_UV
2249 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2250 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2251 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2252 /* Don't flag it as "accurately an integer" if the number
2253 came from a (by definition imprecise) NV operation, and
2254 we're outside the range of NV integer precision */
2260 DEBUG_c(PerlIO_printf(Perl_debug_log,
2261 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2265 return (IV)SvUVX(sv);
2268 else if (SvPOKp(sv) && SvLEN(sv)) {
2270 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2271 /* We want to avoid a possible problem when we cache an IV which
2272 may be later translated to an NV, and the resulting NV is not
2273 the same as the direct translation of the initial string
2274 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2275 be careful to ensure that the value with the .456 is around if the
2276 NV value is requested in the future).
2278 This means that if we cache such an IV, we need to cache the
2279 NV as well. Moreover, we trade speed for space, and do not
2280 cache the NV if we are sure it's not needed.
2283 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2284 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2285 == IS_NUMBER_IN_UV) {
2286 /* It's definitely an integer, only upgrade to PVIV */
2287 if (SvTYPE(sv) < SVt_PVIV)
2288 sv_upgrade(sv, SVt_PVIV);
2290 } else if (SvTYPE(sv) < SVt_PVNV)
2291 sv_upgrade(sv, SVt_PVNV);
2293 /* If NV preserves UV then we only use the UV value if we know that
2294 we aren't going to call atof() below. If NVs don't preserve UVs
2295 then the value returned may have more precision than atof() will
2296 return, even though value isn't perfectly accurate. */
2297 if ((numtype & (IS_NUMBER_IN_UV
2298 #ifdef NV_PRESERVES_UV
2301 )) == IS_NUMBER_IN_UV) {
2302 /* This won't turn off the public IOK flag if it was set above */
2303 (void)SvIOKp_on(sv);
2305 if (!(numtype & IS_NUMBER_NEG)) {
2307 if (value <= (UV)IV_MAX) {
2308 SvIV_set(sv, (IV)value);
2310 SvUV_set(sv, value);
2314 /* 2s complement assumption */
2315 if (value <= (UV)IV_MIN) {
2316 SvIV_set(sv, -(IV)value);
2318 /* Too negative for an IV. This is a double upgrade, but
2319 I'm assuming it will be rare. */
2320 if (SvTYPE(sv) < SVt_PVNV)
2321 sv_upgrade(sv, SVt_PVNV);
2325 SvNV_set(sv, -(NV)value);
2326 SvIV_set(sv, IV_MIN);
2330 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2331 will be in the previous block to set the IV slot, and the next
2332 block to set the NV slot. So no else here. */
2334 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2335 != IS_NUMBER_IN_UV) {
2336 /* It wasn't an (integer that doesn't overflow the UV). */
2337 SvNV_set(sv, Atof(SvPVX_const(sv)));
2339 if (! numtype && ckWARN(WARN_NUMERIC))
2342 #if defined(USE_LONG_DOUBLE)
2343 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2344 PTR2UV(sv), SvNVX(sv)));
2346 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2347 PTR2UV(sv), SvNVX(sv)));
2351 #ifdef NV_PRESERVES_UV
2352 (void)SvIOKp_on(sv);
2354 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2355 SvIV_set(sv, I_V(SvNVX(sv)));
2356 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2359 /* Integer is imprecise. NOK, IOKp */
2361 /* UV will not work better than IV */
2363 if (SvNVX(sv) > (NV)UV_MAX) {
2365 /* Integer is inaccurate. NOK, IOKp, is UV */
2366 SvUV_set(sv, UV_MAX);
2369 SvUV_set(sv, U_V(SvNVX(sv)));
2370 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2371 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2375 /* Integer is imprecise. NOK, IOKp, is UV */
2381 #else /* NV_PRESERVES_UV */
2382 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2383 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2384 /* The IV slot will have been set from value returned by
2385 grok_number above. The NV slot has just been set using
2388 assert (SvIOKp(sv));
2390 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2391 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2392 /* Small enough to preserve all bits. */
2393 (void)SvIOKp_on(sv);
2395 SvIV_set(sv, I_V(SvNVX(sv)));
2396 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2398 /* Assumption: first non-preserved integer is < IV_MAX,
2399 this NV is in the preserved range, therefore: */
2400 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2402 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);
2406 0 0 already failed to read UV.
2407 0 1 already failed to read UV.
2408 1 0 you won't get here in this case. IV/UV
2409 slot set, public IOK, Atof() unneeded.
2410 1 1 already read UV.
2411 so there's no point in sv_2iuv_non_preserve() attempting
2412 to use atol, strtol, strtoul etc. */
2413 if (sv_2iuv_non_preserve (sv, numtype)
2414 >= IS_NUMBER_OVERFLOW_IV)
2418 #endif /* NV_PRESERVES_UV */
2421 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2423 if (SvTYPE(sv) < SVt_IV)
2424 /* Typically the caller expects that sv_any is not NULL now. */
2425 sv_upgrade(sv, SVt_IV);
2428 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2429 PTR2UV(sv),SvIVX(sv)));
2430 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2434 =for apidoc sv_2uv_flags
2436 Return the unsigned integer value of an SV, doing any necessary string
2437 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2438 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2444 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2448 if (SvGMAGICAL(sv)) {
2449 if (flags & SV_GMAGIC)
2454 return U_V(SvNVX(sv));
2455 if (SvPOKp(sv) && SvLEN(sv))
2458 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2459 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2465 if (SvTHINKFIRST(sv)) {
2468 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2469 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2470 return SvUV(tmpstr);
2471 return PTR2UV(SvRV(sv));
2474 sv_force_normal_flags(sv, 0);
2476 if (SvREADONLY(sv) && !SvOK(sv)) {
2477 if (ckWARN(WARN_UNINITIALIZED))
2487 return (UV)SvIVX(sv);
2491 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2492 * without also getting a cached IV/UV from it at the same time
2493 * (ie PV->NV conversion should detect loss of accuracy and cache
2494 * IV or UV at same time to avoid this. */
2495 /* IV-over-UV optimisation - choose to cache IV if possible */
2497 if (SvTYPE(sv) == SVt_NV)
2498 sv_upgrade(sv, SVt_PVNV);
2500 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2501 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2502 SvIV_set(sv, I_V(SvNVX(sv)));
2503 if (SvNVX(sv) == (NV) SvIVX(sv)
2504 #ifndef NV_PRESERVES_UV
2505 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2506 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2507 /* Don't flag it as "accurately an integer" if the number
2508 came from a (by definition imprecise) NV operation, and
2509 we're outside the range of NV integer precision */
2512 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2513 DEBUG_c(PerlIO_printf(Perl_debug_log,
2514 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2520 /* IV not precise. No need to convert from PV, as NV
2521 conversion would already have cached IV if it detected
2522 that PV->IV would be better than PV->NV->IV
2523 flags already correct - don't set public IOK. */
2524 DEBUG_c(PerlIO_printf(Perl_debug_log,
2525 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2530 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2531 but the cast (NV)IV_MIN rounds to a the value less (more
2532 negative) than IV_MIN which happens to be equal to SvNVX ??
2533 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2534 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2535 (NV)UVX == NVX are both true, but the values differ. :-(
2536 Hopefully for 2s complement IV_MIN is something like
2537 0x8000000000000000 which will be exact. NWC */
2540 SvUV_set(sv, U_V(SvNVX(sv)));
2542 (SvNVX(sv) == (NV) SvUVX(sv))
2543 #ifndef NV_PRESERVES_UV
2544 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2545 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2546 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2547 /* Don't flag it as "accurately an integer" if the number
2548 came from a (by definition imprecise) NV operation, and
2549 we're outside the range of NV integer precision */
2554 DEBUG_c(PerlIO_printf(Perl_debug_log,
2555 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2561 else if (SvPOKp(sv) && SvLEN(sv)) {
2563 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2565 /* We want to avoid a possible problem when we cache a UV which
2566 may be later translated to an NV, and the resulting NV is not
2567 the translation of the initial data.
2569 This means that if we cache such a UV, we need to cache the
2570 NV as well. Moreover, we trade speed for space, and do not
2571 cache the NV if not needed.
2574 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2575 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2576 == IS_NUMBER_IN_UV) {
2577 /* It's definitely an integer, only upgrade to PVIV */
2578 if (SvTYPE(sv) < SVt_PVIV)
2579 sv_upgrade(sv, SVt_PVIV);
2581 } else if (SvTYPE(sv) < SVt_PVNV)
2582 sv_upgrade(sv, SVt_PVNV);
2584 /* If NV preserves UV then we only use the UV value if we know that
2585 we aren't going to call atof() below. If NVs don't preserve UVs
2586 then the value returned may have more precision than atof() will
2587 return, even though it isn't accurate. */
2588 if ((numtype & (IS_NUMBER_IN_UV
2589 #ifdef NV_PRESERVES_UV
2592 )) == IS_NUMBER_IN_UV) {
2593 /* This won't turn off the public IOK flag if it was set above */
2594 (void)SvIOKp_on(sv);
2596 if (!(numtype & IS_NUMBER_NEG)) {
2598 if (value <= (UV)IV_MAX) {
2599 SvIV_set(sv, (IV)value);
2601 /* it didn't overflow, and it was positive. */
2602 SvUV_set(sv, value);
2606 /* 2s complement assumption */
2607 if (value <= (UV)IV_MIN) {
2608 SvIV_set(sv, -(IV)value);
2610 /* Too negative for an IV. This is a double upgrade, but
2611 I'm assuming it will be rare. */
2612 if (SvTYPE(sv) < SVt_PVNV)
2613 sv_upgrade(sv, SVt_PVNV);
2617 SvNV_set(sv, -(NV)value);
2618 SvIV_set(sv, IV_MIN);
2623 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2624 != IS_NUMBER_IN_UV) {
2625 /* It wasn't an integer, or it overflowed the UV. */
2626 SvNV_set(sv, Atof(SvPVX_const(sv)));
2628 if (! numtype && ckWARN(WARN_NUMERIC))
2631 #if defined(USE_LONG_DOUBLE)
2632 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2633 PTR2UV(sv), SvNVX(sv)));
2635 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2636 PTR2UV(sv), SvNVX(sv)));
2639 #ifdef NV_PRESERVES_UV
2640 (void)SvIOKp_on(sv);
2642 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2643 SvIV_set(sv, I_V(SvNVX(sv)));
2644 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2647 /* Integer is imprecise. NOK, IOKp */
2649 /* UV will not work better than IV */
2651 if (SvNVX(sv) > (NV)UV_MAX) {
2653 /* Integer is inaccurate. NOK, IOKp, is UV */
2654 SvUV_set(sv, UV_MAX);
2657 SvUV_set(sv, U_V(SvNVX(sv)));
2658 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2659 NV preservse UV so can do correct comparison. */
2660 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2664 /* Integer is imprecise. NOK, IOKp, is UV */
2669 #else /* NV_PRESERVES_UV */
2670 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2671 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2672 /* The UV slot will have been set from value returned by
2673 grok_number above. The NV slot has just been set using
2676 assert (SvIOKp(sv));
2678 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2679 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2680 /* Small enough to preserve all bits. */
2681 (void)SvIOKp_on(sv);
2683 SvIV_set(sv, I_V(SvNVX(sv)));
2684 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2686 /* Assumption: first non-preserved integer is < IV_MAX,
2687 this NV is in the preserved range, therefore: */
2688 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2690 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);
2693 sv_2iuv_non_preserve (sv, numtype);
2695 #endif /* NV_PRESERVES_UV */
2699 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2700 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2703 if (SvTYPE(sv) < SVt_IV)
2704 /* Typically the caller expects that sv_any is not NULL now. */
2705 sv_upgrade(sv, SVt_IV);
2709 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2710 PTR2UV(sv),SvUVX(sv)));
2711 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2717 Return the num value of an SV, doing any necessary string or integer
2718 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2725 Perl_sv_2nv(pTHX_ register SV *sv)
2729 if (SvGMAGICAL(sv)) {
2733 if (SvPOKp(sv) && SvLEN(sv)) {
2734 if (!SvIOKp(sv) && ckWARN(WARN_NUMERIC) &&
2735 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2737 return Atof(SvPVX_const(sv));
2741 return (NV)SvUVX(sv);
2743 return (NV)SvIVX(sv);
2746 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2747 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2753 if (SvTHINKFIRST(sv)) {
2756 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2757 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2758 return SvNV(tmpstr);
2759 return PTR2NV(SvRV(sv));
2762 sv_force_normal_flags(sv, 0);
2764 if (SvREADONLY(sv) && !SvOK(sv)) {
2765 if (ckWARN(WARN_UNINITIALIZED))
2770 if (SvTYPE(sv) < SVt_NV) {
2771 if (SvTYPE(sv) == SVt_IV)
2772 sv_upgrade(sv, SVt_PVNV);
2774 sv_upgrade(sv, SVt_NV);
2775 #ifdef USE_LONG_DOUBLE
2777 STORE_NUMERIC_LOCAL_SET_STANDARD();
2778 PerlIO_printf(Perl_debug_log,
2779 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2780 PTR2UV(sv), SvNVX(sv));
2781 RESTORE_NUMERIC_LOCAL();
2785 STORE_NUMERIC_LOCAL_SET_STANDARD();
2786 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2787 PTR2UV(sv), SvNVX(sv));
2788 RESTORE_NUMERIC_LOCAL();
2792 else if (SvTYPE(sv) < SVt_PVNV)
2793 sv_upgrade(sv, SVt_PVNV);
2798 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2799 #ifdef NV_PRESERVES_UV
2802 /* Only set the public NV OK flag if this NV preserves the IV */
2803 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2804 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2805 : (SvIVX(sv) == I_V(SvNVX(sv))))
2811 else if (SvPOKp(sv) && SvLEN(sv)) {
2813 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2814 if (!SvIOKp(sv) && !numtype && ckWARN(WARN_NUMERIC))
2816 #ifdef NV_PRESERVES_UV
2817 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2818 == IS_NUMBER_IN_UV) {
2819 /* It's definitely an integer */
2820 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2822 SvNV_set(sv, Atof(SvPVX_const(sv)));
2825 SvNV_set(sv, Atof(SvPVX_const(sv)));
2826 /* Only set the public NV OK flag if this NV preserves the value in
2827 the PV at least as well as an IV/UV would.
2828 Not sure how to do this 100% reliably. */
2829 /* if that shift count is out of range then Configure's test is
2830 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2832 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2833 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2834 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2835 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2836 /* Can't use strtol etc to convert this string, so don't try.
2837 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2840 /* value has been set. It may not be precise. */
2841 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2842 /* 2s complement assumption for (UV)IV_MIN */
2843 SvNOK_on(sv); /* Integer is too negative. */
2848 if (numtype & IS_NUMBER_NEG) {
2849 SvIV_set(sv, -(IV)value);
2850 } else if (value <= (UV)IV_MAX) {
2851 SvIV_set(sv, (IV)value);
2853 SvUV_set(sv, value);
2857 if (numtype & IS_NUMBER_NOT_INT) {
2858 /* I believe that even if the original PV had decimals,
2859 they are lost beyond the limit of the FP precision.
2860 However, neither is canonical, so both only get p
2861 flags. NWC, 2000/11/25 */
2862 /* Both already have p flags, so do nothing */
2864 const NV nv = SvNVX(sv);
2865 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2866 if (SvIVX(sv) == I_V(nv)) {
2871 /* It had no "." so it must be integer. */
2874 /* between IV_MAX and NV(UV_MAX).
2875 Could be slightly > UV_MAX */
2877 if (numtype & IS_NUMBER_NOT_INT) {
2878 /* UV and NV both imprecise. */
2880 const UV nv_as_uv = U_V(nv);
2882 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2893 #endif /* NV_PRESERVES_UV */
2896 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2898 if (SvTYPE(sv) < SVt_NV)
2899 /* Typically the caller expects that sv_any is not NULL now. */
2900 /* XXX Ilya implies that this is a bug in callers that assume this
2901 and ideally should be fixed. */
2902 sv_upgrade(sv, SVt_NV);
2905 #if defined(USE_LONG_DOUBLE)
2907 STORE_NUMERIC_LOCAL_SET_STANDARD();
2908 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2909 PTR2UV(sv), SvNVX(sv));
2910 RESTORE_NUMERIC_LOCAL();
2914 STORE_NUMERIC_LOCAL_SET_STANDARD();
2915 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2916 PTR2UV(sv), SvNVX(sv));
2917 RESTORE_NUMERIC_LOCAL();
2923 /* asIV(): extract an integer from the string value of an SV.
2924 * Caller must validate PVX */
2927 S_asIV(pTHX_ SV *sv)
2930 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2932 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2933 == IS_NUMBER_IN_UV) {
2934 /* It's definitely an integer */
2935 if (numtype & IS_NUMBER_NEG) {
2936 if (value < (UV)IV_MIN)
2939 if (value < (UV)IV_MAX)
2944 if (ckWARN(WARN_NUMERIC))
2947 return I_V(Atof(SvPVX_const(sv)));
2950 /* asUV(): extract an unsigned integer from the string value of an SV
2951 * Caller must validate PVX */
2954 S_asUV(pTHX_ SV *sv)
2957 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2959 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2960 == IS_NUMBER_IN_UV) {
2961 /* It's definitely an integer */
2962 if (!(numtype & IS_NUMBER_NEG))
2966 if (ckWARN(WARN_NUMERIC))
2969 return U_V(Atof(SvPVX_const(sv)));
2972 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2973 * UV as a string towards the end of buf, and return pointers to start and
2976 * We assume that buf is at least TYPE_CHARS(UV) long.
2980 S_uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2982 char *ptr = buf + TYPE_CHARS(UV);
2983 char * const ebuf = ptr;
2996 *--ptr = '0' + (char)(uv % 10);
3005 =for apidoc sv_2pv_flags
3007 Returns a pointer to the string value of an SV, and sets *lp to its length.
3008 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3010 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3011 usually end up here too.
3017 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3022 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3023 char *tmpbuf = tbuf;
3024 STRLEN len = 0; /* Hush gcc. len is always initialised before use. */
3031 if (SvGMAGICAL(sv)) {
3032 if (flags & SV_GMAGIC)
3037 if (flags & SV_MUTABLE_RETURN)
3038 return SvPVX_mutable(sv);
3039 if (flags & SV_CONST_RETURN)
3040 return (char *)SvPVX_const(sv);
3044 len = SvIsUV(sv) ? my_sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv))
3045 : my_sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3047 goto tokensave_has_len;
3050 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3055 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3056 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
3064 if (SvTHINKFIRST(sv)) {
3067 register const char *typestr;
3068 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3069 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3071 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3074 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3075 if (flags & SV_CONST_RETURN) {
3076 pv = (char *) SvPVX_const(tmpstr);
3078 pv = (flags & SV_MUTABLE_RETURN)
3079 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3082 *lp = SvCUR(tmpstr);
3084 pv = sv_2pv_flags(tmpstr, lp, flags);
3095 typestr = "NULLREF";
3099 switch (SvTYPE(sv)) {
3101 if ( ((SvFLAGS(sv) &
3102 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3103 == (SVs_OBJECT|SVs_SMG))
3104 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3105 const regexp *re = (regexp *)mg->mg_obj;
3108 const char *fptr = "msix";
3113 char need_newline = 0;
3114 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3116 while((ch = *fptr++)) {
3118 reflags[left++] = ch;
3121 reflags[right--] = ch;
3126 reflags[left] = '-';
3130 mg->mg_len = re->prelen + 4 + left;
3132 * If /x was used, we have to worry about a regex
3133 * ending with a comment later being embedded
3134 * within another regex. If so, we don't want this
3135 * regex's "commentization" to leak out to the
3136 * right part of the enclosing regex, we must cap
3137 * it with a newline.
3139 * So, if /x was used, we scan backwards from the
3140 * end of the regex. If we find a '#' before we
3141 * find a newline, we need to add a newline
3142 * ourself. If we find a '\n' first (or if we
3143 * don't find '#' or '\n'), we don't need to add
3144 * anything. -jfriedl
3146 if (PMf_EXTENDED & re->reganch)
3148 const char *endptr = re->precomp + re->prelen;
3149 while (endptr >= re->precomp)
3151 const char c = *(endptr--);
3153 break; /* don't need another */
3155 /* we end while in a comment, so we
3157 mg->mg_len++; /* save space for it */
3158 need_newline = 1; /* note to add it */
3164 Newx(mg->mg_ptr, mg->mg_len + 1 + left, char);
3165 Copy("(?", mg->mg_ptr, 2, char);
3166 Copy(reflags, mg->mg_ptr+2, left, char);
3167 Copy(":", mg->mg_ptr+left+2, 1, char);
3168 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3170 mg->mg_ptr[mg->mg_len - 2] = '\n';
3171 mg->mg_ptr[mg->mg_len - 1] = ')';
3172 mg->mg_ptr[mg->mg_len] = 0;
3174 PL_reginterp_cnt += re->program[0].next_off;
3176 if (re->reganch & ROPT_UTF8)
3192 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3193 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3194 /* tied lvalues should appear to be
3195 * scalars for backwards compatitbility */
3196 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3197 ? "SCALAR" : "LVALUE"; break;
3198 case SVt_PVAV: typestr = "ARRAY"; break;
3199 case SVt_PVHV: typestr = "HASH"; break;
3200 case SVt_PVCV: typestr = "CODE"; break;
3201 case SVt_PVGV: typestr = "GLOB"; break;
3202 case SVt_PVFM: typestr = "FORMAT"; break;
3203 case SVt_PVIO: typestr = "IO"; break;
3204 default: typestr = "UNKNOWN"; break;
3208 const char * const name = HvNAME_get(SvSTASH(sv));
3209 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3210 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3213 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3217 *lp = strlen(typestr);
3218 return (char *)typestr;
3220 if (SvREADONLY(sv) && !SvOK(sv)) {
3221 if (ckWARN(WARN_UNINITIALIZED))
3228 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3229 /* I'm assuming that if both IV and NV are equally valid then
3230 converting the IV is going to be more efficient */
3231 const U32 isIOK = SvIOK(sv);
3232 const U32 isUIOK = SvIsUV(sv);
3233 char buf[TYPE_CHARS(UV)];
3236 if (SvTYPE(sv) < SVt_PVIV)
3237 sv_upgrade(sv, SVt_PVIV);
3239 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3241 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3242 /* inlined from sv_setpvn */
3243 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3244 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3245 SvCUR_set(sv, ebuf - ptr);
3255 else if (SvNOKp(sv)) {
3256 if (SvTYPE(sv) < SVt_PVNV)
3257 sv_upgrade(sv, SVt_PVNV);
3258 /* The +20 is pure guesswork. Configure test needed. --jhi */
3259 s = SvGROW_mutable(sv, NV_DIG + 20);
3260 olderrno = errno; /* some Xenix systems wipe out errno here */
3262 if (SvNVX(sv) == 0.0)
3263 (void)strcpy(s,"0");
3267 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3270 #ifdef FIXNEGATIVEZERO
3271 if (*s == '-' && s[1] == '0' && !s[2])
3281 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
3285 if (SvTYPE(sv) < SVt_PV)
3286 /* Typically the caller expects that sv_any is not NULL now. */
3287 sv_upgrade(sv, SVt_PV);
3291 const STRLEN len = s - SvPVX_const(sv);
3297 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3298 PTR2UV(sv),SvPVX_const(sv)));
3299 if (flags & SV_CONST_RETURN)
3300 return (char *)SvPVX_const(sv);
3301 if (flags & SV_MUTABLE_RETURN)
3302 return SvPVX_mutable(sv);
3306 len = strlen(tmpbuf);
3309 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3310 /* Sneaky stuff here */
3314 tsv = newSVpvn(tmpbuf, len);
3323 #ifdef FIXNEGATIVEZERO
3324 if (len == 2 && tmpbuf[0] == '-' && tmpbuf[1] == '0') {
3330 SvUPGRADE(sv, SVt_PV);
3333 s = SvGROW_mutable(sv, len + 1);
3336 return memcpy(s, tmpbuf, len + 1);
3341 =for apidoc sv_copypv
3343 Copies a stringified representation of the source SV into the
3344 destination SV. Automatically performs any necessary mg_get and
3345 coercion of numeric values into strings. Guaranteed to preserve
3346 UTF-8 flag even from overloaded objects. Similar in nature to
3347 sv_2pv[_flags] but operates directly on an SV instead of just the
3348 string. Mostly uses sv_2pv_flags to do its work, except when that
3349 would lose the UTF-8'ness of the PV.
3355 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3358 const char * const s = SvPV_const(ssv,len);
3359 sv_setpvn(dsv,s,len);
3367 =for apidoc sv_2pvbyte
3369 Return a pointer to the byte-encoded representation of the SV, and set *lp
3370 to its length. May cause the SV to be downgraded from UTF-8 as a
3373 Usually accessed via the C<SvPVbyte> macro.
3379 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3381 sv_utf8_downgrade(sv,0);
3382 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3386 =for apidoc sv_2pvutf8
3388 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3389 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3391 Usually accessed via the C<SvPVutf8> macro.
3397 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3399 sv_utf8_upgrade(sv);
3400 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3405 =for apidoc sv_2bool
3407 This function is only called on magical items, and is only used by
3408 sv_true() or its macro equivalent.
3414 Perl_sv_2bool(pTHX_ register SV *sv)
3422 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3423 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3424 return (bool)SvTRUE(tmpsv);
3425 return SvRV(sv) != 0;
3428 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
3430 (*sv->sv_u.svu_pv > '0' ||
3431 Xpvtmp->xpv_cur > 1 ||
3432 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3439 return SvIVX(sv) != 0;
3442 return SvNVX(sv) != 0.0;
3450 =for apidoc sv_utf8_upgrade
3452 Converts the PV of an SV to its UTF-8-encoded form.
3453 Forces the SV to string form if it is not already.
3454 Always sets the SvUTF8 flag to avoid future validity checks even
3455 if all the bytes have hibit clear.
3457 This is not as a general purpose byte encoding to Unicode interface:
3458 use the Encode extension for that.
3460 =for apidoc sv_utf8_upgrade_flags
3462 Converts the PV of an SV to its UTF-8-encoded form.
3463 Forces the SV to string form if it is not already.
3464 Always sets the SvUTF8 flag to avoid future validity checks even
3465 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3466 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3467 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3469 This is not as a general purpose byte encoding to Unicode interface:
3470 use the Encode extension for that.
3476 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3478 if (sv == &PL_sv_undef)
3482 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3483 (void) sv_2pv_flags(sv,&len, flags);
3487 (void) SvPV_force(sv,len);
3496 sv_force_normal_flags(sv, 0);
3499 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3500 sv_recode_to_utf8(sv, PL_encoding);
3501 else { /* Assume Latin-1/EBCDIC */
3502 /* This function could be much more efficient if we
3503 * had a FLAG in SVs to signal if there are any hibit
3504 * chars in the PV. Given that there isn't such a flag
3505 * make the loop as fast as possible. */
3506 const U8 *s = (U8 *) SvPVX_const(sv);
3507 const U8 * const e = (U8 *) SvEND(sv);
3513 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3517 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3518 U8 * const recoded = bytes_to_utf8((U8*)s, &len);
3520 SvPV_free(sv); /* No longer using what was there before. */
3522 SvPV_set(sv, (char*)recoded);
3523 SvCUR_set(sv, len - 1);
3524 SvLEN_set(sv, len); /* No longer know the real size. */
3526 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3533 =for apidoc sv_utf8_downgrade
3535 Attempts to convert the PV of an SV from characters to bytes.
3536 If the PV contains a character beyond byte, this conversion will fail;
3537 in this case, either returns false or, if C<fail_ok> is not
3540 This is not as a general purpose Unicode to byte encoding interface:
3541 use the Encode extension for that.
3547 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3549 if (SvPOKp(sv) && SvUTF8(sv)) {
3555 sv_force_normal_flags(sv, 0);
3557 s = (U8 *) SvPV(sv, len);
3558 if (!utf8_to_bytes(s, &len)) {
3563 Perl_croak(aTHX_ "Wide character in %s",
3566 Perl_croak(aTHX_ "Wide character");
3577 =for apidoc sv_utf8_encode
3579 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3580 flag off so that it looks like octets again.
3586 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3588 (void) sv_utf8_upgrade(sv);
3590 sv_force_normal_flags(sv, 0);
3592 if (SvREADONLY(sv)) {
3593 Perl_croak(aTHX_ PL_no_modify);
3599 =for apidoc sv_utf8_decode
3601 If the PV of the SV is an octet sequence in UTF-8
3602 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3603 so that it looks like a character. If the PV contains only single-byte
3604 characters, the C<SvUTF8> flag stays being off.
3605 Scans PV for validity and returns false if the PV is invalid UTF-8.
3611 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3617 /* The octets may have got themselves encoded - get them back as
3620 if (!sv_utf8_downgrade(sv, TRUE))
3623 /* it is actually just a matter of turning the utf8 flag on, but
3624 * we want to make sure everything inside is valid utf8 first.
3626 c = (const U8 *) SvPVX_const(sv);
3627 if (!is_utf8_string(c, SvCUR(sv)+1))
3629 e = (const U8 *) SvEND(sv);
3632 if (!UTF8_IS_INVARIANT(ch)) {
3642 =for apidoc sv_setsv
3644 Copies the contents of the source SV C<ssv> into the destination SV
3645 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3646 function if the source SV needs to be reused. Does not handle 'set' magic.
3647 Loosely speaking, it performs a copy-by-value, obliterating any previous
3648 content of the destination.
3650 You probably want to use one of the assortment of wrappers, such as
3651 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3652 C<SvSetMagicSV_nosteal>.
3654 =for apidoc sv_setsv_flags
3656 Copies the contents of the source SV C<ssv> into the destination SV
3657 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3658 function if the source SV needs to be reused. Does not handle 'set' magic.
3659 Loosely speaking, it performs a copy-by-value, obliterating any previous
3660 content of the destination.
3661 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3662 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3663 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3664 and C<sv_setsv_nomg> are implemented in terms of this function.
3666 You probably want to use one of the assortment of wrappers, such as
3667 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3668 C<SvSetMagicSV_nosteal>.
3670 This is the primary function for copying scalars, and most other
3671 copy-ish functions and macros use this underneath.
3677 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3679 register U32 sflags;
3685 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3687 sstr = &PL_sv_undef;
3688 stype = SvTYPE(sstr);
3689 dtype = SvTYPE(dstr);
3694 /* need to nuke the magic */
3696 SvRMAGICAL_off(dstr);
3699 /* There's a lot of redundancy below but we're going for speed here */
3704 if (dtype != SVt_PVGV) {
3705 (void)SvOK_off(dstr);
3713 sv_upgrade(dstr, SVt_IV);
3716 sv_upgrade(dstr, SVt_PVNV);
3720 sv_upgrade(dstr, SVt_PVIV);
3723 (void)SvIOK_only(dstr);
3724 SvIV_set(dstr, SvIVX(sstr));
3727 if (SvTAINTED(sstr))
3738 sv_upgrade(dstr, SVt_NV);
3743 sv_upgrade(dstr, SVt_PVNV);
3746 SvNV_set(dstr, SvNVX(sstr));
3747 (void)SvNOK_only(dstr);
3748 if (SvTAINTED(sstr))
3756 sv_upgrade(dstr, SVt_RV);
3757 else if (dtype == SVt_PVGV &&
3758 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3761 if (GvIMPORTED(dstr) != GVf_IMPORTED
3762 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3764 GvIMPORTED_on(dstr);
3773 #ifdef PERL_OLD_COPY_ON_WRITE
3774 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3775 if (dtype < SVt_PVIV)
3776 sv_upgrade(dstr, SVt_PVIV);
3783 sv_upgrade(dstr, SVt_PV);
3786 if (dtype < SVt_PVIV)
3787 sv_upgrade(dstr, SVt_PVIV);
3790 if (dtype < SVt_PVNV)
3791 sv_upgrade(dstr, SVt_PVNV);
3798 const char * const type = sv_reftype(sstr,0);
3800 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3802 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3807 if (dtype <= SVt_PVGV) {
3809 if (dtype != SVt_PVGV) {
3810 const char * const name = GvNAME(sstr);
3811 const STRLEN len = GvNAMELEN(sstr);
3812 /* don't upgrade SVt_PVLV: it can hold a glob */
3813 if (dtype != SVt_PVLV)
3814 sv_upgrade(dstr, SVt_PVGV);
3815 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3816 GvSTASH(dstr) = GvSTASH(sstr);
3818 Perl_sv_add_backref(aTHX_ (SV*)GvSTASH(dstr), dstr);
3819 GvNAME(dstr) = savepvn(name, len);
3820 GvNAMELEN(dstr) = len;
3821 SvFAKE_on(dstr); /* can coerce to non-glob */
3824 #ifdef GV_UNIQUE_CHECK
3825 if (GvUNIQUE((GV*)dstr)) {
3826 Perl_croak(aTHX_ PL_no_modify);
3830 (void)SvOK_off(dstr);
3831 GvINTRO_off(dstr); /* one-shot flag */
3833 GvGP(dstr) = gp_ref(GvGP(sstr));
3834 if (SvTAINTED(sstr))
3836 if (GvIMPORTED(dstr) != GVf_IMPORTED
3837 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3839 GvIMPORTED_on(dstr);
3847 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3849 if ((int)SvTYPE(sstr) != stype) {
3850 stype = SvTYPE(sstr);
3851 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3855 if (stype == SVt_PVLV)
3856 SvUPGRADE(dstr, SVt_PVNV);
3858 SvUPGRADE(dstr, (U32)stype);
3861 sflags = SvFLAGS(sstr);
3863 if (sflags & SVf_ROK) {
3864 if (dtype >= SVt_PV) {
3865 if (dtype == SVt_PVGV) {
3866 SV * const sref = SvREFCNT_inc(SvRV(sstr));
3868 const int intro = GvINTRO(dstr);
3870 #ifdef GV_UNIQUE_CHECK
3871 if (GvUNIQUE((GV*)dstr)) {
3872 Perl_croak(aTHX_ PL_no_modify);
3877 GvINTRO_off(dstr); /* one-shot flag */
3878 GvLINE(dstr) = CopLINE(PL_curcop);
3879 GvEGV(dstr) = (GV*)dstr;
3882 switch (SvTYPE(sref)) {
3885 SAVEGENERICSV(GvAV(dstr));
3887 dref = (SV*)GvAV(dstr);
3888 GvAV(dstr) = (AV*)sref;
3889 if (!GvIMPORTED_AV(dstr)
3890 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3892 GvIMPORTED_AV_on(dstr);
3897 SAVEGENERICSV(GvHV(dstr));
3899 dref = (SV*)GvHV(dstr);
3900 GvHV(dstr) = (HV*)sref;
3901 if (!GvIMPORTED_HV(dstr)
3902 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3904 GvIMPORTED_HV_on(dstr);
3909 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3910 SvREFCNT_dec(GvCV(dstr));
3911 GvCV(dstr) = Nullcv;
3912 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3913 PL_sub_generation++;
3915 SAVEGENERICSV(GvCV(dstr));
3918 dref = (SV*)GvCV(dstr);
3919 if (GvCV(dstr) != (CV*)sref) {
3920 CV* const cv = GvCV(dstr);
3922 if (!GvCVGEN((GV*)dstr) &&
3923 (CvROOT(cv) || CvXSUB(cv)))
3925 /* Redefining a sub - warning is mandatory if
3926 it was a const and its value changed. */
3927 if (ckWARN(WARN_REDEFINE)
3929 && (!CvCONST((CV*)sref)
3930 || sv_cmp(cv_const_sv(cv),
3931 cv_const_sv((CV*)sref)))))
3933 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3935 ? "Constant subroutine %s::%s redefined"
3936 : "Subroutine %s::%s redefined",
3937 HvNAME_get(GvSTASH((GV*)dstr)),
3938 GvENAME((GV*)dstr));
3942 cv_ckproto(cv, (GV*)dstr,
3944 ? SvPVX_const(sref) : Nullch);
3946 GvCV(dstr) = (CV*)sref;
3947 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3948 GvASSUMECV_on(dstr);
3949 PL_sub_generation++;
3951 if (!GvIMPORTED_CV(dstr)
3952 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3954 GvIMPORTED_CV_on(dstr);
3959 SAVEGENERICSV(GvIOp(dstr));
3961 dref = (SV*)GvIOp(dstr);
3962 GvIOp(dstr) = (IO*)sref;
3966 SAVEGENERICSV(GvFORM(dstr));
3968 dref = (SV*)GvFORM(dstr);
3969 GvFORM(dstr) = (CV*)sref;
3973 SAVEGENERICSV(GvSV(dstr));
3975 dref = (SV*)GvSV(dstr);
3977 if (!GvIMPORTED_SV(dstr)
3978 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3980 GvIMPORTED_SV_on(dstr);
3986 if (SvTAINTED(sstr))
3990 if (SvPVX_const(dstr)) {
3996 (void)SvOK_off(dstr);
3997 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
3999 if (sflags & SVp_NOK) {
4001 /* Only set the public OK flag if the source has public OK. */
4002 if (sflags & SVf_NOK)
4003 SvFLAGS(dstr) |= SVf_NOK;
4004 SvNV_set(dstr, SvNVX(sstr));
4006 if (sflags & SVp_IOK) {
4007 (void)SvIOKp_on(dstr);
4008 if (sflags & SVf_IOK)
4009 SvFLAGS(dstr) |= SVf_IOK;
4010 if (sflags & SVf_IVisUV)
4012 SvIV_set(dstr, SvIVX(sstr));
4014 if (SvAMAGIC(sstr)) {
4018 else if (sflags & SVp_POK) {
4022 * Check to see if we can just swipe the string. If so, it's a
4023 * possible small lose on short strings, but a big win on long ones.
4024 * It might even be a win on short strings if SvPVX_const(dstr)
4025 * has to be allocated and SvPVX_const(sstr) has to be freed.
4028 /* Whichever path we take through the next code, we want this true,
4029 and doing it now facilitates the COW check. */
4030 (void)SvPOK_only(dstr);
4033 /* We're not already COW */
4034 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4035 #ifndef PERL_OLD_COPY_ON_WRITE
4036 /* or we are, but dstr isn't a suitable target. */
4037 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4042 (sflags & SVs_TEMP) && /* slated for free anyway? */
4043 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4044 (!(flags & SV_NOSTEAL)) &&
4045 /* and we're allowed to steal temps */
4046 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4047 SvLEN(sstr) && /* and really is a string */
4048 /* and won't be needed again, potentially */
4049 !(PL_op && PL_op->op_type == OP_AASSIGN))
4050 #ifdef PERL_OLD_COPY_ON_WRITE
4051 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4052 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4053 && SvTYPE(sstr) >= SVt_PVIV)
4056 /* Failed the swipe test, and it's not a shared hash key either.
4057 Have to copy the string. */
4058 STRLEN len = SvCUR(sstr);
4059 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4060 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4061 SvCUR_set(dstr, len);
4062 *SvEND(dstr) = '\0';
4064 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4066 /* Either it's a shared hash key, or it's suitable for
4067 copy-on-write or we can swipe the string. */
4069 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4073 #ifdef PERL_OLD_COPY_ON_WRITE
4075 /* I believe I should acquire a global SV mutex if
4076 it's a COW sv (not a shared hash key) to stop
4077 it going un copy-on-write.
4078 If the source SV has gone un copy on write between up there
4079 and down here, then (assert() that) it is of the correct
4080 form to make it copy on write again */
4081 if ((sflags & (SVf_FAKE | SVf_READONLY))
4082 != (SVf_FAKE | SVf_READONLY)) {
4083 SvREADONLY_on(sstr);
4085 /* Make the source SV into a loop of 1.
4086 (about to become 2) */
4087 SV_COW_NEXT_SV_SET(sstr, sstr);
4091 /* Initial code is common. */
4092 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4097 /* making another shared SV. */
4098 STRLEN cur = SvCUR(sstr);
4099 STRLEN len = SvLEN(sstr);
4100 #ifdef PERL_OLD_COPY_ON_WRITE
4102 assert (SvTYPE(dstr) >= SVt_PVIV);
4103 /* SvIsCOW_normal */
4104 /* splice us in between source and next-after-source. */
4105 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4106 SV_COW_NEXT_SV_SET(sstr, dstr);
4107 SvPV_set(dstr, SvPVX_mutable(sstr));
4111 /* SvIsCOW_shared_hash */
4112 DEBUG_C(PerlIO_printf(Perl_debug_log,
4113 "Copy on write: Sharing hash\n"));
4115 assert (SvTYPE(dstr) >= SVt_PV);
4117 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4119 SvLEN_set(dstr, len);
4120 SvCUR_set(dstr, cur);
4121 SvREADONLY_on(dstr);
4123 /* Relesase a global SV mutex. */
4126 { /* Passes the swipe test. */
4127 SvPV_set(dstr, SvPVX_mutable(sstr));
4128 SvLEN_set(dstr, SvLEN(sstr));
4129 SvCUR_set(dstr, SvCUR(sstr));
4132 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4133 SvPV_set(sstr, Nullch);
4139 if (sflags & SVf_UTF8)
4141 if (sflags & SVp_NOK) {
4143 if (sflags & SVf_NOK)
4144 SvFLAGS(dstr) |= SVf_NOK;
4145 SvNV_set(dstr, SvNVX(sstr));
4147 if (sflags & SVp_IOK) {
4148 (void)SvIOKp_on(dstr);
4149 if (sflags & SVf_IOK)
4150 SvFLAGS(dstr) |= SVf_IOK;
4151 if (sflags & SVf_IVisUV)
4153 SvIV_set(dstr, SvIVX(sstr));
4156 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4157 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4158 smg->mg_ptr, smg->mg_len);
4159 SvRMAGICAL_on(dstr);
4162 else if (sflags & SVp_IOK) {
4163 if (sflags & SVf_IOK)
4164 (void)SvIOK_only(dstr);
4166 (void)SvOK_off(dstr);
4167 (void)SvIOKp_on(dstr);
4169 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4170 if (sflags & SVf_IVisUV)
4172 SvIV_set(dstr, SvIVX(sstr));
4173 if (sflags & SVp_NOK) {
4174 if (sflags & SVf_NOK)
4175 (void)SvNOK_on(dstr);
4177 (void)SvNOKp_on(dstr);
4178 SvNV_set(dstr, SvNVX(sstr));
4181 else if (sflags & SVp_NOK) {
4182 if (sflags & SVf_NOK)
4183 (void)SvNOK_only(dstr);
4185 (void)SvOK_off(dstr);
4188 SvNV_set(dstr, SvNVX(sstr));
4191 if (dtype == SVt_PVGV) {
4192 if (ckWARN(WARN_MISC))
4193 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4196 (void)SvOK_off(dstr);
4198 if (SvTAINTED(sstr))
4203 =for apidoc sv_setsv_mg
4205 Like C<sv_setsv>, but also handles 'set' magic.
4211 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4213 sv_setsv(dstr,sstr);
4217 #ifdef PERL_OLD_COPY_ON_WRITE
4219 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4221 STRLEN cur = SvCUR(sstr);
4222 STRLEN len = SvLEN(sstr);
4223 register char *new_pv;
4226 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4234 if (SvTHINKFIRST(dstr))
4235 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4236 else if (SvPVX_const(dstr))
4237 Safefree(SvPVX_const(dstr));
4241 SvUPGRADE(dstr, SVt_PVIV);
4243 assert (SvPOK(sstr));
4244 assert (SvPOKp(sstr));
4245 assert (!SvIOK(sstr));
4246 assert (!SvIOKp(sstr));
4247 assert (!SvNOK(sstr));
4248 assert (!SvNOKp(sstr));
4250 if (SvIsCOW(sstr)) {
4252 if (SvLEN(sstr) == 0) {
4253 /* source is a COW shared hash key. */
4254 DEBUG_C(PerlIO_printf(Perl_debug_log,
4255 "Fast copy on write: Sharing hash\n"));
4256 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4259 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4261 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4262 SvUPGRADE(sstr, SVt_PVIV);
4263 SvREADONLY_on(sstr);
4265 DEBUG_C(PerlIO_printf(Perl_debug_log,
4266 "Fast copy on write: Converting sstr to COW\n"));
4267 SV_COW_NEXT_SV_SET(dstr, sstr);
4269 SV_COW_NEXT_SV_SET(sstr, dstr);
4270 new_pv = SvPVX_mutable(sstr);
4273 SvPV_set(dstr, new_pv);
4274 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4277 SvLEN_set(dstr, len);
4278 SvCUR_set(dstr, cur);
4287 =for apidoc sv_setpvn
4289 Copies a string into an SV. The C<len> parameter indicates the number of
4290 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4291 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4297 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4299 register char *dptr;
4301 SV_CHECK_THINKFIRST_COW_DROP(sv);
4307 /* len is STRLEN which is unsigned, need to copy to signed */
4310 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4312 SvUPGRADE(sv, SVt_PV);
4314 dptr = SvGROW(sv, len + 1);
4315 Move(ptr,dptr,len,char);
4318 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4323 =for apidoc sv_setpvn_mg
4325 Like C<sv_setpvn>, but also handles 'set' magic.
4331 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4333 sv_setpvn(sv,ptr,len);
4338 =for apidoc sv_setpv
4340 Copies a string into an SV. The string must be null-terminated. Does not
4341 handle 'set' magic. See C<sv_setpv_mg>.
4347 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4349 register STRLEN len;
4351 SV_CHECK_THINKFIRST_COW_DROP(sv);
4357 SvUPGRADE(sv, SVt_PV);
4359 SvGROW(sv, len + 1);
4360 Move(ptr,SvPVX(sv),len+1,char);
4362 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4367 =for apidoc sv_setpv_mg
4369 Like C<sv_setpv>, but also handles 'set' magic.
4375 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4382 =for apidoc sv_usepvn
4384 Tells an SV to use C<ptr> to find its string value. Normally the string is
4385 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4386 The C<ptr> should point to memory that was allocated by C<malloc>. The
4387 string length, C<len>, must be supplied. This function will realloc the
4388 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4389 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4390 See C<sv_usepvn_mg>.
4396 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4399 SV_CHECK_THINKFIRST_COW_DROP(sv);
4400 SvUPGRADE(sv, SVt_PV);
4405 if (SvPVX_const(sv))
4408 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4409 ptr = saferealloc (ptr, allocate);
4412 SvLEN_set(sv, allocate);
4414 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4419 =for apidoc sv_usepvn_mg
4421 Like C<sv_usepvn>, but also handles 'set' magic.
4427 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4429 sv_usepvn(sv,ptr,len);
4433 #ifdef PERL_OLD_COPY_ON_WRITE
4434 /* Need to do this *after* making the SV normal, as we need the buffer
4435 pointer to remain valid until after we've copied it. If we let go too early,
4436 another thread could invalidate it by unsharing last of the same hash key
4437 (which it can do by means other than releasing copy-on-write Svs)
4438 or by changing the other copy-on-write SVs in the loop. */
4440 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4442 if (len) { /* this SV was SvIsCOW_normal(sv) */
4443 /* we need to find the SV pointing to us. */
4444 SV * const current = SV_COW_NEXT_SV(after);
4446 if (current == sv) {
4447 /* The SV we point to points back to us (there were only two of us
4449 Hence other SV is no longer copy on write either. */
4451 SvREADONLY_off(after);
4453 /* We need to follow the pointers around the loop. */
4455 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4458 /* don't loop forever if the structure is bust, and we have
4459 a pointer into a closed loop. */
4460 assert (current != after);
4461 assert (SvPVX_const(current) == pvx);
4463 /* Make the SV before us point to the SV after us. */
4464 SV_COW_NEXT_SV_SET(current, after);
4467 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4472 Perl_sv_release_IVX(pTHX_ register SV *sv)
4475 sv_force_normal_flags(sv, 0);
4481 =for apidoc sv_force_normal_flags
4483 Undo various types of fakery on an SV: if the PV is a shared string, make
4484 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4485 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4486 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4487 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4488 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4489 set to some other value.) In addition, the C<flags> parameter gets passed to
4490 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4491 with flags set to 0.
4497 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4499 #ifdef PERL_OLD_COPY_ON_WRITE
4500 if (SvREADONLY(sv)) {
4501 /* At this point I believe I should acquire a global SV mutex. */
4503 const char * const pvx = SvPVX_const(sv);
4504 const STRLEN len = SvLEN(sv);
4505 const STRLEN cur = SvCUR(sv);
4506 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4508 PerlIO_printf(Perl_debug_log,
4509 "Copy on write: Force normal %ld\n",
4515 /* This SV doesn't own the buffer, so need to Newx() a new one: */
4516 SvPV_set(sv, (char*)0);
4518 if (flags & SV_COW_DROP_PV) {
4519 /* OK, so we don't need to copy our buffer. */
4522 SvGROW(sv, cur + 1);
4523 Move(pvx,SvPVX(sv),cur,char);
4527 sv_release_COW(sv, pvx, len, next);
4532 else if (IN_PERL_RUNTIME)
4533 Perl_croak(aTHX_ PL_no_modify);
4534 /* At this point I believe that I can drop the global SV mutex. */
4537 if (SvREADONLY(sv)) {
4539 const char * const pvx = SvPVX_const(sv);
4540 const STRLEN len = SvCUR(sv);
4543 SvPV_set(sv, Nullch);
4545 SvGROW(sv, len + 1);
4546 Move(pvx,SvPVX(sv),len,char);
4548 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4550 else if (IN_PERL_RUNTIME)
4551 Perl_croak(aTHX_ PL_no_modify);
4555 sv_unref_flags(sv, flags);
4556 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4563 Efficient removal of characters from the beginning of the string buffer.
4564 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4565 the string buffer. The C<ptr> becomes the first character of the adjusted
4566 string. Uses the "OOK hack".
4567 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4568 refer to the same chunk of data.
4574 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4576 register STRLEN delta;
4577 if (!ptr || !SvPOKp(sv))
4579 delta = ptr - SvPVX_const(sv);
4580 SV_CHECK_THINKFIRST(sv);
4581 if (SvTYPE(sv) < SVt_PVIV)
4582 sv_upgrade(sv,SVt_PVIV);
4585 if (!SvLEN(sv)) { /* make copy of shared string */
4586 const char *pvx = SvPVX_const(sv);
4587 const STRLEN len = SvCUR(sv);
4588 SvGROW(sv, len + 1);
4589 Move(pvx,SvPVX(sv),len,char);
4593 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4594 and we do that anyway inside the SvNIOK_off
4596 SvFLAGS(sv) |= SVf_OOK;
4599 SvLEN_set(sv, SvLEN(sv) - delta);
4600 SvCUR_set(sv, SvCUR(sv) - delta);
4601 SvPV_set(sv, SvPVX(sv) + delta);
4602 SvIV_set(sv, SvIVX(sv) + delta);
4606 =for apidoc sv_catpvn
4608 Concatenates the string onto the end of the string which is in the SV. The
4609 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4610 status set, then the bytes appended should be valid UTF-8.
4611 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4613 =for apidoc sv_catpvn_flags
4615 Concatenates the string onto the end of the string which is in the SV. The
4616 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4617 status set, then the bytes appended should be valid UTF-8.
4618 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4619 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4620 in terms of this function.
4626 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4629 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4631 SvGROW(dsv, dlen + slen + 1);
4633 sstr = SvPVX_const(dsv);
4634 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4635 SvCUR_set(dsv, SvCUR(dsv) + slen);
4637 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4639 if (flags & SV_SMAGIC)
4644 =for apidoc sv_catsv
4646 Concatenates the string from SV C<ssv> onto the end of the string in
4647 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4648 not 'set' magic. See C<sv_catsv_mg>.
4650 =for apidoc sv_catsv_flags
4652 Concatenates the string from SV C<ssv> onto the end of the string in
4653 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4654 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4655 and C<sv_catsv_nomg> are implemented in terms of this function.
4660 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4665 if ((spv = SvPV_const(ssv, slen))) {
4666 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4667 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4668 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4669 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4670 dsv->sv_flags doesn't have that bit set.
4671 Andy Dougherty 12 Oct 2001
4673 const I32 sutf8 = DO_UTF8(ssv);
4676 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4678 dutf8 = DO_UTF8(dsv);
4680 if (dutf8 != sutf8) {
4682 /* Not modifying source SV, so taking a temporary copy. */
4683 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4685 sv_utf8_upgrade(csv);
4686 spv = SvPV_const(csv, slen);
4689 sv_utf8_upgrade_nomg(dsv);
4691 sv_catpvn_nomg(dsv, spv, slen);
4694 if (flags & SV_SMAGIC)
4699 =for apidoc sv_catpv
4701 Concatenates the string onto the end of the string which is in the SV.
4702 If the SV has the UTF-8 status set, then the bytes appended should be
4703 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4708 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4710 register STRLEN len;
4716 junk = SvPV_force(sv, tlen);
4718 SvGROW(sv, tlen + len + 1);
4720 ptr = SvPVX_const(sv);
4721 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4722 SvCUR_set(sv, SvCUR(sv) + len);
4723 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4728 =for apidoc sv_catpv_mg
4730 Like C<sv_catpv>, but also handles 'set' magic.
4736 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4745 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4746 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4753 Perl_newSV(pTHX_ STRLEN len)
4759 sv_upgrade(sv, SVt_PV);
4760 SvGROW(sv, len + 1);
4765 =for apidoc sv_magicext
4767 Adds magic to an SV, upgrading it if necessary. Applies the
4768 supplied vtable and returns a pointer to the magic added.
4770 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4771 In particular, you can add magic to SvREADONLY SVs, and add more than
4772 one instance of the same 'how'.
4774 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4775 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4776 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4777 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4779 (This is now used as a subroutine by C<sv_magic>.)
4784 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4785 const char* name, I32 namlen)
4789 if (SvTYPE(sv) < SVt_PVMG) {
4790 SvUPGRADE(sv, SVt_PVMG);
4792 Newxz(mg, 1, MAGIC);
4793 mg->mg_moremagic = SvMAGIC(sv);
4794 SvMAGIC_set(sv, mg);
4796 /* Sometimes a magic contains a reference loop, where the sv and
4797 object refer to each other. To prevent a reference loop that
4798 would prevent such objects being freed, we look for such loops
4799 and if we find one we avoid incrementing the object refcount.
4801 Note we cannot do this to avoid self-tie loops as intervening RV must
4802 have its REFCNT incremented to keep it in existence.
4805 if (!obj || obj == sv ||
4806 how == PERL_MAGIC_arylen ||
4807 how == PERL_MAGIC_qr ||
4808 how == PERL_MAGIC_symtab ||
4809 (SvTYPE(obj) == SVt_PVGV &&
4810 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4811 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4812 GvFORM(obj) == (CV*)sv)))
4817 mg->mg_obj = SvREFCNT_inc(obj);
4818 mg->mg_flags |= MGf_REFCOUNTED;
4821 /* Normal self-ties simply pass a null object, and instead of
4822 using mg_obj directly, use the SvTIED_obj macro to produce a
4823 new RV as needed. For glob "self-ties", we are tieing the PVIO
4824 with an RV obj pointing to the glob containing the PVIO. In
4825 this case, to avoid a reference loop, we need to weaken the
4829 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4830 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4836 mg->mg_len = namlen;
4839 mg->mg_ptr = savepvn(name, namlen);
4840 else if (namlen == HEf_SVKEY)
4841 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4843 mg->mg_ptr = (char *) name;
4845 mg->mg_virtual = vtable;
4849 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4854 =for apidoc sv_magic
4856 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4857 then adds a new magic item of type C<how> to the head of the magic list.
4859 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4860 handling of the C<name> and C<namlen> arguments.
4862 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4863 to add more than one instance of the same 'how'.
4869 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4871 const MGVTBL *vtable;
4874 #ifdef PERL_OLD_COPY_ON_WRITE
4876 sv_force_normal_flags(sv, 0);
4878 if (SvREADONLY(sv)) {
4880 /* its okay to attach magic to shared strings; the subsequent
4881 * upgrade to PVMG will unshare the string */
4882 !(SvFAKE(sv) && SvTYPE(sv) < SVt_PVMG)
4885 && how != PERL_MAGIC_regex_global
4886 && how != PERL_MAGIC_bm
4887 && how != PERL_MAGIC_fm
4888 && how != PERL_MAGIC_sv
4889 && how != PERL_MAGIC_backref
4892 Perl_croak(aTHX_ PL_no_modify);
4895 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4896 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4897 /* sv_magic() refuses to add a magic of the same 'how' as an
4900 if (how == PERL_MAGIC_taint)
4908 vtable = &PL_vtbl_sv;
4910 case PERL_MAGIC_overload:
4911 vtable = &PL_vtbl_amagic;
4913 case PERL_MAGIC_overload_elem:
4914 vtable = &PL_vtbl_amagicelem;
4916 case PERL_MAGIC_overload_table:
4917 vtable = &PL_vtbl_ovrld;
4920 vtable = &PL_vtbl_bm;
4922 case PERL_MAGIC_regdata:
4923 vtable = &PL_vtbl_regdata;
4925 case PERL_MAGIC_regdatum:
4926 vtable = &PL_vtbl_regdatum;
4928 case PERL_MAGIC_env:
4929 vtable = &PL_vtbl_env;
4932 vtable = &PL_vtbl_fm;
4934 case PERL_MAGIC_envelem:
4935 vtable = &PL_vtbl_envelem;
4937 case PERL_MAGIC_regex_global:
4938 vtable = &PL_vtbl_mglob;
4940 case PERL_MAGIC_isa:
4941 vtable = &PL_vtbl_isa;
4943 case PERL_MAGIC_isaelem:
4944 vtable = &PL_vtbl_isaelem;
4946 case PERL_MAGIC_nkeys:
4947 vtable = &PL_vtbl_nkeys;
4949 case PERL_MAGIC_dbfile:
4952 case PERL_MAGIC_dbline:
4953 vtable = &PL_vtbl_dbline;
4955 #ifdef USE_LOCALE_COLLATE
4956 case PERL_MAGIC_collxfrm:
4957 vtable = &PL_vtbl_collxfrm;
4959 #endif /* USE_LOCALE_COLLATE */
4960 case PERL_MAGIC_tied:
4961 vtable = &PL_vtbl_pack;
4963 case PERL_MAGIC_tiedelem:
4964 case PERL_MAGIC_tiedscalar:
4965 vtable = &PL_vtbl_packelem;
4968 vtable = &PL_vtbl_regexp;
4970 case PERL_MAGIC_sig:
4971 vtable = &PL_vtbl_sig;
4973 case PERL_MAGIC_sigelem:
4974 vtable = &PL_vtbl_sigelem;
4976 case PERL_MAGIC_taint:
4977 vtable = &PL_vtbl_taint;
4979 case PERL_MAGIC_uvar:
4980 vtable = &PL_vtbl_uvar;
4982 case PERL_MAGIC_vec:
4983 vtable = &PL_vtbl_vec;
4985 case PERL_MAGIC_arylen_p:
4986 case PERL_MAGIC_rhash:
4987 case PERL_MAGIC_symtab:
4988 case PERL_MAGIC_vstring:
4991 case PERL_MAGIC_utf8:
4992 vtable = &PL_vtbl_utf8;
4994 case PERL_MAGIC_substr:
4995 vtable = &PL_vtbl_substr;
4997 case PERL_MAGIC_defelem:
4998 vtable = &PL_vtbl_defelem;
5000 case PERL_MAGIC_glob:
5001 vtable = &PL_vtbl_glob;
5003 case PERL_MAGIC_arylen:
5004 vtable = &PL_vtbl_arylen;
5006 case PERL_MAGIC_pos:
5007 vtable = &PL_vtbl_pos;
5009 case PERL_MAGIC_backref:
5010 vtable = &PL_vtbl_backref;
5012 case PERL_MAGIC_ext:
5013 /* Reserved for use by extensions not perl internals. */
5014 /* Useful for attaching extension internal data to perl vars. */
5015 /* Note that multiple extensions may clash if magical scalars */
5016 /* etc holding private data from one are passed to another. */
5020 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5023 /* Rest of work is done else where */
5024 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5027 case PERL_MAGIC_taint:
5030 case PERL_MAGIC_ext:
5031 case PERL_MAGIC_dbfile:
5038 =for apidoc sv_unmagic
5040 Removes all magic of type C<type> from an SV.
5046 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5050 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5053 for (mg = *mgp; mg; mg = *mgp) {
5054 if (mg->mg_type == type) {
5055 const MGVTBL* const vtbl = mg->mg_virtual;
5056 *mgp = mg->mg_moremagic;
5057 if (vtbl && vtbl->svt_free)
5058 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5059 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5061 Safefree(mg->mg_ptr);
5062 else if (mg->mg_len == HEf_SVKEY)
5063 SvREFCNT_dec((SV*)mg->mg_ptr);
5064 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5065 Safefree(mg->mg_ptr);
5067 if (mg->mg_flags & MGf_REFCOUNTED)
5068 SvREFCNT_dec(mg->mg_obj);
5072 mgp = &mg->mg_moremagic;
5076 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5083 =for apidoc sv_rvweaken
5085 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5086 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5087 push a back-reference to this RV onto the array of backreferences
5088 associated with that magic.
5094 Perl_sv_rvweaken(pTHX_ SV *sv)
5097 if (!SvOK(sv)) /* let undefs pass */
5100 Perl_croak(aTHX_ "Can't weaken a nonreference");
5101 else if (SvWEAKREF(sv)) {
5102 if (ckWARN(WARN_MISC))
5103 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5107 Perl_sv_add_backref(aTHX_ tsv, sv);
5113 /* Give tsv backref magic if it hasn't already got it, then push a
5114 * back-reference to sv onto the array associated with the backref magic.
5118 Perl_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5122 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5123 av = (AV*)mg->mg_obj;
5126 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5127 /* av now has a refcnt of 2, which avoids it getting freed
5128 * before us during global cleanup. The extra ref is removed
5129 * by magic_killbackrefs() when tsv is being freed */
5131 if (AvFILLp(av) >= AvMAX(av)) {
5132 av_extend(av, AvFILLp(av)+1);
5134 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5137 /* delete a back-reference to ourselves from the backref magic associated
5138 * with the SV we point to.
5142 S_sv_del_backref(pTHX_ SV *tsv, SV *sv)
5148 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref))) {
5149 if (PL_in_clean_all)
5152 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5153 Perl_croak(aTHX_ "panic: del_backref");
5154 av = (AV *)mg->mg_obj;
5156 /* We shouldn't be in here more than once, but for paranoia reasons lets
5158 for (i = AvFILLp(av); i >= 0; i--) {
5160 const SSize_t fill = AvFILLp(av);
5162 /* We weren't the last entry.
5163 An unordered list has this property that you can take the
5164 last element off the end to fill the hole, and it's still
5165 an unordered list :-)
5170 AvFILLp(av) = fill - 1;
5176 =for apidoc sv_insert
5178 Inserts a string at the specified offset/length within the SV. Similar to
5179 the Perl substr() function.
5185 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5189 register char *midend;
5190 register char *bigend;
5196 Perl_croak(aTHX_ "Can't modify non-existent substring");
5197 SvPV_force(bigstr, curlen);
5198 (void)SvPOK_only_UTF8(bigstr);
5199 if (offset + len > curlen) {
5200 SvGROW(bigstr, offset+len+1);
5201 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5202 SvCUR_set(bigstr, offset+len);
5206 i = littlelen - len;
5207 if (i > 0) { /* string might grow */
5208 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5209 mid = big + offset + len;
5210 midend = bigend = big + SvCUR(bigstr);
5213 while (midend > mid) /* shove everything down */
5214 *--bigend = *--midend;
5215 Move(little,big+offset,littlelen,char);
5216 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5221 Move(little,SvPVX(bigstr)+offset,len,char);
5226 big = SvPVX(bigstr);
5229 bigend = big + SvCUR(bigstr);
5231 if (midend > bigend)
5232 Perl_croak(aTHX_ "panic: sv_insert");
5234 if (mid - big > bigend - midend) { /* faster to shorten from end */
5236 Move(little, mid, littlelen,char);
5239 i = bigend - midend;
5241 Move(midend, mid, i,char);
5245 SvCUR_set(bigstr, mid - big);
5247 else if ((i = mid - big)) { /* faster from front */
5248 midend -= littlelen;
5250 sv_chop(bigstr,midend-i);
5255 Move(little, mid, littlelen,char);
5257 else if (littlelen) {
5258 midend -= littlelen;
5259 sv_chop(bigstr,midend);
5260 Move(little,midend,littlelen,char);
5263 sv_chop(bigstr,midend);
5269 =for apidoc sv_replace
5271 Make the first argument a copy of the second, then delete the original.
5272 The target SV physically takes over ownership of the body of the source SV
5273 and inherits its flags; however, the target keeps any magic it owns,
5274 and any magic in the source is discarded.
5275 Note that this is a rather specialist SV copying operation; most of the
5276 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5282 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5284 const U32 refcnt = SvREFCNT(sv);
5285 SV_CHECK_THINKFIRST_COW_DROP(sv);
5286 if (SvREFCNT(nsv) != 1) {
5287 Perl_croak(aTHX_ "panic: reference miscount on nsv in sv_replace() (%"
5288 UVuf " != 1)", (UV) SvREFCNT(nsv));
5290 if (SvMAGICAL(sv)) {
5294 sv_upgrade(nsv, SVt_PVMG);
5295 SvMAGIC_set(nsv, SvMAGIC(sv));
5296 SvFLAGS(nsv) |= SvMAGICAL(sv);
5298 SvMAGIC_set(sv, NULL);
5302 assert(!SvREFCNT(sv));
5303 #ifdef DEBUG_LEAKING_SCALARS
5304 sv->sv_flags = nsv->sv_flags;
5305 sv->sv_any = nsv->sv_any;
5306 sv->sv_refcnt = nsv->sv_refcnt;
5307 sv->sv_u = nsv->sv_u;
5309 StructCopy(nsv,sv,SV);
5311 /* Currently could join these into one piece of pointer arithmetic, but
5312 it would be unclear. */
5313 if(SvTYPE(sv) == SVt_IV)
5315 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5316 else if (SvTYPE(sv) == SVt_RV) {
5317 SvANY(sv) = &sv->sv_u.svu_rv;
5321 #ifdef PERL_OLD_COPY_ON_WRITE
5322 if (SvIsCOW_normal(nsv)) {
5323 /* We need to follow the pointers around the loop to make the
5324 previous SV point to sv, rather than nsv. */
5327 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5330 assert(SvPVX_const(current) == SvPVX_const(nsv));
5332 /* Make the SV before us point to the SV after us. */
5334 PerlIO_printf(Perl_debug_log, "previous is\n");
5336 PerlIO_printf(Perl_debug_log,
5337 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5338 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5340 SV_COW_NEXT_SV_SET(current, sv);
5343 SvREFCNT(sv) = refcnt;
5344 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5350 =for apidoc sv_clear
5352 Clear an SV: call any destructors, free up any memory used by the body,
5353 and free the body itself. The SV's head is I<not> freed, although
5354 its type is set to all 1's so that it won't inadvertently be assumed
5355 to be live during global destruction etc.
5356 This function should only be called when REFCNT is zero. Most of the time
5357 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5364 Perl_sv_clear(pTHX_ register SV *sv)
5367 void** old_body_arena;
5368 size_t old_body_offset;
5369 const U32 type = SvTYPE(sv);
5372 assert(SvREFCNT(sv) == 0);
5378 old_body_offset = 0;
5381 if (PL_defstash) { /* Still have a symbol table? */
5386 stash = SvSTASH(sv);
5387 destructor = StashHANDLER(stash,DESTROY);
5389 SV* const tmpref = newRV(sv);
5390 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5392 PUSHSTACKi(PERLSI_DESTROY);
5397 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5403 if(SvREFCNT(tmpref) < 2) {
5404 /* tmpref is not kept alive! */
5406 SvRV_set(tmpref, NULL);
5409 SvREFCNT_dec(tmpref);
5411 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5415 if (PL_in_clean_objs)
5416 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5418 /* DESTROY gave object new lease on life */
5424 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5425 SvOBJECT_off(sv); /* Curse the object. */
5426 if (type != SVt_PVIO)
5427 --PL_sv_objcount; /* XXX Might want something more general */
5430 if (type >= SVt_PVMG) {
5433 if (type == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5434 SvREFCNT_dec(SvSTASH(sv));
5439 IoIFP(sv) != PerlIO_stdin() &&
5440 IoIFP(sv) != PerlIO_stdout() &&
5441 IoIFP(sv) != PerlIO_stderr())
5443 io_close((IO*)sv, FALSE);
5445 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5446 PerlDir_close(IoDIRP(sv));
5447 IoDIRP(sv) = (DIR*)NULL;
5448 Safefree(IoTOP_NAME(sv));
5449 Safefree(IoFMT_NAME(sv));
5450 Safefree(IoBOTTOM_NAME(sv));
5451 /* PVIOs aren't from arenas */
5454 old_body_arena = &PL_body_roots[SVt_PVBM];
5457 old_body_arena = &PL_body_roots[SVt_PVCV];
5459 /* PVFMs aren't from arenas */
5464 old_body_arena = &PL_body_roots[SVt_PVHV];
5465 old_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill);
5469 old_body_arena = &PL_body_roots[SVt_PVAV];
5470 old_body_offset = STRUCT_OFFSET(XPVAV, xav_fill);
5473 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5474 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5475 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5476 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5478 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5479 SvREFCNT_dec(LvTARG(sv));
5480 old_body_arena = &PL_body_roots[SVt_PVLV];
5484 Safefree(GvNAME(sv));
5485 /* If we're in a stash, we don't own a reference to it. However it does
5486 have a back reference to us, which needs to be cleared. */
5488 sv_del_backref((SV*)GvSTASH(sv), sv);
5489 old_body_arena = &PL_body_roots[SVt_PVGV];
5492 old_body_arena = &PL_body_roots[SVt_PVMG];
5495 old_body_arena = &PL_body_roots[SVt_PVNV];
5498 old_body_arena = &PL_body_roots[SVt_PVIV];
5499 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur);
5501 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5503 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5504 /* Don't even bother with turning off the OOK flag. */
5508 old_body_arena = &PL_body_roots[SVt_PV];
5509 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur);
5513 SV *target = SvRV(sv);
5515 sv_del_backref(target, sv);
5517 SvREFCNT_dec(target);
5519 #ifdef PERL_OLD_COPY_ON_WRITE
5520 else if (SvPVX_const(sv)) {
5522 /* I believe I need to grab the global SV mutex here and
5523 then recheck the COW status. */
5525 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5528 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5529 SV_COW_NEXT_SV(sv));
5530 /* And drop it here. */
5532 } else if (SvLEN(sv)) {
5533 Safefree(SvPVX_const(sv));
5537 else if (SvPVX_const(sv) && SvLEN(sv))
5538 Safefree(SvPVX_mutable(sv));
5539 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5540 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5546 old_body_arena = PL_body_roots[SVt_NV];
5550 SvFLAGS(sv) &= SVf_BREAK;
5551 SvFLAGS(sv) |= SVTYPEMASK;
5554 if (old_body_arena) {
5555 del_body(((char *)SvANY(sv) + old_body_offset), old_body_arena);
5559 if (type > SVt_RV) {
5560 my_safefree(SvANY(sv));
5565 =for apidoc sv_newref
5567 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5574 Perl_sv_newref(pTHX_ SV *sv)
5584 Decrement an SV's reference count, and if it drops to zero, call
5585 C<sv_clear> to invoke destructors and free up any memory used by
5586 the body; finally, deallocate the SV's head itself.
5587 Normally called via a wrapper macro C<SvREFCNT_dec>.
5593 Perl_sv_free(pTHX_ SV *sv)
5598 if (SvREFCNT(sv) == 0) {
5599 if (SvFLAGS(sv) & SVf_BREAK)
5600 /* this SV's refcnt has been artificially decremented to
5601 * trigger cleanup */
5603 if (PL_in_clean_all) /* All is fair */
5605 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5606 /* make sure SvREFCNT(sv)==0 happens very seldom */
5607 SvREFCNT(sv) = (~(U32)0)/2;
5610 if (ckWARN_d(WARN_INTERNAL)) {
5611 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5612 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5613 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5614 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
5615 Perl_dump_sv_child(aTHX_ sv);
5620 if (--(SvREFCNT(sv)) > 0)
5622 Perl_sv_free2(aTHX_ sv);
5626 Perl_sv_free2(pTHX_ SV *sv)
5631 if (ckWARN_d(WARN_DEBUGGING))
5632 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5633 "Attempt to free temp prematurely: SV 0x%"UVxf
5634 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5638 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5639 /* make sure SvREFCNT(sv)==0 happens very seldom */
5640 SvREFCNT(sv) = (~(U32)0)/2;
5651 Returns the length of the string in the SV. Handles magic and type
5652 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5658 Perl_sv_len(pTHX_ register SV *sv)
5666 len = mg_length(sv);
5668 (void)SvPV_const(sv, len);
5673 =for apidoc sv_len_utf8
5675 Returns the number of characters in the string in an SV, counting wide
5676 UTF-8 bytes as a single character. Handles magic and type coercion.
5682 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5683 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5684 * (Note that the mg_len is not the length of the mg_ptr field.)
5689 Perl_sv_len_utf8(pTHX_ register SV *sv)
5695 return mg_length(sv);
5699 const U8 *s = (U8*)SvPV_const(sv, len);
5700 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5702 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5704 #ifdef PERL_UTF8_CACHE_ASSERT
5705 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5709 ulen = Perl_utf8_length(aTHX_ s, s + len);
5710 if (!mg && !SvREADONLY(sv)) {
5711 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5712 mg = mg_find(sv, PERL_MAGIC_utf8);
5722 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5723 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5724 * between UTF-8 and byte offsets. There are two (substr offset and substr
5725 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5726 * and byte offset) cache positions.
5728 * The mg_len field is used by sv_len_utf8(), see its comments.
5729 * Note that the mg_len is not the length of the mg_ptr field.
5733 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5734 I32 offsetp, const U8 *s, const U8 *start)
5738 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5740 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5744 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5746 Newxz(*cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5747 (*mgp)->mg_ptr = (char *) *cachep;
5751 (*cachep)[i] = offsetp;
5752 (*cachep)[i+1] = s - start;
5760 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5761 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5762 * between UTF-8 and byte offsets. See also the comments of
5763 * S_utf8_mg_pos_init().
5767 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)
5771 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5773 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5774 if (*mgp && (*mgp)->mg_ptr) {
5775 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5776 ASSERT_UTF8_CACHE(*cachep);
5777 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5779 else { /* We will skip to the right spot. */
5784 /* The assumption is that going backward is half
5785 * the speed of going forward (that's where the
5786 * 2 * backw in the below comes from). (The real
5787 * figure of course depends on the UTF-8 data.) */
5789 if ((*cachep)[i] > (STRLEN)uoff) {
5791 backw = (*cachep)[i] - (STRLEN)uoff;
5793 if (forw < 2 * backw)
5796 p = start + (*cachep)[i+1];
5798 /* Try this only for the substr offset (i == 0),
5799 * not for the substr length (i == 2). */
5800 else if (i == 0) { /* (*cachep)[i] < uoff */
5801 const STRLEN ulen = sv_len_utf8(sv);
5803 if ((STRLEN)uoff < ulen) {
5804 forw = (STRLEN)uoff - (*cachep)[i];
5805 backw = ulen - (STRLEN)uoff;
5807 if (forw < 2 * backw)
5808 p = start + (*cachep)[i+1];
5813 /* If the string is not long enough for uoff,
5814 * we could extend it, but not at this low a level. */
5818 if (forw < 2 * backw) {
5825 while (UTF8_IS_CONTINUATION(*p))
5830 /* Update the cache. */
5831 (*cachep)[i] = (STRLEN)uoff;
5832 (*cachep)[i+1] = p - start;
5834 /* Drop the stale "length" cache */
5843 if (found) { /* Setup the return values. */
5844 *offsetp = (*cachep)[i+1];
5845 *sp = start + *offsetp;
5848 *offsetp = send - start;
5850 else if (*sp < start) {
5856 #ifdef PERL_UTF8_CACHE_ASSERT
5861 while (n-- && s < send)
5865 assert(*offsetp == s - start);
5866 assert((*cachep)[0] == (STRLEN)uoff);
5867 assert((*cachep)[1] == *offsetp);
5869 ASSERT_UTF8_CACHE(*cachep);
5878 =for apidoc sv_pos_u2b
5880 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5881 the start of the string, to a count of the equivalent number of bytes; if
5882 lenp is non-zero, it does the same to lenp, but this time starting from
5883 the offset, rather than from the start of the string. Handles magic and
5890 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5891 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5892 * byte offsets. See also the comments of S_utf8_mg_pos().
5897 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5905 start = (U8*)SvPV_const(sv, len);
5909 const U8 *s = start;
5910 I32 uoffset = *offsetp;
5911 const U8 * const send = s + len;
5915 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5917 if (!found && uoffset > 0) {
5918 while (s < send && uoffset--)
5922 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
5924 *offsetp = s - start;
5929 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
5933 if (!found && *lenp > 0) {
5936 while (s < send && ulen--)
5940 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
5944 ASSERT_UTF8_CACHE(cache);
5956 =for apidoc sv_pos_b2u
5958 Converts the value pointed to by offsetp from a count of bytes from the
5959 start of the string, to a count of the equivalent number of UTF-8 chars.
5960 Handles magic and type coercion.
5966 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5967 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5968 * byte offsets. See also the comments of S_utf8_mg_pos().
5973 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5981 s = (const U8*)SvPV_const(sv, len);
5982 if ((I32)len < *offsetp)
5983 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5985 const U8* send = s + *offsetp;
5987 STRLEN *cache = NULL;
5991 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5992 mg = mg_find(sv, PERL_MAGIC_utf8);
5993 if (mg && mg->mg_ptr) {
5994 cache = (STRLEN *) mg->mg_ptr;
5995 if (cache[1] == (STRLEN)*offsetp) {
5996 /* An exact match. */
5997 *offsetp = cache[0];
6001 else if (cache[1] < (STRLEN)*offsetp) {
6002 /* We already know part of the way. */
6005 /* Let the below loop do the rest. */
6007 else { /* cache[1] > *offsetp */
6008 /* We already know all of the way, now we may
6009 * be able to walk back. The same assumption
6010 * is made as in S_utf8_mg_pos(), namely that
6011 * walking backward is twice slower than
6012 * walking forward. */
6013 const STRLEN forw = *offsetp;
6014 STRLEN backw = cache[1] - *offsetp;
6016 if (!(forw < 2 * backw)) {
6017 const U8 *p = s + cache[1];
6024 while (UTF8_IS_CONTINUATION(*p)) {
6032 *offsetp = cache[0];
6034 /* Drop the stale "length" cache */
6042 ASSERT_UTF8_CACHE(cache);
6048 /* Call utf8n_to_uvchr() to validate the sequence
6049 * (unless a simple non-UTF character) */
6050 if (!UTF8_IS_INVARIANT(*s))
6051 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6060 if (!SvREADONLY(sv)) {
6062 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6063 mg = mg_find(sv, PERL_MAGIC_utf8);
6068 Newxz(cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6069 mg->mg_ptr = (char *) cache;
6074 cache[1] = *offsetp;
6075 /* Drop the stale "length" cache */
6088 Returns a boolean indicating whether the strings in the two SVs are
6089 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6090 coerce its args to strings if necessary.
6096 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6104 SV* svrecode = Nullsv;
6111 pv1 = SvPV_const(sv1, cur1);
6118 pv2 = SvPV_const(sv2, cur2);
6120 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6121 /* Differing utf8ness.
6122 * Do not UTF8size the comparands as a side-effect. */
6125 svrecode = newSVpvn(pv2, cur2);
6126 sv_recode_to_utf8(svrecode, PL_encoding);
6127 pv2 = SvPV_const(svrecode, cur2);
6130 svrecode = newSVpvn(pv1, cur1);
6131 sv_recode_to_utf8(svrecode, PL_encoding);
6132 pv1 = SvPV_const(svrecode, cur1);
6134 /* Now both are in UTF-8. */
6136 SvREFCNT_dec(svrecode);
6141 bool is_utf8 = TRUE;
6144 /* sv1 is the UTF-8 one,
6145 * if is equal it must be downgrade-able */
6146 char * const pv = (char*)bytes_from_utf8((const U8*)pv1,
6152 /* sv2 is the UTF-8 one,
6153 * if is equal it must be downgrade-able */
6154 char * const pv = (char *)bytes_from_utf8((const U8*)pv2,
6160 /* Downgrade not possible - cannot be eq */
6168 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6171 SvREFCNT_dec(svrecode);
6182 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6183 string in C<sv1> is less than, equal to, or greater than the string in
6184 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6185 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6191 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6194 const char *pv1, *pv2;
6197 SV *svrecode = Nullsv;
6204 pv1 = SvPV_const(sv1, cur1);
6211 pv2 = SvPV_const(sv2, cur2);
6213 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6214 /* Differing utf8ness.
6215 * Do not UTF8size the comparands as a side-effect. */
6218 svrecode = newSVpvn(pv2, cur2);
6219 sv_recode_to_utf8(svrecode, PL_encoding);
6220 pv2 = SvPV_const(svrecode, cur2);
6223 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6228 svrecode = newSVpvn(pv1, cur1);
6229 sv_recode_to_utf8(svrecode, PL_encoding);
6230 pv1 = SvPV_const(svrecode, cur1);
6233 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6239 cmp = cur2 ? -1 : 0;
6243 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6246 cmp = retval < 0 ? -1 : 1;
6247 } else if (cur1 == cur2) {
6250 cmp = cur1 < cur2 ? -1 : 1;
6255 SvREFCNT_dec(svrecode);
6264 =for apidoc sv_cmp_locale
6266 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6267 'use bytes' aware, handles get magic, and will coerce its args to strings
6268 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6274 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6276 #ifdef USE_LOCALE_COLLATE
6282 if (PL_collation_standard)
6286 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6288 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6290 if (!pv1 || !len1) {
6301 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6304 return retval < 0 ? -1 : 1;
6307 * When the result of collation is equality, that doesn't mean
6308 * that there are no differences -- some locales exclude some
6309 * characters from consideration. So to avoid false equalities,
6310 * we use the raw string as a tiebreaker.
6316 #endif /* USE_LOCALE_COLLATE */
6318 return sv_cmp(sv1, sv2);
6322 #ifdef USE_LOCALE_COLLATE
6325 =for apidoc sv_collxfrm
6327 Add Collate Transform magic to an SV if it doesn't already have it.
6329 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6330 scalar data of the variable, but transformed to such a format that a normal
6331 memory comparison can be used to compare the data according to the locale
6338 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6342 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6343 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6349 Safefree(mg->mg_ptr);
6350 s = SvPV_const(sv, len);
6351 if ((xf = mem_collxfrm(s, len, &xlen))) {
6352 if (SvREADONLY(sv)) {
6355 return xf + sizeof(PL_collation_ix);
6358 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6359 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6372 if (mg && mg->mg_ptr) {
6374 return mg->mg_ptr + sizeof(PL_collation_ix);
6382 #endif /* USE_LOCALE_COLLATE */
6387 Get a line from the filehandle and store it into the SV, optionally
6388 appending to the currently-stored string.
6394 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6398 register STDCHAR rslast;
6399 register STDCHAR *bp;
6405 if (SvTHINKFIRST(sv))
6406 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6407 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6409 However, perlbench says it's slower, because the existing swipe code
6410 is faster than copy on write.
6411 Swings and roundabouts. */
6412 SvUPGRADE(sv, SVt_PV);
6417 if (PerlIO_isutf8(fp)) {
6419 sv_utf8_upgrade_nomg(sv);
6420 sv_pos_u2b(sv,&append,0);
6422 } else if (SvUTF8(sv)) {
6423 SV * const tsv = NEWSV(0,0);
6424 sv_gets(tsv, fp, 0);
6425 sv_utf8_upgrade_nomg(tsv);
6426 SvCUR_set(sv,append);
6429 goto return_string_or_null;
6434 if (PerlIO_isutf8(fp))
6437 if (IN_PERL_COMPILETIME) {
6438 /* we always read code in line mode */
6442 else if (RsSNARF(PL_rs)) {
6443 /* If it is a regular disk file use size from stat() as estimate
6444 of amount we are going to read - may result in malloc-ing
6445 more memory than we realy need if layers bellow reduce
6446 size we read (e.g. CRLF or a gzip layer)
6449 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6450 const Off_t offset = PerlIO_tell(fp);
6451 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6452 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6458 else if (RsRECORD(PL_rs)) {
6462 /* Grab the size of the record we're getting */
6463 recsize = SvIV(SvRV(PL_rs));
6464 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6467 /* VMS wants read instead of fread, because fread doesn't respect */
6468 /* RMS record boundaries. This is not necessarily a good thing to be */
6469 /* doing, but we've got no other real choice - except avoid stdio
6470 as implementation - perhaps write a :vms layer ?
6472 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6474 bytesread = PerlIO_read(fp, buffer, recsize);
6478 SvCUR_set(sv, bytesread += append);
6479 buffer[bytesread] = '\0';
6480 goto return_string_or_null;
6482 else if (RsPARA(PL_rs)) {
6488 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6489 if (PerlIO_isutf8(fp)) {
6490 rsptr = SvPVutf8(PL_rs, rslen);
6493 if (SvUTF8(PL_rs)) {
6494 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6495 Perl_croak(aTHX_ "Wide character in $/");
6498 rsptr = SvPV_const(PL_rs, rslen);
6502 rslast = rslen ? rsptr[rslen - 1] : '\0';
6504 if (rspara) { /* have to do this both before and after */
6505 do { /* to make sure file boundaries work right */
6508 i = PerlIO_getc(fp);
6512 PerlIO_ungetc(fp,i);
6518 /* See if we know enough about I/O mechanism to cheat it ! */
6520 /* This used to be #ifdef test - it is made run-time test for ease
6521 of abstracting out stdio interface. One call should be cheap
6522 enough here - and may even be a macro allowing compile
6526 if (PerlIO_fast_gets(fp)) {
6529 * We're going to steal some values from the stdio struct
6530 * and put EVERYTHING in the innermost loop into registers.
6532 register STDCHAR *ptr;
6536 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6537 /* An ungetc()d char is handled separately from the regular
6538 * buffer, so we getc() it back out and stuff it in the buffer.
6540 i = PerlIO_getc(fp);
6541 if (i == EOF) return 0;
6542 *(--((*fp)->_ptr)) = (unsigned char) i;
6546 /* Here is some breathtakingly efficient cheating */
6548 cnt = PerlIO_get_cnt(fp); /* get count into register */
6549 /* make sure we have the room */
6550 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6551 /* Not room for all of it
6552 if we are looking for a separator and room for some
6554 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6555 /* just process what we have room for */
6556 shortbuffered = cnt - SvLEN(sv) + append + 1;
6557 cnt -= shortbuffered;
6561 /* remember that cnt can be negative */
6562 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6567 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6568 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6569 DEBUG_P(PerlIO_printf(Perl_debug_log,
6570 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6571 DEBUG_P(PerlIO_printf(Perl_debug_log,
6572 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6573 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6574 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6579 while (cnt > 0) { /* this | eat */
6581 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6582 goto thats_all_folks; /* screams | sed :-) */
6586 Copy(ptr, bp, cnt, char); /* this | eat */
6587 bp += cnt; /* screams | dust */
6588 ptr += cnt; /* louder | sed :-) */
6593 if (shortbuffered) { /* oh well, must extend */
6594 cnt = shortbuffered;
6596 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6598 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6599 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6603 DEBUG_P(PerlIO_printf(Perl_debug_log,
6604 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6605 PTR2UV(ptr),(long)cnt));
6606 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6608 DEBUG_P(PerlIO_printf(Perl_debug_log,
6609 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6610 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6611 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6613 /* This used to call 'filbuf' in stdio form, but as that behaves like
6614 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6615 another abstraction. */
6616 i = PerlIO_getc(fp); /* get more characters */
6618 DEBUG_P(PerlIO_printf(Perl_debug_log,
6619 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6620 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6621 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6623 cnt = PerlIO_get_cnt(fp);
6624 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6625 DEBUG_P(PerlIO_printf(Perl_debug_log,
6626 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6628 if (i == EOF) /* all done for ever? */
6629 goto thats_really_all_folks;
6631 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6633 SvGROW(sv, bpx + cnt + 2);
6634 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6636 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6638 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6639 goto thats_all_folks;
6643 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6644 memNE((char*)bp - rslen, rsptr, rslen))
6645 goto screamer; /* go back to the fray */
6646 thats_really_all_folks:
6648 cnt += shortbuffered;
6649 DEBUG_P(PerlIO_printf(Perl_debug_log,
6650 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6651 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6652 DEBUG_P(PerlIO_printf(Perl_debug_log,
6653 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6654 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6655 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6657 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6658 DEBUG_P(PerlIO_printf(Perl_debug_log,
6659 "Screamer: done, len=%ld, string=|%.*s|\n",
6660 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6664 /*The big, slow, and stupid way. */
6665 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6667 Newx(buf, 8192, STDCHAR);
6675 register const STDCHAR *bpe = buf + sizeof(buf);
6677 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6678 ; /* keep reading */
6682 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6683 /* Accomodate broken VAXC compiler, which applies U8 cast to
6684 * both args of ?: operator, causing EOF to change into 255
6687 i = (U8)buf[cnt - 1];
6693 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6695 sv_catpvn(sv, (char *) buf, cnt);
6697 sv_setpvn(sv, (char *) buf, cnt);
6699 if (i != EOF && /* joy */
6701 SvCUR(sv) < rslen ||
6702 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6706 * If we're reading from a TTY and we get a short read,
6707 * indicating that the user hit his EOF character, we need
6708 * to notice it now, because if we try to read from the TTY
6709 * again, the EOF condition will disappear.
6711 * The comparison of cnt to sizeof(buf) is an optimization
6712 * that prevents unnecessary calls to feof().
6716 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6720 #ifdef USE_HEAP_INSTEAD_OF_STACK
6725 if (rspara) { /* have to do this both before and after */
6726 while (i != EOF) { /* to make sure file boundaries work right */
6727 i = PerlIO_getc(fp);
6729 PerlIO_ungetc(fp,i);
6735 return_string_or_null:
6736 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6742 Auto-increment of the value in the SV, doing string to numeric conversion
6743 if necessary. Handles 'get' magic.
6749 Perl_sv_inc(pTHX_ register SV *sv)
6757 if (SvTHINKFIRST(sv)) {
6759 sv_force_normal_flags(sv, 0);
6760 if (SvREADONLY(sv)) {
6761 if (IN_PERL_RUNTIME)
6762 Perl_croak(aTHX_ PL_no_modify);
6766 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6768 i = PTR2IV(SvRV(sv));
6773 flags = SvFLAGS(sv);
6774 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6775 /* It's (privately or publicly) a float, but not tested as an
6776 integer, so test it to see. */
6778 flags = SvFLAGS(sv);
6780 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6781 /* It's publicly an integer, or privately an integer-not-float */
6782 #ifdef PERL_PRESERVE_IVUV
6786 if (SvUVX(sv) == UV_MAX)
6787 sv_setnv(sv, UV_MAX_P1);
6789 (void)SvIOK_only_UV(sv);
6790 SvUV_set(sv, SvUVX(sv) + 1);
6792 if (SvIVX(sv) == IV_MAX)
6793 sv_setuv(sv, (UV)IV_MAX + 1);
6795 (void)SvIOK_only(sv);
6796 SvIV_set(sv, SvIVX(sv) + 1);
6801 if (flags & SVp_NOK) {
6802 (void)SvNOK_only(sv);
6803 SvNV_set(sv, SvNVX(sv) + 1.0);
6807 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6808 if ((flags & SVTYPEMASK) < SVt_PVIV)
6809 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6810 (void)SvIOK_only(sv);
6815 while (isALPHA(*d)) d++;
6816 while (isDIGIT(*d)) d++;
6818 #ifdef PERL_PRESERVE_IVUV
6819 /* Got to punt this as an integer if needs be, but we don't issue
6820 warnings. Probably ought to make the sv_iv_please() that does
6821 the conversion if possible, and silently. */
6822 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6823 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6824 /* Need to try really hard to see if it's an integer.
6825 9.22337203685478e+18 is an integer.
6826 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6827 so $a="9.22337203685478e+18"; $a+0; $a++
6828 needs to be the same as $a="9.22337203685478e+18"; $a++
6835 /* sv_2iv *should* have made this an NV */
6836 if (flags & SVp_NOK) {
6837 (void)SvNOK_only(sv);
6838 SvNV_set(sv, SvNVX(sv) + 1.0);
6841 /* I don't think we can get here. Maybe I should assert this
6842 And if we do get here I suspect that sv_setnv will croak. NWC
6844 #if defined(USE_LONG_DOUBLE)
6845 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",
6846 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6848 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6849 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6852 #endif /* PERL_PRESERVE_IVUV */
6853 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6857 while (d >= SvPVX_const(sv)) {
6865 /* MKS: The original code here died if letters weren't consecutive.
6866 * at least it didn't have to worry about non-C locales. The
6867 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6868 * arranged in order (although not consecutively) and that only
6869 * [A-Za-z] are accepted by isALPHA in the C locale.
6871 if (*d != 'z' && *d != 'Z') {
6872 do { ++*d; } while (!isALPHA(*d));
6875 *(d--) -= 'z' - 'a';
6880 *(d--) -= 'z' - 'a' + 1;
6884 /* oh,oh, the number grew */
6885 SvGROW(sv, SvCUR(sv) + 2);
6886 SvCUR_set(sv, SvCUR(sv) + 1);
6887 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
6898 Auto-decrement of the value in the SV, doing string to numeric conversion
6899 if necessary. Handles 'get' magic.
6905 Perl_sv_dec(pTHX_ register SV *sv)
6912 if (SvTHINKFIRST(sv)) {
6914 sv_force_normal_flags(sv, 0);
6915 if (SvREADONLY(sv)) {
6916 if (IN_PERL_RUNTIME)
6917 Perl_croak(aTHX_ PL_no_modify);
6921 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6923 i = PTR2IV(SvRV(sv));
6928 /* Unlike sv_inc we don't have to worry about string-never-numbers
6929 and keeping them magic. But we mustn't warn on punting */
6930 flags = SvFLAGS(sv);
6931 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6932 /* It's publicly an integer, or privately an integer-not-float */
6933 #ifdef PERL_PRESERVE_IVUV
6937 if (SvUVX(sv) == 0) {
6938 (void)SvIOK_only(sv);
6942 (void)SvIOK_only_UV(sv);
6943 SvUV_set(sv, SvUVX(sv) - 1);
6946 if (SvIVX(sv) == IV_MIN)
6947 sv_setnv(sv, (NV)IV_MIN - 1.0);
6949 (void)SvIOK_only(sv);
6950 SvIV_set(sv, SvIVX(sv) - 1);
6955 if (flags & SVp_NOK) {
6956 SvNV_set(sv, SvNVX(sv) - 1.0);
6957 (void)SvNOK_only(sv);
6960 if (!(flags & SVp_POK)) {
6961 if ((flags & SVTYPEMASK) < SVt_PVIV)
6962 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
6964 (void)SvIOK_only(sv);
6967 #ifdef PERL_PRESERVE_IVUV
6969 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6970 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6971 /* Need to try really hard to see if it's an integer.
6972 9.22337203685478e+18 is an integer.
6973 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6974 so $a="9.22337203685478e+18"; $a+0; $a--
6975 needs to be the same as $a="9.22337203685478e+18"; $a--
6982 /* sv_2iv *should* have made this an NV */
6983 if (flags & SVp_NOK) {
6984 (void)SvNOK_only(sv);
6985 SvNV_set(sv, SvNVX(sv) - 1.0);
6988 /* I don't think we can get here. Maybe I should assert this
6989 And if we do get here I suspect that sv_setnv will croak. NWC
6991 #if defined(USE_LONG_DOUBLE)
6992 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",
6993 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6995 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6996 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7000 #endif /* PERL_PRESERVE_IVUV */
7001 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7005 =for apidoc sv_mortalcopy
7007 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7008 The new SV is marked as mortal. It will be destroyed "soon", either by an
7009 explicit call to FREETMPS, or by an implicit call at places such as
7010 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7015 /* Make a string that will exist for the duration of the expression
7016 * evaluation. Actually, it may have to last longer than that, but
7017 * hopefully we won't free it until it has been assigned to a
7018 * permanent location. */
7021 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7026 sv_setsv(sv,oldstr);
7028 PL_tmps_stack[++PL_tmps_ix] = sv;
7034 =for apidoc sv_newmortal
7036 Creates a new null SV which is mortal. The reference count of the SV is
7037 set to 1. It will be destroyed "soon", either by an explicit call to
7038 FREETMPS, or by an implicit call at places such as statement boundaries.
7039 See also C<sv_mortalcopy> and C<sv_2mortal>.
7045 Perl_sv_newmortal(pTHX)
7050 SvFLAGS(sv) = SVs_TEMP;
7052 PL_tmps_stack[++PL_tmps_ix] = sv;
7057 =for apidoc sv_2mortal
7059 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7060 by an explicit call to FREETMPS, or by an implicit call at places such as
7061 statement boundaries. SvTEMP() is turned on which means that the SV's
7062 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7063 and C<sv_mortalcopy>.
7069 Perl_sv_2mortal(pTHX_ register SV *sv)
7074 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7077 PL_tmps_stack[++PL_tmps_ix] = sv;
7085 Creates a new SV and copies a string into it. The reference count for the
7086 SV is set to 1. If C<len> is zero, Perl will compute the length using
7087 strlen(). For efficiency, consider using C<newSVpvn> instead.
7093 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7098 sv_setpvn(sv,s,len ? len : strlen(s));
7103 =for apidoc newSVpvn
7105 Creates a new SV and copies a string into it. The reference count for the
7106 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7107 string. You are responsible for ensuring that the source string is at least
7108 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7114 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7119 sv_setpvn(sv,s,len);
7125 =for apidoc newSVhek
7127 Creates a new SV from the hash key structure. It will generate scalars that
7128 point to the shared string table where possible. Returns a new (undefined)
7129 SV if the hek is NULL.
7135 Perl_newSVhek(pTHX_ const HEK *hek)
7144 if (HEK_LEN(hek) == HEf_SVKEY) {
7145 return newSVsv(*(SV**)HEK_KEY(hek));
7147 const int flags = HEK_FLAGS(hek);
7148 if (flags & HVhek_WASUTF8) {
7150 Andreas would like keys he put in as utf8 to come back as utf8
7152 STRLEN utf8_len = HEK_LEN(hek);
7153 const U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7154 SV * const sv = newSVpvn ((const char*)as_utf8, utf8_len);
7157 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7159 } else if (flags & HVhek_REHASH) {
7160 /* We don't have a pointer to the hv, so we have to replicate the
7161 flag into every HEK. This hv is using custom a hasing
7162 algorithm. Hence we can't return a shared string scalar, as
7163 that would contain the (wrong) hash value, and might get passed
7164 into an hv routine with a regular hash */
7166 SV * const sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7171 /* This will be overwhelminly the most common case. */
7172 return newSVpvn_share(HEK_KEY(hek),
7173 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7179 =for apidoc newSVpvn_share
7181 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7182 table. If the string does not already exist in the table, it is created
7183 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7184 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7185 otherwise the hash is computed. The idea here is that as the string table
7186 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7187 hash lookup will avoid string compare.
7193 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7196 bool is_utf8 = FALSE;
7198 STRLEN tmplen = -len;
7200 /* See the note in hv.c:hv_fetch() --jhi */
7201 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7205 PERL_HASH(hash, src, len);
7207 sv_upgrade(sv, SVt_PV);
7208 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7220 #if defined(PERL_IMPLICIT_CONTEXT)
7222 /* pTHX_ magic can't cope with varargs, so this is a no-context
7223 * version of the main function, (which may itself be aliased to us).
7224 * Don't access this version directly.
7228 Perl_newSVpvf_nocontext(const char* pat, ...)
7233 va_start(args, pat);
7234 sv = vnewSVpvf(pat, &args);
7241 =for apidoc newSVpvf
7243 Creates a new SV and initializes it with the string formatted like
7250 Perl_newSVpvf(pTHX_ const char* pat, ...)
7254 va_start(args, pat);
7255 sv = vnewSVpvf(pat, &args);
7260 /* backend for newSVpvf() and newSVpvf_nocontext() */
7263 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7267 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7274 Creates a new SV and copies a floating point value into it.
7275 The reference count for the SV is set to 1.
7281 Perl_newSVnv(pTHX_ NV n)
7293 Creates a new SV and copies an integer into it. The reference count for the
7300 Perl_newSViv(pTHX_ IV i)
7312 Creates a new SV and copies an unsigned integer into it.
7313 The reference count for the SV is set to 1.
7319 Perl_newSVuv(pTHX_ UV u)
7329 =for apidoc newRV_noinc
7331 Creates an RV wrapper for an SV. The reference count for the original
7332 SV is B<not> incremented.
7338 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7343 sv_upgrade(sv, SVt_RV);
7345 SvRV_set(sv, tmpRef);
7350 /* newRV_inc is the official function name to use now.
7351 * newRV_inc is in fact #defined to newRV in sv.h
7355 Perl_newRV(pTHX_ SV *tmpRef)
7357 return newRV_noinc(SvREFCNT_inc(tmpRef));
7363 Creates a new SV which is an exact duplicate of the original SV.
7370 Perl_newSVsv(pTHX_ register SV *old)
7376 if (SvTYPE(old) == SVTYPEMASK) {
7377 if (ckWARN_d(WARN_INTERNAL))
7378 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7382 /* SV_GMAGIC is the default for sv_setv()
7383 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7384 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7385 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7390 =for apidoc sv_reset
7392 Underlying implementation for the C<reset> Perl function.
7393 Note that the perl-level function is vaguely deprecated.
7399 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7402 char todo[PERL_UCHAR_MAX+1];
7407 if (!*s) { /* reset ?? searches */
7408 MAGIC * const mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7410 PMOP *pm = (PMOP *) mg->mg_obj;
7412 pm->op_pmdynflags &= ~PMdf_USED;
7419 /* reset variables */
7421 if (!HvARRAY(stash))
7424 Zero(todo, 256, char);
7427 I32 i = (unsigned char)*s;
7431 max = (unsigned char)*s++;
7432 for ( ; i <= max; i++) {
7435 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7437 for (entry = HvARRAY(stash)[i];
7439 entry = HeNEXT(entry))
7444 if (!todo[(U8)*HeKEY(entry)])
7446 gv = (GV*)HeVAL(entry);
7449 if (SvTHINKFIRST(sv)) {
7450 if (!SvREADONLY(sv) && SvROK(sv))
7452 /* XXX Is this continue a bug? Why should THINKFIRST
7453 exempt us from resetting arrays and hashes? */
7457 if (SvTYPE(sv) >= SVt_PV) {
7459 if (SvPVX_const(sv) != Nullch)
7467 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7469 Perl_die(aTHX_ "Can't reset %%ENV on this system");
7472 # if defined(USE_ENVIRON_ARRAY)
7475 # endif /* USE_ENVIRON_ARRAY */
7486 Using various gambits, try to get an IO from an SV: the IO slot if its a
7487 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7488 named after the PV if we're a string.
7494 Perl_sv_2io(pTHX_ SV *sv)
7499 switch (SvTYPE(sv)) {
7507 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7511 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7513 return sv_2io(SvRV(sv));
7514 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7520 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7529 Using various gambits, try to get a CV from an SV; in addition, try if
7530 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7536 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7543 return *gvp = Nullgv, Nullcv;
7544 switch (SvTYPE(sv)) {
7562 SV * const *sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7563 tryAMAGICunDEREF(to_cv);
7566 if (SvTYPE(sv) == SVt_PVCV) {
7575 Perl_croak(aTHX_ "Not a subroutine reference");
7580 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7586 if (lref && !GvCVu(gv)) {
7589 tmpsv = NEWSV(704,0);
7590 gv_efullname3(tmpsv, gv, Nullch);
7591 /* XXX this is probably not what they think they're getting.
7592 * It has the same effect as "sub name;", i.e. just a forward
7594 newSUB(start_subparse(FALSE, 0),
7595 newSVOP(OP_CONST, 0, tmpsv),
7600 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7610 Returns true if the SV has a true value by Perl's rules.
7611 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7612 instead use an in-line version.
7618 Perl_sv_true(pTHX_ register SV *sv)
7623 register const XPV* const tXpv = (XPV*)SvANY(sv);
7625 (tXpv->xpv_cur > 1 ||
7626 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7633 return SvIVX(sv) != 0;
7636 return SvNVX(sv) != 0.0;
7638 return sv_2bool(sv);
7644 =for apidoc sv_pvn_force
7646 Get a sensible string out of the SV somehow.
7647 A private implementation of the C<SvPV_force> macro for compilers which
7648 can't cope with complex macro expressions. Always use the macro instead.
7650 =for apidoc sv_pvn_force_flags
7652 Get a sensible string out of the SV somehow.
7653 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7654 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7655 implemented in terms of this function.
7656 You normally want to use the various wrapper macros instead: see
7657 C<SvPV_force> and C<SvPV_force_nomg>
7663 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7666 if (SvTHINKFIRST(sv) && !SvROK(sv))
7667 sv_force_normal_flags(sv, 0);
7677 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7678 const char * const ref = sv_reftype(sv,0);
7680 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7681 ref, OP_NAME(PL_op));
7683 Perl_croak(aTHX_ "Can't coerce readonly %s to string", ref);
7685 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM)
7686 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7688 s = sv_2pv_flags(sv, &len, flags);
7692 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7695 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7696 SvGROW(sv, len + 1);
7697 Move(s,SvPVX(sv),len,char);
7702 SvPOK_on(sv); /* validate pointer */
7704 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7705 PTR2UV(sv),SvPVX_const(sv)));
7708 return SvPVX_mutable(sv);
7712 =for apidoc sv_pvbyten_force
7714 The backend for the C<SvPVbytex_force> macro. Always use the macro instead.
7720 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7722 sv_pvn_force(sv,lp);
7723 sv_utf8_downgrade(sv,0);
7729 =for apidoc sv_pvutf8n_force
7731 The backend for the C<SvPVutf8x_force> macro. Always use the macro instead.
7737 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7739 sv_pvn_force(sv,lp);
7740 sv_utf8_upgrade(sv);
7746 =for apidoc sv_reftype
7748 Returns a string describing what the SV is a reference to.
7754 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
7756 /* The fact that I don't need to downcast to char * everywhere, only in ?:
7757 inside return suggests a const propagation bug in g++. */
7758 if (ob && SvOBJECT(sv)) {
7759 char * const name = HvNAME_get(SvSTASH(sv));
7760 return name ? name : (char *) "__ANON__";
7763 switch (SvTYPE(sv)) {
7780 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
7781 /* tied lvalues should appear to be
7782 * scalars for backwards compatitbility */
7783 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7784 ? "SCALAR" : "LVALUE");
7785 case SVt_PVAV: return "ARRAY";
7786 case SVt_PVHV: return "HASH";
7787 case SVt_PVCV: return "CODE";
7788 case SVt_PVGV: return "GLOB";
7789 case SVt_PVFM: return "FORMAT";
7790 case SVt_PVIO: return "IO";
7791 default: return "UNKNOWN";
7797 =for apidoc sv_isobject
7799 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7800 object. If the SV is not an RV, or if the object is not blessed, then this
7807 Perl_sv_isobject(pTHX_ SV *sv)
7823 Returns a boolean indicating whether the SV is blessed into the specified
7824 class. This does not check for subtypes; use C<sv_derived_from> to verify
7825 an inheritance relationship.
7831 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7842 hvname = HvNAME_get(SvSTASH(sv));
7846 return strEQ(hvname, name);
7852 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7853 it will be upgraded to one. If C<classname> is non-null then the new SV will
7854 be blessed in the specified package. The new SV is returned and its
7855 reference count is 1.
7861 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7867 SV_CHECK_THINKFIRST_COW_DROP(rv);
7870 if (SvTYPE(rv) >= SVt_PVMG) {
7871 const U32 refcnt = SvREFCNT(rv);
7875 SvREFCNT(rv) = refcnt;
7878 if (SvTYPE(rv) < SVt_RV)
7879 sv_upgrade(rv, SVt_RV);
7880 else if (SvTYPE(rv) > SVt_RV) {
7891 HV* const stash = gv_stashpv(classname, TRUE);
7892 (void)sv_bless(rv, stash);
7898 =for apidoc sv_setref_pv
7900 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7901 argument will be upgraded to an RV. That RV will be modified to point to
7902 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7903 into the SV. The C<classname> argument indicates the package for the
7904 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7905 will have a reference count of 1, and the RV will be returned.
7907 Do not use with other Perl types such as HV, AV, SV, CV, because those
7908 objects will become corrupted by the pointer copy process.
7910 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7916 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7919 sv_setsv(rv, &PL_sv_undef);
7923 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7928 =for apidoc sv_setref_iv
7930 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7931 argument will be upgraded to an RV. That RV will be modified to point to
7932 the new SV. The C<classname> argument indicates the package for the
7933 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7934 will have a reference count of 1, and the RV will be returned.
7940 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7942 sv_setiv(newSVrv(rv,classname), iv);
7947 =for apidoc sv_setref_uv
7949 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7950 argument will be upgraded to an RV. That RV will be modified to point to
7951 the new SV. The C<classname> argument indicates the package for the
7952 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7953 will have a reference count of 1, and the RV will be returned.
7959 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7961 sv_setuv(newSVrv(rv,classname), uv);
7966 =for apidoc sv_setref_nv
7968 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7969 argument will be upgraded to an RV. That RV will be modified to point to
7970 the new SV. The C<classname> argument indicates the package for the
7971 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7972 will have a reference count of 1, and the RV will be returned.
7978 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7980 sv_setnv(newSVrv(rv,classname), nv);
7985 =for apidoc sv_setref_pvn
7987 Copies a string into a new SV, optionally blessing the SV. The length of the
7988 string must be specified with C<n>. The C<rv> argument will be upgraded to
7989 an RV. That RV will be modified to point to the new SV. The C<classname>
7990 argument indicates the package for the blessing. Set C<classname> to
7991 C<Nullch> to avoid the blessing. The new SV will have a reference count
7992 of 1, and the RV will be returned.
7994 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8000 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
8002 sv_setpvn(newSVrv(rv,classname), pv, n);
8007 =for apidoc sv_bless
8009 Blesses an SV into a specified package. The SV must be an RV. The package
8010 must be designated by its stash (see C<gv_stashpv()>). The reference count
8011 of the SV is unaffected.
8017 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8021 Perl_croak(aTHX_ "Can't bless non-reference value");
8023 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8024 if (SvREADONLY(tmpRef))
8025 Perl_croak(aTHX_ PL_no_modify);
8026 if (SvOBJECT(tmpRef)) {
8027 if (SvTYPE(tmpRef) != SVt_PVIO)
8029 SvREFCNT_dec(SvSTASH(tmpRef));
8032 SvOBJECT_on(tmpRef);
8033 if (SvTYPE(tmpRef) != SVt_PVIO)
8035 SvUPGRADE(tmpRef, SVt_PVMG);
8036 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8043 if(SvSMAGICAL(tmpRef))
8044 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8052 /* Downgrades a PVGV to a PVMG.
8056 S_sv_unglob(pTHX_ SV *sv)
8060 assert(SvTYPE(sv) == SVt_PVGV);
8065 sv_del_backref((SV*)GvSTASH(sv), sv);
8066 GvSTASH(sv) = Nullhv;
8068 sv_unmagic(sv, PERL_MAGIC_glob);
8069 Safefree(GvNAME(sv));
8072 /* need to keep SvANY(sv) in the right arena */
8073 xpvmg = new_XPVMG();
8074 StructCopy(SvANY(sv), xpvmg, XPVMG);
8075 del_XPVGV(SvANY(sv));
8078 SvFLAGS(sv) &= ~SVTYPEMASK;
8079 SvFLAGS(sv) |= SVt_PVMG;
8083 =for apidoc sv_unref_flags
8085 Unsets the RV status of the SV, and decrements the reference count of
8086 whatever was being referenced by the RV. This can almost be thought of
8087 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8088 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8089 (otherwise the decrementing is conditional on the reference count being
8090 different from one or the reference being a readonly SV).
8097 Perl_sv_unref_flags(pTHX_ SV *ref, U32 flags)
8099 SV* const target = SvRV(ref);
8101 if (SvWEAKREF(ref)) {
8102 sv_del_backref(target, ref);
8104 SvRV_set(ref, NULL);
8107 SvRV_set(ref, NULL);
8109 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
8110 assigned to as BEGIN {$a = \"Foo"} will fail. */
8111 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
8112 SvREFCNT_dec(target);
8113 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8114 sv_2mortal(target); /* Schedule for freeing later */
8118 =for apidoc sv_untaint
8120 Untaint an SV. Use C<SvTAINTED_off> instead.
8125 Perl_sv_untaint(pTHX_ SV *sv)
8127 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8128 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8135 =for apidoc sv_tainted
8137 Test an SV for taintedness. Use C<SvTAINTED> instead.
8142 Perl_sv_tainted(pTHX_ SV *sv)
8144 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8145 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8146 if (mg && (mg->mg_len & 1) )
8153 =for apidoc sv_setpviv
8155 Copies an integer into the given SV, also updating its string value.
8156 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8162 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8164 char buf[TYPE_CHARS(UV)];
8166 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8168 sv_setpvn(sv, ptr, ebuf - ptr);
8172 =for apidoc sv_setpviv_mg
8174 Like C<sv_setpviv>, but also handles 'set' magic.
8180 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8186 #if defined(PERL_IMPLICIT_CONTEXT)
8188 /* pTHX_ magic can't cope with varargs, so this is a no-context
8189 * version of the main function, (which may itself be aliased to us).
8190 * Don't access this version directly.
8194 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8198 va_start(args, pat);
8199 sv_vsetpvf(sv, pat, &args);
8203 /* pTHX_ magic can't cope with varargs, so this is a no-context
8204 * version of the main function, (which may itself be aliased to us).
8205 * Don't access this version directly.
8209 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8213 va_start(args, pat);
8214 sv_vsetpvf_mg(sv, pat, &args);
8220 =for apidoc sv_setpvf
8222 Works like C<sv_catpvf> but copies the text into the SV instead of
8223 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8229 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8232 va_start(args, pat);
8233 sv_vsetpvf(sv, pat, &args);
8238 =for apidoc sv_vsetpvf
8240 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8241 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8243 Usually used via its frontend C<sv_setpvf>.
8249 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8251 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8255 =for apidoc sv_setpvf_mg
8257 Like C<sv_setpvf>, but also handles 'set' magic.
8263 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8266 va_start(args, pat);
8267 sv_vsetpvf_mg(sv, pat, &args);
8272 =for apidoc sv_vsetpvf_mg
8274 Like C<sv_vsetpvf>, but also handles 'set' magic.
8276 Usually used via its frontend C<sv_setpvf_mg>.
8282 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8284 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8288 #if defined(PERL_IMPLICIT_CONTEXT)
8290 /* pTHX_ magic can't cope with varargs, so this is a no-context
8291 * version of the main function, (which may itself be aliased to us).
8292 * Don't access this version directly.
8296 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8300 va_start(args, pat);
8301 sv_vcatpvf(sv, pat, &args);
8305 /* pTHX_ magic can't cope with varargs, so this is a no-context
8306 * version of the main function, (which may itself be aliased to us).
8307 * Don't access this version directly.
8311 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8315 va_start(args, pat);
8316 sv_vcatpvf_mg(sv, pat, &args);
8322 =for apidoc sv_catpvf
8324 Processes its arguments like C<sprintf> and appends the formatted
8325 output to an SV. If the appended data contains "wide" characters
8326 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8327 and characters >255 formatted with %c), the original SV might get
8328 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8329 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8330 valid UTF-8; if the original SV was bytes, the pattern should be too.
8335 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8338 va_start(args, pat);
8339 sv_vcatpvf(sv, pat, &args);
8344 =for apidoc sv_vcatpvf
8346 Processes its arguments like C<vsprintf> and appends the formatted output
8347 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8349 Usually used via its frontend C<sv_catpvf>.
8355 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8357 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8361 =for apidoc sv_catpvf_mg
8363 Like C<sv_catpvf>, but also handles 'set' magic.
8369 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8372 va_start(args, pat);
8373 sv_vcatpvf_mg(sv, pat, &args);
8378 =for apidoc sv_vcatpvf_mg
8380 Like C<sv_vcatpvf>, but also handles 'set' magic.
8382 Usually used via its frontend C<sv_catpvf_mg>.
8388 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8390 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8395 =for apidoc sv_vsetpvfn
8397 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8400 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8406 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8408 sv_setpvn(sv, "", 0);
8409 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8412 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8415 S_expect_number(pTHX_ char** pattern)
8418 switch (**pattern) {
8419 case '1': case '2': case '3':
8420 case '4': case '5': case '6':
8421 case '7': case '8': case '9':
8422 while (isDIGIT(**pattern))
8423 var = var * 10 + (*(*pattern)++ - '0');
8427 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8430 F0convert(NV nv, char *endbuf, STRLEN *len)
8432 const int neg = nv < 0;
8441 if (uv & 1 && uv == nv)
8442 uv--; /* Round to even */
8444 const unsigned dig = uv % 10;
8457 =for apidoc sv_vcatpvfn
8459 Processes its arguments like C<vsprintf> and appends the formatted output
8460 to an SV. Uses an array of SVs if the C style variable argument list is
8461 missing (NULL). When running with taint checks enabled, indicates via
8462 C<maybe_tainted> if results are untrustworthy (often due to the use of
8465 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8471 #define VECTORIZE_ARGS vecsv = va_arg(*args, SV*);\
8472 vecstr = (U8*)SvPV_const(vecsv,veclen);\
8473 vec_utf8 = DO_UTF8(vecsv);
8475 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8478 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8485 static const char nullstr[] = "(null)";
8487 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8488 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8490 /* Times 4: a decimal digit takes more than 3 binary digits.
8491 * NV_DIG: mantissa takes than many decimal digits.
8492 * Plus 32: Playing safe. */
8493 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8494 /* large enough for "%#.#f" --chip */
8495 /* what about long double NVs? --jhi */
8497 PERL_UNUSED_ARG(maybe_tainted);
8499 /* no matter what, this is a string now */
8500 (void)SvPV_force(sv, origlen);
8502 /* special-case "", "%s", and "%-p" (SVf - see below) */
8505 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8507 const char * const s = va_arg(*args, char*);
8508 sv_catpv(sv, s ? s : nullstr);
8510 else if (svix < svmax) {
8511 sv_catsv(sv, *svargs);
8512 if (DO_UTF8(*svargs))
8517 if (args && patlen == 3 && pat[0] == '%' &&
8518 pat[1] == '-' && pat[2] == 'p') {
8519 argsv = va_arg(*args, SV*);
8520 sv_catsv(sv, argsv);
8526 #ifndef USE_LONG_DOUBLE
8527 /* special-case "%.<number>[gf]" */
8528 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8529 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8530 unsigned digits = 0;
8534 while (*pp >= '0' && *pp <= '9')
8535 digits = 10 * digits + (*pp++ - '0');
8536 if (pp - pat == (int)patlen - 1) {
8544 /* Add check for digits != 0 because it seems that some
8545 gconverts are buggy in this case, and we don't yet have
8546 a Configure test for this. */
8547 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8548 /* 0, point, slack */
8549 Gconvert(nv, (int)digits, 0, ebuf);
8551 if (*ebuf) /* May return an empty string for digits==0 */
8554 } else if (!digits) {
8557 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8558 sv_catpvn(sv, p, l);
8564 #endif /* !USE_LONG_DOUBLE */
8566 if (!args && svix < svmax && DO_UTF8(*svargs))
8569 patend = (char*)pat + patlen;
8570 for (p = (char*)pat; p < patend; p = q) {
8573 bool vectorize = FALSE;
8574 bool vectorarg = FALSE;
8575 bool vec_utf8 = FALSE;
8581 bool has_precis = FALSE;
8584 bool is_utf8 = FALSE; /* is this item utf8? */
8585 #ifdef HAS_LDBL_SPRINTF_BUG
8586 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8587 with sfio - Allen <allens@cpan.org> */
8588 bool fix_ldbl_sprintf_bug = FALSE;
8592 U8 utf8buf[UTF8_MAXBYTES+1];
8593 STRLEN esignlen = 0;
8595 const char *eptr = Nullch;
8598 const U8 *vecstr = Null(U8*);
8605 /* we need a long double target in case HAS_LONG_DOUBLE but
8608 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8616 const char *dotstr = ".";
8617 STRLEN dotstrlen = 1;
8618 I32 efix = 0; /* explicit format parameter index */
8619 I32 ewix = 0; /* explicit width index */
8620 I32 epix = 0; /* explicit precision index */
8621 I32 evix = 0; /* explicit vector index */
8622 bool asterisk = FALSE;
8624 /* echo everything up to the next format specification */
8625 for (q = p; q < patend && *q != '%'; ++q) ;
8627 if (has_utf8 && !pat_utf8)
8628 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8630 sv_catpvn(sv, p, q - p);
8637 We allow format specification elements in this order:
8638 \d+\$ explicit format parameter index
8640 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8641 0 flag (as above): repeated to allow "v02"
8642 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8643 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8645 [%bcdefginopsuxDFOUX] format (mandatory)
8650 As of perl5.9.3, printf format checking is on by default.
8651 Internally, perl uses %p formats to provide an escape to
8652 some extended formatting. This block deals with those
8653 extensions: if it does not match, (char*)q is reset and
8654 the normal format processing code is used.
8656 Currently defined extensions are:
8657 %p include pointer address (standard)
8658 %-p (SVf) include an SV (previously %_)
8659 %-<num>p include an SV with precision <num>
8660 %1p (VDf) include a v-string (as %vd)
8661 %<num>p reserved for future extensions
8663 Robin Barker 2005-07-14
8670 EXPECT_NUMBER(q, n);
8677 argsv = va_arg(*args, SV*);
8678 eptr = SvPVx_const(argsv, elen);
8684 else if (n == vdNUMBER) { /* VDf */
8691 if (ckWARN_d(WARN_INTERNAL))
8692 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
8693 "internal %%<num>p might conflict with future printf extensions");
8699 if (EXPECT_NUMBER(q, width)) {
8740 if (EXPECT_NUMBER(q, ewix))
8749 if ((vectorarg = asterisk)) {
8762 EXPECT_NUMBER(q, width);
8768 vecsv = va_arg(*args, SV*);
8770 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8771 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8772 dotstr = SvPV_const(vecsv, dotstrlen);
8779 else if (efix ? efix <= svmax : svix < svmax) {
8780 vecsv = svargs[efix ? efix-1 : svix++];
8781 vecstr = (U8*)SvPV_const(vecsv,veclen);
8782 vec_utf8 = DO_UTF8(vecsv);
8783 /* if this is a version object, we need to return the
8784 * stringified representation (which the SvPVX_const has
8785 * already done for us), but not vectorize the args
8787 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
8789 q++; /* skip past the rest of the %vd format */
8790 eptr = (const char *) vecstr;
8804 i = va_arg(*args, int);
8806 i = (ewix ? ewix <= svmax : svix < svmax) ?
8807 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8809 width = (i < 0) ? -i : i;
8819 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8821 /* XXX: todo, support specified precision parameter */
8825 i = va_arg(*args, int);
8827 i = (ewix ? ewix <= svmax : svix < svmax)
8828 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8829 precis = (i < 0) ? 0 : i;
8834 precis = precis * 10 + (*q++ - '0');
8843 case 'I': /* Ix, I32x, and I64x */
8845 if (q[1] == '6' && q[2] == '4') {
8851 if (q[1] == '3' && q[2] == '2') {
8861 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8872 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8873 if (*(q + 1) == 'l') { /* lld, llf */
8898 argsv = (efix ? efix <= svmax : svix < svmax) ?
8899 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8906 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8908 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8910 eptr = (char*)utf8buf;
8911 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8922 if (args && !vectorize) {
8923 eptr = va_arg(*args, char*);
8925 #ifdef MACOS_TRADITIONAL
8926 /* On MacOS, %#s format is used for Pascal strings */
8931 elen = strlen(eptr);
8933 eptr = (char *)nullstr;
8934 elen = sizeof nullstr - 1;
8938 eptr = SvPVx_const(argsv, elen);
8939 if (DO_UTF8(argsv)) {
8940 if (has_precis && precis < elen) {
8942 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8945 if (width) { /* fudge width (can't fudge elen) */
8946 width += elen - sv_len_utf8(argsv);
8954 if (has_precis && elen > precis)
8961 if (alt || vectorize)
8963 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8984 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8993 esignbuf[esignlen++] = plus;
8997 case 'h': iv = (short)va_arg(*args, int); break;
8998 case 'l': iv = va_arg(*args, long); break;
8999 case 'V': iv = va_arg(*args, IV); break;
9000 default: iv = va_arg(*args, int); break;
9002 case 'q': iv = va_arg(*args, Quad_t); break;
9007 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9009 case 'h': iv = (short)tiv; break;
9010 case 'l': iv = (long)tiv; break;
9012 default: iv = tiv; break;
9014 case 'q': iv = (Quad_t)tiv; break;
9018 if ( !vectorize ) /* we already set uv above */
9023 esignbuf[esignlen++] = plus;
9027 esignbuf[esignlen++] = '-';
9070 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9081 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9082 case 'l': uv = va_arg(*args, unsigned long); break;
9083 case 'V': uv = va_arg(*args, UV); break;
9084 default: uv = va_arg(*args, unsigned); break;
9086 case 'q': uv = va_arg(*args, Uquad_t); break;
9091 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9093 case 'h': uv = (unsigned short)tuv; break;
9094 case 'l': uv = (unsigned long)tuv; break;
9096 default: uv = tuv; break;
9098 case 'q': uv = (Uquad_t)tuv; break;
9105 char *ptr = ebuf + sizeof ebuf;
9111 p = (char*)((c == 'X')
9112 ? "0123456789ABCDEF" : "0123456789abcdef");
9118 esignbuf[esignlen++] = '0';
9119 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9127 if (alt && *ptr != '0')
9136 esignbuf[esignlen++] = '0';
9137 esignbuf[esignlen++] = 'b';
9140 default: /* it had better be ten or less */
9144 } while (uv /= base);
9147 elen = (ebuf + sizeof ebuf) - ptr;
9151 zeros = precis - elen;
9152 else if (precis == 0 && elen == 1 && *eptr == '0')
9158 /* FLOATING POINT */
9161 c = 'f'; /* maybe %F isn't supported here */
9167 /* This is evil, but floating point is even more evil */
9169 /* for SV-style calling, we can only get NV
9170 for C-style calling, we assume %f is double;
9171 for simplicity we allow any of %Lf, %llf, %qf for long double
9175 #if defined(USE_LONG_DOUBLE)
9179 /* [perl #20339] - we should accept and ignore %lf rather than die */
9183 #if defined(USE_LONG_DOUBLE)
9184 intsize = args ? 0 : 'q';
9188 #if defined(HAS_LONG_DOUBLE)
9197 /* now we need (long double) if intsize == 'q', else (double) */
9198 nv = (args && !vectorize) ?
9199 #if LONG_DOUBLESIZE > DOUBLESIZE
9201 va_arg(*args, long double) :
9202 va_arg(*args, double)
9204 va_arg(*args, double)
9210 if (c != 'e' && c != 'E') {
9212 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9213 will cast our (long double) to (double) */
9214 (void)Perl_frexp(nv, &i);
9215 if (i == PERL_INT_MIN)
9216 Perl_die(aTHX_ "panic: frexp");
9218 need = BIT_DIGITS(i);
9220 need += has_precis ? precis : 6; /* known default */
9225 #ifdef HAS_LDBL_SPRINTF_BUG
9226 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9227 with sfio - Allen <allens@cpan.org> */
9230 # define MY_DBL_MAX DBL_MAX
9231 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9232 # if DOUBLESIZE >= 8
9233 # define MY_DBL_MAX 1.7976931348623157E+308L
9235 # define MY_DBL_MAX 3.40282347E+38L
9239 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9240 # define MY_DBL_MAX_BUG 1L
9242 # define MY_DBL_MAX_BUG MY_DBL_MAX
9246 # define MY_DBL_MIN DBL_MIN
9247 # else /* XXX guessing! -Allen */
9248 # if DOUBLESIZE >= 8
9249 # define MY_DBL_MIN 2.2250738585072014E-308L
9251 # define MY_DBL_MIN 1.17549435E-38L
9255 if ((intsize == 'q') && (c == 'f') &&
9256 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9258 /* it's going to be short enough that
9259 * long double precision is not needed */
9261 if ((nv <= 0L) && (nv >= -0L))
9262 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9264 /* would use Perl_fp_class as a double-check but not
9265 * functional on IRIX - see perl.h comments */
9267 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9268 /* It's within the range that a double can represent */
9269 #if defined(DBL_MAX) && !defined(DBL_MIN)
9270 if ((nv >= ((long double)1/DBL_MAX)) ||
9271 (nv <= (-(long double)1/DBL_MAX)))
9273 fix_ldbl_sprintf_bug = TRUE;
9276 if (fix_ldbl_sprintf_bug == TRUE) {
9286 # undef MY_DBL_MAX_BUG
9289 #endif /* HAS_LDBL_SPRINTF_BUG */
9291 need += 20; /* fudge factor */
9292 if (PL_efloatsize < need) {
9293 Safefree(PL_efloatbuf);
9294 PL_efloatsize = need + 20; /* more fudge */
9295 Newx(PL_efloatbuf, PL_efloatsize, char);
9296 PL_efloatbuf[0] = '\0';
9299 if ( !(width || left || plus || alt) && fill != '0'
9300 && has_precis && intsize != 'q' ) { /* Shortcuts */
9301 /* See earlier comment about buggy Gconvert when digits,
9303 if ( c == 'g' && precis) {
9304 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9305 /* May return an empty string for digits==0 */
9306 if (*PL_efloatbuf) {
9307 elen = strlen(PL_efloatbuf);
9308 goto float_converted;
9310 } else if ( c == 'f' && !precis) {
9311 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9316 char *ptr = ebuf + sizeof ebuf;
9319 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9320 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9321 if (intsize == 'q') {
9322 /* Copy the one or more characters in a long double
9323 * format before the 'base' ([efgEFG]) character to
9324 * the format string. */
9325 static char const prifldbl[] = PERL_PRIfldbl;
9326 char const *p = prifldbl + sizeof(prifldbl) - 3;
9327 while (p >= prifldbl) { *--ptr = *p--; }
9332 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9337 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9349 /* No taint. Otherwise we are in the strange situation
9350 * where printf() taints but print($float) doesn't.
9352 #if defined(HAS_LONG_DOUBLE)
9353 elen = ((intsize == 'q')
9354 ? my_sprintf(PL_efloatbuf, ptr, nv)
9355 : my_sprintf(PL_efloatbuf, ptr, (double)nv));
9357 elen = my_sprintf(PL_efloatbuf, ptr, nv);
9361 eptr = PL_efloatbuf;
9367 i = SvCUR(sv) - origlen;
9368 if (args && !vectorize) {
9370 case 'h': *(va_arg(*args, short*)) = i; break;
9371 default: *(va_arg(*args, int*)) = i; break;
9372 case 'l': *(va_arg(*args, long*)) = i; break;
9373 case 'V': *(va_arg(*args, IV*)) = i; break;
9375 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9380 sv_setuv_mg(argsv, (UV)i);
9382 continue; /* not "break" */
9389 && (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)
9390 && ckWARN(WARN_PRINTF))
9392 SV * const msg = sv_newmortal();
9393 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9394 (PL_op->op_type == OP_PRTF) ? "" : "s");
9397 Perl_sv_catpvf(aTHX_ msg,
9398 "\"%%%c\"", c & 0xFF);
9400 Perl_sv_catpvf(aTHX_ msg,
9401 "\"%%\\%03"UVof"\"",
9404 sv_catpv(msg, "end of string");
9405 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9408 /* output mangled stuff ... */
9414 /* ... right here, because formatting flags should not apply */
9415 SvGROW(sv, SvCUR(sv) + elen + 1);
9417 Copy(eptr, p, elen, char);
9420 SvCUR_set(sv, p - SvPVX_const(sv));
9422 continue; /* not "break" */
9425 /* calculate width before utf8_upgrade changes it */
9426 have = esignlen + zeros + elen;
9428 if (is_utf8 != has_utf8) {
9431 sv_utf8_upgrade(sv);
9434 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
9435 sv_utf8_upgrade(nsv);
9436 eptr = SvPVX_const(nsv);
9439 SvGROW(sv, SvCUR(sv) + elen + 1);
9444 need = (have > width ? have : width);
9447 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9449 if (esignlen && fill == '0') {
9451 for (i = 0; i < (int)esignlen; i++)
9455 memset(p, fill, gap);
9458 if (esignlen && fill != '0') {
9460 for (i = 0; i < (int)esignlen; i++)
9465 for (i = zeros; i; i--)
9469 Copy(eptr, p, elen, char);
9473 memset(p, ' ', gap);
9478 Copy(dotstr, p, dotstrlen, char);
9482 vectorize = FALSE; /* done iterating over vecstr */
9489 SvCUR_set(sv, p - SvPVX_const(sv));
9497 /* =========================================================================
9499 =head1 Cloning an interpreter
9501 All the macros and functions in this section are for the private use of
9502 the main function, perl_clone().
9504 The foo_dup() functions make an exact copy of an existing foo thinngy.
9505 During the course of a cloning, a hash table is used to map old addresses
9506 to new addresses. The table is created and manipulated with the
9507 ptr_table_* functions.
9511 ============================================================================*/
9514 #if defined(USE_ITHREADS)
9516 #ifndef GpREFCNT_inc
9517 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9521 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9522 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9523 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9524 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9525 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9526 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9527 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9528 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9529 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9530 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9531 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9532 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9533 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9536 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9537 regcomp.c. AMS 20010712 */
9540 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
9545 struct reg_substr_datum *s;
9548 return (REGEXP *)NULL;
9550 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9553 len = r->offsets[0];
9554 npar = r->nparens+1;
9556 Newxc(ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9557 Copy(r->program, ret->program, len+1, regnode);
9559 Newx(ret->startp, npar, I32);
9560 Copy(r->startp, ret->startp, npar, I32);
9561 Newx(ret->endp, npar, I32);
9562 Copy(r->startp, ret->startp, npar, I32);
9564 Newx(ret->substrs, 1, struct reg_substr_data);
9565 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9566 s->min_offset = r->substrs->data[i].min_offset;
9567 s->max_offset = r->substrs->data[i].max_offset;
9568 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9569 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9572 ret->regstclass = NULL;
9575 const int count = r->data->count;
9578 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
9579 char, struct reg_data);
9580 Newx(d->what, count, U8);
9583 for (i = 0; i < count; i++) {
9584 d->what[i] = r->data->what[i];
9585 switch (d->what[i]) {
9586 /* legal options are one of: sfpont
9587 see also regcomp.h and pregfree() */
9589 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9592 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9595 /* This is cheating. */
9596 Newx(d->data[i], 1, struct regnode_charclass_class);
9597 StructCopy(r->data->data[i], d->data[i],
9598 struct regnode_charclass_class);
9599 ret->regstclass = (regnode*)d->data[i];
9602 /* Compiled op trees are readonly, and can thus be
9603 shared without duplication. */
9605 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9609 d->data[i] = r->data->data[i];
9612 d->data[i] = r->data->data[i];
9614 ((reg_trie_data*)d->data[i])->refcount++;
9618 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9627 Newx(ret->offsets, 2*len+1, U32);
9628 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9630 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9631 ret->refcnt = r->refcnt;
9632 ret->minlen = r->minlen;
9633 ret->prelen = r->prelen;
9634 ret->nparens = r->nparens;
9635 ret->lastparen = r->lastparen;
9636 ret->lastcloseparen = r->lastcloseparen;
9637 ret->reganch = r->reganch;
9639 ret->sublen = r->sublen;
9641 if (RX_MATCH_COPIED(ret))
9642 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9644 ret->subbeg = Nullch;
9645 #ifdef PERL_OLD_COPY_ON_WRITE
9646 ret->saved_copy = Nullsv;
9649 ptr_table_store(PL_ptr_table, r, ret);
9653 /* duplicate a file handle */
9656 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9660 PERL_UNUSED_ARG(type);
9663 return (PerlIO*)NULL;
9665 /* look for it in the table first */
9666 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9670 /* create anew and remember what it is */
9671 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9672 ptr_table_store(PL_ptr_table, fp, ret);
9676 /* duplicate a directory handle */
9679 Perl_dirp_dup(pTHX_ DIR *dp)
9687 /* duplicate a typeglob */
9690 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9695 /* look for it in the table first */
9696 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9700 /* create anew and remember what it is */
9702 ptr_table_store(PL_ptr_table, gp, ret);
9705 ret->gp_refcnt = 0; /* must be before any other dups! */
9706 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9707 ret->gp_io = io_dup_inc(gp->gp_io, param);
9708 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9709 ret->gp_av = av_dup_inc(gp->gp_av, param);
9710 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9711 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9712 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9713 ret->gp_cvgen = gp->gp_cvgen;
9714 ret->gp_line = gp->gp_line;
9715 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9719 /* duplicate a chain of magic */
9722 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9724 MAGIC *mgprev = (MAGIC*)NULL;
9727 return (MAGIC*)NULL;
9728 /* look for it in the table first */
9729 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9733 for (; mg; mg = mg->mg_moremagic) {
9735 Newxz(nmg, 1, MAGIC);
9737 mgprev->mg_moremagic = nmg;
9740 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9741 nmg->mg_private = mg->mg_private;
9742 nmg->mg_type = mg->mg_type;
9743 nmg->mg_flags = mg->mg_flags;
9744 if (mg->mg_type == PERL_MAGIC_qr) {
9745 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9747 else if(mg->mg_type == PERL_MAGIC_backref) {
9748 const AV * const av = (AV*) mg->mg_obj;
9751 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
9753 for (i = AvFILLp(av); i >= 0; i--) {
9754 if (!svp[i]) continue;
9755 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9758 else if (mg->mg_type == PERL_MAGIC_symtab) {
9759 nmg->mg_obj = mg->mg_obj;
9762 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9763 ? sv_dup_inc(mg->mg_obj, param)
9764 : sv_dup(mg->mg_obj, param);
9766 nmg->mg_len = mg->mg_len;
9767 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9768 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9769 if (mg->mg_len > 0) {
9770 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9771 if (mg->mg_type == PERL_MAGIC_overload_table &&
9772 AMT_AMAGIC((AMT*)mg->mg_ptr))
9774 AMT * const amtp = (AMT*)mg->mg_ptr;
9775 AMT * const namtp = (AMT*)nmg->mg_ptr;
9777 for (i = 1; i < NofAMmeth; i++) {
9778 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9782 else if (mg->mg_len == HEf_SVKEY)
9783 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9785 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9786 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9793 /* create a new pointer-mapping table */
9796 Perl_ptr_table_new(pTHX)
9799 Newxz(tbl, 1, PTR_TBL_t);
9802 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9807 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
9809 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
9813 we use the PTE_SVSLOT 'reservation' made above, both here (in the
9814 following define) and at call to new_body_inline made below in
9815 Perl_ptr_table_store()
9818 #define del_pte(p) del_body_type(p, PTE_SVSLOT)
9820 /* map an existing pointer using a table */
9823 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
9825 PTR_TBL_ENT_t *tblent;
9826 const UV hash = PTR_TABLE_HASH(sv);
9828 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9829 for (; tblent; tblent = tblent->next) {
9830 if (tblent->oldval == sv)
9831 return tblent->newval;
9836 /* add a new entry to a pointer-mapping table */
9839 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldsv, void *newsv)
9841 PTR_TBL_ENT_t *tblent, **otblent;
9842 /* XXX this may be pessimal on platforms where pointers aren't good
9843 * hash values e.g. if they grow faster in the most significant
9845 const UV hash = PTR_TABLE_HASH(oldsv);
9849 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9850 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
9851 if (tblent->oldval == oldsv) {
9852 tblent->newval = newsv;
9856 new_body_inline(tblent, &PL_body_roots[PTE_SVSLOT],
9857 sizeof(struct ptr_tbl_ent), PTE_SVSLOT);
9858 tblent->oldval = oldsv;
9859 tblent->newval = newsv;
9860 tblent->next = *otblent;
9863 if (!empty && tbl->tbl_items > tbl->tbl_max)
9864 ptr_table_split(tbl);
9867 /* double the hash bucket size of an existing ptr table */
9870 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9872 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9873 const UV oldsize = tbl->tbl_max + 1;
9874 UV newsize = oldsize * 2;
9877 Renew(ary, newsize, PTR_TBL_ENT_t*);
9878 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9879 tbl->tbl_max = --newsize;
9881 for (i=0; i < oldsize; i++, ary++) {
9882 PTR_TBL_ENT_t **curentp, **entp, *ent;
9885 curentp = ary + oldsize;
9886 for (entp = ary, ent = *ary; ent; ent = *entp) {
9887 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
9889 ent->next = *curentp;
9899 /* remove all the entries from a ptr table */
9902 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9904 register PTR_TBL_ENT_t **array;
9905 register PTR_TBL_ENT_t *entry;
9909 if (!tbl || !tbl->tbl_items) {
9913 array = tbl->tbl_ary;
9919 PTR_TBL_ENT_t *oentry = entry;
9920 entry = entry->next;
9924 if (++riter > max) {
9927 entry = array[riter];
9934 /* clear and free a ptr table */
9937 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9942 ptr_table_clear(tbl);
9943 Safefree(tbl->tbl_ary);
9949 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9952 SvRV_set(dstr, SvWEAKREF(sstr)
9953 ? sv_dup(SvRV(sstr), param)
9954 : sv_dup_inc(SvRV(sstr), param));
9957 else if (SvPVX_const(sstr)) {
9958 /* Has something there */
9960 /* Normal PV - clone whole allocated space */
9961 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
9962 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9963 /* Not that normal - actually sstr is copy on write.
9964 But we are a true, independant SV, so: */
9965 SvREADONLY_off(dstr);
9970 /* Special case - not normally malloced for some reason */
9971 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
9972 /* A "shared" PV - clone it as "shared" PV */
9974 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
9978 /* Some other special case - random pointer */
9979 SvPV_set(dstr, SvPVX(sstr));
9985 if (SvTYPE(dstr) == SVt_RV)
9986 SvRV_set(dstr, NULL);
9992 /* duplicate an SV of any type (including AV, HV etc) */
9995 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10000 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10002 /* look for it in the table first */
10003 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10007 if(param->flags & CLONEf_JOIN_IN) {
10008 /** We are joining here so we don't want do clone
10009 something that is bad **/
10010 const char *hvname;
10012 if(SvTYPE(sstr) == SVt_PVHV &&
10013 (hvname = HvNAME_get(sstr))) {
10014 /** don't clone stashes if they already exist **/
10015 return (SV*)gv_stashpv(hvname,0);
10019 /* create anew and remember what it is */
10022 #ifdef DEBUG_LEAKING_SCALARS
10023 dstr->sv_debug_optype = sstr->sv_debug_optype;
10024 dstr->sv_debug_line = sstr->sv_debug_line;
10025 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10026 dstr->sv_debug_cloned = 1;
10028 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10030 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10034 ptr_table_store(PL_ptr_table, sstr, dstr);
10037 SvFLAGS(dstr) = SvFLAGS(sstr);
10038 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10039 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10042 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10043 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10044 PL_watch_pvx, SvPVX_const(sstr));
10047 /* don't clone objects whose class has asked us not to */
10048 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10049 SvFLAGS(dstr) &= ~SVTYPEMASK;
10050 SvOBJECT_off(dstr);
10054 switch (SvTYPE(sstr)) {
10056 SvANY(dstr) = NULL;
10059 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10060 SvIV_set(dstr, SvIVX(sstr));
10063 SvANY(dstr) = new_XNV();
10064 SvNV_set(dstr, SvNVX(sstr));
10067 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10068 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10072 /* These are all the types that need complex bodies allocating. */
10073 size_t new_body_length;
10074 size_t new_body_offset = 0;
10075 void **new_body_arena;
10076 void **new_body_arenaroot;
10078 svtype sv_type = SvTYPE(sstr);
10082 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
10087 new_body = new_XPVIO();
10088 new_body_length = sizeof(XPVIO);
10091 new_body = new_XPVFM();
10092 new_body_length = sizeof(XPVFM);
10096 new_body_arena = &PL_body_roots[SVt_PVHV];
10097 new_body_arenaroot = &PL_body_arenaroots[SVt_PVHV];
10098 new_body_offset = - bodies_by_type[SVt_PVHV].offset;
10100 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10101 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10105 new_body_arena = &PL_body_roots[SVt_PVAV];
10106 new_body_arenaroot = &PL_body_arenaroots[SVt_PVAV];
10107 new_body_offset = - bodies_by_type[SVt_PVAV].offset;
10109 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10110 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10114 if (GvUNIQUE((GV*)sstr)) {
10115 /* Do sharing here, and fall through */
10122 new_body_length = bodies_by_type[sv_type].size;
10123 new_body_arena = &PL_body_roots[sv_type];
10124 new_body_arenaroot = &PL_body_arenaroots[sv_type];
10128 new_body_offset = - bodies_by_type[SVt_PVIV].offset;
10129 new_body_length = sizeof(XPVIV) - new_body_offset;
10130 new_body_arena = &PL_body_roots[SVt_PVIV];
10131 new_body_arenaroot = &PL_body_arenaroots[SVt_PVIV];
10134 new_body_offset = - bodies_by_type[SVt_PV].offset;
10135 new_body_length = sizeof(XPV) - new_body_offset;
10136 new_body_arena = &PL_body_roots[SVt_PV];
10137 new_body_arenaroot = &PL_body_arenaroots[SVt_PV];
10139 assert(new_body_length);
10141 new_body_inline(new_body, new_body_arena,
10142 new_body_length, SvTYPE(sstr));
10144 new_body = (void*)((char*)new_body - new_body_offset);
10146 /* We always allocated the full length item with PURIFY */
10147 new_body_length += new_body_offset;
10148 new_body_offset = 0;
10149 new_body = my_safemalloc(new_body_length);
10153 SvANY(dstr) = new_body;
10155 Copy(((char*)SvANY(sstr)) + new_body_offset,
10156 ((char*)SvANY(dstr)) + new_body_offset,
10157 new_body_length, char);
10159 if (SvTYPE(sstr) != SVt_PVAV && SvTYPE(sstr) != SVt_PVHV)
10160 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10162 /* The Copy above means that all the source (unduplicated) pointers
10163 are now in the destination. We can check the flags and the
10164 pointers in either, but it's possible that there's less cache
10165 missing by always going for the destination.
10166 FIXME - instrument and check that assumption */
10167 if (SvTYPE(sstr) >= SVt_PVMG) {
10169 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
10171 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
10174 switch (SvTYPE(sstr)) {
10186 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
10187 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
10188 LvTARG(dstr) = dstr;
10189 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
10190 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
10192 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
10195 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
10196 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
10197 /* Don't call sv_add_backref here as it's going to be created
10198 as part of the magic cloning of the symbol table. */
10199 GvGP(dstr) = gp_dup(GvGP(dstr), param);
10200 (void)GpREFCNT_inc(GvGP(dstr));
10203 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
10204 if (IoOFP(dstr) == IoIFP(sstr))
10205 IoOFP(dstr) = IoIFP(dstr);
10207 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
10208 /* PL_rsfp_filters entries have fake IoDIRP() */
10209 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
10210 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
10211 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
10212 /* I have no idea why fake dirp (rsfps)
10213 should be treated differently but otherwise
10214 we end up with leaks -- sky*/
10215 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
10216 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
10217 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
10219 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
10220 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
10221 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
10223 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
10224 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
10225 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
10228 if (AvARRAY((AV*)sstr)) {
10229 SV **dst_ary, **src_ary;
10230 SSize_t items = AvFILLp((AV*)sstr) + 1;
10232 src_ary = AvARRAY((AV*)sstr);
10233 Newxz(dst_ary, AvMAX((AV*)sstr)+1, SV*);
10234 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10235 SvPV_set(dstr, (char*)dst_ary);
10236 AvALLOC((AV*)dstr) = dst_ary;
10237 if (AvREAL((AV*)sstr)) {
10238 while (items-- > 0)
10239 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10242 while (items-- > 0)
10243 *dst_ary++ = sv_dup(*src_ary++, param);
10245 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10246 while (items-- > 0) {
10247 *dst_ary++ = &PL_sv_undef;
10251 SvPV_set(dstr, Nullch);
10252 AvALLOC((AV*)dstr) = (SV**)NULL;
10259 if (HvARRAY((HV*)sstr)) {
10261 const bool sharekeys = !!HvSHAREKEYS(sstr);
10262 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10263 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10265 Newx(darray, PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10266 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
10268 HvARRAY(dstr) = (HE**)darray;
10269 while (i <= sxhv->xhv_max) {
10270 const HE *source = HvARRAY(sstr)[i];
10271 HvARRAY(dstr)[i] = source
10272 ? he_dup(source, sharekeys, param) : 0;
10276 struct xpvhv_aux *saux = HvAUX(sstr);
10277 struct xpvhv_aux *daux = HvAUX(dstr);
10278 /* This flag isn't copied. */
10279 /* SvOOK_on(hv) attacks the IV flags. */
10280 SvFLAGS(dstr) |= SVf_OOK;
10282 hvname = saux->xhv_name;
10284 = hvname ? hek_dup(hvname, param) : hvname;
10286 daux->xhv_riter = saux->xhv_riter;
10287 daux->xhv_eiter = saux->xhv_eiter
10288 ? he_dup(saux->xhv_eiter,
10289 (bool)!!HvSHAREKEYS(sstr), param) : 0;
10293 SvPV_set(dstr, Nullch);
10295 /* Record stashes for possible cloning in Perl_clone(). */
10297 av_push(param->stashes, dstr);
10302 /* NOTE: not refcounted */
10303 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
10305 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
10307 if (CvCONST(dstr)) {
10308 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
10309 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
10310 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
10312 /* don't dup if copying back - CvGV isn't refcounted, so the
10313 * duped GV may never be freed. A bit of a hack! DAPM */
10314 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10315 Nullgv : gv_dup(CvGV(dstr), param) ;
10316 if (!(param->flags & CLONEf_COPY_STACKS)) {
10319 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10321 CvWEAKOUTSIDE(sstr)
10322 ? cv_dup( CvOUTSIDE(dstr), param)
10323 : cv_dup_inc(CvOUTSIDE(dstr), param);
10325 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
10331 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10337 /* duplicate a context */
10340 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10342 PERL_CONTEXT *ncxs;
10345 return (PERL_CONTEXT*)NULL;
10347 /* look for it in the table first */
10348 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10352 /* create anew and remember what it is */
10353 Newxz(ncxs, max + 1, PERL_CONTEXT);
10354 ptr_table_store(PL_ptr_table, cxs, ncxs);
10357 PERL_CONTEXT *cx = &cxs[ix];
10358 PERL_CONTEXT *ncx = &ncxs[ix];
10359 ncx->cx_type = cx->cx_type;
10360 if (CxTYPE(cx) == CXt_SUBST) {
10361 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10364 ncx->blk_oldsp = cx->blk_oldsp;
10365 ncx->blk_oldcop = cx->blk_oldcop;
10366 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10367 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10368 ncx->blk_oldpm = cx->blk_oldpm;
10369 ncx->blk_gimme = cx->blk_gimme;
10370 switch (CxTYPE(cx)) {
10372 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10373 ? cv_dup_inc(cx->blk_sub.cv, param)
10374 : cv_dup(cx->blk_sub.cv,param));
10375 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10376 ? av_dup_inc(cx->blk_sub.argarray, param)
10378 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10379 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10380 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10381 ncx->blk_sub.lval = cx->blk_sub.lval;
10382 ncx->blk_sub.retop = cx->blk_sub.retop;
10385 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10386 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10387 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10388 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10389 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10390 ncx->blk_eval.retop = cx->blk_eval.retop;
10393 ncx->blk_loop.label = cx->blk_loop.label;
10394 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10395 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10396 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10397 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10398 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10399 ? cx->blk_loop.iterdata
10400 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10401 ncx->blk_loop.oldcomppad
10402 = (PAD*)ptr_table_fetch(PL_ptr_table,
10403 cx->blk_loop.oldcomppad);
10404 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10405 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10406 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10407 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10408 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10411 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10412 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10413 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10414 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10415 ncx->blk_sub.retop = cx->blk_sub.retop;
10427 /* duplicate a stack info structure */
10430 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10435 return (PERL_SI*)NULL;
10437 /* look for it in the table first */
10438 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10442 /* create anew and remember what it is */
10443 Newxz(nsi, 1, PERL_SI);
10444 ptr_table_store(PL_ptr_table, si, nsi);
10446 nsi->si_stack = av_dup_inc(si->si_stack, param);
10447 nsi->si_cxix = si->si_cxix;
10448 nsi->si_cxmax = si->si_cxmax;
10449 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10450 nsi->si_type = si->si_type;
10451 nsi->si_prev = si_dup(si->si_prev, param);
10452 nsi->si_next = si_dup(si->si_next, param);
10453 nsi->si_markoff = si->si_markoff;
10458 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10459 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10460 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10461 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10462 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10463 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10464 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10465 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10466 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10467 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10468 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10469 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10470 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10471 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10474 #define pv_dup_inc(p) SAVEPV(p)
10475 #define pv_dup(p) SAVEPV(p)
10476 #define svp_dup_inc(p,pp) any_dup(p,pp)
10478 /* map any object to the new equivent - either something in the
10479 * ptr table, or something in the interpreter structure
10483 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
10488 return (void*)NULL;
10490 /* look for it in the table first */
10491 ret = ptr_table_fetch(PL_ptr_table, v);
10495 /* see if it is part of the interpreter structure */
10496 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10497 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10505 /* duplicate the save stack */
10508 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10510 ANY * const ss = proto_perl->Tsavestack;
10511 const I32 max = proto_perl->Tsavestack_max;
10512 I32 ix = proto_perl->Tsavestack_ix;
10524 void (*dptr) (void*);
10525 void (*dxptr) (pTHX_ void*);
10527 Newxz(nss, max, ANY);
10530 I32 i = POPINT(ss,ix);
10531 TOPINT(nss,ix) = i;
10533 case SAVEt_ITEM: /* normal string */
10534 sv = (SV*)POPPTR(ss,ix);
10535 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10536 sv = (SV*)POPPTR(ss,ix);
10537 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10539 case SAVEt_SV: /* scalar reference */
10540 sv = (SV*)POPPTR(ss,ix);
10541 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10542 gv = (GV*)POPPTR(ss,ix);
10543 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10545 case SAVEt_GENERIC_PVREF: /* generic char* */
10546 c = (char*)POPPTR(ss,ix);
10547 TOPPTR(nss,ix) = pv_dup(c);
10548 ptr = POPPTR(ss,ix);
10549 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10551 case SAVEt_SHARED_PVREF: /* char* in shared space */
10552 c = (char*)POPPTR(ss,ix);
10553 TOPPTR(nss,ix) = savesharedpv(c);
10554 ptr = POPPTR(ss,ix);
10555 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10557 case SAVEt_GENERIC_SVREF: /* generic sv */
10558 case SAVEt_SVREF: /* scalar reference */
10559 sv = (SV*)POPPTR(ss,ix);
10560 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10561 ptr = POPPTR(ss,ix);
10562 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10564 case SAVEt_AV: /* array reference */
10565 av = (AV*)POPPTR(ss,ix);
10566 TOPPTR(nss,ix) = av_dup_inc(av, param);
10567 gv = (GV*)POPPTR(ss,ix);
10568 TOPPTR(nss,ix) = gv_dup(gv, param);
10570 case SAVEt_HV: /* hash reference */
10571 hv = (HV*)POPPTR(ss,ix);
10572 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10573 gv = (GV*)POPPTR(ss,ix);
10574 TOPPTR(nss,ix) = gv_dup(gv, param);
10576 case SAVEt_INT: /* int reference */
10577 ptr = POPPTR(ss,ix);
10578 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10579 intval = (int)POPINT(ss,ix);
10580 TOPINT(nss,ix) = intval;
10582 case SAVEt_LONG: /* long reference */
10583 ptr = POPPTR(ss,ix);
10584 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10585 longval = (long)POPLONG(ss,ix);
10586 TOPLONG(nss,ix) = longval;
10588 case SAVEt_I32: /* I32 reference */
10589 case SAVEt_I16: /* I16 reference */
10590 case SAVEt_I8: /* I8 reference */
10591 ptr = POPPTR(ss,ix);
10592 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10594 TOPINT(nss,ix) = i;
10596 case SAVEt_IV: /* IV reference */
10597 ptr = POPPTR(ss,ix);
10598 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10600 TOPIV(nss,ix) = iv;
10602 case SAVEt_SPTR: /* SV* reference */
10603 ptr = POPPTR(ss,ix);
10604 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10605 sv = (SV*)POPPTR(ss,ix);
10606 TOPPTR(nss,ix) = sv_dup(sv, param);
10608 case SAVEt_VPTR: /* random* reference */
10609 ptr = POPPTR(ss,ix);
10610 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10611 ptr = POPPTR(ss,ix);
10612 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10614 case SAVEt_PPTR: /* char* reference */
10615 ptr = POPPTR(ss,ix);
10616 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10617 c = (char*)POPPTR(ss,ix);
10618 TOPPTR(nss,ix) = pv_dup(c);
10620 case SAVEt_HPTR: /* HV* reference */
10621 ptr = POPPTR(ss,ix);
10622 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10623 hv = (HV*)POPPTR(ss,ix);
10624 TOPPTR(nss,ix) = hv_dup(hv, param);
10626 case SAVEt_APTR: /* AV* reference */
10627 ptr = POPPTR(ss,ix);
10628 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10629 av = (AV*)POPPTR(ss,ix);
10630 TOPPTR(nss,ix) = av_dup(av, param);
10633 gv = (GV*)POPPTR(ss,ix);
10634 TOPPTR(nss,ix) = gv_dup(gv, param);
10636 case SAVEt_GP: /* scalar reference */
10637 gp = (GP*)POPPTR(ss,ix);
10638 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10639 (void)GpREFCNT_inc(gp);
10640 gv = (GV*)POPPTR(ss,ix);
10641 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10642 c = (char*)POPPTR(ss,ix);
10643 TOPPTR(nss,ix) = pv_dup(c);
10645 TOPIV(nss,ix) = iv;
10647 TOPIV(nss,ix) = iv;
10650 case SAVEt_MORTALIZESV:
10651 sv = (SV*)POPPTR(ss,ix);
10652 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10655 ptr = POPPTR(ss,ix);
10656 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10657 /* these are assumed to be refcounted properly */
10659 switch (((OP*)ptr)->op_type) {
10661 case OP_LEAVESUBLV:
10665 case OP_LEAVEWRITE:
10666 TOPPTR(nss,ix) = ptr;
10671 TOPPTR(nss,ix) = Nullop;
10676 TOPPTR(nss,ix) = Nullop;
10679 c = (char*)POPPTR(ss,ix);
10680 TOPPTR(nss,ix) = pv_dup_inc(c);
10682 case SAVEt_CLEARSV:
10683 longval = POPLONG(ss,ix);
10684 TOPLONG(nss,ix) = longval;
10687 hv = (HV*)POPPTR(ss,ix);
10688 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10689 c = (char*)POPPTR(ss,ix);
10690 TOPPTR(nss,ix) = pv_dup_inc(c);
10692 TOPINT(nss,ix) = i;
10694 case SAVEt_DESTRUCTOR:
10695 ptr = POPPTR(ss,ix);
10696 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10697 dptr = POPDPTR(ss,ix);
10698 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
10699 any_dup(FPTR2DPTR(void *, dptr),
10702 case SAVEt_DESTRUCTOR_X:
10703 ptr = POPPTR(ss,ix);
10704 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10705 dxptr = POPDXPTR(ss,ix);
10706 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
10707 any_dup(FPTR2DPTR(void *, dxptr),
10710 case SAVEt_REGCONTEXT:
10713 TOPINT(nss,ix) = i;
10716 case SAVEt_STACK_POS: /* Position on Perl stack */
10718 TOPINT(nss,ix) = i;
10720 case SAVEt_AELEM: /* array element */
10721 sv = (SV*)POPPTR(ss,ix);
10722 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10724 TOPINT(nss,ix) = i;
10725 av = (AV*)POPPTR(ss,ix);
10726 TOPPTR(nss,ix) = av_dup_inc(av, param);
10728 case SAVEt_HELEM: /* hash element */
10729 sv = (SV*)POPPTR(ss,ix);
10730 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10731 sv = (SV*)POPPTR(ss,ix);
10732 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10733 hv = (HV*)POPPTR(ss,ix);
10734 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10737 ptr = POPPTR(ss,ix);
10738 TOPPTR(nss,ix) = ptr;
10742 TOPINT(nss,ix) = i;
10744 case SAVEt_COMPPAD:
10745 av = (AV*)POPPTR(ss,ix);
10746 TOPPTR(nss,ix) = av_dup(av, param);
10749 longval = (long)POPLONG(ss,ix);
10750 TOPLONG(nss,ix) = longval;
10751 ptr = POPPTR(ss,ix);
10752 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10753 sv = (SV*)POPPTR(ss,ix);
10754 TOPPTR(nss,ix) = sv_dup(sv, param);
10757 ptr = POPPTR(ss,ix);
10758 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10759 longval = (long)POPBOOL(ss,ix);
10760 TOPBOOL(nss,ix) = (bool)longval;
10762 case SAVEt_SET_SVFLAGS:
10764 TOPINT(nss,ix) = i;
10766 TOPINT(nss,ix) = i;
10767 sv = (SV*)POPPTR(ss,ix);
10768 TOPPTR(nss,ix) = sv_dup(sv, param);
10771 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10779 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
10780 * flag to the result. This is done for each stash before cloning starts,
10781 * so we know which stashes want their objects cloned */
10784 do_mark_cloneable_stash(pTHX_ SV *sv)
10786 const HEK * const hvname = HvNAME_HEK((HV*)sv);
10788 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
10789 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
10790 if (cloner && GvCV(cloner)) {
10797 XPUSHs(sv_2mortal(newSVhek(hvname)));
10799 call_sv((SV*)GvCV(cloner), G_SCALAR);
10806 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
10814 =for apidoc perl_clone
10816 Create and return a new interpreter by cloning the current one.
10818 perl_clone takes these flags as parameters:
10820 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10821 without it we only clone the data and zero the stacks,
10822 with it we copy the stacks and the new perl interpreter is
10823 ready to run at the exact same point as the previous one.
10824 The pseudo-fork code uses COPY_STACKS while the
10825 threads->new doesn't.
10827 CLONEf_KEEP_PTR_TABLE
10828 perl_clone keeps a ptr_table with the pointer of the old
10829 variable as a key and the new variable as a value,
10830 this allows it to check if something has been cloned and not
10831 clone it again but rather just use the value and increase the
10832 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10833 the ptr_table using the function
10834 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10835 reason to keep it around is if you want to dup some of your own
10836 variable who are outside the graph perl scans, example of this
10837 code is in threads.xs create
10840 This is a win32 thing, it is ignored on unix, it tells perls
10841 win32host code (which is c++) to clone itself, this is needed on
10842 win32 if you want to run two threads at the same time,
10843 if you just want to do some stuff in a separate perl interpreter
10844 and then throw it away and return to the original one,
10845 you don't need to do anything.
10850 /* XXX the above needs expanding by someone who actually understands it ! */
10851 EXTERN_C PerlInterpreter *
10852 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10855 perl_clone(PerlInterpreter *proto_perl, UV flags)
10858 #ifdef PERL_IMPLICIT_SYS
10860 /* perlhost.h so we need to call into it
10861 to clone the host, CPerlHost should have a c interface, sky */
10863 if (flags & CLONEf_CLONE_HOST) {
10864 return perl_clone_host(proto_perl,flags);
10866 return perl_clone_using(proto_perl, flags,
10868 proto_perl->IMemShared,
10869 proto_perl->IMemParse,
10871 proto_perl->IStdIO,
10875 proto_perl->IProc);
10879 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10880 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10881 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10882 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10883 struct IPerlDir* ipD, struct IPerlSock* ipS,
10884 struct IPerlProc* ipP)
10886 /* XXX many of the string copies here can be optimized if they're
10887 * constants; they need to be allocated as common memory and just
10888 * their pointers copied. */
10891 CLONE_PARAMS clone_params;
10892 CLONE_PARAMS* param = &clone_params;
10894 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10895 /* for each stash, determine whether its objects should be cloned */
10896 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10897 PERL_SET_THX(my_perl);
10900 Poison(my_perl, 1, PerlInterpreter);
10902 PL_curcop = (COP *)Nullop;
10906 PL_savestack_ix = 0;
10907 PL_savestack_max = -1;
10908 PL_sig_pending = 0;
10909 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10910 # else /* !DEBUGGING */
10911 Zero(my_perl, 1, PerlInterpreter);
10912 # endif /* DEBUGGING */
10914 /* host pointers */
10916 PL_MemShared = ipMS;
10917 PL_MemParse = ipMP;
10924 #else /* !PERL_IMPLICIT_SYS */
10926 CLONE_PARAMS clone_params;
10927 CLONE_PARAMS* param = &clone_params;
10928 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10929 /* for each stash, determine whether its objects should be cloned */
10930 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10931 PERL_SET_THX(my_perl);
10934 Poison(my_perl, 1, PerlInterpreter);
10936 PL_curcop = (COP *)Nullop;
10940 PL_savestack_ix = 0;
10941 PL_savestack_max = -1;
10942 PL_sig_pending = 0;
10943 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10944 # else /* !DEBUGGING */
10945 Zero(my_perl, 1, PerlInterpreter);
10946 # endif /* DEBUGGING */
10947 #endif /* PERL_IMPLICIT_SYS */
10948 param->flags = flags;
10949 param->proto_perl = proto_perl;
10951 Zero(&PL_body_arenaroots, 1, PL_body_arenaroots);
10952 Zero(&PL_body_roots, 1, PL_body_roots);
10954 PL_he_arenaroot = NULL;
10957 PL_nice_chunk = NULL;
10958 PL_nice_chunk_size = 0;
10960 PL_sv_objcount = 0;
10961 PL_sv_root = Nullsv;
10962 PL_sv_arenaroot = Nullsv;
10964 PL_debug = proto_perl->Idebug;
10966 PL_hash_seed = proto_perl->Ihash_seed;
10967 PL_rehash_seed = proto_perl->Irehash_seed;
10969 #ifdef USE_REENTRANT_API
10970 /* XXX: things like -Dm will segfault here in perlio, but doing
10971 * PERL_SET_CONTEXT(proto_perl);
10972 * breaks too many other things
10974 Perl_reentrant_init(aTHX);
10977 /* create SV map for pointer relocation */
10978 PL_ptr_table = ptr_table_new();
10980 /* initialize these special pointers as early as possible */
10981 SvANY(&PL_sv_undef) = NULL;
10982 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10983 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10984 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10986 SvANY(&PL_sv_no) = new_XPVNV();
10987 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10988 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
10989 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10990 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
10991 SvCUR_set(&PL_sv_no, 0);
10992 SvLEN_set(&PL_sv_no, 1);
10993 SvIV_set(&PL_sv_no, 0);
10994 SvNV_set(&PL_sv_no, 0);
10995 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10997 SvANY(&PL_sv_yes) = new_XPVNV();
10998 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10999 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11000 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11001 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11002 SvCUR_set(&PL_sv_yes, 1);
11003 SvLEN_set(&PL_sv_yes, 2);
11004 SvIV_set(&PL_sv_yes, 1);
11005 SvNV_set(&PL_sv_yes, 1);
11006 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11008 /* create (a non-shared!) shared string table */
11009 PL_strtab = newHV();
11010 HvSHAREKEYS_off(PL_strtab);
11011 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11012 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11014 PL_compiling = proto_perl->Icompiling;
11016 /* These two PVs will be free'd special way so must set them same way op.c does */
11017 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11018 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11020 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11021 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11023 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11024 if (!specialWARN(PL_compiling.cop_warnings))
11025 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11026 if (!specialCopIO(PL_compiling.cop_io))
11027 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11028 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11030 /* pseudo environmental stuff */
11031 PL_origargc = proto_perl->Iorigargc;
11032 PL_origargv = proto_perl->Iorigargv;
11034 param->stashes = newAV(); /* Setup array of objects to call clone on */
11036 /* Set tainting stuff before PerlIO_debug can possibly get called */
11037 PL_tainting = proto_perl->Itainting;
11038 PL_taint_warn = proto_perl->Itaint_warn;
11040 #ifdef PERLIO_LAYERS
11041 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11042 PerlIO_clone(aTHX_ proto_perl, param);
11045 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11046 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11047 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11048 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11049 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11050 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11053 PL_minus_c = proto_perl->Iminus_c;
11054 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11055 PL_localpatches = proto_perl->Ilocalpatches;
11056 PL_splitstr = proto_perl->Isplitstr;
11057 PL_preprocess = proto_perl->Ipreprocess;
11058 PL_minus_n = proto_perl->Iminus_n;
11059 PL_minus_p = proto_perl->Iminus_p;
11060 PL_minus_l = proto_perl->Iminus_l;
11061 PL_minus_a = proto_perl->Iminus_a;
11062 PL_minus_F = proto_perl->Iminus_F;
11063 PL_doswitches = proto_perl->Idoswitches;
11064 PL_dowarn = proto_perl->Idowarn;
11065 PL_doextract = proto_perl->Idoextract;
11066 PL_sawampersand = proto_perl->Isawampersand;
11067 PL_unsafe = proto_perl->Iunsafe;
11068 PL_inplace = SAVEPV(proto_perl->Iinplace);
11069 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11070 PL_perldb = proto_perl->Iperldb;
11071 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11072 PL_exit_flags = proto_perl->Iexit_flags;
11074 /* magical thingies */
11075 /* XXX time(&PL_basetime) when asked for? */
11076 PL_basetime = proto_perl->Ibasetime;
11077 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11079 PL_maxsysfd = proto_perl->Imaxsysfd;
11080 PL_multiline = proto_perl->Imultiline;
11081 PL_statusvalue = proto_perl->Istatusvalue;
11083 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11085 PL_statusvalue_posix = proto_perl->Istatusvalue_posix;
11087 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11089 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11090 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11091 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11093 /* Clone the regex array */
11094 PL_regex_padav = newAV();
11096 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11097 SV** const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11099 av_push(PL_regex_padav,
11100 sv_dup_inc(regexen[0],param));
11101 for(i = 1; i <= len; i++) {
11102 if(SvREPADTMP(regexen[i])) {
11103 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11105 av_push(PL_regex_padav,
11107 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11108 SvIVX(regexen[i])), param)))
11113 PL_regex_pad = AvARRAY(PL_regex_padav);
11115 /* shortcuts to various I/O objects */
11116 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11117 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11118 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11119 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11120 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11121 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11123 /* shortcuts to regexp stuff */
11124 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11126 /* shortcuts to misc objects */
11127 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11129 /* shortcuts to debugging objects */
11130 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11131 PL_DBline = gv_dup(proto_perl->IDBline, param);
11132 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11133 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11134 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11135 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11136 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11137 PL_lineary = av_dup(proto_perl->Ilineary, param);
11138 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11140 /* symbol tables */
11141 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11142 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11143 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11144 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11145 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11147 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11148 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11149 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11150 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11151 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11152 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11154 PL_sub_generation = proto_perl->Isub_generation;
11156 /* funky return mechanisms */
11157 PL_forkprocess = proto_perl->Iforkprocess;
11159 /* subprocess state */
11160 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11162 /* internal state */
11163 PL_maxo = proto_perl->Imaxo;
11164 if (proto_perl->Iop_mask)
11165 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11167 PL_op_mask = Nullch;
11168 /* PL_asserting = proto_perl->Iasserting; */
11170 /* current interpreter roots */
11171 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11172 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11173 PL_main_start = proto_perl->Imain_start;
11174 PL_eval_root = proto_perl->Ieval_root;
11175 PL_eval_start = proto_perl->Ieval_start;
11177 /* runtime control stuff */
11178 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11179 PL_copline = proto_perl->Icopline;
11181 PL_filemode = proto_perl->Ifilemode;
11182 PL_lastfd = proto_perl->Ilastfd;
11183 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11186 PL_gensym = proto_perl->Igensym;
11187 PL_preambled = proto_perl->Ipreambled;
11188 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11189 PL_laststatval = proto_perl->Ilaststatval;
11190 PL_laststype = proto_perl->Ilaststype;
11191 PL_mess_sv = Nullsv;
11193 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11195 /* interpreter atexit processing */
11196 PL_exitlistlen = proto_perl->Iexitlistlen;
11197 if (PL_exitlistlen) {
11198 Newx(PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11199 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11202 PL_exitlist = (PerlExitListEntry*)NULL;
11203 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11204 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11205 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11207 PL_profiledata = NULL;
11208 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11209 /* PL_rsfp_filters entries have fake IoDIRP() */
11210 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11212 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11214 PAD_CLONE_VARS(proto_perl, param);
11216 #ifdef HAVE_INTERP_INTERN
11217 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11220 /* more statics moved here */
11221 PL_generation = proto_perl->Igeneration;
11222 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11224 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11225 PL_in_clean_all = proto_perl->Iin_clean_all;
11227 PL_uid = proto_perl->Iuid;
11228 PL_euid = proto_perl->Ieuid;
11229 PL_gid = proto_perl->Igid;
11230 PL_egid = proto_perl->Iegid;
11231 PL_nomemok = proto_perl->Inomemok;
11232 PL_an = proto_perl->Ian;
11233 PL_evalseq = proto_perl->Ievalseq;
11234 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11235 PL_origalen = proto_perl->Iorigalen;
11236 #ifdef PERL_USES_PL_PIDSTATUS
11237 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11239 PL_osname = SAVEPV(proto_perl->Iosname);
11240 PL_sighandlerp = proto_perl->Isighandlerp;
11242 PL_runops = proto_perl->Irunops;
11244 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11247 PL_cshlen = proto_perl->Icshlen;
11248 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11251 PL_lex_state = proto_perl->Ilex_state;
11252 PL_lex_defer = proto_perl->Ilex_defer;
11253 PL_lex_expect = proto_perl->Ilex_expect;
11254 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11255 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11256 PL_lex_starts = proto_perl->Ilex_starts;
11257 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11258 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11259 PL_lex_op = proto_perl->Ilex_op;
11260 PL_lex_inpat = proto_perl->Ilex_inpat;
11261 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11262 PL_lex_brackets = proto_perl->Ilex_brackets;
11263 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11264 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11265 PL_lex_casemods = proto_perl->Ilex_casemods;
11266 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11267 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11269 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11270 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11271 PL_nexttoke = proto_perl->Inexttoke;
11273 /* XXX This is probably masking the deeper issue of why
11274 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11275 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11276 * (A little debugging with a watchpoint on it may help.)
11278 if (SvANY(proto_perl->Ilinestr)) {
11279 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11280 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11281 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11282 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11283 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11284 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11285 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11286 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11287 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11290 PL_linestr = NEWSV(65,79);
11291 sv_upgrade(PL_linestr,SVt_PVIV);
11292 sv_setpvn(PL_linestr,"",0);
11293 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11295 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11296 PL_pending_ident = proto_perl->Ipending_ident;
11297 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11299 PL_expect = proto_perl->Iexpect;
11301 PL_multi_start = proto_perl->Imulti_start;
11302 PL_multi_end = proto_perl->Imulti_end;
11303 PL_multi_open = proto_perl->Imulti_open;
11304 PL_multi_close = proto_perl->Imulti_close;
11306 PL_error_count = proto_perl->Ierror_count;
11307 PL_subline = proto_perl->Isubline;
11308 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11310 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11311 if (SvANY(proto_perl->Ilinestr)) {
11312 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11313 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11314 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11315 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11316 PL_last_lop_op = proto_perl->Ilast_lop_op;
11319 PL_last_uni = SvPVX(PL_linestr);
11320 PL_last_lop = SvPVX(PL_linestr);
11321 PL_last_lop_op = 0;
11323 PL_in_my = proto_perl->Iin_my;
11324 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11326 PL_cryptseen = proto_perl->Icryptseen;
11329 PL_hints = proto_perl->Ihints;
11331 PL_amagic_generation = proto_perl->Iamagic_generation;
11333 #ifdef USE_LOCALE_COLLATE
11334 PL_collation_ix = proto_perl->Icollation_ix;
11335 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11336 PL_collation_standard = proto_perl->Icollation_standard;
11337 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11338 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11339 #endif /* USE_LOCALE_COLLATE */
11341 #ifdef USE_LOCALE_NUMERIC
11342 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11343 PL_numeric_standard = proto_perl->Inumeric_standard;
11344 PL_numeric_local = proto_perl->Inumeric_local;
11345 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11346 #endif /* !USE_LOCALE_NUMERIC */
11348 /* utf8 character classes */
11349 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11350 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11351 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11352 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11353 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11354 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11355 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11356 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11357 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11358 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11359 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11360 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11361 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11362 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11363 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11364 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11365 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11366 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11367 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11368 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11370 /* Did the locale setup indicate UTF-8? */
11371 PL_utf8locale = proto_perl->Iutf8locale;
11372 /* Unicode features (see perlrun/-C) */
11373 PL_unicode = proto_perl->Iunicode;
11375 /* Pre-5.8 signals control */
11376 PL_signals = proto_perl->Isignals;
11378 /* times() ticks per second */
11379 PL_clocktick = proto_perl->Iclocktick;
11381 /* Recursion stopper for PerlIO_find_layer */
11382 PL_in_load_module = proto_perl->Iin_load_module;
11384 /* sort() routine */
11385 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11387 /* Not really needed/useful since the reenrant_retint is "volatile",
11388 * but do it for consistency's sake. */
11389 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11391 /* Hooks to shared SVs and locks. */
11392 PL_sharehook = proto_perl->Isharehook;
11393 PL_lockhook = proto_perl->Ilockhook;
11394 PL_unlockhook = proto_perl->Iunlockhook;
11395 PL_threadhook = proto_perl->Ithreadhook;
11397 PL_runops_std = proto_perl->Irunops_std;
11398 PL_runops_dbg = proto_perl->Irunops_dbg;
11400 #ifdef THREADS_HAVE_PIDS
11401 PL_ppid = proto_perl->Ippid;
11405 PL_last_swash_hv = Nullhv; /* reinits on demand */
11406 PL_last_swash_klen = 0;
11407 PL_last_swash_key[0]= '\0';
11408 PL_last_swash_tmps = (U8*)NULL;
11409 PL_last_swash_slen = 0;
11411 PL_glob_index = proto_perl->Iglob_index;
11412 PL_srand_called = proto_perl->Isrand_called;
11413 PL_uudmap['M'] = 0; /* reinits on demand */
11414 PL_bitcount = Nullch; /* reinits on demand */
11416 if (proto_perl->Ipsig_pend) {
11417 Newxz(PL_psig_pend, SIG_SIZE, int);
11420 PL_psig_pend = (int*)NULL;
11423 if (proto_perl->Ipsig_ptr) {
11424 Newxz(PL_psig_ptr, SIG_SIZE, SV*);
11425 Newxz(PL_psig_name, SIG_SIZE, SV*);
11426 for (i = 1; i < SIG_SIZE; i++) {
11427 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11428 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11432 PL_psig_ptr = (SV**)NULL;
11433 PL_psig_name = (SV**)NULL;
11436 /* thrdvar.h stuff */
11438 if (flags & CLONEf_COPY_STACKS) {
11439 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11440 PL_tmps_ix = proto_perl->Ttmps_ix;
11441 PL_tmps_max = proto_perl->Ttmps_max;
11442 PL_tmps_floor = proto_perl->Ttmps_floor;
11443 Newxz(PL_tmps_stack, PL_tmps_max, SV*);
11445 while (i <= PL_tmps_ix) {
11446 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11450 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11451 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11452 Newxz(PL_markstack, i, I32);
11453 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11454 - proto_perl->Tmarkstack);
11455 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11456 - proto_perl->Tmarkstack);
11457 Copy(proto_perl->Tmarkstack, PL_markstack,
11458 PL_markstack_ptr - PL_markstack + 1, I32);
11460 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11461 * NOTE: unlike the others! */
11462 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11463 PL_scopestack_max = proto_perl->Tscopestack_max;
11464 Newxz(PL_scopestack, PL_scopestack_max, I32);
11465 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11467 /* NOTE: si_dup() looks at PL_markstack */
11468 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11470 /* PL_curstack = PL_curstackinfo->si_stack; */
11471 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11472 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11474 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11475 PL_stack_base = AvARRAY(PL_curstack);
11476 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11477 - proto_perl->Tstack_base);
11478 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11480 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11481 * NOTE: unlike the others! */
11482 PL_savestack_ix = proto_perl->Tsavestack_ix;
11483 PL_savestack_max = proto_perl->Tsavestack_max;
11484 /*Newxz(PL_savestack, PL_savestack_max, ANY);*/
11485 PL_savestack = ss_dup(proto_perl, param);
11489 ENTER; /* perl_destruct() wants to LEAVE; */
11492 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11493 PL_top_env = &PL_start_env;
11495 PL_op = proto_perl->Top;
11498 PL_Xpv = (XPV*)NULL;
11499 PL_na = proto_perl->Tna;
11501 PL_statbuf = proto_perl->Tstatbuf;
11502 PL_statcache = proto_perl->Tstatcache;
11503 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11504 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11506 PL_timesbuf = proto_perl->Ttimesbuf;
11509 PL_tainted = proto_perl->Ttainted;
11510 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11511 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11512 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11513 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11514 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11515 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11516 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11517 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11518 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11520 PL_restartop = proto_perl->Trestartop;
11521 PL_in_eval = proto_perl->Tin_eval;
11522 PL_delaymagic = proto_perl->Tdelaymagic;
11523 PL_dirty = proto_perl->Tdirty;
11524 PL_localizing = proto_perl->Tlocalizing;
11526 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11527 PL_hv_fetch_ent_mh = Nullhe;
11528 PL_modcount = proto_perl->Tmodcount;
11529 PL_lastgotoprobe = Nullop;
11530 PL_dumpindent = proto_perl->Tdumpindent;
11532 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11533 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11534 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11535 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11536 PL_efloatbuf = Nullch; /* reinits on demand */
11537 PL_efloatsize = 0; /* reinits on demand */
11541 PL_screamfirst = NULL;
11542 PL_screamnext = NULL;
11543 PL_maxscream = -1; /* reinits on demand */
11544 PL_lastscream = Nullsv;
11546 PL_watchaddr = NULL;
11547 PL_watchok = Nullch;
11549 PL_regdummy = proto_perl->Tregdummy;
11550 PL_regprecomp = Nullch;
11553 PL_colorset = 0; /* reinits PL_colors[] */
11554 /*PL_colors[6] = {0,0,0,0,0,0};*/
11555 PL_reginput = Nullch;
11556 PL_regbol = Nullch;
11557 PL_regeol = Nullch;
11558 PL_regstartp = (I32*)NULL;
11559 PL_regendp = (I32*)NULL;
11560 PL_reglastparen = (U32*)NULL;
11561 PL_reglastcloseparen = (U32*)NULL;
11562 PL_regtill = Nullch;
11563 PL_reg_start_tmp = (char**)NULL;
11564 PL_reg_start_tmpl = 0;
11565 PL_regdata = (struct reg_data*)NULL;
11568 PL_reg_eval_set = 0;
11570 PL_regprogram = (regnode*)NULL;
11572 PL_regcc = (CURCUR*)NULL;
11573 PL_reg_call_cc = (struct re_cc_state*)NULL;
11574 PL_reg_re = (regexp*)NULL;
11575 PL_reg_ganch = Nullch;
11576 PL_reg_sv = Nullsv;
11577 PL_reg_match_utf8 = FALSE;
11578 PL_reg_magic = (MAGIC*)NULL;
11580 PL_reg_oldcurpm = (PMOP*)NULL;
11581 PL_reg_curpm = (PMOP*)NULL;
11582 PL_reg_oldsaved = Nullch;
11583 PL_reg_oldsavedlen = 0;
11584 #ifdef PERL_OLD_COPY_ON_WRITE
11587 PL_reg_maxiter = 0;
11588 PL_reg_leftiter = 0;
11589 PL_reg_poscache = Nullch;
11590 PL_reg_poscache_size= 0;
11592 /* RE engine - function pointers */
11593 PL_regcompp = proto_perl->Tregcompp;
11594 PL_regexecp = proto_perl->Tregexecp;
11595 PL_regint_start = proto_perl->Tregint_start;
11596 PL_regint_string = proto_perl->Tregint_string;
11597 PL_regfree = proto_perl->Tregfree;
11599 PL_reginterp_cnt = 0;
11600 PL_reg_starttry = 0;
11602 /* Pluggable optimizer */
11603 PL_peepp = proto_perl->Tpeepp;
11605 PL_stashcache = newHV();
11607 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11608 ptr_table_free(PL_ptr_table);
11609 PL_ptr_table = NULL;
11612 /* Call the ->CLONE method, if it exists, for each of the stashes
11613 identified by sv_dup() above.
11615 while(av_len(param->stashes) != -1) {
11616 HV* const stash = (HV*) av_shift(param->stashes);
11617 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11618 if (cloner && GvCV(cloner)) {
11623 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
11625 call_sv((SV*)GvCV(cloner), G_DISCARD);
11631 SvREFCNT_dec(param->stashes);
11633 /* orphaned? eg threads->new inside BEGIN or use */
11634 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
11635 (void)SvREFCNT_inc(PL_compcv);
11636 SAVEFREESV(PL_compcv);
11642 #endif /* USE_ITHREADS */
11645 =head1 Unicode Support
11647 =for apidoc sv_recode_to_utf8
11649 The encoding is assumed to be an Encode object, on entry the PV
11650 of the sv is assumed to be octets in that encoding, and the sv
11651 will be converted into Unicode (and UTF-8).
11653 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11654 is not a reference, nothing is done to the sv. If the encoding is not
11655 an C<Encode::XS> Encoding object, bad things will happen.
11656 (See F<lib/encoding.pm> and L<Encode>).
11658 The PV of the sv is returned.
11663 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11666 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11680 Passing sv_yes is wrong - it needs to be or'ed set of constants
11681 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11682 remove converted chars from source.
11684 Both will default the value - let them.
11686 XPUSHs(&PL_sv_yes);
11689 call_method("decode", G_SCALAR);
11693 s = SvPV_const(uni, len);
11694 if (s != SvPVX_const(sv)) {
11695 SvGROW(sv, len + 1);
11696 Move(s, SvPVX(sv), len + 1, char);
11697 SvCUR_set(sv, len);
11704 return SvPOKp(sv) ? SvPVX(sv) : NULL;
11708 =for apidoc sv_cat_decode
11710 The encoding is assumed to be an Encode object, the PV of the ssv is
11711 assumed to be octets in that encoding and decoding the input starts
11712 from the position which (PV + *offset) pointed to. The dsv will be
11713 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11714 when the string tstr appears in decoding output or the input ends on
11715 the PV of the ssv. The value which the offset points will be modified
11716 to the last input position on the ssv.
11718 Returns TRUE if the terminator was found, else returns FALSE.
11723 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11724 SV *ssv, int *offset, char *tstr, int tlen)
11728 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11739 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11740 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11742 call_method("cat_decode", G_SCALAR);
11744 ret = SvTRUE(TOPs);
11745 *offset = SvIV(offsv);
11751 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
11757 * c-indentation-style: bsd
11758 * c-basic-offset: 4
11759 * indent-tabs-mode: t
11762 * ex: set ts=8 sts=4 sw=4 noet: