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 #ifdef DEBUG_LEAKING_SCALARS
171 # define FREE_SV_DEBUG_FILE(sv) PerlMemfree((sv)->sv_debug_file)
173 # define FREE_SV_DEBUG_FILE(sv) PerlMemShared_free((sv)->sv_debug_file)
176 # define FREE_SV_DEBUG_FILE(sv)
179 #define plant_SV(p) \
181 FREE_SV_DEBUG_FILE(p); \
182 SvANY(p) = (void *)PL_sv_root; \
183 SvFLAGS(p) = SVTYPEMASK; \
188 /* sv_mutex must be held while calling uproot_SV() */
189 #define uproot_SV(p) \
192 PL_sv_root = (SV*)SvANY(p); \
197 /* make some more SVs by adding another arena */
199 /* sv_mutex must be held while calling more_sv() */
206 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
207 PL_nice_chunk = Nullch;
208 PL_nice_chunk_size = 0;
211 char *chunk; /* must use New here to match call to */
212 New(704,chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
213 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
219 /* new_SV(): return a new, empty SV head */
221 #ifdef DEBUG_LEAKING_SCALARS
222 /* provide a real function for a debugger to play with */
232 sv = S_more_sv(aTHX);
237 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
238 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
239 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
240 sv->sv_debug_inpad = 0;
241 sv->sv_debug_cloned = 0;
243 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
245 sv->sv_debug_file = PL_curcop ? savesharedpv(CopFILE(PL_curcop)): NULL;
250 # define new_SV(p) (p)=S_new_SV(aTHX)
259 (p) = S_more_sv(aTHX); \
268 /* del_SV(): return an empty SV head to the free list */
283 S_del_sv(pTHX_ SV *p)
288 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
290 SV *svend = &sva[SvREFCNT(sva)];
291 if (p >= sv && p < svend) {
297 if (ckWARN_d(WARN_INTERNAL))
298 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
299 "Attempt to free non-arena SV: 0x%"UVxf
300 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
307 #else /* ! DEBUGGING */
309 #define del_SV(p) plant_SV(p)
311 #endif /* DEBUGGING */
315 =head1 SV Manipulation Functions
317 =for apidoc sv_add_arena
319 Given a chunk of memory, link it to the head of the list of arenas,
320 and split it into a list of free SVs.
326 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
332 /* The first SV in an arena isn't an SV. */
333 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
334 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
335 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
337 PL_sv_arenaroot = sva;
338 PL_sv_root = sva + 1;
340 svend = &sva[SvREFCNT(sva) - 1];
343 SvANY(sv) = (void *)(SV*)(sv + 1);
347 /* Must always set typemask because it's awlays checked in on cleanup
348 when the arenas are walked looking for objects. */
349 SvFLAGS(sv) = SVTYPEMASK;
356 SvFLAGS(sv) = SVTYPEMASK;
359 /* visit(): call the named function for each non-free SV in the arenas
360 * whose flags field matches the flags/mask args. */
363 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
368 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
369 register SV * const svend = &sva[SvREFCNT(sva)];
371 for (sv = sva + 1; sv < svend; ++sv) {
372 if (SvTYPE(sv) != SVTYPEMASK
373 && (sv->sv_flags & mask) == flags
386 /* called by sv_report_used() for each live SV */
389 do_report_used(pTHX_ SV *sv)
391 if (SvTYPE(sv) != SVTYPEMASK) {
392 PerlIO_printf(Perl_debug_log, "****\n");
399 =for apidoc sv_report_used
401 Dump the contents of all SVs not yet freed. (Debugging aid).
407 Perl_sv_report_used(pTHX)
410 visit(do_report_used, 0, 0);
414 /* called by sv_clean_objs() for each live SV */
417 do_clean_objs(pTHX_ SV *sv)
421 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
422 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
434 /* XXX Might want to check arrays, etc. */
437 /* called by sv_clean_objs() for each live SV */
439 #ifndef DISABLE_DESTRUCTOR_KLUDGE
441 do_clean_named_objs(pTHX_ SV *sv)
443 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
444 if ( SvOBJECT(GvSV(sv)) ||
445 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
446 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
447 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
448 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
450 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
451 SvFLAGS(sv) |= SVf_BREAK;
459 =for apidoc sv_clean_objs
461 Attempt to destroy all objects not yet freed
467 Perl_sv_clean_objs(pTHX)
469 PL_in_clean_objs = TRUE;
470 visit(do_clean_objs, SVf_ROK, SVf_ROK);
471 #ifndef DISABLE_DESTRUCTOR_KLUDGE
472 /* some barnacles may yet remain, clinging to typeglobs */
473 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
475 PL_in_clean_objs = FALSE;
478 /* called by sv_clean_all() for each live SV */
481 do_clean_all(pTHX_ SV *sv)
483 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
484 SvFLAGS(sv) |= SVf_BREAK;
485 if (PL_comppad == (AV*)sv) {
487 PL_curpad = Null(SV**);
493 =for apidoc sv_clean_all
495 Decrement the refcnt of each remaining SV, possibly triggering a
496 cleanup. This function may have to be called multiple times to free
497 SVs which are in complex self-referential hierarchies.
503 Perl_sv_clean_all(pTHX)
506 PL_in_clean_all = TRUE;
507 cleaned = visit(do_clean_all, 0,0);
508 PL_in_clean_all = FALSE;
513 =for apidoc sv_free_arenas
515 Deallocate the memory used by all arenas. Note that all the individual SV
516 heads and bodies within the arenas must already have been freed.
522 Perl_sv_free_arenas(pTHX)
526 void *arena, *arenanext;
528 /* Free arenas here, but be careful about fake ones. (We assume
529 contiguity of the fake ones with the corresponding real ones.) */
531 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
532 svanext = (SV*) SvANY(sva);
533 while (svanext && SvFAKE(svanext))
534 svanext = (SV*) SvANY(svanext);
540 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
541 arenanext = *(void **)arena;
544 PL_xnv_arenaroot = 0;
547 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
548 arenanext = *(void **)arena;
551 PL_xpv_arenaroot = 0;
554 for (arena = PL_xpviv_arenaroot; arena; arena = arenanext) {
555 arenanext = *(void **)arena;
558 PL_xpviv_arenaroot = 0;
561 for (arena = PL_xpvnv_arenaroot; arena; arena = arenanext) {
562 arenanext = *(void **)arena;
565 PL_xpvnv_arenaroot = 0;
568 for (arena = PL_xpvcv_arenaroot; arena; arena = arenanext) {
569 arenanext = *(void **)arena;
572 PL_xpvcv_arenaroot = 0;
575 for (arena = PL_xpvav_arenaroot; arena; arena = arenanext) {
576 arenanext = *(void **)arena;
579 PL_xpvav_arenaroot = 0;
582 for (arena = PL_xpvhv_arenaroot; arena; arena = arenanext) {
583 arenanext = *(void **)arena;
586 PL_xpvhv_arenaroot = 0;
589 for (arena = PL_xpvmg_arenaroot; arena; arena = arenanext) {
590 arenanext = *(void **)arena;
593 PL_xpvmg_arenaroot = 0;
596 for (arena = PL_xpvgv_arenaroot; arena; arena = arenanext) {
597 arenanext = *(void **)arena;
600 PL_xpvgv_arenaroot = 0;
603 for (arena = PL_xpvlv_arenaroot; arena; arena = arenanext) {
604 arenanext = *(void **)arena;
607 PL_xpvlv_arenaroot = 0;
610 for (arena = PL_xpvbm_arenaroot; arena; arena = arenanext) {
611 arenanext = *(void **)arena;
614 PL_xpvbm_arenaroot = 0;
620 for (he = PL_he_arenaroot; he; he = he_next) {
621 he_next = HeNEXT(he);
628 #if defined(USE_ITHREADS)
630 struct ptr_tbl_ent *pte;
631 struct ptr_tbl_ent *pte_next;
632 for (pte = PL_pte_arenaroot; pte; pte = pte_next) {
633 pte_next = pte->next;
637 PL_pte_arenaroot = 0;
642 Safefree(PL_nice_chunk);
643 PL_nice_chunk = Nullch;
644 PL_nice_chunk_size = 0;
649 /* ---------------------------------------------------------------------
651 * support functions for report_uninit()
654 /* the maxiumum size of array or hash where we will scan looking
655 * for the undefined element that triggered the warning */
657 #define FUV_MAX_SEARCH_SIZE 1000
659 /* Look for an entry in the hash whose value has the same SV as val;
660 * If so, return a mortal copy of the key. */
663 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
669 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
670 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
675 for (i=HvMAX(hv); i>0; i--) {
677 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
678 if (HeVAL(entry) != val)
680 if ( HeVAL(entry) == &PL_sv_undef ||
681 HeVAL(entry) == &PL_sv_placeholder)
685 if (HeKLEN(entry) == HEf_SVKEY)
686 return sv_mortalcopy(HeKEY_sv(entry));
687 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
693 /* Look for an entry in the array whose value has the same SV as val;
694 * If so, return the index, otherwise return -1. */
697 S_find_array_subscript(pTHX_ AV *av, SV* val)
701 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
702 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
706 for (i=AvFILLp(av); i>=0; i--) {
707 if (svp[i] == val && svp[i] != &PL_sv_undef)
713 /* S_varname(): return the name of a variable, optionally with a subscript.
714 * If gv is non-zero, use the name of that global, along with gvtype (one
715 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
716 * targ. Depending on the value of the subscript_type flag, return:
719 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
720 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
721 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
722 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
725 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
726 SV* keyname, I32 aindex, int subscript_type)
731 SV * const name = sv_newmortal();
734 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
735 * XXX get rid of all this if gv_fullnameX() ever supports this
739 HV *hv = GvSTASH(gv);
740 sv_setpv(name, gvtype);
743 else if (!(p=HvNAME_get(hv)))
745 if (strNE(p, "main")) {
747 sv_catpvn(name,"::", 2);
749 if (GvNAMELEN(gv)>= 1 &&
750 ((unsigned int)*GvNAME(gv)) <= 26)
752 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
753 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
756 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
760 CV *cv = find_runcv(&u);
761 if (!cv || !CvPADLIST(cv))
763 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
764 sv = *av_fetch(av, targ, FALSE);
765 /* SvLEN in a pad name is not to be trusted */
766 sv_setpv(name, SvPV_nolen_const(sv));
769 if (subscript_type == FUV_SUBSCRIPT_HASH) {
772 Perl_sv_catpvf(aTHX_ name, "{%s}",
773 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
776 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
778 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
780 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
781 sv_insert(name, 0, 0, "within ", 7);
788 =for apidoc find_uninit_var
790 Find the name of the undefined variable (if any) that caused the operator o
791 to issue a "Use of uninitialized value" warning.
792 If match is true, only return a name if it's value matches uninit_sv.
793 So roughly speaking, if a unary operator (such as OP_COS) generates a
794 warning, then following the direct child of the op may yield an
795 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
796 other hand, with OP_ADD there are two branches to follow, so we only print
797 the variable name if we get an exact match.
799 The name is returned as a mortal SV.
801 Assumes that PL_op is the op that originally triggered the error, and that
802 PL_comppad/PL_curpad points to the currently executing pad.
808 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
817 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
818 uninit_sv == &PL_sv_placeholder)))
821 switch (obase->op_type) {
828 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
829 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
832 int subscript_type = FUV_SUBSCRIPT_WITHIN;
834 if (pad) { /* @lex, %lex */
835 sv = PAD_SVl(obase->op_targ);
839 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
840 /* @global, %global */
841 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
844 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
846 else /* @{expr}, %{expr} */
847 return find_uninit_var(cUNOPx(obase)->op_first,
851 /* attempt to find a match within the aggregate */
853 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
855 subscript_type = FUV_SUBSCRIPT_HASH;
858 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
860 subscript_type = FUV_SUBSCRIPT_ARRAY;
863 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
866 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
867 keysv, index, subscript_type);
871 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
873 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
874 Nullsv, 0, FUV_SUBSCRIPT_NONE);
877 gv = cGVOPx_gv(obase);
878 if (!gv || (match && GvSV(gv) != uninit_sv))
880 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
883 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
885 av = (AV*)PAD_SV(obase->op_targ);
886 if (!av || SvRMAGICAL(av))
888 svp = av_fetch(av, (I32)obase->op_private, FALSE);
889 if (!svp || *svp != uninit_sv)
892 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
893 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
896 gv = cGVOPx_gv(obase);
901 if (!av || SvRMAGICAL(av))
903 svp = av_fetch(av, (I32)obase->op_private, FALSE);
904 if (!svp || *svp != uninit_sv)
907 return S_varname(aTHX_ gv, "$", 0,
908 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
913 o = cUNOPx(obase)->op_first;
914 if (!o || o->op_type != OP_NULL ||
915 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
917 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
922 /* $a[uninit_expr] or $h{uninit_expr} */
923 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
926 o = cBINOPx(obase)->op_first;
927 kid = cBINOPx(obase)->op_last;
929 /* get the av or hv, and optionally the gv */
931 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
932 sv = PAD_SV(o->op_targ);
934 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
935 && cUNOPo->op_first->op_type == OP_GV)
937 gv = cGVOPx_gv(cUNOPo->op_first);
940 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
945 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
946 /* index is constant */
950 if (obase->op_type == OP_HELEM) {
951 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
952 if (!he || HeVAL(he) != uninit_sv)
956 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
957 if (!svp || *svp != uninit_sv)
961 if (obase->op_type == OP_HELEM)
962 return S_varname(aTHX_ gv, "%", o->op_targ,
963 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
965 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
966 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
970 /* index is an expression;
971 * attempt to find a match within the aggregate */
972 if (obase->op_type == OP_HELEM) {
973 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
975 return S_varname(aTHX_ gv, "%", o->op_targ,
976 keysv, 0, FUV_SUBSCRIPT_HASH);
979 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
981 return S_varname(aTHX_ gv, "@", o->op_targ,
982 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
986 return S_varname(aTHX_ gv,
987 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
989 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
995 /* only examine RHS */
996 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
999 o = cUNOPx(obase)->op_first;
1000 if (o->op_type == OP_PUSHMARK)
1003 if (!o->op_sibling) {
1004 /* one-arg version of open is highly magical */
1006 if (o->op_type == OP_GV) { /* open FOO; */
1008 if (match && GvSV(gv) != uninit_sv)
1010 return S_varname(aTHX_ gv, "$", 0,
1011 Nullsv, 0, FUV_SUBSCRIPT_NONE);
1013 /* other possibilities not handled are:
1014 * open $x; or open my $x; should return '${*$x}'
1015 * open expr; should return '$'.expr ideally
1021 /* ops where $_ may be an implicit arg */
1025 if ( !(obase->op_flags & OPf_STACKED)) {
1026 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1027 ? PAD_SVl(obase->op_targ)
1030 sv = sv_newmortal();
1031 sv_setpvn(sv, "$_", 2);
1039 /* skip filehandle as it can't produce 'undef' warning */
1040 o = cUNOPx(obase)->op_first;
1041 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1042 o = o->op_sibling->op_sibling;
1049 match = 1; /* XS or custom code could trigger random warnings */
1054 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1055 return sv_2mortal(newSVpv("${$/}", 0));
1060 if (!(obase->op_flags & OPf_KIDS))
1062 o = cUNOPx(obase)->op_first;
1068 /* if all except one arg are constant, or have no side-effects,
1069 * or are optimized away, then it's unambiguous */
1071 for (kid=o; kid; kid = kid->op_sibling) {
1073 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1074 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1075 || (kid->op_type == OP_PUSHMARK)
1079 if (o2) { /* more than one found */
1086 return find_uninit_var(o2, uninit_sv, match);
1090 sv = find_uninit_var(o, uninit_sv, 1);
1102 =for apidoc report_uninit
1104 Print appropriate "Use of uninitialized variable" warning
1110 Perl_report_uninit(pTHX_ SV* uninit_sv)
1113 SV* varname = Nullsv;
1115 varname = find_uninit_var(PL_op, uninit_sv,0);
1117 sv_insert(varname, 0, 0, " ", 1);
1119 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1120 varname ? SvPV_nolen_const(varname) : "",
1121 " in ", OP_DESC(PL_op));
1124 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1129 S_more_bodies (pTHX_ void **arena_root, void **root, size_t size)
1133 size_t count = PERL_ARENA_SIZE/size;
1134 New(0, start, count*size, char);
1135 *((void **) start) = *arena_root;
1136 *arena_root = (void *)start;
1138 end = start + (count-1) * size;
1140 /* The initial slot is used to link the arenas together, so it isn't to be
1141 linked into the list of ready-to-use bodies. */
1145 *root = (void *)start;
1147 while (start < end) {
1148 char *next = start + size;
1149 *(void**) start = (void *)next;
1152 *(void **)start = 0;
1157 /* grab a new thing from the free list, allocating more if necessary */
1160 S_new_body(pTHX_ void **arena_root, void **root, size_t size, size_t offset)
1164 xpv = *root ? *root : S_more_bodies(aTHX_ arena_root, root, size);
1165 *root = *(void**)xpv;
1167 return (void*)((char*)xpv - offset);
1170 /* return a thing to the free list */
1173 S_del_body(pTHX_ void *thing, void **root, size_t offset)
1175 void **real_thing = (void**)((char *)thing + offset);
1177 *real_thing = *root;
1178 *root = (void*)real_thing;
1182 /* Conventionally we simply malloc() a big block of memory, then divide it
1183 up into lots of the thing that we're allocating.
1185 This macro will expand to call to S_new_body. So for XPVBM (with ithreads),
1188 S_new_body(my_perl, (void**)&(my_perl->Ixpvbm_arenaroot),
1189 (void**)&(my_perl->Ixpvbm_root), sizeof(XPVBM), 0)
1192 #define new_body(TYPE,lctype) \
1193 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1194 (void**)&PL_ ## lctype ## _root, \
1198 /* But for some types, we cheat. The type starts with some members that are
1199 never accessed. So we allocate the substructure, starting at the first used
1200 member, then adjust the pointer back in memory by the size of the bit not
1201 allocated, so it's as if we allocated the full structure.
1202 (But things will all go boom if you write to the part that is "not there",
1203 because you'll be overwriting the last members of the preceding structure
1206 We calculate the correction using the STRUCT_OFFSET macro. For example, if
1207 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
1208 and the pointer is unchanged. If the allocated structure is smaller (no
1209 initial NV actually allocated) then the net effect is to subtract the size
1210 of the NV from the pointer, to return a new pointer as if an initial NV were
1213 This is the same trick as was used for NV and IV bodies. Ironically it
1214 doesn't need to be used for NV bodies any more, because NV is now at the
1215 start of the structure. IV bodies don't need it either, because they are
1216 no longer allocated. */
1218 #define new_body_allocated(TYPE,lctype,member) \
1219 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1220 (void**)&PL_ ## lctype ## _root, \
1221 sizeof(lctype ## _allocated), \
1222 STRUCT_OFFSET(TYPE, member) \
1223 - STRUCT_OFFSET(lctype ## _allocated, member))
1226 #define del_body(p,TYPE,lctype) \
1227 S_del_body(aTHX_ (void*)p, (void**)&PL_ ## lctype ## _root, 0)
1229 #define del_body_allocated(p,TYPE,lctype,member) \
1230 S_del_body(aTHX_ (void*)p, (void**)&PL_ ## lctype ## _root, \
1231 STRUCT_OFFSET(TYPE, member) \
1232 - STRUCT_OFFSET(lctype ## _allocated, member))
1234 #define my_safemalloc(s) (void*)safemalloc(s)
1235 #define my_safefree(p) safefree((char*)p)
1239 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1240 #define del_XNV(p) my_safefree(p)
1242 #define new_XPV() my_safemalloc(sizeof(XPV))
1243 #define del_XPV(p) my_safefree(p)
1245 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1246 #define del_XPVIV(p) my_safefree(p)
1248 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1249 #define del_XPVNV(p) my_safefree(p)
1251 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1252 #define del_XPVCV(p) my_safefree(p)
1254 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1255 #define del_XPVAV(p) my_safefree(p)
1257 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1258 #define del_XPVHV(p) my_safefree(p)
1260 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1261 #define del_XPVMG(p) my_safefree(p)
1263 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1264 #define del_XPVGV(p) my_safefree(p)
1266 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1267 #define del_XPVLV(p) my_safefree(p)
1269 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1270 #define del_XPVBM(p) my_safefree(p)
1274 #define new_XNV() new_body(NV, xnv)
1275 #define del_XNV(p) del_body(p, NV, xnv)
1277 #define new_XPV() new_body_allocated(XPV, xpv, xpv_cur)
1278 #define del_XPV(p) del_body_allocated(p, XPV, xpv, xpv_cur)
1280 #define new_XPVIV() new_body_allocated(XPVIV, xpviv, xpv_cur)
1281 #define del_XPVIV(p) del_body_allocated(p, XPVIV, xpviv, xpv_cur)
1283 #define new_XPVNV() new_body(XPVNV, xpvnv)
1284 #define del_XPVNV(p) del_body(p, XPVNV, xpvnv)
1286 #define new_XPVCV() new_body(XPVCV, xpvcv)
1287 #define del_XPVCV(p) del_body(p, XPVCV, xpvcv)
1289 #define new_XPVAV() new_body_allocated(XPVAV, xpvav, xav_fill)
1290 #define del_XPVAV(p) del_body_allocated(p, XPVAV, xpvav, xav_fill)
1292 #define new_XPVHV() new_body_allocated(XPVHV, xpvhv, xhv_fill)
1293 #define del_XPVHV(p) del_body_allocated(p, XPVHV, xpvhv, xhv_fill)
1295 #define new_XPVMG() new_body(XPVMG, xpvmg)
1296 #define del_XPVMG(p) del_body(p, XPVMG, xpvmg)
1298 #define new_XPVGV() new_body(XPVGV, xpvgv)
1299 #define del_XPVGV(p) del_body(p, XPVGV, xpvgv)
1301 #define new_XPVLV() new_body(XPVLV, xpvlv)
1302 #define del_XPVLV(p) del_body(p, XPVLV, xpvlv)
1304 #define new_XPVBM() new_body(XPVBM, xpvbm)
1305 #define del_XPVBM(p) del_body(p, XPVBM, xpvbm)
1309 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1310 #define del_XPVFM(p) my_safefree(p)
1312 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1313 #define del_XPVIO(p) my_safefree(p)
1316 =for apidoc sv_upgrade
1318 Upgrade an SV to a more complex form. Generally adds a new body type to the
1319 SV, then copies across as much information as possible from the old body.
1320 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1326 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1328 void** old_body_arena;
1329 size_t old_body_offset;
1330 size_t old_body_length; /* Well, the length to copy. */
1332 bool zero_nv = TRUE;
1334 size_t new_body_length;
1335 size_t new_body_offset;
1336 void** new_body_arena;
1337 void** new_body_arenaroot;
1338 U32 old_type = SvTYPE(sv);
1340 if (mt != SVt_PV && SvIsCOW(sv)) {
1341 sv_force_normal_flags(sv, 0);
1344 if (SvTYPE(sv) == mt)
1347 if (SvTYPE(sv) > mt)
1348 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1349 (int)SvTYPE(sv), (int)mt);
1352 old_body = SvANY(sv);
1354 old_body_offset = 0;
1355 old_body_length = 0;
1356 new_body_offset = 0;
1357 new_body_length = ~0;
1359 /* Copying structures onto other structures that have been neatly zeroed
1360 has a subtle gotcha. Consider XPVMG
1362 +------+------+------+------+------+-------+-------+
1363 | NV | CUR | LEN | IV | MAGIC | STASH |
1364 +------+------+------+------+------+-------+-------+
1365 0 4 8 12 16 20 24 28
1367 where NVs are aligned to 8 bytes, so that sizeof that structure is
1368 actually 32 bytes long, with 4 bytes of padding at the end:
1370 +------+------+------+------+------+-------+-------+------+
1371 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1372 +------+------+------+------+------+-------+-------+------+
1373 0 4 8 12 16 20 24 28 32
1375 so what happens if you allocate memory for this structure:
1377 +------+------+------+------+------+-------+-------+------+------+...
1378 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1379 +------+------+------+------+------+-------+-------+------+------+...
1380 0 4 8 12 16 20 24 28 32 36
1382 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1383 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1384 started out as zero once, but it's quite possible that it isn't. So now,
1385 rather than a nicely zeroed GP, you have it pointing somewhere random.
1388 (In fact, GP ends up pointing at a previous GP structure, because the
1389 principle cause of the padding in XPVMG getting garbage is a copy of
1390 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1392 So we are careful and work out the size of used parts of all the
1395 switch (SvTYPE(sv)) {
1401 else if (mt < SVt_PVIV)
1403 old_body_offset = STRUCT_OFFSET(XPVIV, xiv_iv);
1404 old_body_length = sizeof(IV);
1407 old_body_arena = (void **) &PL_xnv_root;
1408 old_body_length = sizeof(NV);
1417 old_body_arena = (void **) &PL_xpv_root;
1418 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1419 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1420 old_body_length = STRUCT_OFFSET(XPV, xpv_len)
1421 + sizeof (((XPV*)SvANY(sv))->xpv_len)
1425 else if (mt == SVt_NV)
1429 old_body_arena = (void **) &PL_xpviv_root;
1430 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1431 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1432 old_body_length = STRUCT_OFFSET(XPVIV, xiv_u)
1433 + sizeof (((XPVIV*)SvANY(sv))->xiv_u)
1437 old_body_arena = (void **) &PL_xpvnv_root;
1438 old_body_length = STRUCT_OFFSET(XPVNV, xiv_u)
1439 + sizeof (((XPVNV*)SvANY(sv))->xiv_u);
1443 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1444 there's no way that it can be safely upgraded, because perl.c
1445 expects to Safefree(SvANY(PL_mess_sv)) */
1446 assert(sv != PL_mess_sv);
1447 /* This flag bit is used to mean other things in other scalar types.
1448 Given that it only has meaning inside the pad, it shouldn't be set
1449 on anything that can get upgraded. */
1450 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1451 old_body_arena = (void **) &PL_xpvmg_root;
1452 old_body_length = STRUCT_OFFSET(XPVMG, xmg_stash)
1453 + sizeof (((XPVMG*)SvANY(sv))->xmg_stash);
1457 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1460 SvFLAGS(sv) &= ~SVTYPEMASK;
1465 Perl_croak(aTHX_ "Can't upgrade to undef");
1467 assert(old_type == SVt_NULL);
1468 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1472 assert(old_type == SVt_NULL);
1473 SvANY(sv) = new_XNV();
1477 assert(old_type == SVt_NULL);
1478 SvANY(sv) = &sv->sv_u.svu_rv;
1482 SvANY(sv) = new_XPVHV();
1485 HvTOTALKEYS(sv) = 0;
1490 SvANY(sv) = new_XPVAV();
1497 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1498 The target created by newSVrv also is, and it can have magic.
1499 However, it never has SvPVX set.
1501 if (old_type >= SVt_RV) {
1502 assert(SvPVX_const(sv) == 0);
1505 /* Could put this in the else clause below, as PVMG must have SvPVX
1506 0 already (the assertion above) */
1507 SvPV_set(sv, (char*)0);
1509 if (old_type >= SVt_PVMG) {
1510 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1511 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1519 new_body = new_XPVIO();
1520 new_body_length = sizeof(XPVIO);
1523 new_body = new_XPVFM();
1524 new_body_length = sizeof(XPVFM);
1528 new_body_length = sizeof(XPVBM);
1529 new_body_arena = (void **) &PL_xpvbm_root;
1530 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
1533 new_body_length = sizeof(XPVGV);
1534 new_body_arena = (void **) &PL_xpvgv_root;
1535 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
1538 new_body_length = sizeof(XPVCV);
1539 new_body_arena = (void **) &PL_xpvcv_root;
1540 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
1543 new_body_length = sizeof(XPVLV);
1544 new_body_arena = (void **) &PL_xpvlv_root;
1545 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
1548 new_body_length = sizeof(XPVMG);
1549 new_body_arena = (void **) &PL_xpvmg_root;
1550 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
1553 new_body_length = sizeof(XPVNV);
1554 new_body_arena = (void **) &PL_xpvnv_root;
1555 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
1558 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1559 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1560 new_body_length = sizeof(XPVIV) - new_body_offset;
1561 new_body_arena = (void **) &PL_xpviv_root;
1562 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
1563 /* XXX Is this still needed? Was it ever needed? Surely as there is
1564 no route from NV to PVIV, NOK can never be true */
1568 goto new_body_no_NV;
1570 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1571 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1572 new_body_length = sizeof(XPV) - new_body_offset;
1573 new_body_arena = (void **) &PL_xpv_root;
1574 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
1576 /* PV and PVIV don't have an NV slot. */
1581 assert(new_body_length);
1583 new_body = S_new_body(aTHX_ new_body_arenaroot, new_body_arena,
1584 new_body_length, new_body_offset);
1586 /* We always allocated the full length item with PURIFY */
1587 new_body_length += new_body_offset;
1588 new_body_offset = 0;
1589 new_body = my_safemalloc(new_body_length);
1593 Zero(((char *)new_body) + new_body_offset, new_body_length, char);
1594 SvANY(sv) = new_body;
1596 if (old_body_length) {
1597 Copy((char *)old_body + old_body_offset,
1598 (char *)new_body + old_body_offset,
1599 old_body_length, char);
1602 /* FIXME - add a Configure test to determine if NV 0.0 is actually
1603 all bits zero. If it is, we can skip this initialisation. */
1608 IoPAGE_LEN(sv) = 60;
1609 if (old_type < SVt_RV)
1614 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", mt);
1618 if (old_body_arena) {
1620 my_safefree(old_body);
1622 S_del_body(aTHX_ old_body, old_body_arena, old_body_offset);
1628 =for apidoc sv_backoff
1630 Remove any string offset. You should normally use the C<SvOOK_off> macro
1637 Perl_sv_backoff(pTHX_ register SV *sv)
1640 assert(SvTYPE(sv) != SVt_PVHV);
1641 assert(SvTYPE(sv) != SVt_PVAV);
1643 const char *s = SvPVX_const(sv);
1644 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1645 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1647 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1649 SvFLAGS(sv) &= ~SVf_OOK;
1656 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1657 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1658 Use the C<SvGROW> wrapper instead.
1664 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1668 #ifdef HAS_64K_LIMIT
1669 if (newlen >= 0x10000) {
1670 PerlIO_printf(Perl_debug_log,
1671 "Allocation too large: %"UVxf"\n", (UV)newlen);
1674 #endif /* HAS_64K_LIMIT */
1677 if (SvTYPE(sv) < SVt_PV) {
1678 sv_upgrade(sv, SVt_PV);
1679 s = SvPVX_mutable(sv);
1681 else if (SvOOK(sv)) { /* pv is offset? */
1683 s = SvPVX_mutable(sv);
1684 if (newlen > SvLEN(sv))
1685 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1686 #ifdef HAS_64K_LIMIT
1687 if (newlen >= 0x10000)
1692 s = SvPVX_mutable(sv);
1694 if (newlen > SvLEN(sv)) { /* need more room? */
1695 newlen = PERL_STRLEN_ROUNDUP(newlen);
1696 if (SvLEN(sv) && s) {
1698 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1704 s = saferealloc(s, newlen);
1707 s = safemalloc(newlen);
1708 if (SvPVX_const(sv) && SvCUR(sv)) {
1709 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1713 SvLEN_set(sv, newlen);
1719 =for apidoc sv_setiv
1721 Copies an integer into the given SV, upgrading first if necessary.
1722 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1728 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1730 SV_CHECK_THINKFIRST_COW_DROP(sv);
1731 switch (SvTYPE(sv)) {
1733 sv_upgrade(sv, SVt_IV);
1736 sv_upgrade(sv, SVt_PVNV);
1740 sv_upgrade(sv, SVt_PVIV);
1749 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1752 (void)SvIOK_only(sv); /* validate number */
1758 =for apidoc sv_setiv_mg
1760 Like C<sv_setiv>, but also handles 'set' magic.
1766 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1773 =for apidoc sv_setuv
1775 Copies an unsigned integer into the given SV, upgrading first if necessary.
1776 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1782 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1784 /* With these two if statements:
1785 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1788 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1790 If you wish to remove them, please benchmark to see what the effect is
1792 if (u <= (UV)IV_MAX) {
1793 sv_setiv(sv, (IV)u);
1802 =for apidoc sv_setuv_mg
1804 Like C<sv_setuv>, but also handles 'set' magic.
1810 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1812 /* With these two if statements:
1813 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1816 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1818 If you wish to remove them, please benchmark to see what the effect is
1820 if (u <= (UV)IV_MAX) {
1821 sv_setiv(sv, (IV)u);
1831 =for apidoc sv_setnv
1833 Copies a double into the given SV, upgrading first if necessary.
1834 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1840 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1842 SV_CHECK_THINKFIRST_COW_DROP(sv);
1843 switch (SvTYPE(sv)) {
1846 sv_upgrade(sv, SVt_NV);
1851 sv_upgrade(sv, SVt_PVNV);
1860 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1864 (void)SvNOK_only(sv); /* validate number */
1869 =for apidoc sv_setnv_mg
1871 Like C<sv_setnv>, but also handles 'set' magic.
1877 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1883 /* Print an "isn't numeric" warning, using a cleaned-up,
1884 * printable version of the offending string
1888 S_not_a_number(pTHX_ SV *sv)
1895 dsv = sv_2mortal(newSVpv("", 0));
1896 pv = sv_uni_display(dsv, sv, 10, 0);
1899 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1900 /* each *s can expand to 4 chars + "...\0",
1901 i.e. need room for 8 chars */
1903 const char *s, *end;
1904 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1907 if (ch & 128 && !isPRINT_LC(ch)) {
1916 else if (ch == '\r') {
1920 else if (ch == '\f') {
1924 else if (ch == '\\') {
1928 else if (ch == '\0') {
1932 else if (isPRINT_LC(ch))
1949 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1950 "Argument \"%s\" isn't numeric in %s", pv,
1953 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1954 "Argument \"%s\" isn't numeric", pv);
1958 =for apidoc looks_like_number
1960 Test if the content of an SV looks like a number (or is a number).
1961 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1962 non-numeric warning), even if your atof() doesn't grok them.
1968 Perl_looks_like_number(pTHX_ SV *sv)
1970 register const char *sbegin;
1974 sbegin = SvPVX_const(sv);
1977 else if (SvPOKp(sv))
1978 sbegin = SvPV_const(sv, len);
1980 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1981 return grok_number(sbegin, len, NULL);
1984 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1985 until proven guilty, assume that things are not that bad... */
1990 As 64 bit platforms often have an NV that doesn't preserve all bits of
1991 an IV (an assumption perl has been based on to date) it becomes necessary
1992 to remove the assumption that the NV always carries enough precision to
1993 recreate the IV whenever needed, and that the NV is the canonical form.
1994 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1995 precision as a side effect of conversion (which would lead to insanity
1996 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1997 1) to distinguish between IV/UV/NV slots that have cached a valid
1998 conversion where precision was lost and IV/UV/NV slots that have a
1999 valid conversion which has lost no precision
2000 2) to ensure that if a numeric conversion to one form is requested that
2001 would lose precision, the precise conversion (or differently
2002 imprecise conversion) is also performed and cached, to prevent
2003 requests for different numeric formats on the same SV causing
2004 lossy conversion chains. (lossless conversion chains are perfectly
2009 SvIOKp is true if the IV slot contains a valid value
2010 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2011 SvNOKp is true if the NV slot contains a valid value
2012 SvNOK is true only if the NV value is accurate
2015 while converting from PV to NV, check to see if converting that NV to an
2016 IV(or UV) would lose accuracy over a direct conversion from PV to
2017 IV(or UV). If it would, cache both conversions, return NV, but mark
2018 SV as IOK NOKp (ie not NOK).
2020 While converting from PV to IV, check to see if converting that IV to an
2021 NV would lose accuracy over a direct conversion from PV to NV. If it
2022 would, cache both conversions, flag similarly.
2024 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2025 correctly because if IV & NV were set NV *always* overruled.
2026 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2027 changes - now IV and NV together means that the two are interchangeable:
2028 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2030 The benefit of this is that operations such as pp_add know that if
2031 SvIOK is true for both left and right operands, then integer addition
2032 can be used instead of floating point (for cases where the result won't
2033 overflow). Before, floating point was always used, which could lead to
2034 loss of precision compared with integer addition.
2036 * making IV and NV equal status should make maths accurate on 64 bit
2038 * may speed up maths somewhat if pp_add and friends start to use
2039 integers when possible instead of fp. (Hopefully the overhead in
2040 looking for SvIOK and checking for overflow will not outweigh the
2041 fp to integer speedup)
2042 * will slow down integer operations (callers of SvIV) on "inaccurate"
2043 values, as the change from SvIOK to SvIOKp will cause a call into
2044 sv_2iv each time rather than a macro access direct to the IV slot
2045 * should speed up number->string conversion on integers as IV is
2046 favoured when IV and NV are equally accurate
2048 ####################################################################
2049 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2050 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2051 On the other hand, SvUOK is true iff UV.
2052 ####################################################################
2054 Your mileage will vary depending your CPU's relative fp to integer
2058 #ifndef NV_PRESERVES_UV
2059 # define IS_NUMBER_UNDERFLOW_IV 1
2060 # define IS_NUMBER_UNDERFLOW_UV 2
2061 # define IS_NUMBER_IV_AND_UV 2
2062 # define IS_NUMBER_OVERFLOW_IV 4
2063 # define IS_NUMBER_OVERFLOW_UV 5
2065 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2067 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2069 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2071 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));
2072 if (SvNVX(sv) < (NV)IV_MIN) {
2073 (void)SvIOKp_on(sv);
2075 SvIV_set(sv, IV_MIN);
2076 return IS_NUMBER_UNDERFLOW_IV;
2078 if (SvNVX(sv) > (NV)UV_MAX) {
2079 (void)SvIOKp_on(sv);
2082 SvUV_set(sv, UV_MAX);
2083 return IS_NUMBER_OVERFLOW_UV;
2085 (void)SvIOKp_on(sv);
2087 /* Can't use strtol etc to convert this string. (See truth table in
2089 if (SvNVX(sv) <= (UV)IV_MAX) {
2090 SvIV_set(sv, I_V(SvNVX(sv)));
2091 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2092 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2094 /* Integer is imprecise. NOK, IOKp */
2096 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2099 SvUV_set(sv, U_V(SvNVX(sv)));
2100 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2101 if (SvUVX(sv) == UV_MAX) {
2102 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2103 possibly be preserved by NV. Hence, it must be overflow.
2105 return IS_NUMBER_OVERFLOW_UV;
2107 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2109 /* Integer is imprecise. NOK, IOKp */
2111 return IS_NUMBER_OVERFLOW_IV;
2113 #endif /* !NV_PRESERVES_UV*/
2115 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2116 * this function provided for binary compatibility only
2120 Perl_sv_2iv(pTHX_ register SV *sv)
2122 return sv_2iv_flags(sv, SV_GMAGIC);
2126 =for apidoc sv_2iv_flags
2128 Return the integer value of an SV, doing any necessary string
2129 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2130 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2136 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2140 if (SvGMAGICAL(sv)) {
2141 if (flags & SV_GMAGIC)
2146 return I_V(SvNVX(sv));
2148 if (SvPOKp(sv) && SvLEN(sv))
2151 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2152 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2158 if (SvTHINKFIRST(sv)) {
2161 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2162 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2163 return SvIV(tmpstr);
2164 return PTR2IV(SvRV(sv));
2167 sv_force_normal_flags(sv, 0);
2169 if (SvREADONLY(sv) && !SvOK(sv)) {
2170 if (ckWARN(WARN_UNINITIALIZED))
2177 return (IV)(SvUVX(sv));
2184 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2185 * without also getting a cached IV/UV from it at the same time
2186 * (ie PV->NV conversion should detect loss of accuracy and cache
2187 * IV or UV at same time to avoid this. NWC */
2189 if (SvTYPE(sv) == SVt_NV)
2190 sv_upgrade(sv, SVt_PVNV);
2192 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2193 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2194 certainly cast into the IV range at IV_MAX, whereas the correct
2195 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2197 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2198 SvIV_set(sv, I_V(SvNVX(sv)));
2199 if (SvNVX(sv) == (NV) SvIVX(sv)
2200 #ifndef NV_PRESERVES_UV
2201 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2202 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2203 /* Don't flag it as "accurately an integer" if the number
2204 came from a (by definition imprecise) NV operation, and
2205 we're outside the range of NV integer precision */
2208 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2209 DEBUG_c(PerlIO_printf(Perl_debug_log,
2210 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2216 /* IV not precise. No need to convert from PV, as NV
2217 conversion would already have cached IV if it detected
2218 that PV->IV would be better than PV->NV->IV
2219 flags already correct - don't set public IOK. */
2220 DEBUG_c(PerlIO_printf(Perl_debug_log,
2221 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2226 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2227 but the cast (NV)IV_MIN rounds to a the value less (more
2228 negative) than IV_MIN which happens to be equal to SvNVX ??
2229 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2230 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2231 (NV)UVX == NVX are both true, but the values differ. :-(
2232 Hopefully for 2s complement IV_MIN is something like
2233 0x8000000000000000 which will be exact. NWC */
2236 SvUV_set(sv, U_V(SvNVX(sv)));
2238 (SvNVX(sv) == (NV) SvUVX(sv))
2239 #ifndef NV_PRESERVES_UV
2240 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2241 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2242 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2243 /* Don't flag it as "accurately an integer" if the number
2244 came from a (by definition imprecise) NV operation, and
2245 we're outside the range of NV integer precision */
2251 DEBUG_c(PerlIO_printf(Perl_debug_log,
2252 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2256 return (IV)SvUVX(sv);
2259 else if (SvPOKp(sv) && SvLEN(sv)) {
2261 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2262 /* We want to avoid a possible problem when we cache an IV which
2263 may be later translated to an NV, and the resulting NV is not
2264 the same as the direct translation of the initial string
2265 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2266 be careful to ensure that the value with the .456 is around if the
2267 NV value is requested in the future).
2269 This means that if we cache such an IV, we need to cache the
2270 NV as well. Moreover, we trade speed for space, and do not
2271 cache the NV if we are sure it's not needed.
2274 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2275 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2276 == IS_NUMBER_IN_UV) {
2277 /* It's definitely an integer, only upgrade to PVIV */
2278 if (SvTYPE(sv) < SVt_PVIV)
2279 sv_upgrade(sv, SVt_PVIV);
2281 } else if (SvTYPE(sv) < SVt_PVNV)
2282 sv_upgrade(sv, SVt_PVNV);
2284 /* If NV preserves UV then we only use the UV value if we know that
2285 we aren't going to call atof() below. If NVs don't preserve UVs
2286 then the value returned may have more precision than atof() will
2287 return, even though value isn't perfectly accurate. */
2288 if ((numtype & (IS_NUMBER_IN_UV
2289 #ifdef NV_PRESERVES_UV
2292 )) == IS_NUMBER_IN_UV) {
2293 /* This won't turn off the public IOK flag if it was set above */
2294 (void)SvIOKp_on(sv);
2296 if (!(numtype & IS_NUMBER_NEG)) {
2298 if (value <= (UV)IV_MAX) {
2299 SvIV_set(sv, (IV)value);
2301 SvUV_set(sv, value);
2305 /* 2s complement assumption */
2306 if (value <= (UV)IV_MIN) {
2307 SvIV_set(sv, -(IV)value);
2309 /* Too negative for an IV. This is a double upgrade, but
2310 I'm assuming it will be rare. */
2311 if (SvTYPE(sv) < SVt_PVNV)
2312 sv_upgrade(sv, SVt_PVNV);
2316 SvNV_set(sv, -(NV)value);
2317 SvIV_set(sv, IV_MIN);
2321 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2322 will be in the previous block to set the IV slot, and the next
2323 block to set the NV slot. So no else here. */
2325 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2326 != IS_NUMBER_IN_UV) {
2327 /* It wasn't an (integer that doesn't overflow the UV). */
2328 SvNV_set(sv, Atof(SvPVX_const(sv)));
2330 if (! numtype && ckWARN(WARN_NUMERIC))
2333 #if defined(USE_LONG_DOUBLE)
2334 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2335 PTR2UV(sv), SvNVX(sv)));
2337 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2338 PTR2UV(sv), SvNVX(sv)));
2342 #ifdef NV_PRESERVES_UV
2343 (void)SvIOKp_on(sv);
2345 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2346 SvIV_set(sv, I_V(SvNVX(sv)));
2347 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2350 /* Integer is imprecise. NOK, IOKp */
2352 /* UV will not work better than IV */
2354 if (SvNVX(sv) > (NV)UV_MAX) {
2356 /* Integer is inaccurate. NOK, IOKp, is UV */
2357 SvUV_set(sv, UV_MAX);
2360 SvUV_set(sv, U_V(SvNVX(sv)));
2361 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2362 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2366 /* Integer is imprecise. NOK, IOKp, is UV */
2372 #else /* NV_PRESERVES_UV */
2373 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2374 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2375 /* The IV slot will have been set from value returned by
2376 grok_number above. The NV slot has just been set using
2379 assert (SvIOKp(sv));
2381 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2382 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2383 /* Small enough to preserve all bits. */
2384 (void)SvIOKp_on(sv);
2386 SvIV_set(sv, I_V(SvNVX(sv)));
2387 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2389 /* Assumption: first non-preserved integer is < IV_MAX,
2390 this NV is in the preserved range, therefore: */
2391 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2393 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);
2397 0 0 already failed to read UV.
2398 0 1 already failed to read UV.
2399 1 0 you won't get here in this case. IV/UV
2400 slot set, public IOK, Atof() unneeded.
2401 1 1 already read UV.
2402 so there's no point in sv_2iuv_non_preserve() attempting
2403 to use atol, strtol, strtoul etc. */
2404 if (sv_2iuv_non_preserve (sv, numtype)
2405 >= IS_NUMBER_OVERFLOW_IV)
2409 #endif /* NV_PRESERVES_UV */
2412 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2414 if (SvTYPE(sv) < SVt_IV)
2415 /* Typically the caller expects that sv_any is not NULL now. */
2416 sv_upgrade(sv, SVt_IV);
2419 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2420 PTR2UV(sv),SvIVX(sv)));
2421 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2424 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2425 * this function provided for binary compatibility only
2429 Perl_sv_2uv(pTHX_ register SV *sv)
2431 return sv_2uv_flags(sv, SV_GMAGIC);
2435 =for apidoc sv_2uv_flags
2437 Return the unsigned integer value of an SV, doing any necessary string
2438 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2439 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2445 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2449 if (SvGMAGICAL(sv)) {
2450 if (flags & SV_GMAGIC)
2455 return U_V(SvNVX(sv));
2456 if (SvPOKp(sv) && SvLEN(sv))
2459 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2460 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2466 if (SvTHINKFIRST(sv)) {
2469 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2470 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2471 return SvUV(tmpstr);
2472 return PTR2UV(SvRV(sv));
2475 sv_force_normal_flags(sv, 0);
2477 if (SvREADONLY(sv) && !SvOK(sv)) {
2478 if (ckWARN(WARN_UNINITIALIZED))
2488 return (UV)SvIVX(sv);
2492 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2493 * without also getting a cached IV/UV from it at the same time
2494 * (ie PV->NV conversion should detect loss of accuracy and cache
2495 * IV or UV at same time to avoid this. */
2496 /* IV-over-UV optimisation - choose to cache IV if possible */
2498 if (SvTYPE(sv) == SVt_NV)
2499 sv_upgrade(sv, SVt_PVNV);
2501 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2502 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2503 SvIV_set(sv, I_V(SvNVX(sv)));
2504 if (SvNVX(sv) == (NV) SvIVX(sv)
2505 #ifndef NV_PRESERVES_UV
2506 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2507 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2508 /* Don't flag it as "accurately an integer" if the number
2509 came from a (by definition imprecise) NV operation, and
2510 we're outside the range of NV integer precision */
2513 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2514 DEBUG_c(PerlIO_printf(Perl_debug_log,
2515 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2521 /* IV not precise. No need to convert from PV, as NV
2522 conversion would already have cached IV if it detected
2523 that PV->IV would be better than PV->NV->IV
2524 flags already correct - don't set public IOK. */
2525 DEBUG_c(PerlIO_printf(Perl_debug_log,
2526 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2531 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2532 but the cast (NV)IV_MIN rounds to a the value less (more
2533 negative) than IV_MIN which happens to be equal to SvNVX ??
2534 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2535 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2536 (NV)UVX == NVX are both true, but the values differ. :-(
2537 Hopefully for 2s complement IV_MIN is something like
2538 0x8000000000000000 which will be exact. NWC */
2541 SvUV_set(sv, U_V(SvNVX(sv)));
2543 (SvNVX(sv) == (NV) SvUVX(sv))
2544 #ifndef NV_PRESERVES_UV
2545 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2546 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2547 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2548 /* Don't flag it as "accurately an integer" if the number
2549 came from a (by definition imprecise) NV operation, and
2550 we're outside the range of NV integer precision */
2555 DEBUG_c(PerlIO_printf(Perl_debug_log,
2556 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2562 else if (SvPOKp(sv) && SvLEN(sv)) {
2564 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2566 /* We want to avoid a possible problem when we cache a UV which
2567 may be later translated to an NV, and the resulting NV is not
2568 the translation of the initial data.
2570 This means that if we cache such a UV, we need to cache the
2571 NV as well. Moreover, we trade speed for space, and do not
2572 cache the NV if not needed.
2575 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2576 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2577 == IS_NUMBER_IN_UV) {
2578 /* It's definitely an integer, only upgrade to PVIV */
2579 if (SvTYPE(sv) < SVt_PVIV)
2580 sv_upgrade(sv, SVt_PVIV);
2582 } else if (SvTYPE(sv) < SVt_PVNV)
2583 sv_upgrade(sv, SVt_PVNV);
2585 /* If NV preserves UV then we only use the UV value if we know that
2586 we aren't going to call atof() below. If NVs don't preserve UVs
2587 then the value returned may have more precision than atof() will
2588 return, even though it isn't accurate. */
2589 if ((numtype & (IS_NUMBER_IN_UV
2590 #ifdef NV_PRESERVES_UV
2593 )) == IS_NUMBER_IN_UV) {
2594 /* This won't turn off the public IOK flag if it was set above */
2595 (void)SvIOKp_on(sv);
2597 if (!(numtype & IS_NUMBER_NEG)) {
2599 if (value <= (UV)IV_MAX) {
2600 SvIV_set(sv, (IV)value);
2602 /* it didn't overflow, and it was positive. */
2603 SvUV_set(sv, value);
2607 /* 2s complement assumption */
2608 if (value <= (UV)IV_MIN) {
2609 SvIV_set(sv, -(IV)value);
2611 /* Too negative for an IV. This is a double upgrade, but
2612 I'm assuming it will be rare. */
2613 if (SvTYPE(sv) < SVt_PVNV)
2614 sv_upgrade(sv, SVt_PVNV);
2618 SvNV_set(sv, -(NV)value);
2619 SvIV_set(sv, IV_MIN);
2624 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2625 != IS_NUMBER_IN_UV) {
2626 /* It wasn't an integer, or it overflowed the UV. */
2627 SvNV_set(sv, Atof(SvPVX_const(sv)));
2629 if (! numtype && ckWARN(WARN_NUMERIC))
2632 #if defined(USE_LONG_DOUBLE)
2633 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2634 PTR2UV(sv), SvNVX(sv)));
2636 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2637 PTR2UV(sv), SvNVX(sv)));
2640 #ifdef NV_PRESERVES_UV
2641 (void)SvIOKp_on(sv);
2643 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2644 SvIV_set(sv, I_V(SvNVX(sv)));
2645 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2648 /* Integer is imprecise. NOK, IOKp */
2650 /* UV will not work better than IV */
2652 if (SvNVX(sv) > (NV)UV_MAX) {
2654 /* Integer is inaccurate. NOK, IOKp, is UV */
2655 SvUV_set(sv, UV_MAX);
2658 SvUV_set(sv, U_V(SvNVX(sv)));
2659 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2660 NV preservse UV so can do correct comparison. */
2661 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2665 /* Integer is imprecise. NOK, IOKp, is UV */
2670 #else /* NV_PRESERVES_UV */
2671 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2672 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2673 /* The UV slot will have been set from value returned by
2674 grok_number above. The NV slot has just been set using
2677 assert (SvIOKp(sv));
2679 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2680 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2681 /* Small enough to preserve all bits. */
2682 (void)SvIOKp_on(sv);
2684 SvIV_set(sv, I_V(SvNVX(sv)));
2685 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2687 /* Assumption: first non-preserved integer is < IV_MAX,
2688 this NV is in the preserved range, therefore: */
2689 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2691 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs((double)SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2694 sv_2iuv_non_preserve (sv, numtype);
2696 #endif /* NV_PRESERVES_UV */
2700 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2701 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2704 if (SvTYPE(sv) < SVt_IV)
2705 /* Typically the caller expects that sv_any is not NULL now. */
2706 sv_upgrade(sv, SVt_IV);
2710 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2711 PTR2UV(sv),SvUVX(sv)));
2712 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2718 Return the num value of an SV, doing any necessary string or integer
2719 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2726 Perl_sv_2nv(pTHX_ register SV *sv)
2730 if (SvGMAGICAL(sv)) {
2734 if (SvPOKp(sv) && SvLEN(sv)) {
2735 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2736 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2738 return Atof(SvPVX_const(sv));
2742 return (NV)SvUVX(sv);
2744 return (NV)SvIVX(sv);
2747 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2748 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2754 if (SvTHINKFIRST(sv)) {
2757 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2758 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2759 return SvNV(tmpstr);
2760 return PTR2NV(SvRV(sv));
2763 sv_force_normal_flags(sv, 0);
2765 if (SvREADONLY(sv) && !SvOK(sv)) {
2766 if (ckWARN(WARN_UNINITIALIZED))
2771 if (SvTYPE(sv) < SVt_NV) {
2772 if (SvTYPE(sv) == SVt_IV)
2773 sv_upgrade(sv, SVt_PVNV);
2775 sv_upgrade(sv, SVt_NV);
2776 #ifdef USE_LONG_DOUBLE
2778 STORE_NUMERIC_LOCAL_SET_STANDARD();
2779 PerlIO_printf(Perl_debug_log,
2780 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2781 PTR2UV(sv), SvNVX(sv));
2782 RESTORE_NUMERIC_LOCAL();
2786 STORE_NUMERIC_LOCAL_SET_STANDARD();
2787 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2788 PTR2UV(sv), SvNVX(sv));
2789 RESTORE_NUMERIC_LOCAL();
2793 else if (SvTYPE(sv) < SVt_PVNV)
2794 sv_upgrade(sv, SVt_PVNV);
2799 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2800 #ifdef NV_PRESERVES_UV
2803 /* Only set the public NV OK flag if this NV preserves the IV */
2804 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2805 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2806 : (SvIVX(sv) == I_V(SvNVX(sv))))
2812 else if (SvPOKp(sv) && SvLEN(sv)) {
2814 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2815 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2817 #ifdef NV_PRESERVES_UV
2818 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2819 == IS_NUMBER_IN_UV) {
2820 /* It's definitely an integer */
2821 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2823 SvNV_set(sv, Atof(SvPVX_const(sv)));
2826 SvNV_set(sv, Atof(SvPVX_const(sv)));
2827 /* Only set the public NV OK flag if this NV preserves the value in
2828 the PV at least as well as an IV/UV would.
2829 Not sure how to do this 100% reliably. */
2830 /* if that shift count is out of range then Configure's test is
2831 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2833 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2834 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2835 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2836 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2837 /* Can't use strtol etc to convert this string, so don't try.
2838 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2841 /* value has been set. It may not be precise. */
2842 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2843 /* 2s complement assumption for (UV)IV_MIN */
2844 SvNOK_on(sv); /* Integer is too negative. */
2849 if (numtype & IS_NUMBER_NEG) {
2850 SvIV_set(sv, -(IV)value);
2851 } else if (value <= (UV)IV_MAX) {
2852 SvIV_set(sv, (IV)value);
2854 SvUV_set(sv, value);
2858 if (numtype & IS_NUMBER_NOT_INT) {
2859 /* I believe that even if the original PV had decimals,
2860 they are lost beyond the limit of the FP precision.
2861 However, neither is canonical, so both only get p
2862 flags. NWC, 2000/11/25 */
2863 /* Both already have p flags, so do nothing */
2865 const NV nv = SvNVX(sv);
2866 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2867 if (SvIVX(sv) == I_V(nv)) {
2872 /* It had no "." so it must be integer. */
2875 /* between IV_MAX and NV(UV_MAX).
2876 Could be slightly > UV_MAX */
2878 if (numtype & IS_NUMBER_NOT_INT) {
2879 /* UV and NV both imprecise. */
2881 const UV nv_as_uv = U_V(nv);
2883 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2894 #endif /* NV_PRESERVES_UV */
2897 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2899 if (SvTYPE(sv) < SVt_NV)
2900 /* Typically the caller expects that sv_any is not NULL now. */
2901 /* XXX Ilya implies that this is a bug in callers that assume this
2902 and ideally should be fixed. */
2903 sv_upgrade(sv, SVt_NV);
2906 #if defined(USE_LONG_DOUBLE)
2908 STORE_NUMERIC_LOCAL_SET_STANDARD();
2909 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2910 PTR2UV(sv), SvNVX(sv));
2911 RESTORE_NUMERIC_LOCAL();
2915 STORE_NUMERIC_LOCAL_SET_STANDARD();
2916 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2917 PTR2UV(sv), SvNVX(sv));
2918 RESTORE_NUMERIC_LOCAL();
2924 /* asIV(): extract an integer from the string value of an SV.
2925 * Caller must validate PVX */
2928 S_asIV(pTHX_ SV *sv)
2931 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2933 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2934 == IS_NUMBER_IN_UV) {
2935 /* It's definitely an integer */
2936 if (numtype & IS_NUMBER_NEG) {
2937 if (value < (UV)IV_MIN)
2940 if (value < (UV)IV_MAX)
2945 if (ckWARN(WARN_NUMERIC))
2948 return I_V(Atof(SvPVX_const(sv)));
2951 /* asUV(): extract an unsigned integer from the string value of an SV
2952 * Caller must validate PVX */
2955 S_asUV(pTHX_ SV *sv)
2958 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2960 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2961 == IS_NUMBER_IN_UV) {
2962 /* It's definitely an integer */
2963 if (!(numtype & IS_NUMBER_NEG))
2967 if (ckWARN(WARN_NUMERIC))
2970 return U_V(Atof(SvPVX_const(sv)));
2974 =for apidoc sv_2pv_nolen
2976 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2977 use the macro wrapper C<SvPV_nolen(sv)> instead.
2982 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2984 return sv_2pv(sv, 0);
2987 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2988 * UV as a string towards the end of buf, and return pointers to start and
2991 * We assume that buf is at least TYPE_CHARS(UV) long.
2995 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2997 char *ptr = buf + TYPE_CHARS(UV);
3011 *--ptr = '0' + (char)(uv % 10);
3019 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3020 * this function provided for binary compatibility only
3024 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3026 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3030 =for apidoc sv_2pv_flags
3032 Returns a pointer to the string value of an SV, and sets *lp to its length.
3033 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3035 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3036 usually end up here too.
3042 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3047 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3048 char *tmpbuf = tbuf;
3055 if (SvGMAGICAL(sv)) {
3056 if (flags & SV_GMAGIC)
3061 if (flags & SV_MUTABLE_RETURN)
3062 return SvPVX_mutable(sv);
3063 if (flags & SV_CONST_RETURN)
3064 return (char *)SvPVX_const(sv);
3069 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3071 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3076 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3081 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3082 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3090 if (SvTHINKFIRST(sv)) {
3093 register const char *typestr;
3094 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3095 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3097 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3100 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3101 if (flags & SV_CONST_RETURN) {
3102 pv = (char *) SvPVX_const(tmpstr);
3104 pv = (flags & SV_MUTABLE_RETURN)
3105 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3108 *lp = SvCUR(tmpstr);
3110 pv = sv_2pv_flags(tmpstr, lp, flags);
3121 typestr = "NULLREF";
3125 switch (SvTYPE(sv)) {
3127 if ( ((SvFLAGS(sv) &
3128 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3129 == (SVs_OBJECT|SVs_SMG))
3130 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3131 const regexp *re = (regexp *)mg->mg_obj;
3134 const char *fptr = "msix";
3139 char need_newline = 0;
3140 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3142 while((ch = *fptr++)) {
3144 reflags[left++] = ch;
3147 reflags[right--] = ch;
3152 reflags[left] = '-';
3156 mg->mg_len = re->prelen + 4 + left;
3158 * If /x was used, we have to worry about a regex
3159 * ending with a comment later being embedded
3160 * within another regex. If so, we don't want this
3161 * regex's "commentization" to leak out to the
3162 * right part of the enclosing regex, we must cap
3163 * it with a newline.
3165 * So, if /x was used, we scan backwards from the
3166 * end of the regex. If we find a '#' before we
3167 * find a newline, we need to add a newline
3168 * ourself. If we find a '\n' first (or if we
3169 * don't find '#' or '\n'), we don't need to add
3170 * anything. -jfriedl
3172 if (PMf_EXTENDED & re->reganch)
3174 const char *endptr = re->precomp + re->prelen;
3175 while (endptr >= re->precomp)
3177 const char c = *(endptr--);
3179 break; /* don't need another */
3181 /* we end while in a comment, so we
3183 mg->mg_len++; /* save space for it */
3184 need_newline = 1; /* note to add it */
3190 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3191 Copy("(?", mg->mg_ptr, 2, char);
3192 Copy(reflags, mg->mg_ptr+2, left, char);
3193 Copy(":", mg->mg_ptr+left+2, 1, char);
3194 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3196 mg->mg_ptr[mg->mg_len - 2] = '\n';
3197 mg->mg_ptr[mg->mg_len - 1] = ')';
3198 mg->mg_ptr[mg->mg_len] = 0;
3200 PL_reginterp_cnt += re->program[0].next_off;
3202 if (re->reganch & ROPT_UTF8)
3218 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3219 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3220 /* tied lvalues should appear to be
3221 * scalars for backwards compatitbility */
3222 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3223 ? "SCALAR" : "LVALUE"; break;
3224 case SVt_PVAV: typestr = "ARRAY"; break;
3225 case SVt_PVHV: typestr = "HASH"; break;
3226 case SVt_PVCV: typestr = "CODE"; break;
3227 case SVt_PVGV: typestr = "GLOB"; break;
3228 case SVt_PVFM: typestr = "FORMAT"; break;
3229 case SVt_PVIO: typestr = "IO"; break;
3230 default: typestr = "UNKNOWN"; break;
3234 const char *name = HvNAME_get(SvSTASH(sv));
3235 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3236 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3239 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3243 *lp = strlen(typestr);
3244 return (char *)typestr;
3246 if (SvREADONLY(sv) && !SvOK(sv)) {
3247 if (ckWARN(WARN_UNINITIALIZED))
3254 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3255 /* I'm assuming that if both IV and NV are equally valid then
3256 converting the IV is going to be more efficient */
3257 const U32 isIOK = SvIOK(sv);
3258 const U32 isUIOK = SvIsUV(sv);
3259 char buf[TYPE_CHARS(UV)];
3262 if (SvTYPE(sv) < SVt_PVIV)
3263 sv_upgrade(sv, SVt_PVIV);
3265 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3267 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3268 /* inlined from sv_setpvn */
3269 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3270 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3271 SvCUR_set(sv, ebuf - ptr);
3281 else if (SvNOKp(sv)) {
3282 if (SvTYPE(sv) < SVt_PVNV)
3283 sv_upgrade(sv, SVt_PVNV);
3284 /* The +20 is pure guesswork. Configure test needed. --jhi */
3285 s = SvGROW_mutable(sv, NV_DIG + 20);
3286 olderrno = errno; /* some Xenix systems wipe out errno here */
3288 if (SvNVX(sv) == 0.0)
3289 (void)strcpy(s,"0");
3293 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3296 #ifdef FIXNEGATIVEZERO
3297 if (*s == '-' && s[1] == '0' && !s[2])
3307 if (ckWARN(WARN_UNINITIALIZED)
3308 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3312 if (SvTYPE(sv) < SVt_PV)
3313 /* Typically the caller expects that sv_any is not NULL now. */
3314 sv_upgrade(sv, SVt_PV);
3318 STRLEN len = s - SvPVX_const(sv);
3324 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3325 PTR2UV(sv),SvPVX_const(sv)));
3326 if (flags & SV_CONST_RETURN)
3327 return (char *)SvPVX_const(sv);
3328 if (flags & SV_MUTABLE_RETURN)
3329 return SvPVX_mutable(sv);
3333 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3334 /* Sneaky stuff here */
3338 tsv = newSVpv(tmpbuf, 0);
3351 t = SvPVX_const(tsv);
3356 len = strlen(tmpbuf);
3358 #ifdef FIXNEGATIVEZERO
3359 if (len == 2 && t[0] == '-' && t[1] == '0') {
3364 SvUPGRADE(sv, SVt_PV);
3367 s = SvGROW_mutable(sv, len + 1);
3370 return strcpy(s, t);
3375 =for apidoc sv_copypv
3377 Copies a stringified representation of the source SV into the
3378 destination SV. Automatically performs any necessary mg_get and
3379 coercion of numeric values into strings. Guaranteed to preserve
3380 UTF-8 flag even from overloaded objects. Similar in nature to
3381 sv_2pv[_flags] but operates directly on an SV instead of just the
3382 string. Mostly uses sv_2pv_flags to do its work, except when that
3383 would lose the UTF-8'ness of the PV.
3389 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3393 s = SvPV_const(ssv,len);
3394 sv_setpvn(dsv,s,len);
3402 =for apidoc sv_2pvbyte_nolen
3404 Return a pointer to the byte-encoded representation of the SV.
3405 May cause the SV to be downgraded from UTF-8 as a side-effect.
3407 Usually accessed via the C<SvPVbyte_nolen> macro.
3413 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3415 return sv_2pvbyte(sv, 0);
3419 =for apidoc sv_2pvbyte
3421 Return a pointer to the byte-encoded representation of the SV, and set *lp
3422 to its length. May cause the SV to be downgraded from UTF-8 as a
3425 Usually accessed via the C<SvPVbyte> macro.
3431 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3433 sv_utf8_downgrade(sv,0);
3434 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3438 =for apidoc sv_2pvutf8_nolen
3440 Return a pointer to the UTF-8-encoded representation of the SV.
3441 May cause the SV to be upgraded to UTF-8 as a side-effect.
3443 Usually accessed via the C<SvPVutf8_nolen> macro.
3449 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3451 return sv_2pvutf8(sv, 0);
3455 =for apidoc sv_2pvutf8
3457 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3458 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3460 Usually accessed via the C<SvPVutf8> macro.
3466 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3468 sv_utf8_upgrade(sv);
3469 return SvPV(sv,*lp);
3473 =for apidoc sv_2bool
3475 This function is only called on magical items, and is only used by
3476 sv_true() or its macro equivalent.
3482 Perl_sv_2bool(pTHX_ register SV *sv)
3491 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3492 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3493 return (bool)SvTRUE(tmpsv);
3494 return SvRV(sv) != 0;
3497 register XPV* Xpvtmp;
3498 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3499 (*sv->sv_u.svu_pv > '0' ||
3500 Xpvtmp->xpv_cur > 1 ||
3501 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3508 return SvIVX(sv) != 0;
3511 return SvNVX(sv) != 0.0;
3518 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3519 * this function provided for binary compatibility only
3524 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3526 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3530 =for apidoc sv_utf8_upgrade
3532 Converts the PV of an SV to its UTF-8-encoded form.
3533 Forces the SV to string form if it is not already.
3534 Always sets the SvUTF8 flag to avoid future validity checks even
3535 if all the bytes have hibit clear.
3537 This is not as a general purpose byte encoding to Unicode interface:
3538 use the Encode extension for that.
3540 =for apidoc sv_utf8_upgrade_flags
3542 Converts the PV of an SV to its UTF-8-encoded form.
3543 Forces the SV to string form if it is not already.
3544 Always sets the SvUTF8 flag to avoid future validity checks even
3545 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3546 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3547 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3549 This is not as a general purpose byte encoding to Unicode interface:
3550 use the Encode extension for that.
3556 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3558 if (sv == &PL_sv_undef)
3562 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3563 (void) sv_2pv_flags(sv,&len, flags);
3567 (void) SvPV_force(sv,len);
3576 sv_force_normal_flags(sv, 0);
3579 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3580 sv_recode_to_utf8(sv, PL_encoding);
3581 else { /* Assume Latin-1/EBCDIC */
3582 /* This function could be much more efficient if we
3583 * had a FLAG in SVs to signal if there are any hibit
3584 * chars in the PV. Given that there isn't such a flag
3585 * make the loop as fast as possible. */
3586 const U8 *s = (U8 *) SvPVX_const(sv);
3587 const U8 *e = (U8 *) SvEND(sv);
3593 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3597 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3598 U8 *recoded = bytes_to_utf8((U8*)s, &len);
3600 SvPV_free(sv); /* No longer using what was there before. */
3602 SvPV_set(sv, (char*)recoded);
3603 SvCUR_set(sv, len - 1);
3604 SvLEN_set(sv, len); /* No longer know the real size. */
3606 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3613 =for apidoc sv_utf8_downgrade
3615 Attempts to convert the PV of an SV from characters to bytes.
3616 If the PV contains a character beyond byte, this conversion will fail;
3617 in this case, either returns false or, if C<fail_ok> is not
3620 This is not as a general purpose Unicode to byte encoding interface:
3621 use the Encode extension for that.
3627 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3629 if (SvPOKp(sv) && SvUTF8(sv)) {
3635 sv_force_normal_flags(sv, 0);
3637 s = (U8 *) SvPV(sv, len);
3638 if (!utf8_to_bytes(s, &len)) {
3643 Perl_croak(aTHX_ "Wide character in %s",
3646 Perl_croak(aTHX_ "Wide character");
3657 =for apidoc sv_utf8_encode
3659 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3660 flag off so that it looks like octets again.
3666 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3668 (void) sv_utf8_upgrade(sv);
3670 sv_force_normal_flags(sv, 0);
3672 if (SvREADONLY(sv)) {
3673 Perl_croak(aTHX_ PL_no_modify);
3679 =for apidoc sv_utf8_decode
3681 If the PV of the SV is an octet sequence in UTF-8
3682 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3683 so that it looks like a character. If the PV contains only single-byte
3684 characters, the C<SvUTF8> flag stays being off.
3685 Scans PV for validity and returns false if the PV is invalid UTF-8.
3691 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3697 /* The octets may have got themselves encoded - get them back as
3700 if (!sv_utf8_downgrade(sv, TRUE))
3703 /* it is actually just a matter of turning the utf8 flag on, but
3704 * we want to make sure everything inside is valid utf8 first.
3706 c = (const U8 *) SvPVX_const(sv);
3707 if (!is_utf8_string(c, SvCUR(sv)+1))
3709 e = (const U8 *) SvEND(sv);
3712 if (!UTF8_IS_INVARIANT(ch)) {
3721 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3722 * this function provided for binary compatibility only
3726 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3728 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3732 =for apidoc sv_setsv
3734 Copies the contents of the source SV C<ssv> into the destination SV
3735 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3736 function if the source SV needs to be reused. Does not handle 'set' magic.
3737 Loosely speaking, it performs a copy-by-value, obliterating any previous
3738 content of the destination.
3740 You probably want to use one of the assortment of wrappers, such as
3741 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3742 C<SvSetMagicSV_nosteal>.
3744 =for apidoc sv_setsv_flags
3746 Copies the contents of the source SV C<ssv> into the destination SV
3747 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3748 function if the source SV needs to be reused. Does not handle 'set' magic.
3749 Loosely speaking, it performs a copy-by-value, obliterating any previous
3750 content of the destination.
3751 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3752 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3753 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3754 and C<sv_setsv_nomg> are implemented in terms of this function.
3756 You probably want to use one of the assortment of wrappers, such as
3757 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3758 C<SvSetMagicSV_nosteal>.
3760 This is the primary function for copying scalars, and most other
3761 copy-ish functions and macros use this underneath.
3767 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3769 register U32 sflags;
3775 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3777 sstr = &PL_sv_undef;
3778 stype = SvTYPE(sstr);
3779 dtype = SvTYPE(dstr);
3784 /* need to nuke the magic */
3786 SvRMAGICAL_off(dstr);
3789 /* There's a lot of redundancy below but we're going for speed here */
3794 if (dtype != SVt_PVGV) {
3795 (void)SvOK_off(dstr);
3803 sv_upgrade(dstr, SVt_IV);
3806 sv_upgrade(dstr, SVt_PVNV);
3810 sv_upgrade(dstr, SVt_PVIV);
3813 (void)SvIOK_only(dstr);
3814 SvIV_set(dstr, SvIVX(sstr));
3817 if (SvTAINTED(sstr))
3828 sv_upgrade(dstr, SVt_NV);
3833 sv_upgrade(dstr, SVt_PVNV);
3836 SvNV_set(dstr, SvNVX(sstr));
3837 (void)SvNOK_only(dstr);
3838 if (SvTAINTED(sstr))
3846 sv_upgrade(dstr, SVt_RV);
3847 else if (dtype == SVt_PVGV &&
3848 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3851 if (GvIMPORTED(dstr) != GVf_IMPORTED
3852 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3854 GvIMPORTED_on(dstr);
3863 #ifdef PERL_OLD_COPY_ON_WRITE
3864 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3865 if (dtype < SVt_PVIV)
3866 sv_upgrade(dstr, SVt_PVIV);
3873 sv_upgrade(dstr, SVt_PV);
3876 if (dtype < SVt_PVIV)
3877 sv_upgrade(dstr, SVt_PVIV);
3880 if (dtype < SVt_PVNV)
3881 sv_upgrade(dstr, SVt_PVNV);
3888 const char * const type = sv_reftype(sstr,0);
3890 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3892 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3897 if (dtype <= SVt_PVGV) {
3899 if (dtype != SVt_PVGV) {
3900 const char * const name = GvNAME(sstr);
3901 const STRLEN len = GvNAMELEN(sstr);
3902 /* don't upgrade SVt_PVLV: it can hold a glob */
3903 if (dtype != SVt_PVLV)
3904 sv_upgrade(dstr, SVt_PVGV);
3905 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3906 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3907 GvNAME(dstr) = savepvn(name, len);
3908 GvNAMELEN(dstr) = len;
3909 SvFAKE_on(dstr); /* can coerce to non-glob */
3911 /* ahem, death to those who redefine active sort subs */
3912 else if (PL_curstackinfo->si_type == PERLSI_SORT
3913 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3914 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3917 #ifdef GV_UNIQUE_CHECK
3918 if (GvUNIQUE((GV*)dstr)) {
3919 Perl_croak(aTHX_ PL_no_modify);
3923 (void)SvOK_off(dstr);
3924 GvINTRO_off(dstr); /* one-shot flag */
3926 GvGP(dstr) = gp_ref(GvGP(sstr));
3927 if (SvTAINTED(sstr))
3929 if (GvIMPORTED(dstr) != GVf_IMPORTED
3930 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3932 GvIMPORTED_on(dstr);
3940 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3942 if ((int)SvTYPE(sstr) != stype) {
3943 stype = SvTYPE(sstr);
3944 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3948 if (stype == SVt_PVLV)
3949 SvUPGRADE(dstr, SVt_PVNV);
3951 SvUPGRADE(dstr, (U32)stype);
3954 sflags = SvFLAGS(sstr);
3956 if (sflags & SVf_ROK) {
3957 if (dtype >= SVt_PV) {
3958 if (dtype == SVt_PVGV) {
3959 SV *sref = SvREFCNT_inc(SvRV(sstr));
3961 const int intro = GvINTRO(dstr);
3963 #ifdef GV_UNIQUE_CHECK
3964 if (GvUNIQUE((GV*)dstr)) {
3965 Perl_croak(aTHX_ PL_no_modify);
3970 GvINTRO_off(dstr); /* one-shot flag */
3971 GvLINE(dstr) = CopLINE(PL_curcop);
3972 GvEGV(dstr) = (GV*)dstr;
3975 switch (SvTYPE(sref)) {
3978 SAVEGENERICSV(GvAV(dstr));
3980 dref = (SV*)GvAV(dstr);
3981 GvAV(dstr) = (AV*)sref;
3982 if (!GvIMPORTED_AV(dstr)
3983 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3985 GvIMPORTED_AV_on(dstr);
3990 SAVEGENERICSV(GvHV(dstr));
3992 dref = (SV*)GvHV(dstr);
3993 GvHV(dstr) = (HV*)sref;
3994 if (!GvIMPORTED_HV(dstr)
3995 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3997 GvIMPORTED_HV_on(dstr);
4002 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4003 SvREFCNT_dec(GvCV(dstr));
4004 GvCV(dstr) = Nullcv;
4005 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4006 PL_sub_generation++;
4008 SAVEGENERICSV(GvCV(dstr));
4011 dref = (SV*)GvCV(dstr);
4012 if (GvCV(dstr) != (CV*)sref) {
4013 CV* cv = GvCV(dstr);
4015 if (!GvCVGEN((GV*)dstr) &&
4016 (CvROOT(cv) || CvXSUB(cv)))
4018 /* ahem, death to those who redefine
4019 * active sort subs */
4020 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4021 PL_sortcop == CvSTART(cv))
4023 "Can't redefine active sort subroutine %s",
4024 GvENAME((GV*)dstr));
4025 /* Redefining a sub - warning is mandatory if
4026 it was a const and its value changed. */
4027 if (ckWARN(WARN_REDEFINE)
4029 && (!CvCONST((CV*)sref)
4030 || sv_cmp(cv_const_sv(cv),
4031 cv_const_sv((CV*)sref)))))
4033 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4035 ? "Constant subroutine %s::%s redefined"
4036 : "Subroutine %s::%s redefined",
4037 HvNAME_get(GvSTASH((GV*)dstr)),
4038 GvENAME((GV*)dstr));
4042 cv_ckproto(cv, (GV*)dstr,
4044 ? SvPVX_const(sref) : Nullch);
4046 GvCV(dstr) = (CV*)sref;
4047 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4048 GvASSUMECV_on(dstr);
4049 PL_sub_generation++;
4051 if (!GvIMPORTED_CV(dstr)
4052 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4054 GvIMPORTED_CV_on(dstr);
4059 SAVEGENERICSV(GvIOp(dstr));
4061 dref = (SV*)GvIOp(dstr);
4062 GvIOp(dstr) = (IO*)sref;
4066 SAVEGENERICSV(GvFORM(dstr));
4068 dref = (SV*)GvFORM(dstr);
4069 GvFORM(dstr) = (CV*)sref;
4073 SAVEGENERICSV(GvSV(dstr));
4075 dref = (SV*)GvSV(dstr);
4077 if (!GvIMPORTED_SV(dstr)
4078 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4080 GvIMPORTED_SV_on(dstr);
4086 if (SvTAINTED(sstr))
4090 if (SvPVX_const(dstr)) {
4096 (void)SvOK_off(dstr);
4097 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4099 if (sflags & SVp_NOK) {
4101 /* Only set the public OK flag if the source has public OK. */
4102 if (sflags & SVf_NOK)
4103 SvFLAGS(dstr) |= SVf_NOK;
4104 SvNV_set(dstr, SvNVX(sstr));
4106 if (sflags & SVp_IOK) {
4107 (void)SvIOKp_on(dstr);
4108 if (sflags & SVf_IOK)
4109 SvFLAGS(dstr) |= SVf_IOK;
4110 if (sflags & SVf_IVisUV)
4112 SvIV_set(dstr, SvIVX(sstr));
4114 if (SvAMAGIC(sstr)) {
4118 else if (sflags & SVp_POK) {
4122 * Check to see if we can just swipe the string. If so, it's a
4123 * possible small lose on short strings, but a big win on long ones.
4124 * It might even be a win on short strings if SvPVX_const(dstr)
4125 * has to be allocated and SvPVX_const(sstr) has to be freed.
4128 /* Whichever path we take through the next code, we want this true,
4129 and doing it now facilitates the COW check. */
4130 (void)SvPOK_only(dstr);
4133 /* We're not already COW */
4134 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4135 #ifndef PERL_OLD_COPY_ON_WRITE
4136 /* or we are, but dstr isn't a suitable target. */
4137 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4142 (sflags & SVs_TEMP) && /* slated for free anyway? */
4143 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4144 (!(flags & SV_NOSTEAL)) &&
4145 /* and we're allowed to steal temps */
4146 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4147 SvLEN(sstr) && /* and really is a string */
4148 /* and won't be needed again, potentially */
4149 !(PL_op && PL_op->op_type == OP_AASSIGN))
4150 #ifdef PERL_OLD_COPY_ON_WRITE
4151 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4152 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4153 && SvTYPE(sstr) >= SVt_PVIV)
4156 /* Failed the swipe test, and it's not a shared hash key either.
4157 Have to copy the string. */
4158 STRLEN len = SvCUR(sstr);
4159 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4160 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4161 SvCUR_set(dstr, len);
4162 *SvEND(dstr) = '\0';
4164 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4166 /* Either it's a shared hash key, or it's suitable for
4167 copy-on-write or we can swipe the string. */
4169 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4173 #ifdef PERL_OLD_COPY_ON_WRITE
4175 /* I believe I should acquire a global SV mutex if
4176 it's a COW sv (not a shared hash key) to stop
4177 it going un copy-on-write.
4178 If the source SV has gone un copy on write between up there
4179 and down here, then (assert() that) it is of the correct
4180 form to make it copy on write again */
4181 if ((sflags & (SVf_FAKE | SVf_READONLY))
4182 != (SVf_FAKE | SVf_READONLY)) {
4183 SvREADONLY_on(sstr);
4185 /* Make the source SV into a loop of 1.
4186 (about to become 2) */
4187 SV_COW_NEXT_SV_SET(sstr, sstr);
4191 /* Initial code is common. */
4192 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4194 SvFLAGS(dstr) &= ~SVf_OOK;
4195 Safefree(SvPVX_const(dstr) - SvIVX(dstr));
4197 else if (SvLEN(dstr))
4198 Safefree(SvPVX_const(dstr));
4202 /* making another shared SV. */
4203 STRLEN cur = SvCUR(sstr);
4204 STRLEN len = SvLEN(sstr);
4205 #ifdef PERL_OLD_COPY_ON_WRITE
4207 assert (SvTYPE(dstr) >= SVt_PVIV);
4208 /* SvIsCOW_normal */
4209 /* splice us in between source and next-after-source. */
4210 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4211 SV_COW_NEXT_SV_SET(sstr, dstr);
4212 SvPV_set(dstr, SvPVX_mutable(sstr));
4216 /* SvIsCOW_shared_hash */
4217 DEBUG_C(PerlIO_printf(Perl_debug_log,
4218 "Copy on write: Sharing hash\n"));
4220 assert (SvTYPE(dstr) >= SVt_PV);
4222 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4224 SvLEN_set(dstr, len);
4225 SvCUR_set(dstr, cur);
4226 SvREADONLY_on(dstr);
4228 /* Relesase a global SV mutex. */
4231 { /* Passes the swipe test. */
4232 SvPV_set(dstr, SvPVX_mutable(sstr));
4233 SvLEN_set(dstr, SvLEN(sstr));
4234 SvCUR_set(dstr, SvCUR(sstr));
4237 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4238 SvPV_set(sstr, Nullch);
4244 if (sflags & SVf_UTF8)
4246 if (sflags & SVp_NOK) {
4248 if (sflags & SVf_NOK)
4249 SvFLAGS(dstr) |= SVf_NOK;
4250 SvNV_set(dstr, SvNVX(sstr));
4252 if (sflags & SVp_IOK) {
4253 (void)SvIOKp_on(dstr);
4254 if (sflags & SVf_IOK)
4255 SvFLAGS(dstr) |= SVf_IOK;
4256 if (sflags & SVf_IVisUV)
4258 SvIV_set(dstr, SvIVX(sstr));
4261 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4262 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4263 smg->mg_ptr, smg->mg_len);
4264 SvRMAGICAL_on(dstr);
4267 else if (sflags & SVp_IOK) {
4268 if (sflags & SVf_IOK)
4269 (void)SvIOK_only(dstr);
4271 (void)SvOK_off(dstr);
4272 (void)SvIOKp_on(dstr);
4274 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4275 if (sflags & SVf_IVisUV)
4277 SvIV_set(dstr, SvIVX(sstr));
4278 if (sflags & SVp_NOK) {
4279 if (sflags & SVf_NOK)
4280 (void)SvNOK_on(dstr);
4282 (void)SvNOKp_on(dstr);
4283 SvNV_set(dstr, SvNVX(sstr));
4286 else if (sflags & SVp_NOK) {
4287 if (sflags & SVf_NOK)
4288 (void)SvNOK_only(dstr);
4290 (void)SvOK_off(dstr);
4293 SvNV_set(dstr, SvNVX(sstr));
4296 if (dtype == SVt_PVGV) {
4297 if (ckWARN(WARN_MISC))
4298 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4301 (void)SvOK_off(dstr);
4303 if (SvTAINTED(sstr))
4308 =for apidoc sv_setsv_mg
4310 Like C<sv_setsv>, but also handles 'set' magic.
4316 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4318 sv_setsv(dstr,sstr);
4322 #ifdef PERL_OLD_COPY_ON_WRITE
4324 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4326 STRLEN cur = SvCUR(sstr);
4327 STRLEN len = SvLEN(sstr);
4328 register char *new_pv;
4331 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4339 if (SvTHINKFIRST(dstr))
4340 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4341 else if (SvPVX_const(dstr))
4342 Safefree(SvPVX_const(dstr));
4346 SvUPGRADE(dstr, SVt_PVIV);
4348 assert (SvPOK(sstr));
4349 assert (SvPOKp(sstr));
4350 assert (!SvIOK(sstr));
4351 assert (!SvIOKp(sstr));
4352 assert (!SvNOK(sstr));
4353 assert (!SvNOKp(sstr));
4355 if (SvIsCOW(sstr)) {
4357 if (SvLEN(sstr) == 0) {
4358 /* source is a COW shared hash key. */
4359 DEBUG_C(PerlIO_printf(Perl_debug_log,
4360 "Fast copy on write: Sharing hash\n"));
4361 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4364 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4366 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4367 SvUPGRADE(sstr, SVt_PVIV);
4368 SvREADONLY_on(sstr);
4370 DEBUG_C(PerlIO_printf(Perl_debug_log,
4371 "Fast copy on write: Converting sstr to COW\n"));
4372 SV_COW_NEXT_SV_SET(dstr, sstr);
4374 SV_COW_NEXT_SV_SET(sstr, dstr);
4375 new_pv = SvPVX_mutable(sstr);
4378 SvPV_set(dstr, new_pv);
4379 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4382 SvLEN_set(dstr, len);
4383 SvCUR_set(dstr, cur);
4392 =for apidoc sv_setpvn
4394 Copies a string into an SV. The C<len> parameter indicates the number of
4395 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4396 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4402 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4404 register char *dptr;
4406 SV_CHECK_THINKFIRST_COW_DROP(sv);
4412 /* len is STRLEN which is unsigned, need to copy to signed */
4415 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4417 SvUPGRADE(sv, SVt_PV);
4419 dptr = SvGROW(sv, len + 1);
4420 Move(ptr,dptr,len,char);
4423 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4428 =for apidoc sv_setpvn_mg
4430 Like C<sv_setpvn>, but also handles 'set' magic.
4436 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4438 sv_setpvn(sv,ptr,len);
4443 =for apidoc sv_setpv
4445 Copies a string into an SV. The string must be null-terminated. Does not
4446 handle 'set' magic. See C<sv_setpv_mg>.
4452 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4454 register STRLEN len;
4456 SV_CHECK_THINKFIRST_COW_DROP(sv);
4462 SvUPGRADE(sv, SVt_PV);
4464 SvGROW(sv, len + 1);
4465 Move(ptr,SvPVX(sv),len+1,char);
4467 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4472 =for apidoc sv_setpv_mg
4474 Like C<sv_setpv>, but also handles 'set' magic.
4480 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4487 =for apidoc sv_usepvn
4489 Tells an SV to use C<ptr> to find its string value. Normally the string is
4490 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4491 The C<ptr> should point to memory that was allocated by C<malloc>. The
4492 string length, C<len>, must be supplied. This function will realloc the
4493 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4494 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4495 See C<sv_usepvn_mg>.
4501 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4504 SV_CHECK_THINKFIRST_COW_DROP(sv);
4505 SvUPGRADE(sv, SVt_PV);
4510 if (SvPVX_const(sv))
4513 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4514 ptr = saferealloc (ptr, allocate);
4517 SvLEN_set(sv, allocate);
4519 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4524 =for apidoc sv_usepvn_mg
4526 Like C<sv_usepvn>, but also handles 'set' magic.
4532 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4534 sv_usepvn(sv,ptr,len);
4538 #ifdef PERL_OLD_COPY_ON_WRITE
4539 /* Need to do this *after* making the SV normal, as we need the buffer
4540 pointer to remain valid until after we've copied it. If we let go too early,
4541 another thread could invalidate it by unsharing last of the same hash key
4542 (which it can do by means other than releasing copy-on-write Svs)
4543 or by changing the other copy-on-write SVs in the loop. */
4545 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4547 if (len) { /* this SV was SvIsCOW_normal(sv) */
4548 /* we need to find the SV pointing to us. */
4549 SV *current = SV_COW_NEXT_SV(after);
4551 if (current == sv) {
4552 /* The SV we point to points back to us (there were only two of us
4554 Hence other SV is no longer copy on write either. */
4556 SvREADONLY_off(after);
4558 /* We need to follow the pointers around the loop. */
4560 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4563 /* don't loop forever if the structure is bust, and we have
4564 a pointer into a closed loop. */
4565 assert (current != after);
4566 assert (SvPVX_const(current) == pvx);
4568 /* Make the SV before us point to the SV after us. */
4569 SV_COW_NEXT_SV_SET(current, after);
4572 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4577 Perl_sv_release_IVX(pTHX_ register SV *sv)
4580 sv_force_normal_flags(sv, 0);
4586 =for apidoc sv_force_normal_flags
4588 Undo various types of fakery on an SV: if the PV is a shared string, make
4589 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4590 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4591 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4592 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4593 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4594 set to some other value.) In addition, the C<flags> parameter gets passed to
4595 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4596 with flags set to 0.
4602 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4604 #ifdef PERL_OLD_COPY_ON_WRITE
4605 if (SvREADONLY(sv)) {
4606 /* At this point I believe I should acquire a global SV mutex. */
4608 const char *pvx = SvPVX_const(sv);
4609 const STRLEN len = SvLEN(sv);
4610 const STRLEN cur = SvCUR(sv);
4611 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4613 PerlIO_printf(Perl_debug_log,
4614 "Copy on write: Force normal %ld\n",
4620 /* This SV doesn't own the buffer, so need to New() a new one: */
4621 SvPV_set(sv, (char*)0);
4623 if (flags & SV_COW_DROP_PV) {
4624 /* OK, so we don't need to copy our buffer. */
4627 SvGROW(sv, cur + 1);
4628 Move(pvx,SvPVX(sv),cur,char);
4632 sv_release_COW(sv, pvx, len, next);
4637 else if (IN_PERL_RUNTIME)
4638 Perl_croak(aTHX_ PL_no_modify);
4639 /* At this point I believe that I can drop the global SV mutex. */
4642 if (SvREADONLY(sv)) {
4644 const char *pvx = SvPVX_const(sv);
4645 const STRLEN len = SvCUR(sv);
4648 SvPV_set(sv, Nullch);
4650 SvGROW(sv, len + 1);
4651 Move(pvx,SvPVX_const(sv),len,char);
4653 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4655 else if (IN_PERL_RUNTIME)
4656 Perl_croak(aTHX_ PL_no_modify);
4660 sv_unref_flags(sv, flags);
4661 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4666 =for apidoc sv_force_normal
4668 Undo various types of fakery on an SV: if the PV is a shared string, make
4669 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4670 an xpvmg. See also C<sv_force_normal_flags>.
4676 Perl_sv_force_normal(pTHX_ register SV *sv)
4678 sv_force_normal_flags(sv, 0);
4684 Efficient removal of characters from the beginning of the string buffer.
4685 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4686 the string buffer. The C<ptr> becomes the first character of the adjusted
4687 string. Uses the "OOK hack".
4688 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4689 refer to the same chunk of data.
4695 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4697 register STRLEN delta;
4698 if (!ptr || !SvPOKp(sv))
4700 delta = ptr - SvPVX_const(sv);
4701 SV_CHECK_THINKFIRST(sv);
4702 if (SvTYPE(sv) < SVt_PVIV)
4703 sv_upgrade(sv,SVt_PVIV);
4706 if (!SvLEN(sv)) { /* make copy of shared string */
4707 const char *pvx = SvPVX_const(sv);
4708 const STRLEN len = SvCUR(sv);
4709 SvGROW(sv, len + 1);
4710 Move(pvx,SvPVX_const(sv),len,char);
4714 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4715 and we do that anyway inside the SvNIOK_off
4717 SvFLAGS(sv) |= SVf_OOK;
4720 SvLEN_set(sv, SvLEN(sv) - delta);
4721 SvCUR_set(sv, SvCUR(sv) - delta);
4722 SvPV_set(sv, SvPVX(sv) + delta);
4723 SvIV_set(sv, SvIVX(sv) + delta);
4726 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4727 * this function provided for binary compatibility only
4731 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4733 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4737 =for apidoc sv_catpvn
4739 Concatenates the string onto the end of the string which is in the SV. The
4740 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4741 status set, then the bytes appended should be valid UTF-8.
4742 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4744 =for apidoc sv_catpvn_flags
4746 Concatenates the string onto the end of the string which is in the SV. The
4747 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4748 status set, then the bytes appended should be valid UTF-8.
4749 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4750 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4751 in terms of this function.
4757 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4760 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4762 SvGROW(dsv, dlen + slen + 1);
4764 sstr = SvPVX_const(dsv);
4765 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4766 SvCUR_set(dsv, SvCUR(dsv) + slen);
4768 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4773 =for apidoc sv_catpvn_mg
4775 Like C<sv_catpvn>, but also handles 'set' magic.
4781 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4783 sv_catpvn(sv,ptr,len);
4787 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4788 * this function provided for binary compatibility only
4792 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4794 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4798 =for apidoc sv_catsv
4800 Concatenates the string from SV C<ssv> onto the end of the string in
4801 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4802 not 'set' magic. See C<sv_catsv_mg>.
4804 =for apidoc sv_catsv_flags
4806 Concatenates the string from SV C<ssv> onto the end of the string in
4807 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4808 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4809 and C<sv_catsv_nomg> are implemented in terms of this function.
4814 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4820 if ((spv = SvPV_const(ssv, slen))) {
4821 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4822 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4823 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4824 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4825 dsv->sv_flags doesn't have that bit set.
4826 Andy Dougherty 12 Oct 2001
4828 const I32 sutf8 = DO_UTF8(ssv);
4831 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4833 dutf8 = DO_UTF8(dsv);
4835 if (dutf8 != sutf8) {
4837 /* Not modifying source SV, so taking a temporary copy. */
4838 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4840 sv_utf8_upgrade(csv);
4841 spv = SvPV_const(csv, slen);
4844 sv_utf8_upgrade_nomg(dsv);
4846 sv_catpvn_nomg(dsv, spv, slen);
4851 =for apidoc sv_catsv_mg
4853 Like C<sv_catsv>, but also handles 'set' magic.
4859 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4866 =for apidoc sv_catpv
4868 Concatenates the string onto the end of the string which is in the SV.
4869 If the SV has the UTF-8 status set, then the bytes appended should be
4870 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4875 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4877 register STRLEN len;
4883 junk = SvPV_force(sv, tlen);
4885 SvGROW(sv, tlen + len + 1);
4887 ptr = SvPVX_const(sv);
4888 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4889 SvCUR_set(sv, SvCUR(sv) + len);
4890 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4895 =for apidoc sv_catpv_mg
4897 Like C<sv_catpv>, but also handles 'set' magic.
4903 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4912 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4913 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4920 Perl_newSV(pTHX_ STRLEN len)
4926 sv_upgrade(sv, SVt_PV);
4927 SvGROW(sv, len + 1);
4932 =for apidoc sv_magicext
4934 Adds magic to an SV, upgrading it if necessary. Applies the
4935 supplied vtable and returns a pointer to the magic added.
4937 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4938 In particular, you can add magic to SvREADONLY SVs, and add more than
4939 one instance of the same 'how'.
4941 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4942 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4943 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4944 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4946 (This is now used as a subroutine by C<sv_magic>.)
4951 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4952 const char* name, I32 namlen)
4956 if (SvTYPE(sv) < SVt_PVMG) {
4957 SvUPGRADE(sv, SVt_PVMG);
4959 Newz(702,mg, 1, MAGIC);
4960 mg->mg_moremagic = SvMAGIC(sv);
4961 SvMAGIC_set(sv, mg);
4963 /* Sometimes a magic contains a reference loop, where the sv and
4964 object refer to each other. To prevent a reference loop that
4965 would prevent such objects being freed, we look for such loops
4966 and if we find one we avoid incrementing the object refcount.
4968 Note we cannot do this to avoid self-tie loops as intervening RV must
4969 have its REFCNT incremented to keep it in existence.
4972 if (!obj || obj == sv ||
4973 how == PERL_MAGIC_arylen ||
4974 how == PERL_MAGIC_qr ||
4975 how == PERL_MAGIC_symtab ||
4976 (SvTYPE(obj) == SVt_PVGV &&
4977 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4978 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4979 GvFORM(obj) == (CV*)sv)))
4984 mg->mg_obj = SvREFCNT_inc(obj);
4985 mg->mg_flags |= MGf_REFCOUNTED;
4988 /* Normal self-ties simply pass a null object, and instead of
4989 using mg_obj directly, use the SvTIED_obj macro to produce a
4990 new RV as needed. For glob "self-ties", we are tieing the PVIO
4991 with an RV obj pointing to the glob containing the PVIO. In
4992 this case, to avoid a reference loop, we need to weaken the
4996 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4997 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5003 mg->mg_len = namlen;
5006 mg->mg_ptr = savepvn(name, namlen);
5007 else if (namlen == HEf_SVKEY)
5008 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5010 mg->mg_ptr = (char *) name;
5012 mg->mg_virtual = vtable;
5016 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5021 =for apidoc sv_magic
5023 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5024 then adds a new magic item of type C<how> to the head of the magic list.
5026 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5027 handling of the C<name> and C<namlen> arguments.
5029 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5030 to add more than one instance of the same 'how'.
5036 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5038 const MGVTBL *vtable = 0;
5041 #ifdef PERL_OLD_COPY_ON_WRITE
5043 sv_force_normal_flags(sv, 0);
5045 if (SvREADONLY(sv)) {
5047 && how != PERL_MAGIC_regex_global
5048 && how != PERL_MAGIC_bm
5049 && how != PERL_MAGIC_fm
5050 && how != PERL_MAGIC_sv
5051 && how != PERL_MAGIC_backref
5054 Perl_croak(aTHX_ PL_no_modify);
5057 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5058 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5059 /* sv_magic() refuses to add a magic of the same 'how' as an
5062 if (how == PERL_MAGIC_taint)
5070 vtable = &PL_vtbl_sv;
5072 case PERL_MAGIC_overload:
5073 vtable = &PL_vtbl_amagic;
5075 case PERL_MAGIC_overload_elem:
5076 vtable = &PL_vtbl_amagicelem;
5078 case PERL_MAGIC_overload_table:
5079 vtable = &PL_vtbl_ovrld;
5082 vtable = &PL_vtbl_bm;
5084 case PERL_MAGIC_regdata:
5085 vtable = &PL_vtbl_regdata;
5087 case PERL_MAGIC_regdatum:
5088 vtable = &PL_vtbl_regdatum;
5090 case PERL_MAGIC_env:
5091 vtable = &PL_vtbl_env;
5094 vtable = &PL_vtbl_fm;
5096 case PERL_MAGIC_envelem:
5097 vtable = &PL_vtbl_envelem;
5099 case PERL_MAGIC_regex_global:
5100 vtable = &PL_vtbl_mglob;
5102 case PERL_MAGIC_isa:
5103 vtable = &PL_vtbl_isa;
5105 case PERL_MAGIC_isaelem:
5106 vtable = &PL_vtbl_isaelem;
5108 case PERL_MAGIC_nkeys:
5109 vtable = &PL_vtbl_nkeys;
5111 case PERL_MAGIC_dbfile:
5114 case PERL_MAGIC_dbline:
5115 vtable = &PL_vtbl_dbline;
5117 #ifdef USE_LOCALE_COLLATE
5118 case PERL_MAGIC_collxfrm:
5119 vtable = &PL_vtbl_collxfrm;
5121 #endif /* USE_LOCALE_COLLATE */
5122 case PERL_MAGIC_tied:
5123 vtable = &PL_vtbl_pack;
5125 case PERL_MAGIC_tiedelem:
5126 case PERL_MAGIC_tiedscalar:
5127 vtable = &PL_vtbl_packelem;
5130 vtable = &PL_vtbl_regexp;
5132 case PERL_MAGIC_sig:
5133 vtable = &PL_vtbl_sig;
5135 case PERL_MAGIC_sigelem:
5136 vtable = &PL_vtbl_sigelem;
5138 case PERL_MAGIC_taint:
5139 vtable = &PL_vtbl_taint;
5141 case PERL_MAGIC_uvar:
5142 vtable = &PL_vtbl_uvar;
5144 case PERL_MAGIC_vec:
5145 vtable = &PL_vtbl_vec;
5147 case PERL_MAGIC_arylen_p:
5148 case PERL_MAGIC_rhash:
5149 case PERL_MAGIC_symtab:
5150 case PERL_MAGIC_vstring:
5153 case PERL_MAGIC_utf8:
5154 vtable = &PL_vtbl_utf8;
5156 case PERL_MAGIC_substr:
5157 vtable = &PL_vtbl_substr;
5159 case PERL_MAGIC_defelem:
5160 vtable = &PL_vtbl_defelem;
5162 case PERL_MAGIC_glob:
5163 vtable = &PL_vtbl_glob;
5165 case PERL_MAGIC_arylen:
5166 vtable = &PL_vtbl_arylen;
5168 case PERL_MAGIC_pos:
5169 vtable = &PL_vtbl_pos;
5171 case PERL_MAGIC_backref:
5172 vtable = &PL_vtbl_backref;
5174 case PERL_MAGIC_ext:
5175 /* Reserved for use by extensions not perl internals. */
5176 /* Useful for attaching extension internal data to perl vars. */
5177 /* Note that multiple extensions may clash if magical scalars */
5178 /* etc holding private data from one are passed to another. */
5181 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5184 /* Rest of work is done else where */
5185 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5188 case PERL_MAGIC_taint:
5191 case PERL_MAGIC_ext:
5192 case PERL_MAGIC_dbfile:
5199 =for apidoc sv_unmagic
5201 Removes all magic of type C<type> from an SV.
5207 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5211 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5214 for (mg = *mgp; mg; mg = *mgp) {
5215 if (mg->mg_type == type) {
5216 const MGVTBL* const vtbl = mg->mg_virtual;
5217 *mgp = mg->mg_moremagic;
5218 if (vtbl && vtbl->svt_free)
5219 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5220 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5222 Safefree(mg->mg_ptr);
5223 else if (mg->mg_len == HEf_SVKEY)
5224 SvREFCNT_dec((SV*)mg->mg_ptr);
5225 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5226 Safefree(mg->mg_ptr);
5228 if (mg->mg_flags & MGf_REFCOUNTED)
5229 SvREFCNT_dec(mg->mg_obj);
5233 mgp = &mg->mg_moremagic;
5237 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5244 =for apidoc sv_rvweaken
5246 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5247 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5248 push a back-reference to this RV onto the array of backreferences
5249 associated with that magic.
5255 Perl_sv_rvweaken(pTHX_ SV *sv)
5258 if (!SvOK(sv)) /* let undefs pass */
5261 Perl_croak(aTHX_ "Can't weaken a nonreference");
5262 else if (SvWEAKREF(sv)) {
5263 if (ckWARN(WARN_MISC))
5264 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5268 sv_add_backref(tsv, sv);
5274 /* Give tsv backref magic if it hasn't already got it, then push a
5275 * back-reference to sv onto the array associated with the backref magic.
5279 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5283 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5284 av = (AV*)mg->mg_obj;
5287 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5288 /* av now has a refcnt of 2, which avoids it getting freed
5289 * before us during global cleanup. The extra ref is removed
5290 * by magic_killbackrefs() when tsv is being freed */
5292 if (AvFILLp(av) >= AvMAX(av)) {
5294 SV **svp = AvARRAY(av);
5295 for (i = AvFILLp(av); i >= 0; i--)
5297 svp[i] = sv; /* reuse the slot */
5300 av_extend(av, AvFILLp(av)+1);
5302 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5305 /* delete a back-reference to ourselves from the backref magic associated
5306 * with the SV we point to.
5310 S_sv_del_backref(pTHX_ SV *sv)
5317 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5318 Perl_croak(aTHX_ "panic: del_backref");
5319 av = (AV *)mg->mg_obj;
5321 for (i = AvFILLp(av); i >= 0; i--)
5322 if (svp[i] == sv) svp[i] = Nullsv;
5326 =for apidoc sv_insert
5328 Inserts a string at the specified offset/length within the SV. Similar to
5329 the Perl substr() function.
5335 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5339 register char *midend;
5340 register char *bigend;
5346 Perl_croak(aTHX_ "Can't modify non-existent substring");
5347 SvPV_force(bigstr, curlen);
5348 (void)SvPOK_only_UTF8(bigstr);
5349 if (offset + len > curlen) {
5350 SvGROW(bigstr, offset+len+1);
5351 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5352 SvCUR_set(bigstr, offset+len);
5356 i = littlelen - len;
5357 if (i > 0) { /* string might grow */
5358 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5359 mid = big + offset + len;
5360 midend = bigend = big + SvCUR(bigstr);
5363 while (midend > mid) /* shove everything down */
5364 *--bigend = *--midend;
5365 Move(little,big+offset,littlelen,char);
5366 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5371 Move(little,SvPVX(bigstr)+offset,len,char);
5376 big = SvPVX(bigstr);
5379 bigend = big + SvCUR(bigstr);
5381 if (midend > bigend)
5382 Perl_croak(aTHX_ "panic: sv_insert");
5384 if (mid - big > bigend - midend) { /* faster to shorten from end */
5386 Move(little, mid, littlelen,char);
5389 i = bigend - midend;
5391 Move(midend, mid, i,char);
5395 SvCUR_set(bigstr, mid - big);
5397 else if ((i = mid - big)) { /* faster from front */
5398 midend -= littlelen;
5400 sv_chop(bigstr,midend-i);
5405 Move(little, mid, littlelen,char);
5407 else if (littlelen) {
5408 midend -= littlelen;
5409 sv_chop(bigstr,midend);
5410 Move(little,midend,littlelen,char);
5413 sv_chop(bigstr,midend);
5419 =for apidoc sv_replace
5421 Make the first argument a copy of the second, then delete the original.
5422 The target SV physically takes over ownership of the body of the source SV
5423 and inherits its flags; however, the target keeps any magic it owns,
5424 and any magic in the source is discarded.
5425 Note that this is a rather specialist SV copying operation; most of the
5426 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5432 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5434 const U32 refcnt = SvREFCNT(sv);
5435 SV_CHECK_THINKFIRST_COW_DROP(sv);
5436 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5437 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5438 if (SvMAGICAL(sv)) {
5442 sv_upgrade(nsv, SVt_PVMG);
5443 SvMAGIC_set(nsv, SvMAGIC(sv));
5444 SvFLAGS(nsv) |= SvMAGICAL(sv);
5446 SvMAGIC_set(sv, NULL);
5450 assert(!SvREFCNT(sv));
5451 #ifdef DEBUG_LEAKING_SCALARS
5452 sv->sv_flags = nsv->sv_flags;
5453 sv->sv_any = nsv->sv_any;
5454 sv->sv_refcnt = nsv->sv_refcnt;
5455 sv->sv_u = nsv->sv_u;
5457 StructCopy(nsv,sv,SV);
5459 /* Currently could join these into one piece of pointer arithmetic, but
5460 it would be unclear. */
5461 if(SvTYPE(sv) == SVt_IV)
5463 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5464 else if (SvTYPE(sv) == SVt_RV) {
5465 SvANY(sv) = &sv->sv_u.svu_rv;
5469 #ifdef PERL_OLD_COPY_ON_WRITE
5470 if (SvIsCOW_normal(nsv)) {
5471 /* We need to follow the pointers around the loop to make the
5472 previous SV point to sv, rather than nsv. */
5475 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5478 assert(SvPVX_const(current) == SvPVX_const(nsv));
5480 /* Make the SV before us point to the SV after us. */
5482 PerlIO_printf(Perl_debug_log, "previous is\n");
5484 PerlIO_printf(Perl_debug_log,
5485 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5486 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5488 SV_COW_NEXT_SV_SET(current, sv);
5491 SvREFCNT(sv) = refcnt;
5492 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5498 =for apidoc sv_clear
5500 Clear an SV: call any destructors, free up any memory used by the body,
5501 and free the body itself. The SV's head is I<not> freed, although
5502 its type is set to all 1's so that it won't inadvertently be assumed
5503 to be live during global destruction etc.
5504 This function should only be called when REFCNT is zero. Most of the time
5505 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5512 Perl_sv_clear(pTHX_ register SV *sv)
5517 assert(SvREFCNT(sv) == 0);
5520 if (PL_defstash) { /* Still have a symbol table? */
5524 stash = SvSTASH(sv);
5525 destructor = StashHANDLER(stash,DESTROY);
5527 SV* tmpref = newRV(sv);
5528 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5530 PUSHSTACKi(PERLSI_DESTROY);
5535 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5541 if(SvREFCNT(tmpref) < 2) {
5542 /* tmpref is not kept alive! */
5544 SvRV_set(tmpref, NULL);
5547 SvREFCNT_dec(tmpref);
5549 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5553 if (PL_in_clean_objs)
5554 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5556 /* DESTROY gave object new lease on life */
5562 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5563 SvOBJECT_off(sv); /* Curse the object. */
5564 if (SvTYPE(sv) != SVt_PVIO)
5565 --PL_sv_objcount; /* XXX Might want something more general */
5568 if (SvTYPE(sv) >= SVt_PVMG) {
5571 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5572 SvREFCNT_dec(SvSTASH(sv));
5575 switch (SvTYPE(sv)) {
5578 IoIFP(sv) != PerlIO_stdin() &&
5579 IoIFP(sv) != PerlIO_stdout() &&
5580 IoIFP(sv) != PerlIO_stderr())
5582 io_close((IO*)sv, FALSE);
5584 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5585 PerlDir_close(IoDIRP(sv));
5586 IoDIRP(sv) = (DIR*)NULL;
5587 Safefree(IoTOP_NAME(sv));
5588 Safefree(IoFMT_NAME(sv));
5589 Safefree(IoBOTTOM_NAME(sv));
5604 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5605 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5606 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5607 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5609 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5610 SvREFCNT_dec(LvTARG(sv));
5614 Safefree(GvNAME(sv));
5615 /* cannot decrease stash refcount yet, as we might recursively delete
5616 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5617 of stash until current sv is completely gone.
5618 -- JohnPC, 27 Mar 1998 */
5619 stash = GvSTASH(sv);
5625 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5627 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5628 /* Don't even bother with turning off the OOK flag. */
5637 SvREFCNT_dec(SvRV(sv));
5639 #ifdef PERL_OLD_COPY_ON_WRITE
5640 else if (SvPVX_const(sv)) {
5642 /* I believe I need to grab the global SV mutex here and
5643 then recheck the COW status. */
5645 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5648 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5649 SV_COW_NEXT_SV(sv));
5650 /* And drop it here. */
5652 } else if (SvLEN(sv)) {
5653 Safefree(SvPVX_const(sv));
5657 else if (SvPVX_const(sv) && SvLEN(sv))
5658 Safefree(SvPVX_const(sv));
5659 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5660 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5673 switch (SvTYPE(sv)) {
5687 del_XPVIV(SvANY(sv));
5690 del_XPVNV(SvANY(sv));
5693 del_XPVMG(SvANY(sv));
5696 del_XPVLV(SvANY(sv));
5699 del_XPVAV(SvANY(sv));
5702 del_XPVHV(SvANY(sv));
5705 del_XPVCV(SvANY(sv));
5708 del_XPVGV(SvANY(sv));
5709 /* code duplication for increased performance. */
5710 SvFLAGS(sv) &= SVf_BREAK;
5711 SvFLAGS(sv) |= SVTYPEMASK;
5712 /* decrease refcount of the stash that owns this GV, if any */
5714 SvREFCNT_dec(stash);
5715 return; /* not break, SvFLAGS reset already happened */
5717 del_XPVBM(SvANY(sv));
5720 del_XPVFM(SvANY(sv));
5723 del_XPVIO(SvANY(sv));
5726 SvFLAGS(sv) &= SVf_BREAK;
5727 SvFLAGS(sv) |= SVTYPEMASK;
5731 =for apidoc sv_newref
5733 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5740 Perl_sv_newref(pTHX_ SV *sv)
5750 Decrement an SV's reference count, and if it drops to zero, call
5751 C<sv_clear> to invoke destructors and free up any memory used by
5752 the body; finally, deallocate the SV's head itself.
5753 Normally called via a wrapper macro C<SvREFCNT_dec>.
5759 Perl_sv_free(pTHX_ SV *sv)
5764 if (SvREFCNT(sv) == 0) {
5765 if (SvFLAGS(sv) & SVf_BREAK)
5766 /* this SV's refcnt has been artificially decremented to
5767 * trigger cleanup */
5769 if (PL_in_clean_all) /* All is fair */
5771 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5772 /* make sure SvREFCNT(sv)==0 happens very seldom */
5773 SvREFCNT(sv) = (~(U32)0)/2;
5776 if (ckWARN_d(WARN_INTERNAL))
5777 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5778 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5779 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5782 if (--(SvREFCNT(sv)) > 0)
5784 Perl_sv_free2(aTHX_ sv);
5788 Perl_sv_free2(pTHX_ SV *sv)
5793 if (ckWARN_d(WARN_DEBUGGING))
5794 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5795 "Attempt to free temp prematurely: SV 0x%"UVxf
5796 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5800 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5801 /* make sure SvREFCNT(sv)==0 happens very seldom */
5802 SvREFCNT(sv) = (~(U32)0)/2;
5813 Returns the length of the string in the SV. Handles magic and type
5814 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5820 Perl_sv_len(pTHX_ register SV *sv)
5828 len = mg_length(sv);
5830 (void)SvPV_const(sv, len);
5835 =for apidoc sv_len_utf8
5837 Returns the number of characters in the string in an SV, counting wide
5838 UTF-8 bytes as a single character. Handles magic and type coercion.
5844 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5845 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5846 * (Note that the mg_len is not the length of the mg_ptr field.)
5851 Perl_sv_len_utf8(pTHX_ register SV *sv)
5857 return mg_length(sv);
5861 const U8 *s = (U8*)SvPV_const(sv, len);
5862 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5864 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5866 #ifdef PERL_UTF8_CACHE_ASSERT
5867 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5871 ulen = Perl_utf8_length(aTHX_ s, s + len);
5872 if (!mg && !SvREADONLY(sv)) {
5873 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5874 mg = mg_find(sv, PERL_MAGIC_utf8);
5884 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5885 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5886 * between UTF-8 and byte offsets. There are two (substr offset and substr
5887 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5888 * and byte offset) cache positions.
5890 * The mg_len field is used by sv_len_utf8(), see its comments.
5891 * Note that the mg_len is not the length of the mg_ptr field.
5895 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5896 I32 offsetp, const U8 *s, const U8 *start)
5900 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5902 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5906 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5908 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5909 (*mgp)->mg_ptr = (char *) *cachep;
5913 (*cachep)[i] = offsetp;
5914 (*cachep)[i+1] = s - start;
5922 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5923 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5924 * between UTF-8 and byte offsets. See also the comments of
5925 * S_utf8_mg_pos_init().
5929 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)
5933 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5935 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5936 if (*mgp && (*mgp)->mg_ptr) {
5937 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5938 ASSERT_UTF8_CACHE(*cachep);
5939 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5941 else { /* We will skip to the right spot. */
5946 /* The assumption is that going backward is half
5947 * the speed of going forward (that's where the
5948 * 2 * backw in the below comes from). (The real
5949 * figure of course depends on the UTF-8 data.) */
5951 if ((*cachep)[i] > (STRLEN)uoff) {
5953 backw = (*cachep)[i] - (STRLEN)uoff;
5955 if (forw < 2 * backw)
5958 p = start + (*cachep)[i+1];
5960 /* Try this only for the substr offset (i == 0),
5961 * not for the substr length (i == 2). */
5962 else if (i == 0) { /* (*cachep)[i] < uoff */
5963 const STRLEN ulen = sv_len_utf8(sv);
5965 if ((STRLEN)uoff < ulen) {
5966 forw = (STRLEN)uoff - (*cachep)[i];
5967 backw = ulen - (STRLEN)uoff;
5969 if (forw < 2 * backw)
5970 p = start + (*cachep)[i+1];
5975 /* If the string is not long enough for uoff,
5976 * we could extend it, but not at this low a level. */
5980 if (forw < 2 * backw) {
5987 while (UTF8_IS_CONTINUATION(*p))
5992 /* Update the cache. */
5993 (*cachep)[i] = (STRLEN)uoff;
5994 (*cachep)[i+1] = p - start;
5996 /* Drop the stale "length" cache */
6005 if (found) { /* Setup the return values. */
6006 *offsetp = (*cachep)[i+1];
6007 *sp = start + *offsetp;
6010 *offsetp = send - start;
6012 else if (*sp < start) {
6018 #ifdef PERL_UTF8_CACHE_ASSERT
6023 while (n-- && s < send)
6027 assert(*offsetp == s - start);
6028 assert((*cachep)[0] == (STRLEN)uoff);
6029 assert((*cachep)[1] == *offsetp);
6031 ASSERT_UTF8_CACHE(*cachep);
6040 =for apidoc sv_pos_u2b
6042 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6043 the start of the string, to a count of the equivalent number of bytes; if
6044 lenp is non-zero, it does the same to lenp, but this time starting from
6045 the offset, rather than from the start of the string. Handles magic and
6052 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6053 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6054 * byte offsets. See also the comments of S_utf8_mg_pos().
6059 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6067 start = (U8*)SvPV_const(sv, len);
6071 const U8 *s = start;
6072 I32 uoffset = *offsetp;
6073 const U8 *send = s + len;
6077 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6079 if (!found && uoffset > 0) {
6080 while (s < send && uoffset--)
6084 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6086 *offsetp = s - start;
6091 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6095 if (!found && *lenp > 0) {
6098 while (s < send && ulen--)
6102 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6106 ASSERT_UTF8_CACHE(cache);
6118 =for apidoc sv_pos_b2u
6120 Converts the value pointed to by offsetp from a count of bytes from the
6121 start of the string, to a count of the equivalent number of UTF-8 chars.
6122 Handles magic and type coercion.
6128 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6129 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6130 * byte offsets. See also the comments of S_utf8_mg_pos().
6135 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6143 s = (const U8*)SvPV_const(sv, len);
6144 if ((I32)len < *offsetp)
6145 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6147 const U8* send = s + *offsetp;
6149 STRLEN *cache = NULL;
6153 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6154 mg = mg_find(sv, PERL_MAGIC_utf8);
6155 if (mg && mg->mg_ptr) {
6156 cache = (STRLEN *) mg->mg_ptr;
6157 if (cache[1] == (STRLEN)*offsetp) {
6158 /* An exact match. */
6159 *offsetp = cache[0];
6163 else if (cache[1] < (STRLEN)*offsetp) {
6164 /* We already know part of the way. */
6167 /* Let the below loop do the rest. */
6169 else { /* cache[1] > *offsetp */
6170 /* We already know all of the way, now we may
6171 * be able to walk back. The same assumption
6172 * is made as in S_utf8_mg_pos(), namely that
6173 * walking backward is twice slower than
6174 * walking forward. */
6175 STRLEN forw = *offsetp;
6176 STRLEN backw = cache[1] - *offsetp;
6178 if (!(forw < 2 * backw)) {
6179 const U8 *p = s + cache[1];
6186 while (UTF8_IS_CONTINUATION(*p)) {
6194 *offsetp = cache[0];
6196 /* Drop the stale "length" cache */
6204 ASSERT_UTF8_CACHE(cache);
6210 /* Call utf8n_to_uvchr() to validate the sequence
6211 * (unless a simple non-UTF character) */
6212 if (!UTF8_IS_INVARIANT(*s))
6213 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6222 if (!SvREADONLY(sv)) {
6224 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6225 mg = mg_find(sv, PERL_MAGIC_utf8);
6230 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6231 mg->mg_ptr = (char *) cache;
6236 cache[1] = *offsetp;
6237 /* Drop the stale "length" cache */
6250 Returns a boolean indicating whether the strings in the two SVs are
6251 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6252 coerce its args to strings if necessary.
6258 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6266 SV* svrecode = Nullsv;
6273 pv1 = SvPV_const(sv1, cur1);
6280 pv2 = SvPV_const(sv2, cur2);
6282 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6283 /* Differing utf8ness.
6284 * Do not UTF8size the comparands as a side-effect. */
6287 svrecode = newSVpvn(pv2, cur2);
6288 sv_recode_to_utf8(svrecode, PL_encoding);
6289 pv2 = SvPV_const(svrecode, cur2);
6292 svrecode = newSVpvn(pv1, cur1);
6293 sv_recode_to_utf8(svrecode, PL_encoding);
6294 pv1 = SvPV_const(svrecode, cur1);
6296 /* Now both are in UTF-8. */
6298 SvREFCNT_dec(svrecode);
6303 bool is_utf8 = TRUE;
6306 /* sv1 is the UTF-8 one,
6307 * if is equal it must be downgrade-able */
6308 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6314 /* sv2 is the UTF-8 one,
6315 * if is equal it must be downgrade-able */
6316 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6322 /* Downgrade not possible - cannot be eq */
6330 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6333 SvREFCNT_dec(svrecode);
6344 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6345 string in C<sv1> is less than, equal to, or greater than the string in
6346 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6347 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6353 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6356 const char *pv1, *pv2;
6359 SV *svrecode = Nullsv;
6366 pv1 = SvPV_const(sv1, cur1);
6373 pv2 = SvPV_const(sv2, cur2);
6375 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6376 /* Differing utf8ness.
6377 * Do not UTF8size the comparands as a side-effect. */
6380 svrecode = newSVpvn(pv2, cur2);
6381 sv_recode_to_utf8(svrecode, PL_encoding);
6382 pv2 = SvPV_const(svrecode, cur2);
6385 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6390 svrecode = newSVpvn(pv1, cur1);
6391 sv_recode_to_utf8(svrecode, PL_encoding);
6392 pv1 = SvPV_const(svrecode, cur1);
6395 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6401 cmp = cur2 ? -1 : 0;
6405 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6408 cmp = retval < 0 ? -1 : 1;
6409 } else if (cur1 == cur2) {
6412 cmp = cur1 < cur2 ? -1 : 1;
6417 SvREFCNT_dec(svrecode);
6426 =for apidoc sv_cmp_locale
6428 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6429 'use bytes' aware, handles get magic, and will coerce its args to strings
6430 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6436 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6438 #ifdef USE_LOCALE_COLLATE
6444 if (PL_collation_standard)
6448 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6450 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6452 if (!pv1 || !len1) {
6463 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6466 return retval < 0 ? -1 : 1;
6469 * When the result of collation is equality, that doesn't mean
6470 * that there are no differences -- some locales exclude some
6471 * characters from consideration. So to avoid false equalities,
6472 * we use the raw string as a tiebreaker.
6478 #endif /* USE_LOCALE_COLLATE */
6480 return sv_cmp(sv1, sv2);
6484 #ifdef USE_LOCALE_COLLATE
6487 =for apidoc sv_collxfrm
6489 Add Collate Transform magic to an SV if it doesn't already have it.
6491 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6492 scalar data of the variable, but transformed to such a format that a normal
6493 memory comparison can be used to compare the data according to the locale
6500 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6504 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6505 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6511 Safefree(mg->mg_ptr);
6512 s = SvPV_const(sv, len);
6513 if ((xf = mem_collxfrm(s, len, &xlen))) {
6514 if (SvREADONLY(sv)) {
6517 return xf + sizeof(PL_collation_ix);
6520 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6521 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6534 if (mg && mg->mg_ptr) {
6536 return mg->mg_ptr + sizeof(PL_collation_ix);
6544 #endif /* USE_LOCALE_COLLATE */
6549 Get a line from the filehandle and store it into the SV, optionally
6550 appending to the currently-stored string.
6556 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6560 register STDCHAR rslast;
6561 register STDCHAR *bp;
6567 if (SvTHINKFIRST(sv))
6568 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6569 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6571 However, perlbench says it's slower, because the existing swipe code
6572 is faster than copy on write.
6573 Swings and roundabouts. */
6574 SvUPGRADE(sv, SVt_PV);
6579 if (PerlIO_isutf8(fp)) {
6581 sv_utf8_upgrade_nomg(sv);
6582 sv_pos_u2b(sv,&append,0);
6584 } else if (SvUTF8(sv)) {
6585 SV *tsv = NEWSV(0,0);
6586 sv_gets(tsv, fp, 0);
6587 sv_utf8_upgrade_nomg(tsv);
6588 SvCUR_set(sv,append);
6591 goto return_string_or_null;
6596 if (PerlIO_isutf8(fp))
6599 if (IN_PERL_COMPILETIME) {
6600 /* we always read code in line mode */
6604 else if (RsSNARF(PL_rs)) {
6605 /* If it is a regular disk file use size from stat() as estimate
6606 of amount we are going to read - may result in malloc-ing
6607 more memory than we realy need if layers bellow reduce
6608 size we read (e.g. CRLF or a gzip layer)
6611 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6612 const Off_t offset = PerlIO_tell(fp);
6613 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6614 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6620 else if (RsRECORD(PL_rs)) {
6624 /* Grab the size of the record we're getting */
6625 recsize = SvIV(SvRV(PL_rs));
6626 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6629 /* VMS wants read instead of fread, because fread doesn't respect */
6630 /* RMS record boundaries. This is not necessarily a good thing to be */
6631 /* doing, but we've got no other real choice - except avoid stdio
6632 as implementation - perhaps write a :vms layer ?
6634 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6636 bytesread = PerlIO_read(fp, buffer, recsize);
6640 SvCUR_set(sv, bytesread += append);
6641 buffer[bytesread] = '\0';
6642 goto return_string_or_null;
6644 else if (RsPARA(PL_rs)) {
6650 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6651 if (PerlIO_isutf8(fp)) {
6652 rsptr = SvPVutf8(PL_rs, rslen);
6655 if (SvUTF8(PL_rs)) {
6656 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6657 Perl_croak(aTHX_ "Wide character in $/");
6660 rsptr = SvPV_const(PL_rs, rslen);
6664 rslast = rslen ? rsptr[rslen - 1] : '\0';
6666 if (rspara) { /* have to do this both before and after */
6667 do { /* to make sure file boundaries work right */
6670 i = PerlIO_getc(fp);
6674 PerlIO_ungetc(fp,i);
6680 /* See if we know enough about I/O mechanism to cheat it ! */
6682 /* This used to be #ifdef test - it is made run-time test for ease
6683 of abstracting out stdio interface. One call should be cheap
6684 enough here - and may even be a macro allowing compile
6688 if (PerlIO_fast_gets(fp)) {
6691 * We're going to steal some values from the stdio struct
6692 * and put EVERYTHING in the innermost loop into registers.
6694 register STDCHAR *ptr;
6698 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6699 /* An ungetc()d char is handled separately from the regular
6700 * buffer, so we getc() it back out and stuff it in the buffer.
6702 i = PerlIO_getc(fp);
6703 if (i == EOF) return 0;
6704 *(--((*fp)->_ptr)) = (unsigned char) i;
6708 /* Here is some breathtakingly efficient cheating */
6710 cnt = PerlIO_get_cnt(fp); /* get count into register */
6711 /* make sure we have the room */
6712 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6713 /* Not room for all of it
6714 if we are looking for a separator and room for some
6716 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6717 /* just process what we have room for */
6718 shortbuffered = cnt - SvLEN(sv) + append + 1;
6719 cnt -= shortbuffered;
6723 /* remember that cnt can be negative */
6724 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6729 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6730 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6731 DEBUG_P(PerlIO_printf(Perl_debug_log,
6732 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6733 DEBUG_P(PerlIO_printf(Perl_debug_log,
6734 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6735 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6736 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6741 while (cnt > 0) { /* this | eat */
6743 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6744 goto thats_all_folks; /* screams | sed :-) */
6748 Copy(ptr, bp, cnt, char); /* this | eat */
6749 bp += cnt; /* screams | dust */
6750 ptr += cnt; /* louder | sed :-) */
6755 if (shortbuffered) { /* oh well, must extend */
6756 cnt = shortbuffered;
6758 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6760 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6761 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6765 DEBUG_P(PerlIO_printf(Perl_debug_log,
6766 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6767 PTR2UV(ptr),(long)cnt));
6768 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6770 DEBUG_P(PerlIO_printf(Perl_debug_log,
6771 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6772 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6773 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6775 /* This used to call 'filbuf' in stdio form, but as that behaves like
6776 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6777 another abstraction. */
6778 i = PerlIO_getc(fp); /* get more characters */
6780 DEBUG_P(PerlIO_printf(Perl_debug_log,
6781 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6782 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6783 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6785 cnt = PerlIO_get_cnt(fp);
6786 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6787 DEBUG_P(PerlIO_printf(Perl_debug_log,
6788 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6790 if (i == EOF) /* all done for ever? */
6791 goto thats_really_all_folks;
6793 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6795 SvGROW(sv, bpx + cnt + 2);
6796 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6798 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6800 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6801 goto thats_all_folks;
6805 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6806 memNE((char*)bp - rslen, rsptr, rslen))
6807 goto screamer; /* go back to the fray */
6808 thats_really_all_folks:
6810 cnt += shortbuffered;
6811 DEBUG_P(PerlIO_printf(Perl_debug_log,
6812 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6813 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6814 DEBUG_P(PerlIO_printf(Perl_debug_log,
6815 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6816 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6817 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6819 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6820 DEBUG_P(PerlIO_printf(Perl_debug_log,
6821 "Screamer: done, len=%ld, string=|%.*s|\n",
6822 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6826 /*The big, slow, and stupid way. */
6827 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6829 New(0, buf, 8192, STDCHAR);
6837 const register STDCHAR *bpe = buf + sizeof(buf);
6839 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6840 ; /* keep reading */
6844 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6845 /* Accomodate broken VAXC compiler, which applies U8 cast to
6846 * both args of ?: operator, causing EOF to change into 255
6849 i = (U8)buf[cnt - 1];
6855 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6857 sv_catpvn(sv, (char *) buf, cnt);
6859 sv_setpvn(sv, (char *) buf, cnt);
6861 if (i != EOF && /* joy */
6863 SvCUR(sv) < rslen ||
6864 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6868 * If we're reading from a TTY and we get a short read,
6869 * indicating that the user hit his EOF character, we need
6870 * to notice it now, because if we try to read from the TTY
6871 * again, the EOF condition will disappear.
6873 * The comparison of cnt to sizeof(buf) is an optimization
6874 * that prevents unnecessary calls to feof().
6878 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6882 #ifdef USE_HEAP_INSTEAD_OF_STACK
6887 if (rspara) { /* have to do this both before and after */
6888 while (i != EOF) { /* to make sure file boundaries work right */
6889 i = PerlIO_getc(fp);
6891 PerlIO_ungetc(fp,i);
6897 return_string_or_null:
6898 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6904 Auto-increment of the value in the SV, doing string to numeric conversion
6905 if necessary. Handles 'get' magic.
6911 Perl_sv_inc(pTHX_ register SV *sv)
6920 if (SvTHINKFIRST(sv)) {
6922 sv_force_normal_flags(sv, 0);
6923 if (SvREADONLY(sv)) {
6924 if (IN_PERL_RUNTIME)
6925 Perl_croak(aTHX_ PL_no_modify);
6929 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6931 i = PTR2IV(SvRV(sv));
6936 flags = SvFLAGS(sv);
6937 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6938 /* It's (privately or publicly) a float, but not tested as an
6939 integer, so test it to see. */
6941 flags = SvFLAGS(sv);
6943 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6944 /* It's publicly an integer, or privately an integer-not-float */
6945 #ifdef PERL_PRESERVE_IVUV
6949 if (SvUVX(sv) == UV_MAX)
6950 sv_setnv(sv, UV_MAX_P1);
6952 (void)SvIOK_only_UV(sv);
6953 SvUV_set(sv, SvUVX(sv) + 1);
6955 if (SvIVX(sv) == IV_MAX)
6956 sv_setuv(sv, (UV)IV_MAX + 1);
6958 (void)SvIOK_only(sv);
6959 SvIV_set(sv, SvIVX(sv) + 1);
6964 if (flags & SVp_NOK) {
6965 (void)SvNOK_only(sv);
6966 SvNV_set(sv, SvNVX(sv) + 1.0);
6970 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6971 if ((flags & SVTYPEMASK) < SVt_PVIV)
6972 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6973 (void)SvIOK_only(sv);
6978 while (isALPHA(*d)) d++;
6979 while (isDIGIT(*d)) d++;
6981 #ifdef PERL_PRESERVE_IVUV
6982 /* Got to punt this as an integer if needs be, but we don't issue
6983 warnings. Probably ought to make the sv_iv_please() that does
6984 the conversion if possible, and silently. */
6985 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6986 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6987 /* Need to try really hard to see if it's an integer.
6988 9.22337203685478e+18 is an integer.
6989 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6990 so $a="9.22337203685478e+18"; $a+0; $a++
6991 needs to be the same as $a="9.22337203685478e+18"; $a++
6998 /* sv_2iv *should* have made this an NV */
6999 if (flags & SVp_NOK) {
7000 (void)SvNOK_only(sv);
7001 SvNV_set(sv, SvNVX(sv) + 1.0);
7004 /* I don't think we can get here. Maybe I should assert this
7005 And if we do get here I suspect that sv_setnv will croak. NWC
7007 #if defined(USE_LONG_DOUBLE)
7008 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",
7009 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7011 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7012 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7015 #endif /* PERL_PRESERVE_IVUV */
7016 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
7020 while (d >= SvPVX_const(sv)) {
7028 /* MKS: The original code here died if letters weren't consecutive.
7029 * at least it didn't have to worry about non-C locales. The
7030 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7031 * arranged in order (although not consecutively) and that only
7032 * [A-Za-z] are accepted by isALPHA in the C locale.
7034 if (*d != 'z' && *d != 'Z') {
7035 do { ++*d; } while (!isALPHA(*d));
7038 *(d--) -= 'z' - 'a';
7043 *(d--) -= 'z' - 'a' + 1;
7047 /* oh,oh, the number grew */
7048 SvGROW(sv, SvCUR(sv) + 2);
7049 SvCUR_set(sv, SvCUR(sv) + 1);
7050 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
7061 Auto-decrement of the value in the SV, doing string to numeric conversion
7062 if necessary. Handles 'get' magic.
7068 Perl_sv_dec(pTHX_ register SV *sv)
7076 if (SvTHINKFIRST(sv)) {
7078 sv_force_normal_flags(sv, 0);
7079 if (SvREADONLY(sv)) {
7080 if (IN_PERL_RUNTIME)
7081 Perl_croak(aTHX_ PL_no_modify);
7085 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7087 i = PTR2IV(SvRV(sv));
7092 /* Unlike sv_inc we don't have to worry about string-never-numbers
7093 and keeping them magic. But we mustn't warn on punting */
7094 flags = SvFLAGS(sv);
7095 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7096 /* It's publicly an integer, or privately an integer-not-float */
7097 #ifdef PERL_PRESERVE_IVUV
7101 if (SvUVX(sv) == 0) {
7102 (void)SvIOK_only(sv);
7106 (void)SvIOK_only_UV(sv);
7107 SvUV_set(sv, SvUVX(sv) + 1);
7110 if (SvIVX(sv) == IV_MIN)
7111 sv_setnv(sv, (NV)IV_MIN - 1.0);
7113 (void)SvIOK_only(sv);
7114 SvIV_set(sv, SvIVX(sv) - 1);
7119 if (flags & SVp_NOK) {
7120 SvNV_set(sv, SvNVX(sv) - 1.0);
7121 (void)SvNOK_only(sv);
7124 if (!(flags & SVp_POK)) {
7125 if ((flags & SVTYPEMASK) < SVt_PVNV)
7126 sv_upgrade(sv, SVt_NV);
7128 (void)SvNOK_only(sv);
7131 #ifdef PERL_PRESERVE_IVUV
7133 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7134 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7135 /* Need to try really hard to see if it's an integer.
7136 9.22337203685478e+18 is an integer.
7137 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7138 so $a="9.22337203685478e+18"; $a+0; $a--
7139 needs to be the same as $a="9.22337203685478e+18"; $a--
7146 /* sv_2iv *should* have made this an NV */
7147 if (flags & SVp_NOK) {
7148 (void)SvNOK_only(sv);
7149 SvNV_set(sv, SvNVX(sv) - 1.0);
7152 /* I don't think we can get here. Maybe I should assert this
7153 And if we do get here I suspect that sv_setnv will croak. NWC
7155 #if defined(USE_LONG_DOUBLE)
7156 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",
7157 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7159 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7160 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7164 #endif /* PERL_PRESERVE_IVUV */
7165 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7169 =for apidoc sv_mortalcopy
7171 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7172 The new SV is marked as mortal. It will be destroyed "soon", either by an
7173 explicit call to FREETMPS, or by an implicit call at places such as
7174 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7179 /* Make a string that will exist for the duration of the expression
7180 * evaluation. Actually, it may have to last longer than that, but
7181 * hopefully we won't free it until it has been assigned to a
7182 * permanent location. */
7185 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7190 sv_setsv(sv,oldstr);
7192 PL_tmps_stack[++PL_tmps_ix] = sv;
7198 =for apidoc sv_newmortal
7200 Creates a new null SV which is mortal. The reference count of the SV is
7201 set to 1. It will be destroyed "soon", either by an explicit call to
7202 FREETMPS, or by an implicit call at places such as statement boundaries.
7203 See also C<sv_mortalcopy> and C<sv_2mortal>.
7209 Perl_sv_newmortal(pTHX)
7214 SvFLAGS(sv) = SVs_TEMP;
7216 PL_tmps_stack[++PL_tmps_ix] = sv;
7221 =for apidoc sv_2mortal
7223 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7224 by an explicit call to FREETMPS, or by an implicit call at places such as
7225 statement boundaries. SvTEMP() is turned on which means that the SV's
7226 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7227 and C<sv_mortalcopy>.
7233 Perl_sv_2mortal(pTHX_ register SV *sv)
7238 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7241 PL_tmps_stack[++PL_tmps_ix] = sv;
7249 Creates a new SV and copies a string into it. The reference count for the
7250 SV is set to 1. If C<len> is zero, Perl will compute the length using
7251 strlen(). For efficiency, consider using C<newSVpvn> instead.
7257 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7262 sv_setpvn(sv,s,len ? len : strlen(s));
7267 =for apidoc newSVpvn
7269 Creates a new SV and copies a string into it. The reference count for the
7270 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7271 string. You are responsible for ensuring that the source string is at least
7272 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7278 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7283 sv_setpvn(sv,s,len);
7289 =for apidoc newSVhek
7291 Creates a new SV from the hash key structure. It will generate scalars that
7292 point to the shared string table where possible. Returns a new (undefined)
7293 SV if the hek is NULL.
7299 Perl_newSVhek(pTHX_ const HEK *hek)
7308 if (HEK_LEN(hek) == HEf_SVKEY) {
7309 return newSVsv(*(SV**)HEK_KEY(hek));
7311 const int flags = HEK_FLAGS(hek);
7312 if (flags & HVhek_WASUTF8) {
7314 Andreas would like keys he put in as utf8 to come back as utf8
7316 STRLEN utf8_len = HEK_LEN(hek);
7317 U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7318 SV *sv = newSVpvn ((char*)as_utf8, utf8_len);
7321 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7323 } else if (flags & HVhek_REHASH) {
7324 /* We don't have a pointer to the hv, so we have to replicate the
7325 flag into every HEK. This hv is using custom a hasing
7326 algorithm. Hence we can't return a shared string scalar, as
7327 that would contain the (wrong) hash value, and might get passed
7328 into an hv routine with a regular hash */
7330 SV *sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7335 /* This will be overwhelminly the most common case. */
7336 return newSVpvn_share(HEK_KEY(hek),
7337 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7343 =for apidoc newSVpvn_share
7345 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7346 table. If the string does not already exist in the table, it is created
7347 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7348 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7349 otherwise the hash is computed. The idea here is that as the string table
7350 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7351 hash lookup will avoid string compare.
7357 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7360 bool is_utf8 = FALSE;
7362 STRLEN tmplen = -len;
7364 /* See the note in hv.c:hv_fetch() --jhi */
7365 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7369 PERL_HASH(hash, src, len);
7371 sv_upgrade(sv, SVt_PV);
7372 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7384 #if defined(PERL_IMPLICIT_CONTEXT)
7386 /* pTHX_ magic can't cope with varargs, so this is a no-context
7387 * version of the main function, (which may itself be aliased to us).
7388 * Don't access this version directly.
7392 Perl_newSVpvf_nocontext(const char* pat, ...)
7397 va_start(args, pat);
7398 sv = vnewSVpvf(pat, &args);
7405 =for apidoc newSVpvf
7407 Creates a new SV and initializes it with the string formatted like
7414 Perl_newSVpvf(pTHX_ const char* pat, ...)
7418 va_start(args, pat);
7419 sv = vnewSVpvf(pat, &args);
7424 /* backend for newSVpvf() and newSVpvf_nocontext() */
7427 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7431 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7438 Creates a new SV and copies a floating point value into it.
7439 The reference count for the SV is set to 1.
7445 Perl_newSVnv(pTHX_ NV n)
7457 Creates a new SV and copies an integer into it. The reference count for the
7464 Perl_newSViv(pTHX_ IV i)
7476 Creates a new SV and copies an unsigned integer into it.
7477 The reference count for the SV is set to 1.
7483 Perl_newSVuv(pTHX_ UV u)
7493 =for apidoc newRV_noinc
7495 Creates an RV wrapper for an SV. The reference count for the original
7496 SV is B<not> incremented.
7502 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7507 sv_upgrade(sv, SVt_RV);
7509 SvRV_set(sv, tmpRef);
7514 /* newRV_inc is the official function name to use now.
7515 * newRV_inc is in fact #defined to newRV in sv.h
7519 Perl_newRV(pTHX_ SV *tmpRef)
7521 return newRV_noinc(SvREFCNT_inc(tmpRef));
7527 Creates a new SV which is an exact duplicate of the original SV.
7534 Perl_newSVsv(pTHX_ register SV *old)
7540 if (SvTYPE(old) == SVTYPEMASK) {
7541 if (ckWARN_d(WARN_INTERNAL))
7542 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7546 /* SV_GMAGIC is the default for sv_setv()
7547 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7548 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7549 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7554 =for apidoc sv_reset
7556 Underlying implementation for the C<reset> Perl function.
7557 Note that the perl-level function is vaguely deprecated.
7563 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7566 char todo[PERL_UCHAR_MAX+1];
7571 if (!*s) { /* reset ?? searches */
7572 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7574 PMOP *pm = (PMOP *) mg->mg_obj;
7576 pm->op_pmdynflags &= ~PMdf_USED;
7583 /* reset variables */
7585 if (!HvARRAY(stash))
7588 Zero(todo, 256, char);
7591 I32 i = (unsigned char)*s;
7595 max = (unsigned char)*s++;
7596 for ( ; i <= max; i++) {
7599 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7601 for (entry = HvARRAY(stash)[i];
7603 entry = HeNEXT(entry))
7608 if (!todo[(U8)*HeKEY(entry)])
7610 gv = (GV*)HeVAL(entry);
7612 if (SvTHINKFIRST(sv)) {
7613 if (!SvREADONLY(sv) && SvROK(sv))
7618 if (SvTYPE(sv) >= SVt_PV) {
7620 if (SvPVX_const(sv) != Nullch)
7627 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7630 #ifdef USE_ENVIRON_ARRAY
7632 # ifdef USE_ITHREADS
7633 && PL_curinterp == aTHX
7637 environ[0] = Nullch;
7640 #endif /* !PERL_MICRO */
7650 Using various gambits, try to get an IO from an SV: the IO slot if its a
7651 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7652 named after the PV if we're a string.
7658 Perl_sv_2io(pTHX_ SV *sv)
7663 switch (SvTYPE(sv)) {
7671 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7675 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7677 return sv_2io(SvRV(sv));
7678 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7684 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7693 Using various gambits, try to get a CV from an SV; in addition, try if
7694 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7700 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7707 return *gvp = Nullgv, Nullcv;
7708 switch (SvTYPE(sv)) {
7727 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7728 tryAMAGICunDEREF(to_cv);
7731 if (SvTYPE(sv) == SVt_PVCV) {
7740 Perl_croak(aTHX_ "Not a subroutine reference");
7745 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7751 if (lref && !GvCVu(gv)) {
7754 tmpsv = NEWSV(704,0);
7755 gv_efullname3(tmpsv, gv, Nullch);
7756 /* XXX this is probably not what they think they're getting.
7757 * It has the same effect as "sub name;", i.e. just a forward
7759 newSUB(start_subparse(FALSE, 0),
7760 newSVOP(OP_CONST, 0, tmpsv),
7765 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7775 Returns true if the SV has a true value by Perl's rules.
7776 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7777 instead use an in-line version.
7783 Perl_sv_true(pTHX_ register SV *sv)
7788 const register XPV* tXpv;
7789 if ((tXpv = (XPV*)SvANY(sv)) &&
7790 (tXpv->xpv_cur > 1 ||
7791 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7798 return SvIVX(sv) != 0;
7801 return SvNVX(sv) != 0.0;
7803 return sv_2bool(sv);
7811 A private implementation of the C<SvIVx> macro for compilers which can't
7812 cope with complex macro expressions. Always use the macro instead.
7818 Perl_sv_iv(pTHX_ register SV *sv)
7822 return (IV)SvUVX(sv);
7831 A private implementation of the C<SvUVx> macro for compilers which can't
7832 cope with complex macro expressions. Always use the macro instead.
7838 Perl_sv_uv(pTHX_ register SV *sv)
7843 return (UV)SvIVX(sv);
7851 A private implementation of the C<SvNVx> macro for compilers which can't
7852 cope with complex macro expressions. Always use the macro instead.
7858 Perl_sv_nv(pTHX_ register SV *sv)
7865 /* sv_pv() is now a macro using SvPV_nolen();
7866 * this function provided for binary compatibility only
7870 Perl_sv_pv(pTHX_ SV *sv)
7875 return sv_2pv(sv, 0);
7881 Use the C<SvPV_nolen> macro instead
7885 A private implementation of the C<SvPV> macro for compilers which can't
7886 cope with complex macro expressions. Always use the macro instead.
7892 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7898 return sv_2pv(sv, lp);
7903 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7909 return sv_2pv_flags(sv, lp, 0);
7912 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7913 * this function provided for binary compatibility only
7917 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7919 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7923 =for apidoc sv_pvn_force
7925 Get a sensible string out of the SV somehow.
7926 A private implementation of the C<SvPV_force> macro for compilers which
7927 can't cope with complex macro expressions. Always use the macro instead.
7929 =for apidoc sv_pvn_force_flags
7931 Get a sensible string out of the SV somehow.
7932 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7933 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7934 implemented in terms of this function.
7935 You normally want to use the various wrapper macros instead: see
7936 C<SvPV_force> and C<SvPV_force_nomg>
7942 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7945 if (SvTHINKFIRST(sv) && !SvROK(sv))
7946 sv_force_normal_flags(sv, 0);
7956 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7958 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7959 sv_reftype(sv,0), OP_NAME(PL_op));
7961 Perl_croak(aTHX_ "Can't coerce readonly %s to string",
7964 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7965 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7969 s = sv_2pv_flags(sv, &len, flags);
7973 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7976 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7977 SvGROW(sv, len + 1);
7978 Move(s,SvPVX_const(sv),len,char);
7983 SvPOK_on(sv); /* validate pointer */
7985 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7986 PTR2UV(sv),SvPVX_const(sv)));
7989 return SvPVX_mutable(sv);
7992 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7993 * this function provided for binary compatibility only
7997 Perl_sv_pvbyte(pTHX_ SV *sv)
7999 sv_utf8_downgrade(sv,0);
8004 =for apidoc sv_pvbyte
8006 Use C<SvPVbyte_nolen> instead.
8008 =for apidoc sv_pvbyten
8010 A private implementation of the C<SvPVbyte> macro for compilers
8011 which can't cope with complex macro expressions. Always use the macro
8018 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8020 sv_utf8_downgrade(sv,0);
8021 return sv_pvn(sv,lp);
8025 =for apidoc sv_pvbyten_force
8027 A private implementation of the C<SvPVbytex_force> macro for compilers
8028 which can't cope with complex macro expressions. Always use the macro
8035 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8037 sv_pvn_force(sv,lp);
8038 sv_utf8_downgrade(sv,0);
8043 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8044 * this function provided for binary compatibility only
8048 Perl_sv_pvutf8(pTHX_ SV *sv)
8050 sv_utf8_upgrade(sv);
8055 =for apidoc sv_pvutf8
8057 Use the C<SvPVutf8_nolen> macro instead
8059 =for apidoc sv_pvutf8n
8061 A private implementation of the C<SvPVutf8> macro for compilers
8062 which can't cope with complex macro expressions. Always use the macro
8069 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8071 sv_utf8_upgrade(sv);
8072 return sv_pvn(sv,lp);
8076 =for apidoc sv_pvutf8n_force
8078 A private implementation of the C<SvPVutf8_force> macro for compilers
8079 which can't cope with complex macro expressions. Always use the macro
8086 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8088 sv_pvn_force(sv,lp);
8089 sv_utf8_upgrade(sv);
8095 =for apidoc sv_reftype
8097 Returns a string describing what the SV is a reference to.
8103 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8105 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8106 inside return suggests a const propagation bug in g++. */
8107 if (ob && SvOBJECT(sv)) {
8108 char *name = HvNAME_get(SvSTASH(sv));
8109 return name ? name : (char *) "__ANON__";
8112 switch (SvTYPE(sv)) {
8129 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8130 /* tied lvalues should appear to be
8131 * scalars for backwards compatitbility */
8132 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8133 ? "SCALAR" : "LVALUE");
8134 case SVt_PVAV: return "ARRAY";
8135 case SVt_PVHV: return "HASH";
8136 case SVt_PVCV: return "CODE";
8137 case SVt_PVGV: return "GLOB";
8138 case SVt_PVFM: return "FORMAT";
8139 case SVt_PVIO: return "IO";
8140 default: return "UNKNOWN";
8146 =for apidoc sv_isobject
8148 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8149 object. If the SV is not an RV, or if the object is not blessed, then this
8156 Perl_sv_isobject(pTHX_ SV *sv)
8173 Returns a boolean indicating whether the SV is blessed into the specified
8174 class. This does not check for subtypes; use C<sv_derived_from> to verify
8175 an inheritance relationship.
8181 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8193 hvname = HvNAME_get(SvSTASH(sv));
8197 return strEQ(hvname, name);
8203 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8204 it will be upgraded to one. If C<classname> is non-null then the new SV will
8205 be blessed in the specified package. The new SV is returned and its
8206 reference count is 1.
8212 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8218 SV_CHECK_THINKFIRST_COW_DROP(rv);
8221 if (SvTYPE(rv) >= SVt_PVMG) {
8222 const U32 refcnt = SvREFCNT(rv);
8226 SvREFCNT(rv) = refcnt;
8229 if (SvTYPE(rv) < SVt_RV)
8230 sv_upgrade(rv, SVt_RV);
8231 else if (SvTYPE(rv) > SVt_RV) {
8242 HV* stash = gv_stashpv(classname, TRUE);
8243 (void)sv_bless(rv, stash);
8249 =for apidoc sv_setref_pv
8251 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8252 argument will be upgraded to an RV. That RV will be modified to point to
8253 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8254 into the SV. The C<classname> argument indicates the package for the
8255 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8256 will have a reference count of 1, and the RV will be returned.
8258 Do not use with other Perl types such as HV, AV, SV, CV, because those
8259 objects will become corrupted by the pointer copy process.
8261 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8267 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8270 sv_setsv(rv, &PL_sv_undef);
8274 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8279 =for apidoc sv_setref_iv
8281 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8282 argument will be upgraded to an RV. That RV will be modified to point to
8283 the new SV. The C<classname> argument indicates the package for the
8284 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8285 will have a reference count of 1, and the RV will be returned.
8291 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8293 sv_setiv(newSVrv(rv,classname), iv);
8298 =for apidoc sv_setref_uv
8300 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8301 argument will be upgraded to an RV. That RV will be modified to point to
8302 the new SV. The C<classname> argument indicates the package for the
8303 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8304 will have a reference count of 1, and the RV will be returned.
8310 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8312 sv_setuv(newSVrv(rv,classname), uv);
8317 =for apidoc sv_setref_nv
8319 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8320 argument will be upgraded to an RV. That RV will be modified to point to
8321 the new SV. The C<classname> argument indicates the package for the
8322 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8323 will have a reference count of 1, and the RV will be returned.
8329 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8331 sv_setnv(newSVrv(rv,classname), nv);
8336 =for apidoc sv_setref_pvn
8338 Copies a string into a new SV, optionally blessing the SV. The length of the
8339 string must be specified with C<n>. The C<rv> argument will be upgraded to
8340 an RV. That RV will be modified to point to the new SV. The C<classname>
8341 argument indicates the package for the blessing. Set C<classname> to
8342 C<Nullch> to avoid the blessing. The new SV will have a reference count
8343 of 1, and the RV will be returned.
8345 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8351 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8353 sv_setpvn(newSVrv(rv,classname), pv, n);
8358 =for apidoc sv_bless
8360 Blesses an SV into a specified package. The SV must be an RV. The package
8361 must be designated by its stash (see C<gv_stashpv()>). The reference count
8362 of the SV is unaffected.
8368 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8372 Perl_croak(aTHX_ "Can't bless non-reference value");
8374 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8375 if (SvREADONLY(tmpRef))
8376 Perl_croak(aTHX_ PL_no_modify);
8377 if (SvOBJECT(tmpRef)) {
8378 if (SvTYPE(tmpRef) != SVt_PVIO)
8380 SvREFCNT_dec(SvSTASH(tmpRef));
8383 SvOBJECT_on(tmpRef);
8384 if (SvTYPE(tmpRef) != SVt_PVIO)
8386 SvUPGRADE(tmpRef, SVt_PVMG);
8387 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8394 if(SvSMAGICAL(tmpRef))
8395 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8403 /* Downgrades a PVGV to a PVMG.
8407 S_sv_unglob(pTHX_ SV *sv)
8411 assert(SvTYPE(sv) == SVt_PVGV);
8416 SvREFCNT_dec(GvSTASH(sv));
8417 GvSTASH(sv) = Nullhv;
8419 sv_unmagic(sv, PERL_MAGIC_glob);
8420 Safefree(GvNAME(sv));
8423 /* need to keep SvANY(sv) in the right arena */
8424 xpvmg = new_XPVMG();
8425 StructCopy(SvANY(sv), xpvmg, XPVMG);
8426 del_XPVGV(SvANY(sv));
8429 SvFLAGS(sv) &= ~SVTYPEMASK;
8430 SvFLAGS(sv) |= SVt_PVMG;
8434 =for apidoc sv_unref_flags
8436 Unsets the RV status of the SV, and decrements the reference count of
8437 whatever was being referenced by the RV. This can almost be thought of
8438 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8439 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8440 (otherwise the decrementing is conditional on the reference count being
8441 different from one or the reference being a readonly SV).
8448 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8452 if (SvWEAKREF(sv)) {
8460 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8461 assigned to as BEGIN {$a = \"Foo"} will fail. */
8462 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8464 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8465 sv_2mortal(rv); /* Schedule for freeing later */
8469 =for apidoc sv_unref
8471 Unsets the RV status of the SV, and decrements the reference count of
8472 whatever was being referenced by the RV. This can almost be thought of
8473 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8474 being zero. See C<SvROK_off>.
8480 Perl_sv_unref(pTHX_ SV *sv)
8482 sv_unref_flags(sv, 0);
8486 =for apidoc sv_taint
8488 Taint an SV. Use C<SvTAINTED_on> instead.
8493 Perl_sv_taint(pTHX_ SV *sv)
8495 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8499 =for apidoc sv_untaint
8501 Untaint an SV. Use C<SvTAINTED_off> instead.
8506 Perl_sv_untaint(pTHX_ SV *sv)
8508 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8509 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8516 =for apidoc sv_tainted
8518 Test an SV for taintedness. Use C<SvTAINTED> instead.
8523 Perl_sv_tainted(pTHX_ SV *sv)
8525 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8526 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8527 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8534 =for apidoc sv_setpviv
8536 Copies an integer into the given SV, also updating its string value.
8537 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8543 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8545 char buf[TYPE_CHARS(UV)];
8547 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8549 sv_setpvn(sv, ptr, ebuf - ptr);
8553 =for apidoc sv_setpviv_mg
8555 Like C<sv_setpviv>, but also handles 'set' magic.
8561 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8563 char buf[TYPE_CHARS(UV)];
8565 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8567 sv_setpvn(sv, ptr, ebuf - ptr);
8571 #if defined(PERL_IMPLICIT_CONTEXT)
8573 /* pTHX_ magic can't cope with varargs, so this is a no-context
8574 * version of the main function, (which may itself be aliased to us).
8575 * Don't access this version directly.
8579 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8583 va_start(args, pat);
8584 sv_vsetpvf(sv, pat, &args);
8588 /* pTHX_ magic can't cope with varargs, so this is a no-context
8589 * version of the main function, (which may itself be aliased to us).
8590 * Don't access this version directly.
8594 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8598 va_start(args, pat);
8599 sv_vsetpvf_mg(sv, pat, &args);
8605 =for apidoc sv_setpvf
8607 Works like C<sv_catpvf> but copies the text into the SV instead of
8608 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8614 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8617 va_start(args, pat);
8618 sv_vsetpvf(sv, pat, &args);
8623 =for apidoc sv_vsetpvf
8625 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8626 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8628 Usually used via its frontend C<sv_setpvf>.
8634 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8636 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8640 =for apidoc sv_setpvf_mg
8642 Like C<sv_setpvf>, but also handles 'set' magic.
8648 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8651 va_start(args, pat);
8652 sv_vsetpvf_mg(sv, pat, &args);
8657 =for apidoc sv_vsetpvf_mg
8659 Like C<sv_vsetpvf>, but also handles 'set' magic.
8661 Usually used via its frontend C<sv_setpvf_mg>.
8667 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8669 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8673 #if defined(PERL_IMPLICIT_CONTEXT)
8675 /* pTHX_ magic can't cope with varargs, so this is a no-context
8676 * version of the main function, (which may itself be aliased to us).
8677 * Don't access this version directly.
8681 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8685 va_start(args, pat);
8686 sv_vcatpvf(sv, pat, &args);
8690 /* pTHX_ magic can't cope with varargs, so this is a no-context
8691 * version of the main function, (which may itself be aliased to us).
8692 * Don't access this version directly.
8696 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8700 va_start(args, pat);
8701 sv_vcatpvf_mg(sv, pat, &args);
8707 =for apidoc sv_catpvf
8709 Processes its arguments like C<sprintf> and appends the formatted
8710 output to an SV. If the appended data contains "wide" characters
8711 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8712 and characters >255 formatted with %c), the original SV might get
8713 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8714 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8715 valid UTF-8; if the original SV was bytes, the pattern should be too.
8720 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8723 va_start(args, pat);
8724 sv_vcatpvf(sv, pat, &args);
8729 =for apidoc sv_vcatpvf
8731 Processes its arguments like C<vsprintf> and appends the formatted output
8732 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8734 Usually used via its frontend C<sv_catpvf>.
8740 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8742 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8746 =for apidoc sv_catpvf_mg
8748 Like C<sv_catpvf>, but also handles 'set' magic.
8754 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8757 va_start(args, pat);
8758 sv_vcatpvf_mg(sv, pat, &args);
8763 =for apidoc sv_vcatpvf_mg
8765 Like C<sv_vcatpvf>, but also handles 'set' magic.
8767 Usually used via its frontend C<sv_catpvf_mg>.
8773 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8775 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8780 =for apidoc sv_vsetpvfn
8782 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8785 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8791 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8793 sv_setpvn(sv, "", 0);
8794 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8797 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8800 S_expect_number(pTHX_ char** pattern)
8803 switch (**pattern) {
8804 case '1': case '2': case '3':
8805 case '4': case '5': case '6':
8806 case '7': case '8': case '9':
8807 while (isDIGIT(**pattern))
8808 var = var * 10 + (*(*pattern)++ - '0');
8812 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8815 F0convert(NV nv, char *endbuf, STRLEN *len)
8817 const int neg = nv < 0;
8826 if (uv & 1 && uv == nv)
8827 uv--; /* Round to even */
8829 const unsigned dig = uv % 10;
8842 =for apidoc sv_vcatpvfn
8844 Processes its arguments like C<vsprintf> and appends the formatted output
8845 to an SV. Uses an array of SVs if the C style variable argument list is
8846 missing (NULL). When running with taint checks enabled, indicates via
8847 C<maybe_tainted> if results are untrustworthy (often due to the use of
8850 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8855 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8858 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8865 static const char nullstr[] = "(null)";
8867 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8868 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8870 /* Times 4: a decimal digit takes more than 3 binary digits.
8871 * NV_DIG: mantissa takes than many decimal digits.
8872 * Plus 32: Playing safe. */
8873 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8874 /* large enough for "%#.#f" --chip */
8875 /* what about long double NVs? --jhi */
8877 /* no matter what, this is a string now */
8878 (void)SvPV_force(sv, origlen);
8880 /* special-case "", "%s", and "%-p" (SVf) */
8883 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8885 const char *s = va_arg(*args, char*);
8886 sv_catpv(sv, s ? s : nullstr);
8888 else if (svix < svmax) {
8889 sv_catsv(sv, *svargs);
8890 if (DO_UTF8(*svargs))
8895 if (patlen == 3 && pat[0] == '%' &&
8896 pat[1] == '-' && pat[2] == 'p') {
8898 argsv = va_arg(*args, SV*);
8899 sv_catsv(sv, argsv);
8906 #ifndef USE_LONG_DOUBLE
8907 /* special-case "%.<number>[gf]" */
8908 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8909 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8910 unsigned digits = 0;
8914 while (*pp >= '0' && *pp <= '9')
8915 digits = 10 * digits + (*pp++ - '0');
8916 if (pp - pat == (int)patlen - 1) {
8920 nv = (NV)va_arg(*args, double);
8921 else if (svix < svmax)
8926 /* Add check for digits != 0 because it seems that some
8927 gconverts are buggy in this case, and we don't yet have
8928 a Configure test for this. */
8929 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8930 /* 0, point, slack */
8931 Gconvert(nv, (int)digits, 0, ebuf);
8933 if (*ebuf) /* May return an empty string for digits==0 */
8936 } else if (!digits) {
8939 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8940 sv_catpvn(sv, p, l);
8946 #endif /* !USE_LONG_DOUBLE */
8948 if (!args && svix < svmax && DO_UTF8(*svargs))
8951 patend = (char*)pat + patlen;
8952 for (p = (char*)pat; p < patend; p = q) {
8955 bool vectorize = FALSE;
8956 bool vectorarg = FALSE;
8957 bool vec_utf8 = FALSE;
8963 bool has_precis = FALSE;
8966 bool is_utf8 = FALSE; /* is this item utf8? */
8967 #ifdef HAS_LDBL_SPRINTF_BUG
8968 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8969 with sfio - Allen <allens@cpan.org> */
8970 bool fix_ldbl_sprintf_bug = FALSE;
8974 U8 utf8buf[UTF8_MAXBYTES+1];
8975 STRLEN esignlen = 0;
8977 const char *eptr = Nullch;
8980 const U8 *vecstr = Null(U8*);
8987 /* we need a long double target in case HAS_LONG_DOUBLE but
8990 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8998 const char *dotstr = ".";
8999 STRLEN dotstrlen = 1;
9000 I32 efix = 0; /* explicit format parameter index */
9001 I32 ewix = 0; /* explicit width index */
9002 I32 epix = 0; /* explicit precision index */
9003 I32 evix = 0; /* explicit vector index */
9004 bool asterisk = FALSE;
9006 /* echo everything up to the next format specification */
9007 for (q = p; q < patend && *q != '%'; ++q) ;
9009 if (has_utf8 && !pat_utf8)
9010 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9012 sv_catpvn(sv, p, q - p);
9019 We allow format specification elements in this order:
9020 \d+\$ explicit format parameter index
9022 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9023 0 flag (as above): repeated to allow "v02"
9024 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9025 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9027 [%bcdefginopsux_DFOUX] format (mandatory)
9029 if (EXPECT_NUMBER(q, width)) {
9070 if (EXPECT_NUMBER(q, ewix))
9079 if ((vectorarg = asterisk)) {
9091 EXPECT_NUMBER(q, width);
9096 vecsv = va_arg(*args, SV*);
9098 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9099 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9100 dotstr = SvPV_const(vecsv, dotstrlen);
9105 vecsv = va_arg(*args, SV*);
9106 vecstr = (U8*)SvPV_const(vecsv,veclen);
9107 vec_utf8 = DO_UTF8(vecsv);
9109 else if (efix ? efix <= svmax : svix < svmax) {
9110 vecsv = svargs[efix ? efix-1 : svix++];
9111 vecstr = (U8*)SvPV_const(vecsv,veclen);
9112 vec_utf8 = DO_UTF8(vecsv);
9113 /* if this is a version object, we need to return the
9114 * stringified representation (which the SvPVX_const has
9115 * already done for us), but not vectorize the args
9117 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9119 q++; /* skip past the rest of the %vd format */
9120 eptr = (const char *) vecstr;
9121 elen = strlen(eptr);
9134 i = va_arg(*args, int);
9136 i = (ewix ? ewix <= svmax : svix < svmax) ?
9137 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9139 width = (i < 0) ? -i : i;
9149 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9151 /* XXX: todo, support specified precision parameter */
9155 i = va_arg(*args, int);
9157 i = (ewix ? ewix <= svmax : svix < svmax)
9158 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9159 precis = (i < 0) ? 0 : i;
9164 precis = precis * 10 + (*q++ - '0');
9173 case 'I': /* Ix, I32x, and I64x */
9175 if (q[1] == '6' && q[2] == '4') {
9181 if (q[1] == '3' && q[2] == '2') {
9191 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9202 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9203 if (*(q + 1) == 'l') { /* lld, llf */
9228 argsv = (efix ? efix <= svmax : svix < svmax) ?
9229 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9236 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9238 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9240 eptr = (char*)utf8buf;
9241 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9252 if (args && !vectorize) {
9253 eptr = va_arg(*args, char*);
9255 #ifdef MACOS_TRADITIONAL
9256 /* On MacOS, %#s format is used for Pascal strings */
9261 elen = strlen(eptr);
9263 eptr = (char *)nullstr;
9264 elen = sizeof nullstr - 1;
9268 eptr = SvPVx_const(argsv, elen);
9269 if (DO_UTF8(argsv)) {
9270 if (has_precis && precis < elen) {
9272 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9275 if (width) { /* fudge width (can't fudge elen) */
9276 width += elen - sv_len_utf8(argsv);
9284 if (has_precis && elen > precis)
9291 if (left && args) { /* SVf */
9300 argsv = va_arg(*args, SV*);
9301 eptr = SvPVx_const(argsv, elen);
9306 if (alt || vectorize)
9308 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9326 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9335 esignbuf[esignlen++] = plus;
9339 case 'h': iv = (short)va_arg(*args, int); break;
9340 case 'l': iv = va_arg(*args, long); break;
9341 case 'V': iv = va_arg(*args, IV); break;
9342 default: iv = va_arg(*args, int); break;
9344 case 'q': iv = va_arg(*args, Quad_t); break;
9349 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9351 case 'h': iv = (short)tiv; break;
9352 case 'l': iv = (long)tiv; break;
9354 default: iv = tiv; break;
9356 case 'q': iv = (Quad_t)tiv; break;
9360 if ( !vectorize ) /* we already set uv above */
9365 esignbuf[esignlen++] = plus;
9369 esignbuf[esignlen++] = '-';
9412 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9423 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9424 case 'l': uv = va_arg(*args, unsigned long); break;
9425 case 'V': uv = va_arg(*args, UV); break;
9426 default: uv = va_arg(*args, unsigned); break;
9428 case 'q': uv = va_arg(*args, Uquad_t); break;
9433 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9435 case 'h': uv = (unsigned short)tuv; break;
9436 case 'l': uv = (unsigned long)tuv; break;
9438 default: uv = tuv; break;
9440 case 'q': uv = (Uquad_t)tuv; break;
9447 char *ptr = ebuf + sizeof ebuf;
9453 p = (char*)((c == 'X')
9454 ? "0123456789ABCDEF" : "0123456789abcdef");
9460 esignbuf[esignlen++] = '0';
9461 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9469 if (alt && *ptr != '0')
9478 esignbuf[esignlen++] = '0';
9479 esignbuf[esignlen++] = 'b';
9482 default: /* it had better be ten or less */
9486 } while (uv /= base);
9489 elen = (ebuf + sizeof ebuf) - ptr;
9493 zeros = precis - elen;
9494 else if (precis == 0 && elen == 1 && *eptr == '0')
9500 /* FLOATING POINT */
9503 c = 'f'; /* maybe %F isn't supported here */
9509 /* This is evil, but floating point is even more evil */
9511 /* for SV-style calling, we can only get NV
9512 for C-style calling, we assume %f is double;
9513 for simplicity we allow any of %Lf, %llf, %qf for long double
9517 #if defined(USE_LONG_DOUBLE)
9521 /* [perl #20339] - we should accept and ignore %lf rather than die */
9525 #if defined(USE_LONG_DOUBLE)
9526 intsize = args ? 0 : 'q';
9530 #if defined(HAS_LONG_DOUBLE)
9539 /* now we need (long double) if intsize == 'q', else (double) */
9540 nv = (args && !vectorize) ?
9541 #if LONG_DOUBLESIZE > DOUBLESIZE
9543 va_arg(*args, long double) :
9544 va_arg(*args, double)
9546 va_arg(*args, double)
9552 if (c != 'e' && c != 'E') {
9554 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9555 will cast our (long double) to (double) */
9556 (void)Perl_frexp(nv, &i);
9557 if (i == PERL_INT_MIN)
9558 Perl_die(aTHX_ "panic: frexp");
9560 need = BIT_DIGITS(i);
9562 need += has_precis ? precis : 6; /* known default */
9567 #ifdef HAS_LDBL_SPRINTF_BUG
9568 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9569 with sfio - Allen <allens@cpan.org> */
9572 # define MY_DBL_MAX DBL_MAX
9573 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9574 # if DOUBLESIZE >= 8
9575 # define MY_DBL_MAX 1.7976931348623157E+308L
9577 # define MY_DBL_MAX 3.40282347E+38L
9581 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9582 # define MY_DBL_MAX_BUG 1L
9584 # define MY_DBL_MAX_BUG MY_DBL_MAX
9588 # define MY_DBL_MIN DBL_MIN
9589 # else /* XXX guessing! -Allen */
9590 # if DOUBLESIZE >= 8
9591 # define MY_DBL_MIN 2.2250738585072014E-308L
9593 # define MY_DBL_MIN 1.17549435E-38L
9597 if ((intsize == 'q') && (c == 'f') &&
9598 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9600 /* it's going to be short enough that
9601 * long double precision is not needed */
9603 if ((nv <= 0L) && (nv >= -0L))
9604 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9606 /* would use Perl_fp_class as a double-check but not
9607 * functional on IRIX - see perl.h comments */
9609 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9610 /* It's within the range that a double can represent */
9611 #if defined(DBL_MAX) && !defined(DBL_MIN)
9612 if ((nv >= ((long double)1/DBL_MAX)) ||
9613 (nv <= (-(long double)1/DBL_MAX)))
9615 fix_ldbl_sprintf_bug = TRUE;
9618 if (fix_ldbl_sprintf_bug == TRUE) {
9628 # undef MY_DBL_MAX_BUG
9631 #endif /* HAS_LDBL_SPRINTF_BUG */
9633 need += 20; /* fudge factor */
9634 if (PL_efloatsize < need) {
9635 Safefree(PL_efloatbuf);
9636 PL_efloatsize = need + 20; /* more fudge */
9637 New(906, PL_efloatbuf, PL_efloatsize, char);
9638 PL_efloatbuf[0] = '\0';
9641 if ( !(width || left || plus || alt) && fill != '0'
9642 && has_precis && intsize != 'q' ) { /* Shortcuts */
9643 /* See earlier comment about buggy Gconvert when digits,
9645 if ( c == 'g' && precis) {
9646 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9647 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9648 goto float_converted;
9649 } else if ( c == 'f' && !precis) {
9650 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9655 char *ptr = ebuf + sizeof ebuf;
9658 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9659 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9660 if (intsize == 'q') {
9661 /* Copy the one or more characters in a long double
9662 * format before the 'base' ([efgEFG]) character to
9663 * the format string. */
9664 static char const prifldbl[] = PERL_PRIfldbl;
9665 char const *p = prifldbl + sizeof(prifldbl) - 3;
9666 while (p >= prifldbl) { *--ptr = *p--; }
9671 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9676 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9688 /* No taint. Otherwise we are in the strange situation
9689 * where printf() taints but print($float) doesn't.
9691 #if defined(HAS_LONG_DOUBLE)
9693 (void)sprintf(PL_efloatbuf, ptr, nv);
9695 (void)sprintf(PL_efloatbuf, ptr, (double)nv);
9697 (void)sprintf(PL_efloatbuf, ptr, nv);
9701 eptr = PL_efloatbuf;
9702 elen = strlen(PL_efloatbuf);
9708 i = SvCUR(sv) - origlen;
9709 if (args && !vectorize) {
9711 case 'h': *(va_arg(*args, short*)) = i; break;
9712 default: *(va_arg(*args, int*)) = i; break;
9713 case 'l': *(va_arg(*args, long*)) = i; break;
9714 case 'V': *(va_arg(*args, IV*)) = i; break;
9716 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9721 sv_setuv_mg(argsv, (UV)i);
9723 continue; /* not "break" */
9729 if (!args && ckWARN(WARN_PRINTF) &&
9730 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9731 SV *msg = sv_newmortal();
9732 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9733 (PL_op->op_type == OP_PRTF) ? "" : "s");
9736 Perl_sv_catpvf(aTHX_ msg,
9737 "\"%%%c\"", c & 0xFF);
9739 Perl_sv_catpvf(aTHX_ msg,
9740 "\"%%\\%03"UVof"\"",
9743 sv_catpv(msg, "end of string");
9744 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9747 /* output mangled stuff ... */
9753 /* ... right here, because formatting flags should not apply */
9754 SvGROW(sv, SvCUR(sv) + elen + 1);
9756 Copy(eptr, p, elen, char);
9759 SvCUR_set(sv, p - SvPVX_const(sv));
9761 continue; /* not "break" */
9764 /* calculate width before utf8_upgrade changes it */
9765 have = esignlen + zeros + elen;
9767 if (is_utf8 != has_utf8) {
9770 sv_utf8_upgrade(sv);
9773 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9774 sv_utf8_upgrade(nsv);
9775 eptr = SvPVX_const(nsv);
9778 SvGROW(sv, SvCUR(sv) + elen + 1);
9783 need = (have > width ? have : width);
9786 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9788 if (esignlen && fill == '0') {
9789 for (i = 0; i < (int)esignlen; i++)
9793 memset(p, fill, gap);
9796 if (esignlen && fill != '0') {
9797 for (i = 0; i < (int)esignlen; i++)
9801 for (i = zeros; i; i--)
9805 Copy(eptr, p, elen, char);
9809 memset(p, ' ', gap);
9814 Copy(dotstr, p, dotstrlen, char);
9818 vectorize = FALSE; /* done iterating over vecstr */
9825 SvCUR_set(sv, p - SvPVX_const(sv));
9833 /* =========================================================================
9835 =head1 Cloning an interpreter
9837 All the macros and functions in this section are for the private use of
9838 the main function, perl_clone().
9840 The foo_dup() functions make an exact copy of an existing foo thinngy.
9841 During the course of a cloning, a hash table is used to map old addresses
9842 to new addresses. The table is created and manipulated with the
9843 ptr_table_* functions.
9847 ============================================================================*/
9850 #if defined(USE_ITHREADS)
9852 #ifndef GpREFCNT_inc
9853 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9857 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9858 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9859 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9860 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9861 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9862 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9863 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9864 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9865 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9866 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9867 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9868 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9869 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9872 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9873 regcomp.c. AMS 20010712 */
9876 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9881 struct reg_substr_datum *s;
9884 return (REGEXP *)NULL;
9886 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9889 len = r->offsets[0];
9890 npar = r->nparens+1;
9892 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9893 Copy(r->program, ret->program, len+1, regnode);
9895 New(0, ret->startp, npar, I32);
9896 Copy(r->startp, ret->startp, npar, I32);
9897 New(0, ret->endp, npar, I32);
9898 Copy(r->startp, ret->startp, npar, I32);
9900 New(0, ret->substrs, 1, struct reg_substr_data);
9901 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9902 s->min_offset = r->substrs->data[i].min_offset;
9903 s->max_offset = r->substrs->data[i].max_offset;
9904 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9905 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9908 ret->regstclass = NULL;
9911 const int count = r->data->count;
9913 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9914 char, struct reg_data);
9915 New(0, d->what, count, U8);
9918 for (i = 0; i < count; i++) {
9919 d->what[i] = r->data->what[i];
9920 switch (d->what[i]) {
9921 /* legal options are one of: sfpont
9922 see also regcomp.h and pregfree() */
9924 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9927 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9930 /* This is cheating. */
9931 New(0, d->data[i], 1, struct regnode_charclass_class);
9932 StructCopy(r->data->data[i], d->data[i],
9933 struct regnode_charclass_class);
9934 ret->regstclass = (regnode*)d->data[i];
9937 /* Compiled op trees are readonly, and can thus be
9938 shared without duplication. */
9940 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9944 d->data[i] = r->data->data[i];
9947 d->data[i] = r->data->data[i];
9949 ((reg_trie_data*)d->data[i])->refcount++;
9953 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9962 New(0, ret->offsets, 2*len+1, U32);
9963 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9965 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9966 ret->refcnt = r->refcnt;
9967 ret->minlen = r->minlen;
9968 ret->prelen = r->prelen;
9969 ret->nparens = r->nparens;
9970 ret->lastparen = r->lastparen;
9971 ret->lastcloseparen = r->lastcloseparen;
9972 ret->reganch = r->reganch;
9974 ret->sublen = r->sublen;
9976 if (RX_MATCH_COPIED(ret))
9977 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9979 ret->subbeg = Nullch;
9980 #ifdef PERL_OLD_COPY_ON_WRITE
9981 ret->saved_copy = Nullsv;
9984 ptr_table_store(PL_ptr_table, r, ret);
9988 /* duplicate a file handle */
9991 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9997 return (PerlIO*)NULL;
9999 /* look for it in the table first */
10000 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10004 /* create anew and remember what it is */
10005 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10006 ptr_table_store(PL_ptr_table, fp, ret);
10010 /* duplicate a directory handle */
10013 Perl_dirp_dup(pTHX_ DIR *dp)
10021 /* duplicate a typeglob */
10024 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10029 /* look for it in the table first */
10030 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10034 /* create anew and remember what it is */
10035 Newz(0, ret, 1, GP);
10036 ptr_table_store(PL_ptr_table, gp, ret);
10039 ret->gp_refcnt = 0; /* must be before any other dups! */
10040 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10041 ret->gp_io = io_dup_inc(gp->gp_io, param);
10042 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10043 ret->gp_av = av_dup_inc(gp->gp_av, param);
10044 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10045 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10046 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10047 ret->gp_cvgen = gp->gp_cvgen;
10048 ret->gp_flags = gp->gp_flags;
10049 ret->gp_line = gp->gp_line;
10050 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10054 /* duplicate a chain of magic */
10057 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10059 MAGIC *mgprev = (MAGIC*)NULL;
10062 return (MAGIC*)NULL;
10063 /* look for it in the table first */
10064 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10068 for (; mg; mg = mg->mg_moremagic) {
10070 Newz(0, nmg, 1, MAGIC);
10072 mgprev->mg_moremagic = nmg;
10075 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10076 nmg->mg_private = mg->mg_private;
10077 nmg->mg_type = mg->mg_type;
10078 nmg->mg_flags = mg->mg_flags;
10079 if (mg->mg_type == PERL_MAGIC_qr) {
10080 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10082 else if(mg->mg_type == PERL_MAGIC_backref) {
10083 const AV * const av = (AV*) mg->mg_obj;
10086 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10088 for (i = AvFILLp(av); i >= 0; i--) {
10089 if (!svp[i]) continue;
10090 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10093 else if (mg->mg_type == PERL_MAGIC_symtab) {
10094 nmg->mg_obj = mg->mg_obj;
10097 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10098 ? sv_dup_inc(mg->mg_obj, param)
10099 : sv_dup(mg->mg_obj, param);
10101 nmg->mg_len = mg->mg_len;
10102 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10103 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10104 if (mg->mg_len > 0) {
10105 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10106 if (mg->mg_type == PERL_MAGIC_overload_table &&
10107 AMT_AMAGIC((AMT*)mg->mg_ptr))
10109 AMT *amtp = (AMT*)mg->mg_ptr;
10110 AMT *namtp = (AMT*)nmg->mg_ptr;
10112 for (i = 1; i < NofAMmeth; i++) {
10113 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10117 else if (mg->mg_len == HEf_SVKEY)
10118 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10120 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10121 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10128 /* create a new pointer-mapping table */
10131 Perl_ptr_table_new(pTHX)
10134 Newz(0, tbl, 1, PTR_TBL_t);
10135 tbl->tbl_max = 511;
10136 tbl->tbl_items = 0;
10137 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10142 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10144 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10147 #define new_pte() new_body(struct ptr_tbl_ent, pte)
10148 #define del_pte(p) del_body(p, struct ptr_tbl_ent, pte)
10150 /* map an existing pointer using a table */
10153 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10155 PTR_TBL_ENT_t *tblent;
10156 const UV hash = PTR_TABLE_HASH(sv);
10158 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10159 for (; tblent; tblent = tblent->next) {
10160 if (tblent->oldval == sv)
10161 return tblent->newval;
10163 return (void*)NULL;
10166 /* add a new entry to a pointer-mapping table */
10169 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10171 PTR_TBL_ENT_t *tblent, **otblent;
10172 /* XXX this may be pessimal on platforms where pointers aren't good
10173 * hash values e.g. if they grow faster in the most significant
10175 const UV hash = PTR_TABLE_HASH(oldv);
10179 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10180 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10181 if (tblent->oldval == oldv) {
10182 tblent->newval = newv;
10186 tblent = new_pte();
10187 tblent->oldval = oldv;
10188 tblent->newval = newv;
10189 tblent->next = *otblent;
10192 if (!empty && tbl->tbl_items > tbl->tbl_max)
10193 ptr_table_split(tbl);
10196 /* double the hash bucket size of an existing ptr table */
10199 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10201 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10202 const UV oldsize = tbl->tbl_max + 1;
10203 UV newsize = oldsize * 2;
10206 Renew(ary, newsize, PTR_TBL_ENT_t*);
10207 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10208 tbl->tbl_max = --newsize;
10209 tbl->tbl_ary = ary;
10210 for (i=0; i < oldsize; i++, ary++) {
10211 PTR_TBL_ENT_t **curentp, **entp, *ent;
10214 curentp = ary + oldsize;
10215 for (entp = ary, ent = *ary; ent; ent = *entp) {
10216 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10218 ent->next = *curentp;
10228 /* remove all the entries from a ptr table */
10231 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10233 register PTR_TBL_ENT_t **array;
10234 register PTR_TBL_ENT_t *entry;
10238 if (!tbl || !tbl->tbl_items) {
10242 array = tbl->tbl_ary;
10244 max = tbl->tbl_max;
10248 PTR_TBL_ENT_t *oentry = entry;
10249 entry = entry->next;
10253 if (++riter > max) {
10256 entry = array[riter];
10260 tbl->tbl_items = 0;
10263 /* clear and free a ptr table */
10266 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10271 ptr_table_clear(tbl);
10272 Safefree(tbl->tbl_ary);
10276 /* attempt to make everything in the typeglob readonly */
10279 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10281 GV *gv = (GV*)sstr;
10282 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10284 if (GvIO(gv) || GvFORM(gv)) {
10285 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10287 else if (!GvCV(gv)) {
10288 GvCV(gv) = (CV*)sv;
10291 /* CvPADLISTs cannot be shared */
10292 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10297 if (!GvUNIQUE(gv)) {
10299 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10300 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10306 * write attempts will die with
10307 * "Modification of a read-only value attempted"
10313 SvREADONLY_on(GvSV(gv));
10317 GvAV(gv) = (AV*)sv;
10320 SvREADONLY_on(GvAV(gv));
10324 GvHV(gv) = (HV*)sv;
10327 SvREADONLY_on(GvHV(gv));
10330 return sstr; /* he_dup() will SvREFCNT_inc() */
10333 /* duplicate an SV of any type (including AV, HV etc) */
10336 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10339 SvRV_set(dstr, SvWEAKREF(sstr)
10340 ? sv_dup(SvRV(sstr), param)
10341 : sv_dup_inc(SvRV(sstr), param));
10344 else if (SvPVX_const(sstr)) {
10345 /* Has something there */
10347 /* Normal PV - clone whole allocated space */
10348 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
10349 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10350 /* Not that normal - actually sstr is copy on write.
10351 But we are a true, independant SV, so: */
10352 SvREADONLY_off(dstr);
10357 /* Special case - not normally malloced for some reason */
10358 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
10359 /* A "shared" PV - clone it as "shared" PV */
10361 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
10365 /* Some other special case - random pointer */
10366 SvPV_set(dstr, SvPVX(sstr));
10371 /* Copy the Null */
10372 if (SvTYPE(dstr) == SVt_RV)
10373 SvRV_set(dstr, NULL);
10380 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10385 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10387 /* look for it in the table first */
10388 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10392 if(param->flags & CLONEf_JOIN_IN) {
10393 /** We are joining here so we don't want do clone
10394 something that is bad **/
10395 const char *hvname;
10397 if(SvTYPE(sstr) == SVt_PVHV &&
10398 (hvname = HvNAME_get(sstr))) {
10399 /** don't clone stashes if they already exist **/
10400 HV* old_stash = gv_stashpv(hvname,0);
10401 return (SV*) old_stash;
10405 /* create anew and remember what it is */
10408 #ifdef DEBUG_LEAKING_SCALARS
10409 dstr->sv_debug_optype = sstr->sv_debug_optype;
10410 dstr->sv_debug_line = sstr->sv_debug_line;
10411 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10412 dstr->sv_debug_cloned = 1;
10414 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10416 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10420 ptr_table_store(PL_ptr_table, sstr, dstr);
10423 SvFLAGS(dstr) = SvFLAGS(sstr);
10424 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10425 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10428 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10429 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10430 PL_watch_pvx, SvPVX_const(sstr));
10433 /* don't clone objects whose class has asked us not to */
10434 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10435 SvFLAGS(dstr) &= ~SVTYPEMASK;
10436 SvOBJECT_off(dstr);
10440 switch (SvTYPE(sstr)) {
10442 SvANY(dstr) = NULL;
10445 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10446 SvIV_set(dstr, SvIVX(sstr));
10449 SvANY(dstr) = new_XNV();
10450 SvNV_set(dstr, SvNVX(sstr));
10453 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10454 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10457 SvANY(dstr) = new_XPV();
10458 SvCUR_set(dstr, SvCUR(sstr));
10459 SvLEN_set(dstr, SvLEN(sstr));
10460 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10463 SvANY(dstr) = new_XPVIV();
10464 SvCUR_set(dstr, SvCUR(sstr));
10465 SvLEN_set(dstr, SvLEN(sstr));
10466 SvIV_set(dstr, SvIVX(sstr));
10467 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10470 SvANY(dstr) = new_XPVNV();
10471 SvCUR_set(dstr, SvCUR(sstr));
10472 SvLEN_set(dstr, SvLEN(sstr));
10473 SvIV_set(dstr, SvIVX(sstr));
10474 SvNV_set(dstr, SvNVX(sstr));
10475 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10478 SvANY(dstr) = new_XPVMG();
10479 SvCUR_set(dstr, SvCUR(sstr));
10480 SvLEN_set(dstr, SvLEN(sstr));
10481 SvIV_set(dstr, SvIVX(sstr));
10482 SvNV_set(dstr, SvNVX(sstr));
10483 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10484 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10485 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10488 SvANY(dstr) = new_XPVBM();
10489 SvCUR_set(dstr, SvCUR(sstr));
10490 SvLEN_set(dstr, SvLEN(sstr));
10491 SvIV_set(dstr, SvIVX(sstr));
10492 SvNV_set(dstr, SvNVX(sstr));
10493 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10494 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10495 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10496 BmRARE(dstr) = BmRARE(sstr);
10497 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10498 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10501 SvANY(dstr) = new_XPVLV();
10502 SvCUR_set(dstr, SvCUR(sstr));
10503 SvLEN_set(dstr, SvLEN(sstr));
10504 SvIV_set(dstr, SvIVX(sstr));
10505 SvNV_set(dstr, SvNVX(sstr));
10506 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10507 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10508 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10509 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10510 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10511 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10512 LvTARG(dstr) = dstr;
10513 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10514 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10516 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10517 LvTYPE(dstr) = LvTYPE(sstr);
10520 if (GvUNIQUE((GV*)sstr)) {
10522 if ((share = gv_share(sstr, param))) {
10525 ptr_table_store(PL_ptr_table, sstr, dstr);
10527 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10528 HvNAME_get(GvSTASH(share)), GvNAME(share));
10533 SvANY(dstr) = new_XPVGV();
10534 SvCUR_set(dstr, SvCUR(sstr));
10535 SvLEN_set(dstr, SvLEN(sstr));
10536 SvIV_set(dstr, SvIVX(sstr));
10537 SvNV_set(dstr, SvNVX(sstr));
10538 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10539 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10540 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10541 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10542 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10543 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10544 GvFLAGS(dstr) = GvFLAGS(sstr);
10545 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10546 (void)GpREFCNT_inc(GvGP(dstr));
10549 SvANY(dstr) = new_XPVIO();
10550 SvCUR_set(dstr, SvCUR(sstr));
10551 SvLEN_set(dstr, SvLEN(sstr));
10552 SvIV_set(dstr, SvIVX(sstr));
10553 SvNV_set(dstr, SvNVX(sstr));
10554 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10555 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10556 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10557 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10558 if (IoOFP(sstr) == IoIFP(sstr))
10559 IoOFP(dstr) = IoIFP(dstr);
10561 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10562 /* PL_rsfp_filters entries have fake IoDIRP() */
10563 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10564 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10566 IoDIRP(dstr) = IoDIRP(sstr);
10567 IoLINES(dstr) = IoLINES(sstr);
10568 IoPAGE(dstr) = IoPAGE(sstr);
10569 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10570 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10571 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10572 /* I have no idea why fake dirp (rsfps)
10573 should be treaded differently but otherwise
10574 we end up with leaks -- sky*/
10575 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10576 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10577 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10579 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10580 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10581 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10583 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10584 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10585 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10586 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10587 IoTYPE(dstr) = IoTYPE(sstr);
10588 IoFLAGS(dstr) = IoFLAGS(sstr);
10591 SvANY(dstr) = new_XPVAV();
10592 SvCUR_set(dstr, SvCUR(sstr));
10593 SvLEN_set(dstr, SvLEN(sstr));
10594 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10595 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10596 if (AvARRAY((AV*)sstr)) {
10597 SV **dst_ary, **src_ary;
10598 SSize_t items = AvFILLp((AV*)sstr) + 1;
10600 src_ary = AvARRAY((AV*)sstr);
10601 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10602 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10603 SvPV_set(dstr, (char*)dst_ary);
10604 AvALLOC((AV*)dstr) = dst_ary;
10605 if (AvREAL((AV*)sstr)) {
10606 while (items-- > 0)
10607 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10610 while (items-- > 0)
10611 *dst_ary++ = sv_dup(*src_ary++, param);
10613 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10614 while (items-- > 0) {
10615 *dst_ary++ = &PL_sv_undef;
10619 SvPV_set(dstr, Nullch);
10620 AvALLOC((AV*)dstr) = (SV**)NULL;
10624 SvANY(dstr) = new_XPVHV();
10625 SvCUR_set(dstr, SvCUR(sstr));
10626 SvLEN_set(dstr, SvLEN(sstr));
10627 HvTOTALKEYS(dstr) = HvTOTALKEYS(sstr);
10628 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10629 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10633 if (HvARRAY((HV*)sstr)) {
10635 const bool sharekeys = !!HvSHAREKEYS(sstr);
10636 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10637 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10640 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10641 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0), char);
10642 HvARRAY(dstr) = (HE**)darray;
10643 while (i <= sxhv->xhv_max) {
10644 HE *source = HvARRAY(sstr)[i];
10646 = source ? he_dup(source, sharekeys, param) : 0;
10650 struct xpvhv_aux *saux = HvAUX(sstr);
10651 struct xpvhv_aux *daux = HvAUX(dstr);
10652 /* This flag isn't copied. */
10653 /* SvOOK_on(hv) attacks the IV flags. */
10654 SvFLAGS(dstr) |= SVf_OOK;
10656 hvname = saux->xhv_name;
10657 daux->xhv_name = hvname ? hek_dup(hvname, param) : hvname;
10659 daux->xhv_riter = saux->xhv_riter;
10660 daux->xhv_eiter = saux->xhv_eiter
10661 ? he_dup(saux->xhv_eiter, (bool)!!HvSHAREKEYS(sstr),
10666 SvPV_set(dstr, Nullch);
10668 /* Record stashes for possible cloning in Perl_clone(). */
10670 av_push(param->stashes, dstr);
10674 SvANY(dstr) = new_XPVFM();
10675 FmLINES(dstr) = FmLINES(sstr);
10679 SvANY(dstr) = new_XPVCV();
10681 SvCUR_set(dstr, SvCUR(sstr));
10682 SvLEN_set(dstr, SvLEN(sstr));
10683 SvIV_set(dstr, SvIVX(sstr));
10684 SvNV_set(dstr, SvNVX(sstr));
10685 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10686 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10687 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10688 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10689 CvSTART(dstr) = CvSTART(sstr);
10691 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10693 CvXSUB(dstr) = CvXSUB(sstr);
10694 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10695 if (CvCONST(sstr)) {
10696 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10697 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10698 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
10700 /* don't dup if copying back - CvGV isn't refcounted, so the
10701 * duped GV may never be freed. A bit of a hack! DAPM */
10702 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10703 Nullgv : gv_dup(CvGV(sstr), param) ;
10704 if (param->flags & CLONEf_COPY_STACKS) {
10705 CvDEPTH(dstr) = CvDEPTH(sstr);
10709 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10710 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10712 CvWEAKOUTSIDE(sstr)
10713 ? cv_dup( CvOUTSIDE(sstr), param)
10714 : cv_dup_inc(CvOUTSIDE(sstr), param);
10715 CvFLAGS(dstr) = CvFLAGS(sstr);
10716 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10719 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10723 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10729 /* duplicate a context */
10732 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10734 PERL_CONTEXT *ncxs;
10737 return (PERL_CONTEXT*)NULL;
10739 /* look for it in the table first */
10740 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10744 /* create anew and remember what it is */
10745 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10746 ptr_table_store(PL_ptr_table, cxs, ncxs);
10749 PERL_CONTEXT *cx = &cxs[ix];
10750 PERL_CONTEXT *ncx = &ncxs[ix];
10751 ncx->cx_type = cx->cx_type;
10752 if (CxTYPE(cx) == CXt_SUBST) {
10753 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10756 ncx->blk_oldsp = cx->blk_oldsp;
10757 ncx->blk_oldcop = cx->blk_oldcop;
10758 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10759 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10760 ncx->blk_oldpm = cx->blk_oldpm;
10761 ncx->blk_gimme = cx->blk_gimme;
10762 switch (CxTYPE(cx)) {
10764 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10765 ? cv_dup_inc(cx->blk_sub.cv, param)
10766 : cv_dup(cx->blk_sub.cv,param));
10767 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10768 ? av_dup_inc(cx->blk_sub.argarray, param)
10770 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10771 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10772 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10773 ncx->blk_sub.lval = cx->blk_sub.lval;
10774 ncx->blk_sub.retop = cx->blk_sub.retop;
10777 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10778 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10779 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10780 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10781 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10782 ncx->blk_eval.retop = cx->blk_eval.retop;
10785 ncx->blk_loop.label = cx->blk_loop.label;
10786 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10787 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10788 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10789 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10790 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10791 ? cx->blk_loop.iterdata
10792 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10793 ncx->blk_loop.oldcomppad
10794 = (PAD*)ptr_table_fetch(PL_ptr_table,
10795 cx->blk_loop.oldcomppad);
10796 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10797 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10798 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10799 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10800 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10803 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10804 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10805 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10806 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10807 ncx->blk_sub.retop = cx->blk_sub.retop;
10819 /* duplicate a stack info structure */
10822 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10827 return (PERL_SI*)NULL;
10829 /* look for it in the table first */
10830 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10834 /* create anew and remember what it is */
10835 Newz(56, nsi, 1, PERL_SI);
10836 ptr_table_store(PL_ptr_table, si, nsi);
10838 nsi->si_stack = av_dup_inc(si->si_stack, param);
10839 nsi->si_cxix = si->si_cxix;
10840 nsi->si_cxmax = si->si_cxmax;
10841 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10842 nsi->si_type = si->si_type;
10843 nsi->si_prev = si_dup(si->si_prev, param);
10844 nsi->si_next = si_dup(si->si_next, param);
10845 nsi->si_markoff = si->si_markoff;
10850 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10851 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10852 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10853 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10854 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10855 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10856 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10857 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10858 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10859 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10860 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10861 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10862 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10863 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10866 #define pv_dup_inc(p) SAVEPV(p)
10867 #define pv_dup(p) SAVEPV(p)
10868 #define svp_dup_inc(p,pp) any_dup(p,pp)
10870 /* map any object to the new equivent - either something in the
10871 * ptr table, or something in the interpreter structure
10875 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10880 return (void*)NULL;
10882 /* look for it in the table first */
10883 ret = ptr_table_fetch(PL_ptr_table, v);
10887 /* see if it is part of the interpreter structure */
10888 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10889 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10897 /* duplicate the save stack */
10900 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10902 ANY *ss = proto_perl->Tsavestack;
10903 I32 ix = proto_perl->Tsavestack_ix;
10904 I32 max = proto_perl->Tsavestack_max;
10916 void (*dptr) (void*);
10917 void (*dxptr) (pTHX_ void*);
10920 Newz(54, nss, max, ANY);
10923 I32 i = POPINT(ss,ix);
10924 TOPINT(nss,ix) = i;
10926 case SAVEt_ITEM: /* normal string */
10927 sv = (SV*)POPPTR(ss,ix);
10928 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10929 sv = (SV*)POPPTR(ss,ix);
10930 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10932 case SAVEt_SV: /* scalar reference */
10933 sv = (SV*)POPPTR(ss,ix);
10934 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10935 gv = (GV*)POPPTR(ss,ix);
10936 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10938 case SAVEt_GENERIC_PVREF: /* generic char* */
10939 c = (char*)POPPTR(ss,ix);
10940 TOPPTR(nss,ix) = pv_dup(c);
10941 ptr = POPPTR(ss,ix);
10942 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10944 case SAVEt_SHARED_PVREF: /* char* in shared space */
10945 c = (char*)POPPTR(ss,ix);
10946 TOPPTR(nss,ix) = savesharedpv(c);
10947 ptr = POPPTR(ss,ix);
10948 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10950 case SAVEt_GENERIC_SVREF: /* generic sv */
10951 case SAVEt_SVREF: /* scalar reference */
10952 sv = (SV*)POPPTR(ss,ix);
10953 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10954 ptr = POPPTR(ss,ix);
10955 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10957 case SAVEt_AV: /* array reference */
10958 av = (AV*)POPPTR(ss,ix);
10959 TOPPTR(nss,ix) = av_dup_inc(av, param);
10960 gv = (GV*)POPPTR(ss,ix);
10961 TOPPTR(nss,ix) = gv_dup(gv, param);
10963 case SAVEt_HV: /* hash reference */
10964 hv = (HV*)POPPTR(ss,ix);
10965 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10966 gv = (GV*)POPPTR(ss,ix);
10967 TOPPTR(nss,ix) = gv_dup(gv, param);
10969 case SAVEt_INT: /* int reference */
10970 ptr = POPPTR(ss,ix);
10971 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10972 intval = (int)POPINT(ss,ix);
10973 TOPINT(nss,ix) = intval;
10975 case SAVEt_LONG: /* long reference */
10976 ptr = POPPTR(ss,ix);
10977 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10978 longval = (long)POPLONG(ss,ix);
10979 TOPLONG(nss,ix) = longval;
10981 case SAVEt_I32: /* I32 reference */
10982 case SAVEt_I16: /* I16 reference */
10983 case SAVEt_I8: /* I8 reference */
10984 ptr = POPPTR(ss,ix);
10985 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10987 TOPINT(nss,ix) = i;
10989 case SAVEt_IV: /* IV reference */
10990 ptr = POPPTR(ss,ix);
10991 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10993 TOPIV(nss,ix) = iv;
10995 case SAVEt_SPTR: /* SV* reference */
10996 ptr = POPPTR(ss,ix);
10997 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10998 sv = (SV*)POPPTR(ss,ix);
10999 TOPPTR(nss,ix) = sv_dup(sv, param);
11001 case SAVEt_VPTR: /* random* reference */
11002 ptr = POPPTR(ss,ix);
11003 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11004 ptr = POPPTR(ss,ix);
11005 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11007 case SAVEt_PPTR: /* char* reference */
11008 ptr = POPPTR(ss,ix);
11009 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11010 c = (char*)POPPTR(ss,ix);
11011 TOPPTR(nss,ix) = pv_dup(c);
11013 case SAVEt_HPTR: /* HV* reference */
11014 ptr = POPPTR(ss,ix);
11015 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11016 hv = (HV*)POPPTR(ss,ix);
11017 TOPPTR(nss,ix) = hv_dup(hv, param);
11019 case SAVEt_APTR: /* AV* reference */
11020 ptr = POPPTR(ss,ix);
11021 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11022 av = (AV*)POPPTR(ss,ix);
11023 TOPPTR(nss,ix) = av_dup(av, param);
11026 gv = (GV*)POPPTR(ss,ix);
11027 TOPPTR(nss,ix) = gv_dup(gv, param);
11029 case SAVEt_GP: /* scalar reference */
11030 gp = (GP*)POPPTR(ss,ix);
11031 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11032 (void)GpREFCNT_inc(gp);
11033 gv = (GV*)POPPTR(ss,ix);
11034 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11035 c = (char*)POPPTR(ss,ix);
11036 TOPPTR(nss,ix) = pv_dup(c);
11038 TOPIV(nss,ix) = iv;
11040 TOPIV(nss,ix) = iv;
11043 case SAVEt_MORTALIZESV:
11044 sv = (SV*)POPPTR(ss,ix);
11045 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11048 ptr = POPPTR(ss,ix);
11049 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11050 /* these are assumed to be refcounted properly */
11051 switch (((OP*)ptr)->op_type) {
11053 case OP_LEAVESUBLV:
11057 case OP_LEAVEWRITE:
11058 TOPPTR(nss,ix) = ptr;
11063 TOPPTR(nss,ix) = Nullop;
11068 TOPPTR(nss,ix) = Nullop;
11071 c = (char*)POPPTR(ss,ix);
11072 TOPPTR(nss,ix) = pv_dup_inc(c);
11074 case SAVEt_CLEARSV:
11075 longval = POPLONG(ss,ix);
11076 TOPLONG(nss,ix) = longval;
11079 hv = (HV*)POPPTR(ss,ix);
11080 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11081 c = (char*)POPPTR(ss,ix);
11082 TOPPTR(nss,ix) = pv_dup_inc(c);
11084 TOPINT(nss,ix) = i;
11086 case SAVEt_DESTRUCTOR:
11087 ptr = POPPTR(ss,ix);
11088 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11089 dptr = POPDPTR(ss,ix);
11090 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
11091 any_dup(FPTR2DPTR(void *, dptr),
11094 case SAVEt_DESTRUCTOR_X:
11095 ptr = POPPTR(ss,ix);
11096 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11097 dxptr = POPDXPTR(ss,ix);
11098 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
11099 any_dup(FPTR2DPTR(void *, dxptr),
11102 case SAVEt_REGCONTEXT:
11105 TOPINT(nss,ix) = i;
11108 case SAVEt_STACK_POS: /* Position on Perl stack */
11110 TOPINT(nss,ix) = i;
11112 case SAVEt_AELEM: /* array element */
11113 sv = (SV*)POPPTR(ss,ix);
11114 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11116 TOPINT(nss,ix) = i;
11117 av = (AV*)POPPTR(ss,ix);
11118 TOPPTR(nss,ix) = av_dup_inc(av, param);
11120 case SAVEt_HELEM: /* hash element */
11121 sv = (SV*)POPPTR(ss,ix);
11122 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11123 sv = (SV*)POPPTR(ss,ix);
11124 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11125 hv = (HV*)POPPTR(ss,ix);
11126 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11129 ptr = POPPTR(ss,ix);
11130 TOPPTR(nss,ix) = ptr;
11134 TOPINT(nss,ix) = i;
11136 case SAVEt_COMPPAD:
11137 av = (AV*)POPPTR(ss,ix);
11138 TOPPTR(nss,ix) = av_dup(av, param);
11141 longval = (long)POPLONG(ss,ix);
11142 TOPLONG(nss,ix) = longval;
11143 ptr = POPPTR(ss,ix);
11144 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11145 sv = (SV*)POPPTR(ss,ix);
11146 TOPPTR(nss,ix) = sv_dup(sv, param);
11149 ptr = POPPTR(ss,ix);
11150 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11151 longval = (long)POPBOOL(ss,ix);
11152 TOPBOOL(nss,ix) = (bool)longval;
11154 case SAVEt_SET_SVFLAGS:
11156 TOPINT(nss,ix) = i;
11158 TOPINT(nss,ix) = i;
11159 sv = (SV*)POPPTR(ss,ix);
11160 TOPPTR(nss,ix) = sv_dup(sv, param);
11163 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11171 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11172 * flag to the result. This is done for each stash before cloning starts,
11173 * so we know which stashes want their objects cloned */
11176 do_mark_cloneable_stash(pTHX_ SV *sv)
11178 const HEK *hvname = HvNAME_HEK((HV*)sv);
11180 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11181 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11182 if (cloner && GvCV(cloner)) {
11189 XPUSHs(sv_2mortal(newSVhek(hvname)));
11191 call_sv((SV*)GvCV(cloner), G_SCALAR);
11198 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11206 =for apidoc perl_clone
11208 Create and return a new interpreter by cloning the current one.
11210 perl_clone takes these flags as parameters:
11212 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11213 without it we only clone the data and zero the stacks,
11214 with it we copy the stacks and the new perl interpreter is
11215 ready to run at the exact same point as the previous one.
11216 The pseudo-fork code uses COPY_STACKS while the
11217 threads->new doesn't.
11219 CLONEf_KEEP_PTR_TABLE
11220 perl_clone keeps a ptr_table with the pointer of the old
11221 variable as a key and the new variable as a value,
11222 this allows it to check if something has been cloned and not
11223 clone it again but rather just use the value and increase the
11224 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11225 the ptr_table using the function
11226 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11227 reason to keep it around is if you want to dup some of your own
11228 variable who are outside the graph perl scans, example of this
11229 code is in threads.xs create
11232 This is a win32 thing, it is ignored on unix, it tells perls
11233 win32host code (which is c++) to clone itself, this is needed on
11234 win32 if you want to run two threads at the same time,
11235 if you just want to do some stuff in a separate perl interpreter
11236 and then throw it away and return to the original one,
11237 you don't need to do anything.
11242 /* XXX the above needs expanding by someone who actually understands it ! */
11243 EXTERN_C PerlInterpreter *
11244 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11247 perl_clone(PerlInterpreter *proto_perl, UV flags)
11250 #ifdef PERL_IMPLICIT_SYS
11252 /* perlhost.h so we need to call into it
11253 to clone the host, CPerlHost should have a c interface, sky */
11255 if (flags & CLONEf_CLONE_HOST) {
11256 return perl_clone_host(proto_perl,flags);
11258 return perl_clone_using(proto_perl, flags,
11260 proto_perl->IMemShared,
11261 proto_perl->IMemParse,
11263 proto_perl->IStdIO,
11267 proto_perl->IProc);
11271 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11272 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11273 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11274 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11275 struct IPerlDir* ipD, struct IPerlSock* ipS,
11276 struct IPerlProc* ipP)
11278 /* XXX many of the string copies here can be optimized if they're
11279 * constants; they need to be allocated as common memory and just
11280 * their pointers copied. */
11283 CLONE_PARAMS clone_params;
11284 CLONE_PARAMS* param = &clone_params;
11286 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11287 /* for each stash, determine whether its objects should be cloned */
11288 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11289 PERL_SET_THX(my_perl);
11292 Poison(my_perl, 1, PerlInterpreter);
11294 PL_curcop = (COP *)Nullop;
11298 PL_savestack_ix = 0;
11299 PL_savestack_max = -1;
11300 PL_sig_pending = 0;
11301 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11302 # else /* !DEBUGGING */
11303 Zero(my_perl, 1, PerlInterpreter);
11304 # endif /* DEBUGGING */
11306 /* host pointers */
11308 PL_MemShared = ipMS;
11309 PL_MemParse = ipMP;
11316 #else /* !PERL_IMPLICIT_SYS */
11318 CLONE_PARAMS clone_params;
11319 CLONE_PARAMS* param = &clone_params;
11320 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11321 /* for each stash, determine whether its objects should be cloned */
11322 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11323 PERL_SET_THX(my_perl);
11326 Poison(my_perl, 1, PerlInterpreter);
11328 PL_curcop = (COP *)Nullop;
11332 PL_savestack_ix = 0;
11333 PL_savestack_max = -1;
11334 PL_sig_pending = 0;
11335 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11336 # else /* !DEBUGGING */
11337 Zero(my_perl, 1, PerlInterpreter);
11338 # endif /* DEBUGGING */
11339 #endif /* PERL_IMPLICIT_SYS */
11340 param->flags = flags;
11341 param->proto_perl = proto_perl;
11344 PL_xnv_arenaroot = NULL;
11345 PL_xnv_root = NULL;
11346 PL_xpv_arenaroot = NULL;
11347 PL_xpv_root = NULL;
11348 PL_xpviv_arenaroot = NULL;
11349 PL_xpviv_root = NULL;
11350 PL_xpvnv_arenaroot = NULL;
11351 PL_xpvnv_root = NULL;
11352 PL_xpvcv_arenaroot = NULL;
11353 PL_xpvcv_root = NULL;
11354 PL_xpvav_arenaroot = NULL;
11355 PL_xpvav_root = NULL;
11356 PL_xpvhv_arenaroot = NULL;
11357 PL_xpvhv_root = NULL;
11358 PL_xpvmg_arenaroot = NULL;
11359 PL_xpvmg_root = NULL;
11360 PL_xpvgv_arenaroot = NULL;
11361 PL_xpvgv_root = NULL;
11362 PL_xpvlv_arenaroot = NULL;
11363 PL_xpvlv_root = NULL;
11364 PL_xpvbm_arenaroot = NULL;
11365 PL_xpvbm_root = NULL;
11366 PL_he_arenaroot = NULL;
11368 #if defined(USE_ITHREADS)
11369 PL_pte_arenaroot = NULL;
11370 PL_pte_root = NULL;
11372 PL_nice_chunk = NULL;
11373 PL_nice_chunk_size = 0;
11375 PL_sv_objcount = 0;
11376 PL_sv_root = Nullsv;
11377 PL_sv_arenaroot = Nullsv;
11379 PL_debug = proto_perl->Idebug;
11381 PL_hash_seed = proto_perl->Ihash_seed;
11382 PL_rehash_seed = proto_perl->Irehash_seed;
11384 #ifdef USE_REENTRANT_API
11385 /* XXX: things like -Dm will segfault here in perlio, but doing
11386 * PERL_SET_CONTEXT(proto_perl);
11387 * breaks too many other things
11389 Perl_reentrant_init(aTHX);
11392 /* create SV map for pointer relocation */
11393 PL_ptr_table = ptr_table_new();
11395 /* initialize these special pointers as early as possible */
11396 SvANY(&PL_sv_undef) = NULL;
11397 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11398 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11399 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11401 SvANY(&PL_sv_no) = new_XPVNV();
11402 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11403 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11404 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11405 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11406 SvCUR_set(&PL_sv_no, 0);
11407 SvLEN_set(&PL_sv_no, 1);
11408 SvIV_set(&PL_sv_no, 0);
11409 SvNV_set(&PL_sv_no, 0);
11410 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11412 SvANY(&PL_sv_yes) = new_XPVNV();
11413 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11414 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11415 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11416 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11417 SvCUR_set(&PL_sv_yes, 1);
11418 SvLEN_set(&PL_sv_yes, 2);
11419 SvIV_set(&PL_sv_yes, 1);
11420 SvNV_set(&PL_sv_yes, 1);
11421 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11423 /* create (a non-shared!) shared string table */
11424 PL_strtab = newHV();
11425 HvSHAREKEYS_off(PL_strtab);
11426 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11427 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11429 PL_compiling = proto_perl->Icompiling;
11431 /* These two PVs will be free'd special way so must set them same way op.c does */
11432 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11433 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11435 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11436 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11438 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11439 if (!specialWARN(PL_compiling.cop_warnings))
11440 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11441 if (!specialCopIO(PL_compiling.cop_io))
11442 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11443 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11445 /* pseudo environmental stuff */
11446 PL_origargc = proto_perl->Iorigargc;
11447 PL_origargv = proto_perl->Iorigargv;
11449 param->stashes = newAV(); /* Setup array of objects to call clone on */
11451 #ifdef PERLIO_LAYERS
11452 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11453 PerlIO_clone(aTHX_ proto_perl, param);
11456 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11457 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11458 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11459 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11460 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11461 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11464 PL_minus_c = proto_perl->Iminus_c;
11465 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11466 PL_localpatches = proto_perl->Ilocalpatches;
11467 PL_splitstr = proto_perl->Isplitstr;
11468 PL_preprocess = proto_perl->Ipreprocess;
11469 PL_minus_n = proto_perl->Iminus_n;
11470 PL_minus_p = proto_perl->Iminus_p;
11471 PL_minus_l = proto_perl->Iminus_l;
11472 PL_minus_a = proto_perl->Iminus_a;
11473 PL_minus_F = proto_perl->Iminus_F;
11474 PL_doswitches = proto_perl->Idoswitches;
11475 PL_dowarn = proto_perl->Idowarn;
11476 PL_doextract = proto_perl->Idoextract;
11477 PL_sawampersand = proto_perl->Isawampersand;
11478 PL_unsafe = proto_perl->Iunsafe;
11479 PL_inplace = SAVEPV(proto_perl->Iinplace);
11480 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11481 PL_perldb = proto_perl->Iperldb;
11482 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11483 PL_exit_flags = proto_perl->Iexit_flags;
11485 /* magical thingies */
11486 /* XXX time(&PL_basetime) when asked for? */
11487 PL_basetime = proto_perl->Ibasetime;
11488 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11490 PL_maxsysfd = proto_perl->Imaxsysfd;
11491 PL_multiline = proto_perl->Imultiline;
11492 PL_statusvalue = proto_perl->Istatusvalue;
11494 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11496 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11498 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11499 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11500 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11502 /* Clone the regex array */
11503 PL_regex_padav = newAV();
11505 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11506 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11508 av_push(PL_regex_padav,
11509 sv_dup_inc(regexen[0],param));
11510 for(i = 1; i <= len; i++) {
11511 if(SvREPADTMP(regexen[i])) {
11512 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11514 av_push(PL_regex_padav,
11516 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11517 SvIVX(regexen[i])), param)))
11522 PL_regex_pad = AvARRAY(PL_regex_padav);
11524 /* shortcuts to various I/O objects */
11525 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11526 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11527 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11528 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11529 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11530 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11532 /* shortcuts to regexp stuff */
11533 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11535 /* shortcuts to misc objects */
11536 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11538 /* shortcuts to debugging objects */
11539 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11540 PL_DBline = gv_dup(proto_perl->IDBline, param);
11541 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11542 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11543 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11544 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11545 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11546 PL_lineary = av_dup(proto_perl->Ilineary, param);
11547 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11549 /* symbol tables */
11550 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11551 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11552 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11553 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11554 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11556 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11557 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11558 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11559 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11560 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11561 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11563 PL_sub_generation = proto_perl->Isub_generation;
11565 /* funky return mechanisms */
11566 PL_forkprocess = proto_perl->Iforkprocess;
11568 /* subprocess state */
11569 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11571 /* internal state */
11572 PL_tainting = proto_perl->Itainting;
11573 PL_taint_warn = proto_perl->Itaint_warn;
11574 PL_maxo = proto_perl->Imaxo;
11575 if (proto_perl->Iop_mask)
11576 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11578 PL_op_mask = Nullch;
11579 /* PL_asserting = proto_perl->Iasserting; */
11581 /* current interpreter roots */
11582 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11583 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11584 PL_main_start = proto_perl->Imain_start;
11585 PL_eval_root = proto_perl->Ieval_root;
11586 PL_eval_start = proto_perl->Ieval_start;
11588 /* runtime control stuff */
11589 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11590 PL_copline = proto_perl->Icopline;
11592 PL_filemode = proto_perl->Ifilemode;
11593 PL_lastfd = proto_perl->Ilastfd;
11594 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11597 PL_gensym = proto_perl->Igensym;
11598 PL_preambled = proto_perl->Ipreambled;
11599 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11600 PL_laststatval = proto_perl->Ilaststatval;
11601 PL_laststype = proto_perl->Ilaststype;
11602 PL_mess_sv = Nullsv;
11604 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11605 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11607 /* interpreter atexit processing */
11608 PL_exitlistlen = proto_perl->Iexitlistlen;
11609 if (PL_exitlistlen) {
11610 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11611 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11614 PL_exitlist = (PerlExitListEntry*)NULL;
11615 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11616 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11617 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11619 PL_profiledata = NULL;
11620 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11621 /* PL_rsfp_filters entries have fake IoDIRP() */
11622 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11624 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11626 PAD_CLONE_VARS(proto_perl, param);
11628 #ifdef HAVE_INTERP_INTERN
11629 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11632 /* more statics moved here */
11633 PL_generation = proto_perl->Igeneration;
11634 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11636 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11637 PL_in_clean_all = proto_perl->Iin_clean_all;
11639 PL_uid = proto_perl->Iuid;
11640 PL_euid = proto_perl->Ieuid;
11641 PL_gid = proto_perl->Igid;
11642 PL_egid = proto_perl->Iegid;
11643 PL_nomemok = proto_perl->Inomemok;
11644 PL_an = proto_perl->Ian;
11645 PL_evalseq = proto_perl->Ievalseq;
11646 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11647 PL_origalen = proto_perl->Iorigalen;
11648 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11649 PL_osname = SAVEPV(proto_perl->Iosname);
11650 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11651 PL_sighandlerp = proto_perl->Isighandlerp;
11654 PL_runops = proto_perl->Irunops;
11656 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11659 PL_cshlen = proto_perl->Icshlen;
11660 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11663 PL_lex_state = proto_perl->Ilex_state;
11664 PL_lex_defer = proto_perl->Ilex_defer;
11665 PL_lex_expect = proto_perl->Ilex_expect;
11666 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11667 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11668 PL_lex_starts = proto_perl->Ilex_starts;
11669 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11670 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11671 PL_lex_op = proto_perl->Ilex_op;
11672 PL_lex_inpat = proto_perl->Ilex_inpat;
11673 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11674 PL_lex_brackets = proto_perl->Ilex_brackets;
11675 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11676 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11677 PL_lex_casemods = proto_perl->Ilex_casemods;
11678 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11679 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11681 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11682 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11683 PL_nexttoke = proto_perl->Inexttoke;
11685 /* XXX This is probably masking the deeper issue of why
11686 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11687 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11688 * (A little debugging with a watchpoint on it may help.)
11690 if (SvANY(proto_perl->Ilinestr)) {
11691 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11692 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11693 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11694 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11695 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11696 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11697 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11698 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11699 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11702 PL_linestr = NEWSV(65,79);
11703 sv_upgrade(PL_linestr,SVt_PVIV);
11704 sv_setpvn(PL_linestr,"",0);
11705 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11707 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11708 PL_pending_ident = proto_perl->Ipending_ident;
11709 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11711 PL_expect = proto_perl->Iexpect;
11713 PL_multi_start = proto_perl->Imulti_start;
11714 PL_multi_end = proto_perl->Imulti_end;
11715 PL_multi_open = proto_perl->Imulti_open;
11716 PL_multi_close = proto_perl->Imulti_close;
11718 PL_error_count = proto_perl->Ierror_count;
11719 PL_subline = proto_perl->Isubline;
11720 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11722 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11723 if (SvANY(proto_perl->Ilinestr)) {
11724 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11725 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11726 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11727 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11728 PL_last_lop_op = proto_perl->Ilast_lop_op;
11731 PL_last_uni = SvPVX(PL_linestr);
11732 PL_last_lop = SvPVX(PL_linestr);
11733 PL_last_lop_op = 0;
11735 PL_in_my = proto_perl->Iin_my;
11736 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11738 PL_cryptseen = proto_perl->Icryptseen;
11741 PL_hints = proto_perl->Ihints;
11743 PL_amagic_generation = proto_perl->Iamagic_generation;
11745 #ifdef USE_LOCALE_COLLATE
11746 PL_collation_ix = proto_perl->Icollation_ix;
11747 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11748 PL_collation_standard = proto_perl->Icollation_standard;
11749 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11750 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11751 #endif /* USE_LOCALE_COLLATE */
11753 #ifdef USE_LOCALE_NUMERIC
11754 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11755 PL_numeric_standard = proto_perl->Inumeric_standard;
11756 PL_numeric_local = proto_perl->Inumeric_local;
11757 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11758 #endif /* !USE_LOCALE_NUMERIC */
11760 /* utf8 character classes */
11761 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11762 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11763 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11764 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11765 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11766 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11767 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11768 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11769 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11770 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11771 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11772 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11773 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11774 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11775 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11776 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11777 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11778 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11779 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11780 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11782 /* Did the locale setup indicate UTF-8? */
11783 PL_utf8locale = proto_perl->Iutf8locale;
11784 /* Unicode features (see perlrun/-C) */
11785 PL_unicode = proto_perl->Iunicode;
11787 /* Pre-5.8 signals control */
11788 PL_signals = proto_perl->Isignals;
11790 /* times() ticks per second */
11791 PL_clocktick = proto_perl->Iclocktick;
11793 /* Recursion stopper for PerlIO_find_layer */
11794 PL_in_load_module = proto_perl->Iin_load_module;
11796 /* sort() routine */
11797 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11799 /* Not really needed/useful since the reenrant_retint is "volatile",
11800 * but do it for consistency's sake. */
11801 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11803 /* Hooks to shared SVs and locks. */
11804 PL_sharehook = proto_perl->Isharehook;
11805 PL_lockhook = proto_perl->Ilockhook;
11806 PL_unlockhook = proto_perl->Iunlockhook;
11807 PL_threadhook = proto_perl->Ithreadhook;
11809 PL_runops_std = proto_perl->Irunops_std;
11810 PL_runops_dbg = proto_perl->Irunops_dbg;
11812 #ifdef THREADS_HAVE_PIDS
11813 PL_ppid = proto_perl->Ippid;
11817 PL_last_swash_hv = Nullhv; /* reinits on demand */
11818 PL_last_swash_klen = 0;
11819 PL_last_swash_key[0]= '\0';
11820 PL_last_swash_tmps = (U8*)NULL;
11821 PL_last_swash_slen = 0;
11823 PL_glob_index = proto_perl->Iglob_index;
11824 PL_srand_called = proto_perl->Isrand_called;
11825 PL_uudmap['M'] = 0; /* reinits on demand */
11826 PL_bitcount = Nullch; /* reinits on demand */
11828 if (proto_perl->Ipsig_pend) {
11829 Newz(0, PL_psig_pend, SIG_SIZE, int);
11832 PL_psig_pend = (int*)NULL;
11835 if (proto_perl->Ipsig_ptr) {
11836 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11837 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11838 for (i = 1; i < SIG_SIZE; i++) {
11839 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11840 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11844 PL_psig_ptr = (SV**)NULL;
11845 PL_psig_name = (SV**)NULL;
11848 /* thrdvar.h stuff */
11850 if (flags & CLONEf_COPY_STACKS) {
11851 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11852 PL_tmps_ix = proto_perl->Ttmps_ix;
11853 PL_tmps_max = proto_perl->Ttmps_max;
11854 PL_tmps_floor = proto_perl->Ttmps_floor;
11855 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11857 while (i <= PL_tmps_ix) {
11858 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11862 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11863 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11864 Newz(54, PL_markstack, i, I32);
11865 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11866 - proto_perl->Tmarkstack);
11867 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11868 - proto_perl->Tmarkstack);
11869 Copy(proto_perl->Tmarkstack, PL_markstack,
11870 PL_markstack_ptr - PL_markstack + 1, I32);
11872 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11873 * NOTE: unlike the others! */
11874 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11875 PL_scopestack_max = proto_perl->Tscopestack_max;
11876 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11877 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11879 /* NOTE: si_dup() looks at PL_markstack */
11880 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11882 /* PL_curstack = PL_curstackinfo->si_stack; */
11883 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11884 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11886 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11887 PL_stack_base = AvARRAY(PL_curstack);
11888 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11889 - proto_perl->Tstack_base);
11890 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11892 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11893 * NOTE: unlike the others! */
11894 PL_savestack_ix = proto_perl->Tsavestack_ix;
11895 PL_savestack_max = proto_perl->Tsavestack_max;
11896 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11897 PL_savestack = ss_dup(proto_perl, param);
11901 ENTER; /* perl_destruct() wants to LEAVE; */
11904 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11905 PL_top_env = &PL_start_env;
11907 PL_op = proto_perl->Top;
11910 PL_Xpv = (XPV*)NULL;
11911 PL_na = proto_perl->Tna;
11913 PL_statbuf = proto_perl->Tstatbuf;
11914 PL_statcache = proto_perl->Tstatcache;
11915 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11916 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11918 PL_timesbuf = proto_perl->Ttimesbuf;
11921 PL_tainted = proto_perl->Ttainted;
11922 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11923 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11924 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11925 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11926 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11927 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11928 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11929 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11930 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11932 PL_restartop = proto_perl->Trestartop;
11933 PL_in_eval = proto_perl->Tin_eval;
11934 PL_delaymagic = proto_perl->Tdelaymagic;
11935 PL_dirty = proto_perl->Tdirty;
11936 PL_localizing = proto_perl->Tlocalizing;
11938 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11939 PL_hv_fetch_ent_mh = Nullhe;
11940 PL_modcount = proto_perl->Tmodcount;
11941 PL_lastgotoprobe = Nullop;
11942 PL_dumpindent = proto_perl->Tdumpindent;
11944 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11945 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11946 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11947 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11948 PL_sortcxix = proto_perl->Tsortcxix;
11949 PL_efloatbuf = Nullch; /* reinits on demand */
11950 PL_efloatsize = 0; /* reinits on demand */
11954 PL_screamfirst = NULL;
11955 PL_screamnext = NULL;
11956 PL_maxscream = -1; /* reinits on demand */
11957 PL_lastscream = Nullsv;
11959 PL_watchaddr = NULL;
11960 PL_watchok = Nullch;
11962 PL_regdummy = proto_perl->Tregdummy;
11963 PL_regprecomp = Nullch;
11966 PL_colorset = 0; /* reinits PL_colors[] */
11967 /*PL_colors[6] = {0,0,0,0,0,0};*/
11968 PL_reginput = Nullch;
11969 PL_regbol = Nullch;
11970 PL_regeol = Nullch;
11971 PL_regstartp = (I32*)NULL;
11972 PL_regendp = (I32*)NULL;
11973 PL_reglastparen = (U32*)NULL;
11974 PL_reglastcloseparen = (U32*)NULL;
11975 PL_regtill = Nullch;
11976 PL_reg_start_tmp = (char**)NULL;
11977 PL_reg_start_tmpl = 0;
11978 PL_regdata = (struct reg_data*)NULL;
11981 PL_reg_eval_set = 0;
11983 PL_regprogram = (regnode*)NULL;
11985 PL_regcc = (CURCUR*)NULL;
11986 PL_reg_call_cc = (struct re_cc_state*)NULL;
11987 PL_reg_re = (regexp*)NULL;
11988 PL_reg_ganch = Nullch;
11989 PL_reg_sv = Nullsv;
11990 PL_reg_match_utf8 = FALSE;
11991 PL_reg_magic = (MAGIC*)NULL;
11993 PL_reg_oldcurpm = (PMOP*)NULL;
11994 PL_reg_curpm = (PMOP*)NULL;
11995 PL_reg_oldsaved = Nullch;
11996 PL_reg_oldsavedlen = 0;
11997 #ifdef PERL_OLD_COPY_ON_WRITE
12000 PL_reg_maxiter = 0;
12001 PL_reg_leftiter = 0;
12002 PL_reg_poscache = Nullch;
12003 PL_reg_poscache_size= 0;
12005 /* RE engine - function pointers */
12006 PL_regcompp = proto_perl->Tregcompp;
12007 PL_regexecp = proto_perl->Tregexecp;
12008 PL_regint_start = proto_perl->Tregint_start;
12009 PL_regint_string = proto_perl->Tregint_string;
12010 PL_regfree = proto_perl->Tregfree;
12012 PL_reginterp_cnt = 0;
12013 PL_reg_starttry = 0;
12015 /* Pluggable optimizer */
12016 PL_peepp = proto_perl->Tpeepp;
12018 PL_stashcache = newHV();
12020 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12021 ptr_table_free(PL_ptr_table);
12022 PL_ptr_table = NULL;
12025 /* Call the ->CLONE method, if it exists, for each of the stashes
12026 identified by sv_dup() above.
12028 while(av_len(param->stashes) != -1) {
12029 HV* stash = (HV*) av_shift(param->stashes);
12030 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12031 if (cloner && GvCV(cloner)) {
12036 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
12038 call_sv((SV*)GvCV(cloner), G_DISCARD);
12044 SvREFCNT_dec(param->stashes);
12046 /* orphaned? eg threads->new inside BEGIN or use */
12047 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12048 (void)SvREFCNT_inc(PL_compcv);
12049 SAVEFREESV(PL_compcv);
12055 #endif /* USE_ITHREADS */
12058 =head1 Unicode Support
12060 =for apidoc sv_recode_to_utf8
12062 The encoding is assumed to be an Encode object, on entry the PV
12063 of the sv is assumed to be octets in that encoding, and the sv
12064 will be converted into Unicode (and UTF-8).
12066 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12067 is not a reference, nothing is done to the sv. If the encoding is not
12068 an C<Encode::XS> Encoding object, bad things will happen.
12069 (See F<lib/encoding.pm> and L<Encode>).
12071 The PV of the sv is returned.
12076 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12079 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12093 Passing sv_yes is wrong - it needs to be or'ed set of constants
12094 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12095 remove converted chars from source.
12097 Both will default the value - let them.
12099 XPUSHs(&PL_sv_yes);
12102 call_method("decode", G_SCALAR);
12106 s = SvPV_const(uni, len);
12107 if (s != SvPVX_const(sv)) {
12108 SvGROW(sv, len + 1);
12109 Move(s, SvPVX(sv), len + 1, char);
12110 SvCUR_set(sv, len);
12117 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12121 =for apidoc sv_cat_decode
12123 The encoding is assumed to be an Encode object, the PV of the ssv is
12124 assumed to be octets in that encoding and decoding the input starts
12125 from the position which (PV + *offset) pointed to. The dsv will be
12126 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12127 when the string tstr appears in decoding output or the input ends on
12128 the PV of the ssv. The value which the offset points will be modified
12129 to the last input position on the ssv.
12131 Returns TRUE if the terminator was found, else returns FALSE.
12136 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12137 SV *ssv, int *offset, char *tstr, int tlen)
12141 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12152 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12153 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12155 call_method("cat_decode", G_SCALAR);
12157 ret = SvTRUE(TOPs);
12158 *offset = SvIV(offsv);
12164 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12170 * c-indentation-style: bsd
12171 * c-basic-offset: 4
12172 * indent-tabs-mode: t
12175 * ex: set ts=8 sts=4 sw=4 noet: