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 */
4591 if (flags & SV_SMAGIC)
4596 =for apidoc sv_catsv
4598 Concatenates the string from SV C<ssv> onto the end of the string in
4599 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4600 not 'set' magic. See C<sv_catsv_mg>.
4602 =for apidoc sv_catsv_flags
4604 Concatenates the string from SV C<ssv> onto the end of the string in
4605 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4606 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4607 and C<sv_catsv_nomg> are implemented in terms of this function.
4612 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4617 if ((spv = SvPV_const(ssv, slen))) {
4618 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4619 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4620 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4621 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4622 dsv->sv_flags doesn't have that bit set.
4623 Andy Dougherty 12 Oct 2001
4625 const I32 sutf8 = DO_UTF8(ssv);
4628 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4630 dutf8 = DO_UTF8(dsv);
4632 if (dutf8 != sutf8) {
4634 /* Not modifying source SV, so taking a temporary copy. */
4635 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4637 sv_utf8_upgrade(csv);
4638 spv = SvPV_const(csv, slen);
4641 sv_utf8_upgrade_nomg(dsv);
4643 sv_catpvn_nomg(dsv, spv, slen);
4646 if (flags & SV_SMAGIC)
4651 =for apidoc sv_catpv
4653 Concatenates the string onto the end of the string which is in the SV.
4654 If the SV has the UTF-8 status set, then the bytes appended should be
4655 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4660 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4662 register STRLEN len;
4668 junk = SvPV_force(sv, tlen);
4670 SvGROW(sv, tlen + len + 1);
4672 ptr = SvPVX_const(sv);
4673 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4674 SvCUR_set(sv, SvCUR(sv) + len);
4675 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4680 =for apidoc sv_catpv_mg
4682 Like C<sv_catpv>, but also handles 'set' magic.
4688 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4697 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4698 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4705 Perl_newSV(pTHX_ STRLEN len)
4711 sv_upgrade(sv, SVt_PV);
4712 SvGROW(sv, len + 1);
4717 =for apidoc sv_magicext
4719 Adds magic to an SV, upgrading it if necessary. Applies the
4720 supplied vtable and returns a pointer to the magic added.
4722 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4723 In particular, you can add magic to SvREADONLY SVs, and add more than
4724 one instance of the same 'how'.
4726 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4727 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4728 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4729 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4731 (This is now used as a subroutine by C<sv_magic>.)
4736 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4737 const char* name, I32 namlen)
4741 if (SvTYPE(sv) < SVt_PVMG) {
4742 SvUPGRADE(sv, SVt_PVMG);
4744 Newxz(mg, 1, MAGIC);
4745 mg->mg_moremagic = SvMAGIC(sv);
4746 SvMAGIC_set(sv, mg);
4748 /* Sometimes a magic contains a reference loop, where the sv and
4749 object refer to each other. To prevent a reference loop that
4750 would prevent such objects being freed, we look for such loops
4751 and if we find one we avoid incrementing the object refcount.
4753 Note we cannot do this to avoid self-tie loops as intervening RV must
4754 have its REFCNT incremented to keep it in existence.
4757 if (!obj || obj == sv ||
4758 how == PERL_MAGIC_arylen ||
4759 how == PERL_MAGIC_qr ||
4760 how == PERL_MAGIC_symtab ||
4761 (SvTYPE(obj) == SVt_PVGV &&
4762 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4763 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4764 GvFORM(obj) == (CV*)sv)))
4769 mg->mg_obj = SvREFCNT_inc(obj);
4770 mg->mg_flags |= MGf_REFCOUNTED;
4773 /* Normal self-ties simply pass a null object, and instead of
4774 using mg_obj directly, use the SvTIED_obj macro to produce a
4775 new RV as needed. For glob "self-ties", we are tieing the PVIO
4776 with an RV obj pointing to the glob containing the PVIO. In
4777 this case, to avoid a reference loop, we need to weaken the
4781 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4782 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4788 mg->mg_len = namlen;
4791 mg->mg_ptr = savepvn(name, namlen);
4792 else if (namlen == HEf_SVKEY)
4793 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4795 mg->mg_ptr = (char *) name;
4797 mg->mg_virtual = vtable;
4801 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4806 =for apidoc sv_magic
4808 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4809 then adds a new magic item of type C<how> to the head of the magic list.
4811 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4812 handling of the C<name> and C<namlen> arguments.
4814 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4815 to add more than one instance of the same 'how'.
4821 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4823 const MGVTBL *vtable;
4826 #ifdef PERL_OLD_COPY_ON_WRITE
4828 sv_force_normal_flags(sv, 0);
4830 if (SvREADONLY(sv)) {
4832 /* its okay to attach magic to shared strings; the subsequent
4833 * upgrade to PVMG will unshare the string */
4834 !(SvFAKE(sv) && SvTYPE(sv) < SVt_PVMG)
4837 && how != PERL_MAGIC_regex_global
4838 && how != PERL_MAGIC_bm
4839 && how != PERL_MAGIC_fm
4840 && how != PERL_MAGIC_sv
4841 && how != PERL_MAGIC_backref
4844 Perl_croak(aTHX_ PL_no_modify);
4847 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4848 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4849 /* sv_magic() refuses to add a magic of the same 'how' as an
4852 if (how == PERL_MAGIC_taint)
4860 vtable = &PL_vtbl_sv;
4862 case PERL_MAGIC_overload:
4863 vtable = &PL_vtbl_amagic;
4865 case PERL_MAGIC_overload_elem:
4866 vtable = &PL_vtbl_amagicelem;
4868 case PERL_MAGIC_overload_table:
4869 vtable = &PL_vtbl_ovrld;
4872 vtable = &PL_vtbl_bm;
4874 case PERL_MAGIC_regdata:
4875 vtable = &PL_vtbl_regdata;
4877 case PERL_MAGIC_regdatum:
4878 vtable = &PL_vtbl_regdatum;
4880 case PERL_MAGIC_env:
4881 vtable = &PL_vtbl_env;
4884 vtable = &PL_vtbl_fm;
4886 case PERL_MAGIC_envelem:
4887 vtable = &PL_vtbl_envelem;
4889 case PERL_MAGIC_regex_global:
4890 vtable = &PL_vtbl_mglob;
4892 case PERL_MAGIC_isa:
4893 vtable = &PL_vtbl_isa;
4895 case PERL_MAGIC_isaelem:
4896 vtable = &PL_vtbl_isaelem;
4898 case PERL_MAGIC_nkeys:
4899 vtable = &PL_vtbl_nkeys;
4901 case PERL_MAGIC_dbfile:
4904 case PERL_MAGIC_dbline:
4905 vtable = &PL_vtbl_dbline;
4907 #ifdef USE_LOCALE_COLLATE
4908 case PERL_MAGIC_collxfrm:
4909 vtable = &PL_vtbl_collxfrm;
4911 #endif /* USE_LOCALE_COLLATE */
4912 case PERL_MAGIC_tied:
4913 vtable = &PL_vtbl_pack;
4915 case PERL_MAGIC_tiedelem:
4916 case PERL_MAGIC_tiedscalar:
4917 vtable = &PL_vtbl_packelem;
4920 vtable = &PL_vtbl_regexp;
4922 case PERL_MAGIC_sig:
4923 vtable = &PL_vtbl_sig;
4925 case PERL_MAGIC_sigelem:
4926 vtable = &PL_vtbl_sigelem;
4928 case PERL_MAGIC_taint:
4929 vtable = &PL_vtbl_taint;
4931 case PERL_MAGIC_uvar:
4932 vtable = &PL_vtbl_uvar;
4934 case PERL_MAGIC_vec:
4935 vtable = &PL_vtbl_vec;
4937 case PERL_MAGIC_arylen_p:
4938 case PERL_MAGIC_rhash:
4939 case PERL_MAGIC_symtab:
4940 case PERL_MAGIC_vstring:
4943 case PERL_MAGIC_utf8:
4944 vtable = &PL_vtbl_utf8;
4946 case PERL_MAGIC_substr:
4947 vtable = &PL_vtbl_substr;
4949 case PERL_MAGIC_defelem:
4950 vtable = &PL_vtbl_defelem;
4952 case PERL_MAGIC_glob:
4953 vtable = &PL_vtbl_glob;
4955 case PERL_MAGIC_arylen:
4956 vtable = &PL_vtbl_arylen;
4958 case PERL_MAGIC_pos:
4959 vtable = &PL_vtbl_pos;
4961 case PERL_MAGIC_backref:
4962 vtable = &PL_vtbl_backref;
4964 case PERL_MAGIC_ext:
4965 /* Reserved for use by extensions not perl internals. */
4966 /* Useful for attaching extension internal data to perl vars. */
4967 /* Note that multiple extensions may clash if magical scalars */
4968 /* etc holding private data from one are passed to another. */
4972 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4975 /* Rest of work is done else where */
4976 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4979 case PERL_MAGIC_taint:
4982 case PERL_MAGIC_ext:
4983 case PERL_MAGIC_dbfile:
4990 =for apidoc sv_unmagic
4992 Removes all magic of type C<type> from an SV.
4998 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5002 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5005 for (mg = *mgp; mg; mg = *mgp) {
5006 if (mg->mg_type == type) {
5007 const MGVTBL* const vtbl = mg->mg_virtual;
5008 *mgp = mg->mg_moremagic;
5009 if (vtbl && vtbl->svt_free)
5010 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5011 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5013 Safefree(mg->mg_ptr);
5014 else if (mg->mg_len == HEf_SVKEY)
5015 SvREFCNT_dec((SV*)mg->mg_ptr);
5016 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5017 Safefree(mg->mg_ptr);
5019 if (mg->mg_flags & MGf_REFCOUNTED)
5020 SvREFCNT_dec(mg->mg_obj);
5024 mgp = &mg->mg_moremagic;
5028 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5035 =for apidoc sv_rvweaken
5037 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5038 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5039 push a back-reference to this RV onto the array of backreferences
5040 associated with that magic.
5046 Perl_sv_rvweaken(pTHX_ SV *sv)
5049 if (!SvOK(sv)) /* let undefs pass */
5052 Perl_croak(aTHX_ "Can't weaken a nonreference");
5053 else if (SvWEAKREF(sv)) {
5054 if (ckWARN(WARN_MISC))
5055 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5059 Perl_sv_add_backref(aTHX_ tsv, sv);
5065 /* Give tsv backref magic if it hasn't already got it, then push a
5066 * back-reference to sv onto the array associated with the backref magic.
5070 Perl_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5074 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5075 av = (AV*)mg->mg_obj;
5078 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5079 /* av now has a refcnt of 2, which avoids it getting freed
5080 * before us during global cleanup. The extra ref is removed
5081 * by magic_killbackrefs() when tsv is being freed */
5083 if (AvFILLp(av) >= AvMAX(av)) {
5084 av_extend(av, AvFILLp(av)+1);
5086 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5089 /* delete a back-reference to ourselves from the backref magic associated
5090 * with the SV we point to.
5094 S_sv_del_backref(pTHX_ SV *tsv, SV *sv)
5100 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref))) {
5101 if (PL_in_clean_all)
5104 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5105 Perl_croak(aTHX_ "panic: del_backref");
5106 av = (AV *)mg->mg_obj;
5108 /* We shouldn't be in here more than once, but for paranoia reasons lets
5110 for (i = AvFILLp(av); i >= 0; i--) {
5112 const SSize_t fill = AvFILLp(av);
5114 /* We weren't the last entry.
5115 An unordered list has this property that you can take the
5116 last element off the end to fill the hole, and it's still
5117 an unordered list :-)
5122 AvFILLp(av) = fill - 1;
5128 =for apidoc sv_insert
5130 Inserts a string at the specified offset/length within the SV. Similar to
5131 the Perl substr() function.
5137 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5141 register char *midend;
5142 register char *bigend;
5148 Perl_croak(aTHX_ "Can't modify non-existent substring");
5149 SvPV_force(bigstr, curlen);
5150 (void)SvPOK_only_UTF8(bigstr);
5151 if (offset + len > curlen) {
5152 SvGROW(bigstr, offset+len+1);
5153 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5154 SvCUR_set(bigstr, offset+len);
5158 i = littlelen - len;
5159 if (i > 0) { /* string might grow */
5160 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5161 mid = big + offset + len;
5162 midend = bigend = big + SvCUR(bigstr);
5165 while (midend > mid) /* shove everything down */
5166 *--bigend = *--midend;
5167 Move(little,big+offset,littlelen,char);
5168 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5173 Move(little,SvPVX(bigstr)+offset,len,char);
5178 big = SvPVX(bigstr);
5181 bigend = big + SvCUR(bigstr);
5183 if (midend > bigend)
5184 Perl_croak(aTHX_ "panic: sv_insert");
5186 if (mid - big > bigend - midend) { /* faster to shorten from end */
5188 Move(little, mid, littlelen,char);
5191 i = bigend - midend;
5193 Move(midend, mid, i,char);
5197 SvCUR_set(bigstr, mid - big);
5199 else if ((i = mid - big)) { /* faster from front */
5200 midend -= littlelen;
5202 sv_chop(bigstr,midend-i);
5207 Move(little, mid, littlelen,char);
5209 else if (littlelen) {
5210 midend -= littlelen;
5211 sv_chop(bigstr,midend);
5212 Move(little,midend,littlelen,char);
5215 sv_chop(bigstr,midend);
5221 =for apidoc sv_replace
5223 Make the first argument a copy of the second, then delete the original.
5224 The target SV physically takes over ownership of the body of the source SV
5225 and inherits its flags; however, the target keeps any magic it owns,
5226 and any magic in the source is discarded.
5227 Note that this is a rather specialist SV copying operation; most of the
5228 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5234 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5236 const U32 refcnt = SvREFCNT(sv);
5237 SV_CHECK_THINKFIRST_COW_DROP(sv);
5238 if (SvREFCNT(nsv) != 1) {
5239 Perl_croak(aTHX_ "panic: reference miscount on nsv in sv_replace() (%"
5240 UVuf " != 1)", (UV) SvREFCNT(nsv));
5242 if (SvMAGICAL(sv)) {
5246 sv_upgrade(nsv, SVt_PVMG);
5247 SvMAGIC_set(nsv, SvMAGIC(sv));
5248 SvFLAGS(nsv) |= SvMAGICAL(sv);
5250 SvMAGIC_set(sv, NULL);
5254 assert(!SvREFCNT(sv));
5255 #ifdef DEBUG_LEAKING_SCALARS
5256 sv->sv_flags = nsv->sv_flags;
5257 sv->sv_any = nsv->sv_any;
5258 sv->sv_refcnt = nsv->sv_refcnt;
5259 sv->sv_u = nsv->sv_u;
5261 StructCopy(nsv,sv,SV);
5263 /* Currently could join these into one piece of pointer arithmetic, but
5264 it would be unclear. */
5265 if(SvTYPE(sv) == SVt_IV)
5267 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5268 else if (SvTYPE(sv) == SVt_RV) {
5269 SvANY(sv) = &sv->sv_u.svu_rv;
5273 #ifdef PERL_OLD_COPY_ON_WRITE
5274 if (SvIsCOW_normal(nsv)) {
5275 /* We need to follow the pointers around the loop to make the
5276 previous SV point to sv, rather than nsv. */
5279 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5282 assert(SvPVX_const(current) == SvPVX_const(nsv));
5284 /* Make the SV before us point to the SV after us. */
5286 PerlIO_printf(Perl_debug_log, "previous is\n");
5288 PerlIO_printf(Perl_debug_log,
5289 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5290 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5292 SV_COW_NEXT_SV_SET(current, sv);
5295 SvREFCNT(sv) = refcnt;
5296 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5302 =for apidoc sv_clear
5304 Clear an SV: call any destructors, free up any memory used by the body,
5305 and free the body itself. The SV's head is I<not> freed, although
5306 its type is set to all 1's so that it won't inadvertently be assumed
5307 to be live during global destruction etc.
5308 This function should only be called when REFCNT is zero. Most of the time
5309 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5316 Perl_sv_clear(pTHX_ register SV *sv)
5319 void** old_body_arena;
5320 size_t old_body_offset;
5321 const U32 type = SvTYPE(sv);
5324 assert(SvREFCNT(sv) == 0);
5330 old_body_offset = 0;
5333 if (PL_defstash) { /* Still have a symbol table? */
5338 stash = SvSTASH(sv);
5339 destructor = StashHANDLER(stash,DESTROY);
5341 SV* const tmpref = newRV(sv);
5342 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5344 PUSHSTACKi(PERLSI_DESTROY);
5349 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5355 if(SvREFCNT(tmpref) < 2) {
5356 /* tmpref is not kept alive! */
5358 SvRV_set(tmpref, NULL);
5361 SvREFCNT_dec(tmpref);
5363 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5367 if (PL_in_clean_objs)
5368 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5370 /* DESTROY gave object new lease on life */
5376 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5377 SvOBJECT_off(sv); /* Curse the object. */
5378 if (type != SVt_PVIO)
5379 --PL_sv_objcount; /* XXX Might want something more general */
5382 if (type >= SVt_PVMG) {
5385 if (type == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5386 SvREFCNT_dec(SvSTASH(sv));
5391 IoIFP(sv) != PerlIO_stdin() &&
5392 IoIFP(sv) != PerlIO_stdout() &&
5393 IoIFP(sv) != PerlIO_stderr())
5395 io_close((IO*)sv, FALSE);
5397 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5398 PerlDir_close(IoDIRP(sv));
5399 IoDIRP(sv) = (DIR*)NULL;
5400 Safefree(IoTOP_NAME(sv));
5401 Safefree(IoFMT_NAME(sv));
5402 Safefree(IoBOTTOM_NAME(sv));
5403 /* PVIOs aren't from arenas */
5406 old_body_arena = (void **) &PL_xpvbm_root;
5409 old_body_arena = (void **) &PL_xpvcv_root;
5411 /* PVFMs aren't from arenas */
5416 old_body_arena = (void **) &PL_xpvhv_root;
5417 old_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill);
5421 old_body_arena = (void **) &PL_xpvav_root;
5422 old_body_offset = STRUCT_OFFSET(XPVAV, xav_fill);
5425 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5426 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5427 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5428 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5430 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5431 SvREFCNT_dec(LvTARG(sv));
5432 old_body_arena = (void **) &PL_xpvlv_root;
5436 Safefree(GvNAME(sv));
5437 /* If we're in a stash, we don't own a reference to it. However it does
5438 have a back reference to us, which needs to be cleared. */
5440 sv_del_backref((SV*)GvSTASH(sv), sv);
5441 old_body_arena = (void **) &PL_xpvgv_root;
5444 old_body_arena = (void **) &PL_xpvmg_root;
5447 old_body_arena = (void **) &PL_xpvnv_root;
5450 old_body_arena = (void **) &PL_xpviv_root;
5451 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur);
5453 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5455 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5456 /* Don't even bother with turning off the OOK flag. */
5460 old_body_arena = (void **) &PL_xpv_root;
5461 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur);
5465 SV *target = SvRV(sv);
5467 sv_del_backref(target, sv);
5469 SvREFCNT_dec(target);
5471 #ifdef PERL_OLD_COPY_ON_WRITE
5472 else if (SvPVX_const(sv)) {
5474 /* I believe I need to grab the global SV mutex here and
5475 then recheck the COW status. */
5477 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5480 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5481 SV_COW_NEXT_SV(sv));
5482 /* And drop it here. */
5484 } else if (SvLEN(sv)) {
5485 Safefree(SvPVX_const(sv));
5489 else if (SvPVX_const(sv) && SvLEN(sv))
5490 Safefree(SvPVX_mutable(sv));
5491 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5492 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5498 old_body_arena = (void **) &PL_xnv_root;
5502 SvFLAGS(sv) &= SVf_BREAK;
5503 SvFLAGS(sv) |= SVTYPEMASK;
5506 if (old_body_arena) {
5507 del_body(((char *)SvANY(sv) + old_body_offset), old_body_arena);
5511 if (type > SVt_RV) {
5512 my_safefree(SvANY(sv));
5517 =for apidoc sv_newref
5519 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5526 Perl_sv_newref(pTHX_ SV *sv)
5536 Decrement an SV's reference count, and if it drops to zero, call
5537 C<sv_clear> to invoke destructors and free up any memory used by
5538 the body; finally, deallocate the SV's head itself.
5539 Normally called via a wrapper macro C<SvREFCNT_dec>.
5545 Perl_sv_free(pTHX_ SV *sv)
5550 if (SvREFCNT(sv) == 0) {
5551 if (SvFLAGS(sv) & SVf_BREAK)
5552 /* this SV's refcnt has been artificially decremented to
5553 * trigger cleanup */
5555 if (PL_in_clean_all) /* All is fair */
5557 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5558 /* make sure SvREFCNT(sv)==0 happens very seldom */
5559 SvREFCNT(sv) = (~(U32)0)/2;
5562 if (ckWARN_d(WARN_INTERNAL)) {
5563 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5564 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5565 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5566 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
5567 Perl_dump_sv_child(aTHX_ sv);
5572 if (--(SvREFCNT(sv)) > 0)
5574 Perl_sv_free2(aTHX_ sv);
5578 Perl_sv_free2(pTHX_ SV *sv)
5583 if (ckWARN_d(WARN_DEBUGGING))
5584 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5585 "Attempt to free temp prematurely: SV 0x%"UVxf
5586 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5590 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5591 /* make sure SvREFCNT(sv)==0 happens very seldom */
5592 SvREFCNT(sv) = (~(U32)0)/2;
5603 Returns the length of the string in the SV. Handles magic and type
5604 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5610 Perl_sv_len(pTHX_ register SV *sv)
5618 len = mg_length(sv);
5620 (void)SvPV_const(sv, len);
5625 =for apidoc sv_len_utf8
5627 Returns the number of characters in the string in an SV, counting wide
5628 UTF-8 bytes as a single character. Handles magic and type coercion.
5634 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5635 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5636 * (Note that the mg_len is not the length of the mg_ptr field.)
5641 Perl_sv_len_utf8(pTHX_ register SV *sv)
5647 return mg_length(sv);
5651 const U8 *s = (U8*)SvPV_const(sv, len);
5652 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5654 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5656 #ifdef PERL_UTF8_CACHE_ASSERT
5657 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5661 ulen = Perl_utf8_length(aTHX_ s, s + len);
5662 if (!mg && !SvREADONLY(sv)) {
5663 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5664 mg = mg_find(sv, PERL_MAGIC_utf8);
5674 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5675 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5676 * between UTF-8 and byte offsets. There are two (substr offset and substr
5677 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5678 * and byte offset) cache positions.
5680 * The mg_len field is used by sv_len_utf8(), see its comments.
5681 * Note that the mg_len is not the length of the mg_ptr field.
5685 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5686 I32 offsetp, const U8 *s, const U8 *start)
5690 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5692 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5696 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5698 Newxz(*cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5699 (*mgp)->mg_ptr = (char *) *cachep;
5703 (*cachep)[i] = offsetp;
5704 (*cachep)[i+1] = s - start;
5712 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5713 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5714 * between UTF-8 and byte offsets. See also the comments of
5715 * S_utf8_mg_pos_init().
5719 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)
5723 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5725 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5726 if (*mgp && (*mgp)->mg_ptr) {
5727 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5728 ASSERT_UTF8_CACHE(*cachep);
5729 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5731 else { /* We will skip to the right spot. */
5736 /* The assumption is that going backward is half
5737 * the speed of going forward (that's where the
5738 * 2 * backw in the below comes from). (The real
5739 * figure of course depends on the UTF-8 data.) */
5741 if ((*cachep)[i] > (STRLEN)uoff) {
5743 backw = (*cachep)[i] - (STRLEN)uoff;
5745 if (forw < 2 * backw)
5748 p = start + (*cachep)[i+1];
5750 /* Try this only for the substr offset (i == 0),
5751 * not for the substr length (i == 2). */
5752 else if (i == 0) { /* (*cachep)[i] < uoff */
5753 const STRLEN ulen = sv_len_utf8(sv);
5755 if ((STRLEN)uoff < ulen) {
5756 forw = (STRLEN)uoff - (*cachep)[i];
5757 backw = ulen - (STRLEN)uoff;
5759 if (forw < 2 * backw)
5760 p = start + (*cachep)[i+1];
5765 /* If the string is not long enough for uoff,
5766 * we could extend it, but not at this low a level. */
5770 if (forw < 2 * backw) {
5777 while (UTF8_IS_CONTINUATION(*p))
5782 /* Update the cache. */
5783 (*cachep)[i] = (STRLEN)uoff;
5784 (*cachep)[i+1] = p - start;
5786 /* Drop the stale "length" cache */
5795 if (found) { /* Setup the return values. */
5796 *offsetp = (*cachep)[i+1];
5797 *sp = start + *offsetp;
5800 *offsetp = send - start;
5802 else if (*sp < start) {
5808 #ifdef PERL_UTF8_CACHE_ASSERT
5813 while (n-- && s < send)
5817 assert(*offsetp == s - start);
5818 assert((*cachep)[0] == (STRLEN)uoff);
5819 assert((*cachep)[1] == *offsetp);
5821 ASSERT_UTF8_CACHE(*cachep);
5830 =for apidoc sv_pos_u2b
5832 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5833 the start of the string, to a count of the equivalent number of bytes; if
5834 lenp is non-zero, it does the same to lenp, but this time starting from
5835 the offset, rather than from the start of the string. Handles magic and
5842 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5843 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5844 * byte offsets. See also the comments of S_utf8_mg_pos().
5849 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5857 start = (U8*)SvPV_const(sv, len);
5861 const U8 *s = start;
5862 I32 uoffset = *offsetp;
5863 const U8 * const send = s + len;
5867 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5869 if (!found && uoffset > 0) {
5870 while (s < send && uoffset--)
5874 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
5876 *offsetp = s - start;
5881 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
5885 if (!found && *lenp > 0) {
5888 while (s < send && ulen--)
5892 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
5896 ASSERT_UTF8_CACHE(cache);
5908 =for apidoc sv_pos_b2u
5910 Converts the value pointed to by offsetp from a count of bytes from the
5911 start of the string, to a count of the equivalent number of UTF-8 chars.
5912 Handles magic and type coercion.
5918 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5919 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5920 * byte offsets. See also the comments of S_utf8_mg_pos().
5925 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5933 s = (const U8*)SvPV_const(sv, len);
5934 if ((I32)len < *offsetp)
5935 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5937 const U8* send = s + *offsetp;
5939 STRLEN *cache = NULL;
5943 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5944 mg = mg_find(sv, PERL_MAGIC_utf8);
5945 if (mg && mg->mg_ptr) {
5946 cache = (STRLEN *) mg->mg_ptr;
5947 if (cache[1] == (STRLEN)*offsetp) {
5948 /* An exact match. */
5949 *offsetp = cache[0];
5953 else if (cache[1] < (STRLEN)*offsetp) {
5954 /* We already know part of the way. */
5957 /* Let the below loop do the rest. */
5959 else { /* cache[1] > *offsetp */
5960 /* We already know all of the way, now we may
5961 * be able to walk back. The same assumption
5962 * is made as in S_utf8_mg_pos(), namely that
5963 * walking backward is twice slower than
5964 * walking forward. */
5965 const STRLEN forw = *offsetp;
5966 STRLEN backw = cache[1] - *offsetp;
5968 if (!(forw < 2 * backw)) {
5969 const U8 *p = s + cache[1];
5976 while (UTF8_IS_CONTINUATION(*p)) {
5984 *offsetp = cache[0];
5986 /* Drop the stale "length" cache */
5994 ASSERT_UTF8_CACHE(cache);
6000 /* Call utf8n_to_uvchr() to validate the sequence
6001 * (unless a simple non-UTF character) */
6002 if (!UTF8_IS_INVARIANT(*s))
6003 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6012 if (!SvREADONLY(sv)) {
6014 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6015 mg = mg_find(sv, PERL_MAGIC_utf8);
6020 Newxz(cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6021 mg->mg_ptr = (char *) cache;
6026 cache[1] = *offsetp;
6027 /* Drop the stale "length" cache */
6040 Returns a boolean indicating whether the strings in the two SVs are
6041 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6042 coerce its args to strings if necessary.
6048 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6056 SV* svrecode = Nullsv;
6063 pv1 = SvPV_const(sv1, cur1);
6070 pv2 = SvPV_const(sv2, cur2);
6072 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6073 /* Differing utf8ness.
6074 * Do not UTF8size the comparands as a side-effect. */
6077 svrecode = newSVpvn(pv2, cur2);
6078 sv_recode_to_utf8(svrecode, PL_encoding);
6079 pv2 = SvPV_const(svrecode, cur2);
6082 svrecode = newSVpvn(pv1, cur1);
6083 sv_recode_to_utf8(svrecode, PL_encoding);
6084 pv1 = SvPV_const(svrecode, cur1);
6086 /* Now both are in UTF-8. */
6088 SvREFCNT_dec(svrecode);
6093 bool is_utf8 = TRUE;
6096 /* sv1 is the UTF-8 one,
6097 * if is equal it must be downgrade-able */
6098 char * const pv = (char*)bytes_from_utf8((const U8*)pv1,
6104 /* sv2 is the UTF-8 one,
6105 * if is equal it must be downgrade-able */
6106 char * const pv = (char *)bytes_from_utf8((const U8*)pv2,
6112 /* Downgrade not possible - cannot be eq */
6120 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6123 SvREFCNT_dec(svrecode);
6134 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6135 string in C<sv1> is less than, equal to, or greater than the string in
6136 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6137 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6143 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6146 const char *pv1, *pv2;
6149 SV *svrecode = Nullsv;
6156 pv1 = SvPV_const(sv1, cur1);
6163 pv2 = SvPV_const(sv2, cur2);
6165 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6166 /* Differing utf8ness.
6167 * Do not UTF8size the comparands as a side-effect. */
6170 svrecode = newSVpvn(pv2, cur2);
6171 sv_recode_to_utf8(svrecode, PL_encoding);
6172 pv2 = SvPV_const(svrecode, cur2);
6175 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6180 svrecode = newSVpvn(pv1, cur1);
6181 sv_recode_to_utf8(svrecode, PL_encoding);
6182 pv1 = SvPV_const(svrecode, cur1);
6185 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6191 cmp = cur2 ? -1 : 0;
6195 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6198 cmp = retval < 0 ? -1 : 1;
6199 } else if (cur1 == cur2) {
6202 cmp = cur1 < cur2 ? -1 : 1;
6207 SvREFCNT_dec(svrecode);
6216 =for apidoc sv_cmp_locale
6218 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6219 'use bytes' aware, handles get magic, and will coerce its args to strings
6220 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6226 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6228 #ifdef USE_LOCALE_COLLATE
6234 if (PL_collation_standard)
6238 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6240 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6242 if (!pv1 || !len1) {
6253 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6256 return retval < 0 ? -1 : 1;
6259 * When the result of collation is equality, that doesn't mean
6260 * that there are no differences -- some locales exclude some
6261 * characters from consideration. So to avoid false equalities,
6262 * we use the raw string as a tiebreaker.
6268 #endif /* USE_LOCALE_COLLATE */
6270 return sv_cmp(sv1, sv2);
6274 #ifdef USE_LOCALE_COLLATE
6277 =for apidoc sv_collxfrm
6279 Add Collate Transform magic to an SV if it doesn't already have it.
6281 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6282 scalar data of the variable, but transformed to such a format that a normal
6283 memory comparison can be used to compare the data according to the locale
6290 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6294 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6295 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6301 Safefree(mg->mg_ptr);
6302 s = SvPV_const(sv, len);
6303 if ((xf = mem_collxfrm(s, len, &xlen))) {
6304 if (SvREADONLY(sv)) {
6307 return xf + sizeof(PL_collation_ix);
6310 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6311 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6324 if (mg && mg->mg_ptr) {
6326 return mg->mg_ptr + sizeof(PL_collation_ix);
6334 #endif /* USE_LOCALE_COLLATE */
6339 Get a line from the filehandle and store it into the SV, optionally
6340 appending to the currently-stored string.
6346 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6350 register STDCHAR rslast;
6351 register STDCHAR *bp;
6357 if (SvTHINKFIRST(sv))
6358 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6359 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6361 However, perlbench says it's slower, because the existing swipe code
6362 is faster than copy on write.
6363 Swings and roundabouts. */
6364 SvUPGRADE(sv, SVt_PV);
6369 if (PerlIO_isutf8(fp)) {
6371 sv_utf8_upgrade_nomg(sv);
6372 sv_pos_u2b(sv,&append,0);
6374 } else if (SvUTF8(sv)) {
6375 SV * const tsv = NEWSV(0,0);
6376 sv_gets(tsv, fp, 0);
6377 sv_utf8_upgrade_nomg(tsv);
6378 SvCUR_set(sv,append);
6381 goto return_string_or_null;
6386 if (PerlIO_isutf8(fp))
6389 if (IN_PERL_COMPILETIME) {
6390 /* we always read code in line mode */
6394 else if (RsSNARF(PL_rs)) {
6395 /* If it is a regular disk file use size from stat() as estimate
6396 of amount we are going to read - may result in malloc-ing
6397 more memory than we realy need if layers bellow reduce
6398 size we read (e.g. CRLF or a gzip layer)
6401 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6402 const Off_t offset = PerlIO_tell(fp);
6403 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6404 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6410 else if (RsRECORD(PL_rs)) {
6414 /* Grab the size of the record we're getting */
6415 recsize = SvIV(SvRV(PL_rs));
6416 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6419 /* VMS wants read instead of fread, because fread doesn't respect */
6420 /* RMS record boundaries. This is not necessarily a good thing to be */
6421 /* doing, but we've got no other real choice - except avoid stdio
6422 as implementation - perhaps write a :vms layer ?
6424 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6426 bytesread = PerlIO_read(fp, buffer, recsize);
6430 SvCUR_set(sv, bytesread += append);
6431 buffer[bytesread] = '\0';
6432 goto return_string_or_null;
6434 else if (RsPARA(PL_rs)) {
6440 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6441 if (PerlIO_isutf8(fp)) {
6442 rsptr = SvPVutf8(PL_rs, rslen);
6445 if (SvUTF8(PL_rs)) {
6446 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6447 Perl_croak(aTHX_ "Wide character in $/");
6450 rsptr = SvPV_const(PL_rs, rslen);
6454 rslast = rslen ? rsptr[rslen - 1] : '\0';
6456 if (rspara) { /* have to do this both before and after */
6457 do { /* to make sure file boundaries work right */
6460 i = PerlIO_getc(fp);
6464 PerlIO_ungetc(fp,i);
6470 /* See if we know enough about I/O mechanism to cheat it ! */
6472 /* This used to be #ifdef test - it is made run-time test for ease
6473 of abstracting out stdio interface. One call should be cheap
6474 enough here - and may even be a macro allowing compile
6478 if (PerlIO_fast_gets(fp)) {
6481 * We're going to steal some values from the stdio struct
6482 * and put EVERYTHING in the innermost loop into registers.
6484 register STDCHAR *ptr;
6488 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6489 /* An ungetc()d char is handled separately from the regular
6490 * buffer, so we getc() it back out and stuff it in the buffer.
6492 i = PerlIO_getc(fp);
6493 if (i == EOF) return 0;
6494 *(--((*fp)->_ptr)) = (unsigned char) i;
6498 /* Here is some breathtakingly efficient cheating */
6500 cnt = PerlIO_get_cnt(fp); /* get count into register */
6501 /* make sure we have the room */
6502 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6503 /* Not room for all of it
6504 if we are looking for a separator and room for some
6506 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6507 /* just process what we have room for */
6508 shortbuffered = cnt - SvLEN(sv) + append + 1;
6509 cnt -= shortbuffered;
6513 /* remember that cnt can be negative */
6514 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6519 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6520 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6521 DEBUG_P(PerlIO_printf(Perl_debug_log,
6522 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6523 DEBUG_P(PerlIO_printf(Perl_debug_log,
6524 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6525 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6526 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6531 while (cnt > 0) { /* this | eat */
6533 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6534 goto thats_all_folks; /* screams | sed :-) */
6538 Copy(ptr, bp, cnt, char); /* this | eat */
6539 bp += cnt; /* screams | dust */
6540 ptr += cnt; /* louder | sed :-) */
6545 if (shortbuffered) { /* oh well, must extend */
6546 cnt = shortbuffered;
6548 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6550 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6551 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6555 DEBUG_P(PerlIO_printf(Perl_debug_log,
6556 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6557 PTR2UV(ptr),(long)cnt));
6558 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6560 DEBUG_P(PerlIO_printf(Perl_debug_log,
6561 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6562 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6563 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6565 /* This used to call 'filbuf' in stdio form, but as that behaves like
6566 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6567 another abstraction. */
6568 i = PerlIO_getc(fp); /* get more characters */
6570 DEBUG_P(PerlIO_printf(Perl_debug_log,
6571 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6572 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6573 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6575 cnt = PerlIO_get_cnt(fp);
6576 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6577 DEBUG_P(PerlIO_printf(Perl_debug_log,
6578 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6580 if (i == EOF) /* all done for ever? */
6581 goto thats_really_all_folks;
6583 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6585 SvGROW(sv, bpx + cnt + 2);
6586 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6588 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6590 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6591 goto thats_all_folks;
6595 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6596 memNE((char*)bp - rslen, rsptr, rslen))
6597 goto screamer; /* go back to the fray */
6598 thats_really_all_folks:
6600 cnt += shortbuffered;
6601 DEBUG_P(PerlIO_printf(Perl_debug_log,
6602 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6603 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6604 DEBUG_P(PerlIO_printf(Perl_debug_log,
6605 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6606 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6607 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6609 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6610 DEBUG_P(PerlIO_printf(Perl_debug_log,
6611 "Screamer: done, len=%ld, string=|%.*s|\n",
6612 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6616 /*The big, slow, and stupid way. */
6617 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6619 Newx(buf, 8192, STDCHAR);
6627 register const STDCHAR *bpe = buf + sizeof(buf);
6629 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6630 ; /* keep reading */
6634 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6635 /* Accomodate broken VAXC compiler, which applies U8 cast to
6636 * both args of ?: operator, causing EOF to change into 255
6639 i = (U8)buf[cnt - 1];
6645 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6647 sv_catpvn(sv, (char *) buf, cnt);
6649 sv_setpvn(sv, (char *) buf, cnt);
6651 if (i != EOF && /* joy */
6653 SvCUR(sv) < rslen ||
6654 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6658 * If we're reading from a TTY and we get a short read,
6659 * indicating that the user hit his EOF character, we need
6660 * to notice it now, because if we try to read from the TTY
6661 * again, the EOF condition will disappear.
6663 * The comparison of cnt to sizeof(buf) is an optimization
6664 * that prevents unnecessary calls to feof().
6668 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6672 #ifdef USE_HEAP_INSTEAD_OF_STACK
6677 if (rspara) { /* have to do this both before and after */
6678 while (i != EOF) { /* to make sure file boundaries work right */
6679 i = PerlIO_getc(fp);
6681 PerlIO_ungetc(fp,i);
6687 return_string_or_null:
6688 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6694 Auto-increment of the value in the SV, doing string to numeric conversion
6695 if necessary. Handles 'get' magic.
6701 Perl_sv_inc(pTHX_ register SV *sv)
6709 if (SvTHINKFIRST(sv)) {
6711 sv_force_normal_flags(sv, 0);
6712 if (SvREADONLY(sv)) {
6713 if (IN_PERL_RUNTIME)
6714 Perl_croak(aTHX_ PL_no_modify);
6718 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6720 i = PTR2IV(SvRV(sv));
6725 flags = SvFLAGS(sv);
6726 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6727 /* It's (privately or publicly) a float, but not tested as an
6728 integer, so test it to see. */
6730 flags = SvFLAGS(sv);
6732 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6733 /* It's publicly an integer, or privately an integer-not-float */
6734 #ifdef PERL_PRESERVE_IVUV
6738 if (SvUVX(sv) == UV_MAX)
6739 sv_setnv(sv, UV_MAX_P1);
6741 (void)SvIOK_only_UV(sv);
6742 SvUV_set(sv, SvUVX(sv) + 1);
6744 if (SvIVX(sv) == IV_MAX)
6745 sv_setuv(sv, (UV)IV_MAX + 1);
6747 (void)SvIOK_only(sv);
6748 SvIV_set(sv, SvIVX(sv) + 1);
6753 if (flags & SVp_NOK) {
6754 (void)SvNOK_only(sv);
6755 SvNV_set(sv, SvNVX(sv) + 1.0);
6759 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6760 if ((flags & SVTYPEMASK) < SVt_PVIV)
6761 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6762 (void)SvIOK_only(sv);
6767 while (isALPHA(*d)) d++;
6768 while (isDIGIT(*d)) d++;
6770 #ifdef PERL_PRESERVE_IVUV
6771 /* Got to punt this as an integer if needs be, but we don't issue
6772 warnings. Probably ought to make the sv_iv_please() that does
6773 the conversion if possible, and silently. */
6774 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6775 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6776 /* Need to try really hard to see if it's an integer.
6777 9.22337203685478e+18 is an integer.
6778 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6779 so $a="9.22337203685478e+18"; $a+0; $a++
6780 needs to be the same as $a="9.22337203685478e+18"; $a++
6787 /* sv_2iv *should* have made this an NV */
6788 if (flags & SVp_NOK) {
6789 (void)SvNOK_only(sv);
6790 SvNV_set(sv, SvNVX(sv) + 1.0);
6793 /* I don't think we can get here. Maybe I should assert this
6794 And if we do get here I suspect that sv_setnv will croak. NWC
6796 #if defined(USE_LONG_DOUBLE)
6797 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",
6798 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6800 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6801 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6804 #endif /* PERL_PRESERVE_IVUV */
6805 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6809 while (d >= SvPVX_const(sv)) {
6817 /* MKS: The original code here died if letters weren't consecutive.
6818 * at least it didn't have to worry about non-C locales. The
6819 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6820 * arranged in order (although not consecutively) and that only
6821 * [A-Za-z] are accepted by isALPHA in the C locale.
6823 if (*d != 'z' && *d != 'Z') {
6824 do { ++*d; } while (!isALPHA(*d));
6827 *(d--) -= 'z' - 'a';
6832 *(d--) -= 'z' - 'a' + 1;
6836 /* oh,oh, the number grew */
6837 SvGROW(sv, SvCUR(sv) + 2);
6838 SvCUR_set(sv, SvCUR(sv) + 1);
6839 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
6850 Auto-decrement of the value in the SV, doing string to numeric conversion
6851 if necessary. Handles 'get' magic.
6857 Perl_sv_dec(pTHX_ register SV *sv)
6864 if (SvTHINKFIRST(sv)) {
6866 sv_force_normal_flags(sv, 0);
6867 if (SvREADONLY(sv)) {
6868 if (IN_PERL_RUNTIME)
6869 Perl_croak(aTHX_ PL_no_modify);
6873 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6875 i = PTR2IV(SvRV(sv));
6880 /* Unlike sv_inc we don't have to worry about string-never-numbers
6881 and keeping them magic. But we mustn't warn on punting */
6882 flags = SvFLAGS(sv);
6883 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6884 /* It's publicly an integer, or privately an integer-not-float */
6885 #ifdef PERL_PRESERVE_IVUV
6889 if (SvUVX(sv) == 0) {
6890 (void)SvIOK_only(sv);
6894 (void)SvIOK_only_UV(sv);
6895 SvUV_set(sv, SvUVX(sv) - 1);
6898 if (SvIVX(sv) == IV_MIN)
6899 sv_setnv(sv, (NV)IV_MIN - 1.0);
6901 (void)SvIOK_only(sv);
6902 SvIV_set(sv, SvIVX(sv) - 1);
6907 if (flags & SVp_NOK) {
6908 SvNV_set(sv, SvNVX(sv) - 1.0);
6909 (void)SvNOK_only(sv);
6912 if (!(flags & SVp_POK)) {
6913 if ((flags & SVTYPEMASK) < SVt_PVIV)
6914 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
6916 (void)SvIOK_only(sv);
6919 #ifdef PERL_PRESERVE_IVUV
6921 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6922 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6923 /* Need to try really hard to see if it's an integer.
6924 9.22337203685478e+18 is an integer.
6925 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6926 so $a="9.22337203685478e+18"; $a+0; $a--
6927 needs to be the same as $a="9.22337203685478e+18"; $a--
6934 /* sv_2iv *should* have made this an NV */
6935 if (flags & SVp_NOK) {
6936 (void)SvNOK_only(sv);
6937 SvNV_set(sv, SvNVX(sv) - 1.0);
6940 /* I don't think we can get here. Maybe I should assert this
6941 And if we do get here I suspect that sv_setnv will croak. NWC
6943 #if defined(USE_LONG_DOUBLE)
6944 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",
6945 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6947 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6948 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6952 #endif /* PERL_PRESERVE_IVUV */
6953 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
6957 =for apidoc sv_mortalcopy
6959 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6960 The new SV is marked as mortal. It will be destroyed "soon", either by an
6961 explicit call to FREETMPS, or by an implicit call at places such as
6962 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6967 /* Make a string that will exist for the duration of the expression
6968 * evaluation. Actually, it may have to last longer than that, but
6969 * hopefully we won't free it until it has been assigned to a
6970 * permanent location. */
6973 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6978 sv_setsv(sv,oldstr);
6980 PL_tmps_stack[++PL_tmps_ix] = sv;
6986 =for apidoc sv_newmortal
6988 Creates a new null SV which is mortal. The reference count of the SV is
6989 set to 1. It will be destroyed "soon", either by an explicit call to
6990 FREETMPS, or by an implicit call at places such as statement boundaries.
6991 See also C<sv_mortalcopy> and C<sv_2mortal>.
6997 Perl_sv_newmortal(pTHX)
7002 SvFLAGS(sv) = SVs_TEMP;
7004 PL_tmps_stack[++PL_tmps_ix] = sv;
7009 =for apidoc sv_2mortal
7011 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7012 by an explicit call to FREETMPS, or by an implicit call at places such as
7013 statement boundaries. SvTEMP() is turned on which means that the SV's
7014 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7015 and C<sv_mortalcopy>.
7021 Perl_sv_2mortal(pTHX_ register SV *sv)
7026 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7029 PL_tmps_stack[++PL_tmps_ix] = sv;
7037 Creates a new SV and copies a string into it. The reference count for the
7038 SV is set to 1. If C<len> is zero, Perl will compute the length using
7039 strlen(). For efficiency, consider using C<newSVpvn> instead.
7045 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7050 sv_setpvn(sv,s,len ? len : strlen(s));
7055 =for apidoc newSVpvn
7057 Creates a new SV and copies a string into it. The reference count for the
7058 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7059 string. You are responsible for ensuring that the source string is at least
7060 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7066 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7071 sv_setpvn(sv,s,len);
7077 =for apidoc newSVhek
7079 Creates a new SV from the hash key structure. It will generate scalars that
7080 point to the shared string table where possible. Returns a new (undefined)
7081 SV if the hek is NULL.
7087 Perl_newSVhek(pTHX_ const HEK *hek)
7096 if (HEK_LEN(hek) == HEf_SVKEY) {
7097 return newSVsv(*(SV**)HEK_KEY(hek));
7099 const int flags = HEK_FLAGS(hek);
7100 if (flags & HVhek_WASUTF8) {
7102 Andreas would like keys he put in as utf8 to come back as utf8
7104 STRLEN utf8_len = HEK_LEN(hek);
7105 const U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7106 SV * const sv = newSVpvn ((const char*)as_utf8, utf8_len);
7109 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7111 } else if (flags & HVhek_REHASH) {
7112 /* We don't have a pointer to the hv, so we have to replicate the
7113 flag into every HEK. This hv is using custom a hasing
7114 algorithm. Hence we can't return a shared string scalar, as
7115 that would contain the (wrong) hash value, and might get passed
7116 into an hv routine with a regular hash */
7118 SV * const sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7123 /* This will be overwhelminly the most common case. */
7124 return newSVpvn_share(HEK_KEY(hek),
7125 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7131 =for apidoc newSVpvn_share
7133 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7134 table. If the string does not already exist in the table, it is created
7135 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7136 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7137 otherwise the hash is computed. The idea here is that as the string table
7138 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7139 hash lookup will avoid string compare.
7145 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7148 bool is_utf8 = FALSE;
7150 STRLEN tmplen = -len;
7152 /* See the note in hv.c:hv_fetch() --jhi */
7153 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7157 PERL_HASH(hash, src, len);
7159 sv_upgrade(sv, SVt_PV);
7160 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7172 #if defined(PERL_IMPLICIT_CONTEXT)
7174 /* pTHX_ magic can't cope with varargs, so this is a no-context
7175 * version of the main function, (which may itself be aliased to us).
7176 * Don't access this version directly.
7180 Perl_newSVpvf_nocontext(const char* pat, ...)
7185 va_start(args, pat);
7186 sv = vnewSVpvf(pat, &args);
7193 =for apidoc newSVpvf
7195 Creates a new SV and initializes it with the string formatted like
7202 Perl_newSVpvf(pTHX_ const char* pat, ...)
7206 va_start(args, pat);
7207 sv = vnewSVpvf(pat, &args);
7212 /* backend for newSVpvf() and newSVpvf_nocontext() */
7215 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7219 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7226 Creates a new SV and copies a floating point value into it.
7227 The reference count for the SV is set to 1.
7233 Perl_newSVnv(pTHX_ NV n)
7245 Creates a new SV and copies an integer into it. The reference count for the
7252 Perl_newSViv(pTHX_ IV i)
7264 Creates a new SV and copies an unsigned integer into it.
7265 The reference count for the SV is set to 1.
7271 Perl_newSVuv(pTHX_ UV u)
7281 =for apidoc newRV_noinc
7283 Creates an RV wrapper for an SV. The reference count for the original
7284 SV is B<not> incremented.
7290 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7295 sv_upgrade(sv, SVt_RV);
7297 SvRV_set(sv, tmpRef);
7302 /* newRV_inc is the official function name to use now.
7303 * newRV_inc is in fact #defined to newRV in sv.h
7307 Perl_newRV(pTHX_ SV *tmpRef)
7309 return newRV_noinc(SvREFCNT_inc(tmpRef));
7315 Creates a new SV which is an exact duplicate of the original SV.
7322 Perl_newSVsv(pTHX_ register SV *old)
7328 if (SvTYPE(old) == SVTYPEMASK) {
7329 if (ckWARN_d(WARN_INTERNAL))
7330 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7334 /* SV_GMAGIC is the default for sv_setv()
7335 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7336 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7337 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7342 =for apidoc sv_reset
7344 Underlying implementation for the C<reset> Perl function.
7345 Note that the perl-level function is vaguely deprecated.
7351 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7354 char todo[PERL_UCHAR_MAX+1];
7359 if (!*s) { /* reset ?? searches */
7360 MAGIC * const mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7362 PMOP *pm = (PMOP *) mg->mg_obj;
7364 pm->op_pmdynflags &= ~PMdf_USED;
7371 /* reset variables */
7373 if (!HvARRAY(stash))
7376 Zero(todo, 256, char);
7379 I32 i = (unsigned char)*s;
7383 max = (unsigned char)*s++;
7384 for ( ; i <= max; i++) {
7387 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7389 for (entry = HvARRAY(stash)[i];
7391 entry = HeNEXT(entry))
7396 if (!todo[(U8)*HeKEY(entry)])
7398 gv = (GV*)HeVAL(entry);
7401 if (SvTHINKFIRST(sv)) {
7402 if (!SvREADONLY(sv) && SvROK(sv))
7404 /* XXX Is this continue a bug? Why should THINKFIRST
7405 exempt us from resetting arrays and hashes? */
7409 if (SvTYPE(sv) >= SVt_PV) {
7411 if (SvPVX_const(sv) != Nullch)
7419 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7422 #ifdef USE_ENVIRON_ARRAY
7424 # ifdef USE_ITHREADS
7425 && PL_curinterp == aTHX
7429 environ[0] = Nullch;
7432 #endif /* !PERL_MICRO */
7442 Using various gambits, try to get an IO from an SV: the IO slot if its a
7443 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7444 named after the PV if we're a string.
7450 Perl_sv_2io(pTHX_ SV *sv)
7455 switch (SvTYPE(sv)) {
7463 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7467 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7469 return sv_2io(SvRV(sv));
7470 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7476 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7485 Using various gambits, try to get a CV from an SV; in addition, try if
7486 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7492 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7499 return *gvp = Nullgv, Nullcv;
7500 switch (SvTYPE(sv)) {
7518 SV * const *sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7519 tryAMAGICunDEREF(to_cv);
7522 if (SvTYPE(sv) == SVt_PVCV) {
7531 Perl_croak(aTHX_ "Not a subroutine reference");
7536 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7542 if (lref && !GvCVu(gv)) {
7545 tmpsv = NEWSV(704,0);
7546 gv_efullname3(tmpsv, gv, Nullch);
7547 /* XXX this is probably not what they think they're getting.
7548 * It has the same effect as "sub name;", i.e. just a forward
7550 newSUB(start_subparse(FALSE, 0),
7551 newSVOP(OP_CONST, 0, tmpsv),
7556 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7566 Returns true if the SV has a true value by Perl's rules.
7567 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7568 instead use an in-line version.
7574 Perl_sv_true(pTHX_ register SV *sv)
7579 register const XPV* const tXpv = (XPV*)SvANY(sv);
7581 (tXpv->xpv_cur > 1 ||
7582 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7589 return SvIVX(sv) != 0;
7592 return SvNVX(sv) != 0.0;
7594 return sv_2bool(sv);
7600 =for apidoc sv_pvn_force
7602 Get a sensible string out of the SV somehow.
7603 A private implementation of the C<SvPV_force> macro for compilers which
7604 can't cope with complex macro expressions. Always use the macro instead.
7606 =for apidoc sv_pvn_force_flags
7608 Get a sensible string out of the SV somehow.
7609 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7610 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7611 implemented in terms of this function.
7612 You normally want to use the various wrapper macros instead: see
7613 C<SvPV_force> and C<SvPV_force_nomg>
7619 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7622 if (SvTHINKFIRST(sv) && !SvROK(sv))
7623 sv_force_normal_flags(sv, 0);
7633 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7634 const char * const ref = sv_reftype(sv,0);
7636 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7637 ref, OP_NAME(PL_op));
7639 Perl_croak(aTHX_ "Can't coerce readonly %s to string", ref);
7641 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM)
7642 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7644 s = sv_2pv_flags(sv, &len, flags);
7648 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7651 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7652 SvGROW(sv, len + 1);
7653 Move(s,SvPVX(sv),len,char);
7658 SvPOK_on(sv); /* validate pointer */
7660 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7661 PTR2UV(sv),SvPVX_const(sv)));
7664 return SvPVX_mutable(sv);
7668 =for apidoc sv_pvbyten_force
7670 The backend for the C<SvPVbytex_force> macro. Always use the macro instead.
7676 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7678 sv_pvn_force(sv,lp);
7679 sv_utf8_downgrade(sv,0);
7685 =for apidoc sv_pvutf8n_force
7687 The backend for the C<SvPVutf8x_force> macro. Always use the macro instead.
7693 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7695 sv_pvn_force(sv,lp);
7696 sv_utf8_upgrade(sv);
7702 =for apidoc sv_reftype
7704 Returns a string describing what the SV is a reference to.
7710 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
7712 /* The fact that I don't need to downcast to char * everywhere, only in ?:
7713 inside return suggests a const propagation bug in g++. */
7714 if (ob && SvOBJECT(sv)) {
7715 char * const name = HvNAME_get(SvSTASH(sv));
7716 return name ? name : (char *) "__ANON__";
7719 switch (SvTYPE(sv)) {
7736 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
7737 /* tied lvalues should appear to be
7738 * scalars for backwards compatitbility */
7739 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7740 ? "SCALAR" : "LVALUE");
7741 case SVt_PVAV: return "ARRAY";
7742 case SVt_PVHV: return "HASH";
7743 case SVt_PVCV: return "CODE";
7744 case SVt_PVGV: return "GLOB";
7745 case SVt_PVFM: return "FORMAT";
7746 case SVt_PVIO: return "IO";
7747 default: return "UNKNOWN";
7753 =for apidoc sv_isobject
7755 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7756 object. If the SV is not an RV, or if the object is not blessed, then this
7763 Perl_sv_isobject(pTHX_ SV *sv)
7779 Returns a boolean indicating whether the SV is blessed into the specified
7780 class. This does not check for subtypes; use C<sv_derived_from> to verify
7781 an inheritance relationship.
7787 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7798 hvname = HvNAME_get(SvSTASH(sv));
7802 return strEQ(hvname, name);
7808 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7809 it will be upgraded to one. If C<classname> is non-null then the new SV will
7810 be blessed in the specified package. The new SV is returned and its
7811 reference count is 1.
7817 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7823 SV_CHECK_THINKFIRST_COW_DROP(rv);
7826 if (SvTYPE(rv) >= SVt_PVMG) {
7827 const U32 refcnt = SvREFCNT(rv);
7831 SvREFCNT(rv) = refcnt;
7834 if (SvTYPE(rv) < SVt_RV)
7835 sv_upgrade(rv, SVt_RV);
7836 else if (SvTYPE(rv) > SVt_RV) {
7847 HV* const stash = gv_stashpv(classname, TRUE);
7848 (void)sv_bless(rv, stash);
7854 =for apidoc sv_setref_pv
7856 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7857 argument will be upgraded to an RV. That RV will be modified to point to
7858 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7859 into the SV. The C<classname> argument indicates the package for the
7860 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7861 will have a reference count of 1, and the RV will be returned.
7863 Do not use with other Perl types such as HV, AV, SV, CV, because those
7864 objects will become corrupted by the pointer copy process.
7866 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7872 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7875 sv_setsv(rv, &PL_sv_undef);
7879 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7884 =for apidoc sv_setref_iv
7886 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7887 argument will be upgraded to an RV. That RV will be modified to point to
7888 the new SV. The C<classname> argument indicates the package for the
7889 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7890 will have a reference count of 1, and the RV will be returned.
7896 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7898 sv_setiv(newSVrv(rv,classname), iv);
7903 =for apidoc sv_setref_uv
7905 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7906 argument will be upgraded to an RV. That RV will be modified to point to
7907 the new SV. The C<classname> argument indicates the package for the
7908 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7909 will have a reference count of 1, and the RV will be returned.
7915 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7917 sv_setuv(newSVrv(rv,classname), uv);
7922 =for apidoc sv_setref_nv
7924 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7925 argument will be upgraded to an RV. That RV will be modified to point to
7926 the new SV. The C<classname> argument indicates the package for the
7927 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7928 will have a reference count of 1, and the RV will be returned.
7934 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7936 sv_setnv(newSVrv(rv,classname), nv);
7941 =for apidoc sv_setref_pvn
7943 Copies a string into a new SV, optionally blessing the SV. The length of the
7944 string must be specified with C<n>. The C<rv> argument will be upgraded to
7945 an RV. That RV will be modified to point to the new SV. The C<classname>
7946 argument indicates the package for the blessing. Set C<classname> to
7947 C<Nullch> to avoid the blessing. The new SV will have a reference count
7948 of 1, and the RV will be returned.
7950 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7956 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
7958 sv_setpvn(newSVrv(rv,classname), pv, n);
7963 =for apidoc sv_bless
7965 Blesses an SV into a specified package. The SV must be an RV. The package
7966 must be designated by its stash (see C<gv_stashpv()>). The reference count
7967 of the SV is unaffected.
7973 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7977 Perl_croak(aTHX_ "Can't bless non-reference value");
7979 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7980 if (SvREADONLY(tmpRef))
7981 Perl_croak(aTHX_ PL_no_modify);
7982 if (SvOBJECT(tmpRef)) {
7983 if (SvTYPE(tmpRef) != SVt_PVIO)
7985 SvREFCNT_dec(SvSTASH(tmpRef));
7988 SvOBJECT_on(tmpRef);
7989 if (SvTYPE(tmpRef) != SVt_PVIO)
7991 SvUPGRADE(tmpRef, SVt_PVMG);
7992 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
7999 if(SvSMAGICAL(tmpRef))
8000 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8008 /* Downgrades a PVGV to a PVMG.
8012 S_sv_unglob(pTHX_ SV *sv)
8016 assert(SvTYPE(sv) == SVt_PVGV);
8021 sv_del_backref((SV*)GvSTASH(sv), sv);
8022 GvSTASH(sv) = Nullhv;
8024 sv_unmagic(sv, PERL_MAGIC_glob);
8025 Safefree(GvNAME(sv));
8028 /* need to keep SvANY(sv) in the right arena */
8029 xpvmg = new_XPVMG();
8030 StructCopy(SvANY(sv), xpvmg, XPVMG);
8031 del_XPVGV(SvANY(sv));
8034 SvFLAGS(sv) &= ~SVTYPEMASK;
8035 SvFLAGS(sv) |= SVt_PVMG;
8039 =for apidoc sv_unref_flags
8041 Unsets the RV status of the SV, and decrements the reference count of
8042 whatever was being referenced by the RV. This can almost be thought of
8043 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8044 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8045 (otherwise the decrementing is conditional on the reference count being
8046 different from one or the reference being a readonly SV).
8053 Perl_sv_unref_flags(pTHX_ SV *ref, U32 flags)
8055 SV* const target = SvRV(ref);
8057 if (SvWEAKREF(ref)) {
8058 sv_del_backref(target, ref);
8060 SvRV_set(ref, NULL);
8063 SvRV_set(ref, NULL);
8065 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
8066 assigned to as BEGIN {$a = \"Foo"} will fail. */
8067 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
8068 SvREFCNT_dec(target);
8069 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8070 sv_2mortal(target); /* Schedule for freeing later */
8074 =for apidoc sv_untaint
8076 Untaint an SV. Use C<SvTAINTED_off> instead.
8081 Perl_sv_untaint(pTHX_ SV *sv)
8083 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8084 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8091 =for apidoc sv_tainted
8093 Test an SV for taintedness. Use C<SvTAINTED> instead.
8098 Perl_sv_tainted(pTHX_ SV *sv)
8100 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8101 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8102 if (mg && (mg->mg_len & 1) )
8109 =for apidoc sv_setpviv
8111 Copies an integer into the given SV, also updating its string value.
8112 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8118 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8120 char buf[TYPE_CHARS(UV)];
8122 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8124 sv_setpvn(sv, ptr, ebuf - ptr);
8128 =for apidoc sv_setpviv_mg
8130 Like C<sv_setpviv>, but also handles 'set' magic.
8136 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8142 #if defined(PERL_IMPLICIT_CONTEXT)
8144 /* pTHX_ magic can't cope with varargs, so this is a no-context
8145 * version of the main function, (which may itself be aliased to us).
8146 * Don't access this version directly.
8150 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8154 va_start(args, pat);
8155 sv_vsetpvf(sv, pat, &args);
8159 /* pTHX_ magic can't cope with varargs, so this is a no-context
8160 * version of the main function, (which may itself be aliased to us).
8161 * Don't access this version directly.
8165 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8169 va_start(args, pat);
8170 sv_vsetpvf_mg(sv, pat, &args);
8176 =for apidoc sv_setpvf
8178 Works like C<sv_catpvf> but copies the text into the SV instead of
8179 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8185 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8188 va_start(args, pat);
8189 sv_vsetpvf(sv, pat, &args);
8194 =for apidoc sv_vsetpvf
8196 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8197 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8199 Usually used via its frontend C<sv_setpvf>.
8205 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8207 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8211 =for apidoc sv_setpvf_mg
8213 Like C<sv_setpvf>, but also handles 'set' magic.
8219 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8222 va_start(args, pat);
8223 sv_vsetpvf_mg(sv, pat, &args);
8228 =for apidoc sv_vsetpvf_mg
8230 Like C<sv_vsetpvf>, but also handles 'set' magic.
8232 Usually used via its frontend C<sv_setpvf_mg>.
8238 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8240 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8244 #if defined(PERL_IMPLICIT_CONTEXT)
8246 /* pTHX_ magic can't cope with varargs, so this is a no-context
8247 * version of the main function, (which may itself be aliased to us).
8248 * Don't access this version directly.
8252 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8256 va_start(args, pat);
8257 sv_vcatpvf(sv, pat, &args);
8261 /* pTHX_ magic can't cope with varargs, so this is a no-context
8262 * version of the main function, (which may itself be aliased to us).
8263 * Don't access this version directly.
8267 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8271 va_start(args, pat);
8272 sv_vcatpvf_mg(sv, pat, &args);
8278 =for apidoc sv_catpvf
8280 Processes its arguments like C<sprintf> and appends the formatted
8281 output to an SV. If the appended data contains "wide" characters
8282 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8283 and characters >255 formatted with %c), the original SV might get
8284 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8285 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8286 valid UTF-8; if the original SV was bytes, the pattern should be too.
8291 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8294 va_start(args, pat);
8295 sv_vcatpvf(sv, pat, &args);
8300 =for apidoc sv_vcatpvf
8302 Processes its arguments like C<vsprintf> and appends the formatted output
8303 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8305 Usually used via its frontend C<sv_catpvf>.
8311 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8313 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8317 =for apidoc sv_catpvf_mg
8319 Like C<sv_catpvf>, but also handles 'set' magic.
8325 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8328 va_start(args, pat);
8329 sv_vcatpvf_mg(sv, pat, &args);
8334 =for apidoc sv_vcatpvf_mg
8336 Like C<sv_vcatpvf>, but also handles 'set' magic.
8338 Usually used via its frontend C<sv_catpvf_mg>.
8344 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8346 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8351 =for apidoc sv_vsetpvfn
8353 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8356 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8362 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8364 sv_setpvn(sv, "", 0);
8365 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8368 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8371 S_expect_number(pTHX_ char** pattern)
8374 switch (**pattern) {
8375 case '1': case '2': case '3':
8376 case '4': case '5': case '6':
8377 case '7': case '8': case '9':
8378 while (isDIGIT(**pattern))
8379 var = var * 10 + (*(*pattern)++ - '0');
8383 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8386 F0convert(NV nv, char *endbuf, STRLEN *len)
8388 const int neg = nv < 0;
8397 if (uv & 1 && uv == nv)
8398 uv--; /* Round to even */
8400 const unsigned dig = uv % 10;
8413 =for apidoc sv_vcatpvfn
8415 Processes its arguments like C<vsprintf> and appends the formatted output
8416 to an SV. Uses an array of SVs if the C style variable argument list is
8417 missing (NULL). When running with taint checks enabled, indicates via
8418 C<maybe_tainted> if results are untrustworthy (often due to the use of
8421 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8427 #define VECTORIZE_ARGS vecsv = va_arg(*args, SV*);\
8428 vecstr = (U8*)SvPV_const(vecsv,veclen);\
8429 vec_utf8 = DO_UTF8(vecsv);
8431 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8434 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8441 static const char nullstr[] = "(null)";
8443 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8444 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8446 /* Times 4: a decimal digit takes more than 3 binary digits.
8447 * NV_DIG: mantissa takes than many decimal digits.
8448 * Plus 32: Playing safe. */
8449 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8450 /* large enough for "%#.#f" --chip */
8451 /* what about long double NVs? --jhi */
8453 PERL_UNUSED_ARG(maybe_tainted);
8455 /* no matter what, this is a string now */
8456 (void)SvPV_force(sv, origlen);
8458 /* special-case "", "%s", and "%-p" (SVf - see below) */
8461 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8463 const char * const s = va_arg(*args, char*);
8464 sv_catpv(sv, s ? s : nullstr);
8466 else if (svix < svmax) {
8467 sv_catsv(sv, *svargs);
8468 if (DO_UTF8(*svargs))
8473 if (args && patlen == 3 && pat[0] == '%' &&
8474 pat[1] == '-' && pat[2] == 'p') {
8475 argsv = va_arg(*args, SV*);
8476 sv_catsv(sv, argsv);
8482 #ifndef USE_LONG_DOUBLE
8483 /* special-case "%.<number>[gf]" */
8484 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8485 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8486 unsigned digits = 0;
8490 while (*pp >= '0' && *pp <= '9')
8491 digits = 10 * digits + (*pp++ - '0');
8492 if (pp - pat == (int)patlen - 1) {
8500 /* Add check for digits != 0 because it seems that some
8501 gconverts are buggy in this case, and we don't yet have
8502 a Configure test for this. */
8503 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8504 /* 0, point, slack */
8505 Gconvert(nv, (int)digits, 0, ebuf);
8507 if (*ebuf) /* May return an empty string for digits==0 */
8510 } else if (!digits) {
8513 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8514 sv_catpvn(sv, p, l);
8520 #endif /* !USE_LONG_DOUBLE */
8522 if (!args && svix < svmax && DO_UTF8(*svargs))
8525 patend = (char*)pat + patlen;
8526 for (p = (char*)pat; p < patend; p = q) {
8529 bool vectorize = FALSE;
8530 bool vectorarg = FALSE;
8531 bool vec_utf8 = FALSE;
8537 bool has_precis = FALSE;
8540 bool is_utf8 = FALSE; /* is this item utf8? */
8541 #ifdef HAS_LDBL_SPRINTF_BUG
8542 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8543 with sfio - Allen <allens@cpan.org> */
8544 bool fix_ldbl_sprintf_bug = FALSE;
8548 U8 utf8buf[UTF8_MAXBYTES+1];
8549 STRLEN esignlen = 0;
8551 const char *eptr = Nullch;
8554 const U8 *vecstr = Null(U8*);
8561 /* we need a long double target in case HAS_LONG_DOUBLE but
8564 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8572 const char *dotstr = ".";
8573 STRLEN dotstrlen = 1;
8574 I32 efix = 0; /* explicit format parameter index */
8575 I32 ewix = 0; /* explicit width index */
8576 I32 epix = 0; /* explicit precision index */
8577 I32 evix = 0; /* explicit vector index */
8578 bool asterisk = FALSE;
8580 /* echo everything up to the next format specification */
8581 for (q = p; q < patend && *q != '%'; ++q) ;
8583 if (has_utf8 && !pat_utf8)
8584 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8586 sv_catpvn(sv, p, q - p);
8593 We allow format specification elements in this order:
8594 \d+\$ explicit format parameter index
8596 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8597 0 flag (as above): repeated to allow "v02"
8598 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8599 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8601 [%bcdefginopsuxDFOUX] format (mandatory)
8606 As of perl5.9.3, printf format checking is on by default.
8607 Internally, perl uses %p formats to provide an escape to
8608 some extended formatting. This block deals with those
8609 extensions: if it does not match, (char*)q is reset and
8610 the normal format processing code is used.
8612 Currently defined extensions are:
8613 %p include pointer address (standard)
8614 %-p (SVf) include an SV (previously %_)
8615 %-<num>p include an SV with precision <num>
8616 %1p (VDf) include a v-string (as %vd)
8617 %<num>p reserved for future extensions
8619 Robin Barker 2005-07-14
8626 EXPECT_NUMBER(q, n);
8633 argsv = va_arg(*args, SV*);
8634 eptr = SvPVx_const(argsv, elen);
8640 else if (n == vdNUMBER) { /* VDf */
8647 if (ckWARN_d(WARN_INTERNAL))
8648 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
8649 "internal %%<num>p might conflict with future printf extensions");
8655 if (EXPECT_NUMBER(q, width)) {
8696 if (EXPECT_NUMBER(q, ewix))
8705 if ((vectorarg = asterisk)) {
8718 EXPECT_NUMBER(q, width);
8724 vecsv = va_arg(*args, SV*);
8726 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8727 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8728 dotstr = SvPV_const(vecsv, dotstrlen);
8735 else if (efix ? efix <= svmax : svix < svmax) {
8736 vecsv = svargs[efix ? efix-1 : svix++];
8737 vecstr = (U8*)SvPV_const(vecsv,veclen);
8738 vec_utf8 = DO_UTF8(vecsv);
8739 /* if this is a version object, we need to return the
8740 * stringified representation (which the SvPVX_const has
8741 * already done for us), but not vectorize the args
8743 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
8745 q++; /* skip past the rest of the %vd format */
8746 eptr = (const char *) vecstr;
8747 elen = strlen(eptr);
8760 i = va_arg(*args, int);
8762 i = (ewix ? ewix <= svmax : svix < svmax) ?
8763 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8765 width = (i < 0) ? -i : i;
8775 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8777 /* XXX: todo, support specified precision parameter */
8781 i = va_arg(*args, int);
8783 i = (ewix ? ewix <= svmax : svix < svmax)
8784 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8785 precis = (i < 0) ? 0 : i;
8790 precis = precis * 10 + (*q++ - '0');
8799 case 'I': /* Ix, I32x, and I64x */
8801 if (q[1] == '6' && q[2] == '4') {
8807 if (q[1] == '3' && q[2] == '2') {
8817 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8828 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8829 if (*(q + 1) == 'l') { /* lld, llf */
8854 argsv = (efix ? efix <= svmax : svix < svmax) ?
8855 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8862 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8864 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8866 eptr = (char*)utf8buf;
8867 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8878 if (args && !vectorize) {
8879 eptr = va_arg(*args, char*);
8881 #ifdef MACOS_TRADITIONAL
8882 /* On MacOS, %#s format is used for Pascal strings */
8887 elen = strlen(eptr);
8889 eptr = (char *)nullstr;
8890 elen = sizeof nullstr - 1;
8894 eptr = SvPVx_const(argsv, elen);
8895 if (DO_UTF8(argsv)) {
8896 if (has_precis && precis < elen) {
8898 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8901 if (width) { /* fudge width (can't fudge elen) */
8902 width += elen - sv_len_utf8(argsv);
8910 if (has_precis && elen > precis)
8917 if (alt || vectorize)
8919 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8940 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8949 esignbuf[esignlen++] = plus;
8953 case 'h': iv = (short)va_arg(*args, int); break;
8954 case 'l': iv = va_arg(*args, long); break;
8955 case 'V': iv = va_arg(*args, IV); break;
8956 default: iv = va_arg(*args, int); break;
8958 case 'q': iv = va_arg(*args, Quad_t); break;
8963 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
8965 case 'h': iv = (short)tiv; break;
8966 case 'l': iv = (long)tiv; break;
8968 default: iv = tiv; break;
8970 case 'q': iv = (Quad_t)tiv; break;
8974 if ( !vectorize ) /* we already set uv above */
8979 esignbuf[esignlen++] = plus;
8983 esignbuf[esignlen++] = '-';
9026 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9037 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9038 case 'l': uv = va_arg(*args, unsigned long); break;
9039 case 'V': uv = va_arg(*args, UV); break;
9040 default: uv = va_arg(*args, unsigned); break;
9042 case 'q': uv = va_arg(*args, Uquad_t); break;
9047 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9049 case 'h': uv = (unsigned short)tuv; break;
9050 case 'l': uv = (unsigned long)tuv; break;
9052 default: uv = tuv; break;
9054 case 'q': uv = (Uquad_t)tuv; break;
9061 char *ptr = ebuf + sizeof ebuf;
9067 p = (char*)((c == 'X')
9068 ? "0123456789ABCDEF" : "0123456789abcdef");
9074 esignbuf[esignlen++] = '0';
9075 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9083 if (alt && *ptr != '0')
9092 esignbuf[esignlen++] = '0';
9093 esignbuf[esignlen++] = 'b';
9096 default: /* it had better be ten or less */
9100 } while (uv /= base);
9103 elen = (ebuf + sizeof ebuf) - ptr;
9107 zeros = precis - elen;
9108 else if (precis == 0 && elen == 1 && *eptr == '0')
9114 /* FLOATING POINT */
9117 c = 'f'; /* maybe %F isn't supported here */
9123 /* This is evil, but floating point is even more evil */
9125 /* for SV-style calling, we can only get NV
9126 for C-style calling, we assume %f is double;
9127 for simplicity we allow any of %Lf, %llf, %qf for long double
9131 #if defined(USE_LONG_DOUBLE)
9135 /* [perl #20339] - we should accept and ignore %lf rather than die */
9139 #if defined(USE_LONG_DOUBLE)
9140 intsize = args ? 0 : 'q';
9144 #if defined(HAS_LONG_DOUBLE)
9153 /* now we need (long double) if intsize == 'q', else (double) */
9154 nv = (args && !vectorize) ?
9155 #if LONG_DOUBLESIZE > DOUBLESIZE
9157 va_arg(*args, long double) :
9158 va_arg(*args, double)
9160 va_arg(*args, double)
9166 if (c != 'e' && c != 'E') {
9168 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9169 will cast our (long double) to (double) */
9170 (void)Perl_frexp(nv, &i);
9171 if (i == PERL_INT_MIN)
9172 Perl_die(aTHX_ "panic: frexp");
9174 need = BIT_DIGITS(i);
9176 need += has_precis ? precis : 6; /* known default */
9181 #ifdef HAS_LDBL_SPRINTF_BUG
9182 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9183 with sfio - Allen <allens@cpan.org> */
9186 # define MY_DBL_MAX DBL_MAX
9187 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9188 # if DOUBLESIZE >= 8
9189 # define MY_DBL_MAX 1.7976931348623157E+308L
9191 # define MY_DBL_MAX 3.40282347E+38L
9195 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9196 # define MY_DBL_MAX_BUG 1L
9198 # define MY_DBL_MAX_BUG MY_DBL_MAX
9202 # define MY_DBL_MIN DBL_MIN
9203 # else /* XXX guessing! -Allen */
9204 # if DOUBLESIZE >= 8
9205 # define MY_DBL_MIN 2.2250738585072014E-308L
9207 # define MY_DBL_MIN 1.17549435E-38L
9211 if ((intsize == 'q') && (c == 'f') &&
9212 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9214 /* it's going to be short enough that
9215 * long double precision is not needed */
9217 if ((nv <= 0L) && (nv >= -0L))
9218 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9220 /* would use Perl_fp_class as a double-check but not
9221 * functional on IRIX - see perl.h comments */
9223 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9224 /* It's within the range that a double can represent */
9225 #if defined(DBL_MAX) && !defined(DBL_MIN)
9226 if ((nv >= ((long double)1/DBL_MAX)) ||
9227 (nv <= (-(long double)1/DBL_MAX)))
9229 fix_ldbl_sprintf_bug = TRUE;
9232 if (fix_ldbl_sprintf_bug == TRUE) {
9242 # undef MY_DBL_MAX_BUG
9245 #endif /* HAS_LDBL_SPRINTF_BUG */
9247 need += 20; /* fudge factor */
9248 if (PL_efloatsize < need) {
9249 Safefree(PL_efloatbuf);
9250 PL_efloatsize = need + 20; /* more fudge */
9251 Newx(PL_efloatbuf, PL_efloatsize, char);
9252 PL_efloatbuf[0] = '\0';
9255 if ( !(width || left || plus || alt) && fill != '0'
9256 && has_precis && intsize != 'q' ) { /* Shortcuts */
9257 /* See earlier comment about buggy Gconvert when digits,
9259 if ( c == 'g' && precis) {
9260 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9261 /* May return an empty string for digits==0 */
9262 if (*PL_efloatbuf) {
9263 elen = strlen(PL_efloatbuf);
9264 goto float_converted;
9266 } else if ( c == 'f' && !precis) {
9267 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9272 char *ptr = ebuf + sizeof ebuf;
9275 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9276 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9277 if (intsize == 'q') {
9278 /* Copy the one or more characters in a long double
9279 * format before the 'base' ([efgEFG]) character to
9280 * the format string. */
9281 static char const prifldbl[] = PERL_PRIfldbl;
9282 char const *p = prifldbl + sizeof(prifldbl) - 3;
9283 while (p >= prifldbl) { *--ptr = *p--; }
9288 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9293 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9305 /* No taint. Otherwise we are in the strange situation
9306 * where printf() taints but print($float) doesn't.
9308 #if defined(HAS_LONG_DOUBLE)
9309 elen = ((intsize == 'q')
9310 ? my_sprintf(PL_efloatbuf, ptr, nv)
9311 : my_sprintf(PL_efloatbuf, ptr, (double)nv));
9313 elen = my_sprintf(PL_efloatbuf, ptr, nv);
9317 eptr = PL_efloatbuf;
9323 i = SvCUR(sv) - origlen;
9324 if (args && !vectorize) {
9326 case 'h': *(va_arg(*args, short*)) = i; break;
9327 default: *(va_arg(*args, int*)) = i; break;
9328 case 'l': *(va_arg(*args, long*)) = i; break;
9329 case 'V': *(va_arg(*args, IV*)) = i; break;
9331 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9336 sv_setuv_mg(argsv, (UV)i);
9338 continue; /* not "break" */
9345 && (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)
9346 && ckWARN(WARN_PRINTF))
9348 SV *msg = sv_newmortal();
9349 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9350 (PL_op->op_type == OP_PRTF) ? "" : "s");
9353 Perl_sv_catpvf(aTHX_ msg,
9354 "\"%%%c\"", c & 0xFF);
9356 Perl_sv_catpvf(aTHX_ msg,
9357 "\"%%\\%03"UVof"\"",
9360 sv_catpv(msg, "end of string");
9361 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9364 /* output mangled stuff ... */
9370 /* ... right here, because formatting flags should not apply */
9371 SvGROW(sv, SvCUR(sv) + elen + 1);
9373 Copy(eptr, p, elen, char);
9376 SvCUR_set(sv, p - SvPVX_const(sv));
9378 continue; /* not "break" */
9381 /* calculate width before utf8_upgrade changes it */
9382 have = esignlen + zeros + elen;
9384 if (is_utf8 != has_utf8) {
9387 sv_utf8_upgrade(sv);
9390 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
9391 sv_utf8_upgrade(nsv);
9392 eptr = SvPVX_const(nsv);
9395 SvGROW(sv, SvCUR(sv) + elen + 1);
9400 need = (have > width ? have : width);
9403 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9405 if (esignlen && fill == '0') {
9407 for (i = 0; i < (int)esignlen; i++)
9411 memset(p, fill, gap);
9414 if (esignlen && fill != '0') {
9416 for (i = 0; i < (int)esignlen; i++)
9421 for (i = zeros; i; i--)
9425 Copy(eptr, p, elen, char);
9429 memset(p, ' ', gap);
9434 Copy(dotstr, p, dotstrlen, char);
9438 vectorize = FALSE; /* done iterating over vecstr */
9445 SvCUR_set(sv, p - SvPVX_const(sv));
9453 /* =========================================================================
9455 =head1 Cloning an interpreter
9457 All the macros and functions in this section are for the private use of
9458 the main function, perl_clone().
9460 The foo_dup() functions make an exact copy of an existing foo thinngy.
9461 During the course of a cloning, a hash table is used to map old addresses
9462 to new addresses. The table is created and manipulated with the
9463 ptr_table_* functions.
9467 ============================================================================*/
9470 #if defined(USE_ITHREADS)
9472 #ifndef GpREFCNT_inc
9473 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9477 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9478 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9479 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9480 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9481 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9482 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9483 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9484 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9485 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9486 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9487 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9488 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9489 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9492 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9493 regcomp.c. AMS 20010712 */
9496 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
9501 struct reg_substr_datum *s;
9504 return (REGEXP *)NULL;
9506 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9509 len = r->offsets[0];
9510 npar = r->nparens+1;
9512 Newxc(ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9513 Copy(r->program, ret->program, len+1, regnode);
9515 Newx(ret->startp, npar, I32);
9516 Copy(r->startp, ret->startp, npar, I32);
9517 Newx(ret->endp, npar, I32);
9518 Copy(r->startp, ret->startp, npar, I32);
9520 Newx(ret->substrs, 1, struct reg_substr_data);
9521 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9522 s->min_offset = r->substrs->data[i].min_offset;
9523 s->max_offset = r->substrs->data[i].max_offset;
9524 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9525 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9528 ret->regstclass = NULL;
9531 const int count = r->data->count;
9534 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
9535 char, struct reg_data);
9536 Newx(d->what, count, U8);
9539 for (i = 0; i < count; i++) {
9540 d->what[i] = r->data->what[i];
9541 switch (d->what[i]) {
9542 /* legal options are one of: sfpont
9543 see also regcomp.h and pregfree() */
9545 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9548 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9551 /* This is cheating. */
9552 Newx(d->data[i], 1, struct regnode_charclass_class);
9553 StructCopy(r->data->data[i], d->data[i],
9554 struct regnode_charclass_class);
9555 ret->regstclass = (regnode*)d->data[i];
9558 /* Compiled op trees are readonly, and can thus be
9559 shared without duplication. */
9561 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9565 d->data[i] = r->data->data[i];
9568 d->data[i] = r->data->data[i];
9570 ((reg_trie_data*)d->data[i])->refcount++;
9574 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9583 Newx(ret->offsets, 2*len+1, U32);
9584 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9586 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9587 ret->refcnt = r->refcnt;
9588 ret->minlen = r->minlen;
9589 ret->prelen = r->prelen;
9590 ret->nparens = r->nparens;
9591 ret->lastparen = r->lastparen;
9592 ret->lastcloseparen = r->lastcloseparen;
9593 ret->reganch = r->reganch;
9595 ret->sublen = r->sublen;
9597 if (RX_MATCH_COPIED(ret))
9598 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9600 ret->subbeg = Nullch;
9601 #ifdef PERL_OLD_COPY_ON_WRITE
9602 ret->saved_copy = Nullsv;
9605 ptr_table_store(PL_ptr_table, r, ret);
9609 /* duplicate a file handle */
9612 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9616 PERL_UNUSED_ARG(type);
9619 return (PerlIO*)NULL;
9621 /* look for it in the table first */
9622 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9626 /* create anew and remember what it is */
9627 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9628 ptr_table_store(PL_ptr_table, fp, ret);
9632 /* duplicate a directory handle */
9635 Perl_dirp_dup(pTHX_ DIR *dp)
9643 /* duplicate a typeglob */
9646 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9651 /* look for it in the table first */
9652 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9656 /* create anew and remember what it is */
9658 ptr_table_store(PL_ptr_table, gp, ret);
9661 ret->gp_refcnt = 0; /* must be before any other dups! */
9662 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9663 ret->gp_io = io_dup_inc(gp->gp_io, param);
9664 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9665 ret->gp_av = av_dup_inc(gp->gp_av, param);
9666 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9667 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9668 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9669 ret->gp_cvgen = gp->gp_cvgen;
9670 ret->gp_line = gp->gp_line;
9671 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9675 /* duplicate a chain of magic */
9678 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9680 MAGIC *mgprev = (MAGIC*)NULL;
9683 return (MAGIC*)NULL;
9684 /* look for it in the table first */
9685 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9689 for (; mg; mg = mg->mg_moremagic) {
9691 Newxz(nmg, 1, MAGIC);
9693 mgprev->mg_moremagic = nmg;
9696 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9697 nmg->mg_private = mg->mg_private;
9698 nmg->mg_type = mg->mg_type;
9699 nmg->mg_flags = mg->mg_flags;
9700 if (mg->mg_type == PERL_MAGIC_qr) {
9701 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9703 else if(mg->mg_type == PERL_MAGIC_backref) {
9704 const AV * const av = (AV*) mg->mg_obj;
9707 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
9709 for (i = AvFILLp(av); i >= 0; i--) {
9710 if (!svp[i]) continue;
9711 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9714 else if (mg->mg_type == PERL_MAGIC_symtab) {
9715 nmg->mg_obj = mg->mg_obj;
9718 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9719 ? sv_dup_inc(mg->mg_obj, param)
9720 : sv_dup(mg->mg_obj, param);
9722 nmg->mg_len = mg->mg_len;
9723 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9724 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9725 if (mg->mg_len > 0) {
9726 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9727 if (mg->mg_type == PERL_MAGIC_overload_table &&
9728 AMT_AMAGIC((AMT*)mg->mg_ptr))
9730 AMT *amtp = (AMT*)mg->mg_ptr;
9731 AMT *namtp = (AMT*)nmg->mg_ptr;
9733 for (i = 1; i < NofAMmeth; i++) {
9734 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9738 else if (mg->mg_len == HEf_SVKEY)
9739 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9741 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9742 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9749 /* create a new pointer-mapping table */
9752 Perl_ptr_table_new(pTHX)
9755 Newxz(tbl, 1, PTR_TBL_t);
9758 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9763 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
9765 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
9768 #define del_pte(p) del_body_type(p, struct ptr_tbl_ent, pte)
9770 /* map an existing pointer using a table */
9773 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
9775 PTR_TBL_ENT_t *tblent;
9776 const UV hash = PTR_TABLE_HASH(sv);
9778 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9779 for (; tblent; tblent = tblent->next) {
9780 if (tblent->oldval == sv)
9781 return tblent->newval;
9786 /* add a new entry to a pointer-mapping table */
9789 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldsv, void *newsv)
9791 PTR_TBL_ENT_t *tblent, **otblent;
9792 /* XXX this may be pessimal on platforms where pointers aren't good
9793 * hash values e.g. if they grow faster in the most significant
9795 const UV hash = PTR_TABLE_HASH(oldsv);
9799 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9800 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
9801 if (tblent->oldval == oldsv) {
9802 tblent->newval = newsv;
9806 new_body_inline(tblent, (void**)&PL_pte_arenaroot, (void**)&PL_pte_root,
9807 sizeof(struct ptr_tbl_ent));
9808 tblent->oldval = oldsv;
9809 tblent->newval = newsv;
9810 tblent->next = *otblent;
9813 if (!empty && tbl->tbl_items > tbl->tbl_max)
9814 ptr_table_split(tbl);
9817 /* double the hash bucket size of an existing ptr table */
9820 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9822 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9823 const UV oldsize = tbl->tbl_max + 1;
9824 UV newsize = oldsize * 2;
9827 Renew(ary, newsize, PTR_TBL_ENT_t*);
9828 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9829 tbl->tbl_max = --newsize;
9831 for (i=0; i < oldsize; i++, ary++) {
9832 PTR_TBL_ENT_t **curentp, **entp, *ent;
9835 curentp = ary + oldsize;
9836 for (entp = ary, ent = *ary; ent; ent = *entp) {
9837 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
9839 ent->next = *curentp;
9849 /* remove all the entries from a ptr table */
9852 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9854 register PTR_TBL_ENT_t **array;
9855 register PTR_TBL_ENT_t *entry;
9859 if (!tbl || !tbl->tbl_items) {
9863 array = tbl->tbl_ary;
9869 PTR_TBL_ENT_t *oentry = entry;
9870 entry = entry->next;
9874 if (++riter > max) {
9877 entry = array[riter];
9884 /* clear and free a ptr table */
9887 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9892 ptr_table_clear(tbl);
9893 Safefree(tbl->tbl_ary);
9899 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9902 SvRV_set(dstr, SvWEAKREF(sstr)
9903 ? sv_dup(SvRV(sstr), param)
9904 : sv_dup_inc(SvRV(sstr), param));
9907 else if (SvPVX_const(sstr)) {
9908 /* Has something there */
9910 /* Normal PV - clone whole allocated space */
9911 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
9912 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9913 /* Not that normal - actually sstr is copy on write.
9914 But we are a true, independant SV, so: */
9915 SvREADONLY_off(dstr);
9920 /* Special case - not normally malloced for some reason */
9921 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
9922 /* A "shared" PV - clone it as "shared" PV */
9924 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
9928 /* Some other special case - random pointer */
9929 SvPV_set(dstr, SvPVX(sstr));
9935 if (SvTYPE(dstr) == SVt_RV)
9936 SvRV_set(dstr, NULL);
9942 /* duplicate an SV of any type (including AV, HV etc) */
9945 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9950 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9952 /* look for it in the table first */
9953 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9957 if(param->flags & CLONEf_JOIN_IN) {
9958 /** We are joining here so we don't want do clone
9959 something that is bad **/
9962 if(SvTYPE(sstr) == SVt_PVHV &&
9963 (hvname = HvNAME_get(sstr))) {
9964 /** don't clone stashes if they already exist **/
9965 return (SV*)gv_stashpv(hvname,0);
9969 /* create anew and remember what it is */
9972 #ifdef DEBUG_LEAKING_SCALARS
9973 dstr->sv_debug_optype = sstr->sv_debug_optype;
9974 dstr->sv_debug_line = sstr->sv_debug_line;
9975 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
9976 dstr->sv_debug_cloned = 1;
9978 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
9980 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
9984 ptr_table_store(PL_ptr_table, sstr, dstr);
9987 SvFLAGS(dstr) = SvFLAGS(sstr);
9988 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9989 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9992 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
9993 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9994 PL_watch_pvx, SvPVX_const(sstr));
9997 /* don't clone objects whose class has asked us not to */
9998 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
9999 SvFLAGS(dstr) &= ~SVTYPEMASK;
10000 SvOBJECT_off(dstr);
10004 switch (SvTYPE(sstr)) {
10006 SvANY(dstr) = NULL;
10009 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10010 SvIV_set(dstr, SvIVX(sstr));
10013 SvANY(dstr) = new_XNV();
10014 SvNV_set(dstr, SvNVX(sstr));
10017 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10018 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10022 /* These are all the types that need complex bodies allocating. */
10023 size_t new_body_length;
10024 size_t new_body_offset = 0;
10025 void **new_body_arena;
10026 void **new_body_arenaroot;
10029 switch (SvTYPE(sstr)) {
10031 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
10036 new_body = new_XPVIO();
10037 new_body_length = sizeof(XPVIO);
10040 new_body = new_XPVFM();
10041 new_body_length = sizeof(XPVFM);
10045 new_body_arena = (void **) &PL_xpvhv_root;
10046 new_body_arenaroot = (void **) &PL_xpvhv_arenaroot;
10047 new_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill)
10048 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill);
10049 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10050 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10054 new_body_arena = (void **) &PL_xpvav_root;
10055 new_body_arenaroot = (void **) &PL_xpvav_arenaroot;
10056 new_body_offset = STRUCT_OFFSET(XPVAV, xav_fill)
10057 - STRUCT_OFFSET(xpvav_allocated, xav_fill);
10058 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10059 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10063 new_body_length = sizeof(XPVBM);
10064 new_body_arena = (void **) &PL_xpvbm_root;
10065 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
10068 if (GvUNIQUE((GV*)sstr)) {
10069 /* Do sharing here. */
10071 new_body_length = sizeof(XPVGV);
10072 new_body_arena = (void **) &PL_xpvgv_root;
10073 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
10076 new_body_length = sizeof(XPVCV);
10077 new_body_arena = (void **) &PL_xpvcv_root;
10078 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
10081 new_body_length = sizeof(XPVLV);
10082 new_body_arena = (void **) &PL_xpvlv_root;
10083 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
10086 new_body_length = sizeof(XPVMG);
10087 new_body_arena = (void **) &PL_xpvmg_root;
10088 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
10091 new_body_length = sizeof(XPVNV);
10092 new_body_arena = (void **) &PL_xpvnv_root;
10093 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
10096 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
10097 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
10098 new_body_length = sizeof(XPVIV) - new_body_offset;
10099 new_body_arena = (void **) &PL_xpviv_root;
10100 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
10103 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
10104 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
10105 new_body_length = sizeof(XPV) - new_body_offset;
10106 new_body_arena = (void **) &PL_xpv_root;
10107 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
10109 assert(new_body_length);
10111 new_body_inline(new_body, new_body_arenaroot, new_body_arena,
10113 new_body = (void*)((char*)new_body - new_body_offset);
10115 /* We always allocated the full length item with PURIFY */
10116 new_body_length += new_body_offset;
10117 new_body_offset = 0;
10118 new_body = my_safemalloc(new_body_length);
10122 SvANY(dstr) = new_body;
10124 Copy(((char*)SvANY(sstr)) + new_body_offset,
10125 ((char*)SvANY(dstr)) + new_body_offset,
10126 new_body_length, char);
10128 if (SvTYPE(sstr) != SVt_PVAV && SvTYPE(sstr) != SVt_PVHV)
10129 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10131 /* The Copy above means that all the source (unduplicated) pointers
10132 are now in the destination. We can check the flags and the
10133 pointers in either, but it's possible that there's less cache
10134 missing by always going for the destination.
10135 FIXME - instrument and check that assumption */
10136 if (SvTYPE(sstr) >= SVt_PVMG) {
10138 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
10140 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
10143 switch (SvTYPE(sstr)) {
10155 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
10156 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
10157 LvTARG(dstr) = dstr;
10158 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
10159 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
10161 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
10164 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
10165 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
10166 /* Don't call sv_add_backref here as it's going to be created
10167 as part of the magic cloning of the symbol table. */
10168 GvGP(dstr) = gp_dup(GvGP(dstr), param);
10169 (void)GpREFCNT_inc(GvGP(dstr));
10172 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
10173 if (IoOFP(dstr) == IoIFP(sstr))
10174 IoOFP(dstr) = IoIFP(dstr);
10176 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
10177 /* PL_rsfp_filters entries have fake IoDIRP() */
10178 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
10179 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
10180 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
10181 /* I have no idea why fake dirp (rsfps)
10182 should be treated differently but otherwise
10183 we end up with leaks -- sky*/
10184 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
10185 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
10186 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
10188 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
10189 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
10190 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
10192 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
10193 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
10194 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
10197 if (AvARRAY((AV*)sstr)) {
10198 SV **dst_ary, **src_ary;
10199 SSize_t items = AvFILLp((AV*)sstr) + 1;
10201 src_ary = AvARRAY((AV*)sstr);
10202 Newxz(dst_ary, AvMAX((AV*)sstr)+1, SV*);
10203 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10204 SvPV_set(dstr, (char*)dst_ary);
10205 AvALLOC((AV*)dstr) = dst_ary;
10206 if (AvREAL((AV*)sstr)) {
10207 while (items-- > 0)
10208 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10211 while (items-- > 0)
10212 *dst_ary++ = sv_dup(*src_ary++, param);
10214 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10215 while (items-- > 0) {
10216 *dst_ary++ = &PL_sv_undef;
10220 SvPV_set(dstr, Nullch);
10221 AvALLOC((AV*)dstr) = (SV**)NULL;
10228 if (HvARRAY((HV*)sstr)) {
10230 const bool sharekeys = !!HvSHAREKEYS(sstr);
10231 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10232 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10234 Newx(darray, PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10235 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
10237 HvARRAY(dstr) = (HE**)darray;
10238 while (i <= sxhv->xhv_max) {
10239 const HE *source = HvARRAY(sstr)[i];
10240 HvARRAY(dstr)[i] = source
10241 ? he_dup(source, sharekeys, param) : 0;
10245 struct xpvhv_aux *saux = HvAUX(sstr);
10246 struct xpvhv_aux *daux = HvAUX(dstr);
10247 /* This flag isn't copied. */
10248 /* SvOOK_on(hv) attacks the IV flags. */
10249 SvFLAGS(dstr) |= SVf_OOK;
10251 hvname = saux->xhv_name;
10253 = hvname ? hek_dup(hvname, param) : hvname;
10255 daux->xhv_riter = saux->xhv_riter;
10256 daux->xhv_eiter = saux->xhv_eiter
10257 ? he_dup(saux->xhv_eiter,
10258 (bool)!!HvSHAREKEYS(sstr), param) : 0;
10262 SvPV_set(dstr, Nullch);
10264 /* Record stashes for possible cloning in Perl_clone(). */
10266 av_push(param->stashes, dstr);
10271 /* NOTE: not refcounted */
10272 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
10274 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
10276 if (CvCONST(dstr)) {
10277 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
10278 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
10279 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
10281 /* don't dup if copying back - CvGV isn't refcounted, so the
10282 * duped GV may never be freed. A bit of a hack! DAPM */
10283 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10284 Nullgv : gv_dup(CvGV(dstr), param) ;
10285 if (!(param->flags & CLONEf_COPY_STACKS)) {
10288 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10290 CvWEAKOUTSIDE(sstr)
10291 ? cv_dup( CvOUTSIDE(dstr), param)
10292 : cv_dup_inc(CvOUTSIDE(dstr), param);
10294 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
10300 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10306 /* duplicate a context */
10309 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10311 PERL_CONTEXT *ncxs;
10314 return (PERL_CONTEXT*)NULL;
10316 /* look for it in the table first */
10317 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10321 /* create anew and remember what it is */
10322 Newxz(ncxs, max + 1, PERL_CONTEXT);
10323 ptr_table_store(PL_ptr_table, cxs, ncxs);
10326 PERL_CONTEXT *cx = &cxs[ix];
10327 PERL_CONTEXT *ncx = &ncxs[ix];
10328 ncx->cx_type = cx->cx_type;
10329 if (CxTYPE(cx) == CXt_SUBST) {
10330 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10333 ncx->blk_oldsp = cx->blk_oldsp;
10334 ncx->blk_oldcop = cx->blk_oldcop;
10335 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10336 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10337 ncx->blk_oldpm = cx->blk_oldpm;
10338 ncx->blk_gimme = cx->blk_gimme;
10339 switch (CxTYPE(cx)) {
10341 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10342 ? cv_dup_inc(cx->blk_sub.cv, param)
10343 : cv_dup(cx->blk_sub.cv,param));
10344 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10345 ? av_dup_inc(cx->blk_sub.argarray, param)
10347 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10348 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10349 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10350 ncx->blk_sub.lval = cx->blk_sub.lval;
10351 ncx->blk_sub.retop = cx->blk_sub.retop;
10354 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10355 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10356 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10357 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10358 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10359 ncx->blk_eval.retop = cx->blk_eval.retop;
10362 ncx->blk_loop.label = cx->blk_loop.label;
10363 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10364 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10365 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10366 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10367 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10368 ? cx->blk_loop.iterdata
10369 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10370 ncx->blk_loop.oldcomppad
10371 = (PAD*)ptr_table_fetch(PL_ptr_table,
10372 cx->blk_loop.oldcomppad);
10373 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10374 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10375 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10376 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10377 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10380 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10381 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10382 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10383 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10384 ncx->blk_sub.retop = cx->blk_sub.retop;
10396 /* duplicate a stack info structure */
10399 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10404 return (PERL_SI*)NULL;
10406 /* look for it in the table first */
10407 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10411 /* create anew and remember what it is */
10412 Newxz(nsi, 1, PERL_SI);
10413 ptr_table_store(PL_ptr_table, si, nsi);
10415 nsi->si_stack = av_dup_inc(si->si_stack, param);
10416 nsi->si_cxix = si->si_cxix;
10417 nsi->si_cxmax = si->si_cxmax;
10418 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10419 nsi->si_type = si->si_type;
10420 nsi->si_prev = si_dup(si->si_prev, param);
10421 nsi->si_next = si_dup(si->si_next, param);
10422 nsi->si_markoff = si->si_markoff;
10427 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10428 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10429 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10430 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10431 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10432 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10433 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10434 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10435 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10436 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10437 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10438 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10439 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10440 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10443 #define pv_dup_inc(p) SAVEPV(p)
10444 #define pv_dup(p) SAVEPV(p)
10445 #define svp_dup_inc(p,pp) any_dup(p,pp)
10447 /* map any object to the new equivent - either something in the
10448 * ptr table, or something in the interpreter structure
10452 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
10457 return (void*)NULL;
10459 /* look for it in the table first */
10460 ret = ptr_table_fetch(PL_ptr_table, v);
10464 /* see if it is part of the interpreter structure */
10465 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10466 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10474 /* duplicate the save stack */
10477 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10479 ANY * const ss = proto_perl->Tsavestack;
10480 const I32 max = proto_perl->Tsavestack_max;
10481 I32 ix = proto_perl->Tsavestack_ix;
10493 void (*dptr) (void*);
10494 void (*dxptr) (pTHX_ void*);
10496 Newxz(nss, max, ANY);
10499 I32 i = POPINT(ss,ix);
10500 TOPINT(nss,ix) = i;
10502 case SAVEt_ITEM: /* normal string */
10503 sv = (SV*)POPPTR(ss,ix);
10504 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10505 sv = (SV*)POPPTR(ss,ix);
10506 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10508 case SAVEt_SV: /* scalar reference */
10509 sv = (SV*)POPPTR(ss,ix);
10510 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10511 gv = (GV*)POPPTR(ss,ix);
10512 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10514 case SAVEt_GENERIC_PVREF: /* generic char* */
10515 c = (char*)POPPTR(ss,ix);
10516 TOPPTR(nss,ix) = pv_dup(c);
10517 ptr = POPPTR(ss,ix);
10518 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10520 case SAVEt_SHARED_PVREF: /* char* in shared space */
10521 c = (char*)POPPTR(ss,ix);
10522 TOPPTR(nss,ix) = savesharedpv(c);
10523 ptr = POPPTR(ss,ix);
10524 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10526 case SAVEt_GENERIC_SVREF: /* generic sv */
10527 case SAVEt_SVREF: /* scalar reference */
10528 sv = (SV*)POPPTR(ss,ix);
10529 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10530 ptr = POPPTR(ss,ix);
10531 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10533 case SAVEt_AV: /* array reference */
10534 av = (AV*)POPPTR(ss,ix);
10535 TOPPTR(nss,ix) = av_dup_inc(av, param);
10536 gv = (GV*)POPPTR(ss,ix);
10537 TOPPTR(nss,ix) = gv_dup(gv, param);
10539 case SAVEt_HV: /* hash reference */
10540 hv = (HV*)POPPTR(ss,ix);
10541 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10542 gv = (GV*)POPPTR(ss,ix);
10543 TOPPTR(nss,ix) = gv_dup(gv, param);
10545 case SAVEt_INT: /* int reference */
10546 ptr = POPPTR(ss,ix);
10547 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10548 intval = (int)POPINT(ss,ix);
10549 TOPINT(nss,ix) = intval;
10551 case SAVEt_LONG: /* long reference */
10552 ptr = POPPTR(ss,ix);
10553 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10554 longval = (long)POPLONG(ss,ix);
10555 TOPLONG(nss,ix) = longval;
10557 case SAVEt_I32: /* I32 reference */
10558 case SAVEt_I16: /* I16 reference */
10559 case SAVEt_I8: /* I8 reference */
10560 ptr = POPPTR(ss,ix);
10561 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10563 TOPINT(nss,ix) = i;
10565 case SAVEt_IV: /* IV reference */
10566 ptr = POPPTR(ss,ix);
10567 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10569 TOPIV(nss,ix) = iv;
10571 case SAVEt_SPTR: /* SV* reference */
10572 ptr = POPPTR(ss,ix);
10573 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10574 sv = (SV*)POPPTR(ss,ix);
10575 TOPPTR(nss,ix) = sv_dup(sv, param);
10577 case SAVEt_VPTR: /* random* reference */
10578 ptr = POPPTR(ss,ix);
10579 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10580 ptr = POPPTR(ss,ix);
10581 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10583 case SAVEt_PPTR: /* char* reference */
10584 ptr = POPPTR(ss,ix);
10585 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10586 c = (char*)POPPTR(ss,ix);
10587 TOPPTR(nss,ix) = pv_dup(c);
10589 case SAVEt_HPTR: /* HV* reference */
10590 ptr = POPPTR(ss,ix);
10591 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10592 hv = (HV*)POPPTR(ss,ix);
10593 TOPPTR(nss,ix) = hv_dup(hv, param);
10595 case SAVEt_APTR: /* AV* reference */
10596 ptr = POPPTR(ss,ix);
10597 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10598 av = (AV*)POPPTR(ss,ix);
10599 TOPPTR(nss,ix) = av_dup(av, param);
10602 gv = (GV*)POPPTR(ss,ix);
10603 TOPPTR(nss,ix) = gv_dup(gv, param);
10605 case SAVEt_GP: /* scalar reference */
10606 gp = (GP*)POPPTR(ss,ix);
10607 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10608 (void)GpREFCNT_inc(gp);
10609 gv = (GV*)POPPTR(ss,ix);
10610 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10611 c = (char*)POPPTR(ss,ix);
10612 TOPPTR(nss,ix) = pv_dup(c);
10614 TOPIV(nss,ix) = iv;
10616 TOPIV(nss,ix) = iv;
10619 case SAVEt_MORTALIZESV:
10620 sv = (SV*)POPPTR(ss,ix);
10621 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10624 ptr = POPPTR(ss,ix);
10625 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10626 /* these are assumed to be refcounted properly */
10628 switch (((OP*)ptr)->op_type) {
10630 case OP_LEAVESUBLV:
10634 case OP_LEAVEWRITE:
10635 TOPPTR(nss,ix) = ptr;
10640 TOPPTR(nss,ix) = Nullop;
10645 TOPPTR(nss,ix) = Nullop;
10648 c = (char*)POPPTR(ss,ix);
10649 TOPPTR(nss,ix) = pv_dup_inc(c);
10651 case SAVEt_CLEARSV:
10652 longval = POPLONG(ss,ix);
10653 TOPLONG(nss,ix) = longval;
10656 hv = (HV*)POPPTR(ss,ix);
10657 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10658 c = (char*)POPPTR(ss,ix);
10659 TOPPTR(nss,ix) = pv_dup_inc(c);
10661 TOPINT(nss,ix) = i;
10663 case SAVEt_DESTRUCTOR:
10664 ptr = POPPTR(ss,ix);
10665 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10666 dptr = POPDPTR(ss,ix);
10667 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
10668 any_dup(FPTR2DPTR(void *, dptr),
10671 case SAVEt_DESTRUCTOR_X:
10672 ptr = POPPTR(ss,ix);
10673 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10674 dxptr = POPDXPTR(ss,ix);
10675 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
10676 any_dup(FPTR2DPTR(void *, dxptr),
10679 case SAVEt_REGCONTEXT:
10682 TOPINT(nss,ix) = i;
10685 case SAVEt_STACK_POS: /* Position on Perl stack */
10687 TOPINT(nss,ix) = i;
10689 case SAVEt_AELEM: /* array element */
10690 sv = (SV*)POPPTR(ss,ix);
10691 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10693 TOPINT(nss,ix) = i;
10694 av = (AV*)POPPTR(ss,ix);
10695 TOPPTR(nss,ix) = av_dup_inc(av, param);
10697 case SAVEt_HELEM: /* hash element */
10698 sv = (SV*)POPPTR(ss,ix);
10699 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10700 sv = (SV*)POPPTR(ss,ix);
10701 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10702 hv = (HV*)POPPTR(ss,ix);
10703 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10706 ptr = POPPTR(ss,ix);
10707 TOPPTR(nss,ix) = ptr;
10711 TOPINT(nss,ix) = i;
10713 case SAVEt_COMPPAD:
10714 av = (AV*)POPPTR(ss,ix);
10715 TOPPTR(nss,ix) = av_dup(av, param);
10718 longval = (long)POPLONG(ss,ix);
10719 TOPLONG(nss,ix) = longval;
10720 ptr = POPPTR(ss,ix);
10721 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10722 sv = (SV*)POPPTR(ss,ix);
10723 TOPPTR(nss,ix) = sv_dup(sv, param);
10726 ptr = POPPTR(ss,ix);
10727 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10728 longval = (long)POPBOOL(ss,ix);
10729 TOPBOOL(nss,ix) = (bool)longval;
10731 case SAVEt_SET_SVFLAGS:
10733 TOPINT(nss,ix) = i;
10735 TOPINT(nss,ix) = i;
10736 sv = (SV*)POPPTR(ss,ix);
10737 TOPPTR(nss,ix) = sv_dup(sv, param);
10740 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10748 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
10749 * flag to the result. This is done for each stash before cloning starts,
10750 * so we know which stashes want their objects cloned */
10753 do_mark_cloneable_stash(pTHX_ SV *sv)
10755 const HEK * const hvname = HvNAME_HEK((HV*)sv);
10757 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
10758 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
10759 if (cloner && GvCV(cloner)) {
10766 XPUSHs(sv_2mortal(newSVhek(hvname)));
10768 call_sv((SV*)GvCV(cloner), G_SCALAR);
10775 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
10783 =for apidoc perl_clone
10785 Create and return a new interpreter by cloning the current one.
10787 perl_clone takes these flags as parameters:
10789 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10790 without it we only clone the data and zero the stacks,
10791 with it we copy the stacks and the new perl interpreter is
10792 ready to run at the exact same point as the previous one.
10793 The pseudo-fork code uses COPY_STACKS while the
10794 threads->new doesn't.
10796 CLONEf_KEEP_PTR_TABLE
10797 perl_clone keeps a ptr_table with the pointer of the old
10798 variable as a key and the new variable as a value,
10799 this allows it to check if something has been cloned and not
10800 clone it again but rather just use the value and increase the
10801 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10802 the ptr_table using the function
10803 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10804 reason to keep it around is if you want to dup some of your own
10805 variable who are outside the graph perl scans, example of this
10806 code is in threads.xs create
10809 This is a win32 thing, it is ignored on unix, it tells perls
10810 win32host code (which is c++) to clone itself, this is needed on
10811 win32 if you want to run two threads at the same time,
10812 if you just want to do some stuff in a separate perl interpreter
10813 and then throw it away and return to the original one,
10814 you don't need to do anything.
10819 /* XXX the above needs expanding by someone who actually understands it ! */
10820 EXTERN_C PerlInterpreter *
10821 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10824 perl_clone(PerlInterpreter *proto_perl, UV flags)
10827 #ifdef PERL_IMPLICIT_SYS
10829 /* perlhost.h so we need to call into it
10830 to clone the host, CPerlHost should have a c interface, sky */
10832 if (flags & CLONEf_CLONE_HOST) {
10833 return perl_clone_host(proto_perl,flags);
10835 return perl_clone_using(proto_perl, flags,
10837 proto_perl->IMemShared,
10838 proto_perl->IMemParse,
10840 proto_perl->IStdIO,
10844 proto_perl->IProc);
10848 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10849 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10850 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10851 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10852 struct IPerlDir* ipD, struct IPerlSock* ipS,
10853 struct IPerlProc* ipP)
10855 /* XXX many of the string copies here can be optimized if they're
10856 * constants; they need to be allocated as common memory and just
10857 * their pointers copied. */
10860 CLONE_PARAMS clone_params;
10861 CLONE_PARAMS* param = &clone_params;
10863 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10864 /* for each stash, determine whether its objects should be cloned */
10865 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10866 PERL_SET_THX(my_perl);
10869 Poison(my_perl, 1, PerlInterpreter);
10871 PL_curcop = (COP *)Nullop;
10875 PL_savestack_ix = 0;
10876 PL_savestack_max = -1;
10877 PL_sig_pending = 0;
10878 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10879 # else /* !DEBUGGING */
10880 Zero(my_perl, 1, PerlInterpreter);
10881 # endif /* DEBUGGING */
10883 /* host pointers */
10885 PL_MemShared = ipMS;
10886 PL_MemParse = ipMP;
10893 #else /* !PERL_IMPLICIT_SYS */
10895 CLONE_PARAMS clone_params;
10896 CLONE_PARAMS* param = &clone_params;
10897 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10898 /* for each stash, determine whether its objects should be cloned */
10899 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
10900 PERL_SET_THX(my_perl);
10903 Poison(my_perl, 1, PerlInterpreter);
10905 PL_curcop = (COP *)Nullop;
10909 PL_savestack_ix = 0;
10910 PL_savestack_max = -1;
10911 PL_sig_pending = 0;
10912 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10913 # else /* !DEBUGGING */
10914 Zero(my_perl, 1, PerlInterpreter);
10915 # endif /* DEBUGGING */
10916 #endif /* PERL_IMPLICIT_SYS */
10917 param->flags = flags;
10918 param->proto_perl = proto_perl;
10921 PL_xnv_arenaroot = NULL;
10922 PL_xnv_root = NULL;
10923 PL_xpv_arenaroot = NULL;
10924 PL_xpv_root = NULL;
10925 PL_xpviv_arenaroot = NULL;
10926 PL_xpviv_root = NULL;
10927 PL_xpvnv_arenaroot = NULL;
10928 PL_xpvnv_root = NULL;
10929 PL_xpvcv_arenaroot = NULL;
10930 PL_xpvcv_root = NULL;
10931 PL_xpvav_arenaroot = NULL;
10932 PL_xpvav_root = NULL;
10933 PL_xpvhv_arenaroot = NULL;
10934 PL_xpvhv_root = NULL;
10935 PL_xpvmg_arenaroot = NULL;
10936 PL_xpvmg_root = NULL;
10937 PL_xpvgv_arenaroot = NULL;
10938 PL_xpvgv_root = NULL;
10939 PL_xpvlv_arenaroot = NULL;
10940 PL_xpvlv_root = NULL;
10941 PL_xpvbm_arenaroot = NULL;
10942 PL_xpvbm_root = NULL;
10943 PL_he_arenaroot = NULL;
10945 #if defined(USE_ITHREADS)
10946 PL_pte_arenaroot = NULL;
10947 PL_pte_root = NULL;
10949 PL_nice_chunk = NULL;
10950 PL_nice_chunk_size = 0;
10952 PL_sv_objcount = 0;
10953 PL_sv_root = Nullsv;
10954 PL_sv_arenaroot = Nullsv;
10956 PL_debug = proto_perl->Idebug;
10958 PL_hash_seed = proto_perl->Ihash_seed;
10959 PL_rehash_seed = proto_perl->Irehash_seed;
10961 #ifdef USE_REENTRANT_API
10962 /* XXX: things like -Dm will segfault here in perlio, but doing
10963 * PERL_SET_CONTEXT(proto_perl);
10964 * breaks too many other things
10966 Perl_reentrant_init(aTHX);
10969 /* create SV map for pointer relocation */
10970 PL_ptr_table = ptr_table_new();
10972 /* initialize these special pointers as early as possible */
10973 SvANY(&PL_sv_undef) = NULL;
10974 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10975 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10976 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10978 SvANY(&PL_sv_no) = new_XPVNV();
10979 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10980 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
10981 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10982 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
10983 SvCUR_set(&PL_sv_no, 0);
10984 SvLEN_set(&PL_sv_no, 1);
10985 SvIV_set(&PL_sv_no, 0);
10986 SvNV_set(&PL_sv_no, 0);
10987 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10989 SvANY(&PL_sv_yes) = new_XPVNV();
10990 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10991 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
10992 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10993 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
10994 SvCUR_set(&PL_sv_yes, 1);
10995 SvLEN_set(&PL_sv_yes, 2);
10996 SvIV_set(&PL_sv_yes, 1);
10997 SvNV_set(&PL_sv_yes, 1);
10998 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11000 /* create (a non-shared!) shared string table */
11001 PL_strtab = newHV();
11002 HvSHAREKEYS_off(PL_strtab);
11003 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11004 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11006 PL_compiling = proto_perl->Icompiling;
11008 /* These two PVs will be free'd special way so must set them same way op.c does */
11009 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11010 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11012 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11013 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11015 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11016 if (!specialWARN(PL_compiling.cop_warnings))
11017 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11018 if (!specialCopIO(PL_compiling.cop_io))
11019 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11020 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11022 /* pseudo environmental stuff */
11023 PL_origargc = proto_perl->Iorigargc;
11024 PL_origargv = proto_perl->Iorigargv;
11026 param->stashes = newAV(); /* Setup array of objects to call clone on */
11028 /* Set tainting stuff before PerlIO_debug can possibly get called */
11029 PL_tainting = proto_perl->Itainting;
11030 PL_taint_warn = proto_perl->Itaint_warn;
11032 #ifdef PERLIO_LAYERS
11033 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11034 PerlIO_clone(aTHX_ proto_perl, param);
11037 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11038 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11039 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11040 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11041 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11042 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11045 PL_minus_c = proto_perl->Iminus_c;
11046 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11047 PL_localpatches = proto_perl->Ilocalpatches;
11048 PL_splitstr = proto_perl->Isplitstr;
11049 PL_preprocess = proto_perl->Ipreprocess;
11050 PL_minus_n = proto_perl->Iminus_n;
11051 PL_minus_p = proto_perl->Iminus_p;
11052 PL_minus_l = proto_perl->Iminus_l;
11053 PL_minus_a = proto_perl->Iminus_a;
11054 PL_minus_F = proto_perl->Iminus_F;
11055 PL_doswitches = proto_perl->Idoswitches;
11056 PL_dowarn = proto_perl->Idowarn;
11057 PL_doextract = proto_perl->Idoextract;
11058 PL_sawampersand = proto_perl->Isawampersand;
11059 PL_unsafe = proto_perl->Iunsafe;
11060 PL_inplace = SAVEPV(proto_perl->Iinplace);
11061 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11062 PL_perldb = proto_perl->Iperldb;
11063 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11064 PL_exit_flags = proto_perl->Iexit_flags;
11066 /* magical thingies */
11067 /* XXX time(&PL_basetime) when asked for? */
11068 PL_basetime = proto_perl->Ibasetime;
11069 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11071 PL_maxsysfd = proto_perl->Imaxsysfd;
11072 PL_multiline = proto_perl->Imultiline;
11073 PL_statusvalue = proto_perl->Istatusvalue;
11075 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11077 PL_statusvalue_posix = proto_perl->Istatusvalue_posix;
11079 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11081 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11082 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11083 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11085 /* Clone the regex array */
11086 PL_regex_padav = newAV();
11088 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11089 SV** const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11091 av_push(PL_regex_padav,
11092 sv_dup_inc(regexen[0],param));
11093 for(i = 1; i <= len; i++) {
11094 if(SvREPADTMP(regexen[i])) {
11095 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11097 av_push(PL_regex_padav,
11099 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11100 SvIVX(regexen[i])), param)))
11105 PL_regex_pad = AvARRAY(PL_regex_padav);
11107 /* shortcuts to various I/O objects */
11108 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11109 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11110 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11111 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11112 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11113 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11115 /* shortcuts to regexp stuff */
11116 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11118 /* shortcuts to misc objects */
11119 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11121 /* shortcuts to debugging objects */
11122 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11123 PL_DBline = gv_dup(proto_perl->IDBline, param);
11124 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11125 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11126 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11127 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11128 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11129 PL_lineary = av_dup(proto_perl->Ilineary, param);
11130 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11132 /* symbol tables */
11133 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11134 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11135 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11136 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11137 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11139 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11140 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11141 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11142 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11143 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11144 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11146 PL_sub_generation = proto_perl->Isub_generation;
11148 /* funky return mechanisms */
11149 PL_forkprocess = proto_perl->Iforkprocess;
11151 /* subprocess state */
11152 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11154 /* internal state */
11155 PL_maxo = proto_perl->Imaxo;
11156 if (proto_perl->Iop_mask)
11157 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11159 PL_op_mask = Nullch;
11160 /* PL_asserting = proto_perl->Iasserting; */
11162 /* current interpreter roots */
11163 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11164 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11165 PL_main_start = proto_perl->Imain_start;
11166 PL_eval_root = proto_perl->Ieval_root;
11167 PL_eval_start = proto_perl->Ieval_start;
11169 /* runtime control stuff */
11170 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11171 PL_copline = proto_perl->Icopline;
11173 PL_filemode = proto_perl->Ifilemode;
11174 PL_lastfd = proto_perl->Ilastfd;
11175 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11178 PL_gensym = proto_perl->Igensym;
11179 PL_preambled = proto_perl->Ipreambled;
11180 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11181 PL_laststatval = proto_perl->Ilaststatval;
11182 PL_laststype = proto_perl->Ilaststype;
11183 PL_mess_sv = Nullsv;
11185 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11187 /* interpreter atexit processing */
11188 PL_exitlistlen = proto_perl->Iexitlistlen;
11189 if (PL_exitlistlen) {
11190 Newx(PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11191 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11194 PL_exitlist = (PerlExitListEntry*)NULL;
11195 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11196 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11197 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11199 PL_profiledata = NULL;
11200 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11201 /* PL_rsfp_filters entries have fake IoDIRP() */
11202 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11204 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11206 PAD_CLONE_VARS(proto_perl, param);
11208 #ifdef HAVE_INTERP_INTERN
11209 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11212 /* more statics moved here */
11213 PL_generation = proto_perl->Igeneration;
11214 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11216 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11217 PL_in_clean_all = proto_perl->Iin_clean_all;
11219 PL_uid = proto_perl->Iuid;
11220 PL_euid = proto_perl->Ieuid;
11221 PL_gid = proto_perl->Igid;
11222 PL_egid = proto_perl->Iegid;
11223 PL_nomemok = proto_perl->Inomemok;
11224 PL_an = proto_perl->Ian;
11225 PL_evalseq = proto_perl->Ievalseq;
11226 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11227 PL_origalen = proto_perl->Iorigalen;
11228 #ifdef PERL_USES_PL_PIDSTATUS
11229 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11231 PL_osname = SAVEPV(proto_perl->Iosname);
11232 PL_sighandlerp = proto_perl->Isighandlerp;
11234 PL_runops = proto_perl->Irunops;
11236 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11239 PL_cshlen = proto_perl->Icshlen;
11240 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11243 PL_lex_state = proto_perl->Ilex_state;
11244 PL_lex_defer = proto_perl->Ilex_defer;
11245 PL_lex_expect = proto_perl->Ilex_expect;
11246 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11247 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11248 PL_lex_starts = proto_perl->Ilex_starts;
11249 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11250 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11251 PL_lex_op = proto_perl->Ilex_op;
11252 PL_lex_inpat = proto_perl->Ilex_inpat;
11253 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11254 PL_lex_brackets = proto_perl->Ilex_brackets;
11255 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11256 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11257 PL_lex_casemods = proto_perl->Ilex_casemods;
11258 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11259 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11261 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11262 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11263 PL_nexttoke = proto_perl->Inexttoke;
11265 /* XXX This is probably masking the deeper issue of why
11266 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11267 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11268 * (A little debugging with a watchpoint on it may help.)
11270 if (SvANY(proto_perl->Ilinestr)) {
11271 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11272 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11273 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11274 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11275 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11276 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11277 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11278 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11279 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11282 PL_linestr = NEWSV(65,79);
11283 sv_upgrade(PL_linestr,SVt_PVIV);
11284 sv_setpvn(PL_linestr,"",0);
11285 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11287 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11288 PL_pending_ident = proto_perl->Ipending_ident;
11289 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11291 PL_expect = proto_perl->Iexpect;
11293 PL_multi_start = proto_perl->Imulti_start;
11294 PL_multi_end = proto_perl->Imulti_end;
11295 PL_multi_open = proto_perl->Imulti_open;
11296 PL_multi_close = proto_perl->Imulti_close;
11298 PL_error_count = proto_perl->Ierror_count;
11299 PL_subline = proto_perl->Isubline;
11300 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11302 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11303 if (SvANY(proto_perl->Ilinestr)) {
11304 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11305 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11306 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11307 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11308 PL_last_lop_op = proto_perl->Ilast_lop_op;
11311 PL_last_uni = SvPVX(PL_linestr);
11312 PL_last_lop = SvPVX(PL_linestr);
11313 PL_last_lop_op = 0;
11315 PL_in_my = proto_perl->Iin_my;
11316 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11318 PL_cryptseen = proto_perl->Icryptseen;
11321 PL_hints = proto_perl->Ihints;
11323 PL_amagic_generation = proto_perl->Iamagic_generation;
11325 #ifdef USE_LOCALE_COLLATE
11326 PL_collation_ix = proto_perl->Icollation_ix;
11327 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11328 PL_collation_standard = proto_perl->Icollation_standard;
11329 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11330 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11331 #endif /* USE_LOCALE_COLLATE */
11333 #ifdef USE_LOCALE_NUMERIC
11334 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11335 PL_numeric_standard = proto_perl->Inumeric_standard;
11336 PL_numeric_local = proto_perl->Inumeric_local;
11337 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11338 #endif /* !USE_LOCALE_NUMERIC */
11340 /* utf8 character classes */
11341 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11342 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11343 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11344 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11345 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11346 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11347 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11348 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11349 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11350 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11351 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11352 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11353 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11354 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11355 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11356 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11357 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11358 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11359 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11360 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11362 /* Did the locale setup indicate UTF-8? */
11363 PL_utf8locale = proto_perl->Iutf8locale;
11364 /* Unicode features (see perlrun/-C) */
11365 PL_unicode = proto_perl->Iunicode;
11367 /* Pre-5.8 signals control */
11368 PL_signals = proto_perl->Isignals;
11370 /* times() ticks per second */
11371 PL_clocktick = proto_perl->Iclocktick;
11373 /* Recursion stopper for PerlIO_find_layer */
11374 PL_in_load_module = proto_perl->Iin_load_module;
11376 /* sort() routine */
11377 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11379 /* Not really needed/useful since the reenrant_retint is "volatile",
11380 * but do it for consistency's sake. */
11381 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11383 /* Hooks to shared SVs and locks. */
11384 PL_sharehook = proto_perl->Isharehook;
11385 PL_lockhook = proto_perl->Ilockhook;
11386 PL_unlockhook = proto_perl->Iunlockhook;
11387 PL_threadhook = proto_perl->Ithreadhook;
11389 PL_runops_std = proto_perl->Irunops_std;
11390 PL_runops_dbg = proto_perl->Irunops_dbg;
11392 #ifdef THREADS_HAVE_PIDS
11393 PL_ppid = proto_perl->Ippid;
11397 PL_last_swash_hv = Nullhv; /* reinits on demand */
11398 PL_last_swash_klen = 0;
11399 PL_last_swash_key[0]= '\0';
11400 PL_last_swash_tmps = (U8*)NULL;
11401 PL_last_swash_slen = 0;
11403 PL_glob_index = proto_perl->Iglob_index;
11404 PL_srand_called = proto_perl->Isrand_called;
11405 PL_uudmap['M'] = 0; /* reinits on demand */
11406 PL_bitcount = Nullch; /* reinits on demand */
11408 if (proto_perl->Ipsig_pend) {
11409 Newxz(PL_psig_pend, SIG_SIZE, int);
11412 PL_psig_pend = (int*)NULL;
11415 if (proto_perl->Ipsig_ptr) {
11416 Newxz(PL_psig_ptr, SIG_SIZE, SV*);
11417 Newxz(PL_psig_name, SIG_SIZE, SV*);
11418 for (i = 1; i < SIG_SIZE; i++) {
11419 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11420 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11424 PL_psig_ptr = (SV**)NULL;
11425 PL_psig_name = (SV**)NULL;
11428 /* thrdvar.h stuff */
11430 if (flags & CLONEf_COPY_STACKS) {
11431 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11432 PL_tmps_ix = proto_perl->Ttmps_ix;
11433 PL_tmps_max = proto_perl->Ttmps_max;
11434 PL_tmps_floor = proto_perl->Ttmps_floor;
11435 Newxz(PL_tmps_stack, PL_tmps_max, SV*);
11437 while (i <= PL_tmps_ix) {
11438 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11442 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11443 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11444 Newxz(PL_markstack, i, I32);
11445 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11446 - proto_perl->Tmarkstack);
11447 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11448 - proto_perl->Tmarkstack);
11449 Copy(proto_perl->Tmarkstack, PL_markstack,
11450 PL_markstack_ptr - PL_markstack + 1, I32);
11452 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11453 * NOTE: unlike the others! */
11454 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11455 PL_scopestack_max = proto_perl->Tscopestack_max;
11456 Newxz(PL_scopestack, PL_scopestack_max, I32);
11457 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11459 /* NOTE: si_dup() looks at PL_markstack */
11460 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11462 /* PL_curstack = PL_curstackinfo->si_stack; */
11463 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11464 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11466 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11467 PL_stack_base = AvARRAY(PL_curstack);
11468 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11469 - proto_perl->Tstack_base);
11470 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11472 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11473 * NOTE: unlike the others! */
11474 PL_savestack_ix = proto_perl->Tsavestack_ix;
11475 PL_savestack_max = proto_perl->Tsavestack_max;
11476 /*Newxz(PL_savestack, PL_savestack_max, ANY);*/
11477 PL_savestack = ss_dup(proto_perl, param);
11481 ENTER; /* perl_destruct() wants to LEAVE; */
11484 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11485 PL_top_env = &PL_start_env;
11487 PL_op = proto_perl->Top;
11490 PL_Xpv = (XPV*)NULL;
11491 PL_na = proto_perl->Tna;
11493 PL_statbuf = proto_perl->Tstatbuf;
11494 PL_statcache = proto_perl->Tstatcache;
11495 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11496 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11498 PL_timesbuf = proto_perl->Ttimesbuf;
11501 PL_tainted = proto_perl->Ttainted;
11502 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11503 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11504 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11505 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11506 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11507 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11508 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11509 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11510 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11512 PL_restartop = proto_perl->Trestartop;
11513 PL_in_eval = proto_perl->Tin_eval;
11514 PL_delaymagic = proto_perl->Tdelaymagic;
11515 PL_dirty = proto_perl->Tdirty;
11516 PL_localizing = proto_perl->Tlocalizing;
11518 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11519 PL_hv_fetch_ent_mh = Nullhe;
11520 PL_modcount = proto_perl->Tmodcount;
11521 PL_lastgotoprobe = Nullop;
11522 PL_dumpindent = proto_perl->Tdumpindent;
11524 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11525 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11526 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11527 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11528 PL_sortcxix = proto_perl->Tsortcxix;
11529 PL_efloatbuf = Nullch; /* reinits on demand */
11530 PL_efloatsize = 0; /* reinits on demand */
11534 PL_screamfirst = NULL;
11535 PL_screamnext = NULL;
11536 PL_maxscream = -1; /* reinits on demand */
11537 PL_lastscream = Nullsv;
11539 PL_watchaddr = NULL;
11540 PL_watchok = Nullch;
11542 PL_regdummy = proto_perl->Tregdummy;
11543 PL_regprecomp = Nullch;
11546 PL_colorset = 0; /* reinits PL_colors[] */
11547 /*PL_colors[6] = {0,0,0,0,0,0};*/
11548 PL_reginput = Nullch;
11549 PL_regbol = Nullch;
11550 PL_regeol = Nullch;
11551 PL_regstartp = (I32*)NULL;
11552 PL_regendp = (I32*)NULL;
11553 PL_reglastparen = (U32*)NULL;
11554 PL_reglastcloseparen = (U32*)NULL;
11555 PL_regtill = Nullch;
11556 PL_reg_start_tmp = (char**)NULL;
11557 PL_reg_start_tmpl = 0;
11558 PL_regdata = (struct reg_data*)NULL;
11561 PL_reg_eval_set = 0;
11563 PL_regprogram = (regnode*)NULL;
11565 PL_regcc = (CURCUR*)NULL;
11566 PL_reg_call_cc = (struct re_cc_state*)NULL;
11567 PL_reg_re = (regexp*)NULL;
11568 PL_reg_ganch = Nullch;
11569 PL_reg_sv = Nullsv;
11570 PL_reg_match_utf8 = FALSE;
11571 PL_reg_magic = (MAGIC*)NULL;
11573 PL_reg_oldcurpm = (PMOP*)NULL;
11574 PL_reg_curpm = (PMOP*)NULL;
11575 PL_reg_oldsaved = Nullch;
11576 PL_reg_oldsavedlen = 0;
11577 #ifdef PERL_OLD_COPY_ON_WRITE
11580 PL_reg_maxiter = 0;
11581 PL_reg_leftiter = 0;
11582 PL_reg_poscache = Nullch;
11583 PL_reg_poscache_size= 0;
11585 /* RE engine - function pointers */
11586 PL_regcompp = proto_perl->Tregcompp;
11587 PL_regexecp = proto_perl->Tregexecp;
11588 PL_regint_start = proto_perl->Tregint_start;
11589 PL_regint_string = proto_perl->Tregint_string;
11590 PL_regfree = proto_perl->Tregfree;
11592 PL_reginterp_cnt = 0;
11593 PL_reg_starttry = 0;
11595 /* Pluggable optimizer */
11596 PL_peepp = proto_perl->Tpeepp;
11598 PL_stashcache = newHV();
11600 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11601 ptr_table_free(PL_ptr_table);
11602 PL_ptr_table = NULL;
11605 /* Call the ->CLONE method, if it exists, for each of the stashes
11606 identified by sv_dup() above.
11608 while(av_len(param->stashes) != -1) {
11609 HV* const stash = (HV*) av_shift(param->stashes);
11610 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11611 if (cloner && GvCV(cloner)) {
11616 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
11618 call_sv((SV*)GvCV(cloner), G_DISCARD);
11624 SvREFCNT_dec(param->stashes);
11626 /* orphaned? eg threads->new inside BEGIN or use */
11627 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
11628 (void)SvREFCNT_inc(PL_compcv);
11629 SAVEFREESV(PL_compcv);
11635 #endif /* USE_ITHREADS */
11638 =head1 Unicode Support
11640 =for apidoc sv_recode_to_utf8
11642 The encoding is assumed to be an Encode object, on entry the PV
11643 of the sv is assumed to be octets in that encoding, and the sv
11644 will be converted into Unicode (and UTF-8).
11646 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11647 is not a reference, nothing is done to the sv. If the encoding is not
11648 an C<Encode::XS> Encoding object, bad things will happen.
11649 (See F<lib/encoding.pm> and L<Encode>).
11651 The PV of the sv is returned.
11656 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11659 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11673 Passing sv_yes is wrong - it needs to be or'ed set of constants
11674 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11675 remove converted chars from source.
11677 Both will default the value - let them.
11679 XPUSHs(&PL_sv_yes);
11682 call_method("decode", G_SCALAR);
11686 s = SvPV_const(uni, len);
11687 if (s != SvPVX_const(sv)) {
11688 SvGROW(sv, len + 1);
11689 Move(s, SvPVX(sv), len + 1, char);
11690 SvCUR_set(sv, len);
11697 return SvPOKp(sv) ? SvPVX(sv) : NULL;
11701 =for apidoc sv_cat_decode
11703 The encoding is assumed to be an Encode object, the PV of the ssv is
11704 assumed to be octets in that encoding and decoding the input starts
11705 from the position which (PV + *offset) pointed to. The dsv will be
11706 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11707 when the string tstr appears in decoding output or the input ends on
11708 the PV of the ssv. The value which the offset points will be modified
11709 to the last input position on the ssv.
11711 Returns TRUE if the terminator was found, else returns FALSE.
11716 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11717 SV *ssv, int *offset, char *tstr, int tlen)
11721 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11732 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11733 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11735 call_method("cat_decode", G_SCALAR);
11737 ret = SvTRUE(TOPs);
11738 *offset = SvIV(offsv);
11744 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
11750 * c-indentation-style: bsd
11751 * c-basic-offset: 4
11752 * indent-tabs-mode: t
11755 * ex: set ts=8 sts=4 sw=4 noet: