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)
653 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
654 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
659 for (i=HvMAX(hv); i>0; i--) {
660 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
661 if (HeVAL(entry) != val)
663 if ( HeVAL(entry) == &PL_sv_undef ||
664 HeVAL(entry) == &PL_sv_placeholder)
668 if (HeKLEN(entry) == HEf_SVKEY)
669 return sv_mortalcopy(HeKEY_sv(entry));
670 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
676 /* Look for an entry in the array whose value has the same SV as val;
677 * If so, return the index, otherwise return -1. */
680 S_find_array_subscript(pTHX_ AV *av, SV* val)
684 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
685 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
689 for (i=AvFILLp(av); i>=0; i--) {
690 if (svp[i] == val && svp[i] != &PL_sv_undef)
696 /* S_varname(): return the name of a variable, optionally with a subscript.
697 * If gv is non-zero, use the name of that global, along with gvtype (one
698 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
699 * targ. Depending on the value of the subscript_type flag, return:
702 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
703 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
704 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
705 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
708 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
709 SV* keyname, I32 aindex, int subscript_type)
715 name = sv_newmortal();
718 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
719 * XXX get rid of all this if gv_fullnameX() ever supports this
723 HV *hv = GvSTASH(gv);
724 sv_setpv(name, gvtype);
727 else if (!(p=HvNAME(hv)))
729 if (strNE(p, "main")) {
731 sv_catpvn(name,"::", 2);
733 if (GvNAMELEN(gv)>= 1 &&
734 ((unsigned int)*GvNAME(gv)) <= 26)
736 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
737 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
740 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
744 CV *cv = find_runcv(&u);
745 if (!cv || !CvPADLIST(cv))
747 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
748 sv = *av_fetch(av, targ, FALSE);
749 /* SvLEN in a pad name is not to be trusted */
750 sv_setpv(name, SvPV_nolen(sv));
753 if (subscript_type == FUV_SUBSCRIPT_HASH) {
756 Perl_sv_catpvf(aTHX_ name, "{%s}",
757 pv_display(sv,SvPVX(keyname), SvCUR(keyname), 0, 32));
760 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
762 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
764 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
765 sv_insert(name, 0, 0, "within ", 7);
772 =for apidoc find_uninit_var
774 Find the name of the undefined variable (if any) that caused the operator o
775 to issue a "Use of uninitialized value" warning.
776 If match is true, only return a name if it's value matches uninit_sv.
777 So roughly speaking, if a unary operator (such as OP_COS) generates a
778 warning, then following the direct child of the op may yield an
779 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
780 other hand, with OP_ADD there are two branches to follow, so we only print
781 the variable name if we get an exact match.
783 The name is returned as a mortal SV.
785 Assumes that PL_op is the op that originally triggered the error, and that
786 PL_comppad/PL_curpad points to the currently executing pad.
792 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
801 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
802 uninit_sv == &PL_sv_placeholder)))
805 switch (obase->op_type) {
812 bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
813 bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
816 int subscript_type = FUV_SUBSCRIPT_WITHIN;
818 if (pad) { /* @lex, %lex */
819 sv = PAD_SVl(obase->op_targ);
823 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
824 /* @global, %global */
825 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
828 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
830 else /* @{expr}, %{expr} */
831 return find_uninit_var(cUNOPx(obase)->op_first,
835 /* attempt to find a match within the aggregate */
837 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
839 subscript_type = FUV_SUBSCRIPT_HASH;
842 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
844 subscript_type = FUV_SUBSCRIPT_ARRAY;
847 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
850 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
851 keysv, index, subscript_type);
855 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
857 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
858 Nullsv, 0, FUV_SUBSCRIPT_NONE);
861 gv = cGVOPx_gv(obase);
862 if (!gv || (match && GvSV(gv) != uninit_sv))
864 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
867 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
869 av = (AV*)PAD_SV(obase->op_targ);
870 if (!av || SvRMAGICAL(av))
872 svp = av_fetch(av, (I32)obase->op_private, FALSE);
873 if (!svp || *svp != uninit_sv)
876 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
877 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
880 gv = cGVOPx_gv(obase);
885 if (!av || SvRMAGICAL(av))
887 svp = av_fetch(av, (I32)obase->op_private, FALSE);
888 if (!svp || *svp != uninit_sv)
891 return S_varname(aTHX_ gv, "$", 0,
892 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
897 o = cUNOPx(obase)->op_first;
898 if (!o || o->op_type != OP_NULL ||
899 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
901 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
906 /* $a[uninit_expr] or $h{uninit_expr} */
907 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
910 o = cBINOPx(obase)->op_first;
911 kid = cBINOPx(obase)->op_last;
913 /* get the av or hv, and optionally the gv */
915 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
916 sv = PAD_SV(o->op_targ);
918 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
919 && cUNOPo->op_first->op_type == OP_GV)
921 gv = cGVOPx_gv(cUNOPo->op_first);
924 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
929 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
930 /* index is constant */
934 if (obase->op_type == OP_HELEM) {
935 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
936 if (!he || HeVAL(he) != uninit_sv)
940 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
941 if (!svp || *svp != uninit_sv)
945 if (obase->op_type == OP_HELEM)
946 return S_varname(aTHX_ gv, "%", o->op_targ,
947 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
949 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
950 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
954 /* index is an expression;
955 * attempt to find a match within the aggregate */
956 if (obase->op_type == OP_HELEM) {
957 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
959 return S_varname(aTHX_ gv, "%", o->op_targ,
960 keysv, 0, FUV_SUBSCRIPT_HASH);
963 I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
965 return S_varname(aTHX_ gv, "@", o->op_targ,
966 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
970 return S_varname(aTHX_ gv,
971 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
973 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
979 /* only examine RHS */
980 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
983 o = cUNOPx(obase)->op_first;
984 if (o->op_type == OP_PUSHMARK)
987 if (!o->op_sibling) {
988 /* one-arg version of open is highly magical */
990 if (o->op_type == OP_GV) { /* open FOO; */
992 if (match && GvSV(gv) != uninit_sv)
994 return S_varname(aTHX_ gv, "$", 0,
995 Nullsv, 0, FUV_SUBSCRIPT_NONE);
997 /* other possibilities not handled are:
998 * open $x; or open my $x; should return '${*$x}'
999 * open expr; should return '$'.expr ideally
1005 /* ops where $_ may be an implicit arg */
1009 if ( !(obase->op_flags & OPf_STACKED)) {
1010 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1011 ? PAD_SVl(obase->op_targ)
1014 sv = sv_newmortal();
1023 /* skip filehandle as it can't produce 'undef' warning */
1024 o = cUNOPx(obase)->op_first;
1025 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1026 o = o->op_sibling->op_sibling;
1033 match = 1; /* XS or custom code could trigger random warnings */
1038 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1039 return sv_2mortal(newSVpv("${$/}", 0));
1044 if (!(obase->op_flags & OPf_KIDS))
1046 o = cUNOPx(obase)->op_first;
1052 /* if all except one arg are constant, or have no side-effects,
1053 * or are optimized away, then it's unambiguous */
1055 for (kid=o; kid; kid = kid->op_sibling) {
1057 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1058 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1059 || (kid->op_type == OP_PUSHMARK)
1063 if (o2) { /* more than one found */
1070 return find_uninit_var(o2, uninit_sv, match);
1074 sv = find_uninit_var(o, uninit_sv, 1);
1086 =for apidoc report_uninit
1088 Print appropriate "Use of uninitialized variable" warning
1094 Perl_report_uninit(pTHX_ SV* uninit_sv)
1097 SV* varname = Nullsv;
1099 varname = find_uninit_var(PL_op, uninit_sv,0);
1101 sv_insert(varname, 0, 0, " ", 1);
1103 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1104 varname ? SvPV_nolen(varname) : "",
1105 " in ", OP_DESC(PL_op));
1108 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1112 /* grab a new IV body from the free list, allocating more if necessary */
1123 * See comment in more_xiv() -- RAM.
1125 PL_xiv_root = *(IV**)xiv;
1127 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
1130 /* return an IV body to the free list */
1133 S_del_xiv(pTHX_ XPVIV *p)
1135 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
1137 *(IV**)xiv = PL_xiv_root;
1142 /* allocate another arena's worth of IV bodies */
1148 register IV* xivend;
1150 New(705, ptr, 1008/sizeof(XPV), XPV);
1151 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
1152 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
1155 xivend = &xiv[1008 / sizeof(IV) - 1];
1156 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
1158 while (xiv < xivend) {
1159 *(IV**)xiv = (IV *)(xiv + 1);
1165 /* grab a new NV body from the free list, allocating more if necessary */
1175 PL_xnv_root = *(NV**)xnv;
1177 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1180 /* return an NV body to the free list */
1183 S_del_xnv(pTHX_ XPVNV *p)
1185 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1187 *(NV**)xnv = PL_xnv_root;
1192 /* allocate another arena's worth of NV bodies */
1198 register NV* xnvend;
1200 New(711, ptr, 1008/sizeof(XPV), XPV);
1201 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
1202 PL_xnv_arenaroot = ptr;
1205 xnvend = &xnv[1008 / sizeof(NV) - 1];
1206 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1208 while (xnv < xnvend) {
1209 *(NV**)xnv = (NV*)(xnv + 1);
1215 /* grab a new struct xrv from the free list, allocating more if necessary */
1225 PL_xrv_root = (XRV*)xrv->xrv_rv;
1230 /* return a struct xrv to the free list */
1233 S_del_xrv(pTHX_ XRV *p)
1236 p->xrv_rv = (SV*)PL_xrv_root;
1241 /* allocate another arena's worth of struct xrv */
1247 register XRV* xrvend;
1249 New(712, ptr, 1008/sizeof(XPV), XPV);
1250 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
1251 PL_xrv_arenaroot = ptr;
1254 xrvend = &xrv[1008 / sizeof(XRV) - 1];
1255 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
1257 while (xrv < xrvend) {
1258 xrv->xrv_rv = (SV*)(xrv + 1);
1264 /* grab a new struct xpv from the free list, allocating more if necessary */
1274 PL_xpv_root = (XPV*)xpv->xpv_pv;
1279 /* return a struct xpv to the free list */
1282 S_del_xpv(pTHX_ XPV *p)
1285 p->xpv_pv = (char*)PL_xpv_root;
1290 /* allocate another arena's worth of struct xpv */
1296 register XPV* xpvend;
1297 New(713, xpv, 1008/sizeof(XPV), XPV);
1298 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
1299 PL_xpv_arenaroot = xpv;
1301 xpvend = &xpv[1008 / sizeof(XPV) - 1];
1302 PL_xpv_root = ++xpv;
1303 while (xpv < xpvend) {
1304 xpv->xpv_pv = (char*)(xpv + 1);
1310 /* grab a new struct xpviv from the free list, allocating more if necessary */
1319 xpviv = PL_xpviv_root;
1320 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
1325 /* return a struct xpviv to the free list */
1328 S_del_xpviv(pTHX_ XPVIV *p)
1331 p->xpv_pv = (char*)PL_xpviv_root;
1336 /* allocate another arena's worth of struct xpviv */
1341 register XPVIV* xpviv;
1342 register XPVIV* xpvivend;
1343 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
1344 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
1345 PL_xpviv_arenaroot = xpviv;
1347 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
1348 PL_xpviv_root = ++xpviv;
1349 while (xpviv < xpvivend) {
1350 xpviv->xpv_pv = (char*)(xpviv + 1);
1356 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1365 xpvnv = PL_xpvnv_root;
1366 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
1371 /* return a struct xpvnv to the free list */
1374 S_del_xpvnv(pTHX_ XPVNV *p)
1377 p->xpv_pv = (char*)PL_xpvnv_root;
1382 /* allocate another arena's worth of struct xpvnv */
1387 register XPVNV* xpvnv;
1388 register XPVNV* xpvnvend;
1389 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
1390 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
1391 PL_xpvnv_arenaroot = xpvnv;
1393 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
1394 PL_xpvnv_root = ++xpvnv;
1395 while (xpvnv < xpvnvend) {
1396 xpvnv->xpv_pv = (char*)(xpvnv + 1);
1402 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1411 xpvcv = PL_xpvcv_root;
1412 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
1417 /* return a struct xpvcv to the free list */
1420 S_del_xpvcv(pTHX_ XPVCV *p)
1423 p->xpv_pv = (char*)PL_xpvcv_root;
1428 /* allocate another arena's worth of struct xpvcv */
1433 register XPVCV* xpvcv;
1434 register XPVCV* xpvcvend;
1435 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
1436 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
1437 PL_xpvcv_arenaroot = xpvcv;
1439 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
1440 PL_xpvcv_root = ++xpvcv;
1441 while (xpvcv < xpvcvend) {
1442 xpvcv->xpv_pv = (char*)(xpvcv + 1);
1448 /* grab a new struct xpvav from the free list, allocating more if necessary */
1457 xpvav = PL_xpvav_root;
1458 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
1463 /* return a struct xpvav to the free list */
1466 S_del_xpvav(pTHX_ XPVAV *p)
1469 p->xav_array = (char*)PL_xpvav_root;
1474 /* allocate another arena's worth of struct xpvav */
1479 register XPVAV* xpvav;
1480 register XPVAV* xpvavend;
1481 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
1482 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
1483 PL_xpvav_arenaroot = xpvav;
1485 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
1486 PL_xpvav_root = ++xpvav;
1487 while (xpvav < xpvavend) {
1488 xpvav->xav_array = (char*)(xpvav + 1);
1491 xpvav->xav_array = 0;
1494 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1503 xpvhv = PL_xpvhv_root;
1504 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
1509 /* return a struct xpvhv to the free list */
1512 S_del_xpvhv(pTHX_ XPVHV *p)
1515 p->xhv_array = (char*)PL_xpvhv_root;
1520 /* allocate another arena's worth of struct xpvhv */
1525 register XPVHV* xpvhv;
1526 register XPVHV* xpvhvend;
1527 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
1528 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1529 PL_xpvhv_arenaroot = xpvhv;
1531 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
1532 PL_xpvhv_root = ++xpvhv;
1533 while (xpvhv < xpvhvend) {
1534 xpvhv->xhv_array = (char*)(xpvhv + 1);
1537 xpvhv->xhv_array = 0;
1540 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1549 xpvmg = PL_xpvmg_root;
1550 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1555 /* return a struct xpvmg to the free list */
1558 S_del_xpvmg(pTHX_ XPVMG *p)
1561 p->xpv_pv = (char*)PL_xpvmg_root;
1566 /* allocate another arena's worth of struct xpvmg */
1571 register XPVMG* xpvmg;
1572 register XPVMG* xpvmgend;
1573 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1574 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1575 PL_xpvmg_arenaroot = xpvmg;
1577 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1578 PL_xpvmg_root = ++xpvmg;
1579 while (xpvmg < xpvmgend) {
1580 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1586 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1595 xpvlv = PL_xpvlv_root;
1596 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1601 /* return a struct xpvlv to the free list */
1604 S_del_xpvlv(pTHX_ XPVLV *p)
1607 p->xpv_pv = (char*)PL_xpvlv_root;
1612 /* allocate another arena's worth of struct xpvlv */
1617 register XPVLV* xpvlv;
1618 register XPVLV* xpvlvend;
1619 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1620 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1621 PL_xpvlv_arenaroot = xpvlv;
1623 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1624 PL_xpvlv_root = ++xpvlv;
1625 while (xpvlv < xpvlvend) {
1626 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1632 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1641 xpvbm = PL_xpvbm_root;
1642 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1647 /* return a struct xpvbm to the free list */
1650 S_del_xpvbm(pTHX_ XPVBM *p)
1653 p->xpv_pv = (char*)PL_xpvbm_root;
1658 /* allocate another arena's worth of struct xpvbm */
1663 register XPVBM* xpvbm;
1664 register XPVBM* xpvbmend;
1665 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1666 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1667 PL_xpvbm_arenaroot = xpvbm;
1669 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1670 PL_xpvbm_root = ++xpvbm;
1671 while (xpvbm < xpvbmend) {
1672 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1678 #define my_safemalloc(s) (void*)safemalloc(s)
1679 #define my_safefree(p) safefree((char*)p)
1683 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1684 #define del_XIV(p) my_safefree(p)
1686 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1687 #define del_XNV(p) my_safefree(p)
1689 #define new_XRV() my_safemalloc(sizeof(XRV))
1690 #define del_XRV(p) my_safefree(p)
1692 #define new_XPV() my_safemalloc(sizeof(XPV))
1693 #define del_XPV(p) my_safefree(p)
1695 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1696 #define del_XPVIV(p) my_safefree(p)
1698 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1699 #define del_XPVNV(p) my_safefree(p)
1701 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1702 #define del_XPVCV(p) my_safefree(p)
1704 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1705 #define del_XPVAV(p) my_safefree(p)
1707 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1708 #define del_XPVHV(p) my_safefree(p)
1710 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1711 #define del_XPVMG(p) my_safefree(p)
1713 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1714 #define del_XPVLV(p) my_safefree(p)
1716 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1717 #define del_XPVBM(p) my_safefree(p)
1721 #define new_XIV() (void*)new_xiv()
1722 #define del_XIV(p) del_xiv((XPVIV*) p)
1724 #define new_XNV() (void*)new_xnv()
1725 #define del_XNV(p) del_xnv((XPVNV*) p)
1727 #define new_XRV() (void*)new_xrv()
1728 #define del_XRV(p) del_xrv((XRV*) p)
1730 #define new_XPV() (void*)new_xpv()
1731 #define del_XPV(p) del_xpv((XPV *)p)
1733 #define new_XPVIV() (void*)new_xpviv()
1734 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1736 #define new_XPVNV() (void*)new_xpvnv()
1737 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1739 #define new_XPVCV() (void*)new_xpvcv()
1740 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1742 #define new_XPVAV() (void*)new_xpvav()
1743 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1745 #define new_XPVHV() (void*)new_xpvhv()
1746 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1748 #define new_XPVMG() (void*)new_xpvmg()
1749 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1751 #define new_XPVLV() (void*)new_xpvlv()
1752 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1754 #define new_XPVBM() (void*)new_xpvbm()
1755 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1759 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1760 #define del_XPVGV(p) my_safefree(p)
1762 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1763 #define del_XPVFM(p) my_safefree(p)
1765 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1766 #define del_XPVIO(p) my_safefree(p)
1769 =for apidoc sv_upgrade
1771 Upgrade an SV to a more complex form. Generally adds a new body type to the
1772 SV, then copies across as much information as possible from the old body.
1773 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1779 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1790 if (mt != SVt_PV && SvIsCOW(sv)) {
1791 sv_force_normal_flags(sv, 0);
1794 if (SvTYPE(sv) == mt)
1805 switch (SvTYPE(sv)) {
1813 else if (mt < SVt_PVIV)
1823 pv = (char*)SvRV(sv);
1833 else if (mt == SVt_NV)
1841 del_XPVIV(SvANY(sv));
1849 del_XPVNV(SvANY(sv));
1857 magic = SvMAGIC(sv);
1858 stash = SvSTASH(sv);
1859 del_XPVMG(SvANY(sv));
1862 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1865 SvFLAGS(sv) &= ~SVTYPEMASK;
1870 Perl_croak(aTHX_ "Can't upgrade to undef");
1872 SvANY(sv) = new_XIV();
1876 SvANY(sv) = new_XNV();
1880 SvANY(sv) = new_XRV();
1881 SvRV_set(sv, (SV*)pv);
1884 SvANY(sv) = new_XPVHV();
1891 HvTOTALKEYS(sv) = 0;
1892 HvPLACEHOLDERS(sv) = 0;
1894 /* Fall through... */
1897 SvANY(sv) = new_XPVAV();
1902 AvFLAGS(sv) = AVf_REAL;
1907 /* XXX? Only SVt_NULL is ever upgraded to AV or HV? */
1909 /* FIXME. Should be able to remove this if the above assertion is
1910 genuinely always true. */
1911 (void)SvOOK_off(sv);
1914 SvPV_set(sv, (char*)0);
1915 SvMAGIC_set(sv, magic);
1916 SvSTASH_set(sv, stash);
1920 SvANY(sv) = new_XPVIO();
1921 Zero(SvANY(sv), 1, XPVIO);
1922 IoPAGE_LEN(sv) = 60;
1923 goto set_magic_common;
1925 SvANY(sv) = new_XPVFM();
1926 Zero(SvANY(sv), 1, XPVFM);
1927 goto set_magic_common;
1929 SvANY(sv) = new_XPVBM();
1933 goto set_magic_common;
1935 SvANY(sv) = new_XPVGV();
1941 goto set_magic_common;
1943 SvANY(sv) = new_XPVCV();
1944 Zero(SvANY(sv), 1, XPVCV);
1945 goto set_magic_common;
1947 SvANY(sv) = new_XPVLV();
1960 SvANY(sv) = new_XPVMG();
1963 SvMAGIC_set(sv, magic);
1964 SvSTASH_set(sv, stash);
1968 SvANY(sv) = new_XPVNV();
1974 SvANY(sv) = new_XPVIV();
1983 SvANY(sv) = new_XPV();
1994 =for apidoc sv_backoff
1996 Remove any string offset. You should normally use the C<SvOOK_off> macro
2003 Perl_sv_backoff(pTHX_ register SV *sv)
2007 char *s = SvPVX(sv);
2008 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
2009 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
2011 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
2013 SvFLAGS(sv) &= ~SVf_OOK;
2020 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2021 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2022 Use the C<SvGROW> wrapper instead.
2028 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2032 #ifdef HAS_64K_LIMIT
2033 if (newlen >= 0x10000) {
2034 PerlIO_printf(Perl_debug_log,
2035 "Allocation too large: %"UVxf"\n", (UV)newlen);
2038 #endif /* HAS_64K_LIMIT */
2041 if (SvTYPE(sv) < SVt_PV) {
2042 sv_upgrade(sv, SVt_PV);
2045 else if (SvOOK(sv)) { /* pv is offset? */
2048 if (newlen > SvLEN(sv))
2049 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2050 #ifdef HAS_64K_LIMIT
2051 if (newlen >= 0x10000)
2058 if (newlen > SvLEN(sv)) { /* need more room? */
2059 if (SvLEN(sv) && s) {
2061 STRLEN l = malloced_size((void*)SvPVX(sv));
2067 Renew(s,newlen,char);
2070 New(703, s, newlen, char);
2071 if (SvPVX(sv) && SvCUR(sv)) {
2072 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2076 SvLEN_set(sv, newlen);
2082 =for apidoc sv_setiv
2084 Copies an integer into the given SV, upgrading first if necessary.
2085 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2091 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2093 SV_CHECK_THINKFIRST_COW_DROP(sv);
2094 switch (SvTYPE(sv)) {
2096 sv_upgrade(sv, SVt_IV);
2099 sv_upgrade(sv, SVt_PVNV);
2103 sv_upgrade(sv, SVt_PVIV);
2112 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2115 (void)SvIOK_only(sv); /* validate number */
2121 =for apidoc sv_setiv_mg
2123 Like C<sv_setiv>, but also handles 'set' magic.
2129 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2136 =for apidoc sv_setuv
2138 Copies an unsigned integer into the given SV, upgrading first if necessary.
2139 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2145 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2147 /* With these two if statements:
2148 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2151 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2153 If you wish to remove them, please benchmark to see what the effect is
2155 if (u <= (UV)IV_MAX) {
2156 sv_setiv(sv, (IV)u);
2165 =for apidoc sv_setuv_mg
2167 Like C<sv_setuv>, but also handles 'set' magic.
2173 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2175 /* With these two if statements:
2176 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2179 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2181 If you wish to remove them, please benchmark to see what the effect is
2183 if (u <= (UV)IV_MAX) {
2184 sv_setiv(sv, (IV)u);
2194 =for apidoc sv_setnv
2196 Copies a double into the given SV, upgrading first if necessary.
2197 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2203 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2205 SV_CHECK_THINKFIRST_COW_DROP(sv);
2206 switch (SvTYPE(sv)) {
2209 sv_upgrade(sv, SVt_NV);
2214 sv_upgrade(sv, SVt_PVNV);
2223 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2227 (void)SvNOK_only(sv); /* validate number */
2232 =for apidoc sv_setnv_mg
2234 Like C<sv_setnv>, but also handles 'set' magic.
2240 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2246 /* Print an "isn't numeric" warning, using a cleaned-up,
2247 * printable version of the offending string
2251 S_not_a_number(pTHX_ SV *sv)
2258 dsv = sv_2mortal(newSVpv("", 0));
2259 pv = sv_uni_display(dsv, sv, 10, 0);
2262 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2263 /* each *s can expand to 4 chars + "...\0",
2264 i.e. need room for 8 chars */
2267 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2269 if (ch & 128 && !isPRINT_LC(ch)) {
2278 else if (ch == '\r') {
2282 else if (ch == '\f') {
2286 else if (ch == '\\') {
2290 else if (ch == '\0') {
2294 else if (isPRINT_LC(ch))
2311 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2312 "Argument \"%s\" isn't numeric in %s", pv,
2315 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2316 "Argument \"%s\" isn't numeric", pv);
2320 =for apidoc looks_like_number
2322 Test if the content of an SV looks like a number (or is a number).
2323 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2324 non-numeric warning), even if your atof() doesn't grok them.
2330 Perl_looks_like_number(pTHX_ SV *sv)
2332 register char *sbegin;
2339 else if (SvPOKp(sv))
2340 sbegin = SvPV(sv, len);
2342 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2343 return grok_number(sbegin, len, NULL);
2346 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2347 until proven guilty, assume that things are not that bad... */
2352 As 64 bit platforms often have an NV that doesn't preserve all bits of
2353 an IV (an assumption perl has been based on to date) it becomes necessary
2354 to remove the assumption that the NV always carries enough precision to
2355 recreate the IV whenever needed, and that the NV is the canonical form.
2356 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2357 precision as a side effect of conversion (which would lead to insanity
2358 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2359 1) to distinguish between IV/UV/NV slots that have cached a valid
2360 conversion where precision was lost and IV/UV/NV slots that have a
2361 valid conversion which has lost no precision
2362 2) to ensure that if a numeric conversion to one form is requested that
2363 would lose precision, the precise conversion (or differently
2364 imprecise conversion) is also performed and cached, to prevent
2365 requests for different numeric formats on the same SV causing
2366 lossy conversion chains. (lossless conversion chains are perfectly
2371 SvIOKp is true if the IV slot contains a valid value
2372 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2373 SvNOKp is true if the NV slot contains a valid value
2374 SvNOK is true only if the NV value is accurate
2377 while converting from PV to NV, check to see if converting that NV to an
2378 IV(or UV) would lose accuracy over a direct conversion from PV to
2379 IV(or UV). If it would, cache both conversions, return NV, but mark
2380 SV as IOK NOKp (ie not NOK).
2382 While converting from PV to IV, check to see if converting that IV to an
2383 NV would lose accuracy over a direct conversion from PV to NV. If it
2384 would, cache both conversions, flag similarly.
2386 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2387 correctly because if IV & NV were set NV *always* overruled.
2388 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2389 changes - now IV and NV together means that the two are interchangeable:
2390 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2392 The benefit of this is that operations such as pp_add know that if
2393 SvIOK is true for both left and right operands, then integer addition
2394 can be used instead of floating point (for cases where the result won't
2395 overflow). Before, floating point was always used, which could lead to
2396 loss of precision compared with integer addition.
2398 * making IV and NV equal status should make maths accurate on 64 bit
2400 * may speed up maths somewhat if pp_add and friends start to use
2401 integers when possible instead of fp. (Hopefully the overhead in
2402 looking for SvIOK and checking for overflow will not outweigh the
2403 fp to integer speedup)
2404 * will slow down integer operations (callers of SvIV) on "inaccurate"
2405 values, as the change from SvIOK to SvIOKp will cause a call into
2406 sv_2iv each time rather than a macro access direct to the IV slot
2407 * should speed up number->string conversion on integers as IV is
2408 favoured when IV and NV are equally accurate
2410 ####################################################################
2411 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2412 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2413 On the other hand, SvUOK is true iff UV.
2414 ####################################################################
2416 Your mileage will vary depending your CPU's relative fp to integer
2420 #ifndef NV_PRESERVES_UV
2421 # define IS_NUMBER_UNDERFLOW_IV 1
2422 # define IS_NUMBER_UNDERFLOW_UV 2
2423 # define IS_NUMBER_IV_AND_UV 2
2424 # define IS_NUMBER_OVERFLOW_IV 4
2425 # define IS_NUMBER_OVERFLOW_UV 5
2427 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2429 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2431 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2433 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));
2434 if (SvNVX(sv) < (NV)IV_MIN) {
2435 (void)SvIOKp_on(sv);
2437 SvIV_set(sv, IV_MIN);
2438 return IS_NUMBER_UNDERFLOW_IV;
2440 if (SvNVX(sv) > (NV)UV_MAX) {
2441 (void)SvIOKp_on(sv);
2444 SvUV_set(sv, UV_MAX);
2445 return IS_NUMBER_OVERFLOW_UV;
2447 (void)SvIOKp_on(sv);
2449 /* Can't use strtol etc to convert this string. (See truth table in
2451 if (SvNVX(sv) <= (UV)IV_MAX) {
2452 SvIV_set(sv, I_V(SvNVX(sv)));
2453 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2454 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2456 /* Integer is imprecise. NOK, IOKp */
2458 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2461 SvUV_set(sv, U_V(SvNVX(sv)));
2462 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2463 if (SvUVX(sv) == UV_MAX) {
2464 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2465 possibly be preserved by NV. Hence, it must be overflow.
2467 return IS_NUMBER_OVERFLOW_UV;
2469 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2471 /* Integer is imprecise. NOK, IOKp */
2473 return IS_NUMBER_OVERFLOW_IV;
2475 #endif /* !NV_PRESERVES_UV*/
2477 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2478 * this function provided for binary compatibility only
2482 Perl_sv_2iv(pTHX_ register SV *sv)
2484 return sv_2iv_flags(sv, SV_GMAGIC);
2488 =for apidoc sv_2iv_flags
2490 Return the integer value of an SV, doing any necessary string
2491 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2492 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2498 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2502 if (SvGMAGICAL(sv)) {
2503 if (flags & SV_GMAGIC)
2508 return I_V(SvNVX(sv));
2510 if (SvPOKp(sv) && SvLEN(sv))
2513 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2514 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2520 if (SvTHINKFIRST(sv)) {
2523 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2524 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2525 return SvIV(tmpstr);
2526 return PTR2IV(SvRV(sv));
2529 sv_force_normal_flags(sv, 0);
2531 if (SvREADONLY(sv) && !SvOK(sv)) {
2532 if (ckWARN(WARN_UNINITIALIZED))
2539 return (IV)(SvUVX(sv));
2546 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2547 * without also getting a cached IV/UV from it at the same time
2548 * (ie PV->NV conversion should detect loss of accuracy and cache
2549 * IV or UV at same time to avoid this. NWC */
2551 if (SvTYPE(sv) == SVt_NV)
2552 sv_upgrade(sv, SVt_PVNV);
2554 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2555 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2556 certainly cast into the IV range at IV_MAX, whereas the correct
2557 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2559 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2560 SvIV_set(sv, I_V(SvNVX(sv)));
2561 if (SvNVX(sv) == (NV) SvIVX(sv)
2562 #ifndef NV_PRESERVES_UV
2563 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2564 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2565 /* Don't flag it as "accurately an integer" if the number
2566 came from a (by definition imprecise) NV operation, and
2567 we're outside the range of NV integer precision */
2570 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2571 DEBUG_c(PerlIO_printf(Perl_debug_log,
2572 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2578 /* IV not precise. No need to convert from PV, as NV
2579 conversion would already have cached IV if it detected
2580 that PV->IV would be better than PV->NV->IV
2581 flags already correct - don't set public IOK. */
2582 DEBUG_c(PerlIO_printf(Perl_debug_log,
2583 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2588 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2589 but the cast (NV)IV_MIN rounds to a the value less (more
2590 negative) than IV_MIN which happens to be equal to SvNVX ??
2591 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2592 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2593 (NV)UVX == NVX are both true, but the values differ. :-(
2594 Hopefully for 2s complement IV_MIN is something like
2595 0x8000000000000000 which will be exact. NWC */
2598 SvUV_set(sv, U_V(SvNVX(sv)));
2600 (SvNVX(sv) == (NV) SvUVX(sv))
2601 #ifndef NV_PRESERVES_UV
2602 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2603 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2604 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2605 /* Don't flag it as "accurately an integer" if the number
2606 came from a (by definition imprecise) NV operation, and
2607 we're outside the range of NV integer precision */
2613 DEBUG_c(PerlIO_printf(Perl_debug_log,
2614 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2618 return (IV)SvUVX(sv);
2621 else if (SvPOKp(sv) && SvLEN(sv)) {
2623 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2624 /* We want to avoid a possible problem when we cache an IV which
2625 may be later translated to an NV, and the resulting NV is not
2626 the same as the direct translation of the initial string
2627 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2628 be careful to ensure that the value with the .456 is around if the
2629 NV value is requested in the future).
2631 This means that if we cache such an IV, we need to cache the
2632 NV as well. Moreover, we trade speed for space, and do not
2633 cache the NV if we are sure it's not needed.
2636 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2637 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2638 == IS_NUMBER_IN_UV) {
2639 /* It's definitely an integer, only upgrade to PVIV */
2640 if (SvTYPE(sv) < SVt_PVIV)
2641 sv_upgrade(sv, SVt_PVIV);
2643 } else if (SvTYPE(sv) < SVt_PVNV)
2644 sv_upgrade(sv, SVt_PVNV);
2646 /* If NV preserves UV then we only use the UV value if we know that
2647 we aren't going to call atof() below. If NVs don't preserve UVs
2648 then the value returned may have more precision than atof() will
2649 return, even though value isn't perfectly accurate. */
2650 if ((numtype & (IS_NUMBER_IN_UV
2651 #ifdef NV_PRESERVES_UV
2654 )) == IS_NUMBER_IN_UV) {
2655 /* This won't turn off the public IOK flag if it was set above */
2656 (void)SvIOKp_on(sv);
2658 if (!(numtype & IS_NUMBER_NEG)) {
2660 if (value <= (UV)IV_MAX) {
2661 SvIV_set(sv, (IV)value);
2663 SvUV_set(sv, value);
2667 /* 2s complement assumption */
2668 if (value <= (UV)IV_MIN) {
2669 SvIV_set(sv, -(IV)value);
2671 /* Too negative for an IV. This is a double upgrade, but
2672 I'm assuming it will be rare. */
2673 if (SvTYPE(sv) < SVt_PVNV)
2674 sv_upgrade(sv, SVt_PVNV);
2678 SvNV_set(sv, -(NV)value);
2679 SvIV_set(sv, IV_MIN);
2683 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2684 will be in the previous block to set the IV slot, and the next
2685 block to set the NV slot. So no else here. */
2687 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2688 != IS_NUMBER_IN_UV) {
2689 /* It wasn't an (integer that doesn't overflow the UV). */
2690 SvNV_set(sv, Atof(SvPVX(sv)));
2692 if (! numtype && ckWARN(WARN_NUMERIC))
2695 #if defined(USE_LONG_DOUBLE)
2696 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2697 PTR2UV(sv), SvNVX(sv)));
2699 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2700 PTR2UV(sv), SvNVX(sv)));
2704 #ifdef NV_PRESERVES_UV
2705 (void)SvIOKp_on(sv);
2707 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2708 SvIV_set(sv, I_V(SvNVX(sv)));
2709 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2712 /* Integer is imprecise. NOK, IOKp */
2714 /* UV will not work better than IV */
2716 if (SvNVX(sv) > (NV)UV_MAX) {
2718 /* Integer is inaccurate. NOK, IOKp, is UV */
2719 SvUV_set(sv, UV_MAX);
2722 SvUV_set(sv, U_V(SvNVX(sv)));
2723 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2724 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2728 /* Integer is imprecise. NOK, IOKp, is UV */
2734 #else /* NV_PRESERVES_UV */
2735 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2736 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2737 /* The IV slot will have been set from value returned by
2738 grok_number above. The NV slot has just been set using
2741 assert (SvIOKp(sv));
2743 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2744 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2745 /* Small enough to preserve all bits. */
2746 (void)SvIOKp_on(sv);
2748 SvIV_set(sv, I_V(SvNVX(sv)));
2749 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2751 /* Assumption: first non-preserved integer is < IV_MAX,
2752 this NV is in the preserved range, therefore: */
2753 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2755 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);
2759 0 0 already failed to read UV.
2760 0 1 already failed to read UV.
2761 1 0 you won't get here in this case. IV/UV
2762 slot set, public IOK, Atof() unneeded.
2763 1 1 already read UV.
2764 so there's no point in sv_2iuv_non_preserve() attempting
2765 to use atol, strtol, strtoul etc. */
2766 if (sv_2iuv_non_preserve (sv, numtype)
2767 >= IS_NUMBER_OVERFLOW_IV)
2771 #endif /* NV_PRESERVES_UV */
2774 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2776 if (SvTYPE(sv) < SVt_IV)
2777 /* Typically the caller expects that sv_any is not NULL now. */
2778 sv_upgrade(sv, SVt_IV);
2781 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2782 PTR2UV(sv),SvIVX(sv)));
2783 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2786 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2787 * this function provided for binary compatibility only
2791 Perl_sv_2uv(pTHX_ register SV *sv)
2793 return sv_2uv_flags(sv, SV_GMAGIC);
2797 =for apidoc sv_2uv_flags
2799 Return the unsigned integer value of an SV, doing any necessary string
2800 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2801 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2807 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2811 if (SvGMAGICAL(sv)) {
2812 if (flags & SV_GMAGIC)
2817 return U_V(SvNVX(sv));
2818 if (SvPOKp(sv) && SvLEN(sv))
2821 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2822 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2828 if (SvTHINKFIRST(sv)) {
2831 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2832 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2833 return SvUV(tmpstr);
2834 return PTR2UV(SvRV(sv));
2837 sv_force_normal_flags(sv, 0);
2839 if (SvREADONLY(sv) && !SvOK(sv)) {
2840 if (ckWARN(WARN_UNINITIALIZED))
2850 return (UV)SvIVX(sv);
2854 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2855 * without also getting a cached IV/UV from it at the same time
2856 * (ie PV->NV conversion should detect loss of accuracy and cache
2857 * IV or UV at same time to avoid this. */
2858 /* IV-over-UV optimisation - choose to cache IV if possible */
2860 if (SvTYPE(sv) == SVt_NV)
2861 sv_upgrade(sv, SVt_PVNV);
2863 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2864 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2865 SvIV_set(sv, I_V(SvNVX(sv)));
2866 if (SvNVX(sv) == (NV) SvIVX(sv)
2867 #ifndef NV_PRESERVES_UV
2868 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2869 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2870 /* Don't flag it as "accurately an integer" if the number
2871 came from a (by definition imprecise) NV operation, and
2872 we're outside the range of NV integer precision */
2875 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2876 DEBUG_c(PerlIO_printf(Perl_debug_log,
2877 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2883 /* IV not precise. No need to convert from PV, as NV
2884 conversion would already have cached IV if it detected
2885 that PV->IV would be better than PV->NV->IV
2886 flags already correct - don't set public IOK. */
2887 DEBUG_c(PerlIO_printf(Perl_debug_log,
2888 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2893 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2894 but the cast (NV)IV_MIN rounds to a the value less (more
2895 negative) than IV_MIN which happens to be equal to SvNVX ??
2896 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2897 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2898 (NV)UVX == NVX are both true, but the values differ. :-(
2899 Hopefully for 2s complement IV_MIN is something like
2900 0x8000000000000000 which will be exact. NWC */
2903 SvUV_set(sv, U_V(SvNVX(sv)));
2905 (SvNVX(sv) == (NV) SvUVX(sv))
2906 #ifndef NV_PRESERVES_UV
2907 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2908 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2909 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2910 /* Don't flag it as "accurately an integer" if the number
2911 came from a (by definition imprecise) NV operation, and
2912 we're outside the range of NV integer precision */
2917 DEBUG_c(PerlIO_printf(Perl_debug_log,
2918 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2924 else if (SvPOKp(sv) && SvLEN(sv)) {
2926 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2928 /* We want to avoid a possible problem when we cache a UV which
2929 may be later translated to an NV, and the resulting NV is not
2930 the translation of the initial data.
2932 This means that if we cache such a UV, we need to cache the
2933 NV as well. Moreover, we trade speed for space, and do not
2934 cache the NV if not needed.
2937 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2938 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2939 == IS_NUMBER_IN_UV) {
2940 /* It's definitely an integer, only upgrade to PVIV */
2941 if (SvTYPE(sv) < SVt_PVIV)
2942 sv_upgrade(sv, SVt_PVIV);
2944 } else if (SvTYPE(sv) < SVt_PVNV)
2945 sv_upgrade(sv, SVt_PVNV);
2947 /* If NV preserves UV then we only use the UV value if we know that
2948 we aren't going to call atof() below. If NVs don't preserve UVs
2949 then the value returned may have more precision than atof() will
2950 return, even though it isn't accurate. */
2951 if ((numtype & (IS_NUMBER_IN_UV
2952 #ifdef NV_PRESERVES_UV
2955 )) == IS_NUMBER_IN_UV) {
2956 /* This won't turn off the public IOK flag if it was set above */
2957 (void)SvIOKp_on(sv);
2959 if (!(numtype & IS_NUMBER_NEG)) {
2961 if (value <= (UV)IV_MAX) {
2962 SvIV_set(sv, (IV)value);
2964 /* it didn't overflow, and it was positive. */
2965 SvUV_set(sv, value);
2969 /* 2s complement assumption */
2970 if (value <= (UV)IV_MIN) {
2971 SvIV_set(sv, -(IV)value);
2973 /* Too negative for an IV. This is a double upgrade, but
2974 I'm assuming it will be rare. */
2975 if (SvTYPE(sv) < SVt_PVNV)
2976 sv_upgrade(sv, SVt_PVNV);
2980 SvNV_set(sv, -(NV)value);
2981 SvIV_set(sv, IV_MIN);
2986 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2987 != IS_NUMBER_IN_UV) {
2988 /* It wasn't an integer, or it overflowed the UV. */
2989 SvNV_set(sv, Atof(SvPVX(sv)));
2991 if (! numtype && ckWARN(WARN_NUMERIC))
2994 #if defined(USE_LONG_DOUBLE)
2995 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2996 PTR2UV(sv), SvNVX(sv)));
2998 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2999 PTR2UV(sv), SvNVX(sv)));
3002 #ifdef NV_PRESERVES_UV
3003 (void)SvIOKp_on(sv);
3005 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3006 SvIV_set(sv, I_V(SvNVX(sv)));
3007 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
3010 /* Integer is imprecise. NOK, IOKp */
3012 /* UV will not work better than IV */
3014 if (SvNVX(sv) > (NV)UV_MAX) {
3016 /* Integer is inaccurate. NOK, IOKp, is UV */
3017 SvUV_set(sv, UV_MAX);
3020 SvUV_set(sv, U_V(SvNVX(sv)));
3021 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3022 NV preservse UV so can do correct comparison. */
3023 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3027 /* Integer is imprecise. NOK, IOKp, is UV */
3032 #else /* NV_PRESERVES_UV */
3033 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3034 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3035 /* The UV slot will have been set from value returned by
3036 grok_number above. The NV slot has just been set using
3039 assert (SvIOKp(sv));
3041 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3042 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3043 /* Small enough to preserve all bits. */
3044 (void)SvIOKp_on(sv);
3046 SvIV_set(sv, I_V(SvNVX(sv)));
3047 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3049 /* Assumption: first non-preserved integer is < IV_MAX,
3050 this NV is in the preserved range, therefore: */
3051 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3053 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);
3056 sv_2iuv_non_preserve (sv, numtype);
3058 #endif /* NV_PRESERVES_UV */
3062 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3063 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3066 if (SvTYPE(sv) < SVt_IV)
3067 /* Typically the caller expects that sv_any is not NULL now. */
3068 sv_upgrade(sv, SVt_IV);
3072 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3073 PTR2UV(sv),SvUVX(sv)));
3074 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3080 Return the num value of an SV, doing any necessary string or integer
3081 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3088 Perl_sv_2nv(pTHX_ register SV *sv)
3092 if (SvGMAGICAL(sv)) {
3096 if (SvPOKp(sv) && SvLEN(sv)) {
3097 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3098 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
3100 return Atof(SvPVX(sv));
3104 return (NV)SvUVX(sv);
3106 return (NV)SvIVX(sv);
3109 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3110 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3116 if (SvTHINKFIRST(sv)) {
3119 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3120 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3121 return SvNV(tmpstr);
3122 return PTR2NV(SvRV(sv));
3125 sv_force_normal_flags(sv, 0);
3127 if (SvREADONLY(sv) && !SvOK(sv)) {
3128 if (ckWARN(WARN_UNINITIALIZED))
3133 if (SvTYPE(sv) < SVt_NV) {
3134 if (SvTYPE(sv) == SVt_IV)
3135 sv_upgrade(sv, SVt_PVNV);
3137 sv_upgrade(sv, SVt_NV);
3138 #ifdef USE_LONG_DOUBLE
3140 STORE_NUMERIC_LOCAL_SET_STANDARD();
3141 PerlIO_printf(Perl_debug_log,
3142 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3143 PTR2UV(sv), SvNVX(sv));
3144 RESTORE_NUMERIC_LOCAL();
3148 STORE_NUMERIC_LOCAL_SET_STANDARD();
3149 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3150 PTR2UV(sv), SvNVX(sv));
3151 RESTORE_NUMERIC_LOCAL();
3155 else if (SvTYPE(sv) < SVt_PVNV)
3156 sv_upgrade(sv, SVt_PVNV);
3161 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3162 #ifdef NV_PRESERVES_UV
3165 /* Only set the public NV OK flag if this NV preserves the IV */
3166 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3167 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3168 : (SvIVX(sv) == I_V(SvNVX(sv))))
3174 else if (SvPOKp(sv) && SvLEN(sv)) {
3176 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3177 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3179 #ifdef NV_PRESERVES_UV
3180 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3181 == IS_NUMBER_IN_UV) {
3182 /* It's definitely an integer */
3183 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3185 SvNV_set(sv, Atof(SvPVX(sv)));
3188 SvNV_set(sv, Atof(SvPVX(sv)));
3189 /* Only set the public NV OK flag if this NV preserves the value in
3190 the PV at least as well as an IV/UV would.
3191 Not sure how to do this 100% reliably. */
3192 /* if that shift count is out of range then Configure's test is
3193 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3195 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3196 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3197 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3198 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3199 /* Can't use strtol etc to convert this string, so don't try.
3200 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3203 /* value has been set. It may not be precise. */
3204 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3205 /* 2s complement assumption for (UV)IV_MIN */
3206 SvNOK_on(sv); /* Integer is too negative. */
3211 if (numtype & IS_NUMBER_NEG) {
3212 SvIV_set(sv, -(IV)value);
3213 } else if (value <= (UV)IV_MAX) {
3214 SvIV_set(sv, (IV)value);
3216 SvUV_set(sv, value);
3220 if (numtype & IS_NUMBER_NOT_INT) {
3221 /* I believe that even if the original PV had decimals,
3222 they are lost beyond the limit of the FP precision.
3223 However, neither is canonical, so both only get p
3224 flags. NWC, 2000/11/25 */
3225 /* Both already have p flags, so do nothing */
3228 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3229 if (SvIVX(sv) == I_V(nv)) {
3234 /* It had no "." so it must be integer. */
3237 /* between IV_MAX and NV(UV_MAX).
3238 Could be slightly > UV_MAX */
3240 if (numtype & IS_NUMBER_NOT_INT) {
3241 /* UV and NV both imprecise. */
3243 UV nv_as_uv = U_V(nv);
3245 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3256 #endif /* NV_PRESERVES_UV */
3259 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3261 if (SvTYPE(sv) < SVt_NV)
3262 /* Typically the caller expects that sv_any is not NULL now. */
3263 /* XXX Ilya implies that this is a bug in callers that assume this
3264 and ideally should be fixed. */
3265 sv_upgrade(sv, SVt_NV);
3268 #if defined(USE_LONG_DOUBLE)
3270 STORE_NUMERIC_LOCAL_SET_STANDARD();
3271 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3272 PTR2UV(sv), SvNVX(sv));
3273 RESTORE_NUMERIC_LOCAL();
3277 STORE_NUMERIC_LOCAL_SET_STANDARD();
3278 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3279 PTR2UV(sv), SvNVX(sv));
3280 RESTORE_NUMERIC_LOCAL();
3286 /* asIV(): extract an integer from the string value of an SV.
3287 * Caller must validate PVX */
3290 S_asIV(pTHX_ SV *sv)
3293 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3295 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3296 == IS_NUMBER_IN_UV) {
3297 /* It's definitely an integer */
3298 if (numtype & IS_NUMBER_NEG) {
3299 if (value < (UV)IV_MIN)
3302 if (value < (UV)IV_MAX)
3307 if (ckWARN(WARN_NUMERIC))
3310 return I_V(Atof(SvPVX(sv)));
3313 /* asUV(): extract an unsigned integer from the string value of an SV
3314 * Caller must validate PVX */
3317 S_asUV(pTHX_ SV *sv)
3320 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3322 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3323 == IS_NUMBER_IN_UV) {
3324 /* It's definitely an integer */
3325 if (!(numtype & IS_NUMBER_NEG))
3329 if (ckWARN(WARN_NUMERIC))
3332 return U_V(Atof(SvPVX(sv)));
3336 =for apidoc sv_2pv_nolen
3338 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3339 use the macro wrapper C<SvPV_nolen(sv)> instead.
3344 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3347 return sv_2pv(sv, &n_a);
3350 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3351 * UV as a string towards the end of buf, and return pointers to start and
3354 * We assume that buf is at least TYPE_CHARS(UV) long.
3358 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3360 char *ptr = buf + TYPE_CHARS(UV);
3374 *--ptr = '0' + (char)(uv % 10);
3382 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3383 * this function provided for binary compatibility only
3387 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3389 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3393 =for apidoc sv_2pv_flags
3395 Returns a pointer to the string value of an SV, and sets *lp to its length.
3396 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3398 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3399 usually end up here too.
3405 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3410 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3411 char *tmpbuf = tbuf;
3417 if (SvGMAGICAL(sv)) {
3418 if (flags & SV_GMAGIC)
3426 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3428 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3433 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3438 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3439 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3446 if (SvTHINKFIRST(sv)) {
3449 register const char *typestr;
3450 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3451 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3452 char *pv = SvPV(tmpstr, *lp);
3462 typestr = "NULLREF";
3466 switch (SvTYPE(sv)) {
3468 if ( ((SvFLAGS(sv) &
3469 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3470 == (SVs_OBJECT|SVs_SMG))
3471 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3472 const regexp *re = (regexp *)mg->mg_obj;
3475 const char *fptr = "msix";
3480 char need_newline = 0;
3481 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3483 while((ch = *fptr++)) {
3485 reflags[left++] = ch;
3488 reflags[right--] = ch;
3493 reflags[left] = '-';
3497 mg->mg_len = re->prelen + 4 + left;
3499 * If /x was used, we have to worry about a regex
3500 * ending with a comment later being embedded
3501 * within another regex. If so, we don't want this
3502 * regex's "commentization" to leak out to the
3503 * right part of the enclosing regex, we must cap
3504 * it with a newline.
3506 * So, if /x was used, we scan backwards from the
3507 * end of the regex. If we find a '#' before we
3508 * find a newline, we need to add a newline
3509 * ourself. If we find a '\n' first (or if we
3510 * don't find '#' or '\n'), we don't need to add
3511 * anything. -jfriedl
3513 if (PMf_EXTENDED & re->reganch)
3515 const char *endptr = re->precomp + re->prelen;
3516 while (endptr >= re->precomp)
3518 const char c = *(endptr--);
3520 break; /* don't need another */
3522 /* we end while in a comment, so we
3524 mg->mg_len++; /* save space for it */
3525 need_newline = 1; /* note to add it */
3531 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3532 Copy("(?", mg->mg_ptr, 2, char);
3533 Copy(reflags, mg->mg_ptr+2, left, char);
3534 Copy(":", mg->mg_ptr+left+2, 1, char);
3535 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3537 mg->mg_ptr[mg->mg_len - 2] = '\n';
3538 mg->mg_ptr[mg->mg_len - 1] = ')';
3539 mg->mg_ptr[mg->mg_len] = 0;
3541 PL_reginterp_cnt += re->program[0].next_off;
3543 if (re->reganch & ROPT_UTF8)
3558 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3559 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3560 /* tied lvalues should appear to be
3561 * scalars for backwards compatitbility */
3562 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3563 ? "SCALAR" : "LVALUE"; break;
3564 case SVt_PVAV: typestr = "ARRAY"; break;
3565 case SVt_PVHV: typestr = "HASH"; break;
3566 case SVt_PVCV: typestr = "CODE"; break;
3567 case SVt_PVGV: typestr = "GLOB"; break;
3568 case SVt_PVFM: typestr = "FORMAT"; break;
3569 case SVt_PVIO: typestr = "IO"; break;
3570 default: typestr = "UNKNOWN"; break;
3574 const char *name = HvNAME(SvSTASH(sv));
3575 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3576 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3579 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3582 *lp = strlen(typestr);
3583 return (char *)typestr;
3585 if (SvREADONLY(sv) && !SvOK(sv)) {
3586 if (ckWARN(WARN_UNINITIALIZED))
3592 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3593 /* I'm assuming that if both IV and NV are equally valid then
3594 converting the IV is going to be more efficient */
3595 const U32 isIOK = SvIOK(sv);
3596 const U32 isUIOK = SvIsUV(sv);
3597 char buf[TYPE_CHARS(UV)];
3600 if (SvTYPE(sv) < SVt_PVIV)
3601 sv_upgrade(sv, SVt_PVIV);
3603 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3605 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3606 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3607 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3608 SvCUR_set(sv, ebuf - ptr);
3618 else if (SvNOKp(sv)) {
3619 if (SvTYPE(sv) < SVt_PVNV)
3620 sv_upgrade(sv, SVt_PVNV);
3621 /* The +20 is pure guesswork. Configure test needed. --jhi */
3622 SvGROW(sv, NV_DIG + 20);
3624 olderrno = errno; /* some Xenix systems wipe out errno here */
3626 if (SvNVX(sv) == 0.0)
3627 (void)strcpy(s,"0");
3631 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3634 #ifdef FIXNEGATIVEZERO
3635 if (*s == '-' && s[1] == '0' && !s[2])
3645 if (ckWARN(WARN_UNINITIALIZED)
3646 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3649 if (SvTYPE(sv) < SVt_PV)
3650 /* Typically the caller expects that sv_any is not NULL now. */
3651 sv_upgrade(sv, SVt_PV);
3654 *lp = s - SvPVX(sv);
3657 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3658 PTR2UV(sv),SvPVX(sv)));
3662 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3663 /* Sneaky stuff here */
3667 tsv = newSVpv(tmpbuf, 0);
3684 len = strlen(tmpbuf);
3686 #ifdef FIXNEGATIVEZERO
3687 if (len == 2 && t[0] == '-' && t[1] == '0') {
3692 (void)SvUPGRADE(sv, SVt_PV);
3694 s = SvGROW(sv, len + 1);
3697 return strcpy(s, t);
3702 =for apidoc sv_copypv
3704 Copies a stringified representation of the source SV into the
3705 destination SV. Automatically performs any necessary mg_get and
3706 coercion of numeric values into strings. Guaranteed to preserve
3707 UTF-8 flag even from overloaded objects. Similar in nature to
3708 sv_2pv[_flags] but operates directly on an SV instead of just the
3709 string. Mostly uses sv_2pv_flags to do its work, except when that
3710 would lose the UTF-8'ness of the PV.
3716 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3721 sv_setpvn(dsv,s,len);
3729 =for apidoc sv_2pvbyte_nolen
3731 Return a pointer to the byte-encoded representation of the SV.
3732 May cause the SV to be downgraded from UTF-8 as a side-effect.
3734 Usually accessed via the C<SvPVbyte_nolen> macro.
3740 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3743 return sv_2pvbyte(sv, &n_a);
3747 =for apidoc sv_2pvbyte
3749 Return a pointer to the byte-encoded representation of the SV, and set *lp
3750 to its length. May cause the SV to be downgraded from UTF-8 as a
3753 Usually accessed via the C<SvPVbyte> macro.
3759 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3761 sv_utf8_downgrade(sv,0);
3762 return SvPV(sv,*lp);
3766 =for apidoc sv_2pvutf8_nolen
3768 Return a pointer to the UTF-8-encoded representation of the SV.
3769 May cause the SV to be upgraded to UTF-8 as a side-effect.
3771 Usually accessed via the C<SvPVutf8_nolen> macro.
3777 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3780 return sv_2pvutf8(sv, &n_a);
3784 =for apidoc sv_2pvutf8
3786 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3787 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3789 Usually accessed via the C<SvPVutf8> macro.
3795 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3797 sv_utf8_upgrade(sv);
3798 return SvPV(sv,*lp);
3802 =for apidoc sv_2bool
3804 This function is only called on magical items, and is only used by
3805 sv_true() or its macro equivalent.
3811 Perl_sv_2bool(pTHX_ register SV *sv)
3820 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3821 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3822 return (bool)SvTRUE(tmpsv);
3823 return SvRV(sv) != 0;
3826 register XPV* Xpvtmp;
3827 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3828 (*Xpvtmp->xpv_pv > '0' ||
3829 Xpvtmp->xpv_cur > 1 ||
3830 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3837 return SvIVX(sv) != 0;
3840 return SvNVX(sv) != 0.0;
3847 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3848 * this function provided for binary compatibility only
3853 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3855 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3859 =for apidoc sv_utf8_upgrade
3861 Converts the PV of an SV to its UTF-8-encoded form.
3862 Forces the SV to string form if it is not already.
3863 Always sets the SvUTF8 flag to avoid future validity checks even
3864 if all the bytes have hibit clear.
3866 This is not as a general purpose byte encoding to Unicode interface:
3867 use the Encode extension for that.
3869 =for apidoc sv_utf8_upgrade_flags
3871 Converts the PV of an SV to its UTF-8-encoded form.
3872 Forces the SV to string form if it is not already.
3873 Always sets the SvUTF8 flag to avoid future validity checks even
3874 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3875 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3876 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3878 This is not as a general purpose byte encoding to Unicode interface:
3879 use the Encode extension for that.
3885 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3890 if (sv == &PL_sv_undef)
3894 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3895 (void) sv_2pv_flags(sv,&len, flags);
3899 (void) SvPV_force(sv,len);
3908 sv_force_normal_flags(sv, 0);
3911 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3912 sv_recode_to_utf8(sv, PL_encoding);
3913 else { /* Assume Latin-1/EBCDIC */
3914 /* This function could be much more efficient if we
3915 * had a FLAG in SVs to signal if there are any hibit
3916 * chars in the PV. Given that there isn't such a flag
3917 * make the loop as fast as possible. */
3918 s = (U8 *) SvPVX(sv);
3919 e = (U8 *) SvEND(sv);
3923 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3928 (void)SvOOK_off(sv);
3930 len = SvCUR(sv) + 1; /* Plus the \0 */
3931 SvPV_set(sv, (char*)bytes_to_utf8((U8*)s, &len));
3932 SvCUR_set(sv, len - 1);
3934 Safefree(s); /* No longer using what was there before. */
3935 SvLEN_set(sv, len); /* No longer know the real size. */
3937 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3944 =for apidoc sv_utf8_downgrade
3946 Attempts to convert the PV of an SV from characters to bytes.
3947 If the PV contains a character beyond byte, this conversion will fail;
3948 in this case, either returns false or, if C<fail_ok> is not
3951 This is not as a general purpose Unicode to byte encoding interface:
3952 use the Encode extension for that.
3958 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3960 if (SvPOKp(sv) && SvUTF8(sv)) {
3966 sv_force_normal_flags(sv, 0);
3968 s = (U8 *) SvPV(sv, len);
3969 if (!utf8_to_bytes(s, &len)) {
3974 Perl_croak(aTHX_ "Wide character in %s",
3977 Perl_croak(aTHX_ "Wide character");
3988 =for apidoc sv_utf8_encode
3990 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3991 flag off so that it looks like octets again.
3997 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3999 (void) sv_utf8_upgrade(sv);
4001 sv_force_normal_flags(sv, 0);
4003 if (SvREADONLY(sv)) {
4004 Perl_croak(aTHX_ PL_no_modify);
4010 =for apidoc sv_utf8_decode
4012 If the PV of the SV is an octet sequence in UTF-8
4013 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
4014 so that it looks like a character. If the PV contains only single-byte
4015 characters, the C<SvUTF8> flag stays being off.
4016 Scans PV for validity and returns false if the PV is invalid UTF-8.
4022 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4028 /* The octets may have got themselves encoded - get them back as
4031 if (!sv_utf8_downgrade(sv, TRUE))
4034 /* it is actually just a matter of turning the utf8 flag on, but
4035 * we want to make sure everything inside is valid utf8 first.
4037 c = (U8 *) SvPVX(sv);
4038 if (!is_utf8_string(c, SvCUR(sv)+1))
4040 e = (U8 *) SvEND(sv);
4043 if (!UTF8_IS_INVARIANT(ch)) {
4052 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4053 * this function provided for binary compatibility only
4057 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4059 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4063 =for apidoc sv_setsv
4065 Copies the contents of the source SV C<ssv> into the destination SV
4066 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4067 function if the source SV needs to be reused. Does not handle 'set' magic.
4068 Loosely speaking, it performs a copy-by-value, obliterating any previous
4069 content of the destination.
4071 You probably want to use one of the assortment of wrappers, such as
4072 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4073 C<SvSetMagicSV_nosteal>.
4075 =for apidoc sv_setsv_flags
4077 Copies the contents of the source SV C<ssv> into the destination SV
4078 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4079 function if the source SV needs to be reused. Does not handle 'set' magic.
4080 Loosely speaking, it performs a copy-by-value, obliterating any previous
4081 content of the destination.
4082 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4083 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4084 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4085 and C<sv_setsv_nomg> are implemented in terms of this function.
4087 You probably want to use one of the assortment of wrappers, such as
4088 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4089 C<SvSetMagicSV_nosteal>.
4091 This is the primary function for copying scalars, and most other
4092 copy-ish functions and macros use this underneath.
4098 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4100 register U32 sflags;
4106 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4108 sstr = &PL_sv_undef;
4109 stype = SvTYPE(sstr);
4110 dtype = SvTYPE(dstr);
4115 /* need to nuke the magic */
4117 SvRMAGICAL_off(dstr);
4120 /* There's a lot of redundancy below but we're going for speed here */
4125 if (dtype != SVt_PVGV) {
4126 (void)SvOK_off(dstr);
4134 sv_upgrade(dstr, SVt_IV);
4137 sv_upgrade(dstr, SVt_PVNV);
4141 sv_upgrade(dstr, SVt_PVIV);
4144 (void)SvIOK_only(dstr);
4145 SvIV_set(dstr, SvIVX(sstr));
4148 if (SvTAINTED(sstr))
4159 sv_upgrade(dstr, SVt_NV);
4164 sv_upgrade(dstr, SVt_PVNV);
4167 SvNV_set(dstr, SvNVX(sstr));
4168 (void)SvNOK_only(dstr);
4169 if (SvTAINTED(sstr))
4177 sv_upgrade(dstr, SVt_RV);
4178 else if (dtype == SVt_PVGV &&
4179 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4182 if (GvIMPORTED(dstr) != GVf_IMPORTED
4183 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4185 GvIMPORTED_on(dstr);
4194 #ifdef PERL_COPY_ON_WRITE
4195 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4196 if (dtype < SVt_PVIV)
4197 sv_upgrade(dstr, SVt_PVIV);
4204 sv_upgrade(dstr, SVt_PV);
4207 if (dtype < SVt_PVIV)
4208 sv_upgrade(dstr, SVt_PVIV);
4211 if (dtype < SVt_PVNV)
4212 sv_upgrade(dstr, SVt_PVNV);
4219 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
4222 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
4226 if (dtype <= SVt_PVGV) {
4228 if (dtype != SVt_PVGV) {
4229 char *name = GvNAME(sstr);
4230 STRLEN len = GvNAMELEN(sstr);
4231 /* don't upgrade SVt_PVLV: it can hold a glob */
4232 if (dtype != SVt_PVLV)
4233 sv_upgrade(dstr, SVt_PVGV);
4234 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4235 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4236 GvNAME(dstr) = savepvn(name, len);
4237 GvNAMELEN(dstr) = len;
4238 SvFAKE_on(dstr); /* can coerce to non-glob */
4240 /* ahem, death to those who redefine active sort subs */
4241 else if (PL_curstackinfo->si_type == PERLSI_SORT
4242 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4243 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4246 #ifdef GV_UNIQUE_CHECK
4247 if (GvUNIQUE((GV*)dstr)) {
4248 Perl_croak(aTHX_ PL_no_modify);
4252 (void)SvOK_off(dstr);
4253 GvINTRO_off(dstr); /* one-shot flag */
4255 GvGP(dstr) = gp_ref(GvGP(sstr));
4256 if (SvTAINTED(sstr))
4258 if (GvIMPORTED(dstr) != GVf_IMPORTED
4259 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4261 GvIMPORTED_on(dstr);
4269 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4271 if ((int)SvTYPE(sstr) != stype) {
4272 stype = SvTYPE(sstr);
4273 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4277 if (stype == SVt_PVLV)
4278 (void)SvUPGRADE(dstr, SVt_PVNV);
4280 (void)SvUPGRADE(dstr, (U32)stype);
4283 sflags = SvFLAGS(sstr);
4285 if (sflags & SVf_ROK) {
4286 if (dtype >= SVt_PV) {
4287 if (dtype == SVt_PVGV) {
4288 SV *sref = SvREFCNT_inc(SvRV(sstr));
4290 int intro = GvINTRO(dstr);
4292 #ifdef GV_UNIQUE_CHECK
4293 if (GvUNIQUE((GV*)dstr)) {
4294 Perl_croak(aTHX_ PL_no_modify);
4299 GvINTRO_off(dstr); /* one-shot flag */
4300 GvLINE(dstr) = CopLINE(PL_curcop);
4301 GvEGV(dstr) = (GV*)dstr;
4304 switch (SvTYPE(sref)) {
4307 SAVEGENERICSV(GvAV(dstr));
4309 dref = (SV*)GvAV(dstr);
4310 GvAV(dstr) = (AV*)sref;
4311 if (!GvIMPORTED_AV(dstr)
4312 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4314 GvIMPORTED_AV_on(dstr);
4319 SAVEGENERICSV(GvHV(dstr));
4321 dref = (SV*)GvHV(dstr);
4322 GvHV(dstr) = (HV*)sref;
4323 if (!GvIMPORTED_HV(dstr)
4324 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4326 GvIMPORTED_HV_on(dstr);
4331 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4332 SvREFCNT_dec(GvCV(dstr));
4333 GvCV(dstr) = Nullcv;
4334 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4335 PL_sub_generation++;
4337 SAVEGENERICSV(GvCV(dstr));
4340 dref = (SV*)GvCV(dstr);
4341 if (GvCV(dstr) != (CV*)sref) {
4342 CV* cv = GvCV(dstr);
4344 if (!GvCVGEN((GV*)dstr) &&
4345 (CvROOT(cv) || CvXSUB(cv)))
4347 /* ahem, death to those who redefine
4348 * active sort subs */
4349 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4350 PL_sortcop == CvSTART(cv))
4352 "Can't redefine active sort subroutine %s",
4353 GvENAME((GV*)dstr));
4354 /* Redefining a sub - warning is mandatory if
4355 it was a const and its value changed. */
4356 if (ckWARN(WARN_REDEFINE)
4358 && (!CvCONST((CV*)sref)
4359 || sv_cmp(cv_const_sv(cv),
4360 cv_const_sv((CV*)sref)))))
4362 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4364 ? "Constant subroutine %s::%s redefined"
4365 : "Subroutine %s::%s redefined",
4366 HvNAME(GvSTASH((GV*)dstr)),
4367 GvENAME((GV*)dstr));
4371 cv_ckproto(cv, (GV*)dstr,
4372 SvPOK(sref) ? SvPVX(sref) : Nullch);
4374 GvCV(dstr) = (CV*)sref;
4375 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4376 GvASSUMECV_on(dstr);
4377 PL_sub_generation++;
4379 if (!GvIMPORTED_CV(dstr)
4380 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4382 GvIMPORTED_CV_on(dstr);
4387 SAVEGENERICSV(GvIOp(dstr));
4389 dref = (SV*)GvIOp(dstr);
4390 GvIOp(dstr) = (IO*)sref;
4394 SAVEGENERICSV(GvFORM(dstr));
4396 dref = (SV*)GvFORM(dstr);
4397 GvFORM(dstr) = (CV*)sref;
4401 SAVEGENERICSV(GvSV(dstr));
4403 dref = (SV*)GvSV(dstr);
4405 if (!GvIMPORTED_SV(dstr)
4406 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4408 GvIMPORTED_SV_on(dstr);
4414 if (SvTAINTED(sstr))
4420 /* Unwrap the OOK offset by hand, to save a needless
4421 memmove on memory that's about to be free()d. */
4422 char *pv = SvPVX(dstr);
4425 SvFLAGS(dstr) &= ~SVf_OOK;
4433 (void)SvOK_off(dstr);
4434 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4436 if (sflags & SVp_NOK) {
4438 /* Only set the public OK flag if the source has public OK. */
4439 if (sflags & SVf_NOK)
4440 SvFLAGS(dstr) |= SVf_NOK;
4441 SvNV_set(dstr, SvNVX(sstr));
4443 if (sflags & SVp_IOK) {
4444 (void)SvIOKp_on(dstr);
4445 if (sflags & SVf_IOK)
4446 SvFLAGS(dstr) |= SVf_IOK;
4447 if (sflags & SVf_IVisUV)
4449 SvIV_set(dstr, SvIVX(sstr));
4451 if (SvAMAGIC(sstr)) {
4455 else if (sflags & SVp_POK) {
4459 * Check to see if we can just swipe the string. If so, it's a
4460 * possible small lose on short strings, but a big win on long ones.
4461 * It might even be a win on short strings if SvPVX(dstr)
4462 * has to be allocated and SvPVX(sstr) has to be freed.
4465 /* Whichever path we take through the next code, we want this true,
4466 and doing it now facilitates the COW check. */
4467 (void)SvPOK_only(dstr);
4470 #ifdef PERL_COPY_ON_WRITE
4471 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4475 (sflags & SVs_TEMP) && /* slated for free anyway? */
4476 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4477 (!(flags & SV_NOSTEAL)) &&
4478 /* and we're allowed to steal temps */
4479 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4480 SvLEN(sstr) && /* and really is a string */
4481 /* and won't be needed again, potentially */
4482 !(PL_op && PL_op->op_type == OP_AASSIGN))
4483 #ifdef PERL_COPY_ON_WRITE
4484 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4485 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4486 && SvTYPE(sstr) >= SVt_PVIV)
4489 /* Failed the swipe test, and it's not a shared hash key either.
4490 Have to copy the string. */
4491 STRLEN len = SvCUR(sstr);
4492 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4493 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4494 SvCUR_set(dstr, len);
4495 *SvEND(dstr) = '\0';
4497 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4499 #ifdef PERL_COPY_ON_WRITE
4500 /* Either it's a shared hash key, or it's suitable for
4501 copy-on-write or we can swipe the string. */
4503 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4508 /* I believe I should acquire a global SV mutex if
4509 it's a COW sv (not a shared hash key) to stop
4510 it going un copy-on-write.
4511 If the source SV has gone un copy on write between up there
4512 and down here, then (assert() that) it is of the correct
4513 form to make it copy on write again */
4514 if ((sflags & (SVf_FAKE | SVf_READONLY))
4515 != (SVf_FAKE | SVf_READONLY)) {
4516 SvREADONLY_on(sstr);
4518 /* Make the source SV into a loop of 1.
4519 (about to become 2) */
4520 SV_COW_NEXT_SV_SET(sstr, sstr);
4524 /* Initial code is common. */
4525 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4527 SvFLAGS(dstr) &= ~SVf_OOK;
4528 Safefree(SvPVX(dstr) - SvIVX(dstr));
4530 else if (SvLEN(dstr))
4531 Safefree(SvPVX(dstr));
4534 #ifdef PERL_COPY_ON_WRITE
4536 /* making another shared SV. */
4537 STRLEN cur = SvCUR(sstr);
4538 STRLEN len = SvLEN(sstr);
4539 assert (SvTYPE(dstr) >= SVt_PVIV);
4541 /* SvIsCOW_normal */
4542 /* splice us in between source and next-after-source. */
4543 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4544 SV_COW_NEXT_SV_SET(sstr, dstr);
4545 SvPV_set(dstr, SvPVX(sstr));
4547 /* SvIsCOW_shared_hash */
4548 UV hash = SvUVX(sstr);
4549 DEBUG_C(PerlIO_printf(Perl_debug_log,
4550 "Copy on write: Sharing hash\n"));
4552 sharepvn(SvPVX(sstr),
4553 (sflags & SVf_UTF8?-cur:cur), hash));
4554 SvUV_set(dstr, hash);
4556 SvLEN_set(dstr, len);
4557 SvCUR_set(dstr, cur);
4558 SvREADONLY_on(dstr);
4560 /* Relesase a global SV mutex. */
4564 { /* Passes the swipe test. */
4565 SvPV_set(dstr, SvPVX(sstr));
4566 SvLEN_set(dstr, SvLEN(sstr));
4567 SvCUR_set(dstr, SvCUR(sstr));
4570 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4571 SvPV_set(sstr, Nullch);
4577 if (sflags & SVf_UTF8)
4580 if (sflags & SVp_NOK) {
4582 if (sflags & SVf_NOK)
4583 SvFLAGS(dstr) |= SVf_NOK;
4584 SvNV_set(dstr, SvNVX(sstr));
4586 if (sflags & SVp_IOK) {
4587 (void)SvIOKp_on(dstr);
4588 if (sflags & SVf_IOK)
4589 SvFLAGS(dstr) |= SVf_IOK;
4590 if (sflags & SVf_IVisUV)
4592 SvIV_set(dstr, SvIVX(sstr));
4595 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4596 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4597 smg->mg_ptr, smg->mg_len);
4598 SvRMAGICAL_on(dstr);
4601 else if (sflags & SVp_IOK) {
4602 if (sflags & SVf_IOK)
4603 (void)SvIOK_only(dstr);
4605 (void)SvOK_off(dstr);
4606 (void)SvIOKp_on(dstr);
4608 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4609 if (sflags & SVf_IVisUV)
4611 SvIV_set(dstr, SvIVX(sstr));
4612 if (sflags & SVp_NOK) {
4613 if (sflags & SVf_NOK)
4614 (void)SvNOK_on(dstr);
4616 (void)SvNOKp_on(dstr);
4617 SvNV_set(dstr, SvNVX(sstr));
4620 else if (sflags & SVp_NOK) {
4621 if (sflags & SVf_NOK)
4622 (void)SvNOK_only(dstr);
4624 (void)SvOK_off(dstr);
4627 SvNV_set(dstr, SvNVX(sstr));
4630 if (dtype == SVt_PVGV) {
4631 if (ckWARN(WARN_MISC))
4632 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4635 (void)SvOK_off(dstr);
4637 if (SvTAINTED(sstr))
4642 =for apidoc sv_setsv_mg
4644 Like C<sv_setsv>, but also handles 'set' magic.
4650 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4652 sv_setsv(dstr,sstr);
4656 #ifdef PERL_COPY_ON_WRITE
4658 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4660 STRLEN cur = SvCUR(sstr);
4661 STRLEN len = SvLEN(sstr);
4662 register char *new_pv;
4665 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4673 if (SvTHINKFIRST(dstr))
4674 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4675 else if (SvPVX(dstr))
4676 Safefree(SvPVX(dstr));
4680 (void)SvUPGRADE (dstr, SVt_PVIV);
4682 assert (SvPOK(sstr));
4683 assert (SvPOKp(sstr));
4684 assert (!SvIOK(sstr));
4685 assert (!SvIOKp(sstr));
4686 assert (!SvNOK(sstr));
4687 assert (!SvNOKp(sstr));
4689 if (SvIsCOW(sstr)) {
4691 if (SvLEN(sstr) == 0) {
4692 /* source is a COW shared hash key. */
4693 UV hash = SvUVX(sstr);
4694 DEBUG_C(PerlIO_printf(Perl_debug_log,
4695 "Fast copy on write: Sharing hash\n"));
4696 SvUV_set(dstr, hash);
4697 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4700 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4702 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4703 (void)SvUPGRADE (sstr, SVt_PVIV);
4704 SvREADONLY_on(sstr);
4706 DEBUG_C(PerlIO_printf(Perl_debug_log,
4707 "Fast copy on write: Converting sstr to COW\n"));
4708 SV_COW_NEXT_SV_SET(dstr, sstr);
4710 SV_COW_NEXT_SV_SET(sstr, dstr);
4711 new_pv = SvPVX(sstr);
4714 SvPV_set(dstr, new_pv);
4715 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4718 SvLEN_set(dstr, len);
4719 SvCUR_set(dstr, cur);
4728 =for apidoc sv_setpvn
4730 Copies a string into an SV. The C<len> parameter indicates the number of
4731 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4732 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4738 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4740 register char *dptr;
4742 SV_CHECK_THINKFIRST_COW_DROP(sv);
4748 /* len is STRLEN which is unsigned, need to copy to signed */
4751 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4753 (void)SvUPGRADE(sv, SVt_PV);
4755 SvGROW(sv, len + 1);
4757 Move(ptr,dptr,len,char);
4760 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4765 =for apidoc sv_setpvn_mg
4767 Like C<sv_setpvn>, but also handles 'set' magic.
4773 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4775 sv_setpvn(sv,ptr,len);
4780 =for apidoc sv_setpv
4782 Copies a string into an SV. The string must be null-terminated. Does not
4783 handle 'set' magic. See C<sv_setpv_mg>.
4789 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4791 register STRLEN len;
4793 SV_CHECK_THINKFIRST_COW_DROP(sv);
4799 (void)SvUPGRADE(sv, SVt_PV);
4801 SvGROW(sv, len + 1);
4802 Move(ptr,SvPVX(sv),len+1,char);
4804 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4809 =for apidoc sv_setpv_mg
4811 Like C<sv_setpv>, but also handles 'set' magic.
4817 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4824 =for apidoc sv_usepvn
4826 Tells an SV to use C<ptr> to find its string value. Normally the string is
4827 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4828 The C<ptr> should point to memory that was allocated by C<malloc>. The
4829 string length, C<len>, must be supplied. This function will realloc the
4830 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4831 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4832 See C<sv_usepvn_mg>.
4838 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4840 SV_CHECK_THINKFIRST_COW_DROP(sv);
4841 (void)SvUPGRADE(sv, SVt_PV);
4846 (void)SvOOK_off(sv);
4847 if (SvPVX(sv) && SvLEN(sv))
4848 Safefree(SvPVX(sv));
4849 Renew(ptr, len+1, char);
4852 SvLEN_set(sv, len+1);
4854 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4859 =for apidoc sv_usepvn_mg
4861 Like C<sv_usepvn>, but also handles 'set' magic.
4867 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4869 sv_usepvn(sv,ptr,len);
4873 #ifdef PERL_COPY_ON_WRITE
4874 /* Need to do this *after* making the SV normal, as we need the buffer
4875 pointer to remain valid until after we've copied it. If we let go too early,
4876 another thread could invalidate it by unsharing last of the same hash key
4877 (which it can do by means other than releasing copy-on-write Svs)
4878 or by changing the other copy-on-write SVs in the loop. */
4880 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4881 U32 hash, SV *after)
4883 if (len) { /* this SV was SvIsCOW_normal(sv) */
4884 /* we need to find the SV pointing to us. */
4885 SV *current = SV_COW_NEXT_SV(after);
4887 if (current == sv) {
4888 /* The SV we point to points back to us (there were only two of us
4890 Hence other SV is no longer copy on write either. */
4892 SvREADONLY_off(after);
4894 /* We need to follow the pointers around the loop. */
4896 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4899 /* don't loop forever if the structure is bust, and we have
4900 a pointer into a closed loop. */
4901 assert (current != after);
4902 assert (SvPVX(current) == pvx);
4904 /* Make the SV before us point to the SV after us. */
4905 SV_COW_NEXT_SV_SET(current, after);
4908 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4913 Perl_sv_release_IVX(pTHX_ register SV *sv)
4916 sv_force_normal_flags(sv, 0);
4922 =for apidoc sv_force_normal_flags
4924 Undo various types of fakery on an SV: if the PV is a shared string, make
4925 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4926 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4927 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4928 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4929 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4930 set to some other value.) In addition, the C<flags> parameter gets passed to
4931 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4932 with flags set to 0.
4938 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4940 #ifdef PERL_COPY_ON_WRITE
4941 if (SvREADONLY(sv)) {
4942 /* At this point I believe I should acquire a global SV mutex. */
4944 char *pvx = SvPVX(sv);
4945 STRLEN len = SvLEN(sv);
4946 STRLEN cur = SvCUR(sv);
4947 U32 hash = SvUVX(sv);
4948 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4950 PerlIO_printf(Perl_debug_log,
4951 "Copy on write: Force normal %ld\n",
4957 /* This SV doesn't own the buffer, so need to New() a new one: */
4958 SvPV_set(sv, (char*)0);
4960 if (flags & SV_COW_DROP_PV) {
4961 /* OK, so we don't need to copy our buffer. */
4964 SvGROW(sv, cur + 1);
4965 Move(pvx,SvPVX(sv),cur,char);
4969 sv_release_COW(sv, pvx, cur, len, hash, next);
4974 else if (IN_PERL_RUNTIME)
4975 Perl_croak(aTHX_ PL_no_modify);
4976 /* At this point I believe that I can drop the global SV mutex. */
4979 if (SvREADONLY(sv)) {
4981 char *pvx = SvPVX(sv);
4982 int is_utf8 = SvUTF8(sv);
4983 STRLEN len = SvCUR(sv);
4984 U32 hash = SvUVX(sv);
4987 SvPV_set(sv, (char*)0);
4989 SvGROW(sv, len + 1);
4990 Move(pvx,SvPVX(sv),len,char);
4992 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4994 else if (IN_PERL_RUNTIME)
4995 Perl_croak(aTHX_ PL_no_modify);
4999 sv_unref_flags(sv, flags);
5000 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
5005 =for apidoc sv_force_normal
5007 Undo various types of fakery on an SV: if the PV is a shared string, make
5008 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
5009 an xpvmg. See also C<sv_force_normal_flags>.
5015 Perl_sv_force_normal(pTHX_ register SV *sv)
5017 sv_force_normal_flags(sv, 0);
5023 Efficient removal of characters from the beginning of the string buffer.
5024 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5025 the string buffer. The C<ptr> becomes the first character of the adjusted
5026 string. Uses the "OOK hack".
5027 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
5028 refer to the same chunk of data.
5034 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
5036 register STRLEN delta;
5037 if (!ptr || !SvPOKp(sv))
5039 delta = ptr - SvPVX(sv);
5040 SV_CHECK_THINKFIRST(sv);
5041 if (SvTYPE(sv) < SVt_PVIV)
5042 sv_upgrade(sv,SVt_PVIV);
5045 if (!SvLEN(sv)) { /* make copy of shared string */
5046 char *pvx = SvPVX(sv);
5047 STRLEN len = SvCUR(sv);
5048 SvGROW(sv, len + 1);
5049 Move(pvx,SvPVX(sv),len,char);
5053 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5054 and we do that anyway inside the SvNIOK_off
5056 SvFLAGS(sv) |= SVf_OOK;
5059 SvLEN_set(sv, SvLEN(sv) - delta);
5060 SvCUR_set(sv, SvCUR(sv) - delta);
5061 SvPV_set(sv, SvPVX(sv) + delta);
5062 SvIV_set(sv, SvIVX(sv) + delta);
5065 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5066 * this function provided for binary compatibility only
5070 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5072 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5076 =for apidoc sv_catpvn
5078 Concatenates the string onto the end of the string which is in the SV. The
5079 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5080 status set, then the bytes appended should be valid UTF-8.
5081 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5083 =for apidoc sv_catpvn_flags
5085 Concatenates the string onto the end of the string which is in the SV. The
5086 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5087 status set, then the bytes appended should be valid UTF-8.
5088 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5089 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5090 in terms of this function.
5096 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5101 dstr = SvPV_force_flags(dsv, dlen, flags);
5102 SvGROW(dsv, dlen + slen + 1);
5105 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5106 SvCUR_set(dsv, SvCUR(dsv) + slen);
5108 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5113 =for apidoc sv_catpvn_mg
5115 Like C<sv_catpvn>, but also handles 'set' magic.
5121 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5123 sv_catpvn(sv,ptr,len);
5127 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5128 * this function provided for binary compatibility only
5132 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5134 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5138 =for apidoc sv_catsv
5140 Concatenates the string from SV C<ssv> onto the end of the string in
5141 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5142 not 'set' magic. See C<sv_catsv_mg>.
5144 =for apidoc sv_catsv_flags
5146 Concatenates the string from SV C<ssv> onto the end of the string in
5147 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5148 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5149 and C<sv_catsv_nomg> are implemented in terms of this function.
5154 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5160 if ((spv = SvPV(ssv, slen))) {
5161 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5162 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5163 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5164 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5165 dsv->sv_flags doesn't have that bit set.
5166 Andy Dougherty 12 Oct 2001
5168 I32 sutf8 = DO_UTF8(ssv);
5171 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5173 dutf8 = DO_UTF8(dsv);
5175 if (dutf8 != sutf8) {
5177 /* Not modifying source SV, so taking a temporary copy. */
5178 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5180 sv_utf8_upgrade(csv);
5181 spv = SvPV(csv, slen);
5184 sv_utf8_upgrade_nomg(dsv);
5186 sv_catpvn_nomg(dsv, spv, slen);
5191 =for apidoc sv_catsv_mg
5193 Like C<sv_catsv>, but also handles 'set' magic.
5199 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5206 =for apidoc sv_catpv
5208 Concatenates the string onto the end of the string which is in the SV.
5209 If the SV has the UTF-8 status set, then the bytes appended should be
5210 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5215 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5217 register STRLEN len;
5223 junk = SvPV_force(sv, tlen);
5225 SvGROW(sv, tlen + len + 1);
5228 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5229 SvCUR_set(sv, SvCUR(sv) + len);
5230 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5235 =for apidoc sv_catpv_mg
5237 Like C<sv_catpv>, but also handles 'set' magic.
5243 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5252 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5253 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5260 Perl_newSV(pTHX_ STRLEN len)
5266 sv_upgrade(sv, SVt_PV);
5267 SvGROW(sv, len + 1);
5272 =for apidoc sv_magicext
5274 Adds magic to an SV, upgrading it if necessary. Applies the
5275 supplied vtable and returns a pointer to the magic added.
5277 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5278 In particular, you can add magic to SvREADONLY SVs, and add more than
5279 one instance of the same 'how'.
5281 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5282 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5283 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5284 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5286 (This is now used as a subroutine by C<sv_magic>.)
5291 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5292 const char* name, I32 namlen)
5296 if (SvTYPE(sv) < SVt_PVMG) {
5297 (void)SvUPGRADE(sv, SVt_PVMG);
5299 Newz(702,mg, 1, MAGIC);
5300 mg->mg_moremagic = SvMAGIC(sv);
5301 SvMAGIC_set(sv, mg);
5303 /* Sometimes a magic contains a reference loop, where the sv and
5304 object refer to each other. To prevent a reference loop that
5305 would prevent such objects being freed, we look for such loops
5306 and if we find one we avoid incrementing the object refcount.
5308 Note we cannot do this to avoid self-tie loops as intervening RV must
5309 have its REFCNT incremented to keep it in existence.
5312 if (!obj || obj == sv ||
5313 how == PERL_MAGIC_arylen ||
5314 how == PERL_MAGIC_qr ||
5315 (SvTYPE(obj) == SVt_PVGV &&
5316 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5317 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5318 GvFORM(obj) == (CV*)sv)))
5323 mg->mg_obj = SvREFCNT_inc(obj);
5324 mg->mg_flags |= MGf_REFCOUNTED;
5327 /* Normal self-ties simply pass a null object, and instead of
5328 using mg_obj directly, use the SvTIED_obj macro to produce a
5329 new RV as needed. For glob "self-ties", we are tieing the PVIO
5330 with an RV obj pointing to the glob containing the PVIO. In
5331 this case, to avoid a reference loop, we need to weaken the
5335 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5336 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5342 mg->mg_len = namlen;
5345 mg->mg_ptr = savepvn(name, namlen);
5346 else if (namlen == HEf_SVKEY)
5347 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5349 mg->mg_ptr = (char *) name;
5351 mg->mg_virtual = vtable;
5355 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5360 =for apidoc sv_magic
5362 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5363 then adds a new magic item of type C<how> to the head of the magic list.
5365 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5366 handling of the C<name> and C<namlen> arguments.
5368 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5369 to add more than one instance of the same 'how'.
5375 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5377 const MGVTBL *vtable = 0;
5380 #ifdef PERL_COPY_ON_WRITE
5382 sv_force_normal_flags(sv, 0);
5384 if (SvREADONLY(sv)) {
5386 && how != PERL_MAGIC_regex_global
5387 && how != PERL_MAGIC_bm
5388 && how != PERL_MAGIC_fm
5389 && how != PERL_MAGIC_sv
5390 && how != PERL_MAGIC_backref
5393 Perl_croak(aTHX_ PL_no_modify);
5396 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5397 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5398 /* sv_magic() refuses to add a magic of the same 'how' as an
5401 if (how == PERL_MAGIC_taint)
5409 vtable = &PL_vtbl_sv;
5411 case PERL_MAGIC_overload:
5412 vtable = &PL_vtbl_amagic;
5414 case PERL_MAGIC_overload_elem:
5415 vtable = &PL_vtbl_amagicelem;
5417 case PERL_MAGIC_overload_table:
5418 vtable = &PL_vtbl_ovrld;
5421 vtable = &PL_vtbl_bm;
5423 case PERL_MAGIC_regdata:
5424 vtable = &PL_vtbl_regdata;
5426 case PERL_MAGIC_regdatum:
5427 vtable = &PL_vtbl_regdatum;
5429 case PERL_MAGIC_env:
5430 vtable = &PL_vtbl_env;
5433 vtable = &PL_vtbl_fm;
5435 case PERL_MAGIC_envelem:
5436 vtable = &PL_vtbl_envelem;
5438 case PERL_MAGIC_regex_global:
5439 vtable = &PL_vtbl_mglob;
5441 case PERL_MAGIC_isa:
5442 vtable = &PL_vtbl_isa;
5444 case PERL_MAGIC_isaelem:
5445 vtable = &PL_vtbl_isaelem;
5447 case PERL_MAGIC_nkeys:
5448 vtable = &PL_vtbl_nkeys;
5450 case PERL_MAGIC_dbfile:
5453 case PERL_MAGIC_dbline:
5454 vtable = &PL_vtbl_dbline;
5456 #ifdef USE_LOCALE_COLLATE
5457 case PERL_MAGIC_collxfrm:
5458 vtable = &PL_vtbl_collxfrm;
5460 #endif /* USE_LOCALE_COLLATE */
5461 case PERL_MAGIC_tied:
5462 vtable = &PL_vtbl_pack;
5464 case PERL_MAGIC_tiedelem:
5465 case PERL_MAGIC_tiedscalar:
5466 vtable = &PL_vtbl_packelem;
5469 vtable = &PL_vtbl_regexp;
5471 case PERL_MAGIC_sig:
5472 vtable = &PL_vtbl_sig;
5474 case PERL_MAGIC_sigelem:
5475 vtable = &PL_vtbl_sigelem;
5477 case PERL_MAGIC_taint:
5478 vtable = &PL_vtbl_taint;
5480 case PERL_MAGIC_uvar:
5481 vtable = &PL_vtbl_uvar;
5483 case PERL_MAGIC_vec:
5484 vtable = &PL_vtbl_vec;
5486 case PERL_MAGIC_vstring:
5489 case PERL_MAGIC_utf8:
5490 vtable = &PL_vtbl_utf8;
5492 case PERL_MAGIC_substr:
5493 vtable = &PL_vtbl_substr;
5495 case PERL_MAGIC_defelem:
5496 vtable = &PL_vtbl_defelem;
5498 case PERL_MAGIC_glob:
5499 vtable = &PL_vtbl_glob;
5501 case PERL_MAGIC_arylen:
5502 vtable = &PL_vtbl_arylen;
5504 case PERL_MAGIC_pos:
5505 vtable = &PL_vtbl_pos;
5507 case PERL_MAGIC_backref:
5508 vtable = &PL_vtbl_backref;
5510 case PERL_MAGIC_ext:
5511 /* Reserved for use by extensions not perl internals. */
5512 /* Useful for attaching extension internal data to perl vars. */
5513 /* Note that multiple extensions may clash if magical scalars */
5514 /* etc holding private data from one are passed to another. */
5517 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5520 /* Rest of work is done else where */
5521 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5524 case PERL_MAGIC_taint:
5527 case PERL_MAGIC_ext:
5528 case PERL_MAGIC_dbfile:
5535 =for apidoc sv_unmagic
5537 Removes all magic of type C<type> from an SV.
5543 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5547 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5550 for (mg = *mgp; mg; mg = *mgp) {
5551 if (mg->mg_type == type) {
5552 const MGVTBL* const vtbl = mg->mg_virtual;
5553 *mgp = mg->mg_moremagic;
5554 if (vtbl && vtbl->svt_free)
5555 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5556 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5558 Safefree(mg->mg_ptr);
5559 else if (mg->mg_len == HEf_SVKEY)
5560 SvREFCNT_dec((SV*)mg->mg_ptr);
5561 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5562 Safefree(mg->mg_ptr);
5564 if (mg->mg_flags & MGf_REFCOUNTED)
5565 SvREFCNT_dec(mg->mg_obj);
5569 mgp = &mg->mg_moremagic;
5573 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5580 =for apidoc sv_rvweaken
5582 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5583 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5584 push a back-reference to this RV onto the array of backreferences
5585 associated with that magic.
5591 Perl_sv_rvweaken(pTHX_ SV *sv)
5594 if (!SvOK(sv)) /* let undefs pass */
5597 Perl_croak(aTHX_ "Can't weaken a nonreference");
5598 else if (SvWEAKREF(sv)) {
5599 if (ckWARN(WARN_MISC))
5600 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5604 sv_add_backref(tsv, sv);
5610 /* Give tsv backref magic if it hasn't already got it, then push a
5611 * back-reference to sv onto the array associated with the backref magic.
5615 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5619 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5620 av = (AV*)mg->mg_obj;
5623 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5624 /* av now has a refcnt of 2, which avoids it getting freed
5625 * before us during global cleanup. The extra ref is removed
5626 * by magic_killbackrefs() when tsv is being freed */
5628 if (AvFILLp(av) >= AvMAX(av)) {
5630 SV **svp = AvARRAY(av);
5631 for (i = AvFILLp(av); i >= 0; i--)
5633 svp[i] = sv; /* reuse the slot */
5636 av_extend(av, AvFILLp(av)+1);
5638 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5641 /* delete a back-reference to ourselves from the backref magic associated
5642 * with the SV we point to.
5646 S_sv_del_backref(pTHX_ SV *sv)
5653 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5654 Perl_croak(aTHX_ "panic: del_backref");
5655 av = (AV *)mg->mg_obj;
5657 for (i = AvFILLp(av); i >= 0; i--)
5658 if (svp[i] == sv) svp[i] = Nullsv;
5662 =for apidoc sv_insert
5664 Inserts a string at the specified offset/length within the SV. Similar to
5665 the Perl substr() function.
5671 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5675 register char *midend;
5676 register char *bigend;
5682 Perl_croak(aTHX_ "Can't modify non-existent substring");
5683 SvPV_force(bigstr, curlen);
5684 (void)SvPOK_only_UTF8(bigstr);
5685 if (offset + len > curlen) {
5686 SvGROW(bigstr, offset+len+1);
5687 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5688 SvCUR_set(bigstr, offset+len);
5692 i = littlelen - len;
5693 if (i > 0) { /* string might grow */
5694 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5695 mid = big + offset + len;
5696 midend = bigend = big + SvCUR(bigstr);
5699 while (midend > mid) /* shove everything down */
5700 *--bigend = *--midend;
5701 Move(little,big+offset,littlelen,char);
5702 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5707 Move(little,SvPVX(bigstr)+offset,len,char);
5712 big = SvPVX(bigstr);
5715 bigend = big + SvCUR(bigstr);
5717 if (midend > bigend)
5718 Perl_croak(aTHX_ "panic: sv_insert");
5720 if (mid - big > bigend - midend) { /* faster to shorten from end */
5722 Move(little, mid, littlelen,char);
5725 i = bigend - midend;
5727 Move(midend, mid, i,char);
5731 SvCUR_set(bigstr, mid - big);
5734 else if ((i = mid - big)) { /* faster from front */
5735 midend -= littlelen;
5737 sv_chop(bigstr,midend-i);
5742 Move(little, mid, littlelen,char);
5744 else if (littlelen) {
5745 midend -= littlelen;
5746 sv_chop(bigstr,midend);
5747 Move(little,midend,littlelen,char);
5750 sv_chop(bigstr,midend);
5756 =for apidoc sv_replace
5758 Make the first argument a copy of the second, then delete the original.
5759 The target SV physically takes over ownership of the body of the source SV
5760 and inherits its flags; however, the target keeps any magic it owns,
5761 and any magic in the source is discarded.
5762 Note that this is a rather specialist SV copying operation; most of the
5763 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5769 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5771 U32 refcnt = SvREFCNT(sv);
5772 SV_CHECK_THINKFIRST_COW_DROP(sv);
5773 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5774 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5775 if (SvMAGICAL(sv)) {
5779 sv_upgrade(nsv, SVt_PVMG);
5780 SvMAGIC_set(nsv, SvMAGIC(sv));
5781 SvFLAGS(nsv) |= SvMAGICAL(sv);
5783 SvMAGIC_set(sv, NULL);
5787 assert(!SvREFCNT(sv));
5788 #ifdef DEBUG_LEAKING_SCALARS
5789 sv->sv_flags = nsv->sv_flags;
5790 sv->sv_any = nsv->sv_any;
5791 sv->sv_refcnt = nsv->sv_refcnt;
5793 StructCopy(nsv,sv,SV);
5796 #ifdef PERL_COPY_ON_WRITE
5797 if (SvIsCOW_normal(nsv)) {
5798 /* We need to follow the pointers around the loop to make the
5799 previous SV point to sv, rather than nsv. */
5802 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5805 assert(SvPVX(current) == SvPVX(nsv));
5807 /* Make the SV before us point to the SV after us. */
5809 PerlIO_printf(Perl_debug_log, "previous is\n");
5811 PerlIO_printf(Perl_debug_log,
5812 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5813 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5815 SV_COW_NEXT_SV_SET(current, sv);
5818 SvREFCNT(sv) = refcnt;
5819 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5825 =for apidoc sv_clear
5827 Clear an SV: call any destructors, free up any memory used by the body,
5828 and free the body itself. The SV's head is I<not> freed, although
5829 its type is set to all 1's so that it won't inadvertently be assumed
5830 to be live during global destruction etc.
5831 This function should only be called when REFCNT is zero. Most of the time
5832 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5839 Perl_sv_clear(pTHX_ register SV *sv)
5844 assert(SvREFCNT(sv) == 0);
5847 if (PL_defstash) { /* Still have a symbol table? */
5854 stash = SvSTASH(sv);
5855 destructor = StashHANDLER(stash,DESTROY);
5857 SV* tmpref = newRV(sv);
5858 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5860 PUSHSTACKi(PERLSI_DESTROY);
5865 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5871 if(SvREFCNT(tmpref) < 2) {
5872 /* tmpref is not kept alive! */
5874 SvRV_set(tmpref, NULL);
5877 SvREFCNT_dec(tmpref);
5879 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5883 if (PL_in_clean_objs)
5884 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5886 /* DESTROY gave object new lease on life */
5892 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5893 SvOBJECT_off(sv); /* Curse the object. */
5894 if (SvTYPE(sv) != SVt_PVIO)
5895 --PL_sv_objcount; /* XXX Might want something more general */
5898 if (SvTYPE(sv) >= SVt_PVMG) {
5901 if (SvFLAGS(sv) & SVpad_TYPED)
5902 SvREFCNT_dec(SvSTASH(sv));
5905 switch (SvTYPE(sv)) {
5908 IoIFP(sv) != PerlIO_stdin() &&
5909 IoIFP(sv) != PerlIO_stdout() &&
5910 IoIFP(sv) != PerlIO_stderr())
5912 io_close((IO*)sv, FALSE);
5914 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5915 PerlDir_close(IoDIRP(sv));
5916 IoDIRP(sv) = (DIR*)NULL;
5917 Safefree(IoTOP_NAME(sv));
5918 Safefree(IoFMT_NAME(sv));
5919 Safefree(IoBOTTOM_NAME(sv));
5934 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5935 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5936 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5937 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5939 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5940 SvREFCNT_dec(LvTARG(sv));
5944 Safefree(GvNAME(sv));
5945 /* cannot decrease stash refcount yet, as we might recursively delete
5946 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5947 of stash until current sv is completely gone.
5948 -- JohnPC, 27 Mar 1998 */
5949 stash = GvSTASH(sv);
5955 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5957 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5958 /* Don't even bother with turning off the OOK flag. */
5967 SvREFCNT_dec(SvRV(sv));
5969 #ifdef PERL_COPY_ON_WRITE
5970 else if (SvPVX(sv)) {
5972 /* I believe I need to grab the global SV mutex here and
5973 then recheck the COW status. */
5975 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5978 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5979 SvUVX(sv), SV_COW_NEXT_SV(sv));
5980 /* And drop it here. */
5982 } else if (SvLEN(sv)) {
5983 Safefree(SvPVX(sv));
5987 else if (SvPVX(sv) && SvLEN(sv))
5988 Safefree(SvPVX(sv));
5989 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5990 unsharepvn(SvPVX(sv),
5991 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
6005 switch (SvTYPE(sv)) {
6021 del_XPVIV(SvANY(sv));
6024 del_XPVNV(SvANY(sv));
6027 del_XPVMG(SvANY(sv));
6030 del_XPVLV(SvANY(sv));
6033 del_XPVAV(SvANY(sv));
6036 del_XPVHV(SvANY(sv));
6039 del_XPVCV(SvANY(sv));
6042 del_XPVGV(SvANY(sv));
6043 /* code duplication for increased performance. */
6044 SvFLAGS(sv) &= SVf_BREAK;
6045 SvFLAGS(sv) |= SVTYPEMASK;
6046 /* decrease refcount of the stash that owns this GV, if any */
6048 SvREFCNT_dec(stash);
6049 return; /* not break, SvFLAGS reset already happened */
6051 del_XPVBM(SvANY(sv));
6054 del_XPVFM(SvANY(sv));
6057 del_XPVIO(SvANY(sv));
6060 SvFLAGS(sv) &= SVf_BREAK;
6061 SvFLAGS(sv) |= SVTYPEMASK;
6065 =for apidoc sv_newref
6067 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6074 Perl_sv_newref(pTHX_ SV *sv)
6084 Decrement an SV's reference count, and if it drops to zero, call
6085 C<sv_clear> to invoke destructors and free up any memory used by
6086 the body; finally, deallocate the SV's head itself.
6087 Normally called via a wrapper macro C<SvREFCNT_dec>.
6093 Perl_sv_free(pTHX_ SV *sv)
6098 if (SvREFCNT(sv) == 0) {
6099 if (SvFLAGS(sv) & SVf_BREAK)
6100 /* this SV's refcnt has been artificially decremented to
6101 * trigger cleanup */
6103 if (PL_in_clean_all) /* All is fair */
6105 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6106 /* make sure SvREFCNT(sv)==0 happens very seldom */
6107 SvREFCNT(sv) = (~(U32)0)/2;
6110 if (ckWARN_d(WARN_INTERNAL))
6111 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6112 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6113 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6116 if (--(SvREFCNT(sv)) > 0)
6118 Perl_sv_free2(aTHX_ sv);
6122 Perl_sv_free2(pTHX_ SV *sv)
6127 if (ckWARN_d(WARN_DEBUGGING))
6128 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6129 "Attempt to free temp prematurely: SV 0x%"UVxf
6130 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6134 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6135 /* make sure SvREFCNT(sv)==0 happens very seldom */
6136 SvREFCNT(sv) = (~(U32)0)/2;
6147 Returns the length of the string in the SV. Handles magic and type
6148 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6154 Perl_sv_len(pTHX_ register SV *sv)
6162 len = mg_length(sv);
6164 (void)SvPV(sv, len);
6169 =for apidoc sv_len_utf8
6171 Returns the number of characters in the string in an SV, counting wide
6172 UTF-8 bytes as a single character. Handles magic and type coercion.
6178 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6179 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6180 * (Note that the mg_len is not the length of the mg_ptr field.)
6185 Perl_sv_len_utf8(pTHX_ register SV *sv)
6191 return mg_length(sv);
6195 U8 *s = (U8*)SvPV(sv, len);
6196 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6198 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6200 #ifdef PERL_UTF8_CACHE_ASSERT
6201 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6205 ulen = Perl_utf8_length(aTHX_ s, s + len);
6206 if (!mg && !SvREADONLY(sv)) {
6207 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6208 mg = mg_find(sv, PERL_MAGIC_utf8);
6218 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6219 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6220 * between UTF-8 and byte offsets. There are two (substr offset and substr
6221 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6222 * and byte offset) cache positions.
6224 * The mg_len field is used by sv_len_utf8(), see its comments.
6225 * Note that the mg_len is not the length of the mg_ptr field.
6229 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
6233 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6235 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6239 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6241 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6242 (*mgp)->mg_ptr = (char *) *cachep;
6246 (*cachep)[i] = *offsetp;
6247 (*cachep)[i+1] = s - start;
6255 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6256 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6257 * between UTF-8 and byte offsets. See also the comments of
6258 * S_utf8_mg_pos_init().
6262 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6266 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6268 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6269 if (*mgp && (*mgp)->mg_ptr) {
6270 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6271 ASSERT_UTF8_CACHE(*cachep);
6272 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6274 else { /* We will skip to the right spot. */
6279 /* The assumption is that going backward is half
6280 * the speed of going forward (that's where the
6281 * 2 * backw in the below comes from). (The real
6282 * figure of course depends on the UTF-8 data.) */
6284 if ((*cachep)[i] > (STRLEN)uoff) {
6286 backw = (*cachep)[i] - (STRLEN)uoff;
6288 if (forw < 2 * backw)
6291 p = start + (*cachep)[i+1];
6293 /* Try this only for the substr offset (i == 0),
6294 * not for the substr length (i == 2). */
6295 else if (i == 0) { /* (*cachep)[i] < uoff */
6296 STRLEN ulen = sv_len_utf8(sv);
6298 if ((STRLEN)uoff < ulen) {
6299 forw = (STRLEN)uoff - (*cachep)[i];
6300 backw = ulen - (STRLEN)uoff;
6302 if (forw < 2 * backw)
6303 p = start + (*cachep)[i+1];
6308 /* If the string is not long enough for uoff,
6309 * we could extend it, but not at this low a level. */
6313 if (forw < 2 * backw) {
6320 while (UTF8_IS_CONTINUATION(*p))
6325 /* Update the cache. */
6326 (*cachep)[i] = (STRLEN)uoff;
6327 (*cachep)[i+1] = p - start;
6329 /* Drop the stale "length" cache */
6338 if (found) { /* Setup the return values. */
6339 *offsetp = (*cachep)[i+1];
6340 *sp = start + *offsetp;
6343 *offsetp = send - start;
6345 else if (*sp < start) {
6351 #ifdef PERL_UTF8_CACHE_ASSERT
6356 while (n-- && s < send)
6360 assert(*offsetp == s - start);
6361 assert((*cachep)[0] == (STRLEN)uoff);
6362 assert((*cachep)[1] == *offsetp);
6364 ASSERT_UTF8_CACHE(*cachep);
6373 =for apidoc sv_pos_u2b
6375 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6376 the start of the string, to a count of the equivalent number of bytes; if
6377 lenp is non-zero, it does the same to lenp, but this time starting from
6378 the offset, rather than from the start of the string. Handles magic and
6385 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6386 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6387 * byte offsets. See also the comments of S_utf8_mg_pos().
6392 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6403 start = s = (U8*)SvPV(sv, len);
6405 I32 uoffset = *offsetp;
6410 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6412 if (!found && uoffset > 0) {
6413 while (s < send && uoffset--)
6417 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
6419 *offsetp = s - start;
6424 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6428 if (!found && *lenp > 0) {
6431 while (s < send && ulen--)
6435 utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start);
6439 ASSERT_UTF8_CACHE(cache);
6451 =for apidoc sv_pos_b2u
6453 Converts the value pointed to by offsetp from a count of bytes from the
6454 start of the string, to a count of the equivalent number of UTF-8 chars.
6455 Handles magic and type coercion.
6461 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6462 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6463 * byte offsets. See also the comments of S_utf8_mg_pos().
6468 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6476 s = (U8*)SvPV(sv, len);
6477 if ((I32)len < *offsetp)
6478 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6480 U8* send = s + *offsetp;
6482 STRLEN *cache = NULL;
6486 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6487 mg = mg_find(sv, PERL_MAGIC_utf8);
6488 if (mg && mg->mg_ptr) {
6489 cache = (STRLEN *) mg->mg_ptr;
6490 if (cache[1] == (STRLEN)*offsetp) {
6491 /* An exact match. */
6492 *offsetp = cache[0];
6496 else if (cache[1] < (STRLEN)*offsetp) {
6497 /* We already know part of the way. */
6500 /* Let the below loop do the rest. */
6502 else { /* cache[1] > *offsetp */
6503 /* We already know all of the way, now we may
6504 * be able to walk back. The same assumption
6505 * is made as in S_utf8_mg_pos(), namely that
6506 * walking backward is twice slower than
6507 * walking forward. */
6508 STRLEN forw = *offsetp;
6509 STRLEN backw = cache[1] - *offsetp;
6511 if (!(forw < 2 * backw)) {
6512 U8 *p = s + cache[1];
6519 while (UTF8_IS_CONTINUATION(*p)) {
6527 *offsetp = cache[0];
6529 /* Drop the stale "length" cache */
6537 ASSERT_UTF8_CACHE(cache);
6543 /* Call utf8n_to_uvchr() to validate the sequence
6544 * (unless a simple non-UTF character) */
6545 if (!UTF8_IS_INVARIANT(*s))
6546 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6555 if (!SvREADONLY(sv)) {
6557 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6558 mg = mg_find(sv, PERL_MAGIC_utf8);
6563 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6564 mg->mg_ptr = (char *) cache;
6569 cache[1] = *offsetp;
6570 /* Drop the stale "length" cache */
6583 Returns a boolean indicating whether the strings in the two SVs are
6584 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6585 coerce its args to strings if necessary.
6591 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6599 SV* svrecode = Nullsv;
6606 pv1 = SvPV(sv1, cur1);
6613 pv2 = SvPV(sv2, cur2);
6615 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6616 /* Differing utf8ness.
6617 * Do not UTF8size the comparands as a side-effect. */
6620 svrecode = newSVpvn(pv2, cur2);
6621 sv_recode_to_utf8(svrecode, PL_encoding);
6622 pv2 = SvPV(svrecode, cur2);
6625 svrecode = newSVpvn(pv1, cur1);
6626 sv_recode_to_utf8(svrecode, PL_encoding);
6627 pv1 = SvPV(svrecode, cur1);
6629 /* Now both are in UTF-8. */
6631 SvREFCNT_dec(svrecode);
6636 bool is_utf8 = TRUE;
6639 /* sv1 is the UTF-8 one,
6640 * if is equal it must be downgrade-able */
6641 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6647 /* sv2 is the UTF-8 one,
6648 * if is equal it must be downgrade-able */
6649 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6655 /* Downgrade not possible - cannot be eq */
6663 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6666 SvREFCNT_dec(svrecode);
6677 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6678 string in C<sv1> is less than, equal to, or greater than the string in
6679 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6680 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6686 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6689 const char *pv1, *pv2;
6692 SV *svrecode = Nullsv;
6699 pv1 = SvPV(sv1, cur1);
6706 pv2 = SvPV(sv2, cur2);
6708 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6709 /* Differing utf8ness.
6710 * Do not UTF8size the comparands as a side-effect. */
6713 svrecode = newSVpvn(pv2, cur2);
6714 sv_recode_to_utf8(svrecode, PL_encoding);
6715 pv2 = SvPV(svrecode, cur2);
6718 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6723 svrecode = newSVpvn(pv1, cur1);
6724 sv_recode_to_utf8(svrecode, PL_encoding);
6725 pv1 = SvPV(svrecode, cur1);
6728 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6734 cmp = cur2 ? -1 : 0;
6738 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6741 cmp = retval < 0 ? -1 : 1;
6742 } else if (cur1 == cur2) {
6745 cmp = cur1 < cur2 ? -1 : 1;
6750 SvREFCNT_dec(svrecode);
6759 =for apidoc sv_cmp_locale
6761 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6762 'use bytes' aware, handles get magic, and will coerce its args to strings
6763 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6769 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6771 #ifdef USE_LOCALE_COLLATE
6777 if (PL_collation_standard)
6781 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6783 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6785 if (!pv1 || !len1) {
6796 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6799 return retval < 0 ? -1 : 1;
6802 * When the result of collation is equality, that doesn't mean
6803 * that there are no differences -- some locales exclude some
6804 * characters from consideration. So to avoid false equalities,
6805 * we use the raw string as a tiebreaker.
6811 #endif /* USE_LOCALE_COLLATE */
6813 return sv_cmp(sv1, sv2);
6817 #ifdef USE_LOCALE_COLLATE
6820 =for apidoc sv_collxfrm
6822 Add Collate Transform magic to an SV if it doesn't already have it.
6824 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6825 scalar data of the variable, but transformed to such a format that a normal
6826 memory comparison can be used to compare the data according to the locale
6833 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6837 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6838 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6843 Safefree(mg->mg_ptr);
6845 if ((xf = mem_collxfrm(s, len, &xlen))) {
6846 if (SvREADONLY(sv)) {
6849 return xf + sizeof(PL_collation_ix);
6852 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6853 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6866 if (mg && mg->mg_ptr) {
6868 return mg->mg_ptr + sizeof(PL_collation_ix);
6876 #endif /* USE_LOCALE_COLLATE */
6881 Get a line from the filehandle and store it into the SV, optionally
6882 appending to the currently-stored string.
6888 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6892 register STDCHAR rslast;
6893 register STDCHAR *bp;
6899 if (SvTHINKFIRST(sv))
6900 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6901 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6903 However, perlbench says it's slower, because the existing swipe code
6904 is faster than copy on write.
6905 Swings and roundabouts. */
6906 (void)SvUPGRADE(sv, SVt_PV);
6911 if (PerlIO_isutf8(fp)) {
6913 sv_utf8_upgrade_nomg(sv);
6914 sv_pos_u2b(sv,&append,0);
6916 } else if (SvUTF8(sv)) {
6917 SV *tsv = NEWSV(0,0);
6918 sv_gets(tsv, fp, 0);
6919 sv_utf8_upgrade_nomg(tsv);
6920 SvCUR_set(sv,append);
6923 goto return_string_or_null;
6928 if (PerlIO_isutf8(fp))
6931 if (IN_PERL_COMPILETIME) {
6932 /* we always read code in line mode */
6936 else if (RsSNARF(PL_rs)) {
6937 /* If it is a regular disk file use size from stat() as estimate
6938 of amount we are going to read - may result in malloc-ing
6939 more memory than we realy need if layers bellow reduce
6940 size we read (e.g. CRLF or a gzip layer)
6943 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6944 Off_t offset = PerlIO_tell(fp);
6945 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6946 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6952 else if (RsRECORD(PL_rs)) {
6956 /* Grab the size of the record we're getting */
6957 recsize = SvIV(SvRV(PL_rs));
6958 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6961 /* VMS wants read instead of fread, because fread doesn't respect */
6962 /* RMS record boundaries. This is not necessarily a good thing to be */
6963 /* doing, but we've got no other real choice - except avoid stdio
6964 as implementation - perhaps write a :vms layer ?
6966 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6968 bytesread = PerlIO_read(fp, buffer, recsize);
6972 SvCUR_set(sv, bytesread += append);
6973 buffer[bytesread] = '\0';
6974 goto return_string_or_null;
6976 else if (RsPARA(PL_rs)) {
6982 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6983 if (PerlIO_isutf8(fp)) {
6984 rsptr = SvPVutf8(PL_rs, rslen);
6987 if (SvUTF8(PL_rs)) {
6988 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6989 Perl_croak(aTHX_ "Wide character in $/");
6992 rsptr = SvPV(PL_rs, rslen);
6996 rslast = rslen ? rsptr[rslen - 1] : '\0';
6998 if (rspara) { /* have to do this both before and after */
6999 do { /* to make sure file boundaries work right */
7002 i = PerlIO_getc(fp);
7006 PerlIO_ungetc(fp,i);
7012 /* See if we know enough about I/O mechanism to cheat it ! */
7014 /* This used to be #ifdef test - it is made run-time test for ease
7015 of abstracting out stdio interface. One call should be cheap
7016 enough here - and may even be a macro allowing compile
7020 if (PerlIO_fast_gets(fp)) {
7023 * We're going to steal some values from the stdio struct
7024 * and put EVERYTHING in the innermost loop into registers.
7026 register STDCHAR *ptr;
7030 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7031 /* An ungetc()d char is handled separately from the regular
7032 * buffer, so we getc() it back out and stuff it in the buffer.
7034 i = PerlIO_getc(fp);
7035 if (i == EOF) return 0;
7036 *(--((*fp)->_ptr)) = (unsigned char) i;
7040 /* Here is some breathtakingly efficient cheating */
7042 cnt = PerlIO_get_cnt(fp); /* get count into register */
7043 /* make sure we have the room */
7044 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7045 /* Not room for all of it
7046 if we are looking for a separator and room for some
7048 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7049 /* just process what we have room for */
7050 shortbuffered = cnt - SvLEN(sv) + append + 1;
7051 cnt -= shortbuffered;
7055 /* remember that cnt can be negative */
7056 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7061 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7062 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7063 DEBUG_P(PerlIO_printf(Perl_debug_log,
7064 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7065 DEBUG_P(PerlIO_printf(Perl_debug_log,
7066 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7067 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7068 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7073 while (cnt > 0) { /* this | eat */
7075 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7076 goto thats_all_folks; /* screams | sed :-) */
7080 Copy(ptr, bp, cnt, char); /* this | eat */
7081 bp += cnt; /* screams | dust */
7082 ptr += cnt; /* louder | sed :-) */
7087 if (shortbuffered) { /* oh well, must extend */
7088 cnt = shortbuffered;
7090 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7092 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7093 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7097 DEBUG_P(PerlIO_printf(Perl_debug_log,
7098 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7099 PTR2UV(ptr),(long)cnt));
7100 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7102 DEBUG_P(PerlIO_printf(Perl_debug_log,
7103 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7104 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7105 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7107 /* This used to call 'filbuf' in stdio form, but as that behaves like
7108 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7109 another abstraction. */
7110 i = PerlIO_getc(fp); /* get more characters */
7112 DEBUG_P(PerlIO_printf(Perl_debug_log,
7113 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7114 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7115 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7117 cnt = PerlIO_get_cnt(fp);
7118 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7119 DEBUG_P(PerlIO_printf(Perl_debug_log,
7120 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7122 if (i == EOF) /* all done for ever? */
7123 goto thats_really_all_folks;
7125 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7127 SvGROW(sv, bpx + cnt + 2);
7128 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7130 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7132 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7133 goto thats_all_folks;
7137 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7138 memNE((char*)bp - rslen, rsptr, rslen))
7139 goto screamer; /* go back to the fray */
7140 thats_really_all_folks:
7142 cnt += shortbuffered;
7143 DEBUG_P(PerlIO_printf(Perl_debug_log,
7144 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7145 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7146 DEBUG_P(PerlIO_printf(Perl_debug_log,
7147 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7148 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7149 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7151 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7152 DEBUG_P(PerlIO_printf(Perl_debug_log,
7153 "Screamer: done, len=%ld, string=|%.*s|\n",
7154 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7158 /*The big, slow, and stupid way. */
7159 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7161 New(0, buf, 8192, STDCHAR);
7169 const register STDCHAR *bpe = buf + sizeof(buf);
7171 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7172 ; /* keep reading */
7176 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7177 /* Accomodate broken VAXC compiler, which applies U8 cast to
7178 * both args of ?: operator, causing EOF to change into 255
7181 i = (U8)buf[cnt - 1];
7187 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7189 sv_catpvn(sv, (char *) buf, cnt);
7191 sv_setpvn(sv, (char *) buf, cnt);
7193 if (i != EOF && /* joy */
7195 SvCUR(sv) < rslen ||
7196 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7200 * If we're reading from a TTY and we get a short read,
7201 * indicating that the user hit his EOF character, we need
7202 * to notice it now, because if we try to read from the TTY
7203 * again, the EOF condition will disappear.
7205 * The comparison of cnt to sizeof(buf) is an optimization
7206 * that prevents unnecessary calls to feof().
7210 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7214 #ifdef USE_HEAP_INSTEAD_OF_STACK
7219 if (rspara) { /* have to do this both before and after */
7220 while (i != EOF) { /* to make sure file boundaries work right */
7221 i = PerlIO_getc(fp);
7223 PerlIO_ungetc(fp,i);
7229 return_string_or_null:
7230 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7236 Auto-increment of the value in the SV, doing string to numeric conversion
7237 if necessary. Handles 'get' magic.
7243 Perl_sv_inc(pTHX_ register SV *sv)
7252 if (SvTHINKFIRST(sv)) {
7254 sv_force_normal_flags(sv, 0);
7255 if (SvREADONLY(sv)) {
7256 if (IN_PERL_RUNTIME)
7257 Perl_croak(aTHX_ PL_no_modify);
7261 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7263 i = PTR2IV(SvRV(sv));
7268 flags = SvFLAGS(sv);
7269 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7270 /* It's (privately or publicly) a float, but not tested as an
7271 integer, so test it to see. */
7273 flags = SvFLAGS(sv);
7275 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7276 /* It's publicly an integer, or privately an integer-not-float */
7277 #ifdef PERL_PRESERVE_IVUV
7281 if (SvUVX(sv) == UV_MAX)
7282 sv_setnv(sv, UV_MAX_P1);
7284 (void)SvIOK_only_UV(sv);
7285 SvUV_set(sv, SvUVX(sv) + 1);
7287 if (SvIVX(sv) == IV_MAX)
7288 sv_setuv(sv, (UV)IV_MAX + 1);
7290 (void)SvIOK_only(sv);
7291 SvIV_set(sv, SvIVX(sv) + 1);
7296 if (flags & SVp_NOK) {
7297 (void)SvNOK_only(sv);
7298 SvNV_set(sv, SvNVX(sv) + 1.0);
7302 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7303 if ((flags & SVTYPEMASK) < SVt_PVIV)
7304 sv_upgrade(sv, SVt_IV);
7305 (void)SvIOK_only(sv);
7310 while (isALPHA(*d)) d++;
7311 while (isDIGIT(*d)) d++;
7313 #ifdef PERL_PRESERVE_IVUV
7314 /* Got to punt this as an integer if needs be, but we don't issue
7315 warnings. Probably ought to make the sv_iv_please() that does
7316 the conversion if possible, and silently. */
7317 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7318 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7319 /* Need to try really hard to see if it's an integer.
7320 9.22337203685478e+18 is an integer.
7321 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7322 so $a="9.22337203685478e+18"; $a+0; $a++
7323 needs to be the same as $a="9.22337203685478e+18"; $a++
7330 /* sv_2iv *should* have made this an NV */
7331 if (flags & SVp_NOK) {
7332 (void)SvNOK_only(sv);
7333 SvNV_set(sv, SvNVX(sv) + 1.0);
7336 /* I don't think we can get here. Maybe I should assert this
7337 And if we do get here I suspect that sv_setnv will croak. NWC
7339 #if defined(USE_LONG_DOUBLE)
7340 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",
7341 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7343 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7344 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7347 #endif /* PERL_PRESERVE_IVUV */
7348 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7352 while (d >= SvPVX(sv)) {
7360 /* MKS: The original code here died if letters weren't consecutive.
7361 * at least it didn't have to worry about non-C locales. The
7362 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7363 * arranged in order (although not consecutively) and that only
7364 * [A-Za-z] are accepted by isALPHA in the C locale.
7366 if (*d != 'z' && *d != 'Z') {
7367 do { ++*d; } while (!isALPHA(*d));
7370 *(d--) -= 'z' - 'a';
7375 *(d--) -= 'z' - 'a' + 1;
7379 /* oh,oh, the number grew */
7380 SvGROW(sv, SvCUR(sv) + 2);
7381 SvCUR_set(sv, SvCUR(sv) + 1);
7382 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7393 Auto-decrement of the value in the SV, doing string to numeric conversion
7394 if necessary. Handles 'get' magic.
7400 Perl_sv_dec(pTHX_ register SV *sv)
7408 if (SvTHINKFIRST(sv)) {
7410 sv_force_normal_flags(sv, 0);
7411 if (SvREADONLY(sv)) {
7412 if (IN_PERL_RUNTIME)
7413 Perl_croak(aTHX_ PL_no_modify);
7417 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7419 i = PTR2IV(SvRV(sv));
7424 /* Unlike sv_inc we don't have to worry about string-never-numbers
7425 and keeping them magic. But we mustn't warn on punting */
7426 flags = SvFLAGS(sv);
7427 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7428 /* It's publicly an integer, or privately an integer-not-float */
7429 #ifdef PERL_PRESERVE_IVUV
7433 if (SvUVX(sv) == 0) {
7434 (void)SvIOK_only(sv);
7438 (void)SvIOK_only_UV(sv);
7439 SvUV_set(sv, SvUVX(sv) + 1);
7442 if (SvIVX(sv) == IV_MIN)
7443 sv_setnv(sv, (NV)IV_MIN - 1.0);
7445 (void)SvIOK_only(sv);
7446 SvIV_set(sv, SvIVX(sv) - 1);
7451 if (flags & SVp_NOK) {
7452 SvNV_set(sv, SvNVX(sv) - 1.0);
7453 (void)SvNOK_only(sv);
7456 if (!(flags & SVp_POK)) {
7457 if ((flags & SVTYPEMASK) < SVt_PVNV)
7458 sv_upgrade(sv, SVt_NV);
7460 (void)SvNOK_only(sv);
7463 #ifdef PERL_PRESERVE_IVUV
7465 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7466 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7467 /* Need to try really hard to see if it's an integer.
7468 9.22337203685478e+18 is an integer.
7469 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7470 so $a="9.22337203685478e+18"; $a+0; $a--
7471 needs to be the same as $a="9.22337203685478e+18"; $a--
7478 /* sv_2iv *should* have made this an NV */
7479 if (flags & SVp_NOK) {
7480 (void)SvNOK_only(sv);
7481 SvNV_set(sv, SvNVX(sv) - 1.0);
7484 /* I don't think we can get here. Maybe I should assert this
7485 And if we do get here I suspect that sv_setnv will croak. NWC
7487 #if defined(USE_LONG_DOUBLE)
7488 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",
7489 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7491 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7492 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7496 #endif /* PERL_PRESERVE_IVUV */
7497 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7501 =for apidoc sv_mortalcopy
7503 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7504 The new SV is marked as mortal. It will be destroyed "soon", either by an
7505 explicit call to FREETMPS, or by an implicit call at places such as
7506 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7511 /* Make a string that will exist for the duration of the expression
7512 * evaluation. Actually, it may have to last longer than that, but
7513 * hopefully we won't free it until it has been assigned to a
7514 * permanent location. */
7517 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7522 sv_setsv(sv,oldstr);
7524 PL_tmps_stack[++PL_tmps_ix] = sv;
7530 =for apidoc sv_newmortal
7532 Creates a new null SV which is mortal. The reference count of the SV is
7533 set to 1. It will be destroyed "soon", either by an explicit call to
7534 FREETMPS, or by an implicit call at places such as statement boundaries.
7535 See also C<sv_mortalcopy> and C<sv_2mortal>.
7541 Perl_sv_newmortal(pTHX)
7546 SvFLAGS(sv) = SVs_TEMP;
7548 PL_tmps_stack[++PL_tmps_ix] = sv;
7553 =for apidoc sv_2mortal
7555 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7556 by an explicit call to FREETMPS, or by an implicit call at places such as
7557 statement boundaries. SvTEMP() is turned on which means that the SV's
7558 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7559 and C<sv_mortalcopy>.
7565 Perl_sv_2mortal(pTHX_ register SV *sv)
7570 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7573 PL_tmps_stack[++PL_tmps_ix] = sv;
7581 Creates a new SV and copies a string into it. The reference count for the
7582 SV is set to 1. If C<len> is zero, Perl will compute the length using
7583 strlen(). For efficiency, consider using C<newSVpvn> instead.
7589 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7596 sv_setpvn(sv,s,len);
7601 =for apidoc newSVpvn
7603 Creates a new SV and copies a string into it. The reference count for the
7604 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7605 string. You are responsible for ensuring that the source string is at least
7606 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7612 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7617 sv_setpvn(sv,s,len);
7622 =for apidoc newSVpvn_share
7624 Creates a new SV with its SvPVX pointing to a shared string in the string
7625 table. If the string does not already exist in the table, it is created
7626 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7627 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7628 otherwise the hash is computed. The idea here is that as the string table
7629 is used for shared hash keys these strings will have SvPVX == HeKEY and
7630 hash lookup will avoid string compare.
7636 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7639 bool is_utf8 = FALSE;
7641 STRLEN tmplen = -len;
7643 /* See the note in hv.c:hv_fetch() --jhi */
7644 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7648 PERL_HASH(hash, src, len);
7650 sv_upgrade(sv, SVt_PVIV);
7651 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7664 #if defined(PERL_IMPLICIT_CONTEXT)
7666 /* pTHX_ magic can't cope with varargs, so this is a no-context
7667 * version of the main function, (which may itself be aliased to us).
7668 * Don't access this version directly.
7672 Perl_newSVpvf_nocontext(const char* pat, ...)
7677 va_start(args, pat);
7678 sv = vnewSVpvf(pat, &args);
7685 =for apidoc newSVpvf
7687 Creates a new SV and initializes it with the string formatted like
7694 Perl_newSVpvf(pTHX_ const char* pat, ...)
7698 va_start(args, pat);
7699 sv = vnewSVpvf(pat, &args);
7704 /* backend for newSVpvf() and newSVpvf_nocontext() */
7707 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7711 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7718 Creates a new SV and copies a floating point value into it.
7719 The reference count for the SV is set to 1.
7725 Perl_newSVnv(pTHX_ NV n)
7737 Creates a new SV and copies an integer into it. The reference count for the
7744 Perl_newSViv(pTHX_ IV i)
7756 Creates a new SV and copies an unsigned integer into it.
7757 The reference count for the SV is set to 1.
7763 Perl_newSVuv(pTHX_ UV u)
7773 =for apidoc newRV_noinc
7775 Creates an RV wrapper for an SV. The reference count for the original
7776 SV is B<not> incremented.
7782 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7787 sv_upgrade(sv, SVt_RV);
7789 SvRV_set(sv, tmpRef);
7794 /* newRV_inc is the official function name to use now.
7795 * newRV_inc is in fact #defined to newRV in sv.h
7799 Perl_newRV(pTHX_ SV *tmpRef)
7801 return newRV_noinc(SvREFCNT_inc(tmpRef));
7807 Creates a new SV which is an exact duplicate of the original SV.
7814 Perl_newSVsv(pTHX_ register SV *old)
7820 if (SvTYPE(old) == SVTYPEMASK) {
7821 if (ckWARN_d(WARN_INTERNAL))
7822 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7826 /* SV_GMAGIC is the default for sv_setv()
7827 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7828 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7829 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7834 =for apidoc sv_reset
7836 Underlying implementation for the C<reset> Perl function.
7837 Note that the perl-level function is vaguely deprecated.
7843 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7852 char todo[PERL_UCHAR_MAX+1];
7857 if (!*s) { /* reset ?? searches */
7858 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7859 pm->op_pmdynflags &= ~PMdf_USED;
7864 /* reset variables */
7866 if (!HvARRAY(stash))
7869 Zero(todo, 256, char);
7871 i = (unsigned char)*s;
7875 max = (unsigned char)*s++;
7876 for ( ; i <= max; i++) {
7879 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7880 for (entry = HvARRAY(stash)[i];
7882 entry = HeNEXT(entry))
7884 if (!todo[(U8)*HeKEY(entry)])
7886 gv = (GV*)HeVAL(entry);
7888 if (SvTHINKFIRST(sv)) {
7889 if (!SvREADONLY(sv) && SvROK(sv))
7894 if (SvTYPE(sv) >= SVt_PV) {
7896 if (SvPVX(sv) != Nullch)
7903 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7906 #ifdef USE_ENVIRON_ARRAY
7908 # ifdef USE_ITHREADS
7909 && PL_curinterp == aTHX
7913 environ[0] = Nullch;
7916 #endif /* !PERL_MICRO */
7926 Using various gambits, try to get an IO from an SV: the IO slot if its a
7927 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7928 named after the PV if we're a string.
7934 Perl_sv_2io(pTHX_ SV *sv)
7939 switch (SvTYPE(sv)) {
7947 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7951 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7953 return sv_2io(SvRV(sv));
7954 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7960 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7969 Using various gambits, try to get a CV from an SV; in addition, try if
7970 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7976 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7983 return *gvp = Nullgv, Nullcv;
7984 switch (SvTYPE(sv)) {
8003 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
8004 tryAMAGICunDEREF(to_cv);
8007 if (SvTYPE(sv) == SVt_PVCV) {
8016 Perl_croak(aTHX_ "Not a subroutine reference");
8021 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8027 if (lref && !GvCVu(gv)) {
8030 tmpsv = NEWSV(704,0);
8031 gv_efullname3(tmpsv, gv, Nullch);
8032 /* XXX this is probably not what they think they're getting.
8033 * It has the same effect as "sub name;", i.e. just a forward
8035 newSUB(start_subparse(FALSE, 0),
8036 newSVOP(OP_CONST, 0, tmpsv),
8041 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8051 Returns true if the SV has a true value by Perl's rules.
8052 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8053 instead use an in-line version.
8059 Perl_sv_true(pTHX_ register SV *sv)
8064 const register XPV* tXpv;
8065 if ((tXpv = (XPV*)SvANY(sv)) &&
8066 (tXpv->xpv_cur > 1 ||
8067 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
8074 return SvIVX(sv) != 0;
8077 return SvNVX(sv) != 0.0;
8079 return sv_2bool(sv);
8087 A private implementation of the C<SvIVx> macro for compilers which can't
8088 cope with complex macro expressions. Always use the macro instead.
8094 Perl_sv_iv(pTHX_ register SV *sv)
8098 return (IV)SvUVX(sv);
8107 A private implementation of the C<SvUVx> macro for compilers which can't
8108 cope with complex macro expressions. Always use the macro instead.
8114 Perl_sv_uv(pTHX_ register SV *sv)
8119 return (UV)SvIVX(sv);
8127 A private implementation of the C<SvNVx> macro for compilers which can't
8128 cope with complex macro expressions. Always use the macro instead.
8134 Perl_sv_nv(pTHX_ register SV *sv)
8141 /* sv_pv() is now a macro using SvPV_nolen();
8142 * this function provided for binary compatibility only
8146 Perl_sv_pv(pTHX_ SV *sv)
8153 return sv_2pv(sv, &n_a);
8159 Use the C<SvPV_nolen> macro instead
8163 A private implementation of the C<SvPV> macro for compilers which can't
8164 cope with complex macro expressions. Always use the macro instead.
8170 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8176 return sv_2pv(sv, lp);
8181 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8187 return sv_2pv_flags(sv, lp, 0);
8190 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8191 * this function provided for binary compatibility only
8195 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8197 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8201 =for apidoc sv_pvn_force
8203 Get a sensible string out of the SV somehow.
8204 A private implementation of the C<SvPV_force> macro for compilers which
8205 can't cope with complex macro expressions. Always use the macro instead.
8207 =for apidoc sv_pvn_force_flags
8209 Get a sensible string out of the SV somehow.
8210 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8211 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8212 implemented in terms of this function.
8213 You normally want to use the various wrapper macros instead: see
8214 C<SvPV_force> and C<SvPV_force_nomg>
8220 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8224 if (SvTHINKFIRST(sv) && !SvROK(sv))
8225 sv_force_normal_flags(sv, 0);
8231 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8232 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8236 s = sv_2pv_flags(sv, lp, flags);
8237 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8242 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8243 SvGROW(sv, len + 1);
8244 Move(s,SvPVX(sv),len,char);
8249 SvPOK_on(sv); /* validate pointer */
8251 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8252 PTR2UV(sv),SvPVX(sv)));
8258 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8259 * this function provided for binary compatibility only
8263 Perl_sv_pvbyte(pTHX_ SV *sv)
8265 sv_utf8_downgrade(sv,0);
8270 =for apidoc sv_pvbyte
8272 Use C<SvPVbyte_nolen> instead.
8274 =for apidoc sv_pvbyten
8276 A private implementation of the C<SvPVbyte> macro for compilers
8277 which can't cope with complex macro expressions. Always use the macro
8284 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8286 sv_utf8_downgrade(sv,0);
8287 return sv_pvn(sv,lp);
8291 =for apidoc sv_pvbyten_force
8293 A private implementation of the C<SvPVbytex_force> macro for compilers
8294 which can't cope with complex macro expressions. Always use the macro
8301 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8303 sv_pvn_force(sv,lp);
8304 sv_utf8_downgrade(sv,0);
8309 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8310 * this function provided for binary compatibility only
8314 Perl_sv_pvutf8(pTHX_ SV *sv)
8316 sv_utf8_upgrade(sv);
8321 =for apidoc sv_pvutf8
8323 Use the C<SvPVutf8_nolen> macro instead
8325 =for apidoc sv_pvutf8n
8327 A private implementation of the C<SvPVutf8> macro for compilers
8328 which can't cope with complex macro expressions. Always use the macro
8335 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8337 sv_utf8_upgrade(sv);
8338 return sv_pvn(sv,lp);
8342 =for apidoc sv_pvutf8n_force
8344 A private implementation of the C<SvPVutf8_force> macro for compilers
8345 which can't cope with complex macro expressions. Always use the macro
8352 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8354 sv_pvn_force(sv,lp);
8355 sv_utf8_upgrade(sv);
8361 =for apidoc sv_reftype
8363 Returns a string describing what the SV is a reference to.
8369 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8371 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8372 inside return suggests a const propagation bug in g++. */
8373 if (ob && SvOBJECT(sv)) {
8374 char *name = HvNAME(SvSTASH(sv));
8375 return name ? name : (char *) "__ANON__";
8378 switch (SvTYPE(sv)) {
8395 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8396 /* tied lvalues should appear to be
8397 * scalars for backwards compatitbility */
8398 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8399 ? "SCALAR" : "LVALUE");
8400 case SVt_PVAV: return "ARRAY";
8401 case SVt_PVHV: return "HASH";
8402 case SVt_PVCV: return "CODE";
8403 case SVt_PVGV: return "GLOB";
8404 case SVt_PVFM: return "FORMAT";
8405 case SVt_PVIO: return "IO";
8406 default: return "UNKNOWN";
8412 =for apidoc sv_isobject
8414 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8415 object. If the SV is not an RV, or if the object is not blessed, then this
8422 Perl_sv_isobject(pTHX_ SV *sv)
8439 Returns a boolean indicating whether the SV is blessed into the specified
8440 class. This does not check for subtypes; use C<sv_derived_from> to verify
8441 an inheritance relationship.
8447 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8458 if (!HvNAME(SvSTASH(sv)))
8461 return strEQ(HvNAME(SvSTASH(sv)), name);
8467 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8468 it will be upgraded to one. If C<classname> is non-null then the new SV will
8469 be blessed in the specified package. The new SV is returned and its
8470 reference count is 1.
8476 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8482 SV_CHECK_THINKFIRST_COW_DROP(rv);
8485 if (SvTYPE(rv) >= SVt_PVMG) {
8486 U32 refcnt = SvREFCNT(rv);
8490 SvREFCNT(rv) = refcnt;
8493 if (SvTYPE(rv) < SVt_RV)
8494 sv_upgrade(rv, SVt_RV);
8495 else if (SvTYPE(rv) > SVt_RV) {
8497 if (SvPVX(rv) && SvLEN(rv))
8498 Safefree(SvPVX(rv));
8508 HV* stash = gv_stashpv(classname, TRUE);
8509 (void)sv_bless(rv, stash);
8515 =for apidoc sv_setref_pv
8517 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8518 argument will be upgraded to an RV. That RV will be modified to point to
8519 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8520 into the SV. The C<classname> argument indicates the package for the
8521 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8522 will have a reference count of 1, and the RV will be returned.
8524 Do not use with other Perl types such as HV, AV, SV, CV, because those
8525 objects will become corrupted by the pointer copy process.
8527 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8533 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8536 sv_setsv(rv, &PL_sv_undef);
8540 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8545 =for apidoc sv_setref_iv
8547 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8548 argument will be upgraded to an RV. That RV will be modified to point to
8549 the new SV. The C<classname> argument indicates the package for the
8550 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8551 will have a reference count of 1, and the RV will be returned.
8557 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8559 sv_setiv(newSVrv(rv,classname), iv);
8564 =for apidoc sv_setref_uv
8566 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8567 argument will be upgraded to an RV. That RV will be modified to point to
8568 the new SV. The C<classname> argument indicates the package for the
8569 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8570 will have a reference count of 1, and the RV will be returned.
8576 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8578 sv_setuv(newSVrv(rv,classname), uv);
8583 =for apidoc sv_setref_nv
8585 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8586 argument will be upgraded to an RV. That RV will be modified to point to
8587 the new SV. The C<classname> argument indicates the package for the
8588 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8589 will have a reference count of 1, and the RV will be returned.
8595 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8597 sv_setnv(newSVrv(rv,classname), nv);
8602 =for apidoc sv_setref_pvn
8604 Copies a string into a new SV, optionally blessing the SV. The length of the
8605 string must be specified with C<n>. The C<rv> argument will be upgraded to
8606 an RV. That RV will be modified to point to the new SV. The C<classname>
8607 argument indicates the package for the blessing. Set C<classname> to
8608 C<Nullch> to avoid the blessing. The new SV will have a reference count
8609 of 1, and the RV will be returned.
8611 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8617 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8619 sv_setpvn(newSVrv(rv,classname), pv, n);
8624 =for apidoc sv_bless
8626 Blesses an SV into a specified package. The SV must be an RV. The package
8627 must be designated by its stash (see C<gv_stashpv()>). The reference count
8628 of the SV is unaffected.
8634 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8638 Perl_croak(aTHX_ "Can't bless non-reference value");
8640 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8641 if (SvREADONLY(tmpRef))
8642 Perl_croak(aTHX_ PL_no_modify);
8643 if (SvOBJECT(tmpRef)) {
8644 if (SvTYPE(tmpRef) != SVt_PVIO)
8646 SvREFCNT_dec(SvSTASH(tmpRef));
8649 SvOBJECT_on(tmpRef);
8650 if (SvTYPE(tmpRef) != SVt_PVIO)
8652 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8653 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8660 if(SvSMAGICAL(tmpRef))
8661 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8669 /* Downgrades a PVGV to a PVMG.
8673 S_sv_unglob(pTHX_ SV *sv)
8677 assert(SvTYPE(sv) == SVt_PVGV);
8682 SvREFCNT_dec(GvSTASH(sv));
8683 GvSTASH(sv) = Nullhv;
8685 sv_unmagic(sv, PERL_MAGIC_glob);
8686 Safefree(GvNAME(sv));
8689 /* need to keep SvANY(sv) in the right arena */
8690 xpvmg = new_XPVMG();
8691 StructCopy(SvANY(sv), xpvmg, XPVMG);
8692 del_XPVGV(SvANY(sv));
8695 SvFLAGS(sv) &= ~SVTYPEMASK;
8696 SvFLAGS(sv) |= SVt_PVMG;
8700 =for apidoc sv_unref_flags
8702 Unsets the RV status of the SV, and decrements the reference count of
8703 whatever was being referenced by the RV. This can almost be thought of
8704 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8705 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8706 (otherwise the decrementing is conditional on the reference count being
8707 different from one or the reference being a readonly SV).
8714 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8718 if (SvWEAKREF(sv)) {
8726 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8727 assigned to as BEGIN {$a = \"Foo"} will fail. */
8728 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8730 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8731 sv_2mortal(rv); /* Schedule for freeing later */
8735 =for apidoc sv_unref
8737 Unsets the RV status of the SV, and decrements the reference count of
8738 whatever was being referenced by the RV. This can almost be thought of
8739 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8740 being zero. See C<SvROK_off>.
8746 Perl_sv_unref(pTHX_ SV *sv)
8748 sv_unref_flags(sv, 0);
8752 =for apidoc sv_taint
8754 Taint an SV. Use C<SvTAINTED_on> instead.
8759 Perl_sv_taint(pTHX_ SV *sv)
8761 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8765 =for apidoc sv_untaint
8767 Untaint an SV. Use C<SvTAINTED_off> instead.
8772 Perl_sv_untaint(pTHX_ SV *sv)
8774 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8775 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8782 =for apidoc sv_tainted
8784 Test an SV for taintedness. Use C<SvTAINTED> instead.
8789 Perl_sv_tainted(pTHX_ SV *sv)
8791 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8792 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8793 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8800 =for apidoc sv_setpviv
8802 Copies an integer into the given SV, also updating its string value.
8803 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8809 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8811 char buf[TYPE_CHARS(UV)];
8813 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8815 sv_setpvn(sv, ptr, ebuf - ptr);
8819 =for apidoc sv_setpviv_mg
8821 Like C<sv_setpviv>, but also handles 'set' magic.
8827 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8829 char buf[TYPE_CHARS(UV)];
8831 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8833 sv_setpvn(sv, ptr, ebuf - ptr);
8837 #if defined(PERL_IMPLICIT_CONTEXT)
8839 /* pTHX_ magic can't cope with varargs, so this is a no-context
8840 * version of the main function, (which may itself be aliased to us).
8841 * Don't access this version directly.
8845 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8849 va_start(args, pat);
8850 sv_vsetpvf(sv, pat, &args);
8854 /* pTHX_ magic can't cope with varargs, so this is a no-context
8855 * version of the main function, (which may itself be aliased to us).
8856 * Don't access this version directly.
8860 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8864 va_start(args, pat);
8865 sv_vsetpvf_mg(sv, pat, &args);
8871 =for apidoc sv_setpvf
8873 Works like C<sv_catpvf> but copies the text into the SV instead of
8874 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8880 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8883 va_start(args, pat);
8884 sv_vsetpvf(sv, pat, &args);
8889 =for apidoc sv_vsetpvf
8891 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8892 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8894 Usually used via its frontend C<sv_setpvf>.
8900 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8902 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8906 =for apidoc sv_setpvf_mg
8908 Like C<sv_setpvf>, but also handles 'set' magic.
8914 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8917 va_start(args, pat);
8918 sv_vsetpvf_mg(sv, pat, &args);
8923 =for apidoc sv_vsetpvf_mg
8925 Like C<sv_vsetpvf>, but also handles 'set' magic.
8927 Usually used via its frontend C<sv_setpvf_mg>.
8933 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8935 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8939 #if defined(PERL_IMPLICIT_CONTEXT)
8941 /* pTHX_ magic can't cope with varargs, so this is a no-context
8942 * version of the main function, (which may itself be aliased to us).
8943 * Don't access this version directly.
8947 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8951 va_start(args, pat);
8952 sv_vcatpvf(sv, pat, &args);
8956 /* pTHX_ magic can't cope with varargs, so this is a no-context
8957 * version of the main function, (which may itself be aliased to us).
8958 * Don't access this version directly.
8962 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8966 va_start(args, pat);
8967 sv_vcatpvf_mg(sv, pat, &args);
8973 =for apidoc sv_catpvf
8975 Processes its arguments like C<sprintf> and appends the formatted
8976 output to an SV. If the appended data contains "wide" characters
8977 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8978 and characters >255 formatted with %c), the original SV might get
8979 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8980 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8981 valid UTF-8; if the original SV was bytes, the pattern should be too.
8986 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8989 va_start(args, pat);
8990 sv_vcatpvf(sv, pat, &args);
8995 =for apidoc sv_vcatpvf
8997 Processes its arguments like C<vsprintf> and appends the formatted output
8998 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
9000 Usually used via its frontend C<sv_catpvf>.
9006 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
9008 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9012 =for apidoc sv_catpvf_mg
9014 Like C<sv_catpvf>, but also handles 'set' magic.
9020 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9023 va_start(args, pat);
9024 sv_vcatpvf_mg(sv, pat, &args);
9029 =for apidoc sv_vcatpvf_mg
9031 Like C<sv_vcatpvf>, but also handles 'set' magic.
9033 Usually used via its frontend C<sv_catpvf_mg>.
9039 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9041 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9046 =for apidoc sv_vsetpvfn
9048 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9051 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9057 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9059 sv_setpvn(sv, "", 0);
9060 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9063 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9066 S_expect_number(pTHX_ char** pattern)
9069 switch (**pattern) {
9070 case '1': case '2': case '3':
9071 case '4': case '5': case '6':
9072 case '7': case '8': case '9':
9073 while (isDIGIT(**pattern))
9074 var = var * 10 + (*(*pattern)++ - '0');
9078 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9081 F0convert(NV nv, char *endbuf, STRLEN *len)
9092 if (uv & 1 && uv == nv)
9093 uv--; /* Round to even */
9095 unsigned dig = uv % 10;
9108 =for apidoc sv_vcatpvfn
9110 Processes its arguments like C<vsprintf> and appends the formatted output
9111 to an SV. Uses an array of SVs if the C style variable argument list is
9112 missing (NULL). When running with taint checks enabled, indicates via
9113 C<maybe_tainted> if results are untrustworthy (often due to the use of
9116 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9121 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9124 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9131 static const char nullstr[] = "(null)";
9133 bool has_utf8; /* has the result utf8? */
9134 bool pat_utf8; /* the pattern is in utf8? */
9136 /* Times 4: a decimal digit takes more than 3 binary digits.
9137 * NV_DIG: mantissa takes than many decimal digits.
9138 * Plus 32: Playing safe. */
9139 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9140 /* large enough for "%#.#f" --chip */
9141 /* what about long double NVs? --jhi */
9143 has_utf8 = pat_utf8 = DO_UTF8(sv);
9145 /* no matter what, this is a string now */
9146 (void)SvPV_force(sv, origlen);
9148 /* special-case "", "%s", and "%_" */
9151 if (patlen == 2 && pat[0] == '%') {
9155 const char *s = va_arg(*args, char*);
9156 sv_catpv(sv, s ? s : nullstr);
9158 else if (svix < svmax) {
9159 sv_catsv(sv, *svargs);
9160 if (DO_UTF8(*svargs))
9166 argsv = va_arg(*args, SV*);
9167 sv_catsv(sv, argsv);
9172 /* See comment on '_' below */
9177 #ifndef USE_LONG_DOUBLE
9178 /* special-case "%.<number>[gf]" */
9179 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9180 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9181 unsigned digits = 0;
9185 while (*pp >= '0' && *pp <= '9')
9186 digits = 10 * digits + (*pp++ - '0');
9187 if (pp - pat == (int)patlen - 1) {
9191 nv = (NV)va_arg(*args, double);
9192 else if (svix < svmax)
9197 /* Add check for digits != 0 because it seems that some
9198 gconverts are buggy in this case, and we don't yet have
9199 a Configure test for this. */
9200 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9201 /* 0, point, slack */
9202 Gconvert(nv, (int)digits, 0, ebuf);
9204 if (*ebuf) /* May return an empty string for digits==0 */
9207 } else if (!digits) {
9210 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9211 sv_catpvn(sv, p, l);
9217 #endif /* !USE_LONG_DOUBLE */
9219 if (!args && svix < svmax && DO_UTF8(*svargs))
9222 patend = (char*)pat + patlen;
9223 for (p = (char*)pat; p < patend; p = q) {
9226 bool vectorize = FALSE;
9227 bool vectorarg = FALSE;
9228 bool vec_utf8 = FALSE;
9234 bool has_precis = FALSE;
9237 bool is_utf8 = FALSE; /* is this item utf8? */
9238 #ifdef HAS_LDBL_SPRINTF_BUG
9239 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9240 with sfio - Allen <allens@cpan.org> */
9241 bool fix_ldbl_sprintf_bug = FALSE;
9245 U8 utf8buf[UTF8_MAXBYTES+1];
9246 STRLEN esignlen = 0;
9248 char *eptr = Nullch;
9251 U8 *vecstr = Null(U8*);
9258 /* we need a long double target in case HAS_LONG_DOUBLE but
9261 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9269 const char *dotstr = ".";
9270 STRLEN dotstrlen = 1;
9271 I32 efix = 0; /* explicit format parameter index */
9272 I32 ewix = 0; /* explicit width index */
9273 I32 epix = 0; /* explicit precision index */
9274 I32 evix = 0; /* explicit vector index */
9275 bool asterisk = FALSE;
9277 /* echo everything up to the next format specification */
9278 for (q = p; q < patend && *q != '%'; ++q) ;
9280 if (has_utf8 && !pat_utf8)
9281 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9283 sv_catpvn(sv, p, q - p);
9290 We allow format specification elements in this order:
9291 \d+\$ explicit format parameter index
9293 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9294 0 flag (as above): repeated to allow "v02"
9295 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9296 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9298 [%bcdefginopsux_DFOUX] format (mandatory)
9300 if (EXPECT_NUMBER(q, width)) {
9341 if (EXPECT_NUMBER(q, ewix))
9350 if ((vectorarg = asterisk)) {
9362 EXPECT_NUMBER(q, width);
9367 vecsv = va_arg(*args, SV*);
9369 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9370 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9371 dotstr = SvPVx(vecsv, dotstrlen);
9376 vecsv = va_arg(*args, SV*);
9377 vecstr = (U8*)SvPVx(vecsv,veclen);
9378 vec_utf8 = DO_UTF8(vecsv);
9380 else if (efix ? efix <= svmax : svix < svmax) {
9381 vecsv = svargs[efix ? efix-1 : svix++];
9382 vecstr = (U8*)SvPVx(vecsv,veclen);
9383 vec_utf8 = DO_UTF8(vecsv);
9384 /* if this is a version object, we need to return the
9385 * stringified representation (which the SvPVX has
9386 * already done for us), but not vectorize the args
9388 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9390 q++; /* skip past the rest of the %vd format */
9391 eptr = (char *) vecstr;
9392 elen = strlen(eptr);
9405 i = va_arg(*args, int);
9407 i = (ewix ? ewix <= svmax : svix < svmax) ?
9408 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9410 width = (i < 0) ? -i : i;
9420 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9422 /* XXX: todo, support specified precision parameter */
9426 i = va_arg(*args, int);
9428 i = (ewix ? ewix <= svmax : svix < svmax)
9429 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9430 precis = (i < 0) ? 0 : i;
9435 precis = precis * 10 + (*q++ - '0');
9444 case 'I': /* Ix, I32x, and I64x */
9446 if (q[1] == '6' && q[2] == '4') {
9452 if (q[1] == '3' && q[2] == '2') {
9462 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9473 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9474 if (*(q + 1) == 'l') { /* lld, llf */
9499 argsv = (efix ? efix <= svmax : svix < svmax) ?
9500 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9507 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9509 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9511 eptr = (char*)utf8buf;
9512 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9523 if (args && !vectorize) {
9524 eptr = va_arg(*args, char*);
9526 #ifdef MACOS_TRADITIONAL
9527 /* On MacOS, %#s format is used for Pascal strings */
9532 elen = strlen(eptr);
9534 eptr = (char *)nullstr;
9535 elen = sizeof nullstr - 1;
9539 eptr = SvPVx(argsv, elen);
9540 if (DO_UTF8(argsv)) {
9541 if (has_precis && precis < elen) {
9543 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9546 if (width) { /* fudge width (can't fudge elen) */
9547 width += elen - sv_len_utf8(argsv);
9559 * The "%_" hack might have to be changed someday,
9560 * if ISO or ANSI decide to use '_' for something.
9561 * So we keep it hidden from users' code.
9563 if (!args || vectorize)
9565 argsv = va_arg(*args, SV*);
9566 eptr = SvPVx(argsv, elen);
9572 if (has_precis && elen > precis)
9583 goto format_sv; /* %-p -> %_ */
9587 goto format_sv; /* %-Np -> %.N_ */
9590 if (alt || vectorize)
9592 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9610 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9619 esignbuf[esignlen++] = plus;
9623 case 'h': iv = (short)va_arg(*args, int); break;
9624 case 'l': iv = va_arg(*args, long); break;
9625 case 'V': iv = va_arg(*args, IV); break;
9626 default: iv = va_arg(*args, int); break;
9628 case 'q': iv = va_arg(*args, Quad_t); break;
9633 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9635 case 'h': iv = (short)tiv; break;
9636 case 'l': iv = (long)tiv; break;
9638 default: iv = tiv; break;
9640 case 'q': iv = (Quad_t)tiv; break;
9644 if ( !vectorize ) /* we already set uv above */
9649 esignbuf[esignlen++] = plus;
9653 esignbuf[esignlen++] = '-';
9696 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9707 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9708 case 'l': uv = va_arg(*args, unsigned long); break;
9709 case 'V': uv = va_arg(*args, UV); break;
9710 default: uv = va_arg(*args, unsigned); break;
9712 case 'q': uv = va_arg(*args, Uquad_t); break;
9717 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9719 case 'h': uv = (unsigned short)tuv; break;
9720 case 'l': uv = (unsigned long)tuv; break;
9722 default: uv = tuv; break;
9724 case 'q': uv = (Uquad_t)tuv; break;
9730 eptr = ebuf + sizeof ebuf;
9736 p = (char*)((c == 'X')
9737 ? "0123456789ABCDEF" : "0123456789abcdef");
9743 esignbuf[esignlen++] = '0';
9744 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9750 *--eptr = '0' + dig;
9752 if (alt && *eptr != '0')
9758 *--eptr = '0' + dig;
9761 esignbuf[esignlen++] = '0';
9762 esignbuf[esignlen++] = 'b';
9765 default: /* it had better be ten or less */
9768 *--eptr = '0' + dig;
9769 } while (uv /= base);
9772 elen = (ebuf + sizeof ebuf) - eptr;
9775 zeros = precis - elen;
9776 else if (precis == 0 && elen == 1 && *eptr == '0')
9781 /* FLOATING POINT */
9784 c = 'f'; /* maybe %F isn't supported here */
9790 /* This is evil, but floating point is even more evil */
9792 /* for SV-style calling, we can only get NV
9793 for C-style calling, we assume %f is double;
9794 for simplicity we allow any of %Lf, %llf, %qf for long double
9798 #if defined(USE_LONG_DOUBLE)
9802 /* [perl #20339] - we should accept and ignore %lf rather than die */
9806 #if defined(USE_LONG_DOUBLE)
9807 intsize = args ? 0 : 'q';
9811 #if defined(HAS_LONG_DOUBLE)
9820 /* now we need (long double) if intsize == 'q', else (double) */
9821 nv = (args && !vectorize) ?
9822 #if LONG_DOUBLESIZE > DOUBLESIZE
9824 va_arg(*args, long double) :
9825 va_arg(*args, double)
9827 va_arg(*args, double)
9833 if (c != 'e' && c != 'E') {
9835 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9836 will cast our (long double) to (double) */
9837 (void)Perl_frexp(nv, &i);
9838 if (i == PERL_INT_MIN)
9839 Perl_die(aTHX_ "panic: frexp");
9841 need = BIT_DIGITS(i);
9843 need += has_precis ? precis : 6; /* known default */
9848 #ifdef HAS_LDBL_SPRINTF_BUG
9849 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9850 with sfio - Allen <allens@cpan.org> */
9853 # define MY_DBL_MAX DBL_MAX
9854 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9855 # if DOUBLESIZE >= 8
9856 # define MY_DBL_MAX 1.7976931348623157E+308L
9858 # define MY_DBL_MAX 3.40282347E+38L
9862 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9863 # define MY_DBL_MAX_BUG 1L
9865 # define MY_DBL_MAX_BUG MY_DBL_MAX
9869 # define MY_DBL_MIN DBL_MIN
9870 # else /* XXX guessing! -Allen */
9871 # if DOUBLESIZE >= 8
9872 # define MY_DBL_MIN 2.2250738585072014E-308L
9874 # define MY_DBL_MIN 1.17549435E-38L
9878 if ((intsize == 'q') && (c == 'f') &&
9879 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9881 /* it's going to be short enough that
9882 * long double precision is not needed */
9884 if ((nv <= 0L) && (nv >= -0L))
9885 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9887 /* would use Perl_fp_class as a double-check but not
9888 * functional on IRIX - see perl.h comments */
9890 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9891 /* It's within the range that a double can represent */
9892 #if defined(DBL_MAX) && !defined(DBL_MIN)
9893 if ((nv >= ((long double)1/DBL_MAX)) ||
9894 (nv <= (-(long double)1/DBL_MAX)))
9896 fix_ldbl_sprintf_bug = TRUE;
9899 if (fix_ldbl_sprintf_bug == TRUE) {
9909 # undef MY_DBL_MAX_BUG
9912 #endif /* HAS_LDBL_SPRINTF_BUG */
9914 need += 20; /* fudge factor */
9915 if (PL_efloatsize < need) {
9916 Safefree(PL_efloatbuf);
9917 PL_efloatsize = need + 20; /* more fudge */
9918 New(906, PL_efloatbuf, PL_efloatsize, char);
9919 PL_efloatbuf[0] = '\0';
9922 if ( !(width || left || plus || alt) && fill != '0'
9923 && has_precis && intsize != 'q' ) { /* Shortcuts */
9924 /* See earlier comment about buggy Gconvert when digits,
9926 if ( c == 'g' && precis) {
9927 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9928 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9929 goto float_converted;
9930 } else if ( c == 'f' && !precis) {
9931 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9935 eptr = ebuf + sizeof ebuf;
9938 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9939 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9940 if (intsize == 'q') {
9941 /* Copy the one or more characters in a long double
9942 * format before the 'base' ([efgEFG]) character to
9943 * the format string. */
9944 static char const prifldbl[] = PERL_PRIfldbl;
9945 char const *p = prifldbl + sizeof(prifldbl) - 3;
9946 while (p >= prifldbl) { *--eptr = *p--; }
9951 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9956 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9968 /* No taint. Otherwise we are in the strange situation
9969 * where printf() taints but print($float) doesn't.
9971 #if defined(HAS_LONG_DOUBLE)
9973 (void)sprintf(PL_efloatbuf, eptr, nv);
9975 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9977 (void)sprintf(PL_efloatbuf, eptr, nv);
9980 eptr = PL_efloatbuf;
9981 elen = strlen(PL_efloatbuf);
9987 i = SvCUR(sv) - origlen;
9988 if (args && !vectorize) {
9990 case 'h': *(va_arg(*args, short*)) = i; break;
9991 default: *(va_arg(*args, int*)) = i; break;
9992 case 'l': *(va_arg(*args, long*)) = i; break;
9993 case 'V': *(va_arg(*args, IV*)) = i; break;
9995 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
10000 sv_setuv_mg(argsv, (UV)i);
10002 continue; /* not "break" */
10008 if (!args && ckWARN(WARN_PRINTF) &&
10009 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
10010 SV *msg = sv_newmortal();
10011 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
10012 (PL_op->op_type == OP_PRTF) ? "" : "s");
10015 Perl_sv_catpvf(aTHX_ msg,
10016 "\"%%%c\"", c & 0xFF);
10018 Perl_sv_catpvf(aTHX_ msg,
10019 "\"%%\\%03"UVof"\"",
10022 sv_catpv(msg, "end of string");
10023 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10026 /* output mangled stuff ... */
10032 /* ... right here, because formatting flags should not apply */
10033 SvGROW(sv, SvCUR(sv) + elen + 1);
10035 Copy(eptr, p, elen, char);
10038 SvCUR_set(sv, p - SvPVX(sv));
10040 continue; /* not "break" */
10043 /* calculate width before utf8_upgrade changes it */
10044 have = esignlen + zeros + elen;
10046 if (is_utf8 != has_utf8) {
10049 sv_utf8_upgrade(sv);
10052 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10053 sv_utf8_upgrade(nsv);
10057 SvGROW(sv, SvCUR(sv) + elen + 1);
10062 need = (have > width ? have : width);
10065 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10067 if (esignlen && fill == '0') {
10068 for (i = 0; i < (int)esignlen; i++)
10069 *p++ = esignbuf[i];
10071 if (gap && !left) {
10072 memset(p, fill, gap);
10075 if (esignlen && fill != '0') {
10076 for (i = 0; i < (int)esignlen; i++)
10077 *p++ = esignbuf[i];
10080 for (i = zeros; i; i--)
10084 Copy(eptr, p, elen, char);
10088 memset(p, ' ', gap);
10093 Copy(dotstr, p, dotstrlen, char);
10097 vectorize = FALSE; /* done iterating over vecstr */
10104 SvCUR_set(sv, p - SvPVX(sv));
10112 /* =========================================================================
10114 =head1 Cloning an interpreter
10116 All the macros and functions in this section are for the private use of
10117 the main function, perl_clone().
10119 The foo_dup() functions make an exact copy of an existing foo thinngy.
10120 During the course of a cloning, a hash table is used to map old addresses
10121 to new addresses. The table is created and manipulated with the
10122 ptr_table_* functions.
10126 ============================================================================*/
10129 #if defined(USE_ITHREADS)
10131 #ifndef GpREFCNT_inc
10132 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10136 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10137 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10138 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10139 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10140 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10141 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10142 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10143 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10144 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10145 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10146 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10147 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10148 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10151 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10152 regcomp.c. AMS 20010712 */
10155 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10160 struct reg_substr_datum *s;
10163 return (REGEXP *)NULL;
10165 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10168 len = r->offsets[0];
10169 npar = r->nparens+1;
10171 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10172 Copy(r->program, ret->program, len+1, regnode);
10174 New(0, ret->startp, npar, I32);
10175 Copy(r->startp, ret->startp, npar, I32);
10176 New(0, ret->endp, npar, I32);
10177 Copy(r->startp, ret->startp, npar, I32);
10179 New(0, ret->substrs, 1, struct reg_substr_data);
10180 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10181 s->min_offset = r->substrs->data[i].min_offset;
10182 s->max_offset = r->substrs->data[i].max_offset;
10183 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10184 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10187 ret->regstclass = NULL;
10189 struct reg_data *d;
10190 const int count = r->data->count;
10192 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10193 char, struct reg_data);
10194 New(0, d->what, count, U8);
10197 for (i = 0; i < count; i++) {
10198 d->what[i] = r->data->what[i];
10199 switch (d->what[i]) {
10200 /* legal options are one of: sfpont
10201 see also regcomp.h and pregfree() */
10203 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10206 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10209 /* This is cheating. */
10210 New(0, d->data[i], 1, struct regnode_charclass_class);
10211 StructCopy(r->data->data[i], d->data[i],
10212 struct regnode_charclass_class);
10213 ret->regstclass = (regnode*)d->data[i];
10216 /* Compiled op trees are readonly, and can thus be
10217 shared without duplication. */
10219 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10223 d->data[i] = r->data->data[i];
10226 d->data[i] = r->data->data[i];
10228 ((reg_trie_data*)d->data[i])->refcount++;
10232 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10241 New(0, ret->offsets, 2*len+1, U32);
10242 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10244 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10245 ret->refcnt = r->refcnt;
10246 ret->minlen = r->minlen;
10247 ret->prelen = r->prelen;
10248 ret->nparens = r->nparens;
10249 ret->lastparen = r->lastparen;
10250 ret->lastcloseparen = r->lastcloseparen;
10251 ret->reganch = r->reganch;
10253 ret->sublen = r->sublen;
10255 if (RX_MATCH_COPIED(ret))
10256 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10258 ret->subbeg = Nullch;
10259 #ifdef PERL_COPY_ON_WRITE
10260 ret->saved_copy = Nullsv;
10263 ptr_table_store(PL_ptr_table, r, ret);
10267 /* duplicate a file handle */
10270 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10276 return (PerlIO*)NULL;
10278 /* look for it in the table first */
10279 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10283 /* create anew and remember what it is */
10284 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10285 ptr_table_store(PL_ptr_table, fp, ret);
10289 /* duplicate a directory handle */
10292 Perl_dirp_dup(pTHX_ DIR *dp)
10300 /* duplicate a typeglob */
10303 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10308 /* look for it in the table first */
10309 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10313 /* create anew and remember what it is */
10314 Newz(0, ret, 1, GP);
10315 ptr_table_store(PL_ptr_table, gp, ret);
10318 ret->gp_refcnt = 0; /* must be before any other dups! */
10319 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10320 ret->gp_io = io_dup_inc(gp->gp_io, param);
10321 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10322 ret->gp_av = av_dup_inc(gp->gp_av, param);
10323 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10324 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10325 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10326 ret->gp_cvgen = gp->gp_cvgen;
10327 ret->gp_flags = gp->gp_flags;
10328 ret->gp_line = gp->gp_line;
10329 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10333 /* duplicate a chain of magic */
10336 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10338 MAGIC *mgprev = (MAGIC*)NULL;
10341 return (MAGIC*)NULL;
10342 /* look for it in the table first */
10343 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10347 for (; mg; mg = mg->mg_moremagic) {
10349 Newz(0, nmg, 1, MAGIC);
10351 mgprev->mg_moremagic = nmg;
10354 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10355 nmg->mg_private = mg->mg_private;
10356 nmg->mg_type = mg->mg_type;
10357 nmg->mg_flags = mg->mg_flags;
10358 if (mg->mg_type == PERL_MAGIC_qr) {
10359 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10361 else if(mg->mg_type == PERL_MAGIC_backref) {
10362 const AV * const av = (AV*) mg->mg_obj;
10365 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10367 for (i = AvFILLp(av); i >= 0; i--) {
10368 if (!svp[i]) continue;
10369 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10373 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10374 ? sv_dup_inc(mg->mg_obj, param)
10375 : sv_dup(mg->mg_obj, param);
10377 nmg->mg_len = mg->mg_len;
10378 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10379 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10380 if (mg->mg_len > 0) {
10381 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10382 if (mg->mg_type == PERL_MAGIC_overload_table &&
10383 AMT_AMAGIC((AMT*)mg->mg_ptr))
10385 AMT *amtp = (AMT*)mg->mg_ptr;
10386 AMT *namtp = (AMT*)nmg->mg_ptr;
10388 for (i = 1; i < NofAMmeth; i++) {
10389 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10393 else if (mg->mg_len == HEf_SVKEY)
10394 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10396 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10397 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10404 /* create a new pointer-mapping table */
10407 Perl_ptr_table_new(pTHX)
10410 Newz(0, tbl, 1, PTR_TBL_t);
10411 tbl->tbl_max = 511;
10412 tbl->tbl_items = 0;
10413 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10418 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10420 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10423 /* map an existing pointer using a table */
10426 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10428 PTR_TBL_ENT_t *tblent;
10429 UV hash = PTR_TABLE_HASH(sv);
10431 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10432 for (; tblent; tblent = tblent->next) {
10433 if (tblent->oldval == sv)
10434 return tblent->newval;
10436 return (void*)NULL;
10439 /* add a new entry to a pointer-mapping table */
10442 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10444 PTR_TBL_ENT_t *tblent, **otblent;
10445 /* XXX this may be pessimal on platforms where pointers aren't good
10446 * hash values e.g. if they grow faster in the most significant
10448 UV hash = PTR_TABLE_HASH(oldv);
10452 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10453 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10454 if (tblent->oldval == oldv) {
10455 tblent->newval = newv;
10459 Newz(0, tblent, 1, PTR_TBL_ENT_t);
10460 tblent->oldval = oldv;
10461 tblent->newval = newv;
10462 tblent->next = *otblent;
10465 if (!empty && tbl->tbl_items > tbl->tbl_max)
10466 ptr_table_split(tbl);
10469 /* double the hash bucket size of an existing ptr table */
10472 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10474 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10475 UV oldsize = tbl->tbl_max + 1;
10476 UV newsize = oldsize * 2;
10479 Renew(ary, newsize, PTR_TBL_ENT_t*);
10480 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10481 tbl->tbl_max = --newsize;
10482 tbl->tbl_ary = ary;
10483 for (i=0; i < oldsize; i++, ary++) {
10484 PTR_TBL_ENT_t **curentp, **entp, *ent;
10487 curentp = ary + oldsize;
10488 for (entp = ary, ent = *ary; ent; ent = *entp) {
10489 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10491 ent->next = *curentp;
10501 /* remove all the entries from a ptr table */
10504 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10506 register PTR_TBL_ENT_t **array;
10507 register PTR_TBL_ENT_t *entry;
10508 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
10512 if (!tbl || !tbl->tbl_items) {
10516 array = tbl->tbl_ary;
10518 max = tbl->tbl_max;
10523 entry = entry->next;
10527 if (++riter > max) {
10530 entry = array[riter];
10534 tbl->tbl_items = 0;
10537 /* clear and free a ptr table */
10540 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10545 ptr_table_clear(tbl);
10546 Safefree(tbl->tbl_ary);
10550 /* attempt to make everything in the typeglob readonly */
10553 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10555 GV *gv = (GV*)sstr;
10556 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10558 if (GvIO(gv) || GvFORM(gv)) {
10559 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10561 else if (!GvCV(gv)) {
10562 GvCV(gv) = (CV*)sv;
10565 /* CvPADLISTs cannot be shared */
10566 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10571 if (!GvUNIQUE(gv)) {
10573 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10574 HvNAME(GvSTASH(gv)), GvNAME(gv));
10580 * write attempts will die with
10581 * "Modification of a read-only value attempted"
10587 SvREADONLY_on(GvSV(gv));
10591 GvAV(gv) = (AV*)sv;
10594 SvREADONLY_on(GvAV(gv));
10598 GvHV(gv) = (HV*)sv;
10601 SvREADONLY_on(GvHV(gv));
10604 return sstr; /* he_dup() will SvREFCNT_inc() */
10607 /* duplicate an SV of any type (including AV, HV etc) */
10610 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10613 SvRV_set(dstr, SvWEAKREF(sstr)
10614 ? sv_dup(SvRV(sstr), param)
10615 : sv_dup_inc(SvRV(sstr), param));
10618 else if (SvPVX(sstr)) {
10619 /* Has something there */
10621 /* Normal PV - clone whole allocated space */
10622 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10623 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10624 /* Not that normal - actually sstr is copy on write.
10625 But we are a true, independant SV, so: */
10626 SvREADONLY_off(dstr);
10631 /* Special case - not normally malloced for some reason */
10632 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10633 /* A "shared" PV - clone it as unshared string */
10634 if(SvPADTMP(sstr)) {
10635 /* However, some of them live in the pad
10636 and they should not have these flags
10639 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10641 SvUV_set(dstr, SvUVX(sstr));
10644 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10646 SvREADONLY_off(dstr);
10650 /* Some other special case - random pointer */
10651 SvPV_set(dstr, SvPVX(sstr));
10656 /* Copy the Null */
10657 if (SvTYPE(dstr) == SVt_RV)
10658 SvRV_set(dstr, NULL);
10665 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10670 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10672 /* look for it in the table first */
10673 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10677 if(param->flags & CLONEf_JOIN_IN) {
10678 /** We are joining here so we don't want do clone
10679 something that is bad **/
10681 if(SvTYPE(sstr) == SVt_PVHV &&
10683 /** don't clone stashes if they already exist **/
10684 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10685 return (SV*) old_stash;
10689 /* create anew and remember what it is */
10692 #ifdef DEBUG_LEAKING_SCALARS
10693 dstr->sv_debug_optype = sstr->sv_debug_optype;
10694 dstr->sv_debug_line = sstr->sv_debug_line;
10695 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10696 dstr->sv_debug_cloned = 1;
10698 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10700 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10704 ptr_table_store(PL_ptr_table, sstr, dstr);
10707 SvFLAGS(dstr) = SvFLAGS(sstr);
10708 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10709 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10712 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10713 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10714 PL_watch_pvx, SvPVX(sstr));
10717 /* don't clone objects whose class has asked us not to */
10718 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10719 SvFLAGS(dstr) &= ~SVTYPEMASK;
10720 SvOBJECT_off(dstr);
10724 switch (SvTYPE(sstr)) {
10726 SvANY(dstr) = NULL;
10729 SvANY(dstr) = new_XIV();
10730 SvIV_set(dstr, SvIVX(sstr));
10733 SvANY(dstr) = new_XNV();
10734 SvNV_set(dstr, SvNVX(sstr));
10737 SvANY(dstr) = new_XRV();
10738 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10741 SvANY(dstr) = new_XPV();
10742 SvCUR_set(dstr, SvCUR(sstr));
10743 SvLEN_set(dstr, SvLEN(sstr));
10744 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10747 SvANY(dstr) = new_XPVIV();
10748 SvCUR_set(dstr, SvCUR(sstr));
10749 SvLEN_set(dstr, SvLEN(sstr));
10750 SvIV_set(dstr, SvIVX(sstr));
10751 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10754 SvANY(dstr) = new_XPVNV();
10755 SvCUR_set(dstr, SvCUR(sstr));
10756 SvLEN_set(dstr, SvLEN(sstr));
10757 SvIV_set(dstr, SvIVX(sstr));
10758 SvNV_set(dstr, SvNVX(sstr));
10759 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10762 SvANY(dstr) = new_XPVMG();
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);
10772 SvANY(dstr) = new_XPVBM();
10773 SvCUR_set(dstr, SvCUR(sstr));
10774 SvLEN_set(dstr, SvLEN(sstr));
10775 SvIV_set(dstr, SvIVX(sstr));
10776 SvNV_set(dstr, SvNVX(sstr));
10777 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10778 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10779 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10780 BmRARE(dstr) = BmRARE(sstr);
10781 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10782 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10785 SvANY(dstr) = new_XPVLV();
10786 SvCUR_set(dstr, SvCUR(sstr));
10787 SvLEN_set(dstr, SvLEN(sstr));
10788 SvIV_set(dstr, SvIVX(sstr));
10789 SvNV_set(dstr, SvNVX(sstr));
10790 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10791 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10792 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10793 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10794 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10795 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10796 LvTARG(dstr) = dstr;
10797 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10798 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10800 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10801 LvTYPE(dstr) = LvTYPE(sstr);
10804 if (GvUNIQUE((GV*)sstr)) {
10806 if ((share = gv_share(sstr, param))) {
10809 ptr_table_store(PL_ptr_table, sstr, dstr);
10811 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10812 HvNAME(GvSTASH(share)), GvNAME(share));
10817 SvANY(dstr) = new_XPVGV();
10818 SvCUR_set(dstr, SvCUR(sstr));
10819 SvLEN_set(dstr, SvLEN(sstr));
10820 SvIV_set(dstr, SvIVX(sstr));
10821 SvNV_set(dstr, SvNVX(sstr));
10822 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10823 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10824 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10825 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10826 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10827 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10828 GvFLAGS(dstr) = GvFLAGS(sstr);
10829 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10830 (void)GpREFCNT_inc(GvGP(dstr));
10833 SvANY(dstr) = new_XPVIO();
10834 SvCUR_set(dstr, SvCUR(sstr));
10835 SvLEN_set(dstr, SvLEN(sstr));
10836 SvIV_set(dstr, SvIVX(sstr));
10837 SvNV_set(dstr, SvNVX(sstr));
10838 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10839 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10840 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10841 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10842 if (IoOFP(sstr) == IoIFP(sstr))
10843 IoOFP(dstr) = IoIFP(dstr);
10845 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10846 /* PL_rsfp_filters entries have fake IoDIRP() */
10847 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10848 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10850 IoDIRP(dstr) = IoDIRP(sstr);
10851 IoLINES(dstr) = IoLINES(sstr);
10852 IoPAGE(dstr) = IoPAGE(sstr);
10853 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10854 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10855 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10856 /* I have no idea why fake dirp (rsfps)
10857 should be treaded differently but otherwise
10858 we end up with leaks -- sky*/
10859 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10860 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10861 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10863 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10864 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10865 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10867 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10868 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10869 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10870 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10871 IoTYPE(dstr) = IoTYPE(sstr);
10872 IoFLAGS(dstr) = IoFLAGS(sstr);
10875 SvANY(dstr) = new_XPVAV();
10876 SvCUR_set(dstr, SvCUR(sstr));
10877 SvLEN_set(dstr, SvLEN(sstr));
10878 SvIV_set(dstr, SvIVX(sstr));
10879 SvNV_set(dstr, SvNVX(sstr));
10880 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10881 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10882 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10883 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10884 if (AvARRAY((AV*)sstr)) {
10885 SV **dst_ary, **src_ary;
10886 SSize_t items = AvFILLp((AV*)sstr) + 1;
10888 src_ary = AvARRAY((AV*)sstr);
10889 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10890 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10891 SvPV_set(dstr, (char*)dst_ary);
10892 AvALLOC((AV*)dstr) = dst_ary;
10893 if (AvREAL((AV*)sstr)) {
10894 while (items-- > 0)
10895 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10898 while (items-- > 0)
10899 *dst_ary++ = sv_dup(*src_ary++, param);
10901 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10902 while (items-- > 0) {
10903 *dst_ary++ = &PL_sv_undef;
10907 SvPV_set(dstr, Nullch);
10908 AvALLOC((AV*)dstr) = (SV**)NULL;
10912 SvANY(dstr) = new_XPVHV();
10913 SvCUR_set(dstr, SvCUR(sstr));
10914 SvLEN_set(dstr, SvLEN(sstr));
10915 SvIV_set(dstr, SvIVX(sstr));
10916 SvNV_set(dstr, SvNVX(sstr));
10917 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10918 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10919 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10920 if (HvARRAY((HV*)sstr)) {
10922 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10923 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10924 Newz(0, dxhv->xhv_array,
10925 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10926 while (i <= sxhv->xhv_max) {
10927 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10928 (bool)!!HvSHAREKEYS(sstr),
10932 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10933 (bool)!!HvSHAREKEYS(sstr), param);
10936 SvPV_set(dstr, Nullch);
10937 HvEITER((HV*)dstr) = (HE*)NULL;
10939 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10940 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10941 /* Record stashes for possible cloning in Perl_clone(). */
10942 if(HvNAME((HV*)dstr))
10943 av_push(param->stashes, dstr);
10946 SvANY(dstr) = new_XPVFM();
10947 FmLINES(dstr) = FmLINES(sstr);
10951 SvANY(dstr) = new_XPVCV();
10953 SvCUR_set(dstr, SvCUR(sstr));
10954 SvLEN_set(dstr, SvLEN(sstr));
10955 SvIV_set(dstr, SvIVX(sstr));
10956 SvNV_set(dstr, SvNVX(sstr));
10957 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10958 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10959 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10960 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10961 CvSTART(dstr) = CvSTART(sstr);
10963 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10965 CvXSUB(dstr) = CvXSUB(sstr);
10966 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10967 if (CvCONST(sstr)) {
10968 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10969 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10970 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
10972 /* don't dup if copying back - CvGV isn't refcounted, so the
10973 * duped GV may never be freed. A bit of a hack! DAPM */
10974 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10975 Nullgv : gv_dup(CvGV(sstr), param) ;
10976 if (param->flags & CLONEf_COPY_STACKS) {
10977 CvDEPTH(dstr) = CvDEPTH(sstr);
10981 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10982 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10984 CvWEAKOUTSIDE(sstr)
10985 ? cv_dup( CvOUTSIDE(sstr), param)
10986 : cv_dup_inc(CvOUTSIDE(sstr), param);
10987 CvFLAGS(dstr) = CvFLAGS(sstr);
10988 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10991 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10995 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
11001 /* duplicate a context */
11004 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11006 PERL_CONTEXT *ncxs;
11009 return (PERL_CONTEXT*)NULL;
11011 /* look for it in the table first */
11012 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11016 /* create anew and remember what it is */
11017 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11018 ptr_table_store(PL_ptr_table, cxs, ncxs);
11021 PERL_CONTEXT *cx = &cxs[ix];
11022 PERL_CONTEXT *ncx = &ncxs[ix];
11023 ncx->cx_type = cx->cx_type;
11024 if (CxTYPE(cx) == CXt_SUBST) {
11025 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11028 ncx->blk_oldsp = cx->blk_oldsp;
11029 ncx->blk_oldcop = cx->blk_oldcop;
11030 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11031 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11032 ncx->blk_oldpm = cx->blk_oldpm;
11033 ncx->blk_gimme = cx->blk_gimme;
11034 switch (CxTYPE(cx)) {
11036 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11037 ? cv_dup_inc(cx->blk_sub.cv, param)
11038 : cv_dup(cx->blk_sub.cv,param));
11039 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11040 ? av_dup_inc(cx->blk_sub.argarray, param)
11042 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11043 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11044 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11045 ncx->blk_sub.lval = cx->blk_sub.lval;
11046 ncx->blk_sub.retop = cx->blk_sub.retop;
11049 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11050 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11051 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11052 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11053 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11054 ncx->blk_eval.retop = cx->blk_eval.retop;
11057 ncx->blk_loop.label = cx->blk_loop.label;
11058 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11059 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11060 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11061 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11062 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11063 ? cx->blk_loop.iterdata
11064 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11065 ncx->blk_loop.oldcomppad
11066 = (PAD*)ptr_table_fetch(PL_ptr_table,
11067 cx->blk_loop.oldcomppad);
11068 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11069 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11070 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11071 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11072 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11075 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11076 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11077 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11078 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11079 ncx->blk_sub.retop = cx->blk_sub.retop;
11091 /* duplicate a stack info structure */
11094 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11099 return (PERL_SI*)NULL;
11101 /* look for it in the table first */
11102 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11106 /* create anew and remember what it is */
11107 Newz(56, nsi, 1, PERL_SI);
11108 ptr_table_store(PL_ptr_table, si, nsi);
11110 nsi->si_stack = av_dup_inc(si->si_stack, param);
11111 nsi->si_cxix = si->si_cxix;
11112 nsi->si_cxmax = si->si_cxmax;
11113 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11114 nsi->si_type = si->si_type;
11115 nsi->si_prev = si_dup(si->si_prev, param);
11116 nsi->si_next = si_dup(si->si_next, param);
11117 nsi->si_markoff = si->si_markoff;
11122 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11123 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11124 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11125 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11126 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11127 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11128 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11129 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11130 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11131 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11132 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11133 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11134 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11135 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11138 #define pv_dup_inc(p) SAVEPV(p)
11139 #define pv_dup(p) SAVEPV(p)
11140 #define svp_dup_inc(p,pp) any_dup(p,pp)
11142 /* map any object to the new equivent - either something in the
11143 * ptr table, or something in the interpreter structure
11147 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11152 return (void*)NULL;
11154 /* look for it in the table first */
11155 ret = ptr_table_fetch(PL_ptr_table, v);
11159 /* see if it is part of the interpreter structure */
11160 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11161 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11169 /* duplicate the save stack */
11172 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11174 ANY *ss = proto_perl->Tsavestack;
11175 I32 ix = proto_perl->Tsavestack_ix;
11176 I32 max = proto_perl->Tsavestack_max;
11189 void (*dptr) (void*);
11190 void (*dxptr) (pTHX_ void*);
11193 Newz(54, nss, max, ANY);
11197 TOPINT(nss,ix) = i;
11199 case SAVEt_ITEM: /* normal string */
11200 sv = (SV*)POPPTR(ss,ix);
11201 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11202 sv = (SV*)POPPTR(ss,ix);
11203 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11205 case SAVEt_SV: /* scalar reference */
11206 sv = (SV*)POPPTR(ss,ix);
11207 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11208 gv = (GV*)POPPTR(ss,ix);
11209 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11211 case SAVEt_GENERIC_PVREF: /* generic char* */
11212 c = (char*)POPPTR(ss,ix);
11213 TOPPTR(nss,ix) = pv_dup(c);
11214 ptr = POPPTR(ss,ix);
11215 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11217 case SAVEt_SHARED_PVREF: /* char* in shared space */
11218 c = (char*)POPPTR(ss,ix);
11219 TOPPTR(nss,ix) = savesharedpv(c);
11220 ptr = POPPTR(ss,ix);
11221 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11223 case SAVEt_GENERIC_SVREF: /* generic sv */
11224 case SAVEt_SVREF: /* scalar reference */
11225 sv = (SV*)POPPTR(ss,ix);
11226 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11227 ptr = POPPTR(ss,ix);
11228 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11230 case SAVEt_AV: /* array reference */
11231 av = (AV*)POPPTR(ss,ix);
11232 TOPPTR(nss,ix) = av_dup_inc(av, param);
11233 gv = (GV*)POPPTR(ss,ix);
11234 TOPPTR(nss,ix) = gv_dup(gv, param);
11236 case SAVEt_HV: /* hash reference */
11237 hv = (HV*)POPPTR(ss,ix);
11238 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11239 gv = (GV*)POPPTR(ss,ix);
11240 TOPPTR(nss,ix) = gv_dup(gv, param);
11242 case SAVEt_INT: /* int reference */
11243 ptr = POPPTR(ss,ix);
11244 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11245 intval = (int)POPINT(ss,ix);
11246 TOPINT(nss,ix) = intval;
11248 case SAVEt_LONG: /* long reference */
11249 ptr = POPPTR(ss,ix);
11250 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11251 longval = (long)POPLONG(ss,ix);
11252 TOPLONG(nss,ix) = longval;
11254 case SAVEt_I32: /* I32 reference */
11255 case SAVEt_I16: /* I16 reference */
11256 case SAVEt_I8: /* I8 reference */
11257 ptr = POPPTR(ss,ix);
11258 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11260 TOPINT(nss,ix) = i;
11262 case SAVEt_IV: /* IV reference */
11263 ptr = POPPTR(ss,ix);
11264 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11266 TOPIV(nss,ix) = iv;
11268 case SAVEt_SPTR: /* SV* reference */
11269 ptr = POPPTR(ss,ix);
11270 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11271 sv = (SV*)POPPTR(ss,ix);
11272 TOPPTR(nss,ix) = sv_dup(sv, param);
11274 case SAVEt_VPTR: /* random* reference */
11275 ptr = POPPTR(ss,ix);
11276 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11277 ptr = POPPTR(ss,ix);
11278 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11280 case SAVEt_PPTR: /* char* reference */
11281 ptr = POPPTR(ss,ix);
11282 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11283 c = (char*)POPPTR(ss,ix);
11284 TOPPTR(nss,ix) = pv_dup(c);
11286 case SAVEt_HPTR: /* HV* reference */
11287 ptr = POPPTR(ss,ix);
11288 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11289 hv = (HV*)POPPTR(ss,ix);
11290 TOPPTR(nss,ix) = hv_dup(hv, param);
11292 case SAVEt_APTR: /* AV* reference */
11293 ptr = POPPTR(ss,ix);
11294 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11295 av = (AV*)POPPTR(ss,ix);
11296 TOPPTR(nss,ix) = av_dup(av, param);
11299 gv = (GV*)POPPTR(ss,ix);
11300 TOPPTR(nss,ix) = gv_dup(gv, param);
11302 case SAVEt_GP: /* scalar reference */
11303 gp = (GP*)POPPTR(ss,ix);
11304 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11305 (void)GpREFCNT_inc(gp);
11306 gv = (GV*)POPPTR(ss,ix);
11307 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11308 c = (char*)POPPTR(ss,ix);
11309 TOPPTR(nss,ix) = pv_dup(c);
11311 TOPIV(nss,ix) = iv;
11313 TOPIV(nss,ix) = iv;
11316 case SAVEt_MORTALIZESV:
11317 sv = (SV*)POPPTR(ss,ix);
11318 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11321 ptr = POPPTR(ss,ix);
11322 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11323 /* these are assumed to be refcounted properly */
11324 switch (((OP*)ptr)->op_type) {
11326 case OP_LEAVESUBLV:
11330 case OP_LEAVEWRITE:
11331 TOPPTR(nss,ix) = ptr;
11336 TOPPTR(nss,ix) = Nullop;
11341 TOPPTR(nss,ix) = Nullop;
11344 c = (char*)POPPTR(ss,ix);
11345 TOPPTR(nss,ix) = pv_dup_inc(c);
11347 case SAVEt_CLEARSV:
11348 longval = POPLONG(ss,ix);
11349 TOPLONG(nss,ix) = longval;
11352 hv = (HV*)POPPTR(ss,ix);
11353 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11354 c = (char*)POPPTR(ss,ix);
11355 TOPPTR(nss,ix) = pv_dup_inc(c);
11357 TOPINT(nss,ix) = i;
11359 case SAVEt_DESTRUCTOR:
11360 ptr = POPPTR(ss,ix);
11361 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11362 dptr = POPDPTR(ss,ix);
11363 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11365 case SAVEt_DESTRUCTOR_X:
11366 ptr = POPPTR(ss,ix);
11367 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11368 dxptr = POPDXPTR(ss,ix);
11369 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11371 case SAVEt_REGCONTEXT:
11374 TOPINT(nss,ix) = i;
11377 case SAVEt_STACK_POS: /* Position on Perl stack */
11379 TOPINT(nss,ix) = i;
11381 case SAVEt_AELEM: /* array element */
11382 sv = (SV*)POPPTR(ss,ix);
11383 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11385 TOPINT(nss,ix) = i;
11386 av = (AV*)POPPTR(ss,ix);
11387 TOPPTR(nss,ix) = av_dup_inc(av, param);
11389 case SAVEt_HELEM: /* hash element */
11390 sv = (SV*)POPPTR(ss,ix);
11391 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11392 sv = (SV*)POPPTR(ss,ix);
11393 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11394 hv = (HV*)POPPTR(ss,ix);
11395 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11398 ptr = POPPTR(ss,ix);
11399 TOPPTR(nss,ix) = ptr;
11403 TOPINT(nss,ix) = i;
11405 case SAVEt_COMPPAD:
11406 av = (AV*)POPPTR(ss,ix);
11407 TOPPTR(nss,ix) = av_dup(av, param);
11410 longval = (long)POPLONG(ss,ix);
11411 TOPLONG(nss,ix) = longval;
11412 ptr = POPPTR(ss,ix);
11413 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11414 sv = (SV*)POPPTR(ss,ix);
11415 TOPPTR(nss,ix) = sv_dup(sv, param);
11418 ptr = POPPTR(ss,ix);
11419 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11420 longval = (long)POPBOOL(ss,ix);
11421 TOPBOOL(nss,ix) = (bool)longval;
11423 case SAVEt_SET_SVFLAGS:
11425 TOPINT(nss,ix) = i;
11427 TOPINT(nss,ix) = i;
11428 sv = (SV*)POPPTR(ss,ix);
11429 TOPPTR(nss,ix) = sv_dup(sv, param);
11432 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11440 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11441 * flag to the result. This is done for each stash before cloning starts,
11442 * so we know which stashes want their objects cloned */
11445 do_mark_cloneable_stash(pTHX_ SV *sv)
11447 if (HvNAME((HV*)sv)) {
11448 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11449 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11450 if (cloner && GvCV(cloner)) {
11457 XPUSHs(sv_2mortal(newSVpv(HvNAME((HV*)sv), 0)));
11459 call_sv((SV*)GvCV(cloner), G_SCALAR);
11466 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11474 =for apidoc perl_clone
11476 Create and return a new interpreter by cloning the current one.
11478 perl_clone takes these flags as parameters:
11480 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11481 without it we only clone the data and zero the stacks,
11482 with it we copy the stacks and the new perl interpreter is
11483 ready to run at the exact same point as the previous one.
11484 The pseudo-fork code uses COPY_STACKS while the
11485 threads->new doesn't.
11487 CLONEf_KEEP_PTR_TABLE
11488 perl_clone keeps a ptr_table with the pointer of the old
11489 variable as a key and the new variable as a value,
11490 this allows it to check if something has been cloned and not
11491 clone it again but rather just use the value and increase the
11492 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11493 the ptr_table using the function
11494 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11495 reason to keep it around is if you want to dup some of your own
11496 variable who are outside the graph perl scans, example of this
11497 code is in threads.xs create
11500 This is a win32 thing, it is ignored on unix, it tells perls
11501 win32host code (which is c++) to clone itself, this is needed on
11502 win32 if you want to run two threads at the same time,
11503 if you just want to do some stuff in a separate perl interpreter
11504 and then throw it away and return to the original one,
11505 you don't need to do anything.
11510 /* XXX the above needs expanding by someone who actually understands it ! */
11511 EXTERN_C PerlInterpreter *
11512 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11515 perl_clone(PerlInterpreter *proto_perl, UV flags)
11518 #ifdef PERL_IMPLICIT_SYS
11520 /* perlhost.h so we need to call into it
11521 to clone the host, CPerlHost should have a c interface, sky */
11523 if (flags & CLONEf_CLONE_HOST) {
11524 return perl_clone_host(proto_perl,flags);
11526 return perl_clone_using(proto_perl, flags,
11528 proto_perl->IMemShared,
11529 proto_perl->IMemParse,
11531 proto_perl->IStdIO,
11535 proto_perl->IProc);
11539 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11540 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11541 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11542 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11543 struct IPerlDir* ipD, struct IPerlSock* ipS,
11544 struct IPerlProc* ipP)
11546 /* XXX many of the string copies here can be optimized if they're
11547 * constants; they need to be allocated as common memory and just
11548 * their pointers copied. */
11551 CLONE_PARAMS clone_params;
11552 CLONE_PARAMS* param = &clone_params;
11554 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11555 /* for each stash, determine whether its objects should be cloned */
11556 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11557 PERL_SET_THX(my_perl);
11560 Poison(my_perl, 1, PerlInterpreter);
11562 PL_curcop = (COP *)Nullop;
11566 PL_savestack_ix = 0;
11567 PL_savestack_max = -1;
11568 PL_sig_pending = 0;
11569 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11570 # else /* !DEBUGGING */
11571 Zero(my_perl, 1, PerlInterpreter);
11572 # endif /* DEBUGGING */
11574 /* host pointers */
11576 PL_MemShared = ipMS;
11577 PL_MemParse = ipMP;
11584 #else /* !PERL_IMPLICIT_SYS */
11586 CLONE_PARAMS clone_params;
11587 CLONE_PARAMS* param = &clone_params;
11588 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11589 /* for each stash, determine whether its objects should be cloned */
11590 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11591 PERL_SET_THX(my_perl);
11594 Poison(my_perl, 1, PerlInterpreter);
11596 PL_curcop = (COP *)Nullop;
11600 PL_savestack_ix = 0;
11601 PL_savestack_max = -1;
11602 PL_sig_pending = 0;
11603 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11604 # else /* !DEBUGGING */
11605 Zero(my_perl, 1, PerlInterpreter);
11606 # endif /* DEBUGGING */
11607 #endif /* PERL_IMPLICIT_SYS */
11608 param->flags = flags;
11609 param->proto_perl = proto_perl;
11612 PL_xiv_arenaroot = NULL;
11613 PL_xiv_root = NULL;
11614 PL_xnv_arenaroot = NULL;
11615 PL_xnv_root = NULL;
11616 PL_xrv_arenaroot = NULL;
11617 PL_xrv_root = NULL;
11618 PL_xpv_arenaroot = NULL;
11619 PL_xpv_root = NULL;
11620 PL_xpviv_arenaroot = NULL;
11621 PL_xpviv_root = NULL;
11622 PL_xpvnv_arenaroot = NULL;
11623 PL_xpvnv_root = NULL;
11624 PL_xpvcv_arenaroot = NULL;
11625 PL_xpvcv_root = NULL;
11626 PL_xpvav_arenaroot = NULL;
11627 PL_xpvav_root = NULL;
11628 PL_xpvhv_arenaroot = NULL;
11629 PL_xpvhv_root = NULL;
11630 PL_xpvmg_arenaroot = NULL;
11631 PL_xpvmg_root = NULL;
11632 PL_xpvlv_arenaroot = NULL;
11633 PL_xpvlv_root = NULL;
11634 PL_xpvbm_arenaroot = NULL;
11635 PL_xpvbm_root = NULL;
11636 PL_he_arenaroot = NULL;
11638 PL_nice_chunk = NULL;
11639 PL_nice_chunk_size = 0;
11641 PL_sv_objcount = 0;
11642 PL_sv_root = Nullsv;
11643 PL_sv_arenaroot = Nullsv;
11645 PL_debug = proto_perl->Idebug;
11647 #ifdef USE_REENTRANT_API
11648 /* XXX: things like -Dm will segfault here in perlio, but doing
11649 * PERL_SET_CONTEXT(proto_perl);
11650 * breaks too many other things
11652 Perl_reentrant_init(aTHX);
11655 /* create SV map for pointer relocation */
11656 PL_ptr_table = ptr_table_new();
11658 /* initialize these special pointers as early as possible */
11659 SvANY(&PL_sv_undef) = NULL;
11660 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11661 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11662 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11664 SvANY(&PL_sv_no) = new_XPVNV();
11665 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11666 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11667 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11668 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11669 SvCUR_set(&PL_sv_no, 0);
11670 SvLEN_set(&PL_sv_no, 1);
11671 SvIV_set(&PL_sv_no, 0);
11672 SvNV_set(&PL_sv_no, 0);
11673 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11675 SvANY(&PL_sv_yes) = new_XPVNV();
11676 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11677 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11678 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11679 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11680 SvCUR_set(&PL_sv_yes, 1);
11681 SvLEN_set(&PL_sv_yes, 2);
11682 SvIV_set(&PL_sv_yes, 1);
11683 SvNV_set(&PL_sv_yes, 1);
11684 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11686 /* create (a non-shared!) shared string table */
11687 PL_strtab = newHV();
11688 HvSHAREKEYS_off(PL_strtab);
11689 hv_ksplit(PL_strtab, 512);
11690 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11692 PL_compiling = proto_perl->Icompiling;
11694 /* These two PVs will be free'd special way so must set them same way op.c does */
11695 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11696 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11698 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11699 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11701 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11702 if (!specialWARN(PL_compiling.cop_warnings))
11703 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11704 if (!specialCopIO(PL_compiling.cop_io))
11705 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11706 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11708 /* pseudo environmental stuff */
11709 PL_origargc = proto_perl->Iorigargc;
11710 PL_origargv = proto_perl->Iorigargv;
11712 param->stashes = newAV(); /* Setup array of objects to call clone on */
11714 #ifdef PERLIO_LAYERS
11715 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11716 PerlIO_clone(aTHX_ proto_perl, param);
11719 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11720 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11721 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11722 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11723 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11724 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11727 PL_minus_c = proto_perl->Iminus_c;
11728 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11729 PL_localpatches = proto_perl->Ilocalpatches;
11730 PL_splitstr = proto_perl->Isplitstr;
11731 PL_preprocess = proto_perl->Ipreprocess;
11732 PL_minus_n = proto_perl->Iminus_n;
11733 PL_minus_p = proto_perl->Iminus_p;
11734 PL_minus_l = proto_perl->Iminus_l;
11735 PL_minus_a = proto_perl->Iminus_a;
11736 PL_minus_F = proto_perl->Iminus_F;
11737 PL_doswitches = proto_perl->Idoswitches;
11738 PL_dowarn = proto_perl->Idowarn;
11739 PL_doextract = proto_perl->Idoextract;
11740 PL_sawampersand = proto_perl->Isawampersand;
11741 PL_unsafe = proto_perl->Iunsafe;
11742 PL_inplace = SAVEPV(proto_perl->Iinplace);
11743 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11744 PL_perldb = proto_perl->Iperldb;
11745 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11746 PL_exit_flags = proto_perl->Iexit_flags;
11748 /* magical thingies */
11749 /* XXX time(&PL_basetime) when asked for? */
11750 PL_basetime = proto_perl->Ibasetime;
11751 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11753 PL_maxsysfd = proto_perl->Imaxsysfd;
11754 PL_multiline = proto_perl->Imultiline;
11755 PL_statusvalue = proto_perl->Istatusvalue;
11757 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11759 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11761 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11762 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11763 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11765 /* Clone the regex array */
11766 PL_regex_padav = newAV();
11768 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11769 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11770 av_push(PL_regex_padav,
11771 sv_dup_inc(regexen[0],param));
11772 for(i = 1; i <= len; i++) {
11773 if(SvREPADTMP(regexen[i])) {
11774 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11776 av_push(PL_regex_padav,
11778 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11779 SvIVX(regexen[i])), param)))
11784 PL_regex_pad = AvARRAY(PL_regex_padav);
11786 /* shortcuts to various I/O objects */
11787 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11788 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11789 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11790 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11791 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11792 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11794 /* shortcuts to regexp stuff */
11795 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11797 /* shortcuts to misc objects */
11798 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11800 /* shortcuts to debugging objects */
11801 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11802 PL_DBline = gv_dup(proto_perl->IDBline, param);
11803 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11804 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11805 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11806 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11807 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11808 PL_lineary = av_dup(proto_perl->Ilineary, param);
11809 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11811 /* symbol tables */
11812 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11813 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11814 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11815 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11816 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11818 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11819 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11820 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11821 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11822 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11823 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11825 PL_sub_generation = proto_perl->Isub_generation;
11827 /* funky return mechanisms */
11828 PL_forkprocess = proto_perl->Iforkprocess;
11830 /* subprocess state */
11831 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11833 /* internal state */
11834 PL_tainting = proto_perl->Itainting;
11835 PL_taint_warn = proto_perl->Itaint_warn;
11836 PL_maxo = proto_perl->Imaxo;
11837 if (proto_perl->Iop_mask)
11838 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11840 PL_op_mask = Nullch;
11841 /* PL_asserting = proto_perl->Iasserting; */
11843 /* current interpreter roots */
11844 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11845 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11846 PL_main_start = proto_perl->Imain_start;
11847 PL_eval_root = proto_perl->Ieval_root;
11848 PL_eval_start = proto_perl->Ieval_start;
11850 /* runtime control stuff */
11851 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11852 PL_copline = proto_perl->Icopline;
11854 PL_filemode = proto_perl->Ifilemode;
11855 PL_lastfd = proto_perl->Ilastfd;
11856 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11859 PL_gensym = proto_perl->Igensym;
11860 PL_preambled = proto_perl->Ipreambled;
11861 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11862 PL_laststatval = proto_perl->Ilaststatval;
11863 PL_laststype = proto_perl->Ilaststype;
11864 PL_mess_sv = Nullsv;
11866 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11867 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11869 /* interpreter atexit processing */
11870 PL_exitlistlen = proto_perl->Iexitlistlen;
11871 if (PL_exitlistlen) {
11872 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11873 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11876 PL_exitlist = (PerlExitListEntry*)NULL;
11877 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11878 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11879 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11881 PL_profiledata = NULL;
11882 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11883 /* PL_rsfp_filters entries have fake IoDIRP() */
11884 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11886 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11888 PAD_CLONE_VARS(proto_perl, param);
11890 #ifdef HAVE_INTERP_INTERN
11891 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11894 /* more statics moved here */
11895 PL_generation = proto_perl->Igeneration;
11896 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11898 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11899 PL_in_clean_all = proto_perl->Iin_clean_all;
11901 PL_uid = proto_perl->Iuid;
11902 PL_euid = proto_perl->Ieuid;
11903 PL_gid = proto_perl->Igid;
11904 PL_egid = proto_perl->Iegid;
11905 PL_nomemok = proto_perl->Inomemok;
11906 PL_an = proto_perl->Ian;
11907 PL_evalseq = proto_perl->Ievalseq;
11908 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11909 PL_origalen = proto_perl->Iorigalen;
11910 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11911 PL_osname = SAVEPV(proto_perl->Iosname);
11912 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11913 PL_sighandlerp = proto_perl->Isighandlerp;
11916 PL_runops = proto_perl->Irunops;
11918 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11921 PL_cshlen = proto_perl->Icshlen;
11922 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11925 PL_lex_state = proto_perl->Ilex_state;
11926 PL_lex_defer = proto_perl->Ilex_defer;
11927 PL_lex_expect = proto_perl->Ilex_expect;
11928 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11929 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11930 PL_lex_starts = proto_perl->Ilex_starts;
11931 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11932 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11933 PL_lex_op = proto_perl->Ilex_op;
11934 PL_lex_inpat = proto_perl->Ilex_inpat;
11935 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11936 PL_lex_brackets = proto_perl->Ilex_brackets;
11937 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11938 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11939 PL_lex_casemods = proto_perl->Ilex_casemods;
11940 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11941 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11943 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11944 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11945 PL_nexttoke = proto_perl->Inexttoke;
11947 /* XXX This is probably masking the deeper issue of why
11948 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11949 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11950 * (A little debugging with a watchpoint on it may help.)
11952 if (SvANY(proto_perl->Ilinestr)) {
11953 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11954 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11955 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11956 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11957 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11958 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11959 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11960 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11961 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11964 PL_linestr = NEWSV(65,79);
11965 sv_upgrade(PL_linestr,SVt_PVIV);
11966 sv_setpvn(PL_linestr,"",0);
11967 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11969 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11970 PL_pending_ident = proto_perl->Ipending_ident;
11971 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11973 PL_expect = proto_perl->Iexpect;
11975 PL_multi_start = proto_perl->Imulti_start;
11976 PL_multi_end = proto_perl->Imulti_end;
11977 PL_multi_open = proto_perl->Imulti_open;
11978 PL_multi_close = proto_perl->Imulti_close;
11980 PL_error_count = proto_perl->Ierror_count;
11981 PL_subline = proto_perl->Isubline;
11982 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11984 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11985 if (SvANY(proto_perl->Ilinestr)) {
11986 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11987 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11988 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11989 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11990 PL_last_lop_op = proto_perl->Ilast_lop_op;
11993 PL_last_uni = SvPVX(PL_linestr);
11994 PL_last_lop = SvPVX(PL_linestr);
11995 PL_last_lop_op = 0;
11997 PL_in_my = proto_perl->Iin_my;
11998 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12000 PL_cryptseen = proto_perl->Icryptseen;
12003 PL_hints = proto_perl->Ihints;
12005 PL_amagic_generation = proto_perl->Iamagic_generation;
12007 #ifdef USE_LOCALE_COLLATE
12008 PL_collation_ix = proto_perl->Icollation_ix;
12009 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12010 PL_collation_standard = proto_perl->Icollation_standard;
12011 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12012 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12013 #endif /* USE_LOCALE_COLLATE */
12015 #ifdef USE_LOCALE_NUMERIC
12016 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12017 PL_numeric_standard = proto_perl->Inumeric_standard;
12018 PL_numeric_local = proto_perl->Inumeric_local;
12019 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12020 #endif /* !USE_LOCALE_NUMERIC */
12022 /* utf8 character classes */
12023 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12024 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12025 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12026 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12027 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12028 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12029 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12030 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12031 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12032 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12033 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12034 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12035 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12036 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12037 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12038 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12039 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12040 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12041 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12042 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12044 /* Did the locale setup indicate UTF-8? */
12045 PL_utf8locale = proto_perl->Iutf8locale;
12046 /* Unicode features (see perlrun/-C) */
12047 PL_unicode = proto_perl->Iunicode;
12049 /* Pre-5.8 signals control */
12050 PL_signals = proto_perl->Isignals;
12052 /* times() ticks per second */
12053 PL_clocktick = proto_perl->Iclocktick;
12055 /* Recursion stopper for PerlIO_find_layer */
12056 PL_in_load_module = proto_perl->Iin_load_module;
12058 /* sort() routine */
12059 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12061 /* Not really needed/useful since the reenrant_retint is "volatile",
12062 * but do it for consistency's sake. */
12063 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12065 /* Hooks to shared SVs and locks. */
12066 PL_sharehook = proto_perl->Isharehook;
12067 PL_lockhook = proto_perl->Ilockhook;
12068 PL_unlockhook = proto_perl->Iunlockhook;
12069 PL_threadhook = proto_perl->Ithreadhook;
12071 PL_runops_std = proto_perl->Irunops_std;
12072 PL_runops_dbg = proto_perl->Irunops_dbg;
12074 #ifdef THREADS_HAVE_PIDS
12075 PL_ppid = proto_perl->Ippid;
12079 PL_last_swash_hv = Nullhv; /* reinits on demand */
12080 PL_last_swash_klen = 0;
12081 PL_last_swash_key[0]= '\0';
12082 PL_last_swash_tmps = (U8*)NULL;
12083 PL_last_swash_slen = 0;
12085 PL_glob_index = proto_perl->Iglob_index;
12086 PL_srand_called = proto_perl->Isrand_called;
12087 PL_hash_seed = proto_perl->Ihash_seed;
12088 PL_rehash_seed = proto_perl->Irehash_seed;
12089 PL_uudmap['M'] = 0; /* reinits on demand */
12090 PL_bitcount = Nullch; /* reinits on demand */
12092 if (proto_perl->Ipsig_pend) {
12093 Newz(0, PL_psig_pend, SIG_SIZE, int);
12096 PL_psig_pend = (int*)NULL;
12099 if (proto_perl->Ipsig_ptr) {
12100 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12101 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12102 for (i = 1; i < SIG_SIZE; i++) {
12103 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12104 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12108 PL_psig_ptr = (SV**)NULL;
12109 PL_psig_name = (SV**)NULL;
12112 /* thrdvar.h stuff */
12114 if (flags & CLONEf_COPY_STACKS) {
12115 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12116 PL_tmps_ix = proto_perl->Ttmps_ix;
12117 PL_tmps_max = proto_perl->Ttmps_max;
12118 PL_tmps_floor = proto_perl->Ttmps_floor;
12119 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12121 while (i <= PL_tmps_ix) {
12122 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12126 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12127 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12128 Newz(54, PL_markstack, i, I32);
12129 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12130 - proto_perl->Tmarkstack);
12131 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12132 - proto_perl->Tmarkstack);
12133 Copy(proto_perl->Tmarkstack, PL_markstack,
12134 PL_markstack_ptr - PL_markstack + 1, I32);
12136 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12137 * NOTE: unlike the others! */
12138 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12139 PL_scopestack_max = proto_perl->Tscopestack_max;
12140 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12141 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12143 /* NOTE: si_dup() looks at PL_markstack */
12144 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12146 /* PL_curstack = PL_curstackinfo->si_stack; */
12147 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12148 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12150 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12151 PL_stack_base = AvARRAY(PL_curstack);
12152 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12153 - proto_perl->Tstack_base);
12154 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12156 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12157 * NOTE: unlike the others! */
12158 PL_savestack_ix = proto_perl->Tsavestack_ix;
12159 PL_savestack_max = proto_perl->Tsavestack_max;
12160 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12161 PL_savestack = ss_dup(proto_perl, param);
12165 ENTER; /* perl_destruct() wants to LEAVE; */
12168 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12169 PL_top_env = &PL_start_env;
12171 PL_op = proto_perl->Top;
12174 PL_Xpv = (XPV*)NULL;
12175 PL_na = proto_perl->Tna;
12177 PL_statbuf = proto_perl->Tstatbuf;
12178 PL_statcache = proto_perl->Tstatcache;
12179 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12180 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12182 PL_timesbuf = proto_perl->Ttimesbuf;
12185 PL_tainted = proto_perl->Ttainted;
12186 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12187 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12188 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12189 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12190 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12191 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12192 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12193 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12194 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12196 PL_restartop = proto_perl->Trestartop;
12197 PL_in_eval = proto_perl->Tin_eval;
12198 PL_delaymagic = proto_perl->Tdelaymagic;
12199 PL_dirty = proto_perl->Tdirty;
12200 PL_localizing = proto_perl->Tlocalizing;
12202 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12203 PL_hv_fetch_ent_mh = Nullhe;
12204 PL_modcount = proto_perl->Tmodcount;
12205 PL_lastgotoprobe = Nullop;
12206 PL_dumpindent = proto_perl->Tdumpindent;
12208 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12209 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12210 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12211 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12212 PL_sortcxix = proto_perl->Tsortcxix;
12213 PL_efloatbuf = Nullch; /* reinits on demand */
12214 PL_efloatsize = 0; /* reinits on demand */
12218 PL_screamfirst = NULL;
12219 PL_screamnext = NULL;
12220 PL_maxscream = -1; /* reinits on demand */
12221 PL_lastscream = Nullsv;
12223 PL_watchaddr = NULL;
12224 PL_watchok = Nullch;
12226 PL_regdummy = proto_perl->Tregdummy;
12227 PL_regprecomp = Nullch;
12230 PL_colorset = 0; /* reinits PL_colors[] */
12231 /*PL_colors[6] = {0,0,0,0,0,0};*/
12232 PL_reginput = Nullch;
12233 PL_regbol = Nullch;
12234 PL_regeol = Nullch;
12235 PL_regstartp = (I32*)NULL;
12236 PL_regendp = (I32*)NULL;
12237 PL_reglastparen = (U32*)NULL;
12238 PL_reglastcloseparen = (U32*)NULL;
12239 PL_regtill = Nullch;
12240 PL_reg_start_tmp = (char**)NULL;
12241 PL_reg_start_tmpl = 0;
12242 PL_regdata = (struct reg_data*)NULL;
12245 PL_reg_eval_set = 0;
12247 PL_regprogram = (regnode*)NULL;
12249 PL_regcc = (CURCUR*)NULL;
12250 PL_reg_call_cc = (struct re_cc_state*)NULL;
12251 PL_reg_re = (regexp*)NULL;
12252 PL_reg_ganch = Nullch;
12253 PL_reg_sv = Nullsv;
12254 PL_reg_match_utf8 = FALSE;
12255 PL_reg_magic = (MAGIC*)NULL;
12257 PL_reg_oldcurpm = (PMOP*)NULL;
12258 PL_reg_curpm = (PMOP*)NULL;
12259 PL_reg_oldsaved = Nullch;
12260 PL_reg_oldsavedlen = 0;
12261 #ifdef PERL_COPY_ON_WRITE
12264 PL_reg_maxiter = 0;
12265 PL_reg_leftiter = 0;
12266 PL_reg_poscache = Nullch;
12267 PL_reg_poscache_size= 0;
12269 /* RE engine - function pointers */
12270 PL_regcompp = proto_perl->Tregcompp;
12271 PL_regexecp = proto_perl->Tregexecp;
12272 PL_regint_start = proto_perl->Tregint_start;
12273 PL_regint_string = proto_perl->Tregint_string;
12274 PL_regfree = proto_perl->Tregfree;
12276 PL_reginterp_cnt = 0;
12277 PL_reg_starttry = 0;
12279 /* Pluggable optimizer */
12280 PL_peepp = proto_perl->Tpeepp;
12282 PL_stashcache = newHV();
12284 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12285 ptr_table_free(PL_ptr_table);
12286 PL_ptr_table = NULL;
12289 /* Call the ->CLONE method, if it exists, for each of the stashes
12290 identified by sv_dup() above.
12292 while(av_len(param->stashes) != -1) {
12293 HV* stash = (HV*) av_shift(param->stashes);
12294 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12295 if (cloner && GvCV(cloner)) {
12300 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
12302 call_sv((SV*)GvCV(cloner), G_DISCARD);
12308 SvREFCNT_dec(param->stashes);
12313 #endif /* USE_ITHREADS */
12316 =head1 Unicode Support
12318 =for apidoc sv_recode_to_utf8
12320 The encoding is assumed to be an Encode object, on entry the PV
12321 of the sv is assumed to be octets in that encoding, and the sv
12322 will be converted into Unicode (and UTF-8).
12324 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12325 is not a reference, nothing is done to the sv. If the encoding is not
12326 an C<Encode::XS> Encoding object, bad things will happen.
12327 (See F<lib/encoding.pm> and L<Encode>).
12329 The PV of the sv is returned.
12334 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12337 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12351 Passing sv_yes is wrong - it needs to be or'ed set of constants
12352 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12353 remove converted chars from source.
12355 Both will default the value - let them.
12357 XPUSHs(&PL_sv_yes);
12360 call_method("decode", G_SCALAR);
12364 s = SvPV(uni, len);
12365 if (s != SvPVX(sv)) {
12366 SvGROW(sv, len + 1);
12367 Move(s, SvPVX(sv), len, char);
12368 SvCUR_set(sv, len);
12369 SvPVX(sv)[len] = 0;
12376 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12380 =for apidoc sv_cat_decode
12382 The encoding is assumed to be an Encode object, the PV of the ssv is
12383 assumed to be octets in that encoding and decoding the input starts
12384 from the position which (PV + *offset) pointed to. The dsv will be
12385 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12386 when the string tstr appears in decoding output or the input ends on
12387 the PV of the ssv. The value which the offset points will be modified
12388 to the last input position on the ssv.
12390 Returns TRUE if the terminator was found, else returns FALSE.
12395 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12396 SV *ssv, int *offset, char *tstr, int tlen)
12400 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12411 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12412 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12414 call_method("cat_decode", G_SCALAR);
12416 ret = SvTRUE(TOPs);
12417 *offset = SvIV(offsv);
12423 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12429 * c-indentation-style: bsd
12430 * c-basic-offset: 4
12431 * indent-tabs-mode: t
12434 * vim: shiftwidth=4: