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_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);
537 Safefree((void *)sva);
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(sv));
769 if (subscript_type == FUV_SUBSCRIPT_HASH) {
772 Perl_sv_catpvf(aTHX_ name, "{%s}",
773 pv_display(sv,SvPVX(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();
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(varname) : "",
1121 " in ", OP_DESC(PL_op));
1124 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1128 /* allocate another arena's worth of NV bodies */
1136 New(711, ptr, PERL_ARENA_SIZE/sizeof(NV), NV);
1137 *((void **) ptr) = (void *)PL_xnv_arenaroot;
1138 PL_xnv_arenaroot = ptr;
1141 xnvend = &xnv[PERL_ARENA_SIZE / sizeof(NV) - 1];
1142 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1144 while (xnv < xnvend) {
1145 *(NV**)xnv = (NV*)(xnv + 1);
1151 /* allocate another arena's worth of struct xpv */
1158 New(713, xpv, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1159 *((XPV**)xpv) = PL_xpv_arenaroot;
1160 PL_xpv_arenaroot = xpv;
1162 xpvend = &xpv[PERL_ARENA_SIZE / sizeof(XPV) - 1];
1163 PL_xpv_root = ++xpv;
1164 while (xpv < xpvend) {
1165 *((XPV**)xpv) = xpv + 1;
1171 /* allocate another arena's worth of struct xpviv */
1178 New(714, xpviv, PERL_ARENA_SIZE/sizeof(XPVIV), XPVIV);
1179 *((XPVIV**)xpviv) = PL_xpviv_arenaroot;
1180 PL_xpviv_arenaroot = xpviv;
1182 xpvivend = &xpviv[PERL_ARENA_SIZE / sizeof(XPVIV) - 1];
1183 PL_xpviv_root = ++xpviv;
1184 while (xpviv < xpvivend) {
1185 *((XPVIV**)xpviv) = xpviv + 1;
1188 *((XPVIV**)xpviv) = 0;
1191 /* allocate another arena's worth of struct xpvnv */
1198 New(715, xpvnv, PERL_ARENA_SIZE/sizeof(XPVNV), XPVNV);
1199 *((XPVNV**)xpvnv) = PL_xpvnv_arenaroot;
1200 PL_xpvnv_arenaroot = xpvnv;
1202 xpvnvend = &xpvnv[PERL_ARENA_SIZE / sizeof(XPVNV) - 1];
1203 PL_xpvnv_root = ++xpvnv;
1204 while (xpvnv < xpvnvend) {
1205 *((XPVNV**)xpvnv) = xpvnv + 1;
1208 *((XPVNV**)xpvnv) = 0;
1211 /* allocate another arena's worth of struct xpvcv */
1218 New(716, xpvcv, PERL_ARENA_SIZE/sizeof(XPVCV), XPVCV);
1219 *((XPVCV**)xpvcv) = PL_xpvcv_arenaroot;
1220 PL_xpvcv_arenaroot = xpvcv;
1222 xpvcvend = &xpvcv[PERL_ARENA_SIZE / sizeof(XPVCV) - 1];
1223 PL_xpvcv_root = ++xpvcv;
1224 while (xpvcv < xpvcvend) {
1225 *((XPVCV**)xpvcv) = xpvcv + 1;
1228 *((XPVCV**)xpvcv) = 0;
1231 /* allocate another arena's worth of struct xpvav */
1238 New(717, xpvav, PERL_ARENA_SIZE/sizeof(XPVAV), XPVAV);
1239 *((XPVAV**)xpvav) = PL_xpvav_arenaroot;
1240 PL_xpvav_arenaroot = xpvav;
1242 xpvavend = &xpvav[PERL_ARENA_SIZE / sizeof(XPVAV) - 1];
1243 PL_xpvav_root = ++xpvav;
1244 while (xpvav < xpvavend) {
1245 *((XPVAV**)xpvav) = xpvav + 1;
1248 *((XPVAV**)xpvav) = 0;
1251 /* allocate another arena's worth of struct xpvhv */
1258 New(718, xpvhv, PERL_ARENA_SIZE/sizeof(XPVHV), XPVHV);
1259 *((XPVHV**)xpvhv) = PL_xpvhv_arenaroot;
1260 PL_xpvhv_arenaroot = xpvhv;
1262 xpvhvend = &xpvhv[PERL_ARENA_SIZE / sizeof(XPVHV) - 1];
1263 PL_xpvhv_root = ++xpvhv;
1264 while (xpvhv < xpvhvend) {
1265 *((XPVHV**)xpvhv) = xpvhv + 1;
1268 *((XPVHV**)xpvhv) = 0;
1271 /* allocate another arena's worth of struct xpvmg */
1278 New(719, xpvmg, PERL_ARENA_SIZE/sizeof(XPVMG), XPVMG);
1279 *((XPVMG**)xpvmg) = PL_xpvmg_arenaroot;
1280 PL_xpvmg_arenaroot = xpvmg;
1282 xpvmgend = &xpvmg[PERL_ARENA_SIZE / sizeof(XPVMG) - 1];
1283 PL_xpvmg_root = ++xpvmg;
1284 while (xpvmg < xpvmgend) {
1285 *((XPVMG**)xpvmg) = xpvmg + 1;
1288 *((XPVMG**)xpvmg) = 0;
1291 /* allocate another arena's worth of struct xpvgv */
1298 New(720, xpvgv, PERL_ARENA_SIZE/sizeof(XPVGV), XPVGV);
1299 *((XPVGV**)xpvgv) = PL_xpvgv_arenaroot;
1300 PL_xpvgv_arenaroot = xpvgv;
1302 xpvgvend = &xpvgv[PERL_ARENA_SIZE / sizeof(XPVGV) - 1];
1303 PL_xpvgv_root = ++xpvgv;
1304 while (xpvgv < xpvgvend) {
1305 *((XPVGV**)xpvgv) = xpvgv + 1;
1308 *((XPVGV**)xpvgv) = 0;
1311 /* allocate another arena's worth of struct xpvlv */
1318 New(720, xpvlv, PERL_ARENA_SIZE/sizeof(XPVLV), XPVLV);
1319 *((XPVLV**)xpvlv) = PL_xpvlv_arenaroot;
1320 PL_xpvlv_arenaroot = xpvlv;
1322 xpvlvend = &xpvlv[PERL_ARENA_SIZE / sizeof(XPVLV) - 1];
1323 PL_xpvlv_root = ++xpvlv;
1324 while (xpvlv < xpvlvend) {
1325 *((XPVLV**)xpvlv) = xpvlv + 1;
1328 *((XPVLV**)xpvlv) = 0;
1331 /* allocate another arena's worth of struct xpvbm */
1338 New(721, xpvbm, PERL_ARENA_SIZE/sizeof(XPVBM), XPVBM);
1339 *((XPVBM**)xpvbm) = PL_xpvbm_arenaroot;
1340 PL_xpvbm_arenaroot = xpvbm;
1342 xpvbmend = &xpvbm[PERL_ARENA_SIZE / sizeof(XPVBM) - 1];
1343 PL_xpvbm_root = ++xpvbm;
1344 while (xpvbm < xpvbmend) {
1345 *((XPVBM**)xpvbm) = xpvbm + 1;
1348 *((XPVBM**)xpvbm) = 0;
1351 /* grab a new NV body from the free list, allocating more if necessary */
1361 PL_xnv_root = *(NV**)xnv;
1363 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1366 /* return an NV body to the free list */
1369 S_del_xnv(pTHX_ XPVNV *p)
1371 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1373 *(NV**)xnv = PL_xnv_root;
1378 /* grab a new struct xpv from the free list, allocating more if necessary */
1388 PL_xpv_root = *(XPV**)xpv;
1393 /* return a struct xpv to the free list */
1396 S_del_xpv(pTHX_ XPV *p)
1399 *(XPV**)p = PL_xpv_root;
1404 /* grab a new struct xpviv from the free list, allocating more if necessary */
1413 xpviv = PL_xpviv_root;
1414 PL_xpviv_root = *(XPVIV**)xpviv;
1419 /* return a struct xpviv to the free list */
1422 S_del_xpviv(pTHX_ XPVIV *p)
1425 *(XPVIV**)p = PL_xpviv_root;
1430 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1439 xpvnv = PL_xpvnv_root;
1440 PL_xpvnv_root = *(XPVNV**)xpvnv;
1445 /* return a struct xpvnv to the free list */
1448 S_del_xpvnv(pTHX_ XPVNV *p)
1451 *(XPVNV**)p = PL_xpvnv_root;
1456 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1465 xpvcv = PL_xpvcv_root;
1466 PL_xpvcv_root = *(XPVCV**)xpvcv;
1471 /* return a struct xpvcv to the free list */
1474 S_del_xpvcv(pTHX_ XPVCV *p)
1477 *(XPVCV**)p = PL_xpvcv_root;
1482 /* grab a new struct xpvav from the free list, allocating more if necessary */
1491 xpvav = PL_xpvav_root;
1492 PL_xpvav_root = *(XPVAV**)xpvav;
1497 /* return a struct xpvav to the free list */
1500 S_del_xpvav(pTHX_ XPVAV *p)
1503 *(XPVAV**)p = PL_xpvav_root;
1508 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1517 xpvhv = PL_xpvhv_root;
1518 PL_xpvhv_root = *(XPVHV**)xpvhv;
1523 /* return a struct xpvhv to the free list */
1526 S_del_xpvhv(pTHX_ XPVHV *p)
1529 *(XPVHV**)p = PL_xpvhv_root;
1534 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1543 xpvmg = PL_xpvmg_root;
1544 PL_xpvmg_root = *(XPVMG**)xpvmg;
1549 /* return a struct xpvmg to the free list */
1552 S_del_xpvmg(pTHX_ XPVMG *p)
1555 *(XPVMG**)p = PL_xpvmg_root;
1560 /* grab a new struct xpvgv from the free list, allocating more if necessary */
1569 xpvgv = PL_xpvgv_root;
1570 PL_xpvgv_root = *(XPVGV**)xpvgv;
1575 /* return a struct xpvgv to the free list */
1578 S_del_xpvgv(pTHX_ XPVGV *p)
1581 *(XPVGV**)p = PL_xpvgv_root;
1586 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1595 xpvlv = PL_xpvlv_root;
1596 PL_xpvlv_root = *(XPVLV**)xpvlv;
1601 /* return a struct xpvlv to the free list */
1604 S_del_xpvlv(pTHX_ XPVLV *p)
1607 *(XPVLV**)p = PL_xpvlv_root;
1612 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1621 xpvbm = PL_xpvbm_root;
1622 PL_xpvbm_root = *(XPVBM**)xpvbm;
1627 /* return a struct xpvbm to the free list */
1630 S_del_xpvbm(pTHX_ XPVBM *p)
1633 *(XPVBM**)p = PL_xpvbm_root;
1638 #define my_safemalloc(s) (void*)safemalloc(s)
1639 #define my_safefree(p) safefree((char*)p)
1643 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1644 #define del_XNV(p) my_safefree(p)
1646 #define new_XPV() my_safemalloc(sizeof(XPV))
1647 #define del_XPV(p) my_safefree(p)
1649 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1650 #define del_XPVIV(p) my_safefree(p)
1652 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1653 #define del_XPVNV(p) my_safefree(p)
1655 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1656 #define del_XPVCV(p) my_safefree(p)
1658 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1659 #define del_XPVAV(p) my_safefree(p)
1661 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1662 #define del_XPVHV(p) my_safefree(p)
1664 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1665 #define del_XPVMG(p) my_safefree(p)
1667 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1668 #define del_XPVGV(p) my_safefree(p)
1670 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1671 #define del_XPVLV(p) my_safefree(p)
1673 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1674 #define del_XPVBM(p) my_safefree(p)
1678 #define new_XNV() (void*)new_xnv()
1679 #define del_XNV(p) del_xnv((XPVNV*) p)
1681 #define new_XPV() (void*)new_xpv()
1682 #define del_XPV(p) del_xpv((XPV *)p)
1684 #define new_XPVIV() (void*)new_xpviv()
1685 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1687 #define new_XPVNV() (void*)new_xpvnv()
1688 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1690 #define new_XPVCV() (void*)new_xpvcv()
1691 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1693 #define new_XPVAV() (void*)new_xpvav()
1694 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1696 #define new_XPVHV() (void*)new_xpvhv()
1697 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1699 #define new_XPVMG() (void*)new_xpvmg()
1700 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1702 #define new_XPVGV() (void*)new_xpvgv()
1703 #define del_XPVGV(p) del_xpvgv((XPVGV *)p)
1705 #define new_XPVLV() (void*)new_xpvlv()
1706 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1708 #define new_XPVBM() (void*)new_xpvbm()
1709 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1713 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1714 #define del_XPVFM(p) my_safefree(p)
1716 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1717 #define del_XPVIO(p) my_safefree(p)
1720 =for apidoc sv_upgrade
1722 Upgrade an SV to a more complex form. Generally adds a new body type to the
1723 SV, then copies across as much information as possible from the old body.
1724 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1730 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1741 if (mt != SVt_PV && SvIsCOW(sv)) {
1742 sv_force_normal_flags(sv, 0);
1745 if (SvTYPE(sv) == mt)
1756 switch (SvTYPE(sv)) {
1763 else if (mt < SVt_PVIV)
1773 pv = (char*)SvRV(sv);
1782 else if (mt == SVt_NV)
1790 del_XPVIV(SvANY(sv));
1798 del_XPVNV(SvANY(sv));
1801 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1802 there's no way that it can be safely upgraded, because perl.c
1803 expects to Safefree(SvANY(PL_mess_sv)) */
1804 assert(sv != PL_mess_sv);
1805 /* This flag bit is used to mean other things in other scalar types.
1806 Given that it only has meaning inside the pad, it shouldn't be set
1807 on anything that can get upgraded. */
1808 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1814 magic = SvMAGIC(sv);
1815 stash = SvSTASH(sv);
1816 del_XPVMG(SvANY(sv));
1819 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1822 SvFLAGS(sv) &= ~SVTYPEMASK;
1827 Perl_croak(aTHX_ "Can't upgrade to undef");
1829 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.sv_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1833 SvANY(sv) = new_XNV();
1837 SvANY(sv) = &sv->sv_u.sv_rv;
1838 SvRV_set(sv, (SV*)pv);
1841 SvANY(sv) = new_XPVHV();
1842 ((XPVHV*) SvANY(sv))->xhv_aux = 0;
1845 HvTOTALKEYS(sv) = 0;
1847 /* Fall through... */
1850 SvANY(sv) = new_XPVAV();
1860 /* XXX? Only SVt_NULL is ever upgraded to AV or HV? */
1862 /* FIXME. Should be able to remove all this if()... if the above
1863 assertion is genuinely always true. */
1866 SvFLAGS(sv) &= ~SVf_OOK;
1869 SvPV_set(sv, (char*)0);
1870 SvMAGIC_set(sv, magic);
1871 SvSTASH_set(sv, stash);
1875 SvANY(sv) = new_XPVIO();
1876 Zero(SvANY(sv), 1, XPVIO);
1877 IoPAGE_LEN(sv) = 60;
1878 goto set_magic_common;
1880 SvANY(sv) = new_XPVFM();
1881 Zero(SvANY(sv), 1, XPVFM);
1882 goto set_magic_common;
1884 SvANY(sv) = new_XPVBM();
1888 goto set_magic_common;
1890 SvANY(sv) = new_XPVGV();
1896 goto set_magic_common;
1898 SvANY(sv) = new_XPVCV();
1899 Zero(SvANY(sv), 1, XPVCV);
1900 goto set_magic_common;
1902 SvANY(sv) = new_XPVLV();
1915 SvANY(sv) = new_XPVMG();
1918 SvMAGIC_set(sv, magic);
1919 SvSTASH_set(sv, stash);
1923 SvANY(sv) = new_XPVNV();
1929 SvANY(sv) = new_XPVIV();
1938 SvANY(sv) = new_XPV();
1949 =for apidoc sv_backoff
1951 Remove any string offset. You should normally use the C<SvOOK_off> macro
1958 Perl_sv_backoff(pTHX_ register SV *sv)
1962 char *s = SvPVX(sv);
1963 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1964 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1966 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1968 SvFLAGS(sv) &= ~SVf_OOK;
1975 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1976 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1977 Use the C<SvGROW> wrapper instead.
1983 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1987 #ifdef HAS_64K_LIMIT
1988 if (newlen >= 0x10000) {
1989 PerlIO_printf(Perl_debug_log,
1990 "Allocation too large: %"UVxf"\n", (UV)newlen);
1993 #endif /* HAS_64K_LIMIT */
1996 if (SvTYPE(sv) < SVt_PV) {
1997 sv_upgrade(sv, SVt_PV);
2000 else if (SvOOK(sv)) { /* pv is offset? */
2003 if (newlen > SvLEN(sv))
2004 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2005 #ifdef HAS_64K_LIMIT
2006 if (newlen >= 0x10000)
2013 if (newlen > SvLEN(sv)) { /* need more room? */
2014 if (SvLEN(sv) && s) {
2016 const STRLEN l = malloced_size((void*)SvPVX(sv));
2022 Renew(s,newlen,char);
2025 New(703, s, newlen, char);
2026 if (SvPVX(sv) && SvCUR(sv)) {
2027 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2031 SvLEN_set(sv, newlen);
2037 =for apidoc sv_setiv
2039 Copies an integer into the given SV, upgrading first if necessary.
2040 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2046 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2048 SV_CHECK_THINKFIRST_COW_DROP(sv);
2049 switch (SvTYPE(sv)) {
2051 sv_upgrade(sv, SVt_IV);
2054 sv_upgrade(sv, SVt_PVNV);
2058 sv_upgrade(sv, SVt_PVIV);
2067 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2070 (void)SvIOK_only(sv); /* validate number */
2076 =for apidoc sv_setiv_mg
2078 Like C<sv_setiv>, but also handles 'set' magic.
2084 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2091 =for apidoc sv_setuv
2093 Copies an unsigned integer into the given SV, upgrading first if necessary.
2094 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2100 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2102 /* With these two if statements:
2103 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2106 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2108 If you wish to remove them, please benchmark to see what the effect is
2110 if (u <= (UV)IV_MAX) {
2111 sv_setiv(sv, (IV)u);
2120 =for apidoc sv_setuv_mg
2122 Like C<sv_setuv>, but also handles 'set' magic.
2128 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2130 /* With these two if statements:
2131 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2134 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2136 If you wish to remove them, please benchmark to see what the effect is
2138 if (u <= (UV)IV_MAX) {
2139 sv_setiv(sv, (IV)u);
2149 =for apidoc sv_setnv
2151 Copies a double into the given SV, upgrading first if necessary.
2152 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2158 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2160 SV_CHECK_THINKFIRST_COW_DROP(sv);
2161 switch (SvTYPE(sv)) {
2164 sv_upgrade(sv, SVt_NV);
2169 sv_upgrade(sv, SVt_PVNV);
2178 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2182 (void)SvNOK_only(sv); /* validate number */
2187 =for apidoc sv_setnv_mg
2189 Like C<sv_setnv>, but also handles 'set' magic.
2195 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2201 /* Print an "isn't numeric" warning, using a cleaned-up,
2202 * printable version of the offending string
2206 S_not_a_number(pTHX_ SV *sv)
2213 dsv = sv_2mortal(newSVpv("", 0));
2214 pv = sv_uni_display(dsv, sv, 10, 0);
2217 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2218 /* each *s can expand to 4 chars + "...\0",
2219 i.e. need room for 8 chars */
2222 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2224 if (ch & 128 && !isPRINT_LC(ch)) {
2233 else if (ch == '\r') {
2237 else if (ch == '\f') {
2241 else if (ch == '\\') {
2245 else if (ch == '\0') {
2249 else if (isPRINT_LC(ch))
2266 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2267 "Argument \"%s\" isn't numeric in %s", pv,
2270 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2271 "Argument \"%s\" isn't numeric", pv);
2275 =for apidoc looks_like_number
2277 Test if the content of an SV looks like a number (or is a number).
2278 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2279 non-numeric warning), even if your atof() doesn't grok them.
2285 Perl_looks_like_number(pTHX_ SV *sv)
2287 register const char *sbegin;
2294 else if (SvPOKp(sv))
2295 sbegin = SvPV(sv, len);
2297 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2298 return grok_number(sbegin, len, NULL);
2301 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2302 until proven guilty, assume that things are not that bad... */
2307 As 64 bit platforms often have an NV that doesn't preserve all bits of
2308 an IV (an assumption perl has been based on to date) it becomes necessary
2309 to remove the assumption that the NV always carries enough precision to
2310 recreate the IV whenever needed, and that the NV is the canonical form.
2311 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2312 precision as a side effect of conversion (which would lead to insanity
2313 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2314 1) to distinguish between IV/UV/NV slots that have cached a valid
2315 conversion where precision was lost and IV/UV/NV slots that have a
2316 valid conversion which has lost no precision
2317 2) to ensure that if a numeric conversion to one form is requested that
2318 would lose precision, the precise conversion (or differently
2319 imprecise conversion) is also performed and cached, to prevent
2320 requests for different numeric formats on the same SV causing
2321 lossy conversion chains. (lossless conversion chains are perfectly
2326 SvIOKp is true if the IV slot contains a valid value
2327 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2328 SvNOKp is true if the NV slot contains a valid value
2329 SvNOK is true only if the NV value is accurate
2332 while converting from PV to NV, check to see if converting that NV to an
2333 IV(or UV) would lose accuracy over a direct conversion from PV to
2334 IV(or UV). If it would, cache both conversions, return NV, but mark
2335 SV as IOK NOKp (ie not NOK).
2337 While converting from PV to IV, check to see if converting that IV to an
2338 NV would lose accuracy over a direct conversion from PV to NV. If it
2339 would, cache both conversions, flag similarly.
2341 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2342 correctly because if IV & NV were set NV *always* overruled.
2343 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2344 changes - now IV and NV together means that the two are interchangeable:
2345 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2347 The benefit of this is that operations such as pp_add know that if
2348 SvIOK is true for both left and right operands, then integer addition
2349 can be used instead of floating point (for cases where the result won't
2350 overflow). Before, floating point was always used, which could lead to
2351 loss of precision compared with integer addition.
2353 * making IV and NV equal status should make maths accurate on 64 bit
2355 * may speed up maths somewhat if pp_add and friends start to use
2356 integers when possible instead of fp. (Hopefully the overhead in
2357 looking for SvIOK and checking for overflow will not outweigh the
2358 fp to integer speedup)
2359 * will slow down integer operations (callers of SvIV) on "inaccurate"
2360 values, as the change from SvIOK to SvIOKp will cause a call into
2361 sv_2iv each time rather than a macro access direct to the IV slot
2362 * should speed up number->string conversion on integers as IV is
2363 favoured when IV and NV are equally accurate
2365 ####################################################################
2366 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2367 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2368 On the other hand, SvUOK is true iff UV.
2369 ####################################################################
2371 Your mileage will vary depending your CPU's relative fp to integer
2375 #ifndef NV_PRESERVES_UV
2376 # define IS_NUMBER_UNDERFLOW_IV 1
2377 # define IS_NUMBER_UNDERFLOW_UV 2
2378 # define IS_NUMBER_IV_AND_UV 2
2379 # define IS_NUMBER_OVERFLOW_IV 4
2380 # define IS_NUMBER_OVERFLOW_UV 5
2382 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2384 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2386 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2388 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
2389 if (SvNVX(sv) < (NV)IV_MIN) {
2390 (void)SvIOKp_on(sv);
2392 SvIV_set(sv, IV_MIN);
2393 return IS_NUMBER_UNDERFLOW_IV;
2395 if (SvNVX(sv) > (NV)UV_MAX) {
2396 (void)SvIOKp_on(sv);
2399 SvUV_set(sv, UV_MAX);
2400 return IS_NUMBER_OVERFLOW_UV;
2402 (void)SvIOKp_on(sv);
2404 /* Can't use strtol etc to convert this string. (See truth table in
2406 if (SvNVX(sv) <= (UV)IV_MAX) {
2407 SvIV_set(sv, I_V(SvNVX(sv)));
2408 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2409 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2411 /* Integer is imprecise. NOK, IOKp */
2413 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2416 SvUV_set(sv, U_V(SvNVX(sv)));
2417 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2418 if (SvUVX(sv) == UV_MAX) {
2419 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2420 possibly be preserved by NV. Hence, it must be overflow.
2422 return IS_NUMBER_OVERFLOW_UV;
2424 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2426 /* Integer is imprecise. NOK, IOKp */
2428 return IS_NUMBER_OVERFLOW_IV;
2430 #endif /* !NV_PRESERVES_UV*/
2432 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2433 * this function provided for binary compatibility only
2437 Perl_sv_2iv(pTHX_ register SV *sv)
2439 return sv_2iv_flags(sv, SV_GMAGIC);
2443 =for apidoc sv_2iv_flags
2445 Return the integer value of an SV, doing any necessary string
2446 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2447 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2453 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2457 if (SvGMAGICAL(sv)) {
2458 if (flags & SV_GMAGIC)
2463 return I_V(SvNVX(sv));
2465 if (SvPOKp(sv) && SvLEN(sv))
2468 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2469 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2475 if (SvTHINKFIRST(sv)) {
2478 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2479 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2480 return SvIV(tmpstr);
2481 return PTR2IV(SvRV(sv));
2484 sv_force_normal_flags(sv, 0);
2486 if (SvREADONLY(sv) && !SvOK(sv)) {
2487 if (ckWARN(WARN_UNINITIALIZED))
2494 return (IV)(SvUVX(sv));
2501 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2502 * without also getting a cached IV/UV from it at the same time
2503 * (ie PV->NV conversion should detect loss of accuracy and cache
2504 * IV or UV at same time to avoid this. NWC */
2506 if (SvTYPE(sv) == SVt_NV)
2507 sv_upgrade(sv, SVt_PVNV);
2509 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2510 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2511 certainly cast into the IV range at IV_MAX, whereas the correct
2512 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2514 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2515 SvIV_set(sv, I_V(SvNVX(sv)));
2516 if (SvNVX(sv) == (NV) SvIVX(sv)
2517 #ifndef NV_PRESERVES_UV
2518 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2519 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2520 /* Don't flag it as "accurately an integer" if the number
2521 came from a (by definition imprecise) NV operation, and
2522 we're outside the range of NV integer precision */
2525 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2526 DEBUG_c(PerlIO_printf(Perl_debug_log,
2527 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2533 /* IV not precise. No need to convert from PV, as NV
2534 conversion would already have cached IV if it detected
2535 that PV->IV would be better than PV->NV->IV
2536 flags already correct - don't set public IOK. */
2537 DEBUG_c(PerlIO_printf(Perl_debug_log,
2538 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2543 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2544 but the cast (NV)IV_MIN rounds to a the value less (more
2545 negative) than IV_MIN which happens to be equal to SvNVX ??
2546 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2547 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2548 (NV)UVX == NVX are both true, but the values differ. :-(
2549 Hopefully for 2s complement IV_MIN is something like
2550 0x8000000000000000 which will be exact. NWC */
2553 SvUV_set(sv, U_V(SvNVX(sv)));
2555 (SvNVX(sv) == (NV) SvUVX(sv))
2556 #ifndef NV_PRESERVES_UV
2557 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2558 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2559 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2560 /* Don't flag it as "accurately an integer" if the number
2561 came from a (by definition imprecise) NV operation, and
2562 we're outside the range of NV integer precision */
2568 DEBUG_c(PerlIO_printf(Perl_debug_log,
2569 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2573 return (IV)SvUVX(sv);
2576 else if (SvPOKp(sv) && SvLEN(sv)) {
2578 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2579 /* We want to avoid a possible problem when we cache an IV which
2580 may be later translated to an NV, and the resulting NV is not
2581 the same as the direct translation of the initial string
2582 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2583 be careful to ensure that the value with the .456 is around if the
2584 NV value is requested in the future).
2586 This means that if we cache such an IV, we need to cache the
2587 NV as well. Moreover, we trade speed for space, and do not
2588 cache the NV if we are sure it's not needed.
2591 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2592 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2593 == IS_NUMBER_IN_UV) {
2594 /* It's definitely an integer, only upgrade to PVIV */
2595 if (SvTYPE(sv) < SVt_PVIV)
2596 sv_upgrade(sv, SVt_PVIV);
2598 } else if (SvTYPE(sv) < SVt_PVNV)
2599 sv_upgrade(sv, SVt_PVNV);
2601 /* If NV preserves UV then we only use the UV value if we know that
2602 we aren't going to call atof() below. If NVs don't preserve UVs
2603 then the value returned may have more precision than atof() will
2604 return, even though value isn't perfectly accurate. */
2605 if ((numtype & (IS_NUMBER_IN_UV
2606 #ifdef NV_PRESERVES_UV
2609 )) == IS_NUMBER_IN_UV) {
2610 /* This won't turn off the public IOK flag if it was set above */
2611 (void)SvIOKp_on(sv);
2613 if (!(numtype & IS_NUMBER_NEG)) {
2615 if (value <= (UV)IV_MAX) {
2616 SvIV_set(sv, (IV)value);
2618 SvUV_set(sv, value);
2622 /* 2s complement assumption */
2623 if (value <= (UV)IV_MIN) {
2624 SvIV_set(sv, -(IV)value);
2626 /* Too negative for an IV. This is a double upgrade, but
2627 I'm assuming it will be rare. */
2628 if (SvTYPE(sv) < SVt_PVNV)
2629 sv_upgrade(sv, SVt_PVNV);
2633 SvNV_set(sv, -(NV)value);
2634 SvIV_set(sv, IV_MIN);
2638 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2639 will be in the previous block to set the IV slot, and the next
2640 block to set the NV slot. So no else here. */
2642 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2643 != IS_NUMBER_IN_UV) {
2644 /* It wasn't an (integer that doesn't overflow the UV). */
2645 SvNV_set(sv, Atof(SvPVX(sv)));
2647 if (! numtype && ckWARN(WARN_NUMERIC))
2650 #if defined(USE_LONG_DOUBLE)
2651 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2652 PTR2UV(sv), SvNVX(sv)));
2654 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2655 PTR2UV(sv), SvNVX(sv)));
2659 #ifdef NV_PRESERVES_UV
2660 (void)SvIOKp_on(sv);
2662 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2663 SvIV_set(sv, I_V(SvNVX(sv)));
2664 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2667 /* Integer is imprecise. NOK, IOKp */
2669 /* UV will not work better than IV */
2671 if (SvNVX(sv) > (NV)UV_MAX) {
2673 /* Integer is inaccurate. NOK, IOKp, is UV */
2674 SvUV_set(sv, UV_MAX);
2677 SvUV_set(sv, U_V(SvNVX(sv)));
2678 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2679 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2683 /* Integer is imprecise. NOK, IOKp, is UV */
2689 #else /* NV_PRESERVES_UV */
2690 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2691 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2692 /* The IV slot will have been set from value returned by
2693 grok_number above. The NV slot has just been set using
2696 assert (SvIOKp(sv));
2698 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2699 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2700 /* Small enough to preserve all bits. */
2701 (void)SvIOKp_on(sv);
2703 SvIV_set(sv, I_V(SvNVX(sv)));
2704 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2706 /* Assumption: first non-preserved integer is < IV_MAX,
2707 this NV is in the preserved range, therefore: */
2708 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2710 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);
2714 0 0 already failed to read UV.
2715 0 1 already failed to read UV.
2716 1 0 you won't get here in this case. IV/UV
2717 slot set, public IOK, Atof() unneeded.
2718 1 1 already read UV.
2719 so there's no point in sv_2iuv_non_preserve() attempting
2720 to use atol, strtol, strtoul etc. */
2721 if (sv_2iuv_non_preserve (sv, numtype)
2722 >= IS_NUMBER_OVERFLOW_IV)
2726 #endif /* NV_PRESERVES_UV */
2729 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2731 if (SvTYPE(sv) < SVt_IV)
2732 /* Typically the caller expects that sv_any is not NULL now. */
2733 sv_upgrade(sv, SVt_IV);
2736 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2737 PTR2UV(sv),SvIVX(sv)));
2738 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2741 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2742 * this function provided for binary compatibility only
2746 Perl_sv_2uv(pTHX_ register SV *sv)
2748 return sv_2uv_flags(sv, SV_GMAGIC);
2752 =for apidoc sv_2uv_flags
2754 Return the unsigned integer value of an SV, doing any necessary string
2755 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2756 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2762 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2766 if (SvGMAGICAL(sv)) {
2767 if (flags & SV_GMAGIC)
2772 return U_V(SvNVX(sv));
2773 if (SvPOKp(sv) && SvLEN(sv))
2776 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2777 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2783 if (SvTHINKFIRST(sv)) {
2786 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2787 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2788 return SvUV(tmpstr);
2789 return PTR2UV(SvRV(sv));
2792 sv_force_normal_flags(sv, 0);
2794 if (SvREADONLY(sv) && !SvOK(sv)) {
2795 if (ckWARN(WARN_UNINITIALIZED))
2805 return (UV)SvIVX(sv);
2809 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2810 * without also getting a cached IV/UV from it at the same time
2811 * (ie PV->NV conversion should detect loss of accuracy and cache
2812 * IV or UV at same time to avoid this. */
2813 /* IV-over-UV optimisation - choose to cache IV if possible */
2815 if (SvTYPE(sv) == SVt_NV)
2816 sv_upgrade(sv, SVt_PVNV);
2818 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2819 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2820 SvIV_set(sv, I_V(SvNVX(sv)));
2821 if (SvNVX(sv) == (NV) SvIVX(sv)
2822 #ifndef NV_PRESERVES_UV
2823 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2824 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2825 /* Don't flag it as "accurately an integer" if the number
2826 came from a (by definition imprecise) NV operation, and
2827 we're outside the range of NV integer precision */
2830 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2831 DEBUG_c(PerlIO_printf(Perl_debug_log,
2832 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2838 /* IV not precise. No need to convert from PV, as NV
2839 conversion would already have cached IV if it detected
2840 that PV->IV would be better than PV->NV->IV
2841 flags already correct - don't set public IOK. */
2842 DEBUG_c(PerlIO_printf(Perl_debug_log,
2843 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2848 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2849 but the cast (NV)IV_MIN rounds to a the value less (more
2850 negative) than IV_MIN which happens to be equal to SvNVX ??
2851 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2852 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2853 (NV)UVX == NVX are both true, but the values differ. :-(
2854 Hopefully for 2s complement IV_MIN is something like
2855 0x8000000000000000 which will be exact. NWC */
2858 SvUV_set(sv, U_V(SvNVX(sv)));
2860 (SvNVX(sv) == (NV) SvUVX(sv))
2861 #ifndef NV_PRESERVES_UV
2862 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2863 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2864 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2865 /* Don't flag it as "accurately an integer" if the number
2866 came from a (by definition imprecise) NV operation, and
2867 we're outside the range of NV integer precision */
2872 DEBUG_c(PerlIO_printf(Perl_debug_log,
2873 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2879 else if (SvPOKp(sv) && SvLEN(sv)) {
2881 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2883 /* We want to avoid a possible problem when we cache a UV which
2884 may be later translated to an NV, and the resulting NV is not
2885 the translation of the initial data.
2887 This means that if we cache such a UV, we need to cache the
2888 NV as well. Moreover, we trade speed for space, and do not
2889 cache the NV if not needed.
2892 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2893 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2894 == IS_NUMBER_IN_UV) {
2895 /* It's definitely an integer, only upgrade to PVIV */
2896 if (SvTYPE(sv) < SVt_PVIV)
2897 sv_upgrade(sv, SVt_PVIV);
2899 } else if (SvTYPE(sv) < SVt_PVNV)
2900 sv_upgrade(sv, SVt_PVNV);
2902 /* If NV preserves UV then we only use the UV value if we know that
2903 we aren't going to call atof() below. If NVs don't preserve UVs
2904 then the value returned may have more precision than atof() will
2905 return, even though it isn't accurate. */
2906 if ((numtype & (IS_NUMBER_IN_UV
2907 #ifdef NV_PRESERVES_UV
2910 )) == IS_NUMBER_IN_UV) {
2911 /* This won't turn off the public IOK flag if it was set above */
2912 (void)SvIOKp_on(sv);
2914 if (!(numtype & IS_NUMBER_NEG)) {
2916 if (value <= (UV)IV_MAX) {
2917 SvIV_set(sv, (IV)value);
2919 /* it didn't overflow, and it was positive. */
2920 SvUV_set(sv, value);
2924 /* 2s complement assumption */
2925 if (value <= (UV)IV_MIN) {
2926 SvIV_set(sv, -(IV)value);
2928 /* Too negative for an IV. This is a double upgrade, but
2929 I'm assuming it will be rare. */
2930 if (SvTYPE(sv) < SVt_PVNV)
2931 sv_upgrade(sv, SVt_PVNV);
2935 SvNV_set(sv, -(NV)value);
2936 SvIV_set(sv, IV_MIN);
2941 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2942 != IS_NUMBER_IN_UV) {
2943 /* It wasn't an integer, or it overflowed the UV. */
2944 SvNV_set(sv, Atof(SvPVX(sv)));
2946 if (! numtype && ckWARN(WARN_NUMERIC))
2949 #if defined(USE_LONG_DOUBLE)
2950 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2951 PTR2UV(sv), SvNVX(sv)));
2953 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2954 PTR2UV(sv), SvNVX(sv)));
2957 #ifdef NV_PRESERVES_UV
2958 (void)SvIOKp_on(sv);
2960 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2961 SvIV_set(sv, I_V(SvNVX(sv)));
2962 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2965 /* Integer is imprecise. NOK, IOKp */
2967 /* UV will not work better than IV */
2969 if (SvNVX(sv) > (NV)UV_MAX) {
2971 /* Integer is inaccurate. NOK, IOKp, is UV */
2972 SvUV_set(sv, UV_MAX);
2975 SvUV_set(sv, U_V(SvNVX(sv)));
2976 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2977 NV preservse UV so can do correct comparison. */
2978 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2982 /* Integer is imprecise. NOK, IOKp, is UV */
2987 #else /* NV_PRESERVES_UV */
2988 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2989 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2990 /* The UV slot will have been set from value returned by
2991 grok_number above. The NV slot has just been set using
2994 assert (SvIOKp(sv));
2996 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2997 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2998 /* Small enough to preserve all bits. */
2999 (void)SvIOKp_on(sv);
3001 SvIV_set(sv, I_V(SvNVX(sv)));
3002 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3004 /* Assumption: first non-preserved integer is < IV_MAX,
3005 this NV is in the preserved range, therefore: */
3006 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3008 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);
3011 sv_2iuv_non_preserve (sv, numtype);
3013 #endif /* NV_PRESERVES_UV */
3017 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3018 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3021 if (SvTYPE(sv) < SVt_IV)
3022 /* Typically the caller expects that sv_any is not NULL now. */
3023 sv_upgrade(sv, SVt_IV);
3027 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3028 PTR2UV(sv),SvUVX(sv)));
3029 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3035 Return the num value of an SV, doing any necessary string or integer
3036 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3043 Perl_sv_2nv(pTHX_ register SV *sv)
3047 if (SvGMAGICAL(sv)) {
3051 if (SvPOKp(sv) && SvLEN(sv)) {
3052 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3053 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
3055 return Atof(SvPVX(sv));
3059 return (NV)SvUVX(sv);
3061 return (NV)SvIVX(sv);
3064 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3065 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3071 if (SvTHINKFIRST(sv)) {
3074 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3075 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3076 return SvNV(tmpstr);
3077 return PTR2NV(SvRV(sv));
3080 sv_force_normal_flags(sv, 0);
3082 if (SvREADONLY(sv) && !SvOK(sv)) {
3083 if (ckWARN(WARN_UNINITIALIZED))
3088 if (SvTYPE(sv) < SVt_NV) {
3089 if (SvTYPE(sv) == SVt_IV)
3090 sv_upgrade(sv, SVt_PVNV);
3092 sv_upgrade(sv, SVt_NV);
3093 #ifdef USE_LONG_DOUBLE
3095 STORE_NUMERIC_LOCAL_SET_STANDARD();
3096 PerlIO_printf(Perl_debug_log,
3097 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3098 PTR2UV(sv), SvNVX(sv));
3099 RESTORE_NUMERIC_LOCAL();
3103 STORE_NUMERIC_LOCAL_SET_STANDARD();
3104 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3105 PTR2UV(sv), SvNVX(sv));
3106 RESTORE_NUMERIC_LOCAL();
3110 else if (SvTYPE(sv) < SVt_PVNV)
3111 sv_upgrade(sv, SVt_PVNV);
3116 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3117 #ifdef NV_PRESERVES_UV
3120 /* Only set the public NV OK flag if this NV preserves the IV */
3121 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3122 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3123 : (SvIVX(sv) == I_V(SvNVX(sv))))
3129 else if (SvPOKp(sv) && SvLEN(sv)) {
3131 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3132 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3134 #ifdef NV_PRESERVES_UV
3135 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3136 == IS_NUMBER_IN_UV) {
3137 /* It's definitely an integer */
3138 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3140 SvNV_set(sv, Atof(SvPVX(sv)));
3143 SvNV_set(sv, Atof(SvPVX(sv)));
3144 /* Only set the public NV OK flag if this NV preserves the value in
3145 the PV at least as well as an IV/UV would.
3146 Not sure how to do this 100% reliably. */
3147 /* if that shift count is out of range then Configure's test is
3148 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3150 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3151 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3152 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3153 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3154 /* Can't use strtol etc to convert this string, so don't try.
3155 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3158 /* value has been set. It may not be precise. */
3159 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3160 /* 2s complement assumption for (UV)IV_MIN */
3161 SvNOK_on(sv); /* Integer is too negative. */
3166 if (numtype & IS_NUMBER_NEG) {
3167 SvIV_set(sv, -(IV)value);
3168 } else if (value <= (UV)IV_MAX) {
3169 SvIV_set(sv, (IV)value);
3171 SvUV_set(sv, value);
3175 if (numtype & IS_NUMBER_NOT_INT) {
3176 /* I believe that even if the original PV had decimals,
3177 they are lost beyond the limit of the FP precision.
3178 However, neither is canonical, so both only get p
3179 flags. NWC, 2000/11/25 */
3180 /* Both already have p flags, so do nothing */
3183 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3184 if (SvIVX(sv) == I_V(nv)) {
3189 /* It had no "." so it must be integer. */
3192 /* between IV_MAX and NV(UV_MAX).
3193 Could be slightly > UV_MAX */
3195 if (numtype & IS_NUMBER_NOT_INT) {
3196 /* UV and NV both imprecise. */
3198 UV nv_as_uv = U_V(nv);
3200 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3211 #endif /* NV_PRESERVES_UV */
3214 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3216 if (SvTYPE(sv) < SVt_NV)
3217 /* Typically the caller expects that sv_any is not NULL now. */
3218 /* XXX Ilya implies that this is a bug in callers that assume this
3219 and ideally should be fixed. */
3220 sv_upgrade(sv, SVt_NV);
3223 #if defined(USE_LONG_DOUBLE)
3225 STORE_NUMERIC_LOCAL_SET_STANDARD();
3226 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3227 PTR2UV(sv), SvNVX(sv));
3228 RESTORE_NUMERIC_LOCAL();
3232 STORE_NUMERIC_LOCAL_SET_STANDARD();
3233 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3234 PTR2UV(sv), SvNVX(sv));
3235 RESTORE_NUMERIC_LOCAL();
3241 /* asIV(): extract an integer from the string value of an SV.
3242 * Caller must validate PVX */
3245 S_asIV(pTHX_ SV *sv)
3248 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3250 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3251 == IS_NUMBER_IN_UV) {
3252 /* It's definitely an integer */
3253 if (numtype & IS_NUMBER_NEG) {
3254 if (value < (UV)IV_MIN)
3257 if (value < (UV)IV_MAX)
3262 if (ckWARN(WARN_NUMERIC))
3265 return I_V(Atof(SvPVX(sv)));
3268 /* asUV(): extract an unsigned integer from the string value of an SV
3269 * Caller must validate PVX */
3272 S_asUV(pTHX_ SV *sv)
3275 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3277 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3278 == IS_NUMBER_IN_UV) {
3279 /* It's definitely an integer */
3280 if (!(numtype & IS_NUMBER_NEG))
3284 if (ckWARN(WARN_NUMERIC))
3287 return U_V(Atof(SvPVX(sv)));
3291 =for apidoc sv_2pv_nolen
3293 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3294 use the macro wrapper C<SvPV_nolen(sv)> instead.
3299 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3302 return sv_2pv(sv, &n_a);
3305 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3306 * UV as a string towards the end of buf, and return pointers to start and
3309 * We assume that buf is at least TYPE_CHARS(UV) long.
3313 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3315 char *ptr = buf + TYPE_CHARS(UV);
3329 *--ptr = '0' + (char)(uv % 10);
3337 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3338 * this function provided for binary compatibility only
3342 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3344 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3348 =for apidoc sv_2pv_flags
3350 Returns a pointer to the string value of an SV, and sets *lp to its length.
3351 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3353 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3354 usually end up here too.
3360 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3365 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3366 char *tmpbuf = tbuf;
3372 if (SvGMAGICAL(sv)) {
3373 if (flags & SV_GMAGIC)
3381 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3383 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3388 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3393 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3394 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3401 if (SvTHINKFIRST(sv)) {
3404 register const char *typestr;
3405 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3406 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3407 char *pv = SvPV(tmpstr, *lp);
3417 typestr = "NULLREF";
3421 switch (SvTYPE(sv)) {
3423 if ( ((SvFLAGS(sv) &
3424 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3425 == (SVs_OBJECT|SVs_SMG))
3426 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3427 const regexp *re = (regexp *)mg->mg_obj;
3430 const char *fptr = "msix";
3435 char need_newline = 0;
3436 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3438 while((ch = *fptr++)) {
3440 reflags[left++] = ch;
3443 reflags[right--] = ch;
3448 reflags[left] = '-';
3452 mg->mg_len = re->prelen + 4 + left;
3454 * If /x was used, we have to worry about a regex
3455 * ending with a comment later being embedded
3456 * within another regex. If so, we don't want this
3457 * regex's "commentization" to leak out to the
3458 * right part of the enclosing regex, we must cap
3459 * it with a newline.
3461 * So, if /x was used, we scan backwards from the
3462 * end of the regex. If we find a '#' before we
3463 * find a newline, we need to add a newline
3464 * ourself. If we find a '\n' first (or if we
3465 * don't find '#' or '\n'), we don't need to add
3466 * anything. -jfriedl
3468 if (PMf_EXTENDED & re->reganch)
3470 const char *endptr = re->precomp + re->prelen;
3471 while (endptr >= re->precomp)
3473 const char c = *(endptr--);
3475 break; /* don't need another */
3477 /* we end while in a comment, so we
3479 mg->mg_len++; /* save space for it */
3480 need_newline = 1; /* note to add it */
3486 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3487 Copy("(?", mg->mg_ptr, 2, char);
3488 Copy(reflags, mg->mg_ptr+2, left, char);
3489 Copy(":", mg->mg_ptr+left+2, 1, char);
3490 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3492 mg->mg_ptr[mg->mg_len - 2] = '\n';
3493 mg->mg_ptr[mg->mg_len - 1] = ')';
3494 mg->mg_ptr[mg->mg_len] = 0;
3496 PL_reginterp_cnt += re->program[0].next_off;
3498 if (re->reganch & ROPT_UTF8)
3513 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3514 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3515 /* tied lvalues should appear to be
3516 * scalars for backwards compatitbility */
3517 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3518 ? "SCALAR" : "LVALUE"; break;
3519 case SVt_PVAV: typestr = "ARRAY"; break;
3520 case SVt_PVHV: typestr = "HASH"; break;
3521 case SVt_PVCV: typestr = "CODE"; break;
3522 case SVt_PVGV: typestr = "GLOB"; break;
3523 case SVt_PVFM: typestr = "FORMAT"; break;
3524 case SVt_PVIO: typestr = "IO"; break;
3525 default: typestr = "UNKNOWN"; break;
3529 const char *name = HvNAME_get(SvSTASH(sv));
3530 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3531 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3534 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3537 *lp = strlen(typestr);
3538 return (char *)typestr;
3540 if (SvREADONLY(sv) && !SvOK(sv)) {
3541 if (ckWARN(WARN_UNINITIALIZED))
3547 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3548 /* I'm assuming that if both IV and NV are equally valid then
3549 converting the IV is going to be more efficient */
3550 const U32 isIOK = SvIOK(sv);
3551 const U32 isUIOK = SvIsUV(sv);
3552 char buf[TYPE_CHARS(UV)];
3555 if (SvTYPE(sv) < SVt_PVIV)
3556 sv_upgrade(sv, SVt_PVIV);
3558 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3560 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3561 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3562 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3563 SvCUR_set(sv, ebuf - ptr);
3573 else if (SvNOKp(sv)) {
3574 if (SvTYPE(sv) < SVt_PVNV)
3575 sv_upgrade(sv, SVt_PVNV);
3576 /* The +20 is pure guesswork. Configure test needed. --jhi */
3577 SvGROW(sv, NV_DIG + 20);
3579 olderrno = errno; /* some Xenix systems wipe out errno here */
3581 if (SvNVX(sv) == 0.0)
3582 (void)strcpy(s,"0");
3586 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3589 #ifdef FIXNEGATIVEZERO
3590 if (*s == '-' && s[1] == '0' && !s[2])
3600 if (ckWARN(WARN_UNINITIALIZED)
3601 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3604 if (SvTYPE(sv) < SVt_PV)
3605 /* Typically the caller expects that sv_any is not NULL now. */
3606 sv_upgrade(sv, SVt_PV);
3609 *lp = s - SvPVX(sv);
3612 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3613 PTR2UV(sv),SvPVX(sv)));
3617 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3618 /* Sneaky stuff here */
3622 tsv = newSVpv(tmpbuf, 0);
3639 len = strlen(tmpbuf);
3641 #ifdef FIXNEGATIVEZERO
3642 if (len == 2 && t[0] == '-' && t[1] == '0') {
3647 (void)SvUPGRADE(sv, SVt_PV);
3649 s = SvGROW(sv, len + 1);
3652 return strcpy(s, t);
3657 =for apidoc sv_copypv
3659 Copies a stringified representation of the source SV into the
3660 destination SV. Automatically performs any necessary mg_get and
3661 coercion of numeric values into strings. Guaranteed to preserve
3662 UTF-8 flag even from overloaded objects. Similar in nature to
3663 sv_2pv[_flags] but operates directly on an SV instead of just the
3664 string. Mostly uses sv_2pv_flags to do its work, except when that
3665 would lose the UTF-8'ness of the PV.
3671 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3676 sv_setpvn(dsv,s,len);
3684 =for apidoc sv_2pvbyte_nolen
3686 Return a pointer to the byte-encoded representation of the SV.
3687 May cause the SV to be downgraded from UTF-8 as a side-effect.
3689 Usually accessed via the C<SvPVbyte_nolen> macro.
3695 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3698 return sv_2pvbyte(sv, &n_a);
3702 =for apidoc sv_2pvbyte
3704 Return a pointer to the byte-encoded representation of the SV, and set *lp
3705 to its length. May cause the SV to be downgraded from UTF-8 as a
3708 Usually accessed via the C<SvPVbyte> macro.
3714 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3716 sv_utf8_downgrade(sv,0);
3717 return SvPV(sv,*lp);
3721 =for apidoc sv_2pvutf8_nolen
3723 Return a pointer to the UTF-8-encoded representation of the SV.
3724 May cause the SV to be upgraded to UTF-8 as a side-effect.
3726 Usually accessed via the C<SvPVutf8_nolen> macro.
3732 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3735 return sv_2pvutf8(sv, &n_a);
3739 =for apidoc sv_2pvutf8
3741 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3742 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3744 Usually accessed via the C<SvPVutf8> macro.
3750 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3752 sv_utf8_upgrade(sv);
3753 return SvPV(sv,*lp);
3757 =for apidoc sv_2bool
3759 This function is only called on magical items, and is only used by
3760 sv_true() or its macro equivalent.
3766 Perl_sv_2bool(pTHX_ register SV *sv)
3775 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3776 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3777 return (bool)SvTRUE(tmpsv);
3778 return SvRV(sv) != 0;
3781 register XPV* Xpvtmp;
3782 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3783 (*sv->sv_u.sv_pv > '0' ||
3784 Xpvtmp->xpv_cur > 1 ||
3785 (Xpvtmp->xpv_cur && *sv->sv_u.sv_pv != '0')))
3792 return SvIVX(sv) != 0;
3795 return SvNVX(sv) != 0.0;
3802 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3803 * this function provided for binary compatibility only
3808 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3810 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3814 =for apidoc sv_utf8_upgrade
3816 Converts the PV of an SV to its UTF-8-encoded form.
3817 Forces the SV to string form if it is not already.
3818 Always sets the SvUTF8 flag to avoid future validity checks even
3819 if all the bytes have hibit clear.
3821 This is not as a general purpose byte encoding to Unicode interface:
3822 use the Encode extension for that.
3824 =for apidoc sv_utf8_upgrade_flags
3826 Converts the PV of an SV to its UTF-8-encoded form.
3827 Forces the SV to string form if it is not already.
3828 Always sets the SvUTF8 flag to avoid future validity checks even
3829 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3830 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3831 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3833 This is not as a general purpose byte encoding to Unicode interface:
3834 use the Encode extension for that.
3840 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3842 if (sv == &PL_sv_undef)
3846 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3847 (void) sv_2pv_flags(sv,&len, flags);
3851 (void) SvPV_force(sv,len);
3860 sv_force_normal_flags(sv, 0);
3863 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3864 sv_recode_to_utf8(sv, PL_encoding);
3865 else { /* Assume Latin-1/EBCDIC */
3866 /* This function could be much more efficient if we
3867 * had a FLAG in SVs to signal if there are any hibit
3868 * chars in the PV. Given that there isn't such a flag
3869 * make the loop as fast as possible. */
3870 U8 *s = (U8 *) SvPVX(sv);
3871 U8 *e = (U8 *) SvEND(sv);
3877 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3881 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3882 s = bytes_to_utf8((U8*)s, &len);
3884 SvPV_free(sv); /* No longer using what was there before. */
3886 SvPV_set(sv, (char*)s);
3887 SvCUR_set(sv, len - 1);
3888 SvLEN_set(sv, len); /* No longer know the real size. */
3890 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3897 =for apidoc sv_utf8_downgrade
3899 Attempts to convert the PV of an SV from characters to bytes.
3900 If the PV contains a character beyond byte, this conversion will fail;
3901 in this case, either returns false or, if C<fail_ok> is not
3904 This is not as a general purpose Unicode to byte encoding interface:
3905 use the Encode extension for that.
3911 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3913 if (SvPOKp(sv) && SvUTF8(sv)) {
3919 sv_force_normal_flags(sv, 0);
3921 s = (U8 *) SvPV(sv, len);
3922 if (!utf8_to_bytes(s, &len)) {
3927 Perl_croak(aTHX_ "Wide character in %s",
3930 Perl_croak(aTHX_ "Wide character");
3941 =for apidoc sv_utf8_encode
3943 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3944 flag off so that it looks like octets again.
3950 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3952 (void) sv_utf8_upgrade(sv);
3954 sv_force_normal_flags(sv, 0);
3956 if (SvREADONLY(sv)) {
3957 Perl_croak(aTHX_ PL_no_modify);
3963 =for apidoc sv_utf8_decode
3965 If the PV of the SV is an octet sequence in UTF-8
3966 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3967 so that it looks like a character. If the PV contains only single-byte
3968 characters, the C<SvUTF8> flag stays being off.
3969 Scans PV for validity and returns false if the PV is invalid UTF-8.
3975 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3981 /* The octets may have got themselves encoded - get them back as
3984 if (!sv_utf8_downgrade(sv, TRUE))
3987 /* it is actually just a matter of turning the utf8 flag on, but
3988 * we want to make sure everything inside is valid utf8 first.
3990 c = (U8 *) SvPVX(sv);
3991 if (!is_utf8_string(c, SvCUR(sv)+1))
3993 e = (U8 *) SvEND(sv);
3996 if (!UTF8_IS_INVARIANT(ch)) {
4005 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4006 * this function provided for binary compatibility only
4010 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4012 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4016 =for apidoc sv_setsv
4018 Copies the contents of the source SV C<ssv> into the destination SV
4019 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4020 function if the source SV needs to be reused. Does not handle 'set' magic.
4021 Loosely speaking, it performs a copy-by-value, obliterating any previous
4022 content of the destination.
4024 You probably want to use one of the assortment of wrappers, such as
4025 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4026 C<SvSetMagicSV_nosteal>.
4028 =for apidoc sv_setsv_flags
4030 Copies the contents of the source SV C<ssv> into the destination SV
4031 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4032 function if the source SV needs to be reused. Does not handle 'set' magic.
4033 Loosely speaking, it performs a copy-by-value, obliterating any previous
4034 content of the destination.
4035 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4036 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4037 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4038 and C<sv_setsv_nomg> are implemented in terms of this function.
4040 You probably want to use one of the assortment of wrappers, such as
4041 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4042 C<SvSetMagicSV_nosteal>.
4044 This is the primary function for copying scalars, and most other
4045 copy-ish functions and macros use this underneath.
4051 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4053 register U32 sflags;
4059 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4061 sstr = &PL_sv_undef;
4062 stype = SvTYPE(sstr);
4063 dtype = SvTYPE(dstr);
4068 /* need to nuke the magic */
4070 SvRMAGICAL_off(dstr);
4073 /* There's a lot of redundancy below but we're going for speed here */
4078 if (dtype != SVt_PVGV) {
4079 (void)SvOK_off(dstr);
4087 sv_upgrade(dstr, SVt_IV);
4090 sv_upgrade(dstr, SVt_PVNV);
4094 sv_upgrade(dstr, SVt_PVIV);
4097 (void)SvIOK_only(dstr);
4098 SvIV_set(dstr, SvIVX(sstr));
4101 if (SvTAINTED(sstr))
4112 sv_upgrade(dstr, SVt_NV);
4117 sv_upgrade(dstr, SVt_PVNV);
4120 SvNV_set(dstr, SvNVX(sstr));
4121 (void)SvNOK_only(dstr);
4122 if (SvTAINTED(sstr))
4130 sv_upgrade(dstr, SVt_RV);
4131 else if (dtype == SVt_PVGV &&
4132 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4135 if (GvIMPORTED(dstr) != GVf_IMPORTED
4136 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4138 GvIMPORTED_on(dstr);
4147 #ifdef PERL_COPY_ON_WRITE
4148 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4149 if (dtype < SVt_PVIV)
4150 sv_upgrade(dstr, SVt_PVIV);
4157 sv_upgrade(dstr, SVt_PV);
4160 if (dtype < SVt_PVIV)
4161 sv_upgrade(dstr, SVt_PVIV);
4164 if (dtype < SVt_PVNV)
4165 sv_upgrade(dstr, SVt_PVNV);
4172 const char * const type = sv_reftype(sstr,0);
4174 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
4176 Perl_croak(aTHX_ "Bizarre copy of %s", type);
4181 if (dtype <= SVt_PVGV) {
4183 if (dtype != SVt_PVGV) {
4184 const char * const name = GvNAME(sstr);
4185 const STRLEN len = GvNAMELEN(sstr);
4186 /* don't upgrade SVt_PVLV: it can hold a glob */
4187 if (dtype != SVt_PVLV)
4188 sv_upgrade(dstr, SVt_PVGV);
4189 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4190 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4191 GvNAME(dstr) = savepvn(name, len);
4192 GvNAMELEN(dstr) = len;
4193 SvFAKE_on(dstr); /* can coerce to non-glob */
4195 /* ahem, death to those who redefine active sort subs */
4196 else if (PL_curstackinfo->si_type == PERLSI_SORT
4197 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4198 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4201 #ifdef GV_UNIQUE_CHECK
4202 if (GvUNIQUE((GV*)dstr)) {
4203 Perl_croak(aTHX_ PL_no_modify);
4207 (void)SvOK_off(dstr);
4208 GvINTRO_off(dstr); /* one-shot flag */
4210 GvGP(dstr) = gp_ref(GvGP(sstr));
4211 if (SvTAINTED(sstr))
4213 if (GvIMPORTED(dstr) != GVf_IMPORTED
4214 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4216 GvIMPORTED_on(dstr);
4224 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4226 if ((int)SvTYPE(sstr) != stype) {
4227 stype = SvTYPE(sstr);
4228 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4232 if (stype == SVt_PVLV)
4233 (void)SvUPGRADE(dstr, SVt_PVNV);
4235 (void)SvUPGRADE(dstr, (U32)stype);
4238 sflags = SvFLAGS(sstr);
4240 if (sflags & SVf_ROK) {
4241 if (dtype >= SVt_PV) {
4242 if (dtype == SVt_PVGV) {
4243 SV *sref = SvREFCNT_inc(SvRV(sstr));
4245 const int intro = GvINTRO(dstr);
4247 #ifdef GV_UNIQUE_CHECK
4248 if (GvUNIQUE((GV*)dstr)) {
4249 Perl_croak(aTHX_ PL_no_modify);
4254 GvINTRO_off(dstr); /* one-shot flag */
4255 GvLINE(dstr) = CopLINE(PL_curcop);
4256 GvEGV(dstr) = (GV*)dstr;
4259 switch (SvTYPE(sref)) {
4262 SAVEGENERICSV(GvAV(dstr));
4264 dref = (SV*)GvAV(dstr);
4265 GvAV(dstr) = (AV*)sref;
4266 if (!GvIMPORTED_AV(dstr)
4267 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4269 GvIMPORTED_AV_on(dstr);
4274 SAVEGENERICSV(GvHV(dstr));
4276 dref = (SV*)GvHV(dstr);
4277 GvHV(dstr) = (HV*)sref;
4278 if (!GvIMPORTED_HV(dstr)
4279 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4281 GvIMPORTED_HV_on(dstr);
4286 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4287 SvREFCNT_dec(GvCV(dstr));
4288 GvCV(dstr) = Nullcv;
4289 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4290 PL_sub_generation++;
4292 SAVEGENERICSV(GvCV(dstr));
4295 dref = (SV*)GvCV(dstr);
4296 if (GvCV(dstr) != (CV*)sref) {
4297 CV* cv = GvCV(dstr);
4299 if (!GvCVGEN((GV*)dstr) &&
4300 (CvROOT(cv) || CvXSUB(cv)))
4302 /* ahem, death to those who redefine
4303 * active sort subs */
4304 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4305 PL_sortcop == CvSTART(cv))
4307 "Can't redefine active sort subroutine %s",
4308 GvENAME((GV*)dstr));
4309 /* Redefining a sub - warning is mandatory if
4310 it was a const and its value changed. */
4311 if (ckWARN(WARN_REDEFINE)
4313 && (!CvCONST((CV*)sref)
4314 || sv_cmp(cv_const_sv(cv),
4315 cv_const_sv((CV*)sref)))))
4317 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4319 ? "Constant subroutine %s::%s redefined"
4320 : "Subroutine %s::%s redefined",
4321 HvNAME_get(GvSTASH((GV*)dstr)),
4322 GvENAME((GV*)dstr));
4326 cv_ckproto(cv, (GV*)dstr,
4327 SvPOK(sref) ? SvPVX(sref) : Nullch);
4329 GvCV(dstr) = (CV*)sref;
4330 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4331 GvASSUMECV_on(dstr);
4332 PL_sub_generation++;
4334 if (!GvIMPORTED_CV(dstr)
4335 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4337 GvIMPORTED_CV_on(dstr);
4342 SAVEGENERICSV(GvIOp(dstr));
4344 dref = (SV*)GvIOp(dstr);
4345 GvIOp(dstr) = (IO*)sref;
4349 SAVEGENERICSV(GvFORM(dstr));
4351 dref = (SV*)GvFORM(dstr);
4352 GvFORM(dstr) = (CV*)sref;
4356 SAVEGENERICSV(GvSV(dstr));
4358 dref = (SV*)GvSV(dstr);
4360 if (!GvIMPORTED_SV(dstr)
4361 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4363 GvIMPORTED_SV_on(dstr);
4369 if (SvTAINTED(sstr))
4379 (void)SvOK_off(dstr);
4380 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4382 if (sflags & SVp_NOK) {
4384 /* Only set the public OK flag if the source has public OK. */
4385 if (sflags & SVf_NOK)
4386 SvFLAGS(dstr) |= SVf_NOK;
4387 SvNV_set(dstr, SvNVX(sstr));
4389 if (sflags & SVp_IOK) {
4390 (void)SvIOKp_on(dstr);
4391 if (sflags & SVf_IOK)
4392 SvFLAGS(dstr) |= SVf_IOK;
4393 if (sflags & SVf_IVisUV)
4395 SvIV_set(dstr, SvIVX(sstr));
4397 if (SvAMAGIC(sstr)) {
4401 else if (sflags & SVp_POK) {
4405 * Check to see if we can just swipe the string. If so, it's a
4406 * possible small lose on short strings, but a big win on long ones.
4407 * It might even be a win on short strings if SvPVX(dstr)
4408 * has to be allocated and SvPVX(sstr) has to be freed.
4411 /* Whichever path we take through the next code, we want this true,
4412 and doing it now facilitates the COW check. */
4413 (void)SvPOK_only(dstr);
4416 #ifdef PERL_COPY_ON_WRITE
4417 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4421 (sflags & SVs_TEMP) && /* slated for free anyway? */
4422 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4423 (!(flags & SV_NOSTEAL)) &&
4424 /* and we're allowed to steal temps */
4425 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4426 SvLEN(sstr) && /* and really is a string */
4427 /* and won't be needed again, potentially */
4428 !(PL_op && PL_op->op_type == OP_AASSIGN))
4429 #ifdef PERL_COPY_ON_WRITE
4430 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4431 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4432 && SvTYPE(sstr) >= SVt_PVIV)
4435 /* Failed the swipe test, and it's not a shared hash key either.
4436 Have to copy the string. */
4437 STRLEN len = SvCUR(sstr);
4438 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4439 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4440 SvCUR_set(dstr, len);
4441 *SvEND(dstr) = '\0';
4443 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4445 #ifdef PERL_COPY_ON_WRITE
4446 /* Either it's a shared hash key, or it's suitable for
4447 copy-on-write or we can swipe the string. */
4449 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4454 /* I believe I should acquire a global SV mutex if
4455 it's a COW sv (not a shared hash key) to stop
4456 it going un copy-on-write.
4457 If the source SV has gone un copy on write between up there
4458 and down here, then (assert() that) it is of the correct
4459 form to make it copy on write again */
4460 if ((sflags & (SVf_FAKE | SVf_READONLY))
4461 != (SVf_FAKE | SVf_READONLY)) {
4462 SvREADONLY_on(sstr);
4464 /* Make the source SV into a loop of 1.
4465 (about to become 2) */
4466 SV_COW_NEXT_SV_SET(sstr, sstr);
4470 /* Initial code is common. */
4471 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4473 SvFLAGS(dstr) &= ~SVf_OOK;
4474 Safefree(SvPVX(dstr) - SvIVX(dstr));
4476 else if (SvLEN(dstr))
4477 Safefree(SvPVX(dstr));
4480 #ifdef PERL_COPY_ON_WRITE
4482 /* making another shared SV. */
4483 STRLEN cur = SvCUR(sstr);
4484 STRLEN len = SvLEN(sstr);
4485 assert (SvTYPE(dstr) >= SVt_PVIV);
4487 /* SvIsCOW_normal */
4488 /* splice us in between source and next-after-source. */
4489 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4490 SV_COW_NEXT_SV_SET(sstr, dstr);
4491 SvPV_set(dstr, SvPVX(sstr));
4493 /* SvIsCOW_shared_hash */
4494 UV hash = SvUVX(sstr);
4495 DEBUG_C(PerlIO_printf(Perl_debug_log,
4496 "Copy on write: Sharing hash\n"));
4498 sharepvn(SvPVX(sstr),
4499 (sflags & SVf_UTF8?-cur:cur), hash));
4500 SvUV_set(dstr, hash);
4502 SvLEN_set(dstr, len);
4503 SvCUR_set(dstr, cur);
4504 SvREADONLY_on(dstr);
4506 /* Relesase a global SV mutex. */
4510 { /* Passes the swipe test. */
4511 SvPV_set(dstr, SvPVX(sstr));
4512 SvLEN_set(dstr, SvLEN(sstr));
4513 SvCUR_set(dstr, SvCUR(sstr));
4516 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4517 SvPV_set(sstr, Nullch);
4523 if (sflags & SVf_UTF8)
4526 if (sflags & SVp_NOK) {
4528 if (sflags & SVf_NOK)
4529 SvFLAGS(dstr) |= SVf_NOK;
4530 SvNV_set(dstr, SvNVX(sstr));
4532 if (sflags & SVp_IOK) {
4533 (void)SvIOKp_on(dstr);
4534 if (sflags & SVf_IOK)
4535 SvFLAGS(dstr) |= SVf_IOK;
4536 if (sflags & SVf_IVisUV)
4538 SvIV_set(dstr, SvIVX(sstr));
4541 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4542 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4543 smg->mg_ptr, smg->mg_len);
4544 SvRMAGICAL_on(dstr);
4547 else if (sflags & SVp_IOK) {
4548 if (sflags & SVf_IOK)
4549 (void)SvIOK_only(dstr);
4551 (void)SvOK_off(dstr);
4552 (void)SvIOKp_on(dstr);
4554 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4555 if (sflags & SVf_IVisUV)
4557 SvIV_set(dstr, SvIVX(sstr));
4558 if (sflags & SVp_NOK) {
4559 if (sflags & SVf_NOK)
4560 (void)SvNOK_on(dstr);
4562 (void)SvNOKp_on(dstr);
4563 SvNV_set(dstr, SvNVX(sstr));
4566 else if (sflags & SVp_NOK) {
4567 if (sflags & SVf_NOK)
4568 (void)SvNOK_only(dstr);
4570 (void)SvOK_off(dstr);
4573 SvNV_set(dstr, SvNVX(sstr));
4576 if (dtype == SVt_PVGV) {
4577 if (ckWARN(WARN_MISC))
4578 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4581 (void)SvOK_off(dstr);
4583 if (SvTAINTED(sstr))
4588 =for apidoc sv_setsv_mg
4590 Like C<sv_setsv>, but also handles 'set' magic.
4596 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4598 sv_setsv(dstr,sstr);
4602 #ifdef PERL_COPY_ON_WRITE
4604 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4606 STRLEN cur = SvCUR(sstr);
4607 STRLEN len = SvLEN(sstr);
4608 register char *new_pv;
4611 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4619 if (SvTHINKFIRST(dstr))
4620 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4621 else if (SvPVX(dstr))
4622 Safefree(SvPVX(dstr));
4626 (void)SvUPGRADE (dstr, SVt_PVIV);
4628 assert (SvPOK(sstr));
4629 assert (SvPOKp(sstr));
4630 assert (!SvIOK(sstr));
4631 assert (!SvIOKp(sstr));
4632 assert (!SvNOK(sstr));
4633 assert (!SvNOKp(sstr));
4635 if (SvIsCOW(sstr)) {
4637 if (SvLEN(sstr) == 0) {
4638 /* source is a COW shared hash key. */
4639 UV hash = SvUVX(sstr);
4640 DEBUG_C(PerlIO_printf(Perl_debug_log,
4641 "Fast copy on write: Sharing hash\n"));
4642 SvUV_set(dstr, hash);
4643 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4646 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4648 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4649 (void)SvUPGRADE (sstr, SVt_PVIV);
4650 SvREADONLY_on(sstr);
4652 DEBUG_C(PerlIO_printf(Perl_debug_log,
4653 "Fast copy on write: Converting sstr to COW\n"));
4654 SV_COW_NEXT_SV_SET(dstr, sstr);
4656 SV_COW_NEXT_SV_SET(sstr, dstr);
4657 new_pv = SvPVX(sstr);
4660 SvPV_set(dstr, new_pv);
4661 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4664 SvLEN_set(dstr, len);
4665 SvCUR_set(dstr, cur);
4674 =for apidoc sv_setpvn
4676 Copies a string into an SV. The C<len> parameter indicates the number of
4677 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4678 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4684 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4686 register char *dptr;
4688 SV_CHECK_THINKFIRST_COW_DROP(sv);
4694 /* len is STRLEN which is unsigned, need to copy to signed */
4697 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4699 (void)SvUPGRADE(sv, SVt_PV);
4701 SvGROW(sv, len + 1);
4703 Move(ptr,dptr,len,char);
4706 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4711 =for apidoc sv_setpvn_mg
4713 Like C<sv_setpvn>, but also handles 'set' magic.
4719 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4721 sv_setpvn(sv,ptr,len);
4726 =for apidoc sv_setpv
4728 Copies a string into an SV. The string must be null-terminated. Does not
4729 handle 'set' magic. See C<sv_setpv_mg>.
4735 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4737 register STRLEN len;
4739 SV_CHECK_THINKFIRST_COW_DROP(sv);
4745 (void)SvUPGRADE(sv, SVt_PV);
4747 SvGROW(sv, len + 1);
4748 Move(ptr,SvPVX(sv),len+1,char);
4750 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4755 =for apidoc sv_setpv_mg
4757 Like C<sv_setpv>, but also handles 'set' magic.
4763 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4770 =for apidoc sv_usepvn
4772 Tells an SV to use C<ptr> to find its string value. Normally the string is
4773 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4774 The C<ptr> should point to memory that was allocated by C<malloc>. The
4775 string length, C<len>, must be supplied. This function will realloc the
4776 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4777 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4778 See C<sv_usepvn_mg>.
4784 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4786 SV_CHECK_THINKFIRST_COW_DROP(sv);
4787 (void)SvUPGRADE(sv, SVt_PV);
4794 Renew(ptr, len+1, char);
4797 SvLEN_set(sv, len+1);
4799 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4804 =for apidoc sv_usepvn_mg
4806 Like C<sv_usepvn>, but also handles 'set' magic.
4812 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4814 sv_usepvn(sv,ptr,len);
4818 #ifdef PERL_COPY_ON_WRITE
4819 /* Need to do this *after* making the SV normal, as we need the buffer
4820 pointer to remain valid until after we've copied it. If we let go too early,
4821 another thread could invalidate it by unsharing last of the same hash key
4822 (which it can do by means other than releasing copy-on-write Svs)
4823 or by changing the other copy-on-write SVs in the loop. */
4825 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4826 U32 hash, SV *after)
4828 if (len) { /* this SV was SvIsCOW_normal(sv) */
4829 /* we need to find the SV pointing to us. */
4830 SV *current = SV_COW_NEXT_SV(after);
4832 if (current == sv) {
4833 /* The SV we point to points back to us (there were only two of us
4835 Hence other SV is no longer copy on write either. */
4837 SvREADONLY_off(after);
4839 /* We need to follow the pointers around the loop. */
4841 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4844 /* don't loop forever if the structure is bust, and we have
4845 a pointer into a closed loop. */
4846 assert (current != after);
4847 assert (SvPVX(current) == pvx);
4849 /* Make the SV before us point to the SV after us. */
4850 SV_COW_NEXT_SV_SET(current, after);
4853 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4858 Perl_sv_release_IVX(pTHX_ register SV *sv)
4861 sv_force_normal_flags(sv, 0);
4867 =for apidoc sv_force_normal_flags
4869 Undo various types of fakery on an SV: if the PV is a shared string, make
4870 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4871 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4872 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4873 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4874 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4875 set to some other value.) In addition, the C<flags> parameter gets passed to
4876 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4877 with flags set to 0.
4883 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4885 #ifdef PERL_COPY_ON_WRITE
4886 if (SvREADONLY(sv)) {
4887 /* At this point I believe I should acquire a global SV mutex. */
4889 char *pvx = SvPVX(sv);
4890 STRLEN len = SvLEN(sv);
4891 STRLEN cur = SvCUR(sv);
4892 U32 hash = SvUVX(sv);
4893 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4895 PerlIO_printf(Perl_debug_log,
4896 "Copy on write: Force normal %ld\n",
4902 /* This SV doesn't own the buffer, so need to New() a new one: */
4903 SvPV_set(sv, (char*)0);
4905 if (flags & SV_COW_DROP_PV) {
4906 /* OK, so we don't need to copy our buffer. */
4909 SvGROW(sv, cur + 1);
4910 Move(pvx,SvPVX(sv),cur,char);
4914 sv_release_COW(sv, pvx, cur, len, hash, next);
4919 else if (IN_PERL_RUNTIME)
4920 Perl_croak(aTHX_ PL_no_modify);
4921 /* At this point I believe that I can drop the global SV mutex. */
4924 if (SvREADONLY(sv)) {
4926 char *pvx = SvPVX(sv);
4927 int is_utf8 = SvUTF8(sv);
4928 STRLEN len = SvCUR(sv);
4929 U32 hash = SvUVX(sv);
4932 SvPV_set(sv, (char*)0);
4934 SvGROW(sv, len + 1);
4935 Move(pvx,SvPVX(sv),len,char);
4937 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4939 else if (IN_PERL_RUNTIME)
4940 Perl_croak(aTHX_ PL_no_modify);
4944 sv_unref_flags(sv, flags);
4945 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4950 =for apidoc sv_force_normal
4952 Undo various types of fakery on an SV: if the PV is a shared string, make
4953 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4954 an xpvmg. See also C<sv_force_normal_flags>.
4960 Perl_sv_force_normal(pTHX_ register SV *sv)
4962 sv_force_normal_flags(sv, 0);
4968 Efficient removal of characters from the beginning of the string buffer.
4969 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4970 the string buffer. The C<ptr> becomes the first character of the adjusted
4971 string. Uses the "OOK hack".
4972 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4973 refer to the same chunk of data.
4979 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4981 register STRLEN delta;
4982 if (!ptr || !SvPOKp(sv))
4984 delta = ptr - SvPVX(sv);
4985 SV_CHECK_THINKFIRST(sv);
4986 if (SvTYPE(sv) < SVt_PVIV)
4987 sv_upgrade(sv,SVt_PVIV);
4990 if (!SvLEN(sv)) { /* make copy of shared string */
4991 const char *pvx = SvPVX(sv);
4992 STRLEN len = SvCUR(sv);
4993 SvGROW(sv, len + 1);
4994 Move(pvx,SvPVX(sv),len,char);
4998 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4999 and we do that anyway inside the SvNIOK_off
5001 SvFLAGS(sv) |= SVf_OOK;
5004 SvLEN_set(sv, SvLEN(sv) - delta);
5005 SvCUR_set(sv, SvCUR(sv) - delta);
5006 SvPV_set(sv, SvPVX(sv) + delta);
5007 SvIV_set(sv, SvIVX(sv) + delta);
5010 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5011 * this function provided for binary compatibility only
5015 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5017 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5021 =for apidoc sv_catpvn
5023 Concatenates the string onto the end of the string which is in the SV. The
5024 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5025 status set, then the bytes appended should be valid UTF-8.
5026 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5028 =for apidoc sv_catpvn_flags
5030 Concatenates the string onto the end of the string which is in the SV. The
5031 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5032 status set, then the bytes appended should be valid UTF-8.
5033 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5034 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5035 in terms of this function.
5041 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5044 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
5046 SvGROW(dsv, dlen + slen + 1);
5049 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5050 SvCUR_set(dsv, SvCUR(dsv) + slen);
5052 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5057 =for apidoc sv_catpvn_mg
5059 Like C<sv_catpvn>, but also handles 'set' magic.
5065 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5067 sv_catpvn(sv,ptr,len);
5071 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5072 * this function provided for binary compatibility only
5076 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5078 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5082 =for apidoc sv_catsv
5084 Concatenates the string from SV C<ssv> onto the end of the string in
5085 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5086 not 'set' magic. See C<sv_catsv_mg>.
5088 =for apidoc sv_catsv_flags
5090 Concatenates the string from SV C<ssv> onto the end of the string in
5091 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5092 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5093 and C<sv_catsv_nomg> are implemented in terms of this function.
5098 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5104 if ((spv = SvPV(ssv, slen))) {
5105 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5106 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5107 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5108 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5109 dsv->sv_flags doesn't have that bit set.
5110 Andy Dougherty 12 Oct 2001
5112 I32 sutf8 = DO_UTF8(ssv);
5115 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5117 dutf8 = DO_UTF8(dsv);
5119 if (dutf8 != sutf8) {
5121 /* Not modifying source SV, so taking a temporary copy. */
5122 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5124 sv_utf8_upgrade(csv);
5125 spv = SvPV(csv, slen);
5128 sv_utf8_upgrade_nomg(dsv);
5130 sv_catpvn_nomg(dsv, spv, slen);
5135 =for apidoc sv_catsv_mg
5137 Like C<sv_catsv>, but also handles 'set' magic.
5143 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5150 =for apidoc sv_catpv
5152 Concatenates the string onto the end of the string which is in the SV.
5153 If the SV has the UTF-8 status set, then the bytes appended should be
5154 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5159 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5161 register STRLEN len;
5167 junk = SvPV_force(sv, tlen);
5169 SvGROW(sv, tlen + len + 1);
5172 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5173 SvCUR_set(sv, SvCUR(sv) + len);
5174 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5179 =for apidoc sv_catpv_mg
5181 Like C<sv_catpv>, but also handles 'set' magic.
5187 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5196 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5197 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5204 Perl_newSV(pTHX_ STRLEN len)
5210 sv_upgrade(sv, SVt_PV);
5211 SvGROW(sv, len + 1);
5216 =for apidoc sv_magicext
5218 Adds magic to an SV, upgrading it if necessary. Applies the
5219 supplied vtable and returns a pointer to the magic added.
5221 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5222 In particular, you can add magic to SvREADONLY SVs, and add more than
5223 one instance of the same 'how'.
5225 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5226 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5227 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5228 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5230 (This is now used as a subroutine by C<sv_magic>.)
5235 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5236 const char* name, I32 namlen)
5240 if (SvTYPE(sv) < SVt_PVMG) {
5241 (void)SvUPGRADE(sv, SVt_PVMG);
5243 Newz(702,mg, 1, MAGIC);
5244 mg->mg_moremagic = SvMAGIC(sv);
5245 SvMAGIC_set(sv, mg);
5247 /* Sometimes a magic contains a reference loop, where the sv and
5248 object refer to each other. To prevent a reference loop that
5249 would prevent such objects being freed, we look for such loops
5250 and if we find one we avoid incrementing the object refcount.
5252 Note we cannot do this to avoid self-tie loops as intervening RV must
5253 have its REFCNT incremented to keep it in existence.
5256 if (!obj || obj == sv ||
5257 how == PERL_MAGIC_arylen ||
5258 how == PERL_MAGIC_qr ||
5259 how == PERL_MAGIC_symtab ||
5260 (SvTYPE(obj) == SVt_PVGV &&
5261 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5262 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5263 GvFORM(obj) == (CV*)sv)))
5268 mg->mg_obj = SvREFCNT_inc(obj);
5269 mg->mg_flags |= MGf_REFCOUNTED;
5272 /* Normal self-ties simply pass a null object, and instead of
5273 using mg_obj directly, use the SvTIED_obj macro to produce a
5274 new RV as needed. For glob "self-ties", we are tieing the PVIO
5275 with an RV obj pointing to the glob containing the PVIO. In
5276 this case, to avoid a reference loop, we need to weaken the
5280 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5281 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5287 mg->mg_len = namlen;
5290 mg->mg_ptr = savepvn(name, namlen);
5291 else if (namlen == HEf_SVKEY)
5292 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5294 mg->mg_ptr = (char *) name;
5296 mg->mg_virtual = vtable;
5300 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5305 =for apidoc sv_magic
5307 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5308 then adds a new magic item of type C<how> to the head of the magic list.
5310 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5311 handling of the C<name> and C<namlen> arguments.
5313 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5314 to add more than one instance of the same 'how'.
5320 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5322 const MGVTBL *vtable = 0;
5325 #ifdef PERL_COPY_ON_WRITE
5327 sv_force_normal_flags(sv, 0);
5329 if (SvREADONLY(sv)) {
5331 && how != PERL_MAGIC_regex_global
5332 && how != PERL_MAGIC_bm
5333 && how != PERL_MAGIC_fm
5334 && how != PERL_MAGIC_sv
5335 && how != PERL_MAGIC_backref
5338 Perl_croak(aTHX_ PL_no_modify);
5341 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5342 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5343 /* sv_magic() refuses to add a magic of the same 'how' as an
5346 if (how == PERL_MAGIC_taint)
5354 vtable = &PL_vtbl_sv;
5356 case PERL_MAGIC_overload:
5357 vtable = &PL_vtbl_amagic;
5359 case PERL_MAGIC_overload_elem:
5360 vtable = &PL_vtbl_amagicelem;
5362 case PERL_MAGIC_overload_table:
5363 vtable = &PL_vtbl_ovrld;
5366 vtable = &PL_vtbl_bm;
5368 case PERL_MAGIC_regdata:
5369 vtable = &PL_vtbl_regdata;
5371 case PERL_MAGIC_regdatum:
5372 vtable = &PL_vtbl_regdatum;
5374 case PERL_MAGIC_env:
5375 vtable = &PL_vtbl_env;
5378 vtable = &PL_vtbl_fm;
5380 case PERL_MAGIC_envelem:
5381 vtable = &PL_vtbl_envelem;
5383 case PERL_MAGIC_regex_global:
5384 vtable = &PL_vtbl_mglob;
5386 case PERL_MAGIC_isa:
5387 vtable = &PL_vtbl_isa;
5389 case PERL_MAGIC_isaelem:
5390 vtable = &PL_vtbl_isaelem;
5392 case PERL_MAGIC_nkeys:
5393 vtable = &PL_vtbl_nkeys;
5395 case PERL_MAGIC_dbfile:
5398 case PERL_MAGIC_dbline:
5399 vtable = &PL_vtbl_dbline;
5401 #ifdef USE_LOCALE_COLLATE
5402 case PERL_MAGIC_collxfrm:
5403 vtable = &PL_vtbl_collxfrm;
5405 #endif /* USE_LOCALE_COLLATE */
5406 case PERL_MAGIC_tied:
5407 vtable = &PL_vtbl_pack;
5409 case PERL_MAGIC_tiedelem:
5410 case PERL_MAGIC_tiedscalar:
5411 vtable = &PL_vtbl_packelem;
5414 vtable = &PL_vtbl_regexp;
5416 case PERL_MAGIC_sig:
5417 vtable = &PL_vtbl_sig;
5419 case PERL_MAGIC_sigelem:
5420 vtable = &PL_vtbl_sigelem;
5422 case PERL_MAGIC_taint:
5423 vtable = &PL_vtbl_taint;
5425 case PERL_MAGIC_uvar:
5426 vtable = &PL_vtbl_uvar;
5428 case PERL_MAGIC_vec:
5429 vtable = &PL_vtbl_vec;
5431 case PERL_MAGIC_rhash:
5432 case PERL_MAGIC_symtab:
5433 case PERL_MAGIC_vstring:
5436 case PERL_MAGIC_utf8:
5437 vtable = &PL_vtbl_utf8;
5439 case PERL_MAGIC_substr:
5440 vtable = &PL_vtbl_substr;
5442 case PERL_MAGIC_defelem:
5443 vtable = &PL_vtbl_defelem;
5445 case PERL_MAGIC_glob:
5446 vtable = &PL_vtbl_glob;
5448 case PERL_MAGIC_arylen:
5449 vtable = &PL_vtbl_arylen;
5451 case PERL_MAGIC_pos:
5452 vtable = &PL_vtbl_pos;
5454 case PERL_MAGIC_backref:
5455 vtable = &PL_vtbl_backref;
5457 case PERL_MAGIC_ext:
5458 /* Reserved for use by extensions not perl internals. */
5459 /* Useful for attaching extension internal data to perl vars. */
5460 /* Note that multiple extensions may clash if magical scalars */
5461 /* etc holding private data from one are passed to another. */
5464 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5467 /* Rest of work is done else where */
5468 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5471 case PERL_MAGIC_taint:
5474 case PERL_MAGIC_ext:
5475 case PERL_MAGIC_dbfile:
5482 =for apidoc sv_unmagic
5484 Removes all magic of type C<type> from an SV.
5490 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5494 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5497 for (mg = *mgp; mg; mg = *mgp) {
5498 if (mg->mg_type == type) {
5499 const MGVTBL* const vtbl = mg->mg_virtual;
5500 *mgp = mg->mg_moremagic;
5501 if (vtbl && vtbl->svt_free)
5502 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5503 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5505 Safefree(mg->mg_ptr);
5506 else if (mg->mg_len == HEf_SVKEY)
5507 SvREFCNT_dec((SV*)mg->mg_ptr);
5508 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5509 Safefree(mg->mg_ptr);
5511 if (mg->mg_flags & MGf_REFCOUNTED)
5512 SvREFCNT_dec(mg->mg_obj);
5516 mgp = &mg->mg_moremagic;
5520 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5527 =for apidoc sv_rvweaken
5529 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5530 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5531 push a back-reference to this RV onto the array of backreferences
5532 associated with that magic.
5538 Perl_sv_rvweaken(pTHX_ SV *sv)
5541 if (!SvOK(sv)) /* let undefs pass */
5544 Perl_croak(aTHX_ "Can't weaken a nonreference");
5545 else if (SvWEAKREF(sv)) {
5546 if (ckWARN(WARN_MISC))
5547 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5551 sv_add_backref(tsv, sv);
5557 /* Give tsv backref magic if it hasn't already got it, then push a
5558 * back-reference to sv onto the array associated with the backref magic.
5562 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5566 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5567 av = (AV*)mg->mg_obj;
5570 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5571 /* av now has a refcnt of 2, which avoids it getting freed
5572 * before us during global cleanup. The extra ref is removed
5573 * by magic_killbackrefs() when tsv is being freed */
5575 if (AvFILLp(av) >= AvMAX(av)) {
5577 SV **svp = AvARRAY(av);
5578 for (i = AvFILLp(av); i >= 0; i--)
5580 svp[i] = sv; /* reuse the slot */
5583 av_extend(av, AvFILLp(av)+1);
5585 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5588 /* delete a back-reference to ourselves from the backref magic associated
5589 * with the SV we point to.
5593 S_sv_del_backref(pTHX_ SV *sv)
5600 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5601 Perl_croak(aTHX_ "panic: del_backref");
5602 av = (AV *)mg->mg_obj;
5604 for (i = AvFILLp(av); i >= 0; i--)
5605 if (svp[i] == sv) svp[i] = Nullsv;
5609 =for apidoc sv_insert
5611 Inserts a string at the specified offset/length within the SV. Similar to
5612 the Perl substr() function.
5618 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5622 register char *midend;
5623 register char *bigend;
5629 Perl_croak(aTHX_ "Can't modify non-existent substring");
5630 SvPV_force(bigstr, curlen);
5631 (void)SvPOK_only_UTF8(bigstr);
5632 if (offset + len > curlen) {
5633 SvGROW(bigstr, offset+len+1);
5634 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5635 SvCUR_set(bigstr, offset+len);
5639 i = littlelen - len;
5640 if (i > 0) { /* string might grow */
5641 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5642 mid = big + offset + len;
5643 midend = bigend = big + SvCUR(bigstr);
5646 while (midend > mid) /* shove everything down */
5647 *--bigend = *--midend;
5648 Move(little,big+offset,littlelen,char);
5649 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5654 Move(little,SvPVX(bigstr)+offset,len,char);
5659 big = SvPVX(bigstr);
5662 bigend = big + SvCUR(bigstr);
5664 if (midend > bigend)
5665 Perl_croak(aTHX_ "panic: sv_insert");
5667 if (mid - big > bigend - midend) { /* faster to shorten from end */
5669 Move(little, mid, littlelen,char);
5672 i = bigend - midend;
5674 Move(midend, mid, i,char);
5678 SvCUR_set(bigstr, mid - big);
5681 else if ((i = mid - big)) { /* faster from front */
5682 midend -= littlelen;
5684 sv_chop(bigstr,midend-i);
5689 Move(little, mid, littlelen,char);
5691 else if (littlelen) {
5692 midend -= littlelen;
5693 sv_chop(bigstr,midend);
5694 Move(little,midend,littlelen,char);
5697 sv_chop(bigstr,midend);
5703 =for apidoc sv_replace
5705 Make the first argument a copy of the second, then delete the original.
5706 The target SV physically takes over ownership of the body of the source SV
5707 and inherits its flags; however, the target keeps any magic it owns,
5708 and any magic in the source is discarded.
5709 Note that this is a rather specialist SV copying operation; most of the
5710 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5716 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5718 const U32 refcnt = SvREFCNT(sv);
5719 SV_CHECK_THINKFIRST_COW_DROP(sv);
5720 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5721 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5722 if (SvMAGICAL(sv)) {
5726 sv_upgrade(nsv, SVt_PVMG);
5727 SvMAGIC_set(nsv, SvMAGIC(sv));
5728 SvFLAGS(nsv) |= SvMAGICAL(sv);
5730 SvMAGIC_set(sv, NULL);
5734 assert(!SvREFCNT(sv));
5735 #ifdef DEBUG_LEAKING_SCALARS
5736 sv->sv_flags = nsv->sv_flags;
5737 sv->sv_any = nsv->sv_any;
5738 sv->sv_refcnt = nsv->sv_refcnt;
5740 StructCopy(nsv,sv,SV);
5742 /* Currently could join these into one piece of pointer arithmetic, but
5743 it would be unclear. */
5744 if(SvTYPE(sv) == SVt_IV)
5746 = (XPVIV*)((char*)&(sv->sv_u.sv_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5747 else if (SvTYPE(sv) == SVt_RV) {
5748 SvANY(sv) = &sv->sv_u.sv_rv;
5752 #ifdef PERL_COPY_ON_WRITE
5753 if (SvIsCOW_normal(nsv)) {
5754 /* We need to follow the pointers around the loop to make the
5755 previous SV point to sv, rather than nsv. */
5758 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5761 assert(SvPVX(current) == SvPVX(nsv));
5763 /* Make the SV before us point to the SV after us. */
5765 PerlIO_printf(Perl_debug_log, "previous is\n");
5767 PerlIO_printf(Perl_debug_log,
5768 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5769 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5771 SV_COW_NEXT_SV_SET(current, sv);
5774 SvREFCNT(sv) = refcnt;
5775 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5781 =for apidoc sv_clear
5783 Clear an SV: call any destructors, free up any memory used by the body,
5784 and free the body itself. The SV's head is I<not> freed, although
5785 its type is set to all 1's so that it won't inadvertently be assumed
5786 to be live during global destruction etc.
5787 This function should only be called when REFCNT is zero. Most of the time
5788 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5795 Perl_sv_clear(pTHX_ register SV *sv)
5800 assert(SvREFCNT(sv) == 0);
5803 if (PL_defstash) { /* Still have a symbol table? */
5810 stash = SvSTASH(sv);
5811 destructor = StashHANDLER(stash,DESTROY);
5813 SV* tmpref = newRV(sv);
5814 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5816 PUSHSTACKi(PERLSI_DESTROY);
5821 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5827 if(SvREFCNT(tmpref) < 2) {
5828 /* tmpref is not kept alive! */
5830 SvRV_set(tmpref, NULL);
5833 SvREFCNT_dec(tmpref);
5835 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5839 if (PL_in_clean_objs)
5840 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5842 /* DESTROY gave object new lease on life */
5848 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5849 SvOBJECT_off(sv); /* Curse the object. */
5850 if (SvTYPE(sv) != SVt_PVIO)
5851 --PL_sv_objcount; /* XXX Might want something more general */
5854 if (SvTYPE(sv) >= SVt_PVMG) {
5857 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5858 SvREFCNT_dec(SvSTASH(sv));
5861 switch (SvTYPE(sv)) {
5864 IoIFP(sv) != PerlIO_stdin() &&
5865 IoIFP(sv) != PerlIO_stdout() &&
5866 IoIFP(sv) != PerlIO_stderr())
5868 io_close((IO*)sv, FALSE);
5870 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5871 PerlDir_close(IoDIRP(sv));
5872 IoDIRP(sv) = (DIR*)NULL;
5873 Safefree(IoTOP_NAME(sv));
5874 Safefree(IoFMT_NAME(sv));
5875 Safefree(IoBOTTOM_NAME(sv));
5890 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5891 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5892 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5893 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5895 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5896 SvREFCNT_dec(LvTARG(sv));
5900 Safefree(GvNAME(sv));
5901 /* cannot decrease stash refcount yet, as we might recursively delete
5902 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5903 of stash until current sv is completely gone.
5904 -- JohnPC, 27 Mar 1998 */
5905 stash = GvSTASH(sv);
5911 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5913 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5914 /* Don't even bother with turning off the OOK flag. */
5923 SvREFCNT_dec(SvRV(sv));
5925 #ifdef PERL_COPY_ON_WRITE
5926 else if (SvPVX(sv)) {
5928 /* I believe I need to grab the global SV mutex here and
5929 then recheck the COW status. */
5931 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5934 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5935 SvUVX(sv), SV_COW_NEXT_SV(sv));
5936 /* And drop it here. */
5938 } else if (SvLEN(sv)) {
5939 Safefree(SvPVX(sv));
5943 else if (SvPVX(sv) && SvLEN(sv))
5944 Safefree(SvPVX(sv));
5945 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5946 unsharepvn(SvPVX(sv),
5947 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5961 switch (SvTYPE(sv)) {
5975 del_XPVIV(SvANY(sv));
5978 del_XPVNV(SvANY(sv));
5981 del_XPVMG(SvANY(sv));
5984 del_XPVLV(SvANY(sv));
5987 del_XPVAV(SvANY(sv));
5990 del_XPVHV(SvANY(sv));
5993 del_XPVCV(SvANY(sv));
5996 del_XPVGV(SvANY(sv));
5997 /* code duplication for increased performance. */
5998 SvFLAGS(sv) &= SVf_BREAK;
5999 SvFLAGS(sv) |= SVTYPEMASK;
6000 /* decrease refcount of the stash that owns this GV, if any */
6002 SvREFCNT_dec(stash);
6003 return; /* not break, SvFLAGS reset already happened */
6005 del_XPVBM(SvANY(sv));
6008 del_XPVFM(SvANY(sv));
6011 del_XPVIO(SvANY(sv));
6014 SvFLAGS(sv) &= SVf_BREAK;
6015 SvFLAGS(sv) |= SVTYPEMASK;
6019 =for apidoc sv_newref
6021 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6028 Perl_sv_newref(pTHX_ SV *sv)
6038 Decrement an SV's reference count, and if it drops to zero, call
6039 C<sv_clear> to invoke destructors and free up any memory used by
6040 the body; finally, deallocate the SV's head itself.
6041 Normally called via a wrapper macro C<SvREFCNT_dec>.
6047 Perl_sv_free(pTHX_ SV *sv)
6052 if (SvREFCNT(sv) == 0) {
6053 if (SvFLAGS(sv) & SVf_BREAK)
6054 /* this SV's refcnt has been artificially decremented to
6055 * trigger cleanup */
6057 if (PL_in_clean_all) /* All is fair */
6059 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6060 /* make sure SvREFCNT(sv)==0 happens very seldom */
6061 SvREFCNT(sv) = (~(U32)0)/2;
6064 if (ckWARN_d(WARN_INTERNAL))
6065 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6066 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6067 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6070 if (--(SvREFCNT(sv)) > 0)
6072 Perl_sv_free2(aTHX_ sv);
6076 Perl_sv_free2(pTHX_ SV *sv)
6081 if (ckWARN_d(WARN_DEBUGGING))
6082 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6083 "Attempt to free temp prematurely: SV 0x%"UVxf
6084 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6088 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6089 /* make sure SvREFCNT(sv)==0 happens very seldom */
6090 SvREFCNT(sv) = (~(U32)0)/2;
6101 Returns the length of the string in the SV. Handles magic and type
6102 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6108 Perl_sv_len(pTHX_ register SV *sv)
6116 len = mg_length(sv);
6118 (void)SvPV(sv, len);
6123 =for apidoc sv_len_utf8
6125 Returns the number of characters in the string in an SV, counting wide
6126 UTF-8 bytes as a single character. Handles magic and type coercion.
6132 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6133 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6134 * (Note that the mg_len is not the length of the mg_ptr field.)
6139 Perl_sv_len_utf8(pTHX_ register SV *sv)
6145 return mg_length(sv);
6149 const U8 *s = (U8*)SvPV(sv, len);
6150 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6152 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6154 #ifdef PERL_UTF8_CACHE_ASSERT
6155 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6159 ulen = Perl_utf8_length(aTHX_ s, s + len);
6160 if (!mg && !SvREADONLY(sv)) {
6161 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6162 mg = mg_find(sv, PERL_MAGIC_utf8);
6172 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6173 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6174 * between UTF-8 and byte offsets. There are two (substr offset and substr
6175 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6176 * and byte offset) cache positions.
6178 * The mg_len field is used by sv_len_utf8(), see its comments.
6179 * Note that the mg_len is not the length of the mg_ptr field.
6183 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 offsetp, U8 *s, U8 *start)
6187 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6189 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6193 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6195 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6196 (*mgp)->mg_ptr = (char *) *cachep;
6200 (*cachep)[i] = offsetp;
6201 (*cachep)[i+1] = s - start;
6209 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6210 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6211 * between UTF-8 and byte offsets. See also the comments of
6212 * S_utf8_mg_pos_init().
6216 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6220 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6222 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6223 if (*mgp && (*mgp)->mg_ptr) {
6224 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6225 ASSERT_UTF8_CACHE(*cachep);
6226 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6228 else { /* We will skip to the right spot. */
6233 /* The assumption is that going backward is half
6234 * the speed of going forward (that's where the
6235 * 2 * backw in the below comes from). (The real
6236 * figure of course depends on the UTF-8 data.) */
6238 if ((*cachep)[i] > (STRLEN)uoff) {
6240 backw = (*cachep)[i] - (STRLEN)uoff;
6242 if (forw < 2 * backw)
6245 p = start + (*cachep)[i+1];
6247 /* Try this only for the substr offset (i == 0),
6248 * not for the substr length (i == 2). */
6249 else if (i == 0) { /* (*cachep)[i] < uoff */
6250 const STRLEN ulen = sv_len_utf8(sv);
6252 if ((STRLEN)uoff < ulen) {
6253 forw = (STRLEN)uoff - (*cachep)[i];
6254 backw = ulen - (STRLEN)uoff;
6256 if (forw < 2 * backw)
6257 p = start + (*cachep)[i+1];
6262 /* If the string is not long enough for uoff,
6263 * we could extend it, but not at this low a level. */
6267 if (forw < 2 * backw) {
6274 while (UTF8_IS_CONTINUATION(*p))
6279 /* Update the cache. */
6280 (*cachep)[i] = (STRLEN)uoff;
6281 (*cachep)[i+1] = p - start;
6283 /* Drop the stale "length" cache */
6292 if (found) { /* Setup the return values. */
6293 *offsetp = (*cachep)[i+1];
6294 *sp = start + *offsetp;
6297 *offsetp = send - start;
6299 else if (*sp < start) {
6305 #ifdef PERL_UTF8_CACHE_ASSERT
6310 while (n-- && s < send)
6314 assert(*offsetp == s - start);
6315 assert((*cachep)[0] == (STRLEN)uoff);
6316 assert((*cachep)[1] == *offsetp);
6318 ASSERT_UTF8_CACHE(*cachep);
6327 =for apidoc sv_pos_u2b
6329 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6330 the start of the string, to a count of the equivalent number of bytes; if
6331 lenp is non-zero, it does the same to lenp, but this time starting from
6332 the offset, rather than from the start of the string. Handles magic and
6339 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6340 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6341 * byte offsets. See also the comments of S_utf8_mg_pos().
6346 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6357 start = s = (U8*)SvPV(sv, len);
6359 I32 uoffset = *offsetp;
6364 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6366 if (!found && uoffset > 0) {
6367 while (s < send && uoffset--)
6371 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6373 *offsetp = s - start;
6378 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6382 if (!found && *lenp > 0) {
6385 while (s < send && ulen--)
6389 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6393 ASSERT_UTF8_CACHE(cache);
6405 =for apidoc sv_pos_b2u
6407 Converts the value pointed to by offsetp from a count of bytes from the
6408 start of the string, to a count of the equivalent number of UTF-8 chars.
6409 Handles magic and type coercion.
6415 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6416 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6417 * byte offsets. See also the comments of S_utf8_mg_pos().
6422 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6430 s = (U8*)SvPV(sv, len);
6431 if ((I32)len < *offsetp)
6432 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6434 U8* send = s + *offsetp;
6436 STRLEN *cache = NULL;
6440 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6441 mg = mg_find(sv, PERL_MAGIC_utf8);
6442 if (mg && mg->mg_ptr) {
6443 cache = (STRLEN *) mg->mg_ptr;
6444 if (cache[1] == (STRLEN)*offsetp) {
6445 /* An exact match. */
6446 *offsetp = cache[0];
6450 else if (cache[1] < (STRLEN)*offsetp) {
6451 /* We already know part of the way. */
6454 /* Let the below loop do the rest. */
6456 else { /* cache[1] > *offsetp */
6457 /* We already know all of the way, now we may
6458 * be able to walk back. The same assumption
6459 * is made as in S_utf8_mg_pos(), namely that
6460 * walking backward is twice slower than
6461 * walking forward. */
6462 STRLEN forw = *offsetp;
6463 STRLEN backw = cache[1] - *offsetp;
6465 if (!(forw < 2 * backw)) {
6466 U8 *p = s + cache[1];
6473 while (UTF8_IS_CONTINUATION(*p)) {
6481 *offsetp = cache[0];
6483 /* Drop the stale "length" cache */
6491 ASSERT_UTF8_CACHE(cache);
6497 /* Call utf8n_to_uvchr() to validate the sequence
6498 * (unless a simple non-UTF character) */
6499 if (!UTF8_IS_INVARIANT(*s))
6500 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6509 if (!SvREADONLY(sv)) {
6511 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6512 mg = mg_find(sv, PERL_MAGIC_utf8);
6517 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6518 mg->mg_ptr = (char *) cache;
6523 cache[1] = *offsetp;
6524 /* Drop the stale "length" cache */
6537 Returns a boolean indicating whether the strings in the two SVs are
6538 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6539 coerce its args to strings if necessary.
6545 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6553 SV* svrecode = Nullsv;
6560 pv1 = SvPV(sv1, cur1);
6567 pv2 = SvPV(sv2, cur2);
6569 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6570 /* Differing utf8ness.
6571 * Do not UTF8size the comparands as a side-effect. */
6574 svrecode = newSVpvn(pv2, cur2);
6575 sv_recode_to_utf8(svrecode, PL_encoding);
6576 pv2 = SvPV(svrecode, cur2);
6579 svrecode = newSVpvn(pv1, cur1);
6580 sv_recode_to_utf8(svrecode, PL_encoding);
6581 pv1 = SvPV(svrecode, cur1);
6583 /* Now both are in UTF-8. */
6585 SvREFCNT_dec(svrecode);
6590 bool is_utf8 = TRUE;
6593 /* sv1 is the UTF-8 one,
6594 * if is equal it must be downgrade-able */
6595 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6601 /* sv2 is the UTF-8 one,
6602 * if is equal it must be downgrade-able */
6603 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6609 /* Downgrade not possible - cannot be eq */
6617 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6620 SvREFCNT_dec(svrecode);
6631 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6632 string in C<sv1> is less than, equal to, or greater than the string in
6633 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6634 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6640 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6643 const char *pv1, *pv2;
6646 SV *svrecode = Nullsv;
6653 pv1 = SvPV(sv1, cur1);
6660 pv2 = SvPV(sv2, cur2);
6662 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6663 /* Differing utf8ness.
6664 * Do not UTF8size the comparands as a side-effect. */
6667 svrecode = newSVpvn(pv2, cur2);
6668 sv_recode_to_utf8(svrecode, PL_encoding);
6669 pv2 = SvPV(svrecode, cur2);
6672 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6677 svrecode = newSVpvn(pv1, cur1);
6678 sv_recode_to_utf8(svrecode, PL_encoding);
6679 pv1 = SvPV(svrecode, cur1);
6682 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6688 cmp = cur2 ? -1 : 0;
6692 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6695 cmp = retval < 0 ? -1 : 1;
6696 } else if (cur1 == cur2) {
6699 cmp = cur1 < cur2 ? -1 : 1;
6704 SvREFCNT_dec(svrecode);
6713 =for apidoc sv_cmp_locale
6715 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6716 'use bytes' aware, handles get magic, and will coerce its args to strings
6717 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6723 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6725 #ifdef USE_LOCALE_COLLATE
6731 if (PL_collation_standard)
6735 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6737 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6739 if (!pv1 || !len1) {
6750 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6753 return retval < 0 ? -1 : 1;
6756 * When the result of collation is equality, that doesn't mean
6757 * that there are no differences -- some locales exclude some
6758 * characters from consideration. So to avoid false equalities,
6759 * we use the raw string as a tiebreaker.
6765 #endif /* USE_LOCALE_COLLATE */
6767 return sv_cmp(sv1, sv2);
6771 #ifdef USE_LOCALE_COLLATE
6774 =for apidoc sv_collxfrm
6776 Add Collate Transform magic to an SV if it doesn't already have it.
6778 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6779 scalar data of the variable, but transformed to such a format that a normal
6780 memory comparison can be used to compare the data according to the locale
6787 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6791 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6792 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6797 Safefree(mg->mg_ptr);
6799 if ((xf = mem_collxfrm(s, len, &xlen))) {
6800 if (SvREADONLY(sv)) {
6803 return xf + sizeof(PL_collation_ix);
6806 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6807 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6820 if (mg && mg->mg_ptr) {
6822 return mg->mg_ptr + sizeof(PL_collation_ix);
6830 #endif /* USE_LOCALE_COLLATE */
6835 Get a line from the filehandle and store it into the SV, optionally
6836 appending to the currently-stored string.
6842 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6846 register STDCHAR rslast;
6847 register STDCHAR *bp;
6853 if (SvTHINKFIRST(sv))
6854 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6855 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6857 However, perlbench says it's slower, because the existing swipe code
6858 is faster than copy on write.
6859 Swings and roundabouts. */
6860 (void)SvUPGRADE(sv, SVt_PV);
6865 if (PerlIO_isutf8(fp)) {
6867 sv_utf8_upgrade_nomg(sv);
6868 sv_pos_u2b(sv,&append,0);
6870 } else if (SvUTF8(sv)) {
6871 SV *tsv = NEWSV(0,0);
6872 sv_gets(tsv, fp, 0);
6873 sv_utf8_upgrade_nomg(tsv);
6874 SvCUR_set(sv,append);
6877 goto return_string_or_null;
6882 if (PerlIO_isutf8(fp))
6885 if (IN_PERL_COMPILETIME) {
6886 /* we always read code in line mode */
6890 else if (RsSNARF(PL_rs)) {
6891 /* If it is a regular disk file use size from stat() as estimate
6892 of amount we are going to read - may result in malloc-ing
6893 more memory than we realy need if layers bellow reduce
6894 size we read (e.g. CRLF or a gzip layer)
6897 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6898 const Off_t offset = PerlIO_tell(fp);
6899 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6900 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6906 else if (RsRECORD(PL_rs)) {
6910 /* Grab the size of the record we're getting */
6911 recsize = SvIV(SvRV(PL_rs));
6912 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6915 /* VMS wants read instead of fread, because fread doesn't respect */
6916 /* RMS record boundaries. This is not necessarily a good thing to be */
6917 /* doing, but we've got no other real choice - except avoid stdio
6918 as implementation - perhaps write a :vms layer ?
6920 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6922 bytesread = PerlIO_read(fp, buffer, recsize);
6926 SvCUR_set(sv, bytesread += append);
6927 buffer[bytesread] = '\0';
6928 goto return_string_or_null;
6930 else if (RsPARA(PL_rs)) {
6936 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6937 if (PerlIO_isutf8(fp)) {
6938 rsptr = SvPVutf8(PL_rs, rslen);
6941 if (SvUTF8(PL_rs)) {
6942 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6943 Perl_croak(aTHX_ "Wide character in $/");
6946 rsptr = SvPV(PL_rs, rslen);
6950 rslast = rslen ? rsptr[rslen - 1] : '\0';
6952 if (rspara) { /* have to do this both before and after */
6953 do { /* to make sure file boundaries work right */
6956 i = PerlIO_getc(fp);
6960 PerlIO_ungetc(fp,i);
6966 /* See if we know enough about I/O mechanism to cheat it ! */
6968 /* This used to be #ifdef test - it is made run-time test for ease
6969 of abstracting out stdio interface. One call should be cheap
6970 enough here - and may even be a macro allowing compile
6974 if (PerlIO_fast_gets(fp)) {
6977 * We're going to steal some values from the stdio struct
6978 * and put EVERYTHING in the innermost loop into registers.
6980 register STDCHAR *ptr;
6984 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6985 /* An ungetc()d char is handled separately from the regular
6986 * buffer, so we getc() it back out and stuff it in the buffer.
6988 i = PerlIO_getc(fp);
6989 if (i == EOF) return 0;
6990 *(--((*fp)->_ptr)) = (unsigned char) i;
6994 /* Here is some breathtakingly efficient cheating */
6996 cnt = PerlIO_get_cnt(fp); /* get count into register */
6997 /* make sure we have the room */
6998 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6999 /* Not room for all of it
7000 if we are looking for a separator and room for some
7002 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7003 /* just process what we have room for */
7004 shortbuffered = cnt - SvLEN(sv) + append + 1;
7005 cnt -= shortbuffered;
7009 /* remember that cnt can be negative */
7010 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7015 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7016 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7017 DEBUG_P(PerlIO_printf(Perl_debug_log,
7018 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7019 DEBUG_P(PerlIO_printf(Perl_debug_log,
7020 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7021 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7022 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7027 while (cnt > 0) { /* this | eat */
7029 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7030 goto thats_all_folks; /* screams | sed :-) */
7034 Copy(ptr, bp, cnt, char); /* this | eat */
7035 bp += cnt; /* screams | dust */
7036 ptr += cnt; /* louder | sed :-) */
7041 if (shortbuffered) { /* oh well, must extend */
7042 cnt = shortbuffered;
7044 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7046 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7047 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7051 DEBUG_P(PerlIO_printf(Perl_debug_log,
7052 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7053 PTR2UV(ptr),(long)cnt));
7054 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7056 DEBUG_P(PerlIO_printf(Perl_debug_log,
7057 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7058 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7059 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7061 /* This used to call 'filbuf' in stdio form, but as that behaves like
7062 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7063 another abstraction. */
7064 i = PerlIO_getc(fp); /* get more characters */
7066 DEBUG_P(PerlIO_printf(Perl_debug_log,
7067 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7068 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7069 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7071 cnt = PerlIO_get_cnt(fp);
7072 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7073 DEBUG_P(PerlIO_printf(Perl_debug_log,
7074 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7076 if (i == EOF) /* all done for ever? */
7077 goto thats_really_all_folks;
7079 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7081 SvGROW(sv, bpx + cnt + 2);
7082 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7084 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7086 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7087 goto thats_all_folks;
7091 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7092 memNE((char*)bp - rslen, rsptr, rslen))
7093 goto screamer; /* go back to the fray */
7094 thats_really_all_folks:
7096 cnt += shortbuffered;
7097 DEBUG_P(PerlIO_printf(Perl_debug_log,
7098 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7099 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7100 DEBUG_P(PerlIO_printf(Perl_debug_log,
7101 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7102 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7103 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7105 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7106 DEBUG_P(PerlIO_printf(Perl_debug_log,
7107 "Screamer: done, len=%ld, string=|%.*s|\n",
7108 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7112 /*The big, slow, and stupid way. */
7113 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7115 New(0, buf, 8192, STDCHAR);
7123 const register STDCHAR *bpe = buf + sizeof(buf);
7125 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7126 ; /* keep reading */
7130 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7131 /* Accomodate broken VAXC compiler, which applies U8 cast to
7132 * both args of ?: operator, causing EOF to change into 255
7135 i = (U8)buf[cnt - 1];
7141 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7143 sv_catpvn(sv, (char *) buf, cnt);
7145 sv_setpvn(sv, (char *) buf, cnt);
7147 if (i != EOF && /* joy */
7149 SvCUR(sv) < rslen ||
7150 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7154 * If we're reading from a TTY and we get a short read,
7155 * indicating that the user hit his EOF character, we need
7156 * to notice it now, because if we try to read from the TTY
7157 * again, the EOF condition will disappear.
7159 * The comparison of cnt to sizeof(buf) is an optimization
7160 * that prevents unnecessary calls to feof().
7164 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7168 #ifdef USE_HEAP_INSTEAD_OF_STACK
7173 if (rspara) { /* have to do this both before and after */
7174 while (i != EOF) { /* to make sure file boundaries work right */
7175 i = PerlIO_getc(fp);
7177 PerlIO_ungetc(fp,i);
7183 return_string_or_null:
7184 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7190 Auto-increment of the value in the SV, doing string to numeric conversion
7191 if necessary. Handles 'get' magic.
7197 Perl_sv_inc(pTHX_ register SV *sv)
7206 if (SvTHINKFIRST(sv)) {
7208 sv_force_normal_flags(sv, 0);
7209 if (SvREADONLY(sv)) {
7210 if (IN_PERL_RUNTIME)
7211 Perl_croak(aTHX_ PL_no_modify);
7215 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7217 i = PTR2IV(SvRV(sv));
7222 flags = SvFLAGS(sv);
7223 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7224 /* It's (privately or publicly) a float, but not tested as an
7225 integer, so test it to see. */
7227 flags = SvFLAGS(sv);
7229 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7230 /* It's publicly an integer, or privately an integer-not-float */
7231 #ifdef PERL_PRESERVE_IVUV
7235 if (SvUVX(sv) == UV_MAX)
7236 sv_setnv(sv, UV_MAX_P1);
7238 (void)SvIOK_only_UV(sv);
7239 SvUV_set(sv, SvUVX(sv) + 1);
7241 if (SvIVX(sv) == IV_MAX)
7242 sv_setuv(sv, (UV)IV_MAX + 1);
7244 (void)SvIOK_only(sv);
7245 SvIV_set(sv, SvIVX(sv) + 1);
7250 if (flags & SVp_NOK) {
7251 (void)SvNOK_only(sv);
7252 SvNV_set(sv, SvNVX(sv) + 1.0);
7256 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7257 if ((flags & SVTYPEMASK) < SVt_PVIV)
7258 sv_upgrade(sv, SVt_IV);
7259 (void)SvIOK_only(sv);
7264 while (isALPHA(*d)) d++;
7265 while (isDIGIT(*d)) d++;
7267 #ifdef PERL_PRESERVE_IVUV
7268 /* Got to punt this as an integer if needs be, but we don't issue
7269 warnings. Probably ought to make the sv_iv_please() that does
7270 the conversion if possible, and silently. */
7271 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7272 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7273 /* Need to try really hard to see if it's an integer.
7274 9.22337203685478e+18 is an integer.
7275 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7276 so $a="9.22337203685478e+18"; $a+0; $a++
7277 needs to be the same as $a="9.22337203685478e+18"; $a++
7284 /* sv_2iv *should* have made this an NV */
7285 if (flags & SVp_NOK) {
7286 (void)SvNOK_only(sv);
7287 SvNV_set(sv, SvNVX(sv) + 1.0);
7290 /* I don't think we can get here. Maybe I should assert this
7291 And if we do get here I suspect that sv_setnv will croak. NWC
7293 #if defined(USE_LONG_DOUBLE)
7294 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",
7295 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7297 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7298 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7301 #endif /* PERL_PRESERVE_IVUV */
7302 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7306 while (d >= SvPVX(sv)) {
7314 /* MKS: The original code here died if letters weren't consecutive.
7315 * at least it didn't have to worry about non-C locales. The
7316 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7317 * arranged in order (although not consecutively) and that only
7318 * [A-Za-z] are accepted by isALPHA in the C locale.
7320 if (*d != 'z' && *d != 'Z') {
7321 do { ++*d; } while (!isALPHA(*d));
7324 *(d--) -= 'z' - 'a';
7329 *(d--) -= 'z' - 'a' + 1;
7333 /* oh,oh, the number grew */
7334 SvGROW(sv, SvCUR(sv) + 2);
7335 SvCUR_set(sv, SvCUR(sv) + 1);
7336 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7347 Auto-decrement of the value in the SV, doing string to numeric conversion
7348 if necessary. Handles 'get' magic.
7354 Perl_sv_dec(pTHX_ register SV *sv)
7362 if (SvTHINKFIRST(sv)) {
7364 sv_force_normal_flags(sv, 0);
7365 if (SvREADONLY(sv)) {
7366 if (IN_PERL_RUNTIME)
7367 Perl_croak(aTHX_ PL_no_modify);
7371 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7373 i = PTR2IV(SvRV(sv));
7378 /* Unlike sv_inc we don't have to worry about string-never-numbers
7379 and keeping them magic. But we mustn't warn on punting */
7380 flags = SvFLAGS(sv);
7381 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7382 /* It's publicly an integer, or privately an integer-not-float */
7383 #ifdef PERL_PRESERVE_IVUV
7387 if (SvUVX(sv) == 0) {
7388 (void)SvIOK_only(sv);
7392 (void)SvIOK_only_UV(sv);
7393 SvUV_set(sv, SvUVX(sv) + 1);
7396 if (SvIVX(sv) == IV_MIN)
7397 sv_setnv(sv, (NV)IV_MIN - 1.0);
7399 (void)SvIOK_only(sv);
7400 SvIV_set(sv, SvIVX(sv) - 1);
7405 if (flags & SVp_NOK) {
7406 SvNV_set(sv, SvNVX(sv) - 1.0);
7407 (void)SvNOK_only(sv);
7410 if (!(flags & SVp_POK)) {
7411 if ((flags & SVTYPEMASK) < SVt_PVNV)
7412 sv_upgrade(sv, SVt_NV);
7414 (void)SvNOK_only(sv);
7417 #ifdef PERL_PRESERVE_IVUV
7419 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7420 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7421 /* Need to try really hard to see if it's an integer.
7422 9.22337203685478e+18 is an integer.
7423 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7424 so $a="9.22337203685478e+18"; $a+0; $a--
7425 needs to be the same as $a="9.22337203685478e+18"; $a--
7432 /* sv_2iv *should* have made this an NV */
7433 if (flags & SVp_NOK) {
7434 (void)SvNOK_only(sv);
7435 SvNV_set(sv, SvNVX(sv) - 1.0);
7438 /* I don't think we can get here. Maybe I should assert this
7439 And if we do get here I suspect that sv_setnv will croak. NWC
7441 #if defined(USE_LONG_DOUBLE)
7442 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",
7443 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7445 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7446 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7450 #endif /* PERL_PRESERVE_IVUV */
7451 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7455 =for apidoc sv_mortalcopy
7457 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7458 The new SV is marked as mortal. It will be destroyed "soon", either by an
7459 explicit call to FREETMPS, or by an implicit call at places such as
7460 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7465 /* Make a string that will exist for the duration of the expression
7466 * evaluation. Actually, it may have to last longer than that, but
7467 * hopefully we won't free it until it has been assigned to a
7468 * permanent location. */
7471 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7476 sv_setsv(sv,oldstr);
7478 PL_tmps_stack[++PL_tmps_ix] = sv;
7484 =for apidoc sv_newmortal
7486 Creates a new null SV which is mortal. The reference count of the SV is
7487 set to 1. It will be destroyed "soon", either by an explicit call to
7488 FREETMPS, or by an implicit call at places such as statement boundaries.
7489 See also C<sv_mortalcopy> and C<sv_2mortal>.
7495 Perl_sv_newmortal(pTHX)
7500 SvFLAGS(sv) = SVs_TEMP;
7502 PL_tmps_stack[++PL_tmps_ix] = sv;
7507 =for apidoc sv_2mortal
7509 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7510 by an explicit call to FREETMPS, or by an implicit call at places such as
7511 statement boundaries. SvTEMP() is turned on which means that the SV's
7512 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7513 and C<sv_mortalcopy>.
7519 Perl_sv_2mortal(pTHX_ register SV *sv)
7524 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7527 PL_tmps_stack[++PL_tmps_ix] = sv;
7535 Creates a new SV and copies a string into it. The reference count for the
7536 SV is set to 1. If C<len> is zero, Perl will compute the length using
7537 strlen(). For efficiency, consider using C<newSVpvn> instead.
7543 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7550 sv_setpvn(sv,s,len);
7555 =for apidoc newSVpvn
7557 Creates a new SV and copies a string into it. The reference count for the
7558 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7559 string. You are responsible for ensuring that the source string is at least
7560 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7566 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7571 sv_setpvn(sv,s,len);
7576 =for apidoc newSVpvn_share
7578 Creates a new SV with its SvPVX pointing to a shared string in the string
7579 table. If the string does not already exist in the table, it is created
7580 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7581 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7582 otherwise the hash is computed. The idea here is that as the string table
7583 is used for shared hash keys these strings will have SvPVX == HeKEY and
7584 hash lookup will avoid string compare.
7590 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7593 bool is_utf8 = FALSE;
7595 STRLEN tmplen = -len;
7597 /* See the note in hv.c:hv_fetch() --jhi */
7598 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7602 PERL_HASH(hash, src, len);
7604 sv_upgrade(sv, SVt_PVIV);
7605 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7618 #if defined(PERL_IMPLICIT_CONTEXT)
7620 /* pTHX_ magic can't cope with varargs, so this is a no-context
7621 * version of the main function, (which may itself be aliased to us).
7622 * Don't access this version directly.
7626 Perl_newSVpvf_nocontext(const char* pat, ...)
7631 va_start(args, pat);
7632 sv = vnewSVpvf(pat, &args);
7639 =for apidoc newSVpvf
7641 Creates a new SV and initializes it with the string formatted like
7648 Perl_newSVpvf(pTHX_ const char* pat, ...)
7652 va_start(args, pat);
7653 sv = vnewSVpvf(pat, &args);
7658 /* backend for newSVpvf() and newSVpvf_nocontext() */
7661 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7665 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7672 Creates a new SV and copies a floating point value into it.
7673 The reference count for the SV is set to 1.
7679 Perl_newSVnv(pTHX_ NV n)
7691 Creates a new SV and copies an integer into it. The reference count for the
7698 Perl_newSViv(pTHX_ IV i)
7710 Creates a new SV and copies an unsigned integer into it.
7711 The reference count for the SV is set to 1.
7717 Perl_newSVuv(pTHX_ UV u)
7727 =for apidoc newRV_noinc
7729 Creates an RV wrapper for an SV. The reference count for the original
7730 SV is B<not> incremented.
7736 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7741 sv_upgrade(sv, SVt_RV);
7743 SvRV_set(sv, tmpRef);
7748 /* newRV_inc is the official function name to use now.
7749 * newRV_inc is in fact #defined to newRV in sv.h
7753 Perl_newRV(pTHX_ SV *tmpRef)
7755 return newRV_noinc(SvREFCNT_inc(tmpRef));
7761 Creates a new SV which is an exact duplicate of the original SV.
7768 Perl_newSVsv(pTHX_ register SV *old)
7774 if (SvTYPE(old) == SVTYPEMASK) {
7775 if (ckWARN_d(WARN_INTERNAL))
7776 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7780 /* SV_GMAGIC is the default for sv_setv()
7781 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7782 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7783 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7788 =for apidoc sv_reset
7790 Underlying implementation for the C<reset> Perl function.
7791 Note that the perl-level function is vaguely deprecated.
7797 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7805 char todo[PERL_UCHAR_MAX+1];
7810 if (!*s) { /* reset ?? searches */
7811 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7813 PMOP *pm = (PMOP *) mg->mg_obj;
7815 pm->op_pmdynflags &= ~PMdf_USED;
7822 /* reset variables */
7824 if (!HvARRAY(stash))
7827 Zero(todo, 256, char);
7829 i = (unsigned char)*s;
7833 max = (unsigned char)*s++;
7834 for ( ; i <= max; i++) {
7837 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7838 for (entry = HvARRAY(stash)[i];
7840 entry = HeNEXT(entry))
7842 if (!todo[(U8)*HeKEY(entry)])
7844 gv = (GV*)HeVAL(entry);
7846 if (SvTHINKFIRST(sv)) {
7847 if (!SvREADONLY(sv) && SvROK(sv))
7852 if (SvTYPE(sv) >= SVt_PV) {
7854 if (SvPVX(sv) != Nullch)
7861 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7864 #ifdef USE_ENVIRON_ARRAY
7866 # ifdef USE_ITHREADS
7867 && PL_curinterp == aTHX
7871 environ[0] = Nullch;
7874 #endif /* !PERL_MICRO */
7884 Using various gambits, try to get an IO from an SV: the IO slot if its a
7885 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7886 named after the PV if we're a string.
7892 Perl_sv_2io(pTHX_ SV *sv)
7897 switch (SvTYPE(sv)) {
7905 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7909 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7911 return sv_2io(SvRV(sv));
7912 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7918 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7927 Using various gambits, try to get a CV from an SV; in addition, try if
7928 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7934 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7941 return *gvp = Nullgv, Nullcv;
7942 switch (SvTYPE(sv)) {
7961 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7962 tryAMAGICunDEREF(to_cv);
7965 if (SvTYPE(sv) == SVt_PVCV) {
7974 Perl_croak(aTHX_ "Not a subroutine reference");
7979 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7985 if (lref && !GvCVu(gv)) {
7988 tmpsv = NEWSV(704,0);
7989 gv_efullname3(tmpsv, gv, Nullch);
7990 /* XXX this is probably not what they think they're getting.
7991 * It has the same effect as "sub name;", i.e. just a forward
7993 newSUB(start_subparse(FALSE, 0),
7994 newSVOP(OP_CONST, 0, tmpsv),
7999 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8009 Returns true if the SV has a true value by Perl's rules.
8010 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8011 instead use an in-line version.
8017 Perl_sv_true(pTHX_ register SV *sv)
8022 const register XPV* tXpv;
8023 if ((tXpv = (XPV*)SvANY(sv)) &&
8024 (tXpv->xpv_cur > 1 ||
8025 (tXpv->xpv_cur && *sv->sv_u.sv_pv != '0')))
8032 return SvIVX(sv) != 0;
8035 return SvNVX(sv) != 0.0;
8037 return sv_2bool(sv);
8045 A private implementation of the C<SvIVx> macro for compilers which can't
8046 cope with complex macro expressions. Always use the macro instead.
8052 Perl_sv_iv(pTHX_ register SV *sv)
8056 return (IV)SvUVX(sv);
8065 A private implementation of the C<SvUVx> macro for compilers which can't
8066 cope with complex macro expressions. Always use the macro instead.
8072 Perl_sv_uv(pTHX_ register SV *sv)
8077 return (UV)SvIVX(sv);
8085 A private implementation of the C<SvNVx> macro for compilers which can't
8086 cope with complex macro expressions. Always use the macro instead.
8092 Perl_sv_nv(pTHX_ register SV *sv)
8099 /* sv_pv() is now a macro using SvPV_nolen();
8100 * this function provided for binary compatibility only
8104 Perl_sv_pv(pTHX_ SV *sv)
8111 return sv_2pv(sv, &n_a);
8117 Use the C<SvPV_nolen> macro instead
8121 A private implementation of the C<SvPV> macro for compilers which can't
8122 cope with complex macro expressions. Always use the macro instead.
8128 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8134 return sv_2pv(sv, lp);
8139 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8145 return sv_2pv_flags(sv, lp, 0);
8148 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8149 * this function provided for binary compatibility only
8153 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8155 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8159 =for apidoc sv_pvn_force
8161 Get a sensible string out of the SV somehow.
8162 A private implementation of the C<SvPV_force> macro for compilers which
8163 can't cope with complex macro expressions. Always use the macro instead.
8165 =for apidoc sv_pvn_force_flags
8167 Get a sensible string out of the SV somehow.
8168 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8169 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8170 implemented in terms of this function.
8171 You normally want to use the various wrapper macros instead: see
8172 C<SvPV_force> and C<SvPV_force_nomg>
8178 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8181 if (SvTHINKFIRST(sv) && !SvROK(sv))
8182 sv_force_normal_flags(sv, 0);
8189 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8190 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8194 s = sv_2pv_flags(sv, lp, flags);
8195 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8196 const STRLEN len = *lp;
8200 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8201 SvGROW(sv, len + 1);
8202 Move(s,SvPVX(sv),len,char);
8207 SvPOK_on(sv); /* validate pointer */
8209 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8210 PTR2UV(sv),SvPVX(sv)));
8216 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8217 * this function provided for binary compatibility only
8221 Perl_sv_pvbyte(pTHX_ SV *sv)
8223 sv_utf8_downgrade(sv,0);
8228 =for apidoc sv_pvbyte
8230 Use C<SvPVbyte_nolen> instead.
8232 =for apidoc sv_pvbyten
8234 A private implementation of the C<SvPVbyte> macro for compilers
8235 which can't cope with complex macro expressions. Always use the macro
8242 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8244 sv_utf8_downgrade(sv,0);
8245 return sv_pvn(sv,lp);
8249 =for apidoc sv_pvbyten_force
8251 A private implementation of the C<SvPVbytex_force> macro for compilers
8252 which can't cope with complex macro expressions. Always use the macro
8259 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8261 sv_pvn_force(sv,lp);
8262 sv_utf8_downgrade(sv,0);
8267 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8268 * this function provided for binary compatibility only
8272 Perl_sv_pvutf8(pTHX_ SV *sv)
8274 sv_utf8_upgrade(sv);
8279 =for apidoc sv_pvutf8
8281 Use the C<SvPVutf8_nolen> macro instead
8283 =for apidoc sv_pvutf8n
8285 A private implementation of the C<SvPVutf8> macro for compilers
8286 which can't cope with complex macro expressions. Always use the macro
8293 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8295 sv_utf8_upgrade(sv);
8296 return sv_pvn(sv,lp);
8300 =for apidoc sv_pvutf8n_force
8302 A private implementation of the C<SvPVutf8_force> macro for compilers
8303 which can't cope with complex macro expressions. Always use the macro
8310 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8312 sv_pvn_force(sv,lp);
8313 sv_utf8_upgrade(sv);
8319 =for apidoc sv_reftype
8321 Returns a string describing what the SV is a reference to.
8327 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8329 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8330 inside return suggests a const propagation bug in g++. */
8331 if (ob && SvOBJECT(sv)) {
8332 char *name = HvNAME_get(SvSTASH(sv));
8333 return name ? name : (char *) "__ANON__";
8336 switch (SvTYPE(sv)) {
8353 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8354 /* tied lvalues should appear to be
8355 * scalars for backwards compatitbility */
8356 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8357 ? "SCALAR" : "LVALUE");
8358 case SVt_PVAV: return "ARRAY";
8359 case SVt_PVHV: return "HASH";
8360 case SVt_PVCV: return "CODE";
8361 case SVt_PVGV: return "GLOB";
8362 case SVt_PVFM: return "FORMAT";
8363 case SVt_PVIO: return "IO";
8364 default: return "UNKNOWN";
8370 =for apidoc sv_isobject
8372 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8373 object. If the SV is not an RV, or if the object is not blessed, then this
8380 Perl_sv_isobject(pTHX_ SV *sv)
8397 Returns a boolean indicating whether the SV is blessed into the specified
8398 class. This does not check for subtypes; use C<sv_derived_from> to verify
8399 an inheritance relationship.
8405 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8417 hvname = HvNAME_get(SvSTASH(sv));
8421 return strEQ(hvname, name);
8427 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8428 it will be upgraded to one. If C<classname> is non-null then the new SV will
8429 be blessed in the specified package. The new SV is returned and its
8430 reference count is 1.
8436 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8442 SV_CHECK_THINKFIRST_COW_DROP(rv);
8445 if (SvTYPE(rv) >= SVt_PVMG) {
8446 const U32 refcnt = SvREFCNT(rv);
8450 SvREFCNT(rv) = refcnt;
8453 if (SvTYPE(rv) < SVt_RV)
8454 sv_upgrade(rv, SVt_RV);
8455 else if (SvTYPE(rv) > SVt_RV) {
8466 HV* stash = gv_stashpv(classname, TRUE);
8467 (void)sv_bless(rv, stash);
8473 =for apidoc sv_setref_pv
8475 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8476 argument will be upgraded to an RV. That RV will be modified to point to
8477 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8478 into the SV. The C<classname> argument indicates the package for the
8479 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8480 will have a reference count of 1, and the RV will be returned.
8482 Do not use with other Perl types such as HV, AV, SV, CV, because those
8483 objects will become corrupted by the pointer copy process.
8485 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8491 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8494 sv_setsv(rv, &PL_sv_undef);
8498 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8503 =for apidoc sv_setref_iv
8505 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8506 argument will be upgraded to an RV. That RV will be modified to point to
8507 the new SV. The C<classname> argument indicates the package for the
8508 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8509 will have a reference count of 1, and the RV will be returned.
8515 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8517 sv_setiv(newSVrv(rv,classname), iv);
8522 =for apidoc sv_setref_uv
8524 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8525 argument will be upgraded to an RV. That RV will be modified to point to
8526 the new SV. The C<classname> argument indicates the package for the
8527 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8528 will have a reference count of 1, and the RV will be returned.
8534 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8536 sv_setuv(newSVrv(rv,classname), uv);
8541 =for apidoc sv_setref_nv
8543 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8544 argument will be upgraded to an RV. That RV will be modified to point to
8545 the new SV. The C<classname> argument indicates the package for the
8546 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8547 will have a reference count of 1, and the RV will be returned.
8553 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8555 sv_setnv(newSVrv(rv,classname), nv);
8560 =for apidoc sv_setref_pvn
8562 Copies a string into a new SV, optionally blessing the SV. The length of the
8563 string must be specified with C<n>. The C<rv> argument will be upgraded to
8564 an RV. That RV will be modified to point to the new SV. The C<classname>
8565 argument indicates the package for the blessing. Set C<classname> to
8566 C<Nullch> to avoid the blessing. The new SV will have a reference count
8567 of 1, and the RV will be returned.
8569 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8575 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8577 sv_setpvn(newSVrv(rv,classname), pv, n);
8582 =for apidoc sv_bless
8584 Blesses an SV into a specified package. The SV must be an RV. The package
8585 must be designated by its stash (see C<gv_stashpv()>). The reference count
8586 of the SV is unaffected.
8592 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8596 Perl_croak(aTHX_ "Can't bless non-reference value");
8598 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8599 if (SvREADONLY(tmpRef))
8600 Perl_croak(aTHX_ PL_no_modify);
8601 if (SvOBJECT(tmpRef)) {
8602 if (SvTYPE(tmpRef) != SVt_PVIO)
8604 SvREFCNT_dec(SvSTASH(tmpRef));
8607 SvOBJECT_on(tmpRef);
8608 if (SvTYPE(tmpRef) != SVt_PVIO)
8610 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8611 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8618 if(SvSMAGICAL(tmpRef))
8619 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8627 /* Downgrades a PVGV to a PVMG.
8631 S_sv_unglob(pTHX_ SV *sv)
8635 assert(SvTYPE(sv) == SVt_PVGV);
8640 SvREFCNT_dec(GvSTASH(sv));
8641 GvSTASH(sv) = Nullhv;
8643 sv_unmagic(sv, PERL_MAGIC_glob);
8644 Safefree(GvNAME(sv));
8647 /* need to keep SvANY(sv) in the right arena */
8648 xpvmg = new_XPVMG();
8649 StructCopy(SvANY(sv), xpvmg, XPVMG);
8650 del_XPVGV(SvANY(sv));
8653 SvFLAGS(sv) &= ~SVTYPEMASK;
8654 SvFLAGS(sv) |= SVt_PVMG;
8658 =for apidoc sv_unref_flags
8660 Unsets the RV status of the SV, and decrements the reference count of
8661 whatever was being referenced by the RV. This can almost be thought of
8662 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8663 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8664 (otherwise the decrementing is conditional on the reference count being
8665 different from one or the reference being a readonly SV).
8672 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8676 if (SvWEAKREF(sv)) {
8684 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8685 assigned to as BEGIN {$a = \"Foo"} will fail. */
8686 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8688 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8689 sv_2mortal(rv); /* Schedule for freeing later */
8693 =for apidoc sv_unref
8695 Unsets the RV status of the SV, and decrements the reference count of
8696 whatever was being referenced by the RV. This can almost be thought of
8697 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8698 being zero. See C<SvROK_off>.
8704 Perl_sv_unref(pTHX_ SV *sv)
8706 sv_unref_flags(sv, 0);
8710 =for apidoc sv_taint
8712 Taint an SV. Use C<SvTAINTED_on> instead.
8717 Perl_sv_taint(pTHX_ SV *sv)
8719 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8723 =for apidoc sv_untaint
8725 Untaint an SV. Use C<SvTAINTED_off> instead.
8730 Perl_sv_untaint(pTHX_ SV *sv)
8732 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8733 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8740 =for apidoc sv_tainted
8742 Test an SV for taintedness. Use C<SvTAINTED> instead.
8747 Perl_sv_tainted(pTHX_ SV *sv)
8749 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8750 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8751 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8758 =for apidoc sv_setpviv
8760 Copies an integer into the given SV, also updating its string value.
8761 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8767 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8769 char buf[TYPE_CHARS(UV)];
8771 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8773 sv_setpvn(sv, ptr, ebuf - ptr);
8777 =for apidoc sv_setpviv_mg
8779 Like C<sv_setpviv>, but also handles 'set' magic.
8785 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8787 char buf[TYPE_CHARS(UV)];
8789 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8791 sv_setpvn(sv, ptr, ebuf - ptr);
8795 #if defined(PERL_IMPLICIT_CONTEXT)
8797 /* pTHX_ magic can't cope with varargs, so this is a no-context
8798 * version of the main function, (which may itself be aliased to us).
8799 * Don't access this version directly.
8803 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8807 va_start(args, pat);
8808 sv_vsetpvf(sv, pat, &args);
8812 /* pTHX_ magic can't cope with varargs, so this is a no-context
8813 * version of the main function, (which may itself be aliased to us).
8814 * Don't access this version directly.
8818 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8822 va_start(args, pat);
8823 sv_vsetpvf_mg(sv, pat, &args);
8829 =for apidoc sv_setpvf
8831 Works like C<sv_catpvf> but copies the text into the SV instead of
8832 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8838 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8841 va_start(args, pat);
8842 sv_vsetpvf(sv, pat, &args);
8847 =for apidoc sv_vsetpvf
8849 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8850 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8852 Usually used via its frontend C<sv_setpvf>.
8858 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8860 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8864 =for apidoc sv_setpvf_mg
8866 Like C<sv_setpvf>, but also handles 'set' magic.
8872 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8875 va_start(args, pat);
8876 sv_vsetpvf_mg(sv, pat, &args);
8881 =for apidoc sv_vsetpvf_mg
8883 Like C<sv_vsetpvf>, but also handles 'set' magic.
8885 Usually used via its frontend C<sv_setpvf_mg>.
8891 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8893 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8897 #if defined(PERL_IMPLICIT_CONTEXT)
8899 /* pTHX_ magic can't cope with varargs, so this is a no-context
8900 * version of the main function, (which may itself be aliased to us).
8901 * Don't access this version directly.
8905 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8909 va_start(args, pat);
8910 sv_vcatpvf(sv, pat, &args);
8914 /* pTHX_ magic can't cope with varargs, so this is a no-context
8915 * version of the main function, (which may itself be aliased to us).
8916 * Don't access this version directly.
8920 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8924 va_start(args, pat);
8925 sv_vcatpvf_mg(sv, pat, &args);
8931 =for apidoc sv_catpvf
8933 Processes its arguments like C<sprintf> and appends the formatted
8934 output to an SV. If the appended data contains "wide" characters
8935 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8936 and characters >255 formatted with %c), the original SV might get
8937 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8938 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8939 valid UTF-8; if the original SV was bytes, the pattern should be too.
8944 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8947 va_start(args, pat);
8948 sv_vcatpvf(sv, pat, &args);
8953 =for apidoc sv_vcatpvf
8955 Processes its arguments like C<vsprintf> and appends the formatted output
8956 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8958 Usually used via its frontend C<sv_catpvf>.
8964 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8966 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8970 =for apidoc sv_catpvf_mg
8972 Like C<sv_catpvf>, but also handles 'set' magic.
8978 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8981 va_start(args, pat);
8982 sv_vcatpvf_mg(sv, pat, &args);
8987 =for apidoc sv_vcatpvf_mg
8989 Like C<sv_vcatpvf>, but also handles 'set' magic.
8991 Usually used via its frontend C<sv_catpvf_mg>.
8997 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8999 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9004 =for apidoc sv_vsetpvfn
9006 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9009 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9015 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9017 sv_setpvn(sv, "", 0);
9018 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9021 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9024 S_expect_number(pTHX_ char** pattern)
9027 switch (**pattern) {
9028 case '1': case '2': case '3':
9029 case '4': case '5': case '6':
9030 case '7': case '8': case '9':
9031 while (isDIGIT(**pattern))
9032 var = var * 10 + (*(*pattern)++ - '0');
9036 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9039 F0convert(NV nv, char *endbuf, STRLEN *len)
9041 const int neg = nv < 0;
9050 if (uv & 1 && uv == nv)
9051 uv--; /* Round to even */
9053 const unsigned dig = uv % 10;
9066 =for apidoc sv_vcatpvfn
9068 Processes its arguments like C<vsprintf> and appends the formatted output
9069 to an SV. Uses an array of SVs if the C style variable argument list is
9070 missing (NULL). When running with taint checks enabled, indicates via
9071 C<maybe_tainted> if results are untrustworthy (often due to the use of
9074 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9079 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9082 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9089 static const char nullstr[] = "(null)";
9091 bool has_utf8; /* has the result utf8? */
9092 bool pat_utf8; /* the pattern is in utf8? */
9094 /* Times 4: a decimal digit takes more than 3 binary digits.
9095 * NV_DIG: mantissa takes than many decimal digits.
9096 * Plus 32: Playing safe. */
9097 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9098 /* large enough for "%#.#f" --chip */
9099 /* what about long double NVs? --jhi */
9101 has_utf8 = pat_utf8 = DO_UTF8(sv);
9103 /* no matter what, this is a string now */
9104 (void)SvPV_force(sv, origlen);
9106 /* special-case "", "%s", and "%-p" (SVf) */
9109 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
9111 const char *s = va_arg(*args, char*);
9112 sv_catpv(sv, s ? s : nullstr);
9114 else if (svix < svmax) {
9115 sv_catsv(sv, *svargs);
9116 if (DO_UTF8(*svargs))
9121 if (patlen == 3 && pat[0] == '%' &&
9122 pat[1] == '-' && pat[2] == 'p') {
9124 argsv = va_arg(*args, SV*);
9125 sv_catsv(sv, argsv);
9132 #ifndef USE_LONG_DOUBLE
9133 /* special-case "%.<number>[gf]" */
9134 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9135 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9136 unsigned digits = 0;
9140 while (*pp >= '0' && *pp <= '9')
9141 digits = 10 * digits + (*pp++ - '0');
9142 if (pp - pat == (int)patlen - 1) {
9146 nv = (NV)va_arg(*args, double);
9147 else if (svix < svmax)
9152 /* Add check for digits != 0 because it seems that some
9153 gconverts are buggy in this case, and we don't yet have
9154 a Configure test for this. */
9155 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9156 /* 0, point, slack */
9157 Gconvert(nv, (int)digits, 0, ebuf);
9159 if (*ebuf) /* May return an empty string for digits==0 */
9162 } else if (!digits) {
9165 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9166 sv_catpvn(sv, p, l);
9172 #endif /* !USE_LONG_DOUBLE */
9174 if (!args && svix < svmax && DO_UTF8(*svargs))
9177 patend = (char*)pat + patlen;
9178 for (p = (char*)pat; p < patend; p = q) {
9181 bool vectorize = FALSE;
9182 bool vectorarg = FALSE;
9183 bool vec_utf8 = FALSE;
9189 bool has_precis = FALSE;
9192 bool is_utf8 = FALSE; /* is this item utf8? */
9193 #ifdef HAS_LDBL_SPRINTF_BUG
9194 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9195 with sfio - Allen <allens@cpan.org> */
9196 bool fix_ldbl_sprintf_bug = FALSE;
9200 U8 utf8buf[UTF8_MAXBYTES+1];
9201 STRLEN esignlen = 0;
9203 char *eptr = Nullch;
9206 U8 *vecstr = Null(U8*);
9213 /* we need a long double target in case HAS_LONG_DOUBLE but
9216 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9224 const char *dotstr = ".";
9225 STRLEN dotstrlen = 1;
9226 I32 efix = 0; /* explicit format parameter index */
9227 I32 ewix = 0; /* explicit width index */
9228 I32 epix = 0; /* explicit precision index */
9229 I32 evix = 0; /* explicit vector index */
9230 bool asterisk = FALSE;
9232 /* echo everything up to the next format specification */
9233 for (q = p; q < patend && *q != '%'; ++q) ;
9235 if (has_utf8 && !pat_utf8)
9236 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9238 sv_catpvn(sv, p, q - p);
9245 We allow format specification elements in this order:
9246 \d+\$ explicit format parameter index
9248 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9249 0 flag (as above): repeated to allow "v02"
9250 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9251 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9253 [%bcdefginopsux_DFOUX] format (mandatory)
9255 if (EXPECT_NUMBER(q, width)) {
9296 if (EXPECT_NUMBER(q, ewix))
9305 if ((vectorarg = asterisk)) {
9317 EXPECT_NUMBER(q, width);
9322 vecsv = va_arg(*args, SV*);
9324 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9325 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9326 dotstr = SvPVx(vecsv, dotstrlen);
9331 vecsv = va_arg(*args, SV*);
9332 vecstr = (U8*)SvPVx(vecsv,veclen);
9333 vec_utf8 = DO_UTF8(vecsv);
9335 else if (efix ? efix <= svmax : svix < svmax) {
9336 vecsv = svargs[efix ? efix-1 : svix++];
9337 vecstr = (U8*)SvPVx(vecsv,veclen);
9338 vec_utf8 = DO_UTF8(vecsv);
9339 /* if this is a version object, we need to return the
9340 * stringified representation (which the SvPVX has
9341 * already done for us), but not vectorize the args
9343 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9345 q++; /* skip past the rest of the %vd format */
9346 eptr = (char *) vecstr;
9347 elen = strlen(eptr);
9360 i = va_arg(*args, int);
9362 i = (ewix ? ewix <= svmax : svix < svmax) ?
9363 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9365 width = (i < 0) ? -i : i;
9375 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9377 /* XXX: todo, support specified precision parameter */
9381 i = va_arg(*args, int);
9383 i = (ewix ? ewix <= svmax : svix < svmax)
9384 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9385 precis = (i < 0) ? 0 : i;
9390 precis = precis * 10 + (*q++ - '0');
9399 case 'I': /* Ix, I32x, and I64x */
9401 if (q[1] == '6' && q[2] == '4') {
9407 if (q[1] == '3' && q[2] == '2') {
9417 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9428 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9429 if (*(q + 1) == 'l') { /* lld, llf */
9454 argsv = (efix ? efix <= svmax : svix < svmax) ?
9455 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9462 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9464 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9466 eptr = (char*)utf8buf;
9467 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9478 if (args && !vectorize) {
9479 eptr = va_arg(*args, char*);
9481 #ifdef MACOS_TRADITIONAL
9482 /* On MacOS, %#s format is used for Pascal strings */
9487 elen = strlen(eptr);
9489 eptr = (char *)nullstr;
9490 elen = sizeof nullstr - 1;
9494 eptr = SvPVx(argsv, elen);
9495 if (DO_UTF8(argsv)) {
9496 if (has_precis && precis < elen) {
9498 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9501 if (width) { /* fudge width (can't fudge elen) */
9502 width += elen - sv_len_utf8(argsv);
9510 if (has_precis && elen > precis)
9517 if (left && args) { /* SVf */
9526 argsv = va_arg(*args, SV*);
9527 eptr = SvPVx(argsv, elen);
9532 if (alt || vectorize)
9534 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9552 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9561 esignbuf[esignlen++] = plus;
9565 case 'h': iv = (short)va_arg(*args, int); break;
9566 case 'l': iv = va_arg(*args, long); break;
9567 case 'V': iv = va_arg(*args, IV); break;
9568 default: iv = va_arg(*args, int); break;
9570 case 'q': iv = va_arg(*args, Quad_t); break;
9575 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9577 case 'h': iv = (short)tiv; break;
9578 case 'l': iv = (long)tiv; break;
9580 default: iv = tiv; break;
9582 case 'q': iv = (Quad_t)tiv; break;
9586 if ( !vectorize ) /* we already set uv above */
9591 esignbuf[esignlen++] = plus;
9595 esignbuf[esignlen++] = '-';
9638 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9649 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9650 case 'l': uv = va_arg(*args, unsigned long); break;
9651 case 'V': uv = va_arg(*args, UV); break;
9652 default: uv = va_arg(*args, unsigned); break;
9654 case 'q': uv = va_arg(*args, Uquad_t); break;
9659 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9661 case 'h': uv = (unsigned short)tuv; break;
9662 case 'l': uv = (unsigned long)tuv; break;
9664 default: uv = tuv; break;
9666 case 'q': uv = (Uquad_t)tuv; break;
9672 eptr = ebuf + sizeof ebuf;
9678 p = (char*)((c == 'X')
9679 ? "0123456789ABCDEF" : "0123456789abcdef");
9685 esignbuf[esignlen++] = '0';
9686 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9692 *--eptr = '0' + dig;
9694 if (alt && *eptr != '0')
9700 *--eptr = '0' + dig;
9703 esignbuf[esignlen++] = '0';
9704 esignbuf[esignlen++] = 'b';
9707 default: /* it had better be ten or less */
9710 *--eptr = '0' + dig;
9711 } while (uv /= base);
9714 elen = (ebuf + sizeof ebuf) - eptr;
9717 zeros = precis - elen;
9718 else if (precis == 0 && elen == 1 && *eptr == '0')
9723 /* FLOATING POINT */
9726 c = 'f'; /* maybe %F isn't supported here */
9732 /* This is evil, but floating point is even more evil */
9734 /* for SV-style calling, we can only get NV
9735 for C-style calling, we assume %f is double;
9736 for simplicity we allow any of %Lf, %llf, %qf for long double
9740 #if defined(USE_LONG_DOUBLE)
9744 /* [perl #20339] - we should accept and ignore %lf rather than die */
9748 #if defined(USE_LONG_DOUBLE)
9749 intsize = args ? 0 : 'q';
9753 #if defined(HAS_LONG_DOUBLE)
9762 /* now we need (long double) if intsize == 'q', else (double) */
9763 nv = (args && !vectorize) ?
9764 #if LONG_DOUBLESIZE > DOUBLESIZE
9766 va_arg(*args, long double) :
9767 va_arg(*args, double)
9769 va_arg(*args, double)
9775 if (c != 'e' && c != 'E') {
9777 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9778 will cast our (long double) to (double) */
9779 (void)Perl_frexp(nv, &i);
9780 if (i == PERL_INT_MIN)
9781 Perl_die(aTHX_ "panic: frexp");
9783 need = BIT_DIGITS(i);
9785 need += has_precis ? precis : 6; /* known default */
9790 #ifdef HAS_LDBL_SPRINTF_BUG
9791 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9792 with sfio - Allen <allens@cpan.org> */
9795 # define MY_DBL_MAX DBL_MAX
9796 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9797 # if DOUBLESIZE >= 8
9798 # define MY_DBL_MAX 1.7976931348623157E+308L
9800 # define MY_DBL_MAX 3.40282347E+38L
9804 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9805 # define MY_DBL_MAX_BUG 1L
9807 # define MY_DBL_MAX_BUG MY_DBL_MAX
9811 # define MY_DBL_MIN DBL_MIN
9812 # else /* XXX guessing! -Allen */
9813 # if DOUBLESIZE >= 8
9814 # define MY_DBL_MIN 2.2250738585072014E-308L
9816 # define MY_DBL_MIN 1.17549435E-38L
9820 if ((intsize == 'q') && (c == 'f') &&
9821 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9823 /* it's going to be short enough that
9824 * long double precision is not needed */
9826 if ((nv <= 0L) && (nv >= -0L))
9827 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9829 /* would use Perl_fp_class as a double-check but not
9830 * functional on IRIX - see perl.h comments */
9832 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9833 /* It's within the range that a double can represent */
9834 #if defined(DBL_MAX) && !defined(DBL_MIN)
9835 if ((nv >= ((long double)1/DBL_MAX)) ||
9836 (nv <= (-(long double)1/DBL_MAX)))
9838 fix_ldbl_sprintf_bug = TRUE;
9841 if (fix_ldbl_sprintf_bug == TRUE) {
9851 # undef MY_DBL_MAX_BUG
9854 #endif /* HAS_LDBL_SPRINTF_BUG */
9856 need += 20; /* fudge factor */
9857 if (PL_efloatsize < need) {
9858 Safefree(PL_efloatbuf);
9859 PL_efloatsize = need + 20; /* more fudge */
9860 New(906, PL_efloatbuf, PL_efloatsize, char);
9861 PL_efloatbuf[0] = '\0';
9864 if ( !(width || left || plus || alt) && fill != '0'
9865 && has_precis && intsize != 'q' ) { /* Shortcuts */
9866 /* See earlier comment about buggy Gconvert when digits,
9868 if ( c == 'g' && precis) {
9869 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9870 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9871 goto float_converted;
9872 } else if ( c == 'f' && !precis) {
9873 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9877 eptr = ebuf + sizeof ebuf;
9880 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9881 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9882 if (intsize == 'q') {
9883 /* Copy the one or more characters in a long double
9884 * format before the 'base' ([efgEFG]) character to
9885 * the format string. */
9886 static char const prifldbl[] = PERL_PRIfldbl;
9887 char const *p = prifldbl + sizeof(prifldbl) - 3;
9888 while (p >= prifldbl) { *--eptr = *p--; }
9893 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9898 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9910 /* No taint. Otherwise we are in the strange situation
9911 * where printf() taints but print($float) doesn't.
9913 #if defined(HAS_LONG_DOUBLE)
9915 (void)sprintf(PL_efloatbuf, eptr, nv);
9917 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9919 (void)sprintf(PL_efloatbuf, eptr, nv);
9922 eptr = PL_efloatbuf;
9923 elen = strlen(PL_efloatbuf);
9929 i = SvCUR(sv) - origlen;
9930 if (args && !vectorize) {
9932 case 'h': *(va_arg(*args, short*)) = i; break;
9933 default: *(va_arg(*args, int*)) = i; break;
9934 case 'l': *(va_arg(*args, long*)) = i; break;
9935 case 'V': *(va_arg(*args, IV*)) = i; break;
9937 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9942 sv_setuv_mg(argsv, (UV)i);
9944 continue; /* not "break" */
9950 if (!args && ckWARN(WARN_PRINTF) &&
9951 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9952 SV *msg = sv_newmortal();
9953 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9954 (PL_op->op_type == OP_PRTF) ? "" : "s");
9957 Perl_sv_catpvf(aTHX_ msg,
9958 "\"%%%c\"", c & 0xFF);
9960 Perl_sv_catpvf(aTHX_ msg,
9961 "\"%%\\%03"UVof"\"",
9964 sv_catpv(msg, "end of string");
9965 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9968 /* output mangled stuff ... */
9974 /* ... right here, because formatting flags should not apply */
9975 SvGROW(sv, SvCUR(sv) + elen + 1);
9977 Copy(eptr, p, elen, char);
9980 SvCUR_set(sv, p - SvPVX(sv));
9982 continue; /* not "break" */
9985 /* calculate width before utf8_upgrade changes it */
9986 have = esignlen + zeros + elen;
9988 if (is_utf8 != has_utf8) {
9991 sv_utf8_upgrade(sv);
9994 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9995 sv_utf8_upgrade(nsv);
9999 SvGROW(sv, SvCUR(sv) + elen + 1);
10004 need = (have > width ? have : width);
10007 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10009 if (esignlen && fill == '0') {
10010 for (i = 0; i < (int)esignlen; i++)
10011 *p++ = esignbuf[i];
10013 if (gap && !left) {
10014 memset(p, fill, gap);
10017 if (esignlen && fill != '0') {
10018 for (i = 0; i < (int)esignlen; i++)
10019 *p++ = esignbuf[i];
10022 for (i = zeros; i; i--)
10026 Copy(eptr, p, elen, char);
10030 memset(p, ' ', gap);
10035 Copy(dotstr, p, dotstrlen, char);
10039 vectorize = FALSE; /* done iterating over vecstr */
10046 SvCUR_set(sv, p - SvPVX(sv));
10054 /* =========================================================================
10056 =head1 Cloning an interpreter
10058 All the macros and functions in this section are for the private use of
10059 the main function, perl_clone().
10061 The foo_dup() functions make an exact copy of an existing foo thinngy.
10062 During the course of a cloning, a hash table is used to map old addresses
10063 to new addresses. The table is created and manipulated with the
10064 ptr_table_* functions.
10068 ============================================================================*/
10071 #if defined(USE_ITHREADS)
10073 #ifndef GpREFCNT_inc
10074 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10078 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10079 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10080 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10081 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10082 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10083 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10084 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10085 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10086 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10087 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10088 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10089 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10090 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10093 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10094 regcomp.c. AMS 20010712 */
10097 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10102 struct reg_substr_datum *s;
10105 return (REGEXP *)NULL;
10107 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10110 len = r->offsets[0];
10111 npar = r->nparens+1;
10113 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10114 Copy(r->program, ret->program, len+1, regnode);
10116 New(0, ret->startp, npar, I32);
10117 Copy(r->startp, ret->startp, npar, I32);
10118 New(0, ret->endp, npar, I32);
10119 Copy(r->startp, ret->startp, npar, I32);
10121 New(0, ret->substrs, 1, struct reg_substr_data);
10122 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10123 s->min_offset = r->substrs->data[i].min_offset;
10124 s->max_offset = r->substrs->data[i].max_offset;
10125 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10126 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10129 ret->regstclass = NULL;
10131 struct reg_data *d;
10132 const int count = r->data->count;
10134 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10135 char, struct reg_data);
10136 New(0, d->what, count, U8);
10139 for (i = 0; i < count; i++) {
10140 d->what[i] = r->data->what[i];
10141 switch (d->what[i]) {
10142 /* legal options are one of: sfpont
10143 see also regcomp.h and pregfree() */
10145 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10148 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10151 /* This is cheating. */
10152 New(0, d->data[i], 1, struct regnode_charclass_class);
10153 StructCopy(r->data->data[i], d->data[i],
10154 struct regnode_charclass_class);
10155 ret->regstclass = (regnode*)d->data[i];
10158 /* Compiled op trees are readonly, and can thus be
10159 shared without duplication. */
10161 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10165 d->data[i] = r->data->data[i];
10168 d->data[i] = r->data->data[i];
10170 ((reg_trie_data*)d->data[i])->refcount++;
10174 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10183 New(0, ret->offsets, 2*len+1, U32);
10184 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10186 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10187 ret->refcnt = r->refcnt;
10188 ret->minlen = r->minlen;
10189 ret->prelen = r->prelen;
10190 ret->nparens = r->nparens;
10191 ret->lastparen = r->lastparen;
10192 ret->lastcloseparen = r->lastcloseparen;
10193 ret->reganch = r->reganch;
10195 ret->sublen = r->sublen;
10197 if (RX_MATCH_COPIED(ret))
10198 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10200 ret->subbeg = Nullch;
10201 #ifdef PERL_COPY_ON_WRITE
10202 ret->saved_copy = Nullsv;
10205 ptr_table_store(PL_ptr_table, r, ret);
10209 /* duplicate a file handle */
10212 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10218 return (PerlIO*)NULL;
10220 /* look for it in the table first */
10221 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10225 /* create anew and remember what it is */
10226 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10227 ptr_table_store(PL_ptr_table, fp, ret);
10231 /* duplicate a directory handle */
10234 Perl_dirp_dup(pTHX_ DIR *dp)
10242 /* duplicate a typeglob */
10245 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10250 /* look for it in the table first */
10251 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10255 /* create anew and remember what it is */
10256 Newz(0, ret, 1, GP);
10257 ptr_table_store(PL_ptr_table, gp, ret);
10260 ret->gp_refcnt = 0; /* must be before any other dups! */
10261 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10262 ret->gp_io = io_dup_inc(gp->gp_io, param);
10263 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10264 ret->gp_av = av_dup_inc(gp->gp_av, param);
10265 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10266 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10267 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10268 ret->gp_cvgen = gp->gp_cvgen;
10269 ret->gp_flags = gp->gp_flags;
10270 ret->gp_line = gp->gp_line;
10271 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10275 /* duplicate a chain of magic */
10278 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10280 MAGIC *mgprev = (MAGIC*)NULL;
10283 return (MAGIC*)NULL;
10284 /* look for it in the table first */
10285 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10289 for (; mg; mg = mg->mg_moremagic) {
10291 Newz(0, nmg, 1, MAGIC);
10293 mgprev->mg_moremagic = nmg;
10296 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10297 nmg->mg_private = mg->mg_private;
10298 nmg->mg_type = mg->mg_type;
10299 nmg->mg_flags = mg->mg_flags;
10300 if (mg->mg_type == PERL_MAGIC_qr) {
10301 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10303 else if(mg->mg_type == PERL_MAGIC_backref) {
10304 const AV * const av = (AV*) mg->mg_obj;
10307 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10309 for (i = AvFILLp(av); i >= 0; i--) {
10310 if (!svp[i]) continue;
10311 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10314 else if (mg->mg_type == PERL_MAGIC_symtab) {
10315 nmg->mg_obj = mg->mg_obj;
10318 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10319 ? sv_dup_inc(mg->mg_obj, param)
10320 : sv_dup(mg->mg_obj, param);
10322 nmg->mg_len = mg->mg_len;
10323 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10324 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10325 if (mg->mg_len > 0) {
10326 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10327 if (mg->mg_type == PERL_MAGIC_overload_table &&
10328 AMT_AMAGIC((AMT*)mg->mg_ptr))
10330 AMT *amtp = (AMT*)mg->mg_ptr;
10331 AMT *namtp = (AMT*)nmg->mg_ptr;
10333 for (i = 1; i < NofAMmeth; i++) {
10334 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10338 else if (mg->mg_len == HEf_SVKEY)
10339 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10341 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10342 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10349 /* create a new pointer-mapping table */
10352 Perl_ptr_table_new(pTHX)
10355 Newz(0, tbl, 1, PTR_TBL_t);
10356 tbl->tbl_max = 511;
10357 tbl->tbl_items = 0;
10358 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10363 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10365 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10373 struct ptr_tbl_ent* pte;
10374 struct ptr_tbl_ent* pteend;
10375 New(0, pte, PERL_ARENA_SIZE/sizeof(struct ptr_tbl_ent), struct ptr_tbl_ent);
10376 pte->next = PL_pte_arenaroot;
10377 PL_pte_arenaroot = pte;
10379 pteend = &pte[PERL_ARENA_SIZE / sizeof(struct ptr_tbl_ent) - 1];
10380 PL_pte_root = ++pte;
10381 while (pte < pteend) {
10382 pte->next = pte + 1;
10388 STATIC struct ptr_tbl_ent*
10391 struct ptr_tbl_ent* pte;
10395 PL_pte_root = pte->next;
10400 S_del_pte(pTHX_ struct ptr_tbl_ent*p)
10402 p->next = PL_pte_root;
10406 /* map an existing pointer using a table */
10409 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10411 PTR_TBL_ENT_t *tblent;
10412 const UV hash = PTR_TABLE_HASH(sv);
10414 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10415 for (; tblent; tblent = tblent->next) {
10416 if (tblent->oldval == sv)
10417 return tblent->newval;
10419 return (void*)NULL;
10422 /* add a new entry to a pointer-mapping table */
10425 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10427 PTR_TBL_ENT_t *tblent, **otblent;
10428 /* XXX this may be pessimal on platforms where pointers aren't good
10429 * hash values e.g. if they grow faster in the most significant
10431 const UV hash = PTR_TABLE_HASH(oldv);
10435 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10436 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10437 if (tblent->oldval == oldv) {
10438 tblent->newval = newv;
10442 tblent = S_new_pte(aTHX);
10443 tblent->oldval = oldv;
10444 tblent->newval = newv;
10445 tblent->next = *otblent;
10448 if (!empty && tbl->tbl_items > tbl->tbl_max)
10449 ptr_table_split(tbl);
10452 /* double the hash bucket size of an existing ptr table */
10455 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10457 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10458 const UV oldsize = tbl->tbl_max + 1;
10459 UV newsize = oldsize * 2;
10462 Renew(ary, newsize, PTR_TBL_ENT_t*);
10463 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10464 tbl->tbl_max = --newsize;
10465 tbl->tbl_ary = ary;
10466 for (i=0; i < oldsize; i++, ary++) {
10467 PTR_TBL_ENT_t **curentp, **entp, *ent;
10470 curentp = ary + oldsize;
10471 for (entp = ary, ent = *ary; ent; ent = *entp) {
10472 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10474 ent->next = *curentp;
10484 /* remove all the entries from a ptr table */
10487 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10489 register PTR_TBL_ENT_t **array;
10490 register PTR_TBL_ENT_t *entry;
10494 if (!tbl || !tbl->tbl_items) {
10498 array = tbl->tbl_ary;
10500 max = tbl->tbl_max;
10504 PTR_TBL_ENT_t *oentry = entry;
10505 entry = entry->next;
10506 S_del_pte(aTHX_ oentry);
10509 if (++riter > max) {
10512 entry = array[riter];
10516 tbl->tbl_items = 0;
10519 /* clear and free a ptr table */
10522 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10527 ptr_table_clear(tbl);
10528 Safefree(tbl->tbl_ary);
10532 /* attempt to make everything in the typeglob readonly */
10535 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10537 GV *gv = (GV*)sstr;
10538 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10540 if (GvIO(gv) || GvFORM(gv)) {
10541 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10543 else if (!GvCV(gv)) {
10544 GvCV(gv) = (CV*)sv;
10547 /* CvPADLISTs cannot be shared */
10548 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10553 if (!GvUNIQUE(gv)) {
10555 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10556 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10562 * write attempts will die with
10563 * "Modification of a read-only value attempted"
10569 SvREADONLY_on(GvSV(gv));
10573 GvAV(gv) = (AV*)sv;
10576 SvREADONLY_on(GvAV(gv));
10580 GvHV(gv) = (HV*)sv;
10583 SvREADONLY_on(GvHV(gv));
10586 return sstr; /* he_dup() will SvREFCNT_inc() */
10589 /* duplicate an SV of any type (including AV, HV etc) */
10592 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10595 SvRV_set(dstr, SvWEAKREF(sstr)
10596 ? sv_dup(SvRV(sstr), param)
10597 : sv_dup_inc(SvRV(sstr), param));
10600 else if (SvPVX(sstr)) {
10601 /* Has something there */
10603 /* Normal PV - clone whole allocated space */
10604 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10605 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10606 /* Not that normal - actually sstr is copy on write.
10607 But we are a true, independant SV, so: */
10608 SvREADONLY_off(dstr);
10613 /* Special case - not normally malloced for some reason */
10614 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10615 /* A "shared" PV - clone it as unshared string */
10616 if(SvPADTMP(sstr)) {
10617 /* However, some of them live in the pad
10618 and they should not have these flags
10621 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10623 SvUV_set(dstr, SvUVX(sstr));
10626 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10628 SvREADONLY_off(dstr);
10632 /* Some other special case - random pointer */
10633 SvPV_set(dstr, SvPVX(sstr));
10638 /* Copy the Null */
10639 if (SvTYPE(dstr) == SVt_RV)
10640 SvRV_set(dstr, NULL);
10647 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10652 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10654 /* look for it in the table first */
10655 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10659 if(param->flags & CLONEf_JOIN_IN) {
10660 /** We are joining here so we don't want do clone
10661 something that is bad **/
10662 const char *hvname;
10664 if(SvTYPE(sstr) == SVt_PVHV &&
10665 (hvname = HvNAME_get(sstr))) {
10666 /** don't clone stashes if they already exist **/
10667 HV* old_stash = gv_stashpv(hvname,0);
10668 return (SV*) old_stash;
10672 /* create anew and remember what it is */
10675 #ifdef DEBUG_LEAKING_SCALARS
10676 dstr->sv_debug_optype = sstr->sv_debug_optype;
10677 dstr->sv_debug_line = sstr->sv_debug_line;
10678 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10679 dstr->sv_debug_cloned = 1;
10681 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10683 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10687 ptr_table_store(PL_ptr_table, sstr, dstr);
10690 SvFLAGS(dstr) = SvFLAGS(sstr);
10691 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10692 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10695 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10696 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10697 PL_watch_pvx, SvPVX(sstr));
10700 /* don't clone objects whose class has asked us not to */
10701 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10702 SvFLAGS(dstr) &= ~SVTYPEMASK;
10703 SvOBJECT_off(dstr);
10707 switch (SvTYPE(sstr)) {
10709 SvANY(dstr) = NULL;
10712 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.sv_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10713 SvIV_set(dstr, SvIVX(sstr));
10716 SvANY(dstr) = new_XNV();
10717 SvNV_set(dstr, SvNVX(sstr));
10720 SvANY(dstr) = &(dstr->sv_u.sv_rv);
10721 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10724 SvANY(dstr) = new_XPV();
10725 SvCUR_set(dstr, SvCUR(sstr));
10726 SvLEN_set(dstr, SvLEN(sstr));
10727 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10730 SvANY(dstr) = new_XPVIV();
10731 SvCUR_set(dstr, SvCUR(sstr));
10732 SvLEN_set(dstr, SvLEN(sstr));
10733 SvIV_set(dstr, SvIVX(sstr));
10734 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10737 SvANY(dstr) = new_XPVNV();
10738 SvCUR_set(dstr, SvCUR(sstr));
10739 SvLEN_set(dstr, SvLEN(sstr));
10740 SvIV_set(dstr, SvIVX(sstr));
10741 SvNV_set(dstr, SvNVX(sstr));
10742 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10745 SvANY(dstr) = new_XPVMG();
10746 SvCUR_set(dstr, SvCUR(sstr));
10747 SvLEN_set(dstr, SvLEN(sstr));
10748 SvIV_set(dstr, SvIVX(sstr));
10749 SvNV_set(dstr, SvNVX(sstr));
10750 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10751 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10752 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10755 SvANY(dstr) = new_XPVBM();
10756 SvCUR_set(dstr, SvCUR(sstr));
10757 SvLEN_set(dstr, SvLEN(sstr));
10758 SvIV_set(dstr, SvIVX(sstr));
10759 SvNV_set(dstr, SvNVX(sstr));
10760 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10761 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10762 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10763 BmRARE(dstr) = BmRARE(sstr);
10764 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10765 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10768 SvANY(dstr) = new_XPVLV();
10769 SvCUR_set(dstr, SvCUR(sstr));
10770 SvLEN_set(dstr, SvLEN(sstr));
10771 SvIV_set(dstr, SvIVX(sstr));
10772 SvNV_set(dstr, SvNVX(sstr));
10773 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10774 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10775 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10776 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10777 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10778 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10779 LvTARG(dstr) = dstr;
10780 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10781 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10783 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10784 LvTYPE(dstr) = LvTYPE(sstr);
10787 if (GvUNIQUE((GV*)sstr)) {
10789 if ((share = gv_share(sstr, param))) {
10792 ptr_table_store(PL_ptr_table, sstr, dstr);
10794 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10795 HvNAME_get(GvSTASH(share)), GvNAME(share));
10800 SvANY(dstr) = new_XPVGV();
10801 SvCUR_set(dstr, SvCUR(sstr));
10802 SvLEN_set(dstr, SvLEN(sstr));
10803 SvIV_set(dstr, SvIVX(sstr));
10804 SvNV_set(dstr, SvNVX(sstr));
10805 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10806 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10807 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10808 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10809 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10810 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10811 GvFLAGS(dstr) = GvFLAGS(sstr);
10812 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10813 (void)GpREFCNT_inc(GvGP(dstr));
10816 SvANY(dstr) = new_XPVIO();
10817 SvCUR_set(dstr, SvCUR(sstr));
10818 SvLEN_set(dstr, SvLEN(sstr));
10819 SvIV_set(dstr, SvIVX(sstr));
10820 SvNV_set(dstr, SvNVX(sstr));
10821 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10822 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10823 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10824 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10825 if (IoOFP(sstr) == IoIFP(sstr))
10826 IoOFP(dstr) = IoIFP(dstr);
10828 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10829 /* PL_rsfp_filters entries have fake IoDIRP() */
10830 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10831 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10833 IoDIRP(dstr) = IoDIRP(sstr);
10834 IoLINES(dstr) = IoLINES(sstr);
10835 IoPAGE(dstr) = IoPAGE(sstr);
10836 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10837 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10838 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10839 /* I have no idea why fake dirp (rsfps)
10840 should be treaded differently but otherwise
10841 we end up with leaks -- sky*/
10842 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10843 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10844 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10846 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10847 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10848 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10850 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10851 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10852 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10853 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10854 IoTYPE(dstr) = IoTYPE(sstr);
10855 IoFLAGS(dstr) = IoFLAGS(sstr);
10858 SvANY(dstr) = new_XPVAV();
10859 SvCUR_set(dstr, SvCUR(sstr));
10860 SvLEN_set(dstr, SvLEN(sstr));
10861 SvIV_set(dstr, SvIVX(sstr));
10862 SvNV_set(dstr, SvNVX(sstr));
10863 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10864 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10865 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10866 if (AvARRAY((AV*)sstr)) {
10867 SV **dst_ary, **src_ary;
10868 SSize_t items = AvFILLp((AV*)sstr) + 1;
10870 src_ary = AvARRAY((AV*)sstr);
10871 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10872 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10873 SvPV_set(dstr, (char*)dst_ary);
10874 AvALLOC((AV*)dstr) = dst_ary;
10875 if (AvREAL((AV*)sstr)) {
10876 while (items-- > 0)
10877 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10880 while (items-- > 0)
10881 *dst_ary++ = sv_dup(*src_ary++, param);
10883 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10884 while (items-- > 0) {
10885 *dst_ary++ = &PL_sv_undef;
10889 SvPV_set(dstr, Nullch);
10890 AvALLOC((AV*)dstr) = (SV**)NULL;
10894 SvANY(dstr) = new_XPVHV();
10895 SvCUR_set(dstr, SvCUR(sstr));
10896 SvLEN_set(dstr, SvLEN(sstr));
10897 SvIV_set(dstr, SvIVX(sstr));
10898 SvNV_set(dstr, SvNVX(sstr));
10899 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10900 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10902 const char *hvname = HvNAME_get((HV*)sstr);
10903 struct xpvhv_aux *aux = ((XPVHV *)SvANY(sstr))->xhv_aux;
10906 New(0, ((XPVHV *)SvANY(dstr))->xhv_aux, 1, struct xpvhv_aux);
10907 HvRITER_set((HV*)dstr, HvRITER_get((HV*)sstr));
10908 /* FIXME strlen HvNAME */
10909 Perl_hv_name_set(aTHX_ (HV*) dstr, hvname,
10910 hvname ? strlen(hvname) : 0,
10913 ((XPVHV *)SvANY(dstr))->xhv_aux = 0;
10915 if (HvARRAY((HV*)sstr)) {
10917 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10918 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10920 /* FIXME - surely this doesn't need to be zeroed? */
10922 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10923 HvARRAY(dstr) = (HE**)darray;
10924 while (i <= sxhv->xhv_max) {
10926 = he_dup(HvARRAY(sstr)[i],
10927 (bool)!!HvSHAREKEYS(sstr), param);
10930 HvEITER_set(dstr, he_dup(HvEITER_get(sstr),
10931 (bool)!!HvSHAREKEYS(sstr), param));
10934 SvPV_set(dstr, Nullch);
10935 HvEITER_set((HV*)dstr, (HE*)NULL);
10937 /* Record stashes for possible cloning in Perl_clone(). */
10939 av_push(param->stashes, dstr);
10943 SvANY(dstr) = new_XPVFM();
10944 FmLINES(dstr) = FmLINES(sstr);
10948 SvANY(dstr) = new_XPVCV();
10950 SvCUR_set(dstr, SvCUR(sstr));
10951 SvLEN_set(dstr, SvLEN(sstr));
10952 SvIV_set(dstr, SvIVX(sstr));
10953 SvNV_set(dstr, SvNVX(sstr));
10954 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10955 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10956 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10957 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10958 CvSTART(dstr) = CvSTART(sstr);
10960 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10962 CvXSUB(dstr) = CvXSUB(sstr);
10963 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10964 if (CvCONST(sstr)) {
10965 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10966 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10967 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
10969 /* don't dup if copying back - CvGV isn't refcounted, so the
10970 * duped GV may never be freed. A bit of a hack! DAPM */
10971 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10972 Nullgv : gv_dup(CvGV(sstr), param) ;
10973 if (param->flags & CLONEf_COPY_STACKS) {
10974 CvDEPTH(dstr) = CvDEPTH(sstr);
10978 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10979 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10981 CvWEAKOUTSIDE(sstr)
10982 ? cv_dup( CvOUTSIDE(sstr), param)
10983 : cv_dup_inc(CvOUTSIDE(sstr), param);
10984 CvFLAGS(dstr) = CvFLAGS(sstr);
10985 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10988 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10992 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10998 /* duplicate a context */
11001 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11003 PERL_CONTEXT *ncxs;
11006 return (PERL_CONTEXT*)NULL;
11008 /* look for it in the table first */
11009 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11013 /* create anew and remember what it is */
11014 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11015 ptr_table_store(PL_ptr_table, cxs, ncxs);
11018 PERL_CONTEXT *cx = &cxs[ix];
11019 PERL_CONTEXT *ncx = &ncxs[ix];
11020 ncx->cx_type = cx->cx_type;
11021 if (CxTYPE(cx) == CXt_SUBST) {
11022 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11025 ncx->blk_oldsp = cx->blk_oldsp;
11026 ncx->blk_oldcop = cx->blk_oldcop;
11027 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11028 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11029 ncx->blk_oldpm = cx->blk_oldpm;
11030 ncx->blk_gimme = cx->blk_gimme;
11031 switch (CxTYPE(cx)) {
11033 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11034 ? cv_dup_inc(cx->blk_sub.cv, param)
11035 : cv_dup(cx->blk_sub.cv,param));
11036 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11037 ? av_dup_inc(cx->blk_sub.argarray, param)
11039 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11040 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11041 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11042 ncx->blk_sub.lval = cx->blk_sub.lval;
11043 ncx->blk_sub.retop = cx->blk_sub.retop;
11046 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11047 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11048 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11049 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11050 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11051 ncx->blk_eval.retop = cx->blk_eval.retop;
11054 ncx->blk_loop.label = cx->blk_loop.label;
11055 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11056 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11057 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11058 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11059 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11060 ? cx->blk_loop.iterdata
11061 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11062 ncx->blk_loop.oldcomppad
11063 = (PAD*)ptr_table_fetch(PL_ptr_table,
11064 cx->blk_loop.oldcomppad);
11065 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11066 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11067 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11068 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11069 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11072 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11073 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11074 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11075 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11076 ncx->blk_sub.retop = cx->blk_sub.retop;
11088 /* duplicate a stack info structure */
11091 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11096 return (PERL_SI*)NULL;
11098 /* look for it in the table first */
11099 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11103 /* create anew and remember what it is */
11104 Newz(56, nsi, 1, PERL_SI);
11105 ptr_table_store(PL_ptr_table, si, nsi);
11107 nsi->si_stack = av_dup_inc(si->si_stack, param);
11108 nsi->si_cxix = si->si_cxix;
11109 nsi->si_cxmax = si->si_cxmax;
11110 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11111 nsi->si_type = si->si_type;
11112 nsi->si_prev = si_dup(si->si_prev, param);
11113 nsi->si_next = si_dup(si->si_next, param);
11114 nsi->si_markoff = si->si_markoff;
11119 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11120 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11121 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11122 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11123 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11124 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11125 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11126 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11127 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11128 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11129 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11130 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11131 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11132 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11135 #define pv_dup_inc(p) SAVEPV(p)
11136 #define pv_dup(p) SAVEPV(p)
11137 #define svp_dup_inc(p,pp) any_dup(p,pp)
11139 /* map any object to the new equivent - either something in the
11140 * ptr table, or something in the interpreter structure
11144 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11149 return (void*)NULL;
11151 /* look for it in the table first */
11152 ret = ptr_table_fetch(PL_ptr_table, v);
11156 /* see if it is part of the interpreter structure */
11157 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11158 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11166 /* duplicate the save stack */
11169 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11171 ANY *ss = proto_perl->Tsavestack;
11172 I32 ix = proto_perl->Tsavestack_ix;
11173 I32 max = proto_perl->Tsavestack_max;
11186 void (*dptr) (void*);
11187 void (*dxptr) (pTHX_ void*);
11190 Newz(54, nss, max, ANY);
11194 TOPINT(nss,ix) = i;
11196 case SAVEt_ITEM: /* normal string */
11197 sv = (SV*)POPPTR(ss,ix);
11198 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11199 sv = (SV*)POPPTR(ss,ix);
11200 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11202 case SAVEt_SV: /* scalar reference */
11203 sv = (SV*)POPPTR(ss,ix);
11204 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11205 gv = (GV*)POPPTR(ss,ix);
11206 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11208 case SAVEt_GENERIC_PVREF: /* generic char* */
11209 c = (char*)POPPTR(ss,ix);
11210 TOPPTR(nss,ix) = pv_dup(c);
11211 ptr = POPPTR(ss,ix);
11212 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11214 case SAVEt_SHARED_PVREF: /* char* in shared space */
11215 c = (char*)POPPTR(ss,ix);
11216 TOPPTR(nss,ix) = savesharedpv(c);
11217 ptr = POPPTR(ss,ix);
11218 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11220 case SAVEt_GENERIC_SVREF: /* generic sv */
11221 case SAVEt_SVREF: /* scalar reference */
11222 sv = (SV*)POPPTR(ss,ix);
11223 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11224 ptr = POPPTR(ss,ix);
11225 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11227 case SAVEt_AV: /* array reference */
11228 av = (AV*)POPPTR(ss,ix);
11229 TOPPTR(nss,ix) = av_dup_inc(av, param);
11230 gv = (GV*)POPPTR(ss,ix);
11231 TOPPTR(nss,ix) = gv_dup(gv, param);
11233 case SAVEt_HV: /* hash reference */
11234 hv = (HV*)POPPTR(ss,ix);
11235 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11236 gv = (GV*)POPPTR(ss,ix);
11237 TOPPTR(nss,ix) = gv_dup(gv, param);
11239 case SAVEt_INT: /* int reference */
11240 ptr = POPPTR(ss,ix);
11241 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11242 intval = (int)POPINT(ss,ix);
11243 TOPINT(nss,ix) = intval;
11245 case SAVEt_LONG: /* long reference */
11246 ptr = POPPTR(ss,ix);
11247 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11248 longval = (long)POPLONG(ss,ix);
11249 TOPLONG(nss,ix) = longval;
11251 case SAVEt_I32: /* I32 reference */
11252 case SAVEt_I16: /* I16 reference */
11253 case SAVEt_I8: /* I8 reference */
11254 ptr = POPPTR(ss,ix);
11255 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11257 TOPINT(nss,ix) = i;
11259 case SAVEt_IV: /* IV reference */
11260 ptr = POPPTR(ss,ix);
11261 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11263 TOPIV(nss,ix) = iv;
11265 case SAVEt_SPTR: /* SV* reference */
11266 ptr = POPPTR(ss,ix);
11267 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11268 sv = (SV*)POPPTR(ss,ix);
11269 TOPPTR(nss,ix) = sv_dup(sv, param);
11271 case SAVEt_VPTR: /* random* reference */
11272 ptr = POPPTR(ss,ix);
11273 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11274 ptr = POPPTR(ss,ix);
11275 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11277 case SAVEt_PPTR: /* char* reference */
11278 ptr = POPPTR(ss,ix);
11279 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11280 c = (char*)POPPTR(ss,ix);
11281 TOPPTR(nss,ix) = pv_dup(c);
11283 case SAVEt_HPTR: /* HV* reference */
11284 ptr = POPPTR(ss,ix);
11285 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11286 hv = (HV*)POPPTR(ss,ix);
11287 TOPPTR(nss,ix) = hv_dup(hv, param);
11289 case SAVEt_APTR: /* AV* reference */
11290 ptr = POPPTR(ss,ix);
11291 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11292 av = (AV*)POPPTR(ss,ix);
11293 TOPPTR(nss,ix) = av_dup(av, param);
11296 gv = (GV*)POPPTR(ss,ix);
11297 TOPPTR(nss,ix) = gv_dup(gv, param);
11299 case SAVEt_GP: /* scalar reference */
11300 gp = (GP*)POPPTR(ss,ix);
11301 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11302 (void)GpREFCNT_inc(gp);
11303 gv = (GV*)POPPTR(ss,ix);
11304 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11305 c = (char*)POPPTR(ss,ix);
11306 TOPPTR(nss,ix) = pv_dup(c);
11308 TOPIV(nss,ix) = iv;
11310 TOPIV(nss,ix) = iv;
11313 case SAVEt_MORTALIZESV:
11314 sv = (SV*)POPPTR(ss,ix);
11315 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11318 ptr = POPPTR(ss,ix);
11319 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11320 /* these are assumed to be refcounted properly */
11321 switch (((OP*)ptr)->op_type) {
11323 case OP_LEAVESUBLV:
11327 case OP_LEAVEWRITE:
11328 TOPPTR(nss,ix) = ptr;
11333 TOPPTR(nss,ix) = Nullop;
11338 TOPPTR(nss,ix) = Nullop;
11341 c = (char*)POPPTR(ss,ix);
11342 TOPPTR(nss,ix) = pv_dup_inc(c);
11344 case SAVEt_CLEARSV:
11345 longval = POPLONG(ss,ix);
11346 TOPLONG(nss,ix) = longval;
11349 hv = (HV*)POPPTR(ss,ix);
11350 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11351 c = (char*)POPPTR(ss,ix);
11352 TOPPTR(nss,ix) = pv_dup_inc(c);
11354 TOPINT(nss,ix) = i;
11356 case SAVEt_DESTRUCTOR:
11357 ptr = POPPTR(ss,ix);
11358 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11359 dptr = POPDPTR(ss,ix);
11360 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11362 case SAVEt_DESTRUCTOR_X:
11363 ptr = POPPTR(ss,ix);
11364 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11365 dxptr = POPDXPTR(ss,ix);
11366 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11368 case SAVEt_REGCONTEXT:
11371 TOPINT(nss,ix) = i;
11374 case SAVEt_STACK_POS: /* Position on Perl stack */
11376 TOPINT(nss,ix) = i;
11378 case SAVEt_AELEM: /* array element */
11379 sv = (SV*)POPPTR(ss,ix);
11380 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11382 TOPINT(nss,ix) = i;
11383 av = (AV*)POPPTR(ss,ix);
11384 TOPPTR(nss,ix) = av_dup_inc(av, param);
11386 case SAVEt_HELEM: /* hash element */
11387 sv = (SV*)POPPTR(ss,ix);
11388 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11389 sv = (SV*)POPPTR(ss,ix);
11390 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11391 hv = (HV*)POPPTR(ss,ix);
11392 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11395 ptr = POPPTR(ss,ix);
11396 TOPPTR(nss,ix) = ptr;
11400 TOPINT(nss,ix) = i;
11402 case SAVEt_COMPPAD:
11403 av = (AV*)POPPTR(ss,ix);
11404 TOPPTR(nss,ix) = av_dup(av, param);
11407 longval = (long)POPLONG(ss,ix);
11408 TOPLONG(nss,ix) = longval;
11409 ptr = POPPTR(ss,ix);
11410 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11411 sv = (SV*)POPPTR(ss,ix);
11412 TOPPTR(nss,ix) = sv_dup(sv, param);
11415 ptr = POPPTR(ss,ix);
11416 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11417 longval = (long)POPBOOL(ss,ix);
11418 TOPBOOL(nss,ix) = (bool)longval;
11420 case SAVEt_SET_SVFLAGS:
11422 TOPINT(nss,ix) = i;
11424 TOPINT(nss,ix) = i;
11425 sv = (SV*)POPPTR(ss,ix);
11426 TOPPTR(nss,ix) = sv_dup(sv, param);
11429 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11437 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11438 * flag to the result. This is done for each stash before cloning starts,
11439 * so we know which stashes want their objects cloned */
11442 do_mark_cloneable_stash(pTHX_ SV *sv)
11444 const char *hvname = HvNAME_get((HV*)sv);
11446 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11447 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11448 if (cloner && GvCV(cloner)) {
11455 XPUSHs(sv_2mortal(newSVpv(hvname, 0)));
11457 call_sv((SV*)GvCV(cloner), G_SCALAR);
11464 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11472 =for apidoc perl_clone
11474 Create and return a new interpreter by cloning the current one.
11476 perl_clone takes these flags as parameters:
11478 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11479 without it we only clone the data and zero the stacks,
11480 with it we copy the stacks and the new perl interpreter is
11481 ready to run at the exact same point as the previous one.
11482 The pseudo-fork code uses COPY_STACKS while the
11483 threads->new doesn't.
11485 CLONEf_KEEP_PTR_TABLE
11486 perl_clone keeps a ptr_table with the pointer of the old
11487 variable as a key and the new variable as a value,
11488 this allows it to check if something has been cloned and not
11489 clone it again but rather just use the value and increase the
11490 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11491 the ptr_table using the function
11492 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11493 reason to keep it around is if you want to dup some of your own
11494 variable who are outside the graph perl scans, example of this
11495 code is in threads.xs create
11498 This is a win32 thing, it is ignored on unix, it tells perls
11499 win32host code (which is c++) to clone itself, this is needed on
11500 win32 if you want to run two threads at the same time,
11501 if you just want to do some stuff in a separate perl interpreter
11502 and then throw it away and return to the original one,
11503 you don't need to do anything.
11508 /* XXX the above needs expanding by someone who actually understands it ! */
11509 EXTERN_C PerlInterpreter *
11510 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11513 perl_clone(PerlInterpreter *proto_perl, UV flags)
11516 #ifdef PERL_IMPLICIT_SYS
11518 /* perlhost.h so we need to call into it
11519 to clone the host, CPerlHost should have a c interface, sky */
11521 if (flags & CLONEf_CLONE_HOST) {
11522 return perl_clone_host(proto_perl,flags);
11524 return perl_clone_using(proto_perl, flags,
11526 proto_perl->IMemShared,
11527 proto_perl->IMemParse,
11529 proto_perl->IStdIO,
11533 proto_perl->IProc);
11537 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11538 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11539 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11540 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11541 struct IPerlDir* ipD, struct IPerlSock* ipS,
11542 struct IPerlProc* ipP)
11544 /* XXX many of the string copies here can be optimized if they're
11545 * constants; they need to be allocated as common memory and just
11546 * their pointers copied. */
11549 CLONE_PARAMS clone_params;
11550 CLONE_PARAMS* param = &clone_params;
11552 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11553 /* for each stash, determine whether its objects should be cloned */
11554 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11555 PERL_SET_THX(my_perl);
11558 Poison(my_perl, 1, PerlInterpreter);
11560 PL_curcop = (COP *)Nullop;
11564 PL_savestack_ix = 0;
11565 PL_savestack_max = -1;
11566 PL_sig_pending = 0;
11567 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11568 # else /* !DEBUGGING */
11569 Zero(my_perl, 1, PerlInterpreter);
11570 # endif /* DEBUGGING */
11572 /* host pointers */
11574 PL_MemShared = ipMS;
11575 PL_MemParse = ipMP;
11582 #else /* !PERL_IMPLICIT_SYS */
11584 CLONE_PARAMS clone_params;
11585 CLONE_PARAMS* param = &clone_params;
11586 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11587 /* for each stash, determine whether its objects should be cloned */
11588 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11589 PERL_SET_THX(my_perl);
11592 Poison(my_perl, 1, PerlInterpreter);
11594 PL_curcop = (COP *)Nullop;
11598 PL_savestack_ix = 0;
11599 PL_savestack_max = -1;
11600 PL_sig_pending = 0;
11601 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11602 # else /* !DEBUGGING */
11603 Zero(my_perl, 1, PerlInterpreter);
11604 # endif /* DEBUGGING */
11605 #endif /* PERL_IMPLICIT_SYS */
11606 param->flags = flags;
11607 param->proto_perl = proto_perl;
11610 PL_xnv_arenaroot = NULL;
11611 PL_xnv_root = NULL;
11612 PL_xpv_arenaroot = NULL;
11613 PL_xpv_root = NULL;
11614 PL_xpviv_arenaroot = NULL;
11615 PL_xpviv_root = NULL;
11616 PL_xpvnv_arenaroot = NULL;
11617 PL_xpvnv_root = NULL;
11618 PL_xpvcv_arenaroot = NULL;
11619 PL_xpvcv_root = NULL;
11620 PL_xpvav_arenaroot = NULL;
11621 PL_xpvav_root = NULL;
11622 PL_xpvhv_arenaroot = NULL;
11623 PL_xpvhv_root = NULL;
11624 PL_xpvmg_arenaroot = NULL;
11625 PL_xpvmg_root = NULL;
11626 PL_xpvgv_arenaroot = NULL;
11627 PL_xpvgv_root = NULL;
11628 PL_xpvlv_arenaroot = NULL;
11629 PL_xpvlv_root = NULL;
11630 PL_xpvbm_arenaroot = NULL;
11631 PL_xpvbm_root = NULL;
11632 PL_he_arenaroot = NULL;
11634 #if defined(USE_ITHREADS)
11635 PL_pte_arenaroot = NULL;
11636 PL_pte_root = NULL;
11638 PL_nice_chunk = NULL;
11639 PL_nice_chunk_size = 0;
11641 PL_sv_objcount = 0;
11642 PL_sv_root = Nullsv;
11643 PL_sv_arenaroot = Nullsv;
11645 PL_debug = proto_perl->Idebug;
11647 #ifdef USE_REENTRANT_API
11648 /* XXX: things like -Dm will segfault here in perlio, but doing
11649 * PERL_SET_CONTEXT(proto_perl);
11650 * breaks too many other things
11652 Perl_reentrant_init(aTHX);
11655 /* create SV map for pointer relocation */
11656 PL_ptr_table = ptr_table_new();
11658 /* initialize these special pointers as early as possible */
11659 SvANY(&PL_sv_undef) = NULL;
11660 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11661 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11662 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11664 SvANY(&PL_sv_no) = new_XPVNV();
11665 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11666 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11667 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11668 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11669 SvCUR_set(&PL_sv_no, 0);
11670 SvLEN_set(&PL_sv_no, 1);
11671 SvIV_set(&PL_sv_no, 0);
11672 SvNV_set(&PL_sv_no, 0);
11673 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11675 SvANY(&PL_sv_yes) = new_XPVNV();
11676 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11677 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11678 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11679 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11680 SvCUR_set(&PL_sv_yes, 1);
11681 SvLEN_set(&PL_sv_yes, 2);
11682 SvIV_set(&PL_sv_yes, 1);
11683 SvNV_set(&PL_sv_yes, 1);
11684 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11686 /* create (a non-shared!) shared string table */
11687 PL_strtab = newHV();
11688 HvSHAREKEYS_off(PL_strtab);
11689 hv_ksplit(PL_strtab, 512);
11690 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11692 PL_compiling = proto_perl->Icompiling;
11694 /* These two PVs will be free'd special way so must set them same way op.c does */
11695 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11696 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11698 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11699 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11701 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11702 if (!specialWARN(PL_compiling.cop_warnings))
11703 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11704 if (!specialCopIO(PL_compiling.cop_io))
11705 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11706 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11708 /* pseudo environmental stuff */
11709 PL_origargc = proto_perl->Iorigargc;
11710 PL_origargv = proto_perl->Iorigargv;
11712 param->stashes = newAV(); /* Setup array of objects to call clone on */
11714 #ifdef PERLIO_LAYERS
11715 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11716 PerlIO_clone(aTHX_ proto_perl, param);
11719 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11720 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11721 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11722 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11723 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11724 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11727 PL_minus_c = proto_perl->Iminus_c;
11728 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11729 PL_localpatches = proto_perl->Ilocalpatches;
11730 PL_splitstr = proto_perl->Isplitstr;
11731 PL_preprocess = proto_perl->Ipreprocess;
11732 PL_minus_n = proto_perl->Iminus_n;
11733 PL_minus_p = proto_perl->Iminus_p;
11734 PL_minus_l = proto_perl->Iminus_l;
11735 PL_minus_a = proto_perl->Iminus_a;
11736 PL_minus_F = proto_perl->Iminus_F;
11737 PL_doswitches = proto_perl->Idoswitches;
11738 PL_dowarn = proto_perl->Idowarn;
11739 PL_doextract = proto_perl->Idoextract;
11740 PL_sawampersand = proto_perl->Isawampersand;
11741 PL_unsafe = proto_perl->Iunsafe;
11742 PL_inplace = SAVEPV(proto_perl->Iinplace);
11743 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11744 PL_perldb = proto_perl->Iperldb;
11745 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11746 PL_exit_flags = proto_perl->Iexit_flags;
11748 /* magical thingies */
11749 /* XXX time(&PL_basetime) when asked for? */
11750 PL_basetime = proto_perl->Ibasetime;
11751 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11753 PL_maxsysfd = proto_perl->Imaxsysfd;
11754 PL_multiline = proto_perl->Imultiline;
11755 PL_statusvalue = proto_perl->Istatusvalue;
11757 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11759 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11761 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11762 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11763 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11765 /* Clone the regex array */
11766 PL_regex_padav = newAV();
11768 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11769 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11770 av_push(PL_regex_padav,
11771 sv_dup_inc(regexen[0],param));
11772 for(i = 1; i <= len; i++) {
11773 if(SvREPADTMP(regexen[i])) {
11774 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11776 av_push(PL_regex_padav,
11778 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11779 SvIVX(regexen[i])), param)))
11784 PL_regex_pad = AvARRAY(PL_regex_padav);
11786 /* shortcuts to various I/O objects */
11787 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11788 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11789 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11790 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11791 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11792 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11794 /* shortcuts to regexp stuff */
11795 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11797 /* shortcuts to misc objects */
11798 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11800 /* shortcuts to debugging objects */
11801 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11802 PL_DBline = gv_dup(proto_perl->IDBline, param);
11803 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11804 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11805 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11806 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11807 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11808 PL_lineary = av_dup(proto_perl->Ilineary, param);
11809 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11811 /* symbol tables */
11812 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11813 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11814 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11815 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11816 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11818 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11819 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11820 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11821 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11822 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11823 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11825 PL_sub_generation = proto_perl->Isub_generation;
11827 /* funky return mechanisms */
11828 PL_forkprocess = proto_perl->Iforkprocess;
11830 /* subprocess state */
11831 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11833 /* internal state */
11834 PL_tainting = proto_perl->Itainting;
11835 PL_taint_warn = proto_perl->Itaint_warn;
11836 PL_maxo = proto_perl->Imaxo;
11837 if (proto_perl->Iop_mask)
11838 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11840 PL_op_mask = Nullch;
11841 /* PL_asserting = proto_perl->Iasserting; */
11843 /* current interpreter roots */
11844 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11845 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11846 PL_main_start = proto_perl->Imain_start;
11847 PL_eval_root = proto_perl->Ieval_root;
11848 PL_eval_start = proto_perl->Ieval_start;
11850 /* runtime control stuff */
11851 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11852 PL_copline = proto_perl->Icopline;
11854 PL_filemode = proto_perl->Ifilemode;
11855 PL_lastfd = proto_perl->Ilastfd;
11856 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11859 PL_gensym = proto_perl->Igensym;
11860 PL_preambled = proto_perl->Ipreambled;
11861 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11862 PL_laststatval = proto_perl->Ilaststatval;
11863 PL_laststype = proto_perl->Ilaststype;
11864 PL_mess_sv = Nullsv;
11866 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11867 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11869 /* interpreter atexit processing */
11870 PL_exitlistlen = proto_perl->Iexitlistlen;
11871 if (PL_exitlistlen) {
11872 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11873 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11876 PL_exitlist = (PerlExitListEntry*)NULL;
11877 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11878 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11879 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11881 PL_profiledata = NULL;
11882 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11883 /* PL_rsfp_filters entries have fake IoDIRP() */
11884 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11886 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11888 PAD_CLONE_VARS(proto_perl, param);
11890 #ifdef HAVE_INTERP_INTERN
11891 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11894 /* more statics moved here */
11895 PL_generation = proto_perl->Igeneration;
11896 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11898 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11899 PL_in_clean_all = proto_perl->Iin_clean_all;
11901 PL_uid = proto_perl->Iuid;
11902 PL_euid = proto_perl->Ieuid;
11903 PL_gid = proto_perl->Igid;
11904 PL_egid = proto_perl->Iegid;
11905 PL_nomemok = proto_perl->Inomemok;
11906 PL_an = proto_perl->Ian;
11907 PL_evalseq = proto_perl->Ievalseq;
11908 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11909 PL_origalen = proto_perl->Iorigalen;
11910 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11911 PL_osname = SAVEPV(proto_perl->Iosname);
11912 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11913 PL_sighandlerp = proto_perl->Isighandlerp;
11916 PL_runops = proto_perl->Irunops;
11918 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11921 PL_cshlen = proto_perl->Icshlen;
11922 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11925 PL_lex_state = proto_perl->Ilex_state;
11926 PL_lex_defer = proto_perl->Ilex_defer;
11927 PL_lex_expect = proto_perl->Ilex_expect;
11928 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11929 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11930 PL_lex_starts = proto_perl->Ilex_starts;
11931 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11932 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11933 PL_lex_op = proto_perl->Ilex_op;
11934 PL_lex_inpat = proto_perl->Ilex_inpat;
11935 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11936 PL_lex_brackets = proto_perl->Ilex_brackets;
11937 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11938 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11939 PL_lex_casemods = proto_perl->Ilex_casemods;
11940 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11941 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11943 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11944 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11945 PL_nexttoke = proto_perl->Inexttoke;
11947 /* XXX This is probably masking the deeper issue of why
11948 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11949 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11950 * (A little debugging with a watchpoint on it may help.)
11952 if (SvANY(proto_perl->Ilinestr)) {
11953 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11954 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11955 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11956 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11957 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11958 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11959 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11960 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11961 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11964 PL_linestr = NEWSV(65,79);
11965 sv_upgrade(PL_linestr,SVt_PVIV);
11966 sv_setpvn(PL_linestr,"",0);
11967 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11969 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11970 PL_pending_ident = proto_perl->Ipending_ident;
11971 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11973 PL_expect = proto_perl->Iexpect;
11975 PL_multi_start = proto_perl->Imulti_start;
11976 PL_multi_end = proto_perl->Imulti_end;
11977 PL_multi_open = proto_perl->Imulti_open;
11978 PL_multi_close = proto_perl->Imulti_close;
11980 PL_error_count = proto_perl->Ierror_count;
11981 PL_subline = proto_perl->Isubline;
11982 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11984 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11985 if (SvANY(proto_perl->Ilinestr)) {
11986 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11987 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11988 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11989 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11990 PL_last_lop_op = proto_perl->Ilast_lop_op;
11993 PL_last_uni = SvPVX(PL_linestr);
11994 PL_last_lop = SvPVX(PL_linestr);
11995 PL_last_lop_op = 0;
11997 PL_in_my = proto_perl->Iin_my;
11998 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12000 PL_cryptseen = proto_perl->Icryptseen;
12003 PL_hints = proto_perl->Ihints;
12005 PL_amagic_generation = proto_perl->Iamagic_generation;
12007 #ifdef USE_LOCALE_COLLATE
12008 PL_collation_ix = proto_perl->Icollation_ix;
12009 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12010 PL_collation_standard = proto_perl->Icollation_standard;
12011 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12012 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12013 #endif /* USE_LOCALE_COLLATE */
12015 #ifdef USE_LOCALE_NUMERIC
12016 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12017 PL_numeric_standard = proto_perl->Inumeric_standard;
12018 PL_numeric_local = proto_perl->Inumeric_local;
12019 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12020 #endif /* !USE_LOCALE_NUMERIC */
12022 /* utf8 character classes */
12023 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12024 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12025 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12026 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12027 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12028 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12029 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12030 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12031 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12032 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12033 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12034 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12035 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12036 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12037 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12038 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12039 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12040 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12041 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12042 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12044 /* Did the locale setup indicate UTF-8? */
12045 PL_utf8locale = proto_perl->Iutf8locale;
12046 /* Unicode features (see perlrun/-C) */
12047 PL_unicode = proto_perl->Iunicode;
12049 /* Pre-5.8 signals control */
12050 PL_signals = proto_perl->Isignals;
12052 /* times() ticks per second */
12053 PL_clocktick = proto_perl->Iclocktick;
12055 /* Recursion stopper for PerlIO_find_layer */
12056 PL_in_load_module = proto_perl->Iin_load_module;
12058 /* sort() routine */
12059 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12061 /* Not really needed/useful since the reenrant_retint is "volatile",
12062 * but do it for consistency's sake. */
12063 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12065 /* Hooks to shared SVs and locks. */
12066 PL_sharehook = proto_perl->Isharehook;
12067 PL_lockhook = proto_perl->Ilockhook;
12068 PL_unlockhook = proto_perl->Iunlockhook;
12069 PL_threadhook = proto_perl->Ithreadhook;
12071 PL_runops_std = proto_perl->Irunops_std;
12072 PL_runops_dbg = proto_perl->Irunops_dbg;
12074 #ifdef THREADS_HAVE_PIDS
12075 PL_ppid = proto_perl->Ippid;
12079 PL_last_swash_hv = Nullhv; /* reinits on demand */
12080 PL_last_swash_klen = 0;
12081 PL_last_swash_key[0]= '\0';
12082 PL_last_swash_tmps = (U8*)NULL;
12083 PL_last_swash_slen = 0;
12085 PL_glob_index = proto_perl->Iglob_index;
12086 PL_srand_called = proto_perl->Isrand_called;
12087 PL_hash_seed = proto_perl->Ihash_seed;
12088 PL_rehash_seed = proto_perl->Irehash_seed;
12089 PL_uudmap['M'] = 0; /* reinits on demand */
12090 PL_bitcount = Nullch; /* reinits on demand */
12092 if (proto_perl->Ipsig_pend) {
12093 Newz(0, PL_psig_pend, SIG_SIZE, int);
12096 PL_psig_pend = (int*)NULL;
12099 if (proto_perl->Ipsig_ptr) {
12100 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12101 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12102 for (i = 1; i < SIG_SIZE; i++) {
12103 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12104 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12108 PL_psig_ptr = (SV**)NULL;
12109 PL_psig_name = (SV**)NULL;
12112 /* thrdvar.h stuff */
12114 if (flags & CLONEf_COPY_STACKS) {
12115 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12116 PL_tmps_ix = proto_perl->Ttmps_ix;
12117 PL_tmps_max = proto_perl->Ttmps_max;
12118 PL_tmps_floor = proto_perl->Ttmps_floor;
12119 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12121 while (i <= PL_tmps_ix) {
12122 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12126 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12127 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12128 Newz(54, PL_markstack, i, I32);
12129 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12130 - proto_perl->Tmarkstack);
12131 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12132 - proto_perl->Tmarkstack);
12133 Copy(proto_perl->Tmarkstack, PL_markstack,
12134 PL_markstack_ptr - PL_markstack + 1, I32);
12136 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12137 * NOTE: unlike the others! */
12138 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12139 PL_scopestack_max = proto_perl->Tscopestack_max;
12140 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12141 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12143 /* NOTE: si_dup() looks at PL_markstack */
12144 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12146 /* PL_curstack = PL_curstackinfo->si_stack; */
12147 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12148 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12150 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12151 PL_stack_base = AvARRAY(PL_curstack);
12152 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12153 - proto_perl->Tstack_base);
12154 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12156 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12157 * NOTE: unlike the others! */
12158 PL_savestack_ix = proto_perl->Tsavestack_ix;
12159 PL_savestack_max = proto_perl->Tsavestack_max;
12160 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12161 PL_savestack = ss_dup(proto_perl, param);
12165 ENTER; /* perl_destruct() wants to LEAVE; */
12168 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12169 PL_top_env = &PL_start_env;
12171 PL_op = proto_perl->Top;
12174 PL_Xpv = (XPV*)NULL;
12175 PL_na = proto_perl->Tna;
12177 PL_statbuf = proto_perl->Tstatbuf;
12178 PL_statcache = proto_perl->Tstatcache;
12179 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12180 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12182 PL_timesbuf = proto_perl->Ttimesbuf;
12185 PL_tainted = proto_perl->Ttainted;
12186 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12187 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12188 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12189 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12190 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12191 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12192 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12193 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12194 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12196 PL_restartop = proto_perl->Trestartop;
12197 PL_in_eval = proto_perl->Tin_eval;
12198 PL_delaymagic = proto_perl->Tdelaymagic;
12199 PL_dirty = proto_perl->Tdirty;
12200 PL_localizing = proto_perl->Tlocalizing;
12202 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12203 PL_hv_fetch_ent_mh = Nullhe;
12204 PL_modcount = proto_perl->Tmodcount;
12205 PL_lastgotoprobe = Nullop;
12206 PL_dumpindent = proto_perl->Tdumpindent;
12208 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12209 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12210 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12211 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12212 PL_sortcxix = proto_perl->Tsortcxix;
12213 PL_efloatbuf = Nullch; /* reinits on demand */
12214 PL_efloatsize = 0; /* reinits on demand */
12218 PL_screamfirst = NULL;
12219 PL_screamnext = NULL;
12220 PL_maxscream = -1; /* reinits on demand */
12221 PL_lastscream = Nullsv;
12223 PL_watchaddr = NULL;
12224 PL_watchok = Nullch;
12226 PL_regdummy = proto_perl->Tregdummy;
12227 PL_regprecomp = Nullch;
12230 PL_colorset = 0; /* reinits PL_colors[] */
12231 /*PL_colors[6] = {0,0,0,0,0,0};*/
12232 PL_reginput = Nullch;
12233 PL_regbol = Nullch;
12234 PL_regeol = Nullch;
12235 PL_regstartp = (I32*)NULL;
12236 PL_regendp = (I32*)NULL;
12237 PL_reglastparen = (U32*)NULL;
12238 PL_reglastcloseparen = (U32*)NULL;
12239 PL_regtill = Nullch;
12240 PL_reg_start_tmp = (char**)NULL;
12241 PL_reg_start_tmpl = 0;
12242 PL_regdata = (struct reg_data*)NULL;
12245 PL_reg_eval_set = 0;
12247 PL_regprogram = (regnode*)NULL;
12249 PL_regcc = (CURCUR*)NULL;
12250 PL_reg_call_cc = (struct re_cc_state*)NULL;
12251 PL_reg_re = (regexp*)NULL;
12252 PL_reg_ganch = Nullch;
12253 PL_reg_sv = Nullsv;
12254 PL_reg_match_utf8 = FALSE;
12255 PL_reg_magic = (MAGIC*)NULL;
12257 PL_reg_oldcurpm = (PMOP*)NULL;
12258 PL_reg_curpm = (PMOP*)NULL;
12259 PL_reg_oldsaved = Nullch;
12260 PL_reg_oldsavedlen = 0;
12261 #ifdef PERL_COPY_ON_WRITE
12264 PL_reg_maxiter = 0;
12265 PL_reg_leftiter = 0;
12266 PL_reg_poscache = Nullch;
12267 PL_reg_poscache_size= 0;
12269 /* RE engine - function pointers */
12270 PL_regcompp = proto_perl->Tregcompp;
12271 PL_regexecp = proto_perl->Tregexecp;
12272 PL_regint_start = proto_perl->Tregint_start;
12273 PL_regint_string = proto_perl->Tregint_string;
12274 PL_regfree = proto_perl->Tregfree;
12276 PL_reginterp_cnt = 0;
12277 PL_reg_starttry = 0;
12279 /* Pluggable optimizer */
12280 PL_peepp = proto_perl->Tpeepp;
12282 PL_stashcache = newHV();
12284 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12285 ptr_table_free(PL_ptr_table);
12286 PL_ptr_table = NULL;
12289 /* Call the ->CLONE method, if it exists, for each of the stashes
12290 identified by sv_dup() above.
12292 while(av_len(param->stashes) != -1) {
12293 HV* stash = (HV*) av_shift(param->stashes);
12294 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12295 if (cloner && GvCV(cloner)) {
12300 XPUSHs(sv_2mortal(newSVpv(HvNAME_get(stash), 0)));
12302 call_sv((SV*)GvCV(cloner), G_DISCARD);
12308 SvREFCNT_dec(param->stashes);
12310 /* orphaned? eg threads->new inside BEGIN or use */
12311 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12312 (void)SvREFCNT_inc(PL_compcv);
12313 SAVEFREESV(PL_compcv);
12319 #endif /* USE_ITHREADS */
12322 =head1 Unicode Support
12324 =for apidoc sv_recode_to_utf8
12326 The encoding is assumed to be an Encode object, on entry the PV
12327 of the sv is assumed to be octets in that encoding, and the sv
12328 will be converted into Unicode (and UTF-8).
12330 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12331 is not a reference, nothing is done to the sv. If the encoding is not
12332 an C<Encode::XS> Encoding object, bad things will happen.
12333 (See F<lib/encoding.pm> and L<Encode>).
12335 The PV of the sv is returned.
12340 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12343 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12357 Passing sv_yes is wrong - it needs to be or'ed set of constants
12358 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12359 remove converted chars from source.
12361 Both will default the value - let them.
12363 XPUSHs(&PL_sv_yes);
12366 call_method("decode", G_SCALAR);
12370 s = SvPV(uni, len);
12371 if (s != SvPVX(sv)) {
12372 SvGROW(sv, len + 1);
12373 Move(s, SvPVX(sv), len, char);
12374 SvCUR_set(sv, len);
12375 SvPVX(sv)[len] = 0;
12382 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12386 =for apidoc sv_cat_decode
12388 The encoding is assumed to be an Encode object, the PV of the ssv is
12389 assumed to be octets in that encoding and decoding the input starts
12390 from the position which (PV + *offset) pointed to. The dsv will be
12391 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12392 when the string tstr appears in decoding output or the input ends on
12393 the PV of the ssv. The value which the offset points will be modified
12394 to the last input position on the ssv.
12396 Returns TRUE if the terminator was found, else returns FALSE.
12401 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12402 SV *ssv, int *offset, char *tstr, int tlen)
12406 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12417 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12418 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12420 call_method("cat_decode", G_SCALAR);
12422 ret = SvTRUE(TOPs);
12423 *offset = SvIV(offsv);
12429 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12435 * c-indentation-style: bsd
12436 * c-basic-offset: 4
12437 * indent-tabs-mode: t
12440 * ex: set ts=8 sts=4 sw=4 noet: