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 */
344 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
345 sv_add_arena(chunk, 1008, 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;
617 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
618 arenanext = (XPV*)arena->xpv_pv;
625 Safefree(PL_nice_chunk);
626 PL_nice_chunk = Nullch;
627 PL_nice_chunk_size = 0;
632 /* ---------------------------------------------------------------------
634 * support functions for report_uninit()
637 /* the maxiumum size of array or hash where we will scan looking
638 * for the undefined element that triggered the warning */
640 #define FUV_MAX_SEARCH_SIZE 1000
642 /* Look for an entry in the hash whose value has the same SV as val;
643 * If so, return a mortal copy of the key. */
646 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
652 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
653 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
658 for (i=HvMAX(hv); i>0; i--) {
659 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
660 if (HeVAL(entry) != val)
662 if ( HeVAL(entry) == &PL_sv_undef ||
663 HeVAL(entry) == &PL_sv_placeholder)
667 if (HeKLEN(entry) == HEf_SVKEY)
668 return sv_mortalcopy(HeKEY_sv(entry));
669 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
675 /* Look for an entry in the array whose value has the same SV as val;
676 * If so, return the index, otherwise return -1. */
679 S_find_array_subscript(pTHX_ AV *av, SV* val)
683 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
684 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
688 for (i=AvFILLp(av); i>=0; i--) {
689 if (svp[i] == val && svp[i] != &PL_sv_undef)
695 /* S_varname(): return the name of a variable, optionally with a subscript.
696 * If gv is non-zero, use the name of that global, along with gvtype (one
697 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
698 * targ. Depending on the value of the subscript_type flag, return:
701 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
702 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
703 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
704 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
707 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
708 SV* keyname, I32 aindex, int subscript_type)
714 name = sv_newmortal();
717 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
718 * XXX get rid of all this if gv_fullnameX() ever supports this
722 HV *hv = GvSTASH(gv);
723 sv_setpv(name, gvtype);
726 else if (!(p=HvNAME(hv)))
728 if (strNE(p, "main")) {
730 sv_catpvn(name,"::", 2);
732 if (GvNAMELEN(gv)>= 1 &&
733 ((unsigned int)*GvNAME(gv)) <= 26)
735 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
736 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
739 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
743 CV *cv = find_runcv(&u);
744 if (!cv || !CvPADLIST(cv))
746 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
747 sv = *av_fetch(av, targ, FALSE);
748 /* SvLEN in a pad name is not to be trusted */
749 sv_setpv(name, SvPV_nolen(sv));
752 if (subscript_type == FUV_SUBSCRIPT_HASH) {
755 Perl_sv_catpvf(aTHX_ name, "{%s}",
756 pv_display(sv,SvPVX(keyname), SvCUR(keyname), 0, 32));
759 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
761 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
763 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
764 sv_insert(name, 0, 0, "within ", 7);
771 =for apidoc find_uninit_var
773 Find the name of the undefined variable (if any) that caused the operator o
774 to issue a "Use of uninitialized value" warning.
775 If match is true, only return a name if it's value matches uninit_sv.
776 So roughly speaking, if a unary operator (such as OP_COS) generates a
777 warning, then following the direct child of the op may yield an
778 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
779 other hand, with OP_ADD there are two branches to follow, so we only print
780 the variable name if we get an exact match.
782 The name is returned as a mortal SV.
784 Assumes that PL_op is the op that originally triggered the error, and that
785 PL_comppad/PL_curpad points to the currently executing pad.
791 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
799 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
800 uninit_sv == &PL_sv_placeholder)))
803 switch (obase->op_type) {
810 bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
811 bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
814 int subscript_type = FUV_SUBSCRIPT_WITHIN;
816 if (pad) { /* @lex, %lex */
817 sv = PAD_SVl(obase->op_targ);
821 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
822 /* @global, %global */
823 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
826 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
828 else /* @{expr}, %{expr} */
829 return find_uninit_var(cUNOPx(obase)->op_first,
833 /* attempt to find a match within the aggregate */
835 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
837 subscript_type = FUV_SUBSCRIPT_HASH;
840 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
842 subscript_type = FUV_SUBSCRIPT_ARRAY;
845 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
848 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
849 keysv, index, subscript_type);
853 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
855 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
856 Nullsv, 0, FUV_SUBSCRIPT_NONE);
859 gv = cGVOPx_gv(obase);
860 if (!gv || (match && GvSV(gv) != uninit_sv))
862 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
865 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
867 av = (AV*)PAD_SV(obase->op_targ);
868 if (!av || SvRMAGICAL(av))
870 svp = av_fetch(av, (I32)obase->op_private, FALSE);
871 if (!svp || *svp != uninit_sv)
874 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
875 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
878 gv = cGVOPx_gv(obase);
883 if (!av || SvRMAGICAL(av))
885 svp = av_fetch(av, (I32)obase->op_private, FALSE);
886 if (!svp || *svp != uninit_sv)
889 return S_varname(aTHX_ gv, "$", 0,
890 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
895 o = cUNOPx(obase)->op_first;
896 if (!o || o->op_type != OP_NULL ||
897 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
899 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
904 /* $a[uninit_expr] or $h{uninit_expr} */
905 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
908 o = cBINOPx(obase)->op_first;
909 kid = cBINOPx(obase)->op_last;
911 /* get the av or hv, and optionally the gv */
913 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
914 sv = PAD_SV(o->op_targ);
916 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
917 && cUNOPo->op_first->op_type == OP_GV)
919 gv = cGVOPx_gv(cUNOPo->op_first);
922 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
927 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
928 /* index is constant */
932 if (obase->op_type == OP_HELEM) {
933 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
934 if (!he || HeVAL(he) != uninit_sv)
938 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
939 if (!svp || *svp != uninit_sv)
943 if (obase->op_type == OP_HELEM)
944 return S_varname(aTHX_ gv, "%", o->op_targ,
945 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
947 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
948 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
952 /* index is an expression;
953 * attempt to find a match within the aggregate */
954 if (obase->op_type == OP_HELEM) {
955 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
957 return S_varname(aTHX_ gv, "%", o->op_targ,
958 keysv, 0, FUV_SUBSCRIPT_HASH);
961 I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
963 return S_varname(aTHX_ gv, "@", o->op_targ,
964 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
968 return S_varname(aTHX_ gv,
969 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
971 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
977 /* only examine RHS */
978 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
981 o = cUNOPx(obase)->op_first;
982 if (o->op_type == OP_PUSHMARK)
985 if (!o->op_sibling) {
986 /* one-arg version of open is highly magical */
988 if (o->op_type == OP_GV) { /* open FOO; */
990 if (match && GvSV(gv) != uninit_sv)
992 return S_varname(aTHX_ gv, "$", 0,
993 Nullsv, 0, FUV_SUBSCRIPT_NONE);
995 /* other possibilities not handled are:
996 * open $x; or open my $x; should return '${*$x}'
997 * open expr; should return '$'.expr ideally
1003 /* ops where $_ may be an implicit arg */
1007 if ( !(obase->op_flags & OPf_STACKED)) {
1008 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1009 ? PAD_SVl(obase->op_targ)
1012 sv = sv_newmortal();
1021 /* skip filehandle as it can't produce 'undef' warning */
1022 o = cUNOPx(obase)->op_first;
1023 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1024 o = o->op_sibling->op_sibling;
1031 match = 1; /* XS or custom code could trigger random warnings */
1036 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1037 return sv_2mortal(newSVpv("${$/}", 0));
1042 if (!(obase->op_flags & OPf_KIDS))
1044 o = cUNOPx(obase)->op_first;
1050 /* if all except one arg are constant, or have no side-effects,
1051 * or are optimized away, then it's unambiguous */
1053 for (kid=o; kid; kid = kid->op_sibling) {
1055 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1056 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1057 || (kid->op_type == OP_PUSHMARK)
1061 if (o2) { /* more than one found */
1068 return find_uninit_var(o2, uninit_sv, match);
1072 sv = find_uninit_var(o, uninit_sv, 1);
1084 =for apidoc report_uninit
1086 Print appropriate "Use of uninitialized variable" warning
1092 Perl_report_uninit(pTHX_ SV* uninit_sv)
1095 SV* varname = Nullsv;
1097 varname = find_uninit_var(PL_op, uninit_sv,0);
1099 sv_insert(varname, 0, 0, " ", 1);
1101 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1102 varname ? SvPV_nolen(varname) : "",
1103 " in ", OP_DESC(PL_op));
1106 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1110 /* grab a new IV body from the free list, allocating more if necessary */
1121 * See comment in more_xiv() -- RAM.
1123 PL_xiv_root = *(IV**)xiv;
1125 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
1128 /* return an IV body to the free list */
1131 S_del_xiv(pTHX_ XPVIV *p)
1133 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
1135 *(IV**)xiv = PL_xiv_root;
1140 /* allocate another arena's worth of IV bodies */
1146 register IV* xivend;
1148 New(705, ptr, 1008/sizeof(XPV), XPV);
1149 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
1150 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
1153 xivend = &xiv[1008 / sizeof(IV) - 1];
1154 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
1156 while (xiv < xivend) {
1157 *(IV**)xiv = (IV *)(xiv + 1);
1163 /* grab a new NV body from the free list, allocating more if necessary */
1173 PL_xnv_root = *(NV**)xnv;
1175 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1178 /* return an NV body to the free list */
1181 S_del_xnv(pTHX_ XPVNV *p)
1183 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1185 *(NV**)xnv = PL_xnv_root;
1190 /* allocate another arena's worth of NV bodies */
1196 register NV* xnvend;
1198 New(711, ptr, 1008/sizeof(XPV), XPV);
1199 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
1200 PL_xnv_arenaroot = ptr;
1203 xnvend = &xnv[1008 / sizeof(NV) - 1];
1204 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1206 while (xnv < xnvend) {
1207 *(NV**)xnv = (NV*)(xnv + 1);
1213 /* grab a new struct xrv from the free list, allocating more if necessary */
1223 PL_xrv_root = (XRV*)xrv->xrv_rv;
1228 /* return a struct xrv to the free list */
1231 S_del_xrv(pTHX_ XRV *p)
1234 p->xrv_rv = (SV*)PL_xrv_root;
1239 /* allocate another arena's worth of struct xrv */
1245 register XRV* xrvend;
1247 New(712, ptr, 1008/sizeof(XPV), XPV);
1248 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
1249 PL_xrv_arenaroot = ptr;
1252 xrvend = &xrv[1008 / sizeof(XRV) - 1];
1253 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
1255 while (xrv < xrvend) {
1256 xrv->xrv_rv = (SV*)(xrv + 1);
1262 /* grab a new struct xpv from the free list, allocating more if necessary */
1272 PL_xpv_root = (XPV*)xpv->xpv_pv;
1277 /* return a struct xpv to the free list */
1280 S_del_xpv(pTHX_ XPV *p)
1283 p->xpv_pv = (char*)PL_xpv_root;
1288 /* allocate another arena's worth of struct xpv */
1294 register XPV* xpvend;
1295 New(713, xpv, 1008/sizeof(XPV), XPV);
1296 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
1297 PL_xpv_arenaroot = xpv;
1299 xpvend = &xpv[1008 / sizeof(XPV) - 1];
1300 PL_xpv_root = ++xpv;
1301 while (xpv < xpvend) {
1302 xpv->xpv_pv = (char*)(xpv + 1);
1308 /* grab a new struct xpviv from the free list, allocating more if necessary */
1317 xpviv = PL_xpviv_root;
1318 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
1323 /* return a struct xpviv to the free list */
1326 S_del_xpviv(pTHX_ XPVIV *p)
1329 p->xpv_pv = (char*)PL_xpviv_root;
1334 /* allocate another arena's worth of struct xpviv */
1339 register XPVIV* xpviv;
1340 register XPVIV* xpvivend;
1341 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
1342 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
1343 PL_xpviv_arenaroot = xpviv;
1345 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
1346 PL_xpviv_root = ++xpviv;
1347 while (xpviv < xpvivend) {
1348 xpviv->xpv_pv = (char*)(xpviv + 1);
1354 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1363 xpvnv = PL_xpvnv_root;
1364 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
1369 /* return a struct xpvnv to the free list */
1372 S_del_xpvnv(pTHX_ XPVNV *p)
1375 p->xpv_pv = (char*)PL_xpvnv_root;
1380 /* allocate another arena's worth of struct xpvnv */
1385 register XPVNV* xpvnv;
1386 register XPVNV* xpvnvend;
1387 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
1388 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
1389 PL_xpvnv_arenaroot = xpvnv;
1391 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
1392 PL_xpvnv_root = ++xpvnv;
1393 while (xpvnv < xpvnvend) {
1394 xpvnv->xpv_pv = (char*)(xpvnv + 1);
1400 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1409 xpvcv = PL_xpvcv_root;
1410 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
1415 /* return a struct xpvcv to the free list */
1418 S_del_xpvcv(pTHX_ XPVCV *p)
1421 p->xpv_pv = (char*)PL_xpvcv_root;
1426 /* allocate another arena's worth of struct xpvcv */
1431 register XPVCV* xpvcv;
1432 register XPVCV* xpvcvend;
1433 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
1434 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
1435 PL_xpvcv_arenaroot = xpvcv;
1437 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
1438 PL_xpvcv_root = ++xpvcv;
1439 while (xpvcv < xpvcvend) {
1440 xpvcv->xpv_pv = (char*)(xpvcv + 1);
1446 /* grab a new struct xpvav from the free list, allocating more if necessary */
1455 xpvav = PL_xpvav_root;
1456 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
1461 /* return a struct xpvav to the free list */
1464 S_del_xpvav(pTHX_ XPVAV *p)
1467 p->xav_array = (char*)PL_xpvav_root;
1472 /* allocate another arena's worth of struct xpvav */
1477 register XPVAV* xpvav;
1478 register XPVAV* xpvavend;
1479 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
1480 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
1481 PL_xpvav_arenaroot = xpvav;
1483 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
1484 PL_xpvav_root = ++xpvav;
1485 while (xpvav < xpvavend) {
1486 xpvav->xav_array = (char*)(xpvav + 1);
1489 xpvav->xav_array = 0;
1492 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1501 xpvhv = PL_xpvhv_root;
1502 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
1507 /* return a struct xpvhv to the free list */
1510 S_del_xpvhv(pTHX_ XPVHV *p)
1513 p->xhv_array = (char*)PL_xpvhv_root;
1518 /* allocate another arena's worth of struct xpvhv */
1523 register XPVHV* xpvhv;
1524 register XPVHV* xpvhvend;
1525 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
1526 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1527 PL_xpvhv_arenaroot = xpvhv;
1529 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
1530 PL_xpvhv_root = ++xpvhv;
1531 while (xpvhv < xpvhvend) {
1532 xpvhv->xhv_array = (char*)(xpvhv + 1);
1535 xpvhv->xhv_array = 0;
1538 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1547 xpvmg = PL_xpvmg_root;
1548 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1553 /* return a struct xpvmg to the free list */
1556 S_del_xpvmg(pTHX_ XPVMG *p)
1559 p->xpv_pv = (char*)PL_xpvmg_root;
1564 /* allocate another arena's worth of struct xpvmg */
1569 register XPVMG* xpvmg;
1570 register XPVMG* xpvmgend;
1571 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1572 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1573 PL_xpvmg_arenaroot = xpvmg;
1575 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1576 PL_xpvmg_root = ++xpvmg;
1577 while (xpvmg < xpvmgend) {
1578 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1584 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1593 xpvlv = PL_xpvlv_root;
1594 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1599 /* return a struct xpvlv to the free list */
1602 S_del_xpvlv(pTHX_ XPVLV *p)
1605 p->xpv_pv = (char*)PL_xpvlv_root;
1610 /* allocate another arena's worth of struct xpvlv */
1615 register XPVLV* xpvlv;
1616 register XPVLV* xpvlvend;
1617 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1618 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1619 PL_xpvlv_arenaroot = xpvlv;
1621 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1622 PL_xpvlv_root = ++xpvlv;
1623 while (xpvlv < xpvlvend) {
1624 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1630 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1639 xpvbm = PL_xpvbm_root;
1640 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1645 /* return a struct xpvbm to the free list */
1648 S_del_xpvbm(pTHX_ XPVBM *p)
1651 p->xpv_pv = (char*)PL_xpvbm_root;
1656 /* allocate another arena's worth of struct xpvbm */
1661 register XPVBM* xpvbm;
1662 register XPVBM* xpvbmend;
1663 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1664 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1665 PL_xpvbm_arenaroot = xpvbm;
1667 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1668 PL_xpvbm_root = ++xpvbm;
1669 while (xpvbm < xpvbmend) {
1670 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1676 #define my_safemalloc(s) (void*)safemalloc(s)
1677 #define my_safefree(p) safefree((char*)p)
1681 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1682 #define del_XIV(p) my_safefree(p)
1684 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1685 #define del_XNV(p) my_safefree(p)
1687 #define new_XRV() my_safemalloc(sizeof(XRV))
1688 #define del_XRV(p) my_safefree(p)
1690 #define new_XPV() my_safemalloc(sizeof(XPV))
1691 #define del_XPV(p) my_safefree(p)
1693 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1694 #define del_XPVIV(p) my_safefree(p)
1696 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1697 #define del_XPVNV(p) my_safefree(p)
1699 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1700 #define del_XPVCV(p) my_safefree(p)
1702 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1703 #define del_XPVAV(p) my_safefree(p)
1705 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1706 #define del_XPVHV(p) my_safefree(p)
1708 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1709 #define del_XPVMG(p) my_safefree(p)
1711 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1712 #define del_XPVLV(p) my_safefree(p)
1714 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1715 #define del_XPVBM(p) my_safefree(p)
1719 #define new_XIV() (void*)new_xiv()
1720 #define del_XIV(p) del_xiv((XPVIV*) p)
1722 #define new_XNV() (void*)new_xnv()
1723 #define del_XNV(p) del_xnv((XPVNV*) p)
1725 #define new_XRV() (void*)new_xrv()
1726 #define del_XRV(p) del_xrv((XRV*) p)
1728 #define new_XPV() (void*)new_xpv()
1729 #define del_XPV(p) del_xpv((XPV *)p)
1731 #define new_XPVIV() (void*)new_xpviv()
1732 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1734 #define new_XPVNV() (void*)new_xpvnv()
1735 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1737 #define new_XPVCV() (void*)new_xpvcv()
1738 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1740 #define new_XPVAV() (void*)new_xpvav()
1741 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1743 #define new_XPVHV() (void*)new_xpvhv()
1744 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1746 #define new_XPVMG() (void*)new_xpvmg()
1747 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1749 #define new_XPVLV() (void*)new_xpvlv()
1750 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1752 #define new_XPVBM() (void*)new_xpvbm()
1753 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1757 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1758 #define del_XPVGV(p) my_safefree(p)
1760 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1761 #define del_XPVFM(p) my_safefree(p)
1763 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1764 #define del_XPVIO(p) my_safefree(p)
1767 =for apidoc sv_upgrade
1769 Upgrade an SV to a more complex form. Generally adds a new body type to the
1770 SV, then copies across as much information as possible from the old body.
1771 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1777 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1785 MAGIC* magic = NULL;
1788 if (mt != SVt_PV && SvIsCOW(sv)) {
1789 sv_force_normal_flags(sv, 0);
1792 if (SvTYPE(sv) == mt)
1796 (void)SvOOK_off(sv);
1798 switch (SvTYPE(sv)) {
1819 else if (mt < SVt_PVIV)
1836 pv = (char*)SvRV(sv);
1856 else if (mt == SVt_NV)
1867 del_XPVIV(SvANY(sv));
1877 del_XPVNV(SvANY(sv));
1885 magic = SvMAGIC(sv);
1886 stash = SvSTASH(sv);
1887 del_XPVMG(SvANY(sv));
1890 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1893 SvFLAGS(sv) &= ~SVTYPEMASK;
1898 Perl_croak(aTHX_ "Can't upgrade to undef");
1900 SvANY(sv) = new_XIV();
1904 SvANY(sv) = new_XNV();
1908 SvANY(sv) = new_XRV();
1909 SvRV_set(sv, (SV*)pv);
1912 SvANY(sv) = new_XPV();
1918 SvANY(sv) = new_XPVIV();
1928 SvANY(sv) = new_XPVNV();
1936 SvANY(sv) = new_XPVMG();
1942 SvMAGIC_set(sv, magic);
1943 SvSTASH_set(sv, stash);
1946 SvANY(sv) = new_XPVLV();
1952 SvMAGIC_set(sv, magic);
1953 SvSTASH_set(sv, stash);
1965 SvANY(sv) = new_XPVAV();
1968 SvPV_set(sv, (char*)0);
1973 SvMAGIC_set(sv, magic);
1974 SvSTASH_set(sv, stash);
1977 AvFLAGS(sv) = AVf_REAL;
1980 SvANY(sv) = new_XPVHV();
1983 SvPV_set(sv, (char*)0);
1986 HvTOTALKEYS(sv) = 0;
1987 HvPLACEHOLDERS(sv) = 0;
1988 SvMAGIC_set(sv, magic);
1989 SvSTASH_set(sv, stash);
1996 SvANY(sv) = new_XPVCV();
1997 Zero(SvANY(sv), 1, XPVCV);
2003 SvMAGIC_set(sv, magic);
2004 SvSTASH_set(sv, stash);
2007 SvANY(sv) = new_XPVGV();
2013 SvMAGIC_set(sv, magic);
2014 SvSTASH_set(sv, stash);
2022 SvANY(sv) = new_XPVBM();
2028 SvMAGIC_set(sv, magic);
2029 SvSTASH_set(sv, stash);
2035 SvANY(sv) = new_XPVFM();
2036 Zero(SvANY(sv), 1, XPVFM);
2042 SvMAGIC_set(sv, magic);
2043 SvSTASH_set(sv, stash);
2046 SvANY(sv) = new_XPVIO();
2047 Zero(SvANY(sv), 1, XPVIO);
2053 SvMAGIC_set(sv, magic);
2054 SvSTASH_set(sv, stash);
2055 IoPAGE_LEN(sv) = 60;
2062 =for apidoc sv_backoff
2064 Remove any string offset. You should normally use the C<SvOOK_off> macro
2071 Perl_sv_backoff(pTHX_ register SV *sv)
2075 char *s = SvPVX(sv);
2076 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
2077 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
2079 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
2081 SvFLAGS(sv) &= ~SVf_OOK;
2088 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2089 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2090 Use the C<SvGROW> wrapper instead.
2096 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2100 #ifdef HAS_64K_LIMIT
2101 if (newlen >= 0x10000) {
2102 PerlIO_printf(Perl_debug_log,
2103 "Allocation too large: %"UVxf"\n", (UV)newlen);
2106 #endif /* HAS_64K_LIMIT */
2109 if (SvTYPE(sv) < SVt_PV) {
2110 sv_upgrade(sv, SVt_PV);
2113 else if (SvOOK(sv)) { /* pv is offset? */
2116 if (newlen > SvLEN(sv))
2117 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2118 #ifdef HAS_64K_LIMIT
2119 if (newlen >= 0x10000)
2126 if (newlen > SvLEN(sv)) { /* need more room? */
2127 if (SvLEN(sv) && s) {
2129 STRLEN l = malloced_size((void*)SvPVX(sv));
2135 Renew(s,newlen,char);
2138 New(703, s, newlen, char);
2139 if (SvPVX(sv) && SvCUR(sv)) {
2140 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2144 SvLEN_set(sv, newlen);
2150 =for apidoc sv_setiv
2152 Copies an integer into the given SV, upgrading first if necessary.
2153 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2159 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2161 SV_CHECK_THINKFIRST_COW_DROP(sv);
2162 switch (SvTYPE(sv)) {
2164 sv_upgrade(sv, SVt_IV);
2167 sv_upgrade(sv, SVt_PVNV);
2171 sv_upgrade(sv, SVt_PVIV);
2180 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2183 (void)SvIOK_only(sv); /* validate number */
2189 =for apidoc sv_setiv_mg
2191 Like C<sv_setiv>, but also handles 'set' magic.
2197 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2204 =for apidoc sv_setuv
2206 Copies an unsigned integer into the given SV, upgrading first if necessary.
2207 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2213 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2215 /* With these two if statements:
2216 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2219 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2221 If you wish to remove them, please benchmark to see what the effect is
2223 if (u <= (UV)IV_MAX) {
2224 sv_setiv(sv, (IV)u);
2233 =for apidoc sv_setuv_mg
2235 Like C<sv_setuv>, but also handles 'set' magic.
2241 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2243 /* With these two if statements:
2244 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2247 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2249 If you wish to remove them, please benchmark to see what the effect is
2251 if (u <= (UV)IV_MAX) {
2252 sv_setiv(sv, (IV)u);
2262 =for apidoc sv_setnv
2264 Copies a double into the given SV, upgrading first if necessary.
2265 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2271 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2273 SV_CHECK_THINKFIRST_COW_DROP(sv);
2274 switch (SvTYPE(sv)) {
2277 sv_upgrade(sv, SVt_NV);
2282 sv_upgrade(sv, SVt_PVNV);
2291 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2295 (void)SvNOK_only(sv); /* validate number */
2300 =for apidoc sv_setnv_mg
2302 Like C<sv_setnv>, but also handles 'set' magic.
2308 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2314 /* Print an "isn't numeric" warning, using a cleaned-up,
2315 * printable version of the offending string
2319 S_not_a_number(pTHX_ SV *sv)
2326 dsv = sv_2mortal(newSVpv("", 0));
2327 pv = sv_uni_display(dsv, sv, 10, 0);
2330 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2331 /* each *s can expand to 4 chars + "...\0",
2332 i.e. need room for 8 chars */
2335 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2337 if (ch & 128 && !isPRINT_LC(ch)) {
2346 else if (ch == '\r') {
2350 else if (ch == '\f') {
2354 else if (ch == '\\') {
2358 else if (ch == '\0') {
2362 else if (isPRINT_LC(ch))
2379 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2380 "Argument \"%s\" isn't numeric in %s", pv,
2383 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2384 "Argument \"%s\" isn't numeric", pv);
2388 =for apidoc looks_like_number
2390 Test if the content of an SV looks like a number (or is a number).
2391 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2392 non-numeric warning), even if your atof() doesn't grok them.
2398 Perl_looks_like_number(pTHX_ SV *sv)
2400 register char *sbegin;
2407 else if (SvPOKp(sv))
2408 sbegin = SvPV(sv, len);
2410 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2411 return grok_number(sbegin, len, NULL);
2414 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2415 until proven guilty, assume that things are not that bad... */
2420 As 64 bit platforms often have an NV that doesn't preserve all bits of
2421 an IV (an assumption perl has been based on to date) it becomes necessary
2422 to remove the assumption that the NV always carries enough precision to
2423 recreate the IV whenever needed, and that the NV is the canonical form.
2424 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2425 precision as a side effect of conversion (which would lead to insanity
2426 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2427 1) to distinguish between IV/UV/NV slots that have cached a valid
2428 conversion where precision was lost and IV/UV/NV slots that have a
2429 valid conversion which has lost no precision
2430 2) to ensure that if a numeric conversion to one form is requested that
2431 would lose precision, the precise conversion (or differently
2432 imprecise conversion) is also performed and cached, to prevent
2433 requests for different numeric formats on the same SV causing
2434 lossy conversion chains. (lossless conversion chains are perfectly
2439 SvIOKp is true if the IV slot contains a valid value
2440 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2441 SvNOKp is true if the NV slot contains a valid value
2442 SvNOK is true only if the NV value is accurate
2445 while converting from PV to NV, check to see if converting that NV to an
2446 IV(or UV) would lose accuracy over a direct conversion from PV to
2447 IV(or UV). If it would, cache both conversions, return NV, but mark
2448 SV as IOK NOKp (ie not NOK).
2450 While converting from PV to IV, check to see if converting that IV to an
2451 NV would lose accuracy over a direct conversion from PV to NV. If it
2452 would, cache both conversions, flag similarly.
2454 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2455 correctly because if IV & NV were set NV *always* overruled.
2456 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2457 changes - now IV and NV together means that the two are interchangeable:
2458 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2460 The benefit of this is that operations such as pp_add know that if
2461 SvIOK is true for both left and right operands, then integer addition
2462 can be used instead of floating point (for cases where the result won't
2463 overflow). Before, floating point was always used, which could lead to
2464 loss of precision compared with integer addition.
2466 * making IV and NV equal status should make maths accurate on 64 bit
2468 * may speed up maths somewhat if pp_add and friends start to use
2469 integers when possible instead of fp. (Hopefully the overhead in
2470 looking for SvIOK and checking for overflow will not outweigh the
2471 fp to integer speedup)
2472 * will slow down integer operations (callers of SvIV) on "inaccurate"
2473 values, as the change from SvIOK to SvIOKp will cause a call into
2474 sv_2iv each time rather than a macro access direct to the IV slot
2475 * should speed up number->string conversion on integers as IV is
2476 favoured when IV and NV are equally accurate
2478 ####################################################################
2479 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2480 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2481 On the other hand, SvUOK is true iff UV.
2482 ####################################################################
2484 Your mileage will vary depending your CPU's relative fp to integer
2488 #ifndef NV_PRESERVES_UV
2489 # define IS_NUMBER_UNDERFLOW_IV 1
2490 # define IS_NUMBER_UNDERFLOW_UV 2
2491 # define IS_NUMBER_IV_AND_UV 2
2492 # define IS_NUMBER_OVERFLOW_IV 4
2493 # define IS_NUMBER_OVERFLOW_UV 5
2495 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2497 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2499 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2501 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));
2502 if (SvNVX(sv) < (NV)IV_MIN) {
2503 (void)SvIOKp_on(sv);
2505 SvIV_set(sv, IV_MIN);
2506 return IS_NUMBER_UNDERFLOW_IV;
2508 if (SvNVX(sv) > (NV)UV_MAX) {
2509 (void)SvIOKp_on(sv);
2512 SvUV_set(sv, UV_MAX);
2513 return IS_NUMBER_OVERFLOW_UV;
2515 (void)SvIOKp_on(sv);
2517 /* Can't use strtol etc to convert this string. (See truth table in
2519 if (SvNVX(sv) <= (UV)IV_MAX) {
2520 SvIV_set(sv, I_V(SvNVX(sv)));
2521 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2522 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2524 /* Integer is imprecise. NOK, IOKp */
2526 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2529 SvUV_set(sv, U_V(SvNVX(sv)));
2530 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2531 if (SvUVX(sv) == UV_MAX) {
2532 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2533 possibly be preserved by NV. Hence, it must be overflow.
2535 return IS_NUMBER_OVERFLOW_UV;
2537 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2539 /* Integer is imprecise. NOK, IOKp */
2541 return IS_NUMBER_OVERFLOW_IV;
2543 #endif /* !NV_PRESERVES_UV*/
2545 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2546 * this function provided for binary compatibility only
2550 Perl_sv_2iv(pTHX_ register SV *sv)
2552 return sv_2iv_flags(sv, SV_GMAGIC);
2556 =for apidoc sv_2iv_flags
2558 Return the integer value of an SV, doing any necessary string
2559 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2560 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2566 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2570 if (SvGMAGICAL(sv)) {
2571 if (flags & SV_GMAGIC)
2576 return I_V(SvNVX(sv));
2578 if (SvPOKp(sv) && SvLEN(sv))
2581 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2582 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2588 if (SvTHINKFIRST(sv)) {
2591 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2592 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2593 return SvIV(tmpstr);
2594 return PTR2IV(SvRV(sv));
2597 sv_force_normal_flags(sv, 0);
2599 if (SvREADONLY(sv) && !SvOK(sv)) {
2600 if (ckWARN(WARN_UNINITIALIZED))
2607 return (IV)(SvUVX(sv));
2614 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2615 * without also getting a cached IV/UV from it at the same time
2616 * (ie PV->NV conversion should detect loss of accuracy and cache
2617 * IV or UV at same time to avoid this. NWC */
2619 if (SvTYPE(sv) == SVt_NV)
2620 sv_upgrade(sv, SVt_PVNV);
2622 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2623 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2624 certainly cast into the IV range at IV_MAX, whereas the correct
2625 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2627 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2628 SvIV_set(sv, I_V(SvNVX(sv)));
2629 if (SvNVX(sv) == (NV) SvIVX(sv)
2630 #ifndef NV_PRESERVES_UV
2631 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2632 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2633 /* Don't flag it as "accurately an integer" if the number
2634 came from a (by definition imprecise) NV operation, and
2635 we're outside the range of NV integer precision */
2638 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2639 DEBUG_c(PerlIO_printf(Perl_debug_log,
2640 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2646 /* IV not precise. No need to convert from PV, as NV
2647 conversion would already have cached IV if it detected
2648 that PV->IV would be better than PV->NV->IV
2649 flags already correct - don't set public IOK. */
2650 DEBUG_c(PerlIO_printf(Perl_debug_log,
2651 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2656 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2657 but the cast (NV)IV_MIN rounds to a the value less (more
2658 negative) than IV_MIN which happens to be equal to SvNVX ??
2659 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2660 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2661 (NV)UVX == NVX are both true, but the values differ. :-(
2662 Hopefully for 2s complement IV_MIN is something like
2663 0x8000000000000000 which will be exact. NWC */
2666 SvUV_set(sv, U_V(SvNVX(sv)));
2668 (SvNVX(sv) == (NV) SvUVX(sv))
2669 #ifndef NV_PRESERVES_UV
2670 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2671 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2672 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2673 /* Don't flag it as "accurately an integer" if the number
2674 came from a (by definition imprecise) NV operation, and
2675 we're outside the range of NV integer precision */
2681 DEBUG_c(PerlIO_printf(Perl_debug_log,
2682 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2686 return (IV)SvUVX(sv);
2689 else if (SvPOKp(sv) && SvLEN(sv)) {
2691 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2692 /* We want to avoid a possible problem when we cache an IV which
2693 may be later translated to an NV, and the resulting NV is not
2694 the same as the direct translation of the initial string
2695 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2696 be careful to ensure that the value with the .456 is around if the
2697 NV value is requested in the future).
2699 This means that if we cache such an IV, we need to cache the
2700 NV as well. Moreover, we trade speed for space, and do not
2701 cache the NV if we are sure it's not needed.
2704 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2705 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2706 == IS_NUMBER_IN_UV) {
2707 /* It's definitely an integer, only upgrade to PVIV */
2708 if (SvTYPE(sv) < SVt_PVIV)
2709 sv_upgrade(sv, SVt_PVIV);
2711 } else if (SvTYPE(sv) < SVt_PVNV)
2712 sv_upgrade(sv, SVt_PVNV);
2714 /* If NV preserves UV then we only use the UV value if we know that
2715 we aren't going to call atof() below. If NVs don't preserve UVs
2716 then the value returned may have more precision than atof() will
2717 return, even though value isn't perfectly accurate. */
2718 if ((numtype & (IS_NUMBER_IN_UV
2719 #ifdef NV_PRESERVES_UV
2722 )) == IS_NUMBER_IN_UV) {
2723 /* This won't turn off the public IOK flag if it was set above */
2724 (void)SvIOKp_on(sv);
2726 if (!(numtype & IS_NUMBER_NEG)) {
2728 if (value <= (UV)IV_MAX) {
2729 SvIV_set(sv, (IV)value);
2731 SvUV_set(sv, value);
2735 /* 2s complement assumption */
2736 if (value <= (UV)IV_MIN) {
2737 SvIV_set(sv, -(IV)value);
2739 /* Too negative for an IV. This is a double upgrade, but
2740 I'm assuming it will be rare. */
2741 if (SvTYPE(sv) < SVt_PVNV)
2742 sv_upgrade(sv, SVt_PVNV);
2746 SvNV_set(sv, -(NV)value);
2747 SvIV_set(sv, IV_MIN);
2751 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2752 will be in the previous block to set the IV slot, and the next
2753 block to set the NV slot. So no else here. */
2755 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2756 != IS_NUMBER_IN_UV) {
2757 /* It wasn't an (integer that doesn't overflow the UV). */
2758 SvNV_set(sv, Atof(SvPVX(sv)));
2760 if (! numtype && ckWARN(WARN_NUMERIC))
2763 #if defined(USE_LONG_DOUBLE)
2764 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2765 PTR2UV(sv), SvNVX(sv)));
2767 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2768 PTR2UV(sv), SvNVX(sv)));
2772 #ifdef NV_PRESERVES_UV
2773 (void)SvIOKp_on(sv);
2775 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2776 SvIV_set(sv, I_V(SvNVX(sv)));
2777 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2780 /* Integer is imprecise. NOK, IOKp */
2782 /* UV will not work better than IV */
2784 if (SvNVX(sv) > (NV)UV_MAX) {
2786 /* Integer is inaccurate. NOK, IOKp, is UV */
2787 SvUV_set(sv, UV_MAX);
2790 SvUV_set(sv, U_V(SvNVX(sv)));
2791 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2792 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2796 /* Integer is imprecise. NOK, IOKp, is UV */
2802 #else /* NV_PRESERVES_UV */
2803 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2804 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2805 /* The IV slot will have been set from value returned by
2806 grok_number above. The NV slot has just been set using
2809 assert (SvIOKp(sv));
2811 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2812 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2813 /* Small enough to preserve all bits. */
2814 (void)SvIOKp_on(sv);
2816 SvIV_set(sv, I_V(SvNVX(sv)));
2817 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2819 /* Assumption: first non-preserved integer is < IV_MAX,
2820 this NV is in the preserved range, therefore: */
2821 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2823 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);
2827 0 0 already failed to read UV.
2828 0 1 already failed to read UV.
2829 1 0 you won't get here in this case. IV/UV
2830 slot set, public IOK, Atof() unneeded.
2831 1 1 already read UV.
2832 so there's no point in sv_2iuv_non_preserve() attempting
2833 to use atol, strtol, strtoul etc. */
2834 if (sv_2iuv_non_preserve (sv, numtype)
2835 >= IS_NUMBER_OVERFLOW_IV)
2839 #endif /* NV_PRESERVES_UV */
2842 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2844 if (SvTYPE(sv) < SVt_IV)
2845 /* Typically the caller expects that sv_any is not NULL now. */
2846 sv_upgrade(sv, SVt_IV);
2849 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2850 PTR2UV(sv),SvIVX(sv)));
2851 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2854 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2855 * this function provided for binary compatibility only
2859 Perl_sv_2uv(pTHX_ register SV *sv)
2861 return sv_2uv_flags(sv, SV_GMAGIC);
2865 =for apidoc sv_2uv_flags
2867 Return the unsigned integer value of an SV, doing any necessary string
2868 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2869 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2875 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2879 if (SvGMAGICAL(sv)) {
2880 if (flags & SV_GMAGIC)
2885 return U_V(SvNVX(sv));
2886 if (SvPOKp(sv) && SvLEN(sv))
2889 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2890 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2896 if (SvTHINKFIRST(sv)) {
2899 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2900 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2901 return SvUV(tmpstr);
2902 return PTR2UV(SvRV(sv));
2905 sv_force_normal_flags(sv, 0);
2907 if (SvREADONLY(sv) && !SvOK(sv)) {
2908 if (ckWARN(WARN_UNINITIALIZED))
2918 return (UV)SvIVX(sv);
2922 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2923 * without also getting a cached IV/UV from it at the same time
2924 * (ie PV->NV conversion should detect loss of accuracy and cache
2925 * IV or UV at same time to avoid this. */
2926 /* IV-over-UV optimisation - choose to cache IV if possible */
2928 if (SvTYPE(sv) == SVt_NV)
2929 sv_upgrade(sv, SVt_PVNV);
2931 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2932 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2933 SvIV_set(sv, I_V(SvNVX(sv)));
2934 if (SvNVX(sv) == (NV) SvIVX(sv)
2935 #ifndef NV_PRESERVES_UV
2936 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2937 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2938 /* Don't flag it as "accurately an integer" if the number
2939 came from a (by definition imprecise) NV operation, and
2940 we're outside the range of NV integer precision */
2943 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2944 DEBUG_c(PerlIO_printf(Perl_debug_log,
2945 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2951 /* IV not precise. No need to convert from PV, as NV
2952 conversion would already have cached IV if it detected
2953 that PV->IV would be better than PV->NV->IV
2954 flags already correct - don't set public IOK. */
2955 DEBUG_c(PerlIO_printf(Perl_debug_log,
2956 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2961 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2962 but the cast (NV)IV_MIN rounds to a the value less (more
2963 negative) than IV_MIN which happens to be equal to SvNVX ??
2964 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2965 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2966 (NV)UVX == NVX are both true, but the values differ. :-(
2967 Hopefully for 2s complement IV_MIN is something like
2968 0x8000000000000000 which will be exact. NWC */
2971 SvUV_set(sv, U_V(SvNVX(sv)));
2973 (SvNVX(sv) == (NV) SvUVX(sv))
2974 #ifndef NV_PRESERVES_UV
2975 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2976 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2977 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2978 /* Don't flag it as "accurately an integer" if the number
2979 came from a (by definition imprecise) NV operation, and
2980 we're outside the range of NV integer precision */
2985 DEBUG_c(PerlIO_printf(Perl_debug_log,
2986 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2992 else if (SvPOKp(sv) && SvLEN(sv)) {
2994 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2996 /* We want to avoid a possible problem when we cache a UV which
2997 may be later translated to an NV, and the resulting NV is not
2998 the translation of the initial data.
3000 This means that if we cache such a UV, we need to cache the
3001 NV as well. Moreover, we trade speed for space, and do not
3002 cache the NV if not needed.
3005 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
3006 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3007 == IS_NUMBER_IN_UV) {
3008 /* It's definitely an integer, only upgrade to PVIV */
3009 if (SvTYPE(sv) < SVt_PVIV)
3010 sv_upgrade(sv, SVt_PVIV);
3012 } else if (SvTYPE(sv) < SVt_PVNV)
3013 sv_upgrade(sv, SVt_PVNV);
3015 /* If NV preserves UV then we only use the UV value if we know that
3016 we aren't going to call atof() below. If NVs don't preserve UVs
3017 then the value returned may have more precision than atof() will
3018 return, even though it isn't accurate. */
3019 if ((numtype & (IS_NUMBER_IN_UV
3020 #ifdef NV_PRESERVES_UV
3023 )) == IS_NUMBER_IN_UV) {
3024 /* This won't turn off the public IOK flag if it was set above */
3025 (void)SvIOKp_on(sv);
3027 if (!(numtype & IS_NUMBER_NEG)) {
3029 if (value <= (UV)IV_MAX) {
3030 SvIV_set(sv, (IV)value);
3032 /* it didn't overflow, and it was positive. */
3033 SvUV_set(sv, value);
3037 /* 2s complement assumption */
3038 if (value <= (UV)IV_MIN) {
3039 SvIV_set(sv, -(IV)value);
3041 /* Too negative for an IV. This is a double upgrade, but
3042 I'm assuming it will be rare. */
3043 if (SvTYPE(sv) < SVt_PVNV)
3044 sv_upgrade(sv, SVt_PVNV);
3048 SvNV_set(sv, -(NV)value);
3049 SvIV_set(sv, IV_MIN);
3054 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3055 != IS_NUMBER_IN_UV) {
3056 /* It wasn't an integer, or it overflowed the UV. */
3057 SvNV_set(sv, Atof(SvPVX(sv)));
3059 if (! numtype && ckWARN(WARN_NUMERIC))
3062 #if defined(USE_LONG_DOUBLE)
3063 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
3064 PTR2UV(sv), SvNVX(sv)));
3066 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
3067 PTR2UV(sv), SvNVX(sv)));
3070 #ifdef NV_PRESERVES_UV
3071 (void)SvIOKp_on(sv);
3073 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3074 SvIV_set(sv, I_V(SvNVX(sv)));
3075 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
3078 /* Integer is imprecise. NOK, IOKp */
3080 /* UV will not work better than IV */
3082 if (SvNVX(sv) > (NV)UV_MAX) {
3084 /* Integer is inaccurate. NOK, IOKp, is UV */
3085 SvUV_set(sv, UV_MAX);
3088 SvUV_set(sv, U_V(SvNVX(sv)));
3089 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3090 NV preservse UV so can do correct comparison. */
3091 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3095 /* Integer is imprecise. NOK, IOKp, is UV */
3100 #else /* NV_PRESERVES_UV */
3101 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3102 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3103 /* The UV slot will have been set from value returned by
3104 grok_number above. The NV slot has just been set using
3107 assert (SvIOKp(sv));
3109 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3110 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3111 /* Small enough to preserve all bits. */
3112 (void)SvIOKp_on(sv);
3114 SvIV_set(sv, I_V(SvNVX(sv)));
3115 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3117 /* Assumption: first non-preserved integer is < IV_MAX,
3118 this NV is in the preserved range, therefore: */
3119 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3121 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);
3124 sv_2iuv_non_preserve (sv, numtype);
3126 #endif /* NV_PRESERVES_UV */
3130 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3131 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3134 if (SvTYPE(sv) < SVt_IV)
3135 /* Typically the caller expects that sv_any is not NULL now. */
3136 sv_upgrade(sv, SVt_IV);
3140 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3141 PTR2UV(sv),SvUVX(sv)));
3142 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3148 Return the num value of an SV, doing any necessary string or integer
3149 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3156 Perl_sv_2nv(pTHX_ register SV *sv)
3160 if (SvGMAGICAL(sv)) {
3164 if (SvPOKp(sv) && SvLEN(sv)) {
3165 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3166 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
3168 return Atof(SvPVX(sv));
3172 return (NV)SvUVX(sv);
3174 return (NV)SvIVX(sv);
3177 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3178 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3184 if (SvTHINKFIRST(sv)) {
3187 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3188 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3189 return SvNV(tmpstr);
3190 return PTR2NV(SvRV(sv));
3193 sv_force_normal_flags(sv, 0);
3195 if (SvREADONLY(sv) && !SvOK(sv)) {
3196 if (ckWARN(WARN_UNINITIALIZED))
3201 if (SvTYPE(sv) < SVt_NV) {
3202 if (SvTYPE(sv) == SVt_IV)
3203 sv_upgrade(sv, SVt_PVNV);
3205 sv_upgrade(sv, SVt_NV);
3206 #ifdef USE_LONG_DOUBLE
3208 STORE_NUMERIC_LOCAL_SET_STANDARD();
3209 PerlIO_printf(Perl_debug_log,
3210 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3211 PTR2UV(sv), SvNVX(sv));
3212 RESTORE_NUMERIC_LOCAL();
3216 STORE_NUMERIC_LOCAL_SET_STANDARD();
3217 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3218 PTR2UV(sv), SvNVX(sv));
3219 RESTORE_NUMERIC_LOCAL();
3223 else if (SvTYPE(sv) < SVt_PVNV)
3224 sv_upgrade(sv, SVt_PVNV);
3229 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3230 #ifdef NV_PRESERVES_UV
3233 /* Only set the public NV OK flag if this NV preserves the IV */
3234 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3235 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3236 : (SvIVX(sv) == I_V(SvNVX(sv))))
3242 else if (SvPOKp(sv) && SvLEN(sv)) {
3244 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3245 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3247 #ifdef NV_PRESERVES_UV
3248 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3249 == IS_NUMBER_IN_UV) {
3250 /* It's definitely an integer */
3251 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3253 SvNV_set(sv, Atof(SvPVX(sv)));
3256 SvNV_set(sv, Atof(SvPVX(sv)));
3257 /* Only set the public NV OK flag if this NV preserves the value in
3258 the PV at least as well as an IV/UV would.
3259 Not sure how to do this 100% reliably. */
3260 /* if that shift count is out of range then Configure's test is
3261 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3263 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3264 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3265 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3266 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3267 /* Can't use strtol etc to convert this string, so don't try.
3268 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3271 /* value has been set. It may not be precise. */
3272 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3273 /* 2s complement assumption for (UV)IV_MIN */
3274 SvNOK_on(sv); /* Integer is too negative. */
3279 if (numtype & IS_NUMBER_NEG) {
3280 SvIV_set(sv, -(IV)value);
3281 } else if (value <= (UV)IV_MAX) {
3282 SvIV_set(sv, (IV)value);
3284 SvUV_set(sv, value);
3288 if (numtype & IS_NUMBER_NOT_INT) {
3289 /* I believe that even if the original PV had decimals,
3290 they are lost beyond the limit of the FP precision.
3291 However, neither is canonical, so both only get p
3292 flags. NWC, 2000/11/25 */
3293 /* Both already have p flags, so do nothing */
3296 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3297 if (SvIVX(sv) == I_V(nv)) {
3302 /* It had no "." so it must be integer. */
3305 /* between IV_MAX and NV(UV_MAX).
3306 Could be slightly > UV_MAX */
3308 if (numtype & IS_NUMBER_NOT_INT) {
3309 /* UV and NV both imprecise. */
3311 UV nv_as_uv = U_V(nv);
3313 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3324 #endif /* NV_PRESERVES_UV */
3327 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3329 if (SvTYPE(sv) < SVt_NV)
3330 /* Typically the caller expects that sv_any is not NULL now. */
3331 /* XXX Ilya implies that this is a bug in callers that assume this
3332 and ideally should be fixed. */
3333 sv_upgrade(sv, SVt_NV);
3336 #if defined(USE_LONG_DOUBLE)
3338 STORE_NUMERIC_LOCAL_SET_STANDARD();
3339 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3340 PTR2UV(sv), SvNVX(sv));
3341 RESTORE_NUMERIC_LOCAL();
3345 STORE_NUMERIC_LOCAL_SET_STANDARD();
3346 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3347 PTR2UV(sv), SvNVX(sv));
3348 RESTORE_NUMERIC_LOCAL();
3354 /* asIV(): extract an integer from the string value of an SV.
3355 * Caller must validate PVX */
3358 S_asIV(pTHX_ SV *sv)
3361 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3363 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3364 == IS_NUMBER_IN_UV) {
3365 /* It's definitely an integer */
3366 if (numtype & IS_NUMBER_NEG) {
3367 if (value < (UV)IV_MIN)
3370 if (value < (UV)IV_MAX)
3375 if (ckWARN(WARN_NUMERIC))
3378 return I_V(Atof(SvPVX(sv)));
3381 /* asUV(): extract an unsigned integer from the string value of an SV
3382 * Caller must validate PVX */
3385 S_asUV(pTHX_ SV *sv)
3388 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3390 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3391 == IS_NUMBER_IN_UV) {
3392 /* It's definitely an integer */
3393 if (!(numtype & IS_NUMBER_NEG))
3397 if (ckWARN(WARN_NUMERIC))
3400 return U_V(Atof(SvPVX(sv)));
3404 =for apidoc sv_2pv_nolen
3406 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3407 use the macro wrapper C<SvPV_nolen(sv)> instead.
3412 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3415 return sv_2pv(sv, &n_a);
3418 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3419 * UV as a string towards the end of buf, and return pointers to start and
3422 * We assume that buf is at least TYPE_CHARS(UV) long.
3426 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3428 char *ptr = buf + TYPE_CHARS(UV);
3442 *--ptr = '0' + (char)(uv % 10);
3450 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3451 * this function provided for binary compatibility only
3455 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3457 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3461 =for apidoc sv_2pv_flags
3463 Returns a pointer to the string value of an SV, and sets *lp to its length.
3464 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3466 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3467 usually end up here too.
3473 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3478 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3479 char *tmpbuf = tbuf;
3485 if (SvGMAGICAL(sv)) {
3486 if (flags & SV_GMAGIC)
3494 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3496 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3501 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3506 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3507 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3514 if (SvTHINKFIRST(sv)) {
3517 register const char *typestr;
3518 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3519 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3520 char *pv = SvPV(tmpstr, *lp);
3530 typestr = "NULLREF";
3534 switch (SvTYPE(sv)) {
3536 if ( ((SvFLAGS(sv) &
3537 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3538 == (SVs_OBJECT|SVs_SMG))
3539 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3540 const regexp *re = (regexp *)mg->mg_obj;
3543 const char *fptr = "msix";
3548 char need_newline = 0;
3549 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3551 while((ch = *fptr++)) {
3553 reflags[left++] = ch;
3556 reflags[right--] = ch;
3561 reflags[left] = '-';
3565 mg->mg_len = re->prelen + 4 + left;
3567 * If /x was used, we have to worry about a regex
3568 * ending with a comment later being embedded
3569 * within another regex. If so, we don't want this
3570 * regex's "commentization" to leak out to the
3571 * right part of the enclosing regex, we must cap
3572 * it with a newline.
3574 * So, if /x was used, we scan backwards from the
3575 * end of the regex. If we find a '#' before we
3576 * find a newline, we need to add a newline
3577 * ourself. If we find a '\n' first (or if we
3578 * don't find '#' or '\n'), we don't need to add
3579 * anything. -jfriedl
3581 if (PMf_EXTENDED & re->reganch)
3583 const char *endptr = re->precomp + re->prelen;
3584 while (endptr >= re->precomp)
3586 const char c = *(endptr--);
3588 break; /* don't need another */
3590 /* we end while in a comment, so we
3592 mg->mg_len++; /* save space for it */
3593 need_newline = 1; /* note to add it */
3599 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3600 Copy("(?", mg->mg_ptr, 2, char);
3601 Copy(reflags, mg->mg_ptr+2, left, char);
3602 Copy(":", mg->mg_ptr+left+2, 1, char);
3603 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3605 mg->mg_ptr[mg->mg_len - 2] = '\n';
3606 mg->mg_ptr[mg->mg_len - 1] = ')';
3607 mg->mg_ptr[mg->mg_len] = 0;
3609 PL_reginterp_cnt += re->program[0].next_off;
3611 if (re->reganch & ROPT_UTF8)
3626 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3627 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3628 /* tied lvalues should appear to be
3629 * scalars for backwards compatitbility */
3630 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3631 ? "SCALAR" : "LVALUE"; break;
3632 case SVt_PVAV: typestr = "ARRAY"; break;
3633 case SVt_PVHV: typestr = "HASH"; break;
3634 case SVt_PVCV: typestr = "CODE"; break;
3635 case SVt_PVGV: typestr = "GLOB"; break;
3636 case SVt_PVFM: typestr = "FORMAT"; break;
3637 case SVt_PVIO: typestr = "IO"; break;
3638 default: typestr = "UNKNOWN"; break;
3642 const char *name = HvNAME(SvSTASH(sv));
3643 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3644 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3647 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3650 *lp = strlen(typestr);
3651 return (char *)typestr;
3653 if (SvREADONLY(sv) && !SvOK(sv)) {
3654 if (ckWARN(WARN_UNINITIALIZED))
3660 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3661 /* I'm assuming that if both IV and NV are equally valid then
3662 converting the IV is going to be more efficient */
3663 const U32 isIOK = SvIOK(sv);
3664 const U32 isUIOK = SvIsUV(sv);
3665 char buf[TYPE_CHARS(UV)];
3668 if (SvTYPE(sv) < SVt_PVIV)
3669 sv_upgrade(sv, SVt_PVIV);
3671 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3673 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3674 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3675 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3676 SvCUR_set(sv, ebuf - ptr);
3686 else if (SvNOKp(sv)) {
3687 if (SvTYPE(sv) < SVt_PVNV)
3688 sv_upgrade(sv, SVt_PVNV);
3689 /* The +20 is pure guesswork. Configure test needed. --jhi */
3690 SvGROW(sv, NV_DIG + 20);
3692 olderrno = errno; /* some Xenix systems wipe out errno here */
3694 if (SvNVX(sv) == 0.0)
3695 (void)strcpy(s,"0");
3699 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3702 #ifdef FIXNEGATIVEZERO
3703 if (*s == '-' && s[1] == '0' && !s[2])
3713 if (ckWARN(WARN_UNINITIALIZED)
3714 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3717 if (SvTYPE(sv) < SVt_PV)
3718 /* Typically the caller expects that sv_any is not NULL now. */
3719 sv_upgrade(sv, SVt_PV);
3722 *lp = s - SvPVX(sv);
3725 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3726 PTR2UV(sv),SvPVX(sv)));
3730 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3731 /* Sneaky stuff here */
3735 tsv = newSVpv(tmpbuf, 0);
3751 len = strlen(tmpbuf);
3753 #ifdef FIXNEGATIVEZERO
3754 if (len == 2 && t[0] == '-' && t[1] == '0') {
3759 (void)SvUPGRADE(sv, SVt_PV);
3761 s = SvGROW(sv, len + 1);
3764 return strcpy(s, t);
3769 =for apidoc sv_copypv
3771 Copies a stringified representation of the source SV into the
3772 destination SV. Automatically performs any necessary mg_get and
3773 coercion of numeric values into strings. Guaranteed to preserve
3774 UTF-8 flag even from overloaded objects. Similar in nature to
3775 sv_2pv[_flags] but operates directly on an SV instead of just the
3776 string. Mostly uses sv_2pv_flags to do its work, except when that
3777 would lose the UTF-8'ness of the PV.
3783 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3788 sv_setpvn(dsv,s,len);
3796 =for apidoc sv_2pvbyte_nolen
3798 Return a pointer to the byte-encoded representation of the SV.
3799 May cause the SV to be downgraded from UTF-8 as a side-effect.
3801 Usually accessed via the C<SvPVbyte_nolen> macro.
3807 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3810 return sv_2pvbyte(sv, &n_a);
3814 =for apidoc sv_2pvbyte
3816 Return a pointer to the byte-encoded representation of the SV, and set *lp
3817 to its length. May cause the SV to be downgraded from UTF-8 as a
3820 Usually accessed via the C<SvPVbyte> macro.
3826 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3828 sv_utf8_downgrade(sv,0);
3829 return SvPV(sv,*lp);
3833 =for apidoc sv_2pvutf8_nolen
3835 Return a pointer to the UTF-8-encoded representation of the SV.
3836 May cause the SV to be upgraded to UTF-8 as a side-effect.
3838 Usually accessed via the C<SvPVutf8_nolen> macro.
3844 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3847 return sv_2pvutf8(sv, &n_a);
3851 =for apidoc sv_2pvutf8
3853 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3854 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3856 Usually accessed via the C<SvPVutf8> macro.
3862 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3864 sv_utf8_upgrade(sv);
3865 return SvPV(sv,*lp);
3869 =for apidoc sv_2bool
3871 This function is only called on magical items, and is only used by
3872 sv_true() or its macro equivalent.
3878 Perl_sv_2bool(pTHX_ register SV *sv)
3887 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3888 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3889 return (bool)SvTRUE(tmpsv);
3890 return SvRV(sv) != 0;
3893 register XPV* Xpvtmp;
3894 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3895 (*Xpvtmp->xpv_pv > '0' ||
3896 Xpvtmp->xpv_cur > 1 ||
3897 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3904 return SvIVX(sv) != 0;
3907 return SvNVX(sv) != 0.0;
3914 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3915 * this function provided for binary compatibility only
3920 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3922 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3926 =for apidoc sv_utf8_upgrade
3928 Converts the PV of an SV to its UTF-8-encoded form.
3929 Forces the SV to string form if it is not already.
3930 Always sets the SvUTF8 flag to avoid future validity checks even
3931 if all the bytes have hibit clear.
3933 This is not as a general purpose byte encoding to Unicode interface:
3934 use the Encode extension for that.
3936 =for apidoc sv_utf8_upgrade_flags
3938 Converts the PV of an SV to its UTF-8-encoded form.
3939 Forces the SV to string form if it is not already.
3940 Always sets the SvUTF8 flag to avoid future validity checks even
3941 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3942 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3943 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3945 This is not as a general purpose byte encoding to Unicode interface:
3946 use the Encode extension for that.
3952 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3957 if (sv == &PL_sv_undef)
3961 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3962 (void) sv_2pv_flags(sv,&len, flags);
3966 (void) SvPV_force(sv,len);
3975 sv_force_normal_flags(sv, 0);
3978 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3979 sv_recode_to_utf8(sv, PL_encoding);
3980 else { /* Assume Latin-1/EBCDIC */
3981 /* This function could be much more efficient if we
3982 * had a FLAG in SVs to signal if there are any hibit
3983 * chars in the PV. Given that there isn't such a flag
3984 * make the loop as fast as possible. */
3985 s = (U8 *) SvPVX(sv);
3986 e = (U8 *) SvEND(sv);
3990 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3995 (void)SvOOK_off(sv);
3997 len = SvCUR(sv) + 1; /* Plus the \0 */
3998 SvPV_set(sv, (char*)bytes_to_utf8((U8*)s, &len));
3999 SvCUR_set(sv, len - 1);
4001 Safefree(s); /* No longer using what was there before. */
4002 SvLEN_set(sv, len); /* No longer know the real size. */
4004 /* Mark as UTF-8 even if no hibit - saves scanning loop */
4011 =for apidoc sv_utf8_downgrade
4013 Attempts to convert the PV of an SV from characters to bytes.
4014 If the PV contains a character beyond byte, this conversion will fail;
4015 in this case, either returns false or, if C<fail_ok> is not
4018 This is not as a general purpose Unicode to byte encoding interface:
4019 use the Encode extension for that.
4025 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
4027 if (SvPOKp(sv) && SvUTF8(sv)) {
4033 sv_force_normal_flags(sv, 0);
4035 s = (U8 *) SvPV(sv, len);
4036 if (!utf8_to_bytes(s, &len)) {
4041 Perl_croak(aTHX_ "Wide character in %s",
4044 Perl_croak(aTHX_ "Wide character");
4055 =for apidoc sv_utf8_encode
4057 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
4058 flag off so that it looks like octets again.
4064 Perl_sv_utf8_encode(pTHX_ register SV *sv)
4066 (void) sv_utf8_upgrade(sv);
4068 sv_force_normal_flags(sv, 0);
4070 if (SvREADONLY(sv)) {
4071 Perl_croak(aTHX_ PL_no_modify);
4077 =for apidoc sv_utf8_decode
4079 If the PV of the SV is an octet sequence in UTF-8
4080 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
4081 so that it looks like a character. If the PV contains only single-byte
4082 characters, the C<SvUTF8> flag stays being off.
4083 Scans PV for validity and returns false if the PV is invalid UTF-8.
4089 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4095 /* The octets may have got themselves encoded - get them back as
4098 if (!sv_utf8_downgrade(sv, TRUE))
4101 /* it is actually just a matter of turning the utf8 flag on, but
4102 * we want to make sure everything inside is valid utf8 first.
4104 c = (U8 *) SvPVX(sv);
4105 if (!is_utf8_string(c, SvCUR(sv)+1))
4107 e = (U8 *) SvEND(sv);
4110 if (!UTF8_IS_INVARIANT(ch)) {
4119 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4120 * this function provided for binary compatibility only
4124 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4126 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4130 =for apidoc sv_setsv
4132 Copies the contents of the source SV C<ssv> into the destination SV
4133 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4134 function if the source SV needs to be reused. Does not handle 'set' magic.
4135 Loosely speaking, it performs a copy-by-value, obliterating any previous
4136 content of the destination.
4138 You probably want to use one of the assortment of wrappers, such as
4139 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4140 C<SvSetMagicSV_nosteal>.
4142 =for apidoc sv_setsv_flags
4144 Copies the contents of the source SV C<ssv> into the destination SV
4145 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4146 function if the source SV needs to be reused. Does not handle 'set' magic.
4147 Loosely speaking, it performs a copy-by-value, obliterating any previous
4148 content of the destination.
4149 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4150 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4151 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4152 and C<sv_setsv_nomg> are implemented in terms of this function.
4154 You probably want to use one of the assortment of wrappers, such as
4155 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4156 C<SvSetMagicSV_nosteal>.
4158 This is the primary function for copying scalars, and most other
4159 copy-ish functions and macros use this underneath.
4165 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4167 register U32 sflags;
4173 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4175 sstr = &PL_sv_undef;
4176 stype = SvTYPE(sstr);
4177 dtype = SvTYPE(dstr);
4182 /* need to nuke the magic */
4184 SvRMAGICAL_off(dstr);
4187 /* There's a lot of redundancy below but we're going for speed here */
4192 if (dtype != SVt_PVGV) {
4193 (void)SvOK_off(dstr);
4201 sv_upgrade(dstr, SVt_IV);
4204 sv_upgrade(dstr, SVt_PVNV);
4208 sv_upgrade(dstr, SVt_PVIV);
4211 (void)SvIOK_only(dstr);
4212 SvIV_set(dstr, SvIVX(sstr));
4215 if (SvTAINTED(sstr))
4226 sv_upgrade(dstr, SVt_NV);
4231 sv_upgrade(dstr, SVt_PVNV);
4234 SvNV_set(dstr, SvNVX(sstr));
4235 (void)SvNOK_only(dstr);
4236 if (SvTAINTED(sstr))
4244 sv_upgrade(dstr, SVt_RV);
4245 else if (dtype == SVt_PVGV &&
4246 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4249 if (GvIMPORTED(dstr) != GVf_IMPORTED
4250 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4252 GvIMPORTED_on(dstr);
4261 #ifdef PERL_COPY_ON_WRITE
4262 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4263 if (dtype < SVt_PVIV)
4264 sv_upgrade(dstr, SVt_PVIV);
4271 sv_upgrade(dstr, SVt_PV);
4274 if (dtype < SVt_PVIV)
4275 sv_upgrade(dstr, SVt_PVIV);
4278 if (dtype < SVt_PVNV)
4279 sv_upgrade(dstr, SVt_PVNV);
4286 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
4289 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
4293 if (dtype <= SVt_PVGV) {
4295 if (dtype != SVt_PVGV) {
4296 char *name = GvNAME(sstr);
4297 STRLEN len = GvNAMELEN(sstr);
4298 /* don't upgrade SVt_PVLV: it can hold a glob */
4299 if (dtype != SVt_PVLV)
4300 sv_upgrade(dstr, SVt_PVGV);
4301 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4302 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4303 GvNAME(dstr) = savepvn(name, len);
4304 GvNAMELEN(dstr) = len;
4305 SvFAKE_on(dstr); /* can coerce to non-glob */
4307 /* ahem, death to those who redefine active sort subs */
4308 else if (PL_curstackinfo->si_type == PERLSI_SORT
4309 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4310 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4313 #ifdef GV_UNIQUE_CHECK
4314 if (GvUNIQUE((GV*)dstr)) {
4315 Perl_croak(aTHX_ PL_no_modify);
4319 (void)SvOK_off(dstr);
4320 GvINTRO_off(dstr); /* one-shot flag */
4322 GvGP(dstr) = gp_ref(GvGP(sstr));
4323 if (SvTAINTED(sstr))
4325 if (GvIMPORTED(dstr) != GVf_IMPORTED
4326 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4328 GvIMPORTED_on(dstr);
4336 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4338 if ((int)SvTYPE(sstr) != stype) {
4339 stype = SvTYPE(sstr);
4340 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4344 if (stype == SVt_PVLV)
4345 (void)SvUPGRADE(dstr, SVt_PVNV);
4347 (void)SvUPGRADE(dstr, (U32)stype);
4350 sflags = SvFLAGS(sstr);
4352 if (sflags & SVf_ROK) {
4353 if (dtype >= SVt_PV) {
4354 if (dtype == SVt_PVGV) {
4355 SV *sref = SvREFCNT_inc(SvRV(sstr));
4357 int intro = GvINTRO(dstr);
4359 #ifdef GV_UNIQUE_CHECK
4360 if (GvUNIQUE((GV*)dstr)) {
4361 Perl_croak(aTHX_ PL_no_modify);
4366 GvINTRO_off(dstr); /* one-shot flag */
4367 GvLINE(dstr) = CopLINE(PL_curcop);
4368 GvEGV(dstr) = (GV*)dstr;
4371 switch (SvTYPE(sref)) {
4374 SAVEGENERICSV(GvAV(dstr));
4376 dref = (SV*)GvAV(dstr);
4377 GvAV(dstr) = (AV*)sref;
4378 if (!GvIMPORTED_AV(dstr)
4379 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4381 GvIMPORTED_AV_on(dstr);
4386 SAVEGENERICSV(GvHV(dstr));
4388 dref = (SV*)GvHV(dstr);
4389 GvHV(dstr) = (HV*)sref;
4390 if (!GvIMPORTED_HV(dstr)
4391 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4393 GvIMPORTED_HV_on(dstr);
4398 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4399 SvREFCNT_dec(GvCV(dstr));
4400 GvCV(dstr) = Nullcv;
4401 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4402 PL_sub_generation++;
4404 SAVEGENERICSV(GvCV(dstr));
4407 dref = (SV*)GvCV(dstr);
4408 if (GvCV(dstr) != (CV*)sref) {
4409 CV* cv = GvCV(dstr);
4411 if (!GvCVGEN((GV*)dstr) &&
4412 (CvROOT(cv) || CvXSUB(cv)))
4414 /* ahem, death to those who redefine
4415 * active sort subs */
4416 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4417 PL_sortcop == CvSTART(cv))
4419 "Can't redefine active sort subroutine %s",
4420 GvENAME((GV*)dstr));
4421 /* Redefining a sub - warning is mandatory if
4422 it was a const and its value changed. */
4423 if (ckWARN(WARN_REDEFINE)
4425 && (!CvCONST((CV*)sref)
4426 || sv_cmp(cv_const_sv(cv),
4427 cv_const_sv((CV*)sref)))))
4429 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4431 ? "Constant subroutine %s::%s redefined"
4432 : "Subroutine %s::%s redefined",
4433 HvNAME(GvSTASH((GV*)dstr)),
4434 GvENAME((GV*)dstr));
4438 cv_ckproto(cv, (GV*)dstr,
4439 SvPOK(sref) ? SvPVX(sref) : Nullch);
4441 GvCV(dstr) = (CV*)sref;
4442 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4443 GvASSUMECV_on(dstr);
4444 PL_sub_generation++;
4446 if (!GvIMPORTED_CV(dstr)
4447 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4449 GvIMPORTED_CV_on(dstr);
4454 SAVEGENERICSV(GvIOp(dstr));
4456 dref = (SV*)GvIOp(dstr);
4457 GvIOp(dstr) = (IO*)sref;
4461 SAVEGENERICSV(GvFORM(dstr));
4463 dref = (SV*)GvFORM(dstr);
4464 GvFORM(dstr) = (CV*)sref;
4468 SAVEGENERICSV(GvSV(dstr));
4470 dref = (SV*)GvSV(dstr);
4472 if (!GvIMPORTED_SV(dstr)
4473 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4475 GvIMPORTED_SV_on(dstr);
4481 if (SvTAINTED(sstr))
4486 (void)SvOOK_off(dstr); /* backoff */
4488 Safefree(SvPVX(dstr));
4493 (void)SvOK_off(dstr);
4494 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4496 if (sflags & SVp_NOK) {
4498 /* Only set the public OK flag if the source has public OK. */
4499 if (sflags & SVf_NOK)
4500 SvFLAGS(dstr) |= SVf_NOK;
4501 SvNV_set(dstr, SvNVX(sstr));
4503 if (sflags & SVp_IOK) {
4504 (void)SvIOKp_on(dstr);
4505 if (sflags & SVf_IOK)
4506 SvFLAGS(dstr) |= SVf_IOK;
4507 if (sflags & SVf_IVisUV)
4509 SvIV_set(dstr, SvIVX(sstr));
4511 if (SvAMAGIC(sstr)) {
4515 else if (sflags & SVp_POK) {
4519 * Check to see if we can just swipe the string. If so, it's a
4520 * possible small lose on short strings, but a big win on long ones.
4521 * It might even be a win on short strings if SvPVX(dstr)
4522 * has to be allocated and SvPVX(sstr) has to be freed.
4525 /* Whichever path we take through the next code, we want this true,
4526 and doing it now facilitates the COW check. */
4527 (void)SvPOK_only(dstr);
4530 #ifdef PERL_COPY_ON_WRITE
4531 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4535 (sflags & SVs_TEMP) && /* slated for free anyway? */
4536 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4537 (!(flags & SV_NOSTEAL)) &&
4538 /* and we're allowed to steal temps */
4539 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4540 SvLEN(sstr) && /* and really is a string */
4541 /* and won't be needed again, potentially */
4542 !(PL_op && PL_op->op_type == OP_AASSIGN))
4543 #ifdef PERL_COPY_ON_WRITE
4544 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4545 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4546 && SvTYPE(sstr) >= SVt_PVIV)
4549 /* Failed the swipe test, and it's not a shared hash key either.
4550 Have to copy the string. */
4551 STRLEN len = SvCUR(sstr);
4552 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4553 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4554 SvCUR_set(dstr, len);
4555 *SvEND(dstr) = '\0';
4557 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4559 #ifdef PERL_COPY_ON_WRITE
4560 /* Either it's a shared hash key, or it's suitable for
4561 copy-on-write or we can swipe the string. */
4563 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4568 /* I believe I should acquire a global SV mutex if
4569 it's a COW sv (not a shared hash key) to stop
4570 it going un copy-on-write.
4571 If the source SV has gone un copy on write between up there
4572 and down here, then (assert() that) it is of the correct
4573 form to make it copy on write again */
4574 if ((sflags & (SVf_FAKE | SVf_READONLY))
4575 != (SVf_FAKE | SVf_READONLY)) {
4576 SvREADONLY_on(sstr);
4578 /* Make the source SV into a loop of 1.
4579 (about to become 2) */
4580 SV_COW_NEXT_SV_SET(sstr, sstr);
4584 /* Initial code is common. */
4585 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4587 SvFLAGS(dstr) &= ~SVf_OOK;
4588 Safefree(SvPVX(dstr) - SvIVX(dstr));
4590 else if (SvLEN(dstr))
4591 Safefree(SvPVX(dstr));
4594 #ifdef PERL_COPY_ON_WRITE
4596 /* making another shared SV. */
4597 STRLEN cur = SvCUR(sstr);
4598 STRLEN len = SvLEN(sstr);
4599 assert (SvTYPE(dstr) >= SVt_PVIV);
4601 /* SvIsCOW_normal */
4602 /* splice us in between source and next-after-source. */
4603 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4604 SV_COW_NEXT_SV_SET(sstr, dstr);
4605 SvPV_set(dstr, SvPVX(sstr));
4607 /* SvIsCOW_shared_hash */
4608 UV hash = SvUVX(sstr);
4609 DEBUG_C(PerlIO_printf(Perl_debug_log,
4610 "Copy on write: Sharing hash\n"));
4612 sharepvn(SvPVX(sstr),
4613 (sflags & SVf_UTF8?-cur:cur), hash));
4614 SvUV_set(dstr, hash);
4618 SvREADONLY_on(dstr);
4620 /* Relesase a global SV mutex. */
4624 { /* Passes the swipe test. */
4625 SvPV_set(dstr, SvPVX(sstr));
4626 SvLEN_set(dstr, SvLEN(sstr));
4627 SvCUR_set(dstr, SvCUR(sstr));
4630 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4631 SvPV_set(sstr, Nullch);
4637 if (sflags & SVf_UTF8)
4640 if (sflags & SVp_NOK) {
4642 if (sflags & SVf_NOK)
4643 SvFLAGS(dstr) |= SVf_NOK;
4644 SvNV_set(dstr, SvNVX(sstr));
4646 if (sflags & SVp_IOK) {
4647 (void)SvIOKp_on(dstr);
4648 if (sflags & SVf_IOK)
4649 SvFLAGS(dstr) |= SVf_IOK;
4650 if (sflags & SVf_IVisUV)
4652 SvIV_set(dstr, SvIVX(sstr));
4655 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4656 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4657 smg->mg_ptr, smg->mg_len);
4658 SvRMAGICAL_on(dstr);
4661 else if (sflags & SVp_IOK) {
4662 if (sflags & SVf_IOK)
4663 (void)SvIOK_only(dstr);
4665 (void)SvOK_off(dstr);
4666 (void)SvIOKp_on(dstr);
4668 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4669 if (sflags & SVf_IVisUV)
4671 SvIV_set(dstr, SvIVX(sstr));
4672 if (sflags & SVp_NOK) {
4673 if (sflags & SVf_NOK)
4674 (void)SvNOK_on(dstr);
4676 (void)SvNOKp_on(dstr);
4677 SvNV_set(dstr, SvNVX(sstr));
4680 else if (sflags & SVp_NOK) {
4681 if (sflags & SVf_NOK)
4682 (void)SvNOK_only(dstr);
4684 (void)SvOK_off(dstr);
4687 SvNV_set(dstr, SvNVX(sstr));
4690 if (dtype == SVt_PVGV) {
4691 if (ckWARN(WARN_MISC))
4692 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4695 (void)SvOK_off(dstr);
4697 if (SvTAINTED(sstr))
4702 =for apidoc sv_setsv_mg
4704 Like C<sv_setsv>, but also handles 'set' magic.
4710 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4712 sv_setsv(dstr,sstr);
4716 #ifdef PERL_COPY_ON_WRITE
4718 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4720 STRLEN cur = SvCUR(sstr);
4721 STRLEN len = SvLEN(sstr);
4722 register char *new_pv;
4725 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4733 if (SvTHINKFIRST(dstr))
4734 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4735 else if (SvPVX(dstr))
4736 Safefree(SvPVX(dstr));
4740 (void)SvUPGRADE (dstr, SVt_PVIV);
4742 assert (SvPOK(sstr));
4743 assert (SvPOKp(sstr));
4744 assert (!SvIOK(sstr));
4745 assert (!SvIOKp(sstr));
4746 assert (!SvNOK(sstr));
4747 assert (!SvNOKp(sstr));
4749 if (SvIsCOW(sstr)) {
4751 if (SvLEN(sstr) == 0) {
4752 /* source is a COW shared hash key. */
4753 UV hash = SvUVX(sstr);
4754 DEBUG_C(PerlIO_printf(Perl_debug_log,
4755 "Fast copy on write: Sharing hash\n"));
4756 SvUV_set(dstr, hash);
4757 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4760 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4762 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4763 (void)SvUPGRADE (sstr, SVt_PVIV);
4764 SvREADONLY_on(sstr);
4766 DEBUG_C(PerlIO_printf(Perl_debug_log,
4767 "Fast copy on write: Converting sstr to COW\n"));
4768 SV_COW_NEXT_SV_SET(dstr, sstr);
4770 SV_COW_NEXT_SV_SET(sstr, dstr);
4771 new_pv = SvPVX(sstr);
4774 SvPV_set(dstr, new_pv);
4775 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4788 =for apidoc sv_setpvn
4790 Copies a string into an SV. The C<len> parameter indicates the number of
4791 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4792 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4798 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4800 register char *dptr;
4802 SV_CHECK_THINKFIRST_COW_DROP(sv);
4808 /* len is STRLEN which is unsigned, need to copy to signed */
4811 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4813 (void)SvUPGRADE(sv, SVt_PV);
4815 SvGROW(sv, len + 1);
4817 Move(ptr,dptr,len,char);
4820 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4825 =for apidoc sv_setpvn_mg
4827 Like C<sv_setpvn>, but also handles 'set' magic.
4833 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4835 sv_setpvn(sv,ptr,len);
4840 =for apidoc sv_setpv
4842 Copies a string into an SV. The string must be null-terminated. Does not
4843 handle 'set' magic. See C<sv_setpv_mg>.
4849 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4851 register STRLEN len;
4853 SV_CHECK_THINKFIRST_COW_DROP(sv);
4859 (void)SvUPGRADE(sv, SVt_PV);
4861 SvGROW(sv, len + 1);
4862 Move(ptr,SvPVX(sv),len+1,char);
4864 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4869 =for apidoc sv_setpv_mg
4871 Like C<sv_setpv>, but also handles 'set' magic.
4877 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4884 =for apidoc sv_usepvn
4886 Tells an SV to use C<ptr> to find its string value. Normally the string is
4887 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4888 The C<ptr> should point to memory that was allocated by C<malloc>. The
4889 string length, C<len>, must be supplied. This function will realloc the
4890 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4891 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4892 See C<sv_usepvn_mg>.
4898 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4900 SV_CHECK_THINKFIRST_COW_DROP(sv);
4901 (void)SvUPGRADE(sv, SVt_PV);
4906 (void)SvOOK_off(sv);
4907 if (SvPVX(sv) && SvLEN(sv))
4908 Safefree(SvPVX(sv));
4909 Renew(ptr, len+1, char);
4912 SvLEN_set(sv, len+1);
4914 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4919 =for apidoc sv_usepvn_mg
4921 Like C<sv_usepvn>, but also handles 'set' magic.
4927 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4929 sv_usepvn(sv,ptr,len);
4933 #ifdef PERL_COPY_ON_WRITE
4934 /* Need to do this *after* making the SV normal, as we need the buffer
4935 pointer to remain valid until after we've copied it. If we let go too early,
4936 another thread could invalidate it by unsharing last of the same hash key
4937 (which it can do by means other than releasing copy-on-write Svs)
4938 or by changing the other copy-on-write SVs in the loop. */
4940 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4941 U32 hash, SV *after)
4943 if (len) { /* this SV was SvIsCOW_normal(sv) */
4944 /* we need to find the SV pointing to us. */
4945 SV *current = SV_COW_NEXT_SV(after);
4947 if (current == sv) {
4948 /* The SV we point to points back to us (there were only two of us
4950 Hence other SV is no longer copy on write either. */
4952 SvREADONLY_off(after);
4954 /* We need to follow the pointers around the loop. */
4956 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4959 /* don't loop forever if the structure is bust, and we have
4960 a pointer into a closed loop. */
4961 assert (current != after);
4962 assert (SvPVX(current) == pvx);
4964 /* Make the SV before us point to the SV after us. */
4965 SV_COW_NEXT_SV_SET(current, after);
4968 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4973 Perl_sv_release_IVX(pTHX_ register SV *sv)
4976 sv_force_normal_flags(sv, 0);
4982 =for apidoc sv_force_normal_flags
4984 Undo various types of fakery on an SV: if the PV is a shared string, make
4985 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4986 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4987 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4988 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4989 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4990 set to some other value.) In addition, the C<flags> parameter gets passed to
4991 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4992 with flags set to 0.
4998 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
5000 #ifdef PERL_COPY_ON_WRITE
5001 if (SvREADONLY(sv)) {
5002 /* At this point I believe I should acquire a global SV mutex. */
5004 char *pvx = SvPVX(sv);
5005 STRLEN len = SvLEN(sv);
5006 STRLEN cur = SvCUR(sv);
5007 U32 hash = SvUVX(sv);
5008 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
5010 PerlIO_printf(Perl_debug_log,
5011 "Copy on write: Force normal %ld\n",
5017 /* This SV doesn't own the buffer, so need to New() a new one: */
5018 SvPV_set(sv, (char*)0);
5020 if (flags & SV_COW_DROP_PV) {
5021 /* OK, so we don't need to copy our buffer. */
5024 SvGROW(sv, cur + 1);
5025 Move(pvx,SvPVX(sv),cur,char);
5029 sv_release_COW(sv, pvx, cur, len, hash, next);
5034 else if (IN_PERL_RUNTIME)
5035 Perl_croak(aTHX_ PL_no_modify);
5036 /* At this point I believe that I can drop the global SV mutex. */
5039 if (SvREADONLY(sv)) {
5041 char *pvx = SvPVX(sv);
5042 int is_utf8 = SvUTF8(sv);
5043 STRLEN len = SvCUR(sv);
5044 U32 hash = SvUVX(sv);
5047 SvPV_set(sv, (char*)0);
5049 SvGROW(sv, len + 1);
5050 Move(pvx,SvPVX(sv),len,char);
5052 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
5054 else if (IN_PERL_RUNTIME)
5055 Perl_croak(aTHX_ PL_no_modify);
5059 sv_unref_flags(sv, flags);
5060 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
5065 =for apidoc sv_force_normal
5067 Undo various types of fakery on an SV: if the PV is a shared string, make
5068 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
5069 an xpvmg. See also C<sv_force_normal_flags>.
5075 Perl_sv_force_normal(pTHX_ register SV *sv)
5077 sv_force_normal_flags(sv, 0);
5083 Efficient removal of characters from the beginning of the string buffer.
5084 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5085 the string buffer. The C<ptr> becomes the first character of the adjusted
5086 string. Uses the "OOK hack".
5087 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
5088 refer to the same chunk of data.
5094 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
5096 register STRLEN delta;
5097 if (!ptr || !SvPOKp(sv))
5099 delta = ptr - SvPVX(sv);
5100 SV_CHECK_THINKFIRST(sv);
5101 if (SvTYPE(sv) < SVt_PVIV)
5102 sv_upgrade(sv,SVt_PVIV);
5105 if (!SvLEN(sv)) { /* make copy of shared string */
5106 char *pvx = SvPVX(sv);
5107 STRLEN len = SvCUR(sv);
5108 SvGROW(sv, len + 1);
5109 Move(pvx,SvPVX(sv),len,char);
5113 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5114 and we do that anyway inside the SvNIOK_off
5116 SvFLAGS(sv) |= SVf_OOK;
5119 SvLEN_set(sv, SvLEN(sv) - delta);
5120 SvCUR_set(sv, SvCUR(sv) - delta);
5121 SvPV_set(sv, SvPVX(sv) + delta);
5122 SvIV_set(sv, SvIVX(sv) + delta);
5125 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5126 * this function provided for binary compatibility only
5130 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5132 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5136 =for apidoc sv_catpvn
5138 Concatenates the string onto the end of the string which is in the SV. The
5139 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5140 status set, then the bytes appended should be valid UTF-8.
5141 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5143 =for apidoc sv_catpvn_flags
5145 Concatenates the string onto the end of the string which is in the SV. The
5146 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5147 status set, then the bytes appended should be valid UTF-8.
5148 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5149 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5150 in terms of this function.
5156 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5161 dstr = SvPV_force_flags(dsv, dlen, flags);
5162 SvGROW(dsv, dlen + slen + 1);
5165 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5166 SvCUR_set(dsv, SvCUR(dsv) + slen);
5168 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5173 =for apidoc sv_catpvn_mg
5175 Like C<sv_catpvn>, but also handles 'set' magic.
5181 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5183 sv_catpvn(sv,ptr,len);
5187 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5188 * this function provided for binary compatibility only
5192 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5194 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5198 =for apidoc sv_catsv
5200 Concatenates the string from SV C<ssv> onto the end of the string in
5201 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5202 not 'set' magic. See C<sv_catsv_mg>.
5204 =for apidoc sv_catsv_flags
5206 Concatenates the string from SV C<ssv> onto the end of the string in
5207 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5208 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5209 and C<sv_catsv_nomg> are implemented in terms of this function.
5214 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5220 if ((spv = SvPV(ssv, slen))) {
5221 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5222 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5223 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5224 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5225 dsv->sv_flags doesn't have that bit set.
5226 Andy Dougherty 12 Oct 2001
5228 I32 sutf8 = DO_UTF8(ssv);
5231 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5233 dutf8 = DO_UTF8(dsv);
5235 if (dutf8 != sutf8) {
5237 /* Not modifying source SV, so taking a temporary copy. */
5238 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5240 sv_utf8_upgrade(csv);
5241 spv = SvPV(csv, slen);
5244 sv_utf8_upgrade_nomg(dsv);
5246 sv_catpvn_nomg(dsv, spv, slen);
5251 =for apidoc sv_catsv_mg
5253 Like C<sv_catsv>, but also handles 'set' magic.
5259 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5266 =for apidoc sv_catpv
5268 Concatenates the string onto the end of the string which is in the SV.
5269 If the SV has the UTF-8 status set, then the bytes appended should be
5270 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5275 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5277 register STRLEN len;
5283 junk = SvPV_force(sv, tlen);
5285 SvGROW(sv, tlen + len + 1);
5288 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5289 SvCUR_set(sv, SvCUR(sv) + len);
5290 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5295 =for apidoc sv_catpv_mg
5297 Like C<sv_catpv>, but also handles 'set' magic.
5303 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5312 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5313 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5320 Perl_newSV(pTHX_ STRLEN len)
5326 sv_upgrade(sv, SVt_PV);
5327 SvGROW(sv, len + 1);
5332 =for apidoc sv_magicext
5334 Adds magic to an SV, upgrading it if necessary. Applies the
5335 supplied vtable and returns a pointer to the magic added.
5337 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5338 In particular, you can add magic to SvREADONLY SVs, and add more than
5339 one instance of the same 'how'.
5341 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5342 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5343 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5344 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5346 (This is now used as a subroutine by C<sv_magic>.)
5351 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5352 const char* name, I32 namlen)
5356 if (SvTYPE(sv) < SVt_PVMG) {
5357 (void)SvUPGRADE(sv, SVt_PVMG);
5359 Newz(702,mg, 1, MAGIC);
5360 mg->mg_moremagic = SvMAGIC(sv);
5361 SvMAGIC_set(sv, mg);
5363 /* Sometimes a magic contains a reference loop, where the sv and
5364 object refer to each other. To prevent a reference loop that
5365 would prevent such objects being freed, we look for such loops
5366 and if we find one we avoid incrementing the object refcount.
5368 Note we cannot do this to avoid self-tie loops as intervening RV must
5369 have its REFCNT incremented to keep it in existence.
5372 if (!obj || obj == sv ||
5373 how == PERL_MAGIC_arylen ||
5374 how == PERL_MAGIC_qr ||
5375 (SvTYPE(obj) == SVt_PVGV &&
5376 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5377 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5378 GvFORM(obj) == (CV*)sv)))
5383 mg->mg_obj = SvREFCNT_inc(obj);
5384 mg->mg_flags |= MGf_REFCOUNTED;
5387 /* Normal self-ties simply pass a null object, and instead of
5388 using mg_obj directly, use the SvTIED_obj macro to produce a
5389 new RV as needed. For glob "self-ties", we are tieing the PVIO
5390 with an RV obj pointing to the glob containing the PVIO. In
5391 this case, to avoid a reference loop, we need to weaken the
5395 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5396 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5402 mg->mg_len = namlen;
5405 mg->mg_ptr = savepvn(name, namlen);
5406 else if (namlen == HEf_SVKEY)
5407 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5409 mg->mg_ptr = (char *) name;
5411 mg->mg_virtual = vtable;
5415 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5420 =for apidoc sv_magic
5422 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5423 then adds a new magic item of type C<how> to the head of the magic list.
5425 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5426 handling of the C<name> and C<namlen> arguments.
5428 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5429 to add more than one instance of the same 'how'.
5435 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5437 const MGVTBL *vtable = 0;
5440 #ifdef PERL_COPY_ON_WRITE
5442 sv_force_normal_flags(sv, 0);
5444 if (SvREADONLY(sv)) {
5446 && how != PERL_MAGIC_regex_global
5447 && how != PERL_MAGIC_bm
5448 && how != PERL_MAGIC_fm
5449 && how != PERL_MAGIC_sv
5450 && how != PERL_MAGIC_backref
5453 Perl_croak(aTHX_ PL_no_modify);
5456 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5457 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5458 /* sv_magic() refuses to add a magic of the same 'how' as an
5461 if (how == PERL_MAGIC_taint)
5469 vtable = &PL_vtbl_sv;
5471 case PERL_MAGIC_overload:
5472 vtable = &PL_vtbl_amagic;
5474 case PERL_MAGIC_overload_elem:
5475 vtable = &PL_vtbl_amagicelem;
5477 case PERL_MAGIC_overload_table:
5478 vtable = &PL_vtbl_ovrld;
5481 vtable = &PL_vtbl_bm;
5483 case PERL_MAGIC_regdata:
5484 vtable = &PL_vtbl_regdata;
5486 case PERL_MAGIC_regdatum:
5487 vtable = &PL_vtbl_regdatum;
5489 case PERL_MAGIC_env:
5490 vtable = &PL_vtbl_env;
5493 vtable = &PL_vtbl_fm;
5495 case PERL_MAGIC_envelem:
5496 vtable = &PL_vtbl_envelem;
5498 case PERL_MAGIC_regex_global:
5499 vtable = &PL_vtbl_mglob;
5501 case PERL_MAGIC_isa:
5502 vtable = &PL_vtbl_isa;
5504 case PERL_MAGIC_isaelem:
5505 vtable = &PL_vtbl_isaelem;
5507 case PERL_MAGIC_nkeys:
5508 vtable = &PL_vtbl_nkeys;
5510 case PERL_MAGIC_dbfile:
5513 case PERL_MAGIC_dbline:
5514 vtable = &PL_vtbl_dbline;
5516 #ifdef USE_LOCALE_COLLATE
5517 case PERL_MAGIC_collxfrm:
5518 vtable = &PL_vtbl_collxfrm;
5520 #endif /* USE_LOCALE_COLLATE */
5521 case PERL_MAGIC_tied:
5522 vtable = &PL_vtbl_pack;
5524 case PERL_MAGIC_tiedelem:
5525 case PERL_MAGIC_tiedscalar:
5526 vtable = &PL_vtbl_packelem;
5529 vtable = &PL_vtbl_regexp;
5531 case PERL_MAGIC_sig:
5532 vtable = &PL_vtbl_sig;
5534 case PERL_MAGIC_sigelem:
5535 vtable = &PL_vtbl_sigelem;
5537 case PERL_MAGIC_taint:
5538 vtable = &PL_vtbl_taint;
5540 case PERL_MAGIC_uvar:
5541 vtable = &PL_vtbl_uvar;
5543 case PERL_MAGIC_vec:
5544 vtable = &PL_vtbl_vec;
5546 case PERL_MAGIC_vstring:
5549 case PERL_MAGIC_utf8:
5550 vtable = &PL_vtbl_utf8;
5552 case PERL_MAGIC_substr:
5553 vtable = &PL_vtbl_substr;
5555 case PERL_MAGIC_defelem:
5556 vtable = &PL_vtbl_defelem;
5558 case PERL_MAGIC_glob:
5559 vtable = &PL_vtbl_glob;
5561 case PERL_MAGIC_arylen:
5562 vtable = &PL_vtbl_arylen;
5564 case PERL_MAGIC_pos:
5565 vtable = &PL_vtbl_pos;
5567 case PERL_MAGIC_backref:
5568 vtable = &PL_vtbl_backref;
5570 case PERL_MAGIC_ext:
5571 /* Reserved for use by extensions not perl internals. */
5572 /* Useful for attaching extension internal data to perl vars. */
5573 /* Note that multiple extensions may clash if magical scalars */
5574 /* etc holding private data from one are passed to another. */
5577 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5580 /* Rest of work is done else where */
5581 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5584 case PERL_MAGIC_taint:
5587 case PERL_MAGIC_ext:
5588 case PERL_MAGIC_dbfile:
5595 =for apidoc sv_unmagic
5597 Removes all magic of type C<type> from an SV.
5603 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5607 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5610 for (mg = *mgp; mg; mg = *mgp) {
5611 if (mg->mg_type == type) {
5612 const MGVTBL* const vtbl = mg->mg_virtual;
5613 *mgp = mg->mg_moremagic;
5614 if (vtbl && vtbl->svt_free)
5615 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5616 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5618 Safefree(mg->mg_ptr);
5619 else if (mg->mg_len == HEf_SVKEY)
5620 SvREFCNT_dec((SV*)mg->mg_ptr);
5621 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5622 Safefree(mg->mg_ptr);
5624 if (mg->mg_flags & MGf_REFCOUNTED)
5625 SvREFCNT_dec(mg->mg_obj);
5629 mgp = &mg->mg_moremagic;
5633 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5640 =for apidoc sv_rvweaken
5642 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5643 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5644 push a back-reference to this RV onto the array of backreferences
5645 associated with that magic.
5651 Perl_sv_rvweaken(pTHX_ SV *sv)
5654 if (!SvOK(sv)) /* let undefs pass */
5657 Perl_croak(aTHX_ "Can't weaken a nonreference");
5658 else if (SvWEAKREF(sv)) {
5659 if (ckWARN(WARN_MISC))
5660 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5664 sv_add_backref(tsv, sv);
5670 /* Give tsv backref magic if it hasn't already got it, then push a
5671 * back-reference to sv onto the array associated with the backref magic.
5675 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5679 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5680 av = (AV*)mg->mg_obj;
5683 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5684 /* av now has a refcnt of 2, which avoids it getting freed
5685 * before us during global cleanup. The extra ref is removed
5686 * by magic_killbackrefs() when tsv is being freed */
5688 if (AvFILLp(av) >= AvMAX(av)) {
5690 SV **svp = AvARRAY(av);
5691 for (i = AvFILLp(av); i >= 0; i--)
5693 svp[i] = sv; /* reuse the slot */
5696 av_extend(av, AvFILLp(av)+1);
5698 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5701 /* delete a back-reference to ourselves from the backref magic associated
5702 * with the SV we point to.
5706 S_sv_del_backref(pTHX_ SV *sv)
5713 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5714 Perl_croak(aTHX_ "panic: del_backref");
5715 av = (AV *)mg->mg_obj;
5717 for (i = AvFILLp(av); i >= 0; i--)
5718 if (svp[i] == sv) svp[i] = Nullsv;
5722 =for apidoc sv_insert
5724 Inserts a string at the specified offset/length within the SV. Similar to
5725 the Perl substr() function.
5731 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5735 register char *midend;
5736 register char *bigend;
5742 Perl_croak(aTHX_ "Can't modify non-existent substring");
5743 SvPV_force(bigstr, curlen);
5744 (void)SvPOK_only_UTF8(bigstr);
5745 if (offset + len > curlen) {
5746 SvGROW(bigstr, offset+len+1);
5747 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5748 SvCUR_set(bigstr, offset+len);
5752 i = littlelen - len;
5753 if (i > 0) { /* string might grow */
5754 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5755 mid = big + offset + len;
5756 midend = bigend = big + SvCUR(bigstr);
5759 while (midend > mid) /* shove everything down */
5760 *--bigend = *--midend;
5761 Move(little,big+offset,littlelen,char);
5762 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5767 Move(little,SvPVX(bigstr)+offset,len,char);
5772 big = SvPVX(bigstr);
5775 bigend = big + SvCUR(bigstr);
5777 if (midend > bigend)
5778 Perl_croak(aTHX_ "panic: sv_insert");
5780 if (mid - big > bigend - midend) { /* faster to shorten from end */
5782 Move(little, mid, littlelen,char);
5785 i = bigend - midend;
5787 Move(midend, mid, i,char);
5791 SvCUR_set(bigstr, mid - big);
5794 else if ((i = mid - big)) { /* faster from front */
5795 midend -= littlelen;
5797 sv_chop(bigstr,midend-i);
5802 Move(little, mid, littlelen,char);
5804 else if (littlelen) {
5805 midend -= littlelen;
5806 sv_chop(bigstr,midend);
5807 Move(little,midend,littlelen,char);
5810 sv_chop(bigstr,midend);
5816 =for apidoc sv_replace
5818 Make the first argument a copy of the second, then delete the original.
5819 The target SV physically takes over ownership of the body of the source SV
5820 and inherits its flags; however, the target keeps any magic it owns,
5821 and any magic in the source is discarded.
5822 Note that this is a rather specialist SV copying operation; most of the
5823 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5829 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5831 U32 refcnt = SvREFCNT(sv);
5832 SV_CHECK_THINKFIRST_COW_DROP(sv);
5833 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5834 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5835 if (SvMAGICAL(sv)) {
5839 sv_upgrade(nsv, SVt_PVMG);
5840 SvMAGIC_set(nsv, SvMAGIC(sv));
5841 SvFLAGS(nsv) |= SvMAGICAL(sv);
5843 SvMAGIC_set(sv, NULL);
5847 assert(!SvREFCNT(sv));
5848 #ifdef DEBUG_LEAKING_SCALARS
5849 sv->sv_flags = nsv->sv_flags;
5850 sv->sv_any = nsv->sv_any;
5851 sv->sv_refcnt = nsv->sv_refcnt;
5853 StructCopy(nsv,sv,SV);
5856 #ifdef PERL_COPY_ON_WRITE
5857 if (SvIsCOW_normal(nsv)) {
5858 /* We need to follow the pointers around the loop to make the
5859 previous SV point to sv, rather than nsv. */
5862 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5865 assert(SvPVX(current) == SvPVX(nsv));
5867 /* Make the SV before us point to the SV after us. */
5869 PerlIO_printf(Perl_debug_log, "previous is\n");
5871 PerlIO_printf(Perl_debug_log,
5872 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5873 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5875 SV_COW_NEXT_SV_SET(current, sv);
5878 SvREFCNT(sv) = refcnt;
5879 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5885 =for apidoc sv_clear
5887 Clear an SV: call any destructors, free up any memory used by the body,
5888 and free the body itself. The SV's head is I<not> freed, although
5889 its type is set to all 1's so that it won't inadvertently be assumed
5890 to be live during global destruction etc.
5891 This function should only be called when REFCNT is zero. Most of the time
5892 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5899 Perl_sv_clear(pTHX_ register SV *sv)
5903 assert(SvREFCNT(sv) == 0);
5906 if (PL_defstash) { /* Still have a symbol table? */
5913 stash = SvSTASH(sv);
5914 destructor = StashHANDLER(stash,DESTROY);
5916 SV* tmpref = newRV(sv);
5917 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5919 PUSHSTACKi(PERLSI_DESTROY);
5924 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5930 if(SvREFCNT(tmpref) < 2) {
5931 /* tmpref is not kept alive! */
5933 SvRV_set(tmpref, NULL);
5936 SvREFCNT_dec(tmpref);
5938 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5942 if (PL_in_clean_objs)
5943 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5945 /* DESTROY gave object new lease on life */
5951 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5952 SvOBJECT_off(sv); /* Curse the object. */
5953 if (SvTYPE(sv) != SVt_PVIO)
5954 --PL_sv_objcount; /* XXX Might want something more general */
5957 if (SvTYPE(sv) >= SVt_PVMG) {
5960 if (SvFLAGS(sv) & SVpad_TYPED)
5961 SvREFCNT_dec(SvSTASH(sv));
5964 switch (SvTYPE(sv)) {
5967 IoIFP(sv) != PerlIO_stdin() &&
5968 IoIFP(sv) != PerlIO_stdout() &&
5969 IoIFP(sv) != PerlIO_stderr())
5971 io_close((IO*)sv, FALSE);
5973 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5974 PerlDir_close(IoDIRP(sv));
5975 IoDIRP(sv) = (DIR*)NULL;
5976 Safefree(IoTOP_NAME(sv));
5977 Safefree(IoFMT_NAME(sv));
5978 Safefree(IoBOTTOM_NAME(sv));
5993 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5994 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5995 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5996 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5998 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5999 SvREFCNT_dec(LvTARG(sv));
6003 Safefree(GvNAME(sv));
6004 /* cannot decrease stash refcount yet, as we might recursively delete
6005 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
6006 of stash until current sv is completely gone.
6007 -- JohnPC, 27 Mar 1998 */
6008 stash = GvSTASH(sv);
6022 SvREFCNT_dec(SvRV(sv));
6024 #ifdef PERL_COPY_ON_WRITE
6025 else if (SvPVX(sv)) {
6027 /* I believe I need to grab the global SV mutex here and
6028 then recheck the COW status. */
6030 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
6033 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
6034 SvUVX(sv), SV_COW_NEXT_SV(sv));
6035 /* And drop it here. */
6037 } else if (SvLEN(sv)) {
6038 Safefree(SvPVX(sv));
6042 else if (SvPVX(sv) && SvLEN(sv))
6043 Safefree(SvPVX(sv));
6044 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
6045 unsharepvn(SvPVX(sv),
6046 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
6060 switch (SvTYPE(sv)) {
6076 del_XPVIV(SvANY(sv));
6079 del_XPVNV(SvANY(sv));
6082 del_XPVMG(SvANY(sv));
6085 del_XPVLV(SvANY(sv));
6088 del_XPVAV(SvANY(sv));
6091 del_XPVHV(SvANY(sv));
6094 del_XPVCV(SvANY(sv));
6097 del_XPVGV(SvANY(sv));
6098 /* code duplication for increased performance. */
6099 SvFLAGS(sv) &= SVf_BREAK;
6100 SvFLAGS(sv) |= SVTYPEMASK;
6101 /* decrease refcount of the stash that owns this GV, if any */
6103 SvREFCNT_dec(stash);
6104 return; /* not break, SvFLAGS reset already happened */
6106 del_XPVBM(SvANY(sv));
6109 del_XPVFM(SvANY(sv));
6112 del_XPVIO(SvANY(sv));
6115 SvFLAGS(sv) &= SVf_BREAK;
6116 SvFLAGS(sv) |= SVTYPEMASK;
6120 =for apidoc sv_newref
6122 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6129 Perl_sv_newref(pTHX_ SV *sv)
6139 Decrement an SV's reference count, and if it drops to zero, call
6140 C<sv_clear> to invoke destructors and free up any memory used by
6141 the body; finally, deallocate the SV's head itself.
6142 Normally called via a wrapper macro C<SvREFCNT_dec>.
6148 Perl_sv_free(pTHX_ SV *sv)
6152 if (SvREFCNT(sv) == 0) {
6153 if (SvFLAGS(sv) & SVf_BREAK)
6154 /* this SV's refcnt has been artificially decremented to
6155 * trigger cleanup */
6157 if (PL_in_clean_all) /* All is fair */
6159 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6160 /* make sure SvREFCNT(sv)==0 happens very seldom */
6161 SvREFCNT(sv) = (~(U32)0)/2;
6164 if (ckWARN_d(WARN_INTERNAL))
6165 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6166 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6167 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6170 if (--(SvREFCNT(sv)) > 0)
6172 Perl_sv_free2(aTHX_ sv);
6176 Perl_sv_free2(pTHX_ SV *sv)
6180 if (ckWARN_d(WARN_DEBUGGING))
6181 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6182 "Attempt to free temp prematurely: SV 0x%"UVxf
6183 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6187 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6188 /* make sure SvREFCNT(sv)==0 happens very seldom */
6189 SvREFCNT(sv) = (~(U32)0)/2;
6200 Returns the length of the string in the SV. Handles magic and type
6201 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6207 Perl_sv_len(pTHX_ register SV *sv)
6215 len = mg_length(sv);
6217 (void)SvPV(sv, len);
6222 =for apidoc sv_len_utf8
6224 Returns the number of characters in the string in an SV, counting wide
6225 UTF-8 bytes as a single character. Handles magic and type coercion.
6231 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6232 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6233 * (Note that the mg_len is not the length of the mg_ptr field.)
6238 Perl_sv_len_utf8(pTHX_ register SV *sv)
6244 return mg_length(sv);
6248 U8 *s = (U8*)SvPV(sv, len);
6249 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6251 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6253 #ifdef PERL_UTF8_CACHE_ASSERT
6254 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6258 ulen = Perl_utf8_length(aTHX_ s, s + len);
6259 if (!mg && !SvREADONLY(sv)) {
6260 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6261 mg = mg_find(sv, PERL_MAGIC_utf8);
6271 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6272 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6273 * between UTF-8 and byte offsets. There are two (substr offset and substr
6274 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6275 * and byte offset) cache positions.
6277 * The mg_len field is used by sv_len_utf8(), see its comments.
6278 * Note that the mg_len is not the length of the mg_ptr field.
6282 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
6286 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6288 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, &PL_vtbl_utf8, 0, 0);
6292 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6294 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6295 (*mgp)->mg_ptr = (char *) *cachep;
6299 (*cachep)[i] = *offsetp;
6300 (*cachep)[i+1] = s - start;
6308 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6309 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6310 * between UTF-8 and byte offsets. See also the comments of
6311 * S_utf8_mg_pos_init().
6315 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6319 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6321 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6322 if (*mgp && (*mgp)->mg_ptr) {
6323 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6324 ASSERT_UTF8_CACHE(*cachep);
6325 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6327 else { /* We will skip to the right spot. */
6332 /* The assumption is that going backward is half
6333 * the speed of going forward (that's where the
6334 * 2 * backw in the below comes from). (The real
6335 * figure of course depends on the UTF-8 data.) */
6337 if ((*cachep)[i] > (STRLEN)uoff) {
6339 backw = (*cachep)[i] - (STRLEN)uoff;
6341 if (forw < 2 * backw)
6344 p = start + (*cachep)[i+1];
6346 /* Try this only for the substr offset (i == 0),
6347 * not for the substr length (i == 2). */
6348 else if (i == 0) { /* (*cachep)[i] < uoff */
6349 STRLEN ulen = sv_len_utf8(sv);
6351 if ((STRLEN)uoff < ulen) {
6352 forw = (STRLEN)uoff - (*cachep)[i];
6353 backw = ulen - (STRLEN)uoff;
6355 if (forw < 2 * backw)
6356 p = start + (*cachep)[i+1];
6361 /* If the string is not long enough for uoff,
6362 * we could extend it, but not at this low a level. */
6366 if (forw < 2 * backw) {
6373 while (UTF8_IS_CONTINUATION(*p))
6378 /* Update the cache. */
6379 (*cachep)[i] = (STRLEN)uoff;
6380 (*cachep)[i+1] = p - start;
6382 /* Drop the stale "length" cache */
6391 if (found) { /* Setup the return values. */
6392 *offsetp = (*cachep)[i+1];
6393 *sp = start + *offsetp;
6396 *offsetp = send - start;
6398 else if (*sp < start) {
6404 #ifdef PERL_UTF8_CACHE_ASSERT
6409 while (n-- && s < send)
6413 assert(*offsetp == s - start);
6414 assert((*cachep)[0] == (STRLEN)uoff);
6415 assert((*cachep)[1] == *offsetp);
6417 ASSERT_UTF8_CACHE(*cachep);
6426 =for apidoc sv_pos_u2b
6428 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6429 the start of the string, to a count of the equivalent number of bytes; if
6430 lenp is non-zero, it does the same to lenp, but this time starting from
6431 the offset, rather than from the start of the string. Handles magic and
6438 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6439 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6440 * byte offsets. See also the comments of S_utf8_mg_pos().
6445 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6456 start = s = (U8*)SvPV(sv, len);
6458 I32 uoffset = *offsetp;
6463 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6465 if (!found && uoffset > 0) {
6466 while (s < send && uoffset--)
6470 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
6472 *offsetp = s - start;
6477 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp + *offsetp, &s, start, send)) {
6481 if (!found && *lenp > 0) {
6484 while (s < send && ulen--)
6488 utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start);
6492 ASSERT_UTF8_CACHE(cache);
6504 =for apidoc sv_pos_b2u
6506 Converts the value pointed to by offsetp from a count of bytes from the
6507 start of the string, to a count of the equivalent number of UTF-8 chars.
6508 Handles magic and type coercion.
6514 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6515 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6516 * byte offsets. See also the comments of S_utf8_mg_pos().
6521 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6529 s = (U8*)SvPV(sv, len);
6530 if ((I32)len < *offsetp)
6531 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6533 U8* send = s + *offsetp;
6535 STRLEN *cache = NULL;
6539 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6540 mg = mg_find(sv, PERL_MAGIC_utf8);
6541 if (mg && mg->mg_ptr) {
6542 cache = (STRLEN *) mg->mg_ptr;
6543 if (cache[1] == (STRLEN)*offsetp) {
6544 /* An exact match. */
6545 *offsetp = cache[0];
6549 else if (cache[1] < (STRLEN)*offsetp) {
6550 /* We already know part of the way. */
6553 /* Let the below loop do the rest. */
6555 else { /* cache[1] > *offsetp */
6556 /* We already know all of the way, now we may
6557 * be able to walk back. The same assumption
6558 * is made as in S_utf8_mg_pos(), namely that
6559 * walking backward is twice slower than
6560 * walking forward. */
6561 STRLEN forw = *offsetp;
6562 STRLEN backw = cache[1] - *offsetp;
6564 if (!(forw < 2 * backw)) {
6565 U8 *p = s + cache[1];
6572 while (UTF8_IS_CONTINUATION(*p)) {
6580 *offsetp = cache[0];
6582 /* Drop the stale "length" cache */
6590 ASSERT_UTF8_CACHE(cache);
6596 /* Call utf8n_to_uvchr() to validate the sequence
6597 * (unless a simple non-UTF character) */
6598 if (!UTF8_IS_INVARIANT(*s))
6599 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6608 if (!SvREADONLY(sv)) {
6610 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6611 mg = mg_find(sv, PERL_MAGIC_utf8);
6616 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6617 mg->mg_ptr = (char *) cache;
6622 cache[1] = *offsetp;
6623 /* Drop the stale "length" cache */
6636 Returns a boolean indicating whether the strings in the two SVs are
6637 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6638 coerce its args to strings if necessary.
6644 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6652 SV* svrecode = Nullsv;
6659 pv1 = SvPV(sv1, cur1);
6666 pv2 = SvPV(sv2, cur2);
6668 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6669 /* Differing utf8ness.
6670 * Do not UTF8size the comparands as a side-effect. */
6673 svrecode = newSVpvn(pv2, cur2);
6674 sv_recode_to_utf8(svrecode, PL_encoding);
6675 pv2 = SvPV(svrecode, cur2);
6678 svrecode = newSVpvn(pv1, cur1);
6679 sv_recode_to_utf8(svrecode, PL_encoding);
6680 pv1 = SvPV(svrecode, cur1);
6682 /* Now both are in UTF-8. */
6684 SvREFCNT_dec(svrecode);
6689 bool is_utf8 = TRUE;
6692 /* sv1 is the UTF-8 one,
6693 * if is equal it must be downgrade-able */
6694 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6700 /* sv2 is the UTF-8 one,
6701 * if is equal it must be downgrade-able */
6702 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6708 /* Downgrade not possible - cannot be eq */
6716 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6719 SvREFCNT_dec(svrecode);
6730 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6731 string in C<sv1> is less than, equal to, or greater than the string in
6732 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6733 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6739 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6742 const char *pv1, *pv2;
6745 SV *svrecode = Nullsv;
6752 pv1 = SvPV(sv1, cur1);
6759 pv2 = SvPV(sv2, cur2);
6761 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6762 /* Differing utf8ness.
6763 * Do not UTF8size the comparands as a side-effect. */
6766 svrecode = newSVpvn(pv2, cur2);
6767 sv_recode_to_utf8(svrecode, PL_encoding);
6768 pv2 = SvPV(svrecode, cur2);
6771 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6776 svrecode = newSVpvn(pv1, cur1);
6777 sv_recode_to_utf8(svrecode, PL_encoding);
6778 pv1 = SvPV(svrecode, cur1);
6781 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6787 cmp = cur2 ? -1 : 0;
6791 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6794 cmp = retval < 0 ? -1 : 1;
6795 } else if (cur1 == cur2) {
6798 cmp = cur1 < cur2 ? -1 : 1;
6803 SvREFCNT_dec(svrecode);
6812 =for apidoc sv_cmp_locale
6814 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6815 'use bytes' aware, handles get magic, and will coerce its args to strings
6816 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6822 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6824 #ifdef USE_LOCALE_COLLATE
6830 if (PL_collation_standard)
6834 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6836 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6838 if (!pv1 || !len1) {
6849 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6852 return retval < 0 ? -1 : 1;
6855 * When the result of collation is equality, that doesn't mean
6856 * that there are no differences -- some locales exclude some
6857 * characters from consideration. So to avoid false equalities,
6858 * we use the raw string as a tiebreaker.
6864 #endif /* USE_LOCALE_COLLATE */
6866 return sv_cmp(sv1, sv2);
6870 #ifdef USE_LOCALE_COLLATE
6873 =for apidoc sv_collxfrm
6875 Add Collate Transform magic to an SV if it doesn't already have it.
6877 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6878 scalar data of the variable, but transformed to such a format that a normal
6879 memory comparison can be used to compare the data according to the locale
6886 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6890 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6891 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6896 Safefree(mg->mg_ptr);
6898 if ((xf = mem_collxfrm(s, len, &xlen))) {
6899 if (SvREADONLY(sv)) {
6902 return xf + sizeof(PL_collation_ix);
6905 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6906 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6919 if (mg && mg->mg_ptr) {
6921 return mg->mg_ptr + sizeof(PL_collation_ix);
6929 #endif /* USE_LOCALE_COLLATE */
6934 Get a line from the filehandle and store it into the SV, optionally
6935 appending to the currently-stored string.
6941 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6945 register STDCHAR rslast;
6946 register STDCHAR *bp;
6952 if (SvTHINKFIRST(sv))
6953 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6954 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6956 However, perlbench says it's slower, because the existing swipe code
6957 is faster than copy on write.
6958 Swings and roundabouts. */
6959 (void)SvUPGRADE(sv, SVt_PV);
6964 if (PerlIO_isutf8(fp)) {
6966 sv_utf8_upgrade_nomg(sv);
6967 sv_pos_u2b(sv,&append,0);
6969 } else if (SvUTF8(sv)) {
6970 SV *tsv = NEWSV(0,0);
6971 sv_gets(tsv, fp, 0);
6972 sv_utf8_upgrade_nomg(tsv);
6973 SvCUR_set(sv,append);
6976 goto return_string_or_null;
6981 if (PerlIO_isutf8(fp))
6984 if (IN_PERL_COMPILETIME) {
6985 /* we always read code in line mode */
6989 else if (RsSNARF(PL_rs)) {
6990 /* If it is a regular disk file use size from stat() as estimate
6991 of amount we are going to read - may result in malloc-ing
6992 more memory than we realy need if layers bellow reduce
6993 size we read (e.g. CRLF or a gzip layer)
6996 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6997 Off_t offset = PerlIO_tell(fp);
6998 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6999 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
7005 else if (RsRECORD(PL_rs)) {
7009 /* Grab the size of the record we're getting */
7010 recsize = SvIV(SvRV(PL_rs));
7011 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
7014 /* VMS wants read instead of fread, because fread doesn't respect */
7015 /* RMS record boundaries. This is not necessarily a good thing to be */
7016 /* doing, but we've got no other real choice - except avoid stdio
7017 as implementation - perhaps write a :vms layer ?
7019 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
7021 bytesread = PerlIO_read(fp, buffer, recsize);
7025 SvCUR_set(sv, bytesread += append);
7026 buffer[bytesread] = '\0';
7027 goto return_string_or_null;
7029 else if (RsPARA(PL_rs)) {
7035 /* Get $/ i.e. PL_rs into same encoding as stream wants */
7036 if (PerlIO_isutf8(fp)) {
7037 rsptr = SvPVutf8(PL_rs, rslen);
7040 if (SvUTF8(PL_rs)) {
7041 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
7042 Perl_croak(aTHX_ "Wide character in $/");
7045 rsptr = SvPV(PL_rs, rslen);
7049 rslast = rslen ? rsptr[rslen - 1] : '\0';
7051 if (rspara) { /* have to do this both before and after */
7052 do { /* to make sure file boundaries work right */
7055 i = PerlIO_getc(fp);
7059 PerlIO_ungetc(fp,i);
7065 /* See if we know enough about I/O mechanism to cheat it ! */
7067 /* This used to be #ifdef test - it is made run-time test for ease
7068 of abstracting out stdio interface. One call should be cheap
7069 enough here - and may even be a macro allowing compile
7073 if (PerlIO_fast_gets(fp)) {
7076 * We're going to steal some values from the stdio struct
7077 * and put EVERYTHING in the innermost loop into registers.
7079 register STDCHAR *ptr;
7083 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7084 /* An ungetc()d char is handled separately from the regular
7085 * buffer, so we getc() it back out and stuff it in the buffer.
7087 i = PerlIO_getc(fp);
7088 if (i == EOF) return 0;
7089 *(--((*fp)->_ptr)) = (unsigned char) i;
7093 /* Here is some breathtakingly efficient cheating */
7095 cnt = PerlIO_get_cnt(fp); /* get count into register */
7096 /* make sure we have the room */
7097 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7098 /* Not room for all of it
7099 if we are looking for a separator and room for some
7101 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7102 /* just process what we have room for */
7103 shortbuffered = cnt - SvLEN(sv) + append + 1;
7104 cnt -= shortbuffered;
7108 /* remember that cnt can be negative */
7109 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7114 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7115 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7116 DEBUG_P(PerlIO_printf(Perl_debug_log,
7117 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7118 DEBUG_P(PerlIO_printf(Perl_debug_log,
7119 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7120 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7121 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7126 while (cnt > 0) { /* this | eat */
7128 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7129 goto thats_all_folks; /* screams | sed :-) */
7133 Copy(ptr, bp, cnt, char); /* this | eat */
7134 bp += cnt; /* screams | dust */
7135 ptr += cnt; /* louder | sed :-) */
7140 if (shortbuffered) { /* oh well, must extend */
7141 cnt = shortbuffered;
7143 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7145 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7146 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7150 DEBUG_P(PerlIO_printf(Perl_debug_log,
7151 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7152 PTR2UV(ptr),(long)cnt));
7153 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7155 DEBUG_P(PerlIO_printf(Perl_debug_log,
7156 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7157 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7158 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7160 /* This used to call 'filbuf' in stdio form, but as that behaves like
7161 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7162 another abstraction. */
7163 i = PerlIO_getc(fp); /* get more characters */
7165 DEBUG_P(PerlIO_printf(Perl_debug_log,
7166 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7167 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7168 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7170 cnt = PerlIO_get_cnt(fp);
7171 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7172 DEBUG_P(PerlIO_printf(Perl_debug_log,
7173 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7175 if (i == EOF) /* all done for ever? */
7176 goto thats_really_all_folks;
7178 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7180 SvGROW(sv, bpx + cnt + 2);
7181 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7183 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7185 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7186 goto thats_all_folks;
7190 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7191 memNE((char*)bp - rslen, rsptr, rslen))
7192 goto screamer; /* go back to the fray */
7193 thats_really_all_folks:
7195 cnt += shortbuffered;
7196 DEBUG_P(PerlIO_printf(Perl_debug_log,
7197 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7198 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7199 DEBUG_P(PerlIO_printf(Perl_debug_log,
7200 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7201 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7202 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7204 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7205 DEBUG_P(PerlIO_printf(Perl_debug_log,
7206 "Screamer: done, len=%ld, string=|%.*s|\n",
7207 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7211 /*The big, slow, and stupid way. */
7213 /* Any stack-challenged places. */
7215 /* EPOC: need to work around SDK features. *
7216 * On WINS: MS VC5 generates calls to _chkstk, *
7217 * if a "large" stack frame is allocated. *
7218 * gcc on MARM does not generate calls like these. */
7219 # define USEHEAPINSTEADOFSTACK
7222 #ifdef USEHEAPINSTEADOFSTACK
7224 New(0, buf, 8192, STDCHAR);
7232 const register STDCHAR *bpe = buf + sizeof(buf);
7234 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7235 ; /* keep reading */
7239 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7240 /* Accomodate broken VAXC compiler, which applies U8 cast to
7241 * both args of ?: operator, causing EOF to change into 255
7244 i = (U8)buf[cnt - 1];
7250 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7252 sv_catpvn(sv, (char *) buf, cnt);
7254 sv_setpvn(sv, (char *) buf, cnt);
7256 if (i != EOF && /* joy */
7258 SvCUR(sv) < rslen ||
7259 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7263 * If we're reading from a TTY and we get a short read,
7264 * indicating that the user hit his EOF character, we need
7265 * to notice it now, because if we try to read from the TTY
7266 * again, the EOF condition will disappear.
7268 * The comparison of cnt to sizeof(buf) is an optimization
7269 * that prevents unnecessary calls to feof().
7273 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7277 #ifdef USEHEAPINSTEADOFSTACK
7282 if (rspara) { /* have to do this both before and after */
7283 while (i != EOF) { /* to make sure file boundaries work right */
7284 i = PerlIO_getc(fp);
7286 PerlIO_ungetc(fp,i);
7292 return_string_or_null:
7293 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7299 Auto-increment of the value in the SV, doing string to numeric conversion
7300 if necessary. Handles 'get' magic.
7306 Perl_sv_inc(pTHX_ register SV *sv)
7315 if (SvTHINKFIRST(sv)) {
7317 sv_force_normal_flags(sv, 0);
7318 if (SvREADONLY(sv)) {
7319 if (IN_PERL_RUNTIME)
7320 Perl_croak(aTHX_ PL_no_modify);
7324 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7326 i = PTR2IV(SvRV(sv));
7331 flags = SvFLAGS(sv);
7332 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7333 /* It's (privately or publicly) a float, but not tested as an
7334 integer, so test it to see. */
7336 flags = SvFLAGS(sv);
7338 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7339 /* It's publicly an integer, or privately an integer-not-float */
7340 #ifdef PERL_PRESERVE_IVUV
7344 if (SvUVX(sv) == UV_MAX)
7345 sv_setnv(sv, UV_MAX_P1);
7347 (void)SvIOK_only_UV(sv);
7348 SvUV_set(sv, SvUVX(sv) + 1);
7350 if (SvIVX(sv) == IV_MAX)
7351 sv_setuv(sv, (UV)IV_MAX + 1);
7353 (void)SvIOK_only(sv);
7354 SvIV_set(sv, SvIVX(sv) + 1);
7359 if (flags & SVp_NOK) {
7360 (void)SvNOK_only(sv);
7361 SvNV_set(sv, SvNVX(sv) + 1.0);
7365 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7366 if ((flags & SVTYPEMASK) < SVt_PVIV)
7367 sv_upgrade(sv, SVt_IV);
7368 (void)SvIOK_only(sv);
7373 while (isALPHA(*d)) d++;
7374 while (isDIGIT(*d)) d++;
7376 #ifdef PERL_PRESERVE_IVUV
7377 /* Got to punt this as an integer if needs be, but we don't issue
7378 warnings. Probably ought to make the sv_iv_please() that does
7379 the conversion if possible, and silently. */
7380 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7381 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7382 /* Need to try really hard to see if it's an integer.
7383 9.22337203685478e+18 is an integer.
7384 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7385 so $a="9.22337203685478e+18"; $a+0; $a++
7386 needs to be the same as $a="9.22337203685478e+18"; $a++
7393 /* sv_2iv *should* have made this an NV */
7394 if (flags & SVp_NOK) {
7395 (void)SvNOK_only(sv);
7396 SvNV_set(sv, SvNVX(sv) + 1.0);
7399 /* I don't think we can get here. Maybe I should assert this
7400 And if we do get here I suspect that sv_setnv will croak. NWC
7402 #if defined(USE_LONG_DOUBLE)
7403 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",
7404 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7406 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7407 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7410 #endif /* PERL_PRESERVE_IVUV */
7411 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7415 while (d >= SvPVX(sv)) {
7423 /* MKS: The original code here died if letters weren't consecutive.
7424 * at least it didn't have to worry about non-C locales. The
7425 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7426 * arranged in order (although not consecutively) and that only
7427 * [A-Za-z] are accepted by isALPHA in the C locale.
7429 if (*d != 'z' && *d != 'Z') {
7430 do { ++*d; } while (!isALPHA(*d));
7433 *(d--) -= 'z' - 'a';
7438 *(d--) -= 'z' - 'a' + 1;
7442 /* oh,oh, the number grew */
7443 SvGROW(sv, SvCUR(sv) + 2);
7444 SvCUR_set(sv, SvCUR(sv) + 1);
7445 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7456 Auto-decrement of the value in the SV, doing string to numeric conversion
7457 if necessary. Handles 'get' magic.
7463 Perl_sv_dec(pTHX_ register SV *sv)
7471 if (SvTHINKFIRST(sv)) {
7473 sv_force_normal_flags(sv, 0);
7474 if (SvREADONLY(sv)) {
7475 if (IN_PERL_RUNTIME)
7476 Perl_croak(aTHX_ PL_no_modify);
7480 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7482 i = PTR2IV(SvRV(sv));
7487 /* Unlike sv_inc we don't have to worry about string-never-numbers
7488 and keeping them magic. But we mustn't warn on punting */
7489 flags = SvFLAGS(sv);
7490 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7491 /* It's publicly an integer, or privately an integer-not-float */
7492 #ifdef PERL_PRESERVE_IVUV
7496 if (SvUVX(sv) == 0) {
7497 (void)SvIOK_only(sv);
7501 (void)SvIOK_only_UV(sv);
7502 SvUV_set(sv, SvUVX(sv) + 1);
7505 if (SvIVX(sv) == IV_MIN)
7506 sv_setnv(sv, (NV)IV_MIN - 1.0);
7508 (void)SvIOK_only(sv);
7509 SvIV_set(sv, SvIVX(sv) - 1);
7514 if (flags & SVp_NOK) {
7515 SvNV_set(sv, SvNVX(sv) - 1.0);
7516 (void)SvNOK_only(sv);
7519 if (!(flags & SVp_POK)) {
7520 if ((flags & SVTYPEMASK) < SVt_PVNV)
7521 sv_upgrade(sv, SVt_NV);
7523 (void)SvNOK_only(sv);
7526 #ifdef PERL_PRESERVE_IVUV
7528 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7529 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7530 /* Need to try really hard to see if it's an integer.
7531 9.22337203685478e+18 is an integer.
7532 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7533 so $a="9.22337203685478e+18"; $a+0; $a--
7534 needs to be the same as $a="9.22337203685478e+18"; $a--
7541 /* sv_2iv *should* have made this an NV */
7542 if (flags & SVp_NOK) {
7543 (void)SvNOK_only(sv);
7544 SvNV_set(sv, SvNVX(sv) - 1.0);
7547 /* I don't think we can get here. Maybe I should assert this
7548 And if we do get here I suspect that sv_setnv will croak. NWC
7550 #if defined(USE_LONG_DOUBLE)
7551 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",
7552 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7554 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7555 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7559 #endif /* PERL_PRESERVE_IVUV */
7560 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7564 =for apidoc sv_mortalcopy
7566 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7567 The new SV is marked as mortal. It will be destroyed "soon", either by an
7568 explicit call to FREETMPS, or by an implicit call at places such as
7569 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7574 /* Make a string that will exist for the duration of the expression
7575 * evaluation. Actually, it may have to last longer than that, but
7576 * hopefully we won't free it until it has been assigned to a
7577 * permanent location. */
7580 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7585 sv_setsv(sv,oldstr);
7587 PL_tmps_stack[++PL_tmps_ix] = sv;
7593 =for apidoc sv_newmortal
7595 Creates a new null SV which is mortal. The reference count of the SV is
7596 set to 1. It will be destroyed "soon", either by an explicit call to
7597 FREETMPS, or by an implicit call at places such as statement boundaries.
7598 See also C<sv_mortalcopy> and C<sv_2mortal>.
7604 Perl_sv_newmortal(pTHX)
7609 SvFLAGS(sv) = SVs_TEMP;
7611 PL_tmps_stack[++PL_tmps_ix] = sv;
7616 =for apidoc sv_2mortal
7618 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7619 by an explicit call to FREETMPS, or by an implicit call at places such as
7620 statement boundaries. SvTEMP() is turned on which means that the SV's
7621 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7622 and C<sv_mortalcopy>.
7628 Perl_sv_2mortal(pTHX_ register SV *sv)
7632 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7635 PL_tmps_stack[++PL_tmps_ix] = sv;
7643 Creates a new SV and copies a string into it. The reference count for the
7644 SV is set to 1. If C<len> is zero, Perl will compute the length using
7645 strlen(). For efficiency, consider using C<newSVpvn> instead.
7651 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7658 sv_setpvn(sv,s,len);
7663 =for apidoc newSVpvn
7665 Creates a new SV and copies a string into it. The reference count for the
7666 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7667 string. You are responsible for ensuring that the source string is at least
7668 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7674 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7679 sv_setpvn(sv,s,len);
7684 =for apidoc newSVpvn_share
7686 Creates a new SV with its SvPVX pointing to a shared string in the string
7687 table. If the string does not already exist in the table, it is created
7688 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7689 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7690 otherwise the hash is computed. The idea here is that as the string table
7691 is used for shared hash keys these strings will have SvPVX == HeKEY and
7692 hash lookup will avoid string compare.
7698 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7701 bool is_utf8 = FALSE;
7703 STRLEN tmplen = -len;
7705 /* See the note in hv.c:hv_fetch() --jhi */
7706 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7710 PERL_HASH(hash, src, len);
7712 sv_upgrade(sv, SVt_PVIV);
7713 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7726 #if defined(PERL_IMPLICIT_CONTEXT)
7728 /* pTHX_ magic can't cope with varargs, so this is a no-context
7729 * version of the main function, (which may itself be aliased to us).
7730 * Don't access this version directly.
7734 Perl_newSVpvf_nocontext(const char* pat, ...)
7739 va_start(args, pat);
7740 sv = vnewSVpvf(pat, &args);
7747 =for apidoc newSVpvf
7749 Creates a new SV and initializes it with the string formatted like
7756 Perl_newSVpvf(pTHX_ const char* pat, ...)
7760 va_start(args, pat);
7761 sv = vnewSVpvf(pat, &args);
7766 /* backend for newSVpvf() and newSVpvf_nocontext() */
7769 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7773 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7780 Creates a new SV and copies a floating point value into it.
7781 The reference count for the SV is set to 1.
7787 Perl_newSVnv(pTHX_ NV n)
7799 Creates a new SV and copies an integer into it. The reference count for the
7806 Perl_newSViv(pTHX_ IV i)
7818 Creates a new SV and copies an unsigned integer into it.
7819 The reference count for the SV is set to 1.
7825 Perl_newSVuv(pTHX_ UV u)
7835 =for apidoc newRV_noinc
7837 Creates an RV wrapper for an SV. The reference count for the original
7838 SV is B<not> incremented.
7844 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7849 sv_upgrade(sv, SVt_RV);
7851 SvRV_set(sv, tmpRef);
7856 /* newRV_inc is the official function name to use now.
7857 * newRV_inc is in fact #defined to newRV in sv.h
7861 Perl_newRV(pTHX_ SV *tmpRef)
7863 return newRV_noinc(SvREFCNT_inc(tmpRef));
7869 Creates a new SV which is an exact duplicate of the original SV.
7876 Perl_newSVsv(pTHX_ register SV *old)
7882 if (SvTYPE(old) == SVTYPEMASK) {
7883 if (ckWARN_d(WARN_INTERNAL))
7884 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7888 /* SV_GMAGIC is the default for sv_setv()
7889 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7890 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7891 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7896 =for apidoc sv_reset
7898 Underlying implementation for the C<reset> Perl function.
7899 Note that the perl-level function is vaguely deprecated.
7905 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7913 char todo[PERL_UCHAR_MAX+1];
7918 if (!*s) { /* reset ?? searches */
7919 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7920 pm->op_pmdynflags &= ~PMdf_USED;
7925 /* reset variables */
7927 if (!HvARRAY(stash))
7930 Zero(todo, 256, char);
7932 i = (unsigned char)*s;
7936 max = (unsigned char)*s++;
7937 for ( ; i <= max; i++) {
7940 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7941 for (entry = HvARRAY(stash)[i];
7943 entry = HeNEXT(entry))
7945 if (!todo[(U8)*HeKEY(entry)])
7947 gv = (GV*)HeVAL(entry);
7949 if (SvTHINKFIRST(sv)) {
7950 if (!SvREADONLY(sv) && SvROK(sv))
7955 if (SvTYPE(sv) >= SVt_PV) {
7957 if (SvPVX(sv) != Nullch)
7964 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7967 #ifdef USE_ENVIRON_ARRAY
7969 # ifdef USE_ITHREADS
7970 && PL_curinterp == aTHX
7974 environ[0] = Nullch;
7977 #endif /* !PERL_MICRO */
7987 Using various gambits, try to get an IO from an SV: the IO slot if its a
7988 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7989 named after the PV if we're a string.
7995 Perl_sv_2io(pTHX_ SV *sv)
8000 switch (SvTYPE(sv)) {
8008 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
8012 Perl_croak(aTHX_ PL_no_usym, "filehandle");
8014 return sv_2io(SvRV(sv));
8015 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
8021 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
8030 Using various gambits, try to get a CV from an SV; in addition, try if
8031 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
8037 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
8043 return *gvp = Nullgv, Nullcv;
8044 switch (SvTYPE(sv)) {
8063 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
8064 tryAMAGICunDEREF(to_cv);
8067 if (SvTYPE(sv) == SVt_PVCV) {
8076 Perl_croak(aTHX_ "Not a subroutine reference");
8081 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8087 if (lref && !GvCVu(gv)) {
8090 tmpsv = NEWSV(704,0);
8091 gv_efullname3(tmpsv, gv, Nullch);
8092 /* XXX this is probably not what they think they're getting.
8093 * It has the same effect as "sub name;", i.e. just a forward
8095 newSUB(start_subparse(FALSE, 0),
8096 newSVOP(OP_CONST, 0, tmpsv),
8101 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8111 Returns true if the SV has a true value by Perl's rules.
8112 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8113 instead use an in-line version.
8119 Perl_sv_true(pTHX_ register SV *sv)
8124 const register XPV* tXpv;
8125 if ((tXpv = (XPV*)SvANY(sv)) &&
8126 (tXpv->xpv_cur > 1 ||
8127 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
8134 return SvIVX(sv) != 0;
8137 return SvNVX(sv) != 0.0;
8139 return sv_2bool(sv);
8147 A private implementation of the C<SvIVx> macro for compilers which can't
8148 cope with complex macro expressions. Always use the macro instead.
8154 Perl_sv_iv(pTHX_ register SV *sv)
8158 return (IV)SvUVX(sv);
8167 A private implementation of the C<SvUVx> macro for compilers which can't
8168 cope with complex macro expressions. Always use the macro instead.
8174 Perl_sv_uv(pTHX_ register SV *sv)
8179 return (UV)SvIVX(sv);
8187 A private implementation of the C<SvNVx> macro for compilers which can't
8188 cope with complex macro expressions. Always use the macro instead.
8194 Perl_sv_nv(pTHX_ register SV *sv)
8201 /* sv_pv() is now a macro using SvPV_nolen();
8202 * this function provided for binary compatibility only
8206 Perl_sv_pv(pTHX_ SV *sv)
8213 return sv_2pv(sv, &n_a);
8219 Use the C<SvPV_nolen> macro instead
8223 A private implementation of the C<SvPV> macro for compilers which can't
8224 cope with complex macro expressions. Always use the macro instead.
8230 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8236 return sv_2pv(sv, lp);
8241 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8247 return sv_2pv_flags(sv, lp, 0);
8250 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8251 * this function provided for binary compatibility only
8255 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8257 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8261 =for apidoc sv_pvn_force
8263 Get a sensible string out of the SV somehow.
8264 A private implementation of the C<SvPV_force> macro for compilers which
8265 can't cope with complex macro expressions. Always use the macro instead.
8267 =for apidoc sv_pvn_force_flags
8269 Get a sensible string out of the SV somehow.
8270 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8271 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8272 implemented in terms of this function.
8273 You normally want to use the various wrapper macros instead: see
8274 C<SvPV_force> and C<SvPV_force_nomg>
8280 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8284 if (SvTHINKFIRST(sv) && !SvROK(sv))
8285 sv_force_normal_flags(sv, 0);
8291 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8292 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8296 s = sv_2pv_flags(sv, lp, flags);
8297 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8302 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8303 SvGROW(sv, len + 1);
8304 Move(s,SvPVX(sv),len,char);
8309 SvPOK_on(sv); /* validate pointer */
8311 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8312 PTR2UV(sv),SvPVX(sv)));
8318 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8319 * this function provided for binary compatibility only
8323 Perl_sv_pvbyte(pTHX_ SV *sv)
8325 sv_utf8_downgrade(sv,0);
8330 =for apidoc sv_pvbyte
8332 Use C<SvPVbyte_nolen> instead.
8334 =for apidoc sv_pvbyten
8336 A private implementation of the C<SvPVbyte> macro for compilers
8337 which can't cope with complex macro expressions. Always use the macro
8344 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8346 sv_utf8_downgrade(sv,0);
8347 return sv_pvn(sv,lp);
8351 =for apidoc sv_pvbyten_force
8353 A private implementation of the C<SvPVbytex_force> macro for compilers
8354 which can't cope with complex macro expressions. Always use the macro
8361 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8363 sv_pvn_force(sv,lp);
8364 sv_utf8_downgrade(sv,0);
8369 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8370 * this function provided for binary compatibility only
8374 Perl_sv_pvutf8(pTHX_ SV *sv)
8376 sv_utf8_upgrade(sv);
8381 =for apidoc sv_pvutf8
8383 Use the C<SvPVutf8_nolen> macro instead
8385 =for apidoc sv_pvutf8n
8387 A private implementation of the C<SvPVutf8> macro for compilers
8388 which can't cope with complex macro expressions. Always use the macro
8395 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8397 sv_utf8_upgrade(sv);
8398 return sv_pvn(sv,lp);
8402 =for apidoc sv_pvutf8n_force
8404 A private implementation of the C<SvPVutf8_force> macro for compilers
8405 which can't cope with complex macro expressions. Always use the macro
8412 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8414 sv_pvn_force(sv,lp);
8415 sv_utf8_upgrade(sv);
8421 =for apidoc sv_reftype
8423 Returns a string describing what the SV is a reference to.
8429 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8431 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8432 inside return suggests a const propagation bug in g++. */
8433 if (ob && SvOBJECT(sv)) {
8434 char *name = HvNAME(SvSTASH(sv));
8435 return name ? name : (char *) "__ANON__";
8438 switch (SvTYPE(sv)) {
8455 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8456 /* tied lvalues should appear to be
8457 * scalars for backwards compatitbility */
8458 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8459 ? "SCALAR" : "LVALUE");
8460 case SVt_PVAV: return "ARRAY";
8461 case SVt_PVHV: return "HASH";
8462 case SVt_PVCV: return "CODE";
8463 case SVt_PVGV: return "GLOB";
8464 case SVt_PVFM: return "FORMAT";
8465 case SVt_PVIO: return "IO";
8466 default: return "UNKNOWN";
8472 =for apidoc sv_isobject
8474 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8475 object. If the SV is not an RV, or if the object is not blessed, then this
8482 Perl_sv_isobject(pTHX_ SV *sv)
8499 Returns a boolean indicating whether the SV is blessed into the specified
8500 class. This does not check for subtypes; use C<sv_derived_from> to verify
8501 an inheritance relationship.
8507 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8518 if (!HvNAME(SvSTASH(sv)))
8521 return strEQ(HvNAME(SvSTASH(sv)), name);
8527 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8528 it will be upgraded to one. If C<classname> is non-null then the new SV will
8529 be blessed in the specified package. The new SV is returned and its
8530 reference count is 1.
8536 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8542 SV_CHECK_THINKFIRST_COW_DROP(rv);
8545 if (SvTYPE(rv) >= SVt_PVMG) {
8546 U32 refcnt = SvREFCNT(rv);
8550 SvREFCNT(rv) = refcnt;
8553 if (SvTYPE(rv) < SVt_RV)
8554 sv_upgrade(rv, SVt_RV);
8555 else if (SvTYPE(rv) > SVt_RV) {
8557 if (SvPVX(rv) && SvLEN(rv))
8558 Safefree(SvPVX(rv));
8568 HV* stash = gv_stashpv(classname, TRUE);
8569 (void)sv_bless(rv, stash);
8575 =for apidoc sv_setref_pv
8577 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8578 argument will be upgraded to an RV. That RV will be modified to point to
8579 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8580 into the SV. The C<classname> argument indicates the package for the
8581 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8582 will have a reference count of 1, and the RV will be returned.
8584 Do not use with other Perl types such as HV, AV, SV, CV, because those
8585 objects will become corrupted by the pointer copy process.
8587 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8593 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8596 sv_setsv(rv, &PL_sv_undef);
8600 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8605 =for apidoc sv_setref_iv
8607 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8608 argument will be upgraded to an RV. That RV will be modified to point to
8609 the new SV. The C<classname> argument indicates the package for the
8610 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8611 will have a reference count of 1, and the RV will be returned.
8617 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8619 sv_setiv(newSVrv(rv,classname), iv);
8624 =for apidoc sv_setref_uv
8626 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8627 argument will be upgraded to an RV. That RV will be modified to point to
8628 the new SV. The C<classname> argument indicates the package for the
8629 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8630 will have a reference count of 1, and the RV will be returned.
8636 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8638 sv_setuv(newSVrv(rv,classname), uv);
8643 =for apidoc sv_setref_nv
8645 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8646 argument will be upgraded to an RV. That RV will be modified to point to
8647 the new SV. The C<classname> argument indicates the package for the
8648 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8649 will have a reference count of 1, and the RV will be returned.
8655 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8657 sv_setnv(newSVrv(rv,classname), nv);
8662 =for apidoc sv_setref_pvn
8664 Copies a string into a new SV, optionally blessing the SV. The length of the
8665 string must be specified with C<n>. The C<rv> argument will be upgraded to
8666 an RV. That RV will be modified to point to the new SV. The C<classname>
8667 argument indicates the package for the blessing. Set C<classname> to
8668 C<Nullch> to avoid the blessing. The new SV will have a reference count
8669 of 1, and the RV will be returned.
8671 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8677 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8679 sv_setpvn(newSVrv(rv,classname), pv, n);
8684 =for apidoc sv_bless
8686 Blesses an SV into a specified package. The SV must be an RV. The package
8687 must be designated by its stash (see C<gv_stashpv()>). The reference count
8688 of the SV is unaffected.
8694 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8698 Perl_croak(aTHX_ "Can't bless non-reference value");
8700 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8701 if (SvREADONLY(tmpRef))
8702 Perl_croak(aTHX_ PL_no_modify);
8703 if (SvOBJECT(tmpRef)) {
8704 if (SvTYPE(tmpRef) != SVt_PVIO)
8706 SvREFCNT_dec(SvSTASH(tmpRef));
8709 SvOBJECT_on(tmpRef);
8710 if (SvTYPE(tmpRef) != SVt_PVIO)
8712 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8713 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8720 if(SvSMAGICAL(tmpRef))
8721 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8729 /* Downgrades a PVGV to a PVMG.
8733 S_sv_unglob(pTHX_ SV *sv)
8737 assert(SvTYPE(sv) == SVt_PVGV);
8742 SvREFCNT_dec(GvSTASH(sv));
8743 GvSTASH(sv) = Nullhv;
8745 sv_unmagic(sv, PERL_MAGIC_glob);
8746 Safefree(GvNAME(sv));
8749 /* need to keep SvANY(sv) in the right arena */
8750 xpvmg = new_XPVMG();
8751 StructCopy(SvANY(sv), xpvmg, XPVMG);
8752 del_XPVGV(SvANY(sv));
8755 SvFLAGS(sv) &= ~SVTYPEMASK;
8756 SvFLAGS(sv) |= SVt_PVMG;
8760 =for apidoc sv_unref_flags
8762 Unsets the RV status of the SV, and decrements the reference count of
8763 whatever was being referenced by the RV. This can almost be thought of
8764 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8765 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8766 (otherwise the decrementing is conditional on the reference count being
8767 different from one or the reference being a readonly SV).
8774 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8778 if (SvWEAKREF(sv)) {
8786 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8787 assigned to as BEGIN {$a = \"Foo"} will fail. */
8788 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8790 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8791 sv_2mortal(rv); /* Schedule for freeing later */
8795 =for apidoc sv_unref
8797 Unsets the RV status of the SV, and decrements the reference count of
8798 whatever was being referenced by the RV. This can almost be thought of
8799 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8800 being zero. See C<SvROK_off>.
8806 Perl_sv_unref(pTHX_ SV *sv)
8808 sv_unref_flags(sv, 0);
8812 =for apidoc sv_taint
8814 Taint an SV. Use C<SvTAINTED_on> instead.
8819 Perl_sv_taint(pTHX_ SV *sv)
8821 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8825 =for apidoc sv_untaint
8827 Untaint an SV. Use C<SvTAINTED_off> instead.
8832 Perl_sv_untaint(pTHX_ SV *sv)
8834 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8835 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8842 =for apidoc sv_tainted
8844 Test an SV for taintedness. Use C<SvTAINTED> instead.
8849 Perl_sv_tainted(pTHX_ SV *sv)
8851 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8852 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8853 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8860 =for apidoc sv_setpviv
8862 Copies an integer into the given SV, also updating its string value.
8863 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8869 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8871 char buf[TYPE_CHARS(UV)];
8873 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8875 sv_setpvn(sv, ptr, ebuf - ptr);
8879 =for apidoc sv_setpviv_mg
8881 Like C<sv_setpviv>, but also handles 'set' magic.
8887 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8889 char buf[TYPE_CHARS(UV)];
8891 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8893 sv_setpvn(sv, ptr, ebuf - ptr);
8897 #if defined(PERL_IMPLICIT_CONTEXT)
8899 /* pTHX_ magic can't cope with varargs, so this is a no-context
8900 * version of the main function, (which may itself be aliased to us).
8901 * Don't access this version directly.
8905 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8909 va_start(args, pat);
8910 sv_vsetpvf(sv, pat, &args);
8914 /* pTHX_ magic can't cope with varargs, so this is a no-context
8915 * version of the main function, (which may itself be aliased to us).
8916 * Don't access this version directly.
8920 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8924 va_start(args, pat);
8925 sv_vsetpvf_mg(sv, pat, &args);
8931 =for apidoc sv_setpvf
8933 Works like C<sv_catpvf> but copies the text into the SV instead of
8934 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8940 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8943 va_start(args, pat);
8944 sv_vsetpvf(sv, pat, &args);
8949 =for apidoc sv_vsetpvf
8951 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8952 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8954 Usually used via its frontend C<sv_setpvf>.
8960 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8962 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8966 =for apidoc sv_setpvf_mg
8968 Like C<sv_setpvf>, but also handles 'set' magic.
8974 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8977 va_start(args, pat);
8978 sv_vsetpvf_mg(sv, pat, &args);
8983 =for apidoc sv_vsetpvf_mg
8985 Like C<sv_vsetpvf>, but also handles 'set' magic.
8987 Usually used via its frontend C<sv_setpvf_mg>.
8993 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8995 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8999 #if defined(PERL_IMPLICIT_CONTEXT)
9001 /* pTHX_ magic can't cope with varargs, so this is a no-context
9002 * version of the main function, (which may itself be aliased to us).
9003 * Don't access this version directly.
9007 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
9011 va_start(args, pat);
9012 sv_vcatpvf(sv, pat, &args);
9016 /* pTHX_ magic can't cope with varargs, so this is a no-context
9017 * version of the main function, (which may itself be aliased to us).
9018 * Don't access this version directly.
9022 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
9026 va_start(args, pat);
9027 sv_vcatpvf_mg(sv, pat, &args);
9033 =for apidoc sv_catpvf
9035 Processes its arguments like C<sprintf> and appends the formatted
9036 output to an SV. If the appended data contains "wide" characters
9037 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
9038 and characters >255 formatted with %c), the original SV might get
9039 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
9040 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
9041 valid UTF-8; if the original SV was bytes, the pattern should be too.
9046 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
9049 va_start(args, pat);
9050 sv_vcatpvf(sv, pat, &args);
9055 =for apidoc sv_vcatpvf
9057 Processes its arguments like C<vsprintf> and appends the formatted output
9058 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
9060 Usually used via its frontend C<sv_catpvf>.
9066 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
9068 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9072 =for apidoc sv_catpvf_mg
9074 Like C<sv_catpvf>, but also handles 'set' magic.
9080 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9083 va_start(args, pat);
9084 sv_vcatpvf_mg(sv, pat, &args);
9089 =for apidoc sv_vcatpvf_mg
9091 Like C<sv_vcatpvf>, but also handles 'set' magic.
9093 Usually used via its frontend C<sv_catpvf_mg>.
9099 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9101 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9106 =for apidoc sv_vsetpvfn
9108 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9111 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9117 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9119 sv_setpvn(sv, "", 0);
9120 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9123 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9126 S_expect_number(pTHX_ char** pattern)
9129 switch (**pattern) {
9130 case '1': case '2': case '3':
9131 case '4': case '5': case '6':
9132 case '7': case '8': case '9':
9133 while (isDIGIT(**pattern))
9134 var = var * 10 + (*(*pattern)++ - '0');
9138 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9141 F0convert(NV nv, char *endbuf, STRLEN *len)
9152 if (uv & 1 && uv == nv)
9153 uv--; /* Round to even */
9155 unsigned dig = uv % 10;
9168 =for apidoc sv_vcatpvfn
9170 Processes its arguments like C<vsprintf> and appends the formatted output
9171 to an SV. Uses an array of SVs if the C style variable argument list is
9172 missing (NULL). When running with taint checks enabled, indicates via
9173 C<maybe_tainted> if results are untrustworthy (often due to the use of
9176 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9181 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9184 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9191 static char nullstr[] = "(null)";
9193 bool has_utf8; /* has the result utf8? */
9194 bool pat_utf8; /* the pattern is in utf8? */
9196 /* Times 4: a decimal digit takes more than 3 binary digits.
9197 * NV_DIG: mantissa takes than many decimal digits.
9198 * Plus 32: Playing safe. */
9199 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9200 /* large enough for "%#.#f" --chip */
9201 /* what about long double NVs? --jhi */
9203 has_utf8 = pat_utf8 = DO_UTF8(sv);
9205 /* no matter what, this is a string now */
9206 (void)SvPV_force(sv, origlen);
9208 /* special-case "", "%s", and "%_" */
9211 if (patlen == 2 && pat[0] == '%') {
9215 const char *s = va_arg(*args, char*);
9216 sv_catpv(sv, s ? s : nullstr);
9218 else if (svix < svmax) {
9219 sv_catsv(sv, *svargs);
9220 if (DO_UTF8(*svargs))
9226 argsv = va_arg(*args, SV*);
9227 sv_catsv(sv, argsv);
9232 /* See comment on '_' below */
9237 #ifndef USE_LONG_DOUBLE
9238 /* special-case "%.<number>[gf]" */
9239 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9240 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9241 unsigned digits = 0;
9245 while (*pp >= '0' && *pp <= '9')
9246 digits = 10 * digits + (*pp++ - '0');
9247 if (pp - pat == (int)patlen - 1) {
9251 nv = (NV)va_arg(*args, double);
9252 else if (svix < svmax)
9257 /* Add check for digits != 0 because it seems that some
9258 gconverts are buggy in this case, and we don't yet have
9259 a Configure test for this. */
9260 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9261 /* 0, point, slack */
9262 Gconvert(nv, (int)digits, 0, ebuf);
9264 if (*ebuf) /* May return an empty string for digits==0 */
9267 } else if (!digits) {
9270 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9271 sv_catpvn(sv, p, l);
9277 #endif /* !USE_LONG_DOUBLE */
9279 if (!args && svix < svmax && DO_UTF8(*svargs))
9282 patend = (char*)pat + patlen;
9283 for (p = (char*)pat; p < patend; p = q) {
9286 bool vectorize = FALSE;
9287 bool vectorarg = FALSE;
9288 bool vec_utf8 = FALSE;
9294 bool has_precis = FALSE;
9297 bool is_utf8 = FALSE; /* is this item utf8? */
9298 #ifdef HAS_LDBL_SPRINTF_BUG
9299 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9300 with sfio - Allen <allens@cpan.org> */
9301 bool fix_ldbl_sprintf_bug = FALSE;
9305 U8 utf8buf[UTF8_MAXBYTES+1];
9306 STRLEN esignlen = 0;
9308 char *eptr = Nullch;
9311 U8 *vecstr = Null(U8*);
9318 /* we need a long double target in case HAS_LONG_DOUBLE but
9321 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9329 const char *dotstr = ".";
9330 STRLEN dotstrlen = 1;
9331 I32 efix = 0; /* explicit format parameter index */
9332 I32 ewix = 0; /* explicit width index */
9333 I32 epix = 0; /* explicit precision index */
9334 I32 evix = 0; /* explicit vector index */
9335 bool asterisk = FALSE;
9337 /* echo everything up to the next format specification */
9338 for (q = p; q < patend && *q != '%'; ++q) ;
9340 if (has_utf8 && !pat_utf8)
9341 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9343 sv_catpvn(sv, p, q - p);
9350 We allow format specification elements in this order:
9351 \d+\$ explicit format parameter index
9353 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9354 0 flag (as above): repeated to allow "v02"
9355 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9356 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9358 [%bcdefginopsux_DFOUX] format (mandatory)
9360 if (EXPECT_NUMBER(q, width)) {
9401 if (EXPECT_NUMBER(q, ewix))
9410 if ((vectorarg = asterisk)) {
9422 EXPECT_NUMBER(q, width);
9427 vecsv = va_arg(*args, SV*);
9429 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9430 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9431 dotstr = SvPVx(vecsv, dotstrlen);
9436 vecsv = va_arg(*args, SV*);
9437 vecstr = (U8*)SvPVx(vecsv,veclen);
9438 vec_utf8 = DO_UTF8(vecsv);
9440 else if (efix ? efix <= svmax : svix < svmax) {
9441 vecsv = svargs[efix ? efix-1 : svix++];
9442 vecstr = (U8*)SvPVx(vecsv,veclen);
9443 vec_utf8 = DO_UTF8(vecsv);
9444 /* if this is a version object, we need to return the
9445 * stringified representation (which the SvPVX has
9446 * already done for us), but not vectorize the args
9448 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9450 q++; /* skip past the rest of the %vd format */
9451 eptr = (char *) vecstr;
9452 elen = strlen(eptr);
9465 i = va_arg(*args, int);
9467 i = (ewix ? ewix <= svmax : svix < svmax) ?
9468 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9470 width = (i < 0) ? -i : i;
9480 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9482 /* XXX: todo, support specified precision parameter */
9486 i = va_arg(*args, int);
9488 i = (ewix ? ewix <= svmax : svix < svmax)
9489 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9490 precis = (i < 0) ? 0 : i;
9495 precis = precis * 10 + (*q++ - '0');
9504 case 'I': /* Ix, I32x, and I64x */
9506 if (q[1] == '6' && q[2] == '4') {
9512 if (q[1] == '3' && q[2] == '2') {
9522 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9533 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9534 if (*(q + 1) == 'l') { /* lld, llf */
9559 argsv = (efix ? efix <= svmax : svix < svmax) ?
9560 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9567 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9569 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9571 eptr = (char*)utf8buf;
9572 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9583 if (args && !vectorize) {
9584 eptr = va_arg(*args, char*);
9586 #ifdef MACOS_TRADITIONAL
9587 /* On MacOS, %#s format is used for Pascal strings */
9592 elen = strlen(eptr);
9595 elen = sizeof nullstr - 1;
9599 eptr = SvPVx(argsv, elen);
9600 if (DO_UTF8(argsv)) {
9601 if (has_precis && precis < elen) {
9603 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9606 if (width) { /* fudge width (can't fudge elen) */
9607 width += elen - sv_len_utf8(argsv);
9619 * The "%_" hack might have to be changed someday,
9620 * if ISO or ANSI decide to use '_' for something.
9621 * So we keep it hidden from users' code.
9623 if (!args || vectorize)
9625 argsv = va_arg(*args, SV*);
9626 eptr = SvPVx(argsv, elen);
9632 if (has_precis && elen > precis)
9643 goto format_sv; /* %-p -> %_ */
9647 goto format_sv; /* %-Np -> %.N_ */
9650 if (alt || vectorize)
9652 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9670 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9679 esignbuf[esignlen++] = plus;
9683 case 'h': iv = (short)va_arg(*args, int); break;
9684 case 'l': iv = va_arg(*args, long); break;
9685 case 'V': iv = va_arg(*args, IV); break;
9686 default: iv = va_arg(*args, int); break;
9688 case 'q': iv = va_arg(*args, Quad_t); break;
9693 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9695 case 'h': iv = (short)tiv; break;
9696 case 'l': iv = (long)tiv; break;
9698 default: iv = tiv; break;
9700 case 'q': iv = (Quad_t)tiv; break;
9704 if ( !vectorize ) /* we already set uv above */
9709 esignbuf[esignlen++] = plus;
9713 esignbuf[esignlen++] = '-';
9756 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9767 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9768 case 'l': uv = va_arg(*args, unsigned long); break;
9769 case 'V': uv = va_arg(*args, UV); break;
9770 default: uv = va_arg(*args, unsigned); break;
9772 case 'q': uv = va_arg(*args, Uquad_t); break;
9777 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9779 case 'h': uv = (unsigned short)tuv; break;
9780 case 'l': uv = (unsigned long)tuv; break;
9782 default: uv = tuv; break;
9784 case 'q': uv = (Uquad_t)tuv; break;
9790 eptr = ebuf + sizeof ebuf;
9796 p = (char*)((c == 'X')
9797 ? "0123456789ABCDEF" : "0123456789abcdef");
9803 esignbuf[esignlen++] = '0';
9804 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9810 *--eptr = '0' + dig;
9812 if (alt && *eptr != '0')
9818 *--eptr = '0' + dig;
9821 esignbuf[esignlen++] = '0';
9822 esignbuf[esignlen++] = 'b';
9825 default: /* it had better be ten or less */
9828 *--eptr = '0' + dig;
9829 } while (uv /= base);
9832 elen = (ebuf + sizeof ebuf) - eptr;
9835 zeros = precis - elen;
9836 else if (precis == 0 && elen == 1 && *eptr == '0')
9841 /* FLOATING POINT */
9844 c = 'f'; /* maybe %F isn't supported here */
9850 /* This is evil, but floating point is even more evil */
9852 /* for SV-style calling, we can only get NV
9853 for C-style calling, we assume %f is double;
9854 for simplicity we allow any of %Lf, %llf, %qf for long double
9858 #if defined(USE_LONG_DOUBLE)
9862 /* [perl #20339] - we should accept and ignore %lf rather than die */
9866 #if defined(USE_LONG_DOUBLE)
9867 intsize = args ? 0 : 'q';
9871 #if defined(HAS_LONG_DOUBLE)
9880 /* now we need (long double) if intsize == 'q', else (double) */
9881 nv = (args && !vectorize) ?
9882 #if LONG_DOUBLESIZE > DOUBLESIZE
9884 va_arg(*args, long double) :
9885 va_arg(*args, double)
9887 va_arg(*args, double)
9893 if (c != 'e' && c != 'E') {
9895 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9896 will cast our (long double) to (double) */
9897 (void)Perl_frexp(nv, &i);
9898 if (i == PERL_INT_MIN)
9899 Perl_die(aTHX_ "panic: frexp");
9901 need = BIT_DIGITS(i);
9903 need += has_precis ? precis : 6; /* known default */
9908 #ifdef HAS_LDBL_SPRINTF_BUG
9909 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9910 with sfio - Allen <allens@cpan.org> */
9913 # define MY_DBL_MAX DBL_MAX
9914 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9915 # if DOUBLESIZE >= 8
9916 # define MY_DBL_MAX 1.7976931348623157E+308L
9918 # define MY_DBL_MAX 3.40282347E+38L
9922 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9923 # define MY_DBL_MAX_BUG 1L
9925 # define MY_DBL_MAX_BUG MY_DBL_MAX
9929 # define MY_DBL_MIN DBL_MIN
9930 # else /* XXX guessing! -Allen */
9931 # if DOUBLESIZE >= 8
9932 # define MY_DBL_MIN 2.2250738585072014E-308L
9934 # define MY_DBL_MIN 1.17549435E-38L
9938 if ((intsize == 'q') && (c == 'f') &&
9939 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9941 /* it's going to be short enough that
9942 * long double precision is not needed */
9944 if ((nv <= 0L) && (nv >= -0L))
9945 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9947 /* would use Perl_fp_class as a double-check but not
9948 * functional on IRIX - see perl.h comments */
9950 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9951 /* It's within the range that a double can represent */
9952 #if defined(DBL_MAX) && !defined(DBL_MIN)
9953 if ((nv >= ((long double)1/DBL_MAX)) ||
9954 (nv <= (-(long double)1/DBL_MAX)))
9956 fix_ldbl_sprintf_bug = TRUE;
9959 if (fix_ldbl_sprintf_bug == TRUE) {
9969 # undef MY_DBL_MAX_BUG
9972 #endif /* HAS_LDBL_SPRINTF_BUG */
9974 need += 20; /* fudge factor */
9975 if (PL_efloatsize < need) {
9976 Safefree(PL_efloatbuf);
9977 PL_efloatsize = need + 20; /* more fudge */
9978 New(906, PL_efloatbuf, PL_efloatsize, char);
9979 PL_efloatbuf[0] = '\0';
9982 if ( !(width || left || plus || alt) && fill != '0'
9983 && has_precis && intsize != 'q' ) { /* Shortcuts */
9984 /* See earlier comment about buggy Gconvert when digits,
9986 if ( c == 'g' && precis) {
9987 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9988 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9989 goto float_converted;
9990 } else if ( c == 'f' && !precis) {
9991 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9995 eptr = ebuf + sizeof ebuf;
9998 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9999 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
10000 if (intsize == 'q') {
10001 /* Copy the one or more characters in a long double
10002 * format before the 'base' ([efgEFG]) character to
10003 * the format string. */
10004 static char const prifldbl[] = PERL_PRIfldbl;
10005 char const *p = prifldbl + sizeof(prifldbl) - 3;
10006 while (p >= prifldbl) { *--eptr = *p--; }
10011 do { *--eptr = '0' + (base % 10); } while (base /= 10);
10016 do { *--eptr = '0' + (base % 10); } while (base /= 10);
10028 /* No taint. Otherwise we are in the strange situation
10029 * where printf() taints but print($float) doesn't.
10031 #if defined(HAS_LONG_DOUBLE)
10032 if (intsize == 'q')
10033 (void)sprintf(PL_efloatbuf, eptr, nv);
10035 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
10037 (void)sprintf(PL_efloatbuf, eptr, nv);
10040 eptr = PL_efloatbuf;
10041 elen = strlen(PL_efloatbuf);
10047 i = SvCUR(sv) - origlen;
10048 if (args && !vectorize) {
10050 case 'h': *(va_arg(*args, short*)) = i; break;
10051 default: *(va_arg(*args, int*)) = i; break;
10052 case 'l': *(va_arg(*args, long*)) = i; break;
10053 case 'V': *(va_arg(*args, IV*)) = i; break;
10055 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
10060 sv_setuv_mg(argsv, (UV)i);
10062 continue; /* not "break" */
10068 if (!args && ckWARN(WARN_PRINTF) &&
10069 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
10070 SV *msg = sv_newmortal();
10071 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
10072 (PL_op->op_type == OP_PRTF) ? "" : "s");
10075 Perl_sv_catpvf(aTHX_ msg,
10076 "\"%%%c\"", c & 0xFF);
10078 Perl_sv_catpvf(aTHX_ msg,
10079 "\"%%\\%03"UVof"\"",
10082 sv_catpv(msg, "end of string");
10083 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10086 /* output mangled stuff ... */
10092 /* ... right here, because formatting flags should not apply */
10093 SvGROW(sv, SvCUR(sv) + elen + 1);
10095 Copy(eptr, p, elen, char);
10098 SvCUR_set(sv, p - SvPVX(sv));
10100 continue; /* not "break" */
10103 /* calculate width before utf8_upgrade changes it */
10104 have = esignlen + zeros + elen;
10106 if (is_utf8 != has_utf8) {
10109 sv_utf8_upgrade(sv);
10112 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10113 sv_utf8_upgrade(nsv);
10117 SvGROW(sv, SvCUR(sv) + elen + 1);
10122 need = (have > width ? have : width);
10125 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10127 if (esignlen && fill == '0') {
10128 for (i = 0; i < (int)esignlen; i++)
10129 *p++ = esignbuf[i];
10131 if (gap && !left) {
10132 memset(p, fill, gap);
10135 if (esignlen && fill != '0') {
10136 for (i = 0; i < (int)esignlen; i++)
10137 *p++ = esignbuf[i];
10140 for (i = zeros; i; i--)
10144 Copy(eptr, p, elen, char);
10148 memset(p, ' ', gap);
10153 Copy(dotstr, p, dotstrlen, char);
10157 vectorize = FALSE; /* done iterating over vecstr */
10164 SvCUR_set(sv, p - SvPVX(sv));
10172 /* =========================================================================
10174 =head1 Cloning an interpreter
10176 All the macros and functions in this section are for the private use of
10177 the main function, perl_clone().
10179 The foo_dup() functions make an exact copy of an existing foo thinngy.
10180 During the course of a cloning, a hash table is used to map old addresses
10181 to new addresses. The table is created and manipulated with the
10182 ptr_table_* functions.
10186 ============================================================================*/
10189 #if defined(USE_ITHREADS)
10191 #ifndef GpREFCNT_inc
10192 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10196 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10197 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10198 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10199 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10200 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10201 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10202 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10203 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10204 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10205 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10206 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10207 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10208 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10211 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10212 regcomp.c. AMS 20010712 */
10215 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10219 struct reg_substr_datum *s;
10222 return (REGEXP *)NULL;
10224 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10227 len = r->offsets[0];
10228 npar = r->nparens+1;
10230 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10231 Copy(r->program, ret->program, len+1, regnode);
10233 New(0, ret->startp, npar, I32);
10234 Copy(r->startp, ret->startp, npar, I32);
10235 New(0, ret->endp, npar, I32);
10236 Copy(r->startp, ret->startp, npar, I32);
10238 New(0, ret->substrs, 1, struct reg_substr_data);
10239 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10240 s->min_offset = r->substrs->data[i].min_offset;
10241 s->max_offset = r->substrs->data[i].max_offset;
10242 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10243 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10246 ret->regstclass = NULL;
10248 struct reg_data *d;
10249 const int count = r->data->count;
10251 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10252 char, struct reg_data);
10253 New(0, d->what, count, U8);
10256 for (i = 0; i < count; i++) {
10257 d->what[i] = r->data->what[i];
10258 switch (d->what[i]) {
10259 /* legal options are one of: sfpont
10260 see also regcomp.h and pregfree() */
10262 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10265 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10268 /* This is cheating. */
10269 New(0, d->data[i], 1, struct regnode_charclass_class);
10270 StructCopy(r->data->data[i], d->data[i],
10271 struct regnode_charclass_class);
10272 ret->regstclass = (regnode*)d->data[i];
10275 /* Compiled op trees are readonly, and can thus be
10276 shared without duplication. */
10278 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10282 d->data[i] = r->data->data[i];
10285 d->data[i] = r->data->data[i];
10287 ((reg_trie_data*)d->data[i])->refcount++;
10291 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10300 New(0, ret->offsets, 2*len+1, U32);
10301 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10303 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10304 ret->refcnt = r->refcnt;
10305 ret->minlen = r->minlen;
10306 ret->prelen = r->prelen;
10307 ret->nparens = r->nparens;
10308 ret->lastparen = r->lastparen;
10309 ret->lastcloseparen = r->lastcloseparen;
10310 ret->reganch = r->reganch;
10312 ret->sublen = r->sublen;
10314 if (RX_MATCH_COPIED(ret))
10315 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10317 ret->subbeg = Nullch;
10318 #ifdef PERL_COPY_ON_WRITE
10319 ret->saved_copy = Nullsv;
10322 ptr_table_store(PL_ptr_table, r, ret);
10326 /* duplicate a file handle */
10329 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10335 return (PerlIO*)NULL;
10337 /* look for it in the table first */
10338 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10342 /* create anew and remember what it is */
10343 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10344 ptr_table_store(PL_ptr_table, fp, ret);
10348 /* duplicate a directory handle */
10351 Perl_dirp_dup(pTHX_ DIR *dp)
10359 /* duplicate a typeglob */
10362 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10367 /* look for it in the table first */
10368 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10372 /* create anew and remember what it is */
10373 Newz(0, ret, 1, GP);
10374 ptr_table_store(PL_ptr_table, gp, ret);
10377 ret->gp_refcnt = 0; /* must be before any other dups! */
10378 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10379 ret->gp_io = io_dup_inc(gp->gp_io, param);
10380 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10381 ret->gp_av = av_dup_inc(gp->gp_av, param);
10382 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10383 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10384 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10385 ret->gp_cvgen = gp->gp_cvgen;
10386 ret->gp_flags = gp->gp_flags;
10387 ret->gp_line = gp->gp_line;
10388 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10392 /* duplicate a chain of magic */
10395 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10397 MAGIC *mgprev = (MAGIC*)NULL;
10400 return (MAGIC*)NULL;
10401 /* look for it in the table first */
10402 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10406 for (; mg; mg = mg->mg_moremagic) {
10408 Newz(0, nmg, 1, MAGIC);
10410 mgprev->mg_moremagic = nmg;
10413 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10414 nmg->mg_private = mg->mg_private;
10415 nmg->mg_type = mg->mg_type;
10416 nmg->mg_flags = mg->mg_flags;
10417 if (mg->mg_type == PERL_MAGIC_qr) {
10418 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10420 else if(mg->mg_type == PERL_MAGIC_backref) {
10421 const AV * const av = (AV*) mg->mg_obj;
10424 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10426 for (i = AvFILLp(av); i >= 0; i--) {
10427 if (!svp[i]) continue;
10428 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10432 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10433 ? sv_dup_inc(mg->mg_obj, param)
10434 : sv_dup(mg->mg_obj, param);
10436 nmg->mg_len = mg->mg_len;
10437 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10438 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10439 if (mg->mg_len > 0) {
10440 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10441 if (mg->mg_type == PERL_MAGIC_overload_table &&
10442 AMT_AMAGIC((AMT*)mg->mg_ptr))
10444 AMT *amtp = (AMT*)mg->mg_ptr;
10445 AMT *namtp = (AMT*)nmg->mg_ptr;
10447 for (i = 1; i < NofAMmeth; i++) {
10448 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10452 else if (mg->mg_len == HEf_SVKEY)
10453 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10455 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10456 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10463 /* create a new pointer-mapping table */
10466 Perl_ptr_table_new(pTHX)
10469 Newz(0, tbl, 1, PTR_TBL_t);
10470 tbl->tbl_max = 511;
10471 tbl->tbl_items = 0;
10472 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10477 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10479 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10482 /* map an existing pointer using a table */
10485 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10487 PTR_TBL_ENT_t *tblent;
10488 UV hash = PTR_TABLE_HASH(sv);
10490 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10491 for (; tblent; tblent = tblent->next) {
10492 if (tblent->oldval == sv)
10493 return tblent->newval;
10495 return (void*)NULL;
10498 /* add a new entry to a pointer-mapping table */
10501 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10503 PTR_TBL_ENT_t *tblent, **otblent;
10504 /* XXX this may be pessimal on platforms where pointers aren't good
10505 * hash values e.g. if they grow faster in the most significant
10507 UV hash = PTR_TABLE_HASH(oldv);
10511 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10512 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10513 if (tblent->oldval == oldv) {
10514 tblent->newval = newv;
10518 Newz(0, tblent, 1, PTR_TBL_ENT_t);
10519 tblent->oldval = oldv;
10520 tblent->newval = newv;
10521 tblent->next = *otblent;
10524 if (!empty && tbl->tbl_items > tbl->tbl_max)
10525 ptr_table_split(tbl);
10528 /* double the hash bucket size of an existing ptr table */
10531 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10533 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10534 UV oldsize = tbl->tbl_max + 1;
10535 UV newsize = oldsize * 2;
10538 Renew(ary, newsize, PTR_TBL_ENT_t*);
10539 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10540 tbl->tbl_max = --newsize;
10541 tbl->tbl_ary = ary;
10542 for (i=0; i < oldsize; i++, ary++) {
10543 PTR_TBL_ENT_t **curentp, **entp, *ent;
10546 curentp = ary + oldsize;
10547 for (entp = ary, ent = *ary; ent; ent = *entp) {
10548 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10550 ent->next = *curentp;
10560 /* remove all the entries from a ptr table */
10563 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10565 register PTR_TBL_ENT_t **array;
10566 register PTR_TBL_ENT_t *entry;
10567 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
10571 if (!tbl || !tbl->tbl_items) {
10575 array = tbl->tbl_ary;
10577 max = tbl->tbl_max;
10582 entry = entry->next;
10586 if (++riter > max) {
10589 entry = array[riter];
10593 tbl->tbl_items = 0;
10596 /* clear and free a ptr table */
10599 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10604 ptr_table_clear(tbl);
10605 Safefree(tbl->tbl_ary);
10610 char *PL_watch_pvx;
10613 /* attempt to make everything in the typeglob readonly */
10616 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10618 GV *gv = (GV*)sstr;
10619 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10621 if (GvIO(gv) || GvFORM(gv)) {
10622 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10624 else if (!GvCV(gv)) {
10625 GvCV(gv) = (CV*)sv;
10628 /* CvPADLISTs cannot be shared */
10629 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10634 if (!GvUNIQUE(gv)) {
10636 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10637 HvNAME(GvSTASH(gv)), GvNAME(gv));
10643 * write attempts will die with
10644 * "Modification of a read-only value attempted"
10650 SvREADONLY_on(GvSV(gv));
10654 GvAV(gv) = (AV*)sv;
10657 SvREADONLY_on(GvAV(gv));
10661 GvHV(gv) = (HV*)sv;
10664 SvREADONLY_on(GvHV(gv));
10667 return sstr; /* he_dup() will SvREFCNT_inc() */
10670 /* duplicate an SV of any type (including AV, HV etc) */
10673 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10676 SvRV_set(dstr, SvWEAKREF(sstr)
10677 ? sv_dup(SvRV(sstr), param)
10678 : sv_dup_inc(SvRV(sstr), param));
10681 else if (SvPVX(sstr)) {
10682 /* Has something there */
10684 /* Normal PV - clone whole allocated space */
10685 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10686 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10687 /* Not that normal - actually sstr is copy on write.
10688 But we are a true, independant SV, so: */
10689 SvREADONLY_off(dstr);
10694 /* Special case - not normally malloced for some reason */
10695 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10696 /* A "shared" PV - clone it as unshared string */
10697 if(SvPADTMP(sstr)) {
10698 /* However, some of them live in the pad
10699 and they should not have these flags
10702 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10704 SvUV_set(dstr, SvUVX(sstr));
10707 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10709 SvREADONLY_off(dstr);
10713 /* Some other special case - random pointer */
10714 SvPV_set(dstr, SvPVX(sstr));
10719 /* Copy the Null */
10720 if (SvTYPE(dstr) == SVt_RV)
10721 SvRV_set(dstr, NULL);
10728 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10732 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10734 /* look for it in the table first */
10735 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10739 if(param->flags & CLONEf_JOIN_IN) {
10740 /** We are joining here so we don't want do clone
10741 something that is bad **/
10743 if(SvTYPE(sstr) == SVt_PVHV &&
10745 /** don't clone stashes if they already exist **/
10746 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10747 return (SV*) old_stash;
10751 /* create anew and remember what it is */
10754 #ifdef DEBUG_LEAKING_SCALARS
10755 dstr->sv_debug_optype = sstr->sv_debug_optype;
10756 dstr->sv_debug_line = sstr->sv_debug_line;
10757 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10758 dstr->sv_debug_cloned = 1;
10760 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10762 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10766 ptr_table_store(PL_ptr_table, sstr, dstr);
10769 SvFLAGS(dstr) = SvFLAGS(sstr);
10770 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10771 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10774 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10775 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10776 PL_watch_pvx, SvPVX(sstr));
10779 /* don't clone objects whose class has asked us not to */
10780 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10781 SvFLAGS(dstr) &= ~SVTYPEMASK;
10782 SvOBJECT_off(dstr);
10786 switch (SvTYPE(sstr)) {
10788 SvANY(dstr) = NULL;
10791 SvANY(dstr) = new_XIV();
10792 SvIV_set(dstr, SvIVX(sstr));
10795 SvANY(dstr) = new_XNV();
10796 SvNV_set(dstr, SvNVX(sstr));
10799 SvANY(dstr) = new_XRV();
10800 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10803 SvANY(dstr) = new_XPV();
10804 SvCUR_set(dstr, SvCUR(sstr));
10805 SvLEN_set(dstr, SvLEN(sstr));
10806 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10809 SvANY(dstr) = new_XPVIV();
10810 SvCUR_set(dstr, SvCUR(sstr));
10811 SvLEN_set(dstr, SvLEN(sstr));
10812 SvIV_set(dstr, SvIVX(sstr));
10813 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10816 SvANY(dstr) = new_XPVNV();
10817 SvCUR_set(dstr, SvCUR(sstr));
10818 SvLEN_set(dstr, SvLEN(sstr));
10819 SvIV_set(dstr, SvIVX(sstr));
10820 SvNV_set(dstr, SvNVX(sstr));
10821 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10824 SvANY(dstr) = new_XPVMG();
10825 SvCUR_set(dstr, SvCUR(sstr));
10826 SvLEN_set(dstr, SvLEN(sstr));
10827 SvIV_set(dstr, SvIVX(sstr));
10828 SvNV_set(dstr, SvNVX(sstr));
10829 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10830 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10831 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10834 SvANY(dstr) = new_XPVBM();
10835 SvCUR_set(dstr, SvCUR(sstr));
10836 SvLEN_set(dstr, SvLEN(sstr));
10837 SvIV_set(dstr, SvIVX(sstr));
10838 SvNV_set(dstr, SvNVX(sstr));
10839 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10840 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10841 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10842 BmRARE(dstr) = BmRARE(sstr);
10843 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10844 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10847 SvANY(dstr) = new_XPVLV();
10848 SvCUR_set(dstr, SvCUR(sstr));
10849 SvLEN_set(dstr, SvLEN(sstr));
10850 SvIV_set(dstr, SvIVX(sstr));
10851 SvNV_set(dstr, SvNVX(sstr));
10852 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10853 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10854 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10855 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10856 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10857 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10858 LvTARG(dstr) = dstr;
10859 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10860 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10862 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10863 LvTYPE(dstr) = LvTYPE(sstr);
10866 if (GvUNIQUE((GV*)sstr)) {
10868 if ((share = gv_share(sstr, param))) {
10871 ptr_table_store(PL_ptr_table, sstr, dstr);
10873 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10874 HvNAME(GvSTASH(share)), GvNAME(share));
10879 SvANY(dstr) = new_XPVGV();
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 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10888 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10889 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10890 GvFLAGS(dstr) = GvFLAGS(sstr);
10891 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10892 (void)GpREFCNT_inc(GvGP(dstr));
10895 SvANY(dstr) = new_XPVIO();
10896 SvCUR_set(dstr, SvCUR(sstr));
10897 SvLEN_set(dstr, SvLEN(sstr));
10898 SvIV_set(dstr, SvIVX(sstr));
10899 SvNV_set(dstr, SvNVX(sstr));
10900 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10901 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10902 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10903 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10904 if (IoOFP(sstr) == IoIFP(sstr))
10905 IoOFP(dstr) = IoIFP(dstr);
10907 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10908 /* PL_rsfp_filters entries have fake IoDIRP() */
10909 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10910 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10912 IoDIRP(dstr) = IoDIRP(sstr);
10913 IoLINES(dstr) = IoLINES(sstr);
10914 IoPAGE(dstr) = IoPAGE(sstr);
10915 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10916 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10917 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10918 /* I have no idea why fake dirp (rsfps)
10919 should be treaded differently but otherwise
10920 we end up with leaks -- sky*/
10921 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10922 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10923 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10925 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10926 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10927 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10929 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10930 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10931 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10932 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10933 IoTYPE(dstr) = IoTYPE(sstr);
10934 IoFLAGS(dstr) = IoFLAGS(sstr);
10937 SvANY(dstr) = new_XPVAV();
10938 SvCUR_set(dstr, SvCUR(sstr));
10939 SvLEN_set(dstr, SvLEN(sstr));
10940 SvIV_set(dstr, SvIVX(sstr));
10941 SvNV_set(dstr, SvNVX(sstr));
10942 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10943 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10944 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10945 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10946 if (AvARRAY((AV*)sstr)) {
10947 SV **dst_ary, **src_ary;
10948 SSize_t items = AvFILLp((AV*)sstr) + 1;
10950 src_ary = AvARRAY((AV*)sstr);
10951 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10952 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10953 SvPV_set(dstr, (char*)dst_ary);
10954 AvALLOC((AV*)dstr) = dst_ary;
10955 if (AvREAL((AV*)sstr)) {
10956 while (items-- > 0)
10957 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10960 while (items-- > 0)
10961 *dst_ary++ = sv_dup(*src_ary++, param);
10963 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10964 while (items-- > 0) {
10965 *dst_ary++ = &PL_sv_undef;
10969 SvPV_set(dstr, Nullch);
10970 AvALLOC((AV*)dstr) = (SV**)NULL;
10974 SvANY(dstr) = new_XPVHV();
10975 SvCUR_set(dstr, SvCUR(sstr));
10976 SvLEN_set(dstr, SvLEN(sstr));
10977 SvIV_set(dstr, SvIVX(sstr));
10978 SvNV_set(dstr, SvNVX(sstr));
10979 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10980 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10981 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10982 if (HvARRAY((HV*)sstr)) {
10984 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10985 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10986 Newz(0, dxhv->xhv_array,
10987 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10988 while (i <= sxhv->xhv_max) {
10989 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10990 (bool)!!HvSHAREKEYS(sstr),
10994 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10995 (bool)!!HvSHAREKEYS(sstr), param);
10998 SvPV_set(dstr, Nullch);
10999 HvEITER((HV*)dstr) = (HE*)NULL;
11001 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
11002 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
11003 /* Record stashes for possible cloning in Perl_clone(). */
11004 if(HvNAME((HV*)dstr))
11005 av_push(param->stashes, dstr);
11008 SvANY(dstr) = new_XPVFM();
11009 FmLINES(dstr) = FmLINES(sstr);
11013 SvANY(dstr) = new_XPVCV();
11015 SvCUR_set(dstr, SvCUR(sstr));
11016 SvLEN_set(dstr, SvLEN(sstr));
11017 SvIV_set(dstr, SvIVX(sstr));
11018 SvNV_set(dstr, SvNVX(sstr));
11019 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
11020 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
11021 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
11022 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
11023 CvSTART(dstr) = CvSTART(sstr);
11025 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
11027 CvXSUB(dstr) = CvXSUB(sstr);
11028 CvXSUBANY(dstr) = CvXSUBANY(sstr);
11029 if (CvCONST(sstr)) {
11030 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
11031 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
11032 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
11034 /* don't dup if copying back - CvGV isn't refcounted, so the
11035 * duped GV may never be freed. A bit of a hack! DAPM */
11036 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
11037 Nullgv : gv_dup(CvGV(sstr), param) ;
11038 if (param->flags & CLONEf_COPY_STACKS) {
11039 CvDEPTH(dstr) = CvDEPTH(sstr);
11043 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
11044 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
11046 CvWEAKOUTSIDE(sstr)
11047 ? cv_dup( CvOUTSIDE(sstr), param)
11048 : cv_dup_inc(CvOUTSIDE(sstr), param);
11049 CvFLAGS(dstr) = CvFLAGS(sstr);
11050 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
11053 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
11057 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
11063 /* duplicate a context */
11066 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11068 PERL_CONTEXT *ncxs;
11071 return (PERL_CONTEXT*)NULL;
11073 /* look for it in the table first */
11074 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11078 /* create anew and remember what it is */
11079 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11080 ptr_table_store(PL_ptr_table, cxs, ncxs);
11083 PERL_CONTEXT *cx = &cxs[ix];
11084 PERL_CONTEXT *ncx = &ncxs[ix];
11085 ncx->cx_type = cx->cx_type;
11086 if (CxTYPE(cx) == CXt_SUBST) {
11087 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11090 ncx->blk_oldsp = cx->blk_oldsp;
11091 ncx->blk_oldcop = cx->blk_oldcop;
11092 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11093 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11094 ncx->blk_oldpm = cx->blk_oldpm;
11095 ncx->blk_gimme = cx->blk_gimme;
11096 switch (CxTYPE(cx)) {
11098 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11099 ? cv_dup_inc(cx->blk_sub.cv, param)
11100 : cv_dup(cx->blk_sub.cv,param));
11101 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11102 ? av_dup_inc(cx->blk_sub.argarray, param)
11104 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11105 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11106 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11107 ncx->blk_sub.lval = cx->blk_sub.lval;
11108 ncx->blk_sub.retop = cx->blk_sub.retop;
11111 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11112 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11113 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11114 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11115 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11116 ncx->blk_eval.retop = cx->blk_eval.retop;
11119 ncx->blk_loop.label = cx->blk_loop.label;
11120 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11121 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11122 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11123 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11124 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11125 ? cx->blk_loop.iterdata
11126 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11127 ncx->blk_loop.oldcomppad
11128 = (PAD*)ptr_table_fetch(PL_ptr_table,
11129 cx->blk_loop.oldcomppad);
11130 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11131 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11132 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11133 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11134 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11137 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11138 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11139 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11140 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11141 ncx->blk_sub.retop = cx->blk_sub.retop;
11153 /* duplicate a stack info structure */
11156 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11161 return (PERL_SI*)NULL;
11163 /* look for it in the table first */
11164 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11168 /* create anew and remember what it is */
11169 Newz(56, nsi, 1, PERL_SI);
11170 ptr_table_store(PL_ptr_table, si, nsi);
11172 nsi->si_stack = av_dup_inc(si->si_stack, param);
11173 nsi->si_cxix = si->si_cxix;
11174 nsi->si_cxmax = si->si_cxmax;
11175 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11176 nsi->si_type = si->si_type;
11177 nsi->si_prev = si_dup(si->si_prev, param);
11178 nsi->si_next = si_dup(si->si_next, param);
11179 nsi->si_markoff = si->si_markoff;
11184 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11185 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11186 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11187 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11188 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11189 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11190 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11191 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11192 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11193 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11194 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11195 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11196 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11197 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11200 #define pv_dup_inc(p) SAVEPV(p)
11201 #define pv_dup(p) SAVEPV(p)
11202 #define svp_dup_inc(p,pp) any_dup(p,pp)
11204 /* map any object to the new equivent - either something in the
11205 * ptr table, or something in the interpreter structure
11209 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11214 return (void*)NULL;
11216 /* look for it in the table first */
11217 ret = ptr_table_fetch(PL_ptr_table, v);
11221 /* see if it is part of the interpreter structure */
11222 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11223 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11231 /* duplicate the save stack */
11234 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11236 ANY *ss = proto_perl->Tsavestack;
11237 I32 ix = proto_perl->Tsavestack_ix;
11238 I32 max = proto_perl->Tsavestack_max;
11251 void (*dptr) (void*);
11252 void (*dxptr) (pTHX_ void*);
11255 Newz(54, nss, max, ANY);
11259 TOPINT(nss,ix) = i;
11261 case SAVEt_ITEM: /* normal string */
11262 sv = (SV*)POPPTR(ss,ix);
11263 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11264 sv = (SV*)POPPTR(ss,ix);
11265 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11267 case SAVEt_SV: /* scalar reference */
11268 sv = (SV*)POPPTR(ss,ix);
11269 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11270 gv = (GV*)POPPTR(ss,ix);
11271 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11273 case SAVEt_GENERIC_PVREF: /* generic char* */
11274 c = (char*)POPPTR(ss,ix);
11275 TOPPTR(nss,ix) = pv_dup(c);
11276 ptr = POPPTR(ss,ix);
11277 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11279 case SAVEt_SHARED_PVREF: /* char* in shared space */
11280 c = (char*)POPPTR(ss,ix);
11281 TOPPTR(nss,ix) = savesharedpv(c);
11282 ptr = POPPTR(ss,ix);
11283 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11285 case SAVEt_GENERIC_SVREF: /* generic sv */
11286 case SAVEt_SVREF: /* scalar reference */
11287 sv = (SV*)POPPTR(ss,ix);
11288 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11289 ptr = POPPTR(ss,ix);
11290 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11292 case SAVEt_AV: /* array reference */
11293 av = (AV*)POPPTR(ss,ix);
11294 TOPPTR(nss,ix) = av_dup_inc(av, param);
11295 gv = (GV*)POPPTR(ss,ix);
11296 TOPPTR(nss,ix) = gv_dup(gv, param);
11298 case SAVEt_HV: /* hash reference */
11299 hv = (HV*)POPPTR(ss,ix);
11300 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11301 gv = (GV*)POPPTR(ss,ix);
11302 TOPPTR(nss,ix) = gv_dup(gv, param);
11304 case SAVEt_INT: /* int reference */
11305 ptr = POPPTR(ss,ix);
11306 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11307 intval = (int)POPINT(ss,ix);
11308 TOPINT(nss,ix) = intval;
11310 case SAVEt_LONG: /* long reference */
11311 ptr = POPPTR(ss,ix);
11312 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11313 longval = (long)POPLONG(ss,ix);
11314 TOPLONG(nss,ix) = longval;
11316 case SAVEt_I32: /* I32 reference */
11317 case SAVEt_I16: /* I16 reference */
11318 case SAVEt_I8: /* I8 reference */
11319 ptr = POPPTR(ss,ix);
11320 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11322 TOPINT(nss,ix) = i;
11324 case SAVEt_IV: /* IV reference */
11325 ptr = POPPTR(ss,ix);
11326 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11328 TOPIV(nss,ix) = iv;
11330 case SAVEt_SPTR: /* SV* reference */
11331 ptr = POPPTR(ss,ix);
11332 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11333 sv = (SV*)POPPTR(ss,ix);
11334 TOPPTR(nss,ix) = sv_dup(sv, param);
11336 case SAVEt_VPTR: /* random* reference */
11337 ptr = POPPTR(ss,ix);
11338 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11339 ptr = POPPTR(ss,ix);
11340 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11342 case SAVEt_PPTR: /* char* reference */
11343 ptr = POPPTR(ss,ix);
11344 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11345 c = (char*)POPPTR(ss,ix);
11346 TOPPTR(nss,ix) = pv_dup(c);
11348 case SAVEt_HPTR: /* HV* reference */
11349 ptr = POPPTR(ss,ix);
11350 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11351 hv = (HV*)POPPTR(ss,ix);
11352 TOPPTR(nss,ix) = hv_dup(hv, param);
11354 case SAVEt_APTR: /* AV* reference */
11355 ptr = POPPTR(ss,ix);
11356 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11357 av = (AV*)POPPTR(ss,ix);
11358 TOPPTR(nss,ix) = av_dup(av, param);
11361 gv = (GV*)POPPTR(ss,ix);
11362 TOPPTR(nss,ix) = gv_dup(gv, param);
11364 case SAVEt_GP: /* scalar reference */
11365 gp = (GP*)POPPTR(ss,ix);
11366 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11367 (void)GpREFCNT_inc(gp);
11368 gv = (GV*)POPPTR(ss,ix);
11369 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11370 c = (char*)POPPTR(ss,ix);
11371 TOPPTR(nss,ix) = pv_dup(c);
11373 TOPIV(nss,ix) = iv;
11375 TOPIV(nss,ix) = iv;
11378 case SAVEt_MORTALIZESV:
11379 sv = (SV*)POPPTR(ss,ix);
11380 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11383 ptr = POPPTR(ss,ix);
11384 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11385 /* these are assumed to be refcounted properly */
11386 switch (((OP*)ptr)->op_type) {
11388 case OP_LEAVESUBLV:
11392 case OP_LEAVEWRITE:
11393 TOPPTR(nss,ix) = ptr;
11398 TOPPTR(nss,ix) = Nullop;
11403 TOPPTR(nss,ix) = Nullop;
11406 c = (char*)POPPTR(ss,ix);
11407 TOPPTR(nss,ix) = pv_dup_inc(c);
11409 case SAVEt_CLEARSV:
11410 longval = POPLONG(ss,ix);
11411 TOPLONG(nss,ix) = longval;
11414 hv = (HV*)POPPTR(ss,ix);
11415 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11416 c = (char*)POPPTR(ss,ix);
11417 TOPPTR(nss,ix) = pv_dup_inc(c);
11419 TOPINT(nss,ix) = i;
11421 case SAVEt_DESTRUCTOR:
11422 ptr = POPPTR(ss,ix);
11423 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11424 dptr = POPDPTR(ss,ix);
11425 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11427 case SAVEt_DESTRUCTOR_X:
11428 ptr = POPPTR(ss,ix);
11429 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11430 dxptr = POPDXPTR(ss,ix);
11431 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11433 case SAVEt_REGCONTEXT:
11436 TOPINT(nss,ix) = i;
11439 case SAVEt_STACK_POS: /* Position on Perl stack */
11441 TOPINT(nss,ix) = i;
11443 case SAVEt_AELEM: /* array element */
11444 sv = (SV*)POPPTR(ss,ix);
11445 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11447 TOPINT(nss,ix) = i;
11448 av = (AV*)POPPTR(ss,ix);
11449 TOPPTR(nss,ix) = av_dup_inc(av, param);
11451 case SAVEt_HELEM: /* hash element */
11452 sv = (SV*)POPPTR(ss,ix);
11453 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11454 sv = (SV*)POPPTR(ss,ix);
11455 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11456 hv = (HV*)POPPTR(ss,ix);
11457 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11460 ptr = POPPTR(ss,ix);
11461 TOPPTR(nss,ix) = ptr;
11465 TOPINT(nss,ix) = i;
11467 case SAVEt_COMPPAD:
11468 av = (AV*)POPPTR(ss,ix);
11469 TOPPTR(nss,ix) = av_dup(av, param);
11472 longval = (long)POPLONG(ss,ix);
11473 TOPLONG(nss,ix) = longval;
11474 ptr = POPPTR(ss,ix);
11475 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11476 sv = (SV*)POPPTR(ss,ix);
11477 TOPPTR(nss,ix) = sv_dup(sv, param);
11480 ptr = POPPTR(ss,ix);
11481 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11482 longval = (long)POPBOOL(ss,ix);
11483 TOPBOOL(nss,ix) = (bool)longval;
11485 case SAVEt_SET_SVFLAGS:
11487 TOPINT(nss,ix) = i;
11489 TOPINT(nss,ix) = i;
11490 sv = (SV*)POPPTR(ss,ix);
11491 TOPPTR(nss,ix) = sv_dup(sv, param);
11494 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11502 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11503 * flag to the result. This is done for each stash before cloning starts,
11504 * so we know which stashes want their objects cloned */
11507 do_mark_cloneable_stash(pTHX_ SV *sv)
11509 if (HvNAME((HV*)sv)) {
11510 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11511 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11512 if (cloner && GvCV(cloner)) {
11519 XPUSHs(sv_2mortal(newSVpv(HvNAME((HV*)sv), 0)));
11521 call_sv((SV*)GvCV(cloner), G_SCALAR);
11528 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11536 =for apidoc perl_clone
11538 Create and return a new interpreter by cloning the current one.
11540 perl_clone takes these flags as parameters:
11542 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11543 without it we only clone the data and zero the stacks,
11544 with it we copy the stacks and the new perl interpreter is
11545 ready to run at the exact same point as the previous one.
11546 The pseudo-fork code uses COPY_STACKS while the
11547 threads->new doesn't.
11549 CLONEf_KEEP_PTR_TABLE
11550 perl_clone keeps a ptr_table with the pointer of the old
11551 variable as a key and the new variable as a value,
11552 this allows it to check if something has been cloned and not
11553 clone it again but rather just use the value and increase the
11554 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11555 the ptr_table using the function
11556 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11557 reason to keep it around is if you want to dup some of your own
11558 variable who are outside the graph perl scans, example of this
11559 code is in threads.xs create
11562 This is a win32 thing, it is ignored on unix, it tells perls
11563 win32host code (which is c++) to clone itself, this is needed on
11564 win32 if you want to run two threads at the same time,
11565 if you just want to do some stuff in a separate perl interpreter
11566 and then throw it away and return to the original one,
11567 you don't need to do anything.
11572 /* XXX the above needs expanding by someone who actually understands it ! */
11573 EXTERN_C PerlInterpreter *
11574 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11577 perl_clone(PerlInterpreter *proto_perl, UV flags)
11579 #ifdef PERL_IMPLICIT_SYS
11581 /* perlhost.h so we need to call into it
11582 to clone the host, CPerlHost should have a c interface, sky */
11584 if (flags & CLONEf_CLONE_HOST) {
11585 return perl_clone_host(proto_perl,flags);
11587 return perl_clone_using(proto_perl, flags,
11589 proto_perl->IMemShared,
11590 proto_perl->IMemParse,
11592 proto_perl->IStdIO,
11596 proto_perl->IProc);
11600 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11601 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11602 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11603 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11604 struct IPerlDir* ipD, struct IPerlSock* ipS,
11605 struct IPerlProc* ipP)
11607 /* XXX many of the string copies here can be optimized if they're
11608 * constants; they need to be allocated as common memory and just
11609 * their pointers copied. */
11612 CLONE_PARAMS clone_params;
11613 CLONE_PARAMS* param = &clone_params;
11615 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11616 /* for each stash, determine whether its objects should be cloned */
11617 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11618 PERL_SET_THX(my_perl);
11621 Poison(my_perl, 1, PerlInterpreter);
11623 PL_curcop = (COP *)Nullop;
11627 PL_savestack_ix = 0;
11628 PL_savestack_max = -1;
11629 PL_sig_pending = 0;
11630 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11631 # else /* !DEBUGGING */
11632 Zero(my_perl, 1, PerlInterpreter);
11633 # endif /* DEBUGGING */
11635 /* host pointers */
11637 PL_MemShared = ipMS;
11638 PL_MemParse = ipMP;
11645 #else /* !PERL_IMPLICIT_SYS */
11647 CLONE_PARAMS clone_params;
11648 CLONE_PARAMS* param = &clone_params;
11649 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11650 /* for each stash, determine whether its objects should be cloned */
11651 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11652 PERL_SET_THX(my_perl);
11655 Poison(my_perl, 1, PerlInterpreter);
11657 PL_curcop = (COP *)Nullop;
11661 PL_savestack_ix = 0;
11662 PL_savestack_max = -1;
11663 PL_sig_pending = 0;
11664 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11665 # else /* !DEBUGGING */
11666 Zero(my_perl, 1, PerlInterpreter);
11667 # endif /* DEBUGGING */
11668 #endif /* PERL_IMPLICIT_SYS */
11669 param->flags = flags;
11670 param->proto_perl = proto_perl;
11673 PL_xiv_arenaroot = NULL;
11674 PL_xiv_root = NULL;
11675 PL_xnv_arenaroot = NULL;
11676 PL_xnv_root = NULL;
11677 PL_xrv_arenaroot = NULL;
11678 PL_xrv_root = NULL;
11679 PL_xpv_arenaroot = NULL;
11680 PL_xpv_root = NULL;
11681 PL_xpviv_arenaroot = NULL;
11682 PL_xpviv_root = NULL;
11683 PL_xpvnv_arenaroot = NULL;
11684 PL_xpvnv_root = NULL;
11685 PL_xpvcv_arenaroot = NULL;
11686 PL_xpvcv_root = NULL;
11687 PL_xpvav_arenaroot = NULL;
11688 PL_xpvav_root = NULL;
11689 PL_xpvhv_arenaroot = NULL;
11690 PL_xpvhv_root = NULL;
11691 PL_xpvmg_arenaroot = NULL;
11692 PL_xpvmg_root = NULL;
11693 PL_xpvlv_arenaroot = NULL;
11694 PL_xpvlv_root = NULL;
11695 PL_xpvbm_arenaroot = NULL;
11696 PL_xpvbm_root = NULL;
11697 PL_he_arenaroot = NULL;
11699 PL_nice_chunk = NULL;
11700 PL_nice_chunk_size = 0;
11702 PL_sv_objcount = 0;
11703 PL_sv_root = Nullsv;
11704 PL_sv_arenaroot = Nullsv;
11706 PL_debug = proto_perl->Idebug;
11708 #ifdef USE_REENTRANT_API
11709 /* XXX: things like -Dm will segfault here in perlio, but doing
11710 * PERL_SET_CONTEXT(proto_perl);
11711 * breaks too many other things
11713 Perl_reentrant_init(aTHX);
11716 /* create SV map for pointer relocation */
11717 PL_ptr_table = ptr_table_new();
11719 /* initialize these special pointers as early as possible */
11720 SvANY(&PL_sv_undef) = NULL;
11721 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11722 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11723 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11725 SvANY(&PL_sv_no) = new_XPVNV();
11726 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11727 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11728 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11729 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11730 SvCUR_set(&PL_sv_no, 0);
11731 SvLEN_set(&PL_sv_no, 1);
11732 SvIV_set(&PL_sv_no, 0);
11733 SvNV_set(&PL_sv_no, 0);
11734 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11736 SvANY(&PL_sv_yes) = new_XPVNV();
11737 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11738 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11739 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11740 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11741 SvCUR_set(&PL_sv_yes, 1);
11742 SvLEN_set(&PL_sv_yes, 2);
11743 SvIV_set(&PL_sv_yes, 1);
11744 SvNV_set(&PL_sv_yes, 1);
11745 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11747 /* create (a non-shared!) shared string table */
11748 PL_strtab = newHV();
11749 HvSHAREKEYS_off(PL_strtab);
11750 hv_ksplit(PL_strtab, 512);
11751 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11753 PL_compiling = proto_perl->Icompiling;
11755 /* These two PVs will be free'd special way so must set them same way op.c does */
11756 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11757 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11759 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11760 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11762 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11763 if (!specialWARN(PL_compiling.cop_warnings))
11764 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11765 if (!specialCopIO(PL_compiling.cop_io))
11766 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11767 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11769 /* pseudo environmental stuff */
11770 PL_origargc = proto_perl->Iorigargc;
11771 PL_origargv = proto_perl->Iorigargv;
11773 param->stashes = newAV(); /* Setup array of objects to call clone on */
11775 #ifdef PERLIO_LAYERS
11776 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11777 PerlIO_clone(aTHX_ proto_perl, param);
11780 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11781 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11782 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11783 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11784 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11785 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11788 PL_minus_c = proto_perl->Iminus_c;
11789 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11790 PL_localpatches = proto_perl->Ilocalpatches;
11791 PL_splitstr = proto_perl->Isplitstr;
11792 PL_preprocess = proto_perl->Ipreprocess;
11793 PL_minus_n = proto_perl->Iminus_n;
11794 PL_minus_p = proto_perl->Iminus_p;
11795 PL_minus_l = proto_perl->Iminus_l;
11796 PL_minus_a = proto_perl->Iminus_a;
11797 PL_minus_F = proto_perl->Iminus_F;
11798 PL_doswitches = proto_perl->Idoswitches;
11799 PL_dowarn = proto_perl->Idowarn;
11800 PL_doextract = proto_perl->Idoextract;
11801 PL_sawampersand = proto_perl->Isawampersand;
11802 PL_unsafe = proto_perl->Iunsafe;
11803 PL_inplace = SAVEPV(proto_perl->Iinplace);
11804 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11805 PL_perldb = proto_perl->Iperldb;
11806 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11807 PL_exit_flags = proto_perl->Iexit_flags;
11809 /* magical thingies */
11810 /* XXX time(&PL_basetime) when asked for? */
11811 PL_basetime = proto_perl->Ibasetime;
11812 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11814 PL_maxsysfd = proto_perl->Imaxsysfd;
11815 PL_multiline = proto_perl->Imultiline;
11816 PL_statusvalue = proto_perl->Istatusvalue;
11818 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11820 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11822 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11823 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11824 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11826 /* Clone the regex array */
11827 PL_regex_padav = newAV();
11829 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11830 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11831 av_push(PL_regex_padav,
11832 sv_dup_inc(regexen[0],param));
11833 for(i = 1; i <= len; i++) {
11834 if(SvREPADTMP(regexen[i])) {
11835 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11837 av_push(PL_regex_padav,
11839 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11840 SvIVX(regexen[i])), param)))
11845 PL_regex_pad = AvARRAY(PL_regex_padav);
11847 /* shortcuts to various I/O objects */
11848 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11849 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11850 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11851 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11852 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11853 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11855 /* shortcuts to regexp stuff */
11856 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11858 /* shortcuts to misc objects */
11859 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11861 /* shortcuts to debugging objects */
11862 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11863 PL_DBline = gv_dup(proto_perl->IDBline, param);
11864 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11865 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11866 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11867 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11868 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11869 PL_lineary = av_dup(proto_perl->Ilineary, param);
11870 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11872 /* symbol tables */
11873 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11874 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11875 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11876 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11877 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11879 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11880 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11881 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11882 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11883 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11884 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11886 PL_sub_generation = proto_perl->Isub_generation;
11888 /* funky return mechanisms */
11889 PL_forkprocess = proto_perl->Iforkprocess;
11891 /* subprocess state */
11892 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11894 /* internal state */
11895 PL_tainting = proto_perl->Itainting;
11896 PL_taint_warn = proto_perl->Itaint_warn;
11897 PL_maxo = proto_perl->Imaxo;
11898 if (proto_perl->Iop_mask)
11899 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11901 PL_op_mask = Nullch;
11902 /* PL_asserting = proto_perl->Iasserting; */
11904 /* current interpreter roots */
11905 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11906 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11907 PL_main_start = proto_perl->Imain_start;
11908 PL_eval_root = proto_perl->Ieval_root;
11909 PL_eval_start = proto_perl->Ieval_start;
11911 /* runtime control stuff */
11912 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11913 PL_copline = proto_perl->Icopline;
11915 PL_filemode = proto_perl->Ifilemode;
11916 PL_lastfd = proto_perl->Ilastfd;
11917 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11920 PL_gensym = proto_perl->Igensym;
11921 PL_preambled = proto_perl->Ipreambled;
11922 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11923 PL_laststatval = proto_perl->Ilaststatval;
11924 PL_laststype = proto_perl->Ilaststype;
11925 PL_mess_sv = Nullsv;
11927 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11928 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11930 /* interpreter atexit processing */
11931 PL_exitlistlen = proto_perl->Iexitlistlen;
11932 if (PL_exitlistlen) {
11933 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11934 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11937 PL_exitlist = (PerlExitListEntry*)NULL;
11938 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11939 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11940 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11942 PL_profiledata = NULL;
11943 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11944 /* PL_rsfp_filters entries have fake IoDIRP() */
11945 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11947 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11949 PAD_CLONE_VARS(proto_perl, param);
11951 #ifdef HAVE_INTERP_INTERN
11952 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11955 /* more statics moved here */
11956 PL_generation = proto_perl->Igeneration;
11957 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11959 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11960 PL_in_clean_all = proto_perl->Iin_clean_all;
11962 PL_uid = proto_perl->Iuid;
11963 PL_euid = proto_perl->Ieuid;
11964 PL_gid = proto_perl->Igid;
11965 PL_egid = proto_perl->Iegid;
11966 PL_nomemok = proto_perl->Inomemok;
11967 PL_an = proto_perl->Ian;
11968 PL_evalseq = proto_perl->Ievalseq;
11969 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11970 PL_origalen = proto_perl->Iorigalen;
11971 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11972 PL_osname = SAVEPV(proto_perl->Iosname);
11973 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11974 PL_sighandlerp = proto_perl->Isighandlerp;
11977 PL_runops = proto_perl->Irunops;
11979 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11982 PL_cshlen = proto_perl->Icshlen;
11983 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11986 PL_lex_state = proto_perl->Ilex_state;
11987 PL_lex_defer = proto_perl->Ilex_defer;
11988 PL_lex_expect = proto_perl->Ilex_expect;
11989 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11990 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11991 PL_lex_starts = proto_perl->Ilex_starts;
11992 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11993 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11994 PL_lex_op = proto_perl->Ilex_op;
11995 PL_lex_inpat = proto_perl->Ilex_inpat;
11996 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11997 PL_lex_brackets = proto_perl->Ilex_brackets;
11998 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11999 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
12000 PL_lex_casemods = proto_perl->Ilex_casemods;
12001 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
12002 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
12004 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
12005 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
12006 PL_nexttoke = proto_perl->Inexttoke;
12008 /* XXX This is probably masking the deeper issue of why
12009 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
12010 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
12011 * (A little debugging with a watchpoint on it may help.)
12013 if (SvANY(proto_perl->Ilinestr)) {
12014 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
12015 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
12016 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12017 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
12018 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12019 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
12020 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12021 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
12022 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12025 PL_linestr = NEWSV(65,79);
12026 sv_upgrade(PL_linestr,SVt_PVIV);
12027 sv_setpvn(PL_linestr,"",0);
12028 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
12030 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12031 PL_pending_ident = proto_perl->Ipending_ident;
12032 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
12034 PL_expect = proto_perl->Iexpect;
12036 PL_multi_start = proto_perl->Imulti_start;
12037 PL_multi_end = proto_perl->Imulti_end;
12038 PL_multi_open = proto_perl->Imulti_open;
12039 PL_multi_close = proto_perl->Imulti_close;
12041 PL_error_count = proto_perl->Ierror_count;
12042 PL_subline = proto_perl->Isubline;
12043 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
12045 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
12046 if (SvANY(proto_perl->Ilinestr)) {
12047 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
12048 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12049 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
12050 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12051 PL_last_lop_op = proto_perl->Ilast_lop_op;
12054 PL_last_uni = SvPVX(PL_linestr);
12055 PL_last_lop = SvPVX(PL_linestr);
12056 PL_last_lop_op = 0;
12058 PL_in_my = proto_perl->Iin_my;
12059 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12061 PL_cryptseen = proto_perl->Icryptseen;
12064 PL_hints = proto_perl->Ihints;
12066 PL_amagic_generation = proto_perl->Iamagic_generation;
12068 #ifdef USE_LOCALE_COLLATE
12069 PL_collation_ix = proto_perl->Icollation_ix;
12070 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12071 PL_collation_standard = proto_perl->Icollation_standard;
12072 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12073 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12074 #endif /* USE_LOCALE_COLLATE */
12076 #ifdef USE_LOCALE_NUMERIC
12077 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12078 PL_numeric_standard = proto_perl->Inumeric_standard;
12079 PL_numeric_local = proto_perl->Inumeric_local;
12080 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12081 #endif /* !USE_LOCALE_NUMERIC */
12083 /* utf8 character classes */
12084 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12085 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12086 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12087 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12088 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12089 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12090 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12091 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12092 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12093 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12094 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12095 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12096 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12097 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12098 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12099 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12100 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12101 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12102 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12103 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12105 /* Did the locale setup indicate UTF-8? */
12106 PL_utf8locale = proto_perl->Iutf8locale;
12107 /* Unicode features (see perlrun/-C) */
12108 PL_unicode = proto_perl->Iunicode;
12110 /* Pre-5.8 signals control */
12111 PL_signals = proto_perl->Isignals;
12113 /* times() ticks per second */
12114 PL_clocktick = proto_perl->Iclocktick;
12116 /* Recursion stopper for PerlIO_find_layer */
12117 PL_in_load_module = proto_perl->Iin_load_module;
12119 /* sort() routine */
12120 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12122 /* Not really needed/useful since the reenrant_retint is "volatile",
12123 * but do it for consistency's sake. */
12124 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12126 /* Hooks to shared SVs and locks. */
12127 PL_sharehook = proto_perl->Isharehook;
12128 PL_lockhook = proto_perl->Ilockhook;
12129 PL_unlockhook = proto_perl->Iunlockhook;
12130 PL_threadhook = proto_perl->Ithreadhook;
12132 PL_runops_std = proto_perl->Irunops_std;
12133 PL_runops_dbg = proto_perl->Irunops_dbg;
12135 #ifdef THREADS_HAVE_PIDS
12136 PL_ppid = proto_perl->Ippid;
12140 PL_last_swash_hv = Nullhv; /* reinits on demand */
12141 PL_last_swash_klen = 0;
12142 PL_last_swash_key[0]= '\0';
12143 PL_last_swash_tmps = (U8*)NULL;
12144 PL_last_swash_slen = 0;
12146 PL_glob_index = proto_perl->Iglob_index;
12147 PL_srand_called = proto_perl->Isrand_called;
12148 PL_hash_seed = proto_perl->Ihash_seed;
12149 PL_rehash_seed = proto_perl->Irehash_seed;
12150 PL_uudmap['M'] = 0; /* reinits on demand */
12151 PL_bitcount = Nullch; /* reinits on demand */
12153 if (proto_perl->Ipsig_pend) {
12154 Newz(0, PL_psig_pend, SIG_SIZE, int);
12157 PL_psig_pend = (int*)NULL;
12160 if (proto_perl->Ipsig_ptr) {
12161 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12162 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12163 for (i = 1; i < SIG_SIZE; i++) {
12164 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12165 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12169 PL_psig_ptr = (SV**)NULL;
12170 PL_psig_name = (SV**)NULL;
12173 /* thrdvar.h stuff */
12175 if (flags & CLONEf_COPY_STACKS) {
12176 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12177 PL_tmps_ix = proto_perl->Ttmps_ix;
12178 PL_tmps_max = proto_perl->Ttmps_max;
12179 PL_tmps_floor = proto_perl->Ttmps_floor;
12180 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12182 while (i <= PL_tmps_ix) {
12183 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12187 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12188 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12189 Newz(54, PL_markstack, i, I32);
12190 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12191 - proto_perl->Tmarkstack);
12192 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12193 - proto_perl->Tmarkstack);
12194 Copy(proto_perl->Tmarkstack, PL_markstack,
12195 PL_markstack_ptr - PL_markstack + 1, I32);
12197 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12198 * NOTE: unlike the others! */
12199 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12200 PL_scopestack_max = proto_perl->Tscopestack_max;
12201 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12202 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12204 /* NOTE: si_dup() looks at PL_markstack */
12205 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12207 /* PL_curstack = PL_curstackinfo->si_stack; */
12208 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12209 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12211 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12212 PL_stack_base = AvARRAY(PL_curstack);
12213 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12214 - proto_perl->Tstack_base);
12215 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12217 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12218 * NOTE: unlike the others! */
12219 PL_savestack_ix = proto_perl->Tsavestack_ix;
12220 PL_savestack_max = proto_perl->Tsavestack_max;
12221 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12222 PL_savestack = ss_dup(proto_perl, param);
12226 ENTER; /* perl_destruct() wants to LEAVE; */
12229 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12230 PL_top_env = &PL_start_env;
12232 PL_op = proto_perl->Top;
12235 PL_Xpv = (XPV*)NULL;
12236 PL_na = proto_perl->Tna;
12238 PL_statbuf = proto_perl->Tstatbuf;
12239 PL_statcache = proto_perl->Tstatcache;
12240 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12241 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12243 PL_timesbuf = proto_perl->Ttimesbuf;
12246 PL_tainted = proto_perl->Ttainted;
12247 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12248 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12249 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12250 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12251 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12252 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12253 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12254 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12255 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12257 PL_restartop = proto_perl->Trestartop;
12258 PL_in_eval = proto_perl->Tin_eval;
12259 PL_delaymagic = proto_perl->Tdelaymagic;
12260 PL_dirty = proto_perl->Tdirty;
12261 PL_localizing = proto_perl->Tlocalizing;
12263 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12264 PL_hv_fetch_ent_mh = Nullhe;
12265 PL_modcount = proto_perl->Tmodcount;
12266 PL_lastgotoprobe = Nullop;
12267 PL_dumpindent = proto_perl->Tdumpindent;
12269 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12270 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12271 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12272 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12273 PL_sortcxix = proto_perl->Tsortcxix;
12274 PL_efloatbuf = Nullch; /* reinits on demand */
12275 PL_efloatsize = 0; /* reinits on demand */
12279 PL_screamfirst = NULL;
12280 PL_screamnext = NULL;
12281 PL_maxscream = -1; /* reinits on demand */
12282 PL_lastscream = Nullsv;
12284 PL_watchaddr = NULL;
12285 PL_watchok = Nullch;
12287 PL_regdummy = proto_perl->Tregdummy;
12288 PL_regprecomp = Nullch;
12291 PL_colorset = 0; /* reinits PL_colors[] */
12292 /*PL_colors[6] = {0,0,0,0,0,0};*/
12293 PL_reginput = Nullch;
12294 PL_regbol = Nullch;
12295 PL_regeol = Nullch;
12296 PL_regstartp = (I32*)NULL;
12297 PL_regendp = (I32*)NULL;
12298 PL_reglastparen = (U32*)NULL;
12299 PL_reglastcloseparen = (U32*)NULL;
12300 PL_regtill = Nullch;
12301 PL_reg_start_tmp = (char**)NULL;
12302 PL_reg_start_tmpl = 0;
12303 PL_regdata = (struct reg_data*)NULL;
12306 PL_reg_eval_set = 0;
12308 PL_regprogram = (regnode*)NULL;
12310 PL_regcc = (CURCUR*)NULL;
12311 PL_reg_call_cc = (struct re_cc_state*)NULL;
12312 PL_reg_re = (regexp*)NULL;
12313 PL_reg_ganch = Nullch;
12314 PL_reg_sv = Nullsv;
12315 PL_reg_match_utf8 = FALSE;
12316 PL_reg_magic = (MAGIC*)NULL;
12318 PL_reg_oldcurpm = (PMOP*)NULL;
12319 PL_reg_curpm = (PMOP*)NULL;
12320 PL_reg_oldsaved = Nullch;
12321 PL_reg_oldsavedlen = 0;
12322 #ifdef PERL_COPY_ON_WRITE
12325 PL_reg_maxiter = 0;
12326 PL_reg_leftiter = 0;
12327 PL_reg_poscache = Nullch;
12328 PL_reg_poscache_size= 0;
12330 /* RE engine - function pointers */
12331 PL_regcompp = proto_perl->Tregcompp;
12332 PL_regexecp = proto_perl->Tregexecp;
12333 PL_regint_start = proto_perl->Tregint_start;
12334 PL_regint_string = proto_perl->Tregint_string;
12335 PL_regfree = proto_perl->Tregfree;
12337 PL_reginterp_cnt = 0;
12338 PL_reg_starttry = 0;
12340 /* Pluggable optimizer */
12341 PL_peepp = proto_perl->Tpeepp;
12343 PL_stashcache = newHV();
12345 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12346 ptr_table_free(PL_ptr_table);
12347 PL_ptr_table = NULL;
12350 /* Call the ->CLONE method, if it exists, for each of the stashes
12351 identified by sv_dup() above.
12353 while(av_len(param->stashes) != -1) {
12354 HV* stash = (HV*) av_shift(param->stashes);
12355 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12356 if (cloner && GvCV(cloner)) {
12361 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
12363 call_sv((SV*)GvCV(cloner), G_DISCARD);
12369 SvREFCNT_dec(param->stashes);
12374 #endif /* USE_ITHREADS */
12377 =head1 Unicode Support
12379 =for apidoc sv_recode_to_utf8
12381 The encoding is assumed to be an Encode object, on entry the PV
12382 of the sv is assumed to be octets in that encoding, and the sv
12383 will be converted into Unicode (and UTF-8).
12385 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12386 is not a reference, nothing is done to the sv. If the encoding is not
12387 an C<Encode::XS> Encoding object, bad things will happen.
12388 (See F<lib/encoding.pm> and L<Encode>).
12390 The PV of the sv is returned.
12395 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12397 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12411 Passing sv_yes is wrong - it needs to be or'ed set of constants
12412 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12413 remove converted chars from source.
12415 Both will default the value - let them.
12417 XPUSHs(&PL_sv_yes);
12420 call_method("decode", G_SCALAR);
12424 s = SvPV(uni, len);
12425 if (s != SvPVX(sv)) {
12426 SvGROW(sv, len + 1);
12427 Move(s, SvPVX(sv), len, char);
12428 SvCUR_set(sv, len);
12429 SvPVX(sv)[len] = 0;
12436 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12440 =for apidoc sv_cat_decode
12442 The encoding is assumed to be an Encode object, the PV of the ssv is
12443 assumed to be octets in that encoding and decoding the input starts
12444 from the position which (PV + *offset) pointed to. The dsv will be
12445 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12446 when the string tstr appears in decoding output or the input ends on
12447 the PV of the ssv. The value which the offset points will be modified
12448 to the last input position on the ssv.
12450 Returns TRUE if the terminator was found, else returns FALSE.
12455 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12456 SV *ssv, int *offset, char *tstr, int tlen)
12459 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12470 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12471 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12473 call_method("cat_decode", G_SCALAR);
12475 ret = SvTRUE(TOPs);
12476 *offset = SvIV(offsv);
12482 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12488 * c-indentation-style: bsd
12489 * c-basic-offset: 4
12490 * indent-tabs-mode: t
12493 * vim: shiftwidth=4: