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 are approximately
67 1K chunks of memory parcelled up into N heads or bodies. The first slot
68 in each arena is reserved, and is used to hold a link to the next arena.
69 In the case of heads, the unused first slot also contains some flags and
70 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
75 The following global variables are associated with arenas:
77 PL_sv_arenaroot pointer to list of SV arenas
78 PL_sv_root pointer to list of free SV structures
80 PL_foo_arenaroot pointer to list of foo arenas,
81 PL_foo_root pointer to list of free foo bodies
82 ... for foo in xiv, xnv, xrv, xpv etc.
84 Note that some of the larger and more rarely used body types (eg xpvio)
85 are not allocated using arenas, but are instead just malloc()/free()ed as
86 required. Also, if PURIFY is defined, arenas are abandoned altogether,
87 with all items individually malloc()ed. In addition, a few SV heads are
88 not allocated from an arena, but are instead directly created as static
89 or auto variables, eg PL_sv_undef.
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..."
168 #ifdef DEBUG_LEAKING_SCALARS
170 # define FREE_SV_DEBUG_FILE(sv) PerlMemfree((sv)->sv_debug_file)
172 # define FREE_SV_DEBUG_FILE(sv) PerlMemShared_free((sv)->sv_debug_file)
175 # define FREE_SV_DEBUG_FILE(sv)
178 #define plant_SV(p) \
180 FREE_SV_DEBUG_FILE(p); \
181 SvANY(p) = (void *)PL_sv_root; \
182 SvFLAGS(p) = SVTYPEMASK; \
187 /* sv_mutex must be held while calling uproot_SV() */
188 #define uproot_SV(p) \
191 PL_sv_root = (SV*)SvANY(p); \
196 /* new_SV(): return a new, empty SV head */
198 #ifdef DEBUG_LEAKING_SCALARS
199 /* provide a real function for a debugger to play with */
214 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
215 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
216 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
217 sv->sv_debug_inpad = 0;
218 sv->sv_debug_cloned = 0;
220 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
222 sv->sv_debug_file = PL_curcop ? savesharedpv(CopFILE(PL_curcop)): NULL;
227 # define new_SV(p) (p)=S_new_SV(aTHX)
245 /* del_SV(): return an empty SV head to the free list */
260 S_del_sv(pTHX_ SV *p)
267 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
269 svend = &sva[SvREFCNT(sva)];
270 if (p >= sv && p < svend)
274 if (ckWARN_d(WARN_INTERNAL))
275 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
276 "Attempt to free non-arena SV: 0x%"UVxf
277 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
284 #else /* ! DEBUGGING */
286 #define del_SV(p) plant_SV(p)
288 #endif /* DEBUGGING */
292 =head1 SV Manipulation Functions
294 =for apidoc sv_add_arena
296 Given a chunk of memory, link it to the head of the list of arenas,
297 and split it into a list of free SVs.
303 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
309 /* The first SV in an arena isn't an SV. */
310 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
311 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
312 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
314 PL_sv_arenaroot = sva;
315 PL_sv_root = sva + 1;
317 svend = &sva[SvREFCNT(sva) - 1];
320 SvANY(sv) = (void *)(SV*)(sv + 1);
322 SvFLAGS(sv) = SVTYPEMASK;
326 SvFLAGS(sv) = SVTYPEMASK;
329 /* make some more SVs by adding another arena */
331 /* sv_mutex must be held while calling more_sv() */
338 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
339 PL_nice_chunk = Nullch;
340 PL_nice_chunk_size = 0;
343 char *chunk; /* must use New here to match call to Safefree() */
344 New(704,chunk,PERL_ARENA_SIZE,char); /* in sv_free_arenas() */
345 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
351 /* visit(): call the named function for each non-free SV in the arenas
352 * whose flags field matches the flags/mask args. */
355 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
362 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
363 svend = &sva[SvREFCNT(sva)];
364 for (sv = sva + 1; sv < svend; ++sv) {
365 if (SvTYPE(sv) != SVTYPEMASK
366 && (sv->sv_flags & mask) == flags
379 /* called by sv_report_used() for each live SV */
382 do_report_used(pTHX_ SV *sv)
384 if (SvTYPE(sv) != SVTYPEMASK) {
385 PerlIO_printf(Perl_debug_log, "****\n");
392 =for apidoc sv_report_used
394 Dump the contents of all SVs not yet freed. (Debugging aid).
400 Perl_sv_report_used(pTHX)
403 visit(do_report_used, 0, 0);
407 /* called by sv_clean_objs() for each live SV */
410 do_clean_objs(pTHX_ SV *sv)
414 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
415 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
427 /* XXX Might want to check arrays, etc. */
430 /* called by sv_clean_objs() for each live SV */
432 #ifndef DISABLE_DESTRUCTOR_KLUDGE
434 do_clean_named_objs(pTHX_ SV *sv)
436 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
437 if ( SvOBJECT(GvSV(sv)) ||
438 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
439 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
440 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
441 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
443 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
444 SvFLAGS(sv) |= SVf_BREAK;
452 =for apidoc sv_clean_objs
454 Attempt to destroy all objects not yet freed
460 Perl_sv_clean_objs(pTHX)
462 PL_in_clean_objs = TRUE;
463 visit(do_clean_objs, SVf_ROK, SVf_ROK);
464 #ifndef DISABLE_DESTRUCTOR_KLUDGE
465 /* some barnacles may yet remain, clinging to typeglobs */
466 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
468 PL_in_clean_objs = FALSE;
471 /* called by sv_clean_all() for each live SV */
474 do_clean_all(pTHX_ SV *sv)
476 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
477 SvFLAGS(sv) |= SVf_BREAK;
478 if (PL_comppad == (AV*)sv) {
480 PL_curpad = Null(SV**);
486 =for apidoc sv_clean_all
488 Decrement the refcnt of each remaining SV, possibly triggering a
489 cleanup. This function may have to be called multiple times to free
490 SVs which are in complex self-referential hierarchies.
496 Perl_sv_clean_all(pTHX)
499 PL_in_clean_all = TRUE;
500 cleaned = visit(do_clean_all, 0,0);
501 PL_in_clean_all = FALSE;
506 =for apidoc sv_free_arenas
508 Deallocate the memory used by all arenas. Note that all the individual SV
509 heads and bodies within the arenas must already have been freed.
515 Perl_sv_free_arenas(pTHX)
519 XPV *arena, *arenanext;
521 /* Free arenas here, but be careful about fake ones. (We assume
522 contiguity of the fake ones with the corresponding real ones.) */
524 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
525 svanext = (SV*) SvANY(sva);
526 while (svanext && SvFAKE(svanext))
527 svanext = (SV*) SvANY(svanext);
530 Safefree((void *)sva);
533 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
534 arenanext = (XPV*)arena->xpv_pv;
537 PL_xiv_arenaroot = 0;
540 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
541 arenanext = (XPV*)arena->xpv_pv;
544 PL_xnv_arenaroot = 0;
547 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
548 arenanext = (XPV*)arena->xpv_pv;
551 PL_xrv_arenaroot = 0;
554 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
555 arenanext = (XPV*)arena->xpv_pv;
558 PL_xpv_arenaroot = 0;
561 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
562 arenanext = (XPV*)arena->xpv_pv;
565 PL_xpviv_arenaroot = 0;
568 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
569 arenanext = (XPV*)arena->xpv_pv;
572 PL_xpvnv_arenaroot = 0;
575 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
576 arenanext = (XPV*)arena->xpv_pv;
579 PL_xpvcv_arenaroot = 0;
582 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
583 arenanext = (XPV*)arena->xpv_pv;
586 PL_xpvav_arenaroot = 0;
589 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
590 arenanext = (XPV*)arena->xpv_pv;
593 PL_xpvhv_arenaroot = 0;
596 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
597 arenanext = (XPV*)arena->xpv_pv;
600 PL_xpvmg_arenaroot = 0;
603 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
604 arenanext = (XPV*)arena->xpv_pv;
607 PL_xpvlv_arenaroot = 0;
610 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
611 arenanext = (XPV*)arena->xpv_pv;
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)
670 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
671 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
676 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)
732 name = sv_newmortal();
735 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
736 * XXX get rid of all this if gv_fullnameX() ever supports this
740 HV *hv = GvSTASH(gv);
741 sv_setpv(name, gvtype);
744 else if (!(p=HvNAME(hv)))
746 if (strNE(p, "main")) {
748 sv_catpvn(name,"::", 2);
750 if (GvNAMELEN(gv)>= 1 &&
751 ((unsigned int)*GvNAME(gv)) <= 26)
753 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
754 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
757 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
761 CV *cv = find_runcv(&u);
762 if (!cv || !CvPADLIST(cv))
764 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
765 sv = *av_fetch(av, targ, FALSE);
766 /* SvLEN in a pad name is not to be trusted */
767 sv_setpv(name, SvPV_nolen(sv));
770 if (subscript_type == FUV_SUBSCRIPT_HASH) {
773 Perl_sv_catpvf(aTHX_ name, "{%s}",
774 pv_display(sv,SvPVX(keyname), SvCUR(keyname), 0, 32));
777 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
779 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
781 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
782 sv_insert(name, 0, 0, "within ", 7);
789 =for apidoc find_uninit_var
791 Find the name of the undefined variable (if any) that caused the operator o
792 to issue a "Use of uninitialized value" warning.
793 If match is true, only return a name if it's value matches uninit_sv.
794 So roughly speaking, if a unary operator (such as OP_COS) generates a
795 warning, then following the direct child of the op may yield an
796 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
797 other hand, with OP_ADD there are two branches to follow, so we only print
798 the variable name if we get an exact match.
800 The name is returned as a mortal SV.
802 Assumes that PL_op is the op that originally triggered the error, and that
803 PL_comppad/PL_curpad points to the currently executing pad.
809 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
818 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
819 uninit_sv == &PL_sv_placeholder)))
822 switch (obase->op_type) {
829 bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
830 bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
833 int subscript_type = FUV_SUBSCRIPT_WITHIN;
835 if (pad) { /* @lex, %lex */
836 sv = PAD_SVl(obase->op_targ);
840 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
841 /* @global, %global */
842 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
845 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
847 else /* @{expr}, %{expr} */
848 return find_uninit_var(cUNOPx(obase)->op_first,
852 /* attempt to find a match within the aggregate */
854 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
856 subscript_type = FUV_SUBSCRIPT_HASH;
859 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
861 subscript_type = FUV_SUBSCRIPT_ARRAY;
864 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
867 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
868 keysv, index, subscript_type);
872 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
874 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
875 Nullsv, 0, FUV_SUBSCRIPT_NONE);
878 gv = cGVOPx_gv(obase);
879 if (!gv || (match && GvSV(gv) != uninit_sv))
881 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
884 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
886 av = (AV*)PAD_SV(obase->op_targ);
887 if (!av || SvRMAGICAL(av))
889 svp = av_fetch(av, (I32)obase->op_private, FALSE);
890 if (!svp || *svp != uninit_sv)
893 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
894 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
897 gv = cGVOPx_gv(obase);
902 if (!av || SvRMAGICAL(av))
904 svp = av_fetch(av, (I32)obase->op_private, FALSE);
905 if (!svp || *svp != uninit_sv)
908 return S_varname(aTHX_ gv, "$", 0,
909 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
914 o = cUNOPx(obase)->op_first;
915 if (!o || o->op_type != OP_NULL ||
916 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
918 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
923 /* $a[uninit_expr] or $h{uninit_expr} */
924 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
927 o = cBINOPx(obase)->op_first;
928 kid = cBINOPx(obase)->op_last;
930 /* get the av or hv, and optionally the gv */
932 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
933 sv = PAD_SV(o->op_targ);
935 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
936 && cUNOPo->op_first->op_type == OP_GV)
938 gv = cGVOPx_gv(cUNOPo->op_first);
941 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
946 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
947 /* index is constant */
951 if (obase->op_type == OP_HELEM) {
952 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
953 if (!he || HeVAL(he) != uninit_sv)
957 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
958 if (!svp || *svp != uninit_sv)
962 if (obase->op_type == OP_HELEM)
963 return S_varname(aTHX_ gv, "%", o->op_targ,
964 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
966 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
967 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
971 /* index is an expression;
972 * attempt to find a match within the aggregate */
973 if (obase->op_type == OP_HELEM) {
974 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
976 return S_varname(aTHX_ gv, "%", o->op_targ,
977 keysv, 0, FUV_SUBSCRIPT_HASH);
980 I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
982 return S_varname(aTHX_ gv, "@", o->op_targ,
983 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
987 return S_varname(aTHX_ gv,
988 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
990 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
996 /* only examine RHS */
997 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
1000 o = cUNOPx(obase)->op_first;
1001 if (o->op_type == OP_PUSHMARK)
1004 if (!o->op_sibling) {
1005 /* one-arg version of open is highly magical */
1007 if (o->op_type == OP_GV) { /* open FOO; */
1009 if (match && GvSV(gv) != uninit_sv)
1011 return S_varname(aTHX_ gv, "$", 0,
1012 Nullsv, 0, FUV_SUBSCRIPT_NONE);
1014 /* other possibilities not handled are:
1015 * open $x; or open my $x; should return '${*$x}'
1016 * open expr; should return '$'.expr ideally
1022 /* ops where $_ may be an implicit arg */
1026 if ( !(obase->op_flags & OPf_STACKED)) {
1027 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1028 ? PAD_SVl(obase->op_targ)
1031 sv = sv_newmortal();
1040 /* skip filehandle as it can't produce 'undef' warning */
1041 o = cUNOPx(obase)->op_first;
1042 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1043 o = o->op_sibling->op_sibling;
1050 match = 1; /* XS or custom code could trigger random warnings */
1055 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1056 return sv_2mortal(newSVpv("${$/}", 0));
1061 if (!(obase->op_flags & OPf_KIDS))
1063 o = cUNOPx(obase)->op_first;
1069 /* if all except one arg are constant, or have no side-effects,
1070 * or are optimized away, then it's unambiguous */
1072 for (kid=o; kid; kid = kid->op_sibling) {
1074 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1075 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1076 || (kid->op_type == OP_PUSHMARK)
1080 if (o2) { /* more than one found */
1087 return find_uninit_var(o2, uninit_sv, match);
1091 sv = find_uninit_var(o, uninit_sv, 1);
1103 =for apidoc report_uninit
1105 Print appropriate "Use of uninitialized variable" warning
1111 Perl_report_uninit(pTHX_ SV* uninit_sv)
1114 SV* varname = Nullsv;
1116 varname = find_uninit_var(PL_op, uninit_sv,0);
1118 sv_insert(varname, 0, 0, " ", 1);
1120 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1121 varname ? SvPV_nolen(varname) : "",
1122 " in ", OP_DESC(PL_op));
1125 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1129 /* grab a new IV body from the free list, allocating more if necessary */
1140 * See comment in more_xiv() -- RAM.
1142 PL_xiv_root = *(IV**)xiv;
1144 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
1147 /* return an IV body to the free list */
1150 S_del_xiv(pTHX_ XPVIV *p)
1152 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
1154 *(IV**)xiv = PL_xiv_root;
1159 /* allocate another arena's worth of IV bodies */
1165 register IV* xivend;
1167 New(705, ptr, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1168 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
1169 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
1172 xivend = &xiv[PERL_ARENA_SIZE / sizeof(IV) - 1];
1173 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
1175 while (xiv < xivend) {
1176 *(IV**)xiv = (IV *)(xiv + 1);
1182 /* grab a new NV body from the free list, allocating more if necessary */
1192 PL_xnv_root = *(NV**)xnv;
1194 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1197 /* return an NV body to the free list */
1200 S_del_xnv(pTHX_ XPVNV *p)
1202 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1204 *(NV**)xnv = PL_xnv_root;
1209 /* allocate another arena's worth of NV bodies */
1215 register NV* xnvend;
1217 New(711, ptr, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1218 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
1219 PL_xnv_arenaroot = ptr;
1222 xnvend = &xnv[PERL_ARENA_SIZE / sizeof(NV) - 1];
1223 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1225 while (xnv < xnvend) {
1226 *(NV**)xnv = (NV*)(xnv + 1);
1232 /* grab a new struct xrv from the free list, allocating more if necessary */
1242 PL_xrv_root = (XRV*)xrv->xrv_rv;
1247 /* return a struct xrv to the free list */
1250 S_del_xrv(pTHX_ XRV *p)
1253 p->xrv_rv = (SV*)PL_xrv_root;
1258 /* allocate another arena's worth of struct xrv */
1264 register XRV* xrvend;
1266 New(712, ptr, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1267 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
1268 PL_xrv_arenaroot = ptr;
1271 xrvend = &xrv[PERL_ARENA_SIZE / sizeof(XRV) - 1];
1272 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
1274 while (xrv < xrvend) {
1275 xrv->xrv_rv = (SV*)(xrv + 1);
1281 /* grab a new struct xpv from the free list, allocating more if necessary */
1291 PL_xpv_root = (XPV*)xpv->xpv_pv;
1296 /* return a struct xpv to the free list */
1299 S_del_xpv(pTHX_ XPV *p)
1302 p->xpv_pv = (char*)PL_xpv_root;
1307 /* allocate another arena's worth of struct xpv */
1313 register XPV* xpvend;
1314 New(713, xpv, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1315 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
1316 PL_xpv_arenaroot = xpv;
1318 xpvend = &xpv[PERL_ARENA_SIZE / sizeof(XPV) - 1];
1319 PL_xpv_root = ++xpv;
1320 while (xpv < xpvend) {
1321 xpv->xpv_pv = (char*)(xpv + 1);
1327 /* grab a new struct xpviv from the free list, allocating more if necessary */
1336 xpviv = PL_xpviv_root;
1337 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
1342 /* return a struct xpviv to the free list */
1345 S_del_xpviv(pTHX_ XPVIV *p)
1348 p->xpv_pv = (char*)PL_xpviv_root;
1353 /* allocate another arena's worth of struct xpviv */
1358 register XPVIV* xpviv;
1359 register XPVIV* xpvivend;
1360 New(714, xpviv, PERL_ARENA_SIZE/sizeof(XPVIV), XPVIV);
1361 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
1362 PL_xpviv_arenaroot = xpviv;
1364 xpvivend = &xpviv[PERL_ARENA_SIZE / sizeof(XPVIV) - 1];
1365 PL_xpviv_root = ++xpviv;
1366 while (xpviv < xpvivend) {
1367 xpviv->xpv_pv = (char*)(xpviv + 1);
1373 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1382 xpvnv = PL_xpvnv_root;
1383 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
1388 /* return a struct xpvnv to the free list */
1391 S_del_xpvnv(pTHX_ XPVNV *p)
1394 p->xpv_pv = (char*)PL_xpvnv_root;
1399 /* allocate another arena's worth of struct xpvnv */
1404 register XPVNV* xpvnv;
1405 register XPVNV* xpvnvend;
1406 New(715, xpvnv, PERL_ARENA_SIZE/sizeof(XPVNV), XPVNV);
1407 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
1408 PL_xpvnv_arenaroot = xpvnv;
1410 xpvnvend = &xpvnv[PERL_ARENA_SIZE / sizeof(XPVNV) - 1];
1411 PL_xpvnv_root = ++xpvnv;
1412 while (xpvnv < xpvnvend) {
1413 xpvnv->xpv_pv = (char*)(xpvnv + 1);
1419 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1428 xpvcv = PL_xpvcv_root;
1429 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
1434 /* return a struct xpvcv to the free list */
1437 S_del_xpvcv(pTHX_ XPVCV *p)
1440 p->xpv_pv = (char*)PL_xpvcv_root;
1445 /* allocate another arena's worth of struct xpvcv */
1450 register XPVCV* xpvcv;
1451 register XPVCV* xpvcvend;
1452 New(716, xpvcv, PERL_ARENA_SIZE/sizeof(XPVCV), XPVCV);
1453 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
1454 PL_xpvcv_arenaroot = xpvcv;
1456 xpvcvend = &xpvcv[PERL_ARENA_SIZE / sizeof(XPVCV) - 1];
1457 PL_xpvcv_root = ++xpvcv;
1458 while (xpvcv < xpvcvend) {
1459 xpvcv->xpv_pv = (char*)(xpvcv + 1);
1465 /* grab a new struct xpvav from the free list, allocating more if necessary */
1474 xpvav = PL_xpvav_root;
1475 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
1480 /* return a struct xpvav to the free list */
1483 S_del_xpvav(pTHX_ XPVAV *p)
1486 p->xav_array = (char*)PL_xpvav_root;
1491 /* allocate another arena's worth of struct xpvav */
1496 register XPVAV* xpvav;
1497 register XPVAV* xpvavend;
1498 New(717, xpvav, PERL_ARENA_SIZE/sizeof(XPVAV), XPVAV);
1499 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
1500 PL_xpvav_arenaroot = xpvav;
1502 xpvavend = &xpvav[PERL_ARENA_SIZE / sizeof(XPVAV) - 1];
1503 PL_xpvav_root = ++xpvav;
1504 while (xpvav < xpvavend) {
1505 xpvav->xav_array = (char*)(xpvav + 1);
1508 xpvav->xav_array = 0;
1511 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1520 xpvhv = PL_xpvhv_root;
1521 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
1526 /* return a struct xpvhv to the free list */
1529 S_del_xpvhv(pTHX_ XPVHV *p)
1532 p->xhv_array = (char*)PL_xpvhv_root;
1537 /* allocate another arena's worth of struct xpvhv */
1542 register XPVHV* xpvhv;
1543 register XPVHV* xpvhvend;
1544 New(718, xpvhv, PERL_ARENA_SIZE/sizeof(XPVHV), XPVHV);
1545 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1546 PL_xpvhv_arenaroot = xpvhv;
1548 xpvhvend = &xpvhv[PERL_ARENA_SIZE / sizeof(XPVHV) - 1];
1549 PL_xpvhv_root = ++xpvhv;
1550 while (xpvhv < xpvhvend) {
1551 xpvhv->xhv_array = (char*)(xpvhv + 1);
1554 xpvhv->xhv_array = 0;
1557 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1566 xpvmg = PL_xpvmg_root;
1567 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1572 /* return a struct xpvmg to the free list */
1575 S_del_xpvmg(pTHX_ XPVMG *p)
1578 p->xpv_pv = (char*)PL_xpvmg_root;
1583 /* allocate another arena's worth of struct xpvmg */
1588 register XPVMG* xpvmg;
1589 register XPVMG* xpvmgend;
1590 New(719, xpvmg, PERL_ARENA_SIZE/sizeof(XPVMG), XPVMG);
1591 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1592 PL_xpvmg_arenaroot = xpvmg;
1594 xpvmgend = &xpvmg[PERL_ARENA_SIZE / sizeof(XPVMG) - 1];
1595 PL_xpvmg_root = ++xpvmg;
1596 while (xpvmg < xpvmgend) {
1597 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1603 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1612 xpvlv = PL_xpvlv_root;
1613 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1618 /* return a struct xpvlv to the free list */
1621 S_del_xpvlv(pTHX_ XPVLV *p)
1624 p->xpv_pv = (char*)PL_xpvlv_root;
1629 /* allocate another arena's worth of struct xpvlv */
1634 register XPVLV* xpvlv;
1635 register XPVLV* xpvlvend;
1636 New(720, xpvlv, PERL_ARENA_SIZE/sizeof(XPVLV), XPVLV);
1637 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1638 PL_xpvlv_arenaroot = xpvlv;
1640 xpvlvend = &xpvlv[PERL_ARENA_SIZE / sizeof(XPVLV) - 1];
1641 PL_xpvlv_root = ++xpvlv;
1642 while (xpvlv < xpvlvend) {
1643 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1649 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1658 xpvbm = PL_xpvbm_root;
1659 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1664 /* return a struct xpvbm to the free list */
1667 S_del_xpvbm(pTHX_ XPVBM *p)
1670 p->xpv_pv = (char*)PL_xpvbm_root;
1675 /* allocate another arena's worth of struct xpvbm */
1680 register XPVBM* xpvbm;
1681 register XPVBM* xpvbmend;
1682 New(721, xpvbm, PERL_ARENA_SIZE/sizeof(XPVBM), XPVBM);
1683 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1684 PL_xpvbm_arenaroot = xpvbm;
1686 xpvbmend = &xpvbm[PERL_ARENA_SIZE / sizeof(XPVBM) - 1];
1687 PL_xpvbm_root = ++xpvbm;
1688 while (xpvbm < xpvbmend) {
1689 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1695 #define my_safemalloc(s) (void*)safemalloc(s)
1696 #define my_safefree(p) safefree((char*)p)
1700 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1701 #define del_XIV(p) my_safefree(p)
1703 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1704 #define del_XNV(p) my_safefree(p)
1706 #define new_XRV() my_safemalloc(sizeof(XRV))
1707 #define del_XRV(p) my_safefree(p)
1709 #define new_XPV() my_safemalloc(sizeof(XPV))
1710 #define del_XPV(p) my_safefree(p)
1712 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1713 #define del_XPVIV(p) my_safefree(p)
1715 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1716 #define del_XPVNV(p) my_safefree(p)
1718 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1719 #define del_XPVCV(p) my_safefree(p)
1721 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1722 #define del_XPVAV(p) my_safefree(p)
1724 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1725 #define del_XPVHV(p) my_safefree(p)
1727 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1728 #define del_XPVMG(p) my_safefree(p)
1730 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1731 #define del_XPVLV(p) my_safefree(p)
1733 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1734 #define del_XPVBM(p) my_safefree(p)
1738 #define new_XIV() (void*)new_xiv()
1739 #define del_XIV(p) del_xiv((XPVIV*) p)
1741 #define new_XNV() (void*)new_xnv()
1742 #define del_XNV(p) del_xnv((XPVNV*) p)
1744 #define new_XRV() (void*)new_xrv()
1745 #define del_XRV(p) del_xrv((XRV*) p)
1747 #define new_XPV() (void*)new_xpv()
1748 #define del_XPV(p) del_xpv((XPV *)p)
1750 #define new_XPVIV() (void*)new_xpviv()
1751 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1753 #define new_XPVNV() (void*)new_xpvnv()
1754 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1756 #define new_XPVCV() (void*)new_xpvcv()
1757 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1759 #define new_XPVAV() (void*)new_xpvav()
1760 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1762 #define new_XPVHV() (void*)new_xpvhv()
1763 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1765 #define new_XPVMG() (void*)new_xpvmg()
1766 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1768 #define new_XPVLV() (void*)new_xpvlv()
1769 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1771 #define new_XPVBM() (void*)new_xpvbm()
1772 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1776 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1777 #define del_XPVGV(p) my_safefree(p)
1779 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1780 #define del_XPVFM(p) my_safefree(p)
1782 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1783 #define del_XPVIO(p) my_safefree(p)
1786 =for apidoc sv_upgrade
1788 Upgrade an SV to a more complex form. Generally adds a new body type to the
1789 SV, then copies across as much information as possible from the old body.
1790 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1796 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1807 if (mt != SVt_PV && SvIsCOW(sv)) {
1808 sv_force_normal_flags(sv, 0);
1811 if (SvTYPE(sv) == mt)
1822 switch (SvTYPE(sv)) {
1830 else if (mt < SVt_PVIV)
1840 pv = (char*)SvRV(sv);
1850 else if (mt == SVt_NV)
1858 del_XPVIV(SvANY(sv));
1866 del_XPVNV(SvANY(sv));
1869 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1870 there's no way that it can be safely upgraded, because perl.c
1871 expects to Safefree(SvANY(PL_mess_sv)) */
1872 assert(sv != PL_mess_sv);
1878 magic = SvMAGIC(sv);
1879 stash = SvSTASH(sv);
1880 del_XPVMG(SvANY(sv));
1883 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1886 SvFLAGS(sv) &= ~SVTYPEMASK;
1891 Perl_croak(aTHX_ "Can't upgrade to undef");
1893 SvANY(sv) = new_XIV();
1897 SvANY(sv) = new_XNV();
1901 SvANY(sv) = new_XRV();
1902 SvRV_set(sv, (SV*)pv);
1905 SvANY(sv) = new_XPVHV();
1912 HvTOTALKEYS(sv) = 0;
1913 HvPLACEHOLDERS(sv) = 0;
1915 /* Fall through... */
1918 SvANY(sv) = new_XPVAV();
1923 AvFLAGS(sv) = AVf_REAL;
1928 /* XXX? Only SVt_NULL is ever upgraded to AV or HV? */
1930 /* FIXME. Should be able to remove all this if()... if the above
1931 assertion is genuinely always true. */
1934 SvFLAGS(sv) &= ~SVf_OOK;
1937 SvPV_set(sv, (char*)0);
1938 SvMAGIC_set(sv, magic);
1939 SvSTASH_set(sv, stash);
1943 SvANY(sv) = new_XPVIO();
1944 Zero(SvANY(sv), 1, XPVIO);
1945 IoPAGE_LEN(sv) = 60;
1946 goto set_magic_common;
1948 SvANY(sv) = new_XPVFM();
1949 Zero(SvANY(sv), 1, XPVFM);
1950 goto set_magic_common;
1952 SvANY(sv) = new_XPVBM();
1956 goto set_magic_common;
1958 SvANY(sv) = new_XPVGV();
1964 goto set_magic_common;
1966 SvANY(sv) = new_XPVCV();
1967 Zero(SvANY(sv), 1, XPVCV);
1968 goto set_magic_common;
1970 SvANY(sv) = new_XPVLV();
1983 SvANY(sv) = new_XPVMG();
1986 SvMAGIC_set(sv, magic);
1987 SvSTASH_set(sv, stash);
1991 SvANY(sv) = new_XPVNV();
1997 SvANY(sv) = new_XPVIV();
2006 SvANY(sv) = new_XPV();
2017 =for apidoc sv_backoff
2019 Remove any string offset. You should normally use the C<SvOOK_off> macro
2026 Perl_sv_backoff(pTHX_ register SV *sv)
2030 char *s = SvPVX(sv);
2031 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
2032 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
2034 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
2036 SvFLAGS(sv) &= ~SVf_OOK;
2043 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2044 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2045 Use the C<SvGROW> wrapper instead.
2051 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2055 #ifdef HAS_64K_LIMIT
2056 if (newlen >= 0x10000) {
2057 PerlIO_printf(Perl_debug_log,
2058 "Allocation too large: %"UVxf"\n", (UV)newlen);
2061 #endif /* HAS_64K_LIMIT */
2064 if (SvTYPE(sv) < SVt_PV) {
2065 sv_upgrade(sv, SVt_PV);
2068 else if (SvOOK(sv)) { /* pv is offset? */
2071 if (newlen > SvLEN(sv))
2072 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2073 #ifdef HAS_64K_LIMIT
2074 if (newlen >= 0x10000)
2081 if (newlen > SvLEN(sv)) { /* need more room? */
2082 if (SvLEN(sv) && s) {
2084 STRLEN l = malloced_size((void*)SvPVX(sv));
2090 Renew(s,newlen,char);
2093 New(703, s, newlen, char);
2094 if (SvPVX(sv) && SvCUR(sv)) {
2095 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2099 SvLEN_set(sv, newlen);
2105 =for apidoc sv_setiv
2107 Copies an integer into the given SV, upgrading first if necessary.
2108 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2114 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2116 SV_CHECK_THINKFIRST_COW_DROP(sv);
2117 switch (SvTYPE(sv)) {
2119 sv_upgrade(sv, SVt_IV);
2122 sv_upgrade(sv, SVt_PVNV);
2126 sv_upgrade(sv, SVt_PVIV);
2135 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2138 (void)SvIOK_only(sv); /* validate number */
2144 =for apidoc sv_setiv_mg
2146 Like C<sv_setiv>, but also handles 'set' magic.
2152 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2159 =for apidoc sv_setuv
2161 Copies an unsigned integer into the given SV, upgrading first if necessary.
2162 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2168 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2170 /* With these two if statements:
2171 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2174 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2176 If you wish to remove them, please benchmark to see what the effect is
2178 if (u <= (UV)IV_MAX) {
2179 sv_setiv(sv, (IV)u);
2188 =for apidoc sv_setuv_mg
2190 Like C<sv_setuv>, but also handles 'set' magic.
2196 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2198 /* With these two if statements:
2199 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2202 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2204 If you wish to remove them, please benchmark to see what the effect is
2206 if (u <= (UV)IV_MAX) {
2207 sv_setiv(sv, (IV)u);
2217 =for apidoc sv_setnv
2219 Copies a double into the given SV, upgrading first if necessary.
2220 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2226 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2228 SV_CHECK_THINKFIRST_COW_DROP(sv);
2229 switch (SvTYPE(sv)) {
2232 sv_upgrade(sv, SVt_NV);
2237 sv_upgrade(sv, SVt_PVNV);
2246 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2250 (void)SvNOK_only(sv); /* validate number */
2255 =for apidoc sv_setnv_mg
2257 Like C<sv_setnv>, but also handles 'set' magic.
2263 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2269 /* Print an "isn't numeric" warning, using a cleaned-up,
2270 * printable version of the offending string
2274 S_not_a_number(pTHX_ SV *sv)
2281 dsv = sv_2mortal(newSVpv("", 0));
2282 pv = sv_uni_display(dsv, sv, 10, 0);
2285 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2286 /* each *s can expand to 4 chars + "...\0",
2287 i.e. need room for 8 chars */
2290 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2292 if (ch & 128 && !isPRINT_LC(ch)) {
2301 else if (ch == '\r') {
2305 else if (ch == '\f') {
2309 else if (ch == '\\') {
2313 else if (ch == '\0') {
2317 else if (isPRINT_LC(ch))
2334 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2335 "Argument \"%s\" isn't numeric in %s", pv,
2338 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2339 "Argument \"%s\" isn't numeric", pv);
2343 =for apidoc looks_like_number
2345 Test if the content of an SV looks like a number (or is a number).
2346 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2347 non-numeric warning), even if your atof() doesn't grok them.
2353 Perl_looks_like_number(pTHX_ SV *sv)
2355 register char *sbegin;
2362 else if (SvPOKp(sv))
2363 sbegin = SvPV(sv, len);
2365 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2366 return grok_number(sbegin, len, NULL);
2369 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2370 until proven guilty, assume that things are not that bad... */
2375 As 64 bit platforms often have an NV that doesn't preserve all bits of
2376 an IV (an assumption perl has been based on to date) it becomes necessary
2377 to remove the assumption that the NV always carries enough precision to
2378 recreate the IV whenever needed, and that the NV is the canonical form.
2379 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2380 precision as a side effect of conversion (which would lead to insanity
2381 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2382 1) to distinguish between IV/UV/NV slots that have cached a valid
2383 conversion where precision was lost and IV/UV/NV slots that have a
2384 valid conversion which has lost no precision
2385 2) to ensure that if a numeric conversion to one form is requested that
2386 would lose precision, the precise conversion (or differently
2387 imprecise conversion) is also performed and cached, to prevent
2388 requests for different numeric formats on the same SV causing
2389 lossy conversion chains. (lossless conversion chains are perfectly
2394 SvIOKp is true if the IV slot contains a valid value
2395 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2396 SvNOKp is true if the NV slot contains a valid value
2397 SvNOK is true only if the NV value is accurate
2400 while converting from PV to NV, check to see if converting that NV to an
2401 IV(or UV) would lose accuracy over a direct conversion from PV to
2402 IV(or UV). If it would, cache both conversions, return NV, but mark
2403 SV as IOK NOKp (ie not NOK).
2405 While converting from PV to IV, check to see if converting that IV to an
2406 NV would lose accuracy over a direct conversion from PV to NV. If it
2407 would, cache both conversions, flag similarly.
2409 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2410 correctly because if IV & NV were set NV *always* overruled.
2411 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2412 changes - now IV and NV together means that the two are interchangeable:
2413 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2415 The benefit of this is that operations such as pp_add know that if
2416 SvIOK is true for both left and right operands, then integer addition
2417 can be used instead of floating point (for cases where the result won't
2418 overflow). Before, floating point was always used, which could lead to
2419 loss of precision compared with integer addition.
2421 * making IV and NV equal status should make maths accurate on 64 bit
2423 * may speed up maths somewhat if pp_add and friends start to use
2424 integers when possible instead of fp. (Hopefully the overhead in
2425 looking for SvIOK and checking for overflow will not outweigh the
2426 fp to integer speedup)
2427 * will slow down integer operations (callers of SvIV) on "inaccurate"
2428 values, as the change from SvIOK to SvIOKp will cause a call into
2429 sv_2iv each time rather than a macro access direct to the IV slot
2430 * should speed up number->string conversion on integers as IV is
2431 favoured when IV and NV are equally accurate
2433 ####################################################################
2434 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2435 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2436 On the other hand, SvUOK is true iff UV.
2437 ####################################################################
2439 Your mileage will vary depending your CPU's relative fp to integer
2443 #ifndef NV_PRESERVES_UV
2444 # define IS_NUMBER_UNDERFLOW_IV 1
2445 # define IS_NUMBER_UNDERFLOW_UV 2
2446 # define IS_NUMBER_IV_AND_UV 2
2447 # define IS_NUMBER_OVERFLOW_IV 4
2448 # define IS_NUMBER_OVERFLOW_UV 5
2450 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2452 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2454 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2456 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));
2457 if (SvNVX(sv) < (NV)IV_MIN) {
2458 (void)SvIOKp_on(sv);
2460 SvIV_set(sv, IV_MIN);
2461 return IS_NUMBER_UNDERFLOW_IV;
2463 if (SvNVX(sv) > (NV)UV_MAX) {
2464 (void)SvIOKp_on(sv);
2467 SvUV_set(sv, UV_MAX);
2468 return IS_NUMBER_OVERFLOW_UV;
2470 (void)SvIOKp_on(sv);
2472 /* Can't use strtol etc to convert this string. (See truth table in
2474 if (SvNVX(sv) <= (UV)IV_MAX) {
2475 SvIV_set(sv, I_V(SvNVX(sv)));
2476 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2477 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2479 /* Integer is imprecise. NOK, IOKp */
2481 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2484 SvUV_set(sv, U_V(SvNVX(sv)));
2485 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2486 if (SvUVX(sv) == UV_MAX) {
2487 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2488 possibly be preserved by NV. Hence, it must be overflow.
2490 return IS_NUMBER_OVERFLOW_UV;
2492 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2494 /* Integer is imprecise. NOK, IOKp */
2496 return IS_NUMBER_OVERFLOW_IV;
2498 #endif /* !NV_PRESERVES_UV*/
2500 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2501 * this function provided for binary compatibility only
2505 Perl_sv_2iv(pTHX_ register SV *sv)
2507 return sv_2iv_flags(sv, SV_GMAGIC);
2511 =for apidoc sv_2iv_flags
2513 Return the integer value of an SV, doing any necessary string
2514 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2515 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2521 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2525 if (SvGMAGICAL(sv)) {
2526 if (flags & SV_GMAGIC)
2531 return I_V(SvNVX(sv));
2533 if (SvPOKp(sv) && SvLEN(sv))
2536 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2537 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2543 if (SvTHINKFIRST(sv)) {
2546 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2547 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2548 return SvIV(tmpstr);
2549 return PTR2IV(SvRV(sv));
2552 sv_force_normal_flags(sv, 0);
2554 if (SvREADONLY(sv) && !SvOK(sv)) {
2555 if (ckWARN(WARN_UNINITIALIZED))
2562 return (IV)(SvUVX(sv));
2569 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2570 * without also getting a cached IV/UV from it at the same time
2571 * (ie PV->NV conversion should detect loss of accuracy and cache
2572 * IV or UV at same time to avoid this. NWC */
2574 if (SvTYPE(sv) == SVt_NV)
2575 sv_upgrade(sv, SVt_PVNV);
2577 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2578 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2579 certainly cast into the IV range at IV_MAX, whereas the correct
2580 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2582 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2583 SvIV_set(sv, I_V(SvNVX(sv)));
2584 if (SvNVX(sv) == (NV) SvIVX(sv)
2585 #ifndef NV_PRESERVES_UV
2586 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2587 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2588 /* Don't flag it as "accurately an integer" if the number
2589 came from a (by definition imprecise) NV operation, and
2590 we're outside the range of NV integer precision */
2593 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2594 DEBUG_c(PerlIO_printf(Perl_debug_log,
2595 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2601 /* IV not precise. No need to convert from PV, as NV
2602 conversion would already have cached IV if it detected
2603 that PV->IV would be better than PV->NV->IV
2604 flags already correct - don't set public IOK. */
2605 DEBUG_c(PerlIO_printf(Perl_debug_log,
2606 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2611 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2612 but the cast (NV)IV_MIN rounds to a the value less (more
2613 negative) than IV_MIN which happens to be equal to SvNVX ??
2614 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2615 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2616 (NV)UVX == NVX are both true, but the values differ. :-(
2617 Hopefully for 2s complement IV_MIN is something like
2618 0x8000000000000000 which will be exact. NWC */
2621 SvUV_set(sv, U_V(SvNVX(sv)));
2623 (SvNVX(sv) == (NV) SvUVX(sv))
2624 #ifndef NV_PRESERVES_UV
2625 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2626 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2627 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2628 /* Don't flag it as "accurately an integer" if the number
2629 came from a (by definition imprecise) NV operation, and
2630 we're outside the range of NV integer precision */
2636 DEBUG_c(PerlIO_printf(Perl_debug_log,
2637 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2641 return (IV)SvUVX(sv);
2644 else if (SvPOKp(sv) && SvLEN(sv)) {
2646 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2647 /* We want to avoid a possible problem when we cache an IV which
2648 may be later translated to an NV, and the resulting NV is not
2649 the same as the direct translation of the initial string
2650 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2651 be careful to ensure that the value with the .456 is around if the
2652 NV value is requested in the future).
2654 This means that if we cache such an IV, we need to cache the
2655 NV as well. Moreover, we trade speed for space, and do not
2656 cache the NV if we are sure it's not needed.
2659 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2660 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2661 == IS_NUMBER_IN_UV) {
2662 /* It's definitely an integer, only upgrade to PVIV */
2663 if (SvTYPE(sv) < SVt_PVIV)
2664 sv_upgrade(sv, SVt_PVIV);
2666 } else if (SvTYPE(sv) < SVt_PVNV)
2667 sv_upgrade(sv, SVt_PVNV);
2669 /* If NV preserves UV then we only use the UV value if we know that
2670 we aren't going to call atof() below. If NVs don't preserve UVs
2671 then the value returned may have more precision than atof() will
2672 return, even though value isn't perfectly accurate. */
2673 if ((numtype & (IS_NUMBER_IN_UV
2674 #ifdef NV_PRESERVES_UV
2677 )) == IS_NUMBER_IN_UV) {
2678 /* This won't turn off the public IOK flag if it was set above */
2679 (void)SvIOKp_on(sv);
2681 if (!(numtype & IS_NUMBER_NEG)) {
2683 if (value <= (UV)IV_MAX) {
2684 SvIV_set(sv, (IV)value);
2686 SvUV_set(sv, value);
2690 /* 2s complement assumption */
2691 if (value <= (UV)IV_MIN) {
2692 SvIV_set(sv, -(IV)value);
2694 /* Too negative for an IV. This is a double upgrade, but
2695 I'm assuming it will be rare. */
2696 if (SvTYPE(sv) < SVt_PVNV)
2697 sv_upgrade(sv, SVt_PVNV);
2701 SvNV_set(sv, -(NV)value);
2702 SvIV_set(sv, IV_MIN);
2706 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2707 will be in the previous block to set the IV slot, and the next
2708 block to set the NV slot. So no else here. */
2710 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2711 != IS_NUMBER_IN_UV) {
2712 /* It wasn't an (integer that doesn't overflow the UV). */
2713 SvNV_set(sv, Atof(SvPVX(sv)));
2715 if (! numtype && ckWARN(WARN_NUMERIC))
2718 #if defined(USE_LONG_DOUBLE)
2719 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2720 PTR2UV(sv), SvNVX(sv)));
2722 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2723 PTR2UV(sv), SvNVX(sv)));
2727 #ifdef NV_PRESERVES_UV
2728 (void)SvIOKp_on(sv);
2730 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2731 SvIV_set(sv, I_V(SvNVX(sv)));
2732 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2735 /* Integer is imprecise. NOK, IOKp */
2737 /* UV will not work better than IV */
2739 if (SvNVX(sv) > (NV)UV_MAX) {
2741 /* Integer is inaccurate. NOK, IOKp, is UV */
2742 SvUV_set(sv, UV_MAX);
2745 SvUV_set(sv, U_V(SvNVX(sv)));
2746 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2747 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2751 /* Integer is imprecise. NOK, IOKp, is UV */
2757 #else /* NV_PRESERVES_UV */
2758 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2759 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2760 /* The IV slot will have been set from value returned by
2761 grok_number above. The NV slot has just been set using
2764 assert (SvIOKp(sv));
2766 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2767 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2768 /* Small enough to preserve all bits. */
2769 (void)SvIOKp_on(sv);
2771 SvIV_set(sv, I_V(SvNVX(sv)));
2772 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2774 /* Assumption: first non-preserved integer is < IV_MAX,
2775 this NV is in the preserved range, therefore: */
2776 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2778 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);
2782 0 0 already failed to read UV.
2783 0 1 already failed to read UV.
2784 1 0 you won't get here in this case. IV/UV
2785 slot set, public IOK, Atof() unneeded.
2786 1 1 already read UV.
2787 so there's no point in sv_2iuv_non_preserve() attempting
2788 to use atol, strtol, strtoul etc. */
2789 if (sv_2iuv_non_preserve (sv, numtype)
2790 >= IS_NUMBER_OVERFLOW_IV)
2794 #endif /* NV_PRESERVES_UV */
2797 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2799 if (SvTYPE(sv) < SVt_IV)
2800 /* Typically the caller expects that sv_any is not NULL now. */
2801 sv_upgrade(sv, SVt_IV);
2804 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2805 PTR2UV(sv),SvIVX(sv)));
2806 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2809 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2810 * this function provided for binary compatibility only
2814 Perl_sv_2uv(pTHX_ register SV *sv)
2816 return sv_2uv_flags(sv, SV_GMAGIC);
2820 =for apidoc sv_2uv_flags
2822 Return the unsigned integer value of an SV, doing any necessary string
2823 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2824 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2830 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2834 if (SvGMAGICAL(sv)) {
2835 if (flags & SV_GMAGIC)
2840 return U_V(SvNVX(sv));
2841 if (SvPOKp(sv) && SvLEN(sv))
2844 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2845 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2851 if (SvTHINKFIRST(sv)) {
2854 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2855 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2856 return SvUV(tmpstr);
2857 return PTR2UV(SvRV(sv));
2860 sv_force_normal_flags(sv, 0);
2862 if (SvREADONLY(sv) && !SvOK(sv)) {
2863 if (ckWARN(WARN_UNINITIALIZED))
2873 return (UV)SvIVX(sv);
2877 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2878 * without also getting a cached IV/UV from it at the same time
2879 * (ie PV->NV conversion should detect loss of accuracy and cache
2880 * IV or UV at same time to avoid this. */
2881 /* IV-over-UV optimisation - choose to cache IV if possible */
2883 if (SvTYPE(sv) == SVt_NV)
2884 sv_upgrade(sv, SVt_PVNV);
2886 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2887 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2888 SvIV_set(sv, I_V(SvNVX(sv)));
2889 if (SvNVX(sv) == (NV) SvIVX(sv)
2890 #ifndef NV_PRESERVES_UV
2891 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2892 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2893 /* Don't flag it as "accurately an integer" if the number
2894 came from a (by definition imprecise) NV operation, and
2895 we're outside the range of NV integer precision */
2898 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2899 DEBUG_c(PerlIO_printf(Perl_debug_log,
2900 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2906 /* IV not precise. No need to convert from PV, as NV
2907 conversion would already have cached IV if it detected
2908 that PV->IV would be better than PV->NV->IV
2909 flags already correct - don't set public IOK. */
2910 DEBUG_c(PerlIO_printf(Perl_debug_log,
2911 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2916 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2917 but the cast (NV)IV_MIN rounds to a the value less (more
2918 negative) than IV_MIN which happens to be equal to SvNVX ??
2919 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2920 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2921 (NV)UVX == NVX are both true, but the values differ. :-(
2922 Hopefully for 2s complement IV_MIN is something like
2923 0x8000000000000000 which will be exact. NWC */
2926 SvUV_set(sv, U_V(SvNVX(sv)));
2928 (SvNVX(sv) == (NV) SvUVX(sv))
2929 #ifndef NV_PRESERVES_UV
2930 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2931 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2932 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2933 /* Don't flag it as "accurately an integer" if the number
2934 came from a (by definition imprecise) NV operation, and
2935 we're outside the range of NV integer precision */
2940 DEBUG_c(PerlIO_printf(Perl_debug_log,
2941 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2947 else if (SvPOKp(sv) && SvLEN(sv)) {
2949 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2951 /* We want to avoid a possible problem when we cache a UV which
2952 may be later translated to an NV, and the resulting NV is not
2953 the translation of the initial data.
2955 This means that if we cache such a UV, we need to cache the
2956 NV as well. Moreover, we trade speed for space, and do not
2957 cache the NV if not needed.
2960 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2961 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2962 == IS_NUMBER_IN_UV) {
2963 /* It's definitely an integer, only upgrade to PVIV */
2964 if (SvTYPE(sv) < SVt_PVIV)
2965 sv_upgrade(sv, SVt_PVIV);
2967 } else if (SvTYPE(sv) < SVt_PVNV)
2968 sv_upgrade(sv, SVt_PVNV);
2970 /* If NV preserves UV then we only use the UV value if we know that
2971 we aren't going to call atof() below. If NVs don't preserve UVs
2972 then the value returned may have more precision than atof() will
2973 return, even though it isn't accurate. */
2974 if ((numtype & (IS_NUMBER_IN_UV
2975 #ifdef NV_PRESERVES_UV
2978 )) == IS_NUMBER_IN_UV) {
2979 /* This won't turn off the public IOK flag if it was set above */
2980 (void)SvIOKp_on(sv);
2982 if (!(numtype & IS_NUMBER_NEG)) {
2984 if (value <= (UV)IV_MAX) {
2985 SvIV_set(sv, (IV)value);
2987 /* it didn't overflow, and it was positive. */
2988 SvUV_set(sv, value);
2992 /* 2s complement assumption */
2993 if (value <= (UV)IV_MIN) {
2994 SvIV_set(sv, -(IV)value);
2996 /* Too negative for an IV. This is a double upgrade, but
2997 I'm assuming it will be rare. */
2998 if (SvTYPE(sv) < SVt_PVNV)
2999 sv_upgrade(sv, SVt_PVNV);
3003 SvNV_set(sv, -(NV)value);
3004 SvIV_set(sv, IV_MIN);
3009 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3010 != IS_NUMBER_IN_UV) {
3011 /* It wasn't an integer, or it overflowed the UV. */
3012 SvNV_set(sv, Atof(SvPVX(sv)));
3014 if (! numtype && ckWARN(WARN_NUMERIC))
3017 #if defined(USE_LONG_DOUBLE)
3018 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
3019 PTR2UV(sv), SvNVX(sv)));
3021 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
3022 PTR2UV(sv), SvNVX(sv)));
3025 #ifdef NV_PRESERVES_UV
3026 (void)SvIOKp_on(sv);
3028 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3029 SvIV_set(sv, I_V(SvNVX(sv)));
3030 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
3033 /* Integer is imprecise. NOK, IOKp */
3035 /* UV will not work better than IV */
3037 if (SvNVX(sv) > (NV)UV_MAX) {
3039 /* Integer is inaccurate. NOK, IOKp, is UV */
3040 SvUV_set(sv, UV_MAX);
3043 SvUV_set(sv, U_V(SvNVX(sv)));
3044 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3045 NV preservse UV so can do correct comparison. */
3046 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3050 /* Integer is imprecise. NOK, IOKp, is UV */
3055 #else /* NV_PRESERVES_UV */
3056 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3057 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3058 /* The UV slot will have been set from value returned by
3059 grok_number above. The NV slot has just been set using
3062 assert (SvIOKp(sv));
3064 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3065 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3066 /* Small enough to preserve all bits. */
3067 (void)SvIOKp_on(sv);
3069 SvIV_set(sv, I_V(SvNVX(sv)));
3070 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3072 /* Assumption: first non-preserved integer is < IV_MAX,
3073 this NV is in the preserved range, therefore: */
3074 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3076 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);
3079 sv_2iuv_non_preserve (sv, numtype);
3081 #endif /* NV_PRESERVES_UV */
3085 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3086 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3089 if (SvTYPE(sv) < SVt_IV)
3090 /* Typically the caller expects that sv_any is not NULL now. */
3091 sv_upgrade(sv, SVt_IV);
3095 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3096 PTR2UV(sv),SvUVX(sv)));
3097 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3103 Return the num value of an SV, doing any necessary string or integer
3104 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3111 Perl_sv_2nv(pTHX_ register SV *sv)
3115 if (SvGMAGICAL(sv)) {
3119 if (SvPOKp(sv) && SvLEN(sv)) {
3120 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3121 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
3123 return Atof(SvPVX(sv));
3127 return (NV)SvUVX(sv);
3129 return (NV)SvIVX(sv);
3132 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3133 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3139 if (SvTHINKFIRST(sv)) {
3142 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3143 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3144 return SvNV(tmpstr);
3145 return PTR2NV(SvRV(sv));
3148 sv_force_normal_flags(sv, 0);
3150 if (SvREADONLY(sv) && !SvOK(sv)) {
3151 if (ckWARN(WARN_UNINITIALIZED))
3156 if (SvTYPE(sv) < SVt_NV) {
3157 if (SvTYPE(sv) == SVt_IV)
3158 sv_upgrade(sv, SVt_PVNV);
3160 sv_upgrade(sv, SVt_NV);
3161 #ifdef USE_LONG_DOUBLE
3163 STORE_NUMERIC_LOCAL_SET_STANDARD();
3164 PerlIO_printf(Perl_debug_log,
3165 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3166 PTR2UV(sv), SvNVX(sv));
3167 RESTORE_NUMERIC_LOCAL();
3171 STORE_NUMERIC_LOCAL_SET_STANDARD();
3172 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3173 PTR2UV(sv), SvNVX(sv));
3174 RESTORE_NUMERIC_LOCAL();
3178 else if (SvTYPE(sv) < SVt_PVNV)
3179 sv_upgrade(sv, SVt_PVNV);
3184 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3185 #ifdef NV_PRESERVES_UV
3188 /* Only set the public NV OK flag if this NV preserves the IV */
3189 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3190 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3191 : (SvIVX(sv) == I_V(SvNVX(sv))))
3197 else if (SvPOKp(sv) && SvLEN(sv)) {
3199 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3200 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3202 #ifdef NV_PRESERVES_UV
3203 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3204 == IS_NUMBER_IN_UV) {
3205 /* It's definitely an integer */
3206 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3208 SvNV_set(sv, Atof(SvPVX(sv)));
3211 SvNV_set(sv, Atof(SvPVX(sv)));
3212 /* Only set the public NV OK flag if this NV preserves the value in
3213 the PV at least as well as an IV/UV would.
3214 Not sure how to do this 100% reliably. */
3215 /* if that shift count is out of range then Configure's test is
3216 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3218 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3219 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3220 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3221 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3222 /* Can't use strtol etc to convert this string, so don't try.
3223 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3226 /* value has been set. It may not be precise. */
3227 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3228 /* 2s complement assumption for (UV)IV_MIN */
3229 SvNOK_on(sv); /* Integer is too negative. */
3234 if (numtype & IS_NUMBER_NEG) {
3235 SvIV_set(sv, -(IV)value);
3236 } else if (value <= (UV)IV_MAX) {
3237 SvIV_set(sv, (IV)value);
3239 SvUV_set(sv, value);
3243 if (numtype & IS_NUMBER_NOT_INT) {
3244 /* I believe that even if the original PV had decimals,
3245 they are lost beyond the limit of the FP precision.
3246 However, neither is canonical, so both only get p
3247 flags. NWC, 2000/11/25 */
3248 /* Both already have p flags, so do nothing */
3251 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3252 if (SvIVX(sv) == I_V(nv)) {
3257 /* It had no "." so it must be integer. */
3260 /* between IV_MAX and NV(UV_MAX).
3261 Could be slightly > UV_MAX */
3263 if (numtype & IS_NUMBER_NOT_INT) {
3264 /* UV and NV both imprecise. */
3266 UV nv_as_uv = U_V(nv);
3268 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3279 #endif /* NV_PRESERVES_UV */
3282 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3284 if (SvTYPE(sv) < SVt_NV)
3285 /* Typically the caller expects that sv_any is not NULL now. */
3286 /* XXX Ilya implies that this is a bug in callers that assume this
3287 and ideally should be fixed. */
3288 sv_upgrade(sv, SVt_NV);
3291 #if defined(USE_LONG_DOUBLE)
3293 STORE_NUMERIC_LOCAL_SET_STANDARD();
3294 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3295 PTR2UV(sv), SvNVX(sv));
3296 RESTORE_NUMERIC_LOCAL();
3300 STORE_NUMERIC_LOCAL_SET_STANDARD();
3301 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3302 PTR2UV(sv), SvNVX(sv));
3303 RESTORE_NUMERIC_LOCAL();
3309 /* asIV(): extract an integer from the string value of an SV.
3310 * Caller must validate PVX */
3313 S_asIV(pTHX_ SV *sv)
3316 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3318 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3319 == IS_NUMBER_IN_UV) {
3320 /* It's definitely an integer */
3321 if (numtype & IS_NUMBER_NEG) {
3322 if (value < (UV)IV_MIN)
3325 if (value < (UV)IV_MAX)
3330 if (ckWARN(WARN_NUMERIC))
3333 return I_V(Atof(SvPVX(sv)));
3336 /* asUV(): extract an unsigned integer from the string value of an SV
3337 * Caller must validate PVX */
3340 S_asUV(pTHX_ SV *sv)
3343 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3345 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3346 == IS_NUMBER_IN_UV) {
3347 /* It's definitely an integer */
3348 if (!(numtype & IS_NUMBER_NEG))
3352 if (ckWARN(WARN_NUMERIC))
3355 return U_V(Atof(SvPVX(sv)));
3359 =for apidoc sv_2pv_nolen
3361 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3362 use the macro wrapper C<SvPV_nolen(sv)> instead.
3367 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3370 return sv_2pv(sv, &n_a);
3373 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3374 * UV as a string towards the end of buf, and return pointers to start and
3377 * We assume that buf is at least TYPE_CHARS(UV) long.
3381 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3383 char *ptr = buf + TYPE_CHARS(UV);
3397 *--ptr = '0' + (char)(uv % 10);
3405 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3406 * this function provided for binary compatibility only
3410 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3412 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3416 =for apidoc sv_2pv_flags
3418 Returns a pointer to the string value of an SV, and sets *lp to its length.
3419 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3421 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3422 usually end up here too.
3428 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3433 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3434 char *tmpbuf = tbuf;
3440 if (SvGMAGICAL(sv)) {
3441 if (flags & SV_GMAGIC)
3449 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3451 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3456 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3461 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3462 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3469 if (SvTHINKFIRST(sv)) {
3472 register const char *typestr;
3473 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3474 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3475 char *pv = SvPV(tmpstr, *lp);
3485 typestr = "NULLREF";
3489 switch (SvTYPE(sv)) {
3491 if ( ((SvFLAGS(sv) &
3492 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3493 == (SVs_OBJECT|SVs_SMG))
3494 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3495 const regexp *re = (regexp *)mg->mg_obj;
3498 const char *fptr = "msix";
3503 char need_newline = 0;
3504 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3506 while((ch = *fptr++)) {
3508 reflags[left++] = ch;
3511 reflags[right--] = ch;
3516 reflags[left] = '-';
3520 mg->mg_len = re->prelen + 4 + left;
3522 * If /x was used, we have to worry about a regex
3523 * ending with a comment later being embedded
3524 * within another regex. If so, we don't want this
3525 * regex's "commentization" to leak out to the
3526 * right part of the enclosing regex, we must cap
3527 * it with a newline.
3529 * So, if /x was used, we scan backwards from the
3530 * end of the regex. If we find a '#' before we
3531 * find a newline, we need to add a newline
3532 * ourself. If we find a '\n' first (or if we
3533 * don't find '#' or '\n'), we don't need to add
3534 * anything. -jfriedl
3536 if (PMf_EXTENDED & re->reganch)
3538 const char *endptr = re->precomp + re->prelen;
3539 while (endptr >= re->precomp)
3541 const char c = *(endptr--);
3543 break; /* don't need another */
3545 /* we end while in a comment, so we
3547 mg->mg_len++; /* save space for it */
3548 need_newline = 1; /* note to add it */
3554 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3555 Copy("(?", mg->mg_ptr, 2, char);
3556 Copy(reflags, mg->mg_ptr+2, left, char);
3557 Copy(":", mg->mg_ptr+left+2, 1, char);
3558 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3560 mg->mg_ptr[mg->mg_len - 2] = '\n';
3561 mg->mg_ptr[mg->mg_len - 1] = ')';
3562 mg->mg_ptr[mg->mg_len] = 0;
3564 PL_reginterp_cnt += re->program[0].next_off;
3566 if (re->reganch & ROPT_UTF8)
3581 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3582 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3583 /* tied lvalues should appear to be
3584 * scalars for backwards compatitbility */
3585 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3586 ? "SCALAR" : "LVALUE"; break;
3587 case SVt_PVAV: typestr = "ARRAY"; break;
3588 case SVt_PVHV: typestr = "HASH"; break;
3589 case SVt_PVCV: typestr = "CODE"; break;
3590 case SVt_PVGV: typestr = "GLOB"; break;
3591 case SVt_PVFM: typestr = "FORMAT"; break;
3592 case SVt_PVIO: typestr = "IO"; break;
3593 default: typestr = "UNKNOWN"; break;
3597 const char *name = HvNAME(SvSTASH(sv));
3598 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3599 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3602 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3605 *lp = strlen(typestr);
3606 return (char *)typestr;
3608 if (SvREADONLY(sv) && !SvOK(sv)) {
3609 if (ckWARN(WARN_UNINITIALIZED))
3615 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3616 /* I'm assuming that if both IV and NV are equally valid then
3617 converting the IV is going to be more efficient */
3618 const U32 isIOK = SvIOK(sv);
3619 const U32 isUIOK = SvIsUV(sv);
3620 char buf[TYPE_CHARS(UV)];
3623 if (SvTYPE(sv) < SVt_PVIV)
3624 sv_upgrade(sv, SVt_PVIV);
3626 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3628 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3629 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3630 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3631 SvCUR_set(sv, ebuf - ptr);
3641 else if (SvNOKp(sv)) {
3642 if (SvTYPE(sv) < SVt_PVNV)
3643 sv_upgrade(sv, SVt_PVNV);
3644 /* The +20 is pure guesswork. Configure test needed. --jhi */
3645 SvGROW(sv, NV_DIG + 20);
3647 olderrno = errno; /* some Xenix systems wipe out errno here */
3649 if (SvNVX(sv) == 0.0)
3650 (void)strcpy(s,"0");
3654 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3657 #ifdef FIXNEGATIVEZERO
3658 if (*s == '-' && s[1] == '0' && !s[2])
3668 if (ckWARN(WARN_UNINITIALIZED)
3669 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3672 if (SvTYPE(sv) < SVt_PV)
3673 /* Typically the caller expects that sv_any is not NULL now. */
3674 sv_upgrade(sv, SVt_PV);
3677 *lp = s - SvPVX(sv);
3680 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3681 PTR2UV(sv),SvPVX(sv)));
3685 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3686 /* Sneaky stuff here */
3690 tsv = newSVpv(tmpbuf, 0);
3707 len = strlen(tmpbuf);
3709 #ifdef FIXNEGATIVEZERO
3710 if (len == 2 && t[0] == '-' && t[1] == '0') {
3715 (void)SvUPGRADE(sv, SVt_PV);
3717 s = SvGROW(sv, len + 1);
3720 return strcpy(s, t);
3725 =for apidoc sv_copypv
3727 Copies a stringified representation of the source SV into the
3728 destination SV. Automatically performs any necessary mg_get and
3729 coercion of numeric values into strings. Guaranteed to preserve
3730 UTF-8 flag even from overloaded objects. Similar in nature to
3731 sv_2pv[_flags] but operates directly on an SV instead of just the
3732 string. Mostly uses sv_2pv_flags to do its work, except when that
3733 would lose the UTF-8'ness of the PV.
3739 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3744 sv_setpvn(dsv,s,len);
3752 =for apidoc sv_2pvbyte_nolen
3754 Return a pointer to the byte-encoded representation of the SV.
3755 May cause the SV to be downgraded from UTF-8 as a side-effect.
3757 Usually accessed via the C<SvPVbyte_nolen> macro.
3763 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3766 return sv_2pvbyte(sv, &n_a);
3770 =for apidoc sv_2pvbyte
3772 Return a pointer to the byte-encoded representation of the SV, and set *lp
3773 to its length. May cause the SV to be downgraded from UTF-8 as a
3776 Usually accessed via the C<SvPVbyte> macro.
3782 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3784 sv_utf8_downgrade(sv,0);
3785 return SvPV(sv,*lp);
3789 =for apidoc sv_2pvutf8_nolen
3791 Return a pointer to the UTF-8-encoded representation of the SV.
3792 May cause the SV to be upgraded to UTF-8 as a side-effect.
3794 Usually accessed via the C<SvPVutf8_nolen> macro.
3800 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3803 return sv_2pvutf8(sv, &n_a);
3807 =for apidoc sv_2pvutf8
3809 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3810 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3812 Usually accessed via the C<SvPVutf8> macro.
3818 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3820 sv_utf8_upgrade(sv);
3821 return SvPV(sv,*lp);
3825 =for apidoc sv_2bool
3827 This function is only called on magical items, and is only used by
3828 sv_true() or its macro equivalent.
3834 Perl_sv_2bool(pTHX_ register SV *sv)
3843 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3844 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3845 return (bool)SvTRUE(tmpsv);
3846 return SvRV(sv) != 0;
3849 register XPV* Xpvtmp;
3850 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3851 (*Xpvtmp->xpv_pv > '0' ||
3852 Xpvtmp->xpv_cur > 1 ||
3853 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3860 return SvIVX(sv) != 0;
3863 return SvNVX(sv) != 0.0;
3870 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3871 * this function provided for binary compatibility only
3876 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3878 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3882 =for apidoc sv_utf8_upgrade
3884 Converts the PV of an SV to its UTF-8-encoded form.
3885 Forces the SV to string form if it is not already.
3886 Always sets the SvUTF8 flag to avoid future validity checks even
3887 if all the bytes have hibit clear.
3889 This is not as a general purpose byte encoding to Unicode interface:
3890 use the Encode extension for that.
3892 =for apidoc sv_utf8_upgrade_flags
3894 Converts the PV of an SV to its UTF-8-encoded form.
3895 Forces the SV to string form if it is not already.
3896 Always sets the SvUTF8 flag to avoid future validity checks even
3897 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3898 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3899 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3901 This is not as a general purpose byte encoding to Unicode interface:
3902 use the Encode extension for that.
3908 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3910 if (sv == &PL_sv_undef)
3914 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3915 (void) sv_2pv_flags(sv,&len, flags);
3919 (void) SvPV_force(sv,len);
3928 sv_force_normal_flags(sv, 0);
3931 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3932 sv_recode_to_utf8(sv, PL_encoding);
3933 else { /* Assume Latin-1/EBCDIC */
3934 /* This function could be much more efficient if we
3935 * had a FLAG in SVs to signal if there are any hibit
3936 * chars in the PV. Given that there isn't such a flag
3937 * make the loop as fast as possible. */
3938 U8 *s = (U8 *) SvPVX(sv);
3939 U8 *e = (U8 *) SvEND(sv);
3945 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3949 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3950 s = bytes_to_utf8((U8*)s, &len);
3952 SvPV_free(sv); /* No longer using what was there before. */
3954 SvPV_set(sv, (char*)s);
3955 SvCUR_set(sv, len - 1);
3956 SvLEN_set(sv, len); /* No longer know the real size. */
3958 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3965 =for apidoc sv_utf8_downgrade
3967 Attempts to convert the PV of an SV from characters to bytes.
3968 If the PV contains a character beyond byte, this conversion will fail;
3969 in this case, either returns false or, if C<fail_ok> is not
3972 This is not as a general purpose Unicode to byte encoding interface:
3973 use the Encode extension for that.
3979 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3981 if (SvPOKp(sv) && SvUTF8(sv)) {
3987 sv_force_normal_flags(sv, 0);
3989 s = (U8 *) SvPV(sv, len);
3990 if (!utf8_to_bytes(s, &len)) {
3995 Perl_croak(aTHX_ "Wide character in %s",
3998 Perl_croak(aTHX_ "Wide character");
4009 =for apidoc sv_utf8_encode
4011 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
4012 flag off so that it looks like octets again.
4018 Perl_sv_utf8_encode(pTHX_ register SV *sv)
4020 (void) sv_utf8_upgrade(sv);
4022 sv_force_normal_flags(sv, 0);
4024 if (SvREADONLY(sv)) {
4025 Perl_croak(aTHX_ PL_no_modify);
4031 =for apidoc sv_utf8_decode
4033 If the PV of the SV is an octet sequence in UTF-8
4034 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
4035 so that it looks like a character. If the PV contains only single-byte
4036 characters, the C<SvUTF8> flag stays being off.
4037 Scans PV for validity and returns false if the PV is invalid UTF-8.
4043 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4049 /* The octets may have got themselves encoded - get them back as
4052 if (!sv_utf8_downgrade(sv, TRUE))
4055 /* it is actually just a matter of turning the utf8 flag on, but
4056 * we want to make sure everything inside is valid utf8 first.
4058 c = (U8 *) SvPVX(sv);
4059 if (!is_utf8_string(c, SvCUR(sv)+1))
4061 e = (U8 *) SvEND(sv);
4064 if (!UTF8_IS_INVARIANT(ch)) {
4073 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4074 * this function provided for binary compatibility only
4078 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4080 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4084 =for apidoc sv_setsv
4086 Copies the contents of the source SV C<ssv> into the destination SV
4087 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4088 function if the source SV needs to be reused. Does not handle 'set' magic.
4089 Loosely speaking, it performs a copy-by-value, obliterating any previous
4090 content of the destination.
4092 You probably want to use one of the assortment of wrappers, such as
4093 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4094 C<SvSetMagicSV_nosteal>.
4096 =for apidoc sv_setsv_flags
4098 Copies the contents of the source SV C<ssv> into the destination SV
4099 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4100 function if the source SV needs to be reused. Does not handle 'set' magic.
4101 Loosely speaking, it performs a copy-by-value, obliterating any previous
4102 content of the destination.
4103 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4104 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4105 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4106 and C<sv_setsv_nomg> are implemented in terms of this function.
4108 You probably want to use one of the assortment of wrappers, such as
4109 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4110 C<SvSetMagicSV_nosteal>.
4112 This is the primary function for copying scalars, and most other
4113 copy-ish functions and macros use this underneath.
4119 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4121 register U32 sflags;
4127 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4129 sstr = &PL_sv_undef;
4130 stype = SvTYPE(sstr);
4131 dtype = SvTYPE(dstr);
4136 /* need to nuke the magic */
4138 SvRMAGICAL_off(dstr);
4141 /* There's a lot of redundancy below but we're going for speed here */
4146 if (dtype != SVt_PVGV) {
4147 (void)SvOK_off(dstr);
4155 sv_upgrade(dstr, SVt_IV);
4158 sv_upgrade(dstr, SVt_PVNV);
4162 sv_upgrade(dstr, SVt_PVIV);
4165 (void)SvIOK_only(dstr);
4166 SvIV_set(dstr, SvIVX(sstr));
4169 if (SvTAINTED(sstr))
4180 sv_upgrade(dstr, SVt_NV);
4185 sv_upgrade(dstr, SVt_PVNV);
4188 SvNV_set(dstr, SvNVX(sstr));
4189 (void)SvNOK_only(dstr);
4190 if (SvTAINTED(sstr))
4198 sv_upgrade(dstr, SVt_RV);
4199 else if (dtype == SVt_PVGV &&
4200 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4203 if (GvIMPORTED(dstr) != GVf_IMPORTED
4204 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4206 GvIMPORTED_on(dstr);
4215 #ifdef PERL_COPY_ON_WRITE
4216 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4217 if (dtype < SVt_PVIV)
4218 sv_upgrade(dstr, SVt_PVIV);
4225 sv_upgrade(dstr, SVt_PV);
4228 if (dtype < SVt_PVIV)
4229 sv_upgrade(dstr, SVt_PVIV);
4232 if (dtype < SVt_PVNV)
4233 sv_upgrade(dstr, SVt_PVNV);
4240 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
4243 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
4247 if (dtype <= SVt_PVGV) {
4249 if (dtype != SVt_PVGV) {
4250 char *name = GvNAME(sstr);
4251 STRLEN len = GvNAMELEN(sstr);
4252 /* don't upgrade SVt_PVLV: it can hold a glob */
4253 if (dtype != SVt_PVLV)
4254 sv_upgrade(dstr, SVt_PVGV);
4255 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4256 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4257 GvNAME(dstr) = savepvn(name, len);
4258 GvNAMELEN(dstr) = len;
4259 SvFAKE_on(dstr); /* can coerce to non-glob */
4261 /* ahem, death to those who redefine active sort subs */
4262 else if (PL_curstackinfo->si_type == PERLSI_SORT
4263 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4264 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4267 #ifdef GV_UNIQUE_CHECK
4268 if (GvUNIQUE((GV*)dstr)) {
4269 Perl_croak(aTHX_ PL_no_modify);
4273 (void)SvOK_off(dstr);
4274 GvINTRO_off(dstr); /* one-shot flag */
4276 GvGP(dstr) = gp_ref(GvGP(sstr));
4277 if (SvTAINTED(sstr))
4279 if (GvIMPORTED(dstr) != GVf_IMPORTED
4280 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4282 GvIMPORTED_on(dstr);
4290 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4292 if ((int)SvTYPE(sstr) != stype) {
4293 stype = SvTYPE(sstr);
4294 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4298 if (stype == SVt_PVLV)
4299 (void)SvUPGRADE(dstr, SVt_PVNV);
4301 (void)SvUPGRADE(dstr, (U32)stype);
4304 sflags = SvFLAGS(sstr);
4306 if (sflags & SVf_ROK) {
4307 if (dtype >= SVt_PV) {
4308 if (dtype == SVt_PVGV) {
4309 SV *sref = SvREFCNT_inc(SvRV(sstr));
4311 int intro = GvINTRO(dstr);
4313 #ifdef GV_UNIQUE_CHECK
4314 if (GvUNIQUE((GV*)dstr)) {
4315 Perl_croak(aTHX_ PL_no_modify);
4320 GvINTRO_off(dstr); /* one-shot flag */
4321 GvLINE(dstr) = CopLINE(PL_curcop);
4322 GvEGV(dstr) = (GV*)dstr;
4325 switch (SvTYPE(sref)) {
4328 SAVEGENERICSV(GvAV(dstr));
4330 dref = (SV*)GvAV(dstr);
4331 GvAV(dstr) = (AV*)sref;
4332 if (!GvIMPORTED_AV(dstr)
4333 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4335 GvIMPORTED_AV_on(dstr);
4340 SAVEGENERICSV(GvHV(dstr));
4342 dref = (SV*)GvHV(dstr);
4343 GvHV(dstr) = (HV*)sref;
4344 if (!GvIMPORTED_HV(dstr)
4345 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4347 GvIMPORTED_HV_on(dstr);
4352 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4353 SvREFCNT_dec(GvCV(dstr));
4354 GvCV(dstr) = Nullcv;
4355 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4356 PL_sub_generation++;
4358 SAVEGENERICSV(GvCV(dstr));
4361 dref = (SV*)GvCV(dstr);
4362 if (GvCV(dstr) != (CV*)sref) {
4363 CV* cv = GvCV(dstr);
4365 if (!GvCVGEN((GV*)dstr) &&
4366 (CvROOT(cv) || CvXSUB(cv)))
4368 /* ahem, death to those who redefine
4369 * active sort subs */
4370 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4371 PL_sortcop == CvSTART(cv))
4373 "Can't redefine active sort subroutine %s",
4374 GvENAME((GV*)dstr));
4375 /* Redefining a sub - warning is mandatory if
4376 it was a const and its value changed. */
4377 if (ckWARN(WARN_REDEFINE)
4379 && (!CvCONST((CV*)sref)
4380 || sv_cmp(cv_const_sv(cv),
4381 cv_const_sv((CV*)sref)))))
4383 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4385 ? "Constant subroutine %s::%s redefined"
4386 : "Subroutine %s::%s redefined",
4387 HvNAME(GvSTASH((GV*)dstr)),
4388 GvENAME((GV*)dstr));
4392 cv_ckproto(cv, (GV*)dstr,
4393 SvPOK(sref) ? SvPVX(sref) : Nullch);
4395 GvCV(dstr) = (CV*)sref;
4396 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4397 GvASSUMECV_on(dstr);
4398 PL_sub_generation++;
4400 if (!GvIMPORTED_CV(dstr)
4401 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4403 GvIMPORTED_CV_on(dstr);
4408 SAVEGENERICSV(GvIOp(dstr));
4410 dref = (SV*)GvIOp(dstr);
4411 GvIOp(dstr) = (IO*)sref;
4415 SAVEGENERICSV(GvFORM(dstr));
4417 dref = (SV*)GvFORM(dstr);
4418 GvFORM(dstr) = (CV*)sref;
4422 SAVEGENERICSV(GvSV(dstr));
4424 dref = (SV*)GvSV(dstr);
4426 if (!GvIMPORTED_SV(dstr)
4427 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4429 GvIMPORTED_SV_on(dstr);
4435 if (SvTAINTED(sstr))
4445 (void)SvOK_off(dstr);
4446 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4448 if (sflags & SVp_NOK) {
4450 /* Only set the public OK flag if the source has public OK. */
4451 if (sflags & SVf_NOK)
4452 SvFLAGS(dstr) |= SVf_NOK;
4453 SvNV_set(dstr, SvNVX(sstr));
4455 if (sflags & SVp_IOK) {
4456 (void)SvIOKp_on(dstr);
4457 if (sflags & SVf_IOK)
4458 SvFLAGS(dstr) |= SVf_IOK;
4459 if (sflags & SVf_IVisUV)
4461 SvIV_set(dstr, SvIVX(sstr));
4463 if (SvAMAGIC(sstr)) {
4467 else if (sflags & SVp_POK) {
4471 * Check to see if we can just swipe the string. If so, it's a
4472 * possible small lose on short strings, but a big win on long ones.
4473 * It might even be a win on short strings if SvPVX(dstr)
4474 * has to be allocated and SvPVX(sstr) has to be freed.
4477 /* Whichever path we take through the next code, we want this true,
4478 and doing it now facilitates the COW check. */
4479 (void)SvPOK_only(dstr);
4482 #ifdef PERL_COPY_ON_WRITE
4483 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4487 (sflags & SVs_TEMP) && /* slated for free anyway? */
4488 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4489 (!(flags & SV_NOSTEAL)) &&
4490 /* and we're allowed to steal temps */
4491 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4492 SvLEN(sstr) && /* and really is a string */
4493 /* and won't be needed again, potentially */
4494 !(PL_op && PL_op->op_type == OP_AASSIGN))
4495 #ifdef PERL_COPY_ON_WRITE
4496 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4497 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4498 && SvTYPE(sstr) >= SVt_PVIV)
4501 /* Failed the swipe test, and it's not a shared hash key either.
4502 Have to copy the string. */
4503 STRLEN len = SvCUR(sstr);
4504 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4505 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4506 SvCUR_set(dstr, len);
4507 *SvEND(dstr) = '\0';
4509 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4511 #ifdef PERL_COPY_ON_WRITE
4512 /* Either it's a shared hash key, or it's suitable for
4513 copy-on-write or we can swipe the string. */
4515 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4520 /* I believe I should acquire a global SV mutex if
4521 it's a COW sv (not a shared hash key) to stop
4522 it going un copy-on-write.
4523 If the source SV has gone un copy on write between up there
4524 and down here, then (assert() that) it is of the correct
4525 form to make it copy on write again */
4526 if ((sflags & (SVf_FAKE | SVf_READONLY))
4527 != (SVf_FAKE | SVf_READONLY)) {
4528 SvREADONLY_on(sstr);
4530 /* Make the source SV into a loop of 1.
4531 (about to become 2) */
4532 SV_COW_NEXT_SV_SET(sstr, sstr);
4536 /* Initial code is common. */
4537 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4539 SvFLAGS(dstr) &= ~SVf_OOK;
4540 Safefree(SvPVX(dstr) - SvIVX(dstr));
4542 else if (SvLEN(dstr))
4543 Safefree(SvPVX(dstr));
4546 #ifdef PERL_COPY_ON_WRITE
4548 /* making another shared SV. */
4549 STRLEN cur = SvCUR(sstr);
4550 STRLEN len = SvLEN(sstr);
4551 assert (SvTYPE(dstr) >= SVt_PVIV);
4553 /* SvIsCOW_normal */
4554 /* splice us in between source and next-after-source. */
4555 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4556 SV_COW_NEXT_SV_SET(sstr, dstr);
4557 SvPV_set(dstr, SvPVX(sstr));
4559 /* SvIsCOW_shared_hash */
4560 UV hash = SvUVX(sstr);
4561 DEBUG_C(PerlIO_printf(Perl_debug_log,
4562 "Copy on write: Sharing hash\n"));
4564 sharepvn(SvPVX(sstr),
4565 (sflags & SVf_UTF8?-cur:cur), hash));
4566 SvUV_set(dstr, hash);
4568 SvLEN_set(dstr, len);
4569 SvCUR_set(dstr, cur);
4570 SvREADONLY_on(dstr);
4572 /* Relesase a global SV mutex. */
4576 { /* Passes the swipe test. */
4577 SvPV_set(dstr, SvPVX(sstr));
4578 SvLEN_set(dstr, SvLEN(sstr));
4579 SvCUR_set(dstr, SvCUR(sstr));
4582 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4583 SvPV_set(sstr, Nullch);
4589 if (sflags & SVf_UTF8)
4592 if (sflags & SVp_NOK) {
4594 if (sflags & SVf_NOK)
4595 SvFLAGS(dstr) |= SVf_NOK;
4596 SvNV_set(dstr, SvNVX(sstr));
4598 if (sflags & SVp_IOK) {
4599 (void)SvIOKp_on(dstr);
4600 if (sflags & SVf_IOK)
4601 SvFLAGS(dstr) |= SVf_IOK;
4602 if (sflags & SVf_IVisUV)
4604 SvIV_set(dstr, SvIVX(sstr));
4607 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4608 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4609 smg->mg_ptr, smg->mg_len);
4610 SvRMAGICAL_on(dstr);
4613 else if (sflags & SVp_IOK) {
4614 if (sflags & SVf_IOK)
4615 (void)SvIOK_only(dstr);
4617 (void)SvOK_off(dstr);
4618 (void)SvIOKp_on(dstr);
4620 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4621 if (sflags & SVf_IVisUV)
4623 SvIV_set(dstr, SvIVX(sstr));
4624 if (sflags & SVp_NOK) {
4625 if (sflags & SVf_NOK)
4626 (void)SvNOK_on(dstr);
4628 (void)SvNOKp_on(dstr);
4629 SvNV_set(dstr, SvNVX(sstr));
4632 else if (sflags & SVp_NOK) {
4633 if (sflags & SVf_NOK)
4634 (void)SvNOK_only(dstr);
4636 (void)SvOK_off(dstr);
4639 SvNV_set(dstr, SvNVX(sstr));
4642 if (dtype == SVt_PVGV) {
4643 if (ckWARN(WARN_MISC))
4644 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4647 (void)SvOK_off(dstr);
4649 if (SvTAINTED(sstr))
4654 =for apidoc sv_setsv_mg
4656 Like C<sv_setsv>, but also handles 'set' magic.
4662 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4664 sv_setsv(dstr,sstr);
4668 #ifdef PERL_COPY_ON_WRITE
4670 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4672 STRLEN cur = SvCUR(sstr);
4673 STRLEN len = SvLEN(sstr);
4674 register char *new_pv;
4677 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4685 if (SvTHINKFIRST(dstr))
4686 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4687 else if (SvPVX(dstr))
4688 Safefree(SvPVX(dstr));
4692 (void)SvUPGRADE (dstr, SVt_PVIV);
4694 assert (SvPOK(sstr));
4695 assert (SvPOKp(sstr));
4696 assert (!SvIOK(sstr));
4697 assert (!SvIOKp(sstr));
4698 assert (!SvNOK(sstr));
4699 assert (!SvNOKp(sstr));
4701 if (SvIsCOW(sstr)) {
4703 if (SvLEN(sstr) == 0) {
4704 /* source is a COW shared hash key. */
4705 UV hash = SvUVX(sstr);
4706 DEBUG_C(PerlIO_printf(Perl_debug_log,
4707 "Fast copy on write: Sharing hash\n"));
4708 SvUV_set(dstr, hash);
4709 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4712 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4714 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4715 (void)SvUPGRADE (sstr, SVt_PVIV);
4716 SvREADONLY_on(sstr);
4718 DEBUG_C(PerlIO_printf(Perl_debug_log,
4719 "Fast copy on write: Converting sstr to COW\n"));
4720 SV_COW_NEXT_SV_SET(dstr, sstr);
4722 SV_COW_NEXT_SV_SET(sstr, dstr);
4723 new_pv = SvPVX(sstr);
4726 SvPV_set(dstr, new_pv);
4727 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4730 SvLEN_set(dstr, len);
4731 SvCUR_set(dstr, cur);
4740 =for apidoc sv_setpvn
4742 Copies a string into an SV. The C<len> parameter indicates the number of
4743 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4744 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4750 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4752 register char *dptr;
4754 SV_CHECK_THINKFIRST_COW_DROP(sv);
4760 /* len is STRLEN which is unsigned, need to copy to signed */
4763 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4765 (void)SvUPGRADE(sv, SVt_PV);
4767 SvGROW(sv, len + 1);
4769 Move(ptr,dptr,len,char);
4772 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4777 =for apidoc sv_setpvn_mg
4779 Like C<sv_setpvn>, but also handles 'set' magic.
4785 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4787 sv_setpvn(sv,ptr,len);
4792 =for apidoc sv_setpv
4794 Copies a string into an SV. The string must be null-terminated. Does not
4795 handle 'set' magic. See C<sv_setpv_mg>.
4801 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4803 register STRLEN len;
4805 SV_CHECK_THINKFIRST_COW_DROP(sv);
4811 (void)SvUPGRADE(sv, SVt_PV);
4813 SvGROW(sv, len + 1);
4814 Move(ptr,SvPVX(sv),len+1,char);
4816 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4821 =for apidoc sv_setpv_mg
4823 Like C<sv_setpv>, but also handles 'set' magic.
4829 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4836 =for apidoc sv_usepvn
4838 Tells an SV to use C<ptr> to find its string value. Normally the string is
4839 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4840 The C<ptr> should point to memory that was allocated by C<malloc>. The
4841 string length, C<len>, must be supplied. This function will realloc the
4842 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4843 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4844 See C<sv_usepvn_mg>.
4850 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4852 SV_CHECK_THINKFIRST_COW_DROP(sv);
4853 (void)SvUPGRADE(sv, SVt_PV);
4860 Renew(ptr, len+1, char);
4863 SvLEN_set(sv, len+1);
4865 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4870 =for apidoc sv_usepvn_mg
4872 Like C<sv_usepvn>, but also handles 'set' magic.
4878 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4880 sv_usepvn(sv,ptr,len);
4884 #ifdef PERL_COPY_ON_WRITE
4885 /* Need to do this *after* making the SV normal, as we need the buffer
4886 pointer to remain valid until after we've copied it. If we let go too early,
4887 another thread could invalidate it by unsharing last of the same hash key
4888 (which it can do by means other than releasing copy-on-write Svs)
4889 or by changing the other copy-on-write SVs in the loop. */
4891 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4892 U32 hash, SV *after)
4894 if (len) { /* this SV was SvIsCOW_normal(sv) */
4895 /* we need to find the SV pointing to us. */
4896 SV *current = SV_COW_NEXT_SV(after);
4898 if (current == sv) {
4899 /* The SV we point to points back to us (there were only two of us
4901 Hence other SV is no longer copy on write either. */
4903 SvREADONLY_off(after);
4905 /* We need to follow the pointers around the loop. */
4907 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4910 /* don't loop forever if the structure is bust, and we have
4911 a pointer into a closed loop. */
4912 assert (current != after);
4913 assert (SvPVX(current) == pvx);
4915 /* Make the SV before us point to the SV after us. */
4916 SV_COW_NEXT_SV_SET(current, after);
4919 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4924 Perl_sv_release_IVX(pTHX_ register SV *sv)
4927 sv_force_normal_flags(sv, 0);
4933 =for apidoc sv_force_normal_flags
4935 Undo various types of fakery on an SV: if the PV is a shared string, make
4936 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4937 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4938 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4939 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4940 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4941 set to some other value.) In addition, the C<flags> parameter gets passed to
4942 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4943 with flags set to 0.
4949 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4951 #ifdef PERL_COPY_ON_WRITE
4952 if (SvREADONLY(sv)) {
4953 /* At this point I believe I should acquire a global SV mutex. */
4955 char *pvx = SvPVX(sv);
4956 STRLEN len = SvLEN(sv);
4957 STRLEN cur = SvCUR(sv);
4958 U32 hash = SvUVX(sv);
4959 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4961 PerlIO_printf(Perl_debug_log,
4962 "Copy on write: Force normal %ld\n",
4968 /* This SV doesn't own the buffer, so need to New() a new one: */
4969 SvPV_set(sv, (char*)0);
4971 if (flags & SV_COW_DROP_PV) {
4972 /* OK, so we don't need to copy our buffer. */
4975 SvGROW(sv, cur + 1);
4976 Move(pvx,SvPVX(sv),cur,char);
4980 sv_release_COW(sv, pvx, cur, len, hash, next);
4985 else if (IN_PERL_RUNTIME)
4986 Perl_croak(aTHX_ PL_no_modify);
4987 /* At this point I believe that I can drop the global SV mutex. */
4990 if (SvREADONLY(sv)) {
4992 char *pvx = SvPVX(sv);
4993 int is_utf8 = SvUTF8(sv);
4994 STRLEN len = SvCUR(sv);
4995 U32 hash = SvUVX(sv);
4998 SvPV_set(sv, (char*)0);
5000 SvGROW(sv, len + 1);
5001 Move(pvx,SvPVX(sv),len,char);
5003 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
5005 else if (IN_PERL_RUNTIME)
5006 Perl_croak(aTHX_ PL_no_modify);
5010 sv_unref_flags(sv, flags);
5011 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
5016 =for apidoc sv_force_normal
5018 Undo various types of fakery on an SV: if the PV is a shared string, make
5019 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
5020 an xpvmg. See also C<sv_force_normal_flags>.
5026 Perl_sv_force_normal(pTHX_ register SV *sv)
5028 sv_force_normal_flags(sv, 0);
5034 Efficient removal of characters from the beginning of the string buffer.
5035 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5036 the string buffer. The C<ptr> becomes the first character of the adjusted
5037 string. Uses the "OOK hack".
5038 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
5039 refer to the same chunk of data.
5045 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
5047 register STRLEN delta;
5048 if (!ptr || !SvPOKp(sv))
5050 delta = ptr - SvPVX(sv);
5051 SV_CHECK_THINKFIRST(sv);
5052 if (SvTYPE(sv) < SVt_PVIV)
5053 sv_upgrade(sv,SVt_PVIV);
5056 if (!SvLEN(sv)) { /* make copy of shared string */
5057 char *pvx = SvPVX(sv);
5058 STRLEN len = SvCUR(sv);
5059 SvGROW(sv, len + 1);
5060 Move(pvx,SvPVX(sv),len,char);
5064 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5065 and we do that anyway inside the SvNIOK_off
5067 SvFLAGS(sv) |= SVf_OOK;
5070 SvLEN_set(sv, SvLEN(sv) - delta);
5071 SvCUR_set(sv, SvCUR(sv) - delta);
5072 SvPV_set(sv, SvPVX(sv) + delta);
5073 SvIV_set(sv, SvIVX(sv) + delta);
5076 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5077 * this function provided for binary compatibility only
5081 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5083 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5087 =for apidoc sv_catpvn
5089 Concatenates the string onto the end of the string which is in the SV. The
5090 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5091 status set, then the bytes appended should be valid UTF-8.
5092 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5094 =for apidoc sv_catpvn_flags
5096 Concatenates the string onto the end of the string which is in the SV. The
5097 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5098 status set, then the bytes appended should be valid UTF-8.
5099 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5100 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5101 in terms of this function.
5107 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5112 dstr = SvPV_force_flags(dsv, dlen, flags);
5113 SvGROW(dsv, dlen + slen + 1);
5116 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5117 SvCUR_set(dsv, SvCUR(dsv) + slen);
5119 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5124 =for apidoc sv_catpvn_mg
5126 Like C<sv_catpvn>, but also handles 'set' magic.
5132 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5134 sv_catpvn(sv,ptr,len);
5138 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5139 * this function provided for binary compatibility only
5143 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5145 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5149 =for apidoc sv_catsv
5151 Concatenates the string from SV C<ssv> onto the end of the string in
5152 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5153 not 'set' magic. See C<sv_catsv_mg>.
5155 =for apidoc sv_catsv_flags
5157 Concatenates the string from SV C<ssv> onto the end of the string in
5158 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5159 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5160 and C<sv_catsv_nomg> are implemented in terms of this function.
5165 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5171 if ((spv = SvPV(ssv, slen))) {
5172 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5173 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5174 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5175 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5176 dsv->sv_flags doesn't have that bit set.
5177 Andy Dougherty 12 Oct 2001
5179 I32 sutf8 = DO_UTF8(ssv);
5182 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5184 dutf8 = DO_UTF8(dsv);
5186 if (dutf8 != sutf8) {
5188 /* Not modifying source SV, so taking a temporary copy. */
5189 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5191 sv_utf8_upgrade(csv);
5192 spv = SvPV(csv, slen);
5195 sv_utf8_upgrade_nomg(dsv);
5197 sv_catpvn_nomg(dsv, spv, slen);
5202 =for apidoc sv_catsv_mg
5204 Like C<sv_catsv>, but also handles 'set' magic.
5210 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5217 =for apidoc sv_catpv
5219 Concatenates the string onto the end of the string which is in the SV.
5220 If the SV has the UTF-8 status set, then the bytes appended should be
5221 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5226 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5228 register STRLEN len;
5234 junk = SvPV_force(sv, tlen);
5236 SvGROW(sv, tlen + len + 1);
5239 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5240 SvCUR_set(sv, SvCUR(sv) + len);
5241 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5246 =for apidoc sv_catpv_mg
5248 Like C<sv_catpv>, but also handles 'set' magic.
5254 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5263 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5264 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5271 Perl_newSV(pTHX_ STRLEN len)
5277 sv_upgrade(sv, SVt_PV);
5278 SvGROW(sv, len + 1);
5283 =for apidoc sv_magicext
5285 Adds magic to an SV, upgrading it if necessary. Applies the
5286 supplied vtable and returns a pointer to the magic added.
5288 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5289 In particular, you can add magic to SvREADONLY SVs, and add more than
5290 one instance of the same 'how'.
5292 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5293 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5294 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5295 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5297 (This is now used as a subroutine by C<sv_magic>.)
5302 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5303 const char* name, I32 namlen)
5307 if (SvTYPE(sv) < SVt_PVMG) {
5308 (void)SvUPGRADE(sv, SVt_PVMG);
5310 Newz(702,mg, 1, MAGIC);
5311 mg->mg_moremagic = SvMAGIC(sv);
5312 SvMAGIC_set(sv, mg);
5314 /* Sometimes a magic contains a reference loop, where the sv and
5315 object refer to each other. To prevent a reference loop that
5316 would prevent such objects being freed, we look for such loops
5317 and if we find one we avoid incrementing the object refcount.
5319 Note we cannot do this to avoid self-tie loops as intervening RV must
5320 have its REFCNT incremented to keep it in existence.
5323 if (!obj || obj == sv ||
5324 how == PERL_MAGIC_arylen ||
5325 how == PERL_MAGIC_qr ||
5326 (SvTYPE(obj) == SVt_PVGV &&
5327 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5328 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5329 GvFORM(obj) == (CV*)sv)))
5334 mg->mg_obj = SvREFCNT_inc(obj);
5335 mg->mg_flags |= MGf_REFCOUNTED;
5338 /* Normal self-ties simply pass a null object, and instead of
5339 using mg_obj directly, use the SvTIED_obj macro to produce a
5340 new RV as needed. For glob "self-ties", we are tieing the PVIO
5341 with an RV obj pointing to the glob containing the PVIO. In
5342 this case, to avoid a reference loop, we need to weaken the
5346 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5347 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5353 mg->mg_len = namlen;
5356 mg->mg_ptr = savepvn(name, namlen);
5357 else if (namlen == HEf_SVKEY)
5358 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5360 mg->mg_ptr = (char *) name;
5362 mg->mg_virtual = vtable;
5366 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5371 =for apidoc sv_magic
5373 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5374 then adds a new magic item of type C<how> to the head of the magic list.
5376 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5377 handling of the C<name> and C<namlen> arguments.
5379 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5380 to add more than one instance of the same 'how'.
5386 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5388 const MGVTBL *vtable = 0;
5391 #ifdef PERL_COPY_ON_WRITE
5393 sv_force_normal_flags(sv, 0);
5395 if (SvREADONLY(sv)) {
5397 && how != PERL_MAGIC_regex_global
5398 && how != PERL_MAGIC_bm
5399 && how != PERL_MAGIC_fm
5400 && how != PERL_MAGIC_sv
5401 && how != PERL_MAGIC_backref
5404 Perl_croak(aTHX_ PL_no_modify);
5407 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5408 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5409 /* sv_magic() refuses to add a magic of the same 'how' as an
5412 if (how == PERL_MAGIC_taint)
5420 vtable = &PL_vtbl_sv;
5422 case PERL_MAGIC_overload:
5423 vtable = &PL_vtbl_amagic;
5425 case PERL_MAGIC_overload_elem:
5426 vtable = &PL_vtbl_amagicelem;
5428 case PERL_MAGIC_overload_table:
5429 vtable = &PL_vtbl_ovrld;
5432 vtable = &PL_vtbl_bm;
5434 case PERL_MAGIC_regdata:
5435 vtable = &PL_vtbl_regdata;
5437 case PERL_MAGIC_regdatum:
5438 vtable = &PL_vtbl_regdatum;
5440 case PERL_MAGIC_env:
5441 vtable = &PL_vtbl_env;
5444 vtable = &PL_vtbl_fm;
5446 case PERL_MAGIC_envelem:
5447 vtable = &PL_vtbl_envelem;
5449 case PERL_MAGIC_regex_global:
5450 vtable = &PL_vtbl_mglob;
5452 case PERL_MAGIC_isa:
5453 vtable = &PL_vtbl_isa;
5455 case PERL_MAGIC_isaelem:
5456 vtable = &PL_vtbl_isaelem;
5458 case PERL_MAGIC_nkeys:
5459 vtable = &PL_vtbl_nkeys;
5461 case PERL_MAGIC_dbfile:
5464 case PERL_MAGIC_dbline:
5465 vtable = &PL_vtbl_dbline;
5467 #ifdef USE_LOCALE_COLLATE
5468 case PERL_MAGIC_collxfrm:
5469 vtable = &PL_vtbl_collxfrm;
5471 #endif /* USE_LOCALE_COLLATE */
5472 case PERL_MAGIC_tied:
5473 vtable = &PL_vtbl_pack;
5475 case PERL_MAGIC_tiedelem:
5476 case PERL_MAGIC_tiedscalar:
5477 vtable = &PL_vtbl_packelem;
5480 vtable = &PL_vtbl_regexp;
5482 case PERL_MAGIC_sig:
5483 vtable = &PL_vtbl_sig;
5485 case PERL_MAGIC_sigelem:
5486 vtable = &PL_vtbl_sigelem;
5488 case PERL_MAGIC_taint:
5489 vtable = &PL_vtbl_taint;
5491 case PERL_MAGIC_uvar:
5492 vtable = &PL_vtbl_uvar;
5494 case PERL_MAGIC_vec:
5495 vtable = &PL_vtbl_vec;
5497 case PERL_MAGIC_vstring:
5500 case PERL_MAGIC_utf8:
5501 vtable = &PL_vtbl_utf8;
5503 case PERL_MAGIC_substr:
5504 vtable = &PL_vtbl_substr;
5506 case PERL_MAGIC_defelem:
5507 vtable = &PL_vtbl_defelem;
5509 case PERL_MAGIC_glob:
5510 vtable = &PL_vtbl_glob;
5512 case PERL_MAGIC_arylen:
5513 vtable = &PL_vtbl_arylen;
5515 case PERL_MAGIC_pos:
5516 vtable = &PL_vtbl_pos;
5518 case PERL_MAGIC_backref:
5519 vtable = &PL_vtbl_backref;
5521 case PERL_MAGIC_ext:
5522 /* Reserved for use by extensions not perl internals. */
5523 /* Useful for attaching extension internal data to perl vars. */
5524 /* Note that multiple extensions may clash if magical scalars */
5525 /* etc holding private data from one are passed to another. */
5528 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5531 /* Rest of work is done else where */
5532 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5535 case PERL_MAGIC_taint:
5538 case PERL_MAGIC_ext:
5539 case PERL_MAGIC_dbfile:
5546 =for apidoc sv_unmagic
5548 Removes all magic of type C<type> from an SV.
5554 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5558 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5561 for (mg = *mgp; mg; mg = *mgp) {
5562 if (mg->mg_type == type) {
5563 const MGVTBL* const vtbl = mg->mg_virtual;
5564 *mgp = mg->mg_moremagic;
5565 if (vtbl && vtbl->svt_free)
5566 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5567 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5569 Safefree(mg->mg_ptr);
5570 else if (mg->mg_len == HEf_SVKEY)
5571 SvREFCNT_dec((SV*)mg->mg_ptr);
5572 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5573 Safefree(mg->mg_ptr);
5575 if (mg->mg_flags & MGf_REFCOUNTED)
5576 SvREFCNT_dec(mg->mg_obj);
5580 mgp = &mg->mg_moremagic;
5584 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5591 =for apidoc sv_rvweaken
5593 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5594 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5595 push a back-reference to this RV onto the array of backreferences
5596 associated with that magic.
5602 Perl_sv_rvweaken(pTHX_ SV *sv)
5605 if (!SvOK(sv)) /* let undefs pass */
5608 Perl_croak(aTHX_ "Can't weaken a nonreference");
5609 else if (SvWEAKREF(sv)) {
5610 if (ckWARN(WARN_MISC))
5611 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5615 sv_add_backref(tsv, sv);
5621 /* Give tsv backref magic if it hasn't already got it, then push a
5622 * back-reference to sv onto the array associated with the backref magic.
5626 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5630 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5631 av = (AV*)mg->mg_obj;
5634 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5635 /* av now has a refcnt of 2, which avoids it getting freed
5636 * before us during global cleanup. The extra ref is removed
5637 * by magic_killbackrefs() when tsv is being freed */
5639 if (AvFILLp(av) >= AvMAX(av)) {
5641 SV **svp = AvARRAY(av);
5642 for (i = AvFILLp(av); i >= 0; i--)
5644 svp[i] = sv; /* reuse the slot */
5647 av_extend(av, AvFILLp(av)+1);
5649 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5652 /* delete a back-reference to ourselves from the backref magic associated
5653 * with the SV we point to.
5657 S_sv_del_backref(pTHX_ SV *sv)
5664 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5665 Perl_croak(aTHX_ "panic: del_backref");
5666 av = (AV *)mg->mg_obj;
5668 for (i = AvFILLp(av); i >= 0; i--)
5669 if (svp[i] == sv) svp[i] = Nullsv;
5673 =for apidoc sv_insert
5675 Inserts a string at the specified offset/length within the SV. Similar to
5676 the Perl substr() function.
5682 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5686 register char *midend;
5687 register char *bigend;
5693 Perl_croak(aTHX_ "Can't modify non-existent substring");
5694 SvPV_force(bigstr, curlen);
5695 (void)SvPOK_only_UTF8(bigstr);
5696 if (offset + len > curlen) {
5697 SvGROW(bigstr, offset+len+1);
5698 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5699 SvCUR_set(bigstr, offset+len);
5703 i = littlelen - len;
5704 if (i > 0) { /* string might grow */
5705 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5706 mid = big + offset + len;
5707 midend = bigend = big + SvCUR(bigstr);
5710 while (midend > mid) /* shove everything down */
5711 *--bigend = *--midend;
5712 Move(little,big+offset,littlelen,char);
5713 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5718 Move(little,SvPVX(bigstr)+offset,len,char);
5723 big = SvPVX(bigstr);
5726 bigend = big + SvCUR(bigstr);
5728 if (midend > bigend)
5729 Perl_croak(aTHX_ "panic: sv_insert");
5731 if (mid - big > bigend - midend) { /* faster to shorten from end */
5733 Move(little, mid, littlelen,char);
5736 i = bigend - midend;
5738 Move(midend, mid, i,char);
5742 SvCUR_set(bigstr, mid - big);
5745 else if ((i = mid - big)) { /* faster from front */
5746 midend -= littlelen;
5748 sv_chop(bigstr,midend-i);
5753 Move(little, mid, littlelen,char);
5755 else if (littlelen) {
5756 midend -= littlelen;
5757 sv_chop(bigstr,midend);
5758 Move(little,midend,littlelen,char);
5761 sv_chop(bigstr,midend);
5767 =for apidoc sv_replace
5769 Make the first argument a copy of the second, then delete the original.
5770 The target SV physically takes over ownership of the body of the source SV
5771 and inherits its flags; however, the target keeps any magic it owns,
5772 and any magic in the source is discarded.
5773 Note that this is a rather specialist SV copying operation; most of the
5774 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5780 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5782 U32 refcnt = SvREFCNT(sv);
5783 SV_CHECK_THINKFIRST_COW_DROP(sv);
5784 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5785 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5786 if (SvMAGICAL(sv)) {
5790 sv_upgrade(nsv, SVt_PVMG);
5791 SvMAGIC_set(nsv, SvMAGIC(sv));
5792 SvFLAGS(nsv) |= SvMAGICAL(sv);
5794 SvMAGIC_set(sv, NULL);
5798 assert(!SvREFCNT(sv));
5799 #ifdef DEBUG_LEAKING_SCALARS
5800 sv->sv_flags = nsv->sv_flags;
5801 sv->sv_any = nsv->sv_any;
5802 sv->sv_refcnt = nsv->sv_refcnt;
5804 StructCopy(nsv,sv,SV);
5807 #ifdef PERL_COPY_ON_WRITE
5808 if (SvIsCOW_normal(nsv)) {
5809 /* We need to follow the pointers around the loop to make the
5810 previous SV point to sv, rather than nsv. */
5813 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5816 assert(SvPVX(current) == SvPVX(nsv));
5818 /* Make the SV before us point to the SV after us. */
5820 PerlIO_printf(Perl_debug_log, "previous is\n");
5822 PerlIO_printf(Perl_debug_log,
5823 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5824 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5826 SV_COW_NEXT_SV_SET(current, sv);
5829 SvREFCNT(sv) = refcnt;
5830 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5836 =for apidoc sv_clear
5838 Clear an SV: call any destructors, free up any memory used by the body,
5839 and free the body itself. The SV's head is I<not> freed, although
5840 its type is set to all 1's so that it won't inadvertently be assumed
5841 to be live during global destruction etc.
5842 This function should only be called when REFCNT is zero. Most of the time
5843 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5850 Perl_sv_clear(pTHX_ register SV *sv)
5855 assert(SvREFCNT(sv) == 0);
5858 if (PL_defstash) { /* Still have a symbol table? */
5865 stash = SvSTASH(sv);
5866 destructor = StashHANDLER(stash,DESTROY);
5868 SV* tmpref = newRV(sv);
5869 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5871 PUSHSTACKi(PERLSI_DESTROY);
5876 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5882 if(SvREFCNT(tmpref) < 2) {
5883 /* tmpref is not kept alive! */
5885 SvRV_set(tmpref, NULL);
5888 SvREFCNT_dec(tmpref);
5890 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5894 if (PL_in_clean_objs)
5895 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5897 /* DESTROY gave object new lease on life */
5903 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5904 SvOBJECT_off(sv); /* Curse the object. */
5905 if (SvTYPE(sv) != SVt_PVIO)
5906 --PL_sv_objcount; /* XXX Might want something more general */
5909 if (SvTYPE(sv) >= SVt_PVMG) {
5912 if (SvFLAGS(sv) & SVpad_TYPED)
5913 SvREFCNT_dec(SvSTASH(sv));
5916 switch (SvTYPE(sv)) {
5919 IoIFP(sv) != PerlIO_stdin() &&
5920 IoIFP(sv) != PerlIO_stdout() &&
5921 IoIFP(sv) != PerlIO_stderr())
5923 io_close((IO*)sv, FALSE);
5925 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5926 PerlDir_close(IoDIRP(sv));
5927 IoDIRP(sv) = (DIR*)NULL;
5928 Safefree(IoTOP_NAME(sv));
5929 Safefree(IoFMT_NAME(sv));
5930 Safefree(IoBOTTOM_NAME(sv));
5945 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5946 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5947 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5948 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5950 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5951 SvREFCNT_dec(LvTARG(sv));
5955 Safefree(GvNAME(sv));
5956 /* cannot decrease stash refcount yet, as we might recursively delete
5957 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5958 of stash until current sv is completely gone.
5959 -- JohnPC, 27 Mar 1998 */
5960 stash = GvSTASH(sv);
5966 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5968 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5969 /* Don't even bother with turning off the OOK flag. */
5978 SvREFCNT_dec(SvRV(sv));
5980 #ifdef PERL_COPY_ON_WRITE
5981 else if (SvPVX(sv)) {
5983 /* I believe I need to grab the global SV mutex here and
5984 then recheck the COW status. */
5986 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5989 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5990 SvUVX(sv), SV_COW_NEXT_SV(sv));
5991 /* And drop it here. */
5993 } else if (SvLEN(sv)) {
5994 Safefree(SvPVX(sv));
5998 else if (SvPVX(sv) && SvLEN(sv))
5999 Safefree(SvPVX(sv));
6000 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
6001 unsharepvn(SvPVX(sv),
6002 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
6016 switch (SvTYPE(sv)) {
6032 del_XPVIV(SvANY(sv));
6035 del_XPVNV(SvANY(sv));
6038 del_XPVMG(SvANY(sv));
6041 del_XPVLV(SvANY(sv));
6044 del_XPVAV(SvANY(sv));
6047 del_XPVHV(SvANY(sv));
6050 del_XPVCV(SvANY(sv));
6053 del_XPVGV(SvANY(sv));
6054 /* code duplication for increased performance. */
6055 SvFLAGS(sv) &= SVf_BREAK;
6056 SvFLAGS(sv) |= SVTYPEMASK;
6057 /* decrease refcount of the stash that owns this GV, if any */
6059 SvREFCNT_dec(stash);
6060 return; /* not break, SvFLAGS reset already happened */
6062 del_XPVBM(SvANY(sv));
6065 del_XPVFM(SvANY(sv));
6068 del_XPVIO(SvANY(sv));
6071 SvFLAGS(sv) &= SVf_BREAK;
6072 SvFLAGS(sv) |= SVTYPEMASK;
6076 =for apidoc sv_newref
6078 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6085 Perl_sv_newref(pTHX_ SV *sv)
6095 Decrement an SV's reference count, and if it drops to zero, call
6096 C<sv_clear> to invoke destructors and free up any memory used by
6097 the body; finally, deallocate the SV's head itself.
6098 Normally called via a wrapper macro C<SvREFCNT_dec>.
6104 Perl_sv_free(pTHX_ SV *sv)
6109 if (SvREFCNT(sv) == 0) {
6110 if (SvFLAGS(sv) & SVf_BREAK)
6111 /* this SV's refcnt has been artificially decremented to
6112 * trigger cleanup */
6114 if (PL_in_clean_all) /* All is fair */
6116 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6117 /* make sure SvREFCNT(sv)==0 happens very seldom */
6118 SvREFCNT(sv) = (~(U32)0)/2;
6121 if (ckWARN_d(WARN_INTERNAL))
6122 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6123 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6124 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6127 if (--(SvREFCNT(sv)) > 0)
6129 Perl_sv_free2(aTHX_ sv);
6133 Perl_sv_free2(pTHX_ SV *sv)
6138 if (ckWARN_d(WARN_DEBUGGING))
6139 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6140 "Attempt to free temp prematurely: SV 0x%"UVxf
6141 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6145 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6146 /* make sure SvREFCNT(sv)==0 happens very seldom */
6147 SvREFCNT(sv) = (~(U32)0)/2;
6158 Returns the length of the string in the SV. Handles magic and type
6159 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6165 Perl_sv_len(pTHX_ register SV *sv)
6173 len = mg_length(sv);
6175 (void)SvPV(sv, len);
6180 =for apidoc sv_len_utf8
6182 Returns the number of characters in the string in an SV, counting wide
6183 UTF-8 bytes as a single character. Handles magic and type coercion.
6189 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6190 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6191 * (Note that the mg_len is not the length of the mg_ptr field.)
6196 Perl_sv_len_utf8(pTHX_ register SV *sv)
6202 return mg_length(sv);
6206 U8 *s = (U8*)SvPV(sv, len);
6207 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6209 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6211 #ifdef PERL_UTF8_CACHE_ASSERT
6212 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6216 ulen = Perl_utf8_length(aTHX_ s, s + len);
6217 if (!mg && !SvREADONLY(sv)) {
6218 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6219 mg = mg_find(sv, PERL_MAGIC_utf8);
6229 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6230 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6231 * between UTF-8 and byte offsets. There are two (substr offset and substr
6232 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6233 * and byte offset) cache positions.
6235 * The mg_len field is used by sv_len_utf8(), see its comments.
6236 * Note that the mg_len is not the length of the mg_ptr field.
6240 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
6244 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6246 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6250 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6252 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6253 (*mgp)->mg_ptr = (char *) *cachep;
6257 (*cachep)[i] = *offsetp;
6258 (*cachep)[i+1] = s - start;
6266 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6267 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6268 * between UTF-8 and byte offsets. See also the comments of
6269 * S_utf8_mg_pos_init().
6273 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6277 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6279 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6280 if (*mgp && (*mgp)->mg_ptr) {
6281 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6282 ASSERT_UTF8_CACHE(*cachep);
6283 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6285 else { /* We will skip to the right spot. */
6290 /* The assumption is that going backward is half
6291 * the speed of going forward (that's where the
6292 * 2 * backw in the below comes from). (The real
6293 * figure of course depends on the UTF-8 data.) */
6295 if ((*cachep)[i] > (STRLEN)uoff) {
6297 backw = (*cachep)[i] - (STRLEN)uoff;
6299 if (forw < 2 * backw)
6302 p = start + (*cachep)[i+1];
6304 /* Try this only for the substr offset (i == 0),
6305 * not for the substr length (i == 2). */
6306 else if (i == 0) { /* (*cachep)[i] < uoff */
6307 STRLEN ulen = sv_len_utf8(sv);
6309 if ((STRLEN)uoff < ulen) {
6310 forw = (STRLEN)uoff - (*cachep)[i];
6311 backw = ulen - (STRLEN)uoff;
6313 if (forw < 2 * backw)
6314 p = start + (*cachep)[i+1];
6319 /* If the string is not long enough for uoff,
6320 * we could extend it, but not at this low a level. */
6324 if (forw < 2 * backw) {
6331 while (UTF8_IS_CONTINUATION(*p))
6336 /* Update the cache. */
6337 (*cachep)[i] = (STRLEN)uoff;
6338 (*cachep)[i+1] = p - start;
6340 /* Drop the stale "length" cache */
6349 if (found) { /* Setup the return values. */
6350 *offsetp = (*cachep)[i+1];
6351 *sp = start + *offsetp;
6354 *offsetp = send - start;
6356 else if (*sp < start) {
6362 #ifdef PERL_UTF8_CACHE_ASSERT
6367 while (n-- && s < send)
6371 assert(*offsetp == s - start);
6372 assert((*cachep)[0] == (STRLEN)uoff);
6373 assert((*cachep)[1] == *offsetp);
6375 ASSERT_UTF8_CACHE(*cachep);
6384 =for apidoc sv_pos_u2b
6386 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6387 the start of the string, to a count of the equivalent number of bytes; if
6388 lenp is non-zero, it does the same to lenp, but this time starting from
6389 the offset, rather than from the start of the string. Handles magic and
6396 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6397 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6398 * byte offsets. See also the comments of S_utf8_mg_pos().
6403 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6414 start = s = (U8*)SvPV(sv, len);
6416 I32 uoffset = *offsetp;
6421 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6423 if (!found && uoffset > 0) {
6424 while (s < send && uoffset--)
6428 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
6430 *offsetp = s - start;
6435 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6439 if (!found && *lenp > 0) {
6442 while (s < send && ulen--)
6446 utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start);
6450 ASSERT_UTF8_CACHE(cache);
6462 =for apidoc sv_pos_b2u
6464 Converts the value pointed to by offsetp from a count of bytes from the
6465 start of the string, to a count of the equivalent number of UTF-8 chars.
6466 Handles magic and type coercion.
6472 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6473 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6474 * byte offsets. See also the comments of S_utf8_mg_pos().
6479 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6487 s = (U8*)SvPV(sv, len);
6488 if ((I32)len < *offsetp)
6489 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6491 U8* send = s + *offsetp;
6493 STRLEN *cache = NULL;
6497 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6498 mg = mg_find(sv, PERL_MAGIC_utf8);
6499 if (mg && mg->mg_ptr) {
6500 cache = (STRLEN *) mg->mg_ptr;
6501 if (cache[1] == (STRLEN)*offsetp) {
6502 /* An exact match. */
6503 *offsetp = cache[0];
6507 else if (cache[1] < (STRLEN)*offsetp) {
6508 /* We already know part of the way. */
6511 /* Let the below loop do the rest. */
6513 else { /* cache[1] > *offsetp */
6514 /* We already know all of the way, now we may
6515 * be able to walk back. The same assumption
6516 * is made as in S_utf8_mg_pos(), namely that
6517 * walking backward is twice slower than
6518 * walking forward. */
6519 STRLEN forw = *offsetp;
6520 STRLEN backw = cache[1] - *offsetp;
6522 if (!(forw < 2 * backw)) {
6523 U8 *p = s + cache[1];
6530 while (UTF8_IS_CONTINUATION(*p)) {
6538 *offsetp = cache[0];
6540 /* Drop the stale "length" cache */
6548 ASSERT_UTF8_CACHE(cache);
6554 /* Call utf8n_to_uvchr() to validate the sequence
6555 * (unless a simple non-UTF character) */
6556 if (!UTF8_IS_INVARIANT(*s))
6557 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6566 if (!SvREADONLY(sv)) {
6568 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6569 mg = mg_find(sv, PERL_MAGIC_utf8);
6574 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6575 mg->mg_ptr = (char *) cache;
6580 cache[1] = *offsetp;
6581 /* Drop the stale "length" cache */
6594 Returns a boolean indicating whether the strings in the two SVs are
6595 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6596 coerce its args to strings if necessary.
6602 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6610 SV* svrecode = Nullsv;
6617 pv1 = SvPV(sv1, cur1);
6624 pv2 = SvPV(sv2, cur2);
6626 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6627 /* Differing utf8ness.
6628 * Do not UTF8size the comparands as a side-effect. */
6631 svrecode = newSVpvn(pv2, cur2);
6632 sv_recode_to_utf8(svrecode, PL_encoding);
6633 pv2 = SvPV(svrecode, cur2);
6636 svrecode = newSVpvn(pv1, cur1);
6637 sv_recode_to_utf8(svrecode, PL_encoding);
6638 pv1 = SvPV(svrecode, cur1);
6640 /* Now both are in UTF-8. */
6642 SvREFCNT_dec(svrecode);
6647 bool is_utf8 = TRUE;
6650 /* sv1 is the UTF-8 one,
6651 * if is equal it must be downgrade-able */
6652 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6658 /* sv2 is the UTF-8 one,
6659 * if is equal it must be downgrade-able */
6660 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6666 /* Downgrade not possible - cannot be eq */
6674 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6677 SvREFCNT_dec(svrecode);
6688 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6689 string in C<sv1> is less than, equal to, or greater than the string in
6690 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6691 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6697 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6700 const char *pv1, *pv2;
6703 SV *svrecode = Nullsv;
6710 pv1 = SvPV(sv1, cur1);
6717 pv2 = SvPV(sv2, cur2);
6719 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6720 /* Differing utf8ness.
6721 * Do not UTF8size the comparands as a side-effect. */
6724 svrecode = newSVpvn(pv2, cur2);
6725 sv_recode_to_utf8(svrecode, PL_encoding);
6726 pv2 = SvPV(svrecode, cur2);
6729 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6734 svrecode = newSVpvn(pv1, cur1);
6735 sv_recode_to_utf8(svrecode, PL_encoding);
6736 pv1 = SvPV(svrecode, cur1);
6739 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6745 cmp = cur2 ? -1 : 0;
6749 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6752 cmp = retval < 0 ? -1 : 1;
6753 } else if (cur1 == cur2) {
6756 cmp = cur1 < cur2 ? -1 : 1;
6761 SvREFCNT_dec(svrecode);
6770 =for apidoc sv_cmp_locale
6772 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6773 'use bytes' aware, handles get magic, and will coerce its args to strings
6774 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6780 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6782 #ifdef USE_LOCALE_COLLATE
6788 if (PL_collation_standard)
6792 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6794 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6796 if (!pv1 || !len1) {
6807 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6810 return retval < 0 ? -1 : 1;
6813 * When the result of collation is equality, that doesn't mean
6814 * that there are no differences -- some locales exclude some
6815 * characters from consideration. So to avoid false equalities,
6816 * we use the raw string as a tiebreaker.
6822 #endif /* USE_LOCALE_COLLATE */
6824 return sv_cmp(sv1, sv2);
6828 #ifdef USE_LOCALE_COLLATE
6831 =for apidoc sv_collxfrm
6833 Add Collate Transform magic to an SV if it doesn't already have it.
6835 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6836 scalar data of the variable, but transformed to such a format that a normal
6837 memory comparison can be used to compare the data according to the locale
6844 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6848 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6849 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6854 Safefree(mg->mg_ptr);
6856 if ((xf = mem_collxfrm(s, len, &xlen))) {
6857 if (SvREADONLY(sv)) {
6860 return xf + sizeof(PL_collation_ix);
6863 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6864 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6877 if (mg && mg->mg_ptr) {
6879 return mg->mg_ptr + sizeof(PL_collation_ix);
6887 #endif /* USE_LOCALE_COLLATE */
6892 Get a line from the filehandle and store it into the SV, optionally
6893 appending to the currently-stored string.
6899 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6903 register STDCHAR rslast;
6904 register STDCHAR *bp;
6910 if (SvTHINKFIRST(sv))
6911 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6912 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6914 However, perlbench says it's slower, because the existing swipe code
6915 is faster than copy on write.
6916 Swings and roundabouts. */
6917 (void)SvUPGRADE(sv, SVt_PV);
6922 if (PerlIO_isutf8(fp)) {
6924 sv_utf8_upgrade_nomg(sv);
6925 sv_pos_u2b(sv,&append,0);
6927 } else if (SvUTF8(sv)) {
6928 SV *tsv = NEWSV(0,0);
6929 sv_gets(tsv, fp, 0);
6930 sv_utf8_upgrade_nomg(tsv);
6931 SvCUR_set(sv,append);
6934 goto return_string_or_null;
6939 if (PerlIO_isutf8(fp))
6942 if (IN_PERL_COMPILETIME) {
6943 /* we always read code in line mode */
6947 else if (RsSNARF(PL_rs)) {
6948 /* If it is a regular disk file use size from stat() as estimate
6949 of amount we are going to read - may result in malloc-ing
6950 more memory than we realy need if layers bellow reduce
6951 size we read (e.g. CRLF or a gzip layer)
6954 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6955 Off_t offset = PerlIO_tell(fp);
6956 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6957 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6963 else if (RsRECORD(PL_rs)) {
6967 /* Grab the size of the record we're getting */
6968 recsize = SvIV(SvRV(PL_rs));
6969 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6972 /* VMS wants read instead of fread, because fread doesn't respect */
6973 /* RMS record boundaries. This is not necessarily a good thing to be */
6974 /* doing, but we've got no other real choice - except avoid stdio
6975 as implementation - perhaps write a :vms layer ?
6977 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6979 bytesread = PerlIO_read(fp, buffer, recsize);
6983 SvCUR_set(sv, bytesread += append);
6984 buffer[bytesread] = '\0';
6985 goto return_string_or_null;
6987 else if (RsPARA(PL_rs)) {
6993 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6994 if (PerlIO_isutf8(fp)) {
6995 rsptr = SvPVutf8(PL_rs, rslen);
6998 if (SvUTF8(PL_rs)) {
6999 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
7000 Perl_croak(aTHX_ "Wide character in $/");
7003 rsptr = SvPV(PL_rs, rslen);
7007 rslast = rslen ? rsptr[rslen - 1] : '\0';
7009 if (rspara) { /* have to do this both before and after */
7010 do { /* to make sure file boundaries work right */
7013 i = PerlIO_getc(fp);
7017 PerlIO_ungetc(fp,i);
7023 /* See if we know enough about I/O mechanism to cheat it ! */
7025 /* This used to be #ifdef test - it is made run-time test for ease
7026 of abstracting out stdio interface. One call should be cheap
7027 enough here - and may even be a macro allowing compile
7031 if (PerlIO_fast_gets(fp)) {
7034 * We're going to steal some values from the stdio struct
7035 * and put EVERYTHING in the innermost loop into registers.
7037 register STDCHAR *ptr;
7041 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7042 /* An ungetc()d char is handled separately from the regular
7043 * buffer, so we getc() it back out and stuff it in the buffer.
7045 i = PerlIO_getc(fp);
7046 if (i == EOF) return 0;
7047 *(--((*fp)->_ptr)) = (unsigned char) i;
7051 /* Here is some breathtakingly efficient cheating */
7053 cnt = PerlIO_get_cnt(fp); /* get count into register */
7054 /* make sure we have the room */
7055 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7056 /* Not room for all of it
7057 if we are looking for a separator and room for some
7059 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7060 /* just process what we have room for */
7061 shortbuffered = cnt - SvLEN(sv) + append + 1;
7062 cnt -= shortbuffered;
7066 /* remember that cnt can be negative */
7067 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7072 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7073 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7074 DEBUG_P(PerlIO_printf(Perl_debug_log,
7075 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7076 DEBUG_P(PerlIO_printf(Perl_debug_log,
7077 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7078 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7079 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7084 while (cnt > 0) { /* this | eat */
7086 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7087 goto thats_all_folks; /* screams | sed :-) */
7091 Copy(ptr, bp, cnt, char); /* this | eat */
7092 bp += cnt; /* screams | dust */
7093 ptr += cnt; /* louder | sed :-) */
7098 if (shortbuffered) { /* oh well, must extend */
7099 cnt = shortbuffered;
7101 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7103 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7104 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7108 DEBUG_P(PerlIO_printf(Perl_debug_log,
7109 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7110 PTR2UV(ptr),(long)cnt));
7111 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7113 DEBUG_P(PerlIO_printf(Perl_debug_log,
7114 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7115 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7116 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7118 /* This used to call 'filbuf' in stdio form, but as that behaves like
7119 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7120 another abstraction. */
7121 i = PerlIO_getc(fp); /* get more characters */
7123 DEBUG_P(PerlIO_printf(Perl_debug_log,
7124 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7125 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7126 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7128 cnt = PerlIO_get_cnt(fp);
7129 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7130 DEBUG_P(PerlIO_printf(Perl_debug_log,
7131 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7133 if (i == EOF) /* all done for ever? */
7134 goto thats_really_all_folks;
7136 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7138 SvGROW(sv, bpx + cnt + 2);
7139 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7141 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7143 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7144 goto thats_all_folks;
7148 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7149 memNE((char*)bp - rslen, rsptr, rslen))
7150 goto screamer; /* go back to the fray */
7151 thats_really_all_folks:
7153 cnt += shortbuffered;
7154 DEBUG_P(PerlIO_printf(Perl_debug_log,
7155 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7156 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7157 DEBUG_P(PerlIO_printf(Perl_debug_log,
7158 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7159 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7160 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7162 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7163 DEBUG_P(PerlIO_printf(Perl_debug_log,
7164 "Screamer: done, len=%ld, string=|%.*s|\n",
7165 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7169 /*The big, slow, and stupid way. */
7170 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7172 New(0, buf, 8192, STDCHAR);
7180 const register STDCHAR *bpe = buf + sizeof(buf);
7182 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7183 ; /* keep reading */
7187 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7188 /* Accomodate broken VAXC compiler, which applies U8 cast to
7189 * both args of ?: operator, causing EOF to change into 255
7192 i = (U8)buf[cnt - 1];
7198 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7200 sv_catpvn(sv, (char *) buf, cnt);
7202 sv_setpvn(sv, (char *) buf, cnt);
7204 if (i != EOF && /* joy */
7206 SvCUR(sv) < rslen ||
7207 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7211 * If we're reading from a TTY and we get a short read,
7212 * indicating that the user hit his EOF character, we need
7213 * to notice it now, because if we try to read from the TTY
7214 * again, the EOF condition will disappear.
7216 * The comparison of cnt to sizeof(buf) is an optimization
7217 * that prevents unnecessary calls to feof().
7221 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7225 #ifdef USE_HEAP_INSTEAD_OF_STACK
7230 if (rspara) { /* have to do this both before and after */
7231 while (i != EOF) { /* to make sure file boundaries work right */
7232 i = PerlIO_getc(fp);
7234 PerlIO_ungetc(fp,i);
7240 return_string_or_null:
7241 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7247 Auto-increment of the value in the SV, doing string to numeric conversion
7248 if necessary. Handles 'get' magic.
7254 Perl_sv_inc(pTHX_ register SV *sv)
7263 if (SvTHINKFIRST(sv)) {
7265 sv_force_normal_flags(sv, 0);
7266 if (SvREADONLY(sv)) {
7267 if (IN_PERL_RUNTIME)
7268 Perl_croak(aTHX_ PL_no_modify);
7272 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7274 i = PTR2IV(SvRV(sv));
7279 flags = SvFLAGS(sv);
7280 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7281 /* It's (privately or publicly) a float, but not tested as an
7282 integer, so test it to see. */
7284 flags = SvFLAGS(sv);
7286 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7287 /* It's publicly an integer, or privately an integer-not-float */
7288 #ifdef PERL_PRESERVE_IVUV
7292 if (SvUVX(sv) == UV_MAX)
7293 sv_setnv(sv, UV_MAX_P1);
7295 (void)SvIOK_only_UV(sv);
7296 SvUV_set(sv, SvUVX(sv) + 1);
7298 if (SvIVX(sv) == IV_MAX)
7299 sv_setuv(sv, (UV)IV_MAX + 1);
7301 (void)SvIOK_only(sv);
7302 SvIV_set(sv, SvIVX(sv) + 1);
7307 if (flags & SVp_NOK) {
7308 (void)SvNOK_only(sv);
7309 SvNV_set(sv, SvNVX(sv) + 1.0);
7313 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7314 if ((flags & SVTYPEMASK) < SVt_PVIV)
7315 sv_upgrade(sv, SVt_IV);
7316 (void)SvIOK_only(sv);
7321 while (isALPHA(*d)) d++;
7322 while (isDIGIT(*d)) d++;
7324 #ifdef PERL_PRESERVE_IVUV
7325 /* Got to punt this as an integer if needs be, but we don't issue
7326 warnings. Probably ought to make the sv_iv_please() that does
7327 the conversion if possible, and silently. */
7328 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7329 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7330 /* Need to try really hard to see if it's an integer.
7331 9.22337203685478e+18 is an integer.
7332 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7333 so $a="9.22337203685478e+18"; $a+0; $a++
7334 needs to be the same as $a="9.22337203685478e+18"; $a++
7341 /* sv_2iv *should* have made this an NV */
7342 if (flags & SVp_NOK) {
7343 (void)SvNOK_only(sv);
7344 SvNV_set(sv, SvNVX(sv) + 1.0);
7347 /* I don't think we can get here. Maybe I should assert this
7348 And if we do get here I suspect that sv_setnv will croak. NWC
7350 #if defined(USE_LONG_DOUBLE)
7351 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",
7352 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7354 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7355 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7358 #endif /* PERL_PRESERVE_IVUV */
7359 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7363 while (d >= SvPVX(sv)) {
7371 /* MKS: The original code here died if letters weren't consecutive.
7372 * at least it didn't have to worry about non-C locales. The
7373 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7374 * arranged in order (although not consecutively) and that only
7375 * [A-Za-z] are accepted by isALPHA in the C locale.
7377 if (*d != 'z' && *d != 'Z') {
7378 do { ++*d; } while (!isALPHA(*d));
7381 *(d--) -= 'z' - 'a';
7386 *(d--) -= 'z' - 'a' + 1;
7390 /* oh,oh, the number grew */
7391 SvGROW(sv, SvCUR(sv) + 2);
7392 SvCUR_set(sv, SvCUR(sv) + 1);
7393 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7404 Auto-decrement of the value in the SV, doing string to numeric conversion
7405 if necessary. Handles 'get' magic.
7411 Perl_sv_dec(pTHX_ register SV *sv)
7419 if (SvTHINKFIRST(sv)) {
7421 sv_force_normal_flags(sv, 0);
7422 if (SvREADONLY(sv)) {
7423 if (IN_PERL_RUNTIME)
7424 Perl_croak(aTHX_ PL_no_modify);
7428 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7430 i = PTR2IV(SvRV(sv));
7435 /* Unlike sv_inc we don't have to worry about string-never-numbers
7436 and keeping them magic. But we mustn't warn on punting */
7437 flags = SvFLAGS(sv);
7438 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7439 /* It's publicly an integer, or privately an integer-not-float */
7440 #ifdef PERL_PRESERVE_IVUV
7444 if (SvUVX(sv) == 0) {
7445 (void)SvIOK_only(sv);
7449 (void)SvIOK_only_UV(sv);
7450 SvUV_set(sv, SvUVX(sv) + 1);
7453 if (SvIVX(sv) == IV_MIN)
7454 sv_setnv(sv, (NV)IV_MIN - 1.0);
7456 (void)SvIOK_only(sv);
7457 SvIV_set(sv, SvIVX(sv) - 1);
7462 if (flags & SVp_NOK) {
7463 SvNV_set(sv, SvNVX(sv) - 1.0);
7464 (void)SvNOK_only(sv);
7467 if (!(flags & SVp_POK)) {
7468 if ((flags & SVTYPEMASK) < SVt_PVNV)
7469 sv_upgrade(sv, SVt_NV);
7471 (void)SvNOK_only(sv);
7474 #ifdef PERL_PRESERVE_IVUV
7476 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7477 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7478 /* Need to try really hard to see if it's an integer.
7479 9.22337203685478e+18 is an integer.
7480 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7481 so $a="9.22337203685478e+18"; $a+0; $a--
7482 needs to be the same as $a="9.22337203685478e+18"; $a--
7489 /* sv_2iv *should* have made this an NV */
7490 if (flags & SVp_NOK) {
7491 (void)SvNOK_only(sv);
7492 SvNV_set(sv, SvNVX(sv) - 1.0);
7495 /* I don't think we can get here. Maybe I should assert this
7496 And if we do get here I suspect that sv_setnv will croak. NWC
7498 #if defined(USE_LONG_DOUBLE)
7499 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",
7500 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7502 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7503 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7507 #endif /* PERL_PRESERVE_IVUV */
7508 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7512 =for apidoc sv_mortalcopy
7514 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7515 The new SV is marked as mortal. It will be destroyed "soon", either by an
7516 explicit call to FREETMPS, or by an implicit call at places such as
7517 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7522 /* Make a string that will exist for the duration of the expression
7523 * evaluation. Actually, it may have to last longer than that, but
7524 * hopefully we won't free it until it has been assigned to a
7525 * permanent location. */
7528 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7533 sv_setsv(sv,oldstr);
7535 PL_tmps_stack[++PL_tmps_ix] = sv;
7541 =for apidoc sv_newmortal
7543 Creates a new null SV which is mortal. The reference count of the SV is
7544 set to 1. It will be destroyed "soon", either by an explicit call to
7545 FREETMPS, or by an implicit call at places such as statement boundaries.
7546 See also C<sv_mortalcopy> and C<sv_2mortal>.
7552 Perl_sv_newmortal(pTHX)
7557 SvFLAGS(sv) = SVs_TEMP;
7559 PL_tmps_stack[++PL_tmps_ix] = sv;
7564 =for apidoc sv_2mortal
7566 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7567 by an explicit call to FREETMPS, or by an implicit call at places such as
7568 statement boundaries. SvTEMP() is turned on which means that the SV's
7569 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7570 and C<sv_mortalcopy>.
7576 Perl_sv_2mortal(pTHX_ register SV *sv)
7581 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7584 PL_tmps_stack[++PL_tmps_ix] = sv;
7592 Creates a new SV and copies a string into it. The reference count for the
7593 SV is set to 1. If C<len> is zero, Perl will compute the length using
7594 strlen(). For efficiency, consider using C<newSVpvn> instead.
7600 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7607 sv_setpvn(sv,s,len);
7612 =for apidoc newSVpvn
7614 Creates a new SV and copies a string into it. The reference count for the
7615 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7616 string. You are responsible for ensuring that the source string is at least
7617 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7623 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7628 sv_setpvn(sv,s,len);
7633 =for apidoc newSVpvn_share
7635 Creates a new SV with its SvPVX pointing to a shared string in the string
7636 table. If the string does not already exist in the table, it is created
7637 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7638 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7639 otherwise the hash is computed. The idea here is that as the string table
7640 is used for shared hash keys these strings will have SvPVX == HeKEY and
7641 hash lookup will avoid string compare.
7647 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7650 bool is_utf8 = FALSE;
7652 STRLEN tmplen = -len;
7654 /* See the note in hv.c:hv_fetch() --jhi */
7655 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7659 PERL_HASH(hash, src, len);
7661 sv_upgrade(sv, SVt_PVIV);
7662 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7675 #if defined(PERL_IMPLICIT_CONTEXT)
7677 /* pTHX_ magic can't cope with varargs, so this is a no-context
7678 * version of the main function, (which may itself be aliased to us).
7679 * Don't access this version directly.
7683 Perl_newSVpvf_nocontext(const char* pat, ...)
7688 va_start(args, pat);
7689 sv = vnewSVpvf(pat, &args);
7696 =for apidoc newSVpvf
7698 Creates a new SV and initializes it with the string formatted like
7705 Perl_newSVpvf(pTHX_ const char* pat, ...)
7709 va_start(args, pat);
7710 sv = vnewSVpvf(pat, &args);
7715 /* backend for newSVpvf() and newSVpvf_nocontext() */
7718 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7722 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7729 Creates a new SV and copies a floating point value into it.
7730 The reference count for the SV is set to 1.
7736 Perl_newSVnv(pTHX_ NV n)
7748 Creates a new SV and copies an integer into it. The reference count for the
7755 Perl_newSViv(pTHX_ IV i)
7767 Creates a new SV and copies an unsigned integer into it.
7768 The reference count for the SV is set to 1.
7774 Perl_newSVuv(pTHX_ UV u)
7784 =for apidoc newRV_noinc
7786 Creates an RV wrapper for an SV. The reference count for the original
7787 SV is B<not> incremented.
7793 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7798 sv_upgrade(sv, SVt_RV);
7800 SvRV_set(sv, tmpRef);
7805 /* newRV_inc is the official function name to use now.
7806 * newRV_inc is in fact #defined to newRV in sv.h
7810 Perl_newRV(pTHX_ SV *tmpRef)
7812 return newRV_noinc(SvREFCNT_inc(tmpRef));
7818 Creates a new SV which is an exact duplicate of the original SV.
7825 Perl_newSVsv(pTHX_ register SV *old)
7831 if (SvTYPE(old) == SVTYPEMASK) {
7832 if (ckWARN_d(WARN_INTERNAL))
7833 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7837 /* SV_GMAGIC is the default for sv_setv()
7838 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7839 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7840 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7845 =for apidoc sv_reset
7847 Underlying implementation for the C<reset> Perl function.
7848 Note that the perl-level function is vaguely deprecated.
7854 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7863 char todo[PERL_UCHAR_MAX+1];
7868 if (!*s) { /* reset ?? searches */
7869 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7870 pm->op_pmdynflags &= ~PMdf_USED;
7875 /* reset variables */
7877 if (!HvARRAY(stash))
7880 Zero(todo, 256, char);
7882 i = (unsigned char)*s;
7886 max = (unsigned char)*s++;
7887 for ( ; i <= max; i++) {
7890 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7891 for (entry = HvARRAY(stash)[i];
7893 entry = HeNEXT(entry))
7895 if (!todo[(U8)*HeKEY(entry)])
7897 gv = (GV*)HeVAL(entry);
7899 if (SvTHINKFIRST(sv)) {
7900 if (!SvREADONLY(sv) && SvROK(sv))
7905 if (SvTYPE(sv) >= SVt_PV) {
7907 if (SvPVX(sv) != Nullch)
7914 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7917 #ifdef USE_ENVIRON_ARRAY
7919 # ifdef USE_ITHREADS
7920 && PL_curinterp == aTHX
7924 environ[0] = Nullch;
7927 #endif /* !PERL_MICRO */
7937 Using various gambits, try to get an IO from an SV: the IO slot if its a
7938 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7939 named after the PV if we're a string.
7945 Perl_sv_2io(pTHX_ SV *sv)
7950 switch (SvTYPE(sv)) {
7958 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7962 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7964 return sv_2io(SvRV(sv));
7965 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7971 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7980 Using various gambits, try to get a CV from an SV; in addition, try if
7981 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7987 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7994 return *gvp = Nullgv, Nullcv;
7995 switch (SvTYPE(sv)) {
8014 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
8015 tryAMAGICunDEREF(to_cv);
8018 if (SvTYPE(sv) == SVt_PVCV) {
8027 Perl_croak(aTHX_ "Not a subroutine reference");
8032 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8038 if (lref && !GvCVu(gv)) {
8041 tmpsv = NEWSV(704,0);
8042 gv_efullname3(tmpsv, gv, Nullch);
8043 /* XXX this is probably not what they think they're getting.
8044 * It has the same effect as "sub name;", i.e. just a forward
8046 newSUB(start_subparse(FALSE, 0),
8047 newSVOP(OP_CONST, 0, tmpsv),
8052 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8062 Returns true if the SV has a true value by Perl's rules.
8063 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8064 instead use an in-line version.
8070 Perl_sv_true(pTHX_ register SV *sv)
8075 const register XPV* tXpv;
8076 if ((tXpv = (XPV*)SvANY(sv)) &&
8077 (tXpv->xpv_cur > 1 ||
8078 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
8085 return SvIVX(sv) != 0;
8088 return SvNVX(sv) != 0.0;
8090 return sv_2bool(sv);
8098 A private implementation of the C<SvIVx> macro for compilers which can't
8099 cope with complex macro expressions. Always use the macro instead.
8105 Perl_sv_iv(pTHX_ register SV *sv)
8109 return (IV)SvUVX(sv);
8118 A private implementation of the C<SvUVx> macro for compilers which can't
8119 cope with complex macro expressions. Always use the macro instead.
8125 Perl_sv_uv(pTHX_ register SV *sv)
8130 return (UV)SvIVX(sv);
8138 A private implementation of the C<SvNVx> macro for compilers which can't
8139 cope with complex macro expressions. Always use the macro instead.
8145 Perl_sv_nv(pTHX_ register SV *sv)
8152 /* sv_pv() is now a macro using SvPV_nolen();
8153 * this function provided for binary compatibility only
8157 Perl_sv_pv(pTHX_ SV *sv)
8164 return sv_2pv(sv, &n_a);
8170 Use the C<SvPV_nolen> macro instead
8174 A private implementation of the C<SvPV> macro for compilers which can't
8175 cope with complex macro expressions. Always use the macro instead.
8181 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8187 return sv_2pv(sv, lp);
8192 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8198 return sv_2pv_flags(sv, lp, 0);
8201 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8202 * this function provided for binary compatibility only
8206 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8208 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8212 =for apidoc sv_pvn_force
8214 Get a sensible string out of the SV somehow.
8215 A private implementation of the C<SvPV_force> macro for compilers which
8216 can't cope with complex macro expressions. Always use the macro instead.
8218 =for apidoc sv_pvn_force_flags
8220 Get a sensible string out of the SV somehow.
8221 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8222 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8223 implemented in terms of this function.
8224 You normally want to use the various wrapper macros instead: see
8225 C<SvPV_force> and C<SvPV_force_nomg>
8231 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8235 if (SvTHINKFIRST(sv) && !SvROK(sv))
8236 sv_force_normal_flags(sv, 0);
8242 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8243 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8247 s = sv_2pv_flags(sv, lp, flags);
8248 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8253 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8254 SvGROW(sv, len + 1);
8255 Move(s,SvPVX(sv),len,char);
8260 SvPOK_on(sv); /* validate pointer */
8262 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8263 PTR2UV(sv),SvPVX(sv)));
8269 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8270 * this function provided for binary compatibility only
8274 Perl_sv_pvbyte(pTHX_ SV *sv)
8276 sv_utf8_downgrade(sv,0);
8281 =for apidoc sv_pvbyte
8283 Use C<SvPVbyte_nolen> instead.
8285 =for apidoc sv_pvbyten
8287 A private implementation of the C<SvPVbyte> macro for compilers
8288 which can't cope with complex macro expressions. Always use the macro
8295 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8297 sv_utf8_downgrade(sv,0);
8298 return sv_pvn(sv,lp);
8302 =for apidoc sv_pvbyten_force
8304 A private implementation of the C<SvPVbytex_force> macro for compilers
8305 which can't cope with complex macro expressions. Always use the macro
8312 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8314 sv_pvn_force(sv,lp);
8315 sv_utf8_downgrade(sv,0);
8320 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8321 * this function provided for binary compatibility only
8325 Perl_sv_pvutf8(pTHX_ SV *sv)
8327 sv_utf8_upgrade(sv);
8332 =for apidoc sv_pvutf8
8334 Use the C<SvPVutf8_nolen> macro instead
8336 =for apidoc sv_pvutf8n
8338 A private implementation of the C<SvPVutf8> macro for compilers
8339 which can't cope with complex macro expressions. Always use the macro
8346 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8348 sv_utf8_upgrade(sv);
8349 return sv_pvn(sv,lp);
8353 =for apidoc sv_pvutf8n_force
8355 A private implementation of the C<SvPVutf8_force> macro for compilers
8356 which can't cope with complex macro expressions. Always use the macro
8363 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8365 sv_pvn_force(sv,lp);
8366 sv_utf8_upgrade(sv);
8372 =for apidoc sv_reftype
8374 Returns a string describing what the SV is a reference to.
8380 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8382 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8383 inside return suggests a const propagation bug in g++. */
8384 if (ob && SvOBJECT(sv)) {
8385 char *name = HvNAME(SvSTASH(sv));
8386 return name ? name : (char *) "__ANON__";
8389 switch (SvTYPE(sv)) {
8406 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8407 /* tied lvalues should appear to be
8408 * scalars for backwards compatitbility */
8409 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8410 ? "SCALAR" : "LVALUE");
8411 case SVt_PVAV: return "ARRAY";
8412 case SVt_PVHV: return "HASH";
8413 case SVt_PVCV: return "CODE";
8414 case SVt_PVGV: return "GLOB";
8415 case SVt_PVFM: return "FORMAT";
8416 case SVt_PVIO: return "IO";
8417 default: return "UNKNOWN";
8423 =for apidoc sv_isobject
8425 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8426 object. If the SV is not an RV, or if the object is not blessed, then this
8433 Perl_sv_isobject(pTHX_ SV *sv)
8450 Returns a boolean indicating whether the SV is blessed into the specified
8451 class. This does not check for subtypes; use C<sv_derived_from> to verify
8452 an inheritance relationship.
8458 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8469 if (!HvNAME(SvSTASH(sv)))
8472 return strEQ(HvNAME(SvSTASH(sv)), name);
8478 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8479 it will be upgraded to one. If C<classname> is non-null then the new SV will
8480 be blessed in the specified package. The new SV is returned and its
8481 reference count is 1.
8487 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8493 SV_CHECK_THINKFIRST_COW_DROP(rv);
8496 if (SvTYPE(rv) >= SVt_PVMG) {
8497 U32 refcnt = SvREFCNT(rv);
8501 SvREFCNT(rv) = refcnt;
8504 if (SvTYPE(rv) < SVt_RV)
8505 sv_upgrade(rv, SVt_RV);
8506 else if (SvTYPE(rv) > SVt_RV) {
8517 HV* stash = gv_stashpv(classname, TRUE);
8518 (void)sv_bless(rv, stash);
8524 =for apidoc sv_setref_pv
8526 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8527 argument will be upgraded to an RV. That RV will be modified to point to
8528 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8529 into the SV. The C<classname> argument indicates the package for the
8530 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8531 will have a reference count of 1, and the RV will be returned.
8533 Do not use with other Perl types such as HV, AV, SV, CV, because those
8534 objects will become corrupted by the pointer copy process.
8536 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8542 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8545 sv_setsv(rv, &PL_sv_undef);
8549 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8554 =for apidoc sv_setref_iv
8556 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8557 argument will be upgraded to an RV. That RV will be modified to point to
8558 the new SV. The C<classname> argument indicates the package for the
8559 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8560 will have a reference count of 1, and the RV will be returned.
8566 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8568 sv_setiv(newSVrv(rv,classname), iv);
8573 =for apidoc sv_setref_uv
8575 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8576 argument will be upgraded to an RV. That RV will be modified to point to
8577 the new SV. The C<classname> argument indicates the package for the
8578 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8579 will have a reference count of 1, and the RV will be returned.
8585 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8587 sv_setuv(newSVrv(rv,classname), uv);
8592 =for apidoc sv_setref_nv
8594 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8595 argument will be upgraded to an RV. That RV will be modified to point to
8596 the new SV. The C<classname> argument indicates the package for the
8597 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8598 will have a reference count of 1, and the RV will be returned.
8604 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8606 sv_setnv(newSVrv(rv,classname), nv);
8611 =for apidoc sv_setref_pvn
8613 Copies a string into a new SV, optionally blessing the SV. The length of the
8614 string must be specified with C<n>. The C<rv> argument will be upgraded to
8615 an RV. That RV will be modified to point to the new SV. The C<classname>
8616 argument indicates the package for the blessing. Set C<classname> to
8617 C<Nullch> to avoid the blessing. The new SV will have a reference count
8618 of 1, and the RV will be returned.
8620 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8626 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8628 sv_setpvn(newSVrv(rv,classname), pv, n);
8633 =for apidoc sv_bless
8635 Blesses an SV into a specified package. The SV must be an RV. The package
8636 must be designated by its stash (see C<gv_stashpv()>). The reference count
8637 of the SV is unaffected.
8643 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8647 Perl_croak(aTHX_ "Can't bless non-reference value");
8649 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8650 if (SvREADONLY(tmpRef))
8651 Perl_croak(aTHX_ PL_no_modify);
8652 if (SvOBJECT(tmpRef)) {
8653 if (SvTYPE(tmpRef) != SVt_PVIO)
8655 SvREFCNT_dec(SvSTASH(tmpRef));
8658 SvOBJECT_on(tmpRef);
8659 if (SvTYPE(tmpRef) != SVt_PVIO)
8661 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8662 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8669 if(SvSMAGICAL(tmpRef))
8670 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8678 /* Downgrades a PVGV to a PVMG.
8682 S_sv_unglob(pTHX_ SV *sv)
8686 assert(SvTYPE(sv) == SVt_PVGV);
8691 SvREFCNT_dec(GvSTASH(sv));
8692 GvSTASH(sv) = Nullhv;
8694 sv_unmagic(sv, PERL_MAGIC_glob);
8695 Safefree(GvNAME(sv));
8698 /* need to keep SvANY(sv) in the right arena */
8699 xpvmg = new_XPVMG();
8700 StructCopy(SvANY(sv), xpvmg, XPVMG);
8701 del_XPVGV(SvANY(sv));
8704 SvFLAGS(sv) &= ~SVTYPEMASK;
8705 SvFLAGS(sv) |= SVt_PVMG;
8709 =for apidoc sv_unref_flags
8711 Unsets the RV status of the SV, and decrements the reference count of
8712 whatever was being referenced by the RV. This can almost be thought of
8713 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8714 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8715 (otherwise the decrementing is conditional on the reference count being
8716 different from one or the reference being a readonly SV).
8723 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8727 if (SvWEAKREF(sv)) {
8735 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8736 assigned to as BEGIN {$a = \"Foo"} will fail. */
8737 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8739 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8740 sv_2mortal(rv); /* Schedule for freeing later */
8744 =for apidoc sv_unref
8746 Unsets the RV status of the SV, and decrements the reference count of
8747 whatever was being referenced by the RV. This can almost be thought of
8748 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8749 being zero. See C<SvROK_off>.
8755 Perl_sv_unref(pTHX_ SV *sv)
8757 sv_unref_flags(sv, 0);
8761 =for apidoc sv_taint
8763 Taint an SV. Use C<SvTAINTED_on> instead.
8768 Perl_sv_taint(pTHX_ SV *sv)
8770 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8774 =for apidoc sv_untaint
8776 Untaint an SV. Use C<SvTAINTED_off> instead.
8781 Perl_sv_untaint(pTHX_ SV *sv)
8783 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8784 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8791 =for apidoc sv_tainted
8793 Test an SV for taintedness. Use C<SvTAINTED> instead.
8798 Perl_sv_tainted(pTHX_ SV *sv)
8800 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8801 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8802 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8809 =for apidoc sv_setpviv
8811 Copies an integer into the given SV, also updating its string value.
8812 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8818 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8820 char buf[TYPE_CHARS(UV)];
8822 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8824 sv_setpvn(sv, ptr, ebuf - ptr);
8828 =for apidoc sv_setpviv_mg
8830 Like C<sv_setpviv>, but also handles 'set' magic.
8836 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8838 char buf[TYPE_CHARS(UV)];
8840 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8842 sv_setpvn(sv, ptr, ebuf - ptr);
8846 #if defined(PERL_IMPLICIT_CONTEXT)
8848 /* pTHX_ magic can't cope with varargs, so this is a no-context
8849 * version of the main function, (which may itself be aliased to us).
8850 * Don't access this version directly.
8854 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8858 va_start(args, pat);
8859 sv_vsetpvf(sv, pat, &args);
8863 /* pTHX_ magic can't cope with varargs, so this is a no-context
8864 * version of the main function, (which may itself be aliased to us).
8865 * Don't access this version directly.
8869 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8873 va_start(args, pat);
8874 sv_vsetpvf_mg(sv, pat, &args);
8880 =for apidoc sv_setpvf
8882 Works like C<sv_catpvf> but copies the text into the SV instead of
8883 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8889 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8892 va_start(args, pat);
8893 sv_vsetpvf(sv, pat, &args);
8898 =for apidoc sv_vsetpvf
8900 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8901 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8903 Usually used via its frontend C<sv_setpvf>.
8909 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8911 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8915 =for apidoc sv_setpvf_mg
8917 Like C<sv_setpvf>, but also handles 'set' magic.
8923 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8926 va_start(args, pat);
8927 sv_vsetpvf_mg(sv, pat, &args);
8932 =for apidoc sv_vsetpvf_mg
8934 Like C<sv_vsetpvf>, but also handles 'set' magic.
8936 Usually used via its frontend C<sv_setpvf_mg>.
8942 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8944 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8948 #if defined(PERL_IMPLICIT_CONTEXT)
8950 /* pTHX_ magic can't cope with varargs, so this is a no-context
8951 * version of the main function, (which may itself be aliased to us).
8952 * Don't access this version directly.
8956 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8960 va_start(args, pat);
8961 sv_vcatpvf(sv, pat, &args);
8965 /* pTHX_ magic can't cope with varargs, so this is a no-context
8966 * version of the main function, (which may itself be aliased to us).
8967 * Don't access this version directly.
8971 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8975 va_start(args, pat);
8976 sv_vcatpvf_mg(sv, pat, &args);
8982 =for apidoc sv_catpvf
8984 Processes its arguments like C<sprintf> and appends the formatted
8985 output to an SV. If the appended data contains "wide" characters
8986 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8987 and characters >255 formatted with %c), the original SV might get
8988 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8989 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8990 valid UTF-8; if the original SV was bytes, the pattern should be too.
8995 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8998 va_start(args, pat);
8999 sv_vcatpvf(sv, pat, &args);
9004 =for apidoc sv_vcatpvf
9006 Processes its arguments like C<vsprintf> and appends the formatted output
9007 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
9009 Usually used via its frontend C<sv_catpvf>.
9015 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
9017 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9021 =for apidoc sv_catpvf_mg
9023 Like C<sv_catpvf>, but also handles 'set' magic.
9029 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9032 va_start(args, pat);
9033 sv_vcatpvf_mg(sv, pat, &args);
9038 =for apidoc sv_vcatpvf_mg
9040 Like C<sv_vcatpvf>, but also handles 'set' magic.
9042 Usually used via its frontend C<sv_catpvf_mg>.
9048 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9050 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9055 =for apidoc sv_vsetpvfn
9057 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9060 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9066 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9068 sv_setpvn(sv, "", 0);
9069 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9072 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9075 S_expect_number(pTHX_ char** pattern)
9078 switch (**pattern) {
9079 case '1': case '2': case '3':
9080 case '4': case '5': case '6':
9081 case '7': case '8': case '9':
9082 while (isDIGIT(**pattern))
9083 var = var * 10 + (*(*pattern)++ - '0');
9087 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9090 F0convert(NV nv, char *endbuf, STRLEN *len)
9101 if (uv & 1 && uv == nv)
9102 uv--; /* Round to even */
9104 unsigned dig = uv % 10;
9117 =for apidoc sv_vcatpvfn
9119 Processes its arguments like C<vsprintf> and appends the formatted output
9120 to an SV. Uses an array of SVs if the C style variable argument list is
9121 missing (NULL). When running with taint checks enabled, indicates via
9122 C<maybe_tainted> if results are untrustworthy (often due to the use of
9125 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9130 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9133 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9140 static const char nullstr[] = "(null)";
9142 bool has_utf8; /* has the result utf8? */
9143 bool pat_utf8; /* the pattern is in utf8? */
9145 /* Times 4: a decimal digit takes more than 3 binary digits.
9146 * NV_DIG: mantissa takes than many decimal digits.
9147 * Plus 32: Playing safe. */
9148 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9149 /* large enough for "%#.#f" --chip */
9150 /* what about long double NVs? --jhi */
9152 has_utf8 = pat_utf8 = DO_UTF8(sv);
9154 /* no matter what, this is a string now */
9155 (void)SvPV_force(sv, origlen);
9157 /* special-case "", "%s", and "%_" */
9160 if (patlen == 2 && pat[0] == '%') {
9164 const char *s = va_arg(*args, char*);
9165 sv_catpv(sv, s ? s : nullstr);
9167 else if (svix < svmax) {
9168 sv_catsv(sv, *svargs);
9169 if (DO_UTF8(*svargs))
9175 argsv = va_arg(*args, SV*);
9176 sv_catsv(sv, argsv);
9181 /* See comment on '_' below */
9186 #ifndef USE_LONG_DOUBLE
9187 /* special-case "%.<number>[gf]" */
9188 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9189 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9190 unsigned digits = 0;
9194 while (*pp >= '0' && *pp <= '9')
9195 digits = 10 * digits + (*pp++ - '0');
9196 if (pp - pat == (int)patlen - 1) {
9200 nv = (NV)va_arg(*args, double);
9201 else if (svix < svmax)
9206 /* Add check for digits != 0 because it seems that some
9207 gconverts are buggy in this case, and we don't yet have
9208 a Configure test for this. */
9209 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9210 /* 0, point, slack */
9211 Gconvert(nv, (int)digits, 0, ebuf);
9213 if (*ebuf) /* May return an empty string for digits==0 */
9216 } else if (!digits) {
9219 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9220 sv_catpvn(sv, p, l);
9226 #endif /* !USE_LONG_DOUBLE */
9228 if (!args && svix < svmax && DO_UTF8(*svargs))
9231 patend = (char*)pat + patlen;
9232 for (p = (char*)pat; p < patend; p = q) {
9235 bool vectorize = FALSE;
9236 bool vectorarg = FALSE;
9237 bool vec_utf8 = FALSE;
9243 bool has_precis = FALSE;
9246 bool is_utf8 = FALSE; /* is this item utf8? */
9247 #ifdef HAS_LDBL_SPRINTF_BUG
9248 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9249 with sfio - Allen <allens@cpan.org> */
9250 bool fix_ldbl_sprintf_bug = FALSE;
9254 U8 utf8buf[UTF8_MAXBYTES+1];
9255 STRLEN esignlen = 0;
9257 char *eptr = Nullch;
9260 U8 *vecstr = Null(U8*);
9267 /* we need a long double target in case HAS_LONG_DOUBLE but
9270 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9278 const char *dotstr = ".";
9279 STRLEN dotstrlen = 1;
9280 I32 efix = 0; /* explicit format parameter index */
9281 I32 ewix = 0; /* explicit width index */
9282 I32 epix = 0; /* explicit precision index */
9283 I32 evix = 0; /* explicit vector index */
9284 bool asterisk = FALSE;
9286 /* echo everything up to the next format specification */
9287 for (q = p; q < patend && *q != '%'; ++q) ;
9289 if (has_utf8 && !pat_utf8)
9290 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9292 sv_catpvn(sv, p, q - p);
9299 We allow format specification elements in this order:
9300 \d+\$ explicit format parameter index
9302 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9303 0 flag (as above): repeated to allow "v02"
9304 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9305 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9307 [%bcdefginopsux_DFOUX] format (mandatory)
9309 if (EXPECT_NUMBER(q, width)) {
9350 if (EXPECT_NUMBER(q, ewix))
9359 if ((vectorarg = asterisk)) {
9371 EXPECT_NUMBER(q, width);
9376 vecsv = va_arg(*args, SV*);
9378 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9379 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9380 dotstr = SvPVx(vecsv, dotstrlen);
9385 vecsv = va_arg(*args, SV*);
9386 vecstr = (U8*)SvPVx(vecsv,veclen);
9387 vec_utf8 = DO_UTF8(vecsv);
9389 else if (efix ? efix <= svmax : svix < svmax) {
9390 vecsv = svargs[efix ? efix-1 : svix++];
9391 vecstr = (U8*)SvPVx(vecsv,veclen);
9392 vec_utf8 = DO_UTF8(vecsv);
9393 /* if this is a version object, we need to return the
9394 * stringified representation (which the SvPVX has
9395 * already done for us), but not vectorize the args
9397 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9399 q++; /* skip past the rest of the %vd format */
9400 eptr = (char *) vecstr;
9401 elen = strlen(eptr);
9414 i = va_arg(*args, int);
9416 i = (ewix ? ewix <= svmax : svix < svmax) ?
9417 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9419 width = (i < 0) ? -i : i;
9429 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9431 /* XXX: todo, support specified precision parameter */
9435 i = va_arg(*args, int);
9437 i = (ewix ? ewix <= svmax : svix < svmax)
9438 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9439 precis = (i < 0) ? 0 : i;
9444 precis = precis * 10 + (*q++ - '0');
9453 case 'I': /* Ix, I32x, and I64x */
9455 if (q[1] == '6' && q[2] == '4') {
9461 if (q[1] == '3' && q[2] == '2') {
9471 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9482 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9483 if (*(q + 1) == 'l') { /* lld, llf */
9508 argsv = (efix ? efix <= svmax : svix < svmax) ?
9509 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9516 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9518 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9520 eptr = (char*)utf8buf;
9521 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9532 if (args && !vectorize) {
9533 eptr = va_arg(*args, char*);
9535 #ifdef MACOS_TRADITIONAL
9536 /* On MacOS, %#s format is used for Pascal strings */
9541 elen = strlen(eptr);
9543 eptr = (char *)nullstr;
9544 elen = sizeof nullstr - 1;
9548 eptr = SvPVx(argsv, elen);
9549 if (DO_UTF8(argsv)) {
9550 if (has_precis && precis < elen) {
9552 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9555 if (width) { /* fudge width (can't fudge elen) */
9556 width += elen - sv_len_utf8(argsv);
9568 * The "%_" hack might have to be changed someday,
9569 * if ISO or ANSI decide to use '_' for something.
9570 * So we keep it hidden from users' code.
9572 if (!args || vectorize)
9574 argsv = va_arg(*args, SV*);
9575 eptr = SvPVx(argsv, elen);
9581 if (has_precis && elen > precis)
9592 goto format_sv; /* %-p -> %_ */
9596 goto format_sv; /* %-Np -> %.N_ */
9599 if (alt || vectorize)
9601 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9619 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9628 esignbuf[esignlen++] = plus;
9632 case 'h': iv = (short)va_arg(*args, int); break;
9633 case 'l': iv = va_arg(*args, long); break;
9634 case 'V': iv = va_arg(*args, IV); break;
9635 default: iv = va_arg(*args, int); break;
9637 case 'q': iv = va_arg(*args, Quad_t); break;
9642 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9644 case 'h': iv = (short)tiv; break;
9645 case 'l': iv = (long)tiv; break;
9647 default: iv = tiv; break;
9649 case 'q': iv = (Quad_t)tiv; break;
9653 if ( !vectorize ) /* we already set uv above */
9658 esignbuf[esignlen++] = plus;
9662 esignbuf[esignlen++] = '-';
9705 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9716 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9717 case 'l': uv = va_arg(*args, unsigned long); break;
9718 case 'V': uv = va_arg(*args, UV); break;
9719 default: uv = va_arg(*args, unsigned); break;
9721 case 'q': uv = va_arg(*args, Uquad_t); break;
9726 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9728 case 'h': uv = (unsigned short)tuv; break;
9729 case 'l': uv = (unsigned long)tuv; break;
9731 default: uv = tuv; break;
9733 case 'q': uv = (Uquad_t)tuv; break;
9739 eptr = ebuf + sizeof ebuf;
9745 p = (char*)((c == 'X')
9746 ? "0123456789ABCDEF" : "0123456789abcdef");
9752 esignbuf[esignlen++] = '0';
9753 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9759 *--eptr = '0' + dig;
9761 if (alt && *eptr != '0')
9767 *--eptr = '0' + dig;
9770 esignbuf[esignlen++] = '0';
9771 esignbuf[esignlen++] = 'b';
9774 default: /* it had better be ten or less */
9777 *--eptr = '0' + dig;
9778 } while (uv /= base);
9781 elen = (ebuf + sizeof ebuf) - eptr;
9784 zeros = precis - elen;
9785 else if (precis == 0 && elen == 1 && *eptr == '0')
9790 /* FLOATING POINT */
9793 c = 'f'; /* maybe %F isn't supported here */
9799 /* This is evil, but floating point is even more evil */
9801 /* for SV-style calling, we can only get NV
9802 for C-style calling, we assume %f is double;
9803 for simplicity we allow any of %Lf, %llf, %qf for long double
9807 #if defined(USE_LONG_DOUBLE)
9811 /* [perl #20339] - we should accept and ignore %lf rather than die */
9815 #if defined(USE_LONG_DOUBLE)
9816 intsize = args ? 0 : 'q';
9820 #if defined(HAS_LONG_DOUBLE)
9829 /* now we need (long double) if intsize == 'q', else (double) */
9830 nv = (args && !vectorize) ?
9831 #if LONG_DOUBLESIZE > DOUBLESIZE
9833 va_arg(*args, long double) :
9834 va_arg(*args, double)
9836 va_arg(*args, double)
9842 if (c != 'e' && c != 'E') {
9844 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9845 will cast our (long double) to (double) */
9846 (void)Perl_frexp(nv, &i);
9847 if (i == PERL_INT_MIN)
9848 Perl_die(aTHX_ "panic: frexp");
9850 need = BIT_DIGITS(i);
9852 need += has_precis ? precis : 6; /* known default */
9857 #ifdef HAS_LDBL_SPRINTF_BUG
9858 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9859 with sfio - Allen <allens@cpan.org> */
9862 # define MY_DBL_MAX DBL_MAX
9863 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9864 # if DOUBLESIZE >= 8
9865 # define MY_DBL_MAX 1.7976931348623157E+308L
9867 # define MY_DBL_MAX 3.40282347E+38L
9871 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9872 # define MY_DBL_MAX_BUG 1L
9874 # define MY_DBL_MAX_BUG MY_DBL_MAX
9878 # define MY_DBL_MIN DBL_MIN
9879 # else /* XXX guessing! -Allen */
9880 # if DOUBLESIZE >= 8
9881 # define MY_DBL_MIN 2.2250738585072014E-308L
9883 # define MY_DBL_MIN 1.17549435E-38L
9887 if ((intsize == 'q') && (c == 'f') &&
9888 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9890 /* it's going to be short enough that
9891 * long double precision is not needed */
9893 if ((nv <= 0L) && (nv >= -0L))
9894 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9896 /* would use Perl_fp_class as a double-check but not
9897 * functional on IRIX - see perl.h comments */
9899 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9900 /* It's within the range that a double can represent */
9901 #if defined(DBL_MAX) && !defined(DBL_MIN)
9902 if ((nv >= ((long double)1/DBL_MAX)) ||
9903 (nv <= (-(long double)1/DBL_MAX)))
9905 fix_ldbl_sprintf_bug = TRUE;
9908 if (fix_ldbl_sprintf_bug == TRUE) {
9918 # undef MY_DBL_MAX_BUG
9921 #endif /* HAS_LDBL_SPRINTF_BUG */
9923 need += 20; /* fudge factor */
9924 if (PL_efloatsize < need) {
9925 Safefree(PL_efloatbuf);
9926 PL_efloatsize = need + 20; /* more fudge */
9927 New(906, PL_efloatbuf, PL_efloatsize, char);
9928 PL_efloatbuf[0] = '\0';
9931 if ( !(width || left || plus || alt) && fill != '0'
9932 && has_precis && intsize != 'q' ) { /* Shortcuts */
9933 /* See earlier comment about buggy Gconvert when digits,
9935 if ( c == 'g' && precis) {
9936 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9937 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9938 goto float_converted;
9939 } else if ( c == 'f' && !precis) {
9940 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9944 eptr = ebuf + sizeof ebuf;
9947 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9948 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9949 if (intsize == 'q') {
9950 /* Copy the one or more characters in a long double
9951 * format before the 'base' ([efgEFG]) character to
9952 * the format string. */
9953 static char const prifldbl[] = PERL_PRIfldbl;
9954 char const *p = prifldbl + sizeof(prifldbl) - 3;
9955 while (p >= prifldbl) { *--eptr = *p--; }
9960 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9965 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9977 /* No taint. Otherwise we are in the strange situation
9978 * where printf() taints but print($float) doesn't.
9980 #if defined(HAS_LONG_DOUBLE)
9982 (void)sprintf(PL_efloatbuf, eptr, nv);
9984 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9986 (void)sprintf(PL_efloatbuf, eptr, nv);
9989 eptr = PL_efloatbuf;
9990 elen = strlen(PL_efloatbuf);
9996 i = SvCUR(sv) - origlen;
9997 if (args && !vectorize) {
9999 case 'h': *(va_arg(*args, short*)) = i; break;
10000 default: *(va_arg(*args, int*)) = i; break;
10001 case 'l': *(va_arg(*args, long*)) = i; break;
10002 case 'V': *(va_arg(*args, IV*)) = i; break;
10004 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
10009 sv_setuv_mg(argsv, (UV)i);
10011 continue; /* not "break" */
10017 if (!args && ckWARN(WARN_PRINTF) &&
10018 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
10019 SV *msg = sv_newmortal();
10020 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
10021 (PL_op->op_type == OP_PRTF) ? "" : "s");
10024 Perl_sv_catpvf(aTHX_ msg,
10025 "\"%%%c\"", c & 0xFF);
10027 Perl_sv_catpvf(aTHX_ msg,
10028 "\"%%\\%03"UVof"\"",
10031 sv_catpv(msg, "end of string");
10032 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10035 /* output mangled stuff ... */
10041 /* ... right here, because formatting flags should not apply */
10042 SvGROW(sv, SvCUR(sv) + elen + 1);
10044 Copy(eptr, p, elen, char);
10047 SvCUR_set(sv, p - SvPVX(sv));
10049 continue; /* not "break" */
10052 /* calculate width before utf8_upgrade changes it */
10053 have = esignlen + zeros + elen;
10055 if (is_utf8 != has_utf8) {
10058 sv_utf8_upgrade(sv);
10061 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10062 sv_utf8_upgrade(nsv);
10066 SvGROW(sv, SvCUR(sv) + elen + 1);
10071 need = (have > width ? have : width);
10074 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10076 if (esignlen && fill == '0') {
10077 for (i = 0; i < (int)esignlen; i++)
10078 *p++ = esignbuf[i];
10080 if (gap && !left) {
10081 memset(p, fill, gap);
10084 if (esignlen && fill != '0') {
10085 for (i = 0; i < (int)esignlen; i++)
10086 *p++ = esignbuf[i];
10089 for (i = zeros; i; i--)
10093 Copy(eptr, p, elen, char);
10097 memset(p, ' ', gap);
10102 Copy(dotstr, p, dotstrlen, char);
10106 vectorize = FALSE; /* done iterating over vecstr */
10113 SvCUR_set(sv, p - SvPVX(sv));
10121 /* =========================================================================
10123 =head1 Cloning an interpreter
10125 All the macros and functions in this section are for the private use of
10126 the main function, perl_clone().
10128 The foo_dup() functions make an exact copy of an existing foo thinngy.
10129 During the course of a cloning, a hash table is used to map old addresses
10130 to new addresses. The table is created and manipulated with the
10131 ptr_table_* functions.
10135 ============================================================================*/
10138 #if defined(USE_ITHREADS)
10140 #ifndef GpREFCNT_inc
10141 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10145 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10146 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10147 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10148 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10149 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10150 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10151 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10152 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10153 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10154 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10155 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10156 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10157 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10160 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10161 regcomp.c. AMS 20010712 */
10164 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10169 struct reg_substr_datum *s;
10172 return (REGEXP *)NULL;
10174 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10177 len = r->offsets[0];
10178 npar = r->nparens+1;
10180 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10181 Copy(r->program, ret->program, len+1, regnode);
10183 New(0, ret->startp, npar, I32);
10184 Copy(r->startp, ret->startp, npar, I32);
10185 New(0, ret->endp, npar, I32);
10186 Copy(r->startp, ret->startp, npar, I32);
10188 New(0, ret->substrs, 1, struct reg_substr_data);
10189 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10190 s->min_offset = r->substrs->data[i].min_offset;
10191 s->max_offset = r->substrs->data[i].max_offset;
10192 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10193 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10196 ret->regstclass = NULL;
10198 struct reg_data *d;
10199 const int count = r->data->count;
10201 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10202 char, struct reg_data);
10203 New(0, d->what, count, U8);
10206 for (i = 0; i < count; i++) {
10207 d->what[i] = r->data->what[i];
10208 switch (d->what[i]) {
10209 /* legal options are one of: sfpont
10210 see also regcomp.h and pregfree() */
10212 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10215 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10218 /* This is cheating. */
10219 New(0, d->data[i], 1, struct regnode_charclass_class);
10220 StructCopy(r->data->data[i], d->data[i],
10221 struct regnode_charclass_class);
10222 ret->regstclass = (regnode*)d->data[i];
10225 /* Compiled op trees are readonly, and can thus be
10226 shared without duplication. */
10228 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10232 d->data[i] = r->data->data[i];
10235 d->data[i] = r->data->data[i];
10237 ((reg_trie_data*)d->data[i])->refcount++;
10241 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10250 New(0, ret->offsets, 2*len+1, U32);
10251 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10253 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10254 ret->refcnt = r->refcnt;
10255 ret->minlen = r->minlen;
10256 ret->prelen = r->prelen;
10257 ret->nparens = r->nparens;
10258 ret->lastparen = r->lastparen;
10259 ret->lastcloseparen = r->lastcloseparen;
10260 ret->reganch = r->reganch;
10262 ret->sublen = r->sublen;
10264 if (RX_MATCH_COPIED(ret))
10265 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10267 ret->subbeg = Nullch;
10268 #ifdef PERL_COPY_ON_WRITE
10269 ret->saved_copy = Nullsv;
10272 ptr_table_store(PL_ptr_table, r, ret);
10276 /* duplicate a file handle */
10279 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10285 return (PerlIO*)NULL;
10287 /* look for it in the table first */
10288 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10292 /* create anew and remember what it is */
10293 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10294 ptr_table_store(PL_ptr_table, fp, ret);
10298 /* duplicate a directory handle */
10301 Perl_dirp_dup(pTHX_ DIR *dp)
10309 /* duplicate a typeglob */
10312 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10317 /* look for it in the table first */
10318 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10322 /* create anew and remember what it is */
10323 Newz(0, ret, 1, GP);
10324 ptr_table_store(PL_ptr_table, gp, ret);
10327 ret->gp_refcnt = 0; /* must be before any other dups! */
10328 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10329 ret->gp_io = io_dup_inc(gp->gp_io, param);
10330 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10331 ret->gp_av = av_dup_inc(gp->gp_av, param);
10332 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10333 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10334 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10335 ret->gp_cvgen = gp->gp_cvgen;
10336 ret->gp_flags = gp->gp_flags;
10337 ret->gp_line = gp->gp_line;
10338 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10342 /* duplicate a chain of magic */
10345 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10347 MAGIC *mgprev = (MAGIC*)NULL;
10350 return (MAGIC*)NULL;
10351 /* look for it in the table first */
10352 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10356 for (; mg; mg = mg->mg_moremagic) {
10358 Newz(0, nmg, 1, MAGIC);
10360 mgprev->mg_moremagic = nmg;
10363 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10364 nmg->mg_private = mg->mg_private;
10365 nmg->mg_type = mg->mg_type;
10366 nmg->mg_flags = mg->mg_flags;
10367 if (mg->mg_type == PERL_MAGIC_qr) {
10368 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10370 else if(mg->mg_type == PERL_MAGIC_backref) {
10371 const AV * const av = (AV*) mg->mg_obj;
10374 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10376 for (i = AvFILLp(av); i >= 0; i--) {
10377 if (!svp[i]) continue;
10378 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10382 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10383 ? sv_dup_inc(mg->mg_obj, param)
10384 : sv_dup(mg->mg_obj, param);
10386 nmg->mg_len = mg->mg_len;
10387 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10388 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10389 if (mg->mg_len > 0) {
10390 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10391 if (mg->mg_type == PERL_MAGIC_overload_table &&
10392 AMT_AMAGIC((AMT*)mg->mg_ptr))
10394 AMT *amtp = (AMT*)mg->mg_ptr;
10395 AMT *namtp = (AMT*)nmg->mg_ptr;
10397 for (i = 1; i < NofAMmeth; i++) {
10398 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10402 else if (mg->mg_len == HEf_SVKEY)
10403 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10405 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10406 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10413 /* create a new pointer-mapping table */
10416 Perl_ptr_table_new(pTHX)
10419 Newz(0, tbl, 1, PTR_TBL_t);
10420 tbl->tbl_max = 511;
10421 tbl->tbl_items = 0;
10422 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10427 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10429 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10437 register struct ptr_tbl_ent* pte;
10438 register struct ptr_tbl_ent* pteend;
10439 New(0, pte, PERL_ARENA_SIZE/sizeof(struct ptr_tbl_ent), struct ptr_tbl_ent);
10440 pte->next = PL_pte_arenaroot;
10441 PL_pte_arenaroot = pte;
10443 pteend = &pte[PERL_ARENA_SIZE / sizeof(struct ptr_tbl_ent) - 1];
10444 PL_pte_root = ++pte;
10445 while (pte < pteend) {
10446 pte->next = pte + 1;
10452 STATIC struct ptr_tbl_ent*
10455 struct ptr_tbl_ent* pte;
10459 PL_pte_root = pte->next;
10464 S_del_pte(pTHX_ struct ptr_tbl_ent*p)
10466 p->next = PL_pte_root;
10470 /* map an existing pointer using a table */
10473 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10475 PTR_TBL_ENT_t *tblent;
10476 const UV hash = PTR_TABLE_HASH(sv);
10478 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10479 for (; tblent; tblent = tblent->next) {
10480 if (tblent->oldval == sv)
10481 return tblent->newval;
10483 return (void*)NULL;
10486 /* add a new entry to a pointer-mapping table */
10489 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10491 PTR_TBL_ENT_t *tblent, **otblent;
10492 /* XXX this may be pessimal on platforms where pointers aren't good
10493 * hash values e.g. if they grow faster in the most significant
10495 const UV hash = PTR_TABLE_HASH(oldv);
10499 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10500 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10501 if (tblent->oldval == oldv) {
10502 tblent->newval = newv;
10506 tblent = S_new_pte(aTHX);
10507 tblent->oldval = oldv;
10508 tblent->newval = newv;
10509 tblent->next = *otblent;
10512 if (!empty && tbl->tbl_items > tbl->tbl_max)
10513 ptr_table_split(tbl);
10516 /* double the hash bucket size of an existing ptr table */
10519 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10521 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10522 const UV oldsize = tbl->tbl_max + 1;
10523 UV newsize = oldsize * 2;
10526 Renew(ary, newsize, PTR_TBL_ENT_t*);
10527 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10528 tbl->tbl_max = --newsize;
10529 tbl->tbl_ary = ary;
10530 for (i=0; i < oldsize; i++, ary++) {
10531 PTR_TBL_ENT_t **curentp, **entp, *ent;
10534 curentp = ary + oldsize;
10535 for (entp = ary, ent = *ary; ent; ent = *entp) {
10536 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10538 ent->next = *curentp;
10548 /* remove all the entries from a ptr table */
10551 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10553 register PTR_TBL_ENT_t **array;
10554 register PTR_TBL_ENT_t *entry;
10558 if (!tbl || !tbl->tbl_items) {
10562 array = tbl->tbl_ary;
10564 max = tbl->tbl_max;
10568 PTR_TBL_ENT_t *oentry = entry;
10569 entry = entry->next;
10570 S_del_pte(aTHX_ oentry);
10573 if (++riter > max) {
10576 entry = array[riter];
10580 tbl->tbl_items = 0;
10583 /* clear and free a ptr table */
10586 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10591 ptr_table_clear(tbl);
10592 Safefree(tbl->tbl_ary);
10596 /* attempt to make everything in the typeglob readonly */
10599 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10601 GV *gv = (GV*)sstr;
10602 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10604 if (GvIO(gv) || GvFORM(gv)) {
10605 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10607 else if (!GvCV(gv)) {
10608 GvCV(gv) = (CV*)sv;
10611 /* CvPADLISTs cannot be shared */
10612 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10617 if (!GvUNIQUE(gv)) {
10619 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10620 HvNAME(GvSTASH(gv)), GvNAME(gv));
10626 * write attempts will die with
10627 * "Modification of a read-only value attempted"
10633 SvREADONLY_on(GvSV(gv));
10637 GvAV(gv) = (AV*)sv;
10640 SvREADONLY_on(GvAV(gv));
10644 GvHV(gv) = (HV*)sv;
10647 SvREADONLY_on(GvHV(gv));
10650 return sstr; /* he_dup() will SvREFCNT_inc() */
10653 /* duplicate an SV of any type (including AV, HV etc) */
10656 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10659 SvRV_set(dstr, SvWEAKREF(sstr)
10660 ? sv_dup(SvRV(sstr), param)
10661 : sv_dup_inc(SvRV(sstr), param));
10664 else if (SvPVX(sstr)) {
10665 /* Has something there */
10667 /* Normal PV - clone whole allocated space */
10668 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10669 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10670 /* Not that normal - actually sstr is copy on write.
10671 But we are a true, independant SV, so: */
10672 SvREADONLY_off(dstr);
10677 /* Special case - not normally malloced for some reason */
10678 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10679 /* A "shared" PV - clone it as unshared string */
10680 if(SvPADTMP(sstr)) {
10681 /* However, some of them live in the pad
10682 and they should not have these flags
10685 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10687 SvUV_set(dstr, SvUVX(sstr));
10690 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10692 SvREADONLY_off(dstr);
10696 /* Some other special case - random pointer */
10697 SvPV_set(dstr, SvPVX(sstr));
10702 /* Copy the Null */
10703 if (SvTYPE(dstr) == SVt_RV)
10704 SvRV_set(dstr, NULL);
10711 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10716 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10718 /* look for it in the table first */
10719 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10723 if(param->flags & CLONEf_JOIN_IN) {
10724 /** We are joining here so we don't want do clone
10725 something that is bad **/
10727 if(SvTYPE(sstr) == SVt_PVHV &&
10729 /** don't clone stashes if they already exist **/
10730 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10731 return (SV*) old_stash;
10735 /* create anew and remember what it is */
10738 #ifdef DEBUG_LEAKING_SCALARS
10739 dstr->sv_debug_optype = sstr->sv_debug_optype;
10740 dstr->sv_debug_line = sstr->sv_debug_line;
10741 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10742 dstr->sv_debug_cloned = 1;
10744 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10746 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10750 ptr_table_store(PL_ptr_table, sstr, dstr);
10753 SvFLAGS(dstr) = SvFLAGS(sstr);
10754 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10755 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10758 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10759 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10760 PL_watch_pvx, SvPVX(sstr));
10763 /* don't clone objects whose class has asked us not to */
10764 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10765 SvFLAGS(dstr) &= ~SVTYPEMASK;
10766 SvOBJECT_off(dstr);
10770 switch (SvTYPE(sstr)) {
10772 SvANY(dstr) = NULL;
10775 SvANY(dstr) = new_XIV();
10776 SvIV_set(dstr, SvIVX(sstr));
10779 SvANY(dstr) = new_XNV();
10780 SvNV_set(dstr, SvNVX(sstr));
10783 SvANY(dstr) = new_XRV();
10784 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10787 SvANY(dstr) = new_XPV();
10788 SvCUR_set(dstr, SvCUR(sstr));
10789 SvLEN_set(dstr, SvLEN(sstr));
10790 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10793 SvANY(dstr) = new_XPVIV();
10794 SvCUR_set(dstr, SvCUR(sstr));
10795 SvLEN_set(dstr, SvLEN(sstr));
10796 SvIV_set(dstr, SvIVX(sstr));
10797 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10800 SvANY(dstr) = new_XPVNV();
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 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10808 SvANY(dstr) = new_XPVMG();
10809 SvCUR_set(dstr, SvCUR(sstr));
10810 SvLEN_set(dstr, SvLEN(sstr));
10811 SvIV_set(dstr, SvIVX(sstr));
10812 SvNV_set(dstr, SvNVX(sstr));
10813 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10814 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10815 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10818 SvANY(dstr) = new_XPVBM();
10819 SvCUR_set(dstr, SvCUR(sstr));
10820 SvLEN_set(dstr, SvLEN(sstr));
10821 SvIV_set(dstr, SvIVX(sstr));
10822 SvNV_set(dstr, SvNVX(sstr));
10823 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10824 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10825 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10826 BmRARE(dstr) = BmRARE(sstr);
10827 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10828 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10831 SvANY(dstr) = new_XPVLV();
10832 SvCUR_set(dstr, SvCUR(sstr));
10833 SvLEN_set(dstr, SvLEN(sstr));
10834 SvIV_set(dstr, SvIVX(sstr));
10835 SvNV_set(dstr, SvNVX(sstr));
10836 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10837 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10838 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10839 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10840 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10841 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10842 LvTARG(dstr) = dstr;
10843 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10844 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10846 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10847 LvTYPE(dstr) = LvTYPE(sstr);
10850 if (GvUNIQUE((GV*)sstr)) {
10852 if ((share = gv_share(sstr, param))) {
10855 ptr_table_store(PL_ptr_table, sstr, dstr);
10857 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10858 HvNAME(GvSTASH(share)), GvNAME(share));
10863 SvANY(dstr) = new_XPVGV();
10864 SvCUR_set(dstr, SvCUR(sstr));
10865 SvLEN_set(dstr, SvLEN(sstr));
10866 SvIV_set(dstr, SvIVX(sstr));
10867 SvNV_set(dstr, SvNVX(sstr));
10868 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10869 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10870 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10871 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10872 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10873 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10874 GvFLAGS(dstr) = GvFLAGS(sstr);
10875 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10876 (void)GpREFCNT_inc(GvGP(dstr));
10879 SvANY(dstr) = new_XPVIO();
10880 SvCUR_set(dstr, SvCUR(sstr));
10881 SvLEN_set(dstr, SvLEN(sstr));
10882 SvIV_set(dstr, SvIVX(sstr));
10883 SvNV_set(dstr, SvNVX(sstr));
10884 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10885 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10886 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10887 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10888 if (IoOFP(sstr) == IoIFP(sstr))
10889 IoOFP(dstr) = IoIFP(dstr);
10891 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10892 /* PL_rsfp_filters entries have fake IoDIRP() */
10893 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10894 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10896 IoDIRP(dstr) = IoDIRP(sstr);
10897 IoLINES(dstr) = IoLINES(sstr);
10898 IoPAGE(dstr) = IoPAGE(sstr);
10899 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10900 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10901 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10902 /* I have no idea why fake dirp (rsfps)
10903 should be treaded differently but otherwise
10904 we end up with leaks -- sky*/
10905 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10906 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10907 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10909 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10910 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10911 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10913 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10914 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10915 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10916 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10917 IoTYPE(dstr) = IoTYPE(sstr);
10918 IoFLAGS(dstr) = IoFLAGS(sstr);
10921 SvANY(dstr) = new_XPVAV();
10922 SvCUR_set(dstr, SvCUR(sstr));
10923 SvLEN_set(dstr, SvLEN(sstr));
10924 SvIV_set(dstr, SvIVX(sstr));
10925 SvNV_set(dstr, SvNVX(sstr));
10926 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10927 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10928 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10929 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10930 if (AvARRAY((AV*)sstr)) {
10931 SV **dst_ary, **src_ary;
10932 SSize_t items = AvFILLp((AV*)sstr) + 1;
10934 src_ary = AvARRAY((AV*)sstr);
10935 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10936 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10937 SvPV_set(dstr, (char*)dst_ary);
10938 AvALLOC((AV*)dstr) = dst_ary;
10939 if (AvREAL((AV*)sstr)) {
10940 while (items-- > 0)
10941 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10944 while (items-- > 0)
10945 *dst_ary++ = sv_dup(*src_ary++, param);
10947 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10948 while (items-- > 0) {
10949 *dst_ary++ = &PL_sv_undef;
10953 SvPV_set(dstr, Nullch);
10954 AvALLOC((AV*)dstr) = (SV**)NULL;
10958 SvANY(dstr) = new_XPVHV();
10959 SvCUR_set(dstr, SvCUR(sstr));
10960 SvLEN_set(dstr, SvLEN(sstr));
10961 SvIV_set(dstr, SvIVX(sstr));
10962 SvNV_set(dstr, SvNVX(sstr));
10963 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10964 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10965 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10966 if (HvARRAY((HV*)sstr)) {
10968 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10969 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10970 Newz(0, dxhv->xhv_array,
10971 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10972 while (i <= sxhv->xhv_max) {
10973 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10974 (bool)!!HvSHAREKEYS(sstr),
10978 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10979 (bool)!!HvSHAREKEYS(sstr), param);
10982 SvPV_set(dstr, Nullch);
10983 HvEITER((HV*)dstr) = (HE*)NULL;
10985 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10986 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10987 /* Record stashes for possible cloning in Perl_clone(). */
10988 if(HvNAME((HV*)dstr))
10989 av_push(param->stashes, dstr);
10992 SvANY(dstr) = new_XPVFM();
10993 FmLINES(dstr) = FmLINES(sstr);
10997 SvANY(dstr) = new_XPVCV();
10999 SvCUR_set(dstr, SvCUR(sstr));
11000 SvLEN_set(dstr, SvLEN(sstr));
11001 SvIV_set(dstr, SvIVX(sstr));
11002 SvNV_set(dstr, SvNVX(sstr));
11003 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
11004 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
11005 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
11006 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
11007 CvSTART(dstr) = CvSTART(sstr);
11009 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
11011 CvXSUB(dstr) = CvXSUB(sstr);
11012 CvXSUBANY(dstr) = CvXSUBANY(sstr);
11013 if (CvCONST(sstr)) {
11014 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
11015 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
11016 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
11018 /* don't dup if copying back - CvGV isn't refcounted, so the
11019 * duped GV may never be freed. A bit of a hack! DAPM */
11020 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
11021 Nullgv : gv_dup(CvGV(sstr), param) ;
11022 if (param->flags & CLONEf_COPY_STACKS) {
11023 CvDEPTH(dstr) = CvDEPTH(sstr);
11027 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
11028 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
11030 CvWEAKOUTSIDE(sstr)
11031 ? cv_dup( CvOUTSIDE(sstr), param)
11032 : cv_dup_inc(CvOUTSIDE(sstr), param);
11033 CvFLAGS(dstr) = CvFLAGS(sstr);
11034 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
11037 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
11041 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
11047 /* duplicate a context */
11050 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11052 PERL_CONTEXT *ncxs;
11055 return (PERL_CONTEXT*)NULL;
11057 /* look for it in the table first */
11058 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11062 /* create anew and remember what it is */
11063 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11064 ptr_table_store(PL_ptr_table, cxs, ncxs);
11067 PERL_CONTEXT *cx = &cxs[ix];
11068 PERL_CONTEXT *ncx = &ncxs[ix];
11069 ncx->cx_type = cx->cx_type;
11070 if (CxTYPE(cx) == CXt_SUBST) {
11071 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11074 ncx->blk_oldsp = cx->blk_oldsp;
11075 ncx->blk_oldcop = cx->blk_oldcop;
11076 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11077 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11078 ncx->blk_oldpm = cx->blk_oldpm;
11079 ncx->blk_gimme = cx->blk_gimme;
11080 switch (CxTYPE(cx)) {
11082 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11083 ? cv_dup_inc(cx->blk_sub.cv, param)
11084 : cv_dup(cx->blk_sub.cv,param));
11085 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11086 ? av_dup_inc(cx->blk_sub.argarray, param)
11088 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11089 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11090 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11091 ncx->blk_sub.lval = cx->blk_sub.lval;
11092 ncx->blk_sub.retop = cx->blk_sub.retop;
11095 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11096 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11097 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11098 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11099 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11100 ncx->blk_eval.retop = cx->blk_eval.retop;
11103 ncx->blk_loop.label = cx->blk_loop.label;
11104 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11105 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11106 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11107 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11108 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11109 ? cx->blk_loop.iterdata
11110 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11111 ncx->blk_loop.oldcomppad
11112 = (PAD*)ptr_table_fetch(PL_ptr_table,
11113 cx->blk_loop.oldcomppad);
11114 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11115 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11116 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11117 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11118 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11121 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11122 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11123 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11124 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11125 ncx->blk_sub.retop = cx->blk_sub.retop;
11137 /* duplicate a stack info structure */
11140 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11145 return (PERL_SI*)NULL;
11147 /* look for it in the table first */
11148 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11152 /* create anew and remember what it is */
11153 Newz(56, nsi, 1, PERL_SI);
11154 ptr_table_store(PL_ptr_table, si, nsi);
11156 nsi->si_stack = av_dup_inc(si->si_stack, param);
11157 nsi->si_cxix = si->si_cxix;
11158 nsi->si_cxmax = si->si_cxmax;
11159 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11160 nsi->si_type = si->si_type;
11161 nsi->si_prev = si_dup(si->si_prev, param);
11162 nsi->si_next = si_dup(si->si_next, param);
11163 nsi->si_markoff = si->si_markoff;
11168 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11169 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11170 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11171 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11172 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11173 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11174 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11175 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11176 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11177 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11178 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11179 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11180 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11181 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11184 #define pv_dup_inc(p) SAVEPV(p)
11185 #define pv_dup(p) SAVEPV(p)
11186 #define svp_dup_inc(p,pp) any_dup(p,pp)
11188 /* map any object to the new equivent - either something in the
11189 * ptr table, or something in the interpreter structure
11193 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11198 return (void*)NULL;
11200 /* look for it in the table first */
11201 ret = ptr_table_fetch(PL_ptr_table, v);
11205 /* see if it is part of the interpreter structure */
11206 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11207 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11215 /* duplicate the save stack */
11218 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11220 ANY *ss = proto_perl->Tsavestack;
11221 I32 ix = proto_perl->Tsavestack_ix;
11222 I32 max = proto_perl->Tsavestack_max;
11235 void (*dptr) (void*);
11236 void (*dxptr) (pTHX_ void*);
11239 Newz(54, nss, max, ANY);
11243 TOPINT(nss,ix) = i;
11245 case SAVEt_ITEM: /* normal string */
11246 sv = (SV*)POPPTR(ss,ix);
11247 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11248 sv = (SV*)POPPTR(ss,ix);
11249 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11251 case SAVEt_SV: /* scalar reference */
11252 sv = (SV*)POPPTR(ss,ix);
11253 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11254 gv = (GV*)POPPTR(ss,ix);
11255 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11257 case SAVEt_GENERIC_PVREF: /* generic char* */
11258 c = (char*)POPPTR(ss,ix);
11259 TOPPTR(nss,ix) = pv_dup(c);
11260 ptr = POPPTR(ss,ix);
11261 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11263 case SAVEt_SHARED_PVREF: /* char* in shared space */
11264 c = (char*)POPPTR(ss,ix);
11265 TOPPTR(nss,ix) = savesharedpv(c);
11266 ptr = POPPTR(ss,ix);
11267 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11269 case SAVEt_GENERIC_SVREF: /* generic sv */
11270 case SAVEt_SVREF: /* scalar reference */
11271 sv = (SV*)POPPTR(ss,ix);
11272 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11273 ptr = POPPTR(ss,ix);
11274 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11276 case SAVEt_AV: /* array reference */
11277 av = (AV*)POPPTR(ss,ix);
11278 TOPPTR(nss,ix) = av_dup_inc(av, param);
11279 gv = (GV*)POPPTR(ss,ix);
11280 TOPPTR(nss,ix) = gv_dup(gv, param);
11282 case SAVEt_HV: /* hash reference */
11283 hv = (HV*)POPPTR(ss,ix);
11284 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11285 gv = (GV*)POPPTR(ss,ix);
11286 TOPPTR(nss,ix) = gv_dup(gv, param);
11288 case SAVEt_INT: /* int reference */
11289 ptr = POPPTR(ss,ix);
11290 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11291 intval = (int)POPINT(ss,ix);
11292 TOPINT(nss,ix) = intval;
11294 case SAVEt_LONG: /* long reference */
11295 ptr = POPPTR(ss,ix);
11296 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11297 longval = (long)POPLONG(ss,ix);
11298 TOPLONG(nss,ix) = longval;
11300 case SAVEt_I32: /* I32 reference */
11301 case SAVEt_I16: /* I16 reference */
11302 case SAVEt_I8: /* I8 reference */
11303 ptr = POPPTR(ss,ix);
11304 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11306 TOPINT(nss,ix) = i;
11308 case SAVEt_IV: /* IV reference */
11309 ptr = POPPTR(ss,ix);
11310 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11312 TOPIV(nss,ix) = iv;
11314 case SAVEt_SPTR: /* SV* reference */
11315 ptr = POPPTR(ss,ix);
11316 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11317 sv = (SV*)POPPTR(ss,ix);
11318 TOPPTR(nss,ix) = sv_dup(sv, param);
11320 case SAVEt_VPTR: /* random* reference */
11321 ptr = POPPTR(ss,ix);
11322 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11323 ptr = POPPTR(ss,ix);
11324 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11326 case SAVEt_PPTR: /* char* reference */
11327 ptr = POPPTR(ss,ix);
11328 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11329 c = (char*)POPPTR(ss,ix);
11330 TOPPTR(nss,ix) = pv_dup(c);
11332 case SAVEt_HPTR: /* HV* reference */
11333 ptr = POPPTR(ss,ix);
11334 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11335 hv = (HV*)POPPTR(ss,ix);
11336 TOPPTR(nss,ix) = hv_dup(hv, param);
11338 case SAVEt_APTR: /* AV* reference */
11339 ptr = POPPTR(ss,ix);
11340 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11341 av = (AV*)POPPTR(ss,ix);
11342 TOPPTR(nss,ix) = av_dup(av, param);
11345 gv = (GV*)POPPTR(ss,ix);
11346 TOPPTR(nss,ix) = gv_dup(gv, param);
11348 case SAVEt_GP: /* scalar reference */
11349 gp = (GP*)POPPTR(ss,ix);
11350 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11351 (void)GpREFCNT_inc(gp);
11352 gv = (GV*)POPPTR(ss,ix);
11353 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11354 c = (char*)POPPTR(ss,ix);
11355 TOPPTR(nss,ix) = pv_dup(c);
11357 TOPIV(nss,ix) = iv;
11359 TOPIV(nss,ix) = iv;
11362 case SAVEt_MORTALIZESV:
11363 sv = (SV*)POPPTR(ss,ix);
11364 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11367 ptr = POPPTR(ss,ix);
11368 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11369 /* these are assumed to be refcounted properly */
11370 switch (((OP*)ptr)->op_type) {
11372 case OP_LEAVESUBLV:
11376 case OP_LEAVEWRITE:
11377 TOPPTR(nss,ix) = ptr;
11382 TOPPTR(nss,ix) = Nullop;
11387 TOPPTR(nss,ix) = Nullop;
11390 c = (char*)POPPTR(ss,ix);
11391 TOPPTR(nss,ix) = pv_dup_inc(c);
11393 case SAVEt_CLEARSV:
11394 longval = POPLONG(ss,ix);
11395 TOPLONG(nss,ix) = longval;
11398 hv = (HV*)POPPTR(ss,ix);
11399 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11400 c = (char*)POPPTR(ss,ix);
11401 TOPPTR(nss,ix) = pv_dup_inc(c);
11403 TOPINT(nss,ix) = i;
11405 case SAVEt_DESTRUCTOR:
11406 ptr = POPPTR(ss,ix);
11407 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11408 dptr = POPDPTR(ss,ix);
11409 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11411 case SAVEt_DESTRUCTOR_X:
11412 ptr = POPPTR(ss,ix);
11413 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11414 dxptr = POPDXPTR(ss,ix);
11415 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11417 case SAVEt_REGCONTEXT:
11420 TOPINT(nss,ix) = i;
11423 case SAVEt_STACK_POS: /* Position on Perl stack */
11425 TOPINT(nss,ix) = i;
11427 case SAVEt_AELEM: /* array element */
11428 sv = (SV*)POPPTR(ss,ix);
11429 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11431 TOPINT(nss,ix) = i;
11432 av = (AV*)POPPTR(ss,ix);
11433 TOPPTR(nss,ix) = av_dup_inc(av, param);
11435 case SAVEt_HELEM: /* hash element */
11436 sv = (SV*)POPPTR(ss,ix);
11437 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11438 sv = (SV*)POPPTR(ss,ix);
11439 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11440 hv = (HV*)POPPTR(ss,ix);
11441 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11444 ptr = POPPTR(ss,ix);
11445 TOPPTR(nss,ix) = ptr;
11449 TOPINT(nss,ix) = i;
11451 case SAVEt_COMPPAD:
11452 av = (AV*)POPPTR(ss,ix);
11453 TOPPTR(nss,ix) = av_dup(av, param);
11456 longval = (long)POPLONG(ss,ix);
11457 TOPLONG(nss,ix) = longval;
11458 ptr = POPPTR(ss,ix);
11459 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11460 sv = (SV*)POPPTR(ss,ix);
11461 TOPPTR(nss,ix) = sv_dup(sv, param);
11464 ptr = POPPTR(ss,ix);
11465 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11466 longval = (long)POPBOOL(ss,ix);
11467 TOPBOOL(nss,ix) = (bool)longval;
11469 case SAVEt_SET_SVFLAGS:
11471 TOPINT(nss,ix) = i;
11473 TOPINT(nss,ix) = i;
11474 sv = (SV*)POPPTR(ss,ix);
11475 TOPPTR(nss,ix) = sv_dup(sv, param);
11478 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11486 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11487 * flag to the result. This is done for each stash before cloning starts,
11488 * so we know which stashes want their objects cloned */
11491 do_mark_cloneable_stash(pTHX_ SV *sv)
11493 if (HvNAME((HV*)sv)) {
11494 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11495 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11496 if (cloner && GvCV(cloner)) {
11503 XPUSHs(sv_2mortal(newSVpv(HvNAME((HV*)sv), 0)));
11505 call_sv((SV*)GvCV(cloner), G_SCALAR);
11512 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11520 =for apidoc perl_clone
11522 Create and return a new interpreter by cloning the current one.
11524 perl_clone takes these flags as parameters:
11526 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11527 without it we only clone the data and zero the stacks,
11528 with it we copy the stacks and the new perl interpreter is
11529 ready to run at the exact same point as the previous one.
11530 The pseudo-fork code uses COPY_STACKS while the
11531 threads->new doesn't.
11533 CLONEf_KEEP_PTR_TABLE
11534 perl_clone keeps a ptr_table with the pointer of the old
11535 variable as a key and the new variable as a value,
11536 this allows it to check if something has been cloned and not
11537 clone it again but rather just use the value and increase the
11538 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11539 the ptr_table using the function
11540 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11541 reason to keep it around is if you want to dup some of your own
11542 variable who are outside the graph perl scans, example of this
11543 code is in threads.xs create
11546 This is a win32 thing, it is ignored on unix, it tells perls
11547 win32host code (which is c++) to clone itself, this is needed on
11548 win32 if you want to run two threads at the same time,
11549 if you just want to do some stuff in a separate perl interpreter
11550 and then throw it away and return to the original one,
11551 you don't need to do anything.
11556 /* XXX the above needs expanding by someone who actually understands it ! */
11557 EXTERN_C PerlInterpreter *
11558 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11561 perl_clone(PerlInterpreter *proto_perl, UV flags)
11564 #ifdef PERL_IMPLICIT_SYS
11566 /* perlhost.h so we need to call into it
11567 to clone the host, CPerlHost should have a c interface, sky */
11569 if (flags & CLONEf_CLONE_HOST) {
11570 return perl_clone_host(proto_perl,flags);
11572 return perl_clone_using(proto_perl, flags,
11574 proto_perl->IMemShared,
11575 proto_perl->IMemParse,
11577 proto_perl->IStdIO,
11581 proto_perl->IProc);
11585 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11586 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11587 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11588 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11589 struct IPerlDir* ipD, struct IPerlSock* ipS,
11590 struct IPerlProc* ipP)
11592 /* XXX many of the string copies here can be optimized if they're
11593 * constants; they need to be allocated as common memory and just
11594 * their pointers copied. */
11597 CLONE_PARAMS clone_params;
11598 CLONE_PARAMS* param = &clone_params;
11600 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11601 /* for each stash, determine whether its objects should be cloned */
11602 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11603 PERL_SET_THX(my_perl);
11606 Poison(my_perl, 1, PerlInterpreter);
11608 PL_curcop = (COP *)Nullop;
11612 PL_savestack_ix = 0;
11613 PL_savestack_max = -1;
11614 PL_sig_pending = 0;
11615 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11616 # else /* !DEBUGGING */
11617 Zero(my_perl, 1, PerlInterpreter);
11618 # endif /* DEBUGGING */
11620 /* host pointers */
11622 PL_MemShared = ipMS;
11623 PL_MemParse = ipMP;
11630 #else /* !PERL_IMPLICIT_SYS */
11632 CLONE_PARAMS clone_params;
11633 CLONE_PARAMS* param = &clone_params;
11634 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11635 /* for each stash, determine whether its objects should be cloned */
11636 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11637 PERL_SET_THX(my_perl);
11640 Poison(my_perl, 1, PerlInterpreter);
11642 PL_curcop = (COP *)Nullop;
11646 PL_savestack_ix = 0;
11647 PL_savestack_max = -1;
11648 PL_sig_pending = 0;
11649 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11650 # else /* !DEBUGGING */
11651 Zero(my_perl, 1, PerlInterpreter);
11652 # endif /* DEBUGGING */
11653 #endif /* PERL_IMPLICIT_SYS */
11654 param->flags = flags;
11655 param->proto_perl = proto_perl;
11658 PL_xiv_arenaroot = NULL;
11659 PL_xiv_root = NULL;
11660 PL_xnv_arenaroot = NULL;
11661 PL_xnv_root = NULL;
11662 PL_xrv_arenaroot = NULL;
11663 PL_xrv_root = NULL;
11664 PL_xpv_arenaroot = NULL;
11665 PL_xpv_root = NULL;
11666 PL_xpviv_arenaroot = NULL;
11667 PL_xpviv_root = NULL;
11668 PL_xpvnv_arenaroot = NULL;
11669 PL_xpvnv_root = NULL;
11670 PL_xpvcv_arenaroot = NULL;
11671 PL_xpvcv_root = NULL;
11672 PL_xpvav_arenaroot = NULL;
11673 PL_xpvav_root = NULL;
11674 PL_xpvhv_arenaroot = NULL;
11675 PL_xpvhv_root = NULL;
11676 PL_xpvmg_arenaroot = NULL;
11677 PL_xpvmg_root = NULL;
11678 PL_xpvlv_arenaroot = NULL;
11679 PL_xpvlv_root = NULL;
11680 PL_xpvbm_arenaroot = NULL;
11681 PL_xpvbm_root = NULL;
11682 PL_he_arenaroot = NULL;
11684 #if defined(USE_ITHREADS)
11685 PL_pte_arenaroot = NULL;
11686 PL_pte_root = NULL;
11688 PL_nice_chunk = NULL;
11689 PL_nice_chunk_size = 0;
11691 PL_sv_objcount = 0;
11692 PL_sv_root = Nullsv;
11693 PL_sv_arenaroot = Nullsv;
11695 PL_debug = proto_perl->Idebug;
11697 #ifdef USE_REENTRANT_API
11698 /* XXX: things like -Dm will segfault here in perlio, but doing
11699 * PERL_SET_CONTEXT(proto_perl);
11700 * breaks too many other things
11702 Perl_reentrant_init(aTHX);
11705 /* create SV map for pointer relocation */
11706 PL_ptr_table = ptr_table_new();
11708 /* initialize these special pointers as early as possible */
11709 SvANY(&PL_sv_undef) = NULL;
11710 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11711 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11712 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11714 SvANY(&PL_sv_no) = new_XPVNV();
11715 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11716 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11717 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11718 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11719 SvCUR_set(&PL_sv_no, 0);
11720 SvLEN_set(&PL_sv_no, 1);
11721 SvIV_set(&PL_sv_no, 0);
11722 SvNV_set(&PL_sv_no, 0);
11723 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11725 SvANY(&PL_sv_yes) = new_XPVNV();
11726 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11727 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11728 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11729 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11730 SvCUR_set(&PL_sv_yes, 1);
11731 SvLEN_set(&PL_sv_yes, 2);
11732 SvIV_set(&PL_sv_yes, 1);
11733 SvNV_set(&PL_sv_yes, 1);
11734 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11736 /* create (a non-shared!) shared string table */
11737 PL_strtab = newHV();
11738 HvSHAREKEYS_off(PL_strtab);
11739 hv_ksplit(PL_strtab, 512);
11740 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11742 PL_compiling = proto_perl->Icompiling;
11744 /* These two PVs will be free'd special way so must set them same way op.c does */
11745 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11746 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11748 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11749 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11751 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11752 if (!specialWARN(PL_compiling.cop_warnings))
11753 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11754 if (!specialCopIO(PL_compiling.cop_io))
11755 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11756 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11758 /* pseudo environmental stuff */
11759 PL_origargc = proto_perl->Iorigargc;
11760 PL_origargv = proto_perl->Iorigargv;
11762 param->stashes = newAV(); /* Setup array of objects to call clone on */
11764 #ifdef PERLIO_LAYERS
11765 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11766 PerlIO_clone(aTHX_ proto_perl, param);
11769 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11770 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11771 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11772 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11773 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11774 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11777 PL_minus_c = proto_perl->Iminus_c;
11778 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11779 PL_localpatches = proto_perl->Ilocalpatches;
11780 PL_splitstr = proto_perl->Isplitstr;
11781 PL_preprocess = proto_perl->Ipreprocess;
11782 PL_minus_n = proto_perl->Iminus_n;
11783 PL_minus_p = proto_perl->Iminus_p;
11784 PL_minus_l = proto_perl->Iminus_l;
11785 PL_minus_a = proto_perl->Iminus_a;
11786 PL_minus_F = proto_perl->Iminus_F;
11787 PL_doswitches = proto_perl->Idoswitches;
11788 PL_dowarn = proto_perl->Idowarn;
11789 PL_doextract = proto_perl->Idoextract;
11790 PL_sawampersand = proto_perl->Isawampersand;
11791 PL_unsafe = proto_perl->Iunsafe;
11792 PL_inplace = SAVEPV(proto_perl->Iinplace);
11793 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11794 PL_perldb = proto_perl->Iperldb;
11795 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11796 PL_exit_flags = proto_perl->Iexit_flags;
11798 /* magical thingies */
11799 /* XXX time(&PL_basetime) when asked for? */
11800 PL_basetime = proto_perl->Ibasetime;
11801 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11803 PL_maxsysfd = proto_perl->Imaxsysfd;
11804 PL_multiline = proto_perl->Imultiline;
11805 PL_statusvalue = proto_perl->Istatusvalue;
11807 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11809 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11811 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11812 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11813 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11815 /* Clone the regex array */
11816 PL_regex_padav = newAV();
11818 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11819 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11820 av_push(PL_regex_padav,
11821 sv_dup_inc(regexen[0],param));
11822 for(i = 1; i <= len; i++) {
11823 if(SvREPADTMP(regexen[i])) {
11824 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11826 av_push(PL_regex_padav,
11828 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11829 SvIVX(regexen[i])), param)))
11834 PL_regex_pad = AvARRAY(PL_regex_padav);
11836 /* shortcuts to various I/O objects */
11837 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11838 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11839 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11840 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11841 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11842 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11844 /* shortcuts to regexp stuff */
11845 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11847 /* shortcuts to misc objects */
11848 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11850 /* shortcuts to debugging objects */
11851 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11852 PL_DBline = gv_dup(proto_perl->IDBline, param);
11853 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11854 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11855 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11856 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11857 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11858 PL_lineary = av_dup(proto_perl->Ilineary, param);
11859 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11861 /* symbol tables */
11862 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11863 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11864 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11865 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11866 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11868 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11869 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11870 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11871 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11872 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11873 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11875 PL_sub_generation = proto_perl->Isub_generation;
11877 /* funky return mechanisms */
11878 PL_forkprocess = proto_perl->Iforkprocess;
11880 /* subprocess state */
11881 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11883 /* internal state */
11884 PL_tainting = proto_perl->Itainting;
11885 PL_taint_warn = proto_perl->Itaint_warn;
11886 PL_maxo = proto_perl->Imaxo;
11887 if (proto_perl->Iop_mask)
11888 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11890 PL_op_mask = Nullch;
11891 /* PL_asserting = proto_perl->Iasserting; */
11893 /* current interpreter roots */
11894 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11895 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11896 PL_main_start = proto_perl->Imain_start;
11897 PL_eval_root = proto_perl->Ieval_root;
11898 PL_eval_start = proto_perl->Ieval_start;
11900 /* runtime control stuff */
11901 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11902 PL_copline = proto_perl->Icopline;
11904 PL_filemode = proto_perl->Ifilemode;
11905 PL_lastfd = proto_perl->Ilastfd;
11906 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11909 PL_gensym = proto_perl->Igensym;
11910 PL_preambled = proto_perl->Ipreambled;
11911 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11912 PL_laststatval = proto_perl->Ilaststatval;
11913 PL_laststype = proto_perl->Ilaststype;
11914 PL_mess_sv = Nullsv;
11916 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11917 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11919 /* interpreter atexit processing */
11920 PL_exitlistlen = proto_perl->Iexitlistlen;
11921 if (PL_exitlistlen) {
11922 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11923 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11926 PL_exitlist = (PerlExitListEntry*)NULL;
11927 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11928 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11929 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11931 PL_profiledata = NULL;
11932 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11933 /* PL_rsfp_filters entries have fake IoDIRP() */
11934 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11936 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11938 PAD_CLONE_VARS(proto_perl, param);
11940 #ifdef HAVE_INTERP_INTERN
11941 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11944 /* more statics moved here */
11945 PL_generation = proto_perl->Igeneration;
11946 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11948 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11949 PL_in_clean_all = proto_perl->Iin_clean_all;
11951 PL_uid = proto_perl->Iuid;
11952 PL_euid = proto_perl->Ieuid;
11953 PL_gid = proto_perl->Igid;
11954 PL_egid = proto_perl->Iegid;
11955 PL_nomemok = proto_perl->Inomemok;
11956 PL_an = proto_perl->Ian;
11957 PL_evalseq = proto_perl->Ievalseq;
11958 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11959 PL_origalen = proto_perl->Iorigalen;
11960 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11961 PL_osname = SAVEPV(proto_perl->Iosname);
11962 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11963 PL_sighandlerp = proto_perl->Isighandlerp;
11966 PL_runops = proto_perl->Irunops;
11968 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11971 PL_cshlen = proto_perl->Icshlen;
11972 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11975 PL_lex_state = proto_perl->Ilex_state;
11976 PL_lex_defer = proto_perl->Ilex_defer;
11977 PL_lex_expect = proto_perl->Ilex_expect;
11978 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11979 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11980 PL_lex_starts = proto_perl->Ilex_starts;
11981 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11982 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11983 PL_lex_op = proto_perl->Ilex_op;
11984 PL_lex_inpat = proto_perl->Ilex_inpat;
11985 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11986 PL_lex_brackets = proto_perl->Ilex_brackets;
11987 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11988 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11989 PL_lex_casemods = proto_perl->Ilex_casemods;
11990 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11991 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11993 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11994 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11995 PL_nexttoke = proto_perl->Inexttoke;
11997 /* XXX This is probably masking the deeper issue of why
11998 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11999 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
12000 * (A little debugging with a watchpoint on it may help.)
12002 if (SvANY(proto_perl->Ilinestr)) {
12003 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
12004 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
12005 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12006 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
12007 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12008 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
12009 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12010 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
12011 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12014 PL_linestr = NEWSV(65,79);
12015 sv_upgrade(PL_linestr,SVt_PVIV);
12016 sv_setpvn(PL_linestr,"",0);
12017 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
12019 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12020 PL_pending_ident = proto_perl->Ipending_ident;
12021 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
12023 PL_expect = proto_perl->Iexpect;
12025 PL_multi_start = proto_perl->Imulti_start;
12026 PL_multi_end = proto_perl->Imulti_end;
12027 PL_multi_open = proto_perl->Imulti_open;
12028 PL_multi_close = proto_perl->Imulti_close;
12030 PL_error_count = proto_perl->Ierror_count;
12031 PL_subline = proto_perl->Isubline;
12032 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
12034 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
12035 if (SvANY(proto_perl->Ilinestr)) {
12036 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
12037 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12038 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
12039 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12040 PL_last_lop_op = proto_perl->Ilast_lop_op;
12043 PL_last_uni = SvPVX(PL_linestr);
12044 PL_last_lop = SvPVX(PL_linestr);
12045 PL_last_lop_op = 0;
12047 PL_in_my = proto_perl->Iin_my;
12048 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12050 PL_cryptseen = proto_perl->Icryptseen;
12053 PL_hints = proto_perl->Ihints;
12055 PL_amagic_generation = proto_perl->Iamagic_generation;
12057 #ifdef USE_LOCALE_COLLATE
12058 PL_collation_ix = proto_perl->Icollation_ix;
12059 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12060 PL_collation_standard = proto_perl->Icollation_standard;
12061 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12062 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12063 #endif /* USE_LOCALE_COLLATE */
12065 #ifdef USE_LOCALE_NUMERIC
12066 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12067 PL_numeric_standard = proto_perl->Inumeric_standard;
12068 PL_numeric_local = proto_perl->Inumeric_local;
12069 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12070 #endif /* !USE_LOCALE_NUMERIC */
12072 /* utf8 character classes */
12073 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12074 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12075 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12076 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12077 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12078 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12079 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12080 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12081 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12082 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12083 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12084 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12085 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12086 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12087 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12088 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12089 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12090 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12091 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12092 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12094 /* Did the locale setup indicate UTF-8? */
12095 PL_utf8locale = proto_perl->Iutf8locale;
12096 /* Unicode features (see perlrun/-C) */
12097 PL_unicode = proto_perl->Iunicode;
12099 /* Pre-5.8 signals control */
12100 PL_signals = proto_perl->Isignals;
12102 /* times() ticks per second */
12103 PL_clocktick = proto_perl->Iclocktick;
12105 /* Recursion stopper for PerlIO_find_layer */
12106 PL_in_load_module = proto_perl->Iin_load_module;
12108 /* sort() routine */
12109 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12111 /* Not really needed/useful since the reenrant_retint is "volatile",
12112 * but do it for consistency's sake. */
12113 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12115 /* Hooks to shared SVs and locks. */
12116 PL_sharehook = proto_perl->Isharehook;
12117 PL_lockhook = proto_perl->Ilockhook;
12118 PL_unlockhook = proto_perl->Iunlockhook;
12119 PL_threadhook = proto_perl->Ithreadhook;
12121 PL_runops_std = proto_perl->Irunops_std;
12122 PL_runops_dbg = proto_perl->Irunops_dbg;
12124 #ifdef THREADS_HAVE_PIDS
12125 PL_ppid = proto_perl->Ippid;
12129 PL_last_swash_hv = Nullhv; /* reinits on demand */
12130 PL_last_swash_klen = 0;
12131 PL_last_swash_key[0]= '\0';
12132 PL_last_swash_tmps = (U8*)NULL;
12133 PL_last_swash_slen = 0;
12135 PL_glob_index = proto_perl->Iglob_index;
12136 PL_srand_called = proto_perl->Isrand_called;
12137 PL_hash_seed = proto_perl->Ihash_seed;
12138 PL_rehash_seed = proto_perl->Irehash_seed;
12139 PL_uudmap['M'] = 0; /* reinits on demand */
12140 PL_bitcount = Nullch; /* reinits on demand */
12142 if (proto_perl->Ipsig_pend) {
12143 Newz(0, PL_psig_pend, SIG_SIZE, int);
12146 PL_psig_pend = (int*)NULL;
12149 if (proto_perl->Ipsig_ptr) {
12150 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12151 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12152 for (i = 1; i < SIG_SIZE; i++) {
12153 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12154 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12158 PL_psig_ptr = (SV**)NULL;
12159 PL_psig_name = (SV**)NULL;
12162 /* thrdvar.h stuff */
12164 if (flags & CLONEf_COPY_STACKS) {
12165 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12166 PL_tmps_ix = proto_perl->Ttmps_ix;
12167 PL_tmps_max = proto_perl->Ttmps_max;
12168 PL_tmps_floor = proto_perl->Ttmps_floor;
12169 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12171 while (i <= PL_tmps_ix) {
12172 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12176 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12177 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12178 Newz(54, PL_markstack, i, I32);
12179 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12180 - proto_perl->Tmarkstack);
12181 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12182 - proto_perl->Tmarkstack);
12183 Copy(proto_perl->Tmarkstack, PL_markstack,
12184 PL_markstack_ptr - PL_markstack + 1, I32);
12186 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12187 * NOTE: unlike the others! */
12188 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12189 PL_scopestack_max = proto_perl->Tscopestack_max;
12190 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12191 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12193 /* NOTE: si_dup() looks at PL_markstack */
12194 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12196 /* PL_curstack = PL_curstackinfo->si_stack; */
12197 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12198 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12200 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12201 PL_stack_base = AvARRAY(PL_curstack);
12202 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12203 - proto_perl->Tstack_base);
12204 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12206 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12207 * NOTE: unlike the others! */
12208 PL_savestack_ix = proto_perl->Tsavestack_ix;
12209 PL_savestack_max = proto_perl->Tsavestack_max;
12210 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12211 PL_savestack = ss_dup(proto_perl, param);
12215 ENTER; /* perl_destruct() wants to LEAVE; */
12218 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12219 PL_top_env = &PL_start_env;
12221 PL_op = proto_perl->Top;
12224 PL_Xpv = (XPV*)NULL;
12225 PL_na = proto_perl->Tna;
12227 PL_statbuf = proto_perl->Tstatbuf;
12228 PL_statcache = proto_perl->Tstatcache;
12229 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12230 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12232 PL_timesbuf = proto_perl->Ttimesbuf;
12235 PL_tainted = proto_perl->Ttainted;
12236 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12237 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12238 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12239 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12240 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12241 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12242 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12243 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12244 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12246 PL_restartop = proto_perl->Trestartop;
12247 PL_in_eval = proto_perl->Tin_eval;
12248 PL_delaymagic = proto_perl->Tdelaymagic;
12249 PL_dirty = proto_perl->Tdirty;
12250 PL_localizing = proto_perl->Tlocalizing;
12252 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12253 PL_hv_fetch_ent_mh = Nullhe;
12254 PL_modcount = proto_perl->Tmodcount;
12255 PL_lastgotoprobe = Nullop;
12256 PL_dumpindent = proto_perl->Tdumpindent;
12258 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12259 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12260 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12261 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12262 PL_sortcxix = proto_perl->Tsortcxix;
12263 PL_efloatbuf = Nullch; /* reinits on demand */
12264 PL_efloatsize = 0; /* reinits on demand */
12268 PL_screamfirst = NULL;
12269 PL_screamnext = NULL;
12270 PL_maxscream = -1; /* reinits on demand */
12271 PL_lastscream = Nullsv;
12273 PL_watchaddr = NULL;
12274 PL_watchok = Nullch;
12276 PL_regdummy = proto_perl->Tregdummy;
12277 PL_regprecomp = Nullch;
12280 PL_colorset = 0; /* reinits PL_colors[] */
12281 /*PL_colors[6] = {0,0,0,0,0,0};*/
12282 PL_reginput = Nullch;
12283 PL_regbol = Nullch;
12284 PL_regeol = Nullch;
12285 PL_regstartp = (I32*)NULL;
12286 PL_regendp = (I32*)NULL;
12287 PL_reglastparen = (U32*)NULL;
12288 PL_reglastcloseparen = (U32*)NULL;
12289 PL_regtill = Nullch;
12290 PL_reg_start_tmp = (char**)NULL;
12291 PL_reg_start_tmpl = 0;
12292 PL_regdata = (struct reg_data*)NULL;
12295 PL_reg_eval_set = 0;
12297 PL_regprogram = (regnode*)NULL;
12299 PL_regcc = (CURCUR*)NULL;
12300 PL_reg_call_cc = (struct re_cc_state*)NULL;
12301 PL_reg_re = (regexp*)NULL;
12302 PL_reg_ganch = Nullch;
12303 PL_reg_sv = Nullsv;
12304 PL_reg_match_utf8 = FALSE;
12305 PL_reg_magic = (MAGIC*)NULL;
12307 PL_reg_oldcurpm = (PMOP*)NULL;
12308 PL_reg_curpm = (PMOP*)NULL;
12309 PL_reg_oldsaved = Nullch;
12310 PL_reg_oldsavedlen = 0;
12311 #ifdef PERL_COPY_ON_WRITE
12314 PL_reg_maxiter = 0;
12315 PL_reg_leftiter = 0;
12316 PL_reg_poscache = Nullch;
12317 PL_reg_poscache_size= 0;
12319 /* RE engine - function pointers */
12320 PL_regcompp = proto_perl->Tregcompp;
12321 PL_regexecp = proto_perl->Tregexecp;
12322 PL_regint_start = proto_perl->Tregint_start;
12323 PL_regint_string = proto_perl->Tregint_string;
12324 PL_regfree = proto_perl->Tregfree;
12326 PL_reginterp_cnt = 0;
12327 PL_reg_starttry = 0;
12329 /* Pluggable optimizer */
12330 PL_peepp = proto_perl->Tpeepp;
12332 PL_stashcache = newHV();
12334 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12335 ptr_table_free(PL_ptr_table);
12336 PL_ptr_table = NULL;
12339 /* Call the ->CLONE method, if it exists, for each of the stashes
12340 identified by sv_dup() above.
12342 while(av_len(param->stashes) != -1) {
12343 HV* stash = (HV*) av_shift(param->stashes);
12344 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12345 if (cloner && GvCV(cloner)) {
12350 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
12352 call_sv((SV*)GvCV(cloner), G_DISCARD);
12358 SvREFCNT_dec(param->stashes);
12363 #endif /* USE_ITHREADS */
12366 =head1 Unicode Support
12368 =for apidoc sv_recode_to_utf8
12370 The encoding is assumed to be an Encode object, on entry the PV
12371 of the sv is assumed to be octets in that encoding, and the sv
12372 will be converted into Unicode (and UTF-8).
12374 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12375 is not a reference, nothing is done to the sv. If the encoding is not
12376 an C<Encode::XS> Encoding object, bad things will happen.
12377 (See F<lib/encoding.pm> and L<Encode>).
12379 The PV of the sv is returned.
12384 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12387 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12401 Passing sv_yes is wrong - it needs to be or'ed set of constants
12402 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12403 remove converted chars from source.
12405 Both will default the value - let them.
12407 XPUSHs(&PL_sv_yes);
12410 call_method("decode", G_SCALAR);
12414 s = SvPV(uni, len);
12415 if (s != SvPVX(sv)) {
12416 SvGROW(sv, len + 1);
12417 Move(s, SvPVX(sv), len, char);
12418 SvCUR_set(sv, len);
12419 SvPVX(sv)[len] = 0;
12426 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12430 =for apidoc sv_cat_decode
12432 The encoding is assumed to be an Encode object, the PV of the ssv is
12433 assumed to be octets in that encoding and decoding the input starts
12434 from the position which (PV + *offset) pointed to. The dsv will be
12435 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12436 when the string tstr appears in decoding output or the input ends on
12437 the PV of the ssv. The value which the offset points will be modified
12438 to the last input position on the ssv.
12440 Returns TRUE if the terminator was found, else returns FALSE.
12445 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12446 SV *ssv, int *offset, char *tstr, int tlen)
12450 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12461 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12462 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12464 call_method("cat_decode", G_SCALAR);
12466 ret = SvTRUE(TOPs);
12467 *offset = SvIV(offsv);
12473 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12479 * c-indentation-style: bsd
12480 * c-basic-offset: 4
12481 * indent-tabs-mode: t
12484 * vim: shiftwidth=4: