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 Normally, this allocation is done using arenas, which by default are
67 approximately 4K chunks of memory parcelled up into N heads or bodies. The
68 first slot in each arena is reserved, and is used to hold a link to the next
69 arena. In the case of heads, the unused first slot also contains some flags
70 and a note of the number of slots. Snaked through each arena chain is a
71 linked list of free items; when this becomes empty, an extra arena is
72 allocated and divided up into N items which are threaded into the free list.
74 The following global variables are associated with arenas:
76 PL_sv_arenaroot pointer to list of SV arenas
77 PL_sv_root pointer to list of free SV structures
79 PL_foo_arenaroot pointer to list of foo arenas,
80 PL_foo_root pointer to list of free foo bodies
81 ... for foo in xiv, xnv, xrv, xpv etc.
83 Note that some of the larger and more rarely used body types (eg xpvio)
84 are not allocated using arenas, but are instead just malloc()/free()ed as
85 required. Also, if PURIFY is defined, arenas are abandoned altogether,
86 with all items individually malloc()ed. In addition, a few SV heads are
87 not allocated from an arena, but are instead directly created as static
88 or auto variables, eg PL_sv_undef. The size of arenas can be changed from
89 the default by setting PERL_ARENA_SIZE appropriately at compile time.
91 The SV arena serves the secondary purpose of allowing still-live SVs
92 to be located and destroyed during final cleanup.
94 At the lowest level, the macros new_SV() and del_SV() grab and free
95 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
96 to return the SV to the free list with error checking.) new_SV() calls
97 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
98 SVs in the free list have their SvTYPE field set to all ones.
100 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
101 that allocate and return individual body types. Normally these are mapped
102 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
103 instead mapped directly to malloc()/free() if PURIFY is defined. The
104 new/del functions remove from, or add to, the appropriate PL_foo_root
105 list, and call more_xiv() etc to add a new arena if the list is empty.
107 At the time of very final cleanup, sv_free_arenas() is called from
108 perl_destruct() to physically free all the arenas allocated since the
109 start of the interpreter. Note that this also clears PL_he_arenaroot,
110 which is otherwise dealt with in hv.c.
112 Manipulation of any of the PL_*root pointers is protected by enclosing
113 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
114 if threads are enabled.
116 The function visit() scans the SV arenas list, and calls a specified
117 function for each SV it finds which is still live - ie which has an SvTYPE
118 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
119 following functions (specified as [function that calls visit()] / [function
120 called by visit() for each SV]):
122 sv_report_used() / do_report_used()
123 dump all remaining SVs (debugging aid)
125 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
126 Attempt to free all objects pointed to by RVs,
127 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
128 try to do the same for all objects indirectly
129 referenced by typeglobs too. Called once from
130 perl_destruct(), prior to calling sv_clean_all()
133 sv_clean_all() / do_clean_all()
134 SvREFCNT_dec(sv) each remaining SV, possibly
135 triggering an sv_free(). It also sets the
136 SVf_BREAK flag on the SV to indicate that the
137 refcnt has been artificially lowered, and thus
138 stopping sv_free() from giving spurious warnings
139 about SVs which unexpectedly have a refcnt
140 of zero. called repeatedly from perl_destruct()
141 until there are no SVs left.
145 Private API to rest of sv.c
149 new_XIV(), del_XIV(),
150 new_XNV(), del_XNV(),
155 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
160 ============================================================================ */
165 * "A time to plant, and a time to uproot what was planted..."
169 * nice_chunk and nice_chunk size need to be set
170 * and queried under the protection of sv_mutex
173 Perl_offer_nice_chunk(pTHX_ void *chunk, U32 chunk_size)
178 new_chunk = (void *)(chunk);
179 new_chunk_size = (chunk_size);
180 if (new_chunk_size > PL_nice_chunk_size) {
181 Safefree(PL_nice_chunk);
182 PL_nice_chunk = (char *) new_chunk;
183 PL_nice_chunk_size = new_chunk_size;
190 #ifdef DEBUG_LEAKING_SCALARS
191 # define FREE_SV_DEBUG_FILE(sv) Safefree((sv)->sv_debug_file)
193 # define FREE_SV_DEBUG_FILE(sv)
196 #define plant_SV(p) \
198 FREE_SV_DEBUG_FILE(p); \
199 SvANY(p) = (void *)PL_sv_root; \
200 SvFLAGS(p) = SVTYPEMASK; \
205 /* sv_mutex must be held while calling uproot_SV() */
206 #define uproot_SV(p) \
209 PL_sv_root = (SV*)SvANY(p); \
214 /* make some more SVs by adding another arena */
216 /* sv_mutex must be held while calling more_sv() */
223 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
224 PL_nice_chunk = Nullch;
225 PL_nice_chunk_size = 0;
228 char *chunk; /* must use New here to match call to */
229 Newx(chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
230 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
236 /* new_SV(): return a new, empty SV head */
238 #ifdef DEBUG_LEAKING_SCALARS
239 /* provide a real function for a debugger to play with */
249 sv = S_more_sv(aTHX);
254 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
255 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
256 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
257 sv->sv_debug_inpad = 0;
258 sv->sv_debug_cloned = 0;
259 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
263 # define new_SV(p) (p)=S_new_SV(aTHX)
272 (p) = S_more_sv(aTHX); \
281 /* del_SV(): return an empty SV head to the free list */
296 S_del_sv(pTHX_ SV *p)
301 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
302 const SV * const sv = sva + 1;
303 const SV * const svend = &sva[SvREFCNT(sva)];
304 if (p >= sv && p < svend) {
310 if (ckWARN_d(WARN_INTERNAL))
311 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
312 "Attempt to free non-arena SV: 0x%"UVxf
313 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
320 #else /* ! DEBUGGING */
322 #define del_SV(p) plant_SV(p)
324 #endif /* DEBUGGING */
328 =head1 SV Manipulation Functions
330 =for apidoc sv_add_arena
332 Given a chunk of memory, link it to the head of the list of arenas,
333 and split it into a list of free SVs.
339 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
345 /* The first SV in an arena isn't an SV. */
346 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
347 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
348 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
350 PL_sv_arenaroot = sva;
351 PL_sv_root = sva + 1;
353 svend = &sva[SvREFCNT(sva) - 1];
356 SvANY(sv) = (void *)(SV*)(sv + 1);
360 /* Must always set typemask because it's awlays checked in on cleanup
361 when the arenas are walked looking for objects. */
362 SvFLAGS(sv) = SVTYPEMASK;
369 SvFLAGS(sv) = SVTYPEMASK;
372 /* visit(): call the named function for each non-free SV in the arenas
373 * whose flags field matches the flags/mask args. */
376 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
381 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
382 register const SV * const svend = &sva[SvREFCNT(sva)];
384 for (sv = sva + 1; sv < svend; ++sv) {
385 if (SvTYPE(sv) != SVTYPEMASK
386 && (sv->sv_flags & mask) == flags
399 /* called by sv_report_used() for each live SV */
402 do_report_used(pTHX_ SV *sv)
404 if (SvTYPE(sv) != SVTYPEMASK) {
405 PerlIO_printf(Perl_debug_log, "****\n");
412 =for apidoc sv_report_used
414 Dump the contents of all SVs not yet freed. (Debugging aid).
420 Perl_sv_report_used(pTHX)
423 visit(do_report_used, 0, 0);
427 /* called by sv_clean_objs() for each live SV */
430 do_clean_objs(pTHX_ SV *ref)
433 SV * const target = SvRV(ref);
434 if (SvOBJECT(target)) {
435 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(ref)));
436 if (SvWEAKREF(ref)) {
437 sv_del_backref(target, ref);
443 SvREFCNT_dec(target);
448 /* XXX Might want to check arrays, etc. */
451 /* called by sv_clean_objs() for each live SV */
453 #ifndef DISABLE_DESTRUCTOR_KLUDGE
455 do_clean_named_objs(pTHX_ SV *sv)
457 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
459 #ifdef PERL_DONT_CREATE_GVSV
462 SvOBJECT(GvSV(sv))) ||
463 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
464 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
465 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
466 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
468 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
469 SvFLAGS(sv) |= SVf_BREAK;
477 =for apidoc sv_clean_objs
479 Attempt to destroy all objects not yet freed
485 Perl_sv_clean_objs(pTHX)
487 PL_in_clean_objs = TRUE;
488 visit(do_clean_objs, SVf_ROK, SVf_ROK);
489 #ifndef DISABLE_DESTRUCTOR_KLUDGE
490 /* some barnacles may yet remain, clinging to typeglobs */
491 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
493 PL_in_clean_objs = FALSE;
496 /* called by sv_clean_all() for each live SV */
499 do_clean_all(pTHX_ SV *sv)
501 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
502 SvFLAGS(sv) |= SVf_BREAK;
503 if (PL_comppad == (AV*)sv) {
505 PL_curpad = Null(SV**);
511 =for apidoc sv_clean_all
513 Decrement the refcnt of each remaining SV, possibly triggering a
514 cleanup. This function may have to be called multiple times to free
515 SVs which are in complex self-referential hierarchies.
521 Perl_sv_clean_all(pTHX)
524 PL_in_clean_all = TRUE;
525 cleaned = visit(do_clean_all, 0,0);
526 PL_in_clean_all = FALSE;
531 S_free_arena(pTHX_ void **root) {
533 void ** const next = *(void **)root;
540 =for apidoc sv_free_arenas
542 Deallocate the memory used by all arenas. Note that all the individual SV
543 heads and bodies within the arenas must already have been freed.
548 #define free_arena(name) \
550 S_free_arena(aTHX_ (void**) PL_ ## name ## _arenaroot); \
551 PL_ ## name ## _arenaroot = 0; \
552 PL_ ## name ## _root = 0; \
556 Perl_sv_free_arenas(pTHX)
561 /* Free arenas here, but be careful about fake ones. (We assume
562 contiguity of the fake ones with the corresponding real ones.) */
564 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
565 svanext = (SV*) SvANY(sva);
566 while (svanext && SvFAKE(svanext))
567 svanext = (SV*) SvANY(svanext);
585 #if defined(USE_ITHREADS)
589 Safefree(PL_nice_chunk);
590 PL_nice_chunk = Nullch;
591 PL_nice_chunk_size = 0;
596 /* ---------------------------------------------------------------------
598 * support functions for report_uninit()
601 /* the maxiumum size of array or hash where we will scan looking
602 * for the undefined element that triggered the warning */
604 #define FUV_MAX_SEARCH_SIZE 1000
606 /* Look for an entry in the hash whose value has the same SV as val;
607 * If so, return a mortal copy of the key. */
610 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
616 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
617 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
622 for (i=HvMAX(hv); i>0; i--) {
624 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
625 if (HeVAL(entry) != val)
627 if ( HeVAL(entry) == &PL_sv_undef ||
628 HeVAL(entry) == &PL_sv_placeholder)
632 if (HeKLEN(entry) == HEf_SVKEY)
633 return sv_mortalcopy(HeKEY_sv(entry));
634 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
640 /* Look for an entry in the array whose value has the same SV as val;
641 * If so, return the index, otherwise return -1. */
644 S_find_array_subscript(pTHX_ AV *av, SV* val)
648 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
649 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
653 for (i=AvFILLp(av); i>=0; i--) {
654 if (svp[i] == val && svp[i] != &PL_sv_undef)
660 /* S_varname(): return the name of a variable, optionally with a subscript.
661 * If gv is non-zero, use the name of that global, along with gvtype (one
662 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
663 * targ. Depending on the value of the subscript_type flag, return:
666 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
667 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
668 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
669 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
672 S_varname(pTHX_ GV *gv, const char gvtype, PADOFFSET targ,
673 SV* keyname, I32 aindex, int subscript_type)
676 SV * const name = sv_newmortal();
682 /* as gv_fullname4(), but add literal '^' for $^FOO names */
684 gv_fullname4(name, gv, buffer, 0);
686 if ((unsigned int)SvPVX(name)[1] <= 26) {
688 buffer[1] = SvPVX(name)[1] + 'A' - 1;
690 /* Swap the 1 unprintable control character for the 2 byte pretty
691 version - ie substr($name, 1, 1) = $buffer; */
692 sv_insert(name, 1, 1, buffer, 2);
697 CV * const cv = find_runcv(&unused);
701 if (!cv || !CvPADLIST(cv))
703 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
704 sv = *av_fetch(av, targ, FALSE);
705 /* SvLEN in a pad name is not to be trusted */
706 sv_setpv(name, SvPV_nolen_const(sv));
709 if (subscript_type == FUV_SUBSCRIPT_HASH) {
710 SV * const sv = NEWSV(0,0);
712 Perl_sv_catpvf(aTHX_ name, "{%s}",
713 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
716 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
718 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
720 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
721 sv_insert(name, 0, 0, "within ", 7);
728 =for apidoc find_uninit_var
730 Find the name of the undefined variable (if any) that caused the operator o
731 to issue a "Use of uninitialized value" warning.
732 If match is true, only return a name if it's value matches uninit_sv.
733 So roughly speaking, if a unary operator (such as OP_COS) generates a
734 warning, then following the direct child of the op may yield an
735 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
736 other hand, with OP_ADD there are two branches to follow, so we only print
737 the variable name if we get an exact match.
739 The name is returned as a mortal SV.
741 Assumes that PL_op is the op that originally triggered the error, and that
742 PL_comppad/PL_curpad points to the currently executing pad.
748 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
756 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
757 uninit_sv == &PL_sv_placeholder)))
760 switch (obase->op_type) {
767 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
768 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
771 int subscript_type = FUV_SUBSCRIPT_WITHIN;
773 if (pad) { /* @lex, %lex */
774 sv = PAD_SVl(obase->op_targ);
778 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
779 /* @global, %global */
780 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
783 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
785 else /* @{expr}, %{expr} */
786 return find_uninit_var(cUNOPx(obase)->op_first,
790 /* attempt to find a match within the aggregate */
792 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
794 subscript_type = FUV_SUBSCRIPT_HASH;
797 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
799 subscript_type = FUV_SUBSCRIPT_ARRAY;
802 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
805 return varname(gv, hash ? '%' : '@', obase->op_targ,
806 keysv, index, subscript_type);
810 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
812 return varname(Nullgv, '$', obase->op_targ,
813 Nullsv, 0, FUV_SUBSCRIPT_NONE);
816 gv = cGVOPx_gv(obase);
817 if (!gv || (match && GvSV(gv) != uninit_sv))
819 return varname(gv, '$', 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
822 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
825 av = (AV*)PAD_SV(obase->op_targ);
826 if (!av || SvRMAGICAL(av))
828 svp = av_fetch(av, (I32)obase->op_private, FALSE);
829 if (!svp || *svp != uninit_sv)
832 return varname(Nullgv, '$', obase->op_targ,
833 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
836 gv = cGVOPx_gv(obase);
842 if (!av || SvRMAGICAL(av))
844 svp = av_fetch(av, (I32)obase->op_private, FALSE);
845 if (!svp || *svp != uninit_sv)
848 return varname(gv, '$', 0,
849 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
854 o = cUNOPx(obase)->op_first;
855 if (!o || o->op_type != OP_NULL ||
856 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
858 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
863 /* $a[uninit_expr] or $h{uninit_expr} */
864 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
867 o = cBINOPx(obase)->op_first;
868 kid = cBINOPx(obase)->op_last;
870 /* get the av or hv, and optionally the gv */
872 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
873 sv = PAD_SV(o->op_targ);
875 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
876 && cUNOPo->op_first->op_type == OP_GV)
878 gv = cGVOPx_gv(cUNOPo->op_first);
881 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
886 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
887 /* index is constant */
891 if (obase->op_type == OP_HELEM) {
892 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
893 if (!he || HeVAL(he) != uninit_sv)
897 SV ** const svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
898 if (!svp || *svp != uninit_sv)
902 if (obase->op_type == OP_HELEM)
903 return varname(gv, '%', o->op_targ,
904 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
906 return varname(gv, '@', o->op_targ, Nullsv,
907 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
911 /* index is an expression;
912 * attempt to find a match within the aggregate */
913 if (obase->op_type == OP_HELEM) {
914 SV * const keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
916 return varname(gv, '%', o->op_targ,
917 keysv, 0, FUV_SUBSCRIPT_HASH);
920 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
922 return varname(gv, '@', o->op_targ,
923 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
928 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
930 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
936 /* only examine RHS */
937 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
940 o = cUNOPx(obase)->op_first;
941 if (o->op_type == OP_PUSHMARK)
944 if (!o->op_sibling) {
945 /* one-arg version of open is highly magical */
947 if (o->op_type == OP_GV) { /* open FOO; */
949 if (match && GvSV(gv) != uninit_sv)
951 return varname(gv, '$', 0,
952 Nullsv, 0, FUV_SUBSCRIPT_NONE);
954 /* other possibilities not handled are:
955 * open $x; or open my $x; should return '${*$x}'
956 * open expr; should return '$'.expr ideally
962 /* ops where $_ may be an implicit arg */
966 if ( !(obase->op_flags & OPf_STACKED)) {
967 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
968 ? PAD_SVl(obase->op_targ)
972 sv_setpvn(sv, "$_", 2);
980 /* skip filehandle as it can't produce 'undef' warning */
981 o = cUNOPx(obase)->op_first;
982 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
983 o = o->op_sibling->op_sibling;
990 match = 1; /* XS or custom code could trigger random warnings */
995 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
996 return sv_2mortal(newSVpvn("${$/}", 5));
1001 if (!(obase->op_flags & OPf_KIDS))
1003 o = cUNOPx(obase)->op_first;
1009 /* if all except one arg are constant, or have no side-effects,
1010 * or are optimized away, then it's unambiguous */
1012 for (kid=o; kid; kid = kid->op_sibling) {
1014 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1015 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1016 || (kid->op_type == OP_PUSHMARK)
1020 if (o2) { /* more than one found */
1027 return find_uninit_var(o2, uninit_sv, match);
1031 sv = find_uninit_var(o, uninit_sv, 1);
1043 =for apidoc report_uninit
1045 Print appropriate "Use of uninitialized variable" warning
1051 Perl_report_uninit(pTHX_ SV* uninit_sv)
1054 SV* varname = Nullsv;
1056 varname = find_uninit_var(PL_op, uninit_sv,0);
1058 sv_insert(varname, 0, 0, " ", 1);
1060 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1061 varname ? SvPV_nolen_const(varname) : "",
1062 " in ", OP_DESC(PL_op));
1065 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1070 S_more_bodies (pTHX_ void **arena_root, void **root, size_t size)
1074 const size_t count = PERL_ARENA_SIZE/size;
1075 Newx(start, count*size, char);
1076 *((void **) start) = *arena_root;
1077 *arena_root = (void *)start;
1079 end = start + (count-1) * size;
1081 /* The initial slot is used to link the arenas together, so it isn't to be
1082 linked into the list of ready-to-use bodies. */
1086 *root = (void *)start;
1088 while (start < end) {
1089 char * const next = start + size;
1090 *(void**) start = (void *)next;
1093 *(void **)start = 0;
1098 /* grab a new thing from the free list, allocating more if necessary */
1100 /* 1st, the inline version */
1102 #define new_body_inline(xpv, arena_root, root, size) \
1105 xpv = *((void **)(root)) \
1106 ? *((void **)(root)) : S_more_bodies(aTHX_ arena_root, root, size); \
1107 *(root) = *(void**)(xpv); \
1111 /* now use the inline version in the proper function */
1114 S_new_body(pTHX_ void **arena_root, void **root, size_t size)
1117 new_body_inline(xpv, arena_root, root, size);
1121 /* return a thing to the free list */
1123 #define del_body(thing, root) \
1125 void **thing_copy = (void **)thing; \
1127 *thing_copy = *root; \
1128 *root = (void*)thing_copy; \
1132 /* Conventionally we simply malloc() a big block of memory, then divide it
1133 up into lots of the thing that we're allocating.
1135 This macro will expand to call to S_new_body. So for XPVBM (with ithreads),
1138 S_new_body(my_perl, (void**)&(my_perl->Ixpvbm_arenaroot),
1139 (void**)&(my_perl->Ixpvbm_root), sizeof(XPVBM), 0)
1142 #define new_body_type(TYPE,lctype) \
1143 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1144 (void**)&PL_ ## lctype ## _root, \
1147 #define del_body_type(p,TYPE,lctype) \
1148 del_body((void*)p, (void**)&PL_ ## lctype ## _root)
1150 /* But for some types, we cheat. The type starts with some members that are
1151 never accessed. So we allocate the substructure, starting at the first used
1152 member, then adjust the pointer back in memory by the size of the bit not
1153 allocated, so it's as if we allocated the full structure.
1154 (But things will all go boom if you write to the part that is "not there",
1155 because you'll be overwriting the last members of the preceding structure
1158 We calculate the correction using the STRUCT_OFFSET macro. For example, if
1159 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
1160 and the pointer is unchanged. If the allocated structure is smaller (no
1161 initial NV actually allocated) then the net effect is to subtract the size
1162 of the NV from the pointer, to return a new pointer as if an initial NV were
1165 This is the same trick as was used for NV and IV bodies. Ironically it
1166 doesn't need to be used for NV bodies any more, because NV is now at the
1167 start of the structure. IV bodies don't need it either, because they are
1168 no longer allocated. */
1170 #define new_body_allocated(TYPE,lctype,member) \
1171 (void*)((char*)S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1172 (void**)&PL_ ## lctype ## _root, \
1173 sizeof(lctype ## _allocated)) - \
1174 STRUCT_OFFSET(TYPE, member) \
1175 + STRUCT_OFFSET(lctype ## _allocated, member))
1178 #define del_body_allocated(p,TYPE,lctype,member) \
1179 del_body((void*)((char*)p + STRUCT_OFFSET(TYPE, member) \
1180 - STRUCT_OFFSET(lctype ## _allocated, member)), \
1181 (void**)&PL_ ## lctype ## _root)
1183 #define my_safemalloc(s) (void*)safemalloc(s)
1184 #define my_safefree(p) safefree((char*)p)
1188 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1189 #define del_XNV(p) my_safefree(p)
1191 #define new_XPV() my_safemalloc(sizeof(XPV))
1192 #define del_XPV(p) my_safefree(p)
1194 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1195 #define del_XPVIV(p) my_safefree(p)
1197 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1198 #define del_XPVNV(p) my_safefree(p)
1200 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1201 #define del_XPVCV(p) my_safefree(p)
1203 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1204 #define del_XPVAV(p) my_safefree(p)
1206 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1207 #define del_XPVHV(p) my_safefree(p)
1209 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1210 #define del_XPVMG(p) my_safefree(p)
1212 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1213 #define del_XPVGV(p) my_safefree(p)
1215 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1216 #define del_XPVLV(p) my_safefree(p)
1218 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1219 #define del_XPVBM(p) my_safefree(p)
1223 #define new_XNV() new_body_type(NV, xnv)
1224 #define del_XNV(p) del_body_type(p, NV, xnv)
1226 #define new_XPV() new_body_allocated(XPV, xpv, xpv_cur)
1227 #define del_XPV(p) del_body_allocated(p, XPV, xpv, xpv_cur)
1229 #define new_XPVIV() new_body_allocated(XPVIV, xpviv, xpv_cur)
1230 #define del_XPVIV(p) del_body_allocated(p, XPVIV, xpviv, xpv_cur)
1232 #define new_XPVNV() new_body_type(XPVNV, xpvnv)
1233 #define del_XPVNV(p) del_body_type(p, XPVNV, xpvnv)
1235 #define new_XPVCV() new_body_type(XPVCV, xpvcv)
1236 #define del_XPVCV(p) del_body_type(p, XPVCV, xpvcv)
1238 #define new_XPVAV() new_body_allocated(XPVAV, xpvav, xav_fill)
1239 #define del_XPVAV(p) del_body_allocated(p, XPVAV, xpvav, xav_fill)
1241 #define new_XPVHV() new_body_allocated(XPVHV, xpvhv, xhv_fill)
1242 #define del_XPVHV(p) del_body_allocated(p, XPVHV, xpvhv, xhv_fill)
1244 #define new_XPVMG() new_body_type(XPVMG, xpvmg)
1245 #define del_XPVMG(p) del_body_type(p, XPVMG, xpvmg)
1247 #define new_XPVGV() new_body_type(XPVGV, xpvgv)
1248 #define del_XPVGV(p) del_body_type(p, XPVGV, xpvgv)
1250 #define new_XPVLV() new_body_type(XPVLV, xpvlv)
1251 #define del_XPVLV(p) del_body_type(p, XPVLV, xpvlv)
1253 #define new_XPVBM() new_body_type(XPVBM, xpvbm)
1254 #define del_XPVBM(p) del_body_type(p, XPVBM, xpvbm)
1258 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1259 #define del_XPVFM(p) my_safefree(p)
1261 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1262 #define del_XPVIO(p) my_safefree(p)
1265 =for apidoc sv_upgrade
1267 Upgrade an SV to a more complex form. Generally adds a new body type to the
1268 SV, then copies across as much information as possible from the old body.
1269 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1275 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1277 void** old_body_arena;
1278 size_t old_body_offset;
1279 size_t old_body_length; /* Well, the length to copy. */
1281 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1282 /* If NV 0.0 is store as all bits 0 then Zero() already creates a correct
1284 bool zero_nv = TRUE;
1287 size_t new_body_length;
1288 size_t new_body_offset;
1289 void** new_body_arena;
1290 void** new_body_arenaroot;
1291 const U32 old_type = SvTYPE(sv);
1293 if (mt != SVt_PV && SvIsCOW(sv)) {
1294 sv_force_normal_flags(sv, 0);
1297 if (SvTYPE(sv) == mt)
1300 if (SvTYPE(sv) > mt)
1301 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1302 (int)SvTYPE(sv), (int)mt);
1305 old_body = SvANY(sv);
1307 old_body_offset = 0;
1308 old_body_length = 0;
1309 new_body_offset = 0;
1310 new_body_length = ~0;
1312 /* Copying structures onto other structures that have been neatly zeroed
1313 has a subtle gotcha. Consider XPVMG
1315 +------+------+------+------+------+-------+-------+
1316 | NV | CUR | LEN | IV | MAGIC | STASH |
1317 +------+------+------+------+------+-------+-------+
1318 0 4 8 12 16 20 24 28
1320 where NVs are aligned to 8 bytes, so that sizeof that structure is
1321 actually 32 bytes long, with 4 bytes of padding at the end:
1323 +------+------+------+------+------+-------+-------+------+
1324 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1325 +------+------+------+------+------+-------+-------+------+
1326 0 4 8 12 16 20 24 28 32
1328 so what happens if you allocate memory for this structure:
1330 +------+------+------+------+------+-------+-------+------+------+...
1331 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1332 +------+------+------+------+------+-------+-------+------+------+...
1333 0 4 8 12 16 20 24 28 32 36
1335 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1336 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1337 started out as zero once, but it's quite possible that it isn't. So now,
1338 rather than a nicely zeroed GP, you have it pointing somewhere random.
1341 (In fact, GP ends up pointing at a previous GP structure, because the
1342 principle cause of the padding in XPVMG getting garbage is a copy of
1343 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1345 So we are careful and work out the size of used parts of all the
1348 switch (SvTYPE(sv)) {
1354 else if (mt < SVt_PVIV)
1356 old_body_offset = STRUCT_OFFSET(XPVIV, xiv_iv);
1357 old_body_length = sizeof(IV);
1360 old_body_arena = (void **) &PL_xnv_root;
1361 old_body_length = sizeof(NV);
1362 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1371 old_body_arena = (void **) &PL_xpv_root;
1372 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1373 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1374 old_body_length = STRUCT_OFFSET(XPV, xpv_len)
1375 + sizeof (((XPV*)SvANY(sv))->xpv_len)
1379 else if (mt == SVt_NV)
1383 old_body_arena = (void **) &PL_xpviv_root;
1384 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1385 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1386 old_body_length = STRUCT_OFFSET(XPVIV, xiv_u)
1387 + sizeof (((XPVIV*)SvANY(sv))->xiv_u)
1391 old_body_arena = (void **) &PL_xpvnv_root;
1392 old_body_length = STRUCT_OFFSET(XPVNV, xiv_u)
1393 + sizeof (((XPVNV*)SvANY(sv))->xiv_u);
1394 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1399 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1400 there's no way that it can be safely upgraded, because perl.c
1401 expects to Safefree(SvANY(PL_mess_sv)) */
1402 assert(sv != PL_mess_sv);
1403 /* This flag bit is used to mean other things in other scalar types.
1404 Given that it only has meaning inside the pad, it shouldn't be set
1405 on anything that can get upgraded. */
1406 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1407 old_body_arena = (void **) &PL_xpvmg_root;
1408 old_body_length = STRUCT_OFFSET(XPVMG, xmg_stash)
1409 + sizeof (((XPVMG*)SvANY(sv))->xmg_stash);
1410 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1415 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1418 SvFLAGS(sv) &= ~SVTYPEMASK;
1423 Perl_croak(aTHX_ "Can't upgrade to undef");
1425 assert(old_type == SVt_NULL);
1426 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1430 assert(old_type == SVt_NULL);
1431 SvANY(sv) = new_XNV();
1435 assert(old_type == SVt_NULL);
1436 SvANY(sv) = &sv->sv_u.svu_rv;
1440 SvANY(sv) = new_XPVHV();
1443 HvTOTALKEYS(sv) = 0;
1448 SvANY(sv) = new_XPVAV();
1455 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1456 The target created by newSVrv also is, and it can have magic.
1457 However, it never has SvPVX set.
1459 if (old_type >= SVt_RV) {
1460 assert(SvPVX_const(sv) == 0);
1463 /* Could put this in the else clause below, as PVMG must have SvPVX
1464 0 already (the assertion above) */
1465 SvPV_set(sv, (char*)0);
1467 if (old_type >= SVt_PVMG) {
1468 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1469 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1477 new_body = new_XPVIO();
1478 new_body_length = sizeof(XPVIO);
1481 new_body = new_XPVFM();
1482 new_body_length = sizeof(XPVFM);
1486 new_body_length = sizeof(XPVBM);
1487 new_body_arena = (void **) &PL_xpvbm_root;
1488 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
1491 new_body_length = sizeof(XPVGV);
1492 new_body_arena = (void **) &PL_xpvgv_root;
1493 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
1496 new_body_length = sizeof(XPVCV);
1497 new_body_arena = (void **) &PL_xpvcv_root;
1498 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
1501 new_body_length = sizeof(XPVLV);
1502 new_body_arena = (void **) &PL_xpvlv_root;
1503 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
1506 new_body_length = sizeof(XPVMG);
1507 new_body_arena = (void **) &PL_xpvmg_root;
1508 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
1511 new_body_length = sizeof(XPVNV);
1512 new_body_arena = (void **) &PL_xpvnv_root;
1513 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
1516 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1517 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1518 new_body_length = sizeof(XPVIV) - new_body_offset;
1519 new_body_arena = (void **) &PL_xpviv_root;
1520 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
1521 /* XXX Is this still needed? Was it ever needed? Surely as there is
1522 no route from NV to PVIV, NOK can never be true */
1526 goto new_body_no_NV;
1528 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1529 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1530 new_body_length = sizeof(XPV) - new_body_offset;
1531 new_body_arena = (void **) &PL_xpv_root;
1532 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
1534 /* PV and PVIV don't have an NV slot. */
1535 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1540 assert(new_body_length);
1542 /* This points to the start of the allocated area. */
1543 new_body_inline(new_body, new_body_arenaroot, new_body_arena,
1546 /* We always allocated the full length item with PURIFY */
1547 new_body_length += new_body_offset;
1548 new_body_offset = 0;
1549 new_body = my_safemalloc(new_body_length);
1553 Zero(new_body, new_body_length, char);
1554 new_body = ((char *)new_body) - new_body_offset;
1555 SvANY(sv) = new_body;
1557 if (old_body_length) {
1558 Copy((char *)old_body + old_body_offset,
1559 (char *)new_body + old_body_offset,
1560 old_body_length, char);
1563 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1569 IoPAGE_LEN(sv) = 60;
1570 if (old_type < SVt_RV)
1574 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", mt);
1578 if (old_body_arena) {
1580 my_safefree(old_body);
1582 del_body((void*)((char*)old_body + old_body_offset),
1589 =for apidoc sv_backoff
1591 Remove any string offset. You should normally use the C<SvOOK_off> macro
1598 Perl_sv_backoff(pTHX_ register SV *sv)
1601 assert(SvTYPE(sv) != SVt_PVHV);
1602 assert(SvTYPE(sv) != SVt_PVAV);
1604 const char * const s = SvPVX_const(sv);
1605 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1606 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1608 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1610 SvFLAGS(sv) &= ~SVf_OOK;
1617 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1618 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1619 Use the C<SvGROW> wrapper instead.
1625 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1629 #ifdef HAS_64K_LIMIT
1630 if (newlen >= 0x10000) {
1631 PerlIO_printf(Perl_debug_log,
1632 "Allocation too large: %"UVxf"\n", (UV)newlen);
1635 #endif /* HAS_64K_LIMIT */
1638 if (SvTYPE(sv) < SVt_PV) {
1639 sv_upgrade(sv, SVt_PV);
1640 s = SvPVX_mutable(sv);
1642 else if (SvOOK(sv)) { /* pv is offset? */
1644 s = SvPVX_mutable(sv);
1645 if (newlen > SvLEN(sv))
1646 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1647 #ifdef HAS_64K_LIMIT
1648 if (newlen >= 0x10000)
1653 s = SvPVX_mutable(sv);
1655 if (newlen > SvLEN(sv)) { /* need more room? */
1656 newlen = PERL_STRLEN_ROUNDUP(newlen);
1657 if (SvLEN(sv) && s) {
1659 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1665 s = saferealloc(s, newlen);
1668 s = safemalloc(newlen);
1669 if (SvPVX_const(sv) && SvCUR(sv)) {
1670 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1674 SvLEN_set(sv, newlen);
1680 =for apidoc sv_setiv
1682 Copies an integer into the given SV, upgrading first if necessary.
1683 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1689 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1691 SV_CHECK_THINKFIRST_COW_DROP(sv);
1692 switch (SvTYPE(sv)) {
1694 sv_upgrade(sv, SVt_IV);
1697 sv_upgrade(sv, SVt_PVNV);
1701 sv_upgrade(sv, SVt_PVIV);
1710 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1713 (void)SvIOK_only(sv); /* validate number */
1719 =for apidoc sv_setiv_mg
1721 Like C<sv_setiv>, but also handles 'set' magic.
1727 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1734 =for apidoc sv_setuv
1736 Copies an unsigned integer into the given SV, upgrading first if necessary.
1737 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1743 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1745 /* With these two if statements:
1746 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1749 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1751 If you wish to remove them, please benchmark to see what the effect is
1753 if (u <= (UV)IV_MAX) {
1754 sv_setiv(sv, (IV)u);
1763 =for apidoc sv_setuv_mg
1765 Like C<sv_setuv>, but also handles 'set' magic.
1771 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1780 =for apidoc sv_setnv
1782 Copies a double into the given SV, upgrading first if necessary.
1783 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1789 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1791 SV_CHECK_THINKFIRST_COW_DROP(sv);
1792 switch (SvTYPE(sv)) {
1795 sv_upgrade(sv, SVt_NV);
1800 sv_upgrade(sv, SVt_PVNV);
1809 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1813 (void)SvNOK_only(sv); /* validate number */
1818 =for apidoc sv_setnv_mg
1820 Like C<sv_setnv>, but also handles 'set' magic.
1826 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1832 /* Print an "isn't numeric" warning, using a cleaned-up,
1833 * printable version of the offending string
1837 S_not_a_number(pTHX_ SV *sv)
1844 dsv = sv_2mortal(newSVpvn("", 0));
1845 pv = sv_uni_display(dsv, sv, 10, 0);
1848 const char * const limit = tmpbuf + sizeof(tmpbuf) - 8;
1849 /* each *s can expand to 4 chars + "...\0",
1850 i.e. need room for 8 chars */
1852 const char *s, *end;
1853 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1856 if (ch & 128 && !isPRINT_LC(ch)) {
1865 else if (ch == '\r') {
1869 else if (ch == '\f') {
1873 else if (ch == '\\') {
1877 else if (ch == '\0') {
1881 else if (isPRINT_LC(ch))
1898 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1899 "Argument \"%s\" isn't numeric in %s", pv,
1902 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1903 "Argument \"%s\" isn't numeric", pv);
1907 =for apidoc looks_like_number
1909 Test if the content of an SV looks like a number (or is a number).
1910 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1911 non-numeric warning), even if your atof() doesn't grok them.
1917 Perl_looks_like_number(pTHX_ SV *sv)
1919 register const char *sbegin;
1923 sbegin = SvPVX_const(sv);
1926 else if (SvPOKp(sv))
1927 sbegin = SvPV_const(sv, len);
1929 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1930 return grok_number(sbegin, len, NULL);
1933 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1934 until proven guilty, assume that things are not that bad... */
1939 As 64 bit platforms often have an NV that doesn't preserve all bits of
1940 an IV (an assumption perl has been based on to date) it becomes necessary
1941 to remove the assumption that the NV always carries enough precision to
1942 recreate the IV whenever needed, and that the NV is the canonical form.
1943 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1944 precision as a side effect of conversion (which would lead to insanity
1945 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1946 1) to distinguish between IV/UV/NV slots that have cached a valid
1947 conversion where precision was lost and IV/UV/NV slots that have a
1948 valid conversion which has lost no precision
1949 2) to ensure that if a numeric conversion to one form is requested that
1950 would lose precision, the precise conversion (or differently
1951 imprecise conversion) is also performed and cached, to prevent
1952 requests for different numeric formats on the same SV causing
1953 lossy conversion chains. (lossless conversion chains are perfectly
1958 SvIOKp is true if the IV slot contains a valid value
1959 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1960 SvNOKp is true if the NV slot contains a valid value
1961 SvNOK is true only if the NV value is accurate
1964 while converting from PV to NV, check to see if converting that NV to an
1965 IV(or UV) would lose accuracy over a direct conversion from PV to
1966 IV(or UV). If it would, cache both conversions, return NV, but mark
1967 SV as IOK NOKp (ie not NOK).
1969 While converting from PV to IV, check to see if converting that IV to an
1970 NV would lose accuracy over a direct conversion from PV to NV. If it
1971 would, cache both conversions, flag similarly.
1973 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1974 correctly because if IV & NV were set NV *always* overruled.
1975 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1976 changes - now IV and NV together means that the two are interchangeable:
1977 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1979 The benefit of this is that operations such as pp_add know that if
1980 SvIOK is true for both left and right operands, then integer addition
1981 can be used instead of floating point (for cases where the result won't
1982 overflow). Before, floating point was always used, which could lead to
1983 loss of precision compared with integer addition.
1985 * making IV and NV equal status should make maths accurate on 64 bit
1987 * may speed up maths somewhat if pp_add and friends start to use
1988 integers when possible instead of fp. (Hopefully the overhead in
1989 looking for SvIOK and checking for overflow will not outweigh the
1990 fp to integer speedup)
1991 * will slow down integer operations (callers of SvIV) on "inaccurate"
1992 values, as the change from SvIOK to SvIOKp will cause a call into
1993 sv_2iv each time rather than a macro access direct to the IV slot
1994 * should speed up number->string conversion on integers as IV is
1995 favoured when IV and NV are equally accurate
1997 ####################################################################
1998 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1999 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2000 On the other hand, SvUOK is true iff UV.
2001 ####################################################################
2003 Your mileage will vary depending your CPU's relative fp to integer
2007 #ifndef NV_PRESERVES_UV
2008 # define IS_NUMBER_UNDERFLOW_IV 1
2009 # define IS_NUMBER_UNDERFLOW_UV 2
2010 # define IS_NUMBER_IV_AND_UV 2
2011 # define IS_NUMBER_OVERFLOW_IV 4
2012 # define IS_NUMBER_OVERFLOW_UV 5
2014 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2016 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2018 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2020 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));
2021 if (SvNVX(sv) < (NV)IV_MIN) {
2022 (void)SvIOKp_on(sv);
2024 SvIV_set(sv, IV_MIN);
2025 return IS_NUMBER_UNDERFLOW_IV;
2027 if (SvNVX(sv) > (NV)UV_MAX) {
2028 (void)SvIOKp_on(sv);
2031 SvUV_set(sv, UV_MAX);
2032 return IS_NUMBER_OVERFLOW_UV;
2034 (void)SvIOKp_on(sv);
2036 /* Can't use strtol etc to convert this string. (See truth table in
2038 if (SvNVX(sv) <= (UV)IV_MAX) {
2039 SvIV_set(sv, I_V(SvNVX(sv)));
2040 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2041 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2043 /* Integer is imprecise. NOK, IOKp */
2045 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2048 SvUV_set(sv, U_V(SvNVX(sv)));
2049 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2050 if (SvUVX(sv) == UV_MAX) {
2051 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2052 possibly be preserved by NV. Hence, it must be overflow.
2054 return IS_NUMBER_OVERFLOW_UV;
2056 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2058 /* Integer is imprecise. NOK, IOKp */
2060 return IS_NUMBER_OVERFLOW_IV;
2062 #endif /* !NV_PRESERVES_UV*/
2065 =for apidoc sv_2iv_flags
2067 Return the integer value of an SV, doing any necessary string
2068 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2069 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2075 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2079 if (SvGMAGICAL(sv)) {
2080 if (flags & SV_GMAGIC)
2085 return I_V(SvNVX(sv));
2087 if (SvPOKp(sv) && SvLEN(sv))
2090 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2091 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2097 if (SvTHINKFIRST(sv)) {
2100 SV * const tmpstr=AMG_CALLun(sv,numer);
2101 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2102 return SvIV(tmpstr);
2105 return PTR2IV(SvRV(sv));
2108 sv_force_normal_flags(sv, 0);
2110 if (SvREADONLY(sv) && !SvOK(sv)) {
2111 if (ckWARN(WARN_UNINITIALIZED))
2118 return (IV)(SvUVX(sv));
2125 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2126 * without also getting a cached IV/UV from it at the same time
2127 * (ie PV->NV conversion should detect loss of accuracy and cache
2128 * IV or UV at same time to avoid this. NWC */
2130 if (SvTYPE(sv) == SVt_NV)
2131 sv_upgrade(sv, SVt_PVNV);
2133 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2134 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2135 certainly cast into the IV range at IV_MAX, whereas the correct
2136 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2138 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2139 SvIV_set(sv, I_V(SvNVX(sv)));
2140 if (SvNVX(sv) == (NV) SvIVX(sv)
2141 #ifndef NV_PRESERVES_UV
2142 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2143 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2144 /* Don't flag it as "accurately an integer" if the number
2145 came from a (by definition imprecise) NV operation, and
2146 we're outside the range of NV integer precision */
2149 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2150 DEBUG_c(PerlIO_printf(Perl_debug_log,
2151 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2157 /* IV not precise. No need to convert from PV, as NV
2158 conversion would already have cached IV if it detected
2159 that PV->IV would be better than PV->NV->IV
2160 flags already correct - don't set public IOK. */
2161 DEBUG_c(PerlIO_printf(Perl_debug_log,
2162 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2167 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2168 but the cast (NV)IV_MIN rounds to a the value less (more
2169 negative) than IV_MIN which happens to be equal to SvNVX ??
2170 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2171 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2172 (NV)UVX == NVX are both true, but the values differ. :-(
2173 Hopefully for 2s complement IV_MIN is something like
2174 0x8000000000000000 which will be exact. NWC */
2177 SvUV_set(sv, U_V(SvNVX(sv)));
2179 (SvNVX(sv) == (NV) SvUVX(sv))
2180 #ifndef NV_PRESERVES_UV
2181 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2182 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2183 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2184 /* Don't flag it as "accurately an integer" if the number
2185 came from a (by definition imprecise) NV operation, and
2186 we're outside the range of NV integer precision */
2192 DEBUG_c(PerlIO_printf(Perl_debug_log,
2193 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2197 return (IV)SvUVX(sv);
2200 else if (SvPOKp(sv) && SvLEN(sv)) {
2202 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2203 /* We want to avoid a possible problem when we cache an IV which
2204 may be later translated to an NV, and the resulting NV is not
2205 the same as the direct translation of the initial string
2206 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2207 be careful to ensure that the value with the .456 is around if the
2208 NV value is requested in the future).
2210 This means that if we cache such an IV, we need to cache the
2211 NV as well. Moreover, we trade speed for space, and do not
2212 cache the NV if we are sure it's not needed.
2215 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2216 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2217 == IS_NUMBER_IN_UV) {
2218 /* It's definitely an integer, only upgrade to PVIV */
2219 if (SvTYPE(sv) < SVt_PVIV)
2220 sv_upgrade(sv, SVt_PVIV);
2222 } else if (SvTYPE(sv) < SVt_PVNV)
2223 sv_upgrade(sv, SVt_PVNV);
2225 /* If NV preserves UV then we only use the UV value if we know that
2226 we aren't going to call atof() below. If NVs don't preserve UVs
2227 then the value returned may have more precision than atof() will
2228 return, even though value isn't perfectly accurate. */
2229 if ((numtype & (IS_NUMBER_IN_UV
2230 #ifdef NV_PRESERVES_UV
2233 )) == IS_NUMBER_IN_UV) {
2234 /* This won't turn off the public IOK flag if it was set above */
2235 (void)SvIOKp_on(sv);
2237 if (!(numtype & IS_NUMBER_NEG)) {
2239 if (value <= (UV)IV_MAX) {
2240 SvIV_set(sv, (IV)value);
2242 SvUV_set(sv, value);
2246 /* 2s complement assumption */
2247 if (value <= (UV)IV_MIN) {
2248 SvIV_set(sv, -(IV)value);
2250 /* Too negative for an IV. This is a double upgrade, but
2251 I'm assuming it will be rare. */
2252 if (SvTYPE(sv) < SVt_PVNV)
2253 sv_upgrade(sv, SVt_PVNV);
2257 SvNV_set(sv, -(NV)value);
2258 SvIV_set(sv, IV_MIN);
2262 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2263 will be in the previous block to set the IV slot, and the next
2264 block to set the NV slot. So no else here. */
2266 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2267 != IS_NUMBER_IN_UV) {
2268 /* It wasn't an (integer that doesn't overflow the UV). */
2269 SvNV_set(sv, Atof(SvPVX_const(sv)));
2271 if (! numtype && ckWARN(WARN_NUMERIC))
2274 #if defined(USE_LONG_DOUBLE)
2275 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2276 PTR2UV(sv), SvNVX(sv)));
2278 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2279 PTR2UV(sv), SvNVX(sv)));
2283 #ifdef NV_PRESERVES_UV
2284 (void)SvIOKp_on(sv);
2286 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2287 SvIV_set(sv, I_V(SvNVX(sv)));
2288 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2291 /* Integer is imprecise. NOK, IOKp */
2293 /* UV will not work better than IV */
2295 if (SvNVX(sv) > (NV)UV_MAX) {
2297 /* Integer is inaccurate. NOK, IOKp, is UV */
2298 SvUV_set(sv, UV_MAX);
2301 SvUV_set(sv, U_V(SvNVX(sv)));
2302 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2303 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2307 /* Integer is imprecise. NOK, IOKp, is UV */
2313 #else /* NV_PRESERVES_UV */
2314 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2315 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2316 /* The IV slot will have been set from value returned by
2317 grok_number above. The NV slot has just been set using
2320 assert (SvIOKp(sv));
2322 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2323 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2324 /* Small enough to preserve all bits. */
2325 (void)SvIOKp_on(sv);
2327 SvIV_set(sv, I_V(SvNVX(sv)));
2328 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2330 /* Assumption: first non-preserved integer is < IV_MAX,
2331 this NV is in the preserved range, therefore: */
2332 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2334 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);
2338 0 0 already failed to read UV.
2339 0 1 already failed to read UV.
2340 1 0 you won't get here in this case. IV/UV
2341 slot set, public IOK, Atof() unneeded.
2342 1 1 already read UV.
2343 so there's no point in sv_2iuv_non_preserve() attempting
2344 to use atol, strtol, strtoul etc. */
2345 if (sv_2iuv_non_preserve (sv, numtype)
2346 >= IS_NUMBER_OVERFLOW_IV)
2350 #endif /* NV_PRESERVES_UV */
2353 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2355 if (SvTYPE(sv) < SVt_IV)
2356 /* Typically the caller expects that sv_any is not NULL now. */
2357 sv_upgrade(sv, SVt_IV);
2360 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2361 PTR2UV(sv),SvIVX(sv)));
2362 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2366 =for apidoc sv_2uv_flags
2368 Return the unsigned integer value of an SV, doing any necessary string
2369 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2370 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2376 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2380 if (SvGMAGICAL(sv)) {
2381 if (flags & SV_GMAGIC)
2386 return U_V(SvNVX(sv));
2387 if (SvPOKp(sv) && SvLEN(sv))
2390 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2391 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2397 if (SvTHINKFIRST(sv)) {
2400 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2401 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2402 return SvUV(tmpstr);
2403 return PTR2UV(SvRV(sv));
2406 sv_force_normal_flags(sv, 0);
2408 if (SvREADONLY(sv) && !SvOK(sv)) {
2409 if (ckWARN(WARN_UNINITIALIZED))
2419 return (UV)SvIVX(sv);
2423 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2424 * without also getting a cached IV/UV from it at the same time
2425 * (ie PV->NV conversion should detect loss of accuracy and cache
2426 * IV or UV at same time to avoid this. */
2427 /* IV-over-UV optimisation - choose to cache IV if possible */
2429 if (SvTYPE(sv) == SVt_NV)
2430 sv_upgrade(sv, SVt_PVNV);
2432 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2433 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2434 SvIV_set(sv, I_V(SvNVX(sv)));
2435 if (SvNVX(sv) == (NV) SvIVX(sv)
2436 #ifndef NV_PRESERVES_UV
2437 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2438 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2439 /* Don't flag it as "accurately an integer" if the number
2440 came from a (by definition imprecise) NV operation, and
2441 we're outside the range of NV integer precision */
2444 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2445 DEBUG_c(PerlIO_printf(Perl_debug_log,
2446 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2452 /* IV not precise. No need to convert from PV, as NV
2453 conversion would already have cached IV if it detected
2454 that PV->IV would be better than PV->NV->IV
2455 flags already correct - don't set public IOK. */
2456 DEBUG_c(PerlIO_printf(Perl_debug_log,
2457 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2462 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2463 but the cast (NV)IV_MIN rounds to a the value less (more
2464 negative) than IV_MIN which happens to be equal to SvNVX ??
2465 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2466 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2467 (NV)UVX == NVX are both true, but the values differ. :-(
2468 Hopefully for 2s complement IV_MIN is something like
2469 0x8000000000000000 which will be exact. NWC */
2472 SvUV_set(sv, U_V(SvNVX(sv)));
2474 (SvNVX(sv) == (NV) SvUVX(sv))
2475 #ifndef NV_PRESERVES_UV
2476 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2477 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2478 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2479 /* Don't flag it as "accurately an integer" if the number
2480 came from a (by definition imprecise) NV operation, and
2481 we're outside the range of NV integer precision */
2486 DEBUG_c(PerlIO_printf(Perl_debug_log,
2487 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2493 else if (SvPOKp(sv) && SvLEN(sv)) {
2495 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2497 /* We want to avoid a possible problem when we cache a UV which
2498 may be later translated to an NV, and the resulting NV is not
2499 the translation of the initial data.
2501 This means that if we cache such a UV, we need to cache the
2502 NV as well. Moreover, we trade speed for space, and do not
2503 cache the NV if not needed.
2506 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2507 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2508 == IS_NUMBER_IN_UV) {
2509 /* It's definitely an integer, only upgrade to PVIV */
2510 if (SvTYPE(sv) < SVt_PVIV)
2511 sv_upgrade(sv, SVt_PVIV);
2513 } else if (SvTYPE(sv) < SVt_PVNV)
2514 sv_upgrade(sv, SVt_PVNV);
2516 /* If NV preserves UV then we only use the UV value if we know that
2517 we aren't going to call atof() below. If NVs don't preserve UVs
2518 then the value returned may have more precision than atof() will
2519 return, even though it isn't accurate. */
2520 if ((numtype & (IS_NUMBER_IN_UV
2521 #ifdef NV_PRESERVES_UV
2524 )) == IS_NUMBER_IN_UV) {
2525 /* This won't turn off the public IOK flag if it was set above */
2526 (void)SvIOKp_on(sv);
2528 if (!(numtype & IS_NUMBER_NEG)) {
2530 if (value <= (UV)IV_MAX) {
2531 SvIV_set(sv, (IV)value);
2533 /* it didn't overflow, and it was positive. */
2534 SvUV_set(sv, value);
2538 /* 2s complement assumption */
2539 if (value <= (UV)IV_MIN) {
2540 SvIV_set(sv, -(IV)value);
2542 /* Too negative for an IV. This is a double upgrade, but
2543 I'm assuming it will be rare. */
2544 if (SvTYPE(sv) < SVt_PVNV)
2545 sv_upgrade(sv, SVt_PVNV);
2549 SvNV_set(sv, -(NV)value);
2550 SvIV_set(sv, IV_MIN);
2555 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2556 != IS_NUMBER_IN_UV) {
2557 /* It wasn't an integer, or it overflowed the UV. */
2558 SvNV_set(sv, Atof(SvPVX_const(sv)));
2560 if (! numtype && ckWARN(WARN_NUMERIC))
2563 #if defined(USE_LONG_DOUBLE)
2564 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2565 PTR2UV(sv), SvNVX(sv)));
2567 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2568 PTR2UV(sv), SvNVX(sv)));
2571 #ifdef NV_PRESERVES_UV
2572 (void)SvIOKp_on(sv);
2574 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2575 SvIV_set(sv, I_V(SvNVX(sv)));
2576 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2579 /* Integer is imprecise. NOK, IOKp */
2581 /* UV will not work better than IV */
2583 if (SvNVX(sv) > (NV)UV_MAX) {
2585 /* Integer is inaccurate. NOK, IOKp, is UV */
2586 SvUV_set(sv, UV_MAX);
2589 SvUV_set(sv, U_V(SvNVX(sv)));
2590 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2591 NV preservse UV so can do correct comparison. */
2592 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2596 /* Integer is imprecise. NOK, IOKp, is UV */
2601 #else /* NV_PRESERVES_UV */
2602 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2603 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2604 /* The UV slot will have been set from value returned by
2605 grok_number above. The NV slot has just been set using
2608 assert (SvIOKp(sv));
2610 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2611 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2612 /* Small enough to preserve all bits. */
2613 (void)SvIOKp_on(sv);
2615 SvIV_set(sv, I_V(SvNVX(sv)));
2616 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2618 /* Assumption: first non-preserved integer is < IV_MAX,
2619 this NV is in the preserved range, therefore: */
2620 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2622 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);
2625 sv_2iuv_non_preserve (sv, numtype);
2627 #endif /* NV_PRESERVES_UV */
2631 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2632 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2635 if (SvTYPE(sv) < SVt_IV)
2636 /* Typically the caller expects that sv_any is not NULL now. */
2637 sv_upgrade(sv, SVt_IV);
2641 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2642 PTR2UV(sv),SvUVX(sv)));
2643 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2649 Return the num value of an SV, doing any necessary string or integer
2650 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2657 Perl_sv_2nv(pTHX_ register SV *sv)
2661 if (SvGMAGICAL(sv)) {
2665 if (SvPOKp(sv) && SvLEN(sv)) {
2666 if (!SvIOKp(sv) && ckWARN(WARN_NUMERIC) &&
2667 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2669 return Atof(SvPVX_const(sv));
2673 return (NV)SvUVX(sv);
2675 return (NV)SvIVX(sv);
2678 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2679 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2685 if (SvTHINKFIRST(sv)) {
2688 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2689 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2690 return SvNV(tmpstr);
2691 return PTR2NV(SvRV(sv));
2694 sv_force_normal_flags(sv, 0);
2696 if (SvREADONLY(sv) && !SvOK(sv)) {
2697 if (ckWARN(WARN_UNINITIALIZED))
2702 if (SvTYPE(sv) < SVt_NV) {
2703 if (SvTYPE(sv) == SVt_IV)
2704 sv_upgrade(sv, SVt_PVNV);
2706 sv_upgrade(sv, SVt_NV);
2707 #ifdef USE_LONG_DOUBLE
2709 STORE_NUMERIC_LOCAL_SET_STANDARD();
2710 PerlIO_printf(Perl_debug_log,
2711 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2712 PTR2UV(sv), SvNVX(sv));
2713 RESTORE_NUMERIC_LOCAL();
2717 STORE_NUMERIC_LOCAL_SET_STANDARD();
2718 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2719 PTR2UV(sv), SvNVX(sv));
2720 RESTORE_NUMERIC_LOCAL();
2724 else if (SvTYPE(sv) < SVt_PVNV)
2725 sv_upgrade(sv, SVt_PVNV);
2730 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2731 #ifdef NV_PRESERVES_UV
2734 /* Only set the public NV OK flag if this NV preserves the IV */
2735 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2736 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2737 : (SvIVX(sv) == I_V(SvNVX(sv))))
2743 else if (SvPOKp(sv) && SvLEN(sv)) {
2745 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2746 if (!SvIOKp(sv) && !numtype && ckWARN(WARN_NUMERIC))
2748 #ifdef NV_PRESERVES_UV
2749 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2750 == IS_NUMBER_IN_UV) {
2751 /* It's definitely an integer */
2752 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2754 SvNV_set(sv, Atof(SvPVX_const(sv)));
2757 SvNV_set(sv, Atof(SvPVX_const(sv)));
2758 /* Only set the public NV OK flag if this NV preserves the value in
2759 the PV at least as well as an IV/UV would.
2760 Not sure how to do this 100% reliably. */
2761 /* if that shift count is out of range then Configure's test is
2762 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2764 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2765 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2766 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2767 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2768 /* Can't use strtol etc to convert this string, so don't try.
2769 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2772 /* value has been set. It may not be precise. */
2773 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2774 /* 2s complement assumption for (UV)IV_MIN */
2775 SvNOK_on(sv); /* Integer is too negative. */
2780 if (numtype & IS_NUMBER_NEG) {
2781 SvIV_set(sv, -(IV)value);
2782 } else if (value <= (UV)IV_MAX) {
2783 SvIV_set(sv, (IV)value);
2785 SvUV_set(sv, value);
2789 if (numtype & IS_NUMBER_NOT_INT) {
2790 /* I believe that even if the original PV had decimals,
2791 they are lost beyond the limit of the FP precision.
2792 However, neither is canonical, so both only get p
2793 flags. NWC, 2000/11/25 */
2794 /* Both already have p flags, so do nothing */
2796 const NV nv = SvNVX(sv);
2797 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2798 if (SvIVX(sv) == I_V(nv)) {
2803 /* It had no "." so it must be integer. */
2806 /* between IV_MAX and NV(UV_MAX).
2807 Could be slightly > UV_MAX */
2809 if (numtype & IS_NUMBER_NOT_INT) {
2810 /* UV and NV both imprecise. */
2812 const UV nv_as_uv = U_V(nv);
2814 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2825 #endif /* NV_PRESERVES_UV */
2828 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2830 if (SvTYPE(sv) < SVt_NV)
2831 /* Typically the caller expects that sv_any is not NULL now. */
2832 /* XXX Ilya implies that this is a bug in callers that assume this
2833 and ideally should be fixed. */
2834 sv_upgrade(sv, SVt_NV);
2837 #if defined(USE_LONG_DOUBLE)
2839 STORE_NUMERIC_LOCAL_SET_STANDARD();
2840 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2841 PTR2UV(sv), SvNVX(sv));
2842 RESTORE_NUMERIC_LOCAL();
2846 STORE_NUMERIC_LOCAL_SET_STANDARD();
2847 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2848 PTR2UV(sv), SvNVX(sv));
2849 RESTORE_NUMERIC_LOCAL();
2855 /* asIV(): extract an integer from the string value of an SV.
2856 * Caller must validate PVX */
2859 S_asIV(pTHX_ SV *sv)
2862 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2864 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2865 == IS_NUMBER_IN_UV) {
2866 /* It's definitely an integer */
2867 if (numtype & IS_NUMBER_NEG) {
2868 if (value < (UV)IV_MIN)
2871 if (value < (UV)IV_MAX)
2876 if (ckWARN(WARN_NUMERIC))
2879 return I_V(Atof(SvPVX_const(sv)));
2882 /* asUV(): extract an unsigned integer from the string value of an SV
2883 * Caller must validate PVX */
2886 S_asUV(pTHX_ SV *sv)
2889 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2891 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2892 == IS_NUMBER_IN_UV) {
2893 /* It's definitely an integer */
2894 if (!(numtype & IS_NUMBER_NEG))
2898 if (ckWARN(WARN_NUMERIC))
2901 return U_V(Atof(SvPVX_const(sv)));
2904 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2905 * UV as a string towards the end of buf, and return pointers to start and
2908 * We assume that buf is at least TYPE_CHARS(UV) long.
2912 S_uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2914 char *ptr = buf + TYPE_CHARS(UV);
2915 char * const ebuf = ptr;
2928 *--ptr = '0' + (char)(uv % 10);
2937 =for apidoc sv_2pv_flags
2939 Returns a pointer to the string value of an SV, and sets *lp to its length.
2940 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2942 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2943 usually end up here too.
2949 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2954 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2955 char *tmpbuf = tbuf;
2962 if (SvGMAGICAL(sv)) {
2963 if (flags & SV_GMAGIC)
2968 if (flags & SV_MUTABLE_RETURN)
2969 return SvPVX_mutable(sv);
2970 if (flags & SV_CONST_RETURN)
2971 return (char *)SvPVX_const(sv);
2976 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2978 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2983 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2988 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2989 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2997 if (SvTHINKFIRST(sv)) {
3000 register const char *typestr;
3001 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3002 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3004 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3007 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3008 if (flags & SV_CONST_RETURN) {
3009 pv = (char *) SvPVX_const(tmpstr);
3011 pv = (flags & SV_MUTABLE_RETURN)
3012 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3015 *lp = SvCUR(tmpstr);
3017 pv = sv_2pv_flags(tmpstr, lp, flags);
3028 typestr = "NULLREF";
3032 switch (SvTYPE(sv)) {
3034 if ( ((SvFLAGS(sv) &
3035 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3036 == (SVs_OBJECT|SVs_SMG))
3037 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3038 const regexp *re = (regexp *)mg->mg_obj;
3041 const char *fptr = "msix";
3046 char need_newline = 0;
3047 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3049 while((ch = *fptr++)) {
3051 reflags[left++] = ch;
3054 reflags[right--] = ch;
3059 reflags[left] = '-';
3063 mg->mg_len = re->prelen + 4 + left;
3065 * If /x was used, we have to worry about a regex
3066 * ending with a comment later being embedded
3067 * within another regex. If so, we don't want this
3068 * regex's "commentization" to leak out to the
3069 * right part of the enclosing regex, we must cap
3070 * it with a newline.
3072 * So, if /x was used, we scan backwards from the
3073 * end of the regex. If we find a '#' before we
3074 * find a newline, we need to add a newline
3075 * ourself. If we find a '\n' first (or if we
3076 * don't find '#' or '\n'), we don't need to add
3077 * anything. -jfriedl
3079 if (PMf_EXTENDED & re->reganch)
3081 const char *endptr = re->precomp + re->prelen;
3082 while (endptr >= re->precomp)
3084 const char c = *(endptr--);
3086 break; /* don't need another */
3088 /* we end while in a comment, so we
3090 mg->mg_len++; /* save space for it */
3091 need_newline = 1; /* note to add it */
3097 Newx(mg->mg_ptr, mg->mg_len + 1 + left, char);
3098 Copy("(?", mg->mg_ptr, 2, char);
3099 Copy(reflags, mg->mg_ptr+2, left, char);
3100 Copy(":", mg->mg_ptr+left+2, 1, char);
3101 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3103 mg->mg_ptr[mg->mg_len - 2] = '\n';
3104 mg->mg_ptr[mg->mg_len - 1] = ')';
3105 mg->mg_ptr[mg->mg_len] = 0;
3107 PL_reginterp_cnt += re->program[0].next_off;
3109 if (re->reganch & ROPT_UTF8)
3125 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3126 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3127 /* tied lvalues should appear to be
3128 * scalars for backwards compatitbility */
3129 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3130 ? "SCALAR" : "LVALUE"; break;
3131 case SVt_PVAV: typestr = "ARRAY"; break;
3132 case SVt_PVHV: typestr = "HASH"; break;
3133 case SVt_PVCV: typestr = "CODE"; break;
3134 case SVt_PVGV: typestr = "GLOB"; break;
3135 case SVt_PVFM: typestr = "FORMAT"; break;
3136 case SVt_PVIO: typestr = "IO"; break;
3137 default: typestr = "UNKNOWN"; break;
3141 const char *name = HvNAME_get(SvSTASH(sv));
3142 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3143 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3146 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3150 *lp = strlen(typestr);
3151 return (char *)typestr;
3153 if (SvREADONLY(sv) && !SvOK(sv)) {
3154 if (ckWARN(WARN_UNINITIALIZED))
3161 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3162 /* I'm assuming that if both IV and NV are equally valid then
3163 converting the IV is going to be more efficient */
3164 const U32 isIOK = SvIOK(sv);
3165 const U32 isUIOK = SvIsUV(sv);
3166 char buf[TYPE_CHARS(UV)];
3169 if (SvTYPE(sv) < SVt_PVIV)
3170 sv_upgrade(sv, SVt_PVIV);
3172 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3174 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3175 /* inlined from sv_setpvn */
3176 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3177 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3178 SvCUR_set(sv, ebuf - ptr);
3188 else if (SvNOKp(sv)) {
3189 if (SvTYPE(sv) < SVt_PVNV)
3190 sv_upgrade(sv, SVt_PVNV);
3191 /* The +20 is pure guesswork. Configure test needed. --jhi */
3192 s = SvGROW_mutable(sv, NV_DIG + 20);
3193 olderrno = errno; /* some Xenix systems wipe out errno here */
3195 if (SvNVX(sv) == 0.0)
3196 (void)strcpy(s,"0");
3200 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3203 #ifdef FIXNEGATIVEZERO
3204 if (*s == '-' && s[1] == '0' && !s[2])
3214 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
3218 if (SvTYPE(sv) < SVt_PV)
3219 /* Typically the caller expects that sv_any is not NULL now. */
3220 sv_upgrade(sv, SVt_PV);
3224 const STRLEN len = s - SvPVX_const(sv);
3230 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3231 PTR2UV(sv),SvPVX_const(sv)));
3232 if (flags & SV_CONST_RETURN)
3233 return (char *)SvPVX_const(sv);
3234 if (flags & SV_MUTABLE_RETURN)
3235 return SvPVX_mutable(sv);
3239 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3240 /* Sneaky stuff here */
3244 tsv = newSVpv(tmpbuf, 0);
3257 t = SvPVX_const(tsv);
3262 len = strlen(tmpbuf);
3264 #ifdef FIXNEGATIVEZERO
3265 if (len == 2 && t[0] == '-' && t[1] == '0') {
3270 SvUPGRADE(sv, SVt_PV);
3273 s = SvGROW_mutable(sv, len + 1);
3276 return memcpy(s, t, len + 1);
3281 =for apidoc sv_copypv
3283 Copies a stringified representation of the source SV into the
3284 destination SV. Automatically performs any necessary mg_get and
3285 coercion of numeric values into strings. Guaranteed to preserve
3286 UTF-8 flag even from overloaded objects. Similar in nature to
3287 sv_2pv[_flags] but operates directly on an SV instead of just the
3288 string. Mostly uses sv_2pv_flags to do its work, except when that
3289 would lose the UTF-8'ness of the PV.
3295 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3298 const char * const s = SvPV_const(ssv,len);
3299 sv_setpvn(dsv,s,len);
3307 =for apidoc sv_2pvbyte
3309 Return a pointer to the byte-encoded representation of the SV, and set *lp
3310 to its length. May cause the SV to be downgraded from UTF-8 as a
3313 Usually accessed via the C<SvPVbyte> macro.
3319 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3321 sv_utf8_downgrade(sv,0);
3322 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3326 * =for apidoc sv_2pvutf8
3328 * Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3329 * to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3331 * Usually accessed via the C<SvPVutf8> macro.
3337 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3339 sv_utf8_upgrade(sv);
3340 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3345 =for apidoc sv_2bool
3347 This function is only called on magical items, and is only used by
3348 sv_true() or its macro equivalent.
3354 Perl_sv_2bool(pTHX_ register SV *sv)
3362 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3363 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3364 return (bool)SvTRUE(tmpsv);
3365 return SvRV(sv) != 0;
3368 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
3370 (*sv->sv_u.svu_pv > '0' ||
3371 Xpvtmp->xpv_cur > 1 ||
3372 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3379 return SvIVX(sv) != 0;
3382 return SvNVX(sv) != 0.0;
3390 =for apidoc sv_utf8_upgrade
3392 Converts the PV of an SV to its UTF-8-encoded form.
3393 Forces the SV to string form if it is not already.
3394 Always sets the SvUTF8 flag to avoid future validity checks even
3395 if all the bytes have hibit clear.
3397 This is not as a general purpose byte encoding to Unicode interface:
3398 use the Encode extension for that.
3400 =for apidoc sv_utf8_upgrade_flags
3402 Converts the PV of an SV to its UTF-8-encoded form.
3403 Forces the SV to string form if it is not already.
3404 Always sets the SvUTF8 flag to avoid future validity checks even
3405 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3406 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3407 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3409 This is not as a general purpose byte encoding to Unicode interface:
3410 use the Encode extension for that.
3416 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3418 if (sv == &PL_sv_undef)
3422 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3423 (void) sv_2pv_flags(sv,&len, flags);
3427 (void) SvPV_force(sv,len);
3436 sv_force_normal_flags(sv, 0);
3439 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3440 sv_recode_to_utf8(sv, PL_encoding);
3441 else { /* Assume Latin-1/EBCDIC */
3442 /* This function could be much more efficient if we
3443 * had a FLAG in SVs to signal if there are any hibit
3444 * chars in the PV. Given that there isn't such a flag
3445 * make the loop as fast as possible. */
3446 const U8 *s = (U8 *) SvPVX_const(sv);
3447 const U8 *e = (U8 *) SvEND(sv);
3453 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3457 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3458 U8 * const recoded = bytes_to_utf8((U8*)s, &len);
3460 SvPV_free(sv); /* No longer using what was there before. */
3462 SvPV_set(sv, (char*)recoded);
3463 SvCUR_set(sv, len - 1);
3464 SvLEN_set(sv, len); /* No longer know the real size. */
3466 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3473 =for apidoc sv_utf8_downgrade
3475 Attempts to convert the PV of an SV from characters to bytes.
3476 If the PV contains a character beyond byte, this conversion will fail;
3477 in this case, either returns false or, if C<fail_ok> is not
3480 This is not as a general purpose Unicode to byte encoding interface:
3481 use the Encode extension for that.
3487 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3489 if (SvPOKp(sv) && SvUTF8(sv)) {
3495 sv_force_normal_flags(sv, 0);
3497 s = (U8 *) SvPV(sv, len);
3498 if (!utf8_to_bytes(s, &len)) {
3503 Perl_croak(aTHX_ "Wide character in %s",
3506 Perl_croak(aTHX_ "Wide character");
3517 =for apidoc sv_utf8_encode
3519 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3520 flag off so that it looks like octets again.
3526 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3528 (void) sv_utf8_upgrade(sv);
3530 sv_force_normal_flags(sv, 0);
3532 if (SvREADONLY(sv)) {
3533 Perl_croak(aTHX_ PL_no_modify);
3539 =for apidoc sv_utf8_decode
3541 If the PV of the SV is an octet sequence in UTF-8
3542 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3543 so that it looks like a character. If the PV contains only single-byte
3544 characters, the C<SvUTF8> flag stays being off.
3545 Scans PV for validity and returns false if the PV is invalid UTF-8.
3551 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3557 /* The octets may have got themselves encoded - get them back as
3560 if (!sv_utf8_downgrade(sv, TRUE))
3563 /* it is actually just a matter of turning the utf8 flag on, but
3564 * we want to make sure everything inside is valid utf8 first.
3566 c = (const U8 *) SvPVX_const(sv);
3567 if (!is_utf8_string(c, SvCUR(sv)+1))
3569 e = (const U8 *) SvEND(sv);
3572 if (!UTF8_IS_INVARIANT(ch)) {
3582 =for apidoc sv_setsv
3584 Copies the contents of the source SV C<ssv> into the destination SV
3585 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3586 function if the source SV needs to be reused. Does not handle 'set' magic.
3587 Loosely speaking, it performs a copy-by-value, obliterating any previous
3588 content of the destination.
3590 You probably want to use one of the assortment of wrappers, such as
3591 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3592 C<SvSetMagicSV_nosteal>.
3594 =for apidoc sv_setsv_flags
3596 Copies the contents of the source SV C<ssv> into the destination SV
3597 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3598 function if the source SV needs to be reused. Does not handle 'set' magic.
3599 Loosely speaking, it performs a copy-by-value, obliterating any previous
3600 content of the destination.
3601 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3602 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3603 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3604 and C<sv_setsv_nomg> are implemented in terms of this function.
3606 You probably want to use one of the assortment of wrappers, such as
3607 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3608 C<SvSetMagicSV_nosteal>.
3610 This is the primary function for copying scalars, and most other
3611 copy-ish functions and macros use this underneath.
3617 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3619 register U32 sflags;
3625 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3627 sstr = &PL_sv_undef;
3628 stype = SvTYPE(sstr);
3629 dtype = SvTYPE(dstr);
3634 /* need to nuke the magic */
3636 SvRMAGICAL_off(dstr);
3639 /* There's a lot of redundancy below but we're going for speed here */
3644 if (dtype != SVt_PVGV) {
3645 (void)SvOK_off(dstr);
3653 sv_upgrade(dstr, SVt_IV);
3656 sv_upgrade(dstr, SVt_PVNV);
3660 sv_upgrade(dstr, SVt_PVIV);
3663 (void)SvIOK_only(dstr);
3664 SvIV_set(dstr, SvIVX(sstr));
3667 if (SvTAINTED(sstr))
3678 sv_upgrade(dstr, SVt_NV);
3683 sv_upgrade(dstr, SVt_PVNV);
3686 SvNV_set(dstr, SvNVX(sstr));
3687 (void)SvNOK_only(dstr);
3688 if (SvTAINTED(sstr))
3696 sv_upgrade(dstr, SVt_RV);
3697 else if (dtype == SVt_PVGV &&
3698 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3701 if (GvIMPORTED(dstr) != GVf_IMPORTED
3702 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3704 GvIMPORTED_on(dstr);
3713 #ifdef PERL_OLD_COPY_ON_WRITE
3714 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3715 if (dtype < SVt_PVIV)
3716 sv_upgrade(dstr, SVt_PVIV);
3723 sv_upgrade(dstr, SVt_PV);
3726 if (dtype < SVt_PVIV)
3727 sv_upgrade(dstr, SVt_PVIV);
3730 if (dtype < SVt_PVNV)
3731 sv_upgrade(dstr, SVt_PVNV);
3738 const char * const type = sv_reftype(sstr,0);
3740 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3742 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3747 if (dtype <= SVt_PVGV) {
3749 if (dtype != SVt_PVGV) {
3750 const char * const name = GvNAME(sstr);
3751 const STRLEN len = GvNAMELEN(sstr);
3752 /* don't upgrade SVt_PVLV: it can hold a glob */
3753 if (dtype != SVt_PVLV)
3754 sv_upgrade(dstr, SVt_PVGV);
3755 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3756 GvSTASH(dstr) = GvSTASH(sstr);
3758 Perl_sv_add_backref(aTHX_ (SV*)GvSTASH(dstr), dstr);
3759 GvNAME(dstr) = savepvn(name, len);
3760 GvNAMELEN(dstr) = len;
3761 SvFAKE_on(dstr); /* can coerce to non-glob */
3763 /* ahem, death to those who redefine active sort subs */
3764 else if (PL_curstackinfo->si_type == PERLSI_SORT
3765 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3766 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3769 #ifdef GV_UNIQUE_CHECK
3770 if (GvUNIQUE((GV*)dstr)) {
3771 Perl_croak(aTHX_ PL_no_modify);
3775 (void)SvOK_off(dstr);
3776 GvINTRO_off(dstr); /* one-shot flag */
3778 GvGP(dstr) = gp_ref(GvGP(sstr));
3779 if (SvTAINTED(sstr))
3781 if (GvIMPORTED(dstr) != GVf_IMPORTED
3782 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3784 GvIMPORTED_on(dstr);
3792 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3794 if ((int)SvTYPE(sstr) != stype) {
3795 stype = SvTYPE(sstr);
3796 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3800 if (stype == SVt_PVLV)
3801 SvUPGRADE(dstr, SVt_PVNV);
3803 SvUPGRADE(dstr, (U32)stype);
3806 sflags = SvFLAGS(sstr);
3808 if (sflags & SVf_ROK) {
3809 if (dtype >= SVt_PV) {
3810 if (dtype == SVt_PVGV) {
3811 SV * const sref = SvREFCNT_inc(SvRV(sstr));
3813 const int intro = GvINTRO(dstr);
3815 #ifdef GV_UNIQUE_CHECK
3816 if (GvUNIQUE((GV*)dstr)) {
3817 Perl_croak(aTHX_ PL_no_modify);
3822 GvINTRO_off(dstr); /* one-shot flag */
3823 GvLINE(dstr) = CopLINE(PL_curcop);
3824 GvEGV(dstr) = (GV*)dstr;
3827 switch (SvTYPE(sref)) {
3830 SAVEGENERICSV(GvAV(dstr));
3832 dref = (SV*)GvAV(dstr);
3833 GvAV(dstr) = (AV*)sref;
3834 if (!GvIMPORTED_AV(dstr)
3835 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3837 GvIMPORTED_AV_on(dstr);
3842 SAVEGENERICSV(GvHV(dstr));
3844 dref = (SV*)GvHV(dstr);
3845 GvHV(dstr) = (HV*)sref;
3846 if (!GvIMPORTED_HV(dstr)
3847 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3849 GvIMPORTED_HV_on(dstr);
3854 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3855 SvREFCNT_dec(GvCV(dstr));
3856 GvCV(dstr) = Nullcv;
3857 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3858 PL_sub_generation++;
3860 SAVEGENERICSV(GvCV(dstr));
3863 dref = (SV*)GvCV(dstr);
3864 if (GvCV(dstr) != (CV*)sref) {
3865 CV* const cv = GvCV(dstr);
3867 if (!GvCVGEN((GV*)dstr) &&
3868 (CvROOT(cv) || CvXSUB(cv)))
3870 /* ahem, death to those who redefine
3871 * active sort subs */
3872 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3873 PL_sortcop == CvSTART(cv))
3875 "Can't redefine active sort subroutine %s",
3876 GvENAME((GV*)dstr));
3877 /* Redefining a sub - warning is mandatory if
3878 it was a const and its value changed. */
3879 if (ckWARN(WARN_REDEFINE)
3881 && (!CvCONST((CV*)sref)
3882 || sv_cmp(cv_const_sv(cv),
3883 cv_const_sv((CV*)sref)))))
3885 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3887 ? "Constant subroutine %s::%s redefined"
3888 : "Subroutine %s::%s redefined",
3889 HvNAME_get(GvSTASH((GV*)dstr)),
3890 GvENAME((GV*)dstr));
3894 cv_ckproto(cv, (GV*)dstr,
3896 ? SvPVX_const(sref) : Nullch);
3898 GvCV(dstr) = (CV*)sref;
3899 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3900 GvASSUMECV_on(dstr);
3901 PL_sub_generation++;
3903 if (!GvIMPORTED_CV(dstr)
3904 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3906 GvIMPORTED_CV_on(dstr);
3911 SAVEGENERICSV(GvIOp(dstr));
3913 dref = (SV*)GvIOp(dstr);
3914 GvIOp(dstr) = (IO*)sref;
3918 SAVEGENERICSV(GvFORM(dstr));
3920 dref = (SV*)GvFORM(dstr);
3921 GvFORM(dstr) = (CV*)sref;
3925 SAVEGENERICSV(GvSV(dstr));
3927 dref = (SV*)GvSV(dstr);
3929 if (!GvIMPORTED_SV(dstr)
3930 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3932 GvIMPORTED_SV_on(dstr);
3938 if (SvTAINTED(sstr))
3942 if (SvPVX_const(dstr)) {
3948 (void)SvOK_off(dstr);
3949 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
3951 if (sflags & SVp_NOK) {
3953 /* Only set the public OK flag if the source has public OK. */
3954 if (sflags & SVf_NOK)
3955 SvFLAGS(dstr) |= SVf_NOK;
3956 SvNV_set(dstr, SvNVX(sstr));
3958 if (sflags & SVp_IOK) {
3959 (void)SvIOKp_on(dstr);
3960 if (sflags & SVf_IOK)
3961 SvFLAGS(dstr) |= SVf_IOK;
3962 if (sflags & SVf_IVisUV)
3964 SvIV_set(dstr, SvIVX(sstr));
3966 if (SvAMAGIC(sstr)) {
3970 else if (sflags & SVp_POK) {
3974 * Check to see if we can just swipe the string. If so, it's a
3975 * possible small lose on short strings, but a big win on long ones.
3976 * It might even be a win on short strings if SvPVX_const(dstr)
3977 * has to be allocated and SvPVX_const(sstr) has to be freed.
3980 /* Whichever path we take through the next code, we want this true,
3981 and doing it now facilitates the COW check. */
3982 (void)SvPOK_only(dstr);
3985 /* We're not already COW */
3986 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
3987 #ifndef PERL_OLD_COPY_ON_WRITE
3988 /* or we are, but dstr isn't a suitable target. */
3989 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
3994 (sflags & SVs_TEMP) && /* slated for free anyway? */
3995 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3996 (!(flags & SV_NOSTEAL)) &&
3997 /* and we're allowed to steal temps */
3998 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3999 SvLEN(sstr) && /* and really is a string */
4000 /* and won't be needed again, potentially */
4001 !(PL_op && PL_op->op_type == OP_AASSIGN))
4002 #ifdef PERL_OLD_COPY_ON_WRITE
4003 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4004 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4005 && SvTYPE(sstr) >= SVt_PVIV)
4008 /* Failed the swipe test, and it's not a shared hash key either.
4009 Have to copy the string. */
4010 STRLEN len = SvCUR(sstr);
4011 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4012 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4013 SvCUR_set(dstr, len);
4014 *SvEND(dstr) = '\0';
4016 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4018 /* Either it's a shared hash key, or it's suitable for
4019 copy-on-write or we can swipe the string. */
4021 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4025 #ifdef PERL_OLD_COPY_ON_WRITE
4027 /* I believe I should acquire a global SV mutex if
4028 it's a COW sv (not a shared hash key) to stop
4029 it going un copy-on-write.
4030 If the source SV has gone un copy on write between up there
4031 and down here, then (assert() that) it is of the correct
4032 form to make it copy on write again */
4033 if ((sflags & (SVf_FAKE | SVf_READONLY))
4034 != (SVf_FAKE | SVf_READONLY)) {
4035 SvREADONLY_on(sstr);
4037 /* Make the source SV into a loop of 1.
4038 (about to become 2) */
4039 SV_COW_NEXT_SV_SET(sstr, sstr);
4043 /* Initial code is common. */
4044 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4049 /* making another shared SV. */
4050 STRLEN cur = SvCUR(sstr);
4051 STRLEN len = SvLEN(sstr);
4052 #ifdef PERL_OLD_COPY_ON_WRITE
4054 assert (SvTYPE(dstr) >= SVt_PVIV);
4055 /* SvIsCOW_normal */
4056 /* splice us in between source and next-after-source. */
4057 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4058 SV_COW_NEXT_SV_SET(sstr, dstr);
4059 SvPV_set(dstr, SvPVX_mutable(sstr));
4063 /* SvIsCOW_shared_hash */
4064 DEBUG_C(PerlIO_printf(Perl_debug_log,
4065 "Copy on write: Sharing hash\n"));
4067 assert (SvTYPE(dstr) >= SVt_PV);
4069 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4071 SvLEN_set(dstr, len);
4072 SvCUR_set(dstr, cur);
4073 SvREADONLY_on(dstr);
4075 /* Relesase a global SV mutex. */
4078 { /* Passes the swipe test. */
4079 SvPV_set(dstr, SvPVX_mutable(sstr));
4080 SvLEN_set(dstr, SvLEN(sstr));
4081 SvCUR_set(dstr, SvCUR(sstr));
4084 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4085 SvPV_set(sstr, Nullch);
4091 if (sflags & SVf_UTF8)
4093 if (sflags & SVp_NOK) {
4095 if (sflags & SVf_NOK)
4096 SvFLAGS(dstr) |= SVf_NOK;
4097 SvNV_set(dstr, SvNVX(sstr));
4099 if (sflags & SVp_IOK) {
4100 (void)SvIOKp_on(dstr);
4101 if (sflags & SVf_IOK)
4102 SvFLAGS(dstr) |= SVf_IOK;
4103 if (sflags & SVf_IVisUV)
4105 SvIV_set(dstr, SvIVX(sstr));
4108 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4109 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4110 smg->mg_ptr, smg->mg_len);
4111 SvRMAGICAL_on(dstr);
4114 else if (sflags & SVp_IOK) {
4115 if (sflags & SVf_IOK)
4116 (void)SvIOK_only(dstr);
4118 (void)SvOK_off(dstr);
4119 (void)SvIOKp_on(dstr);
4121 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4122 if (sflags & SVf_IVisUV)
4124 SvIV_set(dstr, SvIVX(sstr));
4125 if (sflags & SVp_NOK) {
4126 if (sflags & SVf_NOK)
4127 (void)SvNOK_on(dstr);
4129 (void)SvNOKp_on(dstr);
4130 SvNV_set(dstr, SvNVX(sstr));
4133 else if (sflags & SVp_NOK) {
4134 if (sflags & SVf_NOK)
4135 (void)SvNOK_only(dstr);
4137 (void)SvOK_off(dstr);
4140 SvNV_set(dstr, SvNVX(sstr));
4143 if (dtype == SVt_PVGV) {
4144 if (ckWARN(WARN_MISC))
4145 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4148 (void)SvOK_off(dstr);
4150 if (SvTAINTED(sstr))
4155 =for apidoc sv_setsv_mg
4157 Like C<sv_setsv>, but also handles 'set' magic.
4163 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4165 sv_setsv(dstr,sstr);
4169 #ifdef PERL_OLD_COPY_ON_WRITE
4171 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4173 STRLEN cur = SvCUR(sstr);
4174 STRLEN len = SvLEN(sstr);
4175 register char *new_pv;
4178 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4186 if (SvTHINKFIRST(dstr))
4187 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4188 else if (SvPVX_const(dstr))
4189 Safefree(SvPVX_const(dstr));
4193 SvUPGRADE(dstr, SVt_PVIV);
4195 assert (SvPOK(sstr));
4196 assert (SvPOKp(sstr));
4197 assert (!SvIOK(sstr));
4198 assert (!SvIOKp(sstr));
4199 assert (!SvNOK(sstr));
4200 assert (!SvNOKp(sstr));
4202 if (SvIsCOW(sstr)) {
4204 if (SvLEN(sstr) == 0) {
4205 /* source is a COW shared hash key. */
4206 DEBUG_C(PerlIO_printf(Perl_debug_log,
4207 "Fast copy on write: Sharing hash\n"));
4208 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4211 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4213 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4214 SvUPGRADE(sstr, SVt_PVIV);
4215 SvREADONLY_on(sstr);
4217 DEBUG_C(PerlIO_printf(Perl_debug_log,
4218 "Fast copy on write: Converting sstr to COW\n"));
4219 SV_COW_NEXT_SV_SET(dstr, sstr);
4221 SV_COW_NEXT_SV_SET(sstr, dstr);
4222 new_pv = SvPVX_mutable(sstr);
4225 SvPV_set(dstr, new_pv);
4226 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4229 SvLEN_set(dstr, len);
4230 SvCUR_set(dstr, cur);
4239 =for apidoc sv_setpvn
4241 Copies a string into an SV. The C<len> parameter indicates the number of
4242 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4243 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4249 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4251 register char *dptr;
4253 SV_CHECK_THINKFIRST_COW_DROP(sv);
4259 /* len is STRLEN which is unsigned, need to copy to signed */
4262 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4264 SvUPGRADE(sv, SVt_PV);
4266 dptr = SvGROW(sv, len + 1);
4267 Move(ptr,dptr,len,char);
4270 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4275 =for apidoc sv_setpvn_mg
4277 Like C<sv_setpvn>, but also handles 'set' magic.
4283 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4285 sv_setpvn(sv,ptr,len);
4290 =for apidoc sv_setpv
4292 Copies a string into an SV. The string must be null-terminated. Does not
4293 handle 'set' magic. See C<sv_setpv_mg>.
4299 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4301 register STRLEN len;
4303 SV_CHECK_THINKFIRST_COW_DROP(sv);
4309 SvUPGRADE(sv, SVt_PV);
4311 SvGROW(sv, len + 1);
4312 Move(ptr,SvPVX(sv),len+1,char);
4314 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4319 =for apidoc sv_setpv_mg
4321 Like C<sv_setpv>, but also handles 'set' magic.
4327 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4334 =for apidoc sv_usepvn
4336 Tells an SV to use C<ptr> to find its string value. Normally the string is
4337 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4338 The C<ptr> should point to memory that was allocated by C<malloc>. The
4339 string length, C<len>, must be supplied. This function will realloc the
4340 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4341 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4342 See C<sv_usepvn_mg>.
4348 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4351 SV_CHECK_THINKFIRST_COW_DROP(sv);
4352 SvUPGRADE(sv, SVt_PV);
4357 if (SvPVX_const(sv))
4360 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4361 ptr = saferealloc (ptr, allocate);
4364 SvLEN_set(sv, allocate);
4366 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4371 =for apidoc sv_usepvn_mg
4373 Like C<sv_usepvn>, but also handles 'set' magic.
4379 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4381 sv_usepvn(sv,ptr,len);
4385 #ifdef PERL_OLD_COPY_ON_WRITE
4386 /* Need to do this *after* making the SV normal, as we need the buffer
4387 pointer to remain valid until after we've copied it. If we let go too early,
4388 another thread could invalidate it by unsharing last of the same hash key
4389 (which it can do by means other than releasing copy-on-write Svs)
4390 or by changing the other copy-on-write SVs in the loop. */
4392 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4394 if (len) { /* this SV was SvIsCOW_normal(sv) */
4395 /* we need to find the SV pointing to us. */
4396 SV * const current = SV_COW_NEXT_SV(after);
4398 if (current == sv) {
4399 /* The SV we point to points back to us (there were only two of us
4401 Hence other SV is no longer copy on write either. */
4403 SvREADONLY_off(after);
4405 /* We need to follow the pointers around the loop. */
4407 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4410 /* don't loop forever if the structure is bust, and we have
4411 a pointer into a closed loop. */
4412 assert (current != after);
4413 assert (SvPVX_const(current) == pvx);
4415 /* Make the SV before us point to the SV after us. */
4416 SV_COW_NEXT_SV_SET(current, after);
4419 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4424 Perl_sv_release_IVX(pTHX_ register SV *sv)
4427 sv_force_normal_flags(sv, 0);
4433 =for apidoc sv_force_normal_flags
4435 Undo various types of fakery on an SV: if the PV is a shared string, make
4436 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4437 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4438 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4439 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4440 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4441 set to some other value.) In addition, the C<flags> parameter gets passed to
4442 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4443 with flags set to 0.
4449 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4451 #ifdef PERL_OLD_COPY_ON_WRITE
4452 if (SvREADONLY(sv)) {
4453 /* At this point I believe I should acquire a global SV mutex. */
4455 const char * const pvx = SvPVX_const(sv);
4456 const STRLEN len = SvLEN(sv);
4457 const STRLEN cur = SvCUR(sv);
4458 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4460 PerlIO_printf(Perl_debug_log,
4461 "Copy on write: Force normal %ld\n",
4467 /* This SV doesn't own the buffer, so need to Newx() a new one: */
4468 SvPV_set(sv, (char*)0);
4470 if (flags & SV_COW_DROP_PV) {
4471 /* OK, so we don't need to copy our buffer. */
4474 SvGROW(sv, cur + 1);
4475 Move(pvx,SvPVX(sv),cur,char);
4479 sv_release_COW(sv, pvx, len, next);
4484 else if (IN_PERL_RUNTIME)
4485 Perl_croak(aTHX_ PL_no_modify);
4486 /* At this point I believe that I can drop the global SV mutex. */
4489 if (SvREADONLY(sv)) {
4491 const char * const pvx = SvPVX_const(sv);
4492 const STRLEN len = SvCUR(sv);
4495 SvPV_set(sv, Nullch);
4497 SvGROW(sv, len + 1);
4498 Move(pvx,SvPVX(sv),len,char);
4500 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4502 else if (IN_PERL_RUNTIME)
4503 Perl_croak(aTHX_ PL_no_modify);
4507 sv_unref_flags(sv, flags);
4508 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4515 Efficient removal of characters from the beginning of the string buffer.
4516 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4517 the string buffer. The C<ptr> becomes the first character of the adjusted
4518 string. Uses the "OOK hack".
4519 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4520 refer to the same chunk of data.
4526 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4528 register STRLEN delta;
4529 if (!ptr || !SvPOKp(sv))
4531 delta = ptr - SvPVX_const(sv);
4532 SV_CHECK_THINKFIRST(sv);
4533 if (SvTYPE(sv) < SVt_PVIV)
4534 sv_upgrade(sv,SVt_PVIV);
4537 if (!SvLEN(sv)) { /* make copy of shared string */
4538 const char *pvx = SvPVX_const(sv);
4539 const STRLEN len = SvCUR(sv);
4540 SvGROW(sv, len + 1);
4541 Move(pvx,SvPVX(sv),len,char);
4545 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4546 and we do that anyway inside the SvNIOK_off
4548 SvFLAGS(sv) |= SVf_OOK;
4551 SvLEN_set(sv, SvLEN(sv) - delta);
4552 SvCUR_set(sv, SvCUR(sv) - delta);
4553 SvPV_set(sv, SvPVX(sv) + delta);
4554 SvIV_set(sv, SvIVX(sv) + delta);
4558 =for apidoc sv_catpvn
4560 Concatenates the string onto the end of the string which is in the SV. The
4561 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4562 status set, then the bytes appended should be valid UTF-8.
4563 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4565 =for apidoc sv_catpvn_flags
4567 Concatenates the string onto the end of the string which is in the SV. The
4568 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4569 status set, then the bytes appended should be valid UTF-8.
4570 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4571 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4572 in terms of this function.
4578 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4581 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4583 SvGROW(dsv, dlen + slen + 1);
4585 sstr = SvPVX_const(dsv);
4586 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4587 SvCUR_set(dsv, SvCUR(dsv) + slen);
4589 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4594 =for apidoc sv_catpvn_mg
4596 Like C<sv_catpvn>, but also handles 'set' magic.
4602 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4604 sv_catpvn(sv,ptr,len);
4609 =for apidoc sv_catsv
4611 Concatenates the string from SV C<ssv> onto the end of the string in
4612 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4613 not 'set' magic. See C<sv_catsv_mg>.
4615 =for apidoc sv_catsv_flags
4617 Concatenates the string from SV C<ssv> onto the end of the string in
4618 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4619 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4620 and C<sv_catsv_nomg> are implemented in terms of this function.
4625 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4631 if ((spv = SvPV_const(ssv, slen))) {
4632 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4633 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4634 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4635 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4636 dsv->sv_flags doesn't have that bit set.
4637 Andy Dougherty 12 Oct 2001
4639 const I32 sutf8 = DO_UTF8(ssv);
4642 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4644 dutf8 = DO_UTF8(dsv);
4646 if (dutf8 != sutf8) {
4648 /* Not modifying source SV, so taking a temporary copy. */
4649 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4651 sv_utf8_upgrade(csv);
4652 spv = SvPV_const(csv, slen);
4655 sv_utf8_upgrade_nomg(dsv);
4657 sv_catpvn_nomg(dsv, spv, slen);
4662 =for apidoc sv_catsv_mg
4664 Like C<sv_catsv>, but also handles 'set' magic.
4670 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4677 =for apidoc sv_catpv
4679 Concatenates the string onto the end of the string which is in the SV.
4680 If the SV has the UTF-8 status set, then the bytes appended should be
4681 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4686 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4688 register STRLEN len;
4694 junk = SvPV_force(sv, tlen);
4696 SvGROW(sv, tlen + len + 1);
4698 ptr = SvPVX_const(sv);
4699 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4700 SvCUR_set(sv, SvCUR(sv) + len);
4701 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4706 =for apidoc sv_catpv_mg
4708 Like C<sv_catpv>, but also handles 'set' magic.
4714 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4723 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4724 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4731 Perl_newSV(pTHX_ STRLEN len)
4737 sv_upgrade(sv, SVt_PV);
4738 SvGROW(sv, len + 1);
4743 =for apidoc sv_magicext
4745 Adds magic to an SV, upgrading it if necessary. Applies the
4746 supplied vtable and returns a pointer to the magic added.
4748 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4749 In particular, you can add magic to SvREADONLY SVs, and add more than
4750 one instance of the same 'how'.
4752 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4753 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4754 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4755 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4757 (This is now used as a subroutine by C<sv_magic>.)
4762 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4763 const char* name, I32 namlen)
4767 if (SvTYPE(sv) < SVt_PVMG) {
4768 SvUPGRADE(sv, SVt_PVMG);
4770 Newxz(mg, 1, MAGIC);
4771 mg->mg_moremagic = SvMAGIC(sv);
4772 SvMAGIC_set(sv, mg);
4774 /* Sometimes a magic contains a reference loop, where the sv and
4775 object refer to each other. To prevent a reference loop that
4776 would prevent such objects being freed, we look for such loops
4777 and if we find one we avoid incrementing the object refcount.
4779 Note we cannot do this to avoid self-tie loops as intervening RV must
4780 have its REFCNT incremented to keep it in existence.
4783 if (!obj || obj == sv ||
4784 how == PERL_MAGIC_arylen ||
4785 how == PERL_MAGIC_qr ||
4786 how == PERL_MAGIC_symtab ||
4787 (SvTYPE(obj) == SVt_PVGV &&
4788 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4789 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4790 GvFORM(obj) == (CV*)sv)))
4795 mg->mg_obj = SvREFCNT_inc(obj);
4796 mg->mg_flags |= MGf_REFCOUNTED;
4799 /* Normal self-ties simply pass a null object, and instead of
4800 using mg_obj directly, use the SvTIED_obj macro to produce a
4801 new RV as needed. For glob "self-ties", we are tieing the PVIO
4802 with an RV obj pointing to the glob containing the PVIO. In
4803 this case, to avoid a reference loop, we need to weaken the
4807 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4808 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4814 mg->mg_len = namlen;
4817 mg->mg_ptr = savepvn(name, namlen);
4818 else if (namlen == HEf_SVKEY)
4819 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4821 mg->mg_ptr = (char *) name;
4823 mg->mg_virtual = vtable;
4827 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4832 =for apidoc sv_magic
4834 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4835 then adds a new magic item of type C<how> to the head of the magic list.
4837 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4838 handling of the C<name> and C<namlen> arguments.
4840 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4841 to add more than one instance of the same 'how'.
4847 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4849 const MGVTBL *vtable;
4852 #ifdef PERL_OLD_COPY_ON_WRITE
4854 sv_force_normal_flags(sv, 0);
4856 if (SvREADONLY(sv)) {
4858 /* its okay to attach magic to shared strings; the subsequent
4859 * upgrade to PVMG will unshare the string */
4860 !(SvFAKE(sv) && SvTYPE(sv) < SVt_PVMG)
4863 && how != PERL_MAGIC_regex_global
4864 && how != PERL_MAGIC_bm
4865 && how != PERL_MAGIC_fm
4866 && how != PERL_MAGIC_sv
4867 && how != PERL_MAGIC_backref
4870 Perl_croak(aTHX_ PL_no_modify);
4873 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4874 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4875 /* sv_magic() refuses to add a magic of the same 'how' as an
4878 if (how == PERL_MAGIC_taint)
4886 vtable = &PL_vtbl_sv;
4888 case PERL_MAGIC_overload:
4889 vtable = &PL_vtbl_amagic;
4891 case PERL_MAGIC_overload_elem:
4892 vtable = &PL_vtbl_amagicelem;
4894 case PERL_MAGIC_overload_table:
4895 vtable = &PL_vtbl_ovrld;
4898 vtable = &PL_vtbl_bm;
4900 case PERL_MAGIC_regdata:
4901 vtable = &PL_vtbl_regdata;
4903 case PERL_MAGIC_regdatum:
4904 vtable = &PL_vtbl_regdatum;
4906 case PERL_MAGIC_env:
4907 vtable = &PL_vtbl_env;
4910 vtable = &PL_vtbl_fm;
4912 case PERL_MAGIC_envelem:
4913 vtable = &PL_vtbl_envelem;
4915 case PERL_MAGIC_regex_global:
4916 vtable = &PL_vtbl_mglob;
4918 case PERL_MAGIC_isa:
4919 vtable = &PL_vtbl_isa;
4921 case PERL_MAGIC_isaelem:
4922 vtable = &PL_vtbl_isaelem;
4924 case PERL_MAGIC_nkeys:
4925 vtable = &PL_vtbl_nkeys;
4927 case PERL_MAGIC_dbfile:
4930 case PERL_MAGIC_dbline:
4931 vtable = &PL_vtbl_dbline;
4933 #ifdef USE_LOCALE_COLLATE
4934 case PERL_MAGIC_collxfrm:
4935 vtable = &PL_vtbl_collxfrm;
4937 #endif /* USE_LOCALE_COLLATE */
4938 case PERL_MAGIC_tied:
4939 vtable = &PL_vtbl_pack;
4941 case PERL_MAGIC_tiedelem:
4942 case PERL_MAGIC_tiedscalar:
4943 vtable = &PL_vtbl_packelem;
4946 vtable = &PL_vtbl_regexp;
4948 case PERL_MAGIC_sig:
4949 vtable = &PL_vtbl_sig;
4951 case PERL_MAGIC_sigelem:
4952 vtable = &PL_vtbl_sigelem;
4954 case PERL_MAGIC_taint:
4955 vtable = &PL_vtbl_taint;
4957 case PERL_MAGIC_uvar:
4958 vtable = &PL_vtbl_uvar;
4960 case PERL_MAGIC_vec:
4961 vtable = &PL_vtbl_vec;
4963 case PERL_MAGIC_arylen_p:
4964 case PERL_MAGIC_rhash:
4965 case PERL_MAGIC_symtab:
4966 case PERL_MAGIC_vstring:
4969 case PERL_MAGIC_utf8:
4970 vtable = &PL_vtbl_utf8;
4972 case PERL_MAGIC_substr:
4973 vtable = &PL_vtbl_substr;
4975 case PERL_MAGIC_defelem:
4976 vtable = &PL_vtbl_defelem;
4978 case PERL_MAGIC_glob:
4979 vtable = &PL_vtbl_glob;
4981 case PERL_MAGIC_arylen:
4982 vtable = &PL_vtbl_arylen;
4984 case PERL_MAGIC_pos:
4985 vtable = &PL_vtbl_pos;
4987 case PERL_MAGIC_backref:
4988 vtable = &PL_vtbl_backref;
4990 case PERL_MAGIC_ext:
4991 /* Reserved for use by extensions not perl internals. */
4992 /* Useful for attaching extension internal data to perl vars. */
4993 /* Note that multiple extensions may clash if magical scalars */
4994 /* etc holding private data from one are passed to another. */
4998 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5001 /* Rest of work is done else where */
5002 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5005 case PERL_MAGIC_taint:
5008 case PERL_MAGIC_ext:
5009 case PERL_MAGIC_dbfile:
5016 =for apidoc sv_unmagic
5018 Removes all magic of type C<type> from an SV.
5024 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5028 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5031 for (mg = *mgp; mg; mg = *mgp) {
5032 if (mg->mg_type == type) {
5033 const MGVTBL* const vtbl = mg->mg_virtual;
5034 *mgp = mg->mg_moremagic;
5035 if (vtbl && vtbl->svt_free)
5036 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5037 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5039 Safefree(mg->mg_ptr);
5040 else if (mg->mg_len == HEf_SVKEY)
5041 SvREFCNT_dec((SV*)mg->mg_ptr);
5042 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5043 Safefree(mg->mg_ptr);
5045 if (mg->mg_flags & MGf_REFCOUNTED)
5046 SvREFCNT_dec(mg->mg_obj);
5050 mgp = &mg->mg_moremagic;
5054 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5061 =for apidoc sv_rvweaken
5063 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5064 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5065 push a back-reference to this RV onto the array of backreferences
5066 associated with that magic.
5072 Perl_sv_rvweaken(pTHX_ SV *sv)
5075 if (!SvOK(sv)) /* let undefs pass */
5078 Perl_croak(aTHX_ "Can't weaken a nonreference");
5079 else if (SvWEAKREF(sv)) {
5080 if (ckWARN(WARN_MISC))
5081 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5085 Perl_sv_add_backref(aTHX_ tsv, sv);
5091 /* Give tsv backref magic if it hasn't already got it, then push a
5092 * back-reference to sv onto the array associated with the backref magic.
5096 Perl_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5100 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5101 av = (AV*)mg->mg_obj;
5104 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5105 /* av now has a refcnt of 2, which avoids it getting freed
5106 * before us during global cleanup. The extra ref is removed
5107 * by magic_killbackrefs() when tsv is being freed */
5109 if (AvFILLp(av) >= AvMAX(av)) {
5110 av_extend(av, AvFILLp(av)+1);
5112 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5115 /* delete a back-reference to ourselves from the backref magic associated
5116 * with the SV we point to.
5120 S_sv_del_backref(pTHX_ SV *tsv, SV *sv)
5126 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref))) {
5127 if (PL_in_clean_all)
5130 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5131 Perl_croak(aTHX_ "panic: del_backref");
5132 av = (AV *)mg->mg_obj;
5134 /* We shouldn't be in here more than once, but for paranoia reasons lets
5136 for (i = AvFILLp(av); i >= 0; i--) {
5138 const SSize_t fill = AvFILLp(av);
5140 /* We weren't the last entry.
5141 An unordered list has this property that you can take the
5142 last element off the end to fill the hole, and it's still
5143 an unordered list :-)
5148 AvFILLp(av) = fill - 1;
5154 =for apidoc sv_insert
5156 Inserts a string at the specified offset/length within the SV. Similar to
5157 the Perl substr() function.
5163 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5167 register char *midend;
5168 register char *bigend;
5174 Perl_croak(aTHX_ "Can't modify non-existent substring");
5175 SvPV_force(bigstr, curlen);
5176 (void)SvPOK_only_UTF8(bigstr);
5177 if (offset + len > curlen) {
5178 SvGROW(bigstr, offset+len+1);
5179 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5180 SvCUR_set(bigstr, offset+len);
5184 i = littlelen - len;
5185 if (i > 0) { /* string might grow */
5186 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5187 mid = big + offset + len;
5188 midend = bigend = big + SvCUR(bigstr);
5191 while (midend > mid) /* shove everything down */
5192 *--bigend = *--midend;
5193 Move(little,big+offset,littlelen,char);
5194 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5199 Move(little,SvPVX(bigstr)+offset,len,char);
5204 big = SvPVX(bigstr);
5207 bigend = big + SvCUR(bigstr);
5209 if (midend > bigend)
5210 Perl_croak(aTHX_ "panic: sv_insert");
5212 if (mid - big > bigend - midend) { /* faster to shorten from end */
5214 Move(little, mid, littlelen,char);
5217 i = bigend - midend;
5219 Move(midend, mid, i,char);
5223 SvCUR_set(bigstr, mid - big);
5225 else if ((i = mid - big)) { /* faster from front */
5226 midend -= littlelen;
5228 sv_chop(bigstr,midend-i);
5233 Move(little, mid, littlelen,char);
5235 else if (littlelen) {
5236 midend -= littlelen;
5237 sv_chop(bigstr,midend);
5238 Move(little,midend,littlelen,char);
5241 sv_chop(bigstr,midend);
5247 =for apidoc sv_replace
5249 Make the first argument a copy of the second, then delete the original.
5250 The target SV physically takes over ownership of the body of the source SV
5251 and inherits its flags; however, the target keeps any magic it owns,
5252 and any magic in the source is discarded.
5253 Note that this is a rather specialist SV copying operation; most of the
5254 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5260 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5262 const U32 refcnt = SvREFCNT(sv);
5263 SV_CHECK_THINKFIRST_COW_DROP(sv);
5264 if (SvREFCNT(nsv) != 1) {
5265 Perl_croak(aTHX_ "panic: reference miscount on nsv in sv_replace() (%"
5266 UVuf " != 1)", (UV) SvREFCNT(nsv));
5268 if (SvMAGICAL(sv)) {
5272 sv_upgrade(nsv, SVt_PVMG);
5273 SvMAGIC_set(nsv, SvMAGIC(sv));
5274 SvFLAGS(nsv) |= SvMAGICAL(sv);
5276 SvMAGIC_set(sv, NULL);
5280 assert(!SvREFCNT(sv));
5281 #ifdef DEBUG_LEAKING_SCALARS
5282 sv->sv_flags = nsv->sv_flags;
5283 sv->sv_any = nsv->sv_any;
5284 sv->sv_refcnt = nsv->sv_refcnt;
5285 sv->sv_u = nsv->sv_u;
5287 StructCopy(nsv,sv,SV);
5289 /* Currently could join these into one piece of pointer arithmetic, but
5290 it would be unclear. */
5291 if(SvTYPE(sv) == SVt_IV)
5293 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5294 else if (SvTYPE(sv) == SVt_RV) {
5295 SvANY(sv) = &sv->sv_u.svu_rv;
5299 #ifdef PERL_OLD_COPY_ON_WRITE
5300 if (SvIsCOW_normal(nsv)) {
5301 /* We need to follow the pointers around the loop to make the
5302 previous SV point to sv, rather than nsv. */
5305 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5308 assert(SvPVX_const(current) == SvPVX_const(nsv));
5310 /* Make the SV before us point to the SV after us. */
5312 PerlIO_printf(Perl_debug_log, "previous is\n");
5314 PerlIO_printf(Perl_debug_log,
5315 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5316 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5318 SV_COW_NEXT_SV_SET(current, sv);
5321 SvREFCNT(sv) = refcnt;
5322 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5328 =for apidoc sv_clear
5330 Clear an SV: call any destructors, free up any memory used by the body,
5331 and free the body itself. The SV's head is I<not> freed, although
5332 its type is set to all 1's so that it won't inadvertently be assumed
5333 to be live during global destruction etc.
5334 This function should only be called when REFCNT is zero. Most of the time
5335 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5342 Perl_sv_clear(pTHX_ register SV *sv)
5345 void** old_body_arena;
5346 size_t old_body_offset;
5347 const U32 type = SvTYPE(sv);
5350 assert(SvREFCNT(sv) == 0);
5356 old_body_offset = 0;
5359 if (PL_defstash) { /* Still have a symbol table? */
5364 stash = SvSTASH(sv);
5365 destructor = StashHANDLER(stash,DESTROY);
5367 SV* const tmpref = newRV(sv);
5368 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5370 PUSHSTACKi(PERLSI_DESTROY);
5375 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5381 if(SvREFCNT(tmpref) < 2) {
5382 /* tmpref is not kept alive! */
5384 SvRV_set(tmpref, NULL);
5387 SvREFCNT_dec(tmpref);
5389 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5393 if (PL_in_clean_objs)
5394 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5396 /* DESTROY gave object new lease on life */
5402 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5403 SvOBJECT_off(sv); /* Curse the object. */
5404 if (type != SVt_PVIO)
5405 --PL_sv_objcount; /* XXX Might want something more general */
5408 if (type >= SVt_PVMG) {
5411 if (type == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5412 SvREFCNT_dec(SvSTASH(sv));
5417 IoIFP(sv) != PerlIO_stdin() &&
5418 IoIFP(sv) != PerlIO_stdout() &&
5419 IoIFP(sv) != PerlIO_stderr())
5421 io_close((IO*)sv, FALSE);
5423 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5424 PerlDir_close(IoDIRP(sv));
5425 IoDIRP(sv) = (DIR*)NULL;
5426 Safefree(IoTOP_NAME(sv));
5427 Safefree(IoFMT_NAME(sv));
5428 Safefree(IoBOTTOM_NAME(sv));
5429 /* PVIOs aren't from arenas */
5432 old_body_arena = (void **) &PL_xpvbm_root;
5435 old_body_arena = (void **) &PL_xpvcv_root;
5437 /* PVFMs aren't from arenas */
5442 old_body_arena = (void **) &PL_xpvhv_root;
5443 old_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill);
5447 old_body_arena = (void **) &PL_xpvav_root;
5448 old_body_offset = STRUCT_OFFSET(XPVAV, xav_fill);
5451 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5452 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5453 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5454 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5456 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5457 SvREFCNT_dec(LvTARG(sv));
5458 old_body_arena = (void **) &PL_xpvlv_root;
5462 Safefree(GvNAME(sv));
5463 /* If we're in a stash, we don't own a reference to it. However it does
5464 have a back reference to us, which needs to be cleared. */
5466 sv_del_backref((SV*)GvSTASH(sv), sv);
5467 old_body_arena = (void **) &PL_xpvgv_root;
5470 old_body_arena = (void **) &PL_xpvmg_root;
5473 old_body_arena = (void **) &PL_xpvnv_root;
5476 old_body_arena = (void **) &PL_xpviv_root;
5477 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur);
5479 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5481 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5482 /* Don't even bother with turning off the OOK flag. */
5486 old_body_arena = (void **) &PL_xpv_root;
5487 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur);
5491 SV *target = SvRV(sv);
5493 sv_del_backref(target, sv);
5495 SvREFCNT_dec(target);
5497 #ifdef PERL_OLD_COPY_ON_WRITE
5498 else if (SvPVX_const(sv)) {
5500 /* I believe I need to grab the global SV mutex here and
5501 then recheck the COW status. */
5503 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5506 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5507 SV_COW_NEXT_SV(sv));
5508 /* And drop it here. */
5510 } else if (SvLEN(sv)) {
5511 Safefree(SvPVX_const(sv));
5515 else if (SvPVX_const(sv) && SvLEN(sv))
5516 Safefree(SvPVX_mutable(sv));
5517 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5518 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5524 old_body_arena = (void **) &PL_xnv_root;
5528 SvFLAGS(sv) &= SVf_BREAK;
5529 SvFLAGS(sv) |= SVTYPEMASK;
5532 if (old_body_arena) {
5533 del_body(((char *)SvANY(sv) + old_body_offset), old_body_arena);
5537 if (type > SVt_RV) {
5538 my_safefree(SvANY(sv));
5543 =for apidoc sv_newref
5545 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5552 Perl_sv_newref(pTHX_ SV *sv)
5562 Decrement an SV's reference count, and if it drops to zero, call
5563 C<sv_clear> to invoke destructors and free up any memory used by
5564 the body; finally, deallocate the SV's head itself.
5565 Normally called via a wrapper macro C<SvREFCNT_dec>.
5571 Perl_sv_free(pTHX_ SV *sv)
5576 if (SvREFCNT(sv) == 0) {
5577 if (SvFLAGS(sv) & SVf_BREAK)
5578 /* this SV's refcnt has been artificially decremented to
5579 * trigger cleanup */
5581 if (PL_in_clean_all) /* All is fair */
5583 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5584 /* make sure SvREFCNT(sv)==0 happens very seldom */
5585 SvREFCNT(sv) = (~(U32)0)/2;
5588 if (ckWARN_d(WARN_INTERNAL)) {
5589 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5590 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5591 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5592 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
5593 Perl_dump_sv_child(aTHX_ sv);
5598 if (--(SvREFCNT(sv)) > 0)
5600 Perl_sv_free2(aTHX_ sv);
5604 Perl_sv_free2(pTHX_ SV *sv)
5609 if (ckWARN_d(WARN_DEBUGGING))
5610 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5611 "Attempt to free temp prematurely: SV 0x%"UVxf
5612 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5616 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5617 /* make sure SvREFCNT(sv)==0 happens very seldom */
5618 SvREFCNT(sv) = (~(U32)0)/2;
5629 Returns the length of the string in the SV. Handles magic and type
5630 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5636 Perl_sv_len(pTHX_ register SV *sv)
5644 len = mg_length(sv);
5646 (void)SvPV_const(sv, len);
5651 =for apidoc sv_len_utf8
5653 Returns the number of characters in the string in an SV, counting wide
5654 UTF-8 bytes as a single character. Handles magic and type coercion.
5660 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5661 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5662 * (Note that the mg_len is not the length of the mg_ptr field.)
5667 Perl_sv_len_utf8(pTHX_ register SV *sv)
5673 return mg_length(sv);
5677 const U8 *s = (U8*)SvPV_const(sv, len);
5678 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5680 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5682 #ifdef PERL_UTF8_CACHE_ASSERT
5683 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5687 ulen = Perl_utf8_length(aTHX_ s, s + len);
5688 if (!mg && !SvREADONLY(sv)) {
5689 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5690 mg = mg_find(sv, PERL_MAGIC_utf8);
5700 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5701 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5702 * between UTF-8 and byte offsets. There are two (substr offset and substr
5703 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5704 * and byte offset) cache positions.
5706 * The mg_len field is used by sv_len_utf8(), see its comments.
5707 * Note that the mg_len is not the length of the mg_ptr field.
5711 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5712 I32 offsetp, const U8 *s, const U8 *start)
5716 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5718 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5722 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5724 Newxz(*cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5725 (*mgp)->mg_ptr = (char *) *cachep;
5729 (*cachep)[i] = offsetp;
5730 (*cachep)[i+1] = s - start;
5738 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5739 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5740 * between UTF-8 and byte offsets. See also the comments of
5741 * S_utf8_mg_pos_init().
5745 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)
5749 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5751 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5752 if (*mgp && (*mgp)->mg_ptr) {
5753 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5754 ASSERT_UTF8_CACHE(*cachep);
5755 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5757 else { /* We will skip to the right spot. */
5762 /* The assumption is that going backward is half
5763 * the speed of going forward (that's where the
5764 * 2 * backw in the below comes from). (The real
5765 * figure of course depends on the UTF-8 data.) */
5767 if ((*cachep)[i] > (STRLEN)uoff) {
5769 backw = (*cachep)[i] - (STRLEN)uoff;
5771 if (forw < 2 * backw)
5774 p = start + (*cachep)[i+1];
5776 /* Try this only for the substr offset (i == 0),
5777 * not for the substr length (i == 2). */
5778 else if (i == 0) { /* (*cachep)[i] < uoff */
5779 const STRLEN ulen = sv_len_utf8(sv);
5781 if ((STRLEN)uoff < ulen) {
5782 forw = (STRLEN)uoff - (*cachep)[i];
5783 backw = ulen - (STRLEN)uoff;
5785 if (forw < 2 * backw)
5786 p = start + (*cachep)[i+1];
5791 /* If the string is not long enough for uoff,
5792 * we could extend it, but not at this low a level. */
5796 if (forw < 2 * backw) {
5803 while (UTF8_IS_CONTINUATION(*p))
5808 /* Update the cache. */
5809 (*cachep)[i] = (STRLEN)uoff;
5810 (*cachep)[i+1] = p - start;
5812 /* Drop the stale "length" cache */
5821 if (found) { /* Setup the return values. */
5822 *offsetp = (*cachep)[i+1];
5823 *sp = start + *offsetp;
5826 *offsetp = send - start;
5828 else if (*sp < start) {
5834 #ifdef PERL_UTF8_CACHE_ASSERT
5839 while (n-- && s < send)
5843 assert(*offsetp == s - start);
5844 assert((*cachep)[0] == (STRLEN)uoff);
5845 assert((*cachep)[1] == *offsetp);
5847 ASSERT_UTF8_CACHE(*cachep);
5856 =for apidoc sv_pos_u2b
5858 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5859 the start of the string, to a count of the equivalent number of bytes; if
5860 lenp is non-zero, it does the same to lenp, but this time starting from
5861 the offset, rather than from the start of the string. Handles magic and
5868 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5869 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5870 * byte offsets. See also the comments of S_utf8_mg_pos().
5875 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5883 start = (U8*)SvPV_const(sv, len);
5887 const U8 *s = start;
5888 I32 uoffset = *offsetp;
5889 const U8 * const send = s + len;
5893 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5895 if (!found && uoffset > 0) {
5896 while (s < send && uoffset--)
5900 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
5902 *offsetp = s - start;
5907 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
5911 if (!found && *lenp > 0) {
5914 while (s < send && ulen--)
5918 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
5922 ASSERT_UTF8_CACHE(cache);
5934 =for apidoc sv_pos_b2u
5936 Converts the value pointed to by offsetp from a count of bytes from the
5937 start of the string, to a count of the equivalent number of UTF-8 chars.
5938 Handles magic and type coercion.
5944 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5945 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5946 * byte offsets. See also the comments of S_utf8_mg_pos().
5951 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5959 s = (const U8*)SvPV_const(sv, len);
5960 if ((I32)len < *offsetp)
5961 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5963 const U8* send = s + *offsetp;
5965 STRLEN *cache = NULL;
5969 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5970 mg = mg_find(sv, PERL_MAGIC_utf8);
5971 if (mg && mg->mg_ptr) {
5972 cache = (STRLEN *) mg->mg_ptr;
5973 if (cache[1] == (STRLEN)*offsetp) {
5974 /* An exact match. */
5975 *offsetp = cache[0];
5979 else if (cache[1] < (STRLEN)*offsetp) {
5980 /* We already know part of the way. */
5983 /* Let the below loop do the rest. */
5985 else { /* cache[1] > *offsetp */
5986 /* We already know all of the way, now we may
5987 * be able to walk back. The same assumption
5988 * is made as in S_utf8_mg_pos(), namely that
5989 * walking backward is twice slower than
5990 * walking forward. */
5991 const STRLEN forw = *offsetp;
5992 STRLEN backw = cache[1] - *offsetp;
5994 if (!(forw < 2 * backw)) {
5995 const U8 *p = s + cache[1];
6002 while (UTF8_IS_CONTINUATION(*p)) {
6010 *offsetp = cache[0];
6012 /* Drop the stale "length" cache */
6020 ASSERT_UTF8_CACHE(cache);
6026 /* Call utf8n_to_uvchr() to validate the sequence
6027 * (unless a simple non-UTF character) */
6028 if (!UTF8_IS_INVARIANT(*s))
6029 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6038 if (!SvREADONLY(sv)) {
6040 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6041 mg = mg_find(sv, PERL_MAGIC_utf8);
6046 Newxz(cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6047 mg->mg_ptr = (char *) cache;
6052 cache[1] = *offsetp;
6053 /* Drop the stale "length" cache */
6066 Returns a boolean indicating whether the strings in the two SVs are
6067 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6068 coerce its args to strings if necessary.
6074 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6082 SV* svrecode = Nullsv;
6089 pv1 = SvPV_const(sv1, cur1);
6096 pv2 = SvPV_const(sv2, cur2);
6098 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6099 /* Differing utf8ness.
6100 * Do not UTF8size the comparands as a side-effect. */
6103 svrecode = newSVpvn(pv2, cur2);
6104 sv_recode_to_utf8(svrecode, PL_encoding);
6105 pv2 = SvPV_const(svrecode, cur2);
6108 svrecode = newSVpvn(pv1, cur1);
6109 sv_recode_to_utf8(svrecode, PL_encoding);
6110 pv1 = SvPV_const(svrecode, cur1);
6112 /* Now both are in UTF-8. */
6114 SvREFCNT_dec(svrecode);
6119 bool is_utf8 = TRUE;
6122 /* sv1 is the UTF-8 one,
6123 * if is equal it must be downgrade-able */
6124 char * const pv = (char*)bytes_from_utf8((const U8*)pv1,
6130 /* sv2 is the UTF-8 one,
6131 * if is equal it must be downgrade-able */
6132 char * const pv = (char *)bytes_from_utf8((const U8*)pv2,
6138 /* Downgrade not possible - cannot be eq */
6146 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6149 SvREFCNT_dec(svrecode);
6160 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6161 string in C<sv1> is less than, equal to, or greater than the string in
6162 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6163 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6169 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6172 const char *pv1, *pv2;
6175 SV *svrecode = Nullsv;
6182 pv1 = SvPV_const(sv1, cur1);
6189 pv2 = SvPV_const(sv2, cur2);
6191 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6192 /* Differing utf8ness.
6193 * Do not UTF8size the comparands as a side-effect. */
6196 svrecode = newSVpvn(pv2, cur2);
6197 sv_recode_to_utf8(svrecode, PL_encoding);
6198 pv2 = SvPV_const(svrecode, cur2);
6201 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6206 svrecode = newSVpvn(pv1, cur1);
6207 sv_recode_to_utf8(svrecode, PL_encoding);
6208 pv1 = SvPV_const(svrecode, cur1);
6211 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6217 cmp = cur2 ? -1 : 0;
6221 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6224 cmp = retval < 0 ? -1 : 1;
6225 } else if (cur1 == cur2) {
6228 cmp = cur1 < cur2 ? -1 : 1;
6233 SvREFCNT_dec(svrecode);
6242 =for apidoc sv_cmp_locale
6244 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6245 'use bytes' aware, handles get magic, and will coerce its args to strings
6246 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6252 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6254 #ifdef USE_LOCALE_COLLATE
6260 if (PL_collation_standard)
6264 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6266 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6268 if (!pv1 || !len1) {
6279 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6282 return retval < 0 ? -1 : 1;
6285 * When the result of collation is equality, that doesn't mean
6286 * that there are no differences -- some locales exclude some
6287 * characters from consideration. So to avoid false equalities,
6288 * we use the raw string as a tiebreaker.
6294 #endif /* USE_LOCALE_COLLATE */
6296 return sv_cmp(sv1, sv2);
6300 #ifdef USE_LOCALE_COLLATE
6303 =for apidoc sv_collxfrm
6305 Add Collate Transform magic to an SV if it doesn't already have it.
6307 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6308 scalar data of the variable, but transformed to such a format that a normal
6309 memory comparison can be used to compare the data according to the locale
6316 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6320 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6321 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6327 Safefree(mg->mg_ptr);
6328 s = SvPV_const(sv, len);
6329 if ((xf = mem_collxfrm(s, len, &xlen))) {
6330 if (SvREADONLY(sv)) {
6333 return xf + sizeof(PL_collation_ix);
6336 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6337 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6350 if (mg && mg->mg_ptr) {
6352 return mg->mg_ptr + sizeof(PL_collation_ix);
6360 #endif /* USE_LOCALE_COLLATE */
6365 Get a line from the filehandle and store it into the SV, optionally
6366 appending to the currently-stored string.
6372 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6376 register STDCHAR rslast;
6377 register STDCHAR *bp;
6383 if (SvTHINKFIRST(sv))
6384 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6385 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6387 However, perlbench says it's slower, because the existing swipe code
6388 is faster than copy on write.
6389 Swings and roundabouts. */
6390 SvUPGRADE(sv, SVt_PV);
6395 if (PerlIO_isutf8(fp)) {
6397 sv_utf8_upgrade_nomg(sv);
6398 sv_pos_u2b(sv,&append,0);
6400 } else if (SvUTF8(sv)) {
6401 SV * const tsv = NEWSV(0,0);
6402 sv_gets(tsv, fp, 0);
6403 sv_utf8_upgrade_nomg(tsv);
6404 SvCUR_set(sv,append);
6407 goto return_string_or_null;
6412 if (PerlIO_isutf8(fp))
6415 if (IN_PERL_COMPILETIME) {
6416 /* we always read code in line mode */
6420 else if (RsSNARF(PL_rs)) {
6421 /* If it is a regular disk file use size from stat() as estimate
6422 of amount we are going to read - may result in malloc-ing
6423 more memory than we realy need if layers bellow reduce
6424 size we read (e.g. CRLF or a gzip layer)
6427 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6428 const Off_t offset = PerlIO_tell(fp);
6429 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6430 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6436 else if (RsRECORD(PL_rs)) {
6440 /* Grab the size of the record we're getting */
6441 recsize = SvIV(SvRV(PL_rs));
6442 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6445 /* VMS wants read instead of fread, because fread doesn't respect */
6446 /* RMS record boundaries. This is not necessarily a good thing to be */
6447 /* doing, but we've got no other real choice - except avoid stdio
6448 as implementation - perhaps write a :vms layer ?
6450 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6452 bytesread = PerlIO_read(fp, buffer, recsize);
6456 SvCUR_set(sv, bytesread += append);
6457 buffer[bytesread] = '\0';
6458 goto return_string_or_null;
6460 else if (RsPARA(PL_rs)) {
6466 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6467 if (PerlIO_isutf8(fp)) {
6468 rsptr = SvPVutf8(PL_rs, rslen);
6471 if (SvUTF8(PL_rs)) {
6472 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6473 Perl_croak(aTHX_ "Wide character in $/");
6476 rsptr = SvPV_const(PL_rs, rslen);
6480 rslast = rslen ? rsptr[rslen - 1] : '\0';
6482 if (rspara) { /* have to do this both before and after */
6483 do { /* to make sure file boundaries work right */
6486 i = PerlIO_getc(fp);
6490 PerlIO_ungetc(fp,i);
6496 /* See if we know enough about I/O mechanism to cheat it ! */
6498 /* This used to be #ifdef test - it is made run-time test for ease
6499 of abstracting out stdio interface. One call should be cheap
6500 enough here - and may even be a macro allowing compile
6504 if (PerlIO_fast_gets(fp)) {
6507 * We're going to steal some values from the stdio struct
6508 * and put EVERYTHING in the innermost loop into registers.
6510 register STDCHAR *ptr;
6514 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6515 /* An ungetc()d char is handled separately from the regular
6516 * buffer, so we getc() it back out and stuff it in the buffer.
6518 i = PerlIO_getc(fp);
6519 if (i == EOF) return 0;
6520 *(--((*fp)->_ptr)) = (unsigned char) i;
6524 /* Here is some breathtakingly efficient cheating */
6526 cnt = PerlIO_get_cnt(fp); /* get count into register */
6527 /* make sure we have the room */
6528 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6529 /* Not room for all of it
6530 if we are looking for a separator and room for some
6532 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6533 /* just process what we have room for */
6534 shortbuffered = cnt - SvLEN(sv) + append + 1;
6535 cnt -= shortbuffered;
6539 /* remember that cnt can be negative */
6540 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6545 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6546 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6547 DEBUG_P(PerlIO_printf(Perl_debug_log,
6548 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6549 DEBUG_P(PerlIO_printf(Perl_debug_log,
6550 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6551 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6552 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6557 while (cnt > 0) { /* this | eat */
6559 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6560 goto thats_all_folks; /* screams | sed :-) */
6564 Copy(ptr, bp, cnt, char); /* this | eat */
6565 bp += cnt; /* screams | dust */
6566 ptr += cnt; /* louder | sed :-) */
6571 if (shortbuffered) { /* oh well, must extend */
6572 cnt = shortbuffered;
6574 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6576 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6577 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6581 DEBUG_P(PerlIO_printf(Perl_debug_log,
6582 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6583 PTR2UV(ptr),(long)cnt));
6584 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6586 DEBUG_P(PerlIO_printf(Perl_debug_log,
6587 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6588 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6589 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6591 /* This used to call 'filbuf' in stdio form, but as that behaves like
6592 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6593 another abstraction. */
6594 i = PerlIO_getc(fp); /* get more characters */
6596 DEBUG_P(PerlIO_printf(Perl_debug_log,
6597 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6598 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6599 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6601 cnt = PerlIO_get_cnt(fp);
6602 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6603 DEBUG_P(PerlIO_printf(Perl_debug_log,
6604 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6606 if (i == EOF) /* all done for ever? */
6607 goto thats_really_all_folks;
6609 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6611 SvGROW(sv, bpx + cnt + 2);
6612 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6614 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6616 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6617 goto thats_all_folks;
6621 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6622 memNE((char*)bp - rslen, rsptr, rslen))
6623 goto screamer; /* go back to the fray */
6624 thats_really_all_folks:
6626 cnt += shortbuffered;
6627 DEBUG_P(PerlIO_printf(Perl_debug_log,
6628 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6629 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6630 DEBUG_P(PerlIO_printf(Perl_debug_log,
6631 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6632 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6633 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6635 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6636 DEBUG_P(PerlIO_printf(Perl_debug_log,
6637 "Screamer: done, len=%ld, string=|%.*s|\n",
6638 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6642 /*The big, slow, and stupid way. */
6643 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6645 Newx(buf, 8192, STDCHAR);
6653 register const STDCHAR *bpe = buf + sizeof(buf);
6655 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6656 ; /* keep reading */
6660 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6661 /* Accomodate broken VAXC compiler, which applies U8 cast to
6662 * both args of ?: operator, causing EOF to change into 255
6665 i = (U8)buf[cnt - 1];
6671 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6673 sv_catpvn(sv, (char *) buf, cnt);
6675 sv_setpvn(sv, (char *) buf, cnt);
6677 if (i != EOF && /* joy */
6679 SvCUR(sv) < rslen ||
6680 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6684 * If we're reading from a TTY and we get a short read,
6685 * indicating that the user hit his EOF character, we need
6686 * to notice it now, because if we try to read from the TTY
6687 * again, the EOF condition will disappear.
6689 * The comparison of cnt to sizeof(buf) is an optimization
6690 * that prevents unnecessary calls to feof().
6694 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6698 #ifdef USE_HEAP_INSTEAD_OF_STACK
6703 if (rspara) { /* have to do this both before and after */
6704 while (i != EOF) { /* to make sure file boundaries work right */
6705 i = PerlIO_getc(fp);
6707 PerlIO_ungetc(fp,i);
6713 return_string_or_null:
6714 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6720 Auto-increment of the value in the SV, doing string to numeric conversion
6721 if necessary. Handles 'get' magic.
6727 Perl_sv_inc(pTHX_ register SV *sv)
6735 if (SvTHINKFIRST(sv)) {
6737 sv_force_normal_flags(sv, 0);
6738 if (SvREADONLY(sv)) {
6739 if (IN_PERL_RUNTIME)
6740 Perl_croak(aTHX_ PL_no_modify);
6744 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6746 i = PTR2IV(SvRV(sv));
6751 flags = SvFLAGS(sv);
6752 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6753 /* It's (privately or publicly) a float, but not tested as an
6754 integer, so test it to see. */
6756 flags = SvFLAGS(sv);
6758 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6759 /* It's publicly an integer, or privately an integer-not-float */
6760 #ifdef PERL_PRESERVE_IVUV
6764 if (SvUVX(sv) == UV_MAX)
6765 sv_setnv(sv, UV_MAX_P1);
6767 (void)SvIOK_only_UV(sv);
6768 SvUV_set(sv, SvUVX(sv) + 1);
6770 if (SvIVX(sv) == IV_MAX)
6771 sv_setuv(sv, (UV)IV_MAX + 1);
6773 (void)SvIOK_only(sv);
6774 SvIV_set(sv, SvIVX(sv) + 1);
6779 if (flags & SVp_NOK) {
6780 (void)SvNOK_only(sv);
6781 SvNV_set(sv, SvNVX(sv) + 1.0);
6785 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6786 if ((flags & SVTYPEMASK) < SVt_PVIV)
6787 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6788 (void)SvIOK_only(sv);
6793 while (isALPHA(*d)) d++;
6794 while (isDIGIT(*d)) d++;
6796 #ifdef PERL_PRESERVE_IVUV
6797 /* Got to punt this as an integer if needs be, but we don't issue
6798 warnings. Probably ought to make the sv_iv_please() that does
6799 the conversion if possible, and silently. */
6800 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6801 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6802 /* Need to try really hard to see if it's an integer.
6803 9.22337203685478e+18 is an integer.
6804 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6805 so $a="9.22337203685478e+18"; $a+0; $a++
6806 needs to be the same as $a="9.22337203685478e+18"; $a++
6813 /* sv_2iv *should* have made this an NV */
6814 if (flags & SVp_NOK) {
6815 (void)SvNOK_only(sv);
6816 SvNV_set(sv, SvNVX(sv) + 1.0);
6819 /* I don't think we can get here. Maybe I should assert this
6820 And if we do get here I suspect that sv_setnv will croak. NWC
6822 #if defined(USE_LONG_DOUBLE)
6823 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",
6824 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6826 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6827 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6830 #endif /* PERL_PRESERVE_IVUV */
6831 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6835 while (d >= SvPVX_const(sv)) {
6843 /* MKS: The original code here died if letters weren't consecutive.
6844 * at least it didn't have to worry about non-C locales. The
6845 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6846 * arranged in order (although not consecutively) and that only
6847 * [A-Za-z] are accepted by isALPHA in the C locale.
6849 if (*d != 'z' && *d != 'Z') {
6850 do { ++*d; } while (!isALPHA(*d));
6853 *(d--) -= 'z' - 'a';
6858 *(d--) -= 'z' - 'a' + 1;
6862 /* oh,oh, the number grew */
6863 SvGROW(sv, SvCUR(sv) + 2);
6864 SvCUR_set(sv, SvCUR(sv) + 1);
6865 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
6876 Auto-decrement of the value in the SV, doing string to numeric conversion
6877 if necessary. Handles 'get' magic.
6883 Perl_sv_dec(pTHX_ register SV *sv)
6890 if (SvTHINKFIRST(sv)) {
6892 sv_force_normal_flags(sv, 0);
6893 if (SvREADONLY(sv)) {
6894 if (IN_PERL_RUNTIME)
6895 Perl_croak(aTHX_ PL_no_modify);
6899 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6901 i = PTR2IV(SvRV(sv));
6906 /* Unlike sv_inc we don't have to worry about string-never-numbers
6907 and keeping them magic. But we mustn't warn on punting */
6908 flags = SvFLAGS(sv);
6909 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6910 /* It's publicly an integer, or privately an integer-not-float */
6911 #ifdef PERL_PRESERVE_IVUV
6915 if (SvUVX(sv) == 0) {
6916 (void)SvIOK_only(sv);
6920 (void)SvIOK_only_UV(sv);
6921 SvUV_set(sv, SvUVX(sv) - 1);
6924 if (SvIVX(sv) == IV_MIN)
6925 sv_setnv(sv, (NV)IV_MIN - 1.0);
6927 (void)SvIOK_only(sv);
6928 SvIV_set(sv, SvIVX(sv) - 1);
6933 if (flags & SVp_NOK) {
6934 SvNV_set(sv, SvNVX(sv) - 1.0);
6935 (void)SvNOK_only(sv);
6938 if (!(flags & SVp_POK)) {
6939 if ((flags & SVTYPEMASK) < SVt_PVIV)
6940 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
6942 (void)SvIOK_only(sv);
6945 #ifdef PERL_PRESERVE_IVUV
6947 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6948 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6949 /* Need to try really hard to see if it's an integer.
6950 9.22337203685478e+18 is an integer.
6951 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6952 so $a="9.22337203685478e+18"; $a+0; $a--
6953 needs to be the same as $a="9.22337203685478e+18"; $a--
6960 /* sv_2iv *should* have made this an NV */
6961 if (flags & SVp_NOK) {
6962 (void)SvNOK_only(sv);
6963 SvNV_set(sv, SvNVX(sv) - 1.0);
6966 /* I don't think we can get here. Maybe I should assert this
6967 And if we do get here I suspect that sv_setnv will croak. NWC
6969 #if defined(USE_LONG_DOUBLE)
6970 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",
6971 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6973 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6974 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6978 #endif /* PERL_PRESERVE_IVUV */
6979 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
6983 =for apidoc sv_mortalcopy
6985 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6986 The new SV is marked as mortal. It will be destroyed "soon", either by an
6987 explicit call to FREETMPS, or by an implicit call at places such as
6988 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6993 /* Make a string that will exist for the duration of the expression
6994 * evaluation. Actually, it may have to last longer than that, but
6995 * hopefully we won't free it until it has been assigned to a
6996 * permanent location. */
6999 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7004 sv_setsv(sv,oldstr);
7006 PL_tmps_stack[++PL_tmps_ix] = sv;
7012 =for apidoc sv_newmortal
7014 Creates a new null SV which is mortal. The reference count of the SV is
7015 set to 1. It will be destroyed "soon", either by an explicit call to
7016 FREETMPS, or by an implicit call at places such as statement boundaries.
7017 See also C<sv_mortalcopy> and C<sv_2mortal>.
7023 Perl_sv_newmortal(pTHX)
7028 SvFLAGS(sv) = SVs_TEMP;
7030 PL_tmps_stack[++PL_tmps_ix] = sv;
7035 =for apidoc sv_2mortal
7037 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7038 by an explicit call to FREETMPS, or by an implicit call at places such as
7039 statement boundaries. SvTEMP() is turned on which means that the SV's
7040 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7041 and C<sv_mortalcopy>.
7047 Perl_sv_2mortal(pTHX_ register SV *sv)
7052 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7055 PL_tmps_stack[++PL_tmps_ix] = sv;
7063 Creates a new SV and copies a string into it. The reference count for the
7064 SV is set to 1. If C<len> is zero, Perl will compute the length using
7065 strlen(). For efficiency, consider using C<newSVpvn> instead.
7071 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7076 sv_setpvn(sv,s,len ? len : strlen(s));
7081 =for apidoc newSVpvn
7083 Creates a new SV and copies a string into it. The reference count for the
7084 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7085 string. You are responsible for ensuring that the source string is at least
7086 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7092 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7097 sv_setpvn(sv,s,len);
7103 =for apidoc newSVhek
7105 Creates a new SV from the hash key structure. It will generate scalars that
7106 point to the shared string table where possible. Returns a new (undefined)
7107 SV if the hek is NULL.
7113 Perl_newSVhek(pTHX_ const HEK *hek)
7122 if (HEK_LEN(hek) == HEf_SVKEY) {
7123 return newSVsv(*(SV**)HEK_KEY(hek));
7125 const int flags = HEK_FLAGS(hek);
7126 if (flags & HVhek_WASUTF8) {
7128 Andreas would like keys he put in as utf8 to come back as utf8
7130 STRLEN utf8_len = HEK_LEN(hek);
7131 const U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7132 SV * const sv = newSVpvn ((const char*)as_utf8, utf8_len);
7135 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7137 } else if (flags & HVhek_REHASH) {
7138 /* We don't have a pointer to the hv, so we have to replicate the
7139 flag into every HEK. This hv is using custom a hasing
7140 algorithm. Hence we can't return a shared string scalar, as
7141 that would contain the (wrong) hash value, and might get passed
7142 into an hv routine with a regular hash */
7144 SV * const sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7149 /* This will be overwhelminly the most common case. */
7150 return newSVpvn_share(HEK_KEY(hek),
7151 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7157 =for apidoc newSVpvn_share
7159 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7160 table. If the string does not already exist in the table, it is created
7161 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7162 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7163 otherwise the hash is computed. The idea here is that as the string table
7164 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7165 hash lookup will avoid string compare.
7171 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7174 bool is_utf8 = FALSE;
7176 STRLEN tmplen = -len;
7178 /* See the note in hv.c:hv_fetch() --jhi */
7179 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7183 PERL_HASH(hash, src, len);
7185 sv_upgrade(sv, SVt_PV);
7186 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7198 #if defined(PERL_IMPLICIT_CONTEXT)
7200 /* pTHX_ magic can't cope with varargs, so this is a no-context
7201 * version of the main function, (which may itself be aliased to us).
7202 * Don't access this version directly.
7206 Perl_newSVpvf_nocontext(const char* pat, ...)
7211 va_start(args, pat);
7212 sv = vnewSVpvf(pat, &args);
7219 =for apidoc newSVpvf
7221 Creates a new SV and initializes it with the string formatted like
7228 Perl_newSVpvf(pTHX_ const char* pat, ...)
7232 va_start(args, pat);
7233 sv = vnewSVpvf(pat, &args);
7238 /* backend for newSVpvf() and newSVpvf_nocontext() */
7241 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7245 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7252 Creates a new SV and copies a floating point value into it.
7253 The reference count for the SV is set to 1.
7259 Perl_newSVnv(pTHX_ NV n)
7271 Creates a new SV and copies an integer into it. The reference count for the
7278 Perl_newSViv(pTHX_ IV i)
7290 Creates a new SV and copies an unsigned integer into it.
7291 The reference count for the SV is set to 1.
7297 Perl_newSVuv(pTHX_ UV u)
7307 =for apidoc newRV_noinc
7309 Creates an RV wrapper for an SV. The reference count for the original
7310 SV is B<not> incremented.
7316 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7321 sv_upgrade(sv, SVt_RV);
7323 SvRV_set(sv, tmpRef);
7328 /* newRV_inc is the official function name to use now.
7329 * newRV_inc is in fact #defined to newRV in sv.h
7333 Perl_newRV(pTHX_ SV *tmpRef)
7335 return newRV_noinc(SvREFCNT_inc(tmpRef));
7341 Creates a new SV which is an exact duplicate of the original SV.
7348 Perl_newSVsv(pTHX_ register SV *old)
7354 if (SvTYPE(old) == SVTYPEMASK) {
7355 if (ckWARN_d(WARN_INTERNAL))
7356 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7360 /* SV_GMAGIC is the default for sv_setv()
7361 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7362 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7363 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7368 =for apidoc sv_reset
7370 Underlying implementation for the C<reset> Perl function.
7371 Note that the perl-level function is vaguely deprecated.
7377 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7380 char todo[PERL_UCHAR_MAX+1];
7385 if (!*s) { /* reset ?? searches */
7386 MAGIC * const mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7388 PMOP *pm = (PMOP *) mg->mg_obj;
7390 pm->op_pmdynflags &= ~PMdf_USED;
7397 /* reset variables */
7399 if (!HvARRAY(stash))
7402 Zero(todo, 256, char);
7405 I32 i = (unsigned char)*s;
7409 max = (unsigned char)*s++;
7410 for ( ; i <= max; i++) {
7413 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7415 for (entry = HvARRAY(stash)[i];
7417 entry = HeNEXT(entry))
7422 if (!todo[(U8)*HeKEY(entry)])
7424 gv = (GV*)HeVAL(entry);
7427 if (SvTHINKFIRST(sv)) {
7428 if (!SvREADONLY(sv) && SvROK(sv))
7430 /* XXX Is this continue a bug? Why should THINKFIRST
7431 exempt us from resetting arrays and hashes? */
7435 if (SvTYPE(sv) >= SVt_PV) {
7437 if (SvPVX_const(sv) != Nullch)
7445 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7448 #ifdef USE_ENVIRON_ARRAY
7450 # ifdef USE_ITHREADS
7451 && PL_curinterp == aTHX
7455 environ[0] = Nullch;
7458 #endif /* !PERL_MICRO */
7468 Using various gambits, try to get an IO from an SV: the IO slot if its a
7469 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7470 named after the PV if we're a string.
7476 Perl_sv_2io(pTHX_ SV *sv)
7481 switch (SvTYPE(sv)) {
7489 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7493 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7495 return sv_2io(SvRV(sv));
7496 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7502 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7511 Using various gambits, try to get a CV from an SV; in addition, try if
7512 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7518 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7525 return *gvp = Nullgv, Nullcv;
7526 switch (SvTYPE(sv)) {
7544 SV * const *sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7545 tryAMAGICunDEREF(to_cv);
7548 if (SvTYPE(sv) == SVt_PVCV) {
7557 Perl_croak(aTHX_ "Not a subroutine reference");
7562 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7568 if (lref && !GvCVu(gv)) {
7571 tmpsv = NEWSV(704,0);
7572 gv_efullname3(tmpsv, gv, Nullch);
7573 /* XXX this is probably not what they think they're getting.
7574 * It has the same effect as "sub name;", i.e. just a forward
7576 newSUB(start_subparse(FALSE, 0),
7577 newSVOP(OP_CONST, 0, tmpsv),
7582 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7592 Returns true if the SV has a true value by Perl's rules.
7593 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7594 instead use an in-line version.
7600 Perl_sv_true(pTHX_ register SV *sv)
7605 register const XPV* const tXpv = (XPV*)SvANY(sv);
7607 (tXpv->xpv_cur > 1 ||
7608 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7615 return SvIVX(sv) != 0;
7618 return SvNVX(sv) != 0.0;
7620 return sv_2bool(sv);
7626 =for apidoc sv_pvn_force
7628 Get a sensible string out of the SV somehow.
7629 A private implementation of the C<SvPV_force> macro for compilers which
7630 can't cope with complex macro expressions. Always use the macro instead.
7632 =for apidoc sv_pvn_force_flags
7634 Get a sensible string out of the SV somehow.
7635 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7636 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7637 implemented in terms of this function.
7638 You normally want to use the various wrapper macros instead: see
7639 C<SvPV_force> and C<SvPV_force_nomg>
7645 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7648 if (SvTHINKFIRST(sv) && !SvROK(sv))
7649 sv_force_normal_flags(sv, 0);
7659 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7660 const char * const ref = sv_reftype(sv,0);
7662 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7663 ref, OP_NAME(PL_op));
7665 Perl_croak(aTHX_ "Can't coerce readonly %s to string", ref);
7667 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM)
7668 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7670 s = sv_2pv_flags(sv, &len, flags);
7674 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7677 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7678 SvGROW(sv, len + 1);
7679 Move(s,SvPVX(sv),len,char);
7684 SvPOK_on(sv); /* validate pointer */
7686 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7687 PTR2UV(sv),SvPVX_const(sv)));
7690 return SvPVX_mutable(sv);
7694 =for apidoc sv_pvbyten_force
7696 The backend for the C<SvPVbytex_force> macro. Always use the macro instead.
7702 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7704 sv_pvn_force(sv,lp);
7705 sv_utf8_downgrade(sv,0);
7711 =for apidoc sv_pvutf8n_force
7713 The backend for the C<SvPVutf8x_force> macro. Always use the macro instead.
7719 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7721 sv_pvn_force(sv,lp);
7722 sv_utf8_upgrade(sv);
7728 =for apidoc sv_reftype
7730 Returns a string describing what the SV is a reference to.
7736 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
7738 /* The fact that I don't need to downcast to char * everywhere, only in ?:
7739 inside return suggests a const propagation bug in g++. */
7740 if (ob && SvOBJECT(sv)) {
7741 char * const name = HvNAME_get(SvSTASH(sv));
7742 return name ? name : (char *) "__ANON__";
7745 switch (SvTYPE(sv)) {
7762 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
7763 /* tied lvalues should appear to be
7764 * scalars for backwards compatitbility */
7765 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7766 ? "SCALAR" : "LVALUE");
7767 case SVt_PVAV: return "ARRAY";
7768 case SVt_PVHV: return "HASH";
7769 case SVt_PVCV: return "CODE";
7770 case SVt_PVGV: return "GLOB";
7771 case SVt_PVFM: return "FORMAT";
7772 case SVt_PVIO: return "IO";
7773 default: return "UNKNOWN";
7779 =for apidoc sv_isobject
7781 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7782 object. If the SV is not an RV, or if the object is not blessed, then this
7789 Perl_sv_isobject(pTHX_ SV *sv)
7805 Returns a boolean indicating whether the SV is blessed into the specified
7806 class. This does not check for subtypes; use C<sv_derived_from> to verify
7807 an inheritance relationship.
7813 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7824 hvname = HvNAME_get(SvSTASH(sv));
7828 return strEQ(hvname, name);
7834 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7835 it will be upgraded to one. If C<classname> is non-null then the new SV will
7836 be blessed in the specified package. The new SV is returned and its
7837 reference count is 1.
7843 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7849 SV_CHECK_THINKFIRST_COW_DROP(rv);
7852 if (SvTYPE(rv) >= SVt_PVMG) {
7853 const U32 refcnt = SvREFCNT(rv);
7857 SvREFCNT(rv) = refcnt;
7860 if (SvTYPE(rv) < SVt_RV)
7861 sv_upgrade(rv, SVt_RV);
7862 else if (SvTYPE(rv) > SVt_RV) {
7873 HV* const stash = gv_stashpv(classname, TRUE);
7874 (void)sv_bless(rv, stash);
7880 =for apidoc sv_setref_pv
7882 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7883 argument will be upgraded to an RV. That RV will be modified to point to
7884 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7885 into the SV. The C<classname> argument indicates the package for the
7886 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7887 will have a reference count of 1, and the RV will be returned.
7889 Do not use with other Perl types such as HV, AV, SV, CV, because those
7890 objects will become corrupted by the pointer copy process.
7892 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7898 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7901 sv_setsv(rv, &PL_sv_undef);
7905 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7910 =for apidoc sv_setref_iv
7912 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7913 argument will be upgraded to an RV. That RV will be modified to point to
7914 the new SV. The C<classname> argument indicates the package for the
7915 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7916 will have a reference count of 1, and the RV will be returned.
7922 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7924 sv_setiv(newSVrv(rv,classname), iv);
7929 =for apidoc sv_setref_uv
7931 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7932 argument will be upgraded to an RV. That RV will be modified to point to
7933 the new SV. The C<classname> argument indicates the package for the
7934 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7935 will have a reference count of 1, and the RV will be returned.
7941 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7943 sv_setuv(newSVrv(rv,classname), uv);
7948 =for apidoc sv_setref_nv
7950 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7951 argument will be upgraded to an RV. That RV will be modified to point to
7952 the new SV. The C<classname> argument indicates the package for the
7953 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7954 will have a reference count of 1, and the RV will be returned.
7960 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7962 sv_setnv(newSVrv(rv,classname), nv);
7967 =for apidoc sv_setref_pvn
7969 Copies a string into a new SV, optionally blessing the SV. The length of the
7970 string must be specified with C<n>. The C<rv> argument will be upgraded to
7971 an RV. That RV will be modified to point to the new SV. The C<classname>
7972 argument indicates the package for the blessing. Set C<classname> to
7973 C<Nullch> to avoid the blessing. The new SV will have a reference count
7974 of 1, and the RV will be returned.
7976 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7982 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
7984 sv_setpvn(newSVrv(rv,classname), pv, n);
7989 =for apidoc sv_bless
7991 Blesses an SV into a specified package. The SV must be an RV. The package
7992 must be designated by its stash (see C<gv_stashpv()>). The reference count
7993 of the SV is unaffected.
7999 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8003 Perl_croak(aTHX_ "Can't bless non-reference value");
8005 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8006 if (SvREADONLY(tmpRef))
8007 Perl_croak(aTHX_ PL_no_modify);
8008 if (SvOBJECT(tmpRef)) {
8009 if (SvTYPE(tmpRef) != SVt_PVIO)
8011 SvREFCNT_dec(SvSTASH(tmpRef));
8014 SvOBJECT_on(tmpRef);
8015 if (SvTYPE(tmpRef) != SVt_PVIO)
8017 SvUPGRADE(tmpRef, SVt_PVMG);
8018 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8025 if(SvSMAGICAL(tmpRef))
8026 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8034 /* Downgrades a PVGV to a PVMG.
8038 S_sv_unglob(pTHX_ SV *sv)
8042 assert(SvTYPE(sv) == SVt_PVGV);
8047 sv_del_backref((SV*)GvSTASH(sv), sv);
8048 GvSTASH(sv) = Nullhv;
8050 sv_unmagic(sv, PERL_MAGIC_glob);
8051 Safefree(GvNAME(sv));
8054 /* need to keep SvANY(sv) in the right arena */
8055 xpvmg = new_XPVMG();
8056 StructCopy(SvANY(sv), xpvmg, XPVMG);
8057 del_XPVGV(SvANY(sv));
8060 SvFLAGS(sv) &= ~SVTYPEMASK;
8061 SvFLAGS(sv) |= SVt_PVMG;
8065 =for apidoc sv_unref_flags
8067 Unsets the RV status of the SV, and decrements the reference count of
8068 whatever was being referenced by the RV. This can almost be thought of
8069 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8070 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8071 (otherwise the decrementing is conditional on the reference count being
8072 different from one or the reference being a readonly SV).
8079 Perl_sv_unref_flags(pTHX_ SV *ref, U32 flags)
8081 SV* const target = SvRV(ref);
8083 if (SvWEAKREF(ref)) {
8084 sv_del_backref(target, ref);
8086 SvRV_set(ref, NULL);
8089 SvRV_set(ref, NULL);
8091 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
8092 assigned to as BEGIN {$a = \"Foo"} will fail. */
8093 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
8094 SvREFCNT_dec(target);
8095 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8096 sv_2mortal(target); /* Schedule for freeing later */
8100 =for apidoc sv_untaint
8102 Untaint an SV. Use C<SvTAINTED_off> instead.
8107 Perl_sv_untaint(pTHX_ SV *sv)
8109 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8110 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8117 =for apidoc sv_tainted
8119 Test an SV for taintedness. Use C<SvTAINTED> instead.
8124 Perl_sv_tainted(pTHX_ SV *sv)
8126 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8127 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8128 if (mg && (mg->mg_len & 1) )
8135 =for apidoc sv_setpviv
8137 Copies an integer into the given SV, also updating its string value.
8138 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8144 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8146 char buf[TYPE_CHARS(UV)];
8148 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8150 sv_setpvn(sv, ptr, ebuf - ptr);
8154 =for apidoc sv_setpviv_mg
8156 Like C<sv_setpviv>, but also handles 'set' magic.
8162 Perl_sv_setpviv_mg(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 #if defined(PERL_IMPLICIT_CONTEXT)
8174 /* pTHX_ magic can't cope with varargs, so this is a no-context
8175 * version of the main function, (which may itself be aliased to us).
8176 * Don't access this version directly.
8180 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8184 va_start(args, pat);
8185 sv_vsetpvf(sv, pat, &args);
8189 /* pTHX_ magic can't cope with varargs, so this is a no-context
8190 * version of the main function, (which may itself be aliased to us).
8191 * Don't access this version directly.
8195 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8199 va_start(args, pat);
8200 sv_vsetpvf_mg(sv, pat, &args);
8206 =for apidoc sv_setpvf
8208 Works like C<sv_catpvf> but copies the text into the SV instead of
8209 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8215 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8218 va_start(args, pat);
8219 sv_vsetpvf(sv, pat, &args);
8224 =for apidoc sv_vsetpvf
8226 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8227 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8229 Usually used via its frontend C<sv_setpvf>.
8235 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8237 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8241 =for apidoc sv_setpvf_mg
8243 Like C<sv_setpvf>, but also handles 'set' magic.
8249 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8252 va_start(args, pat);
8253 sv_vsetpvf_mg(sv, pat, &args);
8258 =for apidoc sv_vsetpvf_mg
8260 Like C<sv_vsetpvf>, but also handles 'set' magic.
8262 Usually used via its frontend C<sv_setpvf_mg>.
8268 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8270 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8274 #if defined(PERL_IMPLICIT_CONTEXT)
8276 /* pTHX_ magic can't cope with varargs, so this is a no-context
8277 * version of the main function, (which may itself be aliased to us).
8278 * Don't access this version directly.
8282 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8286 va_start(args, pat);
8287 sv_vcatpvf(sv, pat, &args);
8291 /* pTHX_ magic can't cope with varargs, so this is a no-context
8292 * version of the main function, (which may itself be aliased to us).
8293 * Don't access this version directly.
8297 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8301 va_start(args, pat);
8302 sv_vcatpvf_mg(sv, pat, &args);
8308 =for apidoc sv_catpvf
8310 Processes its arguments like C<sprintf> and appends the formatted
8311 output to an SV. If the appended data contains "wide" characters
8312 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8313 and characters >255 formatted with %c), the original SV might get
8314 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8315 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8316 valid UTF-8; if the original SV was bytes, the pattern should be too.
8321 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8324 va_start(args, pat);
8325 sv_vcatpvf(sv, pat, &args);
8330 =for apidoc sv_vcatpvf
8332 Processes its arguments like C<vsprintf> and appends the formatted output
8333 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8335 Usually used via its frontend C<sv_catpvf>.
8341 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8343 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8347 =for apidoc sv_catpvf_mg
8349 Like C<sv_catpvf>, but also handles 'set' magic.
8355 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8358 va_start(args, pat);
8359 sv_vcatpvf_mg(sv, pat, &args);
8364 =for apidoc sv_vcatpvf_mg
8366 Like C<sv_vcatpvf>, but also handles 'set' magic.
8368 Usually used via its frontend C<sv_catpvf_mg>.
8374 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8376 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8381 =for apidoc sv_vsetpvfn
8383 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8386 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8392 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8394 sv_setpvn(sv, "", 0);
8395 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8398 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8401 S_expect_number(pTHX_ char** pattern)
8404 switch (**pattern) {
8405 case '1': case '2': case '3':
8406 case '4': case '5': case '6':
8407 case '7': case '8': case '9':
8408 while (isDIGIT(**pattern))
8409 var = var * 10 + (*(*pattern)++ - '0');
8413 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8416 F0convert(NV nv, char *endbuf, STRLEN *len)
8418 const int neg = nv < 0;
8427 if (uv & 1 && uv == nv)
8428 uv--; /* Round to even */
8430 const unsigned dig = uv % 10;
8443 =for apidoc sv_vcatpvfn
8445 Processes its arguments like C<vsprintf> and appends the formatted output
8446 to an SV. Uses an array of SVs if the C style variable argument list is
8447 missing (NULL). When running with taint checks enabled, indicates via
8448 C<maybe_tainted> if results are untrustworthy (often due to the use of
8451 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8457 #define VECTORIZE_ARGS vecsv = va_arg(*args, SV*);\
8458 vecstr = (U8*)SvPV_const(vecsv,veclen);\
8459 vec_utf8 = DO_UTF8(vecsv);
8461 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8464 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8471 static const char nullstr[] = "(null)";
8473 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8474 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8476 /* Times 4: a decimal digit takes more than 3 binary digits.
8477 * NV_DIG: mantissa takes than many decimal digits.
8478 * Plus 32: Playing safe. */
8479 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8480 /* large enough for "%#.#f" --chip */
8481 /* what about long double NVs? --jhi */
8483 PERL_UNUSED_ARG(maybe_tainted);
8485 /* no matter what, this is a string now */
8486 (void)SvPV_force(sv, origlen);
8488 /* special-case "", "%s", and "%-p" (SVf - see below) */
8491 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8493 const char * const s = va_arg(*args, char*);
8494 sv_catpv(sv, s ? s : nullstr);
8496 else if (svix < svmax) {
8497 sv_catsv(sv, *svargs);
8498 if (DO_UTF8(*svargs))
8503 if (args && patlen == 3 && pat[0] == '%' &&
8504 pat[1] == '-' && pat[2] == 'p') {
8505 argsv = va_arg(*args, SV*);
8506 sv_catsv(sv, argsv);
8512 #ifndef USE_LONG_DOUBLE
8513 /* special-case "%.<number>[gf]" */
8514 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8515 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8516 unsigned digits = 0;
8520 while (*pp >= '0' && *pp <= '9')
8521 digits = 10 * digits + (*pp++ - '0');
8522 if (pp - pat == (int)patlen - 1) {
8530 /* Add check for digits != 0 because it seems that some
8531 gconverts are buggy in this case, and we don't yet have
8532 a Configure test for this. */
8533 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8534 /* 0, point, slack */
8535 Gconvert(nv, (int)digits, 0, ebuf);
8537 if (*ebuf) /* May return an empty string for digits==0 */
8540 } else if (!digits) {
8543 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8544 sv_catpvn(sv, p, l);
8550 #endif /* !USE_LONG_DOUBLE */
8552 if (!args && svix < svmax && DO_UTF8(*svargs))
8555 patend = (char*)pat + patlen;
8556 for (p = (char*)pat; p < patend; p = q) {
8559 bool vectorize = FALSE;
8560 bool vectorarg = FALSE;
8561 bool vec_utf8 = FALSE;
8567 bool has_precis = FALSE;
8570 bool is_utf8 = FALSE; /* is this item utf8? */
8571 #ifdef HAS_LDBL_SPRINTF_BUG
8572 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8573 with sfio - Allen <allens@cpan.org> */
8574 bool fix_ldbl_sprintf_bug = FALSE;
8578 U8 utf8buf[UTF8_MAXBYTES+1];
8579 STRLEN esignlen = 0;
8581 const char *eptr = Nullch;
8584 const U8 *vecstr = Null(U8*);
8591 /* we need a long double target in case HAS_LONG_DOUBLE but
8594 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8602 const char *dotstr = ".";
8603 STRLEN dotstrlen = 1;
8604 I32 efix = 0; /* explicit format parameter index */
8605 I32 ewix = 0; /* explicit width index */
8606 I32 epix = 0; /* explicit precision index */
8607 I32 evix = 0; /* explicit vector index */
8608 bool asterisk = FALSE;
8610 /* echo everything up to the next format specification */
8611 for (q = p; q < patend && *q != '%'; ++q) ;
8613 if (has_utf8 && !pat_utf8)
8614 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8616 sv_catpvn(sv, p, q - p);
8623 We allow format specification elements in this order:
8624 \d+\$ explicit format parameter index
8626 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8627 0 flag (as above): repeated to allow "v02"
8628 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8629 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8631 [%bcdefginopsuxDFOUX] format (mandatory)
8636 As of perl5.9.3, printf format checking is on by default.
8637 Internally, perl uses %p formats to provide an escape to
8638 some extended formatting. This block deals with those
8639 extensions: if it does not match, (char*)q is reset and
8640 the normal format processing code is used.
8642 Currently defined extensions are:
8643 %p include pointer address (standard)
8644 %-p (SVf) include an SV (previously %_)
8645 %-<num>p include an SV with precision <num>
8646 %1p (VDf) include a v-string (as %vd)
8647 %<num>p reserved for future extensions
8649 Robin Barker 2005-07-14
8656 EXPECT_NUMBER(q, n);
8663 argsv = va_arg(*args, SV*);
8664 eptr = SvPVx_const(argsv, elen);
8670 else if (n == vdNUMBER) { /* VDf */
8677 if (ckWARN_d(WARN_INTERNAL))
8678 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
8679 "internal %%<num>p might conflict with future printf extensions");
8685 if (EXPECT_NUMBER(q, width)) {
8726 if (EXPECT_NUMBER(q, ewix))
8735 if ((vectorarg = asterisk)) {
8748 EXPECT_NUMBER(q, width);
8754 vecsv = va_arg(*args, SV*);
8756 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8757 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8758 dotstr = SvPV_const(vecsv, dotstrlen);
8765 else if (efix ? efix <= svmax : svix < svmax) {
8766 vecsv = svargs[efix ? efix-1 : svix++];
8767 vecstr = (U8*)SvPV_const(vecsv,veclen);
8768 vec_utf8 = DO_UTF8(vecsv);
8769 /* if this is a version object, we need to return the
8770 * stringified representation (which the SvPVX_const has
8771 * already done for us), but not vectorize the args
8773 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
8775 q++; /* skip past the rest of the %vd format */
8776 eptr = (const char *) vecstr;
8777 elen = strlen(eptr);
8790 i = va_arg(*args, int);
8792 i = (ewix ? ewix <= svmax : svix < svmax) ?
8793 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8795 width = (i < 0) ? -i : i;
8805 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8807 /* XXX: todo, support specified precision parameter */
8811 i = va_arg(*args, int);
8813 i = (ewix ? ewix <= svmax : svix < svmax)
8814 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8815 precis = (i < 0) ? 0 : i;
8820 precis = precis * 10 + (*q++ - '0');
8829 case 'I': /* Ix, I32x, and I64x */
8831 if (q[1] == '6' && q[2] == '4') {
8837 if (q[1] == '3' && q[2] == '2') {
8847 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8858 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8859 if (*(q + 1) == 'l') { /* lld, llf */
8884 argsv = (efix ? efix <= svmax : svix < svmax) ?
8885 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8892 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8894 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8896 eptr = (char*)utf8buf;
8897 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8908 if (args && !vectorize) {
8909 eptr = va_arg(*args, char*);
8911 #ifdef MACOS_TRADITIONAL
8912 /* On MacOS, %#s format is used for Pascal strings */
8917 elen = strlen(eptr);
8919 eptr = (char *)nullstr;
8920 elen = sizeof nullstr - 1;
8924 eptr = SvPVx_const(argsv, elen);
8925 if (DO_UTF8(argsv)) {
8926 if (has_precis && precis < elen) {
8928 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8931 if (width) { /* fudge width (can't fudge elen) */
8932 width += elen - sv_len_utf8(argsv);
8940 if (has_precis && elen > precis)
8947 if (alt || vectorize)
8949 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8970 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8979 esignbuf[esignlen++] = plus;
8983 case 'h': iv = (short)va_arg(*args, int); break;
8984 case 'l': iv = va_arg(*args, long); break;
8985 case 'V': iv = va_arg(*args, IV); break;
8986 default: iv = va_arg(*args, int); break;
8988 case 'q': iv = va_arg(*args, Quad_t); break;
8993 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
8995 case 'h': iv = (short)tiv; break;
8996 case 'l': iv = (long)tiv; break;
8998 default: iv = tiv; break;
9000 case 'q': iv = (Quad_t)tiv; break;
9004 if ( !vectorize ) /* we already set uv above */
9009 esignbuf[esignlen++] = plus;
9013 esignbuf[esignlen++] = '-';
9056 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9067 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9068 case 'l': uv = va_arg(*args, unsigned long); break;
9069 case 'V': uv = va_arg(*args, UV); break;
9070 default: uv = va_arg(*args, unsigned); break;
9072 case 'q': uv = va_arg(*args, Uquad_t); break;
9077 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9079 case 'h': uv = (unsigned short)tuv; break;
9080 case 'l': uv = (unsigned long)tuv; break;
9082 default: uv = tuv; break;
9084 case 'q': uv = (Uquad_t)tuv; break;
9091 char *ptr = ebuf + sizeof ebuf;
9097 p = (char*)((c == 'X')
9098 ? "0123456789ABCDEF" : "0123456789abcdef");
9104 esignbuf[esignlen++] = '0';
9105 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9113 if (alt && *ptr != '0')
9122 esignbuf[esignlen++] = '0';
9123 esignbuf[esignlen++] = 'b';
9126 default: /* it had better be ten or less */
9130 } while (uv /= base);
9133 elen = (ebuf + sizeof ebuf) - ptr;
9137 zeros = precis - elen;
9138 else if (precis == 0 && elen == 1 && *eptr == '0')
9144 /* FLOATING POINT */
9147 c = 'f'; /* maybe %F isn't supported here */
9153 /* This is evil, but floating point is even more evil */
9155 /* for SV-style calling, we can only get NV
9156 for C-style calling, we assume %f is double;
9157 for simplicity we allow any of %Lf, %llf, %qf for long double
9161 #if defined(USE_LONG_DOUBLE)
9165 /* [perl #20339] - we should accept and ignore %lf rather than die */
9169 #if defined(USE_LONG_DOUBLE)
9170 intsize = args ? 0 : 'q';
9174 #if defined(HAS_LONG_DOUBLE)
9183 /* now we need (long double) if intsize == 'q', else (double) */
9184 nv = (args && !vectorize) ?
9185 #if LONG_DOUBLESIZE > DOUBLESIZE
9187 va_arg(*args, long double) :
9188 va_arg(*args, double)
9190 va_arg(*args, double)
9196 if (c != 'e' && c != 'E') {
9198 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9199 will cast our (long double) to (double) */
9200 (void)Perl_frexp(nv, &i);
9201 if (i == PERL_INT_MIN)
9202 Perl_die(aTHX_ "panic: frexp");
9204 need = BIT_DIGITS(i);
9206 need += has_precis ? precis : 6; /* known default */
9211 #ifdef HAS_LDBL_SPRINTF_BUG
9212 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9213 with sfio - Allen <allens@cpan.org> */
9216 # define MY_DBL_MAX DBL_MAX
9217 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9218 # if DOUBLESIZE >= 8
9219 # define MY_DBL_MAX 1.7976931348623157E+308L
9221 # define MY_DBL_MAX 3.40282347E+38L
9225 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9226 # define MY_DBL_MAX_BUG 1L
9228 # define MY_DBL_MAX_BUG MY_DBL_MAX
9232 # define MY_DBL_MIN DBL_MIN
9233 # else /* XXX guessing! -Allen */
9234 # if DOUBLESIZE >= 8
9235 # define MY_DBL_MIN 2.2250738585072014E-308L
9237 # define MY_DBL_MIN 1.17549435E-38L
9241 if ((intsize == 'q') && (c == 'f') &&
9242 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9244 /* it's going to be short enough that
9245 * long double precision is not needed */
9247 if ((nv <= 0L) && (nv >= -0L))
9248 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9250 /* would use Perl_fp_class as a double-check but not
9251 * functional on IRIX - see perl.h comments */
9253 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9254 /* It's within the range that a double can represent */
9255 #if defined(DBL_MAX) && !defined(DBL_MIN)
9256 if ((nv >= ((long double)1/DBL_MAX)) ||
9257 (nv <= (-(long double)1/DBL_MAX)))
9259 fix_ldbl_sprintf_bug = TRUE;
9262 if (fix_ldbl_sprintf_bug == TRUE) {
9272 # undef MY_DBL_MAX_BUG
9275 #endif /* HAS_LDBL_SPRINTF_BUG */
9277 need += 20; /* fudge factor */
9278 if (PL_efloatsize < need) {
9279 Safefree(PL_efloatbuf);
9280 PL_efloatsize = need + 20; /* more fudge */
9281 Newx(PL_efloatbuf, PL_efloatsize, char);
9282 PL_efloatbuf[0] = '\0';
9285 if ( !(width || left || plus || alt) && fill != '0'
9286 && has_precis && intsize != 'q' ) { /* Shortcuts */
9287 /* See earlier comment about buggy Gconvert when digits,
9289 if ( c == 'g' && precis) {
9290 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9291 /* May return an empty string for digits==0 */
9292 if (*PL_efloatbuf) {
9293 elen = strlen(PL_efloatbuf);
9294 goto float_converted;
9296 } else if ( c == 'f' && !precis) {
9297 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9302 char *ptr = ebuf + sizeof ebuf;
9305 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9306 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9307 if (intsize == 'q') {
9308 /* Copy the one or more characters in a long double
9309 * format before the 'base' ([efgEFG]) character to
9310 * the format string. */
9311 static char const prifldbl[] = PERL_PRIfldbl;
9312 char const *p = prifldbl + sizeof(prifldbl) - 3;
9313 while (p >= prifldbl) { *--ptr = *p--; }
9318 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9323 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9335 /* No taint. Otherwise we are in the strange situation
9336 * where printf() taints but print($float) doesn't.
9338 #if defined(HAS_LONG_DOUBLE)
9339 elen = ((intsize == 'q')
9340 ? my_sprintf(PL_efloatbuf, ptr, nv)
9341 : my_sprintf(PL_efloatbuf, ptr, (double)nv));
9343 elen = my_sprintf(PL_efloatbuf, ptr, nv);
9347 eptr = PL_efloatbuf;
9353 i = SvCUR(sv) - origlen;
9354 if (args && !vectorize) {
9356 case 'h': *(va_arg(*args, short*)) = i; break;
9357 default: *(va_arg(*args, int*)) = i; break;
9358 case 'l': *(va_arg(*args, long*)) = i; break;
9359 case 'V': *(va_arg(*args, IV*)) = i; break;
9361 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9366 sv_setuv_mg(argsv, (UV)i);
9368 continue; /* not "break" */
9375 && (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)
9376 && ckWARN(WARN_PRINTF))
9378 SV *msg = sv_newmortal();
9379 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9380 (PL_op->op_type == OP_PRTF) ? "" : "s");
9383 Perl_sv_catpvf(aTHX_ msg,
9384 "\"%%%c\"", c & 0xFF);
9386 Perl_sv_catpvf(aTHX_ msg,
9387 "\"%%\\%03"UVof"\"",
9390 sv_catpv(msg, "end of string");
9391 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9394 /* output mangled stuff ... */
9400 /* ... right here, because formatting flags should not apply */
9401 SvGROW(sv, SvCUR(sv) + elen + 1);
9403 Copy(eptr, p, elen, char);
9406 SvCUR_set(sv, p - SvPVX_const(sv));
9408 continue; /* not "break" */
9411 /* calculate width before utf8_upgrade changes it */
9412 have = esignlen + zeros + elen;
9414 if (is_utf8 != has_utf8) {
9417 sv_utf8_upgrade(sv);
9420 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
9421 sv_utf8_upgrade(nsv);
9422 eptr = SvPVX_const(nsv);
9425 SvGROW(sv, SvCUR(sv) + elen + 1);
9430 need = (have > width ? have : width);
9433 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9435 if (esignlen && fill == '0') {
9437 for (i = 0; i < (int)esignlen; i++)
9441 memset(p, fill, gap);
9444 if (esignlen && fill != '0') {
9446 for (i = 0; i < (int)esignlen; i++)
9451 for (i = zeros; i; i--)
9455 Copy(eptr, p, elen, char);
9459 memset(p, ' ', gap);
9464 Copy(dotstr, p, dotstrlen, char);
9468 vectorize = FALSE; /* done iterating over vecstr */
9475 SvCUR_set(sv, p - SvPVX_const(sv));
9483 /* =========================================================================
9485 =head1 Cloning an interpreter
9487 All the macros and functions in this section are for the private use of
9488 the main function, perl_clone().
9490 The foo_dup() functions make an exact copy of an existing foo thinngy.
9491 During the course of a cloning, a hash table is used to map old addresses
9492 to new addresses. The table is created and manipulated with the
9493 ptr_table_* functions.
9497 ============================================================================*/
9500 #if defined(USE_ITHREADS)
9502 #ifndef GpREFCNT_inc
9503 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9507 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9508 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9509 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9510 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9511 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9512 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9513 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9514 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9515 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9516 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9517 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9518 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9519 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9522 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9523 regcomp.c. AMS 20010712 */
9526 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
9531 struct reg_substr_datum *s;
9534 return (REGEXP *)NULL;
9536 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9539 len = r->offsets[0];
9540 npar = r->nparens+1;
9542 Newxc(ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9543 Copy(r->program, ret->program, len+1, regnode);
9545 Newx(ret->startp, npar, I32);
9546 Copy(r->startp, ret->startp, npar, I32);
9547 Newx(ret->endp, npar, I32);
9548 Copy(r->startp, ret->startp, npar, I32);
9550 Newx(ret->substrs, 1, struct reg_substr_data);
9551 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9552 s->min_offset = r->substrs->data[i].min_offset;
9553 s->max_offset = r->substrs->data[i].max_offset;
9554 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9555 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9558 ret->regstclass = NULL;
9561 const int count = r->data->count;
9564 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
9565 char, struct reg_data);
9566 Newx(d->what, count, U8);
9569 for (i = 0; i < count; i++) {
9570 d->what[i] = r->data->what[i];
9571 switch (d->what[i]) {
9572 /* legal options are one of: sfpont
9573 see also regcomp.h and pregfree() */
9575 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9578 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9581 /* This is cheating. */
9582 Newx(d->data[i], 1, struct regnode_charclass_class);
9583 StructCopy(r->data->data[i], d->data[i],
9584 struct regnode_charclass_class);
9585 ret->regstclass = (regnode*)d->data[i];
9588 /* Compiled op trees are readonly, and can thus be
9589 shared without duplication. */
9591 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9595 d->data[i] = r->data->data[i];
9598 d->data[i] = r->data->data[i];
9600 ((reg_trie_data*)d->data[i])->refcount++;
9604 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9613 Newx(ret->offsets, 2*len+1, U32);
9614 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9616 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9617 ret->refcnt = r->refcnt;
9618 ret->minlen = r->minlen;
9619 ret->prelen = r->prelen;
9620 ret->nparens = r->nparens;
9621 ret->lastparen = r->lastparen;
9622 ret->lastcloseparen = r->lastcloseparen;
9623 ret->reganch = r->reganch;
9625 ret->sublen = r->sublen;
9627 if (RX_MATCH_COPIED(ret))
9628 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9630 ret->subbeg = Nullch;
9631 #ifdef PERL_OLD_COPY_ON_WRITE
9632 ret->saved_copy = Nullsv;
9635 ptr_table_store(PL_ptr_table, r, ret);
9639 /* duplicate a file handle */
9642 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9646 PERL_UNUSED_ARG(type);
9649 return (PerlIO*)NULL;
9651 /* look for it in the table first */
9652 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9656 /* create anew and remember what it is */
9657 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9658 ptr_table_store(PL_ptr_table, fp, ret);
9662 /* duplicate a directory handle */
9665 Perl_dirp_dup(pTHX_ DIR *dp)
9673 /* duplicate a typeglob */
9676 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9681 /* look for it in the table first */
9682 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9686 /* create anew and remember what it is */
9688 ptr_table_store(PL_ptr_table, gp, ret);
9691 ret->gp_refcnt = 0; /* must be before any other dups! */
9692 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9693 ret->gp_io = io_dup_inc(gp->gp_io, param);
9694 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9695 ret->gp_av = av_dup_inc(gp->gp_av, param);
9696 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9697 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9698 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9699 ret->gp_cvgen = gp->gp_cvgen;
9700 ret->gp_line = gp->gp_line;
9701 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9705 /* duplicate a chain of magic */
9708 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9710 MAGIC *mgprev = (MAGIC*)NULL;
9713 return (MAGIC*)NULL;
9714 /* look for it in the table first */
9715 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9719 for (; mg; mg = mg->mg_moremagic) {
9721 Newxz(nmg, 1, MAGIC);
9723 mgprev->mg_moremagic = nmg;
9726 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9727 nmg->mg_private = mg->mg_private;
9728 nmg->mg_type = mg->mg_type;
9729 nmg->mg_flags = mg->mg_flags;
9730 if (mg->mg_type == PERL_MAGIC_qr) {
9731 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9733 else if(mg->mg_type == PERL_MAGIC_backref) {
9734 const AV * const av = (AV*) mg->mg_obj;
9737 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
9739 for (i = AvFILLp(av); i >= 0; i--) {
9740 if (!svp[i]) continue;
9741 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9744 else if (mg->mg_type == PERL_MAGIC_symtab) {
9745 nmg->mg_obj = mg->mg_obj;
9748 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9749 ? sv_dup_inc(mg->mg_obj, param)
9750 : sv_dup(mg->mg_obj, param);
9752 nmg->mg_len = mg->mg_len;
9753 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9754 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9755 if (mg->mg_len > 0) {
9756 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9757 if (mg->mg_type == PERL_MAGIC_overload_table &&
9758 AMT_AMAGIC((AMT*)mg->mg_ptr))
9760 AMT *amtp = (AMT*)mg->mg_ptr;
9761 AMT *namtp = (AMT*)nmg->mg_ptr;
9763 for (i = 1; i < NofAMmeth; i++) {
9764 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9768 else if (mg->mg_len == HEf_SVKEY)
9769 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9771 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9772 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9779 /* create a new pointer-mapping table */
9782 Perl_ptr_table_new(pTHX)
9785 Newxz(tbl, 1, PTR_TBL_t);
9788 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9793 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
9795 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
9798 #define del_pte(p) del_body_type(p, struct ptr_tbl_ent, pte)
9800 /* map an existing pointer using a table */
9803 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
9805 PTR_TBL_ENT_t *tblent;
9806 const UV hash = PTR_TABLE_HASH(sv);
9808 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9809 for (; tblent; tblent = tblent->next) {
9810 if (tblent->oldval == sv)
9811 return tblent->newval;
9816 /* add a new entry to a pointer-mapping table */
9819 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldsv, void *newsv)
9821 PTR_TBL_ENT_t *tblent, **otblent;
9822 /* XXX this may be pessimal on platforms where pointers aren't good
9823 * hash values e.g. if they grow faster in the most significant
9825 const UV hash = PTR_TABLE_HASH(oldsv);
9829 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9830 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
9831 if (tblent->oldval == oldsv) {
9832 tblent->newval = newsv;
9836 new_body_inline(tblent, (void**)&PL_pte_arenaroot, (void**)&PL_pte_root,
9837 sizeof(struct ptr_tbl_ent));
9838 tblent->oldval = oldsv;
9839 tblent->newval = newsv;
9840 tblent->next = *otblent;
9843 if (!empty && tbl->tbl_items > tbl->tbl_max)
9844 ptr_table_split(tbl);
9847 /* double the hash bucket size of an existing ptr table */
9850 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9852 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9853 const UV oldsize = tbl->tbl_max + 1;
9854 UV newsize = oldsize * 2;
9857 Renew(ary, newsize, PTR_TBL_ENT_t*);
9858 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9859 tbl->tbl_max = --newsize;
9861 for (i=0; i < oldsize; i++, ary++) {
9862 PTR_TBL_ENT_t **curentp, **entp, *ent;
9865 curentp = ary + oldsize;
9866 for (entp = ary, ent = *ary; ent; ent = *entp) {
9867 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
9869 ent->next = *curentp;
9879 /* remove all the entries from a ptr table */
9882 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9884 register PTR_TBL_ENT_t **array;
9885 register PTR_TBL_ENT_t *entry;
9889 if (!tbl || !tbl->tbl_items) {
9893 array = tbl->tbl_ary;
9899 PTR_TBL_ENT_t *oentry = entry;
9900 entry = entry->next;
9904 if (++riter > max) {
9907 entry = array[riter];
9914 /* clear and free a ptr table */
9917 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9922 ptr_table_clear(tbl);
9923 Safefree(tbl->tbl_ary);
9929 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9932 SvRV_set(dstr, SvWEAKREF(sstr)
9933 ? sv_dup(SvRV(sstr), param)
9934 : sv_dup_inc(SvRV(sstr), param));
9937 else if (SvPVX_const(sstr)) {
9938 /* Has something there */
9940 /* Normal PV - clone whole allocated space */
9941 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
9942 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9943 /* Not that normal - actually sstr is copy on write.
9944 But we are a true, independant SV, so: */
9945 SvREADONLY_off(dstr);
9950 /* Special case - not normally malloced for some reason */
9951 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
9952 /* A "shared" PV - clone it as "shared" PV */
9954 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
9958 /* Some other special case - random pointer */
9959 SvPV_set(dstr, SvPVX(sstr));
9965 if (SvTYPE(dstr) == SVt_RV)
9966 SvRV_set(dstr, NULL);
9972 /* duplicate an SV of any type (including AV, HV etc) */
9975 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9980 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9982 /* look for it in the table first */
9983 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9987 if(param->flags & CLONEf_JOIN_IN) {
9988 /** We are joining here so we don't want do clone
9989 something that is bad **/
9992 if(SvTYPE(sstr) == SVt_PVHV &&
9993 (hvname = HvNAME_get(sstr))) {
9994 /** don't clone stashes if they already exist **/
9995 return (SV*)gv_stashpv(hvname,0);
9999 /* create anew and remember what it is */
10002 #ifdef DEBUG_LEAKING_SCALARS
10003 dstr->sv_debug_optype = sstr->sv_debug_optype;
10004 dstr->sv_debug_line = sstr->sv_debug_line;
10005 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10006 dstr->sv_debug_cloned = 1;
10008 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10010 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10014 ptr_table_store(PL_ptr_table, sstr, dstr);
10017 SvFLAGS(dstr) = SvFLAGS(sstr);
10018 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10019 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10022 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10023 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10024 PL_watch_pvx, SvPVX_const(sstr));
10027 /* don't clone objects whose class has asked us not to */
10028 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10029 SvFLAGS(dstr) &= ~SVTYPEMASK;
10030 SvOBJECT_off(dstr);
10034 switch (SvTYPE(sstr)) {
10036 SvANY(dstr) = NULL;
10039 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10040 SvIV_set(dstr, SvIVX(sstr));
10043 SvANY(dstr) = new_XNV();
10044 SvNV_set(dstr, SvNVX(sstr));
10047 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10048 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10052 /* These are all the types that need complex bodies allocating. */
10053 size_t new_body_length;
10054 size_t new_body_offset = 0;
10055 void **new_body_arena;
10056 void **new_body_arenaroot;
10059 switch (SvTYPE(sstr)) {
10061 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
10066 new_body = new_XPVIO();
10067 new_body_length = sizeof(XPVIO);
10070 new_body = new_XPVFM();
10071 new_body_length = sizeof(XPVFM);
10075 new_body_arena = (void **) &PL_xpvhv_root;
10076 new_body_arenaroot = (void **) &PL_xpvhv_arenaroot;
10077 new_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill)
10078 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill);
10079 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10080 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10084 new_body_arena = (void **) &PL_xpvav_root;
10085 new_body_arenaroot = (void **) &PL_xpvav_arenaroot;
10086 new_body_offset = STRUCT_OFFSET(XPVAV, xav_fill)
10087 - STRUCT_OFFSET(xpvav_allocated, xav_fill);
10088 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10089 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10093 new_body_length = sizeof(XPVBM);
10094 new_body_arena = (void **) &PL_xpvbm_root;
10095 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
10098 if (GvUNIQUE((GV*)sstr)) {
10099 /* Do sharing here. */
10101 new_body_length = sizeof(XPVGV);
10102 new_body_arena = (void **) &PL_xpvgv_root;
10103 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
10106 new_body_length = sizeof(XPVCV);
10107 new_body_arena = (void **) &PL_xpvcv_root;
10108 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
10111 new_body_length = sizeof(XPVLV);
10112 new_body_arena = (void **) &PL_xpvlv_root;
10113 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
10116 new_body_length = sizeof(XPVMG);
10117 new_body_arena = (void **) &PL_xpvmg_root;
10118 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
10121 new_body_length = sizeof(XPVNV);
10122 new_body_arena = (void **) &PL_xpvnv_root;
10123 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
10126 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
10127 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
10128 new_body_length = sizeof(XPVIV) - new_body_offset;
10129 new_body_arena = (void **) &PL_xpviv_root;
10130 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
10133 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
10134 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
10135 new_body_length = sizeof(XPV) - new_body_offset;
10136 new_body_arena = (void **) &PL_xpv_root;
10137 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
10139 assert(new_body_length);
10141 new_body_inline(new_body, new_body_arenaroot, new_body_arena,
10143 new_body = (void*)((char*)new_body - new_body_offset);
10145 /* We always allocated the full length item with PURIFY */
10146 new_body_length += new_body_offset;
10147 new_body_offset = 0;
10148 new_body = my_safemalloc(new_body_length);
10152 SvANY(dstr) = new_body;
10154 Copy(((char*)SvANY(sstr)) + new_body_offset,
10155 ((char*)SvANY(dstr)) + new_body_offset,
10156 new_body_length, char);
10158 if (SvTYPE(sstr) != SVt_PVAV && SvTYPE(sstr) != SVt_PVHV)
10159 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10161 /* The Copy above means that all the source (unduplicated) pointers
10162 are now in the destination. We can check the flags and the
10163 pointers in either, but it's possible that there's less cache
10164 missing by always going for the destination.
10165 FIXME - instrument and check that assumption */
10166 if (SvTYPE(sstr) >= SVt_PVMG) {
10168 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
10170 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
10173 switch (SvTYPE(sstr)) {
10185 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
10186 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
10187 LvTARG(dstr) = dstr;
10188 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
10189 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
10191 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
10194 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
10195 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
10196 /* Don't call sv_add_backref here as it's going to be created
10197 as part of the magic cloning of the symbol table. */
10198 GvGP(dstr) = gp_dup(GvGP(dstr), param);
10199 (void)GpREFCNT_inc(GvGP(dstr));
10202 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
10203 if (IoOFP(dstr) == IoIFP(sstr))
10204 IoOFP(dstr) = IoIFP(dstr);
10206 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
10207 /* PL_rsfp_filters entries have fake IoDIRP() */
10208 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
10209 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
10210 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
10211 /* I have no idea why fake dirp (rsfps)
10212 should be treated differently but otherwise
10213 we end up with leaks -- sky*/
10214 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
10215 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
10216 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
10218 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
10219 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
10220 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
10222 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
10223 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
10224 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
10227 if (AvARRAY((AV*)sstr)) {
10228 SV **dst_ary, **src_ary;
10229 SSize_t items = AvFILLp((AV*)sstr) + 1;
10231 src_ary = AvARRAY((AV*)sstr);
10232 Newxz(dst_ary, AvMAX((AV*)sstr)+1, SV*);
10233 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10234 SvPV_set(dstr, (char*)dst_ary);
10235 AvALLOC((AV*)dstr) = dst_ary;
10236 if (AvREAL((AV*)sstr)) {
10237 while (items-- > 0)
10238 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10241 while (items-- > 0)
10242 *dst_ary++ = sv_dup(*src_ary++, param);
10244 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10245 while (items-- > 0) {
10246 *dst_ary++ = &PL_sv_undef;
10250 SvPV_set(dstr, Nullch);
10251 AvALLOC((AV*)dstr) = (SV**)NULL;
10258 if (HvARRAY((HV*)sstr)) {
10260 const bool sharekeys = !!HvSHAREKEYS(sstr);
10261 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10262 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10264 Newx(darray, PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10265 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
10267 HvARRAY(dstr) = (HE**)darray;
10268 while (i <= sxhv->xhv_max) {
10269 const HE *source = HvARRAY(sstr)[i];
10270 HvARRAY(dstr)[i] = source
10271 ? he_dup(source, sharekeys, param) : 0;
10275 struct xpvhv_aux *saux = HvAUX(sstr);
10276 struct xpvhv_aux *daux = HvAUX(dstr);
10277 /* This flag isn't copied. */
10278 /* SvOOK_on(hv) attacks the IV flags. */
10279 SvFLAGS(dstr) |= SVf_OOK;
10281 hvname = saux->xhv_name;
10283 = hvname ? hek_dup(hvname, param) : hvname;
10285 daux->xhv_riter = saux->xhv_riter;
10286 daux->xhv_eiter = saux->xhv_eiter
10287 ? he_dup(saux->xhv_eiter,
10288 (bool)!!HvSHAREKEYS(sstr), param) : 0;
10292 SvPV_set(dstr, Nullch);
10294 /* Record stashes for possible cloning in Perl_clone(). */
10296 av_push(param->stashes, dstr);
10301 /* NOTE: not refcounted */
10302 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
10304 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
10306 if (CvCONST(dstr)) {
10307 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
10308 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
10309 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
10311 /* don't dup if copying back - CvGV isn't refcounted, so the
10312 * duped GV may never be freed. A bit of a hack! DAPM */
10313 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10314 Nullgv : gv_dup(CvGV(dstr), param) ;
10315 if (!(param->flags & CLONEf_COPY_STACKS)) {
10318 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10320 CvWEAKOUTSIDE(sstr)
10321 ? cv_dup( CvOUTSIDE(dstr), param)
10322 : cv_dup_inc(CvOUTSIDE(dstr), param);
10324 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
10330 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10336 /* duplicate a context */
10339 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10341 PERL_CONTEXT *ncxs;
10344 return (PERL_CONTEXT*)NULL;
10346 /* look for it in the table first */
10347 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10351 /* create anew and remember what it is */
10352 Newxz(ncxs, max + 1, PERL_CONTEXT);
10353 ptr_table_store(PL_ptr_table, cxs, ncxs);
10356 PERL_CONTEXT *cx = &cxs[ix];
10357 PERL_CONTEXT *ncx = &ncxs[ix];
10358 ncx->cx_type = cx->cx_type;
10359 if (CxTYPE(cx) == CXt_SUBST) {
10360 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10363 ncx->blk_oldsp = cx->blk_oldsp;
10364 ncx->blk_oldcop = cx->blk_oldcop;
10365 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10366 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10367 ncx->blk_oldpm = cx->blk_oldpm;
10368 ncx->blk_gimme = cx->blk_gimme;
10369 switch (CxTYPE(cx)) {
10371 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10372 ? cv_dup_inc(cx->blk_sub.cv, param)
10373 : cv_dup(cx->blk_sub.cv,param));
10374 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10375 ? av_dup_inc(cx->blk_sub.argarray, param)
10377 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10378 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10379 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10380 ncx->blk_sub.lval = cx->blk_sub.lval;
10381 ncx->blk_sub.retop = cx->blk_sub.retop;
10384 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10385 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10386 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10387 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10388 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10389 ncx->blk_eval.retop = cx->blk_eval.retop;
10392 ncx->blk_loop.label = cx->blk_loop.label;
10393 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10394 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10395 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10396 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10397 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10398 ? cx->blk_loop.iterdata
10399 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10400 ncx->blk_loop.oldcomppad
10401 = (PAD*)ptr_table_fetch(PL_ptr_table,
10402 cx->blk_loop.oldcomppad);
10403 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10404 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10405 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10406 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10407 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10410 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10411 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10412 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10413 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10414 ncx->blk_sub.retop = cx->blk_sub.retop;
10426 /* duplicate a stack info structure */
10429 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10434 return (PERL_SI*)NULL;
10436 /* look for it in the table first */
10437 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10441 /* create anew and remember what it is */
10442 Newxz(nsi, 1, PERL_SI);
10443 ptr_table_store(PL_ptr_table, si, nsi);
10445 nsi->si_stack = av_dup_inc(si->si_stack, param);
10446 nsi->si_cxix = si->si_cxix;
10447 nsi->si_cxmax = si->si_cxmax;
10448 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10449 nsi->si_type = si->si_type;
10450 nsi->si_prev = si_dup(si->si_prev, param);
10451 nsi->si_next = si_dup(si->si_next, param);
10452 nsi->si_markoff = si->si_markoff;
10457 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10458 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10459 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10460 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10461 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10462 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10463 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10464 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10465 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10466 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10467 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10468 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10469 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10470 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10473 #define pv_dup_inc(p) SAVEPV(p)
10474 #define pv_dup(p) SAVEPV(p)
10475 #define svp_dup_inc(p,pp) any_dup(p,pp)
10477 /* map any object to the new equivent - either something in the
10478 * ptr table, or something in the interpreter structure
10482 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
10487 return (void*)NULL;
10489 /* look for it in the table first */
10490 ret = ptr_table_fetch(PL_ptr_table, v);
10494 /* see if it is part of the interpreter structure */
10495 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10496 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10504 /* duplicate the save stack */
10507 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10509 ANY * const ss = proto_perl->Tsavestack;
10510 const I32 max = proto_perl->Tsavestack_max;
10511 I32 ix = proto_perl->Tsavestack_ix;
10523 void (*dptr) (void*);
10524 void (*dxptr) (pTHX_ void*);
10526 Newxz(nss, max, ANY);
10529 I32 i = POPINT(ss,ix);
10530 TOPINT(nss,ix) = i;
10532 case SAVEt_ITEM: /* normal string */
10533 sv = (SV*)POPPTR(ss,ix);
10534 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10535 sv = (SV*)POPPTR(ss,ix);
10536 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10538 case SAVEt_SV: /* scalar reference */
10539 sv = (SV*)POPPTR(ss,ix);
10540 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10541 gv = (GV*)POPPTR(ss,ix);
10542 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10544 case SAVEt_GENERIC_PVREF: /* generic char* */
10545 c = (char*)POPPTR(ss,ix);
10546 TOPPTR(nss,ix) = pv_dup(c);
10547 ptr = POPPTR(ss,ix);
10548 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10550 case SAVEt_SHARED_PVREF: /* char* in shared space */
10551 c = (char*)POPPTR(ss,ix);
10552 TOPPTR(nss,ix) = savesharedpv(c);
10553 ptr = POPPTR(ss,ix);
10554 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10556 case SAVEt_GENERIC_SVREF: /* generic sv */
10557 case SAVEt_SVREF: /* scalar reference */
10558 sv = (SV*)POPPTR(ss,ix);
10559 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10560 ptr = POPPTR(ss,ix);
10561 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10563 case SAVEt_AV: /* array reference */
10564 av = (AV*)POPPTR(ss,ix);
10565 TOPPTR(nss,ix) = av_dup_inc(av, param);
10566 gv = (GV*)POPPTR(ss,ix);
10567 TOPPTR(nss,ix) = gv_dup(gv, param);
10569 case SAVEt_HV: /* hash reference */
10570 hv = (HV*)POPPTR(ss,ix);
10571 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10572 gv = (GV*)POPPTR(ss,ix);
10573 TOPPTR(nss,ix) = gv_dup(gv, param);
10575 case SAVEt_INT: /* int reference */
10576 ptr = POPPTR(ss,ix);
10577 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10578 intval = (int)POPINT(ss,ix);
10579 TOPINT(nss,ix) = intval;
10581 case SAVEt_LONG: /* long reference */
10582 ptr = POPPTR(ss,ix);
10583 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10584 longval = (long)POPLONG(ss,ix);
10585 TOPLONG(nss,ix) = longval;
10587 case SAVEt_I32: /* I32 reference */
10588 case SAVEt_I16: /* I16 reference */
10589 case SAVEt_I8: /* I8 reference */
10590 ptr = POPPTR(ss,ix);
10591 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10593 TOPINT(nss,ix) = i;
10595 case SAVEt_IV: /* IV reference */
10596 ptr = POPPTR(ss,ix);
10597 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10599 TOPIV(nss,ix) = iv;
10601 case SAVEt_SPTR: /* SV* reference */
10602 ptr = POPPTR(ss,ix);
10603 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10604 sv = (SV*)POPPTR(ss,ix);
10605 TOPPTR(nss,ix) = sv_dup(sv, param);
10607 case SAVEt_VPTR: /* random* reference */
10608 ptr = POPPTR(ss,ix);
10609 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10610 ptr = POPPTR(ss,ix);
10611 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10613 case SAVEt_PPTR: /* char* reference */
10614 ptr = POPPTR(ss,ix);
10615 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10616 c = (char*)POPPTR(ss,ix);
10617 TOPPTR(nss,ix) = pv_dup(c);
10619 case SAVEt_HPTR: /* HV* reference */
10620 ptr = POPPTR(ss,ix);
10621 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10622 hv = (HV*)POPPTR(ss,ix);
10623 TOPPTR(nss,ix) = hv_dup(hv, param);
10625 case SAVEt_APTR: /* AV* reference */
10626 ptr = POPPTR(ss,ix);
10627 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10628 av = (AV*)POPPTR(ss,ix);
10629 TOPPTR(nss,ix) = av_dup(av, param);
10632 gv = (GV*)POPPTR(ss,ix);
10633 TOPPTR(nss,ix) = gv_dup(gv, param);
10635 case SAVEt_GP: /* scalar reference */
10636 gp = (GP*)POPPTR(ss,ix);
10637 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10638 (void)GpREFCNT_inc(gp);
10639 gv = (GV*)POPPTR(ss,ix);
10640 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10641 c = (char*)POPPTR(ss,ix);
10642 TOPPTR(nss,ix) = pv_dup(c);
10644 TOPIV(nss,ix) = iv;
10646 TOPIV(nss,ix) = iv;
10649 case SAVEt_MORTALIZESV:
10650 sv = (SV*)POPPTR(ss,ix);
10651 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10654 ptr = POPPTR(ss,ix);
10655 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10656 /* these are assumed to be refcounted properly */
10658 switch (((OP*)ptr)->op_type) {
10660 case OP_LEAVESUBLV:
10664 case OP_LEAVEWRITE:
10665 TOPPTR(nss,ix) = ptr;
10670 TOPPTR(nss,ix) = Nullop;
10675 TOPPTR(nss,ix) = Nullop;
10678 c = (char*)POPPTR(ss,ix);
10679 TOPPTR(nss,ix) = pv_dup_inc(c);
10681 case SAVEt_CLEARSV:
10682 longval = POPLONG(ss,ix);
10683 TOPLONG(nss,ix) = longval;
10686 hv = (HV*)POPPTR(ss,ix);
10687 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10688 c = (char*)POPPTR(ss,ix);
10689 TOPPTR(nss,ix) = pv_dup_inc(c);
10691 TOPINT(nss,ix) = i;
10693 case SAVEt_DESTRUCTOR:
10694 ptr = POPPTR(ss,ix);
10695 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10696 dptr = POPDPTR(ss,ix);
10697 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
10698 any_dup(FPTR2DPTR(void *, dptr),
10701 case SAVEt_DESTRUCTOR_X:
10702 ptr = POPPTR(ss,ix);
10703 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10704 dxptr = POPDXPTR(ss,ix);
10705 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
10706 any_dup(FPTR2DPTR(void *, dxptr),
10709 case SAVEt_REGCONTEXT:
10712 TOPINT(nss,ix) = i;
10715 case SAVEt_STACK_POS: /* Position on Perl stack */
10717 TOPINT(nss,ix) = i;
10719 case SAVEt_AELEM: /* array element */
10720 sv = (SV*)POPPTR(ss,ix);
10721 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10723 TOPINT(nss,ix) = i;
10724 av = (AV*)POPPTR(ss,ix);
10725 TOPPTR(nss,ix) = av_dup_inc(av, param);
10727 case SAVEt_HELEM: /* hash element */
10728 sv = (SV*)POPPTR(ss,ix);
10729 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10730 sv = (SV*)POPPTR(ss,ix);
10731 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10732 hv = (HV*)POPPTR(ss,ix);
10733 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10736 ptr = POPPTR(ss,ix);
10737 TOPPTR(nss,ix) = ptr;
10741 TOPINT(nss,ix) = i;
10743 case SAVEt_COMPPAD:
10744 av = (AV*)POPPTR(ss,ix);
10745 TOPPTR(nss,ix) = av_dup(av, param);
10748 longval = (long)POPLONG(ss,ix);
10749 TOPLONG(nss,ix) = longval;
10750 ptr = POPPTR(ss,ix);
10751 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10752 sv = (SV*)POPPTR(ss,ix);
10753 TOPPTR(nss,ix) = sv_dup(sv, param);
10756 ptr = POPPTR(ss,ix);
10757 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10758 longval = (long)POPBOOL(ss,ix);
10759 TOPBOOL(nss,ix) = (bool)longval;
10761 case SAVEt_SET_SVFLAGS:
10763 TOPINT(nss,ix) = i;
10765 TOPINT(nss,ix) = i;
10766 sv = (SV*)POPPTR(ss,ix);
10767 TOPPTR(nss,ix) = sv_dup(sv, param);
10770 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10778 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
10779 * flag to the result. This is done for each stash before cloning starts,
10780 * so we know which stashes want their objects cloned */
10783 do_mark_cloneable_stash(pTHX_ SV *sv)
10785 const HEK * const hvname = HvNAME_HEK((HV*)sv);
10787 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
10788 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
10789 if (cloner && GvCV(cloner)) {
10796 XPUSHs(sv_2mortal(newSVhek(hvname)));
10798 call_sv((SV*)GvCV(cloner), G_SCALAR);
10805 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
10813 =for apidoc perl_clone
10815 Create and return a new interpreter by cloning the current one.
10817 perl_clone takes these flags as parameters:
10819 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10820 without it we only clone the data and zero the stacks,
10821 with it we copy the stacks and the new perl interpreter is
10822 ready to run at the exact same point as the previous one.
10823 The pseudo-fork code uses COPY_STACKS while the
10824 threads->new doesn't.
10826 CLONEf_KEEP_PTR_TABLE
10827 perl_clone keeps a ptr_table with the pointer of the old
10828 variable as a key and the new variable as a value,
10829 this allows it to check if something has been cloned and not
10830 clone it again but rather just use the value and increase the
10831 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10832 the ptr_table using the function
10833 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10834 reason to keep it around is if you want to dup some of your own
10835 variable who are outside the graph perl scans, example of this
10836 code is in threads.xs create
10839 This is a win32 thing, it is ignored on unix, it tells perls
10840 win32host code (which is c++) to clone itself, this is needed on
10841 win32 if you want to run two threads at the same time,
10842 if you just want to do some stuff in a separate perl interpreter
10843 and then throw it away and return to the original one,
10844 you don't need to do anything.
10849 /* XXX the above needs expanding by someone who actually understands it ! */
10850 EXTERN_C PerlInterpreter *
10851 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10854 perl_clone(PerlInterpreter *proto_perl, UV flags)
10857 #ifdef PERL_IMPLICIT_SYS
10859 /* perlhost.h so we need to call into it
10860 to clone the host, CPerlHost should have a c interface, sky */
10862 if (flags & CLONEf_CLONE_HOST) {
10863 return perl_clone_host(proto_perl,flags);
10865 return perl_clone_using(proto_perl, flags,
10867 proto_perl->IMemShared,
10868 proto_perl->IMemParse,
10870 proto_perl->IStdIO,
10874 proto_perl->IProc);
10878 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10879 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10880 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10881 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10882 struct IPerlDir* ipD, struct IPerlSock* ipS,
10883 struct IPerlProc* ipP)
10885 /* XXX many of the string copies here can be optimized if they're
10886 * constants; they need to be allocated as common memory and just
10887 * their pointers copied. */
10890 CLONE_PARAMS clone_params;
10891 CLONE_PARAMS* param = &clone_params;
10893 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10894 /* for each stash, determine whether its objects should be cloned */
10895 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10896 PERL_SET_THX(my_perl);
10899 Poison(my_perl, 1, PerlInterpreter);
10901 PL_curcop = (COP *)Nullop;
10905 PL_savestack_ix = 0;
10906 PL_savestack_max = -1;
10907 PL_sig_pending = 0;
10908 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10909 # else /* !DEBUGGING */
10910 Zero(my_perl, 1, PerlInterpreter);
10911 # endif /* DEBUGGING */
10913 /* host pointers */
10915 PL_MemShared = ipMS;
10916 PL_MemParse = ipMP;
10923 #else /* !PERL_IMPLICIT_SYS */
10925 CLONE_PARAMS clone_params;
10926 CLONE_PARAMS* param = &clone_params;
10927 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10928 /* for each stash, determine whether its objects should be cloned */
10929 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10930 PERL_SET_THX(my_perl);
10933 Poison(my_perl, 1, PerlInterpreter);
10935 PL_curcop = (COP *)Nullop;
10939 PL_savestack_ix = 0;
10940 PL_savestack_max = -1;
10941 PL_sig_pending = 0;
10942 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10943 # else /* !DEBUGGING */
10944 Zero(my_perl, 1, PerlInterpreter);
10945 # endif /* DEBUGGING */
10946 #endif /* PERL_IMPLICIT_SYS */
10947 param->flags = flags;
10948 param->proto_perl = proto_perl;
10951 PL_xnv_arenaroot = NULL;
10952 PL_xnv_root = NULL;
10953 PL_xpv_arenaroot = NULL;
10954 PL_xpv_root = NULL;
10955 PL_xpviv_arenaroot = NULL;
10956 PL_xpviv_root = NULL;
10957 PL_xpvnv_arenaroot = NULL;
10958 PL_xpvnv_root = NULL;
10959 PL_xpvcv_arenaroot = NULL;
10960 PL_xpvcv_root = NULL;
10961 PL_xpvav_arenaroot = NULL;
10962 PL_xpvav_root = NULL;
10963 PL_xpvhv_arenaroot = NULL;
10964 PL_xpvhv_root = NULL;
10965 PL_xpvmg_arenaroot = NULL;
10966 PL_xpvmg_root = NULL;
10967 PL_xpvgv_arenaroot = NULL;
10968 PL_xpvgv_root = NULL;
10969 PL_xpvlv_arenaroot = NULL;
10970 PL_xpvlv_root = NULL;
10971 PL_xpvbm_arenaroot = NULL;
10972 PL_xpvbm_root = NULL;
10973 PL_he_arenaroot = NULL;
10975 #if defined(USE_ITHREADS)
10976 PL_pte_arenaroot = NULL;
10977 PL_pte_root = NULL;
10979 PL_nice_chunk = NULL;
10980 PL_nice_chunk_size = 0;
10982 PL_sv_objcount = 0;
10983 PL_sv_root = Nullsv;
10984 PL_sv_arenaroot = Nullsv;
10986 PL_debug = proto_perl->Idebug;
10988 PL_hash_seed = proto_perl->Ihash_seed;
10989 PL_rehash_seed = proto_perl->Irehash_seed;
10991 #ifdef USE_REENTRANT_API
10992 /* XXX: things like -Dm will segfault here in perlio, but doing
10993 * PERL_SET_CONTEXT(proto_perl);
10994 * breaks too many other things
10996 Perl_reentrant_init(aTHX);
10999 /* create SV map for pointer relocation */
11000 PL_ptr_table = ptr_table_new();
11002 /* initialize these special pointers as early as possible */
11003 SvANY(&PL_sv_undef) = NULL;
11004 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11005 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11006 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11008 SvANY(&PL_sv_no) = new_XPVNV();
11009 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11010 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11011 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11012 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11013 SvCUR_set(&PL_sv_no, 0);
11014 SvLEN_set(&PL_sv_no, 1);
11015 SvIV_set(&PL_sv_no, 0);
11016 SvNV_set(&PL_sv_no, 0);
11017 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11019 SvANY(&PL_sv_yes) = new_XPVNV();
11020 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11021 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11022 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11023 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11024 SvCUR_set(&PL_sv_yes, 1);
11025 SvLEN_set(&PL_sv_yes, 2);
11026 SvIV_set(&PL_sv_yes, 1);
11027 SvNV_set(&PL_sv_yes, 1);
11028 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11030 /* create (a non-shared!) shared string table */
11031 PL_strtab = newHV();
11032 HvSHAREKEYS_off(PL_strtab);
11033 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11034 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11036 PL_compiling = proto_perl->Icompiling;
11038 /* These two PVs will be free'd special way so must set them same way op.c does */
11039 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11040 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11042 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11043 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11045 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11046 if (!specialWARN(PL_compiling.cop_warnings))
11047 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11048 if (!specialCopIO(PL_compiling.cop_io))
11049 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11050 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11052 /* pseudo environmental stuff */
11053 PL_origargc = proto_perl->Iorigargc;
11054 PL_origargv = proto_perl->Iorigargv;
11056 param->stashes = newAV(); /* Setup array of objects to call clone on */
11058 /* Set tainting stuff before PerlIO_debug can possibly get called */
11059 PL_tainting = proto_perl->Itainting;
11060 PL_taint_warn = proto_perl->Itaint_warn;
11062 #ifdef PERLIO_LAYERS
11063 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11064 PerlIO_clone(aTHX_ proto_perl, param);
11067 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11068 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11069 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11070 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11071 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11072 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11075 PL_minus_c = proto_perl->Iminus_c;
11076 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11077 PL_localpatches = proto_perl->Ilocalpatches;
11078 PL_splitstr = proto_perl->Isplitstr;
11079 PL_preprocess = proto_perl->Ipreprocess;
11080 PL_minus_n = proto_perl->Iminus_n;
11081 PL_minus_p = proto_perl->Iminus_p;
11082 PL_minus_l = proto_perl->Iminus_l;
11083 PL_minus_a = proto_perl->Iminus_a;
11084 PL_minus_F = proto_perl->Iminus_F;
11085 PL_doswitches = proto_perl->Idoswitches;
11086 PL_dowarn = proto_perl->Idowarn;
11087 PL_doextract = proto_perl->Idoextract;
11088 PL_sawampersand = proto_perl->Isawampersand;
11089 PL_unsafe = proto_perl->Iunsafe;
11090 PL_inplace = SAVEPV(proto_perl->Iinplace);
11091 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11092 PL_perldb = proto_perl->Iperldb;
11093 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11094 PL_exit_flags = proto_perl->Iexit_flags;
11096 /* magical thingies */
11097 /* XXX time(&PL_basetime) when asked for? */
11098 PL_basetime = proto_perl->Ibasetime;
11099 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11101 PL_maxsysfd = proto_perl->Imaxsysfd;
11102 PL_multiline = proto_perl->Imultiline;
11103 PL_statusvalue = proto_perl->Istatusvalue;
11105 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11107 PL_statusvalue_posix = proto_perl->Istatusvalue_posix;
11109 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11111 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11112 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11113 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11115 /* Clone the regex array */
11116 PL_regex_padav = newAV();
11118 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11119 SV** const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11121 av_push(PL_regex_padav,
11122 sv_dup_inc(regexen[0],param));
11123 for(i = 1; i <= len; i++) {
11124 if(SvREPADTMP(regexen[i])) {
11125 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11127 av_push(PL_regex_padav,
11129 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11130 SvIVX(regexen[i])), param)))
11135 PL_regex_pad = AvARRAY(PL_regex_padav);
11137 /* shortcuts to various I/O objects */
11138 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11139 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11140 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11141 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11142 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11143 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11145 /* shortcuts to regexp stuff */
11146 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11148 /* shortcuts to misc objects */
11149 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11151 /* shortcuts to debugging objects */
11152 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11153 PL_DBline = gv_dup(proto_perl->IDBline, param);
11154 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11155 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11156 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11157 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11158 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11159 PL_lineary = av_dup(proto_perl->Ilineary, param);
11160 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11162 /* symbol tables */
11163 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11164 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11165 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11166 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11167 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11169 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11170 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11171 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11172 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11173 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11174 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11176 PL_sub_generation = proto_perl->Isub_generation;
11178 /* funky return mechanisms */
11179 PL_forkprocess = proto_perl->Iforkprocess;
11181 /* subprocess state */
11182 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11184 /* internal state */
11185 PL_maxo = proto_perl->Imaxo;
11186 if (proto_perl->Iop_mask)
11187 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11189 PL_op_mask = Nullch;
11190 /* PL_asserting = proto_perl->Iasserting; */
11192 /* current interpreter roots */
11193 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11194 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11195 PL_main_start = proto_perl->Imain_start;
11196 PL_eval_root = proto_perl->Ieval_root;
11197 PL_eval_start = proto_perl->Ieval_start;
11199 /* runtime control stuff */
11200 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11201 PL_copline = proto_perl->Icopline;
11203 PL_filemode = proto_perl->Ifilemode;
11204 PL_lastfd = proto_perl->Ilastfd;
11205 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11208 PL_gensym = proto_perl->Igensym;
11209 PL_preambled = proto_perl->Ipreambled;
11210 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11211 PL_laststatval = proto_perl->Ilaststatval;
11212 PL_laststype = proto_perl->Ilaststype;
11213 PL_mess_sv = Nullsv;
11215 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11217 /* interpreter atexit processing */
11218 PL_exitlistlen = proto_perl->Iexitlistlen;
11219 if (PL_exitlistlen) {
11220 Newx(PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11221 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11224 PL_exitlist = (PerlExitListEntry*)NULL;
11225 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11226 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11227 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11229 PL_profiledata = NULL;
11230 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11231 /* PL_rsfp_filters entries have fake IoDIRP() */
11232 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11234 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11236 PAD_CLONE_VARS(proto_perl, param);
11238 #ifdef HAVE_INTERP_INTERN
11239 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11242 /* more statics moved here */
11243 PL_generation = proto_perl->Igeneration;
11244 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11246 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11247 PL_in_clean_all = proto_perl->Iin_clean_all;
11249 PL_uid = proto_perl->Iuid;
11250 PL_euid = proto_perl->Ieuid;
11251 PL_gid = proto_perl->Igid;
11252 PL_egid = proto_perl->Iegid;
11253 PL_nomemok = proto_perl->Inomemok;
11254 PL_an = proto_perl->Ian;
11255 PL_evalseq = proto_perl->Ievalseq;
11256 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11257 PL_origalen = proto_perl->Iorigalen;
11258 #ifdef PERL_USES_PL_PIDSTATUS
11259 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11261 PL_osname = SAVEPV(proto_perl->Iosname);
11262 PL_sighandlerp = proto_perl->Isighandlerp;
11264 PL_runops = proto_perl->Irunops;
11266 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11269 PL_cshlen = proto_perl->Icshlen;
11270 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11273 PL_lex_state = proto_perl->Ilex_state;
11274 PL_lex_defer = proto_perl->Ilex_defer;
11275 PL_lex_expect = proto_perl->Ilex_expect;
11276 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11277 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11278 PL_lex_starts = proto_perl->Ilex_starts;
11279 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11280 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11281 PL_lex_op = proto_perl->Ilex_op;
11282 PL_lex_inpat = proto_perl->Ilex_inpat;
11283 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11284 PL_lex_brackets = proto_perl->Ilex_brackets;
11285 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11286 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11287 PL_lex_casemods = proto_perl->Ilex_casemods;
11288 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11289 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11291 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11292 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11293 PL_nexttoke = proto_perl->Inexttoke;
11295 /* XXX This is probably masking the deeper issue of why
11296 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11297 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11298 * (A little debugging with a watchpoint on it may help.)
11300 if (SvANY(proto_perl->Ilinestr)) {
11301 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11302 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11303 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11304 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11305 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11306 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11307 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11308 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11309 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11312 PL_linestr = NEWSV(65,79);
11313 sv_upgrade(PL_linestr,SVt_PVIV);
11314 sv_setpvn(PL_linestr,"",0);
11315 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11317 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11318 PL_pending_ident = proto_perl->Ipending_ident;
11319 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11321 PL_expect = proto_perl->Iexpect;
11323 PL_multi_start = proto_perl->Imulti_start;
11324 PL_multi_end = proto_perl->Imulti_end;
11325 PL_multi_open = proto_perl->Imulti_open;
11326 PL_multi_close = proto_perl->Imulti_close;
11328 PL_error_count = proto_perl->Ierror_count;
11329 PL_subline = proto_perl->Isubline;
11330 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11332 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11333 if (SvANY(proto_perl->Ilinestr)) {
11334 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11335 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11336 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11337 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11338 PL_last_lop_op = proto_perl->Ilast_lop_op;
11341 PL_last_uni = SvPVX(PL_linestr);
11342 PL_last_lop = SvPVX(PL_linestr);
11343 PL_last_lop_op = 0;
11345 PL_in_my = proto_perl->Iin_my;
11346 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11348 PL_cryptseen = proto_perl->Icryptseen;
11351 PL_hints = proto_perl->Ihints;
11353 PL_amagic_generation = proto_perl->Iamagic_generation;
11355 #ifdef USE_LOCALE_COLLATE
11356 PL_collation_ix = proto_perl->Icollation_ix;
11357 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11358 PL_collation_standard = proto_perl->Icollation_standard;
11359 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11360 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11361 #endif /* USE_LOCALE_COLLATE */
11363 #ifdef USE_LOCALE_NUMERIC
11364 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11365 PL_numeric_standard = proto_perl->Inumeric_standard;
11366 PL_numeric_local = proto_perl->Inumeric_local;
11367 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11368 #endif /* !USE_LOCALE_NUMERIC */
11370 /* utf8 character classes */
11371 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11372 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11373 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11374 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11375 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11376 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11377 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11378 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11379 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11380 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11381 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11382 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11383 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11384 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11385 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11386 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11387 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11388 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11389 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11390 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11392 /* Did the locale setup indicate UTF-8? */
11393 PL_utf8locale = proto_perl->Iutf8locale;
11394 /* Unicode features (see perlrun/-C) */
11395 PL_unicode = proto_perl->Iunicode;
11397 /* Pre-5.8 signals control */
11398 PL_signals = proto_perl->Isignals;
11400 /* times() ticks per second */
11401 PL_clocktick = proto_perl->Iclocktick;
11403 /* Recursion stopper for PerlIO_find_layer */
11404 PL_in_load_module = proto_perl->Iin_load_module;
11406 /* sort() routine */
11407 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11409 /* Not really needed/useful since the reenrant_retint is "volatile",
11410 * but do it for consistency's sake. */
11411 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11413 /* Hooks to shared SVs and locks. */
11414 PL_sharehook = proto_perl->Isharehook;
11415 PL_lockhook = proto_perl->Ilockhook;
11416 PL_unlockhook = proto_perl->Iunlockhook;
11417 PL_threadhook = proto_perl->Ithreadhook;
11419 PL_runops_std = proto_perl->Irunops_std;
11420 PL_runops_dbg = proto_perl->Irunops_dbg;
11422 #ifdef THREADS_HAVE_PIDS
11423 PL_ppid = proto_perl->Ippid;
11427 PL_last_swash_hv = Nullhv; /* reinits on demand */
11428 PL_last_swash_klen = 0;
11429 PL_last_swash_key[0]= '\0';
11430 PL_last_swash_tmps = (U8*)NULL;
11431 PL_last_swash_slen = 0;
11433 PL_glob_index = proto_perl->Iglob_index;
11434 PL_srand_called = proto_perl->Isrand_called;
11435 PL_uudmap['M'] = 0; /* reinits on demand */
11436 PL_bitcount = Nullch; /* reinits on demand */
11438 if (proto_perl->Ipsig_pend) {
11439 Newxz(PL_psig_pend, SIG_SIZE, int);
11442 PL_psig_pend = (int*)NULL;
11445 if (proto_perl->Ipsig_ptr) {
11446 Newxz(PL_psig_ptr, SIG_SIZE, SV*);
11447 Newxz(PL_psig_name, SIG_SIZE, SV*);
11448 for (i = 1; i < SIG_SIZE; i++) {
11449 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11450 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11454 PL_psig_ptr = (SV**)NULL;
11455 PL_psig_name = (SV**)NULL;
11458 /* thrdvar.h stuff */
11460 if (flags & CLONEf_COPY_STACKS) {
11461 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11462 PL_tmps_ix = proto_perl->Ttmps_ix;
11463 PL_tmps_max = proto_perl->Ttmps_max;
11464 PL_tmps_floor = proto_perl->Ttmps_floor;
11465 Newxz(PL_tmps_stack, PL_tmps_max, SV*);
11467 while (i <= PL_tmps_ix) {
11468 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11472 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11473 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11474 Newxz(PL_markstack, i, I32);
11475 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11476 - proto_perl->Tmarkstack);
11477 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11478 - proto_perl->Tmarkstack);
11479 Copy(proto_perl->Tmarkstack, PL_markstack,
11480 PL_markstack_ptr - PL_markstack + 1, I32);
11482 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11483 * NOTE: unlike the others! */
11484 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11485 PL_scopestack_max = proto_perl->Tscopestack_max;
11486 Newxz(PL_scopestack, PL_scopestack_max, I32);
11487 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11489 /* NOTE: si_dup() looks at PL_markstack */
11490 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11492 /* PL_curstack = PL_curstackinfo->si_stack; */
11493 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11494 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11496 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11497 PL_stack_base = AvARRAY(PL_curstack);
11498 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11499 - proto_perl->Tstack_base);
11500 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11502 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11503 * NOTE: unlike the others! */
11504 PL_savestack_ix = proto_perl->Tsavestack_ix;
11505 PL_savestack_max = proto_perl->Tsavestack_max;
11506 /*Newxz(PL_savestack, PL_savestack_max, ANY);*/
11507 PL_savestack = ss_dup(proto_perl, param);
11511 ENTER; /* perl_destruct() wants to LEAVE; */
11514 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11515 PL_top_env = &PL_start_env;
11517 PL_op = proto_perl->Top;
11520 PL_Xpv = (XPV*)NULL;
11521 PL_na = proto_perl->Tna;
11523 PL_statbuf = proto_perl->Tstatbuf;
11524 PL_statcache = proto_perl->Tstatcache;
11525 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11526 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11528 PL_timesbuf = proto_perl->Ttimesbuf;
11531 PL_tainted = proto_perl->Ttainted;
11532 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11533 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11534 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11535 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11536 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11537 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11538 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11539 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11540 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11542 PL_restartop = proto_perl->Trestartop;
11543 PL_in_eval = proto_perl->Tin_eval;
11544 PL_delaymagic = proto_perl->Tdelaymagic;
11545 PL_dirty = proto_perl->Tdirty;
11546 PL_localizing = proto_perl->Tlocalizing;
11548 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11549 PL_hv_fetch_ent_mh = Nullhe;
11550 PL_modcount = proto_perl->Tmodcount;
11551 PL_lastgotoprobe = Nullop;
11552 PL_dumpindent = proto_perl->Tdumpindent;
11554 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11555 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11556 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11557 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11558 PL_sortcxix = proto_perl->Tsortcxix;
11559 PL_efloatbuf = Nullch; /* reinits on demand */
11560 PL_efloatsize = 0; /* reinits on demand */
11564 PL_screamfirst = NULL;
11565 PL_screamnext = NULL;
11566 PL_maxscream = -1; /* reinits on demand */
11567 PL_lastscream = Nullsv;
11569 PL_watchaddr = NULL;
11570 PL_watchok = Nullch;
11572 PL_regdummy = proto_perl->Tregdummy;
11573 PL_regprecomp = Nullch;
11576 PL_colorset = 0; /* reinits PL_colors[] */
11577 /*PL_colors[6] = {0,0,0,0,0,0};*/
11578 PL_reginput = Nullch;
11579 PL_regbol = Nullch;
11580 PL_regeol = Nullch;
11581 PL_regstartp = (I32*)NULL;
11582 PL_regendp = (I32*)NULL;
11583 PL_reglastparen = (U32*)NULL;
11584 PL_reglastcloseparen = (U32*)NULL;
11585 PL_regtill = Nullch;
11586 PL_reg_start_tmp = (char**)NULL;
11587 PL_reg_start_tmpl = 0;
11588 PL_regdata = (struct reg_data*)NULL;
11591 PL_reg_eval_set = 0;
11593 PL_regprogram = (regnode*)NULL;
11595 PL_regcc = (CURCUR*)NULL;
11596 PL_reg_call_cc = (struct re_cc_state*)NULL;
11597 PL_reg_re = (regexp*)NULL;
11598 PL_reg_ganch = Nullch;
11599 PL_reg_sv = Nullsv;
11600 PL_reg_match_utf8 = FALSE;
11601 PL_reg_magic = (MAGIC*)NULL;
11603 PL_reg_oldcurpm = (PMOP*)NULL;
11604 PL_reg_curpm = (PMOP*)NULL;
11605 PL_reg_oldsaved = Nullch;
11606 PL_reg_oldsavedlen = 0;
11607 #ifdef PERL_OLD_COPY_ON_WRITE
11610 PL_reg_maxiter = 0;
11611 PL_reg_leftiter = 0;
11612 PL_reg_poscache = Nullch;
11613 PL_reg_poscache_size= 0;
11615 /* RE engine - function pointers */
11616 PL_regcompp = proto_perl->Tregcompp;
11617 PL_regexecp = proto_perl->Tregexecp;
11618 PL_regint_start = proto_perl->Tregint_start;
11619 PL_regint_string = proto_perl->Tregint_string;
11620 PL_regfree = proto_perl->Tregfree;
11622 PL_reginterp_cnt = 0;
11623 PL_reg_starttry = 0;
11625 /* Pluggable optimizer */
11626 PL_peepp = proto_perl->Tpeepp;
11628 PL_stashcache = newHV();
11630 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11631 ptr_table_free(PL_ptr_table);
11632 PL_ptr_table = NULL;
11635 /* Call the ->CLONE method, if it exists, for each of the stashes
11636 identified by sv_dup() above.
11638 while(av_len(param->stashes) != -1) {
11639 HV* const stash = (HV*) av_shift(param->stashes);
11640 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11641 if (cloner && GvCV(cloner)) {
11646 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
11648 call_sv((SV*)GvCV(cloner), G_DISCARD);
11654 SvREFCNT_dec(param->stashes);
11656 /* orphaned? eg threads->new inside BEGIN or use */
11657 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
11658 (void)SvREFCNT_inc(PL_compcv);
11659 SAVEFREESV(PL_compcv);
11665 #endif /* USE_ITHREADS */
11668 =head1 Unicode Support
11670 =for apidoc sv_recode_to_utf8
11672 The encoding is assumed to be an Encode object, on entry the PV
11673 of the sv is assumed to be octets in that encoding, and the sv
11674 will be converted into Unicode (and UTF-8).
11676 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11677 is not a reference, nothing is done to the sv. If the encoding is not
11678 an C<Encode::XS> Encoding object, bad things will happen.
11679 (See F<lib/encoding.pm> and L<Encode>).
11681 The PV of the sv is returned.
11686 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11689 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11703 Passing sv_yes is wrong - it needs to be or'ed set of constants
11704 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11705 remove converted chars from source.
11707 Both will default the value - let them.
11709 XPUSHs(&PL_sv_yes);
11712 call_method("decode", G_SCALAR);
11716 s = SvPV_const(uni, len);
11717 if (s != SvPVX_const(sv)) {
11718 SvGROW(sv, len + 1);
11719 Move(s, SvPVX(sv), len + 1, char);
11720 SvCUR_set(sv, len);
11727 return SvPOKp(sv) ? SvPVX(sv) : NULL;
11731 =for apidoc sv_cat_decode
11733 The encoding is assumed to be an Encode object, the PV of the ssv is
11734 assumed to be octets in that encoding and decoding the input starts
11735 from the position which (PV + *offset) pointed to. The dsv will be
11736 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11737 when the string tstr appears in decoding output or the input ends on
11738 the PV of the ssv. The value which the offset points will be modified
11739 to the last input position on the ssv.
11741 Returns TRUE if the terminator was found, else returns FALSE.
11746 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11747 SV *ssv, int *offset, char *tstr, int tlen)
11751 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11762 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11763 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11765 call_method("cat_decode", G_SCALAR);
11767 ret = SvTRUE(TOPs);
11768 *offset = SvIV(offsv);
11774 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
11780 * c-indentation-style: bsd
11781 * c-basic-offset: 4
11782 * indent-tabs-mode: t
11785 * ex: set ts=8 sts=4 sw=4 noet: