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 all this if()... if the above
1910 assertion is genuinely always true. */
1913 SvFLAGS(sv) &= ~SVf_OOK;
1916 SvPV_set(sv, (char*)0);
1917 SvMAGIC_set(sv, magic);
1918 SvSTASH_set(sv, stash);
1922 SvANY(sv) = new_XPVIO();
1923 Zero(SvANY(sv), 1, XPVIO);
1924 IoPAGE_LEN(sv) = 60;
1925 goto set_magic_common;
1927 SvANY(sv) = new_XPVFM();
1928 Zero(SvANY(sv), 1, XPVFM);
1929 goto set_magic_common;
1931 SvANY(sv) = new_XPVBM();
1935 goto set_magic_common;
1937 SvANY(sv) = new_XPVGV();
1943 goto set_magic_common;
1945 SvANY(sv) = new_XPVCV();
1946 Zero(SvANY(sv), 1, XPVCV);
1947 goto set_magic_common;
1949 SvANY(sv) = new_XPVLV();
1962 SvANY(sv) = new_XPVMG();
1965 SvMAGIC_set(sv, magic);
1966 SvSTASH_set(sv, stash);
1970 SvANY(sv) = new_XPVNV();
1976 SvANY(sv) = new_XPVIV();
1985 SvANY(sv) = new_XPV();
1996 =for apidoc sv_backoff
1998 Remove any string offset. You should normally use the C<SvOOK_off> macro
2005 Perl_sv_backoff(pTHX_ register SV *sv)
2009 char *s = SvPVX(sv);
2010 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
2011 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
2013 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
2015 SvFLAGS(sv) &= ~SVf_OOK;
2022 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2023 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2024 Use the C<SvGROW> wrapper instead.
2030 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2034 #ifdef HAS_64K_LIMIT
2035 if (newlen >= 0x10000) {
2036 PerlIO_printf(Perl_debug_log,
2037 "Allocation too large: %"UVxf"\n", (UV)newlen);
2040 #endif /* HAS_64K_LIMIT */
2043 if (SvTYPE(sv) < SVt_PV) {
2044 sv_upgrade(sv, SVt_PV);
2047 else if (SvOOK(sv)) { /* pv is offset? */
2050 if (newlen > SvLEN(sv))
2051 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2052 #ifdef HAS_64K_LIMIT
2053 if (newlen >= 0x10000)
2060 if (newlen > SvLEN(sv)) { /* need more room? */
2061 if (SvLEN(sv) && s) {
2063 STRLEN l = malloced_size((void*)SvPVX(sv));
2069 Renew(s,newlen,char);
2072 New(703, s, newlen, char);
2073 if (SvPVX(sv) && SvCUR(sv)) {
2074 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2078 SvLEN_set(sv, newlen);
2084 =for apidoc sv_setiv
2086 Copies an integer into the given SV, upgrading first if necessary.
2087 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2093 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2095 SV_CHECK_THINKFIRST_COW_DROP(sv);
2096 switch (SvTYPE(sv)) {
2098 sv_upgrade(sv, SVt_IV);
2101 sv_upgrade(sv, SVt_PVNV);
2105 sv_upgrade(sv, SVt_PVIV);
2114 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2117 (void)SvIOK_only(sv); /* validate number */
2123 =for apidoc sv_setiv_mg
2125 Like C<sv_setiv>, but also handles 'set' magic.
2131 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2138 =for apidoc sv_setuv
2140 Copies an unsigned integer into the given SV, upgrading first if necessary.
2141 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2147 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2149 /* With these two if statements:
2150 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2153 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2155 If you wish to remove them, please benchmark to see what the effect is
2157 if (u <= (UV)IV_MAX) {
2158 sv_setiv(sv, (IV)u);
2167 =for apidoc sv_setuv_mg
2169 Like C<sv_setuv>, but also handles 'set' magic.
2175 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2177 /* With these two if statements:
2178 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2181 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2183 If you wish to remove them, please benchmark to see what the effect is
2185 if (u <= (UV)IV_MAX) {
2186 sv_setiv(sv, (IV)u);
2196 =for apidoc sv_setnv
2198 Copies a double into the given SV, upgrading first if necessary.
2199 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2205 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2207 SV_CHECK_THINKFIRST_COW_DROP(sv);
2208 switch (SvTYPE(sv)) {
2211 sv_upgrade(sv, SVt_NV);
2216 sv_upgrade(sv, SVt_PVNV);
2225 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2229 (void)SvNOK_only(sv); /* validate number */
2234 =for apidoc sv_setnv_mg
2236 Like C<sv_setnv>, but also handles 'set' magic.
2242 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2248 /* Print an "isn't numeric" warning, using a cleaned-up,
2249 * printable version of the offending string
2253 S_not_a_number(pTHX_ SV *sv)
2260 dsv = sv_2mortal(newSVpv("", 0));
2261 pv = sv_uni_display(dsv, sv, 10, 0);
2264 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2265 /* each *s can expand to 4 chars + "...\0",
2266 i.e. need room for 8 chars */
2269 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2271 if (ch & 128 && !isPRINT_LC(ch)) {
2280 else if (ch == '\r') {
2284 else if (ch == '\f') {
2288 else if (ch == '\\') {
2292 else if (ch == '\0') {
2296 else if (isPRINT_LC(ch))
2313 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2314 "Argument \"%s\" isn't numeric in %s", pv,
2317 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2318 "Argument \"%s\" isn't numeric", pv);
2322 =for apidoc looks_like_number
2324 Test if the content of an SV looks like a number (or is a number).
2325 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2326 non-numeric warning), even if your atof() doesn't grok them.
2332 Perl_looks_like_number(pTHX_ SV *sv)
2334 register char *sbegin;
2341 else if (SvPOKp(sv))
2342 sbegin = SvPV(sv, len);
2344 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2345 return grok_number(sbegin, len, NULL);
2348 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2349 until proven guilty, assume that things are not that bad... */
2354 As 64 bit platforms often have an NV that doesn't preserve all bits of
2355 an IV (an assumption perl has been based on to date) it becomes necessary
2356 to remove the assumption that the NV always carries enough precision to
2357 recreate the IV whenever needed, and that the NV is the canonical form.
2358 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2359 precision as a side effect of conversion (which would lead to insanity
2360 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2361 1) to distinguish between IV/UV/NV slots that have cached a valid
2362 conversion where precision was lost and IV/UV/NV slots that have a
2363 valid conversion which has lost no precision
2364 2) to ensure that if a numeric conversion to one form is requested that
2365 would lose precision, the precise conversion (or differently
2366 imprecise conversion) is also performed and cached, to prevent
2367 requests for different numeric formats on the same SV causing
2368 lossy conversion chains. (lossless conversion chains are perfectly
2373 SvIOKp is true if the IV slot contains a valid value
2374 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2375 SvNOKp is true if the NV slot contains a valid value
2376 SvNOK is true only if the NV value is accurate
2379 while converting from PV to NV, check to see if converting that NV to an
2380 IV(or UV) would lose accuracy over a direct conversion from PV to
2381 IV(or UV). If it would, cache both conversions, return NV, but mark
2382 SV as IOK NOKp (ie not NOK).
2384 While converting from PV to IV, check to see if converting that IV to an
2385 NV would lose accuracy over a direct conversion from PV to NV. If it
2386 would, cache both conversions, flag similarly.
2388 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2389 correctly because if IV & NV were set NV *always* overruled.
2390 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2391 changes - now IV and NV together means that the two are interchangeable:
2392 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2394 The benefit of this is that operations such as pp_add know that if
2395 SvIOK is true for both left and right operands, then integer addition
2396 can be used instead of floating point (for cases where the result won't
2397 overflow). Before, floating point was always used, which could lead to
2398 loss of precision compared with integer addition.
2400 * making IV and NV equal status should make maths accurate on 64 bit
2402 * may speed up maths somewhat if pp_add and friends start to use
2403 integers when possible instead of fp. (Hopefully the overhead in
2404 looking for SvIOK and checking for overflow will not outweigh the
2405 fp to integer speedup)
2406 * will slow down integer operations (callers of SvIV) on "inaccurate"
2407 values, as the change from SvIOK to SvIOKp will cause a call into
2408 sv_2iv each time rather than a macro access direct to the IV slot
2409 * should speed up number->string conversion on integers as IV is
2410 favoured when IV and NV are equally accurate
2412 ####################################################################
2413 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2414 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2415 On the other hand, SvUOK is true iff UV.
2416 ####################################################################
2418 Your mileage will vary depending your CPU's relative fp to integer
2422 #ifndef NV_PRESERVES_UV
2423 # define IS_NUMBER_UNDERFLOW_IV 1
2424 # define IS_NUMBER_UNDERFLOW_UV 2
2425 # define IS_NUMBER_IV_AND_UV 2
2426 # define IS_NUMBER_OVERFLOW_IV 4
2427 # define IS_NUMBER_OVERFLOW_UV 5
2429 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2431 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2433 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2435 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));
2436 if (SvNVX(sv) < (NV)IV_MIN) {
2437 (void)SvIOKp_on(sv);
2439 SvIV_set(sv, IV_MIN);
2440 return IS_NUMBER_UNDERFLOW_IV;
2442 if (SvNVX(sv) > (NV)UV_MAX) {
2443 (void)SvIOKp_on(sv);
2446 SvUV_set(sv, UV_MAX);
2447 return IS_NUMBER_OVERFLOW_UV;
2449 (void)SvIOKp_on(sv);
2451 /* Can't use strtol etc to convert this string. (See truth table in
2453 if (SvNVX(sv) <= (UV)IV_MAX) {
2454 SvIV_set(sv, I_V(SvNVX(sv)));
2455 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2456 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2458 /* Integer is imprecise. NOK, IOKp */
2460 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2463 SvUV_set(sv, U_V(SvNVX(sv)));
2464 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2465 if (SvUVX(sv) == UV_MAX) {
2466 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2467 possibly be preserved by NV. Hence, it must be overflow.
2469 return IS_NUMBER_OVERFLOW_UV;
2471 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2473 /* Integer is imprecise. NOK, IOKp */
2475 return IS_NUMBER_OVERFLOW_IV;
2477 #endif /* !NV_PRESERVES_UV*/
2479 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2480 * this function provided for binary compatibility only
2484 Perl_sv_2iv(pTHX_ register SV *sv)
2486 return sv_2iv_flags(sv, SV_GMAGIC);
2490 =for apidoc sv_2iv_flags
2492 Return the integer value of an SV, doing any necessary string
2493 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2494 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2500 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2504 if (SvGMAGICAL(sv)) {
2505 if (flags & SV_GMAGIC)
2510 return I_V(SvNVX(sv));
2512 if (SvPOKp(sv) && SvLEN(sv))
2515 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2516 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2522 if (SvTHINKFIRST(sv)) {
2525 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2526 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2527 return SvIV(tmpstr);
2528 return PTR2IV(SvRV(sv));
2531 sv_force_normal_flags(sv, 0);
2533 if (SvREADONLY(sv) && !SvOK(sv)) {
2534 if (ckWARN(WARN_UNINITIALIZED))
2541 return (IV)(SvUVX(sv));
2548 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2549 * without also getting a cached IV/UV from it at the same time
2550 * (ie PV->NV conversion should detect loss of accuracy and cache
2551 * IV or UV at same time to avoid this. NWC */
2553 if (SvTYPE(sv) == SVt_NV)
2554 sv_upgrade(sv, SVt_PVNV);
2556 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2557 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2558 certainly cast into the IV range at IV_MAX, whereas the correct
2559 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2561 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2562 SvIV_set(sv, I_V(SvNVX(sv)));
2563 if (SvNVX(sv) == (NV) SvIVX(sv)
2564 #ifndef NV_PRESERVES_UV
2565 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2566 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2567 /* Don't flag it as "accurately an integer" if the number
2568 came from a (by definition imprecise) NV operation, and
2569 we're outside the range of NV integer precision */
2572 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2573 DEBUG_c(PerlIO_printf(Perl_debug_log,
2574 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2580 /* IV not precise. No need to convert from PV, as NV
2581 conversion would already have cached IV if it detected
2582 that PV->IV would be better than PV->NV->IV
2583 flags already correct - don't set public IOK. */
2584 DEBUG_c(PerlIO_printf(Perl_debug_log,
2585 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2590 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2591 but the cast (NV)IV_MIN rounds to a the value less (more
2592 negative) than IV_MIN which happens to be equal to SvNVX ??
2593 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2594 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2595 (NV)UVX == NVX are both true, but the values differ. :-(
2596 Hopefully for 2s complement IV_MIN is something like
2597 0x8000000000000000 which will be exact. NWC */
2600 SvUV_set(sv, U_V(SvNVX(sv)));
2602 (SvNVX(sv) == (NV) SvUVX(sv))
2603 #ifndef NV_PRESERVES_UV
2604 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2605 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2606 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2607 /* Don't flag it as "accurately an integer" if the number
2608 came from a (by definition imprecise) NV operation, and
2609 we're outside the range of NV integer precision */
2615 DEBUG_c(PerlIO_printf(Perl_debug_log,
2616 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2620 return (IV)SvUVX(sv);
2623 else if (SvPOKp(sv) && SvLEN(sv)) {
2625 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2626 /* We want to avoid a possible problem when we cache an IV which
2627 may be later translated to an NV, and the resulting NV is not
2628 the same as the direct translation of the initial string
2629 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2630 be careful to ensure that the value with the .456 is around if the
2631 NV value is requested in the future).
2633 This means that if we cache such an IV, we need to cache the
2634 NV as well. Moreover, we trade speed for space, and do not
2635 cache the NV if we are sure it's not needed.
2638 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2639 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2640 == IS_NUMBER_IN_UV) {
2641 /* It's definitely an integer, only upgrade to PVIV */
2642 if (SvTYPE(sv) < SVt_PVIV)
2643 sv_upgrade(sv, SVt_PVIV);
2645 } else if (SvTYPE(sv) < SVt_PVNV)
2646 sv_upgrade(sv, SVt_PVNV);
2648 /* If NV preserves UV then we only use the UV value if we know that
2649 we aren't going to call atof() below. If NVs don't preserve UVs
2650 then the value returned may have more precision than atof() will
2651 return, even though value isn't perfectly accurate. */
2652 if ((numtype & (IS_NUMBER_IN_UV
2653 #ifdef NV_PRESERVES_UV
2656 )) == IS_NUMBER_IN_UV) {
2657 /* This won't turn off the public IOK flag if it was set above */
2658 (void)SvIOKp_on(sv);
2660 if (!(numtype & IS_NUMBER_NEG)) {
2662 if (value <= (UV)IV_MAX) {
2663 SvIV_set(sv, (IV)value);
2665 SvUV_set(sv, value);
2669 /* 2s complement assumption */
2670 if (value <= (UV)IV_MIN) {
2671 SvIV_set(sv, -(IV)value);
2673 /* Too negative for an IV. This is a double upgrade, but
2674 I'm assuming it will be rare. */
2675 if (SvTYPE(sv) < SVt_PVNV)
2676 sv_upgrade(sv, SVt_PVNV);
2680 SvNV_set(sv, -(NV)value);
2681 SvIV_set(sv, IV_MIN);
2685 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2686 will be in the previous block to set the IV slot, and the next
2687 block to set the NV slot. So no else here. */
2689 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2690 != IS_NUMBER_IN_UV) {
2691 /* It wasn't an (integer that doesn't overflow the UV). */
2692 SvNV_set(sv, Atof(SvPVX(sv)));
2694 if (! numtype && ckWARN(WARN_NUMERIC))
2697 #if defined(USE_LONG_DOUBLE)
2698 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2699 PTR2UV(sv), SvNVX(sv)));
2701 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2702 PTR2UV(sv), SvNVX(sv)));
2706 #ifdef NV_PRESERVES_UV
2707 (void)SvIOKp_on(sv);
2709 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2710 SvIV_set(sv, I_V(SvNVX(sv)));
2711 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2714 /* Integer is imprecise. NOK, IOKp */
2716 /* UV will not work better than IV */
2718 if (SvNVX(sv) > (NV)UV_MAX) {
2720 /* Integer is inaccurate. NOK, IOKp, is UV */
2721 SvUV_set(sv, UV_MAX);
2724 SvUV_set(sv, U_V(SvNVX(sv)));
2725 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2726 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2730 /* Integer is imprecise. NOK, IOKp, is UV */
2736 #else /* NV_PRESERVES_UV */
2737 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2738 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2739 /* The IV slot will have been set from value returned by
2740 grok_number above. The NV slot has just been set using
2743 assert (SvIOKp(sv));
2745 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2746 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2747 /* Small enough to preserve all bits. */
2748 (void)SvIOKp_on(sv);
2750 SvIV_set(sv, I_V(SvNVX(sv)));
2751 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2753 /* Assumption: first non-preserved integer is < IV_MAX,
2754 this NV is in the preserved range, therefore: */
2755 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2757 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);
2761 0 0 already failed to read UV.
2762 0 1 already failed to read UV.
2763 1 0 you won't get here in this case. IV/UV
2764 slot set, public IOK, Atof() unneeded.
2765 1 1 already read UV.
2766 so there's no point in sv_2iuv_non_preserve() attempting
2767 to use atol, strtol, strtoul etc. */
2768 if (sv_2iuv_non_preserve (sv, numtype)
2769 >= IS_NUMBER_OVERFLOW_IV)
2773 #endif /* NV_PRESERVES_UV */
2776 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2778 if (SvTYPE(sv) < SVt_IV)
2779 /* Typically the caller expects that sv_any is not NULL now. */
2780 sv_upgrade(sv, SVt_IV);
2783 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2784 PTR2UV(sv),SvIVX(sv)));
2785 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2788 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2789 * this function provided for binary compatibility only
2793 Perl_sv_2uv(pTHX_ register SV *sv)
2795 return sv_2uv_flags(sv, SV_GMAGIC);
2799 =for apidoc sv_2uv_flags
2801 Return the unsigned integer value of an SV, doing any necessary string
2802 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2803 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2809 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2813 if (SvGMAGICAL(sv)) {
2814 if (flags & SV_GMAGIC)
2819 return U_V(SvNVX(sv));
2820 if (SvPOKp(sv) && SvLEN(sv))
2823 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2824 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2830 if (SvTHINKFIRST(sv)) {
2833 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2834 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2835 return SvUV(tmpstr);
2836 return PTR2UV(SvRV(sv));
2839 sv_force_normal_flags(sv, 0);
2841 if (SvREADONLY(sv) && !SvOK(sv)) {
2842 if (ckWARN(WARN_UNINITIALIZED))
2852 return (UV)SvIVX(sv);
2856 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2857 * without also getting a cached IV/UV from it at the same time
2858 * (ie PV->NV conversion should detect loss of accuracy and cache
2859 * IV or UV at same time to avoid this. */
2860 /* IV-over-UV optimisation - choose to cache IV if possible */
2862 if (SvTYPE(sv) == SVt_NV)
2863 sv_upgrade(sv, SVt_PVNV);
2865 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2866 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2867 SvIV_set(sv, I_V(SvNVX(sv)));
2868 if (SvNVX(sv) == (NV) SvIVX(sv)
2869 #ifndef NV_PRESERVES_UV
2870 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2871 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2872 /* Don't flag it as "accurately an integer" if the number
2873 came from a (by definition imprecise) NV operation, and
2874 we're outside the range of NV integer precision */
2877 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2878 DEBUG_c(PerlIO_printf(Perl_debug_log,
2879 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2885 /* IV not precise. No need to convert from PV, as NV
2886 conversion would already have cached IV if it detected
2887 that PV->IV would be better than PV->NV->IV
2888 flags already correct - don't set public IOK. */
2889 DEBUG_c(PerlIO_printf(Perl_debug_log,
2890 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2895 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2896 but the cast (NV)IV_MIN rounds to a the value less (more
2897 negative) than IV_MIN which happens to be equal to SvNVX ??
2898 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2899 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2900 (NV)UVX == NVX are both true, but the values differ. :-(
2901 Hopefully for 2s complement IV_MIN is something like
2902 0x8000000000000000 which will be exact. NWC */
2905 SvUV_set(sv, U_V(SvNVX(sv)));
2907 (SvNVX(sv) == (NV) SvUVX(sv))
2908 #ifndef NV_PRESERVES_UV
2909 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2910 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2911 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2912 /* Don't flag it as "accurately an integer" if the number
2913 came from a (by definition imprecise) NV operation, and
2914 we're outside the range of NV integer precision */
2919 DEBUG_c(PerlIO_printf(Perl_debug_log,
2920 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2926 else if (SvPOKp(sv) && SvLEN(sv)) {
2928 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2930 /* We want to avoid a possible problem when we cache a UV which
2931 may be later translated to an NV, and the resulting NV is not
2932 the translation of the initial data.
2934 This means that if we cache such a UV, we need to cache the
2935 NV as well. Moreover, we trade speed for space, and do not
2936 cache the NV if not needed.
2939 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2940 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2941 == IS_NUMBER_IN_UV) {
2942 /* It's definitely an integer, only upgrade to PVIV */
2943 if (SvTYPE(sv) < SVt_PVIV)
2944 sv_upgrade(sv, SVt_PVIV);
2946 } else if (SvTYPE(sv) < SVt_PVNV)
2947 sv_upgrade(sv, SVt_PVNV);
2949 /* If NV preserves UV then we only use the UV value if we know that
2950 we aren't going to call atof() below. If NVs don't preserve UVs
2951 then the value returned may have more precision than atof() will
2952 return, even though it isn't accurate. */
2953 if ((numtype & (IS_NUMBER_IN_UV
2954 #ifdef NV_PRESERVES_UV
2957 )) == IS_NUMBER_IN_UV) {
2958 /* This won't turn off the public IOK flag if it was set above */
2959 (void)SvIOKp_on(sv);
2961 if (!(numtype & IS_NUMBER_NEG)) {
2963 if (value <= (UV)IV_MAX) {
2964 SvIV_set(sv, (IV)value);
2966 /* it didn't overflow, and it was positive. */
2967 SvUV_set(sv, value);
2971 /* 2s complement assumption */
2972 if (value <= (UV)IV_MIN) {
2973 SvIV_set(sv, -(IV)value);
2975 /* Too negative for an IV. This is a double upgrade, but
2976 I'm assuming it will be rare. */
2977 if (SvTYPE(sv) < SVt_PVNV)
2978 sv_upgrade(sv, SVt_PVNV);
2982 SvNV_set(sv, -(NV)value);
2983 SvIV_set(sv, IV_MIN);
2988 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2989 != IS_NUMBER_IN_UV) {
2990 /* It wasn't an integer, or it overflowed the UV. */
2991 SvNV_set(sv, Atof(SvPVX(sv)));
2993 if (! numtype && ckWARN(WARN_NUMERIC))
2996 #if defined(USE_LONG_DOUBLE)
2997 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2998 PTR2UV(sv), SvNVX(sv)));
3000 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
3001 PTR2UV(sv), SvNVX(sv)));
3004 #ifdef NV_PRESERVES_UV
3005 (void)SvIOKp_on(sv);
3007 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3008 SvIV_set(sv, I_V(SvNVX(sv)));
3009 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
3012 /* Integer is imprecise. NOK, IOKp */
3014 /* UV will not work better than IV */
3016 if (SvNVX(sv) > (NV)UV_MAX) {
3018 /* Integer is inaccurate. NOK, IOKp, is UV */
3019 SvUV_set(sv, UV_MAX);
3022 SvUV_set(sv, U_V(SvNVX(sv)));
3023 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3024 NV preservse UV so can do correct comparison. */
3025 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3029 /* Integer is imprecise. NOK, IOKp, is UV */
3034 #else /* NV_PRESERVES_UV */
3035 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3036 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3037 /* The UV slot will have been set from value returned by
3038 grok_number above. The NV slot has just been set using
3041 assert (SvIOKp(sv));
3043 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3044 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3045 /* Small enough to preserve all bits. */
3046 (void)SvIOKp_on(sv);
3048 SvIV_set(sv, I_V(SvNVX(sv)));
3049 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3051 /* Assumption: first non-preserved integer is < IV_MAX,
3052 this NV is in the preserved range, therefore: */
3053 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3055 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);
3058 sv_2iuv_non_preserve (sv, numtype);
3060 #endif /* NV_PRESERVES_UV */
3064 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3065 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3068 if (SvTYPE(sv) < SVt_IV)
3069 /* Typically the caller expects that sv_any is not NULL now. */
3070 sv_upgrade(sv, SVt_IV);
3074 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3075 PTR2UV(sv),SvUVX(sv)));
3076 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3082 Return the num value of an SV, doing any necessary string or integer
3083 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3090 Perl_sv_2nv(pTHX_ register SV *sv)
3094 if (SvGMAGICAL(sv)) {
3098 if (SvPOKp(sv) && SvLEN(sv)) {
3099 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3100 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
3102 return Atof(SvPVX(sv));
3106 return (NV)SvUVX(sv);
3108 return (NV)SvIVX(sv);
3111 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3112 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3118 if (SvTHINKFIRST(sv)) {
3121 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3122 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3123 return SvNV(tmpstr);
3124 return PTR2NV(SvRV(sv));
3127 sv_force_normal_flags(sv, 0);
3129 if (SvREADONLY(sv) && !SvOK(sv)) {
3130 if (ckWARN(WARN_UNINITIALIZED))
3135 if (SvTYPE(sv) < SVt_NV) {
3136 if (SvTYPE(sv) == SVt_IV)
3137 sv_upgrade(sv, SVt_PVNV);
3139 sv_upgrade(sv, SVt_NV);
3140 #ifdef USE_LONG_DOUBLE
3142 STORE_NUMERIC_LOCAL_SET_STANDARD();
3143 PerlIO_printf(Perl_debug_log,
3144 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3145 PTR2UV(sv), SvNVX(sv));
3146 RESTORE_NUMERIC_LOCAL();
3150 STORE_NUMERIC_LOCAL_SET_STANDARD();
3151 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3152 PTR2UV(sv), SvNVX(sv));
3153 RESTORE_NUMERIC_LOCAL();
3157 else if (SvTYPE(sv) < SVt_PVNV)
3158 sv_upgrade(sv, SVt_PVNV);
3163 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3164 #ifdef NV_PRESERVES_UV
3167 /* Only set the public NV OK flag if this NV preserves the IV */
3168 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3169 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3170 : (SvIVX(sv) == I_V(SvNVX(sv))))
3176 else if (SvPOKp(sv) && SvLEN(sv)) {
3178 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3179 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3181 #ifdef NV_PRESERVES_UV
3182 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3183 == IS_NUMBER_IN_UV) {
3184 /* It's definitely an integer */
3185 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3187 SvNV_set(sv, Atof(SvPVX(sv)));
3190 SvNV_set(sv, Atof(SvPVX(sv)));
3191 /* Only set the public NV OK flag if this NV preserves the value in
3192 the PV at least as well as an IV/UV would.
3193 Not sure how to do this 100% reliably. */
3194 /* if that shift count is out of range then Configure's test is
3195 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3197 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3198 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3199 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3200 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3201 /* Can't use strtol etc to convert this string, so don't try.
3202 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3205 /* value has been set. It may not be precise. */
3206 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3207 /* 2s complement assumption for (UV)IV_MIN */
3208 SvNOK_on(sv); /* Integer is too negative. */
3213 if (numtype & IS_NUMBER_NEG) {
3214 SvIV_set(sv, -(IV)value);
3215 } else if (value <= (UV)IV_MAX) {
3216 SvIV_set(sv, (IV)value);
3218 SvUV_set(sv, value);
3222 if (numtype & IS_NUMBER_NOT_INT) {
3223 /* I believe that even if the original PV had decimals,
3224 they are lost beyond the limit of the FP precision.
3225 However, neither is canonical, so both only get p
3226 flags. NWC, 2000/11/25 */
3227 /* Both already have p flags, so do nothing */
3230 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3231 if (SvIVX(sv) == I_V(nv)) {
3236 /* It had no "." so it must be integer. */
3239 /* between IV_MAX and NV(UV_MAX).
3240 Could be slightly > UV_MAX */
3242 if (numtype & IS_NUMBER_NOT_INT) {
3243 /* UV and NV both imprecise. */
3245 UV nv_as_uv = U_V(nv);
3247 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3258 #endif /* NV_PRESERVES_UV */
3261 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3263 if (SvTYPE(sv) < SVt_NV)
3264 /* Typically the caller expects that sv_any is not NULL now. */
3265 /* XXX Ilya implies that this is a bug in callers that assume this
3266 and ideally should be fixed. */
3267 sv_upgrade(sv, SVt_NV);
3270 #if defined(USE_LONG_DOUBLE)
3272 STORE_NUMERIC_LOCAL_SET_STANDARD();
3273 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3274 PTR2UV(sv), SvNVX(sv));
3275 RESTORE_NUMERIC_LOCAL();
3279 STORE_NUMERIC_LOCAL_SET_STANDARD();
3280 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3281 PTR2UV(sv), SvNVX(sv));
3282 RESTORE_NUMERIC_LOCAL();
3288 /* asIV(): extract an integer from the string value of an SV.
3289 * Caller must validate PVX */
3292 S_asIV(pTHX_ SV *sv)
3295 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3297 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3298 == IS_NUMBER_IN_UV) {
3299 /* It's definitely an integer */
3300 if (numtype & IS_NUMBER_NEG) {
3301 if (value < (UV)IV_MIN)
3304 if (value < (UV)IV_MAX)
3309 if (ckWARN(WARN_NUMERIC))
3312 return I_V(Atof(SvPVX(sv)));
3315 /* asUV(): extract an unsigned integer from the string value of an SV
3316 * Caller must validate PVX */
3319 S_asUV(pTHX_ SV *sv)
3322 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3324 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3325 == IS_NUMBER_IN_UV) {
3326 /* It's definitely an integer */
3327 if (!(numtype & IS_NUMBER_NEG))
3331 if (ckWARN(WARN_NUMERIC))
3334 return U_V(Atof(SvPVX(sv)));
3338 =for apidoc sv_2pv_nolen
3340 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3341 use the macro wrapper C<SvPV_nolen(sv)> instead.
3346 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3349 return sv_2pv(sv, &n_a);
3352 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3353 * UV as a string towards the end of buf, and return pointers to start and
3356 * We assume that buf is at least TYPE_CHARS(UV) long.
3360 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3362 char *ptr = buf + TYPE_CHARS(UV);
3376 *--ptr = '0' + (char)(uv % 10);
3384 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3385 * this function provided for binary compatibility only
3389 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3391 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3395 =for apidoc sv_2pv_flags
3397 Returns a pointer to the string value of an SV, and sets *lp to its length.
3398 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3400 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3401 usually end up here too.
3407 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3412 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3413 char *tmpbuf = tbuf;
3419 if (SvGMAGICAL(sv)) {
3420 if (flags & SV_GMAGIC)
3428 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3430 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3435 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3440 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3441 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3448 if (SvTHINKFIRST(sv)) {
3451 register const char *typestr;
3452 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3453 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3454 char *pv = SvPV(tmpstr, *lp);
3464 typestr = "NULLREF";
3468 switch (SvTYPE(sv)) {
3470 if ( ((SvFLAGS(sv) &
3471 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3472 == (SVs_OBJECT|SVs_SMG))
3473 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3474 const regexp *re = (regexp *)mg->mg_obj;
3477 const char *fptr = "msix";
3482 char need_newline = 0;
3483 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3485 while((ch = *fptr++)) {
3487 reflags[left++] = ch;
3490 reflags[right--] = ch;
3495 reflags[left] = '-';
3499 mg->mg_len = re->prelen + 4 + left;
3501 * If /x was used, we have to worry about a regex
3502 * ending with a comment later being embedded
3503 * within another regex. If so, we don't want this
3504 * regex's "commentization" to leak out to the
3505 * right part of the enclosing regex, we must cap
3506 * it with a newline.
3508 * So, if /x was used, we scan backwards from the
3509 * end of the regex. If we find a '#' before we
3510 * find a newline, we need to add a newline
3511 * ourself. If we find a '\n' first (or if we
3512 * don't find '#' or '\n'), we don't need to add
3513 * anything. -jfriedl
3515 if (PMf_EXTENDED & re->reganch)
3517 const char *endptr = re->precomp + re->prelen;
3518 while (endptr >= re->precomp)
3520 const char c = *(endptr--);
3522 break; /* don't need another */
3524 /* we end while in a comment, so we
3526 mg->mg_len++; /* save space for it */
3527 need_newline = 1; /* note to add it */
3533 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3534 Copy("(?", mg->mg_ptr, 2, char);
3535 Copy(reflags, mg->mg_ptr+2, left, char);
3536 Copy(":", mg->mg_ptr+left+2, 1, char);
3537 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3539 mg->mg_ptr[mg->mg_len - 2] = '\n';
3540 mg->mg_ptr[mg->mg_len - 1] = ')';
3541 mg->mg_ptr[mg->mg_len] = 0;
3543 PL_reginterp_cnt += re->program[0].next_off;
3545 if (re->reganch & ROPT_UTF8)
3560 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3561 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3562 /* tied lvalues should appear to be
3563 * scalars for backwards compatitbility */
3564 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3565 ? "SCALAR" : "LVALUE"; break;
3566 case SVt_PVAV: typestr = "ARRAY"; break;
3567 case SVt_PVHV: typestr = "HASH"; break;
3568 case SVt_PVCV: typestr = "CODE"; break;
3569 case SVt_PVGV: typestr = "GLOB"; break;
3570 case SVt_PVFM: typestr = "FORMAT"; break;
3571 case SVt_PVIO: typestr = "IO"; break;
3572 default: typestr = "UNKNOWN"; break;
3576 const char *name = HvNAME(SvSTASH(sv));
3577 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3578 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3581 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3584 *lp = strlen(typestr);
3585 return (char *)typestr;
3587 if (SvREADONLY(sv) && !SvOK(sv)) {
3588 if (ckWARN(WARN_UNINITIALIZED))
3594 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3595 /* I'm assuming that if both IV and NV are equally valid then
3596 converting the IV is going to be more efficient */
3597 const U32 isIOK = SvIOK(sv);
3598 const U32 isUIOK = SvIsUV(sv);
3599 char buf[TYPE_CHARS(UV)];
3602 if (SvTYPE(sv) < SVt_PVIV)
3603 sv_upgrade(sv, SVt_PVIV);
3605 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3607 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3608 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3609 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3610 SvCUR_set(sv, ebuf - ptr);
3620 else if (SvNOKp(sv)) {
3621 if (SvTYPE(sv) < SVt_PVNV)
3622 sv_upgrade(sv, SVt_PVNV);
3623 /* The +20 is pure guesswork. Configure test needed. --jhi */
3624 SvGROW(sv, NV_DIG + 20);
3626 olderrno = errno; /* some Xenix systems wipe out errno here */
3628 if (SvNVX(sv) == 0.0)
3629 (void)strcpy(s,"0");
3633 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3636 #ifdef FIXNEGATIVEZERO
3637 if (*s == '-' && s[1] == '0' && !s[2])
3647 if (ckWARN(WARN_UNINITIALIZED)
3648 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3651 if (SvTYPE(sv) < SVt_PV)
3652 /* Typically the caller expects that sv_any is not NULL now. */
3653 sv_upgrade(sv, SVt_PV);
3656 *lp = s - SvPVX(sv);
3659 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3660 PTR2UV(sv),SvPVX(sv)));
3664 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3665 /* Sneaky stuff here */
3669 tsv = newSVpv(tmpbuf, 0);
3686 len = strlen(tmpbuf);
3688 #ifdef FIXNEGATIVEZERO
3689 if (len == 2 && t[0] == '-' && t[1] == '0') {
3694 (void)SvUPGRADE(sv, SVt_PV);
3696 s = SvGROW(sv, len + 1);
3699 return strcpy(s, t);
3704 =for apidoc sv_copypv
3706 Copies a stringified representation of the source SV into the
3707 destination SV. Automatically performs any necessary mg_get and
3708 coercion of numeric values into strings. Guaranteed to preserve
3709 UTF-8 flag even from overloaded objects. Similar in nature to
3710 sv_2pv[_flags] but operates directly on an SV instead of just the
3711 string. Mostly uses sv_2pv_flags to do its work, except when that
3712 would lose the UTF-8'ness of the PV.
3718 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3723 sv_setpvn(dsv,s,len);
3731 =for apidoc sv_2pvbyte_nolen
3733 Return a pointer to the byte-encoded representation of the SV.
3734 May cause the SV to be downgraded from UTF-8 as a side-effect.
3736 Usually accessed via the C<SvPVbyte_nolen> macro.
3742 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3745 return sv_2pvbyte(sv, &n_a);
3749 =for apidoc sv_2pvbyte
3751 Return a pointer to the byte-encoded representation of the SV, and set *lp
3752 to its length. May cause the SV to be downgraded from UTF-8 as a
3755 Usually accessed via the C<SvPVbyte> macro.
3761 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3763 sv_utf8_downgrade(sv,0);
3764 return SvPV(sv,*lp);
3768 =for apidoc sv_2pvutf8_nolen
3770 Return a pointer to the UTF-8-encoded representation of the SV.
3771 May cause the SV to be upgraded to UTF-8 as a side-effect.
3773 Usually accessed via the C<SvPVutf8_nolen> macro.
3779 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3782 return sv_2pvutf8(sv, &n_a);
3786 =for apidoc sv_2pvutf8
3788 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3789 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3791 Usually accessed via the C<SvPVutf8> macro.
3797 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3799 sv_utf8_upgrade(sv);
3800 return SvPV(sv,*lp);
3804 =for apidoc sv_2bool
3806 This function is only called on magical items, and is only used by
3807 sv_true() or its macro equivalent.
3813 Perl_sv_2bool(pTHX_ register SV *sv)
3822 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3823 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3824 return (bool)SvTRUE(tmpsv);
3825 return SvRV(sv) != 0;
3828 register XPV* Xpvtmp;
3829 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3830 (*Xpvtmp->xpv_pv > '0' ||
3831 Xpvtmp->xpv_cur > 1 ||
3832 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3839 return SvIVX(sv) != 0;
3842 return SvNVX(sv) != 0.0;
3849 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3850 * this function provided for binary compatibility only
3855 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3857 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3861 =for apidoc sv_utf8_upgrade
3863 Converts the PV of an SV to its UTF-8-encoded form.
3864 Forces the SV to string form if it is not already.
3865 Always sets the SvUTF8 flag to avoid future validity checks even
3866 if all the bytes have hibit clear.
3868 This is not as a general purpose byte encoding to Unicode interface:
3869 use the Encode extension for that.
3871 =for apidoc sv_utf8_upgrade_flags
3873 Converts the PV of an SV to its UTF-8-encoded form.
3874 Forces the SV to string form if it is not already.
3875 Always sets the SvUTF8 flag to avoid future validity checks even
3876 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3877 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3878 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3880 This is not as a general purpose byte encoding to Unicode interface:
3881 use the Encode extension for that.
3887 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3892 if (sv == &PL_sv_undef)
3896 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3897 (void) sv_2pv_flags(sv,&len, flags);
3901 (void) SvPV_force(sv,len);
3910 sv_force_normal_flags(sv, 0);
3913 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3914 sv_recode_to_utf8(sv, PL_encoding);
3915 else { /* Assume Latin-1/EBCDIC */
3916 /* This function could be much more efficient if we
3917 * had a FLAG in SVs to signal if there are any hibit
3918 * chars in the PV. Given that there isn't such a flag
3919 * make the loop as fast as possible. */
3920 s = (U8 *) SvPVX(sv);
3921 e = (U8 *) SvEND(sv);
3925 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3930 (void)SvOOK_off(sv);
3932 len = SvCUR(sv) + 1; /* Plus the \0 */
3933 SvPV_set(sv, (char*)bytes_to_utf8((U8*)s, &len));
3934 SvCUR_set(sv, len - 1);
3936 Safefree(s); /* No longer using what was there before. */
3937 SvLEN_set(sv, len); /* No longer know the real size. */
3939 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3946 =for apidoc sv_utf8_downgrade
3948 Attempts to convert the PV of an SV from characters to bytes.
3949 If the PV contains a character beyond byte, this conversion will fail;
3950 in this case, either returns false or, if C<fail_ok> is not
3953 This is not as a general purpose Unicode to byte encoding interface:
3954 use the Encode extension for that.
3960 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3962 if (SvPOKp(sv) && SvUTF8(sv)) {
3968 sv_force_normal_flags(sv, 0);
3970 s = (U8 *) SvPV(sv, len);
3971 if (!utf8_to_bytes(s, &len)) {
3976 Perl_croak(aTHX_ "Wide character in %s",
3979 Perl_croak(aTHX_ "Wide character");
3990 =for apidoc sv_utf8_encode
3992 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3993 flag off so that it looks like octets again.
3999 Perl_sv_utf8_encode(pTHX_ register SV *sv)
4001 (void) sv_utf8_upgrade(sv);
4003 sv_force_normal_flags(sv, 0);
4005 if (SvREADONLY(sv)) {
4006 Perl_croak(aTHX_ PL_no_modify);
4012 =for apidoc sv_utf8_decode
4014 If the PV of the SV is an octet sequence in UTF-8
4015 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
4016 so that it looks like a character. If the PV contains only single-byte
4017 characters, the C<SvUTF8> flag stays being off.
4018 Scans PV for validity and returns false if the PV is invalid UTF-8.
4024 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4030 /* The octets may have got themselves encoded - get them back as
4033 if (!sv_utf8_downgrade(sv, TRUE))
4036 /* it is actually just a matter of turning the utf8 flag on, but
4037 * we want to make sure everything inside is valid utf8 first.
4039 c = (U8 *) SvPVX(sv);
4040 if (!is_utf8_string(c, SvCUR(sv)+1))
4042 e = (U8 *) SvEND(sv);
4045 if (!UTF8_IS_INVARIANT(ch)) {
4054 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4055 * this function provided for binary compatibility only
4059 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4061 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4065 =for apidoc sv_setsv
4067 Copies the contents of the source SV C<ssv> into the destination SV
4068 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4069 function if the source SV needs to be reused. Does not handle 'set' magic.
4070 Loosely speaking, it performs a copy-by-value, obliterating any previous
4071 content of the destination.
4073 You probably want to use one of the assortment of wrappers, such as
4074 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4075 C<SvSetMagicSV_nosteal>.
4077 =for apidoc sv_setsv_flags
4079 Copies the contents of the source SV C<ssv> into the destination SV
4080 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4081 function if the source SV needs to be reused. Does not handle 'set' magic.
4082 Loosely speaking, it performs a copy-by-value, obliterating any previous
4083 content of the destination.
4084 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4085 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4086 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4087 and C<sv_setsv_nomg> are implemented in terms of this function.
4089 You probably want to use one of the assortment of wrappers, such as
4090 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4091 C<SvSetMagicSV_nosteal>.
4093 This is the primary function for copying scalars, and most other
4094 copy-ish functions and macros use this underneath.
4100 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4102 register U32 sflags;
4108 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4110 sstr = &PL_sv_undef;
4111 stype = SvTYPE(sstr);
4112 dtype = SvTYPE(dstr);
4117 /* need to nuke the magic */
4119 SvRMAGICAL_off(dstr);
4122 /* There's a lot of redundancy below but we're going for speed here */
4127 if (dtype != SVt_PVGV) {
4128 (void)SvOK_off(dstr);
4136 sv_upgrade(dstr, SVt_IV);
4139 sv_upgrade(dstr, SVt_PVNV);
4143 sv_upgrade(dstr, SVt_PVIV);
4146 (void)SvIOK_only(dstr);
4147 SvIV_set(dstr, SvIVX(sstr));
4150 if (SvTAINTED(sstr))
4161 sv_upgrade(dstr, SVt_NV);
4166 sv_upgrade(dstr, SVt_PVNV);
4169 SvNV_set(dstr, SvNVX(sstr));
4170 (void)SvNOK_only(dstr);
4171 if (SvTAINTED(sstr))
4179 sv_upgrade(dstr, SVt_RV);
4180 else if (dtype == SVt_PVGV &&
4181 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4184 if (GvIMPORTED(dstr) != GVf_IMPORTED
4185 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4187 GvIMPORTED_on(dstr);
4196 #ifdef PERL_COPY_ON_WRITE
4197 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4198 if (dtype < SVt_PVIV)
4199 sv_upgrade(dstr, SVt_PVIV);
4206 sv_upgrade(dstr, SVt_PV);
4209 if (dtype < SVt_PVIV)
4210 sv_upgrade(dstr, SVt_PVIV);
4213 if (dtype < SVt_PVNV)
4214 sv_upgrade(dstr, SVt_PVNV);
4221 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
4224 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
4228 if (dtype <= SVt_PVGV) {
4230 if (dtype != SVt_PVGV) {
4231 char *name = GvNAME(sstr);
4232 STRLEN len = GvNAMELEN(sstr);
4233 /* don't upgrade SVt_PVLV: it can hold a glob */
4234 if (dtype != SVt_PVLV)
4235 sv_upgrade(dstr, SVt_PVGV);
4236 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4237 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4238 GvNAME(dstr) = savepvn(name, len);
4239 GvNAMELEN(dstr) = len;
4240 SvFAKE_on(dstr); /* can coerce to non-glob */
4242 /* ahem, death to those who redefine active sort subs */
4243 else if (PL_curstackinfo->si_type == PERLSI_SORT
4244 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4245 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4248 #ifdef GV_UNIQUE_CHECK
4249 if (GvUNIQUE((GV*)dstr)) {
4250 Perl_croak(aTHX_ PL_no_modify);
4254 (void)SvOK_off(dstr);
4255 GvINTRO_off(dstr); /* one-shot flag */
4257 GvGP(dstr) = gp_ref(GvGP(sstr));
4258 if (SvTAINTED(sstr))
4260 if (GvIMPORTED(dstr) != GVf_IMPORTED
4261 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4263 GvIMPORTED_on(dstr);
4271 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4273 if ((int)SvTYPE(sstr) != stype) {
4274 stype = SvTYPE(sstr);
4275 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4279 if (stype == SVt_PVLV)
4280 (void)SvUPGRADE(dstr, SVt_PVNV);
4282 (void)SvUPGRADE(dstr, (U32)stype);
4285 sflags = SvFLAGS(sstr);
4287 if (sflags & SVf_ROK) {
4288 if (dtype >= SVt_PV) {
4289 if (dtype == SVt_PVGV) {
4290 SV *sref = SvREFCNT_inc(SvRV(sstr));
4292 int intro = GvINTRO(dstr);
4294 #ifdef GV_UNIQUE_CHECK
4295 if (GvUNIQUE((GV*)dstr)) {
4296 Perl_croak(aTHX_ PL_no_modify);
4301 GvINTRO_off(dstr); /* one-shot flag */
4302 GvLINE(dstr) = CopLINE(PL_curcop);
4303 GvEGV(dstr) = (GV*)dstr;
4306 switch (SvTYPE(sref)) {
4309 SAVEGENERICSV(GvAV(dstr));
4311 dref = (SV*)GvAV(dstr);
4312 GvAV(dstr) = (AV*)sref;
4313 if (!GvIMPORTED_AV(dstr)
4314 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4316 GvIMPORTED_AV_on(dstr);
4321 SAVEGENERICSV(GvHV(dstr));
4323 dref = (SV*)GvHV(dstr);
4324 GvHV(dstr) = (HV*)sref;
4325 if (!GvIMPORTED_HV(dstr)
4326 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4328 GvIMPORTED_HV_on(dstr);
4333 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4334 SvREFCNT_dec(GvCV(dstr));
4335 GvCV(dstr) = Nullcv;
4336 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4337 PL_sub_generation++;
4339 SAVEGENERICSV(GvCV(dstr));
4342 dref = (SV*)GvCV(dstr);
4343 if (GvCV(dstr) != (CV*)sref) {
4344 CV* cv = GvCV(dstr);
4346 if (!GvCVGEN((GV*)dstr) &&
4347 (CvROOT(cv) || CvXSUB(cv)))
4349 /* ahem, death to those who redefine
4350 * active sort subs */
4351 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4352 PL_sortcop == CvSTART(cv))
4354 "Can't redefine active sort subroutine %s",
4355 GvENAME((GV*)dstr));
4356 /* Redefining a sub - warning is mandatory if
4357 it was a const and its value changed. */
4358 if (ckWARN(WARN_REDEFINE)
4360 && (!CvCONST((CV*)sref)
4361 || sv_cmp(cv_const_sv(cv),
4362 cv_const_sv((CV*)sref)))))
4364 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4366 ? "Constant subroutine %s::%s redefined"
4367 : "Subroutine %s::%s redefined",
4368 HvNAME(GvSTASH((GV*)dstr)),
4369 GvENAME((GV*)dstr));
4373 cv_ckproto(cv, (GV*)dstr,
4374 SvPOK(sref) ? SvPVX(sref) : Nullch);
4376 GvCV(dstr) = (CV*)sref;
4377 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4378 GvASSUMECV_on(dstr);
4379 PL_sub_generation++;
4381 if (!GvIMPORTED_CV(dstr)
4382 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4384 GvIMPORTED_CV_on(dstr);
4389 SAVEGENERICSV(GvIOp(dstr));
4391 dref = (SV*)GvIOp(dstr);
4392 GvIOp(dstr) = (IO*)sref;
4396 SAVEGENERICSV(GvFORM(dstr));
4398 dref = (SV*)GvFORM(dstr);
4399 GvFORM(dstr) = (CV*)sref;
4403 SAVEGENERICSV(GvSV(dstr));
4405 dref = (SV*)GvSV(dstr);
4407 if (!GvIMPORTED_SV(dstr)
4408 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4410 GvIMPORTED_SV_on(dstr);
4416 if (SvTAINTED(sstr))
4426 (void)SvOK_off(dstr);
4427 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4429 if (sflags & SVp_NOK) {
4431 /* Only set the public OK flag if the source has public OK. */
4432 if (sflags & SVf_NOK)
4433 SvFLAGS(dstr) |= SVf_NOK;
4434 SvNV_set(dstr, SvNVX(sstr));
4436 if (sflags & SVp_IOK) {
4437 (void)SvIOKp_on(dstr);
4438 if (sflags & SVf_IOK)
4439 SvFLAGS(dstr) |= SVf_IOK;
4440 if (sflags & SVf_IVisUV)
4442 SvIV_set(dstr, SvIVX(sstr));
4444 if (SvAMAGIC(sstr)) {
4448 else if (sflags & SVp_POK) {
4452 * Check to see if we can just swipe the string. If so, it's a
4453 * possible small lose on short strings, but a big win on long ones.
4454 * It might even be a win on short strings if SvPVX(dstr)
4455 * has to be allocated and SvPVX(sstr) has to be freed.
4458 /* Whichever path we take through the next code, we want this true,
4459 and doing it now facilitates the COW check. */
4460 (void)SvPOK_only(dstr);
4463 #ifdef PERL_COPY_ON_WRITE
4464 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4468 (sflags & SVs_TEMP) && /* slated for free anyway? */
4469 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4470 (!(flags & SV_NOSTEAL)) &&
4471 /* and we're allowed to steal temps */
4472 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4473 SvLEN(sstr) && /* and really is a string */
4474 /* and won't be needed again, potentially */
4475 !(PL_op && PL_op->op_type == OP_AASSIGN))
4476 #ifdef PERL_COPY_ON_WRITE
4477 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4478 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4479 && SvTYPE(sstr) >= SVt_PVIV)
4482 /* Failed the swipe test, and it's not a shared hash key either.
4483 Have to copy the string. */
4484 STRLEN len = SvCUR(sstr);
4485 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4486 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4487 SvCUR_set(dstr, len);
4488 *SvEND(dstr) = '\0';
4490 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4492 #ifdef PERL_COPY_ON_WRITE
4493 /* Either it's a shared hash key, or it's suitable for
4494 copy-on-write or we can swipe the string. */
4496 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4501 /* I believe I should acquire a global SV mutex if
4502 it's a COW sv (not a shared hash key) to stop
4503 it going un copy-on-write.
4504 If the source SV has gone un copy on write between up there
4505 and down here, then (assert() that) it is of the correct
4506 form to make it copy on write again */
4507 if ((sflags & (SVf_FAKE | SVf_READONLY))
4508 != (SVf_FAKE | SVf_READONLY)) {
4509 SvREADONLY_on(sstr);
4511 /* Make the source SV into a loop of 1.
4512 (about to become 2) */
4513 SV_COW_NEXT_SV_SET(sstr, sstr);
4517 /* Initial code is common. */
4518 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4520 SvFLAGS(dstr) &= ~SVf_OOK;
4521 Safefree(SvPVX(dstr) - SvIVX(dstr));
4523 else if (SvLEN(dstr))
4524 Safefree(SvPVX(dstr));
4527 #ifdef PERL_COPY_ON_WRITE
4529 /* making another shared SV. */
4530 STRLEN cur = SvCUR(sstr);
4531 STRLEN len = SvLEN(sstr);
4532 assert (SvTYPE(dstr) >= SVt_PVIV);
4534 /* SvIsCOW_normal */
4535 /* splice us in between source and next-after-source. */
4536 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4537 SV_COW_NEXT_SV_SET(sstr, dstr);
4538 SvPV_set(dstr, SvPVX(sstr));
4540 /* SvIsCOW_shared_hash */
4541 UV hash = SvUVX(sstr);
4542 DEBUG_C(PerlIO_printf(Perl_debug_log,
4543 "Copy on write: Sharing hash\n"));
4545 sharepvn(SvPVX(sstr),
4546 (sflags & SVf_UTF8?-cur:cur), hash));
4547 SvUV_set(dstr, hash);
4549 SvLEN_set(dstr, len);
4550 SvCUR_set(dstr, cur);
4551 SvREADONLY_on(dstr);
4553 /* Relesase a global SV mutex. */
4557 { /* Passes the swipe test. */
4558 SvPV_set(dstr, SvPVX(sstr));
4559 SvLEN_set(dstr, SvLEN(sstr));
4560 SvCUR_set(dstr, SvCUR(sstr));
4563 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4564 SvPV_set(sstr, Nullch);
4570 if (sflags & SVf_UTF8)
4573 if (sflags & SVp_NOK) {
4575 if (sflags & SVf_NOK)
4576 SvFLAGS(dstr) |= SVf_NOK;
4577 SvNV_set(dstr, SvNVX(sstr));
4579 if (sflags & SVp_IOK) {
4580 (void)SvIOKp_on(dstr);
4581 if (sflags & SVf_IOK)
4582 SvFLAGS(dstr) |= SVf_IOK;
4583 if (sflags & SVf_IVisUV)
4585 SvIV_set(dstr, SvIVX(sstr));
4588 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4589 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4590 smg->mg_ptr, smg->mg_len);
4591 SvRMAGICAL_on(dstr);
4594 else if (sflags & SVp_IOK) {
4595 if (sflags & SVf_IOK)
4596 (void)SvIOK_only(dstr);
4598 (void)SvOK_off(dstr);
4599 (void)SvIOKp_on(dstr);
4601 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4602 if (sflags & SVf_IVisUV)
4604 SvIV_set(dstr, SvIVX(sstr));
4605 if (sflags & SVp_NOK) {
4606 if (sflags & SVf_NOK)
4607 (void)SvNOK_on(dstr);
4609 (void)SvNOKp_on(dstr);
4610 SvNV_set(dstr, SvNVX(sstr));
4613 else if (sflags & SVp_NOK) {
4614 if (sflags & SVf_NOK)
4615 (void)SvNOK_only(dstr);
4617 (void)SvOK_off(dstr);
4620 SvNV_set(dstr, SvNVX(sstr));
4623 if (dtype == SVt_PVGV) {
4624 if (ckWARN(WARN_MISC))
4625 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4628 (void)SvOK_off(dstr);
4630 if (SvTAINTED(sstr))
4635 =for apidoc sv_setsv_mg
4637 Like C<sv_setsv>, but also handles 'set' magic.
4643 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4645 sv_setsv(dstr,sstr);
4649 #ifdef PERL_COPY_ON_WRITE
4651 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4653 STRLEN cur = SvCUR(sstr);
4654 STRLEN len = SvLEN(sstr);
4655 register char *new_pv;
4658 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4666 if (SvTHINKFIRST(dstr))
4667 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4668 else if (SvPVX(dstr))
4669 Safefree(SvPVX(dstr));
4673 (void)SvUPGRADE (dstr, SVt_PVIV);
4675 assert (SvPOK(sstr));
4676 assert (SvPOKp(sstr));
4677 assert (!SvIOK(sstr));
4678 assert (!SvIOKp(sstr));
4679 assert (!SvNOK(sstr));
4680 assert (!SvNOKp(sstr));
4682 if (SvIsCOW(sstr)) {
4684 if (SvLEN(sstr) == 0) {
4685 /* source is a COW shared hash key. */
4686 UV hash = SvUVX(sstr);
4687 DEBUG_C(PerlIO_printf(Perl_debug_log,
4688 "Fast copy on write: Sharing hash\n"));
4689 SvUV_set(dstr, hash);
4690 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4693 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4695 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4696 (void)SvUPGRADE (sstr, SVt_PVIV);
4697 SvREADONLY_on(sstr);
4699 DEBUG_C(PerlIO_printf(Perl_debug_log,
4700 "Fast copy on write: Converting sstr to COW\n"));
4701 SV_COW_NEXT_SV_SET(dstr, sstr);
4703 SV_COW_NEXT_SV_SET(sstr, dstr);
4704 new_pv = SvPVX(sstr);
4707 SvPV_set(dstr, new_pv);
4708 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4711 SvLEN_set(dstr, len);
4712 SvCUR_set(dstr, cur);
4721 =for apidoc sv_setpvn
4723 Copies a string into an SV. The C<len> parameter indicates the number of
4724 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4725 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4731 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4733 register char *dptr;
4735 SV_CHECK_THINKFIRST_COW_DROP(sv);
4741 /* len is STRLEN which is unsigned, need to copy to signed */
4744 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4746 (void)SvUPGRADE(sv, SVt_PV);
4748 SvGROW(sv, len + 1);
4750 Move(ptr,dptr,len,char);
4753 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4758 =for apidoc sv_setpvn_mg
4760 Like C<sv_setpvn>, but also handles 'set' magic.
4766 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4768 sv_setpvn(sv,ptr,len);
4773 =for apidoc sv_setpv
4775 Copies a string into an SV. The string must be null-terminated. Does not
4776 handle 'set' magic. See C<sv_setpv_mg>.
4782 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4784 register STRLEN len;
4786 SV_CHECK_THINKFIRST_COW_DROP(sv);
4792 (void)SvUPGRADE(sv, SVt_PV);
4794 SvGROW(sv, len + 1);
4795 Move(ptr,SvPVX(sv),len+1,char);
4797 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4802 =for apidoc sv_setpv_mg
4804 Like C<sv_setpv>, but also handles 'set' magic.
4810 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4817 =for apidoc sv_usepvn
4819 Tells an SV to use C<ptr> to find its string value. Normally the string is
4820 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4821 The C<ptr> should point to memory that was allocated by C<malloc>. The
4822 string length, C<len>, must be supplied. This function will realloc the
4823 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4824 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4825 See C<sv_usepvn_mg>.
4831 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4833 SV_CHECK_THINKFIRST_COW_DROP(sv);
4834 (void)SvUPGRADE(sv, SVt_PV);
4841 Renew(ptr, len+1, char);
4844 SvLEN_set(sv, len+1);
4846 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4851 =for apidoc sv_usepvn_mg
4853 Like C<sv_usepvn>, but also handles 'set' magic.
4859 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4861 sv_usepvn(sv,ptr,len);
4865 #ifdef PERL_COPY_ON_WRITE
4866 /* Need to do this *after* making the SV normal, as we need the buffer
4867 pointer to remain valid until after we've copied it. If we let go too early,
4868 another thread could invalidate it by unsharing last of the same hash key
4869 (which it can do by means other than releasing copy-on-write Svs)
4870 or by changing the other copy-on-write SVs in the loop. */
4872 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4873 U32 hash, SV *after)
4875 if (len) { /* this SV was SvIsCOW_normal(sv) */
4876 /* we need to find the SV pointing to us. */
4877 SV *current = SV_COW_NEXT_SV(after);
4879 if (current == sv) {
4880 /* The SV we point to points back to us (there were only two of us
4882 Hence other SV is no longer copy on write either. */
4884 SvREADONLY_off(after);
4886 /* We need to follow the pointers around the loop. */
4888 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4891 /* don't loop forever if the structure is bust, and we have
4892 a pointer into a closed loop. */
4893 assert (current != after);
4894 assert (SvPVX(current) == pvx);
4896 /* Make the SV before us point to the SV after us. */
4897 SV_COW_NEXT_SV_SET(current, after);
4900 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4905 Perl_sv_release_IVX(pTHX_ register SV *sv)
4908 sv_force_normal_flags(sv, 0);
4914 =for apidoc sv_force_normal_flags
4916 Undo various types of fakery on an SV: if the PV is a shared string, make
4917 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4918 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4919 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4920 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4921 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4922 set to some other value.) In addition, the C<flags> parameter gets passed to
4923 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4924 with flags set to 0.
4930 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4932 #ifdef PERL_COPY_ON_WRITE
4933 if (SvREADONLY(sv)) {
4934 /* At this point I believe I should acquire a global SV mutex. */
4936 char *pvx = SvPVX(sv);
4937 STRLEN len = SvLEN(sv);
4938 STRLEN cur = SvCUR(sv);
4939 U32 hash = SvUVX(sv);
4940 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4942 PerlIO_printf(Perl_debug_log,
4943 "Copy on write: Force normal %ld\n",
4949 /* This SV doesn't own the buffer, so need to New() a new one: */
4950 SvPV_set(sv, (char*)0);
4952 if (flags & SV_COW_DROP_PV) {
4953 /* OK, so we don't need to copy our buffer. */
4956 SvGROW(sv, cur + 1);
4957 Move(pvx,SvPVX(sv),cur,char);
4961 sv_release_COW(sv, pvx, cur, len, hash, next);
4966 else if (IN_PERL_RUNTIME)
4967 Perl_croak(aTHX_ PL_no_modify);
4968 /* At this point I believe that I can drop the global SV mutex. */
4971 if (SvREADONLY(sv)) {
4973 char *pvx = SvPVX(sv);
4974 int is_utf8 = SvUTF8(sv);
4975 STRLEN len = SvCUR(sv);
4976 U32 hash = SvUVX(sv);
4979 SvPV_set(sv, (char*)0);
4981 SvGROW(sv, len + 1);
4982 Move(pvx,SvPVX(sv),len,char);
4984 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4986 else if (IN_PERL_RUNTIME)
4987 Perl_croak(aTHX_ PL_no_modify);
4991 sv_unref_flags(sv, flags);
4992 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4997 =for apidoc sv_force_normal
4999 Undo various types of fakery on an SV: if the PV is a shared string, make
5000 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
5001 an xpvmg. See also C<sv_force_normal_flags>.
5007 Perl_sv_force_normal(pTHX_ register SV *sv)
5009 sv_force_normal_flags(sv, 0);
5015 Efficient removal of characters from the beginning of the string buffer.
5016 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5017 the string buffer. The C<ptr> becomes the first character of the adjusted
5018 string. Uses the "OOK hack".
5019 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
5020 refer to the same chunk of data.
5026 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
5028 register STRLEN delta;
5029 if (!ptr || !SvPOKp(sv))
5031 delta = ptr - SvPVX(sv);
5032 SV_CHECK_THINKFIRST(sv);
5033 if (SvTYPE(sv) < SVt_PVIV)
5034 sv_upgrade(sv,SVt_PVIV);
5037 if (!SvLEN(sv)) { /* make copy of shared string */
5038 char *pvx = SvPVX(sv);
5039 STRLEN len = SvCUR(sv);
5040 SvGROW(sv, len + 1);
5041 Move(pvx,SvPVX(sv),len,char);
5045 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5046 and we do that anyway inside the SvNIOK_off
5048 SvFLAGS(sv) |= SVf_OOK;
5051 SvLEN_set(sv, SvLEN(sv) - delta);
5052 SvCUR_set(sv, SvCUR(sv) - delta);
5053 SvPV_set(sv, SvPVX(sv) + delta);
5054 SvIV_set(sv, SvIVX(sv) + delta);
5057 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5058 * this function provided for binary compatibility only
5062 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5064 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5068 =for apidoc sv_catpvn
5070 Concatenates the string onto the end of the string which is in the SV. The
5071 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5072 status set, then the bytes appended should be valid UTF-8.
5073 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5075 =for apidoc sv_catpvn_flags
5077 Concatenates the string onto the end of the string which is in the SV. The
5078 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5079 status set, then the bytes appended should be valid UTF-8.
5080 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5081 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5082 in terms of this function.
5088 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5093 dstr = SvPV_force_flags(dsv, dlen, flags);
5094 SvGROW(dsv, dlen + slen + 1);
5097 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5098 SvCUR_set(dsv, SvCUR(dsv) + slen);
5100 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5105 =for apidoc sv_catpvn_mg
5107 Like C<sv_catpvn>, but also handles 'set' magic.
5113 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5115 sv_catpvn(sv,ptr,len);
5119 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5120 * this function provided for binary compatibility only
5124 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5126 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5130 =for apidoc sv_catsv
5132 Concatenates the string from SV C<ssv> onto the end of the string in
5133 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5134 not 'set' magic. See C<sv_catsv_mg>.
5136 =for apidoc sv_catsv_flags
5138 Concatenates the string from SV C<ssv> onto the end of the string in
5139 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5140 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5141 and C<sv_catsv_nomg> are implemented in terms of this function.
5146 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5152 if ((spv = SvPV(ssv, slen))) {
5153 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5154 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5155 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5156 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5157 dsv->sv_flags doesn't have that bit set.
5158 Andy Dougherty 12 Oct 2001
5160 I32 sutf8 = DO_UTF8(ssv);
5163 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5165 dutf8 = DO_UTF8(dsv);
5167 if (dutf8 != sutf8) {
5169 /* Not modifying source SV, so taking a temporary copy. */
5170 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5172 sv_utf8_upgrade(csv);
5173 spv = SvPV(csv, slen);
5176 sv_utf8_upgrade_nomg(dsv);
5178 sv_catpvn_nomg(dsv, spv, slen);
5183 =for apidoc sv_catsv_mg
5185 Like C<sv_catsv>, but also handles 'set' magic.
5191 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5198 =for apidoc sv_catpv
5200 Concatenates the string onto the end of the string which is in the SV.
5201 If the SV has the UTF-8 status set, then the bytes appended should be
5202 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5207 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5209 register STRLEN len;
5215 junk = SvPV_force(sv, tlen);
5217 SvGROW(sv, tlen + len + 1);
5220 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5221 SvCUR_set(sv, SvCUR(sv) + len);
5222 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5227 =for apidoc sv_catpv_mg
5229 Like C<sv_catpv>, but also handles 'set' magic.
5235 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5244 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5245 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5252 Perl_newSV(pTHX_ STRLEN len)
5258 sv_upgrade(sv, SVt_PV);
5259 SvGROW(sv, len + 1);
5264 =for apidoc sv_magicext
5266 Adds magic to an SV, upgrading it if necessary. Applies the
5267 supplied vtable and returns a pointer to the magic added.
5269 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5270 In particular, you can add magic to SvREADONLY SVs, and add more than
5271 one instance of the same 'how'.
5273 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5274 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5275 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5276 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5278 (This is now used as a subroutine by C<sv_magic>.)
5283 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5284 const char* name, I32 namlen)
5288 if (SvTYPE(sv) < SVt_PVMG) {
5289 (void)SvUPGRADE(sv, SVt_PVMG);
5291 Newz(702,mg, 1, MAGIC);
5292 mg->mg_moremagic = SvMAGIC(sv);
5293 SvMAGIC_set(sv, mg);
5295 /* Sometimes a magic contains a reference loop, where the sv and
5296 object refer to each other. To prevent a reference loop that
5297 would prevent such objects being freed, we look for such loops
5298 and if we find one we avoid incrementing the object refcount.
5300 Note we cannot do this to avoid self-tie loops as intervening RV must
5301 have its REFCNT incremented to keep it in existence.
5304 if (!obj || obj == sv ||
5305 how == PERL_MAGIC_arylen ||
5306 how == PERL_MAGIC_qr ||
5307 (SvTYPE(obj) == SVt_PVGV &&
5308 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5309 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5310 GvFORM(obj) == (CV*)sv)))
5315 mg->mg_obj = SvREFCNT_inc(obj);
5316 mg->mg_flags |= MGf_REFCOUNTED;
5319 /* Normal self-ties simply pass a null object, and instead of
5320 using mg_obj directly, use the SvTIED_obj macro to produce a
5321 new RV as needed. For glob "self-ties", we are tieing the PVIO
5322 with an RV obj pointing to the glob containing the PVIO. In
5323 this case, to avoid a reference loop, we need to weaken the
5327 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5328 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5334 mg->mg_len = namlen;
5337 mg->mg_ptr = savepvn(name, namlen);
5338 else if (namlen == HEf_SVKEY)
5339 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5341 mg->mg_ptr = (char *) name;
5343 mg->mg_virtual = vtable;
5347 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5352 =for apidoc sv_magic
5354 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5355 then adds a new magic item of type C<how> to the head of the magic list.
5357 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5358 handling of the C<name> and C<namlen> arguments.
5360 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5361 to add more than one instance of the same 'how'.
5367 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5369 const MGVTBL *vtable = 0;
5372 #ifdef PERL_COPY_ON_WRITE
5374 sv_force_normal_flags(sv, 0);
5376 if (SvREADONLY(sv)) {
5378 && how != PERL_MAGIC_regex_global
5379 && how != PERL_MAGIC_bm
5380 && how != PERL_MAGIC_fm
5381 && how != PERL_MAGIC_sv
5382 && how != PERL_MAGIC_backref
5385 Perl_croak(aTHX_ PL_no_modify);
5388 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5389 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5390 /* sv_magic() refuses to add a magic of the same 'how' as an
5393 if (how == PERL_MAGIC_taint)
5401 vtable = &PL_vtbl_sv;
5403 case PERL_MAGIC_overload:
5404 vtable = &PL_vtbl_amagic;
5406 case PERL_MAGIC_overload_elem:
5407 vtable = &PL_vtbl_amagicelem;
5409 case PERL_MAGIC_overload_table:
5410 vtable = &PL_vtbl_ovrld;
5413 vtable = &PL_vtbl_bm;
5415 case PERL_MAGIC_regdata:
5416 vtable = &PL_vtbl_regdata;
5418 case PERL_MAGIC_regdatum:
5419 vtable = &PL_vtbl_regdatum;
5421 case PERL_MAGIC_env:
5422 vtable = &PL_vtbl_env;
5425 vtable = &PL_vtbl_fm;
5427 case PERL_MAGIC_envelem:
5428 vtable = &PL_vtbl_envelem;
5430 case PERL_MAGIC_regex_global:
5431 vtable = &PL_vtbl_mglob;
5433 case PERL_MAGIC_isa:
5434 vtable = &PL_vtbl_isa;
5436 case PERL_MAGIC_isaelem:
5437 vtable = &PL_vtbl_isaelem;
5439 case PERL_MAGIC_nkeys:
5440 vtable = &PL_vtbl_nkeys;
5442 case PERL_MAGIC_dbfile:
5445 case PERL_MAGIC_dbline:
5446 vtable = &PL_vtbl_dbline;
5448 #ifdef USE_LOCALE_COLLATE
5449 case PERL_MAGIC_collxfrm:
5450 vtable = &PL_vtbl_collxfrm;
5452 #endif /* USE_LOCALE_COLLATE */
5453 case PERL_MAGIC_tied:
5454 vtable = &PL_vtbl_pack;
5456 case PERL_MAGIC_tiedelem:
5457 case PERL_MAGIC_tiedscalar:
5458 vtable = &PL_vtbl_packelem;
5461 vtable = &PL_vtbl_regexp;
5463 case PERL_MAGIC_sig:
5464 vtable = &PL_vtbl_sig;
5466 case PERL_MAGIC_sigelem:
5467 vtable = &PL_vtbl_sigelem;
5469 case PERL_MAGIC_taint:
5470 vtable = &PL_vtbl_taint;
5472 case PERL_MAGIC_uvar:
5473 vtable = &PL_vtbl_uvar;
5475 case PERL_MAGIC_vec:
5476 vtable = &PL_vtbl_vec;
5478 case PERL_MAGIC_vstring:
5481 case PERL_MAGIC_utf8:
5482 vtable = &PL_vtbl_utf8;
5484 case PERL_MAGIC_substr:
5485 vtable = &PL_vtbl_substr;
5487 case PERL_MAGIC_defelem:
5488 vtable = &PL_vtbl_defelem;
5490 case PERL_MAGIC_glob:
5491 vtable = &PL_vtbl_glob;
5493 case PERL_MAGIC_arylen:
5494 vtable = &PL_vtbl_arylen;
5496 case PERL_MAGIC_pos:
5497 vtable = &PL_vtbl_pos;
5499 case PERL_MAGIC_backref:
5500 vtable = &PL_vtbl_backref;
5502 case PERL_MAGIC_ext:
5503 /* Reserved for use by extensions not perl internals. */
5504 /* Useful for attaching extension internal data to perl vars. */
5505 /* Note that multiple extensions may clash if magical scalars */
5506 /* etc holding private data from one are passed to another. */
5509 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5512 /* Rest of work is done else where */
5513 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5516 case PERL_MAGIC_taint:
5519 case PERL_MAGIC_ext:
5520 case PERL_MAGIC_dbfile:
5527 =for apidoc sv_unmagic
5529 Removes all magic of type C<type> from an SV.
5535 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5539 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5542 for (mg = *mgp; mg; mg = *mgp) {
5543 if (mg->mg_type == type) {
5544 const MGVTBL* const vtbl = mg->mg_virtual;
5545 *mgp = mg->mg_moremagic;
5546 if (vtbl && vtbl->svt_free)
5547 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5548 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5550 Safefree(mg->mg_ptr);
5551 else if (mg->mg_len == HEf_SVKEY)
5552 SvREFCNT_dec((SV*)mg->mg_ptr);
5553 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5554 Safefree(mg->mg_ptr);
5556 if (mg->mg_flags & MGf_REFCOUNTED)
5557 SvREFCNT_dec(mg->mg_obj);
5561 mgp = &mg->mg_moremagic;
5565 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5572 =for apidoc sv_rvweaken
5574 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5575 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5576 push a back-reference to this RV onto the array of backreferences
5577 associated with that magic.
5583 Perl_sv_rvweaken(pTHX_ SV *sv)
5586 if (!SvOK(sv)) /* let undefs pass */
5589 Perl_croak(aTHX_ "Can't weaken a nonreference");
5590 else if (SvWEAKREF(sv)) {
5591 if (ckWARN(WARN_MISC))
5592 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5596 sv_add_backref(tsv, sv);
5602 /* Give tsv backref magic if it hasn't already got it, then push a
5603 * back-reference to sv onto the array associated with the backref magic.
5607 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5611 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5612 av = (AV*)mg->mg_obj;
5615 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5616 /* av now has a refcnt of 2, which avoids it getting freed
5617 * before us during global cleanup. The extra ref is removed
5618 * by magic_killbackrefs() when tsv is being freed */
5620 if (AvFILLp(av) >= AvMAX(av)) {
5622 SV **svp = AvARRAY(av);
5623 for (i = AvFILLp(av); i >= 0; i--)
5625 svp[i] = sv; /* reuse the slot */
5628 av_extend(av, AvFILLp(av)+1);
5630 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5633 /* delete a back-reference to ourselves from the backref magic associated
5634 * with the SV we point to.
5638 S_sv_del_backref(pTHX_ SV *sv)
5645 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5646 Perl_croak(aTHX_ "panic: del_backref");
5647 av = (AV *)mg->mg_obj;
5649 for (i = AvFILLp(av); i >= 0; i--)
5650 if (svp[i] == sv) svp[i] = Nullsv;
5654 =for apidoc sv_insert
5656 Inserts a string at the specified offset/length within the SV. Similar to
5657 the Perl substr() function.
5663 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5667 register char *midend;
5668 register char *bigend;
5674 Perl_croak(aTHX_ "Can't modify non-existent substring");
5675 SvPV_force(bigstr, curlen);
5676 (void)SvPOK_only_UTF8(bigstr);
5677 if (offset + len > curlen) {
5678 SvGROW(bigstr, offset+len+1);
5679 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5680 SvCUR_set(bigstr, offset+len);
5684 i = littlelen - len;
5685 if (i > 0) { /* string might grow */
5686 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5687 mid = big + offset + len;
5688 midend = bigend = big + SvCUR(bigstr);
5691 while (midend > mid) /* shove everything down */
5692 *--bigend = *--midend;
5693 Move(little,big+offset,littlelen,char);
5694 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5699 Move(little,SvPVX(bigstr)+offset,len,char);
5704 big = SvPVX(bigstr);
5707 bigend = big + SvCUR(bigstr);
5709 if (midend > bigend)
5710 Perl_croak(aTHX_ "panic: sv_insert");
5712 if (mid - big > bigend - midend) { /* faster to shorten from end */
5714 Move(little, mid, littlelen,char);
5717 i = bigend - midend;
5719 Move(midend, mid, i,char);
5723 SvCUR_set(bigstr, mid - big);
5726 else if ((i = mid - big)) { /* faster from front */
5727 midend -= littlelen;
5729 sv_chop(bigstr,midend-i);
5734 Move(little, mid, littlelen,char);
5736 else if (littlelen) {
5737 midend -= littlelen;
5738 sv_chop(bigstr,midend);
5739 Move(little,midend,littlelen,char);
5742 sv_chop(bigstr,midend);
5748 =for apidoc sv_replace
5750 Make the first argument a copy of the second, then delete the original.
5751 The target SV physically takes over ownership of the body of the source SV
5752 and inherits its flags; however, the target keeps any magic it owns,
5753 and any magic in the source is discarded.
5754 Note that this is a rather specialist SV copying operation; most of the
5755 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5761 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5763 U32 refcnt = SvREFCNT(sv);
5764 SV_CHECK_THINKFIRST_COW_DROP(sv);
5765 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5766 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5767 if (SvMAGICAL(sv)) {
5771 sv_upgrade(nsv, SVt_PVMG);
5772 SvMAGIC_set(nsv, SvMAGIC(sv));
5773 SvFLAGS(nsv) |= SvMAGICAL(sv);
5775 SvMAGIC_set(sv, NULL);
5779 assert(!SvREFCNT(sv));
5780 #ifdef DEBUG_LEAKING_SCALARS
5781 sv->sv_flags = nsv->sv_flags;
5782 sv->sv_any = nsv->sv_any;
5783 sv->sv_refcnt = nsv->sv_refcnt;
5785 StructCopy(nsv,sv,SV);
5788 #ifdef PERL_COPY_ON_WRITE
5789 if (SvIsCOW_normal(nsv)) {
5790 /* We need to follow the pointers around the loop to make the
5791 previous SV point to sv, rather than nsv. */
5794 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5797 assert(SvPVX(current) == SvPVX(nsv));
5799 /* Make the SV before us point to the SV after us. */
5801 PerlIO_printf(Perl_debug_log, "previous is\n");
5803 PerlIO_printf(Perl_debug_log,
5804 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5805 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5807 SV_COW_NEXT_SV_SET(current, sv);
5810 SvREFCNT(sv) = refcnt;
5811 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5817 =for apidoc sv_clear
5819 Clear an SV: call any destructors, free up any memory used by the body,
5820 and free the body itself. The SV's head is I<not> freed, although
5821 its type is set to all 1's so that it won't inadvertently be assumed
5822 to be live during global destruction etc.
5823 This function should only be called when REFCNT is zero. Most of the time
5824 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5831 Perl_sv_clear(pTHX_ register SV *sv)
5836 assert(SvREFCNT(sv) == 0);
5839 if (PL_defstash) { /* Still have a symbol table? */
5846 stash = SvSTASH(sv);
5847 destructor = StashHANDLER(stash,DESTROY);
5849 SV* tmpref = newRV(sv);
5850 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5852 PUSHSTACKi(PERLSI_DESTROY);
5857 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5863 if(SvREFCNT(tmpref) < 2) {
5864 /* tmpref is not kept alive! */
5866 SvRV_set(tmpref, NULL);
5869 SvREFCNT_dec(tmpref);
5871 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5875 if (PL_in_clean_objs)
5876 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5878 /* DESTROY gave object new lease on life */
5884 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5885 SvOBJECT_off(sv); /* Curse the object. */
5886 if (SvTYPE(sv) != SVt_PVIO)
5887 --PL_sv_objcount; /* XXX Might want something more general */
5890 if (SvTYPE(sv) >= SVt_PVMG) {
5893 if (SvFLAGS(sv) & SVpad_TYPED)
5894 SvREFCNT_dec(SvSTASH(sv));
5897 switch (SvTYPE(sv)) {
5900 IoIFP(sv) != PerlIO_stdin() &&
5901 IoIFP(sv) != PerlIO_stdout() &&
5902 IoIFP(sv) != PerlIO_stderr())
5904 io_close((IO*)sv, FALSE);
5906 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5907 PerlDir_close(IoDIRP(sv));
5908 IoDIRP(sv) = (DIR*)NULL;
5909 Safefree(IoTOP_NAME(sv));
5910 Safefree(IoFMT_NAME(sv));
5911 Safefree(IoBOTTOM_NAME(sv));
5926 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5927 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5928 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5929 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5931 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5932 SvREFCNT_dec(LvTARG(sv));
5936 Safefree(GvNAME(sv));
5937 /* cannot decrease stash refcount yet, as we might recursively delete
5938 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5939 of stash until current sv is completely gone.
5940 -- JohnPC, 27 Mar 1998 */
5941 stash = GvSTASH(sv);
5947 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5949 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5950 /* Don't even bother with turning off the OOK flag. */
5959 SvREFCNT_dec(SvRV(sv));
5961 #ifdef PERL_COPY_ON_WRITE
5962 else if (SvPVX(sv)) {
5964 /* I believe I need to grab the global SV mutex here and
5965 then recheck the COW status. */
5967 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5970 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5971 SvUVX(sv), SV_COW_NEXT_SV(sv));
5972 /* And drop it here. */
5974 } else if (SvLEN(sv)) {
5975 Safefree(SvPVX(sv));
5979 else if (SvPVX(sv) && SvLEN(sv))
5980 Safefree(SvPVX(sv));
5981 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5982 unsharepvn(SvPVX(sv),
5983 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5997 switch (SvTYPE(sv)) {
6013 del_XPVIV(SvANY(sv));
6016 del_XPVNV(SvANY(sv));
6019 del_XPVMG(SvANY(sv));
6022 del_XPVLV(SvANY(sv));
6025 del_XPVAV(SvANY(sv));
6028 del_XPVHV(SvANY(sv));
6031 del_XPVCV(SvANY(sv));
6034 del_XPVGV(SvANY(sv));
6035 /* code duplication for increased performance. */
6036 SvFLAGS(sv) &= SVf_BREAK;
6037 SvFLAGS(sv) |= SVTYPEMASK;
6038 /* decrease refcount of the stash that owns this GV, if any */
6040 SvREFCNT_dec(stash);
6041 return; /* not break, SvFLAGS reset already happened */
6043 del_XPVBM(SvANY(sv));
6046 del_XPVFM(SvANY(sv));
6049 del_XPVIO(SvANY(sv));
6052 SvFLAGS(sv) &= SVf_BREAK;
6053 SvFLAGS(sv) |= SVTYPEMASK;
6057 =for apidoc sv_newref
6059 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6066 Perl_sv_newref(pTHX_ SV *sv)
6076 Decrement an SV's reference count, and if it drops to zero, call
6077 C<sv_clear> to invoke destructors and free up any memory used by
6078 the body; finally, deallocate the SV's head itself.
6079 Normally called via a wrapper macro C<SvREFCNT_dec>.
6085 Perl_sv_free(pTHX_ SV *sv)
6090 if (SvREFCNT(sv) == 0) {
6091 if (SvFLAGS(sv) & SVf_BREAK)
6092 /* this SV's refcnt has been artificially decremented to
6093 * trigger cleanup */
6095 if (PL_in_clean_all) /* All is fair */
6097 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6098 /* make sure SvREFCNT(sv)==0 happens very seldom */
6099 SvREFCNT(sv) = (~(U32)0)/2;
6102 if (ckWARN_d(WARN_INTERNAL))
6103 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6104 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6105 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6108 if (--(SvREFCNT(sv)) > 0)
6110 Perl_sv_free2(aTHX_ sv);
6114 Perl_sv_free2(pTHX_ SV *sv)
6119 if (ckWARN_d(WARN_DEBUGGING))
6120 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6121 "Attempt to free temp prematurely: SV 0x%"UVxf
6122 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6126 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6127 /* make sure SvREFCNT(sv)==0 happens very seldom */
6128 SvREFCNT(sv) = (~(U32)0)/2;
6139 Returns the length of the string in the SV. Handles magic and type
6140 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6146 Perl_sv_len(pTHX_ register SV *sv)
6154 len = mg_length(sv);
6156 (void)SvPV(sv, len);
6161 =for apidoc sv_len_utf8
6163 Returns the number of characters in the string in an SV, counting wide
6164 UTF-8 bytes as a single character. Handles magic and type coercion.
6170 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6171 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6172 * (Note that the mg_len is not the length of the mg_ptr field.)
6177 Perl_sv_len_utf8(pTHX_ register SV *sv)
6183 return mg_length(sv);
6187 U8 *s = (U8*)SvPV(sv, len);
6188 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6190 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6192 #ifdef PERL_UTF8_CACHE_ASSERT
6193 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6197 ulen = Perl_utf8_length(aTHX_ s, s + len);
6198 if (!mg && !SvREADONLY(sv)) {
6199 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6200 mg = mg_find(sv, PERL_MAGIC_utf8);
6210 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6211 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6212 * between UTF-8 and byte offsets. There are two (substr offset and substr
6213 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6214 * and byte offset) cache positions.
6216 * The mg_len field is used by sv_len_utf8(), see its comments.
6217 * Note that the mg_len is not the length of the mg_ptr field.
6221 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
6225 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6227 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6231 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6233 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6234 (*mgp)->mg_ptr = (char *) *cachep;
6238 (*cachep)[i] = *offsetp;
6239 (*cachep)[i+1] = s - start;
6247 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6248 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6249 * between UTF-8 and byte offsets. See also the comments of
6250 * S_utf8_mg_pos_init().
6254 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6258 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6260 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6261 if (*mgp && (*mgp)->mg_ptr) {
6262 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6263 ASSERT_UTF8_CACHE(*cachep);
6264 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6266 else { /* We will skip to the right spot. */
6271 /* The assumption is that going backward is half
6272 * the speed of going forward (that's where the
6273 * 2 * backw in the below comes from). (The real
6274 * figure of course depends on the UTF-8 data.) */
6276 if ((*cachep)[i] > (STRLEN)uoff) {
6278 backw = (*cachep)[i] - (STRLEN)uoff;
6280 if (forw < 2 * backw)
6283 p = start + (*cachep)[i+1];
6285 /* Try this only for the substr offset (i == 0),
6286 * not for the substr length (i == 2). */
6287 else if (i == 0) { /* (*cachep)[i] < uoff */
6288 STRLEN ulen = sv_len_utf8(sv);
6290 if ((STRLEN)uoff < ulen) {
6291 forw = (STRLEN)uoff - (*cachep)[i];
6292 backw = ulen - (STRLEN)uoff;
6294 if (forw < 2 * backw)
6295 p = start + (*cachep)[i+1];
6300 /* If the string is not long enough for uoff,
6301 * we could extend it, but not at this low a level. */
6305 if (forw < 2 * backw) {
6312 while (UTF8_IS_CONTINUATION(*p))
6317 /* Update the cache. */
6318 (*cachep)[i] = (STRLEN)uoff;
6319 (*cachep)[i+1] = p - start;
6321 /* Drop the stale "length" cache */
6330 if (found) { /* Setup the return values. */
6331 *offsetp = (*cachep)[i+1];
6332 *sp = start + *offsetp;
6335 *offsetp = send - start;
6337 else if (*sp < start) {
6343 #ifdef PERL_UTF8_CACHE_ASSERT
6348 while (n-- && s < send)
6352 assert(*offsetp == s - start);
6353 assert((*cachep)[0] == (STRLEN)uoff);
6354 assert((*cachep)[1] == *offsetp);
6356 ASSERT_UTF8_CACHE(*cachep);
6365 =for apidoc sv_pos_u2b
6367 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6368 the start of the string, to a count of the equivalent number of bytes; if
6369 lenp is non-zero, it does the same to lenp, but this time starting from
6370 the offset, rather than from the start of the string. Handles magic and
6377 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6378 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6379 * byte offsets. See also the comments of S_utf8_mg_pos().
6384 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6395 start = s = (U8*)SvPV(sv, len);
6397 I32 uoffset = *offsetp;
6402 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6404 if (!found && uoffset > 0) {
6405 while (s < send && uoffset--)
6409 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
6411 *offsetp = s - start;
6416 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6420 if (!found && *lenp > 0) {
6423 while (s < send && ulen--)
6427 utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start);
6431 ASSERT_UTF8_CACHE(cache);
6443 =for apidoc sv_pos_b2u
6445 Converts the value pointed to by offsetp from a count of bytes from the
6446 start of the string, to a count of the equivalent number of UTF-8 chars.
6447 Handles magic and type coercion.
6453 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6454 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6455 * byte offsets. See also the comments of S_utf8_mg_pos().
6460 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6468 s = (U8*)SvPV(sv, len);
6469 if ((I32)len < *offsetp)
6470 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6472 U8* send = s + *offsetp;
6474 STRLEN *cache = NULL;
6478 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6479 mg = mg_find(sv, PERL_MAGIC_utf8);
6480 if (mg && mg->mg_ptr) {
6481 cache = (STRLEN *) mg->mg_ptr;
6482 if (cache[1] == (STRLEN)*offsetp) {
6483 /* An exact match. */
6484 *offsetp = cache[0];
6488 else if (cache[1] < (STRLEN)*offsetp) {
6489 /* We already know part of the way. */
6492 /* Let the below loop do the rest. */
6494 else { /* cache[1] > *offsetp */
6495 /* We already know all of the way, now we may
6496 * be able to walk back. The same assumption
6497 * is made as in S_utf8_mg_pos(), namely that
6498 * walking backward is twice slower than
6499 * walking forward. */
6500 STRLEN forw = *offsetp;
6501 STRLEN backw = cache[1] - *offsetp;
6503 if (!(forw < 2 * backw)) {
6504 U8 *p = s + cache[1];
6511 while (UTF8_IS_CONTINUATION(*p)) {
6519 *offsetp = cache[0];
6521 /* Drop the stale "length" cache */
6529 ASSERT_UTF8_CACHE(cache);
6535 /* Call utf8n_to_uvchr() to validate the sequence
6536 * (unless a simple non-UTF character) */
6537 if (!UTF8_IS_INVARIANT(*s))
6538 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6547 if (!SvREADONLY(sv)) {
6549 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6550 mg = mg_find(sv, PERL_MAGIC_utf8);
6555 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6556 mg->mg_ptr = (char *) cache;
6561 cache[1] = *offsetp;
6562 /* Drop the stale "length" cache */
6575 Returns a boolean indicating whether the strings in the two SVs are
6576 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6577 coerce its args to strings if necessary.
6583 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6591 SV* svrecode = Nullsv;
6598 pv1 = SvPV(sv1, cur1);
6605 pv2 = SvPV(sv2, cur2);
6607 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6608 /* Differing utf8ness.
6609 * Do not UTF8size the comparands as a side-effect. */
6612 svrecode = newSVpvn(pv2, cur2);
6613 sv_recode_to_utf8(svrecode, PL_encoding);
6614 pv2 = SvPV(svrecode, cur2);
6617 svrecode = newSVpvn(pv1, cur1);
6618 sv_recode_to_utf8(svrecode, PL_encoding);
6619 pv1 = SvPV(svrecode, cur1);
6621 /* Now both are in UTF-8. */
6623 SvREFCNT_dec(svrecode);
6628 bool is_utf8 = TRUE;
6631 /* sv1 is the UTF-8 one,
6632 * if is equal it must be downgrade-able */
6633 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6639 /* sv2 is the UTF-8 one,
6640 * if is equal it must be downgrade-able */
6641 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6647 /* Downgrade not possible - cannot be eq */
6655 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6658 SvREFCNT_dec(svrecode);
6669 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6670 string in C<sv1> is less than, equal to, or greater than the string in
6671 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6672 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6678 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6681 const char *pv1, *pv2;
6684 SV *svrecode = Nullsv;
6691 pv1 = SvPV(sv1, cur1);
6698 pv2 = SvPV(sv2, cur2);
6700 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6701 /* Differing utf8ness.
6702 * Do not UTF8size the comparands as a side-effect. */
6705 svrecode = newSVpvn(pv2, cur2);
6706 sv_recode_to_utf8(svrecode, PL_encoding);
6707 pv2 = SvPV(svrecode, cur2);
6710 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6715 svrecode = newSVpvn(pv1, cur1);
6716 sv_recode_to_utf8(svrecode, PL_encoding);
6717 pv1 = SvPV(svrecode, cur1);
6720 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6726 cmp = cur2 ? -1 : 0;
6730 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6733 cmp = retval < 0 ? -1 : 1;
6734 } else if (cur1 == cur2) {
6737 cmp = cur1 < cur2 ? -1 : 1;
6742 SvREFCNT_dec(svrecode);
6751 =for apidoc sv_cmp_locale
6753 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6754 'use bytes' aware, handles get magic, and will coerce its args to strings
6755 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6761 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6763 #ifdef USE_LOCALE_COLLATE
6769 if (PL_collation_standard)
6773 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6775 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6777 if (!pv1 || !len1) {
6788 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6791 return retval < 0 ? -1 : 1;
6794 * When the result of collation is equality, that doesn't mean
6795 * that there are no differences -- some locales exclude some
6796 * characters from consideration. So to avoid false equalities,
6797 * we use the raw string as a tiebreaker.
6803 #endif /* USE_LOCALE_COLLATE */
6805 return sv_cmp(sv1, sv2);
6809 #ifdef USE_LOCALE_COLLATE
6812 =for apidoc sv_collxfrm
6814 Add Collate Transform magic to an SV if it doesn't already have it.
6816 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6817 scalar data of the variable, but transformed to such a format that a normal
6818 memory comparison can be used to compare the data according to the locale
6825 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6829 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6830 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6835 Safefree(mg->mg_ptr);
6837 if ((xf = mem_collxfrm(s, len, &xlen))) {
6838 if (SvREADONLY(sv)) {
6841 return xf + sizeof(PL_collation_ix);
6844 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6845 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6858 if (mg && mg->mg_ptr) {
6860 return mg->mg_ptr + sizeof(PL_collation_ix);
6868 #endif /* USE_LOCALE_COLLATE */
6873 Get a line from the filehandle and store it into the SV, optionally
6874 appending to the currently-stored string.
6880 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6884 register STDCHAR rslast;
6885 register STDCHAR *bp;
6891 if (SvTHINKFIRST(sv))
6892 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6893 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6895 However, perlbench says it's slower, because the existing swipe code
6896 is faster than copy on write.
6897 Swings and roundabouts. */
6898 (void)SvUPGRADE(sv, SVt_PV);
6903 if (PerlIO_isutf8(fp)) {
6905 sv_utf8_upgrade_nomg(sv);
6906 sv_pos_u2b(sv,&append,0);
6908 } else if (SvUTF8(sv)) {
6909 SV *tsv = NEWSV(0,0);
6910 sv_gets(tsv, fp, 0);
6911 sv_utf8_upgrade_nomg(tsv);
6912 SvCUR_set(sv,append);
6915 goto return_string_or_null;
6920 if (PerlIO_isutf8(fp))
6923 if (IN_PERL_COMPILETIME) {
6924 /* we always read code in line mode */
6928 else if (RsSNARF(PL_rs)) {
6929 /* If it is a regular disk file use size from stat() as estimate
6930 of amount we are going to read - may result in malloc-ing
6931 more memory than we realy need if layers bellow reduce
6932 size we read (e.g. CRLF or a gzip layer)
6935 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6936 Off_t offset = PerlIO_tell(fp);
6937 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6938 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6944 else if (RsRECORD(PL_rs)) {
6948 /* Grab the size of the record we're getting */
6949 recsize = SvIV(SvRV(PL_rs));
6950 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6953 /* VMS wants read instead of fread, because fread doesn't respect */
6954 /* RMS record boundaries. This is not necessarily a good thing to be */
6955 /* doing, but we've got no other real choice - except avoid stdio
6956 as implementation - perhaps write a :vms layer ?
6958 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6960 bytesread = PerlIO_read(fp, buffer, recsize);
6964 SvCUR_set(sv, bytesread += append);
6965 buffer[bytesread] = '\0';
6966 goto return_string_or_null;
6968 else if (RsPARA(PL_rs)) {
6974 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6975 if (PerlIO_isutf8(fp)) {
6976 rsptr = SvPVutf8(PL_rs, rslen);
6979 if (SvUTF8(PL_rs)) {
6980 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6981 Perl_croak(aTHX_ "Wide character in $/");
6984 rsptr = SvPV(PL_rs, rslen);
6988 rslast = rslen ? rsptr[rslen - 1] : '\0';
6990 if (rspara) { /* have to do this both before and after */
6991 do { /* to make sure file boundaries work right */
6994 i = PerlIO_getc(fp);
6998 PerlIO_ungetc(fp,i);
7004 /* See if we know enough about I/O mechanism to cheat it ! */
7006 /* This used to be #ifdef test - it is made run-time test for ease
7007 of abstracting out stdio interface. One call should be cheap
7008 enough here - and may even be a macro allowing compile
7012 if (PerlIO_fast_gets(fp)) {
7015 * We're going to steal some values from the stdio struct
7016 * and put EVERYTHING in the innermost loop into registers.
7018 register STDCHAR *ptr;
7022 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7023 /* An ungetc()d char is handled separately from the regular
7024 * buffer, so we getc() it back out and stuff it in the buffer.
7026 i = PerlIO_getc(fp);
7027 if (i == EOF) return 0;
7028 *(--((*fp)->_ptr)) = (unsigned char) i;
7032 /* Here is some breathtakingly efficient cheating */
7034 cnt = PerlIO_get_cnt(fp); /* get count into register */
7035 /* make sure we have the room */
7036 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7037 /* Not room for all of it
7038 if we are looking for a separator and room for some
7040 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7041 /* just process what we have room for */
7042 shortbuffered = cnt - SvLEN(sv) + append + 1;
7043 cnt -= shortbuffered;
7047 /* remember that cnt can be negative */
7048 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7053 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7054 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7055 DEBUG_P(PerlIO_printf(Perl_debug_log,
7056 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7057 DEBUG_P(PerlIO_printf(Perl_debug_log,
7058 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7059 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7060 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7065 while (cnt > 0) { /* this | eat */
7067 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7068 goto thats_all_folks; /* screams | sed :-) */
7072 Copy(ptr, bp, cnt, char); /* this | eat */
7073 bp += cnt; /* screams | dust */
7074 ptr += cnt; /* louder | sed :-) */
7079 if (shortbuffered) { /* oh well, must extend */
7080 cnt = shortbuffered;
7082 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7084 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7085 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7089 DEBUG_P(PerlIO_printf(Perl_debug_log,
7090 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7091 PTR2UV(ptr),(long)cnt));
7092 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7094 DEBUG_P(PerlIO_printf(Perl_debug_log,
7095 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7096 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7097 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7099 /* This used to call 'filbuf' in stdio form, but as that behaves like
7100 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7101 another abstraction. */
7102 i = PerlIO_getc(fp); /* get more characters */
7104 DEBUG_P(PerlIO_printf(Perl_debug_log,
7105 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7106 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7107 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7109 cnt = PerlIO_get_cnt(fp);
7110 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7111 DEBUG_P(PerlIO_printf(Perl_debug_log,
7112 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7114 if (i == EOF) /* all done for ever? */
7115 goto thats_really_all_folks;
7117 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7119 SvGROW(sv, bpx + cnt + 2);
7120 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7122 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7124 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7125 goto thats_all_folks;
7129 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7130 memNE((char*)bp - rslen, rsptr, rslen))
7131 goto screamer; /* go back to the fray */
7132 thats_really_all_folks:
7134 cnt += shortbuffered;
7135 DEBUG_P(PerlIO_printf(Perl_debug_log,
7136 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7137 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7138 DEBUG_P(PerlIO_printf(Perl_debug_log,
7139 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7140 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7141 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7143 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7144 DEBUG_P(PerlIO_printf(Perl_debug_log,
7145 "Screamer: done, len=%ld, string=|%.*s|\n",
7146 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7150 /*The big, slow, and stupid way. */
7151 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7153 New(0, buf, 8192, STDCHAR);
7161 const register STDCHAR *bpe = buf + sizeof(buf);
7163 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7164 ; /* keep reading */
7168 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7169 /* Accomodate broken VAXC compiler, which applies U8 cast to
7170 * both args of ?: operator, causing EOF to change into 255
7173 i = (U8)buf[cnt - 1];
7179 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7181 sv_catpvn(sv, (char *) buf, cnt);
7183 sv_setpvn(sv, (char *) buf, cnt);
7185 if (i != EOF && /* joy */
7187 SvCUR(sv) < rslen ||
7188 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7192 * If we're reading from a TTY and we get a short read,
7193 * indicating that the user hit his EOF character, we need
7194 * to notice it now, because if we try to read from the TTY
7195 * again, the EOF condition will disappear.
7197 * The comparison of cnt to sizeof(buf) is an optimization
7198 * that prevents unnecessary calls to feof().
7202 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7206 #ifdef USE_HEAP_INSTEAD_OF_STACK
7211 if (rspara) { /* have to do this both before and after */
7212 while (i != EOF) { /* to make sure file boundaries work right */
7213 i = PerlIO_getc(fp);
7215 PerlIO_ungetc(fp,i);
7221 return_string_or_null:
7222 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7228 Auto-increment of the value in the SV, doing string to numeric conversion
7229 if necessary. Handles 'get' magic.
7235 Perl_sv_inc(pTHX_ register SV *sv)
7244 if (SvTHINKFIRST(sv)) {
7246 sv_force_normal_flags(sv, 0);
7247 if (SvREADONLY(sv)) {
7248 if (IN_PERL_RUNTIME)
7249 Perl_croak(aTHX_ PL_no_modify);
7253 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7255 i = PTR2IV(SvRV(sv));
7260 flags = SvFLAGS(sv);
7261 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7262 /* It's (privately or publicly) a float, but not tested as an
7263 integer, so test it to see. */
7265 flags = SvFLAGS(sv);
7267 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7268 /* It's publicly an integer, or privately an integer-not-float */
7269 #ifdef PERL_PRESERVE_IVUV
7273 if (SvUVX(sv) == UV_MAX)
7274 sv_setnv(sv, UV_MAX_P1);
7276 (void)SvIOK_only_UV(sv);
7277 SvUV_set(sv, SvUVX(sv) + 1);
7279 if (SvIVX(sv) == IV_MAX)
7280 sv_setuv(sv, (UV)IV_MAX + 1);
7282 (void)SvIOK_only(sv);
7283 SvIV_set(sv, SvIVX(sv) + 1);
7288 if (flags & SVp_NOK) {
7289 (void)SvNOK_only(sv);
7290 SvNV_set(sv, SvNVX(sv) + 1.0);
7294 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7295 if ((flags & SVTYPEMASK) < SVt_PVIV)
7296 sv_upgrade(sv, SVt_IV);
7297 (void)SvIOK_only(sv);
7302 while (isALPHA(*d)) d++;
7303 while (isDIGIT(*d)) d++;
7305 #ifdef PERL_PRESERVE_IVUV
7306 /* Got to punt this as an integer if needs be, but we don't issue
7307 warnings. Probably ought to make the sv_iv_please() that does
7308 the conversion if possible, and silently. */
7309 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7310 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7311 /* Need to try really hard to see if it's an integer.
7312 9.22337203685478e+18 is an integer.
7313 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7314 so $a="9.22337203685478e+18"; $a+0; $a++
7315 needs to be the same as $a="9.22337203685478e+18"; $a++
7322 /* sv_2iv *should* have made this an NV */
7323 if (flags & SVp_NOK) {
7324 (void)SvNOK_only(sv);
7325 SvNV_set(sv, SvNVX(sv) + 1.0);
7328 /* I don't think we can get here. Maybe I should assert this
7329 And if we do get here I suspect that sv_setnv will croak. NWC
7331 #if defined(USE_LONG_DOUBLE)
7332 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",
7333 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7335 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7336 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7339 #endif /* PERL_PRESERVE_IVUV */
7340 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7344 while (d >= SvPVX(sv)) {
7352 /* MKS: The original code here died if letters weren't consecutive.
7353 * at least it didn't have to worry about non-C locales. The
7354 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7355 * arranged in order (although not consecutively) and that only
7356 * [A-Za-z] are accepted by isALPHA in the C locale.
7358 if (*d != 'z' && *d != 'Z') {
7359 do { ++*d; } while (!isALPHA(*d));
7362 *(d--) -= 'z' - 'a';
7367 *(d--) -= 'z' - 'a' + 1;
7371 /* oh,oh, the number grew */
7372 SvGROW(sv, SvCUR(sv) + 2);
7373 SvCUR_set(sv, SvCUR(sv) + 1);
7374 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7385 Auto-decrement of the value in the SV, doing string to numeric conversion
7386 if necessary. Handles 'get' magic.
7392 Perl_sv_dec(pTHX_ register SV *sv)
7400 if (SvTHINKFIRST(sv)) {
7402 sv_force_normal_flags(sv, 0);
7403 if (SvREADONLY(sv)) {
7404 if (IN_PERL_RUNTIME)
7405 Perl_croak(aTHX_ PL_no_modify);
7409 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7411 i = PTR2IV(SvRV(sv));
7416 /* Unlike sv_inc we don't have to worry about string-never-numbers
7417 and keeping them magic. But we mustn't warn on punting */
7418 flags = SvFLAGS(sv);
7419 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7420 /* It's publicly an integer, or privately an integer-not-float */
7421 #ifdef PERL_PRESERVE_IVUV
7425 if (SvUVX(sv) == 0) {
7426 (void)SvIOK_only(sv);
7430 (void)SvIOK_only_UV(sv);
7431 SvUV_set(sv, SvUVX(sv) + 1);
7434 if (SvIVX(sv) == IV_MIN)
7435 sv_setnv(sv, (NV)IV_MIN - 1.0);
7437 (void)SvIOK_only(sv);
7438 SvIV_set(sv, SvIVX(sv) - 1);
7443 if (flags & SVp_NOK) {
7444 SvNV_set(sv, SvNVX(sv) - 1.0);
7445 (void)SvNOK_only(sv);
7448 if (!(flags & SVp_POK)) {
7449 if ((flags & SVTYPEMASK) < SVt_PVNV)
7450 sv_upgrade(sv, SVt_NV);
7452 (void)SvNOK_only(sv);
7455 #ifdef PERL_PRESERVE_IVUV
7457 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7458 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7459 /* Need to try really hard to see if it's an integer.
7460 9.22337203685478e+18 is an integer.
7461 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7462 so $a="9.22337203685478e+18"; $a+0; $a--
7463 needs to be the same as $a="9.22337203685478e+18"; $a--
7470 /* sv_2iv *should* have made this an NV */
7471 if (flags & SVp_NOK) {
7472 (void)SvNOK_only(sv);
7473 SvNV_set(sv, SvNVX(sv) - 1.0);
7476 /* I don't think we can get here. Maybe I should assert this
7477 And if we do get here I suspect that sv_setnv will croak. NWC
7479 #if defined(USE_LONG_DOUBLE)
7480 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",
7481 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7483 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7484 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7488 #endif /* PERL_PRESERVE_IVUV */
7489 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7493 =for apidoc sv_mortalcopy
7495 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7496 The new SV is marked as mortal. It will be destroyed "soon", either by an
7497 explicit call to FREETMPS, or by an implicit call at places such as
7498 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7503 /* Make a string that will exist for the duration of the expression
7504 * evaluation. Actually, it may have to last longer than that, but
7505 * hopefully we won't free it until it has been assigned to a
7506 * permanent location. */
7509 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7514 sv_setsv(sv,oldstr);
7516 PL_tmps_stack[++PL_tmps_ix] = sv;
7522 =for apidoc sv_newmortal
7524 Creates a new null SV which is mortal. The reference count of the SV is
7525 set to 1. It will be destroyed "soon", either by an explicit call to
7526 FREETMPS, or by an implicit call at places such as statement boundaries.
7527 See also C<sv_mortalcopy> and C<sv_2mortal>.
7533 Perl_sv_newmortal(pTHX)
7538 SvFLAGS(sv) = SVs_TEMP;
7540 PL_tmps_stack[++PL_tmps_ix] = sv;
7545 =for apidoc sv_2mortal
7547 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7548 by an explicit call to FREETMPS, or by an implicit call at places such as
7549 statement boundaries. SvTEMP() is turned on which means that the SV's
7550 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7551 and C<sv_mortalcopy>.
7557 Perl_sv_2mortal(pTHX_ register SV *sv)
7562 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7565 PL_tmps_stack[++PL_tmps_ix] = sv;
7573 Creates a new SV and copies a string into it. The reference count for the
7574 SV is set to 1. If C<len> is zero, Perl will compute the length using
7575 strlen(). For efficiency, consider using C<newSVpvn> instead.
7581 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7588 sv_setpvn(sv,s,len);
7593 =for apidoc newSVpvn
7595 Creates a new SV and copies a string into it. The reference count for the
7596 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7597 string. You are responsible for ensuring that the source string is at least
7598 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7604 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7609 sv_setpvn(sv,s,len);
7614 =for apidoc newSVpvn_share
7616 Creates a new SV with its SvPVX pointing to a shared string in the string
7617 table. If the string does not already exist in the table, it is created
7618 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7619 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7620 otherwise the hash is computed. The idea here is that as the string table
7621 is used for shared hash keys these strings will have SvPVX == HeKEY and
7622 hash lookup will avoid string compare.
7628 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7631 bool is_utf8 = FALSE;
7633 STRLEN tmplen = -len;
7635 /* See the note in hv.c:hv_fetch() --jhi */
7636 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7640 PERL_HASH(hash, src, len);
7642 sv_upgrade(sv, SVt_PVIV);
7643 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7656 #if defined(PERL_IMPLICIT_CONTEXT)
7658 /* pTHX_ magic can't cope with varargs, so this is a no-context
7659 * version of the main function, (which may itself be aliased to us).
7660 * Don't access this version directly.
7664 Perl_newSVpvf_nocontext(const char* pat, ...)
7669 va_start(args, pat);
7670 sv = vnewSVpvf(pat, &args);
7677 =for apidoc newSVpvf
7679 Creates a new SV and initializes it with the string formatted like
7686 Perl_newSVpvf(pTHX_ const char* pat, ...)
7690 va_start(args, pat);
7691 sv = vnewSVpvf(pat, &args);
7696 /* backend for newSVpvf() and newSVpvf_nocontext() */
7699 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7703 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7710 Creates a new SV and copies a floating point value into it.
7711 The reference count for the SV is set to 1.
7717 Perl_newSVnv(pTHX_ NV n)
7729 Creates a new SV and copies an integer into it. The reference count for the
7736 Perl_newSViv(pTHX_ IV i)
7748 Creates a new SV and copies an unsigned integer into it.
7749 The reference count for the SV is set to 1.
7755 Perl_newSVuv(pTHX_ UV u)
7765 =for apidoc newRV_noinc
7767 Creates an RV wrapper for an SV. The reference count for the original
7768 SV is B<not> incremented.
7774 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7779 sv_upgrade(sv, SVt_RV);
7781 SvRV_set(sv, tmpRef);
7786 /* newRV_inc is the official function name to use now.
7787 * newRV_inc is in fact #defined to newRV in sv.h
7791 Perl_newRV(pTHX_ SV *tmpRef)
7793 return newRV_noinc(SvREFCNT_inc(tmpRef));
7799 Creates a new SV which is an exact duplicate of the original SV.
7806 Perl_newSVsv(pTHX_ register SV *old)
7812 if (SvTYPE(old) == SVTYPEMASK) {
7813 if (ckWARN_d(WARN_INTERNAL))
7814 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7818 /* SV_GMAGIC is the default for sv_setv()
7819 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7820 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7821 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7826 =for apidoc sv_reset
7828 Underlying implementation for the C<reset> Perl function.
7829 Note that the perl-level function is vaguely deprecated.
7835 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7844 char todo[PERL_UCHAR_MAX+1];
7849 if (!*s) { /* reset ?? searches */
7850 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7851 pm->op_pmdynflags &= ~PMdf_USED;
7856 /* reset variables */
7858 if (!HvARRAY(stash))
7861 Zero(todo, 256, char);
7863 i = (unsigned char)*s;
7867 max = (unsigned char)*s++;
7868 for ( ; i <= max; i++) {
7871 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7872 for (entry = HvARRAY(stash)[i];
7874 entry = HeNEXT(entry))
7876 if (!todo[(U8)*HeKEY(entry)])
7878 gv = (GV*)HeVAL(entry);
7880 if (SvTHINKFIRST(sv)) {
7881 if (!SvREADONLY(sv) && SvROK(sv))
7886 if (SvTYPE(sv) >= SVt_PV) {
7888 if (SvPVX(sv) != Nullch)
7895 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7898 #ifdef USE_ENVIRON_ARRAY
7900 # ifdef USE_ITHREADS
7901 && PL_curinterp == aTHX
7905 environ[0] = Nullch;
7908 #endif /* !PERL_MICRO */
7918 Using various gambits, try to get an IO from an SV: the IO slot if its a
7919 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7920 named after the PV if we're a string.
7926 Perl_sv_2io(pTHX_ SV *sv)
7931 switch (SvTYPE(sv)) {
7939 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7943 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7945 return sv_2io(SvRV(sv));
7946 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7952 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7961 Using various gambits, try to get a CV from an SV; in addition, try if
7962 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7968 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7975 return *gvp = Nullgv, Nullcv;
7976 switch (SvTYPE(sv)) {
7995 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7996 tryAMAGICunDEREF(to_cv);
7999 if (SvTYPE(sv) == SVt_PVCV) {
8008 Perl_croak(aTHX_ "Not a subroutine reference");
8013 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8019 if (lref && !GvCVu(gv)) {
8022 tmpsv = NEWSV(704,0);
8023 gv_efullname3(tmpsv, gv, Nullch);
8024 /* XXX this is probably not what they think they're getting.
8025 * It has the same effect as "sub name;", i.e. just a forward
8027 newSUB(start_subparse(FALSE, 0),
8028 newSVOP(OP_CONST, 0, tmpsv),
8033 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8043 Returns true if the SV has a true value by Perl's rules.
8044 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8045 instead use an in-line version.
8051 Perl_sv_true(pTHX_ register SV *sv)
8056 const register XPV* tXpv;
8057 if ((tXpv = (XPV*)SvANY(sv)) &&
8058 (tXpv->xpv_cur > 1 ||
8059 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
8066 return SvIVX(sv) != 0;
8069 return SvNVX(sv) != 0.0;
8071 return sv_2bool(sv);
8079 A private implementation of the C<SvIVx> macro for compilers which can't
8080 cope with complex macro expressions. Always use the macro instead.
8086 Perl_sv_iv(pTHX_ register SV *sv)
8090 return (IV)SvUVX(sv);
8099 A private implementation of the C<SvUVx> macro for compilers which can't
8100 cope with complex macro expressions. Always use the macro instead.
8106 Perl_sv_uv(pTHX_ register SV *sv)
8111 return (UV)SvIVX(sv);
8119 A private implementation of the C<SvNVx> macro for compilers which can't
8120 cope with complex macro expressions. Always use the macro instead.
8126 Perl_sv_nv(pTHX_ register SV *sv)
8133 /* sv_pv() is now a macro using SvPV_nolen();
8134 * this function provided for binary compatibility only
8138 Perl_sv_pv(pTHX_ SV *sv)
8145 return sv_2pv(sv, &n_a);
8151 Use the C<SvPV_nolen> macro instead
8155 A private implementation of the C<SvPV> macro for compilers which can't
8156 cope with complex macro expressions. Always use the macro instead.
8162 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8168 return sv_2pv(sv, lp);
8173 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8179 return sv_2pv_flags(sv, lp, 0);
8182 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8183 * this function provided for binary compatibility only
8187 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8189 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8193 =for apidoc sv_pvn_force
8195 Get a sensible string out of the SV somehow.
8196 A private implementation of the C<SvPV_force> macro for compilers which
8197 can't cope with complex macro expressions. Always use the macro instead.
8199 =for apidoc sv_pvn_force_flags
8201 Get a sensible string out of the SV somehow.
8202 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8203 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8204 implemented in terms of this function.
8205 You normally want to use the various wrapper macros instead: see
8206 C<SvPV_force> and C<SvPV_force_nomg>
8212 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8216 if (SvTHINKFIRST(sv) && !SvROK(sv))
8217 sv_force_normal_flags(sv, 0);
8223 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8224 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8228 s = sv_2pv_flags(sv, lp, flags);
8229 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8234 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8235 SvGROW(sv, len + 1);
8236 Move(s,SvPVX(sv),len,char);
8241 SvPOK_on(sv); /* validate pointer */
8243 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8244 PTR2UV(sv),SvPVX(sv)));
8250 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8251 * this function provided for binary compatibility only
8255 Perl_sv_pvbyte(pTHX_ SV *sv)
8257 sv_utf8_downgrade(sv,0);
8262 =for apidoc sv_pvbyte
8264 Use C<SvPVbyte_nolen> instead.
8266 =for apidoc sv_pvbyten
8268 A private implementation of the C<SvPVbyte> macro for compilers
8269 which can't cope with complex macro expressions. Always use the macro
8276 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8278 sv_utf8_downgrade(sv,0);
8279 return sv_pvn(sv,lp);
8283 =for apidoc sv_pvbyten_force
8285 A private implementation of the C<SvPVbytex_force> macro for compilers
8286 which can't cope with complex macro expressions. Always use the macro
8293 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8295 sv_pvn_force(sv,lp);
8296 sv_utf8_downgrade(sv,0);
8301 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8302 * this function provided for binary compatibility only
8306 Perl_sv_pvutf8(pTHX_ SV *sv)
8308 sv_utf8_upgrade(sv);
8313 =for apidoc sv_pvutf8
8315 Use the C<SvPVutf8_nolen> macro instead
8317 =for apidoc sv_pvutf8n
8319 A private implementation of the C<SvPVutf8> macro for compilers
8320 which can't cope with complex macro expressions. Always use the macro
8327 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8329 sv_utf8_upgrade(sv);
8330 return sv_pvn(sv,lp);
8334 =for apidoc sv_pvutf8n_force
8336 A private implementation of the C<SvPVutf8_force> macro for compilers
8337 which can't cope with complex macro expressions. Always use the macro
8344 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8346 sv_pvn_force(sv,lp);
8347 sv_utf8_upgrade(sv);
8353 =for apidoc sv_reftype
8355 Returns a string describing what the SV is a reference to.
8361 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8363 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8364 inside return suggests a const propagation bug in g++. */
8365 if (ob && SvOBJECT(sv)) {
8366 char *name = HvNAME(SvSTASH(sv));
8367 return name ? name : (char *) "__ANON__";
8370 switch (SvTYPE(sv)) {
8387 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8388 /* tied lvalues should appear to be
8389 * scalars for backwards compatitbility */
8390 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8391 ? "SCALAR" : "LVALUE");
8392 case SVt_PVAV: return "ARRAY";
8393 case SVt_PVHV: return "HASH";
8394 case SVt_PVCV: return "CODE";
8395 case SVt_PVGV: return "GLOB";
8396 case SVt_PVFM: return "FORMAT";
8397 case SVt_PVIO: return "IO";
8398 default: return "UNKNOWN";
8404 =for apidoc sv_isobject
8406 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8407 object. If the SV is not an RV, or if the object is not blessed, then this
8414 Perl_sv_isobject(pTHX_ SV *sv)
8431 Returns a boolean indicating whether the SV is blessed into the specified
8432 class. This does not check for subtypes; use C<sv_derived_from> to verify
8433 an inheritance relationship.
8439 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8450 if (!HvNAME(SvSTASH(sv)))
8453 return strEQ(HvNAME(SvSTASH(sv)), name);
8459 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8460 it will be upgraded to one. If C<classname> is non-null then the new SV will
8461 be blessed in the specified package. The new SV is returned and its
8462 reference count is 1.
8468 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8474 SV_CHECK_THINKFIRST_COW_DROP(rv);
8477 if (SvTYPE(rv) >= SVt_PVMG) {
8478 U32 refcnt = SvREFCNT(rv);
8482 SvREFCNT(rv) = refcnt;
8485 if (SvTYPE(rv) < SVt_RV)
8486 sv_upgrade(rv, SVt_RV);
8487 else if (SvTYPE(rv) > SVt_RV) {
8498 HV* stash = gv_stashpv(classname, TRUE);
8499 (void)sv_bless(rv, stash);
8505 =for apidoc sv_setref_pv
8507 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8508 argument will be upgraded to an RV. That RV will be modified to point to
8509 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8510 into the SV. The C<classname> argument indicates the package for the
8511 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8512 will have a reference count of 1, and the RV will be returned.
8514 Do not use with other Perl types such as HV, AV, SV, CV, because those
8515 objects will become corrupted by the pointer copy process.
8517 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8523 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8526 sv_setsv(rv, &PL_sv_undef);
8530 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8535 =for apidoc sv_setref_iv
8537 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8538 argument will be upgraded to an RV. That RV will be modified to point to
8539 the new SV. The C<classname> argument indicates the package for the
8540 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8541 will have a reference count of 1, and the RV will be returned.
8547 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8549 sv_setiv(newSVrv(rv,classname), iv);
8554 =for apidoc sv_setref_uv
8556 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8557 argument will be upgraded to an RV. That RV will be modified to point to
8558 the new SV. The C<classname> argument indicates the package for the
8559 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8560 will have a reference count of 1, and the RV will be returned.
8566 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8568 sv_setuv(newSVrv(rv,classname), uv);
8573 =for apidoc sv_setref_nv
8575 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8576 argument will be upgraded to an RV. That RV will be modified to point to
8577 the new SV. The C<classname> argument indicates the package for the
8578 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8579 will have a reference count of 1, and the RV will be returned.
8585 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8587 sv_setnv(newSVrv(rv,classname), nv);
8592 =for apidoc sv_setref_pvn
8594 Copies a string into a new SV, optionally blessing the SV. The length of the
8595 string must be specified with C<n>. The C<rv> argument will be upgraded to
8596 an RV. That RV will be modified to point to the new SV. The C<classname>
8597 argument indicates the package for the blessing. Set C<classname> to
8598 C<Nullch> to avoid the blessing. The new SV will have a reference count
8599 of 1, and the RV will be returned.
8601 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8607 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8609 sv_setpvn(newSVrv(rv,classname), pv, n);
8614 =for apidoc sv_bless
8616 Blesses an SV into a specified package. The SV must be an RV. The package
8617 must be designated by its stash (see C<gv_stashpv()>). The reference count
8618 of the SV is unaffected.
8624 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8628 Perl_croak(aTHX_ "Can't bless non-reference value");
8630 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8631 if (SvREADONLY(tmpRef))
8632 Perl_croak(aTHX_ PL_no_modify);
8633 if (SvOBJECT(tmpRef)) {
8634 if (SvTYPE(tmpRef) != SVt_PVIO)
8636 SvREFCNT_dec(SvSTASH(tmpRef));
8639 SvOBJECT_on(tmpRef);
8640 if (SvTYPE(tmpRef) != SVt_PVIO)
8642 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8643 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8650 if(SvSMAGICAL(tmpRef))
8651 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8659 /* Downgrades a PVGV to a PVMG.
8663 S_sv_unglob(pTHX_ SV *sv)
8667 assert(SvTYPE(sv) == SVt_PVGV);
8672 SvREFCNT_dec(GvSTASH(sv));
8673 GvSTASH(sv) = Nullhv;
8675 sv_unmagic(sv, PERL_MAGIC_glob);
8676 Safefree(GvNAME(sv));
8679 /* need to keep SvANY(sv) in the right arena */
8680 xpvmg = new_XPVMG();
8681 StructCopy(SvANY(sv), xpvmg, XPVMG);
8682 del_XPVGV(SvANY(sv));
8685 SvFLAGS(sv) &= ~SVTYPEMASK;
8686 SvFLAGS(sv) |= SVt_PVMG;
8690 =for apidoc sv_unref_flags
8692 Unsets the RV status of the SV, and decrements the reference count of
8693 whatever was being referenced by the RV. This can almost be thought of
8694 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8695 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8696 (otherwise the decrementing is conditional on the reference count being
8697 different from one or the reference being a readonly SV).
8704 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8708 if (SvWEAKREF(sv)) {
8716 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8717 assigned to as BEGIN {$a = \"Foo"} will fail. */
8718 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8720 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8721 sv_2mortal(rv); /* Schedule for freeing later */
8725 =for apidoc sv_unref
8727 Unsets the RV status of the SV, and decrements the reference count of
8728 whatever was being referenced by the RV. This can almost be thought of
8729 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8730 being zero. See C<SvROK_off>.
8736 Perl_sv_unref(pTHX_ SV *sv)
8738 sv_unref_flags(sv, 0);
8742 =for apidoc sv_taint
8744 Taint an SV. Use C<SvTAINTED_on> instead.
8749 Perl_sv_taint(pTHX_ SV *sv)
8751 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8755 =for apidoc sv_untaint
8757 Untaint an SV. Use C<SvTAINTED_off> instead.
8762 Perl_sv_untaint(pTHX_ SV *sv)
8764 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8765 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8772 =for apidoc sv_tainted
8774 Test an SV for taintedness. Use C<SvTAINTED> instead.
8779 Perl_sv_tainted(pTHX_ SV *sv)
8781 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8782 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8783 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8790 =for apidoc sv_setpviv
8792 Copies an integer into the given SV, also updating its string value.
8793 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8799 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8801 char buf[TYPE_CHARS(UV)];
8803 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8805 sv_setpvn(sv, ptr, ebuf - ptr);
8809 =for apidoc sv_setpviv_mg
8811 Like C<sv_setpviv>, but also handles 'set' magic.
8817 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8819 char buf[TYPE_CHARS(UV)];
8821 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8823 sv_setpvn(sv, ptr, ebuf - ptr);
8827 #if defined(PERL_IMPLICIT_CONTEXT)
8829 /* pTHX_ magic can't cope with varargs, so this is a no-context
8830 * version of the main function, (which may itself be aliased to us).
8831 * Don't access this version directly.
8835 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8839 va_start(args, pat);
8840 sv_vsetpvf(sv, pat, &args);
8844 /* pTHX_ magic can't cope with varargs, so this is a no-context
8845 * version of the main function, (which may itself be aliased to us).
8846 * Don't access this version directly.
8850 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8854 va_start(args, pat);
8855 sv_vsetpvf_mg(sv, pat, &args);
8861 =for apidoc sv_setpvf
8863 Works like C<sv_catpvf> but copies the text into the SV instead of
8864 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8870 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8873 va_start(args, pat);
8874 sv_vsetpvf(sv, pat, &args);
8879 =for apidoc sv_vsetpvf
8881 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8882 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8884 Usually used via its frontend C<sv_setpvf>.
8890 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8892 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8896 =for apidoc sv_setpvf_mg
8898 Like C<sv_setpvf>, but also handles 'set' magic.
8904 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8907 va_start(args, pat);
8908 sv_vsetpvf_mg(sv, pat, &args);
8913 =for apidoc sv_vsetpvf_mg
8915 Like C<sv_vsetpvf>, but also handles 'set' magic.
8917 Usually used via its frontend C<sv_setpvf_mg>.
8923 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8925 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8929 #if defined(PERL_IMPLICIT_CONTEXT)
8931 /* pTHX_ magic can't cope with varargs, so this is a no-context
8932 * version of the main function, (which may itself be aliased to us).
8933 * Don't access this version directly.
8937 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8941 va_start(args, pat);
8942 sv_vcatpvf(sv, pat, &args);
8946 /* pTHX_ magic can't cope with varargs, so this is a no-context
8947 * version of the main function, (which may itself be aliased to us).
8948 * Don't access this version directly.
8952 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8956 va_start(args, pat);
8957 sv_vcatpvf_mg(sv, pat, &args);
8963 =for apidoc sv_catpvf
8965 Processes its arguments like C<sprintf> and appends the formatted
8966 output to an SV. If the appended data contains "wide" characters
8967 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8968 and characters >255 formatted with %c), the original SV might get
8969 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8970 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8971 valid UTF-8; if the original SV was bytes, the pattern should be too.
8976 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8979 va_start(args, pat);
8980 sv_vcatpvf(sv, pat, &args);
8985 =for apidoc sv_vcatpvf
8987 Processes its arguments like C<vsprintf> and appends the formatted output
8988 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8990 Usually used via its frontend C<sv_catpvf>.
8996 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8998 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9002 =for apidoc sv_catpvf_mg
9004 Like C<sv_catpvf>, but also handles 'set' magic.
9010 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9013 va_start(args, pat);
9014 sv_vcatpvf_mg(sv, pat, &args);
9019 =for apidoc sv_vcatpvf_mg
9021 Like C<sv_vcatpvf>, but also handles 'set' magic.
9023 Usually used via its frontend C<sv_catpvf_mg>.
9029 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9031 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9036 =for apidoc sv_vsetpvfn
9038 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9041 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9047 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9049 sv_setpvn(sv, "", 0);
9050 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9053 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9056 S_expect_number(pTHX_ char** pattern)
9059 switch (**pattern) {
9060 case '1': case '2': case '3':
9061 case '4': case '5': case '6':
9062 case '7': case '8': case '9':
9063 while (isDIGIT(**pattern))
9064 var = var * 10 + (*(*pattern)++ - '0');
9068 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9071 F0convert(NV nv, char *endbuf, STRLEN *len)
9082 if (uv & 1 && uv == nv)
9083 uv--; /* Round to even */
9085 unsigned dig = uv % 10;
9098 =for apidoc sv_vcatpvfn
9100 Processes its arguments like C<vsprintf> and appends the formatted output
9101 to an SV. Uses an array of SVs if the C style variable argument list is
9102 missing (NULL). When running with taint checks enabled, indicates via
9103 C<maybe_tainted> if results are untrustworthy (often due to the use of
9106 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9111 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9114 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9121 static const char nullstr[] = "(null)";
9123 bool has_utf8; /* has the result utf8? */
9124 bool pat_utf8; /* the pattern is in utf8? */
9126 /* Times 4: a decimal digit takes more than 3 binary digits.
9127 * NV_DIG: mantissa takes than many decimal digits.
9128 * Plus 32: Playing safe. */
9129 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9130 /* large enough for "%#.#f" --chip */
9131 /* what about long double NVs? --jhi */
9133 has_utf8 = pat_utf8 = DO_UTF8(sv);
9135 /* no matter what, this is a string now */
9136 (void)SvPV_force(sv, origlen);
9138 /* special-case "", "%s", and "%_" */
9141 if (patlen == 2 && pat[0] == '%') {
9145 const char *s = va_arg(*args, char*);
9146 sv_catpv(sv, s ? s : nullstr);
9148 else if (svix < svmax) {
9149 sv_catsv(sv, *svargs);
9150 if (DO_UTF8(*svargs))
9156 argsv = va_arg(*args, SV*);
9157 sv_catsv(sv, argsv);
9162 /* See comment on '_' below */
9167 #ifndef USE_LONG_DOUBLE
9168 /* special-case "%.<number>[gf]" */
9169 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9170 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9171 unsigned digits = 0;
9175 while (*pp >= '0' && *pp <= '9')
9176 digits = 10 * digits + (*pp++ - '0');
9177 if (pp - pat == (int)patlen - 1) {
9181 nv = (NV)va_arg(*args, double);
9182 else if (svix < svmax)
9187 /* Add check for digits != 0 because it seems that some
9188 gconverts are buggy in this case, and we don't yet have
9189 a Configure test for this. */
9190 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9191 /* 0, point, slack */
9192 Gconvert(nv, (int)digits, 0, ebuf);
9194 if (*ebuf) /* May return an empty string for digits==0 */
9197 } else if (!digits) {
9200 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9201 sv_catpvn(sv, p, l);
9207 #endif /* !USE_LONG_DOUBLE */
9209 if (!args && svix < svmax && DO_UTF8(*svargs))
9212 patend = (char*)pat + patlen;
9213 for (p = (char*)pat; p < patend; p = q) {
9216 bool vectorize = FALSE;
9217 bool vectorarg = FALSE;
9218 bool vec_utf8 = FALSE;
9224 bool has_precis = FALSE;
9227 bool is_utf8 = FALSE; /* is this item utf8? */
9228 #ifdef HAS_LDBL_SPRINTF_BUG
9229 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9230 with sfio - Allen <allens@cpan.org> */
9231 bool fix_ldbl_sprintf_bug = FALSE;
9235 U8 utf8buf[UTF8_MAXBYTES+1];
9236 STRLEN esignlen = 0;
9238 char *eptr = Nullch;
9241 U8 *vecstr = Null(U8*);
9248 /* we need a long double target in case HAS_LONG_DOUBLE but
9251 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9259 const char *dotstr = ".";
9260 STRLEN dotstrlen = 1;
9261 I32 efix = 0; /* explicit format parameter index */
9262 I32 ewix = 0; /* explicit width index */
9263 I32 epix = 0; /* explicit precision index */
9264 I32 evix = 0; /* explicit vector index */
9265 bool asterisk = FALSE;
9267 /* echo everything up to the next format specification */
9268 for (q = p; q < patend && *q != '%'; ++q) ;
9270 if (has_utf8 && !pat_utf8)
9271 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9273 sv_catpvn(sv, p, q - p);
9280 We allow format specification elements in this order:
9281 \d+\$ explicit format parameter index
9283 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9284 0 flag (as above): repeated to allow "v02"
9285 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9286 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9288 [%bcdefginopsux_DFOUX] format (mandatory)
9290 if (EXPECT_NUMBER(q, width)) {
9331 if (EXPECT_NUMBER(q, ewix))
9340 if ((vectorarg = asterisk)) {
9352 EXPECT_NUMBER(q, width);
9357 vecsv = va_arg(*args, SV*);
9359 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9360 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9361 dotstr = SvPVx(vecsv, dotstrlen);
9366 vecsv = va_arg(*args, SV*);
9367 vecstr = (U8*)SvPVx(vecsv,veclen);
9368 vec_utf8 = DO_UTF8(vecsv);
9370 else if (efix ? efix <= svmax : svix < svmax) {
9371 vecsv = svargs[efix ? efix-1 : svix++];
9372 vecstr = (U8*)SvPVx(vecsv,veclen);
9373 vec_utf8 = DO_UTF8(vecsv);
9374 /* if this is a version object, we need to return the
9375 * stringified representation (which the SvPVX has
9376 * already done for us), but not vectorize the args
9378 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9380 q++; /* skip past the rest of the %vd format */
9381 eptr = (char *) vecstr;
9382 elen = strlen(eptr);
9395 i = va_arg(*args, int);
9397 i = (ewix ? ewix <= svmax : svix < svmax) ?
9398 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9400 width = (i < 0) ? -i : i;
9410 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9412 /* XXX: todo, support specified precision parameter */
9416 i = va_arg(*args, int);
9418 i = (ewix ? ewix <= svmax : svix < svmax)
9419 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9420 precis = (i < 0) ? 0 : i;
9425 precis = precis * 10 + (*q++ - '0');
9434 case 'I': /* Ix, I32x, and I64x */
9436 if (q[1] == '6' && q[2] == '4') {
9442 if (q[1] == '3' && q[2] == '2') {
9452 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9463 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9464 if (*(q + 1) == 'l') { /* lld, llf */
9489 argsv = (efix ? efix <= svmax : svix < svmax) ?
9490 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9497 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9499 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9501 eptr = (char*)utf8buf;
9502 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9513 if (args && !vectorize) {
9514 eptr = va_arg(*args, char*);
9516 #ifdef MACOS_TRADITIONAL
9517 /* On MacOS, %#s format is used for Pascal strings */
9522 elen = strlen(eptr);
9524 eptr = (char *)nullstr;
9525 elen = sizeof nullstr - 1;
9529 eptr = SvPVx(argsv, elen);
9530 if (DO_UTF8(argsv)) {
9531 if (has_precis && precis < elen) {
9533 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9536 if (width) { /* fudge width (can't fudge elen) */
9537 width += elen - sv_len_utf8(argsv);
9549 * The "%_" hack might have to be changed someday,
9550 * if ISO or ANSI decide to use '_' for something.
9551 * So we keep it hidden from users' code.
9553 if (!args || vectorize)
9555 argsv = va_arg(*args, SV*);
9556 eptr = SvPVx(argsv, elen);
9562 if (has_precis && elen > precis)
9573 goto format_sv; /* %-p -> %_ */
9577 goto format_sv; /* %-Np -> %.N_ */
9580 if (alt || vectorize)
9582 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9600 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9609 esignbuf[esignlen++] = plus;
9613 case 'h': iv = (short)va_arg(*args, int); break;
9614 case 'l': iv = va_arg(*args, long); break;
9615 case 'V': iv = va_arg(*args, IV); break;
9616 default: iv = va_arg(*args, int); break;
9618 case 'q': iv = va_arg(*args, Quad_t); break;
9623 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9625 case 'h': iv = (short)tiv; break;
9626 case 'l': iv = (long)tiv; break;
9628 default: iv = tiv; break;
9630 case 'q': iv = (Quad_t)tiv; break;
9634 if ( !vectorize ) /* we already set uv above */
9639 esignbuf[esignlen++] = plus;
9643 esignbuf[esignlen++] = '-';
9686 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9697 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9698 case 'l': uv = va_arg(*args, unsigned long); break;
9699 case 'V': uv = va_arg(*args, UV); break;
9700 default: uv = va_arg(*args, unsigned); break;
9702 case 'q': uv = va_arg(*args, Uquad_t); break;
9707 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9709 case 'h': uv = (unsigned short)tuv; break;
9710 case 'l': uv = (unsigned long)tuv; break;
9712 default: uv = tuv; break;
9714 case 'q': uv = (Uquad_t)tuv; break;
9720 eptr = ebuf + sizeof ebuf;
9726 p = (char*)((c == 'X')
9727 ? "0123456789ABCDEF" : "0123456789abcdef");
9733 esignbuf[esignlen++] = '0';
9734 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9740 *--eptr = '0' + dig;
9742 if (alt && *eptr != '0')
9748 *--eptr = '0' + dig;
9751 esignbuf[esignlen++] = '0';
9752 esignbuf[esignlen++] = 'b';
9755 default: /* it had better be ten or less */
9758 *--eptr = '0' + dig;
9759 } while (uv /= base);
9762 elen = (ebuf + sizeof ebuf) - eptr;
9765 zeros = precis - elen;
9766 else if (precis == 0 && elen == 1 && *eptr == '0')
9771 /* FLOATING POINT */
9774 c = 'f'; /* maybe %F isn't supported here */
9780 /* This is evil, but floating point is even more evil */
9782 /* for SV-style calling, we can only get NV
9783 for C-style calling, we assume %f is double;
9784 for simplicity we allow any of %Lf, %llf, %qf for long double
9788 #if defined(USE_LONG_DOUBLE)
9792 /* [perl #20339] - we should accept and ignore %lf rather than die */
9796 #if defined(USE_LONG_DOUBLE)
9797 intsize = args ? 0 : 'q';
9801 #if defined(HAS_LONG_DOUBLE)
9810 /* now we need (long double) if intsize == 'q', else (double) */
9811 nv = (args && !vectorize) ?
9812 #if LONG_DOUBLESIZE > DOUBLESIZE
9814 va_arg(*args, long double) :
9815 va_arg(*args, double)
9817 va_arg(*args, double)
9823 if (c != 'e' && c != 'E') {
9825 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9826 will cast our (long double) to (double) */
9827 (void)Perl_frexp(nv, &i);
9828 if (i == PERL_INT_MIN)
9829 Perl_die(aTHX_ "panic: frexp");
9831 need = BIT_DIGITS(i);
9833 need += has_precis ? precis : 6; /* known default */
9838 #ifdef HAS_LDBL_SPRINTF_BUG
9839 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9840 with sfio - Allen <allens@cpan.org> */
9843 # define MY_DBL_MAX DBL_MAX
9844 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9845 # if DOUBLESIZE >= 8
9846 # define MY_DBL_MAX 1.7976931348623157E+308L
9848 # define MY_DBL_MAX 3.40282347E+38L
9852 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9853 # define MY_DBL_MAX_BUG 1L
9855 # define MY_DBL_MAX_BUG MY_DBL_MAX
9859 # define MY_DBL_MIN DBL_MIN
9860 # else /* XXX guessing! -Allen */
9861 # if DOUBLESIZE >= 8
9862 # define MY_DBL_MIN 2.2250738585072014E-308L
9864 # define MY_DBL_MIN 1.17549435E-38L
9868 if ((intsize == 'q') && (c == 'f') &&
9869 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9871 /* it's going to be short enough that
9872 * long double precision is not needed */
9874 if ((nv <= 0L) && (nv >= -0L))
9875 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9877 /* would use Perl_fp_class as a double-check but not
9878 * functional on IRIX - see perl.h comments */
9880 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9881 /* It's within the range that a double can represent */
9882 #if defined(DBL_MAX) && !defined(DBL_MIN)
9883 if ((nv >= ((long double)1/DBL_MAX)) ||
9884 (nv <= (-(long double)1/DBL_MAX)))
9886 fix_ldbl_sprintf_bug = TRUE;
9889 if (fix_ldbl_sprintf_bug == TRUE) {
9899 # undef MY_DBL_MAX_BUG
9902 #endif /* HAS_LDBL_SPRINTF_BUG */
9904 need += 20; /* fudge factor */
9905 if (PL_efloatsize < need) {
9906 Safefree(PL_efloatbuf);
9907 PL_efloatsize = need + 20; /* more fudge */
9908 New(906, PL_efloatbuf, PL_efloatsize, char);
9909 PL_efloatbuf[0] = '\0';
9912 if ( !(width || left || plus || alt) && fill != '0'
9913 && has_precis && intsize != 'q' ) { /* Shortcuts */
9914 /* See earlier comment about buggy Gconvert when digits,
9916 if ( c == 'g' && precis) {
9917 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9918 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9919 goto float_converted;
9920 } else if ( c == 'f' && !precis) {
9921 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9925 eptr = ebuf + sizeof ebuf;
9928 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9929 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9930 if (intsize == 'q') {
9931 /* Copy the one or more characters in a long double
9932 * format before the 'base' ([efgEFG]) character to
9933 * the format string. */
9934 static char const prifldbl[] = PERL_PRIfldbl;
9935 char const *p = prifldbl + sizeof(prifldbl) - 3;
9936 while (p >= prifldbl) { *--eptr = *p--; }
9941 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9946 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9958 /* No taint. Otherwise we are in the strange situation
9959 * where printf() taints but print($float) doesn't.
9961 #if defined(HAS_LONG_DOUBLE)
9963 (void)sprintf(PL_efloatbuf, eptr, nv);
9965 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9967 (void)sprintf(PL_efloatbuf, eptr, nv);
9970 eptr = PL_efloatbuf;
9971 elen = strlen(PL_efloatbuf);
9977 i = SvCUR(sv) - origlen;
9978 if (args && !vectorize) {
9980 case 'h': *(va_arg(*args, short*)) = i; break;
9981 default: *(va_arg(*args, int*)) = i; break;
9982 case 'l': *(va_arg(*args, long*)) = i; break;
9983 case 'V': *(va_arg(*args, IV*)) = i; break;
9985 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9990 sv_setuv_mg(argsv, (UV)i);
9992 continue; /* not "break" */
9998 if (!args && ckWARN(WARN_PRINTF) &&
9999 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
10000 SV *msg = sv_newmortal();
10001 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
10002 (PL_op->op_type == OP_PRTF) ? "" : "s");
10005 Perl_sv_catpvf(aTHX_ msg,
10006 "\"%%%c\"", c & 0xFF);
10008 Perl_sv_catpvf(aTHX_ msg,
10009 "\"%%\\%03"UVof"\"",
10012 sv_catpv(msg, "end of string");
10013 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10016 /* output mangled stuff ... */
10022 /* ... right here, because formatting flags should not apply */
10023 SvGROW(sv, SvCUR(sv) + elen + 1);
10025 Copy(eptr, p, elen, char);
10028 SvCUR_set(sv, p - SvPVX(sv));
10030 continue; /* not "break" */
10033 /* calculate width before utf8_upgrade changes it */
10034 have = esignlen + zeros + elen;
10036 if (is_utf8 != has_utf8) {
10039 sv_utf8_upgrade(sv);
10042 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10043 sv_utf8_upgrade(nsv);
10047 SvGROW(sv, SvCUR(sv) + elen + 1);
10052 need = (have > width ? have : width);
10055 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10057 if (esignlen && fill == '0') {
10058 for (i = 0; i < (int)esignlen; i++)
10059 *p++ = esignbuf[i];
10061 if (gap && !left) {
10062 memset(p, fill, gap);
10065 if (esignlen && fill != '0') {
10066 for (i = 0; i < (int)esignlen; i++)
10067 *p++ = esignbuf[i];
10070 for (i = zeros; i; i--)
10074 Copy(eptr, p, elen, char);
10078 memset(p, ' ', gap);
10083 Copy(dotstr, p, dotstrlen, char);
10087 vectorize = FALSE; /* done iterating over vecstr */
10094 SvCUR_set(sv, p - SvPVX(sv));
10102 /* =========================================================================
10104 =head1 Cloning an interpreter
10106 All the macros and functions in this section are for the private use of
10107 the main function, perl_clone().
10109 The foo_dup() functions make an exact copy of an existing foo thinngy.
10110 During the course of a cloning, a hash table is used to map old addresses
10111 to new addresses. The table is created and manipulated with the
10112 ptr_table_* functions.
10116 ============================================================================*/
10119 #if defined(USE_ITHREADS)
10121 #ifndef GpREFCNT_inc
10122 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10126 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10127 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10128 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10129 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10130 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10131 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10132 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10133 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10134 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10135 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10136 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10137 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10138 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10141 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10142 regcomp.c. AMS 20010712 */
10145 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10150 struct reg_substr_datum *s;
10153 return (REGEXP *)NULL;
10155 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10158 len = r->offsets[0];
10159 npar = r->nparens+1;
10161 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10162 Copy(r->program, ret->program, len+1, regnode);
10164 New(0, ret->startp, npar, I32);
10165 Copy(r->startp, ret->startp, npar, I32);
10166 New(0, ret->endp, npar, I32);
10167 Copy(r->startp, ret->startp, npar, I32);
10169 New(0, ret->substrs, 1, struct reg_substr_data);
10170 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10171 s->min_offset = r->substrs->data[i].min_offset;
10172 s->max_offset = r->substrs->data[i].max_offset;
10173 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10174 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10177 ret->regstclass = NULL;
10179 struct reg_data *d;
10180 const int count = r->data->count;
10182 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10183 char, struct reg_data);
10184 New(0, d->what, count, U8);
10187 for (i = 0; i < count; i++) {
10188 d->what[i] = r->data->what[i];
10189 switch (d->what[i]) {
10190 /* legal options are one of: sfpont
10191 see also regcomp.h and pregfree() */
10193 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10196 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10199 /* This is cheating. */
10200 New(0, d->data[i], 1, struct regnode_charclass_class);
10201 StructCopy(r->data->data[i], d->data[i],
10202 struct regnode_charclass_class);
10203 ret->regstclass = (regnode*)d->data[i];
10206 /* Compiled op trees are readonly, and can thus be
10207 shared without duplication. */
10209 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10213 d->data[i] = r->data->data[i];
10216 d->data[i] = r->data->data[i];
10218 ((reg_trie_data*)d->data[i])->refcount++;
10222 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10231 New(0, ret->offsets, 2*len+1, U32);
10232 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10234 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10235 ret->refcnt = r->refcnt;
10236 ret->minlen = r->minlen;
10237 ret->prelen = r->prelen;
10238 ret->nparens = r->nparens;
10239 ret->lastparen = r->lastparen;
10240 ret->lastcloseparen = r->lastcloseparen;
10241 ret->reganch = r->reganch;
10243 ret->sublen = r->sublen;
10245 if (RX_MATCH_COPIED(ret))
10246 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10248 ret->subbeg = Nullch;
10249 #ifdef PERL_COPY_ON_WRITE
10250 ret->saved_copy = Nullsv;
10253 ptr_table_store(PL_ptr_table, r, ret);
10257 /* duplicate a file handle */
10260 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10266 return (PerlIO*)NULL;
10268 /* look for it in the table first */
10269 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10273 /* create anew and remember what it is */
10274 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10275 ptr_table_store(PL_ptr_table, fp, ret);
10279 /* duplicate a directory handle */
10282 Perl_dirp_dup(pTHX_ DIR *dp)
10290 /* duplicate a typeglob */
10293 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10298 /* look for it in the table first */
10299 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10303 /* create anew and remember what it is */
10304 Newz(0, ret, 1, GP);
10305 ptr_table_store(PL_ptr_table, gp, ret);
10308 ret->gp_refcnt = 0; /* must be before any other dups! */
10309 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10310 ret->gp_io = io_dup_inc(gp->gp_io, param);
10311 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10312 ret->gp_av = av_dup_inc(gp->gp_av, param);
10313 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10314 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10315 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10316 ret->gp_cvgen = gp->gp_cvgen;
10317 ret->gp_flags = gp->gp_flags;
10318 ret->gp_line = gp->gp_line;
10319 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10323 /* duplicate a chain of magic */
10326 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10328 MAGIC *mgprev = (MAGIC*)NULL;
10331 return (MAGIC*)NULL;
10332 /* look for it in the table first */
10333 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10337 for (; mg; mg = mg->mg_moremagic) {
10339 Newz(0, nmg, 1, MAGIC);
10341 mgprev->mg_moremagic = nmg;
10344 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10345 nmg->mg_private = mg->mg_private;
10346 nmg->mg_type = mg->mg_type;
10347 nmg->mg_flags = mg->mg_flags;
10348 if (mg->mg_type == PERL_MAGIC_qr) {
10349 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10351 else if(mg->mg_type == PERL_MAGIC_backref) {
10352 const AV * const av = (AV*) mg->mg_obj;
10355 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10357 for (i = AvFILLp(av); i >= 0; i--) {
10358 if (!svp[i]) continue;
10359 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10363 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10364 ? sv_dup_inc(mg->mg_obj, param)
10365 : sv_dup(mg->mg_obj, param);
10367 nmg->mg_len = mg->mg_len;
10368 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10369 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10370 if (mg->mg_len > 0) {
10371 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10372 if (mg->mg_type == PERL_MAGIC_overload_table &&
10373 AMT_AMAGIC((AMT*)mg->mg_ptr))
10375 AMT *amtp = (AMT*)mg->mg_ptr;
10376 AMT *namtp = (AMT*)nmg->mg_ptr;
10378 for (i = 1; i < NofAMmeth; i++) {
10379 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10383 else if (mg->mg_len == HEf_SVKEY)
10384 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10386 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10387 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10394 /* create a new pointer-mapping table */
10397 Perl_ptr_table_new(pTHX)
10400 Newz(0, tbl, 1, PTR_TBL_t);
10401 tbl->tbl_max = 511;
10402 tbl->tbl_items = 0;
10403 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10408 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10410 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10413 /* map an existing pointer using a table */
10416 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10418 PTR_TBL_ENT_t *tblent;
10419 UV hash = PTR_TABLE_HASH(sv);
10421 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10422 for (; tblent; tblent = tblent->next) {
10423 if (tblent->oldval == sv)
10424 return tblent->newval;
10426 return (void*)NULL;
10429 /* add a new entry to a pointer-mapping table */
10432 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10434 PTR_TBL_ENT_t *tblent, **otblent;
10435 /* XXX this may be pessimal on platforms where pointers aren't good
10436 * hash values e.g. if they grow faster in the most significant
10438 UV hash = PTR_TABLE_HASH(oldv);
10442 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10443 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10444 if (tblent->oldval == oldv) {
10445 tblent->newval = newv;
10449 Newz(0, tblent, 1, PTR_TBL_ENT_t);
10450 tblent->oldval = oldv;
10451 tblent->newval = newv;
10452 tblent->next = *otblent;
10455 if (!empty && tbl->tbl_items > tbl->tbl_max)
10456 ptr_table_split(tbl);
10459 /* double the hash bucket size of an existing ptr table */
10462 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10464 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10465 UV oldsize = tbl->tbl_max + 1;
10466 UV newsize = oldsize * 2;
10469 Renew(ary, newsize, PTR_TBL_ENT_t*);
10470 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10471 tbl->tbl_max = --newsize;
10472 tbl->tbl_ary = ary;
10473 for (i=0; i < oldsize; i++, ary++) {
10474 PTR_TBL_ENT_t **curentp, **entp, *ent;
10477 curentp = ary + oldsize;
10478 for (entp = ary, ent = *ary; ent; ent = *entp) {
10479 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10481 ent->next = *curentp;
10491 /* remove all the entries from a ptr table */
10494 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10496 register PTR_TBL_ENT_t **array;
10497 register PTR_TBL_ENT_t *entry;
10498 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
10502 if (!tbl || !tbl->tbl_items) {
10506 array = tbl->tbl_ary;
10508 max = tbl->tbl_max;
10513 entry = entry->next;
10517 if (++riter > max) {
10520 entry = array[riter];
10524 tbl->tbl_items = 0;
10527 /* clear and free a ptr table */
10530 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10535 ptr_table_clear(tbl);
10536 Safefree(tbl->tbl_ary);
10540 /* attempt to make everything in the typeglob readonly */
10543 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10545 GV *gv = (GV*)sstr;
10546 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10548 if (GvIO(gv) || GvFORM(gv)) {
10549 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10551 else if (!GvCV(gv)) {
10552 GvCV(gv) = (CV*)sv;
10555 /* CvPADLISTs cannot be shared */
10556 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10561 if (!GvUNIQUE(gv)) {
10563 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10564 HvNAME(GvSTASH(gv)), GvNAME(gv));
10570 * write attempts will die with
10571 * "Modification of a read-only value attempted"
10577 SvREADONLY_on(GvSV(gv));
10581 GvAV(gv) = (AV*)sv;
10584 SvREADONLY_on(GvAV(gv));
10588 GvHV(gv) = (HV*)sv;
10591 SvREADONLY_on(GvHV(gv));
10594 return sstr; /* he_dup() will SvREFCNT_inc() */
10597 /* duplicate an SV of any type (including AV, HV etc) */
10600 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10603 SvRV_set(dstr, SvWEAKREF(sstr)
10604 ? sv_dup(SvRV(sstr), param)
10605 : sv_dup_inc(SvRV(sstr), param));
10608 else if (SvPVX(sstr)) {
10609 /* Has something there */
10611 /* Normal PV - clone whole allocated space */
10612 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10613 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10614 /* Not that normal - actually sstr is copy on write.
10615 But we are a true, independant SV, so: */
10616 SvREADONLY_off(dstr);
10621 /* Special case - not normally malloced for some reason */
10622 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10623 /* A "shared" PV - clone it as unshared string */
10624 if(SvPADTMP(sstr)) {
10625 /* However, some of them live in the pad
10626 and they should not have these flags
10629 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10631 SvUV_set(dstr, SvUVX(sstr));
10634 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10636 SvREADONLY_off(dstr);
10640 /* Some other special case - random pointer */
10641 SvPV_set(dstr, SvPVX(sstr));
10646 /* Copy the Null */
10647 if (SvTYPE(dstr) == SVt_RV)
10648 SvRV_set(dstr, NULL);
10655 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10660 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10662 /* look for it in the table first */
10663 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10667 if(param->flags & CLONEf_JOIN_IN) {
10668 /** We are joining here so we don't want do clone
10669 something that is bad **/
10671 if(SvTYPE(sstr) == SVt_PVHV &&
10673 /** don't clone stashes if they already exist **/
10674 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10675 return (SV*) old_stash;
10679 /* create anew and remember what it is */
10682 #ifdef DEBUG_LEAKING_SCALARS
10683 dstr->sv_debug_optype = sstr->sv_debug_optype;
10684 dstr->sv_debug_line = sstr->sv_debug_line;
10685 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10686 dstr->sv_debug_cloned = 1;
10688 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10690 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10694 ptr_table_store(PL_ptr_table, sstr, dstr);
10697 SvFLAGS(dstr) = SvFLAGS(sstr);
10698 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10699 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10702 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10703 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10704 PL_watch_pvx, SvPVX(sstr));
10707 /* don't clone objects whose class has asked us not to */
10708 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10709 SvFLAGS(dstr) &= ~SVTYPEMASK;
10710 SvOBJECT_off(dstr);
10714 switch (SvTYPE(sstr)) {
10716 SvANY(dstr) = NULL;
10719 SvANY(dstr) = new_XIV();
10720 SvIV_set(dstr, SvIVX(sstr));
10723 SvANY(dstr) = new_XNV();
10724 SvNV_set(dstr, SvNVX(sstr));
10727 SvANY(dstr) = new_XRV();
10728 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10731 SvANY(dstr) = new_XPV();
10732 SvCUR_set(dstr, SvCUR(sstr));
10733 SvLEN_set(dstr, SvLEN(sstr));
10734 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10737 SvANY(dstr) = new_XPVIV();
10738 SvCUR_set(dstr, SvCUR(sstr));
10739 SvLEN_set(dstr, SvLEN(sstr));
10740 SvIV_set(dstr, SvIVX(sstr));
10741 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10744 SvANY(dstr) = new_XPVNV();
10745 SvCUR_set(dstr, SvCUR(sstr));
10746 SvLEN_set(dstr, SvLEN(sstr));
10747 SvIV_set(dstr, SvIVX(sstr));
10748 SvNV_set(dstr, SvNVX(sstr));
10749 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10752 SvANY(dstr) = new_XPVMG();
10753 SvCUR_set(dstr, SvCUR(sstr));
10754 SvLEN_set(dstr, SvLEN(sstr));
10755 SvIV_set(dstr, SvIVX(sstr));
10756 SvNV_set(dstr, SvNVX(sstr));
10757 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10758 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10759 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10762 SvANY(dstr) = new_XPVBM();
10763 SvCUR_set(dstr, SvCUR(sstr));
10764 SvLEN_set(dstr, SvLEN(sstr));
10765 SvIV_set(dstr, SvIVX(sstr));
10766 SvNV_set(dstr, SvNVX(sstr));
10767 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10768 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10769 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10770 BmRARE(dstr) = BmRARE(sstr);
10771 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10772 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10775 SvANY(dstr) = new_XPVLV();
10776 SvCUR_set(dstr, SvCUR(sstr));
10777 SvLEN_set(dstr, SvLEN(sstr));
10778 SvIV_set(dstr, SvIVX(sstr));
10779 SvNV_set(dstr, SvNVX(sstr));
10780 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10781 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10782 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10783 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10784 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10785 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10786 LvTARG(dstr) = dstr;
10787 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10788 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10790 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10791 LvTYPE(dstr) = LvTYPE(sstr);
10794 if (GvUNIQUE((GV*)sstr)) {
10796 if ((share = gv_share(sstr, param))) {
10799 ptr_table_store(PL_ptr_table, sstr, dstr);
10801 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10802 HvNAME(GvSTASH(share)), GvNAME(share));
10807 SvANY(dstr) = new_XPVGV();
10808 SvCUR_set(dstr, SvCUR(sstr));
10809 SvLEN_set(dstr, SvLEN(sstr));
10810 SvIV_set(dstr, SvIVX(sstr));
10811 SvNV_set(dstr, SvNVX(sstr));
10812 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10813 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10814 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10815 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10816 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10817 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10818 GvFLAGS(dstr) = GvFLAGS(sstr);
10819 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10820 (void)GpREFCNT_inc(GvGP(dstr));
10823 SvANY(dstr) = new_XPVIO();
10824 SvCUR_set(dstr, SvCUR(sstr));
10825 SvLEN_set(dstr, SvLEN(sstr));
10826 SvIV_set(dstr, SvIVX(sstr));
10827 SvNV_set(dstr, SvNVX(sstr));
10828 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10829 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10830 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10831 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10832 if (IoOFP(sstr) == IoIFP(sstr))
10833 IoOFP(dstr) = IoIFP(dstr);
10835 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10836 /* PL_rsfp_filters entries have fake IoDIRP() */
10837 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10838 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10840 IoDIRP(dstr) = IoDIRP(sstr);
10841 IoLINES(dstr) = IoLINES(sstr);
10842 IoPAGE(dstr) = IoPAGE(sstr);
10843 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10844 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10845 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10846 /* I have no idea why fake dirp (rsfps)
10847 should be treaded differently but otherwise
10848 we end up with leaks -- sky*/
10849 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10850 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10851 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10853 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10854 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10855 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10857 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10858 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10859 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10860 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10861 IoTYPE(dstr) = IoTYPE(sstr);
10862 IoFLAGS(dstr) = IoFLAGS(sstr);
10865 SvANY(dstr) = new_XPVAV();
10866 SvCUR_set(dstr, SvCUR(sstr));
10867 SvLEN_set(dstr, SvLEN(sstr));
10868 SvIV_set(dstr, SvIVX(sstr));
10869 SvNV_set(dstr, SvNVX(sstr));
10870 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10871 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10872 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10873 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10874 if (AvARRAY((AV*)sstr)) {
10875 SV **dst_ary, **src_ary;
10876 SSize_t items = AvFILLp((AV*)sstr) + 1;
10878 src_ary = AvARRAY((AV*)sstr);
10879 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10880 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10881 SvPV_set(dstr, (char*)dst_ary);
10882 AvALLOC((AV*)dstr) = dst_ary;
10883 if (AvREAL((AV*)sstr)) {
10884 while (items-- > 0)
10885 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10888 while (items-- > 0)
10889 *dst_ary++ = sv_dup(*src_ary++, param);
10891 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10892 while (items-- > 0) {
10893 *dst_ary++ = &PL_sv_undef;
10897 SvPV_set(dstr, Nullch);
10898 AvALLOC((AV*)dstr) = (SV**)NULL;
10902 SvANY(dstr) = new_XPVHV();
10903 SvCUR_set(dstr, SvCUR(sstr));
10904 SvLEN_set(dstr, SvLEN(sstr));
10905 SvIV_set(dstr, SvIVX(sstr));
10906 SvNV_set(dstr, SvNVX(sstr));
10907 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10908 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10909 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10910 if (HvARRAY((HV*)sstr)) {
10912 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10913 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10914 Newz(0, dxhv->xhv_array,
10915 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10916 while (i <= sxhv->xhv_max) {
10917 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10918 (bool)!!HvSHAREKEYS(sstr),
10922 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10923 (bool)!!HvSHAREKEYS(sstr), param);
10926 SvPV_set(dstr, Nullch);
10927 HvEITER((HV*)dstr) = (HE*)NULL;
10929 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10930 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10931 /* Record stashes for possible cloning in Perl_clone(). */
10932 if(HvNAME((HV*)dstr))
10933 av_push(param->stashes, dstr);
10936 SvANY(dstr) = new_XPVFM();
10937 FmLINES(dstr) = FmLINES(sstr);
10941 SvANY(dstr) = new_XPVCV();
10943 SvCUR_set(dstr, SvCUR(sstr));
10944 SvLEN_set(dstr, SvLEN(sstr));
10945 SvIV_set(dstr, SvIVX(sstr));
10946 SvNV_set(dstr, SvNVX(sstr));
10947 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10948 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10949 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10950 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10951 CvSTART(dstr) = CvSTART(sstr);
10953 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10955 CvXSUB(dstr) = CvXSUB(sstr);
10956 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10957 if (CvCONST(sstr)) {
10958 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10959 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10960 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
10962 /* don't dup if copying back - CvGV isn't refcounted, so the
10963 * duped GV may never be freed. A bit of a hack! DAPM */
10964 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10965 Nullgv : gv_dup(CvGV(sstr), param) ;
10966 if (param->flags & CLONEf_COPY_STACKS) {
10967 CvDEPTH(dstr) = CvDEPTH(sstr);
10971 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10972 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10974 CvWEAKOUTSIDE(sstr)
10975 ? cv_dup( CvOUTSIDE(sstr), param)
10976 : cv_dup_inc(CvOUTSIDE(sstr), param);
10977 CvFLAGS(dstr) = CvFLAGS(sstr);
10978 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10981 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10985 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10991 /* duplicate a context */
10994 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10996 PERL_CONTEXT *ncxs;
10999 return (PERL_CONTEXT*)NULL;
11001 /* look for it in the table first */
11002 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11006 /* create anew and remember what it is */
11007 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11008 ptr_table_store(PL_ptr_table, cxs, ncxs);
11011 PERL_CONTEXT *cx = &cxs[ix];
11012 PERL_CONTEXT *ncx = &ncxs[ix];
11013 ncx->cx_type = cx->cx_type;
11014 if (CxTYPE(cx) == CXt_SUBST) {
11015 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11018 ncx->blk_oldsp = cx->blk_oldsp;
11019 ncx->blk_oldcop = cx->blk_oldcop;
11020 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11021 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11022 ncx->blk_oldpm = cx->blk_oldpm;
11023 ncx->blk_gimme = cx->blk_gimme;
11024 switch (CxTYPE(cx)) {
11026 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11027 ? cv_dup_inc(cx->blk_sub.cv, param)
11028 : cv_dup(cx->blk_sub.cv,param));
11029 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11030 ? av_dup_inc(cx->blk_sub.argarray, param)
11032 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11033 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11034 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11035 ncx->blk_sub.lval = cx->blk_sub.lval;
11036 ncx->blk_sub.retop = cx->blk_sub.retop;
11039 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11040 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11041 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11042 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11043 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11044 ncx->blk_eval.retop = cx->blk_eval.retop;
11047 ncx->blk_loop.label = cx->blk_loop.label;
11048 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11049 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11050 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11051 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11052 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11053 ? cx->blk_loop.iterdata
11054 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11055 ncx->blk_loop.oldcomppad
11056 = (PAD*)ptr_table_fetch(PL_ptr_table,
11057 cx->blk_loop.oldcomppad);
11058 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11059 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11060 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11061 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11062 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11065 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11066 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11067 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11068 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11069 ncx->blk_sub.retop = cx->blk_sub.retop;
11081 /* duplicate a stack info structure */
11084 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11089 return (PERL_SI*)NULL;
11091 /* look for it in the table first */
11092 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11096 /* create anew and remember what it is */
11097 Newz(56, nsi, 1, PERL_SI);
11098 ptr_table_store(PL_ptr_table, si, nsi);
11100 nsi->si_stack = av_dup_inc(si->si_stack, param);
11101 nsi->si_cxix = si->si_cxix;
11102 nsi->si_cxmax = si->si_cxmax;
11103 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11104 nsi->si_type = si->si_type;
11105 nsi->si_prev = si_dup(si->si_prev, param);
11106 nsi->si_next = si_dup(si->si_next, param);
11107 nsi->si_markoff = si->si_markoff;
11112 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11113 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11114 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11115 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11116 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11117 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11118 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11119 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11120 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11121 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11122 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11123 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11124 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11125 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11128 #define pv_dup_inc(p) SAVEPV(p)
11129 #define pv_dup(p) SAVEPV(p)
11130 #define svp_dup_inc(p,pp) any_dup(p,pp)
11132 /* map any object to the new equivent - either something in the
11133 * ptr table, or something in the interpreter structure
11137 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11142 return (void*)NULL;
11144 /* look for it in the table first */
11145 ret = ptr_table_fetch(PL_ptr_table, v);
11149 /* see if it is part of the interpreter structure */
11150 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11151 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11159 /* duplicate the save stack */
11162 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11164 ANY *ss = proto_perl->Tsavestack;
11165 I32 ix = proto_perl->Tsavestack_ix;
11166 I32 max = proto_perl->Tsavestack_max;
11179 void (*dptr) (void*);
11180 void (*dxptr) (pTHX_ void*);
11183 Newz(54, nss, max, ANY);
11187 TOPINT(nss,ix) = i;
11189 case SAVEt_ITEM: /* normal string */
11190 sv = (SV*)POPPTR(ss,ix);
11191 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11192 sv = (SV*)POPPTR(ss,ix);
11193 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11195 case SAVEt_SV: /* scalar reference */
11196 sv = (SV*)POPPTR(ss,ix);
11197 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11198 gv = (GV*)POPPTR(ss,ix);
11199 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11201 case SAVEt_GENERIC_PVREF: /* generic char* */
11202 c = (char*)POPPTR(ss,ix);
11203 TOPPTR(nss,ix) = pv_dup(c);
11204 ptr = POPPTR(ss,ix);
11205 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11207 case SAVEt_SHARED_PVREF: /* char* in shared space */
11208 c = (char*)POPPTR(ss,ix);
11209 TOPPTR(nss,ix) = savesharedpv(c);
11210 ptr = POPPTR(ss,ix);
11211 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11213 case SAVEt_GENERIC_SVREF: /* generic sv */
11214 case SAVEt_SVREF: /* scalar reference */
11215 sv = (SV*)POPPTR(ss,ix);
11216 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11217 ptr = POPPTR(ss,ix);
11218 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11220 case SAVEt_AV: /* array reference */
11221 av = (AV*)POPPTR(ss,ix);
11222 TOPPTR(nss,ix) = av_dup_inc(av, param);
11223 gv = (GV*)POPPTR(ss,ix);
11224 TOPPTR(nss,ix) = gv_dup(gv, param);
11226 case SAVEt_HV: /* hash reference */
11227 hv = (HV*)POPPTR(ss,ix);
11228 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11229 gv = (GV*)POPPTR(ss,ix);
11230 TOPPTR(nss,ix) = gv_dup(gv, param);
11232 case SAVEt_INT: /* int reference */
11233 ptr = POPPTR(ss,ix);
11234 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11235 intval = (int)POPINT(ss,ix);
11236 TOPINT(nss,ix) = intval;
11238 case SAVEt_LONG: /* long reference */
11239 ptr = POPPTR(ss,ix);
11240 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11241 longval = (long)POPLONG(ss,ix);
11242 TOPLONG(nss,ix) = longval;
11244 case SAVEt_I32: /* I32 reference */
11245 case SAVEt_I16: /* I16 reference */
11246 case SAVEt_I8: /* I8 reference */
11247 ptr = POPPTR(ss,ix);
11248 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11250 TOPINT(nss,ix) = i;
11252 case SAVEt_IV: /* IV reference */
11253 ptr = POPPTR(ss,ix);
11254 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11256 TOPIV(nss,ix) = iv;
11258 case SAVEt_SPTR: /* SV* reference */
11259 ptr = POPPTR(ss,ix);
11260 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11261 sv = (SV*)POPPTR(ss,ix);
11262 TOPPTR(nss,ix) = sv_dup(sv, param);
11264 case SAVEt_VPTR: /* random* reference */
11265 ptr = POPPTR(ss,ix);
11266 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11267 ptr = POPPTR(ss,ix);
11268 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11270 case SAVEt_PPTR: /* char* reference */
11271 ptr = POPPTR(ss,ix);
11272 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11273 c = (char*)POPPTR(ss,ix);
11274 TOPPTR(nss,ix) = pv_dup(c);
11276 case SAVEt_HPTR: /* HV* reference */
11277 ptr = POPPTR(ss,ix);
11278 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11279 hv = (HV*)POPPTR(ss,ix);
11280 TOPPTR(nss,ix) = hv_dup(hv, param);
11282 case SAVEt_APTR: /* AV* reference */
11283 ptr = POPPTR(ss,ix);
11284 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11285 av = (AV*)POPPTR(ss,ix);
11286 TOPPTR(nss,ix) = av_dup(av, param);
11289 gv = (GV*)POPPTR(ss,ix);
11290 TOPPTR(nss,ix) = gv_dup(gv, param);
11292 case SAVEt_GP: /* scalar reference */
11293 gp = (GP*)POPPTR(ss,ix);
11294 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11295 (void)GpREFCNT_inc(gp);
11296 gv = (GV*)POPPTR(ss,ix);
11297 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11298 c = (char*)POPPTR(ss,ix);
11299 TOPPTR(nss,ix) = pv_dup(c);
11301 TOPIV(nss,ix) = iv;
11303 TOPIV(nss,ix) = iv;
11306 case SAVEt_MORTALIZESV:
11307 sv = (SV*)POPPTR(ss,ix);
11308 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11311 ptr = POPPTR(ss,ix);
11312 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11313 /* these are assumed to be refcounted properly */
11314 switch (((OP*)ptr)->op_type) {
11316 case OP_LEAVESUBLV:
11320 case OP_LEAVEWRITE:
11321 TOPPTR(nss,ix) = ptr;
11326 TOPPTR(nss,ix) = Nullop;
11331 TOPPTR(nss,ix) = Nullop;
11334 c = (char*)POPPTR(ss,ix);
11335 TOPPTR(nss,ix) = pv_dup_inc(c);
11337 case SAVEt_CLEARSV:
11338 longval = POPLONG(ss,ix);
11339 TOPLONG(nss,ix) = longval;
11342 hv = (HV*)POPPTR(ss,ix);
11343 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11344 c = (char*)POPPTR(ss,ix);
11345 TOPPTR(nss,ix) = pv_dup_inc(c);
11347 TOPINT(nss,ix) = i;
11349 case SAVEt_DESTRUCTOR:
11350 ptr = POPPTR(ss,ix);
11351 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11352 dptr = POPDPTR(ss,ix);
11353 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11355 case SAVEt_DESTRUCTOR_X:
11356 ptr = POPPTR(ss,ix);
11357 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11358 dxptr = POPDXPTR(ss,ix);
11359 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11361 case SAVEt_REGCONTEXT:
11364 TOPINT(nss,ix) = i;
11367 case SAVEt_STACK_POS: /* Position on Perl stack */
11369 TOPINT(nss,ix) = i;
11371 case SAVEt_AELEM: /* array element */
11372 sv = (SV*)POPPTR(ss,ix);
11373 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11375 TOPINT(nss,ix) = i;
11376 av = (AV*)POPPTR(ss,ix);
11377 TOPPTR(nss,ix) = av_dup_inc(av, param);
11379 case SAVEt_HELEM: /* hash element */
11380 sv = (SV*)POPPTR(ss,ix);
11381 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11382 sv = (SV*)POPPTR(ss,ix);
11383 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11384 hv = (HV*)POPPTR(ss,ix);
11385 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11388 ptr = POPPTR(ss,ix);
11389 TOPPTR(nss,ix) = ptr;
11393 TOPINT(nss,ix) = i;
11395 case SAVEt_COMPPAD:
11396 av = (AV*)POPPTR(ss,ix);
11397 TOPPTR(nss,ix) = av_dup(av, param);
11400 longval = (long)POPLONG(ss,ix);
11401 TOPLONG(nss,ix) = longval;
11402 ptr = POPPTR(ss,ix);
11403 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11404 sv = (SV*)POPPTR(ss,ix);
11405 TOPPTR(nss,ix) = sv_dup(sv, param);
11408 ptr = POPPTR(ss,ix);
11409 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11410 longval = (long)POPBOOL(ss,ix);
11411 TOPBOOL(nss,ix) = (bool)longval;
11413 case SAVEt_SET_SVFLAGS:
11415 TOPINT(nss,ix) = i;
11417 TOPINT(nss,ix) = i;
11418 sv = (SV*)POPPTR(ss,ix);
11419 TOPPTR(nss,ix) = sv_dup(sv, param);
11422 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11430 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11431 * flag to the result. This is done for each stash before cloning starts,
11432 * so we know which stashes want their objects cloned */
11435 do_mark_cloneable_stash(pTHX_ SV *sv)
11437 if (HvNAME((HV*)sv)) {
11438 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11439 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11440 if (cloner && GvCV(cloner)) {
11447 XPUSHs(sv_2mortal(newSVpv(HvNAME((HV*)sv), 0)));
11449 call_sv((SV*)GvCV(cloner), G_SCALAR);
11456 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11464 =for apidoc perl_clone
11466 Create and return a new interpreter by cloning the current one.
11468 perl_clone takes these flags as parameters:
11470 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11471 without it we only clone the data and zero the stacks,
11472 with it we copy the stacks and the new perl interpreter is
11473 ready to run at the exact same point as the previous one.
11474 The pseudo-fork code uses COPY_STACKS while the
11475 threads->new doesn't.
11477 CLONEf_KEEP_PTR_TABLE
11478 perl_clone keeps a ptr_table with the pointer of the old
11479 variable as a key and the new variable as a value,
11480 this allows it to check if something has been cloned and not
11481 clone it again but rather just use the value and increase the
11482 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11483 the ptr_table using the function
11484 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11485 reason to keep it around is if you want to dup some of your own
11486 variable who are outside the graph perl scans, example of this
11487 code is in threads.xs create
11490 This is a win32 thing, it is ignored on unix, it tells perls
11491 win32host code (which is c++) to clone itself, this is needed on
11492 win32 if you want to run two threads at the same time,
11493 if you just want to do some stuff in a separate perl interpreter
11494 and then throw it away and return to the original one,
11495 you don't need to do anything.
11500 /* XXX the above needs expanding by someone who actually understands it ! */
11501 EXTERN_C PerlInterpreter *
11502 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11505 perl_clone(PerlInterpreter *proto_perl, UV flags)
11508 #ifdef PERL_IMPLICIT_SYS
11510 /* perlhost.h so we need to call into it
11511 to clone the host, CPerlHost should have a c interface, sky */
11513 if (flags & CLONEf_CLONE_HOST) {
11514 return perl_clone_host(proto_perl,flags);
11516 return perl_clone_using(proto_perl, flags,
11518 proto_perl->IMemShared,
11519 proto_perl->IMemParse,
11521 proto_perl->IStdIO,
11525 proto_perl->IProc);
11529 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11530 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11531 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11532 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11533 struct IPerlDir* ipD, struct IPerlSock* ipS,
11534 struct IPerlProc* ipP)
11536 /* XXX many of the string copies here can be optimized if they're
11537 * constants; they need to be allocated as common memory and just
11538 * their pointers copied. */
11541 CLONE_PARAMS clone_params;
11542 CLONE_PARAMS* param = &clone_params;
11544 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11545 /* for each stash, determine whether its objects should be cloned */
11546 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11547 PERL_SET_THX(my_perl);
11550 Poison(my_perl, 1, PerlInterpreter);
11552 PL_curcop = (COP *)Nullop;
11556 PL_savestack_ix = 0;
11557 PL_savestack_max = -1;
11558 PL_sig_pending = 0;
11559 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11560 # else /* !DEBUGGING */
11561 Zero(my_perl, 1, PerlInterpreter);
11562 # endif /* DEBUGGING */
11564 /* host pointers */
11566 PL_MemShared = ipMS;
11567 PL_MemParse = ipMP;
11574 #else /* !PERL_IMPLICIT_SYS */
11576 CLONE_PARAMS clone_params;
11577 CLONE_PARAMS* param = &clone_params;
11578 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11579 /* for each stash, determine whether its objects should be cloned */
11580 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11581 PERL_SET_THX(my_perl);
11584 Poison(my_perl, 1, PerlInterpreter);
11586 PL_curcop = (COP *)Nullop;
11590 PL_savestack_ix = 0;
11591 PL_savestack_max = -1;
11592 PL_sig_pending = 0;
11593 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11594 # else /* !DEBUGGING */
11595 Zero(my_perl, 1, PerlInterpreter);
11596 # endif /* DEBUGGING */
11597 #endif /* PERL_IMPLICIT_SYS */
11598 param->flags = flags;
11599 param->proto_perl = proto_perl;
11602 PL_xiv_arenaroot = NULL;
11603 PL_xiv_root = NULL;
11604 PL_xnv_arenaroot = NULL;
11605 PL_xnv_root = NULL;
11606 PL_xrv_arenaroot = NULL;
11607 PL_xrv_root = NULL;
11608 PL_xpv_arenaroot = NULL;
11609 PL_xpv_root = NULL;
11610 PL_xpviv_arenaroot = NULL;
11611 PL_xpviv_root = NULL;
11612 PL_xpvnv_arenaroot = NULL;
11613 PL_xpvnv_root = NULL;
11614 PL_xpvcv_arenaroot = NULL;
11615 PL_xpvcv_root = NULL;
11616 PL_xpvav_arenaroot = NULL;
11617 PL_xpvav_root = NULL;
11618 PL_xpvhv_arenaroot = NULL;
11619 PL_xpvhv_root = NULL;
11620 PL_xpvmg_arenaroot = NULL;
11621 PL_xpvmg_root = NULL;
11622 PL_xpvlv_arenaroot = NULL;
11623 PL_xpvlv_root = NULL;
11624 PL_xpvbm_arenaroot = NULL;
11625 PL_xpvbm_root = NULL;
11626 PL_he_arenaroot = NULL;
11628 PL_nice_chunk = NULL;
11629 PL_nice_chunk_size = 0;
11631 PL_sv_objcount = 0;
11632 PL_sv_root = Nullsv;
11633 PL_sv_arenaroot = Nullsv;
11635 PL_debug = proto_perl->Idebug;
11637 #ifdef USE_REENTRANT_API
11638 /* XXX: things like -Dm will segfault here in perlio, but doing
11639 * PERL_SET_CONTEXT(proto_perl);
11640 * breaks too many other things
11642 Perl_reentrant_init(aTHX);
11645 /* create SV map for pointer relocation */
11646 PL_ptr_table = ptr_table_new();
11648 /* initialize these special pointers as early as possible */
11649 SvANY(&PL_sv_undef) = NULL;
11650 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11651 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11652 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11654 SvANY(&PL_sv_no) = new_XPVNV();
11655 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11656 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11657 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11658 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11659 SvCUR_set(&PL_sv_no, 0);
11660 SvLEN_set(&PL_sv_no, 1);
11661 SvIV_set(&PL_sv_no, 0);
11662 SvNV_set(&PL_sv_no, 0);
11663 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11665 SvANY(&PL_sv_yes) = new_XPVNV();
11666 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11667 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11668 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11669 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11670 SvCUR_set(&PL_sv_yes, 1);
11671 SvLEN_set(&PL_sv_yes, 2);
11672 SvIV_set(&PL_sv_yes, 1);
11673 SvNV_set(&PL_sv_yes, 1);
11674 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11676 /* create (a non-shared!) shared string table */
11677 PL_strtab = newHV();
11678 HvSHAREKEYS_off(PL_strtab);
11679 hv_ksplit(PL_strtab, 512);
11680 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11682 PL_compiling = proto_perl->Icompiling;
11684 /* These two PVs will be free'd special way so must set them same way op.c does */
11685 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11686 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11688 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11689 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11691 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11692 if (!specialWARN(PL_compiling.cop_warnings))
11693 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11694 if (!specialCopIO(PL_compiling.cop_io))
11695 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11696 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11698 /* pseudo environmental stuff */
11699 PL_origargc = proto_perl->Iorigargc;
11700 PL_origargv = proto_perl->Iorigargv;
11702 param->stashes = newAV(); /* Setup array of objects to call clone on */
11704 #ifdef PERLIO_LAYERS
11705 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11706 PerlIO_clone(aTHX_ proto_perl, param);
11709 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11710 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11711 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11712 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11713 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11714 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11717 PL_minus_c = proto_perl->Iminus_c;
11718 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11719 PL_localpatches = proto_perl->Ilocalpatches;
11720 PL_splitstr = proto_perl->Isplitstr;
11721 PL_preprocess = proto_perl->Ipreprocess;
11722 PL_minus_n = proto_perl->Iminus_n;
11723 PL_minus_p = proto_perl->Iminus_p;
11724 PL_minus_l = proto_perl->Iminus_l;
11725 PL_minus_a = proto_perl->Iminus_a;
11726 PL_minus_F = proto_perl->Iminus_F;
11727 PL_doswitches = proto_perl->Idoswitches;
11728 PL_dowarn = proto_perl->Idowarn;
11729 PL_doextract = proto_perl->Idoextract;
11730 PL_sawampersand = proto_perl->Isawampersand;
11731 PL_unsafe = proto_perl->Iunsafe;
11732 PL_inplace = SAVEPV(proto_perl->Iinplace);
11733 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11734 PL_perldb = proto_perl->Iperldb;
11735 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11736 PL_exit_flags = proto_perl->Iexit_flags;
11738 /* magical thingies */
11739 /* XXX time(&PL_basetime) when asked for? */
11740 PL_basetime = proto_perl->Ibasetime;
11741 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11743 PL_maxsysfd = proto_perl->Imaxsysfd;
11744 PL_multiline = proto_perl->Imultiline;
11745 PL_statusvalue = proto_perl->Istatusvalue;
11747 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11749 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11751 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11752 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11753 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11755 /* Clone the regex array */
11756 PL_regex_padav = newAV();
11758 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11759 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11760 av_push(PL_regex_padav,
11761 sv_dup_inc(regexen[0],param));
11762 for(i = 1; i <= len; i++) {
11763 if(SvREPADTMP(regexen[i])) {
11764 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11766 av_push(PL_regex_padav,
11768 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11769 SvIVX(regexen[i])), param)))
11774 PL_regex_pad = AvARRAY(PL_regex_padav);
11776 /* shortcuts to various I/O objects */
11777 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11778 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11779 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11780 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11781 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11782 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11784 /* shortcuts to regexp stuff */
11785 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11787 /* shortcuts to misc objects */
11788 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11790 /* shortcuts to debugging objects */
11791 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11792 PL_DBline = gv_dup(proto_perl->IDBline, param);
11793 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11794 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11795 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11796 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11797 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11798 PL_lineary = av_dup(proto_perl->Ilineary, param);
11799 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11801 /* symbol tables */
11802 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11803 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11804 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11805 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11806 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11808 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11809 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11810 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11811 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11812 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11813 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11815 PL_sub_generation = proto_perl->Isub_generation;
11817 /* funky return mechanisms */
11818 PL_forkprocess = proto_perl->Iforkprocess;
11820 /* subprocess state */
11821 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11823 /* internal state */
11824 PL_tainting = proto_perl->Itainting;
11825 PL_taint_warn = proto_perl->Itaint_warn;
11826 PL_maxo = proto_perl->Imaxo;
11827 if (proto_perl->Iop_mask)
11828 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11830 PL_op_mask = Nullch;
11831 /* PL_asserting = proto_perl->Iasserting; */
11833 /* current interpreter roots */
11834 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11835 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11836 PL_main_start = proto_perl->Imain_start;
11837 PL_eval_root = proto_perl->Ieval_root;
11838 PL_eval_start = proto_perl->Ieval_start;
11840 /* runtime control stuff */
11841 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11842 PL_copline = proto_perl->Icopline;
11844 PL_filemode = proto_perl->Ifilemode;
11845 PL_lastfd = proto_perl->Ilastfd;
11846 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11849 PL_gensym = proto_perl->Igensym;
11850 PL_preambled = proto_perl->Ipreambled;
11851 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11852 PL_laststatval = proto_perl->Ilaststatval;
11853 PL_laststype = proto_perl->Ilaststype;
11854 PL_mess_sv = Nullsv;
11856 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11857 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11859 /* interpreter atexit processing */
11860 PL_exitlistlen = proto_perl->Iexitlistlen;
11861 if (PL_exitlistlen) {
11862 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11863 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11866 PL_exitlist = (PerlExitListEntry*)NULL;
11867 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11868 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11869 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11871 PL_profiledata = NULL;
11872 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11873 /* PL_rsfp_filters entries have fake IoDIRP() */
11874 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11876 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11878 PAD_CLONE_VARS(proto_perl, param);
11880 #ifdef HAVE_INTERP_INTERN
11881 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11884 /* more statics moved here */
11885 PL_generation = proto_perl->Igeneration;
11886 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11888 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11889 PL_in_clean_all = proto_perl->Iin_clean_all;
11891 PL_uid = proto_perl->Iuid;
11892 PL_euid = proto_perl->Ieuid;
11893 PL_gid = proto_perl->Igid;
11894 PL_egid = proto_perl->Iegid;
11895 PL_nomemok = proto_perl->Inomemok;
11896 PL_an = proto_perl->Ian;
11897 PL_evalseq = proto_perl->Ievalseq;
11898 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11899 PL_origalen = proto_perl->Iorigalen;
11900 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11901 PL_osname = SAVEPV(proto_perl->Iosname);
11902 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11903 PL_sighandlerp = proto_perl->Isighandlerp;
11906 PL_runops = proto_perl->Irunops;
11908 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11911 PL_cshlen = proto_perl->Icshlen;
11912 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11915 PL_lex_state = proto_perl->Ilex_state;
11916 PL_lex_defer = proto_perl->Ilex_defer;
11917 PL_lex_expect = proto_perl->Ilex_expect;
11918 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11919 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11920 PL_lex_starts = proto_perl->Ilex_starts;
11921 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11922 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11923 PL_lex_op = proto_perl->Ilex_op;
11924 PL_lex_inpat = proto_perl->Ilex_inpat;
11925 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11926 PL_lex_brackets = proto_perl->Ilex_brackets;
11927 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11928 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11929 PL_lex_casemods = proto_perl->Ilex_casemods;
11930 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11931 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11933 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11934 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11935 PL_nexttoke = proto_perl->Inexttoke;
11937 /* XXX This is probably masking the deeper issue of why
11938 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11939 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11940 * (A little debugging with a watchpoint on it may help.)
11942 if (SvANY(proto_perl->Ilinestr)) {
11943 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11944 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11945 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11946 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11947 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11948 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11949 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11950 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11951 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11954 PL_linestr = NEWSV(65,79);
11955 sv_upgrade(PL_linestr,SVt_PVIV);
11956 sv_setpvn(PL_linestr,"",0);
11957 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11959 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11960 PL_pending_ident = proto_perl->Ipending_ident;
11961 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11963 PL_expect = proto_perl->Iexpect;
11965 PL_multi_start = proto_perl->Imulti_start;
11966 PL_multi_end = proto_perl->Imulti_end;
11967 PL_multi_open = proto_perl->Imulti_open;
11968 PL_multi_close = proto_perl->Imulti_close;
11970 PL_error_count = proto_perl->Ierror_count;
11971 PL_subline = proto_perl->Isubline;
11972 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11974 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11975 if (SvANY(proto_perl->Ilinestr)) {
11976 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11977 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11978 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11979 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11980 PL_last_lop_op = proto_perl->Ilast_lop_op;
11983 PL_last_uni = SvPVX(PL_linestr);
11984 PL_last_lop = SvPVX(PL_linestr);
11985 PL_last_lop_op = 0;
11987 PL_in_my = proto_perl->Iin_my;
11988 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11990 PL_cryptseen = proto_perl->Icryptseen;
11993 PL_hints = proto_perl->Ihints;
11995 PL_amagic_generation = proto_perl->Iamagic_generation;
11997 #ifdef USE_LOCALE_COLLATE
11998 PL_collation_ix = proto_perl->Icollation_ix;
11999 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12000 PL_collation_standard = proto_perl->Icollation_standard;
12001 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12002 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12003 #endif /* USE_LOCALE_COLLATE */
12005 #ifdef USE_LOCALE_NUMERIC
12006 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12007 PL_numeric_standard = proto_perl->Inumeric_standard;
12008 PL_numeric_local = proto_perl->Inumeric_local;
12009 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12010 #endif /* !USE_LOCALE_NUMERIC */
12012 /* utf8 character classes */
12013 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12014 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12015 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12016 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12017 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12018 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12019 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12020 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12021 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12022 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12023 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12024 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12025 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12026 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12027 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12028 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12029 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12030 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12031 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12032 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12034 /* Did the locale setup indicate UTF-8? */
12035 PL_utf8locale = proto_perl->Iutf8locale;
12036 /* Unicode features (see perlrun/-C) */
12037 PL_unicode = proto_perl->Iunicode;
12039 /* Pre-5.8 signals control */
12040 PL_signals = proto_perl->Isignals;
12042 /* times() ticks per second */
12043 PL_clocktick = proto_perl->Iclocktick;
12045 /* Recursion stopper for PerlIO_find_layer */
12046 PL_in_load_module = proto_perl->Iin_load_module;
12048 /* sort() routine */
12049 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12051 /* Not really needed/useful since the reenrant_retint is "volatile",
12052 * but do it for consistency's sake. */
12053 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12055 /* Hooks to shared SVs and locks. */
12056 PL_sharehook = proto_perl->Isharehook;
12057 PL_lockhook = proto_perl->Ilockhook;
12058 PL_unlockhook = proto_perl->Iunlockhook;
12059 PL_threadhook = proto_perl->Ithreadhook;
12061 PL_runops_std = proto_perl->Irunops_std;
12062 PL_runops_dbg = proto_perl->Irunops_dbg;
12064 #ifdef THREADS_HAVE_PIDS
12065 PL_ppid = proto_perl->Ippid;
12069 PL_last_swash_hv = Nullhv; /* reinits on demand */
12070 PL_last_swash_klen = 0;
12071 PL_last_swash_key[0]= '\0';
12072 PL_last_swash_tmps = (U8*)NULL;
12073 PL_last_swash_slen = 0;
12075 PL_glob_index = proto_perl->Iglob_index;
12076 PL_srand_called = proto_perl->Isrand_called;
12077 PL_hash_seed = proto_perl->Ihash_seed;
12078 PL_rehash_seed = proto_perl->Irehash_seed;
12079 PL_uudmap['M'] = 0; /* reinits on demand */
12080 PL_bitcount = Nullch; /* reinits on demand */
12082 if (proto_perl->Ipsig_pend) {
12083 Newz(0, PL_psig_pend, SIG_SIZE, int);
12086 PL_psig_pend = (int*)NULL;
12089 if (proto_perl->Ipsig_ptr) {
12090 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12091 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12092 for (i = 1; i < SIG_SIZE; i++) {
12093 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12094 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12098 PL_psig_ptr = (SV**)NULL;
12099 PL_psig_name = (SV**)NULL;
12102 /* thrdvar.h stuff */
12104 if (flags & CLONEf_COPY_STACKS) {
12105 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12106 PL_tmps_ix = proto_perl->Ttmps_ix;
12107 PL_tmps_max = proto_perl->Ttmps_max;
12108 PL_tmps_floor = proto_perl->Ttmps_floor;
12109 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12111 while (i <= PL_tmps_ix) {
12112 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12116 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12117 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12118 Newz(54, PL_markstack, i, I32);
12119 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12120 - proto_perl->Tmarkstack);
12121 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12122 - proto_perl->Tmarkstack);
12123 Copy(proto_perl->Tmarkstack, PL_markstack,
12124 PL_markstack_ptr - PL_markstack + 1, I32);
12126 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12127 * NOTE: unlike the others! */
12128 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12129 PL_scopestack_max = proto_perl->Tscopestack_max;
12130 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12131 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12133 /* NOTE: si_dup() looks at PL_markstack */
12134 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12136 /* PL_curstack = PL_curstackinfo->si_stack; */
12137 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12138 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12140 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12141 PL_stack_base = AvARRAY(PL_curstack);
12142 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12143 - proto_perl->Tstack_base);
12144 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12146 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12147 * NOTE: unlike the others! */
12148 PL_savestack_ix = proto_perl->Tsavestack_ix;
12149 PL_savestack_max = proto_perl->Tsavestack_max;
12150 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12151 PL_savestack = ss_dup(proto_perl, param);
12155 ENTER; /* perl_destruct() wants to LEAVE; */
12158 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12159 PL_top_env = &PL_start_env;
12161 PL_op = proto_perl->Top;
12164 PL_Xpv = (XPV*)NULL;
12165 PL_na = proto_perl->Tna;
12167 PL_statbuf = proto_perl->Tstatbuf;
12168 PL_statcache = proto_perl->Tstatcache;
12169 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12170 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12172 PL_timesbuf = proto_perl->Ttimesbuf;
12175 PL_tainted = proto_perl->Ttainted;
12176 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12177 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12178 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12179 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12180 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12181 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12182 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12183 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12184 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12186 PL_restartop = proto_perl->Trestartop;
12187 PL_in_eval = proto_perl->Tin_eval;
12188 PL_delaymagic = proto_perl->Tdelaymagic;
12189 PL_dirty = proto_perl->Tdirty;
12190 PL_localizing = proto_perl->Tlocalizing;
12192 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12193 PL_hv_fetch_ent_mh = Nullhe;
12194 PL_modcount = proto_perl->Tmodcount;
12195 PL_lastgotoprobe = Nullop;
12196 PL_dumpindent = proto_perl->Tdumpindent;
12198 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12199 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12200 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12201 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12202 PL_sortcxix = proto_perl->Tsortcxix;
12203 PL_efloatbuf = Nullch; /* reinits on demand */
12204 PL_efloatsize = 0; /* reinits on demand */
12208 PL_screamfirst = NULL;
12209 PL_screamnext = NULL;
12210 PL_maxscream = -1; /* reinits on demand */
12211 PL_lastscream = Nullsv;
12213 PL_watchaddr = NULL;
12214 PL_watchok = Nullch;
12216 PL_regdummy = proto_perl->Tregdummy;
12217 PL_regprecomp = Nullch;
12220 PL_colorset = 0; /* reinits PL_colors[] */
12221 /*PL_colors[6] = {0,0,0,0,0,0};*/
12222 PL_reginput = Nullch;
12223 PL_regbol = Nullch;
12224 PL_regeol = Nullch;
12225 PL_regstartp = (I32*)NULL;
12226 PL_regendp = (I32*)NULL;
12227 PL_reglastparen = (U32*)NULL;
12228 PL_reglastcloseparen = (U32*)NULL;
12229 PL_regtill = Nullch;
12230 PL_reg_start_tmp = (char**)NULL;
12231 PL_reg_start_tmpl = 0;
12232 PL_regdata = (struct reg_data*)NULL;
12235 PL_reg_eval_set = 0;
12237 PL_regprogram = (regnode*)NULL;
12239 PL_regcc = (CURCUR*)NULL;
12240 PL_reg_call_cc = (struct re_cc_state*)NULL;
12241 PL_reg_re = (regexp*)NULL;
12242 PL_reg_ganch = Nullch;
12243 PL_reg_sv = Nullsv;
12244 PL_reg_match_utf8 = FALSE;
12245 PL_reg_magic = (MAGIC*)NULL;
12247 PL_reg_oldcurpm = (PMOP*)NULL;
12248 PL_reg_curpm = (PMOP*)NULL;
12249 PL_reg_oldsaved = Nullch;
12250 PL_reg_oldsavedlen = 0;
12251 #ifdef PERL_COPY_ON_WRITE
12254 PL_reg_maxiter = 0;
12255 PL_reg_leftiter = 0;
12256 PL_reg_poscache = Nullch;
12257 PL_reg_poscache_size= 0;
12259 /* RE engine - function pointers */
12260 PL_regcompp = proto_perl->Tregcompp;
12261 PL_regexecp = proto_perl->Tregexecp;
12262 PL_regint_start = proto_perl->Tregint_start;
12263 PL_regint_string = proto_perl->Tregint_string;
12264 PL_regfree = proto_perl->Tregfree;
12266 PL_reginterp_cnt = 0;
12267 PL_reg_starttry = 0;
12269 /* Pluggable optimizer */
12270 PL_peepp = proto_perl->Tpeepp;
12272 PL_stashcache = newHV();
12274 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12275 ptr_table_free(PL_ptr_table);
12276 PL_ptr_table = NULL;
12279 /* Call the ->CLONE method, if it exists, for each of the stashes
12280 identified by sv_dup() above.
12282 while(av_len(param->stashes) != -1) {
12283 HV* stash = (HV*) av_shift(param->stashes);
12284 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12285 if (cloner && GvCV(cloner)) {
12290 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
12292 call_sv((SV*)GvCV(cloner), G_DISCARD);
12298 SvREFCNT_dec(param->stashes);
12303 #endif /* USE_ITHREADS */
12306 =head1 Unicode Support
12308 =for apidoc sv_recode_to_utf8
12310 The encoding is assumed to be an Encode object, on entry the PV
12311 of the sv is assumed to be octets in that encoding, and the sv
12312 will be converted into Unicode (and UTF-8).
12314 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12315 is not a reference, nothing is done to the sv. If the encoding is not
12316 an C<Encode::XS> Encoding object, bad things will happen.
12317 (See F<lib/encoding.pm> and L<Encode>).
12319 The PV of the sv is returned.
12324 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12327 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12341 Passing sv_yes is wrong - it needs to be or'ed set of constants
12342 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12343 remove converted chars from source.
12345 Both will default the value - let them.
12347 XPUSHs(&PL_sv_yes);
12350 call_method("decode", G_SCALAR);
12354 s = SvPV(uni, len);
12355 if (s != SvPVX(sv)) {
12356 SvGROW(sv, len + 1);
12357 Move(s, SvPVX(sv), len, char);
12358 SvCUR_set(sv, len);
12359 SvPVX(sv)[len] = 0;
12366 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12370 =for apidoc sv_cat_decode
12372 The encoding is assumed to be an Encode object, the PV of the ssv is
12373 assumed to be octets in that encoding and decoding the input starts
12374 from the position which (PV + *offset) pointed to. The dsv will be
12375 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12376 when the string tstr appears in decoding output or the input ends on
12377 the PV of the ssv. The value which the offset points will be modified
12378 to the last input position on the ssv.
12380 Returns TRUE if the terminator was found, else returns FALSE.
12385 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12386 SV *ssv, int *offset, char *tstr, int tlen)
12390 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12401 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12402 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12404 call_method("cat_decode", G_SCALAR);
12406 ret = SvTRUE(TOPs);
12407 *offset = SvIV(offsv);
12413 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12419 * c-indentation-style: bsd
12420 * c-basic-offset: 4
12421 * indent-tabs-mode: t
12424 * vim: shiftwidth=4: