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)
1788 if (mt != SVt_PV && SvIsCOW(sv)) {
1789 sv_force_normal_flags(sv, 0);
1792 if (SvTYPE(sv) == mt)
1796 (void)SvOOK_off(sv);
1806 switch (SvTYPE(sv)) {
1814 else if (mt < SVt_PVIV)
1824 pv = (char*)SvRV(sv);
1834 else if (mt == SVt_NV)
1842 del_XPVIV(SvANY(sv));
1850 del_XPVNV(SvANY(sv));
1858 magic = SvMAGIC(sv);
1859 stash = SvSTASH(sv);
1860 del_XPVMG(SvANY(sv));
1863 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1866 SvFLAGS(sv) &= ~SVTYPEMASK;
1871 Perl_croak(aTHX_ "Can't upgrade to undef");
1873 SvANY(sv) = new_XIV();
1877 SvANY(sv) = new_XNV();
1881 SvANY(sv) = new_XRV();
1882 SvRV_set(sv, (SV*)pv);
1885 SvANY(sv) = new_XPVHV();
1892 HvTOTALKEYS(sv) = 0;
1893 HvPLACEHOLDERS(sv) = 0;
1895 /* Fall through... */
1898 SvANY(sv) = new_XPVAV();
1903 AvFLAGS(sv) = AVf_REAL;
1910 SvPV_set(sv, (char*)0);
1911 SvMAGIC_set(sv, magic);
1912 SvSTASH_set(sv, stash);
1916 SvANY(sv) = new_XPVIO();
1917 Zero(SvANY(sv), 1, XPVIO);
1918 IoPAGE_LEN(sv) = 60;
1919 goto set_magic_common;
1921 SvANY(sv) = new_XPVFM();
1922 Zero(SvANY(sv), 1, XPVFM);
1923 goto set_magic_common;
1925 SvANY(sv) = new_XPVBM();
1929 goto set_magic_common;
1931 SvANY(sv) = new_XPVGV();
1937 goto set_magic_common;
1939 SvANY(sv) = new_XPVCV();
1940 Zero(SvANY(sv), 1, XPVCV);
1941 goto set_magic_common;
1943 SvANY(sv) = new_XPVLV();
1956 SvANY(sv) = new_XPVMG();
1959 SvMAGIC_set(sv, magic);
1960 SvSTASH_set(sv, stash);
1964 SvANY(sv) = new_XPVNV();
1970 SvANY(sv) = new_XPVIV();
1979 SvANY(sv) = new_XPV();
1990 =for apidoc sv_backoff
1992 Remove any string offset. You should normally use the C<SvOOK_off> macro
1999 Perl_sv_backoff(pTHX_ register SV *sv)
2003 char *s = SvPVX(sv);
2004 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
2005 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
2007 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
2009 SvFLAGS(sv) &= ~SVf_OOK;
2016 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2017 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2018 Use the C<SvGROW> wrapper instead.
2024 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2028 #ifdef HAS_64K_LIMIT
2029 if (newlen >= 0x10000) {
2030 PerlIO_printf(Perl_debug_log,
2031 "Allocation too large: %"UVxf"\n", (UV)newlen);
2034 #endif /* HAS_64K_LIMIT */
2037 if (SvTYPE(sv) < SVt_PV) {
2038 sv_upgrade(sv, SVt_PV);
2041 else if (SvOOK(sv)) { /* pv is offset? */
2044 if (newlen > SvLEN(sv))
2045 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2046 #ifdef HAS_64K_LIMIT
2047 if (newlen >= 0x10000)
2054 if (newlen > SvLEN(sv)) { /* need more room? */
2055 if (SvLEN(sv) && s) {
2057 STRLEN l = malloced_size((void*)SvPVX(sv));
2063 Renew(s,newlen,char);
2066 New(703, s, newlen, char);
2067 if (SvPVX(sv) && SvCUR(sv)) {
2068 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2072 SvLEN_set(sv, newlen);
2078 =for apidoc sv_setiv
2080 Copies an integer into the given SV, upgrading first if necessary.
2081 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2087 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2089 SV_CHECK_THINKFIRST_COW_DROP(sv);
2090 switch (SvTYPE(sv)) {
2092 sv_upgrade(sv, SVt_IV);
2095 sv_upgrade(sv, SVt_PVNV);
2099 sv_upgrade(sv, SVt_PVIV);
2108 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2111 (void)SvIOK_only(sv); /* validate number */
2117 =for apidoc sv_setiv_mg
2119 Like C<sv_setiv>, but also handles 'set' magic.
2125 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2132 =for apidoc sv_setuv
2134 Copies an unsigned integer into the given SV, upgrading first if necessary.
2135 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2141 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2143 /* With these two if statements:
2144 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2147 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2149 If you wish to remove them, please benchmark to see what the effect is
2151 if (u <= (UV)IV_MAX) {
2152 sv_setiv(sv, (IV)u);
2161 =for apidoc sv_setuv_mg
2163 Like C<sv_setuv>, but also handles 'set' magic.
2169 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2171 /* With these two if statements:
2172 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2175 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2177 If you wish to remove them, please benchmark to see what the effect is
2179 if (u <= (UV)IV_MAX) {
2180 sv_setiv(sv, (IV)u);
2190 =for apidoc sv_setnv
2192 Copies a double into the given SV, upgrading first if necessary.
2193 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2199 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2201 SV_CHECK_THINKFIRST_COW_DROP(sv);
2202 switch (SvTYPE(sv)) {
2205 sv_upgrade(sv, SVt_NV);
2210 sv_upgrade(sv, SVt_PVNV);
2219 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2223 (void)SvNOK_only(sv); /* validate number */
2228 =for apidoc sv_setnv_mg
2230 Like C<sv_setnv>, but also handles 'set' magic.
2236 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2242 /* Print an "isn't numeric" warning, using a cleaned-up,
2243 * printable version of the offending string
2247 S_not_a_number(pTHX_ SV *sv)
2254 dsv = sv_2mortal(newSVpv("", 0));
2255 pv = sv_uni_display(dsv, sv, 10, 0);
2258 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2259 /* each *s can expand to 4 chars + "...\0",
2260 i.e. need room for 8 chars */
2263 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2265 if (ch & 128 && !isPRINT_LC(ch)) {
2274 else if (ch == '\r') {
2278 else if (ch == '\f') {
2282 else if (ch == '\\') {
2286 else if (ch == '\0') {
2290 else if (isPRINT_LC(ch))
2307 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2308 "Argument \"%s\" isn't numeric in %s", pv,
2311 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2312 "Argument \"%s\" isn't numeric", pv);
2316 =for apidoc looks_like_number
2318 Test if the content of an SV looks like a number (or is a number).
2319 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2320 non-numeric warning), even if your atof() doesn't grok them.
2326 Perl_looks_like_number(pTHX_ SV *sv)
2328 register char *sbegin;
2335 else if (SvPOKp(sv))
2336 sbegin = SvPV(sv, len);
2338 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2339 return grok_number(sbegin, len, NULL);
2342 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2343 until proven guilty, assume that things are not that bad... */
2348 As 64 bit platforms often have an NV that doesn't preserve all bits of
2349 an IV (an assumption perl has been based on to date) it becomes necessary
2350 to remove the assumption that the NV always carries enough precision to
2351 recreate the IV whenever needed, and that the NV is the canonical form.
2352 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2353 precision as a side effect of conversion (which would lead to insanity
2354 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2355 1) to distinguish between IV/UV/NV slots that have cached a valid
2356 conversion where precision was lost and IV/UV/NV slots that have a
2357 valid conversion which has lost no precision
2358 2) to ensure that if a numeric conversion to one form is requested that
2359 would lose precision, the precise conversion (or differently
2360 imprecise conversion) is also performed and cached, to prevent
2361 requests for different numeric formats on the same SV causing
2362 lossy conversion chains. (lossless conversion chains are perfectly
2367 SvIOKp is true if the IV slot contains a valid value
2368 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2369 SvNOKp is true if the NV slot contains a valid value
2370 SvNOK is true only if the NV value is accurate
2373 while converting from PV to NV, check to see if converting that NV to an
2374 IV(or UV) would lose accuracy over a direct conversion from PV to
2375 IV(or UV). If it would, cache both conversions, return NV, but mark
2376 SV as IOK NOKp (ie not NOK).
2378 While converting from PV to IV, check to see if converting that IV to an
2379 NV would lose accuracy over a direct conversion from PV to NV. If it
2380 would, cache both conversions, flag similarly.
2382 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2383 correctly because if IV & NV were set NV *always* overruled.
2384 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2385 changes - now IV and NV together means that the two are interchangeable:
2386 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2388 The benefit of this is that operations such as pp_add know that if
2389 SvIOK is true for both left and right operands, then integer addition
2390 can be used instead of floating point (for cases where the result won't
2391 overflow). Before, floating point was always used, which could lead to
2392 loss of precision compared with integer addition.
2394 * making IV and NV equal status should make maths accurate on 64 bit
2396 * may speed up maths somewhat if pp_add and friends start to use
2397 integers when possible instead of fp. (Hopefully the overhead in
2398 looking for SvIOK and checking for overflow will not outweigh the
2399 fp to integer speedup)
2400 * will slow down integer operations (callers of SvIV) on "inaccurate"
2401 values, as the change from SvIOK to SvIOKp will cause a call into
2402 sv_2iv each time rather than a macro access direct to the IV slot
2403 * should speed up number->string conversion on integers as IV is
2404 favoured when IV and NV are equally accurate
2406 ####################################################################
2407 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2408 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2409 On the other hand, SvUOK is true iff UV.
2410 ####################################################################
2412 Your mileage will vary depending your CPU's relative fp to integer
2416 #ifndef NV_PRESERVES_UV
2417 # define IS_NUMBER_UNDERFLOW_IV 1
2418 # define IS_NUMBER_UNDERFLOW_UV 2
2419 # define IS_NUMBER_IV_AND_UV 2
2420 # define IS_NUMBER_OVERFLOW_IV 4
2421 # define IS_NUMBER_OVERFLOW_UV 5
2423 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2425 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2427 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2429 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));
2430 if (SvNVX(sv) < (NV)IV_MIN) {
2431 (void)SvIOKp_on(sv);
2433 SvIV_set(sv, IV_MIN);
2434 return IS_NUMBER_UNDERFLOW_IV;
2436 if (SvNVX(sv) > (NV)UV_MAX) {
2437 (void)SvIOKp_on(sv);
2440 SvUV_set(sv, UV_MAX);
2441 return IS_NUMBER_OVERFLOW_UV;
2443 (void)SvIOKp_on(sv);
2445 /* Can't use strtol etc to convert this string. (See truth table in
2447 if (SvNVX(sv) <= (UV)IV_MAX) {
2448 SvIV_set(sv, I_V(SvNVX(sv)));
2449 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2450 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2452 /* Integer is imprecise. NOK, IOKp */
2454 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2457 SvUV_set(sv, U_V(SvNVX(sv)));
2458 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2459 if (SvUVX(sv) == UV_MAX) {
2460 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2461 possibly be preserved by NV. Hence, it must be overflow.
2463 return IS_NUMBER_OVERFLOW_UV;
2465 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2467 /* Integer is imprecise. NOK, IOKp */
2469 return IS_NUMBER_OVERFLOW_IV;
2471 #endif /* !NV_PRESERVES_UV*/
2473 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2474 * this function provided for binary compatibility only
2478 Perl_sv_2iv(pTHX_ register SV *sv)
2480 return sv_2iv_flags(sv, SV_GMAGIC);
2484 =for apidoc sv_2iv_flags
2486 Return the integer value of an SV, doing any necessary string
2487 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2488 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2494 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2498 if (SvGMAGICAL(sv)) {
2499 if (flags & SV_GMAGIC)
2504 return I_V(SvNVX(sv));
2506 if (SvPOKp(sv) && SvLEN(sv))
2509 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2510 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2516 if (SvTHINKFIRST(sv)) {
2519 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2520 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2521 return SvIV(tmpstr);
2522 return PTR2IV(SvRV(sv));
2525 sv_force_normal_flags(sv, 0);
2527 if (SvREADONLY(sv) && !SvOK(sv)) {
2528 if (ckWARN(WARN_UNINITIALIZED))
2535 return (IV)(SvUVX(sv));
2542 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2543 * without also getting a cached IV/UV from it at the same time
2544 * (ie PV->NV conversion should detect loss of accuracy and cache
2545 * IV or UV at same time to avoid this. NWC */
2547 if (SvTYPE(sv) == SVt_NV)
2548 sv_upgrade(sv, SVt_PVNV);
2550 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2551 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2552 certainly cast into the IV range at IV_MAX, whereas the correct
2553 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2555 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2556 SvIV_set(sv, I_V(SvNVX(sv)));
2557 if (SvNVX(sv) == (NV) SvIVX(sv)
2558 #ifndef NV_PRESERVES_UV
2559 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2560 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2561 /* Don't flag it as "accurately an integer" if the number
2562 came from a (by definition imprecise) NV operation, and
2563 we're outside the range of NV integer precision */
2566 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2567 DEBUG_c(PerlIO_printf(Perl_debug_log,
2568 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2574 /* IV not precise. No need to convert from PV, as NV
2575 conversion would already have cached IV if it detected
2576 that PV->IV would be better than PV->NV->IV
2577 flags already correct - don't set public IOK. */
2578 DEBUG_c(PerlIO_printf(Perl_debug_log,
2579 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2584 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2585 but the cast (NV)IV_MIN rounds to a the value less (more
2586 negative) than IV_MIN which happens to be equal to SvNVX ??
2587 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2588 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2589 (NV)UVX == NVX are both true, but the values differ. :-(
2590 Hopefully for 2s complement IV_MIN is something like
2591 0x8000000000000000 which will be exact. NWC */
2594 SvUV_set(sv, U_V(SvNVX(sv)));
2596 (SvNVX(sv) == (NV) SvUVX(sv))
2597 #ifndef NV_PRESERVES_UV
2598 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2599 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2600 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2601 /* Don't flag it as "accurately an integer" if the number
2602 came from a (by definition imprecise) NV operation, and
2603 we're outside the range of NV integer precision */
2609 DEBUG_c(PerlIO_printf(Perl_debug_log,
2610 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2614 return (IV)SvUVX(sv);
2617 else if (SvPOKp(sv) && SvLEN(sv)) {
2619 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2620 /* We want to avoid a possible problem when we cache an IV which
2621 may be later translated to an NV, and the resulting NV is not
2622 the same as the direct translation of the initial string
2623 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2624 be careful to ensure that the value with the .456 is around if the
2625 NV value is requested in the future).
2627 This means that if we cache such an IV, we need to cache the
2628 NV as well. Moreover, we trade speed for space, and do not
2629 cache the NV if we are sure it's not needed.
2632 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2633 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2634 == IS_NUMBER_IN_UV) {
2635 /* It's definitely an integer, only upgrade to PVIV */
2636 if (SvTYPE(sv) < SVt_PVIV)
2637 sv_upgrade(sv, SVt_PVIV);
2639 } else if (SvTYPE(sv) < SVt_PVNV)
2640 sv_upgrade(sv, SVt_PVNV);
2642 /* If NV preserves UV then we only use the UV value if we know that
2643 we aren't going to call atof() below. If NVs don't preserve UVs
2644 then the value returned may have more precision than atof() will
2645 return, even though value isn't perfectly accurate. */
2646 if ((numtype & (IS_NUMBER_IN_UV
2647 #ifdef NV_PRESERVES_UV
2650 )) == IS_NUMBER_IN_UV) {
2651 /* This won't turn off the public IOK flag if it was set above */
2652 (void)SvIOKp_on(sv);
2654 if (!(numtype & IS_NUMBER_NEG)) {
2656 if (value <= (UV)IV_MAX) {
2657 SvIV_set(sv, (IV)value);
2659 SvUV_set(sv, value);
2663 /* 2s complement assumption */
2664 if (value <= (UV)IV_MIN) {
2665 SvIV_set(sv, -(IV)value);
2667 /* Too negative for an IV. This is a double upgrade, but
2668 I'm assuming it will be rare. */
2669 if (SvTYPE(sv) < SVt_PVNV)
2670 sv_upgrade(sv, SVt_PVNV);
2674 SvNV_set(sv, -(NV)value);
2675 SvIV_set(sv, IV_MIN);
2679 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2680 will be in the previous block to set the IV slot, and the next
2681 block to set the NV slot. So no else here. */
2683 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2684 != IS_NUMBER_IN_UV) {
2685 /* It wasn't an (integer that doesn't overflow the UV). */
2686 SvNV_set(sv, Atof(SvPVX(sv)));
2688 if (! numtype && ckWARN(WARN_NUMERIC))
2691 #if defined(USE_LONG_DOUBLE)
2692 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2693 PTR2UV(sv), SvNVX(sv)));
2695 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2696 PTR2UV(sv), SvNVX(sv)));
2700 #ifdef NV_PRESERVES_UV
2701 (void)SvIOKp_on(sv);
2703 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2704 SvIV_set(sv, I_V(SvNVX(sv)));
2705 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2708 /* Integer is imprecise. NOK, IOKp */
2710 /* UV will not work better than IV */
2712 if (SvNVX(sv) > (NV)UV_MAX) {
2714 /* Integer is inaccurate. NOK, IOKp, is UV */
2715 SvUV_set(sv, UV_MAX);
2718 SvUV_set(sv, U_V(SvNVX(sv)));
2719 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2720 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2724 /* Integer is imprecise. NOK, IOKp, is UV */
2730 #else /* NV_PRESERVES_UV */
2731 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2732 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2733 /* The IV slot will have been set from value returned by
2734 grok_number above. The NV slot has just been set using
2737 assert (SvIOKp(sv));
2739 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2740 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2741 /* Small enough to preserve all bits. */
2742 (void)SvIOKp_on(sv);
2744 SvIV_set(sv, I_V(SvNVX(sv)));
2745 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2747 /* Assumption: first non-preserved integer is < IV_MAX,
2748 this NV is in the preserved range, therefore: */
2749 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2751 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);
2755 0 0 already failed to read UV.
2756 0 1 already failed to read UV.
2757 1 0 you won't get here in this case. IV/UV
2758 slot set, public IOK, Atof() unneeded.
2759 1 1 already read UV.
2760 so there's no point in sv_2iuv_non_preserve() attempting
2761 to use atol, strtol, strtoul etc. */
2762 if (sv_2iuv_non_preserve (sv, numtype)
2763 >= IS_NUMBER_OVERFLOW_IV)
2767 #endif /* NV_PRESERVES_UV */
2770 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2772 if (SvTYPE(sv) < SVt_IV)
2773 /* Typically the caller expects that sv_any is not NULL now. */
2774 sv_upgrade(sv, SVt_IV);
2777 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2778 PTR2UV(sv),SvIVX(sv)));
2779 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2782 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2783 * this function provided for binary compatibility only
2787 Perl_sv_2uv(pTHX_ register SV *sv)
2789 return sv_2uv_flags(sv, SV_GMAGIC);
2793 =for apidoc sv_2uv_flags
2795 Return the unsigned integer value of an SV, doing any necessary string
2796 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2797 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2803 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2807 if (SvGMAGICAL(sv)) {
2808 if (flags & SV_GMAGIC)
2813 return U_V(SvNVX(sv));
2814 if (SvPOKp(sv) && SvLEN(sv))
2817 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2818 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2824 if (SvTHINKFIRST(sv)) {
2827 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2828 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2829 return SvUV(tmpstr);
2830 return PTR2UV(SvRV(sv));
2833 sv_force_normal_flags(sv, 0);
2835 if (SvREADONLY(sv) && !SvOK(sv)) {
2836 if (ckWARN(WARN_UNINITIALIZED))
2846 return (UV)SvIVX(sv);
2850 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2851 * without also getting a cached IV/UV from it at the same time
2852 * (ie PV->NV conversion should detect loss of accuracy and cache
2853 * IV or UV at same time to avoid this. */
2854 /* IV-over-UV optimisation - choose to cache IV if possible */
2856 if (SvTYPE(sv) == SVt_NV)
2857 sv_upgrade(sv, SVt_PVNV);
2859 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2860 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2861 SvIV_set(sv, I_V(SvNVX(sv)));
2862 if (SvNVX(sv) == (NV) SvIVX(sv)
2863 #ifndef NV_PRESERVES_UV
2864 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2865 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2866 /* Don't flag it as "accurately an integer" if the number
2867 came from a (by definition imprecise) NV operation, and
2868 we're outside the range of NV integer precision */
2871 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2872 DEBUG_c(PerlIO_printf(Perl_debug_log,
2873 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2879 /* IV not precise. No need to convert from PV, as NV
2880 conversion would already have cached IV if it detected
2881 that PV->IV would be better than PV->NV->IV
2882 flags already correct - don't set public IOK. */
2883 DEBUG_c(PerlIO_printf(Perl_debug_log,
2884 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2889 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2890 but the cast (NV)IV_MIN rounds to a the value less (more
2891 negative) than IV_MIN which happens to be equal to SvNVX ??
2892 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2893 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2894 (NV)UVX == NVX are both true, but the values differ. :-(
2895 Hopefully for 2s complement IV_MIN is something like
2896 0x8000000000000000 which will be exact. NWC */
2899 SvUV_set(sv, U_V(SvNVX(sv)));
2901 (SvNVX(sv) == (NV) SvUVX(sv))
2902 #ifndef NV_PRESERVES_UV
2903 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2904 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2905 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2906 /* Don't flag it as "accurately an integer" if the number
2907 came from a (by definition imprecise) NV operation, and
2908 we're outside the range of NV integer precision */
2913 DEBUG_c(PerlIO_printf(Perl_debug_log,
2914 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2920 else if (SvPOKp(sv) && SvLEN(sv)) {
2922 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2924 /* We want to avoid a possible problem when we cache a UV which
2925 may be later translated to an NV, and the resulting NV is not
2926 the translation of the initial data.
2928 This means that if we cache such a UV, we need to cache the
2929 NV as well. Moreover, we trade speed for space, and do not
2930 cache the NV if not needed.
2933 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2934 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2935 == IS_NUMBER_IN_UV) {
2936 /* It's definitely an integer, only upgrade to PVIV */
2937 if (SvTYPE(sv) < SVt_PVIV)
2938 sv_upgrade(sv, SVt_PVIV);
2940 } else if (SvTYPE(sv) < SVt_PVNV)
2941 sv_upgrade(sv, SVt_PVNV);
2943 /* If NV preserves UV then we only use the UV value if we know that
2944 we aren't going to call atof() below. If NVs don't preserve UVs
2945 then the value returned may have more precision than atof() will
2946 return, even though it isn't accurate. */
2947 if ((numtype & (IS_NUMBER_IN_UV
2948 #ifdef NV_PRESERVES_UV
2951 )) == IS_NUMBER_IN_UV) {
2952 /* This won't turn off the public IOK flag if it was set above */
2953 (void)SvIOKp_on(sv);
2955 if (!(numtype & IS_NUMBER_NEG)) {
2957 if (value <= (UV)IV_MAX) {
2958 SvIV_set(sv, (IV)value);
2960 /* it didn't overflow, and it was positive. */
2961 SvUV_set(sv, value);
2965 /* 2s complement assumption */
2966 if (value <= (UV)IV_MIN) {
2967 SvIV_set(sv, -(IV)value);
2969 /* Too negative for an IV. This is a double upgrade, but
2970 I'm assuming it will be rare. */
2971 if (SvTYPE(sv) < SVt_PVNV)
2972 sv_upgrade(sv, SVt_PVNV);
2976 SvNV_set(sv, -(NV)value);
2977 SvIV_set(sv, IV_MIN);
2982 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2983 != IS_NUMBER_IN_UV) {
2984 /* It wasn't an integer, or it overflowed the UV. */
2985 SvNV_set(sv, Atof(SvPVX(sv)));
2987 if (! numtype && ckWARN(WARN_NUMERIC))
2990 #if defined(USE_LONG_DOUBLE)
2991 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2992 PTR2UV(sv), SvNVX(sv)));
2994 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2995 PTR2UV(sv), SvNVX(sv)));
2998 #ifdef NV_PRESERVES_UV
2999 (void)SvIOKp_on(sv);
3001 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3002 SvIV_set(sv, I_V(SvNVX(sv)));
3003 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
3006 /* Integer is imprecise. NOK, IOKp */
3008 /* UV will not work better than IV */
3010 if (SvNVX(sv) > (NV)UV_MAX) {
3012 /* Integer is inaccurate. NOK, IOKp, is UV */
3013 SvUV_set(sv, UV_MAX);
3016 SvUV_set(sv, U_V(SvNVX(sv)));
3017 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3018 NV preservse UV so can do correct comparison. */
3019 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3023 /* Integer is imprecise. NOK, IOKp, is UV */
3028 #else /* NV_PRESERVES_UV */
3029 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3030 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3031 /* The UV slot will have been set from value returned by
3032 grok_number above. The NV slot has just been set using
3035 assert (SvIOKp(sv));
3037 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3038 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3039 /* Small enough to preserve all bits. */
3040 (void)SvIOKp_on(sv);
3042 SvIV_set(sv, I_V(SvNVX(sv)));
3043 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3045 /* Assumption: first non-preserved integer is < IV_MAX,
3046 this NV is in the preserved range, therefore: */
3047 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3049 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);
3052 sv_2iuv_non_preserve (sv, numtype);
3054 #endif /* NV_PRESERVES_UV */
3058 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3059 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3062 if (SvTYPE(sv) < SVt_IV)
3063 /* Typically the caller expects that sv_any is not NULL now. */
3064 sv_upgrade(sv, SVt_IV);
3068 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3069 PTR2UV(sv),SvUVX(sv)));
3070 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3076 Return the num value of an SV, doing any necessary string or integer
3077 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3084 Perl_sv_2nv(pTHX_ register SV *sv)
3088 if (SvGMAGICAL(sv)) {
3092 if (SvPOKp(sv) && SvLEN(sv)) {
3093 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3094 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
3096 return Atof(SvPVX(sv));
3100 return (NV)SvUVX(sv);
3102 return (NV)SvIVX(sv);
3105 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3106 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3112 if (SvTHINKFIRST(sv)) {
3115 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3116 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3117 return SvNV(tmpstr);
3118 return PTR2NV(SvRV(sv));
3121 sv_force_normal_flags(sv, 0);
3123 if (SvREADONLY(sv) && !SvOK(sv)) {
3124 if (ckWARN(WARN_UNINITIALIZED))
3129 if (SvTYPE(sv) < SVt_NV) {
3130 if (SvTYPE(sv) == SVt_IV)
3131 sv_upgrade(sv, SVt_PVNV);
3133 sv_upgrade(sv, SVt_NV);
3134 #ifdef USE_LONG_DOUBLE
3136 STORE_NUMERIC_LOCAL_SET_STANDARD();
3137 PerlIO_printf(Perl_debug_log,
3138 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3139 PTR2UV(sv), SvNVX(sv));
3140 RESTORE_NUMERIC_LOCAL();
3144 STORE_NUMERIC_LOCAL_SET_STANDARD();
3145 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3146 PTR2UV(sv), SvNVX(sv));
3147 RESTORE_NUMERIC_LOCAL();
3151 else if (SvTYPE(sv) < SVt_PVNV)
3152 sv_upgrade(sv, SVt_PVNV);
3157 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3158 #ifdef NV_PRESERVES_UV
3161 /* Only set the public NV OK flag if this NV preserves the IV */
3162 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3163 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3164 : (SvIVX(sv) == I_V(SvNVX(sv))))
3170 else if (SvPOKp(sv) && SvLEN(sv)) {
3172 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3173 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3175 #ifdef NV_PRESERVES_UV
3176 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3177 == IS_NUMBER_IN_UV) {
3178 /* It's definitely an integer */
3179 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3181 SvNV_set(sv, Atof(SvPVX(sv)));
3184 SvNV_set(sv, Atof(SvPVX(sv)));
3185 /* Only set the public NV OK flag if this NV preserves the value in
3186 the PV at least as well as an IV/UV would.
3187 Not sure how to do this 100% reliably. */
3188 /* if that shift count is out of range then Configure's test is
3189 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3191 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3192 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3193 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3194 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3195 /* Can't use strtol etc to convert this string, so don't try.
3196 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3199 /* value has been set. It may not be precise. */
3200 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3201 /* 2s complement assumption for (UV)IV_MIN */
3202 SvNOK_on(sv); /* Integer is too negative. */
3207 if (numtype & IS_NUMBER_NEG) {
3208 SvIV_set(sv, -(IV)value);
3209 } else if (value <= (UV)IV_MAX) {
3210 SvIV_set(sv, (IV)value);
3212 SvUV_set(sv, value);
3216 if (numtype & IS_NUMBER_NOT_INT) {
3217 /* I believe that even if the original PV had decimals,
3218 they are lost beyond the limit of the FP precision.
3219 However, neither is canonical, so both only get p
3220 flags. NWC, 2000/11/25 */
3221 /* Both already have p flags, so do nothing */
3224 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3225 if (SvIVX(sv) == I_V(nv)) {
3230 /* It had no "." so it must be integer. */
3233 /* between IV_MAX and NV(UV_MAX).
3234 Could be slightly > UV_MAX */
3236 if (numtype & IS_NUMBER_NOT_INT) {
3237 /* UV and NV both imprecise. */
3239 UV nv_as_uv = U_V(nv);
3241 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3252 #endif /* NV_PRESERVES_UV */
3255 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3257 if (SvTYPE(sv) < SVt_NV)
3258 /* Typically the caller expects that sv_any is not NULL now. */
3259 /* XXX Ilya implies that this is a bug in callers that assume this
3260 and ideally should be fixed. */
3261 sv_upgrade(sv, SVt_NV);
3264 #if defined(USE_LONG_DOUBLE)
3266 STORE_NUMERIC_LOCAL_SET_STANDARD();
3267 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3268 PTR2UV(sv), SvNVX(sv));
3269 RESTORE_NUMERIC_LOCAL();
3273 STORE_NUMERIC_LOCAL_SET_STANDARD();
3274 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3275 PTR2UV(sv), SvNVX(sv));
3276 RESTORE_NUMERIC_LOCAL();
3282 /* asIV(): extract an integer from the string value of an SV.
3283 * Caller must validate PVX */
3286 S_asIV(pTHX_ SV *sv)
3289 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3291 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3292 == IS_NUMBER_IN_UV) {
3293 /* It's definitely an integer */
3294 if (numtype & IS_NUMBER_NEG) {
3295 if (value < (UV)IV_MIN)
3298 if (value < (UV)IV_MAX)
3303 if (ckWARN(WARN_NUMERIC))
3306 return I_V(Atof(SvPVX(sv)));
3309 /* asUV(): extract an unsigned integer from the string value of an SV
3310 * Caller must validate PVX */
3313 S_asUV(pTHX_ SV *sv)
3316 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3318 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3319 == IS_NUMBER_IN_UV) {
3320 /* It's definitely an integer */
3321 if (!(numtype & IS_NUMBER_NEG))
3325 if (ckWARN(WARN_NUMERIC))
3328 return U_V(Atof(SvPVX(sv)));
3332 =for apidoc sv_2pv_nolen
3334 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3335 use the macro wrapper C<SvPV_nolen(sv)> instead.
3340 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3343 return sv_2pv(sv, &n_a);
3346 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3347 * UV as a string towards the end of buf, and return pointers to start and
3350 * We assume that buf is at least TYPE_CHARS(UV) long.
3354 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3356 char *ptr = buf + TYPE_CHARS(UV);
3370 *--ptr = '0' + (char)(uv % 10);
3378 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3379 * this function provided for binary compatibility only
3383 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3385 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3389 =for apidoc sv_2pv_flags
3391 Returns a pointer to the string value of an SV, and sets *lp to its length.
3392 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3394 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3395 usually end up here too.
3401 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3406 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3407 char *tmpbuf = tbuf;
3413 if (SvGMAGICAL(sv)) {
3414 if (flags & SV_GMAGIC)
3422 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3424 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3429 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3434 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3435 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3442 if (SvTHINKFIRST(sv)) {
3445 register const char *typestr;
3446 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3447 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3448 char *pv = SvPV(tmpstr, *lp);
3458 typestr = "NULLREF";
3462 switch (SvTYPE(sv)) {
3464 if ( ((SvFLAGS(sv) &
3465 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3466 == (SVs_OBJECT|SVs_SMG))
3467 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3468 const regexp *re = (regexp *)mg->mg_obj;
3471 const char *fptr = "msix";
3476 char need_newline = 0;
3477 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3479 while((ch = *fptr++)) {
3481 reflags[left++] = ch;
3484 reflags[right--] = ch;
3489 reflags[left] = '-';
3493 mg->mg_len = re->prelen + 4 + left;
3495 * If /x was used, we have to worry about a regex
3496 * ending with a comment later being embedded
3497 * within another regex. If so, we don't want this
3498 * regex's "commentization" to leak out to the
3499 * right part of the enclosing regex, we must cap
3500 * it with a newline.
3502 * So, if /x was used, we scan backwards from the
3503 * end of the regex. If we find a '#' before we
3504 * find a newline, we need to add a newline
3505 * ourself. If we find a '\n' first (or if we
3506 * don't find '#' or '\n'), we don't need to add
3507 * anything. -jfriedl
3509 if (PMf_EXTENDED & re->reganch)
3511 const char *endptr = re->precomp + re->prelen;
3512 while (endptr >= re->precomp)
3514 const char c = *(endptr--);
3516 break; /* don't need another */
3518 /* we end while in a comment, so we
3520 mg->mg_len++; /* save space for it */
3521 need_newline = 1; /* note to add it */
3527 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3528 Copy("(?", mg->mg_ptr, 2, char);
3529 Copy(reflags, mg->mg_ptr+2, left, char);
3530 Copy(":", mg->mg_ptr+left+2, 1, char);
3531 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3533 mg->mg_ptr[mg->mg_len - 2] = '\n';
3534 mg->mg_ptr[mg->mg_len - 1] = ')';
3535 mg->mg_ptr[mg->mg_len] = 0;
3537 PL_reginterp_cnt += re->program[0].next_off;
3539 if (re->reganch & ROPT_UTF8)
3554 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3555 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3556 /* tied lvalues should appear to be
3557 * scalars for backwards compatitbility */
3558 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3559 ? "SCALAR" : "LVALUE"; break;
3560 case SVt_PVAV: typestr = "ARRAY"; break;
3561 case SVt_PVHV: typestr = "HASH"; break;
3562 case SVt_PVCV: typestr = "CODE"; break;
3563 case SVt_PVGV: typestr = "GLOB"; break;
3564 case SVt_PVFM: typestr = "FORMAT"; break;
3565 case SVt_PVIO: typestr = "IO"; break;
3566 default: typestr = "UNKNOWN"; break;
3570 const char *name = HvNAME(SvSTASH(sv));
3571 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3572 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3575 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3578 *lp = strlen(typestr);
3579 return (char *)typestr;
3581 if (SvREADONLY(sv) && !SvOK(sv)) {
3582 if (ckWARN(WARN_UNINITIALIZED))
3588 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3589 /* I'm assuming that if both IV and NV are equally valid then
3590 converting the IV is going to be more efficient */
3591 const U32 isIOK = SvIOK(sv);
3592 const U32 isUIOK = SvIsUV(sv);
3593 char buf[TYPE_CHARS(UV)];
3596 if (SvTYPE(sv) < SVt_PVIV)
3597 sv_upgrade(sv, SVt_PVIV);
3599 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3601 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3602 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3603 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3604 SvCUR_set(sv, ebuf - ptr);
3614 else if (SvNOKp(sv)) {
3615 if (SvTYPE(sv) < SVt_PVNV)
3616 sv_upgrade(sv, SVt_PVNV);
3617 /* The +20 is pure guesswork. Configure test needed. --jhi */
3618 SvGROW(sv, NV_DIG + 20);
3620 olderrno = errno; /* some Xenix systems wipe out errno here */
3622 if (SvNVX(sv) == 0.0)
3623 (void)strcpy(s,"0");
3627 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3630 #ifdef FIXNEGATIVEZERO
3631 if (*s == '-' && s[1] == '0' && !s[2])
3641 if (ckWARN(WARN_UNINITIALIZED)
3642 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3645 if (SvTYPE(sv) < SVt_PV)
3646 /* Typically the caller expects that sv_any is not NULL now. */
3647 sv_upgrade(sv, SVt_PV);
3650 *lp = s - SvPVX(sv);
3653 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3654 PTR2UV(sv),SvPVX(sv)));
3658 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3659 /* Sneaky stuff here */
3663 tsv = newSVpv(tmpbuf, 0);
3679 len = strlen(tmpbuf);
3681 #ifdef FIXNEGATIVEZERO
3682 if (len == 2 && t[0] == '-' && t[1] == '0') {
3687 (void)SvUPGRADE(sv, SVt_PV);
3689 s = SvGROW(sv, len + 1);
3692 return strcpy(s, t);
3697 =for apidoc sv_copypv
3699 Copies a stringified representation of the source SV into the
3700 destination SV. Automatically performs any necessary mg_get and
3701 coercion of numeric values into strings. Guaranteed to preserve
3702 UTF-8 flag even from overloaded objects. Similar in nature to
3703 sv_2pv[_flags] but operates directly on an SV instead of just the
3704 string. Mostly uses sv_2pv_flags to do its work, except when that
3705 would lose the UTF-8'ness of the PV.
3711 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3716 sv_setpvn(dsv,s,len);
3724 =for apidoc sv_2pvbyte_nolen
3726 Return a pointer to the byte-encoded representation of the SV.
3727 May cause the SV to be downgraded from UTF-8 as a side-effect.
3729 Usually accessed via the C<SvPVbyte_nolen> macro.
3735 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3738 return sv_2pvbyte(sv, &n_a);
3742 =for apidoc sv_2pvbyte
3744 Return a pointer to the byte-encoded representation of the SV, and set *lp
3745 to its length. May cause the SV to be downgraded from UTF-8 as a
3748 Usually accessed via the C<SvPVbyte> macro.
3754 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3756 sv_utf8_downgrade(sv,0);
3757 return SvPV(sv,*lp);
3761 =for apidoc sv_2pvutf8_nolen
3763 Return a pointer to the UTF-8-encoded representation of the SV.
3764 May cause the SV to be upgraded to UTF-8 as a side-effect.
3766 Usually accessed via the C<SvPVutf8_nolen> macro.
3772 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3775 return sv_2pvutf8(sv, &n_a);
3779 =for apidoc sv_2pvutf8
3781 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3782 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3784 Usually accessed via the C<SvPVutf8> macro.
3790 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3792 sv_utf8_upgrade(sv);
3793 return SvPV(sv,*lp);
3797 =for apidoc sv_2bool
3799 This function is only called on magical items, and is only used by
3800 sv_true() or its macro equivalent.
3806 Perl_sv_2bool(pTHX_ register SV *sv)
3815 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3816 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3817 return (bool)SvTRUE(tmpsv);
3818 return SvRV(sv) != 0;
3821 register XPV* Xpvtmp;
3822 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3823 (*Xpvtmp->xpv_pv > '0' ||
3824 Xpvtmp->xpv_cur > 1 ||
3825 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3832 return SvIVX(sv) != 0;
3835 return SvNVX(sv) != 0.0;
3842 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3843 * this function provided for binary compatibility only
3848 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3850 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3854 =for apidoc sv_utf8_upgrade
3856 Converts the PV of an SV to its UTF-8-encoded form.
3857 Forces the SV to string form if it is not already.
3858 Always sets the SvUTF8 flag to avoid future validity checks even
3859 if all the bytes have hibit clear.
3861 This is not as a general purpose byte encoding to Unicode interface:
3862 use the Encode extension for that.
3864 =for apidoc sv_utf8_upgrade_flags
3866 Converts the PV of an SV to its UTF-8-encoded form.
3867 Forces the SV to string form if it is not already.
3868 Always sets the SvUTF8 flag to avoid future validity checks even
3869 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3870 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3871 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3873 This is not as a general purpose byte encoding to Unicode interface:
3874 use the Encode extension for that.
3880 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3885 if (sv == &PL_sv_undef)
3889 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3890 (void) sv_2pv_flags(sv,&len, flags);
3894 (void) SvPV_force(sv,len);
3903 sv_force_normal_flags(sv, 0);
3906 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3907 sv_recode_to_utf8(sv, PL_encoding);
3908 else { /* Assume Latin-1/EBCDIC */
3909 /* This function could be much more efficient if we
3910 * had a FLAG in SVs to signal if there are any hibit
3911 * chars in the PV. Given that there isn't such a flag
3912 * make the loop as fast as possible. */
3913 s = (U8 *) SvPVX(sv);
3914 e = (U8 *) SvEND(sv);
3918 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3923 (void)SvOOK_off(sv);
3925 len = SvCUR(sv) + 1; /* Plus the \0 */
3926 SvPV_set(sv, (char*)bytes_to_utf8((U8*)s, &len));
3927 SvCUR_set(sv, len - 1);
3929 Safefree(s); /* No longer using what was there before. */
3930 SvLEN_set(sv, len); /* No longer know the real size. */
3932 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3939 =for apidoc sv_utf8_downgrade
3941 Attempts to convert the PV of an SV from characters to bytes.
3942 If the PV contains a character beyond byte, this conversion will fail;
3943 in this case, either returns false or, if C<fail_ok> is not
3946 This is not as a general purpose Unicode to byte encoding interface:
3947 use the Encode extension for that.
3953 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3955 if (SvPOKp(sv) && SvUTF8(sv)) {
3961 sv_force_normal_flags(sv, 0);
3963 s = (U8 *) SvPV(sv, len);
3964 if (!utf8_to_bytes(s, &len)) {
3969 Perl_croak(aTHX_ "Wide character in %s",
3972 Perl_croak(aTHX_ "Wide character");
3983 =for apidoc sv_utf8_encode
3985 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3986 flag off so that it looks like octets again.
3992 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3994 (void) sv_utf8_upgrade(sv);
3996 sv_force_normal_flags(sv, 0);
3998 if (SvREADONLY(sv)) {
3999 Perl_croak(aTHX_ PL_no_modify);
4005 =for apidoc sv_utf8_decode
4007 If the PV of the SV is an octet sequence in UTF-8
4008 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
4009 so that it looks like a character. If the PV contains only single-byte
4010 characters, the C<SvUTF8> flag stays being off.
4011 Scans PV for validity and returns false if the PV is invalid UTF-8.
4017 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4023 /* The octets may have got themselves encoded - get them back as
4026 if (!sv_utf8_downgrade(sv, TRUE))
4029 /* it is actually just a matter of turning the utf8 flag on, but
4030 * we want to make sure everything inside is valid utf8 first.
4032 c = (U8 *) SvPVX(sv);
4033 if (!is_utf8_string(c, SvCUR(sv)+1))
4035 e = (U8 *) SvEND(sv);
4038 if (!UTF8_IS_INVARIANT(ch)) {
4047 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4048 * this function provided for binary compatibility only
4052 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4054 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4058 =for apidoc sv_setsv
4060 Copies the contents of the source SV C<ssv> into the destination SV
4061 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4062 function if the source SV needs to be reused. Does not handle 'set' magic.
4063 Loosely speaking, it performs a copy-by-value, obliterating any previous
4064 content of the destination.
4066 You probably want to use one of the assortment of wrappers, such as
4067 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4068 C<SvSetMagicSV_nosteal>.
4070 =for apidoc sv_setsv_flags
4072 Copies the contents of the source SV C<ssv> into the destination SV
4073 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4074 function if the source SV needs to be reused. Does not handle 'set' magic.
4075 Loosely speaking, it performs a copy-by-value, obliterating any previous
4076 content of the destination.
4077 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4078 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4079 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4080 and C<sv_setsv_nomg> are implemented in terms of this function.
4082 You probably want to use one of the assortment of wrappers, such as
4083 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4084 C<SvSetMagicSV_nosteal>.
4086 This is the primary function for copying scalars, and most other
4087 copy-ish functions and macros use this underneath.
4093 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4095 register U32 sflags;
4101 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4103 sstr = &PL_sv_undef;
4104 stype = SvTYPE(sstr);
4105 dtype = SvTYPE(dstr);
4110 /* need to nuke the magic */
4112 SvRMAGICAL_off(dstr);
4115 /* There's a lot of redundancy below but we're going for speed here */
4120 if (dtype != SVt_PVGV) {
4121 (void)SvOK_off(dstr);
4129 sv_upgrade(dstr, SVt_IV);
4132 sv_upgrade(dstr, SVt_PVNV);
4136 sv_upgrade(dstr, SVt_PVIV);
4139 (void)SvIOK_only(dstr);
4140 SvIV_set(dstr, SvIVX(sstr));
4143 if (SvTAINTED(sstr))
4154 sv_upgrade(dstr, SVt_NV);
4159 sv_upgrade(dstr, SVt_PVNV);
4162 SvNV_set(dstr, SvNVX(sstr));
4163 (void)SvNOK_only(dstr);
4164 if (SvTAINTED(sstr))
4172 sv_upgrade(dstr, SVt_RV);
4173 else if (dtype == SVt_PVGV &&
4174 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4177 if (GvIMPORTED(dstr) != GVf_IMPORTED
4178 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4180 GvIMPORTED_on(dstr);
4189 #ifdef PERL_COPY_ON_WRITE
4190 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4191 if (dtype < SVt_PVIV)
4192 sv_upgrade(dstr, SVt_PVIV);
4199 sv_upgrade(dstr, SVt_PV);
4202 if (dtype < SVt_PVIV)
4203 sv_upgrade(dstr, SVt_PVIV);
4206 if (dtype < SVt_PVNV)
4207 sv_upgrade(dstr, SVt_PVNV);
4214 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
4217 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
4221 if (dtype <= SVt_PVGV) {
4223 if (dtype != SVt_PVGV) {
4224 char *name = GvNAME(sstr);
4225 STRLEN len = GvNAMELEN(sstr);
4226 /* don't upgrade SVt_PVLV: it can hold a glob */
4227 if (dtype != SVt_PVLV)
4228 sv_upgrade(dstr, SVt_PVGV);
4229 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4230 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4231 GvNAME(dstr) = savepvn(name, len);
4232 GvNAMELEN(dstr) = len;
4233 SvFAKE_on(dstr); /* can coerce to non-glob */
4235 /* ahem, death to those who redefine active sort subs */
4236 else if (PL_curstackinfo->si_type == PERLSI_SORT
4237 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4238 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4241 #ifdef GV_UNIQUE_CHECK
4242 if (GvUNIQUE((GV*)dstr)) {
4243 Perl_croak(aTHX_ PL_no_modify);
4247 (void)SvOK_off(dstr);
4248 GvINTRO_off(dstr); /* one-shot flag */
4250 GvGP(dstr) = gp_ref(GvGP(sstr));
4251 if (SvTAINTED(sstr))
4253 if (GvIMPORTED(dstr) != GVf_IMPORTED
4254 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4256 GvIMPORTED_on(dstr);
4264 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4266 if ((int)SvTYPE(sstr) != stype) {
4267 stype = SvTYPE(sstr);
4268 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4272 if (stype == SVt_PVLV)
4273 (void)SvUPGRADE(dstr, SVt_PVNV);
4275 (void)SvUPGRADE(dstr, (U32)stype);
4278 sflags = SvFLAGS(sstr);
4280 if (sflags & SVf_ROK) {
4281 if (dtype >= SVt_PV) {
4282 if (dtype == SVt_PVGV) {
4283 SV *sref = SvREFCNT_inc(SvRV(sstr));
4285 int intro = GvINTRO(dstr);
4287 #ifdef GV_UNIQUE_CHECK
4288 if (GvUNIQUE((GV*)dstr)) {
4289 Perl_croak(aTHX_ PL_no_modify);
4294 GvINTRO_off(dstr); /* one-shot flag */
4295 GvLINE(dstr) = CopLINE(PL_curcop);
4296 GvEGV(dstr) = (GV*)dstr;
4299 switch (SvTYPE(sref)) {
4302 SAVEGENERICSV(GvAV(dstr));
4304 dref = (SV*)GvAV(dstr);
4305 GvAV(dstr) = (AV*)sref;
4306 if (!GvIMPORTED_AV(dstr)
4307 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4309 GvIMPORTED_AV_on(dstr);
4314 SAVEGENERICSV(GvHV(dstr));
4316 dref = (SV*)GvHV(dstr);
4317 GvHV(dstr) = (HV*)sref;
4318 if (!GvIMPORTED_HV(dstr)
4319 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4321 GvIMPORTED_HV_on(dstr);
4326 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4327 SvREFCNT_dec(GvCV(dstr));
4328 GvCV(dstr) = Nullcv;
4329 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4330 PL_sub_generation++;
4332 SAVEGENERICSV(GvCV(dstr));
4335 dref = (SV*)GvCV(dstr);
4336 if (GvCV(dstr) != (CV*)sref) {
4337 CV* cv = GvCV(dstr);
4339 if (!GvCVGEN((GV*)dstr) &&
4340 (CvROOT(cv) || CvXSUB(cv)))
4342 /* ahem, death to those who redefine
4343 * active sort subs */
4344 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4345 PL_sortcop == CvSTART(cv))
4347 "Can't redefine active sort subroutine %s",
4348 GvENAME((GV*)dstr));
4349 /* Redefining a sub - warning is mandatory if
4350 it was a const and its value changed. */
4351 if (ckWARN(WARN_REDEFINE)
4353 && (!CvCONST((CV*)sref)
4354 || sv_cmp(cv_const_sv(cv),
4355 cv_const_sv((CV*)sref)))))
4357 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4359 ? "Constant subroutine %s::%s redefined"
4360 : "Subroutine %s::%s redefined",
4361 HvNAME(GvSTASH((GV*)dstr)),
4362 GvENAME((GV*)dstr));
4366 cv_ckproto(cv, (GV*)dstr,
4367 SvPOK(sref) ? SvPVX(sref) : Nullch);
4369 GvCV(dstr) = (CV*)sref;
4370 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4371 GvASSUMECV_on(dstr);
4372 PL_sub_generation++;
4374 if (!GvIMPORTED_CV(dstr)
4375 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4377 GvIMPORTED_CV_on(dstr);
4382 SAVEGENERICSV(GvIOp(dstr));
4384 dref = (SV*)GvIOp(dstr);
4385 GvIOp(dstr) = (IO*)sref;
4389 SAVEGENERICSV(GvFORM(dstr));
4391 dref = (SV*)GvFORM(dstr);
4392 GvFORM(dstr) = (CV*)sref;
4396 SAVEGENERICSV(GvSV(dstr));
4398 dref = (SV*)GvSV(dstr);
4400 if (!GvIMPORTED_SV(dstr)
4401 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4403 GvIMPORTED_SV_on(dstr);
4409 if (SvTAINTED(sstr))
4414 (void)SvOOK_off(dstr); /* backoff */
4416 Safefree(SvPVX(dstr));
4421 (void)SvOK_off(dstr);
4422 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4424 if (sflags & SVp_NOK) {
4426 /* Only set the public OK flag if the source has public OK. */
4427 if (sflags & SVf_NOK)
4428 SvFLAGS(dstr) |= SVf_NOK;
4429 SvNV_set(dstr, SvNVX(sstr));
4431 if (sflags & SVp_IOK) {
4432 (void)SvIOKp_on(dstr);
4433 if (sflags & SVf_IOK)
4434 SvFLAGS(dstr) |= SVf_IOK;
4435 if (sflags & SVf_IVisUV)
4437 SvIV_set(dstr, SvIVX(sstr));
4439 if (SvAMAGIC(sstr)) {
4443 else if (sflags & SVp_POK) {
4447 * Check to see if we can just swipe the string. If so, it's a
4448 * possible small lose on short strings, but a big win on long ones.
4449 * It might even be a win on short strings if SvPVX(dstr)
4450 * has to be allocated and SvPVX(sstr) has to be freed.
4453 /* Whichever path we take through the next code, we want this true,
4454 and doing it now facilitates the COW check. */
4455 (void)SvPOK_only(dstr);
4458 #ifdef PERL_COPY_ON_WRITE
4459 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4463 (sflags & SVs_TEMP) && /* slated for free anyway? */
4464 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4465 (!(flags & SV_NOSTEAL)) &&
4466 /* and we're allowed to steal temps */
4467 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4468 SvLEN(sstr) && /* and really is a string */
4469 /* and won't be needed again, potentially */
4470 !(PL_op && PL_op->op_type == OP_AASSIGN))
4471 #ifdef PERL_COPY_ON_WRITE
4472 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4473 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4474 && SvTYPE(sstr) >= SVt_PVIV)
4477 /* Failed the swipe test, and it's not a shared hash key either.
4478 Have to copy the string. */
4479 STRLEN len = SvCUR(sstr);
4480 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4481 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4482 SvCUR_set(dstr, len);
4483 *SvEND(dstr) = '\0';
4485 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4487 #ifdef PERL_COPY_ON_WRITE
4488 /* Either it's a shared hash key, or it's suitable for
4489 copy-on-write or we can swipe the string. */
4491 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4496 /* I believe I should acquire a global SV mutex if
4497 it's a COW sv (not a shared hash key) to stop
4498 it going un copy-on-write.
4499 If the source SV has gone un copy on write between up there
4500 and down here, then (assert() that) it is of the correct
4501 form to make it copy on write again */
4502 if ((sflags & (SVf_FAKE | SVf_READONLY))
4503 != (SVf_FAKE | SVf_READONLY)) {
4504 SvREADONLY_on(sstr);
4506 /* Make the source SV into a loop of 1.
4507 (about to become 2) */
4508 SV_COW_NEXT_SV_SET(sstr, sstr);
4512 /* Initial code is common. */
4513 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4515 SvFLAGS(dstr) &= ~SVf_OOK;
4516 Safefree(SvPVX(dstr) - SvIVX(dstr));
4518 else if (SvLEN(dstr))
4519 Safefree(SvPVX(dstr));
4522 #ifdef PERL_COPY_ON_WRITE
4524 /* making another shared SV. */
4525 STRLEN cur = SvCUR(sstr);
4526 STRLEN len = SvLEN(sstr);
4527 assert (SvTYPE(dstr) >= SVt_PVIV);
4529 /* SvIsCOW_normal */
4530 /* splice us in between source and next-after-source. */
4531 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4532 SV_COW_NEXT_SV_SET(sstr, dstr);
4533 SvPV_set(dstr, SvPVX(sstr));
4535 /* SvIsCOW_shared_hash */
4536 UV hash = SvUVX(sstr);
4537 DEBUG_C(PerlIO_printf(Perl_debug_log,
4538 "Copy on write: Sharing hash\n"));
4540 sharepvn(SvPVX(sstr),
4541 (sflags & SVf_UTF8?-cur:cur), hash));
4542 SvUV_set(dstr, hash);
4544 SvLEN_set(dstr, len);
4545 SvCUR_set(dstr, cur);
4546 SvREADONLY_on(dstr);
4548 /* Relesase a global SV mutex. */
4552 { /* Passes the swipe test. */
4553 SvPV_set(dstr, SvPVX(sstr));
4554 SvLEN_set(dstr, SvLEN(sstr));
4555 SvCUR_set(dstr, SvCUR(sstr));
4558 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4559 SvPV_set(sstr, Nullch);
4565 if (sflags & SVf_UTF8)
4568 if (sflags & SVp_NOK) {
4570 if (sflags & SVf_NOK)
4571 SvFLAGS(dstr) |= SVf_NOK;
4572 SvNV_set(dstr, SvNVX(sstr));
4574 if (sflags & SVp_IOK) {
4575 (void)SvIOKp_on(dstr);
4576 if (sflags & SVf_IOK)
4577 SvFLAGS(dstr) |= SVf_IOK;
4578 if (sflags & SVf_IVisUV)
4580 SvIV_set(dstr, SvIVX(sstr));
4583 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4584 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4585 smg->mg_ptr, smg->mg_len);
4586 SvRMAGICAL_on(dstr);
4589 else if (sflags & SVp_IOK) {
4590 if (sflags & SVf_IOK)
4591 (void)SvIOK_only(dstr);
4593 (void)SvOK_off(dstr);
4594 (void)SvIOKp_on(dstr);
4596 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4597 if (sflags & SVf_IVisUV)
4599 SvIV_set(dstr, SvIVX(sstr));
4600 if (sflags & SVp_NOK) {
4601 if (sflags & SVf_NOK)
4602 (void)SvNOK_on(dstr);
4604 (void)SvNOKp_on(dstr);
4605 SvNV_set(dstr, SvNVX(sstr));
4608 else if (sflags & SVp_NOK) {
4609 if (sflags & SVf_NOK)
4610 (void)SvNOK_only(dstr);
4612 (void)SvOK_off(dstr);
4615 SvNV_set(dstr, SvNVX(sstr));
4618 if (dtype == SVt_PVGV) {
4619 if (ckWARN(WARN_MISC))
4620 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4623 (void)SvOK_off(dstr);
4625 if (SvTAINTED(sstr))
4630 =for apidoc sv_setsv_mg
4632 Like C<sv_setsv>, but also handles 'set' magic.
4638 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4640 sv_setsv(dstr,sstr);
4644 #ifdef PERL_COPY_ON_WRITE
4646 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4648 STRLEN cur = SvCUR(sstr);
4649 STRLEN len = SvLEN(sstr);
4650 register char *new_pv;
4653 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4661 if (SvTHINKFIRST(dstr))
4662 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4663 else if (SvPVX(dstr))
4664 Safefree(SvPVX(dstr));
4668 (void)SvUPGRADE (dstr, SVt_PVIV);
4670 assert (SvPOK(sstr));
4671 assert (SvPOKp(sstr));
4672 assert (!SvIOK(sstr));
4673 assert (!SvIOKp(sstr));
4674 assert (!SvNOK(sstr));
4675 assert (!SvNOKp(sstr));
4677 if (SvIsCOW(sstr)) {
4679 if (SvLEN(sstr) == 0) {
4680 /* source is a COW shared hash key. */
4681 UV hash = SvUVX(sstr);
4682 DEBUG_C(PerlIO_printf(Perl_debug_log,
4683 "Fast copy on write: Sharing hash\n"));
4684 SvUV_set(dstr, hash);
4685 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4688 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4690 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4691 (void)SvUPGRADE (sstr, SVt_PVIV);
4692 SvREADONLY_on(sstr);
4694 DEBUG_C(PerlIO_printf(Perl_debug_log,
4695 "Fast copy on write: Converting sstr to COW\n"));
4696 SV_COW_NEXT_SV_SET(dstr, sstr);
4698 SV_COW_NEXT_SV_SET(sstr, dstr);
4699 new_pv = SvPVX(sstr);
4702 SvPV_set(dstr, new_pv);
4703 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4706 SvLEN_set(dstr, len);
4707 SvCUR_set(dstr, cur);
4716 =for apidoc sv_setpvn
4718 Copies a string into an SV. The C<len> parameter indicates the number of
4719 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4720 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4726 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4728 register char *dptr;
4730 SV_CHECK_THINKFIRST_COW_DROP(sv);
4736 /* len is STRLEN which is unsigned, need to copy to signed */
4739 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4741 (void)SvUPGRADE(sv, SVt_PV);
4743 SvGROW(sv, len + 1);
4745 Move(ptr,dptr,len,char);
4748 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4753 =for apidoc sv_setpvn_mg
4755 Like C<sv_setpvn>, but also handles 'set' magic.
4761 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4763 sv_setpvn(sv,ptr,len);
4768 =for apidoc sv_setpv
4770 Copies a string into an SV. The string must be null-terminated. Does not
4771 handle 'set' magic. See C<sv_setpv_mg>.
4777 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4779 register STRLEN len;
4781 SV_CHECK_THINKFIRST_COW_DROP(sv);
4787 (void)SvUPGRADE(sv, SVt_PV);
4789 SvGROW(sv, len + 1);
4790 Move(ptr,SvPVX(sv),len+1,char);
4792 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4797 =for apidoc sv_setpv_mg
4799 Like C<sv_setpv>, but also handles 'set' magic.
4805 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4812 =for apidoc sv_usepvn
4814 Tells an SV to use C<ptr> to find its string value. Normally the string is
4815 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4816 The C<ptr> should point to memory that was allocated by C<malloc>. The
4817 string length, C<len>, must be supplied. This function will realloc the
4818 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4819 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4820 See C<sv_usepvn_mg>.
4826 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4828 SV_CHECK_THINKFIRST_COW_DROP(sv);
4829 (void)SvUPGRADE(sv, SVt_PV);
4834 (void)SvOOK_off(sv);
4835 if (SvPVX(sv) && SvLEN(sv))
4836 Safefree(SvPVX(sv));
4837 Renew(ptr, len+1, char);
4840 SvLEN_set(sv, len+1);
4842 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4847 =for apidoc sv_usepvn_mg
4849 Like C<sv_usepvn>, but also handles 'set' magic.
4855 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4857 sv_usepvn(sv,ptr,len);
4861 #ifdef PERL_COPY_ON_WRITE
4862 /* Need to do this *after* making the SV normal, as we need the buffer
4863 pointer to remain valid until after we've copied it. If we let go too early,
4864 another thread could invalidate it by unsharing last of the same hash key
4865 (which it can do by means other than releasing copy-on-write Svs)
4866 or by changing the other copy-on-write SVs in the loop. */
4868 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4869 U32 hash, SV *after)
4871 if (len) { /* this SV was SvIsCOW_normal(sv) */
4872 /* we need to find the SV pointing to us. */
4873 SV *current = SV_COW_NEXT_SV(after);
4875 if (current == sv) {
4876 /* The SV we point to points back to us (there were only two of us
4878 Hence other SV is no longer copy on write either. */
4880 SvREADONLY_off(after);
4882 /* We need to follow the pointers around the loop. */
4884 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4887 /* don't loop forever if the structure is bust, and we have
4888 a pointer into a closed loop. */
4889 assert (current != after);
4890 assert (SvPVX(current) == pvx);
4892 /* Make the SV before us point to the SV after us. */
4893 SV_COW_NEXT_SV_SET(current, after);
4896 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4901 Perl_sv_release_IVX(pTHX_ register SV *sv)
4904 sv_force_normal_flags(sv, 0);
4910 =for apidoc sv_force_normal_flags
4912 Undo various types of fakery on an SV: if the PV is a shared string, make
4913 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4914 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4915 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4916 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4917 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4918 set to some other value.) In addition, the C<flags> parameter gets passed to
4919 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4920 with flags set to 0.
4926 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4928 #ifdef PERL_COPY_ON_WRITE
4929 if (SvREADONLY(sv)) {
4930 /* At this point I believe I should acquire a global SV mutex. */
4932 char *pvx = SvPVX(sv);
4933 STRLEN len = SvLEN(sv);
4934 STRLEN cur = SvCUR(sv);
4935 U32 hash = SvUVX(sv);
4936 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4938 PerlIO_printf(Perl_debug_log,
4939 "Copy on write: Force normal %ld\n",
4945 /* This SV doesn't own the buffer, so need to New() a new one: */
4946 SvPV_set(sv, (char*)0);
4948 if (flags & SV_COW_DROP_PV) {
4949 /* OK, so we don't need to copy our buffer. */
4952 SvGROW(sv, cur + 1);
4953 Move(pvx,SvPVX(sv),cur,char);
4957 sv_release_COW(sv, pvx, cur, len, hash, next);
4962 else if (IN_PERL_RUNTIME)
4963 Perl_croak(aTHX_ PL_no_modify);
4964 /* At this point I believe that I can drop the global SV mutex. */
4967 if (SvREADONLY(sv)) {
4969 char *pvx = SvPVX(sv);
4970 int is_utf8 = SvUTF8(sv);
4971 STRLEN len = SvCUR(sv);
4972 U32 hash = SvUVX(sv);
4975 SvPV_set(sv, (char*)0);
4977 SvGROW(sv, len + 1);
4978 Move(pvx,SvPVX(sv),len,char);
4980 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4982 else if (IN_PERL_RUNTIME)
4983 Perl_croak(aTHX_ PL_no_modify);
4987 sv_unref_flags(sv, flags);
4988 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4993 =for apidoc sv_force_normal
4995 Undo various types of fakery on an SV: if the PV is a shared string, make
4996 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4997 an xpvmg. See also C<sv_force_normal_flags>.
5003 Perl_sv_force_normal(pTHX_ register SV *sv)
5005 sv_force_normal_flags(sv, 0);
5011 Efficient removal of characters from the beginning of the string buffer.
5012 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5013 the string buffer. The C<ptr> becomes the first character of the adjusted
5014 string. Uses the "OOK hack".
5015 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
5016 refer to the same chunk of data.
5022 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
5024 register STRLEN delta;
5025 if (!ptr || !SvPOKp(sv))
5027 delta = ptr - SvPVX(sv);
5028 SV_CHECK_THINKFIRST(sv);
5029 if (SvTYPE(sv) < SVt_PVIV)
5030 sv_upgrade(sv,SVt_PVIV);
5033 if (!SvLEN(sv)) { /* make copy of shared string */
5034 char *pvx = SvPVX(sv);
5035 STRLEN len = SvCUR(sv);
5036 SvGROW(sv, len + 1);
5037 Move(pvx,SvPVX(sv),len,char);
5041 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5042 and we do that anyway inside the SvNIOK_off
5044 SvFLAGS(sv) |= SVf_OOK;
5047 SvLEN_set(sv, SvLEN(sv) - delta);
5048 SvCUR_set(sv, SvCUR(sv) - delta);
5049 SvPV_set(sv, SvPVX(sv) + delta);
5050 SvIV_set(sv, SvIVX(sv) + delta);
5053 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5054 * this function provided for binary compatibility only
5058 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5060 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5064 =for apidoc sv_catpvn
5066 Concatenates the string onto the end of the string which is in the SV. The
5067 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5068 status set, then the bytes appended should be valid UTF-8.
5069 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5071 =for apidoc sv_catpvn_flags
5073 Concatenates the string onto the end of the string which is in the SV. The
5074 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5075 status set, then the bytes appended should be valid UTF-8.
5076 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5077 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5078 in terms of this function.
5084 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5089 dstr = SvPV_force_flags(dsv, dlen, flags);
5090 SvGROW(dsv, dlen + slen + 1);
5093 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5094 SvCUR_set(dsv, SvCUR(dsv) + slen);
5096 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5101 =for apidoc sv_catpvn_mg
5103 Like C<sv_catpvn>, but also handles 'set' magic.
5109 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5111 sv_catpvn(sv,ptr,len);
5115 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5116 * this function provided for binary compatibility only
5120 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5122 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5126 =for apidoc sv_catsv
5128 Concatenates the string from SV C<ssv> onto the end of the string in
5129 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5130 not 'set' magic. See C<sv_catsv_mg>.
5132 =for apidoc sv_catsv_flags
5134 Concatenates the string from SV C<ssv> onto the end of the string in
5135 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5136 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5137 and C<sv_catsv_nomg> are implemented in terms of this function.
5142 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5148 if ((spv = SvPV(ssv, slen))) {
5149 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5150 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5151 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5152 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5153 dsv->sv_flags doesn't have that bit set.
5154 Andy Dougherty 12 Oct 2001
5156 I32 sutf8 = DO_UTF8(ssv);
5159 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5161 dutf8 = DO_UTF8(dsv);
5163 if (dutf8 != sutf8) {
5165 /* Not modifying source SV, so taking a temporary copy. */
5166 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5168 sv_utf8_upgrade(csv);
5169 spv = SvPV(csv, slen);
5172 sv_utf8_upgrade_nomg(dsv);
5174 sv_catpvn_nomg(dsv, spv, slen);
5179 =for apidoc sv_catsv_mg
5181 Like C<sv_catsv>, but also handles 'set' magic.
5187 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5194 =for apidoc sv_catpv
5196 Concatenates the string onto the end of the string which is in the SV.
5197 If the SV has the UTF-8 status set, then the bytes appended should be
5198 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5203 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5205 register STRLEN len;
5211 junk = SvPV_force(sv, tlen);
5213 SvGROW(sv, tlen + len + 1);
5216 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5217 SvCUR_set(sv, SvCUR(sv) + len);
5218 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5223 =for apidoc sv_catpv_mg
5225 Like C<sv_catpv>, but also handles 'set' magic.
5231 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5240 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5241 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5248 Perl_newSV(pTHX_ STRLEN len)
5254 sv_upgrade(sv, SVt_PV);
5255 SvGROW(sv, len + 1);
5260 =for apidoc sv_magicext
5262 Adds magic to an SV, upgrading it if necessary. Applies the
5263 supplied vtable and returns a pointer to the magic added.
5265 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5266 In particular, you can add magic to SvREADONLY SVs, and add more than
5267 one instance of the same 'how'.
5269 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5270 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5271 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5272 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5274 (This is now used as a subroutine by C<sv_magic>.)
5279 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5280 const char* name, I32 namlen)
5284 if (SvTYPE(sv) < SVt_PVMG) {
5285 (void)SvUPGRADE(sv, SVt_PVMG);
5287 Newz(702,mg, 1, MAGIC);
5288 mg->mg_moremagic = SvMAGIC(sv);
5289 SvMAGIC_set(sv, mg);
5291 /* Sometimes a magic contains a reference loop, where the sv and
5292 object refer to each other. To prevent a reference loop that
5293 would prevent such objects being freed, we look for such loops
5294 and if we find one we avoid incrementing the object refcount.
5296 Note we cannot do this to avoid self-tie loops as intervening RV must
5297 have its REFCNT incremented to keep it in existence.
5300 if (!obj || obj == sv ||
5301 how == PERL_MAGIC_arylen ||
5302 how == PERL_MAGIC_qr ||
5303 (SvTYPE(obj) == SVt_PVGV &&
5304 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5305 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5306 GvFORM(obj) == (CV*)sv)))
5311 mg->mg_obj = SvREFCNT_inc(obj);
5312 mg->mg_flags |= MGf_REFCOUNTED;
5315 /* Normal self-ties simply pass a null object, and instead of
5316 using mg_obj directly, use the SvTIED_obj macro to produce a
5317 new RV as needed. For glob "self-ties", we are tieing the PVIO
5318 with an RV obj pointing to the glob containing the PVIO. In
5319 this case, to avoid a reference loop, we need to weaken the
5323 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5324 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5330 mg->mg_len = namlen;
5333 mg->mg_ptr = savepvn(name, namlen);
5334 else if (namlen == HEf_SVKEY)
5335 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5337 mg->mg_ptr = (char *) name;
5339 mg->mg_virtual = vtable;
5343 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5348 =for apidoc sv_magic
5350 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5351 then adds a new magic item of type C<how> to the head of the magic list.
5353 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5354 handling of the C<name> and C<namlen> arguments.
5356 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5357 to add more than one instance of the same 'how'.
5363 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5365 const MGVTBL *vtable = 0;
5368 #ifdef PERL_COPY_ON_WRITE
5370 sv_force_normal_flags(sv, 0);
5372 if (SvREADONLY(sv)) {
5374 && how != PERL_MAGIC_regex_global
5375 && how != PERL_MAGIC_bm
5376 && how != PERL_MAGIC_fm
5377 && how != PERL_MAGIC_sv
5378 && how != PERL_MAGIC_backref
5381 Perl_croak(aTHX_ PL_no_modify);
5384 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5385 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5386 /* sv_magic() refuses to add a magic of the same 'how' as an
5389 if (how == PERL_MAGIC_taint)
5397 vtable = &PL_vtbl_sv;
5399 case PERL_MAGIC_overload:
5400 vtable = &PL_vtbl_amagic;
5402 case PERL_MAGIC_overload_elem:
5403 vtable = &PL_vtbl_amagicelem;
5405 case PERL_MAGIC_overload_table:
5406 vtable = &PL_vtbl_ovrld;
5409 vtable = &PL_vtbl_bm;
5411 case PERL_MAGIC_regdata:
5412 vtable = &PL_vtbl_regdata;
5414 case PERL_MAGIC_regdatum:
5415 vtable = &PL_vtbl_regdatum;
5417 case PERL_MAGIC_env:
5418 vtable = &PL_vtbl_env;
5421 vtable = &PL_vtbl_fm;
5423 case PERL_MAGIC_envelem:
5424 vtable = &PL_vtbl_envelem;
5426 case PERL_MAGIC_regex_global:
5427 vtable = &PL_vtbl_mglob;
5429 case PERL_MAGIC_isa:
5430 vtable = &PL_vtbl_isa;
5432 case PERL_MAGIC_isaelem:
5433 vtable = &PL_vtbl_isaelem;
5435 case PERL_MAGIC_nkeys:
5436 vtable = &PL_vtbl_nkeys;
5438 case PERL_MAGIC_dbfile:
5441 case PERL_MAGIC_dbline:
5442 vtable = &PL_vtbl_dbline;
5444 #ifdef USE_LOCALE_COLLATE
5445 case PERL_MAGIC_collxfrm:
5446 vtable = &PL_vtbl_collxfrm;
5448 #endif /* USE_LOCALE_COLLATE */
5449 case PERL_MAGIC_tied:
5450 vtable = &PL_vtbl_pack;
5452 case PERL_MAGIC_tiedelem:
5453 case PERL_MAGIC_tiedscalar:
5454 vtable = &PL_vtbl_packelem;
5457 vtable = &PL_vtbl_regexp;
5459 case PERL_MAGIC_sig:
5460 vtable = &PL_vtbl_sig;
5462 case PERL_MAGIC_sigelem:
5463 vtable = &PL_vtbl_sigelem;
5465 case PERL_MAGIC_taint:
5466 vtable = &PL_vtbl_taint;
5468 case PERL_MAGIC_uvar:
5469 vtable = &PL_vtbl_uvar;
5471 case PERL_MAGIC_vec:
5472 vtable = &PL_vtbl_vec;
5474 case PERL_MAGIC_vstring:
5477 case PERL_MAGIC_utf8:
5478 vtable = &PL_vtbl_utf8;
5480 case PERL_MAGIC_substr:
5481 vtable = &PL_vtbl_substr;
5483 case PERL_MAGIC_defelem:
5484 vtable = &PL_vtbl_defelem;
5486 case PERL_MAGIC_glob:
5487 vtable = &PL_vtbl_glob;
5489 case PERL_MAGIC_arylen:
5490 vtable = &PL_vtbl_arylen;
5492 case PERL_MAGIC_pos:
5493 vtable = &PL_vtbl_pos;
5495 case PERL_MAGIC_backref:
5496 vtable = &PL_vtbl_backref;
5498 case PERL_MAGIC_ext:
5499 /* Reserved for use by extensions not perl internals. */
5500 /* Useful for attaching extension internal data to perl vars. */
5501 /* Note that multiple extensions may clash if magical scalars */
5502 /* etc holding private data from one are passed to another. */
5505 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5508 /* Rest of work is done else where */
5509 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5512 case PERL_MAGIC_taint:
5515 case PERL_MAGIC_ext:
5516 case PERL_MAGIC_dbfile:
5523 =for apidoc sv_unmagic
5525 Removes all magic of type C<type> from an SV.
5531 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5535 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5538 for (mg = *mgp; mg; mg = *mgp) {
5539 if (mg->mg_type == type) {
5540 const MGVTBL* const vtbl = mg->mg_virtual;
5541 *mgp = mg->mg_moremagic;
5542 if (vtbl && vtbl->svt_free)
5543 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5544 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5546 Safefree(mg->mg_ptr);
5547 else if (mg->mg_len == HEf_SVKEY)
5548 SvREFCNT_dec((SV*)mg->mg_ptr);
5549 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5550 Safefree(mg->mg_ptr);
5552 if (mg->mg_flags & MGf_REFCOUNTED)
5553 SvREFCNT_dec(mg->mg_obj);
5557 mgp = &mg->mg_moremagic;
5561 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5568 =for apidoc sv_rvweaken
5570 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5571 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5572 push a back-reference to this RV onto the array of backreferences
5573 associated with that magic.
5579 Perl_sv_rvweaken(pTHX_ SV *sv)
5582 if (!SvOK(sv)) /* let undefs pass */
5585 Perl_croak(aTHX_ "Can't weaken a nonreference");
5586 else if (SvWEAKREF(sv)) {
5587 if (ckWARN(WARN_MISC))
5588 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5592 sv_add_backref(tsv, sv);
5598 /* Give tsv backref magic if it hasn't already got it, then push a
5599 * back-reference to sv onto the array associated with the backref magic.
5603 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5607 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5608 av = (AV*)mg->mg_obj;
5611 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5612 /* av now has a refcnt of 2, which avoids it getting freed
5613 * before us during global cleanup. The extra ref is removed
5614 * by magic_killbackrefs() when tsv is being freed */
5616 if (AvFILLp(av) >= AvMAX(av)) {
5618 SV **svp = AvARRAY(av);
5619 for (i = AvFILLp(av); i >= 0; i--)
5621 svp[i] = sv; /* reuse the slot */
5624 av_extend(av, AvFILLp(av)+1);
5626 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5629 /* delete a back-reference to ourselves from the backref magic associated
5630 * with the SV we point to.
5634 S_sv_del_backref(pTHX_ SV *sv)
5641 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5642 Perl_croak(aTHX_ "panic: del_backref");
5643 av = (AV *)mg->mg_obj;
5645 for (i = AvFILLp(av); i >= 0; i--)
5646 if (svp[i] == sv) svp[i] = Nullsv;
5650 =for apidoc sv_insert
5652 Inserts a string at the specified offset/length within the SV. Similar to
5653 the Perl substr() function.
5659 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5663 register char *midend;
5664 register char *bigend;
5670 Perl_croak(aTHX_ "Can't modify non-existent substring");
5671 SvPV_force(bigstr, curlen);
5672 (void)SvPOK_only_UTF8(bigstr);
5673 if (offset + len > curlen) {
5674 SvGROW(bigstr, offset+len+1);
5675 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5676 SvCUR_set(bigstr, offset+len);
5680 i = littlelen - len;
5681 if (i > 0) { /* string might grow */
5682 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5683 mid = big + offset + len;
5684 midend = bigend = big + SvCUR(bigstr);
5687 while (midend > mid) /* shove everything down */
5688 *--bigend = *--midend;
5689 Move(little,big+offset,littlelen,char);
5690 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5695 Move(little,SvPVX(bigstr)+offset,len,char);
5700 big = SvPVX(bigstr);
5703 bigend = big + SvCUR(bigstr);
5705 if (midend > bigend)
5706 Perl_croak(aTHX_ "panic: sv_insert");
5708 if (mid - big > bigend - midend) { /* faster to shorten from end */
5710 Move(little, mid, littlelen,char);
5713 i = bigend - midend;
5715 Move(midend, mid, i,char);
5719 SvCUR_set(bigstr, mid - big);
5722 else if ((i = mid - big)) { /* faster from front */
5723 midend -= littlelen;
5725 sv_chop(bigstr,midend-i);
5730 Move(little, mid, littlelen,char);
5732 else if (littlelen) {
5733 midend -= littlelen;
5734 sv_chop(bigstr,midend);
5735 Move(little,midend,littlelen,char);
5738 sv_chop(bigstr,midend);
5744 =for apidoc sv_replace
5746 Make the first argument a copy of the second, then delete the original.
5747 The target SV physically takes over ownership of the body of the source SV
5748 and inherits its flags; however, the target keeps any magic it owns,
5749 and any magic in the source is discarded.
5750 Note that this is a rather specialist SV copying operation; most of the
5751 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5757 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5759 U32 refcnt = SvREFCNT(sv);
5760 SV_CHECK_THINKFIRST_COW_DROP(sv);
5761 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5762 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5763 if (SvMAGICAL(sv)) {
5767 sv_upgrade(nsv, SVt_PVMG);
5768 SvMAGIC_set(nsv, SvMAGIC(sv));
5769 SvFLAGS(nsv) |= SvMAGICAL(sv);
5771 SvMAGIC_set(sv, NULL);
5775 assert(!SvREFCNT(sv));
5776 #ifdef DEBUG_LEAKING_SCALARS
5777 sv->sv_flags = nsv->sv_flags;
5778 sv->sv_any = nsv->sv_any;
5779 sv->sv_refcnt = nsv->sv_refcnt;
5781 StructCopy(nsv,sv,SV);
5784 #ifdef PERL_COPY_ON_WRITE
5785 if (SvIsCOW_normal(nsv)) {
5786 /* We need to follow the pointers around the loop to make the
5787 previous SV point to sv, rather than nsv. */
5790 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5793 assert(SvPVX(current) == SvPVX(nsv));
5795 /* Make the SV before us point to the SV after us. */
5797 PerlIO_printf(Perl_debug_log, "previous is\n");
5799 PerlIO_printf(Perl_debug_log,
5800 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5801 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5803 SV_COW_NEXT_SV_SET(current, sv);
5806 SvREFCNT(sv) = refcnt;
5807 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5813 =for apidoc sv_clear
5815 Clear an SV: call any destructors, free up any memory used by the body,
5816 and free the body itself. The SV's head is I<not> freed, although
5817 its type is set to all 1's so that it won't inadvertently be assumed
5818 to be live during global destruction etc.
5819 This function should only be called when REFCNT is zero. Most of the time
5820 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5827 Perl_sv_clear(pTHX_ register SV *sv)
5831 assert(SvREFCNT(sv) == 0);
5834 if (PL_defstash) { /* Still have a symbol table? */
5841 stash = SvSTASH(sv);
5842 destructor = StashHANDLER(stash,DESTROY);
5844 SV* tmpref = newRV(sv);
5845 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5847 PUSHSTACKi(PERLSI_DESTROY);
5852 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5858 if(SvREFCNT(tmpref) < 2) {
5859 /* tmpref is not kept alive! */
5861 SvRV_set(tmpref, NULL);
5864 SvREFCNT_dec(tmpref);
5866 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5870 if (PL_in_clean_objs)
5871 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5873 /* DESTROY gave object new lease on life */
5879 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5880 SvOBJECT_off(sv); /* Curse the object. */
5881 if (SvTYPE(sv) != SVt_PVIO)
5882 --PL_sv_objcount; /* XXX Might want something more general */
5885 if (SvTYPE(sv) >= SVt_PVMG) {
5888 if (SvFLAGS(sv) & SVpad_TYPED)
5889 SvREFCNT_dec(SvSTASH(sv));
5892 switch (SvTYPE(sv)) {
5895 IoIFP(sv) != PerlIO_stdin() &&
5896 IoIFP(sv) != PerlIO_stdout() &&
5897 IoIFP(sv) != PerlIO_stderr())
5899 io_close((IO*)sv, FALSE);
5901 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5902 PerlDir_close(IoDIRP(sv));
5903 IoDIRP(sv) = (DIR*)NULL;
5904 Safefree(IoTOP_NAME(sv));
5905 Safefree(IoFMT_NAME(sv));
5906 Safefree(IoBOTTOM_NAME(sv));
5921 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5922 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5923 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5924 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5926 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5927 SvREFCNT_dec(LvTARG(sv));
5931 Safefree(GvNAME(sv));
5932 /* cannot decrease stash refcount yet, as we might recursively delete
5933 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5934 of stash until current sv is completely gone.
5935 -- JohnPC, 27 Mar 1998 */
5936 stash = GvSTASH(sv);
5950 SvREFCNT_dec(SvRV(sv));
5952 #ifdef PERL_COPY_ON_WRITE
5953 else if (SvPVX(sv)) {
5955 /* I believe I need to grab the global SV mutex here and
5956 then recheck the COW status. */
5958 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5961 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5962 SvUVX(sv), SV_COW_NEXT_SV(sv));
5963 /* And drop it here. */
5965 } else if (SvLEN(sv)) {
5966 Safefree(SvPVX(sv));
5970 else if (SvPVX(sv) && SvLEN(sv))
5971 Safefree(SvPVX(sv));
5972 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5973 unsharepvn(SvPVX(sv),
5974 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5988 switch (SvTYPE(sv)) {
6004 del_XPVIV(SvANY(sv));
6007 del_XPVNV(SvANY(sv));
6010 del_XPVMG(SvANY(sv));
6013 del_XPVLV(SvANY(sv));
6016 del_XPVAV(SvANY(sv));
6019 del_XPVHV(SvANY(sv));
6022 del_XPVCV(SvANY(sv));
6025 del_XPVGV(SvANY(sv));
6026 /* code duplication for increased performance. */
6027 SvFLAGS(sv) &= SVf_BREAK;
6028 SvFLAGS(sv) |= SVTYPEMASK;
6029 /* decrease refcount of the stash that owns this GV, if any */
6031 SvREFCNT_dec(stash);
6032 return; /* not break, SvFLAGS reset already happened */
6034 del_XPVBM(SvANY(sv));
6037 del_XPVFM(SvANY(sv));
6040 del_XPVIO(SvANY(sv));
6043 SvFLAGS(sv) &= SVf_BREAK;
6044 SvFLAGS(sv) |= SVTYPEMASK;
6048 =for apidoc sv_newref
6050 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6057 Perl_sv_newref(pTHX_ SV *sv)
6067 Decrement an SV's reference count, and if it drops to zero, call
6068 C<sv_clear> to invoke destructors and free up any memory used by
6069 the body; finally, deallocate the SV's head itself.
6070 Normally called via a wrapper macro C<SvREFCNT_dec>.
6076 Perl_sv_free(pTHX_ SV *sv)
6080 if (SvREFCNT(sv) == 0) {
6081 if (SvFLAGS(sv) & SVf_BREAK)
6082 /* this SV's refcnt has been artificially decremented to
6083 * trigger cleanup */
6085 if (PL_in_clean_all) /* All is fair */
6087 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6088 /* make sure SvREFCNT(sv)==0 happens very seldom */
6089 SvREFCNT(sv) = (~(U32)0)/2;
6092 if (ckWARN_d(WARN_INTERNAL))
6093 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6094 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6095 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6098 if (--(SvREFCNT(sv)) > 0)
6100 Perl_sv_free2(aTHX_ sv);
6104 Perl_sv_free2(pTHX_ SV *sv)
6108 if (ckWARN_d(WARN_DEBUGGING))
6109 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6110 "Attempt to free temp prematurely: SV 0x%"UVxf
6111 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6115 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6116 /* make sure SvREFCNT(sv)==0 happens very seldom */
6117 SvREFCNT(sv) = (~(U32)0)/2;
6128 Returns the length of the string in the SV. Handles magic and type
6129 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6135 Perl_sv_len(pTHX_ register SV *sv)
6143 len = mg_length(sv);
6145 (void)SvPV(sv, len);
6150 =for apidoc sv_len_utf8
6152 Returns the number of characters in the string in an SV, counting wide
6153 UTF-8 bytes as a single character. Handles magic and type coercion.
6159 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6160 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6161 * (Note that the mg_len is not the length of the mg_ptr field.)
6166 Perl_sv_len_utf8(pTHX_ register SV *sv)
6172 return mg_length(sv);
6176 U8 *s = (U8*)SvPV(sv, len);
6177 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6179 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6181 #ifdef PERL_UTF8_CACHE_ASSERT
6182 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6186 ulen = Perl_utf8_length(aTHX_ s, s + len);
6187 if (!mg && !SvREADONLY(sv)) {
6188 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6189 mg = mg_find(sv, PERL_MAGIC_utf8);
6199 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6200 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6201 * between UTF-8 and byte offsets. There are two (substr offset and substr
6202 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6203 * and byte offset) cache positions.
6205 * The mg_len field is used by sv_len_utf8(), see its comments.
6206 * Note that the mg_len is not the length of the mg_ptr field.
6210 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
6214 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6216 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, &PL_vtbl_utf8, 0, 0);
6220 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6222 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6223 (*mgp)->mg_ptr = (char *) *cachep;
6227 (*cachep)[i] = *offsetp;
6228 (*cachep)[i+1] = s - start;
6236 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6237 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6238 * between UTF-8 and byte offsets. See also the comments of
6239 * S_utf8_mg_pos_init().
6243 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6247 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6249 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6250 if (*mgp && (*mgp)->mg_ptr) {
6251 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6252 ASSERT_UTF8_CACHE(*cachep);
6253 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6255 else { /* We will skip to the right spot. */
6260 /* The assumption is that going backward is half
6261 * the speed of going forward (that's where the
6262 * 2 * backw in the below comes from). (The real
6263 * figure of course depends on the UTF-8 data.) */
6265 if ((*cachep)[i] > (STRLEN)uoff) {
6267 backw = (*cachep)[i] - (STRLEN)uoff;
6269 if (forw < 2 * backw)
6272 p = start + (*cachep)[i+1];
6274 /* Try this only for the substr offset (i == 0),
6275 * not for the substr length (i == 2). */
6276 else if (i == 0) { /* (*cachep)[i] < uoff */
6277 STRLEN ulen = sv_len_utf8(sv);
6279 if ((STRLEN)uoff < ulen) {
6280 forw = (STRLEN)uoff - (*cachep)[i];
6281 backw = ulen - (STRLEN)uoff;
6283 if (forw < 2 * backw)
6284 p = start + (*cachep)[i+1];
6289 /* If the string is not long enough for uoff,
6290 * we could extend it, but not at this low a level. */
6294 if (forw < 2 * backw) {
6301 while (UTF8_IS_CONTINUATION(*p))
6306 /* Update the cache. */
6307 (*cachep)[i] = (STRLEN)uoff;
6308 (*cachep)[i+1] = p - start;
6310 /* Drop the stale "length" cache */
6319 if (found) { /* Setup the return values. */
6320 *offsetp = (*cachep)[i+1];
6321 *sp = start + *offsetp;
6324 *offsetp = send - start;
6326 else if (*sp < start) {
6332 #ifdef PERL_UTF8_CACHE_ASSERT
6337 while (n-- && s < send)
6341 assert(*offsetp == s - start);
6342 assert((*cachep)[0] == (STRLEN)uoff);
6343 assert((*cachep)[1] == *offsetp);
6345 ASSERT_UTF8_CACHE(*cachep);
6354 =for apidoc sv_pos_u2b
6356 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6357 the start of the string, to a count of the equivalent number of bytes; if
6358 lenp is non-zero, it does the same to lenp, but this time starting from
6359 the offset, rather than from the start of the string. Handles magic and
6366 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6367 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6368 * byte offsets. See also the comments of S_utf8_mg_pos().
6373 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6384 start = s = (U8*)SvPV(sv, len);
6386 I32 uoffset = *offsetp;
6391 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6393 if (!found && uoffset > 0) {
6394 while (s < send && uoffset--)
6398 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
6400 *offsetp = s - start;
6405 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6409 if (!found && *lenp > 0) {
6412 while (s < send && ulen--)
6416 utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start);
6420 ASSERT_UTF8_CACHE(cache);
6432 =for apidoc sv_pos_b2u
6434 Converts the value pointed to by offsetp from a count of bytes from the
6435 start of the string, to a count of the equivalent number of UTF-8 chars.
6436 Handles magic and type coercion.
6442 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6443 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6444 * byte offsets. See also the comments of S_utf8_mg_pos().
6449 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6457 s = (U8*)SvPV(sv, len);
6458 if ((I32)len < *offsetp)
6459 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6461 U8* send = s + *offsetp;
6463 STRLEN *cache = NULL;
6467 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6468 mg = mg_find(sv, PERL_MAGIC_utf8);
6469 if (mg && mg->mg_ptr) {
6470 cache = (STRLEN *) mg->mg_ptr;
6471 if (cache[1] == (STRLEN)*offsetp) {
6472 /* An exact match. */
6473 *offsetp = cache[0];
6477 else if (cache[1] < (STRLEN)*offsetp) {
6478 /* We already know part of the way. */
6481 /* Let the below loop do the rest. */
6483 else { /* cache[1] > *offsetp */
6484 /* We already know all of the way, now we may
6485 * be able to walk back. The same assumption
6486 * is made as in S_utf8_mg_pos(), namely that
6487 * walking backward is twice slower than
6488 * walking forward. */
6489 STRLEN forw = *offsetp;
6490 STRLEN backw = cache[1] - *offsetp;
6492 if (!(forw < 2 * backw)) {
6493 U8 *p = s + cache[1];
6500 while (UTF8_IS_CONTINUATION(*p)) {
6508 *offsetp = cache[0];
6510 /* Drop the stale "length" cache */
6518 ASSERT_UTF8_CACHE(cache);
6524 /* Call utf8n_to_uvchr() to validate the sequence
6525 * (unless a simple non-UTF character) */
6526 if (!UTF8_IS_INVARIANT(*s))
6527 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6536 if (!SvREADONLY(sv)) {
6538 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6539 mg = mg_find(sv, PERL_MAGIC_utf8);
6544 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6545 mg->mg_ptr = (char *) cache;
6550 cache[1] = *offsetp;
6551 /* Drop the stale "length" cache */
6564 Returns a boolean indicating whether the strings in the two SVs are
6565 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6566 coerce its args to strings if necessary.
6572 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6580 SV* svrecode = Nullsv;
6587 pv1 = SvPV(sv1, cur1);
6594 pv2 = SvPV(sv2, cur2);
6596 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6597 /* Differing utf8ness.
6598 * Do not UTF8size the comparands as a side-effect. */
6601 svrecode = newSVpvn(pv2, cur2);
6602 sv_recode_to_utf8(svrecode, PL_encoding);
6603 pv2 = SvPV(svrecode, cur2);
6606 svrecode = newSVpvn(pv1, cur1);
6607 sv_recode_to_utf8(svrecode, PL_encoding);
6608 pv1 = SvPV(svrecode, cur1);
6610 /* Now both are in UTF-8. */
6612 SvREFCNT_dec(svrecode);
6617 bool is_utf8 = TRUE;
6620 /* sv1 is the UTF-8 one,
6621 * if is equal it must be downgrade-able */
6622 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6628 /* sv2 is the UTF-8 one,
6629 * if is equal it must be downgrade-able */
6630 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6636 /* Downgrade not possible - cannot be eq */
6644 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6647 SvREFCNT_dec(svrecode);
6658 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6659 string in C<sv1> is less than, equal to, or greater than the string in
6660 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6661 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6667 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6670 const char *pv1, *pv2;
6673 SV *svrecode = Nullsv;
6680 pv1 = SvPV(sv1, cur1);
6687 pv2 = SvPV(sv2, cur2);
6689 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6690 /* Differing utf8ness.
6691 * Do not UTF8size the comparands as a side-effect. */
6694 svrecode = newSVpvn(pv2, cur2);
6695 sv_recode_to_utf8(svrecode, PL_encoding);
6696 pv2 = SvPV(svrecode, cur2);
6699 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6704 svrecode = newSVpvn(pv1, cur1);
6705 sv_recode_to_utf8(svrecode, PL_encoding);
6706 pv1 = SvPV(svrecode, cur1);
6709 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6715 cmp = cur2 ? -1 : 0;
6719 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6722 cmp = retval < 0 ? -1 : 1;
6723 } else if (cur1 == cur2) {
6726 cmp = cur1 < cur2 ? -1 : 1;
6731 SvREFCNT_dec(svrecode);
6740 =for apidoc sv_cmp_locale
6742 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6743 'use bytes' aware, handles get magic, and will coerce its args to strings
6744 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6750 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6752 #ifdef USE_LOCALE_COLLATE
6758 if (PL_collation_standard)
6762 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6764 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6766 if (!pv1 || !len1) {
6777 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6780 return retval < 0 ? -1 : 1;
6783 * When the result of collation is equality, that doesn't mean
6784 * that there are no differences -- some locales exclude some
6785 * characters from consideration. So to avoid false equalities,
6786 * we use the raw string as a tiebreaker.
6792 #endif /* USE_LOCALE_COLLATE */
6794 return sv_cmp(sv1, sv2);
6798 #ifdef USE_LOCALE_COLLATE
6801 =for apidoc sv_collxfrm
6803 Add Collate Transform magic to an SV if it doesn't already have it.
6805 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6806 scalar data of the variable, but transformed to such a format that a normal
6807 memory comparison can be used to compare the data according to the locale
6814 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6818 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6819 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6824 Safefree(mg->mg_ptr);
6826 if ((xf = mem_collxfrm(s, len, &xlen))) {
6827 if (SvREADONLY(sv)) {
6830 return xf + sizeof(PL_collation_ix);
6833 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6834 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6847 if (mg && mg->mg_ptr) {
6849 return mg->mg_ptr + sizeof(PL_collation_ix);
6857 #endif /* USE_LOCALE_COLLATE */
6862 Get a line from the filehandle and store it into the SV, optionally
6863 appending to the currently-stored string.
6869 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6873 register STDCHAR rslast;
6874 register STDCHAR *bp;
6880 if (SvTHINKFIRST(sv))
6881 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6882 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6884 However, perlbench says it's slower, because the existing swipe code
6885 is faster than copy on write.
6886 Swings and roundabouts. */
6887 (void)SvUPGRADE(sv, SVt_PV);
6892 if (PerlIO_isutf8(fp)) {
6894 sv_utf8_upgrade_nomg(sv);
6895 sv_pos_u2b(sv,&append,0);
6897 } else if (SvUTF8(sv)) {
6898 SV *tsv = NEWSV(0,0);
6899 sv_gets(tsv, fp, 0);
6900 sv_utf8_upgrade_nomg(tsv);
6901 SvCUR_set(sv,append);
6904 goto return_string_or_null;
6909 if (PerlIO_isutf8(fp))
6912 if (IN_PERL_COMPILETIME) {
6913 /* we always read code in line mode */
6917 else if (RsSNARF(PL_rs)) {
6918 /* If it is a regular disk file use size from stat() as estimate
6919 of amount we are going to read - may result in malloc-ing
6920 more memory than we realy need if layers bellow reduce
6921 size we read (e.g. CRLF or a gzip layer)
6924 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6925 Off_t offset = PerlIO_tell(fp);
6926 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6927 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6933 else if (RsRECORD(PL_rs)) {
6937 /* Grab the size of the record we're getting */
6938 recsize = SvIV(SvRV(PL_rs));
6939 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6942 /* VMS wants read instead of fread, because fread doesn't respect */
6943 /* RMS record boundaries. This is not necessarily a good thing to be */
6944 /* doing, but we've got no other real choice - except avoid stdio
6945 as implementation - perhaps write a :vms layer ?
6947 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6949 bytesread = PerlIO_read(fp, buffer, recsize);
6953 SvCUR_set(sv, bytesread += append);
6954 buffer[bytesread] = '\0';
6955 goto return_string_or_null;
6957 else if (RsPARA(PL_rs)) {
6963 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6964 if (PerlIO_isutf8(fp)) {
6965 rsptr = SvPVutf8(PL_rs, rslen);
6968 if (SvUTF8(PL_rs)) {
6969 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6970 Perl_croak(aTHX_ "Wide character in $/");
6973 rsptr = SvPV(PL_rs, rslen);
6977 rslast = rslen ? rsptr[rslen - 1] : '\0';
6979 if (rspara) { /* have to do this both before and after */
6980 do { /* to make sure file boundaries work right */
6983 i = PerlIO_getc(fp);
6987 PerlIO_ungetc(fp,i);
6993 /* See if we know enough about I/O mechanism to cheat it ! */
6995 /* This used to be #ifdef test - it is made run-time test for ease
6996 of abstracting out stdio interface. One call should be cheap
6997 enough here - and may even be a macro allowing compile
7001 if (PerlIO_fast_gets(fp)) {
7004 * We're going to steal some values from the stdio struct
7005 * and put EVERYTHING in the innermost loop into registers.
7007 register STDCHAR *ptr;
7011 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7012 /* An ungetc()d char is handled separately from the regular
7013 * buffer, so we getc() it back out and stuff it in the buffer.
7015 i = PerlIO_getc(fp);
7016 if (i == EOF) return 0;
7017 *(--((*fp)->_ptr)) = (unsigned char) i;
7021 /* Here is some breathtakingly efficient cheating */
7023 cnt = PerlIO_get_cnt(fp); /* get count into register */
7024 /* make sure we have the room */
7025 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7026 /* Not room for all of it
7027 if we are looking for a separator and room for some
7029 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7030 /* just process what we have room for */
7031 shortbuffered = cnt - SvLEN(sv) + append + 1;
7032 cnt -= shortbuffered;
7036 /* remember that cnt can be negative */
7037 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7042 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7043 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7044 DEBUG_P(PerlIO_printf(Perl_debug_log,
7045 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7046 DEBUG_P(PerlIO_printf(Perl_debug_log,
7047 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7048 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7049 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7054 while (cnt > 0) { /* this | eat */
7056 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7057 goto thats_all_folks; /* screams | sed :-) */
7061 Copy(ptr, bp, cnt, char); /* this | eat */
7062 bp += cnt; /* screams | dust */
7063 ptr += cnt; /* louder | sed :-) */
7068 if (shortbuffered) { /* oh well, must extend */
7069 cnt = shortbuffered;
7071 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7073 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7074 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7078 DEBUG_P(PerlIO_printf(Perl_debug_log,
7079 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7080 PTR2UV(ptr),(long)cnt));
7081 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7083 DEBUG_P(PerlIO_printf(Perl_debug_log,
7084 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7085 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7086 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7088 /* This used to call 'filbuf' in stdio form, but as that behaves like
7089 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7090 another abstraction. */
7091 i = PerlIO_getc(fp); /* get more characters */
7093 DEBUG_P(PerlIO_printf(Perl_debug_log,
7094 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7095 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7096 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7098 cnt = PerlIO_get_cnt(fp);
7099 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7100 DEBUG_P(PerlIO_printf(Perl_debug_log,
7101 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7103 if (i == EOF) /* all done for ever? */
7104 goto thats_really_all_folks;
7106 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7108 SvGROW(sv, bpx + cnt + 2);
7109 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7111 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7113 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7114 goto thats_all_folks;
7118 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7119 memNE((char*)bp - rslen, rsptr, rslen))
7120 goto screamer; /* go back to the fray */
7121 thats_really_all_folks:
7123 cnt += shortbuffered;
7124 DEBUG_P(PerlIO_printf(Perl_debug_log,
7125 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7126 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7127 DEBUG_P(PerlIO_printf(Perl_debug_log,
7128 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7129 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7130 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7132 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7133 DEBUG_P(PerlIO_printf(Perl_debug_log,
7134 "Screamer: done, len=%ld, string=|%.*s|\n",
7135 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7139 /*The big, slow, and stupid way. */
7141 /* Any stack-challenged places. */
7143 /* EPOC: need to work around SDK features. *
7144 * On WINS: MS VC5 generates calls to _chkstk, *
7145 * if a "large" stack frame is allocated. *
7146 * gcc on MARM does not generate calls like these. */
7147 # define USEHEAPINSTEADOFSTACK
7150 #ifdef USEHEAPINSTEADOFSTACK
7152 New(0, buf, 8192, STDCHAR);
7160 const register STDCHAR *bpe = buf + sizeof(buf);
7162 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7163 ; /* keep reading */
7167 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7168 /* Accomodate broken VAXC compiler, which applies U8 cast to
7169 * both args of ?: operator, causing EOF to change into 255
7172 i = (U8)buf[cnt - 1];
7178 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7180 sv_catpvn(sv, (char *) buf, cnt);
7182 sv_setpvn(sv, (char *) buf, cnt);
7184 if (i != EOF && /* joy */
7186 SvCUR(sv) < rslen ||
7187 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7191 * If we're reading from a TTY and we get a short read,
7192 * indicating that the user hit his EOF character, we need
7193 * to notice it now, because if we try to read from the TTY
7194 * again, the EOF condition will disappear.
7196 * The comparison of cnt to sizeof(buf) is an optimization
7197 * that prevents unnecessary calls to feof().
7201 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7205 #ifdef USEHEAPINSTEADOFSTACK
7210 if (rspara) { /* have to do this both before and after */
7211 while (i != EOF) { /* to make sure file boundaries work right */
7212 i = PerlIO_getc(fp);
7214 PerlIO_ungetc(fp,i);
7220 return_string_or_null:
7221 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7227 Auto-increment of the value in the SV, doing string to numeric conversion
7228 if necessary. Handles 'get' magic.
7234 Perl_sv_inc(pTHX_ register SV *sv)
7243 if (SvTHINKFIRST(sv)) {
7245 sv_force_normal_flags(sv, 0);
7246 if (SvREADONLY(sv)) {
7247 if (IN_PERL_RUNTIME)
7248 Perl_croak(aTHX_ PL_no_modify);
7252 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7254 i = PTR2IV(SvRV(sv));
7259 flags = SvFLAGS(sv);
7260 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7261 /* It's (privately or publicly) a float, but not tested as an
7262 integer, so test it to see. */
7264 flags = SvFLAGS(sv);
7266 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7267 /* It's publicly an integer, or privately an integer-not-float */
7268 #ifdef PERL_PRESERVE_IVUV
7272 if (SvUVX(sv) == UV_MAX)
7273 sv_setnv(sv, UV_MAX_P1);
7275 (void)SvIOK_only_UV(sv);
7276 SvUV_set(sv, SvUVX(sv) + 1);
7278 if (SvIVX(sv) == IV_MAX)
7279 sv_setuv(sv, (UV)IV_MAX + 1);
7281 (void)SvIOK_only(sv);
7282 SvIV_set(sv, SvIVX(sv) + 1);
7287 if (flags & SVp_NOK) {
7288 (void)SvNOK_only(sv);
7289 SvNV_set(sv, SvNVX(sv) + 1.0);
7293 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7294 if ((flags & SVTYPEMASK) < SVt_PVIV)
7295 sv_upgrade(sv, SVt_IV);
7296 (void)SvIOK_only(sv);
7301 while (isALPHA(*d)) d++;
7302 while (isDIGIT(*d)) d++;
7304 #ifdef PERL_PRESERVE_IVUV
7305 /* Got to punt this as an integer if needs be, but we don't issue
7306 warnings. Probably ought to make the sv_iv_please() that does
7307 the conversion if possible, and silently. */
7308 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7309 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7310 /* Need to try really hard to see if it's an integer.
7311 9.22337203685478e+18 is an integer.
7312 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7313 so $a="9.22337203685478e+18"; $a+0; $a++
7314 needs to be the same as $a="9.22337203685478e+18"; $a++
7321 /* sv_2iv *should* have made this an NV */
7322 if (flags & SVp_NOK) {
7323 (void)SvNOK_only(sv);
7324 SvNV_set(sv, SvNVX(sv) + 1.0);
7327 /* I don't think we can get here. Maybe I should assert this
7328 And if we do get here I suspect that sv_setnv will croak. NWC
7330 #if defined(USE_LONG_DOUBLE)
7331 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",
7332 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7334 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7335 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7338 #endif /* PERL_PRESERVE_IVUV */
7339 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7343 while (d >= SvPVX(sv)) {
7351 /* MKS: The original code here died if letters weren't consecutive.
7352 * at least it didn't have to worry about non-C locales. The
7353 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7354 * arranged in order (although not consecutively) and that only
7355 * [A-Za-z] are accepted by isALPHA in the C locale.
7357 if (*d != 'z' && *d != 'Z') {
7358 do { ++*d; } while (!isALPHA(*d));
7361 *(d--) -= 'z' - 'a';
7366 *(d--) -= 'z' - 'a' + 1;
7370 /* oh,oh, the number grew */
7371 SvGROW(sv, SvCUR(sv) + 2);
7372 SvCUR_set(sv, SvCUR(sv) + 1);
7373 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7384 Auto-decrement of the value in the SV, doing string to numeric conversion
7385 if necessary. Handles 'get' magic.
7391 Perl_sv_dec(pTHX_ register SV *sv)
7399 if (SvTHINKFIRST(sv)) {
7401 sv_force_normal_flags(sv, 0);
7402 if (SvREADONLY(sv)) {
7403 if (IN_PERL_RUNTIME)
7404 Perl_croak(aTHX_ PL_no_modify);
7408 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7410 i = PTR2IV(SvRV(sv));
7415 /* Unlike sv_inc we don't have to worry about string-never-numbers
7416 and keeping them magic. But we mustn't warn on punting */
7417 flags = SvFLAGS(sv);
7418 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7419 /* It's publicly an integer, or privately an integer-not-float */
7420 #ifdef PERL_PRESERVE_IVUV
7424 if (SvUVX(sv) == 0) {
7425 (void)SvIOK_only(sv);
7429 (void)SvIOK_only_UV(sv);
7430 SvUV_set(sv, SvUVX(sv) + 1);
7433 if (SvIVX(sv) == IV_MIN)
7434 sv_setnv(sv, (NV)IV_MIN - 1.0);
7436 (void)SvIOK_only(sv);
7437 SvIV_set(sv, SvIVX(sv) - 1);
7442 if (flags & SVp_NOK) {
7443 SvNV_set(sv, SvNVX(sv) - 1.0);
7444 (void)SvNOK_only(sv);
7447 if (!(flags & SVp_POK)) {
7448 if ((flags & SVTYPEMASK) < SVt_PVNV)
7449 sv_upgrade(sv, SVt_NV);
7451 (void)SvNOK_only(sv);
7454 #ifdef PERL_PRESERVE_IVUV
7456 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7457 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7458 /* Need to try really hard to see if it's an integer.
7459 9.22337203685478e+18 is an integer.
7460 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7461 so $a="9.22337203685478e+18"; $a+0; $a--
7462 needs to be the same as $a="9.22337203685478e+18"; $a--
7469 /* sv_2iv *should* have made this an NV */
7470 if (flags & SVp_NOK) {
7471 (void)SvNOK_only(sv);
7472 SvNV_set(sv, SvNVX(sv) - 1.0);
7475 /* I don't think we can get here. Maybe I should assert this
7476 And if we do get here I suspect that sv_setnv will croak. NWC
7478 #if defined(USE_LONG_DOUBLE)
7479 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",
7480 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7482 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7483 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7487 #endif /* PERL_PRESERVE_IVUV */
7488 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7492 =for apidoc sv_mortalcopy
7494 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7495 The new SV is marked as mortal. It will be destroyed "soon", either by an
7496 explicit call to FREETMPS, or by an implicit call at places such as
7497 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7502 /* Make a string that will exist for the duration of the expression
7503 * evaluation. Actually, it may have to last longer than that, but
7504 * hopefully we won't free it until it has been assigned to a
7505 * permanent location. */
7508 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7513 sv_setsv(sv,oldstr);
7515 PL_tmps_stack[++PL_tmps_ix] = sv;
7521 =for apidoc sv_newmortal
7523 Creates a new null SV which is mortal. The reference count of the SV is
7524 set to 1. It will be destroyed "soon", either by an explicit call to
7525 FREETMPS, or by an implicit call at places such as statement boundaries.
7526 See also C<sv_mortalcopy> and C<sv_2mortal>.
7532 Perl_sv_newmortal(pTHX)
7537 SvFLAGS(sv) = SVs_TEMP;
7539 PL_tmps_stack[++PL_tmps_ix] = sv;
7544 =for apidoc sv_2mortal
7546 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7547 by an explicit call to FREETMPS, or by an implicit call at places such as
7548 statement boundaries. SvTEMP() is turned on which means that the SV's
7549 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7550 and C<sv_mortalcopy>.
7556 Perl_sv_2mortal(pTHX_ register SV *sv)
7560 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7563 PL_tmps_stack[++PL_tmps_ix] = sv;
7571 Creates a new SV and copies a string into it. The reference count for the
7572 SV is set to 1. If C<len> is zero, Perl will compute the length using
7573 strlen(). For efficiency, consider using C<newSVpvn> instead.
7579 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7586 sv_setpvn(sv,s,len);
7591 =for apidoc newSVpvn
7593 Creates a new SV and copies a string into it. The reference count for the
7594 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7595 string. You are responsible for ensuring that the source string is at least
7596 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7602 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7607 sv_setpvn(sv,s,len);
7612 =for apidoc newSVpvn_share
7614 Creates a new SV with its SvPVX pointing to a shared string in the string
7615 table. If the string does not already exist in the table, it is created
7616 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7617 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7618 otherwise the hash is computed. The idea here is that as the string table
7619 is used for shared hash keys these strings will have SvPVX == HeKEY and
7620 hash lookup will avoid string compare.
7626 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7629 bool is_utf8 = FALSE;
7631 STRLEN tmplen = -len;
7633 /* See the note in hv.c:hv_fetch() --jhi */
7634 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7638 PERL_HASH(hash, src, len);
7640 sv_upgrade(sv, SVt_PVIV);
7641 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7654 #if defined(PERL_IMPLICIT_CONTEXT)
7656 /* pTHX_ magic can't cope with varargs, so this is a no-context
7657 * version of the main function, (which may itself be aliased to us).
7658 * Don't access this version directly.
7662 Perl_newSVpvf_nocontext(const char* pat, ...)
7667 va_start(args, pat);
7668 sv = vnewSVpvf(pat, &args);
7675 =for apidoc newSVpvf
7677 Creates a new SV and initializes it with the string formatted like
7684 Perl_newSVpvf(pTHX_ const char* pat, ...)
7688 va_start(args, pat);
7689 sv = vnewSVpvf(pat, &args);
7694 /* backend for newSVpvf() and newSVpvf_nocontext() */
7697 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7701 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7708 Creates a new SV and copies a floating point value into it.
7709 The reference count for the SV is set to 1.
7715 Perl_newSVnv(pTHX_ NV n)
7727 Creates a new SV and copies an integer into it. The reference count for the
7734 Perl_newSViv(pTHX_ IV i)
7746 Creates a new SV and copies an unsigned integer into it.
7747 The reference count for the SV is set to 1.
7753 Perl_newSVuv(pTHX_ UV u)
7763 =for apidoc newRV_noinc
7765 Creates an RV wrapper for an SV. The reference count for the original
7766 SV is B<not> incremented.
7772 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7777 sv_upgrade(sv, SVt_RV);
7779 SvRV_set(sv, tmpRef);
7784 /* newRV_inc is the official function name to use now.
7785 * newRV_inc is in fact #defined to newRV in sv.h
7789 Perl_newRV(pTHX_ SV *tmpRef)
7791 return newRV_noinc(SvREFCNT_inc(tmpRef));
7797 Creates a new SV which is an exact duplicate of the original SV.
7804 Perl_newSVsv(pTHX_ register SV *old)
7810 if (SvTYPE(old) == SVTYPEMASK) {
7811 if (ckWARN_d(WARN_INTERNAL))
7812 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7816 /* SV_GMAGIC is the default for sv_setv()
7817 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7818 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7819 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7824 =for apidoc sv_reset
7826 Underlying implementation for the C<reset> Perl function.
7827 Note that the perl-level function is vaguely deprecated.
7833 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7841 char todo[PERL_UCHAR_MAX+1];
7846 if (!*s) { /* reset ?? searches */
7847 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7848 pm->op_pmdynflags &= ~PMdf_USED;
7853 /* reset variables */
7855 if (!HvARRAY(stash))
7858 Zero(todo, 256, char);
7860 i = (unsigned char)*s;
7864 max = (unsigned char)*s++;
7865 for ( ; i <= max; i++) {
7868 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7869 for (entry = HvARRAY(stash)[i];
7871 entry = HeNEXT(entry))
7873 if (!todo[(U8)*HeKEY(entry)])
7875 gv = (GV*)HeVAL(entry);
7877 if (SvTHINKFIRST(sv)) {
7878 if (!SvREADONLY(sv) && SvROK(sv))
7883 if (SvTYPE(sv) >= SVt_PV) {
7885 if (SvPVX(sv) != Nullch)
7892 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7895 #ifdef USE_ENVIRON_ARRAY
7897 # ifdef USE_ITHREADS
7898 && PL_curinterp == aTHX
7902 environ[0] = Nullch;
7905 #endif /* !PERL_MICRO */
7915 Using various gambits, try to get an IO from an SV: the IO slot if its a
7916 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7917 named after the PV if we're a string.
7923 Perl_sv_2io(pTHX_ SV *sv)
7928 switch (SvTYPE(sv)) {
7936 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7940 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7942 return sv_2io(SvRV(sv));
7943 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7949 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7958 Using various gambits, try to get a CV from an SV; in addition, try if
7959 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7965 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7971 return *gvp = Nullgv, Nullcv;
7972 switch (SvTYPE(sv)) {
7991 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7992 tryAMAGICunDEREF(to_cv);
7995 if (SvTYPE(sv) == SVt_PVCV) {
8004 Perl_croak(aTHX_ "Not a subroutine reference");
8009 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8015 if (lref && !GvCVu(gv)) {
8018 tmpsv = NEWSV(704,0);
8019 gv_efullname3(tmpsv, gv, Nullch);
8020 /* XXX this is probably not what they think they're getting.
8021 * It has the same effect as "sub name;", i.e. just a forward
8023 newSUB(start_subparse(FALSE, 0),
8024 newSVOP(OP_CONST, 0, tmpsv),
8029 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8039 Returns true if the SV has a true value by Perl's rules.
8040 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8041 instead use an in-line version.
8047 Perl_sv_true(pTHX_ register SV *sv)
8052 const register XPV* tXpv;
8053 if ((tXpv = (XPV*)SvANY(sv)) &&
8054 (tXpv->xpv_cur > 1 ||
8055 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
8062 return SvIVX(sv) != 0;
8065 return SvNVX(sv) != 0.0;
8067 return sv_2bool(sv);
8075 A private implementation of the C<SvIVx> macro for compilers which can't
8076 cope with complex macro expressions. Always use the macro instead.
8082 Perl_sv_iv(pTHX_ register SV *sv)
8086 return (IV)SvUVX(sv);
8095 A private implementation of the C<SvUVx> macro for compilers which can't
8096 cope with complex macro expressions. Always use the macro instead.
8102 Perl_sv_uv(pTHX_ register SV *sv)
8107 return (UV)SvIVX(sv);
8115 A private implementation of the C<SvNVx> macro for compilers which can't
8116 cope with complex macro expressions. Always use the macro instead.
8122 Perl_sv_nv(pTHX_ register SV *sv)
8129 /* sv_pv() is now a macro using SvPV_nolen();
8130 * this function provided for binary compatibility only
8134 Perl_sv_pv(pTHX_ SV *sv)
8141 return sv_2pv(sv, &n_a);
8147 Use the C<SvPV_nolen> macro instead
8151 A private implementation of the C<SvPV> macro for compilers which can't
8152 cope with complex macro expressions. Always use the macro instead.
8158 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8164 return sv_2pv(sv, lp);
8169 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8175 return sv_2pv_flags(sv, lp, 0);
8178 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8179 * this function provided for binary compatibility only
8183 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8185 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8189 =for apidoc sv_pvn_force
8191 Get a sensible string out of the SV somehow.
8192 A private implementation of the C<SvPV_force> macro for compilers which
8193 can't cope with complex macro expressions. Always use the macro instead.
8195 =for apidoc sv_pvn_force_flags
8197 Get a sensible string out of the SV somehow.
8198 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8199 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8200 implemented in terms of this function.
8201 You normally want to use the various wrapper macros instead: see
8202 C<SvPV_force> and C<SvPV_force_nomg>
8208 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8212 if (SvTHINKFIRST(sv) && !SvROK(sv))
8213 sv_force_normal_flags(sv, 0);
8219 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8220 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8224 s = sv_2pv_flags(sv, lp, flags);
8225 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8230 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8231 SvGROW(sv, len + 1);
8232 Move(s,SvPVX(sv),len,char);
8237 SvPOK_on(sv); /* validate pointer */
8239 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8240 PTR2UV(sv),SvPVX(sv)));
8246 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8247 * this function provided for binary compatibility only
8251 Perl_sv_pvbyte(pTHX_ SV *sv)
8253 sv_utf8_downgrade(sv,0);
8258 =for apidoc sv_pvbyte
8260 Use C<SvPVbyte_nolen> instead.
8262 =for apidoc sv_pvbyten
8264 A private implementation of the C<SvPVbyte> macro for compilers
8265 which can't cope with complex macro expressions. Always use the macro
8272 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8274 sv_utf8_downgrade(sv,0);
8275 return sv_pvn(sv,lp);
8279 =for apidoc sv_pvbyten_force
8281 A private implementation of the C<SvPVbytex_force> macro for compilers
8282 which can't cope with complex macro expressions. Always use the macro
8289 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8291 sv_pvn_force(sv,lp);
8292 sv_utf8_downgrade(sv,0);
8297 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8298 * this function provided for binary compatibility only
8302 Perl_sv_pvutf8(pTHX_ SV *sv)
8304 sv_utf8_upgrade(sv);
8309 =for apidoc sv_pvutf8
8311 Use the C<SvPVutf8_nolen> macro instead
8313 =for apidoc sv_pvutf8n
8315 A private implementation of the C<SvPVutf8> macro for compilers
8316 which can't cope with complex macro expressions. Always use the macro
8323 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8325 sv_utf8_upgrade(sv);
8326 return sv_pvn(sv,lp);
8330 =for apidoc sv_pvutf8n_force
8332 A private implementation of the C<SvPVutf8_force> macro for compilers
8333 which can't cope with complex macro expressions. Always use the macro
8340 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8342 sv_pvn_force(sv,lp);
8343 sv_utf8_upgrade(sv);
8349 =for apidoc sv_reftype
8351 Returns a string describing what the SV is a reference to.
8357 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8359 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8360 inside return suggests a const propagation bug in g++. */
8361 if (ob && SvOBJECT(sv)) {
8362 char *name = HvNAME(SvSTASH(sv));
8363 return name ? name : (char *) "__ANON__";
8366 switch (SvTYPE(sv)) {
8383 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8384 /* tied lvalues should appear to be
8385 * scalars for backwards compatitbility */
8386 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8387 ? "SCALAR" : "LVALUE");
8388 case SVt_PVAV: return "ARRAY";
8389 case SVt_PVHV: return "HASH";
8390 case SVt_PVCV: return "CODE";
8391 case SVt_PVGV: return "GLOB";
8392 case SVt_PVFM: return "FORMAT";
8393 case SVt_PVIO: return "IO";
8394 default: return "UNKNOWN";
8400 =for apidoc sv_isobject
8402 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8403 object. If the SV is not an RV, or if the object is not blessed, then this
8410 Perl_sv_isobject(pTHX_ SV *sv)
8427 Returns a boolean indicating whether the SV is blessed into the specified
8428 class. This does not check for subtypes; use C<sv_derived_from> to verify
8429 an inheritance relationship.
8435 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8446 if (!HvNAME(SvSTASH(sv)))
8449 return strEQ(HvNAME(SvSTASH(sv)), name);
8455 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8456 it will be upgraded to one. If C<classname> is non-null then the new SV will
8457 be blessed in the specified package. The new SV is returned and its
8458 reference count is 1.
8464 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8470 SV_CHECK_THINKFIRST_COW_DROP(rv);
8473 if (SvTYPE(rv) >= SVt_PVMG) {
8474 U32 refcnt = SvREFCNT(rv);
8478 SvREFCNT(rv) = refcnt;
8481 if (SvTYPE(rv) < SVt_RV)
8482 sv_upgrade(rv, SVt_RV);
8483 else if (SvTYPE(rv) > SVt_RV) {
8485 if (SvPVX(rv) && SvLEN(rv))
8486 Safefree(SvPVX(rv));
8496 HV* stash = gv_stashpv(classname, TRUE);
8497 (void)sv_bless(rv, stash);
8503 =for apidoc sv_setref_pv
8505 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8506 argument will be upgraded to an RV. That RV will be modified to point to
8507 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8508 into the SV. The C<classname> argument indicates the package for the
8509 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8510 will have a reference count of 1, and the RV will be returned.
8512 Do not use with other Perl types such as HV, AV, SV, CV, because those
8513 objects will become corrupted by the pointer copy process.
8515 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8521 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8524 sv_setsv(rv, &PL_sv_undef);
8528 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8533 =for apidoc sv_setref_iv
8535 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8536 argument will be upgraded to an RV. That RV will be modified to point to
8537 the new SV. The C<classname> argument indicates the package for the
8538 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8539 will have a reference count of 1, and the RV will be returned.
8545 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8547 sv_setiv(newSVrv(rv,classname), iv);
8552 =for apidoc sv_setref_uv
8554 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8555 argument will be upgraded to an RV. That RV will be modified to point to
8556 the new SV. The C<classname> argument indicates the package for the
8557 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8558 will have a reference count of 1, and the RV will be returned.
8564 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8566 sv_setuv(newSVrv(rv,classname), uv);
8571 =for apidoc sv_setref_nv
8573 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8574 argument will be upgraded to an RV. That RV will be modified to point to
8575 the new SV. The C<classname> argument indicates the package for the
8576 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8577 will have a reference count of 1, and the RV will be returned.
8583 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8585 sv_setnv(newSVrv(rv,classname), nv);
8590 =for apidoc sv_setref_pvn
8592 Copies a string into a new SV, optionally blessing the SV. The length of the
8593 string must be specified with C<n>. The C<rv> argument will be upgraded to
8594 an RV. That RV will be modified to point to the new SV. The C<classname>
8595 argument indicates the package for the blessing. Set C<classname> to
8596 C<Nullch> to avoid the blessing. The new SV will have a reference count
8597 of 1, and the RV will be returned.
8599 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8605 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8607 sv_setpvn(newSVrv(rv,classname), pv, n);
8612 =for apidoc sv_bless
8614 Blesses an SV into a specified package. The SV must be an RV. The package
8615 must be designated by its stash (see C<gv_stashpv()>). The reference count
8616 of the SV is unaffected.
8622 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8626 Perl_croak(aTHX_ "Can't bless non-reference value");
8628 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8629 if (SvREADONLY(tmpRef))
8630 Perl_croak(aTHX_ PL_no_modify);
8631 if (SvOBJECT(tmpRef)) {
8632 if (SvTYPE(tmpRef) != SVt_PVIO)
8634 SvREFCNT_dec(SvSTASH(tmpRef));
8637 SvOBJECT_on(tmpRef);
8638 if (SvTYPE(tmpRef) != SVt_PVIO)
8640 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8641 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8648 if(SvSMAGICAL(tmpRef))
8649 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8657 /* Downgrades a PVGV to a PVMG.
8661 S_sv_unglob(pTHX_ SV *sv)
8665 assert(SvTYPE(sv) == SVt_PVGV);
8670 SvREFCNT_dec(GvSTASH(sv));
8671 GvSTASH(sv) = Nullhv;
8673 sv_unmagic(sv, PERL_MAGIC_glob);
8674 Safefree(GvNAME(sv));
8677 /* need to keep SvANY(sv) in the right arena */
8678 xpvmg = new_XPVMG();
8679 StructCopy(SvANY(sv), xpvmg, XPVMG);
8680 del_XPVGV(SvANY(sv));
8683 SvFLAGS(sv) &= ~SVTYPEMASK;
8684 SvFLAGS(sv) |= SVt_PVMG;
8688 =for apidoc sv_unref_flags
8690 Unsets the RV status of the SV, and decrements the reference count of
8691 whatever was being referenced by the RV. This can almost be thought of
8692 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8693 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8694 (otherwise the decrementing is conditional on the reference count being
8695 different from one or the reference being a readonly SV).
8702 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8706 if (SvWEAKREF(sv)) {
8714 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8715 assigned to as BEGIN {$a = \"Foo"} will fail. */
8716 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8718 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8719 sv_2mortal(rv); /* Schedule for freeing later */
8723 =for apidoc sv_unref
8725 Unsets the RV status of the SV, and decrements the reference count of
8726 whatever was being referenced by the RV. This can almost be thought of
8727 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8728 being zero. See C<SvROK_off>.
8734 Perl_sv_unref(pTHX_ SV *sv)
8736 sv_unref_flags(sv, 0);
8740 =for apidoc sv_taint
8742 Taint an SV. Use C<SvTAINTED_on> instead.
8747 Perl_sv_taint(pTHX_ SV *sv)
8749 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8753 =for apidoc sv_untaint
8755 Untaint an SV. Use C<SvTAINTED_off> instead.
8760 Perl_sv_untaint(pTHX_ SV *sv)
8762 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8763 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8770 =for apidoc sv_tainted
8772 Test an SV for taintedness. Use C<SvTAINTED> instead.
8777 Perl_sv_tainted(pTHX_ SV *sv)
8779 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8780 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8781 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8788 =for apidoc sv_setpviv
8790 Copies an integer into the given SV, also updating its string value.
8791 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8797 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8799 char buf[TYPE_CHARS(UV)];
8801 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8803 sv_setpvn(sv, ptr, ebuf - ptr);
8807 =for apidoc sv_setpviv_mg
8809 Like C<sv_setpviv>, but also handles 'set' magic.
8815 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8817 char buf[TYPE_CHARS(UV)];
8819 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8821 sv_setpvn(sv, ptr, ebuf - ptr);
8825 #if defined(PERL_IMPLICIT_CONTEXT)
8827 /* pTHX_ magic can't cope with varargs, so this is a no-context
8828 * version of the main function, (which may itself be aliased to us).
8829 * Don't access this version directly.
8833 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8837 va_start(args, pat);
8838 sv_vsetpvf(sv, pat, &args);
8842 /* pTHX_ magic can't cope with varargs, so this is a no-context
8843 * version of the main function, (which may itself be aliased to us).
8844 * Don't access this version directly.
8848 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8852 va_start(args, pat);
8853 sv_vsetpvf_mg(sv, pat, &args);
8859 =for apidoc sv_setpvf
8861 Works like C<sv_catpvf> but copies the text into the SV instead of
8862 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8868 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8871 va_start(args, pat);
8872 sv_vsetpvf(sv, pat, &args);
8877 =for apidoc sv_vsetpvf
8879 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8880 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8882 Usually used via its frontend C<sv_setpvf>.
8888 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8890 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8894 =for apidoc sv_setpvf_mg
8896 Like C<sv_setpvf>, but also handles 'set' magic.
8902 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8905 va_start(args, pat);
8906 sv_vsetpvf_mg(sv, pat, &args);
8911 =for apidoc sv_vsetpvf_mg
8913 Like C<sv_vsetpvf>, but also handles 'set' magic.
8915 Usually used via its frontend C<sv_setpvf_mg>.
8921 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8923 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8927 #if defined(PERL_IMPLICIT_CONTEXT)
8929 /* pTHX_ magic can't cope with varargs, so this is a no-context
8930 * version of the main function, (which may itself be aliased to us).
8931 * Don't access this version directly.
8935 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8939 va_start(args, pat);
8940 sv_vcatpvf(sv, pat, &args);
8944 /* pTHX_ magic can't cope with varargs, so this is a no-context
8945 * version of the main function, (which may itself be aliased to us).
8946 * Don't access this version directly.
8950 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8954 va_start(args, pat);
8955 sv_vcatpvf_mg(sv, pat, &args);
8961 =for apidoc sv_catpvf
8963 Processes its arguments like C<sprintf> and appends the formatted
8964 output to an SV. If the appended data contains "wide" characters
8965 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8966 and characters >255 formatted with %c), the original SV might get
8967 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8968 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8969 valid UTF-8; if the original SV was bytes, the pattern should be too.
8974 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8977 va_start(args, pat);
8978 sv_vcatpvf(sv, pat, &args);
8983 =for apidoc sv_vcatpvf
8985 Processes its arguments like C<vsprintf> and appends the formatted output
8986 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8988 Usually used via its frontend C<sv_catpvf>.
8994 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8996 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9000 =for apidoc sv_catpvf_mg
9002 Like C<sv_catpvf>, but also handles 'set' magic.
9008 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9011 va_start(args, pat);
9012 sv_vcatpvf_mg(sv, pat, &args);
9017 =for apidoc sv_vcatpvf_mg
9019 Like C<sv_vcatpvf>, but also handles 'set' magic.
9021 Usually used via its frontend C<sv_catpvf_mg>.
9027 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9029 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9034 =for apidoc sv_vsetpvfn
9036 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9039 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9045 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9047 sv_setpvn(sv, "", 0);
9048 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9051 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9054 S_expect_number(pTHX_ char** pattern)
9057 switch (**pattern) {
9058 case '1': case '2': case '3':
9059 case '4': case '5': case '6':
9060 case '7': case '8': case '9':
9061 while (isDIGIT(**pattern))
9062 var = var * 10 + (*(*pattern)++ - '0');
9066 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9069 F0convert(NV nv, char *endbuf, STRLEN *len)
9080 if (uv & 1 && uv == nv)
9081 uv--; /* Round to even */
9083 unsigned dig = uv % 10;
9096 =for apidoc sv_vcatpvfn
9098 Processes its arguments like C<vsprintf> and appends the formatted output
9099 to an SV. Uses an array of SVs if the C style variable argument list is
9100 missing (NULL). When running with taint checks enabled, indicates via
9101 C<maybe_tainted> if results are untrustworthy (often due to the use of
9104 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9109 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9112 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9119 static char nullstr[] = "(null)";
9121 bool has_utf8; /* has the result utf8? */
9122 bool pat_utf8; /* the pattern is in utf8? */
9124 /* Times 4: a decimal digit takes more than 3 binary digits.
9125 * NV_DIG: mantissa takes than many decimal digits.
9126 * Plus 32: Playing safe. */
9127 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9128 /* large enough for "%#.#f" --chip */
9129 /* what about long double NVs? --jhi */
9131 has_utf8 = pat_utf8 = DO_UTF8(sv);
9133 /* no matter what, this is a string now */
9134 (void)SvPV_force(sv, origlen);
9136 /* special-case "", "%s", and "%_" */
9139 if (patlen == 2 && pat[0] == '%') {
9143 const char *s = va_arg(*args, char*);
9144 sv_catpv(sv, s ? s : nullstr);
9146 else if (svix < svmax) {
9147 sv_catsv(sv, *svargs);
9148 if (DO_UTF8(*svargs))
9154 argsv = va_arg(*args, SV*);
9155 sv_catsv(sv, argsv);
9160 /* See comment on '_' below */
9165 #ifndef USE_LONG_DOUBLE
9166 /* special-case "%.<number>[gf]" */
9167 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9168 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9169 unsigned digits = 0;
9173 while (*pp >= '0' && *pp <= '9')
9174 digits = 10 * digits + (*pp++ - '0');
9175 if (pp - pat == (int)patlen - 1) {
9179 nv = (NV)va_arg(*args, double);
9180 else if (svix < svmax)
9185 /* Add check for digits != 0 because it seems that some
9186 gconverts are buggy in this case, and we don't yet have
9187 a Configure test for this. */
9188 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9189 /* 0, point, slack */
9190 Gconvert(nv, (int)digits, 0, ebuf);
9192 if (*ebuf) /* May return an empty string for digits==0 */
9195 } else if (!digits) {
9198 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9199 sv_catpvn(sv, p, l);
9205 #endif /* !USE_LONG_DOUBLE */
9207 if (!args && svix < svmax && DO_UTF8(*svargs))
9210 patend = (char*)pat + patlen;
9211 for (p = (char*)pat; p < patend; p = q) {
9214 bool vectorize = FALSE;
9215 bool vectorarg = FALSE;
9216 bool vec_utf8 = FALSE;
9222 bool has_precis = FALSE;
9225 bool is_utf8 = FALSE; /* is this item utf8? */
9226 #ifdef HAS_LDBL_SPRINTF_BUG
9227 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9228 with sfio - Allen <allens@cpan.org> */
9229 bool fix_ldbl_sprintf_bug = FALSE;
9233 U8 utf8buf[UTF8_MAXBYTES+1];
9234 STRLEN esignlen = 0;
9236 char *eptr = Nullch;
9239 U8 *vecstr = Null(U8*);
9246 /* we need a long double target in case HAS_LONG_DOUBLE but
9249 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9257 const char *dotstr = ".";
9258 STRLEN dotstrlen = 1;
9259 I32 efix = 0; /* explicit format parameter index */
9260 I32 ewix = 0; /* explicit width index */
9261 I32 epix = 0; /* explicit precision index */
9262 I32 evix = 0; /* explicit vector index */
9263 bool asterisk = FALSE;
9265 /* echo everything up to the next format specification */
9266 for (q = p; q < patend && *q != '%'; ++q) ;
9268 if (has_utf8 && !pat_utf8)
9269 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9271 sv_catpvn(sv, p, q - p);
9278 We allow format specification elements in this order:
9279 \d+\$ explicit format parameter index
9281 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9282 0 flag (as above): repeated to allow "v02"
9283 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9284 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9286 [%bcdefginopsux_DFOUX] format (mandatory)
9288 if (EXPECT_NUMBER(q, width)) {
9329 if (EXPECT_NUMBER(q, ewix))
9338 if ((vectorarg = asterisk)) {
9350 EXPECT_NUMBER(q, width);
9355 vecsv = va_arg(*args, SV*);
9357 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9358 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9359 dotstr = SvPVx(vecsv, dotstrlen);
9364 vecsv = va_arg(*args, SV*);
9365 vecstr = (U8*)SvPVx(vecsv,veclen);
9366 vec_utf8 = DO_UTF8(vecsv);
9368 else if (efix ? efix <= svmax : svix < svmax) {
9369 vecsv = svargs[efix ? efix-1 : svix++];
9370 vecstr = (U8*)SvPVx(vecsv,veclen);
9371 vec_utf8 = DO_UTF8(vecsv);
9372 /* if this is a version object, we need to return the
9373 * stringified representation (which the SvPVX has
9374 * already done for us), but not vectorize the args
9376 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9378 q++; /* skip past the rest of the %vd format */
9379 eptr = (char *) vecstr;
9380 elen = strlen(eptr);
9393 i = va_arg(*args, int);
9395 i = (ewix ? ewix <= svmax : svix < svmax) ?
9396 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9398 width = (i < 0) ? -i : i;
9408 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9410 /* XXX: todo, support specified precision parameter */
9414 i = va_arg(*args, int);
9416 i = (ewix ? ewix <= svmax : svix < svmax)
9417 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9418 precis = (i < 0) ? 0 : i;
9423 precis = precis * 10 + (*q++ - '0');
9432 case 'I': /* Ix, I32x, and I64x */
9434 if (q[1] == '6' && q[2] == '4') {
9440 if (q[1] == '3' && q[2] == '2') {
9450 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9461 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9462 if (*(q + 1) == 'l') { /* lld, llf */
9487 argsv = (efix ? efix <= svmax : svix < svmax) ?
9488 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9495 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9497 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9499 eptr = (char*)utf8buf;
9500 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9511 if (args && !vectorize) {
9512 eptr = va_arg(*args, char*);
9514 #ifdef MACOS_TRADITIONAL
9515 /* On MacOS, %#s format is used for Pascal strings */
9520 elen = strlen(eptr);
9523 elen = sizeof nullstr - 1;
9527 eptr = SvPVx(argsv, elen);
9528 if (DO_UTF8(argsv)) {
9529 if (has_precis && precis < elen) {
9531 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9534 if (width) { /* fudge width (can't fudge elen) */
9535 width += elen - sv_len_utf8(argsv);
9547 * The "%_" hack might have to be changed someday,
9548 * if ISO or ANSI decide to use '_' for something.
9549 * So we keep it hidden from users' code.
9551 if (!args || vectorize)
9553 argsv = va_arg(*args, SV*);
9554 eptr = SvPVx(argsv, elen);
9560 if (has_precis && elen > precis)
9571 goto format_sv; /* %-p -> %_ */
9575 goto format_sv; /* %-Np -> %.N_ */
9578 if (alt || vectorize)
9580 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9598 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9607 esignbuf[esignlen++] = plus;
9611 case 'h': iv = (short)va_arg(*args, int); break;
9612 case 'l': iv = va_arg(*args, long); break;
9613 case 'V': iv = va_arg(*args, IV); break;
9614 default: iv = va_arg(*args, int); break;
9616 case 'q': iv = va_arg(*args, Quad_t); break;
9621 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9623 case 'h': iv = (short)tiv; break;
9624 case 'l': iv = (long)tiv; break;
9626 default: iv = tiv; break;
9628 case 'q': iv = (Quad_t)tiv; break;
9632 if ( !vectorize ) /* we already set uv above */
9637 esignbuf[esignlen++] = plus;
9641 esignbuf[esignlen++] = '-';
9684 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9695 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9696 case 'l': uv = va_arg(*args, unsigned long); break;
9697 case 'V': uv = va_arg(*args, UV); break;
9698 default: uv = va_arg(*args, unsigned); break;
9700 case 'q': uv = va_arg(*args, Uquad_t); break;
9705 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9707 case 'h': uv = (unsigned short)tuv; break;
9708 case 'l': uv = (unsigned long)tuv; break;
9710 default: uv = tuv; break;
9712 case 'q': uv = (Uquad_t)tuv; break;
9718 eptr = ebuf + sizeof ebuf;
9724 p = (char*)((c == 'X')
9725 ? "0123456789ABCDEF" : "0123456789abcdef");
9731 esignbuf[esignlen++] = '0';
9732 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9738 *--eptr = '0' + dig;
9740 if (alt && *eptr != '0')
9746 *--eptr = '0' + dig;
9749 esignbuf[esignlen++] = '0';
9750 esignbuf[esignlen++] = 'b';
9753 default: /* it had better be ten or less */
9756 *--eptr = '0' + dig;
9757 } while (uv /= base);
9760 elen = (ebuf + sizeof ebuf) - eptr;
9763 zeros = precis - elen;
9764 else if (precis == 0 && elen == 1 && *eptr == '0')
9769 /* FLOATING POINT */
9772 c = 'f'; /* maybe %F isn't supported here */
9778 /* This is evil, but floating point is even more evil */
9780 /* for SV-style calling, we can only get NV
9781 for C-style calling, we assume %f is double;
9782 for simplicity we allow any of %Lf, %llf, %qf for long double
9786 #if defined(USE_LONG_DOUBLE)
9790 /* [perl #20339] - we should accept and ignore %lf rather than die */
9794 #if defined(USE_LONG_DOUBLE)
9795 intsize = args ? 0 : 'q';
9799 #if defined(HAS_LONG_DOUBLE)
9808 /* now we need (long double) if intsize == 'q', else (double) */
9809 nv = (args && !vectorize) ?
9810 #if LONG_DOUBLESIZE > DOUBLESIZE
9812 va_arg(*args, long double) :
9813 va_arg(*args, double)
9815 va_arg(*args, double)
9821 if (c != 'e' && c != 'E') {
9823 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9824 will cast our (long double) to (double) */
9825 (void)Perl_frexp(nv, &i);
9826 if (i == PERL_INT_MIN)
9827 Perl_die(aTHX_ "panic: frexp");
9829 need = BIT_DIGITS(i);
9831 need += has_precis ? precis : 6; /* known default */
9836 #ifdef HAS_LDBL_SPRINTF_BUG
9837 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9838 with sfio - Allen <allens@cpan.org> */
9841 # define MY_DBL_MAX DBL_MAX
9842 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9843 # if DOUBLESIZE >= 8
9844 # define MY_DBL_MAX 1.7976931348623157E+308L
9846 # define MY_DBL_MAX 3.40282347E+38L
9850 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9851 # define MY_DBL_MAX_BUG 1L
9853 # define MY_DBL_MAX_BUG MY_DBL_MAX
9857 # define MY_DBL_MIN DBL_MIN
9858 # else /* XXX guessing! -Allen */
9859 # if DOUBLESIZE >= 8
9860 # define MY_DBL_MIN 2.2250738585072014E-308L
9862 # define MY_DBL_MIN 1.17549435E-38L
9866 if ((intsize == 'q') && (c == 'f') &&
9867 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9869 /* it's going to be short enough that
9870 * long double precision is not needed */
9872 if ((nv <= 0L) && (nv >= -0L))
9873 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9875 /* would use Perl_fp_class as a double-check but not
9876 * functional on IRIX - see perl.h comments */
9878 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9879 /* It's within the range that a double can represent */
9880 #if defined(DBL_MAX) && !defined(DBL_MIN)
9881 if ((nv >= ((long double)1/DBL_MAX)) ||
9882 (nv <= (-(long double)1/DBL_MAX)))
9884 fix_ldbl_sprintf_bug = TRUE;
9887 if (fix_ldbl_sprintf_bug == TRUE) {
9897 # undef MY_DBL_MAX_BUG
9900 #endif /* HAS_LDBL_SPRINTF_BUG */
9902 need += 20; /* fudge factor */
9903 if (PL_efloatsize < need) {
9904 Safefree(PL_efloatbuf);
9905 PL_efloatsize = need + 20; /* more fudge */
9906 New(906, PL_efloatbuf, PL_efloatsize, char);
9907 PL_efloatbuf[0] = '\0';
9910 if ( !(width || left || plus || alt) && fill != '0'
9911 && has_precis && intsize != 'q' ) { /* Shortcuts */
9912 /* See earlier comment about buggy Gconvert when digits,
9914 if ( c == 'g' && precis) {
9915 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9916 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9917 goto float_converted;
9918 } else if ( c == 'f' && !precis) {
9919 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9923 eptr = ebuf + sizeof ebuf;
9926 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9927 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9928 if (intsize == 'q') {
9929 /* Copy the one or more characters in a long double
9930 * format before the 'base' ([efgEFG]) character to
9931 * the format string. */
9932 static char const prifldbl[] = PERL_PRIfldbl;
9933 char const *p = prifldbl + sizeof(prifldbl) - 3;
9934 while (p >= prifldbl) { *--eptr = *p--; }
9939 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9944 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9956 /* No taint. Otherwise we are in the strange situation
9957 * where printf() taints but print($float) doesn't.
9959 #if defined(HAS_LONG_DOUBLE)
9961 (void)sprintf(PL_efloatbuf, eptr, nv);
9963 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9965 (void)sprintf(PL_efloatbuf, eptr, nv);
9968 eptr = PL_efloatbuf;
9969 elen = strlen(PL_efloatbuf);
9975 i = SvCUR(sv) - origlen;
9976 if (args && !vectorize) {
9978 case 'h': *(va_arg(*args, short*)) = i; break;
9979 default: *(va_arg(*args, int*)) = i; break;
9980 case 'l': *(va_arg(*args, long*)) = i; break;
9981 case 'V': *(va_arg(*args, IV*)) = i; break;
9983 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9988 sv_setuv_mg(argsv, (UV)i);
9990 continue; /* not "break" */
9996 if (!args && ckWARN(WARN_PRINTF) &&
9997 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9998 SV *msg = sv_newmortal();
9999 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
10000 (PL_op->op_type == OP_PRTF) ? "" : "s");
10003 Perl_sv_catpvf(aTHX_ msg,
10004 "\"%%%c\"", c & 0xFF);
10006 Perl_sv_catpvf(aTHX_ msg,
10007 "\"%%\\%03"UVof"\"",
10010 sv_catpv(msg, "end of string");
10011 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10014 /* output mangled stuff ... */
10020 /* ... right here, because formatting flags should not apply */
10021 SvGROW(sv, SvCUR(sv) + elen + 1);
10023 Copy(eptr, p, elen, char);
10026 SvCUR_set(sv, p - SvPVX(sv));
10028 continue; /* not "break" */
10031 /* calculate width before utf8_upgrade changes it */
10032 have = esignlen + zeros + elen;
10034 if (is_utf8 != has_utf8) {
10037 sv_utf8_upgrade(sv);
10040 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10041 sv_utf8_upgrade(nsv);
10045 SvGROW(sv, SvCUR(sv) + elen + 1);
10050 need = (have > width ? have : width);
10053 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10055 if (esignlen && fill == '0') {
10056 for (i = 0; i < (int)esignlen; i++)
10057 *p++ = esignbuf[i];
10059 if (gap && !left) {
10060 memset(p, fill, gap);
10063 if (esignlen && fill != '0') {
10064 for (i = 0; i < (int)esignlen; i++)
10065 *p++ = esignbuf[i];
10068 for (i = zeros; i; i--)
10072 Copy(eptr, p, elen, char);
10076 memset(p, ' ', gap);
10081 Copy(dotstr, p, dotstrlen, char);
10085 vectorize = FALSE; /* done iterating over vecstr */
10092 SvCUR_set(sv, p - SvPVX(sv));
10100 /* =========================================================================
10102 =head1 Cloning an interpreter
10104 All the macros and functions in this section are for the private use of
10105 the main function, perl_clone().
10107 The foo_dup() functions make an exact copy of an existing foo thinngy.
10108 During the course of a cloning, a hash table is used to map old addresses
10109 to new addresses. The table is created and manipulated with the
10110 ptr_table_* functions.
10114 ============================================================================*/
10117 #if defined(USE_ITHREADS)
10119 #ifndef GpREFCNT_inc
10120 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10124 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10125 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10126 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10127 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10128 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10129 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10130 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10131 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10132 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10133 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10134 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10135 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10136 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10139 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10140 regcomp.c. AMS 20010712 */
10143 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10147 struct reg_substr_datum *s;
10150 return (REGEXP *)NULL;
10152 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10155 len = r->offsets[0];
10156 npar = r->nparens+1;
10158 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10159 Copy(r->program, ret->program, len+1, regnode);
10161 New(0, ret->startp, npar, I32);
10162 Copy(r->startp, ret->startp, npar, I32);
10163 New(0, ret->endp, npar, I32);
10164 Copy(r->startp, ret->startp, npar, I32);
10166 New(0, ret->substrs, 1, struct reg_substr_data);
10167 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10168 s->min_offset = r->substrs->data[i].min_offset;
10169 s->max_offset = r->substrs->data[i].max_offset;
10170 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10171 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10174 ret->regstclass = NULL;
10176 struct reg_data *d;
10177 const int count = r->data->count;
10179 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10180 char, struct reg_data);
10181 New(0, d->what, count, U8);
10184 for (i = 0; i < count; i++) {
10185 d->what[i] = r->data->what[i];
10186 switch (d->what[i]) {
10187 /* legal options are one of: sfpont
10188 see also regcomp.h and pregfree() */
10190 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10193 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10196 /* This is cheating. */
10197 New(0, d->data[i], 1, struct regnode_charclass_class);
10198 StructCopy(r->data->data[i], d->data[i],
10199 struct regnode_charclass_class);
10200 ret->regstclass = (regnode*)d->data[i];
10203 /* Compiled op trees are readonly, and can thus be
10204 shared without duplication. */
10206 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10210 d->data[i] = r->data->data[i];
10213 d->data[i] = r->data->data[i];
10215 ((reg_trie_data*)d->data[i])->refcount++;
10219 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10228 New(0, ret->offsets, 2*len+1, U32);
10229 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10231 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10232 ret->refcnt = r->refcnt;
10233 ret->minlen = r->minlen;
10234 ret->prelen = r->prelen;
10235 ret->nparens = r->nparens;
10236 ret->lastparen = r->lastparen;
10237 ret->lastcloseparen = r->lastcloseparen;
10238 ret->reganch = r->reganch;
10240 ret->sublen = r->sublen;
10242 if (RX_MATCH_COPIED(ret))
10243 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10245 ret->subbeg = Nullch;
10246 #ifdef PERL_COPY_ON_WRITE
10247 ret->saved_copy = Nullsv;
10250 ptr_table_store(PL_ptr_table, r, ret);
10254 /* duplicate a file handle */
10257 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10263 return (PerlIO*)NULL;
10265 /* look for it in the table first */
10266 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10270 /* create anew and remember what it is */
10271 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10272 ptr_table_store(PL_ptr_table, fp, ret);
10276 /* duplicate a directory handle */
10279 Perl_dirp_dup(pTHX_ DIR *dp)
10287 /* duplicate a typeglob */
10290 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10295 /* look for it in the table first */
10296 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10300 /* create anew and remember what it is */
10301 Newz(0, ret, 1, GP);
10302 ptr_table_store(PL_ptr_table, gp, ret);
10305 ret->gp_refcnt = 0; /* must be before any other dups! */
10306 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10307 ret->gp_io = io_dup_inc(gp->gp_io, param);
10308 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10309 ret->gp_av = av_dup_inc(gp->gp_av, param);
10310 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10311 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10312 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10313 ret->gp_cvgen = gp->gp_cvgen;
10314 ret->gp_flags = gp->gp_flags;
10315 ret->gp_line = gp->gp_line;
10316 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10320 /* duplicate a chain of magic */
10323 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10325 MAGIC *mgprev = (MAGIC*)NULL;
10328 return (MAGIC*)NULL;
10329 /* look for it in the table first */
10330 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10334 for (; mg; mg = mg->mg_moremagic) {
10336 Newz(0, nmg, 1, MAGIC);
10338 mgprev->mg_moremagic = nmg;
10341 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10342 nmg->mg_private = mg->mg_private;
10343 nmg->mg_type = mg->mg_type;
10344 nmg->mg_flags = mg->mg_flags;
10345 if (mg->mg_type == PERL_MAGIC_qr) {
10346 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10348 else if(mg->mg_type == PERL_MAGIC_backref) {
10349 const AV * const av = (AV*) mg->mg_obj;
10352 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10354 for (i = AvFILLp(av); i >= 0; i--) {
10355 if (!svp[i]) continue;
10356 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10360 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10361 ? sv_dup_inc(mg->mg_obj, param)
10362 : sv_dup(mg->mg_obj, param);
10364 nmg->mg_len = mg->mg_len;
10365 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10366 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10367 if (mg->mg_len > 0) {
10368 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10369 if (mg->mg_type == PERL_MAGIC_overload_table &&
10370 AMT_AMAGIC((AMT*)mg->mg_ptr))
10372 AMT *amtp = (AMT*)mg->mg_ptr;
10373 AMT *namtp = (AMT*)nmg->mg_ptr;
10375 for (i = 1; i < NofAMmeth; i++) {
10376 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10380 else if (mg->mg_len == HEf_SVKEY)
10381 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10383 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10384 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10391 /* create a new pointer-mapping table */
10394 Perl_ptr_table_new(pTHX)
10397 Newz(0, tbl, 1, PTR_TBL_t);
10398 tbl->tbl_max = 511;
10399 tbl->tbl_items = 0;
10400 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10405 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10407 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10410 /* map an existing pointer using a table */
10413 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10415 PTR_TBL_ENT_t *tblent;
10416 UV hash = PTR_TABLE_HASH(sv);
10418 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10419 for (; tblent; tblent = tblent->next) {
10420 if (tblent->oldval == sv)
10421 return tblent->newval;
10423 return (void*)NULL;
10426 /* add a new entry to a pointer-mapping table */
10429 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10431 PTR_TBL_ENT_t *tblent, **otblent;
10432 /* XXX this may be pessimal on platforms where pointers aren't good
10433 * hash values e.g. if they grow faster in the most significant
10435 UV hash = PTR_TABLE_HASH(oldv);
10439 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10440 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10441 if (tblent->oldval == oldv) {
10442 tblent->newval = newv;
10446 Newz(0, tblent, 1, PTR_TBL_ENT_t);
10447 tblent->oldval = oldv;
10448 tblent->newval = newv;
10449 tblent->next = *otblent;
10452 if (!empty && tbl->tbl_items > tbl->tbl_max)
10453 ptr_table_split(tbl);
10456 /* double the hash bucket size of an existing ptr table */
10459 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10461 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10462 UV oldsize = tbl->tbl_max + 1;
10463 UV newsize = oldsize * 2;
10466 Renew(ary, newsize, PTR_TBL_ENT_t*);
10467 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10468 tbl->tbl_max = --newsize;
10469 tbl->tbl_ary = ary;
10470 for (i=0; i < oldsize; i++, ary++) {
10471 PTR_TBL_ENT_t **curentp, **entp, *ent;
10474 curentp = ary + oldsize;
10475 for (entp = ary, ent = *ary; ent; ent = *entp) {
10476 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10478 ent->next = *curentp;
10488 /* remove all the entries from a ptr table */
10491 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10493 register PTR_TBL_ENT_t **array;
10494 register PTR_TBL_ENT_t *entry;
10495 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
10499 if (!tbl || !tbl->tbl_items) {
10503 array = tbl->tbl_ary;
10505 max = tbl->tbl_max;
10510 entry = entry->next;
10514 if (++riter > max) {
10517 entry = array[riter];
10521 tbl->tbl_items = 0;
10524 /* clear and free a ptr table */
10527 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10532 ptr_table_clear(tbl);
10533 Safefree(tbl->tbl_ary);
10538 char *PL_watch_pvx;
10541 /* attempt to make everything in the typeglob readonly */
10544 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10546 GV *gv = (GV*)sstr;
10547 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10549 if (GvIO(gv) || GvFORM(gv)) {
10550 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10552 else if (!GvCV(gv)) {
10553 GvCV(gv) = (CV*)sv;
10556 /* CvPADLISTs cannot be shared */
10557 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10562 if (!GvUNIQUE(gv)) {
10564 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10565 HvNAME(GvSTASH(gv)), GvNAME(gv));
10571 * write attempts will die with
10572 * "Modification of a read-only value attempted"
10578 SvREADONLY_on(GvSV(gv));
10582 GvAV(gv) = (AV*)sv;
10585 SvREADONLY_on(GvAV(gv));
10589 GvHV(gv) = (HV*)sv;
10592 SvREADONLY_on(GvHV(gv));
10595 return sstr; /* he_dup() will SvREFCNT_inc() */
10598 /* duplicate an SV of any type (including AV, HV etc) */
10601 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10604 SvRV_set(dstr, SvWEAKREF(sstr)
10605 ? sv_dup(SvRV(sstr), param)
10606 : sv_dup_inc(SvRV(sstr), param));
10609 else if (SvPVX(sstr)) {
10610 /* Has something there */
10612 /* Normal PV - clone whole allocated space */
10613 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10614 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10615 /* Not that normal - actually sstr is copy on write.
10616 But we are a true, independant SV, so: */
10617 SvREADONLY_off(dstr);
10622 /* Special case - not normally malloced for some reason */
10623 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10624 /* A "shared" PV - clone it as unshared string */
10625 if(SvPADTMP(sstr)) {
10626 /* However, some of them live in the pad
10627 and they should not have these flags
10630 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10632 SvUV_set(dstr, SvUVX(sstr));
10635 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10637 SvREADONLY_off(dstr);
10641 /* Some other special case - random pointer */
10642 SvPV_set(dstr, SvPVX(sstr));
10647 /* Copy the Null */
10648 if (SvTYPE(dstr) == SVt_RV)
10649 SvRV_set(dstr, NULL);
10656 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10660 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10662 /* look for it in the table first */
10663 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10667 if(param->flags & CLONEf_JOIN_IN) {
10668 /** We are joining here so we don't want do clone
10669 something that is bad **/
10671 if(SvTYPE(sstr) == SVt_PVHV &&
10673 /** don't clone stashes if they already exist **/
10674 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10675 return (SV*) old_stash;
10679 /* create anew and remember what it is */
10682 #ifdef DEBUG_LEAKING_SCALARS
10683 dstr->sv_debug_optype = sstr->sv_debug_optype;
10684 dstr->sv_debug_line = sstr->sv_debug_line;
10685 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10686 dstr->sv_debug_cloned = 1;
10688 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10690 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10694 ptr_table_store(PL_ptr_table, sstr, dstr);
10697 SvFLAGS(dstr) = SvFLAGS(sstr);
10698 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10699 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10702 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10703 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10704 PL_watch_pvx, SvPVX(sstr));
10707 /* don't clone objects whose class has asked us not to */
10708 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10709 SvFLAGS(dstr) &= ~SVTYPEMASK;
10710 SvOBJECT_off(dstr);
10714 switch (SvTYPE(sstr)) {
10716 SvANY(dstr) = NULL;
10719 SvANY(dstr) = new_XIV();
10720 SvIV_set(dstr, SvIVX(sstr));
10723 SvANY(dstr) = new_XNV();
10724 SvNV_set(dstr, SvNVX(sstr));
10727 SvANY(dstr) = new_XRV();
10728 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10731 SvANY(dstr) = new_XPV();
10732 SvCUR_set(dstr, SvCUR(sstr));
10733 SvLEN_set(dstr, SvLEN(sstr));
10734 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10737 SvANY(dstr) = new_XPVIV();
10738 SvCUR_set(dstr, SvCUR(sstr));
10739 SvLEN_set(dstr, SvLEN(sstr));
10740 SvIV_set(dstr, SvIVX(sstr));
10741 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10744 SvANY(dstr) = new_XPVNV();
10745 SvCUR_set(dstr, SvCUR(sstr));
10746 SvLEN_set(dstr, SvLEN(sstr));
10747 SvIV_set(dstr, SvIVX(sstr));
10748 SvNV_set(dstr, SvNVX(sstr));
10749 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10752 SvANY(dstr) = new_XPVMG();
10753 SvCUR_set(dstr, SvCUR(sstr));
10754 SvLEN_set(dstr, SvLEN(sstr));
10755 SvIV_set(dstr, SvIVX(sstr));
10756 SvNV_set(dstr, SvNVX(sstr));
10757 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10758 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10759 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10762 SvANY(dstr) = new_XPVBM();
10763 SvCUR_set(dstr, SvCUR(sstr));
10764 SvLEN_set(dstr, SvLEN(sstr));
10765 SvIV_set(dstr, SvIVX(sstr));
10766 SvNV_set(dstr, SvNVX(sstr));
10767 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10768 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10769 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10770 BmRARE(dstr) = BmRARE(sstr);
10771 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10772 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10775 SvANY(dstr) = new_XPVLV();
10776 SvCUR_set(dstr, SvCUR(sstr));
10777 SvLEN_set(dstr, SvLEN(sstr));
10778 SvIV_set(dstr, SvIVX(sstr));
10779 SvNV_set(dstr, SvNVX(sstr));
10780 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10781 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10782 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10783 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10784 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10785 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10786 LvTARG(dstr) = dstr;
10787 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10788 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10790 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10791 LvTYPE(dstr) = LvTYPE(sstr);
10794 if (GvUNIQUE((GV*)sstr)) {
10796 if ((share = gv_share(sstr, param))) {
10799 ptr_table_store(PL_ptr_table, sstr, dstr);
10801 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10802 HvNAME(GvSTASH(share)), GvNAME(share));
10807 SvANY(dstr) = new_XPVGV();
10808 SvCUR_set(dstr, SvCUR(sstr));
10809 SvLEN_set(dstr, SvLEN(sstr));
10810 SvIV_set(dstr, SvIVX(sstr));
10811 SvNV_set(dstr, SvNVX(sstr));
10812 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10813 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10814 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10815 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10816 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10817 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10818 GvFLAGS(dstr) = GvFLAGS(sstr);
10819 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10820 (void)GpREFCNT_inc(GvGP(dstr));
10823 SvANY(dstr) = new_XPVIO();
10824 SvCUR_set(dstr, SvCUR(sstr));
10825 SvLEN_set(dstr, SvLEN(sstr));
10826 SvIV_set(dstr, SvIVX(sstr));
10827 SvNV_set(dstr, SvNVX(sstr));
10828 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10829 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10830 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10831 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10832 if (IoOFP(sstr) == IoIFP(sstr))
10833 IoOFP(dstr) = IoIFP(dstr);
10835 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10836 /* PL_rsfp_filters entries have fake IoDIRP() */
10837 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10838 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10840 IoDIRP(dstr) = IoDIRP(sstr);
10841 IoLINES(dstr) = IoLINES(sstr);
10842 IoPAGE(dstr) = IoPAGE(sstr);
10843 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10844 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10845 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10846 /* I have no idea why fake dirp (rsfps)
10847 should be treaded differently but otherwise
10848 we end up with leaks -- sky*/
10849 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10850 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10851 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10853 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10854 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10855 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10857 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10858 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10859 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10860 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10861 IoTYPE(dstr) = IoTYPE(sstr);
10862 IoFLAGS(dstr) = IoFLAGS(sstr);
10865 SvANY(dstr) = new_XPVAV();
10866 SvCUR_set(dstr, SvCUR(sstr));
10867 SvLEN_set(dstr, SvLEN(sstr));
10868 SvIV_set(dstr, SvIVX(sstr));
10869 SvNV_set(dstr, SvNVX(sstr));
10870 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10871 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10872 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10873 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10874 if (AvARRAY((AV*)sstr)) {
10875 SV **dst_ary, **src_ary;
10876 SSize_t items = AvFILLp((AV*)sstr) + 1;
10878 src_ary = AvARRAY((AV*)sstr);
10879 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10880 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10881 SvPV_set(dstr, (char*)dst_ary);
10882 AvALLOC((AV*)dstr) = dst_ary;
10883 if (AvREAL((AV*)sstr)) {
10884 while (items-- > 0)
10885 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10888 while (items-- > 0)
10889 *dst_ary++ = sv_dup(*src_ary++, param);
10891 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10892 while (items-- > 0) {
10893 *dst_ary++ = &PL_sv_undef;
10897 SvPV_set(dstr, Nullch);
10898 AvALLOC((AV*)dstr) = (SV**)NULL;
10902 SvANY(dstr) = new_XPVHV();
10903 SvCUR_set(dstr, SvCUR(sstr));
10904 SvLEN_set(dstr, SvLEN(sstr));
10905 SvIV_set(dstr, SvIVX(sstr));
10906 SvNV_set(dstr, SvNVX(sstr));
10907 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10908 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10909 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10910 if (HvARRAY((HV*)sstr)) {
10912 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10913 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10914 Newz(0, dxhv->xhv_array,
10915 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10916 while (i <= sxhv->xhv_max) {
10917 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10918 (bool)!!HvSHAREKEYS(sstr),
10922 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10923 (bool)!!HvSHAREKEYS(sstr), param);
10926 SvPV_set(dstr, Nullch);
10927 HvEITER((HV*)dstr) = (HE*)NULL;
10929 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10930 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10931 /* Record stashes for possible cloning in Perl_clone(). */
10932 if(HvNAME((HV*)dstr))
10933 av_push(param->stashes, dstr);
10936 SvANY(dstr) = new_XPVFM();
10937 FmLINES(dstr) = FmLINES(sstr);
10941 SvANY(dstr) = new_XPVCV();
10943 SvCUR_set(dstr, SvCUR(sstr));
10944 SvLEN_set(dstr, SvLEN(sstr));
10945 SvIV_set(dstr, SvIVX(sstr));
10946 SvNV_set(dstr, SvNVX(sstr));
10947 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10948 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10949 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10950 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10951 CvSTART(dstr) = CvSTART(sstr);
10953 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10955 CvXSUB(dstr) = CvXSUB(sstr);
10956 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10957 if (CvCONST(sstr)) {
10958 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10959 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10960 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
10962 /* don't dup if copying back - CvGV isn't refcounted, so the
10963 * duped GV may never be freed. A bit of a hack! DAPM */
10964 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10965 Nullgv : gv_dup(CvGV(sstr), param) ;
10966 if (param->flags & CLONEf_COPY_STACKS) {
10967 CvDEPTH(dstr) = CvDEPTH(sstr);
10971 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10972 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10974 CvWEAKOUTSIDE(sstr)
10975 ? cv_dup( CvOUTSIDE(sstr), param)
10976 : cv_dup_inc(CvOUTSIDE(sstr), param);
10977 CvFLAGS(dstr) = CvFLAGS(sstr);
10978 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10981 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10985 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10991 /* duplicate a context */
10994 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10996 PERL_CONTEXT *ncxs;
10999 return (PERL_CONTEXT*)NULL;
11001 /* look for it in the table first */
11002 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11006 /* create anew and remember what it is */
11007 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11008 ptr_table_store(PL_ptr_table, cxs, ncxs);
11011 PERL_CONTEXT *cx = &cxs[ix];
11012 PERL_CONTEXT *ncx = &ncxs[ix];
11013 ncx->cx_type = cx->cx_type;
11014 if (CxTYPE(cx) == CXt_SUBST) {
11015 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11018 ncx->blk_oldsp = cx->blk_oldsp;
11019 ncx->blk_oldcop = cx->blk_oldcop;
11020 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11021 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11022 ncx->blk_oldpm = cx->blk_oldpm;
11023 ncx->blk_gimme = cx->blk_gimme;
11024 switch (CxTYPE(cx)) {
11026 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11027 ? cv_dup_inc(cx->blk_sub.cv, param)
11028 : cv_dup(cx->blk_sub.cv,param));
11029 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11030 ? av_dup_inc(cx->blk_sub.argarray, param)
11032 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11033 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11034 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11035 ncx->blk_sub.lval = cx->blk_sub.lval;
11036 ncx->blk_sub.retop = cx->blk_sub.retop;
11039 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11040 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11041 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11042 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11043 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11044 ncx->blk_eval.retop = cx->blk_eval.retop;
11047 ncx->blk_loop.label = cx->blk_loop.label;
11048 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11049 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11050 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11051 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11052 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11053 ? cx->blk_loop.iterdata
11054 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11055 ncx->blk_loop.oldcomppad
11056 = (PAD*)ptr_table_fetch(PL_ptr_table,
11057 cx->blk_loop.oldcomppad);
11058 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11059 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11060 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11061 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11062 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11065 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11066 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11067 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11068 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11069 ncx->blk_sub.retop = cx->blk_sub.retop;
11081 /* duplicate a stack info structure */
11084 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11089 return (PERL_SI*)NULL;
11091 /* look for it in the table first */
11092 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11096 /* create anew and remember what it is */
11097 Newz(56, nsi, 1, PERL_SI);
11098 ptr_table_store(PL_ptr_table, si, nsi);
11100 nsi->si_stack = av_dup_inc(si->si_stack, param);
11101 nsi->si_cxix = si->si_cxix;
11102 nsi->si_cxmax = si->si_cxmax;
11103 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11104 nsi->si_type = si->si_type;
11105 nsi->si_prev = si_dup(si->si_prev, param);
11106 nsi->si_next = si_dup(si->si_next, param);
11107 nsi->si_markoff = si->si_markoff;
11112 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11113 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11114 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11115 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11116 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11117 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11118 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11119 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11120 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11121 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11122 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11123 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11124 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11125 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11128 #define pv_dup_inc(p) SAVEPV(p)
11129 #define pv_dup(p) SAVEPV(p)
11130 #define svp_dup_inc(p,pp) any_dup(p,pp)
11132 /* map any object to the new equivent - either something in the
11133 * ptr table, or something in the interpreter structure
11137 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11142 return (void*)NULL;
11144 /* look for it in the table first */
11145 ret = ptr_table_fetch(PL_ptr_table, v);
11149 /* see if it is part of the interpreter structure */
11150 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11151 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11159 /* duplicate the save stack */
11162 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11164 ANY *ss = proto_perl->Tsavestack;
11165 I32 ix = proto_perl->Tsavestack_ix;
11166 I32 max = proto_perl->Tsavestack_max;
11179 void (*dptr) (void*);
11180 void (*dxptr) (pTHX_ void*);
11183 Newz(54, nss, max, ANY);
11187 TOPINT(nss,ix) = i;
11189 case SAVEt_ITEM: /* normal string */
11190 sv = (SV*)POPPTR(ss,ix);
11191 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11192 sv = (SV*)POPPTR(ss,ix);
11193 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11195 case SAVEt_SV: /* scalar reference */
11196 sv = (SV*)POPPTR(ss,ix);
11197 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11198 gv = (GV*)POPPTR(ss,ix);
11199 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11201 case SAVEt_GENERIC_PVREF: /* generic char* */
11202 c = (char*)POPPTR(ss,ix);
11203 TOPPTR(nss,ix) = pv_dup(c);
11204 ptr = POPPTR(ss,ix);
11205 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11207 case SAVEt_SHARED_PVREF: /* char* in shared space */
11208 c = (char*)POPPTR(ss,ix);
11209 TOPPTR(nss,ix) = savesharedpv(c);
11210 ptr = POPPTR(ss,ix);
11211 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11213 case SAVEt_GENERIC_SVREF: /* generic sv */
11214 case SAVEt_SVREF: /* scalar reference */
11215 sv = (SV*)POPPTR(ss,ix);
11216 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11217 ptr = POPPTR(ss,ix);
11218 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11220 case SAVEt_AV: /* array reference */
11221 av = (AV*)POPPTR(ss,ix);
11222 TOPPTR(nss,ix) = av_dup_inc(av, param);
11223 gv = (GV*)POPPTR(ss,ix);
11224 TOPPTR(nss,ix) = gv_dup(gv, param);
11226 case SAVEt_HV: /* hash reference */
11227 hv = (HV*)POPPTR(ss,ix);
11228 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11229 gv = (GV*)POPPTR(ss,ix);
11230 TOPPTR(nss,ix) = gv_dup(gv, param);
11232 case SAVEt_INT: /* int reference */
11233 ptr = POPPTR(ss,ix);
11234 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11235 intval = (int)POPINT(ss,ix);
11236 TOPINT(nss,ix) = intval;
11238 case SAVEt_LONG: /* long reference */
11239 ptr = POPPTR(ss,ix);
11240 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11241 longval = (long)POPLONG(ss,ix);
11242 TOPLONG(nss,ix) = longval;
11244 case SAVEt_I32: /* I32 reference */
11245 case SAVEt_I16: /* I16 reference */
11246 case SAVEt_I8: /* I8 reference */
11247 ptr = POPPTR(ss,ix);
11248 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11250 TOPINT(nss,ix) = i;
11252 case SAVEt_IV: /* IV reference */
11253 ptr = POPPTR(ss,ix);
11254 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11256 TOPIV(nss,ix) = iv;
11258 case SAVEt_SPTR: /* SV* reference */
11259 ptr = POPPTR(ss,ix);
11260 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11261 sv = (SV*)POPPTR(ss,ix);
11262 TOPPTR(nss,ix) = sv_dup(sv, param);
11264 case SAVEt_VPTR: /* random* reference */
11265 ptr = POPPTR(ss,ix);
11266 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11267 ptr = POPPTR(ss,ix);
11268 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11270 case SAVEt_PPTR: /* char* reference */
11271 ptr = POPPTR(ss,ix);
11272 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11273 c = (char*)POPPTR(ss,ix);
11274 TOPPTR(nss,ix) = pv_dup(c);
11276 case SAVEt_HPTR: /* HV* reference */
11277 ptr = POPPTR(ss,ix);
11278 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11279 hv = (HV*)POPPTR(ss,ix);
11280 TOPPTR(nss,ix) = hv_dup(hv, param);
11282 case SAVEt_APTR: /* AV* reference */
11283 ptr = POPPTR(ss,ix);
11284 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11285 av = (AV*)POPPTR(ss,ix);
11286 TOPPTR(nss,ix) = av_dup(av, param);
11289 gv = (GV*)POPPTR(ss,ix);
11290 TOPPTR(nss,ix) = gv_dup(gv, param);
11292 case SAVEt_GP: /* scalar reference */
11293 gp = (GP*)POPPTR(ss,ix);
11294 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11295 (void)GpREFCNT_inc(gp);
11296 gv = (GV*)POPPTR(ss,ix);
11297 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11298 c = (char*)POPPTR(ss,ix);
11299 TOPPTR(nss,ix) = pv_dup(c);
11301 TOPIV(nss,ix) = iv;
11303 TOPIV(nss,ix) = iv;
11306 case SAVEt_MORTALIZESV:
11307 sv = (SV*)POPPTR(ss,ix);
11308 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11311 ptr = POPPTR(ss,ix);
11312 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11313 /* these are assumed to be refcounted properly */
11314 switch (((OP*)ptr)->op_type) {
11316 case OP_LEAVESUBLV:
11320 case OP_LEAVEWRITE:
11321 TOPPTR(nss,ix) = ptr;
11326 TOPPTR(nss,ix) = Nullop;
11331 TOPPTR(nss,ix) = Nullop;
11334 c = (char*)POPPTR(ss,ix);
11335 TOPPTR(nss,ix) = pv_dup_inc(c);
11337 case SAVEt_CLEARSV:
11338 longval = POPLONG(ss,ix);
11339 TOPLONG(nss,ix) = longval;
11342 hv = (HV*)POPPTR(ss,ix);
11343 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11344 c = (char*)POPPTR(ss,ix);
11345 TOPPTR(nss,ix) = pv_dup_inc(c);
11347 TOPINT(nss,ix) = i;
11349 case SAVEt_DESTRUCTOR:
11350 ptr = POPPTR(ss,ix);
11351 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11352 dptr = POPDPTR(ss,ix);
11353 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11355 case SAVEt_DESTRUCTOR_X:
11356 ptr = POPPTR(ss,ix);
11357 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11358 dxptr = POPDXPTR(ss,ix);
11359 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11361 case SAVEt_REGCONTEXT:
11364 TOPINT(nss,ix) = i;
11367 case SAVEt_STACK_POS: /* Position on Perl stack */
11369 TOPINT(nss,ix) = i;
11371 case SAVEt_AELEM: /* array element */
11372 sv = (SV*)POPPTR(ss,ix);
11373 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11375 TOPINT(nss,ix) = i;
11376 av = (AV*)POPPTR(ss,ix);
11377 TOPPTR(nss,ix) = av_dup_inc(av, param);
11379 case SAVEt_HELEM: /* hash element */
11380 sv = (SV*)POPPTR(ss,ix);
11381 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11382 sv = (SV*)POPPTR(ss,ix);
11383 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11384 hv = (HV*)POPPTR(ss,ix);
11385 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11388 ptr = POPPTR(ss,ix);
11389 TOPPTR(nss,ix) = ptr;
11393 TOPINT(nss,ix) = i;
11395 case SAVEt_COMPPAD:
11396 av = (AV*)POPPTR(ss,ix);
11397 TOPPTR(nss,ix) = av_dup(av, param);
11400 longval = (long)POPLONG(ss,ix);
11401 TOPLONG(nss,ix) = longval;
11402 ptr = POPPTR(ss,ix);
11403 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11404 sv = (SV*)POPPTR(ss,ix);
11405 TOPPTR(nss,ix) = sv_dup(sv, param);
11408 ptr = POPPTR(ss,ix);
11409 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11410 longval = (long)POPBOOL(ss,ix);
11411 TOPBOOL(nss,ix) = (bool)longval;
11413 case SAVEt_SET_SVFLAGS:
11415 TOPINT(nss,ix) = i;
11417 TOPINT(nss,ix) = i;
11418 sv = (SV*)POPPTR(ss,ix);
11419 TOPPTR(nss,ix) = sv_dup(sv, param);
11422 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11430 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11431 * flag to the result. This is done for each stash before cloning starts,
11432 * so we know which stashes want their objects cloned */
11435 do_mark_cloneable_stash(pTHX_ SV *sv)
11437 if (HvNAME((HV*)sv)) {
11438 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11439 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11440 if (cloner && GvCV(cloner)) {
11447 XPUSHs(sv_2mortal(newSVpv(HvNAME((HV*)sv), 0)));
11449 call_sv((SV*)GvCV(cloner), G_SCALAR);
11456 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11464 =for apidoc perl_clone
11466 Create and return a new interpreter by cloning the current one.
11468 perl_clone takes these flags as parameters:
11470 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11471 without it we only clone the data and zero the stacks,
11472 with it we copy the stacks and the new perl interpreter is
11473 ready to run at the exact same point as the previous one.
11474 The pseudo-fork code uses COPY_STACKS while the
11475 threads->new doesn't.
11477 CLONEf_KEEP_PTR_TABLE
11478 perl_clone keeps a ptr_table with the pointer of the old
11479 variable as a key and the new variable as a value,
11480 this allows it to check if something has been cloned and not
11481 clone it again but rather just use the value and increase the
11482 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11483 the ptr_table using the function
11484 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11485 reason to keep it around is if you want to dup some of your own
11486 variable who are outside the graph perl scans, example of this
11487 code is in threads.xs create
11490 This is a win32 thing, it is ignored on unix, it tells perls
11491 win32host code (which is c++) to clone itself, this is needed on
11492 win32 if you want to run two threads at the same time,
11493 if you just want to do some stuff in a separate perl interpreter
11494 and then throw it away and return to the original one,
11495 you don't need to do anything.
11500 /* XXX the above needs expanding by someone who actually understands it ! */
11501 EXTERN_C PerlInterpreter *
11502 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11505 perl_clone(PerlInterpreter *proto_perl, UV flags)
11507 #ifdef PERL_IMPLICIT_SYS
11509 /* perlhost.h so we need to call into it
11510 to clone the host, CPerlHost should have a c interface, sky */
11512 if (flags & CLONEf_CLONE_HOST) {
11513 return perl_clone_host(proto_perl,flags);
11515 return perl_clone_using(proto_perl, flags,
11517 proto_perl->IMemShared,
11518 proto_perl->IMemParse,
11520 proto_perl->IStdIO,
11524 proto_perl->IProc);
11528 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11529 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11530 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11531 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11532 struct IPerlDir* ipD, struct IPerlSock* ipS,
11533 struct IPerlProc* ipP)
11535 /* XXX many of the string copies here can be optimized if they're
11536 * constants; they need to be allocated as common memory and just
11537 * their pointers copied. */
11540 CLONE_PARAMS clone_params;
11541 CLONE_PARAMS* param = &clone_params;
11543 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11544 /* for each stash, determine whether its objects should be cloned */
11545 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11546 PERL_SET_THX(my_perl);
11549 Poison(my_perl, 1, PerlInterpreter);
11551 PL_curcop = (COP *)Nullop;
11555 PL_savestack_ix = 0;
11556 PL_savestack_max = -1;
11557 PL_sig_pending = 0;
11558 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11559 # else /* !DEBUGGING */
11560 Zero(my_perl, 1, PerlInterpreter);
11561 # endif /* DEBUGGING */
11563 /* host pointers */
11565 PL_MemShared = ipMS;
11566 PL_MemParse = ipMP;
11573 #else /* !PERL_IMPLICIT_SYS */
11575 CLONE_PARAMS clone_params;
11576 CLONE_PARAMS* param = &clone_params;
11577 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11578 /* for each stash, determine whether its objects should be cloned */
11579 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11580 PERL_SET_THX(my_perl);
11583 Poison(my_perl, 1, PerlInterpreter);
11585 PL_curcop = (COP *)Nullop;
11589 PL_savestack_ix = 0;
11590 PL_savestack_max = -1;
11591 PL_sig_pending = 0;
11592 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11593 # else /* !DEBUGGING */
11594 Zero(my_perl, 1, PerlInterpreter);
11595 # endif /* DEBUGGING */
11596 #endif /* PERL_IMPLICIT_SYS */
11597 param->flags = flags;
11598 param->proto_perl = proto_perl;
11601 PL_xiv_arenaroot = NULL;
11602 PL_xiv_root = NULL;
11603 PL_xnv_arenaroot = NULL;
11604 PL_xnv_root = NULL;
11605 PL_xrv_arenaroot = NULL;
11606 PL_xrv_root = NULL;
11607 PL_xpv_arenaroot = NULL;
11608 PL_xpv_root = NULL;
11609 PL_xpviv_arenaroot = NULL;
11610 PL_xpviv_root = NULL;
11611 PL_xpvnv_arenaroot = NULL;
11612 PL_xpvnv_root = NULL;
11613 PL_xpvcv_arenaroot = NULL;
11614 PL_xpvcv_root = NULL;
11615 PL_xpvav_arenaroot = NULL;
11616 PL_xpvav_root = NULL;
11617 PL_xpvhv_arenaroot = NULL;
11618 PL_xpvhv_root = NULL;
11619 PL_xpvmg_arenaroot = NULL;
11620 PL_xpvmg_root = NULL;
11621 PL_xpvlv_arenaroot = NULL;
11622 PL_xpvlv_root = NULL;
11623 PL_xpvbm_arenaroot = NULL;
11624 PL_xpvbm_root = NULL;
11625 PL_he_arenaroot = NULL;
11627 PL_nice_chunk = NULL;
11628 PL_nice_chunk_size = 0;
11630 PL_sv_objcount = 0;
11631 PL_sv_root = Nullsv;
11632 PL_sv_arenaroot = Nullsv;
11634 PL_debug = proto_perl->Idebug;
11636 #ifdef USE_REENTRANT_API
11637 /* XXX: things like -Dm will segfault here in perlio, but doing
11638 * PERL_SET_CONTEXT(proto_perl);
11639 * breaks too many other things
11641 Perl_reentrant_init(aTHX);
11644 /* create SV map for pointer relocation */
11645 PL_ptr_table = ptr_table_new();
11647 /* initialize these special pointers as early as possible */
11648 SvANY(&PL_sv_undef) = NULL;
11649 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11650 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11651 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11653 SvANY(&PL_sv_no) = new_XPVNV();
11654 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11655 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11656 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11657 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11658 SvCUR_set(&PL_sv_no, 0);
11659 SvLEN_set(&PL_sv_no, 1);
11660 SvIV_set(&PL_sv_no, 0);
11661 SvNV_set(&PL_sv_no, 0);
11662 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11664 SvANY(&PL_sv_yes) = new_XPVNV();
11665 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11666 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11667 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11668 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11669 SvCUR_set(&PL_sv_yes, 1);
11670 SvLEN_set(&PL_sv_yes, 2);
11671 SvIV_set(&PL_sv_yes, 1);
11672 SvNV_set(&PL_sv_yes, 1);
11673 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11675 /* create (a non-shared!) shared string table */
11676 PL_strtab = newHV();
11677 HvSHAREKEYS_off(PL_strtab);
11678 hv_ksplit(PL_strtab, 512);
11679 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11681 PL_compiling = proto_perl->Icompiling;
11683 /* These two PVs will be free'd special way so must set them same way op.c does */
11684 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11685 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11687 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11688 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11690 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11691 if (!specialWARN(PL_compiling.cop_warnings))
11692 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11693 if (!specialCopIO(PL_compiling.cop_io))
11694 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11695 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11697 /* pseudo environmental stuff */
11698 PL_origargc = proto_perl->Iorigargc;
11699 PL_origargv = proto_perl->Iorigargv;
11701 param->stashes = newAV(); /* Setup array of objects to call clone on */
11703 #ifdef PERLIO_LAYERS
11704 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11705 PerlIO_clone(aTHX_ proto_perl, param);
11708 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11709 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11710 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11711 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11712 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11713 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11716 PL_minus_c = proto_perl->Iminus_c;
11717 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11718 PL_localpatches = proto_perl->Ilocalpatches;
11719 PL_splitstr = proto_perl->Isplitstr;
11720 PL_preprocess = proto_perl->Ipreprocess;
11721 PL_minus_n = proto_perl->Iminus_n;
11722 PL_minus_p = proto_perl->Iminus_p;
11723 PL_minus_l = proto_perl->Iminus_l;
11724 PL_minus_a = proto_perl->Iminus_a;
11725 PL_minus_F = proto_perl->Iminus_F;
11726 PL_doswitches = proto_perl->Idoswitches;
11727 PL_dowarn = proto_perl->Idowarn;
11728 PL_doextract = proto_perl->Idoextract;
11729 PL_sawampersand = proto_perl->Isawampersand;
11730 PL_unsafe = proto_perl->Iunsafe;
11731 PL_inplace = SAVEPV(proto_perl->Iinplace);
11732 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11733 PL_perldb = proto_perl->Iperldb;
11734 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11735 PL_exit_flags = proto_perl->Iexit_flags;
11737 /* magical thingies */
11738 /* XXX time(&PL_basetime) when asked for? */
11739 PL_basetime = proto_perl->Ibasetime;
11740 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11742 PL_maxsysfd = proto_perl->Imaxsysfd;
11743 PL_multiline = proto_perl->Imultiline;
11744 PL_statusvalue = proto_perl->Istatusvalue;
11746 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11748 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11750 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11751 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11752 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11754 /* Clone the regex array */
11755 PL_regex_padav = newAV();
11757 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11758 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11759 av_push(PL_regex_padav,
11760 sv_dup_inc(regexen[0],param));
11761 for(i = 1; i <= len; i++) {
11762 if(SvREPADTMP(regexen[i])) {
11763 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11765 av_push(PL_regex_padav,
11767 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11768 SvIVX(regexen[i])), param)))
11773 PL_regex_pad = AvARRAY(PL_regex_padav);
11775 /* shortcuts to various I/O objects */
11776 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11777 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11778 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11779 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11780 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11781 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11783 /* shortcuts to regexp stuff */
11784 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11786 /* shortcuts to misc objects */
11787 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11789 /* shortcuts to debugging objects */
11790 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11791 PL_DBline = gv_dup(proto_perl->IDBline, param);
11792 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11793 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11794 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11795 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11796 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11797 PL_lineary = av_dup(proto_perl->Ilineary, param);
11798 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11800 /* symbol tables */
11801 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11802 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11803 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11804 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11805 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11807 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11808 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11809 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11810 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11811 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11812 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11814 PL_sub_generation = proto_perl->Isub_generation;
11816 /* funky return mechanisms */
11817 PL_forkprocess = proto_perl->Iforkprocess;
11819 /* subprocess state */
11820 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11822 /* internal state */
11823 PL_tainting = proto_perl->Itainting;
11824 PL_taint_warn = proto_perl->Itaint_warn;
11825 PL_maxo = proto_perl->Imaxo;
11826 if (proto_perl->Iop_mask)
11827 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11829 PL_op_mask = Nullch;
11830 /* PL_asserting = proto_perl->Iasserting; */
11832 /* current interpreter roots */
11833 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11834 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11835 PL_main_start = proto_perl->Imain_start;
11836 PL_eval_root = proto_perl->Ieval_root;
11837 PL_eval_start = proto_perl->Ieval_start;
11839 /* runtime control stuff */
11840 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11841 PL_copline = proto_perl->Icopline;
11843 PL_filemode = proto_perl->Ifilemode;
11844 PL_lastfd = proto_perl->Ilastfd;
11845 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11848 PL_gensym = proto_perl->Igensym;
11849 PL_preambled = proto_perl->Ipreambled;
11850 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11851 PL_laststatval = proto_perl->Ilaststatval;
11852 PL_laststype = proto_perl->Ilaststype;
11853 PL_mess_sv = Nullsv;
11855 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11856 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11858 /* interpreter atexit processing */
11859 PL_exitlistlen = proto_perl->Iexitlistlen;
11860 if (PL_exitlistlen) {
11861 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11862 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11865 PL_exitlist = (PerlExitListEntry*)NULL;
11866 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11867 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11868 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11870 PL_profiledata = NULL;
11871 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11872 /* PL_rsfp_filters entries have fake IoDIRP() */
11873 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11875 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11877 PAD_CLONE_VARS(proto_perl, param);
11879 #ifdef HAVE_INTERP_INTERN
11880 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11883 /* more statics moved here */
11884 PL_generation = proto_perl->Igeneration;
11885 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11887 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11888 PL_in_clean_all = proto_perl->Iin_clean_all;
11890 PL_uid = proto_perl->Iuid;
11891 PL_euid = proto_perl->Ieuid;
11892 PL_gid = proto_perl->Igid;
11893 PL_egid = proto_perl->Iegid;
11894 PL_nomemok = proto_perl->Inomemok;
11895 PL_an = proto_perl->Ian;
11896 PL_evalseq = proto_perl->Ievalseq;
11897 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11898 PL_origalen = proto_perl->Iorigalen;
11899 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11900 PL_osname = SAVEPV(proto_perl->Iosname);
11901 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11902 PL_sighandlerp = proto_perl->Isighandlerp;
11905 PL_runops = proto_perl->Irunops;
11907 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11910 PL_cshlen = proto_perl->Icshlen;
11911 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11914 PL_lex_state = proto_perl->Ilex_state;
11915 PL_lex_defer = proto_perl->Ilex_defer;
11916 PL_lex_expect = proto_perl->Ilex_expect;
11917 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11918 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11919 PL_lex_starts = proto_perl->Ilex_starts;
11920 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11921 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11922 PL_lex_op = proto_perl->Ilex_op;
11923 PL_lex_inpat = proto_perl->Ilex_inpat;
11924 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11925 PL_lex_brackets = proto_perl->Ilex_brackets;
11926 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11927 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11928 PL_lex_casemods = proto_perl->Ilex_casemods;
11929 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11930 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11932 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11933 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11934 PL_nexttoke = proto_perl->Inexttoke;
11936 /* XXX This is probably masking the deeper issue of why
11937 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11938 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11939 * (A little debugging with a watchpoint on it may help.)
11941 if (SvANY(proto_perl->Ilinestr)) {
11942 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11943 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11944 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11945 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11946 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11947 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11948 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11949 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11950 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11953 PL_linestr = NEWSV(65,79);
11954 sv_upgrade(PL_linestr,SVt_PVIV);
11955 sv_setpvn(PL_linestr,"",0);
11956 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11958 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11959 PL_pending_ident = proto_perl->Ipending_ident;
11960 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11962 PL_expect = proto_perl->Iexpect;
11964 PL_multi_start = proto_perl->Imulti_start;
11965 PL_multi_end = proto_perl->Imulti_end;
11966 PL_multi_open = proto_perl->Imulti_open;
11967 PL_multi_close = proto_perl->Imulti_close;
11969 PL_error_count = proto_perl->Ierror_count;
11970 PL_subline = proto_perl->Isubline;
11971 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11973 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11974 if (SvANY(proto_perl->Ilinestr)) {
11975 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11976 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11977 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11978 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11979 PL_last_lop_op = proto_perl->Ilast_lop_op;
11982 PL_last_uni = SvPVX(PL_linestr);
11983 PL_last_lop = SvPVX(PL_linestr);
11984 PL_last_lop_op = 0;
11986 PL_in_my = proto_perl->Iin_my;
11987 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11989 PL_cryptseen = proto_perl->Icryptseen;
11992 PL_hints = proto_perl->Ihints;
11994 PL_amagic_generation = proto_perl->Iamagic_generation;
11996 #ifdef USE_LOCALE_COLLATE
11997 PL_collation_ix = proto_perl->Icollation_ix;
11998 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11999 PL_collation_standard = proto_perl->Icollation_standard;
12000 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12001 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12002 #endif /* USE_LOCALE_COLLATE */
12004 #ifdef USE_LOCALE_NUMERIC
12005 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12006 PL_numeric_standard = proto_perl->Inumeric_standard;
12007 PL_numeric_local = proto_perl->Inumeric_local;
12008 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12009 #endif /* !USE_LOCALE_NUMERIC */
12011 /* utf8 character classes */
12012 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12013 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12014 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12015 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12016 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12017 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12018 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12019 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12020 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12021 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12022 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12023 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12024 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12025 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12026 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12027 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12028 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12029 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12030 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12031 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12033 /* Did the locale setup indicate UTF-8? */
12034 PL_utf8locale = proto_perl->Iutf8locale;
12035 /* Unicode features (see perlrun/-C) */
12036 PL_unicode = proto_perl->Iunicode;
12038 /* Pre-5.8 signals control */
12039 PL_signals = proto_perl->Isignals;
12041 /* times() ticks per second */
12042 PL_clocktick = proto_perl->Iclocktick;
12044 /* Recursion stopper for PerlIO_find_layer */
12045 PL_in_load_module = proto_perl->Iin_load_module;
12047 /* sort() routine */
12048 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12050 /* Not really needed/useful since the reenrant_retint is "volatile",
12051 * but do it for consistency's sake. */
12052 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12054 /* Hooks to shared SVs and locks. */
12055 PL_sharehook = proto_perl->Isharehook;
12056 PL_lockhook = proto_perl->Ilockhook;
12057 PL_unlockhook = proto_perl->Iunlockhook;
12058 PL_threadhook = proto_perl->Ithreadhook;
12060 PL_runops_std = proto_perl->Irunops_std;
12061 PL_runops_dbg = proto_perl->Irunops_dbg;
12063 #ifdef THREADS_HAVE_PIDS
12064 PL_ppid = proto_perl->Ippid;
12068 PL_last_swash_hv = Nullhv; /* reinits on demand */
12069 PL_last_swash_klen = 0;
12070 PL_last_swash_key[0]= '\0';
12071 PL_last_swash_tmps = (U8*)NULL;
12072 PL_last_swash_slen = 0;
12074 PL_glob_index = proto_perl->Iglob_index;
12075 PL_srand_called = proto_perl->Isrand_called;
12076 PL_hash_seed = proto_perl->Ihash_seed;
12077 PL_rehash_seed = proto_perl->Irehash_seed;
12078 PL_uudmap['M'] = 0; /* reinits on demand */
12079 PL_bitcount = Nullch; /* reinits on demand */
12081 if (proto_perl->Ipsig_pend) {
12082 Newz(0, PL_psig_pend, SIG_SIZE, int);
12085 PL_psig_pend = (int*)NULL;
12088 if (proto_perl->Ipsig_ptr) {
12089 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12090 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12091 for (i = 1; i < SIG_SIZE; i++) {
12092 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12093 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12097 PL_psig_ptr = (SV**)NULL;
12098 PL_psig_name = (SV**)NULL;
12101 /* thrdvar.h stuff */
12103 if (flags & CLONEf_COPY_STACKS) {
12104 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12105 PL_tmps_ix = proto_perl->Ttmps_ix;
12106 PL_tmps_max = proto_perl->Ttmps_max;
12107 PL_tmps_floor = proto_perl->Ttmps_floor;
12108 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12110 while (i <= PL_tmps_ix) {
12111 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12115 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12116 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12117 Newz(54, PL_markstack, i, I32);
12118 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12119 - proto_perl->Tmarkstack);
12120 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12121 - proto_perl->Tmarkstack);
12122 Copy(proto_perl->Tmarkstack, PL_markstack,
12123 PL_markstack_ptr - PL_markstack + 1, I32);
12125 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12126 * NOTE: unlike the others! */
12127 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12128 PL_scopestack_max = proto_perl->Tscopestack_max;
12129 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12130 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12132 /* NOTE: si_dup() looks at PL_markstack */
12133 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12135 /* PL_curstack = PL_curstackinfo->si_stack; */
12136 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12137 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12139 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12140 PL_stack_base = AvARRAY(PL_curstack);
12141 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12142 - proto_perl->Tstack_base);
12143 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12145 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12146 * NOTE: unlike the others! */
12147 PL_savestack_ix = proto_perl->Tsavestack_ix;
12148 PL_savestack_max = proto_perl->Tsavestack_max;
12149 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12150 PL_savestack = ss_dup(proto_perl, param);
12154 ENTER; /* perl_destruct() wants to LEAVE; */
12157 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12158 PL_top_env = &PL_start_env;
12160 PL_op = proto_perl->Top;
12163 PL_Xpv = (XPV*)NULL;
12164 PL_na = proto_perl->Tna;
12166 PL_statbuf = proto_perl->Tstatbuf;
12167 PL_statcache = proto_perl->Tstatcache;
12168 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12169 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12171 PL_timesbuf = proto_perl->Ttimesbuf;
12174 PL_tainted = proto_perl->Ttainted;
12175 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12176 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12177 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12178 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12179 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12180 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12181 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12182 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12183 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12185 PL_restartop = proto_perl->Trestartop;
12186 PL_in_eval = proto_perl->Tin_eval;
12187 PL_delaymagic = proto_perl->Tdelaymagic;
12188 PL_dirty = proto_perl->Tdirty;
12189 PL_localizing = proto_perl->Tlocalizing;
12191 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12192 PL_hv_fetch_ent_mh = Nullhe;
12193 PL_modcount = proto_perl->Tmodcount;
12194 PL_lastgotoprobe = Nullop;
12195 PL_dumpindent = proto_perl->Tdumpindent;
12197 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12198 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12199 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12200 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12201 PL_sortcxix = proto_perl->Tsortcxix;
12202 PL_efloatbuf = Nullch; /* reinits on demand */
12203 PL_efloatsize = 0; /* reinits on demand */
12207 PL_screamfirst = NULL;
12208 PL_screamnext = NULL;
12209 PL_maxscream = -1; /* reinits on demand */
12210 PL_lastscream = Nullsv;
12212 PL_watchaddr = NULL;
12213 PL_watchok = Nullch;
12215 PL_regdummy = proto_perl->Tregdummy;
12216 PL_regprecomp = Nullch;
12219 PL_colorset = 0; /* reinits PL_colors[] */
12220 /*PL_colors[6] = {0,0,0,0,0,0};*/
12221 PL_reginput = Nullch;
12222 PL_regbol = Nullch;
12223 PL_regeol = Nullch;
12224 PL_regstartp = (I32*)NULL;
12225 PL_regendp = (I32*)NULL;
12226 PL_reglastparen = (U32*)NULL;
12227 PL_reglastcloseparen = (U32*)NULL;
12228 PL_regtill = Nullch;
12229 PL_reg_start_tmp = (char**)NULL;
12230 PL_reg_start_tmpl = 0;
12231 PL_regdata = (struct reg_data*)NULL;
12234 PL_reg_eval_set = 0;
12236 PL_regprogram = (regnode*)NULL;
12238 PL_regcc = (CURCUR*)NULL;
12239 PL_reg_call_cc = (struct re_cc_state*)NULL;
12240 PL_reg_re = (regexp*)NULL;
12241 PL_reg_ganch = Nullch;
12242 PL_reg_sv = Nullsv;
12243 PL_reg_match_utf8 = FALSE;
12244 PL_reg_magic = (MAGIC*)NULL;
12246 PL_reg_oldcurpm = (PMOP*)NULL;
12247 PL_reg_curpm = (PMOP*)NULL;
12248 PL_reg_oldsaved = Nullch;
12249 PL_reg_oldsavedlen = 0;
12250 #ifdef PERL_COPY_ON_WRITE
12253 PL_reg_maxiter = 0;
12254 PL_reg_leftiter = 0;
12255 PL_reg_poscache = Nullch;
12256 PL_reg_poscache_size= 0;
12258 /* RE engine - function pointers */
12259 PL_regcompp = proto_perl->Tregcompp;
12260 PL_regexecp = proto_perl->Tregexecp;
12261 PL_regint_start = proto_perl->Tregint_start;
12262 PL_regint_string = proto_perl->Tregint_string;
12263 PL_regfree = proto_perl->Tregfree;
12265 PL_reginterp_cnt = 0;
12266 PL_reg_starttry = 0;
12268 /* Pluggable optimizer */
12269 PL_peepp = proto_perl->Tpeepp;
12271 PL_stashcache = newHV();
12273 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12274 ptr_table_free(PL_ptr_table);
12275 PL_ptr_table = NULL;
12278 /* Call the ->CLONE method, if it exists, for each of the stashes
12279 identified by sv_dup() above.
12281 while(av_len(param->stashes) != -1) {
12282 HV* stash = (HV*) av_shift(param->stashes);
12283 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12284 if (cloner && GvCV(cloner)) {
12289 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
12291 call_sv((SV*)GvCV(cloner), G_DISCARD);
12297 SvREFCNT_dec(param->stashes);
12302 #endif /* USE_ITHREADS */
12305 =head1 Unicode Support
12307 =for apidoc sv_recode_to_utf8
12309 The encoding is assumed to be an Encode object, on entry the PV
12310 of the sv is assumed to be octets in that encoding, and the sv
12311 will be converted into Unicode (and UTF-8).
12313 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12314 is not a reference, nothing is done to the sv. If the encoding is not
12315 an C<Encode::XS> Encoding object, bad things will happen.
12316 (See F<lib/encoding.pm> and L<Encode>).
12318 The PV of the sv is returned.
12323 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12325 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12339 Passing sv_yes is wrong - it needs to be or'ed set of constants
12340 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12341 remove converted chars from source.
12343 Both will default the value - let them.
12345 XPUSHs(&PL_sv_yes);
12348 call_method("decode", G_SCALAR);
12352 s = SvPV(uni, len);
12353 if (s != SvPVX(sv)) {
12354 SvGROW(sv, len + 1);
12355 Move(s, SvPVX(sv), len, char);
12356 SvCUR_set(sv, len);
12357 SvPVX(sv)[len] = 0;
12364 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12368 =for apidoc sv_cat_decode
12370 The encoding is assumed to be an Encode object, the PV of the ssv is
12371 assumed to be octets in that encoding and decoding the input starts
12372 from the position which (PV + *offset) pointed to. The dsv will be
12373 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12374 when the string tstr appears in decoding output or the input ends on
12375 the PV of the ssv. The value which the offset points will be modified
12376 to the last input position on the ssv.
12378 Returns TRUE if the terminator was found, else returns FALSE.
12383 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12384 SV *ssv, int *offset, char *tstr, int tlen)
12387 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12398 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12399 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12401 call_method("cat_decode", G_SCALAR);
12403 ret = SvTRUE(TOPs);
12404 *offset = SvIV(offsv);
12410 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12416 * c-indentation-style: bsd
12417 * c-basic-offset: 4
12418 * indent-tabs-mode: t
12421 * vim: shiftwidth=4: