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();
679 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
680 * XXX get rid of all this if gv_fullnameX() ever supports this
684 HV * const hv = GvSTASH(gv);
687 else if (!(p=HvNAME_get(hv)))
689 if (strEQ(p, "main"))
690 sv_setpvn(name, &gvtype, 1);
692 Perl_sv_setpvf(aTHX_ name, "%c%s::", gvtype, p);
694 if (GvNAMELEN(gv)>= 1 &&
695 ((unsigned int)*GvNAME(gv)) <= 26)
697 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
698 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
701 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
705 CV * const cv = find_runcv(&unused);
709 if (!cv || !CvPADLIST(cv))
711 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
712 sv = *av_fetch(av, targ, FALSE);
713 /* SvLEN in a pad name is not to be trusted */
714 sv_setpv(name, SvPV_nolen_const(sv));
717 if (subscript_type == FUV_SUBSCRIPT_HASH) {
718 SV * const sv = NEWSV(0,0);
720 Perl_sv_catpvf(aTHX_ name, "{%s}",
721 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
724 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
726 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
728 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
729 sv_insert(name, 0, 0, "within ", 7);
736 =for apidoc find_uninit_var
738 Find the name of the undefined variable (if any) that caused the operator o
739 to issue a "Use of uninitialized value" warning.
740 If match is true, only return a name if it's value matches uninit_sv.
741 So roughly speaking, if a unary operator (such as OP_COS) generates a
742 warning, then following the direct child of the op may yield an
743 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
744 other hand, with OP_ADD there are two branches to follow, so we only print
745 the variable name if we get an exact match.
747 The name is returned as a mortal SV.
749 Assumes that PL_op is the op that originally triggered the error, and that
750 PL_comppad/PL_curpad points to the currently executing pad.
756 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
764 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
765 uninit_sv == &PL_sv_placeholder)))
768 switch (obase->op_type) {
775 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
776 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
779 int subscript_type = FUV_SUBSCRIPT_WITHIN;
781 if (pad) { /* @lex, %lex */
782 sv = PAD_SVl(obase->op_targ);
786 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
787 /* @global, %global */
788 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
791 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
793 else /* @{expr}, %{expr} */
794 return find_uninit_var(cUNOPx(obase)->op_first,
798 /* attempt to find a match within the aggregate */
800 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
802 subscript_type = FUV_SUBSCRIPT_HASH;
805 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
807 subscript_type = FUV_SUBSCRIPT_ARRAY;
810 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
813 return varname(gv, hash ? '%' : '@', obase->op_targ,
814 keysv, index, subscript_type);
818 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
820 return varname(Nullgv, '$', obase->op_targ,
821 Nullsv, 0, FUV_SUBSCRIPT_NONE);
824 gv = cGVOPx_gv(obase);
825 if (!gv || (match && GvSV(gv) != uninit_sv))
827 return varname(gv, '$', 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
830 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
833 av = (AV*)PAD_SV(obase->op_targ);
834 if (!av || SvRMAGICAL(av))
836 svp = av_fetch(av, (I32)obase->op_private, FALSE);
837 if (!svp || *svp != uninit_sv)
840 return varname(Nullgv, '$', obase->op_targ,
841 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
844 gv = cGVOPx_gv(obase);
850 if (!av || SvRMAGICAL(av))
852 svp = av_fetch(av, (I32)obase->op_private, FALSE);
853 if (!svp || *svp != uninit_sv)
856 return varname(gv, '$', 0,
857 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
862 o = cUNOPx(obase)->op_first;
863 if (!o || o->op_type != OP_NULL ||
864 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
866 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
871 /* $a[uninit_expr] or $h{uninit_expr} */
872 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
875 o = cBINOPx(obase)->op_first;
876 kid = cBINOPx(obase)->op_last;
878 /* get the av or hv, and optionally the gv */
880 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
881 sv = PAD_SV(o->op_targ);
883 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
884 && cUNOPo->op_first->op_type == OP_GV)
886 gv = cGVOPx_gv(cUNOPo->op_first);
889 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
894 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
895 /* index is constant */
899 if (obase->op_type == OP_HELEM) {
900 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
901 if (!he || HeVAL(he) != uninit_sv)
905 SV ** const svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
906 if (!svp || *svp != uninit_sv)
910 if (obase->op_type == OP_HELEM)
911 return varname(gv, '%', o->op_targ,
912 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
914 return varname(gv, '@', o->op_targ, Nullsv,
915 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
919 /* index is an expression;
920 * attempt to find a match within the aggregate */
921 if (obase->op_type == OP_HELEM) {
922 SV * const keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
924 return varname(gv, '%', o->op_targ,
925 keysv, 0, FUV_SUBSCRIPT_HASH);
928 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
930 return varname(gv, '@', o->op_targ,
931 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
936 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
938 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
944 /* only examine RHS */
945 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
948 o = cUNOPx(obase)->op_first;
949 if (o->op_type == OP_PUSHMARK)
952 if (!o->op_sibling) {
953 /* one-arg version of open is highly magical */
955 if (o->op_type == OP_GV) { /* open FOO; */
957 if (match && GvSV(gv) != uninit_sv)
959 return varname(gv, '$', 0,
960 Nullsv, 0, FUV_SUBSCRIPT_NONE);
962 /* other possibilities not handled are:
963 * open $x; or open my $x; should return '${*$x}'
964 * open expr; should return '$'.expr ideally
970 /* ops where $_ may be an implicit arg */
974 if ( !(obase->op_flags & OPf_STACKED)) {
975 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
976 ? PAD_SVl(obase->op_targ)
980 sv_setpvn(sv, "$_", 2);
988 /* skip filehandle as it can't produce 'undef' warning */
989 o = cUNOPx(obase)->op_first;
990 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
991 o = o->op_sibling->op_sibling;
998 match = 1; /* XS or custom code could trigger random warnings */
1003 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1004 return sv_2mortal(newSVpvn("${$/}", 5));
1009 if (!(obase->op_flags & OPf_KIDS))
1011 o = cUNOPx(obase)->op_first;
1017 /* if all except one arg are constant, or have no side-effects,
1018 * or are optimized away, then it's unambiguous */
1020 for (kid=o; kid; kid = kid->op_sibling) {
1022 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1023 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1024 || (kid->op_type == OP_PUSHMARK)
1028 if (o2) { /* more than one found */
1035 return find_uninit_var(o2, uninit_sv, match);
1039 sv = find_uninit_var(o, uninit_sv, 1);
1051 =for apidoc report_uninit
1053 Print appropriate "Use of uninitialized variable" warning
1059 Perl_report_uninit(pTHX_ SV* uninit_sv)
1062 SV* varname = Nullsv;
1064 varname = find_uninit_var(PL_op, uninit_sv,0);
1066 sv_insert(varname, 0, 0, " ", 1);
1068 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1069 varname ? SvPV_nolen_const(varname) : "",
1070 " in ", OP_DESC(PL_op));
1073 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1078 S_more_bodies (pTHX_ void **arena_root, void **root, size_t size)
1082 const size_t count = PERL_ARENA_SIZE/size;
1083 Newx(start, count*size, char);
1084 *((void **) start) = *arena_root;
1085 *arena_root = (void *)start;
1087 end = start + (count-1) * size;
1089 /* The initial slot is used to link the arenas together, so it isn't to be
1090 linked into the list of ready-to-use bodies. */
1094 *root = (void *)start;
1096 while (start < end) {
1097 char * const next = start + size;
1098 *(void**) start = (void *)next;
1101 *(void **)start = 0;
1106 /* grab a new thing from the free list, allocating more if necessary */
1108 /* 1st, the inline version */
1110 #define new_body_inline(xpv, arena_root, root, size) \
1113 xpv = *((void **)(root)) \
1114 ? *((void **)(root)) : S_more_bodies(aTHX_ arena_root, root, size); \
1115 *(root) = *(void**)(xpv); \
1119 /* now use the inline version in the proper function */
1122 S_new_body(pTHX_ void **arena_root, void **root, size_t size)
1125 new_body_inline(xpv, arena_root, root, size);
1129 /* return a thing to the free list */
1131 #define del_body(thing, root) \
1133 void **thing_copy = (void **)thing; \
1135 *thing_copy = *root; \
1136 *root = (void*)thing_copy; \
1140 /* Conventionally we simply malloc() a big block of memory, then divide it
1141 up into lots of the thing that we're allocating.
1143 This macro will expand to call to S_new_body. So for XPVBM (with ithreads),
1146 S_new_body(my_perl, (void**)&(my_perl->Ixpvbm_arenaroot),
1147 (void**)&(my_perl->Ixpvbm_root), sizeof(XPVBM), 0)
1150 #define new_body_type(TYPE,lctype) \
1151 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1152 (void**)&PL_ ## lctype ## _root, \
1155 #define del_body_type(p,TYPE,lctype) \
1156 del_body((void*)p, (void**)&PL_ ## lctype ## _root)
1158 /* But for some types, we cheat. The type starts with some members that are
1159 never accessed. So we allocate the substructure, starting at the first used
1160 member, then adjust the pointer back in memory by the size of the bit not
1161 allocated, so it's as if we allocated the full structure.
1162 (But things will all go boom if you write to the part that is "not there",
1163 because you'll be overwriting the last members of the preceding structure
1166 We calculate the correction using the STRUCT_OFFSET macro. For example, if
1167 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
1168 and the pointer is unchanged. If the allocated structure is smaller (no
1169 initial NV actually allocated) then the net effect is to subtract the size
1170 of the NV from the pointer, to return a new pointer as if an initial NV were
1173 This is the same trick as was used for NV and IV bodies. Ironically it
1174 doesn't need to be used for NV bodies any more, because NV is now at the
1175 start of the structure. IV bodies don't need it either, because they are
1176 no longer allocated. */
1178 #define new_body_allocated(TYPE,lctype,member) \
1179 (void*)((char*)S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1180 (void**)&PL_ ## lctype ## _root, \
1181 sizeof(lctype ## _allocated)) - \
1182 STRUCT_OFFSET(TYPE, member) \
1183 + STRUCT_OFFSET(lctype ## _allocated, member))
1186 #define del_body_allocated(p,TYPE,lctype,member) \
1187 del_body((void*)((char*)p + STRUCT_OFFSET(TYPE, member) \
1188 - STRUCT_OFFSET(lctype ## _allocated, member)), \
1189 (void**)&PL_ ## lctype ## _root)
1191 #define my_safemalloc(s) (void*)safemalloc(s)
1192 #define my_safefree(p) safefree((char*)p)
1196 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1197 #define del_XNV(p) my_safefree(p)
1199 #define new_XPV() my_safemalloc(sizeof(XPV))
1200 #define del_XPV(p) my_safefree(p)
1202 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1203 #define del_XPVIV(p) my_safefree(p)
1205 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1206 #define del_XPVNV(p) my_safefree(p)
1208 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1209 #define del_XPVCV(p) my_safefree(p)
1211 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1212 #define del_XPVAV(p) my_safefree(p)
1214 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1215 #define del_XPVHV(p) my_safefree(p)
1217 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1218 #define del_XPVMG(p) my_safefree(p)
1220 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1221 #define del_XPVGV(p) my_safefree(p)
1223 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1224 #define del_XPVLV(p) my_safefree(p)
1226 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1227 #define del_XPVBM(p) my_safefree(p)
1231 #define new_XNV() new_body_type(NV, xnv)
1232 #define del_XNV(p) del_body_type(p, NV, xnv)
1234 #define new_XPV() new_body_allocated(XPV, xpv, xpv_cur)
1235 #define del_XPV(p) del_body_allocated(p, XPV, xpv, xpv_cur)
1237 #define new_XPVIV() new_body_allocated(XPVIV, xpviv, xpv_cur)
1238 #define del_XPVIV(p) del_body_allocated(p, XPVIV, xpviv, xpv_cur)
1240 #define new_XPVNV() new_body_type(XPVNV, xpvnv)
1241 #define del_XPVNV(p) del_body_type(p, XPVNV, xpvnv)
1243 #define new_XPVCV() new_body_type(XPVCV, xpvcv)
1244 #define del_XPVCV(p) del_body_type(p, XPVCV, xpvcv)
1246 #define new_XPVAV() new_body_allocated(XPVAV, xpvav, xav_fill)
1247 #define del_XPVAV(p) del_body_allocated(p, XPVAV, xpvav, xav_fill)
1249 #define new_XPVHV() new_body_allocated(XPVHV, xpvhv, xhv_fill)
1250 #define del_XPVHV(p) del_body_allocated(p, XPVHV, xpvhv, xhv_fill)
1252 #define new_XPVMG() new_body_type(XPVMG, xpvmg)
1253 #define del_XPVMG(p) del_body_type(p, XPVMG, xpvmg)
1255 #define new_XPVGV() new_body_type(XPVGV, xpvgv)
1256 #define del_XPVGV(p) del_body_type(p, XPVGV, xpvgv)
1258 #define new_XPVLV() new_body_type(XPVLV, xpvlv)
1259 #define del_XPVLV(p) del_body_type(p, XPVLV, xpvlv)
1261 #define new_XPVBM() new_body_type(XPVBM, xpvbm)
1262 #define del_XPVBM(p) del_body_type(p, XPVBM, xpvbm)
1266 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1267 #define del_XPVFM(p) my_safefree(p)
1269 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1270 #define del_XPVIO(p) my_safefree(p)
1273 =for apidoc sv_upgrade
1275 Upgrade an SV to a more complex form. Generally adds a new body type to the
1276 SV, then copies across as much information as possible from the old body.
1277 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1283 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1285 void** old_body_arena;
1286 size_t old_body_offset;
1287 size_t old_body_length; /* Well, the length to copy. */
1289 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1290 /* If NV 0.0 is store as all bits 0 then Zero() already creates a correct
1292 bool zero_nv = TRUE;
1295 size_t new_body_length;
1296 size_t new_body_offset;
1297 void** new_body_arena;
1298 void** new_body_arenaroot;
1299 const U32 old_type = SvTYPE(sv);
1301 if (mt != SVt_PV && SvIsCOW(sv)) {
1302 sv_force_normal_flags(sv, 0);
1305 if (SvTYPE(sv) == mt)
1308 if (SvTYPE(sv) > mt)
1309 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1310 (int)SvTYPE(sv), (int)mt);
1313 old_body = SvANY(sv);
1315 old_body_offset = 0;
1316 old_body_length = 0;
1317 new_body_offset = 0;
1318 new_body_length = ~0;
1320 /* Copying structures onto other structures that have been neatly zeroed
1321 has a subtle gotcha. Consider XPVMG
1323 +------+------+------+------+------+-------+-------+
1324 | NV | CUR | LEN | IV | MAGIC | STASH |
1325 +------+------+------+------+------+-------+-------+
1326 0 4 8 12 16 20 24 28
1328 where NVs are aligned to 8 bytes, so that sizeof that structure is
1329 actually 32 bytes long, with 4 bytes of padding at the end:
1331 +------+------+------+------+------+-------+-------+------+
1332 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1333 +------+------+------+------+------+-------+-------+------+
1334 0 4 8 12 16 20 24 28 32
1336 so what happens if you allocate memory for this structure:
1338 +------+------+------+------+------+-------+-------+------+------+...
1339 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1340 +------+------+------+------+------+-------+-------+------+------+...
1341 0 4 8 12 16 20 24 28 32 36
1343 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1344 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1345 started out as zero once, but it's quite possible that it isn't. So now,
1346 rather than a nicely zeroed GP, you have it pointing somewhere random.
1349 (In fact, GP ends up pointing at a previous GP structure, because the
1350 principle cause of the padding in XPVMG getting garbage is a copy of
1351 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1353 So we are careful and work out the size of used parts of all the
1356 switch (SvTYPE(sv)) {
1362 else if (mt < SVt_PVIV)
1364 old_body_offset = STRUCT_OFFSET(XPVIV, xiv_iv);
1365 old_body_length = sizeof(IV);
1368 old_body_arena = (void **) &PL_xnv_root;
1369 old_body_length = sizeof(NV);
1370 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1379 old_body_arena = (void **) &PL_xpv_root;
1380 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1381 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1382 old_body_length = STRUCT_OFFSET(XPV, xpv_len)
1383 + sizeof (((XPV*)SvANY(sv))->xpv_len)
1387 else if (mt == SVt_NV)
1391 old_body_arena = (void **) &PL_xpviv_root;
1392 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1393 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1394 old_body_length = STRUCT_OFFSET(XPVIV, xiv_u)
1395 + sizeof (((XPVIV*)SvANY(sv))->xiv_u)
1399 old_body_arena = (void **) &PL_xpvnv_root;
1400 old_body_length = STRUCT_OFFSET(XPVNV, xiv_u)
1401 + sizeof (((XPVNV*)SvANY(sv))->xiv_u);
1402 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1407 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1408 there's no way that it can be safely upgraded, because perl.c
1409 expects to Safefree(SvANY(PL_mess_sv)) */
1410 assert(sv != PL_mess_sv);
1411 /* This flag bit is used to mean other things in other scalar types.
1412 Given that it only has meaning inside the pad, it shouldn't be set
1413 on anything that can get upgraded. */
1414 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1415 old_body_arena = (void **) &PL_xpvmg_root;
1416 old_body_length = STRUCT_OFFSET(XPVMG, xmg_stash)
1417 + sizeof (((XPVMG*)SvANY(sv))->xmg_stash);
1418 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1423 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1426 SvFLAGS(sv) &= ~SVTYPEMASK;
1431 Perl_croak(aTHX_ "Can't upgrade to undef");
1433 assert(old_type == SVt_NULL);
1434 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1438 assert(old_type == SVt_NULL);
1439 SvANY(sv) = new_XNV();
1443 assert(old_type == SVt_NULL);
1444 SvANY(sv) = &sv->sv_u.svu_rv;
1448 SvANY(sv) = new_XPVHV();
1451 HvTOTALKEYS(sv) = 0;
1456 SvANY(sv) = new_XPVAV();
1463 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1464 The target created by newSVrv also is, and it can have magic.
1465 However, it never has SvPVX set.
1467 if (old_type >= SVt_RV) {
1468 assert(SvPVX_const(sv) == 0);
1471 /* Could put this in the else clause below, as PVMG must have SvPVX
1472 0 already (the assertion above) */
1473 SvPV_set(sv, (char*)0);
1475 if (old_type >= SVt_PVMG) {
1476 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1477 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1485 new_body = new_XPVIO();
1486 new_body_length = sizeof(XPVIO);
1489 new_body = new_XPVFM();
1490 new_body_length = sizeof(XPVFM);
1494 new_body_length = sizeof(XPVBM);
1495 new_body_arena = (void **) &PL_xpvbm_root;
1496 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
1499 new_body_length = sizeof(XPVGV);
1500 new_body_arena = (void **) &PL_xpvgv_root;
1501 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
1504 new_body_length = sizeof(XPVCV);
1505 new_body_arena = (void **) &PL_xpvcv_root;
1506 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
1509 new_body_length = sizeof(XPVLV);
1510 new_body_arena = (void **) &PL_xpvlv_root;
1511 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
1514 new_body_length = sizeof(XPVMG);
1515 new_body_arena = (void **) &PL_xpvmg_root;
1516 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
1519 new_body_length = sizeof(XPVNV);
1520 new_body_arena = (void **) &PL_xpvnv_root;
1521 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
1524 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1525 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1526 new_body_length = sizeof(XPVIV) - new_body_offset;
1527 new_body_arena = (void **) &PL_xpviv_root;
1528 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
1529 /* XXX Is this still needed? Was it ever needed? Surely as there is
1530 no route from NV to PVIV, NOK can never be true */
1534 goto new_body_no_NV;
1536 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1537 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1538 new_body_length = sizeof(XPV) - new_body_offset;
1539 new_body_arena = (void **) &PL_xpv_root;
1540 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
1542 /* PV and PVIV don't have an NV slot. */
1543 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1548 assert(new_body_length);
1550 /* This points to the start of the allocated area. */
1551 new_body_inline(new_body, new_body_arenaroot, new_body_arena,
1554 /* We always allocated the full length item with PURIFY */
1555 new_body_length += new_body_offset;
1556 new_body_offset = 0;
1557 new_body = my_safemalloc(new_body_length);
1561 Zero(new_body, new_body_length, char);
1562 new_body = ((char *)new_body) - new_body_offset;
1563 SvANY(sv) = new_body;
1565 if (old_body_length) {
1566 Copy((char *)old_body + old_body_offset,
1567 (char *)new_body + old_body_offset,
1568 old_body_length, char);
1571 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1577 IoPAGE_LEN(sv) = 60;
1578 if (old_type < SVt_RV)
1582 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", mt);
1586 if (old_body_arena) {
1588 my_safefree(old_body);
1590 del_body((void*)((char*)old_body + old_body_offset),
1597 =for apidoc sv_backoff
1599 Remove any string offset. You should normally use the C<SvOOK_off> macro
1606 Perl_sv_backoff(pTHX_ register SV *sv)
1609 assert(SvTYPE(sv) != SVt_PVHV);
1610 assert(SvTYPE(sv) != SVt_PVAV);
1612 const char * const s = SvPVX_const(sv);
1613 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1614 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1616 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1618 SvFLAGS(sv) &= ~SVf_OOK;
1625 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1626 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1627 Use the C<SvGROW> wrapper instead.
1633 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1637 #ifdef HAS_64K_LIMIT
1638 if (newlen >= 0x10000) {
1639 PerlIO_printf(Perl_debug_log,
1640 "Allocation too large: %"UVxf"\n", (UV)newlen);
1643 #endif /* HAS_64K_LIMIT */
1646 if (SvTYPE(sv) < SVt_PV) {
1647 sv_upgrade(sv, SVt_PV);
1648 s = SvPVX_mutable(sv);
1650 else if (SvOOK(sv)) { /* pv is offset? */
1652 s = SvPVX_mutable(sv);
1653 if (newlen > SvLEN(sv))
1654 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1655 #ifdef HAS_64K_LIMIT
1656 if (newlen >= 0x10000)
1661 s = SvPVX_mutable(sv);
1663 if (newlen > SvLEN(sv)) { /* need more room? */
1664 newlen = PERL_STRLEN_ROUNDUP(newlen);
1665 if (SvLEN(sv) && s) {
1667 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1673 s = saferealloc(s, newlen);
1676 s = safemalloc(newlen);
1677 if (SvPVX_const(sv) && SvCUR(sv)) {
1678 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1682 SvLEN_set(sv, newlen);
1688 =for apidoc sv_setiv
1690 Copies an integer into the given SV, upgrading first if necessary.
1691 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1697 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1699 SV_CHECK_THINKFIRST_COW_DROP(sv);
1700 switch (SvTYPE(sv)) {
1702 sv_upgrade(sv, SVt_IV);
1705 sv_upgrade(sv, SVt_PVNV);
1709 sv_upgrade(sv, SVt_PVIV);
1718 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1721 (void)SvIOK_only(sv); /* validate number */
1727 =for apidoc sv_setiv_mg
1729 Like C<sv_setiv>, but also handles 'set' magic.
1735 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1742 =for apidoc sv_setuv
1744 Copies an unsigned integer into the given SV, upgrading first if necessary.
1745 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1751 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1753 /* With these two if statements:
1754 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1757 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1759 If you wish to remove them, please benchmark to see what the effect is
1761 if (u <= (UV)IV_MAX) {
1762 sv_setiv(sv, (IV)u);
1771 =for apidoc sv_setuv_mg
1773 Like C<sv_setuv>, but also handles 'set' magic.
1779 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1788 =for apidoc sv_setnv
1790 Copies a double into the given SV, upgrading first if necessary.
1791 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1797 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1799 SV_CHECK_THINKFIRST_COW_DROP(sv);
1800 switch (SvTYPE(sv)) {
1803 sv_upgrade(sv, SVt_NV);
1808 sv_upgrade(sv, SVt_PVNV);
1817 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1821 (void)SvNOK_only(sv); /* validate number */
1826 =for apidoc sv_setnv_mg
1828 Like C<sv_setnv>, but also handles 'set' magic.
1834 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1840 /* Print an "isn't numeric" warning, using a cleaned-up,
1841 * printable version of the offending string
1845 S_not_a_number(pTHX_ SV *sv)
1852 dsv = sv_2mortal(newSVpvn("", 0));
1853 pv = sv_uni_display(dsv, sv, 10, 0);
1856 const char * const limit = tmpbuf + sizeof(tmpbuf) - 8;
1857 /* each *s can expand to 4 chars + "...\0",
1858 i.e. need room for 8 chars */
1860 const char *s, *end;
1861 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1864 if (ch & 128 && !isPRINT_LC(ch)) {
1873 else if (ch == '\r') {
1877 else if (ch == '\f') {
1881 else if (ch == '\\') {
1885 else if (ch == '\0') {
1889 else if (isPRINT_LC(ch))
1906 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1907 "Argument \"%s\" isn't numeric in %s", pv,
1910 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1911 "Argument \"%s\" isn't numeric", pv);
1915 =for apidoc looks_like_number
1917 Test if the content of an SV looks like a number (or is a number).
1918 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1919 non-numeric warning), even if your atof() doesn't grok them.
1925 Perl_looks_like_number(pTHX_ SV *sv)
1927 register const char *sbegin;
1931 sbegin = SvPVX_const(sv);
1934 else if (SvPOKp(sv))
1935 sbegin = SvPV_const(sv, len);
1937 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1938 return grok_number(sbegin, len, NULL);
1941 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1942 until proven guilty, assume that things are not that bad... */
1947 As 64 bit platforms often have an NV that doesn't preserve all bits of
1948 an IV (an assumption perl has been based on to date) it becomes necessary
1949 to remove the assumption that the NV always carries enough precision to
1950 recreate the IV whenever needed, and that the NV is the canonical form.
1951 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1952 precision as a side effect of conversion (which would lead to insanity
1953 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1954 1) to distinguish between IV/UV/NV slots that have cached a valid
1955 conversion where precision was lost and IV/UV/NV slots that have a
1956 valid conversion which has lost no precision
1957 2) to ensure that if a numeric conversion to one form is requested that
1958 would lose precision, the precise conversion (or differently
1959 imprecise conversion) is also performed and cached, to prevent
1960 requests for different numeric formats on the same SV causing
1961 lossy conversion chains. (lossless conversion chains are perfectly
1966 SvIOKp is true if the IV slot contains a valid value
1967 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1968 SvNOKp is true if the NV slot contains a valid value
1969 SvNOK is true only if the NV value is accurate
1972 while converting from PV to NV, check to see if converting that NV to an
1973 IV(or UV) would lose accuracy over a direct conversion from PV to
1974 IV(or UV). If it would, cache both conversions, return NV, but mark
1975 SV as IOK NOKp (ie not NOK).
1977 While converting from PV to IV, check to see if converting that IV to an
1978 NV would lose accuracy over a direct conversion from PV to NV. If it
1979 would, cache both conversions, flag similarly.
1981 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1982 correctly because if IV & NV were set NV *always* overruled.
1983 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1984 changes - now IV and NV together means that the two are interchangeable:
1985 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1987 The benefit of this is that operations such as pp_add know that if
1988 SvIOK is true for both left and right operands, then integer addition
1989 can be used instead of floating point (for cases where the result won't
1990 overflow). Before, floating point was always used, which could lead to
1991 loss of precision compared with integer addition.
1993 * making IV and NV equal status should make maths accurate on 64 bit
1995 * may speed up maths somewhat if pp_add and friends start to use
1996 integers when possible instead of fp. (Hopefully the overhead in
1997 looking for SvIOK and checking for overflow will not outweigh the
1998 fp to integer speedup)
1999 * will slow down integer operations (callers of SvIV) on "inaccurate"
2000 values, as the change from SvIOK to SvIOKp will cause a call into
2001 sv_2iv each time rather than a macro access direct to the IV slot
2002 * should speed up number->string conversion on integers as IV is
2003 favoured when IV and NV are equally accurate
2005 ####################################################################
2006 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2007 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2008 On the other hand, SvUOK is true iff UV.
2009 ####################################################################
2011 Your mileage will vary depending your CPU's relative fp to integer
2015 #ifndef NV_PRESERVES_UV
2016 # define IS_NUMBER_UNDERFLOW_IV 1
2017 # define IS_NUMBER_UNDERFLOW_UV 2
2018 # define IS_NUMBER_IV_AND_UV 2
2019 # define IS_NUMBER_OVERFLOW_IV 4
2020 # define IS_NUMBER_OVERFLOW_UV 5
2022 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2024 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2026 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2028 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));
2029 if (SvNVX(sv) < (NV)IV_MIN) {
2030 (void)SvIOKp_on(sv);
2032 SvIV_set(sv, IV_MIN);
2033 return IS_NUMBER_UNDERFLOW_IV;
2035 if (SvNVX(sv) > (NV)UV_MAX) {
2036 (void)SvIOKp_on(sv);
2039 SvUV_set(sv, UV_MAX);
2040 return IS_NUMBER_OVERFLOW_UV;
2042 (void)SvIOKp_on(sv);
2044 /* Can't use strtol etc to convert this string. (See truth table in
2046 if (SvNVX(sv) <= (UV)IV_MAX) {
2047 SvIV_set(sv, I_V(SvNVX(sv)));
2048 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2049 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2051 /* Integer is imprecise. NOK, IOKp */
2053 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2056 SvUV_set(sv, U_V(SvNVX(sv)));
2057 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2058 if (SvUVX(sv) == UV_MAX) {
2059 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2060 possibly be preserved by NV. Hence, it must be overflow.
2062 return IS_NUMBER_OVERFLOW_UV;
2064 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2066 /* Integer is imprecise. NOK, IOKp */
2068 return IS_NUMBER_OVERFLOW_IV;
2070 #endif /* !NV_PRESERVES_UV*/
2073 =for apidoc sv_2iv_flags
2075 Return the integer value of an SV, doing any necessary string
2076 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2077 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2083 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2087 if (SvGMAGICAL(sv)) {
2088 if (flags & SV_GMAGIC)
2093 return I_V(SvNVX(sv));
2095 if (SvPOKp(sv) && SvLEN(sv))
2098 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2099 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2105 if (SvTHINKFIRST(sv)) {
2108 SV * const tmpstr=AMG_CALLun(sv,numer);
2109 if (tmpstr && (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2110 return SvIV(tmpstr);
2113 return PTR2IV(SvRV(sv));
2116 sv_force_normal_flags(sv, 0);
2118 if (SvREADONLY(sv) && !SvOK(sv)) {
2119 if (ckWARN(WARN_UNINITIALIZED))
2126 return (IV)(SvUVX(sv));
2133 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2134 * without also getting a cached IV/UV from it at the same time
2135 * (ie PV->NV conversion should detect loss of accuracy and cache
2136 * IV or UV at same time to avoid this. NWC */
2138 if (SvTYPE(sv) == SVt_NV)
2139 sv_upgrade(sv, SVt_PVNV);
2141 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2142 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2143 certainly cast into the IV range at IV_MAX, whereas the correct
2144 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2146 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2147 SvIV_set(sv, I_V(SvNVX(sv)));
2148 if (SvNVX(sv) == (NV) SvIVX(sv)
2149 #ifndef NV_PRESERVES_UV
2150 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2151 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2152 /* Don't flag it as "accurately an integer" if the number
2153 came from a (by definition imprecise) NV operation, and
2154 we're outside the range of NV integer precision */
2157 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2158 DEBUG_c(PerlIO_printf(Perl_debug_log,
2159 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2165 /* IV not precise. No need to convert from PV, as NV
2166 conversion would already have cached IV if it detected
2167 that PV->IV would be better than PV->NV->IV
2168 flags already correct - don't set public IOK. */
2169 DEBUG_c(PerlIO_printf(Perl_debug_log,
2170 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2175 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2176 but the cast (NV)IV_MIN rounds to a the value less (more
2177 negative) than IV_MIN which happens to be equal to SvNVX ??
2178 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2179 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2180 (NV)UVX == NVX are both true, but the values differ. :-(
2181 Hopefully for 2s complement IV_MIN is something like
2182 0x8000000000000000 which will be exact. NWC */
2185 SvUV_set(sv, U_V(SvNVX(sv)));
2187 (SvNVX(sv) == (NV) SvUVX(sv))
2188 #ifndef NV_PRESERVES_UV
2189 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2190 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2191 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2192 /* Don't flag it as "accurately an integer" if the number
2193 came from a (by definition imprecise) NV operation, and
2194 we're outside the range of NV integer precision */
2200 DEBUG_c(PerlIO_printf(Perl_debug_log,
2201 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2205 return (IV)SvUVX(sv);
2208 else if (SvPOKp(sv) && SvLEN(sv)) {
2210 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2211 /* We want to avoid a possible problem when we cache an IV which
2212 may be later translated to an NV, and the resulting NV is not
2213 the same as the direct translation of the initial string
2214 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2215 be careful to ensure that the value with the .456 is around if the
2216 NV value is requested in the future).
2218 This means that if we cache such an IV, we need to cache the
2219 NV as well. Moreover, we trade speed for space, and do not
2220 cache the NV if we are sure it's not needed.
2223 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2224 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2225 == IS_NUMBER_IN_UV) {
2226 /* It's definitely an integer, only upgrade to PVIV */
2227 if (SvTYPE(sv) < SVt_PVIV)
2228 sv_upgrade(sv, SVt_PVIV);
2230 } else if (SvTYPE(sv) < SVt_PVNV)
2231 sv_upgrade(sv, SVt_PVNV);
2233 /* If NV preserves UV then we only use the UV value if we know that
2234 we aren't going to call atof() below. If NVs don't preserve UVs
2235 then the value returned may have more precision than atof() will
2236 return, even though value isn't perfectly accurate. */
2237 if ((numtype & (IS_NUMBER_IN_UV
2238 #ifdef NV_PRESERVES_UV
2241 )) == IS_NUMBER_IN_UV) {
2242 /* This won't turn off the public IOK flag if it was set above */
2243 (void)SvIOKp_on(sv);
2245 if (!(numtype & IS_NUMBER_NEG)) {
2247 if (value <= (UV)IV_MAX) {
2248 SvIV_set(sv, (IV)value);
2250 SvUV_set(sv, value);
2254 /* 2s complement assumption */
2255 if (value <= (UV)IV_MIN) {
2256 SvIV_set(sv, -(IV)value);
2258 /* Too negative for an IV. This is a double upgrade, but
2259 I'm assuming it will be rare. */
2260 if (SvTYPE(sv) < SVt_PVNV)
2261 sv_upgrade(sv, SVt_PVNV);
2265 SvNV_set(sv, -(NV)value);
2266 SvIV_set(sv, IV_MIN);
2270 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2271 will be in the previous block to set the IV slot, and the next
2272 block to set the NV slot. So no else here. */
2274 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2275 != IS_NUMBER_IN_UV) {
2276 /* It wasn't an (integer that doesn't overflow the UV). */
2277 SvNV_set(sv, Atof(SvPVX_const(sv)));
2279 if (! numtype && ckWARN(WARN_NUMERIC))
2282 #if defined(USE_LONG_DOUBLE)
2283 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2284 PTR2UV(sv), SvNVX(sv)));
2286 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2287 PTR2UV(sv), SvNVX(sv)));
2291 #ifdef NV_PRESERVES_UV
2292 (void)SvIOKp_on(sv);
2294 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2295 SvIV_set(sv, I_V(SvNVX(sv)));
2296 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2299 /* Integer is imprecise. NOK, IOKp */
2301 /* UV will not work better than IV */
2303 if (SvNVX(sv) > (NV)UV_MAX) {
2305 /* Integer is inaccurate. NOK, IOKp, is UV */
2306 SvUV_set(sv, UV_MAX);
2309 SvUV_set(sv, U_V(SvNVX(sv)));
2310 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2311 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2315 /* Integer is imprecise. NOK, IOKp, is UV */
2321 #else /* NV_PRESERVES_UV */
2322 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2323 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2324 /* The IV slot will have been set from value returned by
2325 grok_number above. The NV slot has just been set using
2328 assert (SvIOKp(sv));
2330 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2331 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2332 /* Small enough to preserve all bits. */
2333 (void)SvIOKp_on(sv);
2335 SvIV_set(sv, I_V(SvNVX(sv)));
2336 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2338 /* Assumption: first non-preserved integer is < IV_MAX,
2339 this NV is in the preserved range, therefore: */
2340 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2342 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);
2346 0 0 already failed to read UV.
2347 0 1 already failed to read UV.
2348 1 0 you won't get here in this case. IV/UV
2349 slot set, public IOK, Atof() unneeded.
2350 1 1 already read UV.
2351 so there's no point in sv_2iuv_non_preserve() attempting
2352 to use atol, strtol, strtoul etc. */
2353 if (sv_2iuv_non_preserve (sv, numtype)
2354 >= IS_NUMBER_OVERFLOW_IV)
2358 #endif /* NV_PRESERVES_UV */
2361 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2363 if (SvTYPE(sv) < SVt_IV)
2364 /* Typically the caller expects that sv_any is not NULL now. */
2365 sv_upgrade(sv, SVt_IV);
2368 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2369 PTR2UV(sv),SvIVX(sv)));
2370 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2373 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2374 * this function provided for binary compatibility only
2378 Perl_sv_2uv(pTHX_ register SV *sv)
2380 return sv_2uv_flags(sv, SV_GMAGIC);
2384 =for apidoc sv_2uv_flags
2386 Return the unsigned integer value of an SV, doing any necessary string
2387 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2388 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2394 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2398 if (SvGMAGICAL(sv)) {
2399 if (flags & SV_GMAGIC)
2404 return U_V(SvNVX(sv));
2405 if (SvPOKp(sv) && SvLEN(sv))
2408 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2409 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2415 if (SvTHINKFIRST(sv)) {
2418 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2419 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2420 return SvUV(tmpstr);
2421 return PTR2UV(SvRV(sv));
2424 sv_force_normal_flags(sv, 0);
2426 if (SvREADONLY(sv) && !SvOK(sv)) {
2427 if (ckWARN(WARN_UNINITIALIZED))
2437 return (UV)SvIVX(sv);
2441 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2442 * without also getting a cached IV/UV from it at the same time
2443 * (ie PV->NV conversion should detect loss of accuracy and cache
2444 * IV or UV at same time to avoid this. */
2445 /* IV-over-UV optimisation - choose to cache IV if possible */
2447 if (SvTYPE(sv) == SVt_NV)
2448 sv_upgrade(sv, SVt_PVNV);
2450 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2451 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2452 SvIV_set(sv, I_V(SvNVX(sv)));
2453 if (SvNVX(sv) == (NV) SvIVX(sv)
2454 #ifndef NV_PRESERVES_UV
2455 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2456 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2457 /* Don't flag it as "accurately an integer" if the number
2458 came from a (by definition imprecise) NV operation, and
2459 we're outside the range of NV integer precision */
2462 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2463 DEBUG_c(PerlIO_printf(Perl_debug_log,
2464 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2470 /* IV not precise. No need to convert from PV, as NV
2471 conversion would already have cached IV if it detected
2472 that PV->IV would be better than PV->NV->IV
2473 flags already correct - don't set public IOK. */
2474 DEBUG_c(PerlIO_printf(Perl_debug_log,
2475 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2480 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2481 but the cast (NV)IV_MIN rounds to a the value less (more
2482 negative) than IV_MIN which happens to be equal to SvNVX ??
2483 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2484 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2485 (NV)UVX == NVX are both true, but the values differ. :-(
2486 Hopefully for 2s complement IV_MIN is something like
2487 0x8000000000000000 which will be exact. NWC */
2490 SvUV_set(sv, U_V(SvNVX(sv)));
2492 (SvNVX(sv) == (NV) SvUVX(sv))
2493 #ifndef NV_PRESERVES_UV
2494 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2495 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2496 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2497 /* Don't flag it as "accurately an integer" if the number
2498 came from a (by definition imprecise) NV operation, and
2499 we're outside the range of NV integer precision */
2504 DEBUG_c(PerlIO_printf(Perl_debug_log,
2505 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2511 else if (SvPOKp(sv) && SvLEN(sv)) {
2513 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2515 /* We want to avoid a possible problem when we cache a UV which
2516 may be later translated to an NV, and the resulting NV is not
2517 the translation of the initial data.
2519 This means that if we cache such a UV, we need to cache the
2520 NV as well. Moreover, we trade speed for space, and do not
2521 cache the NV if not needed.
2524 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2525 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2526 == IS_NUMBER_IN_UV) {
2527 /* It's definitely an integer, only upgrade to PVIV */
2528 if (SvTYPE(sv) < SVt_PVIV)
2529 sv_upgrade(sv, SVt_PVIV);
2531 } else if (SvTYPE(sv) < SVt_PVNV)
2532 sv_upgrade(sv, SVt_PVNV);
2534 /* If NV preserves UV then we only use the UV value if we know that
2535 we aren't going to call atof() below. If NVs don't preserve UVs
2536 then the value returned may have more precision than atof() will
2537 return, even though it isn't accurate. */
2538 if ((numtype & (IS_NUMBER_IN_UV
2539 #ifdef NV_PRESERVES_UV
2542 )) == IS_NUMBER_IN_UV) {
2543 /* This won't turn off the public IOK flag if it was set above */
2544 (void)SvIOKp_on(sv);
2546 if (!(numtype & IS_NUMBER_NEG)) {
2548 if (value <= (UV)IV_MAX) {
2549 SvIV_set(sv, (IV)value);
2551 /* it didn't overflow, and it was positive. */
2552 SvUV_set(sv, value);
2556 /* 2s complement assumption */
2557 if (value <= (UV)IV_MIN) {
2558 SvIV_set(sv, -(IV)value);
2560 /* Too negative for an IV. This is a double upgrade, but
2561 I'm assuming it will be rare. */
2562 if (SvTYPE(sv) < SVt_PVNV)
2563 sv_upgrade(sv, SVt_PVNV);
2567 SvNV_set(sv, -(NV)value);
2568 SvIV_set(sv, IV_MIN);
2573 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2574 != IS_NUMBER_IN_UV) {
2575 /* It wasn't an integer, or it overflowed the UV. */
2576 SvNV_set(sv, Atof(SvPVX_const(sv)));
2578 if (! numtype && ckWARN(WARN_NUMERIC))
2581 #if defined(USE_LONG_DOUBLE)
2582 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2583 PTR2UV(sv), SvNVX(sv)));
2585 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2586 PTR2UV(sv), SvNVX(sv)));
2589 #ifdef NV_PRESERVES_UV
2590 (void)SvIOKp_on(sv);
2592 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2593 SvIV_set(sv, I_V(SvNVX(sv)));
2594 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2597 /* Integer is imprecise. NOK, IOKp */
2599 /* UV will not work better than IV */
2601 if (SvNVX(sv) > (NV)UV_MAX) {
2603 /* Integer is inaccurate. NOK, IOKp, is UV */
2604 SvUV_set(sv, UV_MAX);
2607 SvUV_set(sv, U_V(SvNVX(sv)));
2608 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2609 NV preservse UV so can do correct comparison. */
2610 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2614 /* Integer is imprecise. NOK, IOKp, is UV */
2619 #else /* NV_PRESERVES_UV */
2620 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2621 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2622 /* The UV slot will have been set from value returned by
2623 grok_number above. The NV slot has just been set using
2626 assert (SvIOKp(sv));
2628 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2629 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2630 /* Small enough to preserve all bits. */
2631 (void)SvIOKp_on(sv);
2633 SvIV_set(sv, I_V(SvNVX(sv)));
2634 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2636 /* Assumption: first non-preserved integer is < IV_MAX,
2637 this NV is in the preserved range, therefore: */
2638 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2640 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);
2643 sv_2iuv_non_preserve (sv, numtype);
2645 #endif /* NV_PRESERVES_UV */
2649 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2650 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2653 if (SvTYPE(sv) < SVt_IV)
2654 /* Typically the caller expects that sv_any is not NULL now. */
2655 sv_upgrade(sv, SVt_IV);
2659 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2660 PTR2UV(sv),SvUVX(sv)));
2661 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2667 Return the num value of an SV, doing any necessary string or integer
2668 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2675 Perl_sv_2nv(pTHX_ register SV *sv)
2679 if (SvGMAGICAL(sv)) {
2683 if (SvPOKp(sv) && SvLEN(sv)) {
2684 if (!SvIOKp(sv) && ckWARN(WARN_NUMERIC) &&
2685 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2687 return Atof(SvPVX_const(sv));
2691 return (NV)SvUVX(sv);
2693 return (NV)SvIVX(sv);
2696 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2697 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
2703 if (SvTHINKFIRST(sv)) {
2706 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2707 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2708 return SvNV(tmpstr);
2709 return PTR2NV(SvRV(sv));
2712 sv_force_normal_flags(sv, 0);
2714 if (SvREADONLY(sv) && !SvOK(sv)) {
2715 if (ckWARN(WARN_UNINITIALIZED))
2720 if (SvTYPE(sv) < SVt_NV) {
2721 if (SvTYPE(sv) == SVt_IV)
2722 sv_upgrade(sv, SVt_PVNV);
2724 sv_upgrade(sv, SVt_NV);
2725 #ifdef USE_LONG_DOUBLE
2727 STORE_NUMERIC_LOCAL_SET_STANDARD();
2728 PerlIO_printf(Perl_debug_log,
2729 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2730 PTR2UV(sv), SvNVX(sv));
2731 RESTORE_NUMERIC_LOCAL();
2735 STORE_NUMERIC_LOCAL_SET_STANDARD();
2736 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2737 PTR2UV(sv), SvNVX(sv));
2738 RESTORE_NUMERIC_LOCAL();
2742 else if (SvTYPE(sv) < SVt_PVNV)
2743 sv_upgrade(sv, SVt_PVNV);
2748 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2749 #ifdef NV_PRESERVES_UV
2752 /* Only set the public NV OK flag if this NV preserves the IV */
2753 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2754 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2755 : (SvIVX(sv) == I_V(SvNVX(sv))))
2761 else if (SvPOKp(sv) && SvLEN(sv)) {
2763 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2764 if (!SvIOKp(sv) && !numtype && ckWARN(WARN_NUMERIC))
2766 #ifdef NV_PRESERVES_UV
2767 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2768 == IS_NUMBER_IN_UV) {
2769 /* It's definitely an integer */
2770 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2772 SvNV_set(sv, Atof(SvPVX_const(sv)));
2775 SvNV_set(sv, Atof(SvPVX_const(sv)));
2776 /* Only set the public NV OK flag if this NV preserves the value in
2777 the PV at least as well as an IV/UV would.
2778 Not sure how to do this 100% reliably. */
2779 /* if that shift count is out of range then Configure's test is
2780 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2782 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2783 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2784 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2785 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2786 /* Can't use strtol etc to convert this string, so don't try.
2787 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2790 /* value has been set. It may not be precise. */
2791 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2792 /* 2s complement assumption for (UV)IV_MIN */
2793 SvNOK_on(sv); /* Integer is too negative. */
2798 if (numtype & IS_NUMBER_NEG) {
2799 SvIV_set(sv, -(IV)value);
2800 } else if (value <= (UV)IV_MAX) {
2801 SvIV_set(sv, (IV)value);
2803 SvUV_set(sv, value);
2807 if (numtype & IS_NUMBER_NOT_INT) {
2808 /* I believe that even if the original PV had decimals,
2809 they are lost beyond the limit of the FP precision.
2810 However, neither is canonical, so both only get p
2811 flags. NWC, 2000/11/25 */
2812 /* Both already have p flags, so do nothing */
2814 const NV nv = SvNVX(sv);
2815 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2816 if (SvIVX(sv) == I_V(nv)) {
2821 /* It had no "." so it must be integer. */
2824 /* between IV_MAX and NV(UV_MAX).
2825 Could be slightly > UV_MAX */
2827 if (numtype & IS_NUMBER_NOT_INT) {
2828 /* UV and NV both imprecise. */
2830 const UV nv_as_uv = U_V(nv);
2832 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2843 #endif /* NV_PRESERVES_UV */
2846 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
2848 if (SvTYPE(sv) < SVt_NV)
2849 /* Typically the caller expects that sv_any is not NULL now. */
2850 /* XXX Ilya implies that this is a bug in callers that assume this
2851 and ideally should be fixed. */
2852 sv_upgrade(sv, SVt_NV);
2855 #if defined(USE_LONG_DOUBLE)
2857 STORE_NUMERIC_LOCAL_SET_STANDARD();
2858 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2859 PTR2UV(sv), SvNVX(sv));
2860 RESTORE_NUMERIC_LOCAL();
2864 STORE_NUMERIC_LOCAL_SET_STANDARD();
2865 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2866 PTR2UV(sv), SvNVX(sv));
2867 RESTORE_NUMERIC_LOCAL();
2873 /* asIV(): extract an integer from the string value of an SV.
2874 * Caller must validate PVX */
2877 S_asIV(pTHX_ SV *sv)
2880 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2882 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2883 == IS_NUMBER_IN_UV) {
2884 /* It's definitely an integer */
2885 if (numtype & IS_NUMBER_NEG) {
2886 if (value < (UV)IV_MIN)
2889 if (value < (UV)IV_MAX)
2894 if (ckWARN(WARN_NUMERIC))
2897 return I_V(Atof(SvPVX_const(sv)));
2900 /* asUV(): extract an unsigned integer from the string value of an SV
2901 * Caller must validate PVX */
2904 S_asUV(pTHX_ SV *sv)
2907 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2909 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2910 == IS_NUMBER_IN_UV) {
2911 /* It's definitely an integer */
2912 if (!(numtype & IS_NUMBER_NEG))
2916 if (ckWARN(WARN_NUMERIC))
2919 return U_V(Atof(SvPVX_const(sv)));
2923 =for apidoc sv_2pv_nolen
2925 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2926 use the macro wrapper C<SvPV_nolen(sv)> instead.
2931 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2933 return sv_2pv(sv, 0);
2936 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2937 * UV as a string towards the end of buf, and return pointers to start and
2940 * We assume that buf is at least TYPE_CHARS(UV) long.
2944 S_uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2946 char *ptr = buf + TYPE_CHARS(UV);
2947 char * const ebuf = ptr;
2960 *--ptr = '0' + (char)(uv % 10);
2969 =for apidoc sv_2pv_flags
2971 Returns a pointer to the string value of an SV, and sets *lp to its length.
2972 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2974 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2975 usually end up here too.
2981 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2986 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2987 char *tmpbuf = tbuf;
2994 if (SvGMAGICAL(sv)) {
2995 if (flags & SV_GMAGIC)
3000 if (flags & SV_MUTABLE_RETURN)
3001 return SvPVX_mutable(sv);
3002 if (flags & SV_CONST_RETURN)
3003 return (char *)SvPVX_const(sv);
3008 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3010 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3015 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3020 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3021 if (!PL_localizing && ckWARN(WARN_UNINITIALIZED))
3029 if (SvTHINKFIRST(sv)) {
3032 register const char *typestr;
3033 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3034 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3036 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3039 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3040 if (flags & SV_CONST_RETURN) {
3041 pv = (char *) SvPVX_const(tmpstr);
3043 pv = (flags & SV_MUTABLE_RETURN)
3044 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3047 *lp = SvCUR(tmpstr);
3049 pv = sv_2pv_flags(tmpstr, lp, flags);
3060 typestr = "NULLREF";
3064 switch (SvTYPE(sv)) {
3066 if ( ((SvFLAGS(sv) &
3067 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3068 == (SVs_OBJECT|SVs_SMG))
3069 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3070 const regexp *re = (regexp *)mg->mg_obj;
3073 const char *fptr = "msix";
3078 char need_newline = 0;
3079 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3081 while((ch = *fptr++)) {
3083 reflags[left++] = ch;
3086 reflags[right--] = ch;
3091 reflags[left] = '-';
3095 mg->mg_len = re->prelen + 4 + left;
3097 * If /x was used, we have to worry about a regex
3098 * ending with a comment later being embedded
3099 * within another regex. If so, we don't want this
3100 * regex's "commentization" to leak out to the
3101 * right part of the enclosing regex, we must cap
3102 * it with a newline.
3104 * So, if /x was used, we scan backwards from the
3105 * end of the regex. If we find a '#' before we
3106 * find a newline, we need to add a newline
3107 * ourself. If we find a '\n' first (or if we
3108 * don't find '#' or '\n'), we don't need to add
3109 * anything. -jfriedl
3111 if (PMf_EXTENDED & re->reganch)
3113 const char *endptr = re->precomp + re->prelen;
3114 while (endptr >= re->precomp)
3116 const char c = *(endptr--);
3118 break; /* don't need another */
3120 /* we end while in a comment, so we
3122 mg->mg_len++; /* save space for it */
3123 need_newline = 1; /* note to add it */
3129 Newx(mg->mg_ptr, mg->mg_len + 1 + left, char);
3130 Copy("(?", mg->mg_ptr, 2, char);
3131 Copy(reflags, mg->mg_ptr+2, left, char);
3132 Copy(":", mg->mg_ptr+left+2, 1, char);
3133 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3135 mg->mg_ptr[mg->mg_len - 2] = '\n';
3136 mg->mg_ptr[mg->mg_len - 1] = ')';
3137 mg->mg_ptr[mg->mg_len] = 0;
3139 PL_reginterp_cnt += re->program[0].next_off;
3141 if (re->reganch & ROPT_UTF8)
3157 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3158 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3159 /* tied lvalues should appear to be
3160 * scalars for backwards compatitbility */
3161 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3162 ? "SCALAR" : "LVALUE"; break;
3163 case SVt_PVAV: typestr = "ARRAY"; break;
3164 case SVt_PVHV: typestr = "HASH"; break;
3165 case SVt_PVCV: typestr = "CODE"; break;
3166 case SVt_PVGV: typestr = "GLOB"; break;
3167 case SVt_PVFM: typestr = "FORMAT"; break;
3168 case SVt_PVIO: typestr = "IO"; break;
3169 default: typestr = "UNKNOWN"; break;
3173 const char *name = HvNAME_get(SvSTASH(sv));
3174 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3175 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3178 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3182 *lp = strlen(typestr);
3183 return (char *)typestr;
3185 if (SvREADONLY(sv) && !SvOK(sv)) {
3186 if (ckWARN(WARN_UNINITIALIZED))
3193 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3194 /* I'm assuming that if both IV and NV are equally valid then
3195 converting the IV is going to be more efficient */
3196 const U32 isIOK = SvIOK(sv);
3197 const U32 isUIOK = SvIsUV(sv);
3198 char buf[TYPE_CHARS(UV)];
3201 if (SvTYPE(sv) < SVt_PVIV)
3202 sv_upgrade(sv, SVt_PVIV);
3204 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3206 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3207 /* inlined from sv_setpvn */
3208 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3209 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3210 SvCUR_set(sv, ebuf - ptr);
3220 else if (SvNOKp(sv)) {
3221 if (SvTYPE(sv) < SVt_PVNV)
3222 sv_upgrade(sv, SVt_PVNV);
3223 /* The +20 is pure guesswork. Configure test needed. --jhi */
3224 s = SvGROW_mutable(sv, NV_DIG + 20);
3225 olderrno = errno; /* some Xenix systems wipe out errno here */
3227 if (SvNVX(sv) == 0.0)
3228 (void)strcpy(s,"0");
3232 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3235 #ifdef FIXNEGATIVEZERO
3236 if (*s == '-' && s[1] == '0' && !s[2])
3246 if (!PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP) && ckWARN(WARN_UNINITIALIZED))
3250 if (SvTYPE(sv) < SVt_PV)
3251 /* Typically the caller expects that sv_any is not NULL now. */
3252 sv_upgrade(sv, SVt_PV);
3256 const STRLEN len = s - SvPVX_const(sv);
3262 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3263 PTR2UV(sv),SvPVX_const(sv)));
3264 if (flags & SV_CONST_RETURN)
3265 return (char *)SvPVX_const(sv);
3266 if (flags & SV_MUTABLE_RETURN)
3267 return SvPVX_mutable(sv);
3271 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3272 /* Sneaky stuff here */
3276 tsv = newSVpv(tmpbuf, 0);
3289 t = SvPVX_const(tsv);
3294 len = strlen(tmpbuf);
3296 #ifdef FIXNEGATIVEZERO
3297 if (len == 2 && t[0] == '-' && t[1] == '0') {
3302 SvUPGRADE(sv, SVt_PV);
3305 s = SvGROW_mutable(sv, len + 1);
3308 return memcpy(s, t, len + 1);
3313 =for apidoc sv_copypv
3315 Copies a stringified representation of the source SV into the
3316 destination SV. Automatically performs any necessary mg_get and
3317 coercion of numeric values into strings. Guaranteed to preserve
3318 UTF-8 flag even from overloaded objects. Similar in nature to
3319 sv_2pv[_flags] but operates directly on an SV instead of just the
3320 string. Mostly uses sv_2pv_flags to do its work, except when that
3321 would lose the UTF-8'ness of the PV.
3327 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3330 const char * const s = SvPV_const(ssv,len);
3331 sv_setpvn(dsv,s,len);
3339 =for apidoc sv_2pvbyte_nolen
3341 Return a pointer to the byte-encoded representation of the SV.
3342 May cause the SV to be downgraded from UTF-8 as a side-effect.
3344 Usually accessed via the C<SvPVbyte_nolen> macro.
3350 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3352 return sv_2pvbyte(sv, 0);
3356 =for apidoc sv_2pvbyte
3358 Return a pointer to the byte-encoded representation of the SV, and set *lp
3359 to its length. May cause the SV to be downgraded from UTF-8 as a
3362 Usually accessed via the C<SvPVbyte> macro.
3368 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3370 sv_utf8_downgrade(sv,0);
3371 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3375 =for apidoc sv_2pvutf8_nolen
3377 Return a pointer to the UTF-8-encoded representation of the SV.
3378 May cause the SV to be upgraded to UTF-8 as a side-effect.
3380 Usually accessed via the C<SvPVutf8_nolen> macro.
3386 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3388 return sv_2pvutf8(sv, 0);
3392 * =for apidoc sv_2pvutf8
3394 * Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3395 * to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3397 * Usually accessed via the C<SvPVutf8> macro.
3403 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3405 sv_utf8_upgrade(sv);
3406 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3411 =for apidoc sv_2bool
3413 This function is only called on magical items, and is only used by
3414 sv_true() or its macro equivalent.
3420 Perl_sv_2bool(pTHX_ register SV *sv)
3428 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3429 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3430 return (bool)SvTRUE(tmpsv);
3431 return SvRV(sv) != 0;
3434 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
3436 (*sv->sv_u.svu_pv > '0' ||
3437 Xpvtmp->xpv_cur > 1 ||
3438 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3445 return SvIVX(sv) != 0;
3448 return SvNVX(sv) != 0.0;
3455 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3456 * this function provided for binary compatibility only
3461 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3463 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3467 =for apidoc sv_utf8_upgrade
3469 Converts the PV of an SV to its UTF-8-encoded form.
3470 Forces the SV to string form if it is not already.
3471 Always sets the SvUTF8 flag to avoid future validity checks even
3472 if all the bytes have hibit clear.
3474 This is not as a general purpose byte encoding to Unicode interface:
3475 use the Encode extension for that.
3477 =for apidoc sv_utf8_upgrade_flags
3479 Converts the PV of an SV to its UTF-8-encoded form.
3480 Forces the SV to string form if it is not already.
3481 Always sets the SvUTF8 flag to avoid future validity checks even
3482 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3483 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3484 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3486 This is not as a general purpose byte encoding to Unicode interface:
3487 use the Encode extension for that.
3493 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3495 if (sv == &PL_sv_undef)
3499 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3500 (void) sv_2pv_flags(sv,&len, flags);
3504 (void) SvPV_force(sv,len);
3513 sv_force_normal_flags(sv, 0);
3516 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3517 sv_recode_to_utf8(sv, PL_encoding);
3518 else { /* Assume Latin-1/EBCDIC */
3519 /* This function could be much more efficient if we
3520 * had a FLAG in SVs to signal if there are any hibit
3521 * chars in the PV. Given that there isn't such a flag
3522 * make the loop as fast as possible. */
3523 const U8 *s = (U8 *) SvPVX_const(sv);
3524 const U8 *e = (U8 *) SvEND(sv);
3530 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3534 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3535 U8 * const recoded = bytes_to_utf8((U8*)s, &len);
3537 SvPV_free(sv); /* No longer using what was there before. */
3539 SvPV_set(sv, (char*)recoded);
3540 SvCUR_set(sv, len - 1);
3541 SvLEN_set(sv, len); /* No longer know the real size. */
3543 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3550 =for apidoc sv_utf8_downgrade
3552 Attempts to convert the PV of an SV from characters to bytes.
3553 If the PV contains a character beyond byte, this conversion will fail;
3554 in this case, either returns false or, if C<fail_ok> is not
3557 This is not as a general purpose Unicode to byte encoding interface:
3558 use the Encode extension for that.
3564 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3566 if (SvPOKp(sv) && SvUTF8(sv)) {
3572 sv_force_normal_flags(sv, 0);
3574 s = (U8 *) SvPV(sv, len);
3575 if (!utf8_to_bytes(s, &len)) {
3580 Perl_croak(aTHX_ "Wide character in %s",
3583 Perl_croak(aTHX_ "Wide character");
3594 =for apidoc sv_utf8_encode
3596 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3597 flag off so that it looks like octets again.
3603 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3605 (void) sv_utf8_upgrade(sv);
3607 sv_force_normal_flags(sv, 0);
3609 if (SvREADONLY(sv)) {
3610 Perl_croak(aTHX_ PL_no_modify);
3616 =for apidoc sv_utf8_decode
3618 If the PV of the SV is an octet sequence in UTF-8
3619 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3620 so that it looks like a character. If the PV contains only single-byte
3621 characters, the C<SvUTF8> flag stays being off.
3622 Scans PV for validity and returns false if the PV is invalid UTF-8.
3628 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3634 /* The octets may have got themselves encoded - get them back as
3637 if (!sv_utf8_downgrade(sv, TRUE))
3640 /* it is actually just a matter of turning the utf8 flag on, but
3641 * we want to make sure everything inside is valid utf8 first.
3643 c = (const U8 *) SvPVX_const(sv);
3644 if (!is_utf8_string(c, SvCUR(sv)+1))
3646 e = (const U8 *) SvEND(sv);
3649 if (!UTF8_IS_INVARIANT(ch)) {
3659 =for apidoc sv_setsv
3661 Copies the contents of the source SV C<ssv> into the destination SV
3662 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3663 function if the source SV needs to be reused. Does not handle 'set' magic.
3664 Loosely speaking, it performs a copy-by-value, obliterating any previous
3665 content of the destination.
3667 You probably want to use one of the assortment of wrappers, such as
3668 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3669 C<SvSetMagicSV_nosteal>.
3671 =for apidoc sv_setsv_flags
3673 Copies the contents of the source SV C<ssv> into the destination SV
3674 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3675 function if the source SV needs to be reused. Does not handle 'set' magic.
3676 Loosely speaking, it performs a copy-by-value, obliterating any previous
3677 content of the destination.
3678 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3679 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3680 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3681 and C<sv_setsv_nomg> are implemented in terms of this function.
3683 You probably want to use one of the assortment of wrappers, such as
3684 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3685 C<SvSetMagicSV_nosteal>.
3687 This is the primary function for copying scalars, and most other
3688 copy-ish functions and macros use this underneath.
3694 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3696 register U32 sflags;
3702 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3704 sstr = &PL_sv_undef;
3705 stype = SvTYPE(sstr);
3706 dtype = SvTYPE(dstr);
3711 /* need to nuke the magic */
3713 SvRMAGICAL_off(dstr);
3716 /* There's a lot of redundancy below but we're going for speed here */
3721 if (dtype != SVt_PVGV) {
3722 (void)SvOK_off(dstr);
3730 sv_upgrade(dstr, SVt_IV);
3733 sv_upgrade(dstr, SVt_PVNV);
3737 sv_upgrade(dstr, SVt_PVIV);
3740 (void)SvIOK_only(dstr);
3741 SvIV_set(dstr, SvIVX(sstr));
3744 if (SvTAINTED(sstr))
3755 sv_upgrade(dstr, SVt_NV);
3760 sv_upgrade(dstr, SVt_PVNV);
3763 SvNV_set(dstr, SvNVX(sstr));
3764 (void)SvNOK_only(dstr);
3765 if (SvTAINTED(sstr))
3773 sv_upgrade(dstr, SVt_RV);
3774 else if (dtype == SVt_PVGV &&
3775 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3778 if (GvIMPORTED(dstr) != GVf_IMPORTED
3779 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3781 GvIMPORTED_on(dstr);
3790 #ifdef PERL_OLD_COPY_ON_WRITE
3791 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3792 if (dtype < SVt_PVIV)
3793 sv_upgrade(dstr, SVt_PVIV);
3800 sv_upgrade(dstr, SVt_PV);
3803 if (dtype < SVt_PVIV)
3804 sv_upgrade(dstr, SVt_PVIV);
3807 if (dtype < SVt_PVNV)
3808 sv_upgrade(dstr, SVt_PVNV);
3815 const char * const type = sv_reftype(sstr,0);
3817 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3819 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3824 if (dtype <= SVt_PVGV) {
3826 if (dtype != SVt_PVGV) {
3827 const char * const name = GvNAME(sstr);
3828 const STRLEN len = GvNAMELEN(sstr);
3829 /* don't upgrade SVt_PVLV: it can hold a glob */
3830 if (dtype != SVt_PVLV)
3831 sv_upgrade(dstr, SVt_PVGV);
3832 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3833 GvSTASH(dstr) = GvSTASH(sstr);
3835 Perl_sv_add_backref(aTHX_ (SV*)GvSTASH(dstr), dstr);
3836 GvNAME(dstr) = savepvn(name, len);
3837 GvNAMELEN(dstr) = len;
3838 SvFAKE_on(dstr); /* can coerce to non-glob */
3840 /* ahem, death to those who redefine active sort subs */
3841 else if (PL_curstackinfo->si_type == PERLSI_SORT
3842 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3843 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3846 #ifdef GV_UNIQUE_CHECK
3847 if (GvUNIQUE((GV*)dstr)) {
3848 Perl_croak(aTHX_ PL_no_modify);
3852 (void)SvOK_off(dstr);
3853 GvINTRO_off(dstr); /* one-shot flag */
3855 GvGP(dstr) = gp_ref(GvGP(sstr));
3856 if (SvTAINTED(sstr))
3858 if (GvIMPORTED(dstr) != GVf_IMPORTED
3859 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3861 GvIMPORTED_on(dstr);
3869 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3871 if ((int)SvTYPE(sstr) != stype) {
3872 stype = SvTYPE(sstr);
3873 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3877 if (stype == SVt_PVLV)
3878 SvUPGRADE(dstr, SVt_PVNV);
3880 SvUPGRADE(dstr, (U32)stype);
3883 sflags = SvFLAGS(sstr);
3885 if (sflags & SVf_ROK) {
3886 if (dtype >= SVt_PV) {
3887 if (dtype == SVt_PVGV) {
3888 SV * const sref = SvREFCNT_inc(SvRV(sstr));
3890 const int intro = GvINTRO(dstr);
3892 #ifdef GV_UNIQUE_CHECK
3893 if (GvUNIQUE((GV*)dstr)) {
3894 Perl_croak(aTHX_ PL_no_modify);
3899 GvINTRO_off(dstr); /* one-shot flag */
3900 GvLINE(dstr) = CopLINE(PL_curcop);
3901 GvEGV(dstr) = (GV*)dstr;
3904 switch (SvTYPE(sref)) {
3907 SAVEGENERICSV(GvAV(dstr));
3909 dref = (SV*)GvAV(dstr);
3910 GvAV(dstr) = (AV*)sref;
3911 if (!GvIMPORTED_AV(dstr)
3912 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3914 GvIMPORTED_AV_on(dstr);
3919 SAVEGENERICSV(GvHV(dstr));
3921 dref = (SV*)GvHV(dstr);
3922 GvHV(dstr) = (HV*)sref;
3923 if (!GvIMPORTED_HV(dstr)
3924 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3926 GvIMPORTED_HV_on(dstr);
3931 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3932 SvREFCNT_dec(GvCV(dstr));
3933 GvCV(dstr) = Nullcv;
3934 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3935 PL_sub_generation++;
3937 SAVEGENERICSV(GvCV(dstr));
3940 dref = (SV*)GvCV(dstr);
3941 if (GvCV(dstr) != (CV*)sref) {
3942 CV* const cv = GvCV(dstr);
3944 if (!GvCVGEN((GV*)dstr) &&
3945 (CvROOT(cv) || CvXSUB(cv)))
3947 /* ahem, death to those who redefine
3948 * active sort subs */
3949 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3950 PL_sortcop == CvSTART(cv))
3952 "Can't redefine active sort subroutine %s",
3953 GvENAME((GV*)dstr));
3954 /* Redefining a sub - warning is mandatory if
3955 it was a const and its value changed. */
3956 if (ckWARN(WARN_REDEFINE)
3958 && (!CvCONST((CV*)sref)
3959 || sv_cmp(cv_const_sv(cv),
3960 cv_const_sv((CV*)sref)))))
3962 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3964 ? "Constant subroutine %s::%s redefined"
3965 : "Subroutine %s::%s redefined",
3966 HvNAME_get(GvSTASH((GV*)dstr)),
3967 GvENAME((GV*)dstr));
3971 cv_ckproto(cv, (GV*)dstr,
3973 ? SvPVX_const(sref) : Nullch);
3975 GvCV(dstr) = (CV*)sref;
3976 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3977 GvASSUMECV_on(dstr);
3978 PL_sub_generation++;
3980 if (!GvIMPORTED_CV(dstr)
3981 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3983 GvIMPORTED_CV_on(dstr);
3988 SAVEGENERICSV(GvIOp(dstr));
3990 dref = (SV*)GvIOp(dstr);
3991 GvIOp(dstr) = (IO*)sref;
3995 SAVEGENERICSV(GvFORM(dstr));
3997 dref = (SV*)GvFORM(dstr);
3998 GvFORM(dstr) = (CV*)sref;
4002 SAVEGENERICSV(GvSV(dstr));
4004 dref = (SV*)GvSV(dstr);
4006 if (!GvIMPORTED_SV(dstr)
4007 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4009 GvIMPORTED_SV_on(dstr);
4015 if (SvTAINTED(sstr))
4019 if (SvPVX_const(dstr)) {
4025 (void)SvOK_off(dstr);
4026 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4028 if (sflags & SVp_NOK) {
4030 /* Only set the public OK flag if the source has public OK. */
4031 if (sflags & SVf_NOK)
4032 SvFLAGS(dstr) |= SVf_NOK;
4033 SvNV_set(dstr, SvNVX(sstr));
4035 if (sflags & SVp_IOK) {
4036 (void)SvIOKp_on(dstr);
4037 if (sflags & SVf_IOK)
4038 SvFLAGS(dstr) |= SVf_IOK;
4039 if (sflags & SVf_IVisUV)
4041 SvIV_set(dstr, SvIVX(sstr));
4043 if (SvAMAGIC(sstr)) {
4047 else if (sflags & SVp_POK) {
4051 * Check to see if we can just swipe the string. If so, it's a
4052 * possible small lose on short strings, but a big win on long ones.
4053 * It might even be a win on short strings if SvPVX_const(dstr)
4054 * has to be allocated and SvPVX_const(sstr) has to be freed.
4057 /* Whichever path we take through the next code, we want this true,
4058 and doing it now facilitates the COW check. */
4059 (void)SvPOK_only(dstr);
4062 /* We're not already COW */
4063 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4064 #ifndef PERL_OLD_COPY_ON_WRITE
4065 /* or we are, but dstr isn't a suitable target. */
4066 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4071 (sflags & SVs_TEMP) && /* slated for free anyway? */
4072 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4073 (!(flags & SV_NOSTEAL)) &&
4074 /* and we're allowed to steal temps */
4075 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4076 SvLEN(sstr) && /* and really is a string */
4077 /* and won't be needed again, potentially */
4078 !(PL_op && PL_op->op_type == OP_AASSIGN))
4079 #ifdef PERL_OLD_COPY_ON_WRITE
4080 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4081 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4082 && SvTYPE(sstr) >= SVt_PVIV)
4085 /* Failed the swipe test, and it's not a shared hash key either.
4086 Have to copy the string. */
4087 STRLEN len = SvCUR(sstr);
4088 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4089 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4090 SvCUR_set(dstr, len);
4091 *SvEND(dstr) = '\0';
4093 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4095 /* Either it's a shared hash key, or it's suitable for
4096 copy-on-write or we can swipe the string. */
4098 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4102 #ifdef PERL_OLD_COPY_ON_WRITE
4104 /* I believe I should acquire a global SV mutex if
4105 it's a COW sv (not a shared hash key) to stop
4106 it going un copy-on-write.
4107 If the source SV has gone un copy on write between up there
4108 and down here, then (assert() that) it is of the correct
4109 form to make it copy on write again */
4110 if ((sflags & (SVf_FAKE | SVf_READONLY))
4111 != (SVf_FAKE | SVf_READONLY)) {
4112 SvREADONLY_on(sstr);
4114 /* Make the source SV into a loop of 1.
4115 (about to become 2) */
4116 SV_COW_NEXT_SV_SET(sstr, sstr);
4120 /* Initial code is common. */
4121 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4126 /* making another shared SV. */
4127 STRLEN cur = SvCUR(sstr);
4128 STRLEN len = SvLEN(sstr);
4129 #ifdef PERL_OLD_COPY_ON_WRITE
4131 assert (SvTYPE(dstr) >= SVt_PVIV);
4132 /* SvIsCOW_normal */
4133 /* splice us in between source and next-after-source. */
4134 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4135 SV_COW_NEXT_SV_SET(sstr, dstr);
4136 SvPV_set(dstr, SvPVX_mutable(sstr));
4140 /* SvIsCOW_shared_hash */
4141 DEBUG_C(PerlIO_printf(Perl_debug_log,
4142 "Copy on write: Sharing hash\n"));
4144 assert (SvTYPE(dstr) >= SVt_PV);
4146 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4148 SvLEN_set(dstr, len);
4149 SvCUR_set(dstr, cur);
4150 SvREADONLY_on(dstr);
4152 /* Relesase a global SV mutex. */
4155 { /* Passes the swipe test. */
4156 SvPV_set(dstr, SvPVX_mutable(sstr));
4157 SvLEN_set(dstr, SvLEN(sstr));
4158 SvCUR_set(dstr, SvCUR(sstr));
4161 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4162 SvPV_set(sstr, Nullch);
4168 if (sflags & SVf_UTF8)
4170 if (sflags & SVp_NOK) {
4172 if (sflags & SVf_NOK)
4173 SvFLAGS(dstr) |= SVf_NOK;
4174 SvNV_set(dstr, SvNVX(sstr));
4176 if (sflags & SVp_IOK) {
4177 (void)SvIOKp_on(dstr);
4178 if (sflags & SVf_IOK)
4179 SvFLAGS(dstr) |= SVf_IOK;
4180 if (sflags & SVf_IVisUV)
4182 SvIV_set(dstr, SvIVX(sstr));
4185 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4186 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4187 smg->mg_ptr, smg->mg_len);
4188 SvRMAGICAL_on(dstr);
4191 else if (sflags & SVp_IOK) {
4192 if (sflags & SVf_IOK)
4193 (void)SvIOK_only(dstr);
4195 (void)SvOK_off(dstr);
4196 (void)SvIOKp_on(dstr);
4198 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4199 if (sflags & SVf_IVisUV)
4201 SvIV_set(dstr, SvIVX(sstr));
4202 if (sflags & SVp_NOK) {
4203 if (sflags & SVf_NOK)
4204 (void)SvNOK_on(dstr);
4206 (void)SvNOKp_on(dstr);
4207 SvNV_set(dstr, SvNVX(sstr));
4210 else if (sflags & SVp_NOK) {
4211 if (sflags & SVf_NOK)
4212 (void)SvNOK_only(dstr);
4214 (void)SvOK_off(dstr);
4217 SvNV_set(dstr, SvNVX(sstr));
4220 if (dtype == SVt_PVGV) {
4221 if (ckWARN(WARN_MISC))
4222 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4225 (void)SvOK_off(dstr);
4227 if (SvTAINTED(sstr))
4232 =for apidoc sv_setsv_mg
4234 Like C<sv_setsv>, but also handles 'set' magic.
4240 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4242 sv_setsv(dstr,sstr);
4246 #ifdef PERL_OLD_COPY_ON_WRITE
4248 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4250 STRLEN cur = SvCUR(sstr);
4251 STRLEN len = SvLEN(sstr);
4252 register char *new_pv;
4255 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4263 if (SvTHINKFIRST(dstr))
4264 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4265 else if (SvPVX_const(dstr))
4266 Safefree(SvPVX_const(dstr));
4270 SvUPGRADE(dstr, SVt_PVIV);
4272 assert (SvPOK(sstr));
4273 assert (SvPOKp(sstr));
4274 assert (!SvIOK(sstr));
4275 assert (!SvIOKp(sstr));
4276 assert (!SvNOK(sstr));
4277 assert (!SvNOKp(sstr));
4279 if (SvIsCOW(sstr)) {
4281 if (SvLEN(sstr) == 0) {
4282 /* source is a COW shared hash key. */
4283 DEBUG_C(PerlIO_printf(Perl_debug_log,
4284 "Fast copy on write: Sharing hash\n"));
4285 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4288 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4290 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4291 SvUPGRADE(sstr, SVt_PVIV);
4292 SvREADONLY_on(sstr);
4294 DEBUG_C(PerlIO_printf(Perl_debug_log,
4295 "Fast copy on write: Converting sstr to COW\n"));
4296 SV_COW_NEXT_SV_SET(dstr, sstr);
4298 SV_COW_NEXT_SV_SET(sstr, dstr);
4299 new_pv = SvPVX_mutable(sstr);
4302 SvPV_set(dstr, new_pv);
4303 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4306 SvLEN_set(dstr, len);
4307 SvCUR_set(dstr, cur);
4316 =for apidoc sv_setpvn
4318 Copies a string into an SV. The C<len> parameter indicates the number of
4319 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4320 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4326 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4328 register char *dptr;
4330 SV_CHECK_THINKFIRST_COW_DROP(sv);
4336 /* len is STRLEN which is unsigned, need to copy to signed */
4339 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4341 SvUPGRADE(sv, SVt_PV);
4343 dptr = SvGROW(sv, len + 1);
4344 Move(ptr,dptr,len,char);
4347 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4352 =for apidoc sv_setpvn_mg
4354 Like C<sv_setpvn>, but also handles 'set' magic.
4360 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4362 sv_setpvn(sv,ptr,len);
4367 =for apidoc sv_setpv
4369 Copies a string into an SV. The string must be null-terminated. Does not
4370 handle 'set' magic. See C<sv_setpv_mg>.
4376 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4378 register STRLEN len;
4380 SV_CHECK_THINKFIRST_COW_DROP(sv);
4386 SvUPGRADE(sv, SVt_PV);
4388 SvGROW(sv, len + 1);
4389 Move(ptr,SvPVX(sv),len+1,char);
4391 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4396 =for apidoc sv_setpv_mg
4398 Like C<sv_setpv>, but also handles 'set' magic.
4404 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4411 =for apidoc sv_usepvn
4413 Tells an SV to use C<ptr> to find its string value. Normally the string is
4414 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4415 The C<ptr> should point to memory that was allocated by C<malloc>. The
4416 string length, C<len>, must be supplied. This function will realloc the
4417 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4418 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4419 See C<sv_usepvn_mg>.
4425 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4428 SV_CHECK_THINKFIRST_COW_DROP(sv);
4429 SvUPGRADE(sv, SVt_PV);
4434 if (SvPVX_const(sv))
4437 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4438 ptr = saferealloc (ptr, allocate);
4441 SvLEN_set(sv, allocate);
4443 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4448 =for apidoc sv_usepvn_mg
4450 Like C<sv_usepvn>, but also handles 'set' magic.
4456 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4458 sv_usepvn(sv,ptr,len);
4462 #ifdef PERL_OLD_COPY_ON_WRITE
4463 /* Need to do this *after* making the SV normal, as we need the buffer
4464 pointer to remain valid until after we've copied it. If we let go too early,
4465 another thread could invalidate it by unsharing last of the same hash key
4466 (which it can do by means other than releasing copy-on-write Svs)
4467 or by changing the other copy-on-write SVs in the loop. */
4469 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4471 if (len) { /* this SV was SvIsCOW_normal(sv) */
4472 /* we need to find the SV pointing to us. */
4473 SV * const current = SV_COW_NEXT_SV(after);
4475 if (current == sv) {
4476 /* The SV we point to points back to us (there were only two of us
4478 Hence other SV is no longer copy on write either. */
4480 SvREADONLY_off(after);
4482 /* We need to follow the pointers around the loop. */
4484 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4487 /* don't loop forever if the structure is bust, and we have
4488 a pointer into a closed loop. */
4489 assert (current != after);
4490 assert (SvPVX_const(current) == pvx);
4492 /* Make the SV before us point to the SV after us. */
4493 SV_COW_NEXT_SV_SET(current, after);
4496 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4501 Perl_sv_release_IVX(pTHX_ register SV *sv)
4504 sv_force_normal_flags(sv, 0);
4510 =for apidoc sv_force_normal_flags
4512 Undo various types of fakery on an SV: if the PV is a shared string, make
4513 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4514 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4515 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4516 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4517 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4518 set to some other value.) In addition, the C<flags> parameter gets passed to
4519 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4520 with flags set to 0.
4526 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4528 #ifdef PERL_OLD_COPY_ON_WRITE
4529 if (SvREADONLY(sv)) {
4530 /* At this point I believe I should acquire a global SV mutex. */
4532 const char * const pvx = SvPVX_const(sv);
4533 const STRLEN len = SvLEN(sv);
4534 const STRLEN cur = SvCUR(sv);
4535 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4537 PerlIO_printf(Perl_debug_log,
4538 "Copy on write: Force normal %ld\n",
4544 /* This SV doesn't own the buffer, so need to Newx() a new one: */
4545 SvPV_set(sv, (char*)0);
4547 if (flags & SV_COW_DROP_PV) {
4548 /* OK, so we don't need to copy our buffer. */
4551 SvGROW(sv, cur + 1);
4552 Move(pvx,SvPVX(sv),cur,char);
4556 sv_release_COW(sv, pvx, len, next);
4561 else if (IN_PERL_RUNTIME)
4562 Perl_croak(aTHX_ PL_no_modify);
4563 /* At this point I believe that I can drop the global SV mutex. */
4566 if (SvREADONLY(sv)) {
4568 const char * const pvx = SvPVX_const(sv);
4569 const STRLEN len = SvCUR(sv);
4572 SvPV_set(sv, Nullch);
4574 SvGROW(sv, len + 1);
4575 Move(pvx,SvPVX(sv),len,char);
4577 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4579 else if (IN_PERL_RUNTIME)
4580 Perl_croak(aTHX_ PL_no_modify);
4584 sv_unref_flags(sv, flags);
4585 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4590 =for apidoc sv_force_normal
4592 Undo various types of fakery on an SV: if the PV is a shared string, make
4593 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4594 an xpvmg. See also C<sv_force_normal_flags>.
4600 Perl_sv_force_normal(pTHX_ register SV *sv)
4602 sv_force_normal_flags(sv, 0);
4608 Efficient removal of characters from the beginning of the string buffer.
4609 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4610 the string buffer. The C<ptr> becomes the first character of the adjusted
4611 string. Uses the "OOK hack".
4612 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4613 refer to the same chunk of data.
4619 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4621 register STRLEN delta;
4622 if (!ptr || !SvPOKp(sv))
4624 delta = ptr - SvPVX_const(sv);
4625 SV_CHECK_THINKFIRST(sv);
4626 if (SvTYPE(sv) < SVt_PVIV)
4627 sv_upgrade(sv,SVt_PVIV);
4630 if (!SvLEN(sv)) { /* make copy of shared string */
4631 const char *pvx = SvPVX_const(sv);
4632 const STRLEN len = SvCUR(sv);
4633 SvGROW(sv, len + 1);
4634 Move(pvx,SvPVX(sv),len,char);
4638 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4639 and we do that anyway inside the SvNIOK_off
4641 SvFLAGS(sv) |= SVf_OOK;
4644 SvLEN_set(sv, SvLEN(sv) - delta);
4645 SvCUR_set(sv, SvCUR(sv) - delta);
4646 SvPV_set(sv, SvPVX(sv) + delta);
4647 SvIV_set(sv, SvIVX(sv) + delta);
4651 =for apidoc sv_catpvn
4653 Concatenates the string onto the end of the string which is in the SV. The
4654 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4655 status set, then the bytes appended should be valid UTF-8.
4656 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4658 =for apidoc sv_catpvn_flags
4660 Concatenates the string onto the end of the string which is in the SV. The
4661 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4662 status set, then the bytes appended should be valid UTF-8.
4663 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4664 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4665 in terms of this function.
4671 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4674 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4676 SvGROW(dsv, dlen + slen + 1);
4678 sstr = SvPVX_const(dsv);
4679 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4680 SvCUR_set(dsv, SvCUR(dsv) + slen);
4682 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4687 =for apidoc sv_catpvn_mg
4689 Like C<sv_catpvn>, but also handles 'set' magic.
4695 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4697 sv_catpvn(sv,ptr,len);
4702 =for apidoc sv_catsv
4704 Concatenates the string from SV C<ssv> onto the end of the string in
4705 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4706 not 'set' magic. See C<sv_catsv_mg>.
4708 =for apidoc sv_catsv_flags
4710 Concatenates the string from SV C<ssv> onto the end of the string in
4711 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4712 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4713 and C<sv_catsv_nomg> are implemented in terms of this function.
4718 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4724 if ((spv = SvPV_const(ssv, slen))) {
4725 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4726 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4727 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4728 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4729 dsv->sv_flags doesn't have that bit set.
4730 Andy Dougherty 12 Oct 2001
4732 const I32 sutf8 = DO_UTF8(ssv);
4735 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4737 dutf8 = DO_UTF8(dsv);
4739 if (dutf8 != sutf8) {
4741 /* Not modifying source SV, so taking a temporary copy. */
4742 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4744 sv_utf8_upgrade(csv);
4745 spv = SvPV_const(csv, slen);
4748 sv_utf8_upgrade_nomg(dsv);
4750 sv_catpvn_nomg(dsv, spv, slen);
4755 =for apidoc sv_catsv_mg
4757 Like C<sv_catsv>, but also handles 'set' magic.
4763 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4770 =for apidoc sv_catpv
4772 Concatenates the string onto the end of the string which is in the SV.
4773 If the SV has the UTF-8 status set, then the bytes appended should be
4774 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4779 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4781 register STRLEN len;
4787 junk = SvPV_force(sv, tlen);
4789 SvGROW(sv, tlen + len + 1);
4791 ptr = SvPVX_const(sv);
4792 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4793 SvCUR_set(sv, SvCUR(sv) + len);
4794 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4799 =for apidoc sv_catpv_mg
4801 Like C<sv_catpv>, but also handles 'set' magic.
4807 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4816 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4817 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4824 Perl_newSV(pTHX_ STRLEN len)
4830 sv_upgrade(sv, SVt_PV);
4831 SvGROW(sv, len + 1);
4836 =for apidoc sv_magicext
4838 Adds magic to an SV, upgrading it if necessary. Applies the
4839 supplied vtable and returns a pointer to the magic added.
4841 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4842 In particular, you can add magic to SvREADONLY SVs, and add more than
4843 one instance of the same 'how'.
4845 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4846 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4847 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4848 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4850 (This is now used as a subroutine by C<sv_magic>.)
4855 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4856 const char* name, I32 namlen)
4860 if (SvTYPE(sv) < SVt_PVMG) {
4861 SvUPGRADE(sv, SVt_PVMG);
4863 Newxz(mg, 1, MAGIC);
4864 mg->mg_moremagic = SvMAGIC(sv);
4865 SvMAGIC_set(sv, mg);
4867 /* Sometimes a magic contains a reference loop, where the sv and
4868 object refer to each other. To prevent a reference loop that
4869 would prevent such objects being freed, we look for such loops
4870 and if we find one we avoid incrementing the object refcount.
4872 Note we cannot do this to avoid self-tie loops as intervening RV must
4873 have its REFCNT incremented to keep it in existence.
4876 if (!obj || obj == sv ||
4877 how == PERL_MAGIC_arylen ||
4878 how == PERL_MAGIC_qr ||
4879 how == PERL_MAGIC_symtab ||
4880 (SvTYPE(obj) == SVt_PVGV &&
4881 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4882 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4883 GvFORM(obj) == (CV*)sv)))
4888 mg->mg_obj = SvREFCNT_inc(obj);
4889 mg->mg_flags |= MGf_REFCOUNTED;
4892 /* Normal self-ties simply pass a null object, and instead of
4893 using mg_obj directly, use the SvTIED_obj macro to produce a
4894 new RV as needed. For glob "self-ties", we are tieing the PVIO
4895 with an RV obj pointing to the glob containing the PVIO. In
4896 this case, to avoid a reference loop, we need to weaken the
4900 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4901 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4907 mg->mg_len = namlen;
4910 mg->mg_ptr = savepvn(name, namlen);
4911 else if (namlen == HEf_SVKEY)
4912 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4914 mg->mg_ptr = (char *) name;
4916 mg->mg_virtual = vtable;
4920 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4925 =for apidoc sv_magic
4927 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4928 then adds a new magic item of type C<how> to the head of the magic list.
4930 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4931 handling of the C<name> and C<namlen> arguments.
4933 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4934 to add more than one instance of the same 'how'.
4940 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4942 const MGVTBL *vtable;
4945 #ifdef PERL_OLD_COPY_ON_WRITE
4947 sv_force_normal_flags(sv, 0);
4949 if (SvREADONLY(sv)) {
4951 /* its okay to attach magic to shared strings; the subsequent
4952 * upgrade to PVMG will unshare the string */
4953 !(SvFAKE(sv) && SvTYPE(sv) < SVt_PVMG)
4956 && how != PERL_MAGIC_regex_global
4957 && how != PERL_MAGIC_bm
4958 && how != PERL_MAGIC_fm
4959 && how != PERL_MAGIC_sv
4960 && how != PERL_MAGIC_backref
4963 Perl_croak(aTHX_ PL_no_modify);
4966 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4967 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4968 /* sv_magic() refuses to add a magic of the same 'how' as an
4971 if (how == PERL_MAGIC_taint)
4979 vtable = &PL_vtbl_sv;
4981 case PERL_MAGIC_overload:
4982 vtable = &PL_vtbl_amagic;
4984 case PERL_MAGIC_overload_elem:
4985 vtable = &PL_vtbl_amagicelem;
4987 case PERL_MAGIC_overload_table:
4988 vtable = &PL_vtbl_ovrld;
4991 vtable = &PL_vtbl_bm;
4993 case PERL_MAGIC_regdata:
4994 vtable = &PL_vtbl_regdata;
4996 case PERL_MAGIC_regdatum:
4997 vtable = &PL_vtbl_regdatum;
4999 case PERL_MAGIC_env:
5000 vtable = &PL_vtbl_env;
5003 vtable = &PL_vtbl_fm;
5005 case PERL_MAGIC_envelem:
5006 vtable = &PL_vtbl_envelem;
5008 case PERL_MAGIC_regex_global:
5009 vtable = &PL_vtbl_mglob;
5011 case PERL_MAGIC_isa:
5012 vtable = &PL_vtbl_isa;
5014 case PERL_MAGIC_isaelem:
5015 vtable = &PL_vtbl_isaelem;
5017 case PERL_MAGIC_nkeys:
5018 vtable = &PL_vtbl_nkeys;
5020 case PERL_MAGIC_dbfile:
5023 case PERL_MAGIC_dbline:
5024 vtable = &PL_vtbl_dbline;
5026 #ifdef USE_LOCALE_COLLATE
5027 case PERL_MAGIC_collxfrm:
5028 vtable = &PL_vtbl_collxfrm;
5030 #endif /* USE_LOCALE_COLLATE */
5031 case PERL_MAGIC_tied:
5032 vtable = &PL_vtbl_pack;
5034 case PERL_MAGIC_tiedelem:
5035 case PERL_MAGIC_tiedscalar:
5036 vtable = &PL_vtbl_packelem;
5039 vtable = &PL_vtbl_regexp;
5041 case PERL_MAGIC_sig:
5042 vtable = &PL_vtbl_sig;
5044 case PERL_MAGIC_sigelem:
5045 vtable = &PL_vtbl_sigelem;
5047 case PERL_MAGIC_taint:
5048 vtable = &PL_vtbl_taint;
5050 case PERL_MAGIC_uvar:
5051 vtable = &PL_vtbl_uvar;
5053 case PERL_MAGIC_vec:
5054 vtable = &PL_vtbl_vec;
5056 case PERL_MAGIC_arylen_p:
5057 case PERL_MAGIC_rhash:
5058 case PERL_MAGIC_symtab:
5059 case PERL_MAGIC_vstring:
5062 case PERL_MAGIC_utf8:
5063 vtable = &PL_vtbl_utf8;
5065 case PERL_MAGIC_substr:
5066 vtable = &PL_vtbl_substr;
5068 case PERL_MAGIC_defelem:
5069 vtable = &PL_vtbl_defelem;
5071 case PERL_MAGIC_glob:
5072 vtable = &PL_vtbl_glob;
5074 case PERL_MAGIC_arylen:
5075 vtable = &PL_vtbl_arylen;
5077 case PERL_MAGIC_pos:
5078 vtable = &PL_vtbl_pos;
5080 case PERL_MAGIC_backref:
5081 vtable = &PL_vtbl_backref;
5083 case PERL_MAGIC_ext:
5084 /* Reserved for use by extensions not perl internals. */
5085 /* Useful for attaching extension internal data to perl vars. */
5086 /* Note that multiple extensions may clash if magical scalars */
5087 /* etc holding private data from one are passed to another. */
5091 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5094 /* Rest of work is done else where */
5095 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5098 case PERL_MAGIC_taint:
5101 case PERL_MAGIC_ext:
5102 case PERL_MAGIC_dbfile:
5109 =for apidoc sv_unmagic
5111 Removes all magic of type C<type> from an SV.
5117 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5121 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5124 for (mg = *mgp; mg; mg = *mgp) {
5125 if (mg->mg_type == type) {
5126 const MGVTBL* const vtbl = mg->mg_virtual;
5127 *mgp = mg->mg_moremagic;
5128 if (vtbl && vtbl->svt_free)
5129 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5130 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5132 Safefree(mg->mg_ptr);
5133 else if (mg->mg_len == HEf_SVKEY)
5134 SvREFCNT_dec((SV*)mg->mg_ptr);
5135 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5136 Safefree(mg->mg_ptr);
5138 if (mg->mg_flags & MGf_REFCOUNTED)
5139 SvREFCNT_dec(mg->mg_obj);
5143 mgp = &mg->mg_moremagic;
5147 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5154 =for apidoc sv_rvweaken
5156 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5157 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5158 push a back-reference to this RV onto the array of backreferences
5159 associated with that magic.
5165 Perl_sv_rvweaken(pTHX_ SV *sv)
5168 if (!SvOK(sv)) /* let undefs pass */
5171 Perl_croak(aTHX_ "Can't weaken a nonreference");
5172 else if (SvWEAKREF(sv)) {
5173 if (ckWARN(WARN_MISC))
5174 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5178 Perl_sv_add_backref(aTHX_ tsv, sv);
5184 /* Give tsv backref magic if it hasn't already got it, then push a
5185 * back-reference to sv onto the array associated with the backref magic.
5189 Perl_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5193 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5194 av = (AV*)mg->mg_obj;
5197 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5198 /* av now has a refcnt of 2, which avoids it getting freed
5199 * before us during global cleanup. The extra ref is removed
5200 * by magic_killbackrefs() when tsv is being freed */
5202 if (AvFILLp(av) >= AvMAX(av)) {
5203 av_extend(av, AvFILLp(av)+1);
5205 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5208 /* delete a back-reference to ourselves from the backref magic associated
5209 * with the SV we point to.
5213 S_sv_del_backref(pTHX_ SV *tsv, SV *sv)
5219 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref))) {
5220 if (PL_in_clean_all)
5223 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5224 Perl_croak(aTHX_ "panic: del_backref");
5225 av = (AV *)mg->mg_obj;
5227 /* We shouldn't be in here more than once, but for paranoia reasons lets
5229 for (i = AvFILLp(av); i >= 0; i--) {
5231 const SSize_t fill = AvFILLp(av);
5233 /* We weren't the last entry.
5234 An unordered list has this property that you can take the
5235 last element off the end to fill the hole, and it's still
5236 an unordered list :-)
5241 AvFILLp(av) = fill - 1;
5247 =for apidoc sv_insert
5249 Inserts a string at the specified offset/length within the SV. Similar to
5250 the Perl substr() function.
5256 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5260 register char *midend;
5261 register char *bigend;
5267 Perl_croak(aTHX_ "Can't modify non-existent substring");
5268 SvPV_force(bigstr, curlen);
5269 (void)SvPOK_only_UTF8(bigstr);
5270 if (offset + len > curlen) {
5271 SvGROW(bigstr, offset+len+1);
5272 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5273 SvCUR_set(bigstr, offset+len);
5277 i = littlelen - len;
5278 if (i > 0) { /* string might grow */
5279 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5280 mid = big + offset + len;
5281 midend = bigend = big + SvCUR(bigstr);
5284 while (midend > mid) /* shove everything down */
5285 *--bigend = *--midend;
5286 Move(little,big+offset,littlelen,char);
5287 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5292 Move(little,SvPVX(bigstr)+offset,len,char);
5297 big = SvPVX(bigstr);
5300 bigend = big + SvCUR(bigstr);
5302 if (midend > bigend)
5303 Perl_croak(aTHX_ "panic: sv_insert");
5305 if (mid - big > bigend - midend) { /* faster to shorten from end */
5307 Move(little, mid, littlelen,char);
5310 i = bigend - midend;
5312 Move(midend, mid, i,char);
5316 SvCUR_set(bigstr, mid - big);
5318 else if ((i = mid - big)) { /* faster from front */
5319 midend -= littlelen;
5321 sv_chop(bigstr,midend-i);
5326 Move(little, mid, littlelen,char);
5328 else if (littlelen) {
5329 midend -= littlelen;
5330 sv_chop(bigstr,midend);
5331 Move(little,midend,littlelen,char);
5334 sv_chop(bigstr,midend);
5340 =for apidoc sv_replace
5342 Make the first argument a copy of the second, then delete the original.
5343 The target SV physically takes over ownership of the body of the source SV
5344 and inherits its flags; however, the target keeps any magic it owns,
5345 and any magic in the source is discarded.
5346 Note that this is a rather specialist SV copying operation; most of the
5347 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5353 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5355 const U32 refcnt = SvREFCNT(sv);
5356 SV_CHECK_THINKFIRST_COW_DROP(sv);
5357 if (SvREFCNT(nsv) != 1) {
5358 Perl_croak(aTHX_ "panic: reference miscount on nsv in sv_replace() (%"
5359 UVuf " != 1)", (UV) SvREFCNT(nsv));
5361 if (SvMAGICAL(sv)) {
5365 sv_upgrade(nsv, SVt_PVMG);
5366 SvMAGIC_set(nsv, SvMAGIC(sv));
5367 SvFLAGS(nsv) |= SvMAGICAL(sv);
5369 SvMAGIC_set(sv, NULL);
5373 assert(!SvREFCNT(sv));
5374 #ifdef DEBUG_LEAKING_SCALARS
5375 sv->sv_flags = nsv->sv_flags;
5376 sv->sv_any = nsv->sv_any;
5377 sv->sv_refcnt = nsv->sv_refcnt;
5378 sv->sv_u = nsv->sv_u;
5380 StructCopy(nsv,sv,SV);
5382 /* Currently could join these into one piece of pointer arithmetic, but
5383 it would be unclear. */
5384 if(SvTYPE(sv) == SVt_IV)
5386 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5387 else if (SvTYPE(sv) == SVt_RV) {
5388 SvANY(sv) = &sv->sv_u.svu_rv;
5392 #ifdef PERL_OLD_COPY_ON_WRITE
5393 if (SvIsCOW_normal(nsv)) {
5394 /* We need to follow the pointers around the loop to make the
5395 previous SV point to sv, rather than nsv. */
5398 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5401 assert(SvPVX_const(current) == SvPVX_const(nsv));
5403 /* Make the SV before us point to the SV after us. */
5405 PerlIO_printf(Perl_debug_log, "previous is\n");
5407 PerlIO_printf(Perl_debug_log,
5408 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5409 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5411 SV_COW_NEXT_SV_SET(current, sv);
5414 SvREFCNT(sv) = refcnt;
5415 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5421 =for apidoc sv_clear
5423 Clear an SV: call any destructors, free up any memory used by the body,
5424 and free the body itself. The SV's head is I<not> freed, although
5425 its type is set to all 1's so that it won't inadvertently be assumed
5426 to be live during global destruction etc.
5427 This function should only be called when REFCNT is zero. Most of the time
5428 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5435 Perl_sv_clear(pTHX_ register SV *sv)
5438 void** old_body_arena;
5439 size_t old_body_offset;
5440 const U32 type = SvTYPE(sv);
5443 assert(SvREFCNT(sv) == 0);
5449 old_body_offset = 0;
5452 if (PL_defstash) { /* Still have a symbol table? */
5457 stash = SvSTASH(sv);
5458 destructor = StashHANDLER(stash,DESTROY);
5460 SV* const tmpref = newRV(sv);
5461 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5463 PUSHSTACKi(PERLSI_DESTROY);
5468 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5474 if(SvREFCNT(tmpref) < 2) {
5475 /* tmpref is not kept alive! */
5477 SvRV_set(tmpref, NULL);
5480 SvREFCNT_dec(tmpref);
5482 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5486 if (PL_in_clean_objs)
5487 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5489 /* DESTROY gave object new lease on life */
5495 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5496 SvOBJECT_off(sv); /* Curse the object. */
5497 if (type != SVt_PVIO)
5498 --PL_sv_objcount; /* XXX Might want something more general */
5501 if (type >= SVt_PVMG) {
5504 if (type == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5505 SvREFCNT_dec(SvSTASH(sv));
5510 IoIFP(sv) != PerlIO_stdin() &&
5511 IoIFP(sv) != PerlIO_stdout() &&
5512 IoIFP(sv) != PerlIO_stderr())
5514 io_close((IO*)sv, FALSE);
5516 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5517 PerlDir_close(IoDIRP(sv));
5518 IoDIRP(sv) = (DIR*)NULL;
5519 Safefree(IoTOP_NAME(sv));
5520 Safefree(IoFMT_NAME(sv));
5521 Safefree(IoBOTTOM_NAME(sv));
5522 /* PVIOs aren't from arenas */
5525 old_body_arena = (void **) &PL_xpvbm_root;
5528 old_body_arena = (void **) &PL_xpvcv_root;
5530 /* PVFMs aren't from arenas */
5535 old_body_arena = (void **) &PL_xpvhv_root;
5536 old_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill);
5540 old_body_arena = (void **) &PL_xpvav_root;
5541 old_body_offset = STRUCT_OFFSET(XPVAV, xav_fill);
5544 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5545 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5546 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5547 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5549 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5550 SvREFCNT_dec(LvTARG(sv));
5551 old_body_arena = (void **) &PL_xpvlv_root;
5555 Safefree(GvNAME(sv));
5556 /* If we're in a stash, we don't own a reference to it. However it does
5557 have a back reference to us, which needs to be cleared. */
5559 sv_del_backref((SV*)GvSTASH(sv), sv);
5560 old_body_arena = (void **) &PL_xpvgv_root;
5563 old_body_arena = (void **) &PL_xpvmg_root;
5566 old_body_arena = (void **) &PL_xpvnv_root;
5569 old_body_arena = (void **) &PL_xpviv_root;
5570 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur);
5572 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5574 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5575 /* Don't even bother with turning off the OOK flag. */
5579 old_body_arena = (void **) &PL_xpv_root;
5580 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur);
5584 SV *target = SvRV(sv);
5586 sv_del_backref(target, sv);
5588 SvREFCNT_dec(target);
5590 #ifdef PERL_OLD_COPY_ON_WRITE
5591 else if (SvPVX_const(sv)) {
5593 /* I believe I need to grab the global SV mutex here and
5594 then recheck the COW status. */
5596 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5599 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5600 SV_COW_NEXT_SV(sv));
5601 /* And drop it here. */
5603 } else if (SvLEN(sv)) {
5604 Safefree(SvPVX_const(sv));
5608 else if (SvPVX_const(sv) && SvLEN(sv))
5609 Safefree(SvPVX_mutable(sv));
5610 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5611 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5617 old_body_arena = (void **) &PL_xnv_root;
5621 SvFLAGS(sv) &= SVf_BREAK;
5622 SvFLAGS(sv) |= SVTYPEMASK;
5625 if (old_body_arena) {
5626 del_body(((char *)SvANY(sv) + old_body_offset), old_body_arena);
5630 if (type > SVt_RV) {
5631 my_safefree(SvANY(sv));
5636 =for apidoc sv_newref
5638 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5645 Perl_sv_newref(pTHX_ SV *sv)
5655 Decrement an SV's reference count, and if it drops to zero, call
5656 C<sv_clear> to invoke destructors and free up any memory used by
5657 the body; finally, deallocate the SV's head itself.
5658 Normally called via a wrapper macro C<SvREFCNT_dec>.
5664 Perl_sv_free(pTHX_ SV *sv)
5669 if (SvREFCNT(sv) == 0) {
5670 if (SvFLAGS(sv) & SVf_BREAK)
5671 /* this SV's refcnt has been artificially decremented to
5672 * trigger cleanup */
5674 if (PL_in_clean_all) /* All is fair */
5676 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5677 /* make sure SvREFCNT(sv)==0 happens very seldom */
5678 SvREFCNT(sv) = (~(U32)0)/2;
5681 if (ckWARN_d(WARN_INTERNAL)) {
5682 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5683 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5684 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5685 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
5686 Perl_dump_sv_child(aTHX_ sv);
5691 if (--(SvREFCNT(sv)) > 0)
5693 Perl_sv_free2(aTHX_ sv);
5697 Perl_sv_free2(pTHX_ SV *sv)
5702 if (ckWARN_d(WARN_DEBUGGING))
5703 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5704 "Attempt to free temp prematurely: SV 0x%"UVxf
5705 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5709 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5710 /* make sure SvREFCNT(sv)==0 happens very seldom */
5711 SvREFCNT(sv) = (~(U32)0)/2;
5722 Returns the length of the string in the SV. Handles magic and type
5723 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5729 Perl_sv_len(pTHX_ register SV *sv)
5737 len = mg_length(sv);
5739 (void)SvPV_const(sv, len);
5744 =for apidoc sv_len_utf8
5746 Returns the number of characters in the string in an SV, counting wide
5747 UTF-8 bytes as a single character. Handles magic and type coercion.
5753 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5754 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5755 * (Note that the mg_len is not the length of the mg_ptr field.)
5760 Perl_sv_len_utf8(pTHX_ register SV *sv)
5766 return mg_length(sv);
5770 const U8 *s = (U8*)SvPV_const(sv, len);
5771 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5773 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5775 #ifdef PERL_UTF8_CACHE_ASSERT
5776 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5780 ulen = Perl_utf8_length(aTHX_ s, s + len);
5781 if (!mg && !SvREADONLY(sv)) {
5782 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5783 mg = mg_find(sv, PERL_MAGIC_utf8);
5793 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5794 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5795 * between UTF-8 and byte offsets. There are two (substr offset and substr
5796 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5797 * and byte offset) cache positions.
5799 * The mg_len field is used by sv_len_utf8(), see its comments.
5800 * Note that the mg_len is not the length of the mg_ptr field.
5804 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5805 I32 offsetp, const U8 *s, const U8 *start)
5809 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5811 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5815 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5817 Newxz(*cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5818 (*mgp)->mg_ptr = (char *) *cachep;
5822 (*cachep)[i] = offsetp;
5823 (*cachep)[i+1] = s - start;
5831 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5832 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5833 * between UTF-8 and byte offsets. See also the comments of
5834 * S_utf8_mg_pos_init().
5838 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)
5842 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5844 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5845 if (*mgp && (*mgp)->mg_ptr) {
5846 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5847 ASSERT_UTF8_CACHE(*cachep);
5848 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5850 else { /* We will skip to the right spot. */
5855 /* The assumption is that going backward is half
5856 * the speed of going forward (that's where the
5857 * 2 * backw in the below comes from). (The real
5858 * figure of course depends on the UTF-8 data.) */
5860 if ((*cachep)[i] > (STRLEN)uoff) {
5862 backw = (*cachep)[i] - (STRLEN)uoff;
5864 if (forw < 2 * backw)
5867 p = start + (*cachep)[i+1];
5869 /* Try this only for the substr offset (i == 0),
5870 * not for the substr length (i == 2). */
5871 else if (i == 0) { /* (*cachep)[i] < uoff */
5872 const STRLEN ulen = sv_len_utf8(sv);
5874 if ((STRLEN)uoff < ulen) {
5875 forw = (STRLEN)uoff - (*cachep)[i];
5876 backw = ulen - (STRLEN)uoff;
5878 if (forw < 2 * backw)
5879 p = start + (*cachep)[i+1];
5884 /* If the string is not long enough for uoff,
5885 * we could extend it, but not at this low a level. */
5889 if (forw < 2 * backw) {
5896 while (UTF8_IS_CONTINUATION(*p))
5901 /* Update the cache. */
5902 (*cachep)[i] = (STRLEN)uoff;
5903 (*cachep)[i+1] = p - start;
5905 /* Drop the stale "length" cache */
5914 if (found) { /* Setup the return values. */
5915 *offsetp = (*cachep)[i+1];
5916 *sp = start + *offsetp;
5919 *offsetp = send - start;
5921 else if (*sp < start) {
5927 #ifdef PERL_UTF8_CACHE_ASSERT
5932 while (n-- && s < send)
5936 assert(*offsetp == s - start);
5937 assert((*cachep)[0] == (STRLEN)uoff);
5938 assert((*cachep)[1] == *offsetp);
5940 ASSERT_UTF8_CACHE(*cachep);
5949 =for apidoc sv_pos_u2b
5951 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5952 the start of the string, to a count of the equivalent number of bytes; if
5953 lenp is non-zero, it does the same to lenp, but this time starting from
5954 the offset, rather than from the start of the string. Handles magic and
5961 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5962 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5963 * byte offsets. See also the comments of S_utf8_mg_pos().
5968 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5976 start = (U8*)SvPV_const(sv, len);
5980 const U8 *s = start;
5981 I32 uoffset = *offsetp;
5982 const U8 * const send = s + len;
5986 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5988 if (!found && uoffset > 0) {
5989 while (s < send && uoffset--)
5993 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
5995 *offsetp = s - start;
6000 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6004 if (!found && *lenp > 0) {
6007 while (s < send && ulen--)
6011 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6015 ASSERT_UTF8_CACHE(cache);
6027 =for apidoc sv_pos_b2u
6029 Converts the value pointed to by offsetp from a count of bytes from the
6030 start of the string, to a count of the equivalent number of UTF-8 chars.
6031 Handles magic and type coercion.
6037 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6038 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6039 * byte offsets. See also the comments of S_utf8_mg_pos().
6044 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6052 s = (const U8*)SvPV_const(sv, len);
6053 if ((I32)len < *offsetp)
6054 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6056 const U8* send = s + *offsetp;
6058 STRLEN *cache = NULL;
6062 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6063 mg = mg_find(sv, PERL_MAGIC_utf8);
6064 if (mg && mg->mg_ptr) {
6065 cache = (STRLEN *) mg->mg_ptr;
6066 if (cache[1] == (STRLEN)*offsetp) {
6067 /* An exact match. */
6068 *offsetp = cache[0];
6072 else if (cache[1] < (STRLEN)*offsetp) {
6073 /* We already know part of the way. */
6076 /* Let the below loop do the rest. */
6078 else { /* cache[1] > *offsetp */
6079 /* We already know all of the way, now we may
6080 * be able to walk back. The same assumption
6081 * is made as in S_utf8_mg_pos(), namely that
6082 * walking backward is twice slower than
6083 * walking forward. */
6084 const STRLEN forw = *offsetp;
6085 STRLEN backw = cache[1] - *offsetp;
6087 if (!(forw < 2 * backw)) {
6088 const U8 *p = s + cache[1];
6095 while (UTF8_IS_CONTINUATION(*p)) {
6103 *offsetp = cache[0];
6105 /* Drop the stale "length" cache */
6113 ASSERT_UTF8_CACHE(cache);
6119 /* Call utf8n_to_uvchr() to validate the sequence
6120 * (unless a simple non-UTF character) */
6121 if (!UTF8_IS_INVARIANT(*s))
6122 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6131 if (!SvREADONLY(sv)) {
6133 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6134 mg = mg_find(sv, PERL_MAGIC_utf8);
6139 Newxz(cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6140 mg->mg_ptr = (char *) cache;
6145 cache[1] = *offsetp;
6146 /* Drop the stale "length" cache */
6159 Returns a boolean indicating whether the strings in the two SVs are
6160 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6161 coerce its args to strings if necessary.
6167 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6175 SV* svrecode = Nullsv;
6182 pv1 = SvPV_const(sv1, cur1);
6189 pv2 = SvPV_const(sv2, cur2);
6191 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6192 /* Differing utf8ness.
6193 * Do not UTF8size the comparands as a side-effect. */
6196 svrecode = newSVpvn(pv2, cur2);
6197 sv_recode_to_utf8(svrecode, PL_encoding);
6198 pv2 = SvPV_const(svrecode, cur2);
6201 svrecode = newSVpvn(pv1, cur1);
6202 sv_recode_to_utf8(svrecode, PL_encoding);
6203 pv1 = SvPV_const(svrecode, cur1);
6205 /* Now both are in UTF-8. */
6207 SvREFCNT_dec(svrecode);
6212 bool is_utf8 = TRUE;
6215 /* sv1 is the UTF-8 one,
6216 * if is equal it must be downgrade-able */
6217 char * const pv = (char*)bytes_from_utf8((const U8*)pv1,
6223 /* sv2 is the UTF-8 one,
6224 * if is equal it must be downgrade-able */
6225 char * const pv = (char *)bytes_from_utf8((const U8*)pv2,
6231 /* Downgrade not possible - cannot be eq */
6239 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6242 SvREFCNT_dec(svrecode);
6253 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6254 string in C<sv1> is less than, equal to, or greater than the string in
6255 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6256 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6262 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6265 const char *pv1, *pv2;
6268 SV *svrecode = Nullsv;
6275 pv1 = SvPV_const(sv1, cur1);
6282 pv2 = SvPV_const(sv2, cur2);
6284 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6285 /* Differing utf8ness.
6286 * Do not UTF8size the comparands as a side-effect. */
6289 svrecode = newSVpvn(pv2, cur2);
6290 sv_recode_to_utf8(svrecode, PL_encoding);
6291 pv2 = SvPV_const(svrecode, cur2);
6294 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6299 svrecode = newSVpvn(pv1, cur1);
6300 sv_recode_to_utf8(svrecode, PL_encoding);
6301 pv1 = SvPV_const(svrecode, cur1);
6304 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6310 cmp = cur2 ? -1 : 0;
6314 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6317 cmp = retval < 0 ? -1 : 1;
6318 } else if (cur1 == cur2) {
6321 cmp = cur1 < cur2 ? -1 : 1;
6326 SvREFCNT_dec(svrecode);
6335 =for apidoc sv_cmp_locale
6337 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6338 'use bytes' aware, handles get magic, and will coerce its args to strings
6339 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6345 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6347 #ifdef USE_LOCALE_COLLATE
6353 if (PL_collation_standard)
6357 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6359 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6361 if (!pv1 || !len1) {
6372 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6375 return retval < 0 ? -1 : 1;
6378 * When the result of collation is equality, that doesn't mean
6379 * that there are no differences -- some locales exclude some
6380 * characters from consideration. So to avoid false equalities,
6381 * we use the raw string as a tiebreaker.
6387 #endif /* USE_LOCALE_COLLATE */
6389 return sv_cmp(sv1, sv2);
6393 #ifdef USE_LOCALE_COLLATE
6396 =for apidoc sv_collxfrm
6398 Add Collate Transform magic to an SV if it doesn't already have it.
6400 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6401 scalar data of the variable, but transformed to such a format that a normal
6402 memory comparison can be used to compare the data according to the locale
6409 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6413 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6414 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6420 Safefree(mg->mg_ptr);
6421 s = SvPV_const(sv, len);
6422 if ((xf = mem_collxfrm(s, len, &xlen))) {
6423 if (SvREADONLY(sv)) {
6426 return xf + sizeof(PL_collation_ix);
6429 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6430 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6443 if (mg && mg->mg_ptr) {
6445 return mg->mg_ptr + sizeof(PL_collation_ix);
6453 #endif /* USE_LOCALE_COLLATE */
6458 Get a line from the filehandle and store it into the SV, optionally
6459 appending to the currently-stored string.
6465 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6469 register STDCHAR rslast;
6470 register STDCHAR *bp;
6476 if (SvTHINKFIRST(sv))
6477 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6478 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6480 However, perlbench says it's slower, because the existing swipe code
6481 is faster than copy on write.
6482 Swings and roundabouts. */
6483 SvUPGRADE(sv, SVt_PV);
6488 if (PerlIO_isutf8(fp)) {
6490 sv_utf8_upgrade_nomg(sv);
6491 sv_pos_u2b(sv,&append,0);
6493 } else if (SvUTF8(sv)) {
6494 SV * const tsv = NEWSV(0,0);
6495 sv_gets(tsv, fp, 0);
6496 sv_utf8_upgrade_nomg(tsv);
6497 SvCUR_set(sv,append);
6500 goto return_string_or_null;
6505 if (PerlIO_isutf8(fp))
6508 if (IN_PERL_COMPILETIME) {
6509 /* we always read code in line mode */
6513 else if (RsSNARF(PL_rs)) {
6514 /* If it is a regular disk file use size from stat() as estimate
6515 of amount we are going to read - may result in malloc-ing
6516 more memory than we realy need if layers bellow reduce
6517 size we read (e.g. CRLF or a gzip layer)
6520 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6521 const Off_t offset = PerlIO_tell(fp);
6522 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6523 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6529 else if (RsRECORD(PL_rs)) {
6533 /* Grab the size of the record we're getting */
6534 recsize = SvIV(SvRV(PL_rs));
6535 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6538 /* VMS wants read instead of fread, because fread doesn't respect */
6539 /* RMS record boundaries. This is not necessarily a good thing to be */
6540 /* doing, but we've got no other real choice - except avoid stdio
6541 as implementation - perhaps write a :vms layer ?
6543 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6545 bytesread = PerlIO_read(fp, buffer, recsize);
6549 SvCUR_set(sv, bytesread += append);
6550 buffer[bytesread] = '\0';
6551 goto return_string_or_null;
6553 else if (RsPARA(PL_rs)) {
6559 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6560 if (PerlIO_isutf8(fp)) {
6561 rsptr = SvPVutf8(PL_rs, rslen);
6564 if (SvUTF8(PL_rs)) {
6565 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6566 Perl_croak(aTHX_ "Wide character in $/");
6569 rsptr = SvPV_const(PL_rs, rslen);
6573 rslast = rslen ? rsptr[rslen - 1] : '\0';
6575 if (rspara) { /* have to do this both before and after */
6576 do { /* to make sure file boundaries work right */
6579 i = PerlIO_getc(fp);
6583 PerlIO_ungetc(fp,i);
6589 /* See if we know enough about I/O mechanism to cheat it ! */
6591 /* This used to be #ifdef test - it is made run-time test for ease
6592 of abstracting out stdio interface. One call should be cheap
6593 enough here - and may even be a macro allowing compile
6597 if (PerlIO_fast_gets(fp)) {
6600 * We're going to steal some values from the stdio struct
6601 * and put EVERYTHING in the innermost loop into registers.
6603 register STDCHAR *ptr;
6607 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6608 /* An ungetc()d char is handled separately from the regular
6609 * buffer, so we getc() it back out and stuff it in the buffer.
6611 i = PerlIO_getc(fp);
6612 if (i == EOF) return 0;
6613 *(--((*fp)->_ptr)) = (unsigned char) i;
6617 /* Here is some breathtakingly efficient cheating */
6619 cnt = PerlIO_get_cnt(fp); /* get count into register */
6620 /* make sure we have the room */
6621 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6622 /* Not room for all of it
6623 if we are looking for a separator and room for some
6625 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6626 /* just process what we have room for */
6627 shortbuffered = cnt - SvLEN(sv) + append + 1;
6628 cnt -= shortbuffered;
6632 /* remember that cnt can be negative */
6633 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6638 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6639 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6640 DEBUG_P(PerlIO_printf(Perl_debug_log,
6641 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6642 DEBUG_P(PerlIO_printf(Perl_debug_log,
6643 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6644 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6645 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6650 while (cnt > 0) { /* this | eat */
6652 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6653 goto thats_all_folks; /* screams | sed :-) */
6657 Copy(ptr, bp, cnt, char); /* this | eat */
6658 bp += cnt; /* screams | dust */
6659 ptr += cnt; /* louder | sed :-) */
6664 if (shortbuffered) { /* oh well, must extend */
6665 cnt = shortbuffered;
6667 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6669 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6670 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6674 DEBUG_P(PerlIO_printf(Perl_debug_log,
6675 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6676 PTR2UV(ptr),(long)cnt));
6677 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6679 DEBUG_P(PerlIO_printf(Perl_debug_log,
6680 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6681 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6682 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6684 /* This used to call 'filbuf' in stdio form, but as that behaves like
6685 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6686 another abstraction. */
6687 i = PerlIO_getc(fp); /* get more characters */
6689 DEBUG_P(PerlIO_printf(Perl_debug_log,
6690 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6691 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6692 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6694 cnt = PerlIO_get_cnt(fp);
6695 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6696 DEBUG_P(PerlIO_printf(Perl_debug_log,
6697 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6699 if (i == EOF) /* all done for ever? */
6700 goto thats_really_all_folks;
6702 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6704 SvGROW(sv, bpx + cnt + 2);
6705 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6707 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6709 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6710 goto thats_all_folks;
6714 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6715 memNE((char*)bp - rslen, rsptr, rslen))
6716 goto screamer; /* go back to the fray */
6717 thats_really_all_folks:
6719 cnt += shortbuffered;
6720 DEBUG_P(PerlIO_printf(Perl_debug_log,
6721 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6722 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6723 DEBUG_P(PerlIO_printf(Perl_debug_log,
6724 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6725 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6726 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6728 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6729 DEBUG_P(PerlIO_printf(Perl_debug_log,
6730 "Screamer: done, len=%ld, string=|%.*s|\n",
6731 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6735 /*The big, slow, and stupid way. */
6736 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6738 Newx(buf, 8192, STDCHAR);
6746 register const STDCHAR *bpe = buf + sizeof(buf);
6748 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6749 ; /* keep reading */
6753 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6754 /* Accomodate broken VAXC compiler, which applies U8 cast to
6755 * both args of ?: operator, causing EOF to change into 255
6758 i = (U8)buf[cnt - 1];
6764 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6766 sv_catpvn(sv, (char *) buf, cnt);
6768 sv_setpvn(sv, (char *) buf, cnt);
6770 if (i != EOF && /* joy */
6772 SvCUR(sv) < rslen ||
6773 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6777 * If we're reading from a TTY and we get a short read,
6778 * indicating that the user hit his EOF character, we need
6779 * to notice it now, because if we try to read from the TTY
6780 * again, the EOF condition will disappear.
6782 * The comparison of cnt to sizeof(buf) is an optimization
6783 * that prevents unnecessary calls to feof().
6787 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6791 #ifdef USE_HEAP_INSTEAD_OF_STACK
6796 if (rspara) { /* have to do this both before and after */
6797 while (i != EOF) { /* to make sure file boundaries work right */
6798 i = PerlIO_getc(fp);
6800 PerlIO_ungetc(fp,i);
6806 return_string_or_null:
6807 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6813 Auto-increment of the value in the SV, doing string to numeric conversion
6814 if necessary. Handles 'get' magic.
6820 Perl_sv_inc(pTHX_ register SV *sv)
6828 if (SvTHINKFIRST(sv)) {
6830 sv_force_normal_flags(sv, 0);
6831 if (SvREADONLY(sv)) {
6832 if (IN_PERL_RUNTIME)
6833 Perl_croak(aTHX_ PL_no_modify);
6837 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6839 i = PTR2IV(SvRV(sv));
6844 flags = SvFLAGS(sv);
6845 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6846 /* It's (privately or publicly) a float, but not tested as an
6847 integer, so test it to see. */
6849 flags = SvFLAGS(sv);
6851 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6852 /* It's publicly an integer, or privately an integer-not-float */
6853 #ifdef PERL_PRESERVE_IVUV
6857 if (SvUVX(sv) == UV_MAX)
6858 sv_setnv(sv, UV_MAX_P1);
6860 (void)SvIOK_only_UV(sv);
6861 SvUV_set(sv, SvUVX(sv) + 1);
6863 if (SvIVX(sv) == IV_MAX)
6864 sv_setuv(sv, (UV)IV_MAX + 1);
6866 (void)SvIOK_only(sv);
6867 SvIV_set(sv, SvIVX(sv) + 1);
6872 if (flags & SVp_NOK) {
6873 (void)SvNOK_only(sv);
6874 SvNV_set(sv, SvNVX(sv) + 1.0);
6878 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6879 if ((flags & SVTYPEMASK) < SVt_PVIV)
6880 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6881 (void)SvIOK_only(sv);
6886 while (isALPHA(*d)) d++;
6887 while (isDIGIT(*d)) d++;
6889 #ifdef PERL_PRESERVE_IVUV
6890 /* Got to punt this as an integer if needs be, but we don't issue
6891 warnings. Probably ought to make the sv_iv_please() that does
6892 the conversion if possible, and silently. */
6893 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6894 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6895 /* Need to try really hard to see if it's an integer.
6896 9.22337203685478e+18 is an integer.
6897 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6898 so $a="9.22337203685478e+18"; $a+0; $a++
6899 needs to be the same as $a="9.22337203685478e+18"; $a++
6906 /* sv_2iv *should* have made this an NV */
6907 if (flags & SVp_NOK) {
6908 (void)SvNOK_only(sv);
6909 SvNV_set(sv, SvNVX(sv) + 1.0);
6912 /* I don't think we can get here. Maybe I should assert this
6913 And if we do get here I suspect that sv_setnv will croak. NWC
6915 #if defined(USE_LONG_DOUBLE)
6916 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",
6917 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6919 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6920 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6923 #endif /* PERL_PRESERVE_IVUV */
6924 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6928 while (d >= SvPVX_const(sv)) {
6936 /* MKS: The original code here died if letters weren't consecutive.
6937 * at least it didn't have to worry about non-C locales. The
6938 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6939 * arranged in order (although not consecutively) and that only
6940 * [A-Za-z] are accepted by isALPHA in the C locale.
6942 if (*d != 'z' && *d != 'Z') {
6943 do { ++*d; } while (!isALPHA(*d));
6946 *(d--) -= 'z' - 'a';
6951 *(d--) -= 'z' - 'a' + 1;
6955 /* oh,oh, the number grew */
6956 SvGROW(sv, SvCUR(sv) + 2);
6957 SvCUR_set(sv, SvCUR(sv) + 1);
6958 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
6969 Auto-decrement of the value in the SV, doing string to numeric conversion
6970 if necessary. Handles 'get' magic.
6976 Perl_sv_dec(pTHX_ register SV *sv)
6983 if (SvTHINKFIRST(sv)) {
6985 sv_force_normal_flags(sv, 0);
6986 if (SvREADONLY(sv)) {
6987 if (IN_PERL_RUNTIME)
6988 Perl_croak(aTHX_ PL_no_modify);
6992 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6994 i = PTR2IV(SvRV(sv));
6999 /* Unlike sv_inc we don't have to worry about string-never-numbers
7000 and keeping them magic. But we mustn't warn on punting */
7001 flags = SvFLAGS(sv);
7002 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7003 /* It's publicly an integer, or privately an integer-not-float */
7004 #ifdef PERL_PRESERVE_IVUV
7008 if (SvUVX(sv) == 0) {
7009 (void)SvIOK_only(sv);
7013 (void)SvIOK_only_UV(sv);
7014 SvUV_set(sv, SvUVX(sv) - 1);
7017 if (SvIVX(sv) == IV_MIN)
7018 sv_setnv(sv, (NV)IV_MIN - 1.0);
7020 (void)SvIOK_only(sv);
7021 SvIV_set(sv, SvIVX(sv) - 1);
7026 if (flags & SVp_NOK) {
7027 SvNV_set(sv, SvNVX(sv) - 1.0);
7028 (void)SvNOK_only(sv);
7031 if (!(flags & SVp_POK)) {
7032 if ((flags & SVTYPEMASK) < SVt_PVIV)
7033 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
7035 (void)SvIOK_only(sv);
7038 #ifdef PERL_PRESERVE_IVUV
7040 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7041 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7042 /* Need to try really hard to see if it's an integer.
7043 9.22337203685478e+18 is an integer.
7044 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7045 so $a="9.22337203685478e+18"; $a+0; $a--
7046 needs to be the same as $a="9.22337203685478e+18"; $a--
7053 /* sv_2iv *should* have made this an NV */
7054 if (flags & SVp_NOK) {
7055 (void)SvNOK_only(sv);
7056 SvNV_set(sv, SvNVX(sv) - 1.0);
7059 /* I don't think we can get here. Maybe I should assert this
7060 And if we do get here I suspect that sv_setnv will croak. NWC
7062 #if defined(USE_LONG_DOUBLE)
7063 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",
7064 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7066 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7067 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7071 #endif /* PERL_PRESERVE_IVUV */
7072 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7076 =for apidoc sv_mortalcopy
7078 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7079 The new SV is marked as mortal. It will be destroyed "soon", either by an
7080 explicit call to FREETMPS, or by an implicit call at places such as
7081 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7086 /* Make a string that will exist for the duration of the expression
7087 * evaluation. Actually, it may have to last longer than that, but
7088 * hopefully we won't free it until it has been assigned to a
7089 * permanent location. */
7092 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7097 sv_setsv(sv,oldstr);
7099 PL_tmps_stack[++PL_tmps_ix] = sv;
7105 =for apidoc sv_newmortal
7107 Creates a new null SV which is mortal. The reference count of the SV is
7108 set to 1. It will be destroyed "soon", either by an explicit call to
7109 FREETMPS, or by an implicit call at places such as statement boundaries.
7110 See also C<sv_mortalcopy> and C<sv_2mortal>.
7116 Perl_sv_newmortal(pTHX)
7121 SvFLAGS(sv) = SVs_TEMP;
7123 PL_tmps_stack[++PL_tmps_ix] = sv;
7128 =for apidoc sv_2mortal
7130 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7131 by an explicit call to FREETMPS, or by an implicit call at places such as
7132 statement boundaries. SvTEMP() is turned on which means that the SV's
7133 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7134 and C<sv_mortalcopy>.
7140 Perl_sv_2mortal(pTHX_ register SV *sv)
7145 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7148 PL_tmps_stack[++PL_tmps_ix] = sv;
7156 Creates a new SV and copies a string into it. The reference count for the
7157 SV is set to 1. If C<len> is zero, Perl will compute the length using
7158 strlen(). For efficiency, consider using C<newSVpvn> instead.
7164 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7169 sv_setpvn(sv,s,len ? len : strlen(s));
7174 =for apidoc newSVpvn
7176 Creates a new SV and copies a string into it. The reference count for the
7177 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7178 string. You are responsible for ensuring that the source string is at least
7179 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7185 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7190 sv_setpvn(sv,s,len);
7196 =for apidoc newSVhek
7198 Creates a new SV from the hash key structure. It will generate scalars that
7199 point to the shared string table where possible. Returns a new (undefined)
7200 SV if the hek is NULL.
7206 Perl_newSVhek(pTHX_ const HEK *hek)
7215 if (HEK_LEN(hek) == HEf_SVKEY) {
7216 return newSVsv(*(SV**)HEK_KEY(hek));
7218 const int flags = HEK_FLAGS(hek);
7219 if (flags & HVhek_WASUTF8) {
7221 Andreas would like keys he put in as utf8 to come back as utf8
7223 STRLEN utf8_len = HEK_LEN(hek);
7224 const U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7225 SV * const sv = newSVpvn ((const char*)as_utf8, utf8_len);
7228 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7230 } else if (flags & HVhek_REHASH) {
7231 /* We don't have a pointer to the hv, so we have to replicate the
7232 flag into every HEK. This hv is using custom a hasing
7233 algorithm. Hence we can't return a shared string scalar, as
7234 that would contain the (wrong) hash value, and might get passed
7235 into an hv routine with a regular hash */
7237 SV * const sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7242 /* This will be overwhelminly the most common case. */
7243 return newSVpvn_share(HEK_KEY(hek),
7244 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7250 =for apidoc newSVpvn_share
7252 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7253 table. If the string does not already exist in the table, it is created
7254 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7255 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7256 otherwise the hash is computed. The idea here is that as the string table
7257 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7258 hash lookup will avoid string compare.
7264 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7267 bool is_utf8 = FALSE;
7269 STRLEN tmplen = -len;
7271 /* See the note in hv.c:hv_fetch() --jhi */
7272 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7276 PERL_HASH(hash, src, len);
7278 sv_upgrade(sv, SVt_PV);
7279 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7291 #if defined(PERL_IMPLICIT_CONTEXT)
7293 /* pTHX_ magic can't cope with varargs, so this is a no-context
7294 * version of the main function, (which may itself be aliased to us).
7295 * Don't access this version directly.
7299 Perl_newSVpvf_nocontext(const char* pat, ...)
7304 va_start(args, pat);
7305 sv = vnewSVpvf(pat, &args);
7312 =for apidoc newSVpvf
7314 Creates a new SV and initializes it with the string formatted like
7321 Perl_newSVpvf(pTHX_ const char* pat, ...)
7325 va_start(args, pat);
7326 sv = vnewSVpvf(pat, &args);
7331 /* backend for newSVpvf() and newSVpvf_nocontext() */
7334 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7338 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7345 Creates a new SV and copies a floating point value into it.
7346 The reference count for the SV is set to 1.
7352 Perl_newSVnv(pTHX_ NV n)
7364 Creates a new SV and copies an integer into it. The reference count for the
7371 Perl_newSViv(pTHX_ IV i)
7383 Creates a new SV and copies an unsigned integer into it.
7384 The reference count for the SV is set to 1.
7390 Perl_newSVuv(pTHX_ UV u)
7400 =for apidoc newRV_noinc
7402 Creates an RV wrapper for an SV. The reference count for the original
7403 SV is B<not> incremented.
7409 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7414 sv_upgrade(sv, SVt_RV);
7416 SvRV_set(sv, tmpRef);
7421 /* newRV_inc is the official function name to use now.
7422 * newRV_inc is in fact #defined to newRV in sv.h
7426 Perl_newRV(pTHX_ SV *tmpRef)
7428 return newRV_noinc(SvREFCNT_inc(tmpRef));
7434 Creates a new SV which is an exact duplicate of the original SV.
7441 Perl_newSVsv(pTHX_ register SV *old)
7447 if (SvTYPE(old) == SVTYPEMASK) {
7448 if (ckWARN_d(WARN_INTERNAL))
7449 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7453 /* SV_GMAGIC is the default for sv_setv()
7454 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7455 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7456 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7461 =for apidoc sv_reset
7463 Underlying implementation for the C<reset> Perl function.
7464 Note that the perl-level function is vaguely deprecated.
7470 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7473 char todo[PERL_UCHAR_MAX+1];
7478 if (!*s) { /* reset ?? searches */
7479 MAGIC * const mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7481 PMOP *pm = (PMOP *) mg->mg_obj;
7483 pm->op_pmdynflags &= ~PMdf_USED;
7490 /* reset variables */
7492 if (!HvARRAY(stash))
7495 Zero(todo, 256, char);
7498 I32 i = (unsigned char)*s;
7502 max = (unsigned char)*s++;
7503 for ( ; i <= max; i++) {
7506 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7508 for (entry = HvARRAY(stash)[i];
7510 entry = HeNEXT(entry))
7515 if (!todo[(U8)*HeKEY(entry)])
7517 gv = (GV*)HeVAL(entry);
7520 if (SvTHINKFIRST(sv)) {
7521 if (!SvREADONLY(sv) && SvROK(sv))
7523 /* XXX Is this continue a bug? Why should THINKFIRST
7524 exempt us from resetting arrays and hashes? */
7528 if (SvTYPE(sv) >= SVt_PV) {
7530 if (SvPVX_const(sv) != Nullch)
7538 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7541 #ifdef USE_ENVIRON_ARRAY
7543 # ifdef USE_ITHREADS
7544 && PL_curinterp == aTHX
7548 environ[0] = Nullch;
7551 #endif /* !PERL_MICRO */
7561 Using various gambits, try to get an IO from an SV: the IO slot if its a
7562 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7563 named after the PV if we're a string.
7569 Perl_sv_2io(pTHX_ SV *sv)
7574 switch (SvTYPE(sv)) {
7582 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7586 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7588 return sv_2io(SvRV(sv));
7589 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7595 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7604 Using various gambits, try to get a CV from an SV; in addition, try if
7605 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7611 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7618 return *gvp = Nullgv, Nullcv;
7619 switch (SvTYPE(sv)) {
7637 SV * const *sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7638 tryAMAGICunDEREF(to_cv);
7641 if (SvTYPE(sv) == SVt_PVCV) {
7650 Perl_croak(aTHX_ "Not a subroutine reference");
7655 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7661 if (lref && !GvCVu(gv)) {
7664 tmpsv = NEWSV(704,0);
7665 gv_efullname3(tmpsv, gv, Nullch);
7666 /* XXX this is probably not what they think they're getting.
7667 * It has the same effect as "sub name;", i.e. just a forward
7669 newSUB(start_subparse(FALSE, 0),
7670 newSVOP(OP_CONST, 0, tmpsv),
7675 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7685 Returns true if the SV has a true value by Perl's rules.
7686 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7687 instead use an in-line version.
7693 Perl_sv_true(pTHX_ register SV *sv)
7698 register const XPV* const tXpv = (XPV*)SvANY(sv);
7700 (tXpv->xpv_cur > 1 ||
7701 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7708 return SvIVX(sv) != 0;
7711 return SvNVX(sv) != 0.0;
7713 return sv_2bool(sv);
7721 A private implementation of the C<SvIVx> macro for compilers which can't
7722 cope with complex macro expressions. Always use the macro instead.
7728 Perl_sv_iv(pTHX_ register SV *sv)
7732 return (IV)SvUVX(sv);
7741 A private implementation of the C<SvUVx> macro for compilers which can't
7742 cope with complex macro expressions. Always use the macro instead.
7748 Perl_sv_uv(pTHX_ register SV *sv)
7753 return (UV)SvIVX(sv);
7761 A private implementation of the C<SvNVx> macro for compilers which can't
7762 cope with complex macro expressions. Always use the macro instead.
7768 Perl_sv_nv(pTHX_ register SV *sv)
7778 Use the C<SvPV_nolen> macro instead
7782 A private implementation of the C<SvPV> macro for compilers which can't
7783 cope with complex macro expressions. Always use the macro instead.
7789 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7795 return sv_2pv(sv, lp);
7800 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7806 return sv_2pv_flags(sv, lp, 0);
7810 =for apidoc sv_pvn_force
7812 Get a sensible string out of the SV somehow.
7813 A private implementation of the C<SvPV_force> macro for compilers which
7814 can't cope with complex macro expressions. Always use the macro instead.
7816 =for apidoc sv_pvn_force_flags
7818 Get a sensible string out of the SV somehow.
7819 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7820 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7821 implemented in terms of this function.
7822 You normally want to use the various wrapper macros instead: see
7823 C<SvPV_force> and C<SvPV_force_nomg>
7829 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7832 if (SvTHINKFIRST(sv) && !SvROK(sv))
7833 sv_force_normal_flags(sv, 0);
7843 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7844 const char * const ref = sv_reftype(sv,0);
7846 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7847 ref, OP_NAME(PL_op));
7849 Perl_croak(aTHX_ "Can't coerce readonly %s to string", ref);
7851 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM)
7852 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7854 s = sv_2pv_flags(sv, &len, flags);
7858 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7861 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7862 SvGROW(sv, len + 1);
7863 Move(s,SvPVX(sv),len,char);
7868 SvPOK_on(sv); /* validate pointer */
7870 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7871 PTR2UV(sv),SvPVX_const(sv)));
7874 return SvPVX_mutable(sv);
7878 =for apidoc sv_pvbyte
7880 Use C<SvPVbyte_nolen> instead.
7882 =for apidoc sv_pvbyten
7884 A private implementation of the C<SvPVbyte> macro for compilers
7885 which can't cope with complex macro expressions. Always use the macro
7892 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7894 sv_utf8_downgrade(sv,0);
7895 return sv_pvn(sv,lp);
7899 =for apidoc sv_pvbyten_force
7901 A private implementation of the C<SvPVbytex_force> macro for compilers
7902 which can't cope with complex macro expressions. Always use the macro
7909 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7911 sv_pvn_force(sv,lp);
7912 sv_utf8_downgrade(sv,0);
7918 =for apidoc sv_pvutf8
7920 Use the C<SvPVutf8_nolen> macro instead
7922 =for apidoc sv_pvutf8n
7924 A private implementation of the C<SvPVutf8> macro for compilers
7925 which can't cope with complex macro expressions. Always use the macro
7932 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7934 sv_utf8_upgrade(sv);
7935 return sv_pvn(sv,lp);
7939 =for apidoc sv_pvutf8n_force
7941 A private implementation of the C<SvPVutf8_force> macro for compilers
7942 which can't cope with complex macro expressions. Always use the macro
7949 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7951 sv_pvn_force(sv,lp);
7952 sv_utf8_upgrade(sv);
7958 =for apidoc sv_reftype
7960 Returns a string describing what the SV is a reference to.
7966 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
7968 /* The fact that I don't need to downcast to char * everywhere, only in ?:
7969 inside return suggests a const propagation bug in g++. */
7970 if (ob && SvOBJECT(sv)) {
7971 char * const name = HvNAME_get(SvSTASH(sv));
7972 return name ? name : (char *) "__ANON__";
7975 switch (SvTYPE(sv)) {
7992 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
7993 /* tied lvalues should appear to be
7994 * scalars for backwards compatitbility */
7995 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7996 ? "SCALAR" : "LVALUE");
7997 case SVt_PVAV: return "ARRAY";
7998 case SVt_PVHV: return "HASH";
7999 case SVt_PVCV: return "CODE";
8000 case SVt_PVGV: return "GLOB";
8001 case SVt_PVFM: return "FORMAT";
8002 case SVt_PVIO: return "IO";
8003 default: return "UNKNOWN";
8009 =for apidoc sv_isobject
8011 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8012 object. If the SV is not an RV, or if the object is not blessed, then this
8019 Perl_sv_isobject(pTHX_ SV *sv)
8035 Returns a boolean indicating whether the SV is blessed into the specified
8036 class. This does not check for subtypes; use C<sv_derived_from> to verify
8037 an inheritance relationship.
8043 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8054 hvname = HvNAME_get(SvSTASH(sv));
8058 return strEQ(hvname, name);
8064 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8065 it will be upgraded to one. If C<classname> is non-null then the new SV will
8066 be blessed in the specified package. The new SV is returned and its
8067 reference count is 1.
8073 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8079 SV_CHECK_THINKFIRST_COW_DROP(rv);
8082 if (SvTYPE(rv) >= SVt_PVMG) {
8083 const U32 refcnt = SvREFCNT(rv);
8087 SvREFCNT(rv) = refcnt;
8090 if (SvTYPE(rv) < SVt_RV)
8091 sv_upgrade(rv, SVt_RV);
8092 else if (SvTYPE(rv) > SVt_RV) {
8103 HV* const stash = gv_stashpv(classname, TRUE);
8104 (void)sv_bless(rv, stash);
8110 =for apidoc sv_setref_pv
8112 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8113 argument will be upgraded to an RV. That RV will be modified to point to
8114 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8115 into the SV. The C<classname> argument indicates the package for the
8116 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8117 will have a reference count of 1, and the RV will be returned.
8119 Do not use with other Perl types such as HV, AV, SV, CV, because those
8120 objects will become corrupted by the pointer copy process.
8122 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8128 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8131 sv_setsv(rv, &PL_sv_undef);
8135 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8140 =for apidoc sv_setref_iv
8142 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8143 argument will be upgraded to an RV. That RV will be modified to point to
8144 the new SV. The C<classname> argument indicates the package for the
8145 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8146 will have a reference count of 1, and the RV will be returned.
8152 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8154 sv_setiv(newSVrv(rv,classname), iv);
8159 =for apidoc sv_setref_uv
8161 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8162 argument will be upgraded to an RV. That RV will be modified to point to
8163 the new SV. The C<classname> argument indicates the package for the
8164 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8165 will have a reference count of 1, and the RV will be returned.
8171 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8173 sv_setuv(newSVrv(rv,classname), uv);
8178 =for apidoc sv_setref_nv
8180 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8181 argument will be upgraded to an RV. That RV will be modified to point to
8182 the new SV. The C<classname> argument indicates the package for the
8183 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8184 will have a reference count of 1, and the RV will be returned.
8190 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8192 sv_setnv(newSVrv(rv,classname), nv);
8197 =for apidoc sv_setref_pvn
8199 Copies a string into a new SV, optionally blessing the SV. The length of the
8200 string must be specified with C<n>. The C<rv> argument will be upgraded to
8201 an RV. That RV will be modified to point to the new SV. The C<classname>
8202 argument indicates the package for the blessing. Set C<classname> to
8203 C<Nullch> to avoid the blessing. The new SV will have a reference count
8204 of 1, and the RV will be returned.
8206 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8212 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
8214 sv_setpvn(newSVrv(rv,classname), pv, n);
8219 =for apidoc sv_bless
8221 Blesses an SV into a specified package. The SV must be an RV. The package
8222 must be designated by its stash (see C<gv_stashpv()>). The reference count
8223 of the SV is unaffected.
8229 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8233 Perl_croak(aTHX_ "Can't bless non-reference value");
8235 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8236 if (SvREADONLY(tmpRef))
8237 Perl_croak(aTHX_ PL_no_modify);
8238 if (SvOBJECT(tmpRef)) {
8239 if (SvTYPE(tmpRef) != SVt_PVIO)
8241 SvREFCNT_dec(SvSTASH(tmpRef));
8244 SvOBJECT_on(tmpRef);
8245 if (SvTYPE(tmpRef) != SVt_PVIO)
8247 SvUPGRADE(tmpRef, SVt_PVMG);
8248 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8255 if(SvSMAGICAL(tmpRef))
8256 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8264 /* Downgrades a PVGV to a PVMG.
8268 S_sv_unglob(pTHX_ SV *sv)
8272 assert(SvTYPE(sv) == SVt_PVGV);
8277 sv_del_backref((SV*)GvSTASH(sv), sv);
8278 GvSTASH(sv) = Nullhv;
8280 sv_unmagic(sv, PERL_MAGIC_glob);
8281 Safefree(GvNAME(sv));
8284 /* need to keep SvANY(sv) in the right arena */
8285 xpvmg = new_XPVMG();
8286 StructCopy(SvANY(sv), xpvmg, XPVMG);
8287 del_XPVGV(SvANY(sv));
8290 SvFLAGS(sv) &= ~SVTYPEMASK;
8291 SvFLAGS(sv) |= SVt_PVMG;
8295 =for apidoc sv_unref_flags
8297 Unsets the RV status of the SV, and decrements the reference count of
8298 whatever was being referenced by the RV. This can almost be thought of
8299 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8300 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8301 (otherwise the decrementing is conditional on the reference count being
8302 different from one or the reference being a readonly SV).
8309 Perl_sv_unref_flags(pTHX_ SV *ref, U32 flags)
8311 SV* const target = SvRV(ref);
8313 if (SvWEAKREF(ref)) {
8314 sv_del_backref(target, ref);
8316 SvRV_set(ref, NULL);
8319 SvRV_set(ref, NULL);
8321 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
8322 assigned to as BEGIN {$a = \"Foo"} will fail. */
8323 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
8324 SvREFCNT_dec(target);
8325 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8326 sv_2mortal(target); /* Schedule for freeing later */
8330 =for apidoc sv_unref
8332 Unsets the RV status of the SV, and decrements the reference count of
8333 whatever was being referenced by the RV. This can almost be thought of
8334 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8335 being zero. See C<SvROK_off>.
8341 Perl_sv_unref(pTHX_ SV *sv)
8343 sv_unref_flags(sv, 0);
8347 =for apidoc sv_taint
8349 Taint an SV. Use C<SvTAINTED_on> instead.
8354 Perl_sv_taint(pTHX_ SV *sv)
8356 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8360 =for apidoc sv_untaint
8362 Untaint an SV. Use C<SvTAINTED_off> instead.
8367 Perl_sv_untaint(pTHX_ SV *sv)
8369 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8370 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8377 =for apidoc sv_tainted
8379 Test an SV for taintedness. Use C<SvTAINTED> instead.
8384 Perl_sv_tainted(pTHX_ SV *sv)
8386 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8387 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8388 if (mg && (mg->mg_len & 1) )
8395 =for apidoc sv_setpviv
8397 Copies an integer into the given SV, also updating its string value.
8398 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8404 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8406 char buf[TYPE_CHARS(UV)];
8408 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8410 sv_setpvn(sv, ptr, ebuf - ptr);
8414 =for apidoc sv_setpviv_mg
8416 Like C<sv_setpviv>, but also handles 'set' magic.
8422 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8424 char buf[TYPE_CHARS(UV)];
8426 char * const ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8428 sv_setpvn(sv, ptr, ebuf - ptr);
8432 #if defined(PERL_IMPLICIT_CONTEXT)
8434 /* pTHX_ magic can't cope with varargs, so this is a no-context
8435 * version of the main function, (which may itself be aliased to us).
8436 * Don't access this version directly.
8440 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8444 va_start(args, pat);
8445 sv_vsetpvf(sv, pat, &args);
8449 /* pTHX_ magic can't cope with varargs, so this is a no-context
8450 * version of the main function, (which may itself be aliased to us).
8451 * Don't access this version directly.
8455 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8459 va_start(args, pat);
8460 sv_vsetpvf_mg(sv, pat, &args);
8466 =for apidoc sv_setpvf
8468 Works like C<sv_catpvf> but copies the text into the SV instead of
8469 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8475 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8478 va_start(args, pat);
8479 sv_vsetpvf(sv, pat, &args);
8484 =for apidoc sv_vsetpvf
8486 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8487 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8489 Usually used via its frontend C<sv_setpvf>.
8495 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8497 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8501 =for apidoc sv_setpvf_mg
8503 Like C<sv_setpvf>, but also handles 'set' magic.
8509 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8512 va_start(args, pat);
8513 sv_vsetpvf_mg(sv, pat, &args);
8518 =for apidoc sv_vsetpvf_mg
8520 Like C<sv_vsetpvf>, but also handles 'set' magic.
8522 Usually used via its frontend C<sv_setpvf_mg>.
8528 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8530 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8534 #if defined(PERL_IMPLICIT_CONTEXT)
8536 /* pTHX_ magic can't cope with varargs, so this is a no-context
8537 * version of the main function, (which may itself be aliased to us).
8538 * Don't access this version directly.
8542 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8546 va_start(args, pat);
8547 sv_vcatpvf(sv, pat, &args);
8551 /* pTHX_ magic can't cope with varargs, so this is a no-context
8552 * version of the main function, (which may itself be aliased to us).
8553 * Don't access this version directly.
8557 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8561 va_start(args, pat);
8562 sv_vcatpvf_mg(sv, pat, &args);
8568 =for apidoc sv_catpvf
8570 Processes its arguments like C<sprintf> and appends the formatted
8571 output to an SV. If the appended data contains "wide" characters
8572 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8573 and characters >255 formatted with %c), the original SV might get
8574 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8575 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8576 valid UTF-8; if the original SV was bytes, the pattern should be too.
8581 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8584 va_start(args, pat);
8585 sv_vcatpvf(sv, pat, &args);
8590 =for apidoc sv_vcatpvf
8592 Processes its arguments like C<vsprintf> and appends the formatted output
8593 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8595 Usually used via its frontend C<sv_catpvf>.
8601 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8603 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8607 =for apidoc sv_catpvf_mg
8609 Like C<sv_catpvf>, but also handles 'set' magic.
8615 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8618 va_start(args, pat);
8619 sv_vcatpvf_mg(sv, pat, &args);
8624 =for apidoc sv_vcatpvf_mg
8626 Like C<sv_vcatpvf>, but also handles 'set' magic.
8628 Usually used via its frontend C<sv_catpvf_mg>.
8634 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8636 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8641 =for apidoc sv_vsetpvfn
8643 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8646 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8652 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8654 sv_setpvn(sv, "", 0);
8655 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8658 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8661 S_expect_number(pTHX_ char** pattern)
8664 switch (**pattern) {
8665 case '1': case '2': case '3':
8666 case '4': case '5': case '6':
8667 case '7': case '8': case '9':
8668 while (isDIGIT(**pattern))
8669 var = var * 10 + (*(*pattern)++ - '0');
8673 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8676 F0convert(NV nv, char *endbuf, STRLEN *len)
8678 const int neg = nv < 0;
8687 if (uv & 1 && uv == nv)
8688 uv--; /* Round to even */
8690 const unsigned dig = uv % 10;
8703 =for apidoc sv_vcatpvfn
8705 Processes its arguments like C<vsprintf> and appends the formatted output
8706 to an SV. Uses an array of SVs if the C style variable argument list is
8707 missing (NULL). When running with taint checks enabled, indicates via
8708 C<maybe_tainted> if results are untrustworthy (often due to the use of
8711 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8717 #define VECTORIZE_ARGS vecsv = va_arg(*args, SV*);\
8718 vecstr = (U8*)SvPV_const(vecsv,veclen);\
8719 vec_utf8 = DO_UTF8(vecsv);
8721 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8724 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8731 static const char nullstr[] = "(null)";
8733 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8734 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8736 /* Times 4: a decimal digit takes more than 3 binary digits.
8737 * NV_DIG: mantissa takes than many decimal digits.
8738 * Plus 32: Playing safe. */
8739 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8740 /* large enough for "%#.#f" --chip */
8741 /* what about long double NVs? --jhi */
8743 PERL_UNUSED_ARG(maybe_tainted);
8745 /* no matter what, this is a string now */
8746 (void)SvPV_force(sv, origlen);
8748 /* special-case "", "%s", and "%-p" (SVf - see below) */
8751 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8753 const char * const s = va_arg(*args, char*);
8754 sv_catpv(sv, s ? s : nullstr);
8756 else if (svix < svmax) {
8757 sv_catsv(sv, *svargs);
8758 if (DO_UTF8(*svargs))
8763 if (args && patlen == 3 && pat[0] == '%' &&
8764 pat[1] == '-' && pat[2] == 'p') {
8765 argsv = va_arg(*args, SV*);
8766 sv_catsv(sv, argsv);
8772 #ifndef USE_LONG_DOUBLE
8773 /* special-case "%.<number>[gf]" */
8774 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8775 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8776 unsigned digits = 0;
8780 while (*pp >= '0' && *pp <= '9')
8781 digits = 10 * digits + (*pp++ - '0');
8782 if (pp - pat == (int)patlen - 1) {
8790 /* Add check for digits != 0 because it seems that some
8791 gconverts are buggy in this case, and we don't yet have
8792 a Configure test for this. */
8793 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8794 /* 0, point, slack */
8795 Gconvert(nv, (int)digits, 0, ebuf);
8797 if (*ebuf) /* May return an empty string for digits==0 */
8800 } else if (!digits) {
8803 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8804 sv_catpvn(sv, p, l);
8810 #endif /* !USE_LONG_DOUBLE */
8812 if (!args && svix < svmax && DO_UTF8(*svargs))
8815 patend = (char*)pat + patlen;
8816 for (p = (char*)pat; p < patend; p = q) {
8819 bool vectorize = FALSE;
8820 bool vectorarg = FALSE;
8821 bool vec_utf8 = FALSE;
8827 bool has_precis = FALSE;
8830 bool is_utf8 = FALSE; /* is this item utf8? */
8831 #ifdef HAS_LDBL_SPRINTF_BUG
8832 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8833 with sfio - Allen <allens@cpan.org> */
8834 bool fix_ldbl_sprintf_bug = FALSE;
8838 U8 utf8buf[UTF8_MAXBYTES+1];
8839 STRLEN esignlen = 0;
8841 const char *eptr = Nullch;
8844 const U8 *vecstr = Null(U8*);
8851 /* we need a long double target in case HAS_LONG_DOUBLE but
8854 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8862 const char *dotstr = ".";
8863 STRLEN dotstrlen = 1;
8864 I32 efix = 0; /* explicit format parameter index */
8865 I32 ewix = 0; /* explicit width index */
8866 I32 epix = 0; /* explicit precision index */
8867 I32 evix = 0; /* explicit vector index */
8868 bool asterisk = FALSE;
8870 /* echo everything up to the next format specification */
8871 for (q = p; q < patend && *q != '%'; ++q) ;
8873 if (has_utf8 && !pat_utf8)
8874 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8876 sv_catpvn(sv, p, q - p);
8883 We allow format specification elements in this order:
8884 \d+\$ explicit format parameter index
8886 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8887 0 flag (as above): repeated to allow "v02"
8888 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8889 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8891 [%bcdefginopsuxDFOUX] format (mandatory)
8896 As of perl5.9.3, printf format checking is on by default.
8897 Internally, perl uses %p formats to provide an escape to
8898 some extended formatting. This block deals with those
8899 extensions: if it does not match, (char*)q is reset and
8900 the normal format processing code is used.
8902 Currently defined extensions are:
8903 %p include pointer address (standard)
8904 %-p (SVf) include an SV (previously %_)
8905 %-<num>p include an SV with precision <num>
8906 %1p (VDf) include a v-string (as %vd)
8907 %<num>p reserved for future extensions
8909 Robin Barker 2005-07-14
8916 EXPECT_NUMBER(q, n);
8923 argsv = va_arg(*args, SV*);
8924 eptr = SvPVx_const(argsv, elen);
8930 else if (n == vdNUMBER) { /* VDf */
8937 if (ckWARN_d(WARN_INTERNAL))
8938 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
8939 "internal %%<num>p might conflict with future printf extensions");
8945 if (EXPECT_NUMBER(q, width)) {
8986 if (EXPECT_NUMBER(q, ewix))
8995 if ((vectorarg = asterisk)) {
9008 EXPECT_NUMBER(q, width);
9014 vecsv = va_arg(*args, SV*);
9016 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9017 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9018 dotstr = SvPV_const(vecsv, dotstrlen);
9025 else if (efix ? efix <= svmax : svix < svmax) {
9026 vecsv = svargs[efix ? efix-1 : svix++];
9027 vecstr = (U8*)SvPV_const(vecsv,veclen);
9028 vec_utf8 = DO_UTF8(vecsv);
9029 /* if this is a version object, we need to return the
9030 * stringified representation (which the SvPVX_const has
9031 * already done for us), but not vectorize the args
9033 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9035 q++; /* skip past the rest of the %vd format */
9036 eptr = (const char *) vecstr;
9037 elen = strlen(eptr);
9050 i = va_arg(*args, int);
9052 i = (ewix ? ewix <= svmax : svix < svmax) ?
9053 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9055 width = (i < 0) ? -i : i;
9065 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9067 /* XXX: todo, support specified precision parameter */
9071 i = va_arg(*args, int);
9073 i = (ewix ? ewix <= svmax : svix < svmax)
9074 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9075 precis = (i < 0) ? 0 : i;
9080 precis = precis * 10 + (*q++ - '0');
9089 case 'I': /* Ix, I32x, and I64x */
9091 if (q[1] == '6' && q[2] == '4') {
9097 if (q[1] == '3' && q[2] == '2') {
9107 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9118 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9119 if (*(q + 1) == 'l') { /* lld, llf */
9144 argsv = (efix ? efix <= svmax : svix < svmax) ?
9145 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9152 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9154 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9156 eptr = (char*)utf8buf;
9157 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9168 if (args && !vectorize) {
9169 eptr = va_arg(*args, char*);
9171 #ifdef MACOS_TRADITIONAL
9172 /* On MacOS, %#s format is used for Pascal strings */
9177 elen = strlen(eptr);
9179 eptr = (char *)nullstr;
9180 elen = sizeof nullstr - 1;
9184 eptr = SvPVx_const(argsv, elen);
9185 if (DO_UTF8(argsv)) {
9186 if (has_precis && precis < elen) {
9188 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9191 if (width) { /* fudge width (can't fudge elen) */
9192 width += elen - sv_len_utf8(argsv);
9200 if (has_precis && elen > precis)
9207 if (alt || vectorize)
9209 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9230 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9239 esignbuf[esignlen++] = plus;
9243 case 'h': iv = (short)va_arg(*args, int); break;
9244 case 'l': iv = va_arg(*args, long); break;
9245 case 'V': iv = va_arg(*args, IV); break;
9246 default: iv = va_arg(*args, int); break;
9248 case 'q': iv = va_arg(*args, Quad_t); break;
9253 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9255 case 'h': iv = (short)tiv; break;
9256 case 'l': iv = (long)tiv; break;
9258 default: iv = tiv; break;
9260 case 'q': iv = (Quad_t)tiv; break;
9264 if ( !vectorize ) /* we already set uv above */
9269 esignbuf[esignlen++] = plus;
9273 esignbuf[esignlen++] = '-';
9316 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9327 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9328 case 'l': uv = va_arg(*args, unsigned long); break;
9329 case 'V': uv = va_arg(*args, UV); break;
9330 default: uv = va_arg(*args, unsigned); break;
9332 case 'q': uv = va_arg(*args, Uquad_t); break;
9337 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9339 case 'h': uv = (unsigned short)tuv; break;
9340 case 'l': uv = (unsigned long)tuv; break;
9342 default: uv = tuv; break;
9344 case 'q': uv = (Uquad_t)tuv; break;
9351 char *ptr = ebuf + sizeof ebuf;
9357 p = (char*)((c == 'X')
9358 ? "0123456789ABCDEF" : "0123456789abcdef");
9364 esignbuf[esignlen++] = '0';
9365 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9373 if (alt && *ptr != '0')
9382 esignbuf[esignlen++] = '0';
9383 esignbuf[esignlen++] = 'b';
9386 default: /* it had better be ten or less */
9390 } while (uv /= base);
9393 elen = (ebuf + sizeof ebuf) - ptr;
9397 zeros = precis - elen;
9398 else if (precis == 0 && elen == 1 && *eptr == '0')
9404 /* FLOATING POINT */
9407 c = 'f'; /* maybe %F isn't supported here */
9413 /* This is evil, but floating point is even more evil */
9415 /* for SV-style calling, we can only get NV
9416 for C-style calling, we assume %f is double;
9417 for simplicity we allow any of %Lf, %llf, %qf for long double
9421 #if defined(USE_LONG_DOUBLE)
9425 /* [perl #20339] - we should accept and ignore %lf rather than die */
9429 #if defined(USE_LONG_DOUBLE)
9430 intsize = args ? 0 : 'q';
9434 #if defined(HAS_LONG_DOUBLE)
9443 /* now we need (long double) if intsize == 'q', else (double) */
9444 nv = (args && !vectorize) ?
9445 #if LONG_DOUBLESIZE > DOUBLESIZE
9447 va_arg(*args, long double) :
9448 va_arg(*args, double)
9450 va_arg(*args, double)
9456 if (c != 'e' && c != 'E') {
9458 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9459 will cast our (long double) to (double) */
9460 (void)Perl_frexp(nv, &i);
9461 if (i == PERL_INT_MIN)
9462 Perl_die(aTHX_ "panic: frexp");
9464 need = BIT_DIGITS(i);
9466 need += has_precis ? precis : 6; /* known default */
9471 #ifdef HAS_LDBL_SPRINTF_BUG
9472 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9473 with sfio - Allen <allens@cpan.org> */
9476 # define MY_DBL_MAX DBL_MAX
9477 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9478 # if DOUBLESIZE >= 8
9479 # define MY_DBL_MAX 1.7976931348623157E+308L
9481 # define MY_DBL_MAX 3.40282347E+38L
9485 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9486 # define MY_DBL_MAX_BUG 1L
9488 # define MY_DBL_MAX_BUG MY_DBL_MAX
9492 # define MY_DBL_MIN DBL_MIN
9493 # else /* XXX guessing! -Allen */
9494 # if DOUBLESIZE >= 8
9495 # define MY_DBL_MIN 2.2250738585072014E-308L
9497 # define MY_DBL_MIN 1.17549435E-38L
9501 if ((intsize == 'q') && (c == 'f') &&
9502 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9504 /* it's going to be short enough that
9505 * long double precision is not needed */
9507 if ((nv <= 0L) && (nv >= -0L))
9508 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9510 /* would use Perl_fp_class as a double-check but not
9511 * functional on IRIX - see perl.h comments */
9513 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9514 /* It's within the range that a double can represent */
9515 #if defined(DBL_MAX) && !defined(DBL_MIN)
9516 if ((nv >= ((long double)1/DBL_MAX)) ||
9517 (nv <= (-(long double)1/DBL_MAX)))
9519 fix_ldbl_sprintf_bug = TRUE;
9522 if (fix_ldbl_sprintf_bug == TRUE) {
9532 # undef MY_DBL_MAX_BUG
9535 #endif /* HAS_LDBL_SPRINTF_BUG */
9537 need += 20; /* fudge factor */
9538 if (PL_efloatsize < need) {
9539 Safefree(PL_efloatbuf);
9540 PL_efloatsize = need + 20; /* more fudge */
9541 Newx(PL_efloatbuf, PL_efloatsize, char);
9542 PL_efloatbuf[0] = '\0';
9545 if ( !(width || left || plus || alt) && fill != '0'
9546 && has_precis && intsize != 'q' ) { /* Shortcuts */
9547 /* See earlier comment about buggy Gconvert when digits,
9549 if ( c == 'g' && precis) {
9550 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9551 /* May return an empty string for digits==0 */
9552 if (*PL_efloatbuf) {
9553 elen = strlen(PL_efloatbuf);
9554 goto float_converted;
9556 } else if ( c == 'f' && !precis) {
9557 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9562 char *ptr = ebuf + sizeof ebuf;
9565 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9566 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9567 if (intsize == 'q') {
9568 /* Copy the one or more characters in a long double
9569 * format before the 'base' ([efgEFG]) character to
9570 * the format string. */
9571 static char const prifldbl[] = PERL_PRIfldbl;
9572 char const *p = prifldbl + sizeof(prifldbl) - 3;
9573 while (p >= prifldbl) { *--ptr = *p--; }
9578 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9583 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9595 /* No taint. Otherwise we are in the strange situation
9596 * where printf() taints but print($float) doesn't.
9598 #if defined(HAS_LONG_DOUBLE)
9599 elen = ((intsize == 'q')
9600 ? my_sprintf(PL_efloatbuf, ptr, nv)
9601 : my_sprintf(PL_efloatbuf, ptr, (double)nv));
9603 elen = my_sprintf(PL_efloatbuf, ptr, nv);
9607 eptr = PL_efloatbuf;
9613 i = SvCUR(sv) - origlen;
9614 if (args && !vectorize) {
9616 case 'h': *(va_arg(*args, short*)) = i; break;
9617 default: *(va_arg(*args, int*)) = i; break;
9618 case 'l': *(va_arg(*args, long*)) = i; break;
9619 case 'V': *(va_arg(*args, IV*)) = i; break;
9621 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9626 sv_setuv_mg(argsv, (UV)i);
9628 continue; /* not "break" */
9635 && (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)
9636 && ckWARN(WARN_PRINTF))
9638 SV *msg = sv_newmortal();
9639 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9640 (PL_op->op_type == OP_PRTF) ? "" : "s");
9643 Perl_sv_catpvf(aTHX_ msg,
9644 "\"%%%c\"", c & 0xFF);
9646 Perl_sv_catpvf(aTHX_ msg,
9647 "\"%%\\%03"UVof"\"",
9650 sv_catpv(msg, "end of string");
9651 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9654 /* output mangled stuff ... */
9660 /* ... right here, because formatting flags should not apply */
9661 SvGROW(sv, SvCUR(sv) + elen + 1);
9663 Copy(eptr, p, elen, char);
9666 SvCUR_set(sv, p - SvPVX_const(sv));
9668 continue; /* not "break" */
9671 /* calculate width before utf8_upgrade changes it */
9672 have = esignlen + zeros + elen;
9674 if (is_utf8 != has_utf8) {
9677 sv_utf8_upgrade(sv);
9680 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
9681 sv_utf8_upgrade(nsv);
9682 eptr = SvPVX_const(nsv);
9685 SvGROW(sv, SvCUR(sv) + elen + 1);
9690 need = (have > width ? have : width);
9693 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9695 if (esignlen && fill == '0') {
9697 for (i = 0; i < (int)esignlen; i++)
9701 memset(p, fill, gap);
9704 if (esignlen && fill != '0') {
9706 for (i = 0; i < (int)esignlen; i++)
9711 for (i = zeros; i; i--)
9715 Copy(eptr, p, elen, char);
9719 memset(p, ' ', gap);
9724 Copy(dotstr, p, dotstrlen, char);
9728 vectorize = FALSE; /* done iterating over vecstr */
9735 SvCUR_set(sv, p - SvPVX_const(sv));
9743 /* =========================================================================
9745 =head1 Cloning an interpreter
9747 All the macros and functions in this section are for the private use of
9748 the main function, perl_clone().
9750 The foo_dup() functions make an exact copy of an existing foo thinngy.
9751 During the course of a cloning, a hash table is used to map old addresses
9752 to new addresses. The table is created and manipulated with the
9753 ptr_table_* functions.
9757 ============================================================================*/
9760 #if defined(USE_ITHREADS)
9762 #ifndef GpREFCNT_inc
9763 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9767 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9768 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9769 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9770 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9771 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9772 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9773 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9774 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9775 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9776 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9777 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9778 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9779 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9782 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9783 regcomp.c. AMS 20010712 */
9786 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
9791 struct reg_substr_datum *s;
9794 return (REGEXP *)NULL;
9796 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9799 len = r->offsets[0];
9800 npar = r->nparens+1;
9802 Newxc(ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9803 Copy(r->program, ret->program, len+1, regnode);
9805 Newx(ret->startp, npar, I32);
9806 Copy(r->startp, ret->startp, npar, I32);
9807 Newx(ret->endp, npar, I32);
9808 Copy(r->startp, ret->startp, npar, I32);
9810 Newx(ret->substrs, 1, struct reg_substr_data);
9811 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9812 s->min_offset = r->substrs->data[i].min_offset;
9813 s->max_offset = r->substrs->data[i].max_offset;
9814 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9815 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9818 ret->regstclass = NULL;
9821 const int count = r->data->count;
9824 Newxc(d, sizeof(struct reg_data) + count*sizeof(void *),
9825 char, struct reg_data);
9826 Newx(d->what, count, U8);
9829 for (i = 0; i < count; i++) {
9830 d->what[i] = r->data->what[i];
9831 switch (d->what[i]) {
9832 /* legal options are one of: sfpont
9833 see also regcomp.h and pregfree() */
9835 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9838 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9841 /* This is cheating. */
9842 Newx(d->data[i], 1, struct regnode_charclass_class);
9843 StructCopy(r->data->data[i], d->data[i],
9844 struct regnode_charclass_class);
9845 ret->regstclass = (regnode*)d->data[i];
9848 /* Compiled op trees are readonly, and can thus be
9849 shared without duplication. */
9851 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9855 d->data[i] = r->data->data[i];
9858 d->data[i] = r->data->data[i];
9860 ((reg_trie_data*)d->data[i])->refcount++;
9864 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9873 Newx(ret->offsets, 2*len+1, U32);
9874 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9876 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9877 ret->refcnt = r->refcnt;
9878 ret->minlen = r->minlen;
9879 ret->prelen = r->prelen;
9880 ret->nparens = r->nparens;
9881 ret->lastparen = r->lastparen;
9882 ret->lastcloseparen = r->lastcloseparen;
9883 ret->reganch = r->reganch;
9885 ret->sublen = r->sublen;
9887 if (RX_MATCH_COPIED(ret))
9888 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9890 ret->subbeg = Nullch;
9891 #ifdef PERL_OLD_COPY_ON_WRITE
9892 ret->saved_copy = Nullsv;
9895 ptr_table_store(PL_ptr_table, r, ret);
9899 /* duplicate a file handle */
9902 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9906 PERL_UNUSED_ARG(type);
9909 return (PerlIO*)NULL;
9911 /* look for it in the table first */
9912 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9916 /* create anew and remember what it is */
9917 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9918 ptr_table_store(PL_ptr_table, fp, ret);
9922 /* duplicate a directory handle */
9925 Perl_dirp_dup(pTHX_ DIR *dp)
9933 /* duplicate a typeglob */
9936 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9941 /* look for it in the table first */
9942 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9946 /* create anew and remember what it is */
9948 ptr_table_store(PL_ptr_table, gp, ret);
9951 ret->gp_refcnt = 0; /* must be before any other dups! */
9952 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9953 ret->gp_io = io_dup_inc(gp->gp_io, param);
9954 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9955 ret->gp_av = av_dup_inc(gp->gp_av, param);
9956 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9957 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9958 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9959 ret->gp_cvgen = gp->gp_cvgen;
9960 ret->gp_line = gp->gp_line;
9961 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9965 /* duplicate a chain of magic */
9968 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9970 MAGIC *mgprev = (MAGIC*)NULL;
9973 return (MAGIC*)NULL;
9974 /* look for it in the table first */
9975 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9979 for (; mg; mg = mg->mg_moremagic) {
9981 Newxz(nmg, 1, MAGIC);
9983 mgprev->mg_moremagic = nmg;
9986 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9987 nmg->mg_private = mg->mg_private;
9988 nmg->mg_type = mg->mg_type;
9989 nmg->mg_flags = mg->mg_flags;
9990 if (mg->mg_type == PERL_MAGIC_qr) {
9991 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9993 else if(mg->mg_type == PERL_MAGIC_backref) {
9994 const AV * const av = (AV*) mg->mg_obj;
9997 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
9999 for (i = AvFILLp(av); i >= 0; i--) {
10000 if (!svp[i]) continue;
10001 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10004 else if (mg->mg_type == PERL_MAGIC_symtab) {
10005 nmg->mg_obj = mg->mg_obj;
10008 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10009 ? sv_dup_inc(mg->mg_obj, param)
10010 : sv_dup(mg->mg_obj, param);
10012 nmg->mg_len = mg->mg_len;
10013 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10014 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10015 if (mg->mg_len > 0) {
10016 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10017 if (mg->mg_type == PERL_MAGIC_overload_table &&
10018 AMT_AMAGIC((AMT*)mg->mg_ptr))
10020 AMT *amtp = (AMT*)mg->mg_ptr;
10021 AMT *namtp = (AMT*)nmg->mg_ptr;
10023 for (i = 1; i < NofAMmeth; i++) {
10024 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10028 else if (mg->mg_len == HEf_SVKEY)
10029 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10031 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10032 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10039 /* create a new pointer-mapping table */
10042 Perl_ptr_table_new(pTHX)
10045 Newxz(tbl, 1, PTR_TBL_t);
10046 tbl->tbl_max = 511;
10047 tbl->tbl_items = 0;
10048 Newxz(tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10053 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10055 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10058 #define del_pte(p) del_body_type(p, struct ptr_tbl_ent, pte)
10060 /* map an existing pointer using a table */
10063 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
10065 PTR_TBL_ENT_t *tblent;
10066 const UV hash = PTR_TABLE_HASH(sv);
10068 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10069 for (; tblent; tblent = tblent->next) {
10070 if (tblent->oldval == sv)
10071 return tblent->newval;
10073 return (void*)NULL;
10076 /* add a new entry to a pointer-mapping table */
10079 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldsv, void *newsv)
10081 PTR_TBL_ENT_t *tblent, **otblent;
10082 /* XXX this may be pessimal on platforms where pointers aren't good
10083 * hash values e.g. if they grow faster in the most significant
10085 const UV hash = PTR_TABLE_HASH(oldsv);
10089 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10090 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10091 if (tblent->oldval == oldsv) {
10092 tblent->newval = newsv;
10096 new_body_inline(tblent, (void**)&PL_pte_arenaroot, (void**)&PL_pte_root,
10097 sizeof(struct ptr_tbl_ent));
10098 tblent->oldval = oldsv;
10099 tblent->newval = newsv;
10100 tblent->next = *otblent;
10103 if (!empty && tbl->tbl_items > tbl->tbl_max)
10104 ptr_table_split(tbl);
10107 /* double the hash bucket size of an existing ptr table */
10110 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10112 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10113 const UV oldsize = tbl->tbl_max + 1;
10114 UV newsize = oldsize * 2;
10117 Renew(ary, newsize, PTR_TBL_ENT_t*);
10118 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10119 tbl->tbl_max = --newsize;
10120 tbl->tbl_ary = ary;
10121 for (i=0; i < oldsize; i++, ary++) {
10122 PTR_TBL_ENT_t **curentp, **entp, *ent;
10125 curentp = ary + oldsize;
10126 for (entp = ary, ent = *ary; ent; ent = *entp) {
10127 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10129 ent->next = *curentp;
10139 /* remove all the entries from a ptr table */
10142 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10144 register PTR_TBL_ENT_t **array;
10145 register PTR_TBL_ENT_t *entry;
10149 if (!tbl || !tbl->tbl_items) {
10153 array = tbl->tbl_ary;
10155 max = tbl->tbl_max;
10159 PTR_TBL_ENT_t *oentry = entry;
10160 entry = entry->next;
10164 if (++riter > max) {
10167 entry = array[riter];
10171 tbl->tbl_items = 0;
10174 /* clear and free a ptr table */
10177 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10182 ptr_table_clear(tbl);
10183 Safefree(tbl->tbl_ary);
10189 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10192 SvRV_set(dstr, SvWEAKREF(sstr)
10193 ? sv_dup(SvRV(sstr), param)
10194 : sv_dup_inc(SvRV(sstr), param));
10197 else if (SvPVX_const(sstr)) {
10198 /* Has something there */
10200 /* Normal PV - clone whole allocated space */
10201 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
10202 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10203 /* Not that normal - actually sstr is copy on write.
10204 But we are a true, independant SV, so: */
10205 SvREADONLY_off(dstr);
10210 /* Special case - not normally malloced for some reason */
10211 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
10212 /* A "shared" PV - clone it as "shared" PV */
10214 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
10218 /* Some other special case - random pointer */
10219 SvPV_set(dstr, SvPVX(sstr));
10224 /* Copy the Null */
10225 if (SvTYPE(dstr) == SVt_RV)
10226 SvRV_set(dstr, NULL);
10232 /* duplicate an SV of any type (including AV, HV etc) */
10235 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10240 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10242 /* look for it in the table first */
10243 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10247 if(param->flags & CLONEf_JOIN_IN) {
10248 /** We are joining here so we don't want do clone
10249 something that is bad **/
10250 const char *hvname;
10252 if(SvTYPE(sstr) == SVt_PVHV &&
10253 (hvname = HvNAME_get(sstr))) {
10254 /** don't clone stashes if they already exist **/
10255 return (SV*)gv_stashpv(hvname,0);
10259 /* create anew and remember what it is */
10262 #ifdef DEBUG_LEAKING_SCALARS
10263 dstr->sv_debug_optype = sstr->sv_debug_optype;
10264 dstr->sv_debug_line = sstr->sv_debug_line;
10265 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10266 dstr->sv_debug_cloned = 1;
10268 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10270 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10274 ptr_table_store(PL_ptr_table, sstr, dstr);
10277 SvFLAGS(dstr) = SvFLAGS(sstr);
10278 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10279 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10282 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10283 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10284 PL_watch_pvx, SvPVX_const(sstr));
10287 /* don't clone objects whose class has asked us not to */
10288 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10289 SvFLAGS(dstr) &= ~SVTYPEMASK;
10290 SvOBJECT_off(dstr);
10294 switch (SvTYPE(sstr)) {
10296 SvANY(dstr) = NULL;
10299 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10300 SvIV_set(dstr, SvIVX(sstr));
10303 SvANY(dstr) = new_XNV();
10304 SvNV_set(dstr, SvNVX(sstr));
10307 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10308 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10312 /* These are all the types that need complex bodies allocating. */
10313 size_t new_body_length;
10314 size_t new_body_offset = 0;
10315 void **new_body_arena;
10316 void **new_body_arenaroot;
10319 switch (SvTYPE(sstr)) {
10321 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
10326 new_body = new_XPVIO();
10327 new_body_length = sizeof(XPVIO);
10330 new_body = new_XPVFM();
10331 new_body_length = sizeof(XPVFM);
10335 new_body_arena = (void **) &PL_xpvhv_root;
10336 new_body_arenaroot = (void **) &PL_xpvhv_arenaroot;
10337 new_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill)
10338 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill);
10339 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10340 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10344 new_body_arena = (void **) &PL_xpvav_root;
10345 new_body_arenaroot = (void **) &PL_xpvav_arenaroot;
10346 new_body_offset = STRUCT_OFFSET(XPVAV, xav_fill)
10347 - STRUCT_OFFSET(xpvav_allocated, xav_fill);
10348 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10349 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10353 new_body_length = sizeof(XPVBM);
10354 new_body_arena = (void **) &PL_xpvbm_root;
10355 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
10358 if (GvUNIQUE((GV*)sstr)) {
10359 /* Do sharing here. */
10361 new_body_length = sizeof(XPVGV);
10362 new_body_arena = (void **) &PL_xpvgv_root;
10363 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
10366 new_body_length = sizeof(XPVCV);
10367 new_body_arena = (void **) &PL_xpvcv_root;
10368 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
10371 new_body_length = sizeof(XPVLV);
10372 new_body_arena = (void **) &PL_xpvlv_root;
10373 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
10376 new_body_length = sizeof(XPVMG);
10377 new_body_arena = (void **) &PL_xpvmg_root;
10378 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
10381 new_body_length = sizeof(XPVNV);
10382 new_body_arena = (void **) &PL_xpvnv_root;
10383 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
10386 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
10387 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
10388 new_body_length = sizeof(XPVIV) - new_body_offset;
10389 new_body_arena = (void **) &PL_xpviv_root;
10390 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
10393 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
10394 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
10395 new_body_length = sizeof(XPV) - new_body_offset;
10396 new_body_arena = (void **) &PL_xpv_root;
10397 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
10399 assert(new_body_length);
10401 new_body_inline(new_body, new_body_arenaroot, new_body_arena,
10403 new_body = (void*)((char*)new_body - new_body_offset);
10405 /* We always allocated the full length item with PURIFY */
10406 new_body_length += new_body_offset;
10407 new_body_offset = 0;
10408 new_body = my_safemalloc(new_body_length);
10412 SvANY(dstr) = new_body;
10414 Copy(((char*)SvANY(sstr)) + new_body_offset,
10415 ((char*)SvANY(dstr)) + new_body_offset,
10416 new_body_length, char);
10418 if (SvTYPE(sstr) != SVt_PVAV && SvTYPE(sstr) != SVt_PVHV)
10419 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10421 /* The Copy above means that all the source (unduplicated) pointers
10422 are now in the destination. We can check the flags and the
10423 pointers in either, but it's possible that there's less cache
10424 missing by always going for the destination.
10425 FIXME - instrument and check that assumption */
10426 if (SvTYPE(sstr) >= SVt_PVMG) {
10428 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
10430 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
10433 switch (SvTYPE(sstr)) {
10445 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
10446 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
10447 LvTARG(dstr) = dstr;
10448 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
10449 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
10451 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
10454 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
10455 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
10456 /* Don't call sv_add_backref here as it's going to be created
10457 as part of the magic cloning of the symbol table. */
10458 GvGP(dstr) = gp_dup(GvGP(dstr), param);
10459 (void)GpREFCNT_inc(GvGP(dstr));
10462 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
10463 if (IoOFP(dstr) == IoIFP(sstr))
10464 IoOFP(dstr) = IoIFP(dstr);
10466 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
10467 /* PL_rsfp_filters entries have fake IoDIRP() */
10468 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
10469 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
10470 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
10471 /* I have no idea why fake dirp (rsfps)
10472 should be treated differently but otherwise
10473 we end up with leaks -- sky*/
10474 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
10475 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
10476 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
10478 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
10479 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
10480 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
10482 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
10483 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
10484 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
10487 if (AvARRAY((AV*)sstr)) {
10488 SV **dst_ary, **src_ary;
10489 SSize_t items = AvFILLp((AV*)sstr) + 1;
10491 src_ary = AvARRAY((AV*)sstr);
10492 Newxz(dst_ary, AvMAX((AV*)sstr)+1, SV*);
10493 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10494 SvPV_set(dstr, (char*)dst_ary);
10495 AvALLOC((AV*)dstr) = dst_ary;
10496 if (AvREAL((AV*)sstr)) {
10497 while (items-- > 0)
10498 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10501 while (items-- > 0)
10502 *dst_ary++ = sv_dup(*src_ary++, param);
10504 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10505 while (items-- > 0) {
10506 *dst_ary++ = &PL_sv_undef;
10510 SvPV_set(dstr, Nullch);
10511 AvALLOC((AV*)dstr) = (SV**)NULL;
10518 if (HvARRAY((HV*)sstr)) {
10520 const bool sharekeys = !!HvSHAREKEYS(sstr);
10521 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10522 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10524 Newx(darray, PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10525 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
10527 HvARRAY(dstr) = (HE**)darray;
10528 while (i <= sxhv->xhv_max) {
10529 const HE *source = HvARRAY(sstr)[i];
10530 HvARRAY(dstr)[i] = source
10531 ? he_dup(source, sharekeys, param) : 0;
10535 struct xpvhv_aux *saux = HvAUX(sstr);
10536 struct xpvhv_aux *daux = HvAUX(dstr);
10537 /* This flag isn't copied. */
10538 /* SvOOK_on(hv) attacks the IV flags. */
10539 SvFLAGS(dstr) |= SVf_OOK;
10541 hvname = saux->xhv_name;
10543 = hvname ? hek_dup(hvname, param) : hvname;
10545 daux->xhv_riter = saux->xhv_riter;
10546 daux->xhv_eiter = saux->xhv_eiter
10547 ? he_dup(saux->xhv_eiter,
10548 (bool)!!HvSHAREKEYS(sstr), param) : 0;
10552 SvPV_set(dstr, Nullch);
10554 /* Record stashes for possible cloning in Perl_clone(). */
10556 av_push(param->stashes, dstr);
10561 /* NOTE: not refcounted */
10562 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
10564 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
10566 if (CvCONST(dstr)) {
10567 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
10568 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
10569 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
10571 /* don't dup if copying back - CvGV isn't refcounted, so the
10572 * duped GV may never be freed. A bit of a hack! DAPM */
10573 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10574 Nullgv : gv_dup(CvGV(dstr), param) ;
10575 if (!(param->flags & CLONEf_COPY_STACKS)) {
10578 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10580 CvWEAKOUTSIDE(sstr)
10581 ? cv_dup( CvOUTSIDE(dstr), param)
10582 : cv_dup_inc(CvOUTSIDE(dstr), param);
10584 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
10590 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10596 /* duplicate a context */
10599 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10601 PERL_CONTEXT *ncxs;
10604 return (PERL_CONTEXT*)NULL;
10606 /* look for it in the table first */
10607 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10611 /* create anew and remember what it is */
10612 Newxz(ncxs, max + 1, PERL_CONTEXT);
10613 ptr_table_store(PL_ptr_table, cxs, ncxs);
10616 PERL_CONTEXT *cx = &cxs[ix];
10617 PERL_CONTEXT *ncx = &ncxs[ix];
10618 ncx->cx_type = cx->cx_type;
10619 if (CxTYPE(cx) == CXt_SUBST) {
10620 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10623 ncx->blk_oldsp = cx->blk_oldsp;
10624 ncx->blk_oldcop = cx->blk_oldcop;
10625 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10626 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10627 ncx->blk_oldpm = cx->blk_oldpm;
10628 ncx->blk_gimme = cx->blk_gimme;
10629 switch (CxTYPE(cx)) {
10631 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10632 ? cv_dup_inc(cx->blk_sub.cv, param)
10633 : cv_dup(cx->blk_sub.cv,param));
10634 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10635 ? av_dup_inc(cx->blk_sub.argarray, param)
10637 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10638 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10639 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10640 ncx->blk_sub.lval = cx->blk_sub.lval;
10641 ncx->blk_sub.retop = cx->blk_sub.retop;
10644 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10645 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10646 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10647 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10648 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10649 ncx->blk_eval.retop = cx->blk_eval.retop;
10652 ncx->blk_loop.label = cx->blk_loop.label;
10653 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10654 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10655 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10656 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10657 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10658 ? cx->blk_loop.iterdata
10659 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10660 ncx->blk_loop.oldcomppad
10661 = (PAD*)ptr_table_fetch(PL_ptr_table,
10662 cx->blk_loop.oldcomppad);
10663 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10664 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10665 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10666 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10667 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10670 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10671 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10672 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10673 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10674 ncx->blk_sub.retop = cx->blk_sub.retop;
10686 /* duplicate a stack info structure */
10689 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10694 return (PERL_SI*)NULL;
10696 /* look for it in the table first */
10697 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10701 /* create anew and remember what it is */
10702 Newxz(nsi, 1, PERL_SI);
10703 ptr_table_store(PL_ptr_table, si, nsi);
10705 nsi->si_stack = av_dup_inc(si->si_stack, param);
10706 nsi->si_cxix = si->si_cxix;
10707 nsi->si_cxmax = si->si_cxmax;
10708 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10709 nsi->si_type = si->si_type;
10710 nsi->si_prev = si_dup(si->si_prev, param);
10711 nsi->si_next = si_dup(si->si_next, param);
10712 nsi->si_markoff = si->si_markoff;
10717 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10718 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10719 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10720 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10721 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10722 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10723 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10724 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10725 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10726 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10727 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10728 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10729 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10730 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10733 #define pv_dup_inc(p) SAVEPV(p)
10734 #define pv_dup(p) SAVEPV(p)
10735 #define svp_dup_inc(p,pp) any_dup(p,pp)
10737 /* map any object to the new equivent - either something in the
10738 * ptr table, or something in the interpreter structure
10742 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
10747 return (void*)NULL;
10749 /* look for it in the table first */
10750 ret = ptr_table_fetch(PL_ptr_table, v);
10754 /* see if it is part of the interpreter structure */
10755 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10756 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10764 /* duplicate the save stack */
10767 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10769 ANY * const ss = proto_perl->Tsavestack;
10770 const I32 max = proto_perl->Tsavestack_max;
10771 I32 ix = proto_perl->Tsavestack_ix;
10783 void (*dptr) (void*);
10784 void (*dxptr) (pTHX_ void*);
10786 Newxz(nss, max, ANY);
10789 I32 i = POPINT(ss,ix);
10790 TOPINT(nss,ix) = i;
10792 case SAVEt_ITEM: /* normal string */
10793 sv = (SV*)POPPTR(ss,ix);
10794 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10795 sv = (SV*)POPPTR(ss,ix);
10796 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10798 case SAVEt_SV: /* scalar reference */
10799 sv = (SV*)POPPTR(ss,ix);
10800 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10801 gv = (GV*)POPPTR(ss,ix);
10802 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10804 case SAVEt_GENERIC_PVREF: /* generic char* */
10805 c = (char*)POPPTR(ss,ix);
10806 TOPPTR(nss,ix) = pv_dup(c);
10807 ptr = POPPTR(ss,ix);
10808 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10810 case SAVEt_SHARED_PVREF: /* char* in shared space */
10811 c = (char*)POPPTR(ss,ix);
10812 TOPPTR(nss,ix) = savesharedpv(c);
10813 ptr = POPPTR(ss,ix);
10814 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10816 case SAVEt_GENERIC_SVREF: /* generic sv */
10817 case SAVEt_SVREF: /* scalar reference */
10818 sv = (SV*)POPPTR(ss,ix);
10819 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10820 ptr = POPPTR(ss,ix);
10821 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10823 case SAVEt_AV: /* array reference */
10824 av = (AV*)POPPTR(ss,ix);
10825 TOPPTR(nss,ix) = av_dup_inc(av, param);
10826 gv = (GV*)POPPTR(ss,ix);
10827 TOPPTR(nss,ix) = gv_dup(gv, param);
10829 case SAVEt_HV: /* hash reference */
10830 hv = (HV*)POPPTR(ss,ix);
10831 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10832 gv = (GV*)POPPTR(ss,ix);
10833 TOPPTR(nss,ix) = gv_dup(gv, param);
10835 case SAVEt_INT: /* int reference */
10836 ptr = POPPTR(ss,ix);
10837 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10838 intval = (int)POPINT(ss,ix);
10839 TOPINT(nss,ix) = intval;
10841 case SAVEt_LONG: /* long reference */
10842 ptr = POPPTR(ss,ix);
10843 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10844 longval = (long)POPLONG(ss,ix);
10845 TOPLONG(nss,ix) = longval;
10847 case SAVEt_I32: /* I32 reference */
10848 case SAVEt_I16: /* I16 reference */
10849 case SAVEt_I8: /* I8 reference */
10850 ptr = POPPTR(ss,ix);
10851 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10853 TOPINT(nss,ix) = i;
10855 case SAVEt_IV: /* IV reference */
10856 ptr = POPPTR(ss,ix);
10857 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10859 TOPIV(nss,ix) = iv;
10861 case SAVEt_SPTR: /* SV* reference */
10862 ptr = POPPTR(ss,ix);
10863 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10864 sv = (SV*)POPPTR(ss,ix);
10865 TOPPTR(nss,ix) = sv_dup(sv, param);
10867 case SAVEt_VPTR: /* random* reference */
10868 ptr = POPPTR(ss,ix);
10869 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10870 ptr = POPPTR(ss,ix);
10871 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10873 case SAVEt_PPTR: /* char* reference */
10874 ptr = POPPTR(ss,ix);
10875 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10876 c = (char*)POPPTR(ss,ix);
10877 TOPPTR(nss,ix) = pv_dup(c);
10879 case SAVEt_HPTR: /* HV* reference */
10880 ptr = POPPTR(ss,ix);
10881 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10882 hv = (HV*)POPPTR(ss,ix);
10883 TOPPTR(nss,ix) = hv_dup(hv, param);
10885 case SAVEt_APTR: /* AV* reference */
10886 ptr = POPPTR(ss,ix);
10887 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10888 av = (AV*)POPPTR(ss,ix);
10889 TOPPTR(nss,ix) = av_dup(av, param);
10892 gv = (GV*)POPPTR(ss,ix);
10893 TOPPTR(nss,ix) = gv_dup(gv, param);
10895 case SAVEt_GP: /* scalar reference */
10896 gp = (GP*)POPPTR(ss,ix);
10897 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10898 (void)GpREFCNT_inc(gp);
10899 gv = (GV*)POPPTR(ss,ix);
10900 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10901 c = (char*)POPPTR(ss,ix);
10902 TOPPTR(nss,ix) = pv_dup(c);
10904 TOPIV(nss,ix) = iv;
10906 TOPIV(nss,ix) = iv;
10909 case SAVEt_MORTALIZESV:
10910 sv = (SV*)POPPTR(ss,ix);
10911 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10914 ptr = POPPTR(ss,ix);
10915 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10916 /* these are assumed to be refcounted properly */
10918 switch (((OP*)ptr)->op_type) {
10920 case OP_LEAVESUBLV:
10924 case OP_LEAVEWRITE:
10925 TOPPTR(nss,ix) = ptr;
10930 TOPPTR(nss,ix) = Nullop;
10935 TOPPTR(nss,ix) = Nullop;
10938 c = (char*)POPPTR(ss,ix);
10939 TOPPTR(nss,ix) = pv_dup_inc(c);
10941 case SAVEt_CLEARSV:
10942 longval = POPLONG(ss,ix);
10943 TOPLONG(nss,ix) = longval;
10946 hv = (HV*)POPPTR(ss,ix);
10947 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10948 c = (char*)POPPTR(ss,ix);
10949 TOPPTR(nss,ix) = pv_dup_inc(c);
10951 TOPINT(nss,ix) = i;
10953 case SAVEt_DESTRUCTOR:
10954 ptr = POPPTR(ss,ix);
10955 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10956 dptr = POPDPTR(ss,ix);
10957 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
10958 any_dup(FPTR2DPTR(void *, dptr),
10961 case SAVEt_DESTRUCTOR_X:
10962 ptr = POPPTR(ss,ix);
10963 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10964 dxptr = POPDXPTR(ss,ix);
10965 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
10966 any_dup(FPTR2DPTR(void *, dxptr),
10969 case SAVEt_REGCONTEXT:
10972 TOPINT(nss,ix) = i;
10975 case SAVEt_STACK_POS: /* Position on Perl stack */
10977 TOPINT(nss,ix) = i;
10979 case SAVEt_AELEM: /* array element */
10980 sv = (SV*)POPPTR(ss,ix);
10981 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10983 TOPINT(nss,ix) = i;
10984 av = (AV*)POPPTR(ss,ix);
10985 TOPPTR(nss,ix) = av_dup_inc(av, param);
10987 case SAVEt_HELEM: /* hash element */
10988 sv = (SV*)POPPTR(ss,ix);
10989 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10990 sv = (SV*)POPPTR(ss,ix);
10991 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10992 hv = (HV*)POPPTR(ss,ix);
10993 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10996 ptr = POPPTR(ss,ix);
10997 TOPPTR(nss,ix) = ptr;
11001 TOPINT(nss,ix) = i;
11003 case SAVEt_COMPPAD:
11004 av = (AV*)POPPTR(ss,ix);
11005 TOPPTR(nss,ix) = av_dup(av, param);
11008 longval = (long)POPLONG(ss,ix);
11009 TOPLONG(nss,ix) = longval;
11010 ptr = POPPTR(ss,ix);
11011 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11012 sv = (SV*)POPPTR(ss,ix);
11013 TOPPTR(nss,ix) = sv_dup(sv, param);
11016 ptr = POPPTR(ss,ix);
11017 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11018 longval = (long)POPBOOL(ss,ix);
11019 TOPBOOL(nss,ix) = (bool)longval;
11021 case SAVEt_SET_SVFLAGS:
11023 TOPINT(nss,ix) = i;
11025 TOPINT(nss,ix) = i;
11026 sv = (SV*)POPPTR(ss,ix);
11027 TOPPTR(nss,ix) = sv_dup(sv, param);
11030 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11038 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11039 * flag to the result. This is done for each stash before cloning starts,
11040 * so we know which stashes want their objects cloned */
11043 do_mark_cloneable_stash(pTHX_ SV *sv)
11045 const HEK * const hvname = HvNAME_HEK((HV*)sv);
11047 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11048 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11049 if (cloner && GvCV(cloner)) {
11056 XPUSHs(sv_2mortal(newSVhek(hvname)));
11058 call_sv((SV*)GvCV(cloner), G_SCALAR);
11065 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11073 =for apidoc perl_clone
11075 Create and return a new interpreter by cloning the current one.
11077 perl_clone takes these flags as parameters:
11079 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11080 without it we only clone the data and zero the stacks,
11081 with it we copy the stacks and the new perl interpreter is
11082 ready to run at the exact same point as the previous one.
11083 The pseudo-fork code uses COPY_STACKS while the
11084 threads->new doesn't.
11086 CLONEf_KEEP_PTR_TABLE
11087 perl_clone keeps a ptr_table with the pointer of the old
11088 variable as a key and the new variable as a value,
11089 this allows it to check if something has been cloned and not
11090 clone it again but rather just use the value and increase the
11091 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11092 the ptr_table using the function
11093 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11094 reason to keep it around is if you want to dup some of your own
11095 variable who are outside the graph perl scans, example of this
11096 code is in threads.xs create
11099 This is a win32 thing, it is ignored on unix, it tells perls
11100 win32host code (which is c++) to clone itself, this is needed on
11101 win32 if you want to run two threads at the same time,
11102 if you just want to do some stuff in a separate perl interpreter
11103 and then throw it away and return to the original one,
11104 you don't need to do anything.
11109 /* XXX the above needs expanding by someone who actually understands it ! */
11110 EXTERN_C PerlInterpreter *
11111 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11114 perl_clone(PerlInterpreter *proto_perl, UV flags)
11117 #ifdef PERL_IMPLICIT_SYS
11119 /* perlhost.h so we need to call into it
11120 to clone the host, CPerlHost should have a c interface, sky */
11122 if (flags & CLONEf_CLONE_HOST) {
11123 return perl_clone_host(proto_perl,flags);
11125 return perl_clone_using(proto_perl, flags,
11127 proto_perl->IMemShared,
11128 proto_perl->IMemParse,
11130 proto_perl->IStdIO,
11134 proto_perl->IProc);
11138 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11139 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11140 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11141 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11142 struct IPerlDir* ipD, struct IPerlSock* ipS,
11143 struct IPerlProc* ipP)
11145 /* XXX many of the string copies here can be optimized if they're
11146 * constants; they need to be allocated as common memory and just
11147 * their pointers copied. */
11150 CLONE_PARAMS clone_params;
11151 CLONE_PARAMS* param = &clone_params;
11153 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11154 /* for each stash, determine whether its objects should be cloned */
11155 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11156 PERL_SET_THX(my_perl);
11159 Poison(my_perl, 1, PerlInterpreter);
11161 PL_curcop = (COP *)Nullop;
11165 PL_savestack_ix = 0;
11166 PL_savestack_max = -1;
11167 PL_sig_pending = 0;
11168 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11169 # else /* !DEBUGGING */
11170 Zero(my_perl, 1, PerlInterpreter);
11171 # endif /* DEBUGGING */
11173 /* host pointers */
11175 PL_MemShared = ipMS;
11176 PL_MemParse = ipMP;
11183 #else /* !PERL_IMPLICIT_SYS */
11185 CLONE_PARAMS clone_params;
11186 CLONE_PARAMS* param = &clone_params;
11187 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11188 /* for each stash, determine whether its objects should be cloned */
11189 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11190 PERL_SET_THX(my_perl);
11193 Poison(my_perl, 1, PerlInterpreter);
11195 PL_curcop = (COP *)Nullop;
11199 PL_savestack_ix = 0;
11200 PL_savestack_max = -1;
11201 PL_sig_pending = 0;
11202 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11203 # else /* !DEBUGGING */
11204 Zero(my_perl, 1, PerlInterpreter);
11205 # endif /* DEBUGGING */
11206 #endif /* PERL_IMPLICIT_SYS */
11207 param->flags = flags;
11208 param->proto_perl = proto_perl;
11211 PL_xnv_arenaroot = NULL;
11212 PL_xnv_root = NULL;
11213 PL_xpv_arenaroot = NULL;
11214 PL_xpv_root = NULL;
11215 PL_xpviv_arenaroot = NULL;
11216 PL_xpviv_root = NULL;
11217 PL_xpvnv_arenaroot = NULL;
11218 PL_xpvnv_root = NULL;
11219 PL_xpvcv_arenaroot = NULL;
11220 PL_xpvcv_root = NULL;
11221 PL_xpvav_arenaroot = NULL;
11222 PL_xpvav_root = NULL;
11223 PL_xpvhv_arenaroot = NULL;
11224 PL_xpvhv_root = NULL;
11225 PL_xpvmg_arenaroot = NULL;
11226 PL_xpvmg_root = NULL;
11227 PL_xpvgv_arenaroot = NULL;
11228 PL_xpvgv_root = NULL;
11229 PL_xpvlv_arenaroot = NULL;
11230 PL_xpvlv_root = NULL;
11231 PL_xpvbm_arenaroot = NULL;
11232 PL_xpvbm_root = NULL;
11233 PL_he_arenaroot = NULL;
11235 #if defined(USE_ITHREADS)
11236 PL_pte_arenaroot = NULL;
11237 PL_pte_root = NULL;
11239 PL_nice_chunk = NULL;
11240 PL_nice_chunk_size = 0;
11242 PL_sv_objcount = 0;
11243 PL_sv_root = Nullsv;
11244 PL_sv_arenaroot = Nullsv;
11246 PL_debug = proto_perl->Idebug;
11248 PL_hash_seed = proto_perl->Ihash_seed;
11249 PL_rehash_seed = proto_perl->Irehash_seed;
11251 #ifdef USE_REENTRANT_API
11252 /* XXX: things like -Dm will segfault here in perlio, but doing
11253 * PERL_SET_CONTEXT(proto_perl);
11254 * breaks too many other things
11256 Perl_reentrant_init(aTHX);
11259 /* create SV map for pointer relocation */
11260 PL_ptr_table = ptr_table_new();
11262 /* initialize these special pointers as early as possible */
11263 SvANY(&PL_sv_undef) = NULL;
11264 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11265 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11266 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11268 SvANY(&PL_sv_no) = new_XPVNV();
11269 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11270 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11271 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11272 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11273 SvCUR_set(&PL_sv_no, 0);
11274 SvLEN_set(&PL_sv_no, 1);
11275 SvIV_set(&PL_sv_no, 0);
11276 SvNV_set(&PL_sv_no, 0);
11277 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11279 SvANY(&PL_sv_yes) = new_XPVNV();
11280 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11281 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11282 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11283 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11284 SvCUR_set(&PL_sv_yes, 1);
11285 SvLEN_set(&PL_sv_yes, 2);
11286 SvIV_set(&PL_sv_yes, 1);
11287 SvNV_set(&PL_sv_yes, 1);
11288 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11290 /* create (a non-shared!) shared string table */
11291 PL_strtab = newHV();
11292 HvSHAREKEYS_off(PL_strtab);
11293 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11294 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11296 PL_compiling = proto_perl->Icompiling;
11298 /* These two PVs will be free'd special way so must set them same way op.c does */
11299 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11300 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11302 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11303 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11305 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11306 if (!specialWARN(PL_compiling.cop_warnings))
11307 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11308 if (!specialCopIO(PL_compiling.cop_io))
11309 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11310 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11312 /* pseudo environmental stuff */
11313 PL_origargc = proto_perl->Iorigargc;
11314 PL_origargv = proto_perl->Iorigargv;
11316 param->stashes = newAV(); /* Setup array of objects to call clone on */
11318 /* Set tainting stuff before PerlIO_debug can possibly get called */
11319 PL_tainting = proto_perl->Itainting;
11320 PL_taint_warn = proto_perl->Itaint_warn;
11322 #ifdef PERLIO_LAYERS
11323 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11324 PerlIO_clone(aTHX_ proto_perl, param);
11327 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11328 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11329 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11330 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11331 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11332 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11335 PL_minus_c = proto_perl->Iminus_c;
11336 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11337 PL_localpatches = proto_perl->Ilocalpatches;
11338 PL_splitstr = proto_perl->Isplitstr;
11339 PL_preprocess = proto_perl->Ipreprocess;
11340 PL_minus_n = proto_perl->Iminus_n;
11341 PL_minus_p = proto_perl->Iminus_p;
11342 PL_minus_l = proto_perl->Iminus_l;
11343 PL_minus_a = proto_perl->Iminus_a;
11344 PL_minus_F = proto_perl->Iminus_F;
11345 PL_doswitches = proto_perl->Idoswitches;
11346 PL_dowarn = proto_perl->Idowarn;
11347 PL_doextract = proto_perl->Idoextract;
11348 PL_sawampersand = proto_perl->Isawampersand;
11349 PL_unsafe = proto_perl->Iunsafe;
11350 PL_inplace = SAVEPV(proto_perl->Iinplace);
11351 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11352 PL_perldb = proto_perl->Iperldb;
11353 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11354 PL_exit_flags = proto_perl->Iexit_flags;
11356 /* magical thingies */
11357 /* XXX time(&PL_basetime) when asked for? */
11358 PL_basetime = proto_perl->Ibasetime;
11359 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11361 PL_maxsysfd = proto_perl->Imaxsysfd;
11362 PL_multiline = proto_perl->Imultiline;
11363 PL_statusvalue = proto_perl->Istatusvalue;
11365 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11367 PL_statusvalue_posix = proto_perl->Istatusvalue_posix;
11369 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11371 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11372 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11373 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11375 /* Clone the regex array */
11376 PL_regex_padav = newAV();
11378 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11379 SV** const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11381 av_push(PL_regex_padav,
11382 sv_dup_inc(regexen[0],param));
11383 for(i = 1; i <= len; i++) {
11384 if(SvREPADTMP(regexen[i])) {
11385 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11387 av_push(PL_regex_padav,
11389 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11390 SvIVX(regexen[i])), param)))
11395 PL_regex_pad = AvARRAY(PL_regex_padav);
11397 /* shortcuts to various I/O objects */
11398 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11399 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11400 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11401 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11402 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11403 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11405 /* shortcuts to regexp stuff */
11406 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11408 /* shortcuts to misc objects */
11409 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11411 /* shortcuts to debugging objects */
11412 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11413 PL_DBline = gv_dup(proto_perl->IDBline, param);
11414 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11415 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11416 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11417 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11418 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11419 PL_lineary = av_dup(proto_perl->Ilineary, param);
11420 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11422 /* symbol tables */
11423 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11424 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11425 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11426 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11427 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11429 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11430 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11431 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11432 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11433 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11434 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11436 PL_sub_generation = proto_perl->Isub_generation;
11438 /* funky return mechanisms */
11439 PL_forkprocess = proto_perl->Iforkprocess;
11441 /* subprocess state */
11442 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11444 /* internal state */
11445 PL_maxo = proto_perl->Imaxo;
11446 if (proto_perl->Iop_mask)
11447 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11449 PL_op_mask = Nullch;
11450 /* PL_asserting = proto_perl->Iasserting; */
11452 /* current interpreter roots */
11453 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11454 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11455 PL_main_start = proto_perl->Imain_start;
11456 PL_eval_root = proto_perl->Ieval_root;
11457 PL_eval_start = proto_perl->Ieval_start;
11459 /* runtime control stuff */
11460 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11461 PL_copline = proto_perl->Icopline;
11463 PL_filemode = proto_perl->Ifilemode;
11464 PL_lastfd = proto_perl->Ilastfd;
11465 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11468 PL_gensym = proto_perl->Igensym;
11469 PL_preambled = proto_perl->Ipreambled;
11470 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11471 PL_laststatval = proto_perl->Ilaststatval;
11472 PL_laststype = proto_perl->Ilaststype;
11473 PL_mess_sv = Nullsv;
11475 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11477 /* interpreter atexit processing */
11478 PL_exitlistlen = proto_perl->Iexitlistlen;
11479 if (PL_exitlistlen) {
11480 Newx(PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11481 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11484 PL_exitlist = (PerlExitListEntry*)NULL;
11485 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11486 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11487 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11489 PL_profiledata = NULL;
11490 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11491 /* PL_rsfp_filters entries have fake IoDIRP() */
11492 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11494 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11496 PAD_CLONE_VARS(proto_perl, param);
11498 #ifdef HAVE_INTERP_INTERN
11499 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11502 /* more statics moved here */
11503 PL_generation = proto_perl->Igeneration;
11504 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11506 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11507 PL_in_clean_all = proto_perl->Iin_clean_all;
11509 PL_uid = proto_perl->Iuid;
11510 PL_euid = proto_perl->Ieuid;
11511 PL_gid = proto_perl->Igid;
11512 PL_egid = proto_perl->Iegid;
11513 PL_nomemok = proto_perl->Inomemok;
11514 PL_an = proto_perl->Ian;
11515 PL_evalseq = proto_perl->Ievalseq;
11516 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11517 PL_origalen = proto_perl->Iorigalen;
11518 #ifdef PERL_USES_PL_PIDSTATUS
11519 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11521 PL_osname = SAVEPV(proto_perl->Iosname);
11522 PL_sighandlerp = proto_perl->Isighandlerp;
11524 PL_runops = proto_perl->Irunops;
11526 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11529 PL_cshlen = proto_perl->Icshlen;
11530 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11533 PL_lex_state = proto_perl->Ilex_state;
11534 PL_lex_defer = proto_perl->Ilex_defer;
11535 PL_lex_expect = proto_perl->Ilex_expect;
11536 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11537 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11538 PL_lex_starts = proto_perl->Ilex_starts;
11539 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11540 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11541 PL_lex_op = proto_perl->Ilex_op;
11542 PL_lex_inpat = proto_perl->Ilex_inpat;
11543 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11544 PL_lex_brackets = proto_perl->Ilex_brackets;
11545 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11546 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11547 PL_lex_casemods = proto_perl->Ilex_casemods;
11548 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11549 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11551 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11552 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11553 PL_nexttoke = proto_perl->Inexttoke;
11555 /* XXX This is probably masking the deeper issue of why
11556 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11557 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11558 * (A little debugging with a watchpoint on it may help.)
11560 if (SvANY(proto_perl->Ilinestr)) {
11561 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11562 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11563 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11564 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11565 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11566 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11567 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11568 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11569 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11572 PL_linestr = NEWSV(65,79);
11573 sv_upgrade(PL_linestr,SVt_PVIV);
11574 sv_setpvn(PL_linestr,"",0);
11575 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11577 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11578 PL_pending_ident = proto_perl->Ipending_ident;
11579 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11581 PL_expect = proto_perl->Iexpect;
11583 PL_multi_start = proto_perl->Imulti_start;
11584 PL_multi_end = proto_perl->Imulti_end;
11585 PL_multi_open = proto_perl->Imulti_open;
11586 PL_multi_close = proto_perl->Imulti_close;
11588 PL_error_count = proto_perl->Ierror_count;
11589 PL_subline = proto_perl->Isubline;
11590 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11592 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11593 if (SvANY(proto_perl->Ilinestr)) {
11594 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11595 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11596 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11597 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11598 PL_last_lop_op = proto_perl->Ilast_lop_op;
11601 PL_last_uni = SvPVX(PL_linestr);
11602 PL_last_lop = SvPVX(PL_linestr);
11603 PL_last_lop_op = 0;
11605 PL_in_my = proto_perl->Iin_my;
11606 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11608 PL_cryptseen = proto_perl->Icryptseen;
11611 PL_hints = proto_perl->Ihints;
11613 PL_amagic_generation = proto_perl->Iamagic_generation;
11615 #ifdef USE_LOCALE_COLLATE
11616 PL_collation_ix = proto_perl->Icollation_ix;
11617 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11618 PL_collation_standard = proto_perl->Icollation_standard;
11619 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11620 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11621 #endif /* USE_LOCALE_COLLATE */
11623 #ifdef USE_LOCALE_NUMERIC
11624 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11625 PL_numeric_standard = proto_perl->Inumeric_standard;
11626 PL_numeric_local = proto_perl->Inumeric_local;
11627 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11628 #endif /* !USE_LOCALE_NUMERIC */
11630 /* utf8 character classes */
11631 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11632 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11633 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11634 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11635 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11636 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11637 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11638 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11639 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11640 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11641 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11642 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11643 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11644 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11645 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11646 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11647 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11648 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11649 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11650 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11652 /* Did the locale setup indicate UTF-8? */
11653 PL_utf8locale = proto_perl->Iutf8locale;
11654 /* Unicode features (see perlrun/-C) */
11655 PL_unicode = proto_perl->Iunicode;
11657 /* Pre-5.8 signals control */
11658 PL_signals = proto_perl->Isignals;
11660 /* times() ticks per second */
11661 PL_clocktick = proto_perl->Iclocktick;
11663 /* Recursion stopper for PerlIO_find_layer */
11664 PL_in_load_module = proto_perl->Iin_load_module;
11666 /* sort() routine */
11667 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11669 /* Not really needed/useful since the reenrant_retint is "volatile",
11670 * but do it for consistency's sake. */
11671 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11673 /* Hooks to shared SVs and locks. */
11674 PL_sharehook = proto_perl->Isharehook;
11675 PL_lockhook = proto_perl->Ilockhook;
11676 PL_unlockhook = proto_perl->Iunlockhook;
11677 PL_threadhook = proto_perl->Ithreadhook;
11679 PL_runops_std = proto_perl->Irunops_std;
11680 PL_runops_dbg = proto_perl->Irunops_dbg;
11682 #ifdef THREADS_HAVE_PIDS
11683 PL_ppid = proto_perl->Ippid;
11687 PL_last_swash_hv = Nullhv; /* reinits on demand */
11688 PL_last_swash_klen = 0;
11689 PL_last_swash_key[0]= '\0';
11690 PL_last_swash_tmps = (U8*)NULL;
11691 PL_last_swash_slen = 0;
11693 PL_glob_index = proto_perl->Iglob_index;
11694 PL_srand_called = proto_perl->Isrand_called;
11695 PL_uudmap['M'] = 0; /* reinits on demand */
11696 PL_bitcount = Nullch; /* reinits on demand */
11698 if (proto_perl->Ipsig_pend) {
11699 Newxz(PL_psig_pend, SIG_SIZE, int);
11702 PL_psig_pend = (int*)NULL;
11705 if (proto_perl->Ipsig_ptr) {
11706 Newxz(PL_psig_ptr, SIG_SIZE, SV*);
11707 Newxz(PL_psig_name, SIG_SIZE, SV*);
11708 for (i = 1; i < SIG_SIZE; i++) {
11709 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11710 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11714 PL_psig_ptr = (SV**)NULL;
11715 PL_psig_name = (SV**)NULL;
11718 /* thrdvar.h stuff */
11720 if (flags & CLONEf_COPY_STACKS) {
11721 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11722 PL_tmps_ix = proto_perl->Ttmps_ix;
11723 PL_tmps_max = proto_perl->Ttmps_max;
11724 PL_tmps_floor = proto_perl->Ttmps_floor;
11725 Newxz(PL_tmps_stack, PL_tmps_max, SV*);
11727 while (i <= PL_tmps_ix) {
11728 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11732 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11733 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11734 Newxz(PL_markstack, i, I32);
11735 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11736 - proto_perl->Tmarkstack);
11737 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11738 - proto_perl->Tmarkstack);
11739 Copy(proto_perl->Tmarkstack, PL_markstack,
11740 PL_markstack_ptr - PL_markstack + 1, I32);
11742 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11743 * NOTE: unlike the others! */
11744 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11745 PL_scopestack_max = proto_perl->Tscopestack_max;
11746 Newxz(PL_scopestack, PL_scopestack_max, I32);
11747 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11749 /* NOTE: si_dup() looks at PL_markstack */
11750 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11752 /* PL_curstack = PL_curstackinfo->si_stack; */
11753 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11754 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11756 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11757 PL_stack_base = AvARRAY(PL_curstack);
11758 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11759 - proto_perl->Tstack_base);
11760 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11762 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11763 * NOTE: unlike the others! */
11764 PL_savestack_ix = proto_perl->Tsavestack_ix;
11765 PL_savestack_max = proto_perl->Tsavestack_max;
11766 /*Newxz(PL_savestack, PL_savestack_max, ANY);*/
11767 PL_savestack = ss_dup(proto_perl, param);
11771 ENTER; /* perl_destruct() wants to LEAVE; */
11774 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11775 PL_top_env = &PL_start_env;
11777 PL_op = proto_perl->Top;
11780 PL_Xpv = (XPV*)NULL;
11781 PL_na = proto_perl->Tna;
11783 PL_statbuf = proto_perl->Tstatbuf;
11784 PL_statcache = proto_perl->Tstatcache;
11785 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11786 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11788 PL_timesbuf = proto_perl->Ttimesbuf;
11791 PL_tainted = proto_perl->Ttainted;
11792 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11793 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11794 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11795 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11796 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11797 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11798 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11799 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11800 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11802 PL_restartop = proto_perl->Trestartop;
11803 PL_in_eval = proto_perl->Tin_eval;
11804 PL_delaymagic = proto_perl->Tdelaymagic;
11805 PL_dirty = proto_perl->Tdirty;
11806 PL_localizing = proto_perl->Tlocalizing;
11808 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11809 PL_hv_fetch_ent_mh = Nullhe;
11810 PL_modcount = proto_perl->Tmodcount;
11811 PL_lastgotoprobe = Nullop;
11812 PL_dumpindent = proto_perl->Tdumpindent;
11814 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11815 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11816 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11817 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11818 PL_sortcxix = proto_perl->Tsortcxix;
11819 PL_efloatbuf = Nullch; /* reinits on demand */
11820 PL_efloatsize = 0; /* reinits on demand */
11824 PL_screamfirst = NULL;
11825 PL_screamnext = NULL;
11826 PL_maxscream = -1; /* reinits on demand */
11827 PL_lastscream = Nullsv;
11829 PL_watchaddr = NULL;
11830 PL_watchok = Nullch;
11832 PL_regdummy = proto_perl->Tregdummy;
11833 PL_regprecomp = Nullch;
11836 PL_colorset = 0; /* reinits PL_colors[] */
11837 /*PL_colors[6] = {0,0,0,0,0,0};*/
11838 PL_reginput = Nullch;
11839 PL_regbol = Nullch;
11840 PL_regeol = Nullch;
11841 PL_regstartp = (I32*)NULL;
11842 PL_regendp = (I32*)NULL;
11843 PL_reglastparen = (U32*)NULL;
11844 PL_reglastcloseparen = (U32*)NULL;
11845 PL_regtill = Nullch;
11846 PL_reg_start_tmp = (char**)NULL;
11847 PL_reg_start_tmpl = 0;
11848 PL_regdata = (struct reg_data*)NULL;
11851 PL_reg_eval_set = 0;
11853 PL_regprogram = (regnode*)NULL;
11855 PL_regcc = (CURCUR*)NULL;
11856 PL_reg_call_cc = (struct re_cc_state*)NULL;
11857 PL_reg_re = (regexp*)NULL;
11858 PL_reg_ganch = Nullch;
11859 PL_reg_sv = Nullsv;
11860 PL_reg_match_utf8 = FALSE;
11861 PL_reg_magic = (MAGIC*)NULL;
11863 PL_reg_oldcurpm = (PMOP*)NULL;
11864 PL_reg_curpm = (PMOP*)NULL;
11865 PL_reg_oldsaved = Nullch;
11866 PL_reg_oldsavedlen = 0;
11867 #ifdef PERL_OLD_COPY_ON_WRITE
11870 PL_reg_maxiter = 0;
11871 PL_reg_leftiter = 0;
11872 PL_reg_poscache = Nullch;
11873 PL_reg_poscache_size= 0;
11875 /* RE engine - function pointers */
11876 PL_regcompp = proto_perl->Tregcompp;
11877 PL_regexecp = proto_perl->Tregexecp;
11878 PL_regint_start = proto_perl->Tregint_start;
11879 PL_regint_string = proto_perl->Tregint_string;
11880 PL_regfree = proto_perl->Tregfree;
11882 PL_reginterp_cnt = 0;
11883 PL_reg_starttry = 0;
11885 /* Pluggable optimizer */
11886 PL_peepp = proto_perl->Tpeepp;
11888 PL_stashcache = newHV();
11890 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11891 ptr_table_free(PL_ptr_table);
11892 PL_ptr_table = NULL;
11895 /* Call the ->CLONE method, if it exists, for each of the stashes
11896 identified by sv_dup() above.
11898 while(av_len(param->stashes) != -1) {
11899 HV* const stash = (HV*) av_shift(param->stashes);
11900 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11901 if (cloner && GvCV(cloner)) {
11906 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
11908 call_sv((SV*)GvCV(cloner), G_DISCARD);
11914 SvREFCNT_dec(param->stashes);
11916 /* orphaned? eg threads->new inside BEGIN or use */
11917 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
11918 (void)SvREFCNT_inc(PL_compcv);
11919 SAVEFREESV(PL_compcv);
11925 #endif /* USE_ITHREADS */
11928 =head1 Unicode Support
11930 =for apidoc sv_recode_to_utf8
11932 The encoding is assumed to be an Encode object, on entry the PV
11933 of the sv is assumed to be octets in that encoding, and the sv
11934 will be converted into Unicode (and UTF-8).
11936 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11937 is not a reference, nothing is done to the sv. If the encoding is not
11938 an C<Encode::XS> Encoding object, bad things will happen.
11939 (See F<lib/encoding.pm> and L<Encode>).
11941 The PV of the sv is returned.
11946 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11949 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11963 Passing sv_yes is wrong - it needs to be or'ed set of constants
11964 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11965 remove converted chars from source.
11967 Both will default the value - let them.
11969 XPUSHs(&PL_sv_yes);
11972 call_method("decode", G_SCALAR);
11976 s = SvPV_const(uni, len);
11977 if (s != SvPVX_const(sv)) {
11978 SvGROW(sv, len + 1);
11979 Move(s, SvPVX(sv), len + 1, char);
11980 SvCUR_set(sv, len);
11987 return SvPOKp(sv) ? SvPVX(sv) : NULL;
11991 =for apidoc sv_cat_decode
11993 The encoding is assumed to be an Encode object, the PV of the ssv is
11994 assumed to be octets in that encoding and decoding the input starts
11995 from the position which (PV + *offset) pointed to. The dsv will be
11996 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11997 when the string tstr appears in decoding output or the input ends on
11998 the PV of the ssv. The value which the offset points will be modified
11999 to the last input position on the ssv.
12001 Returns TRUE if the terminator was found, else returns FALSE.
12006 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12007 SV *ssv, int *offset, char *tstr, int tlen)
12011 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12022 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12023 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12025 call_method("cat_decode", G_SCALAR);
12027 ret = SvTRUE(TOPs);
12028 *offset = SvIV(offsv);
12034 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12040 * c-indentation-style: bsd
12041 * c-basic-offset: 4
12042 * indent-tabs-mode: t
12045 * ex: set ts=8 sts=4 sw=4 noet: