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)
3889 if (sv == &PL_sv_undef)
3893 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3894 (void) sv_2pv_flags(sv,&len, flags);
3898 (void) SvPV_force(sv,len);
3907 sv_force_normal_flags(sv, 0);
3910 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3911 sv_recode_to_utf8(sv, PL_encoding);
3912 else { /* Assume Latin-1/EBCDIC */
3913 /* This function could be much more efficient if we
3914 * had a FLAG in SVs to signal if there are any hibit
3915 * chars in the PV. Given that there isn't such a flag
3916 * make the loop as fast as possible. */
3917 U8 *s = (U8 *) SvPVX(sv);
3918 U8 *e = (U8 *) SvEND(sv);
3924 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3928 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3929 s = bytes_to_utf8((U8*)s, &len);
3931 SvPV_free(sv); /* No longer using what was there before. */
3933 SvPV_set(sv, (char*)s);
3934 SvCUR_set(sv, len - 1);
3935 SvLEN_set(sv, len); /* No longer know the real size. */
3937 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3944 =for apidoc sv_utf8_downgrade
3946 Attempts to convert the PV of an SV from characters to bytes.
3947 If the PV contains a character beyond byte, this conversion will fail;
3948 in this case, either returns false or, if C<fail_ok> is not
3951 This is not as a general purpose Unicode to byte encoding interface:
3952 use the Encode extension for that.
3958 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3960 if (SvPOKp(sv) && SvUTF8(sv)) {
3966 sv_force_normal_flags(sv, 0);
3968 s = (U8 *) SvPV(sv, len);
3969 if (!utf8_to_bytes(s, &len)) {
3974 Perl_croak(aTHX_ "Wide character in %s",
3977 Perl_croak(aTHX_ "Wide character");
3988 =for apidoc sv_utf8_encode
3990 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3991 flag off so that it looks like octets again.
3997 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3999 (void) sv_utf8_upgrade(sv);
4001 sv_force_normal_flags(sv, 0);
4003 if (SvREADONLY(sv)) {
4004 Perl_croak(aTHX_ PL_no_modify);
4010 =for apidoc sv_utf8_decode
4012 If the PV of the SV is an octet sequence in UTF-8
4013 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
4014 so that it looks like a character. If the PV contains only single-byte
4015 characters, the C<SvUTF8> flag stays being off.
4016 Scans PV for validity and returns false if the PV is invalid UTF-8.
4022 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4028 /* The octets may have got themselves encoded - get them back as
4031 if (!sv_utf8_downgrade(sv, TRUE))
4034 /* it is actually just a matter of turning the utf8 flag on, but
4035 * we want to make sure everything inside is valid utf8 first.
4037 c = (U8 *) SvPVX(sv);
4038 if (!is_utf8_string(c, SvCUR(sv)+1))
4040 e = (U8 *) SvEND(sv);
4043 if (!UTF8_IS_INVARIANT(ch)) {
4052 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4053 * this function provided for binary compatibility only
4057 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4059 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4063 =for apidoc sv_setsv
4065 Copies the contents of the source SV C<ssv> into the destination SV
4066 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4067 function if the source SV needs to be reused. Does not handle 'set' magic.
4068 Loosely speaking, it performs a copy-by-value, obliterating any previous
4069 content of the destination.
4071 You probably want to use one of the assortment of wrappers, such as
4072 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4073 C<SvSetMagicSV_nosteal>.
4075 =for apidoc sv_setsv_flags
4077 Copies the contents of the source SV C<ssv> into the destination SV
4078 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4079 function if the source SV needs to be reused. Does not handle 'set' magic.
4080 Loosely speaking, it performs a copy-by-value, obliterating any previous
4081 content of the destination.
4082 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4083 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4084 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4085 and C<sv_setsv_nomg> are implemented in terms of this function.
4087 You probably want to use one of the assortment of wrappers, such as
4088 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4089 C<SvSetMagicSV_nosteal>.
4091 This is the primary function for copying scalars, and most other
4092 copy-ish functions and macros use this underneath.
4098 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4100 register U32 sflags;
4106 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4108 sstr = &PL_sv_undef;
4109 stype = SvTYPE(sstr);
4110 dtype = SvTYPE(dstr);
4115 /* need to nuke the magic */
4117 SvRMAGICAL_off(dstr);
4120 /* There's a lot of redundancy below but we're going for speed here */
4125 if (dtype != SVt_PVGV) {
4126 (void)SvOK_off(dstr);
4134 sv_upgrade(dstr, SVt_IV);
4137 sv_upgrade(dstr, SVt_PVNV);
4141 sv_upgrade(dstr, SVt_PVIV);
4144 (void)SvIOK_only(dstr);
4145 SvIV_set(dstr, SvIVX(sstr));
4148 if (SvTAINTED(sstr))
4159 sv_upgrade(dstr, SVt_NV);
4164 sv_upgrade(dstr, SVt_PVNV);
4167 SvNV_set(dstr, SvNVX(sstr));
4168 (void)SvNOK_only(dstr);
4169 if (SvTAINTED(sstr))
4177 sv_upgrade(dstr, SVt_RV);
4178 else if (dtype == SVt_PVGV &&
4179 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4182 if (GvIMPORTED(dstr) != GVf_IMPORTED
4183 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4185 GvIMPORTED_on(dstr);
4194 #ifdef PERL_COPY_ON_WRITE
4195 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4196 if (dtype < SVt_PVIV)
4197 sv_upgrade(dstr, SVt_PVIV);
4204 sv_upgrade(dstr, SVt_PV);
4207 if (dtype < SVt_PVIV)
4208 sv_upgrade(dstr, SVt_PVIV);
4211 if (dtype < SVt_PVNV)
4212 sv_upgrade(dstr, SVt_PVNV);
4219 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
4222 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
4226 if (dtype <= SVt_PVGV) {
4228 if (dtype != SVt_PVGV) {
4229 char *name = GvNAME(sstr);
4230 STRLEN len = GvNAMELEN(sstr);
4231 /* don't upgrade SVt_PVLV: it can hold a glob */
4232 if (dtype != SVt_PVLV)
4233 sv_upgrade(dstr, SVt_PVGV);
4234 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4235 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4236 GvNAME(dstr) = savepvn(name, len);
4237 GvNAMELEN(dstr) = len;
4238 SvFAKE_on(dstr); /* can coerce to non-glob */
4240 /* ahem, death to those who redefine active sort subs */
4241 else if (PL_curstackinfo->si_type == PERLSI_SORT
4242 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4243 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4246 #ifdef GV_UNIQUE_CHECK
4247 if (GvUNIQUE((GV*)dstr)) {
4248 Perl_croak(aTHX_ PL_no_modify);
4252 (void)SvOK_off(dstr);
4253 GvINTRO_off(dstr); /* one-shot flag */
4255 GvGP(dstr) = gp_ref(GvGP(sstr));
4256 if (SvTAINTED(sstr))
4258 if (GvIMPORTED(dstr) != GVf_IMPORTED
4259 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4261 GvIMPORTED_on(dstr);
4269 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4271 if ((int)SvTYPE(sstr) != stype) {
4272 stype = SvTYPE(sstr);
4273 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4277 if (stype == SVt_PVLV)
4278 (void)SvUPGRADE(dstr, SVt_PVNV);
4280 (void)SvUPGRADE(dstr, (U32)stype);
4283 sflags = SvFLAGS(sstr);
4285 if (sflags & SVf_ROK) {
4286 if (dtype >= SVt_PV) {
4287 if (dtype == SVt_PVGV) {
4288 SV *sref = SvREFCNT_inc(SvRV(sstr));
4290 int intro = GvINTRO(dstr);
4292 #ifdef GV_UNIQUE_CHECK
4293 if (GvUNIQUE((GV*)dstr)) {
4294 Perl_croak(aTHX_ PL_no_modify);
4299 GvINTRO_off(dstr); /* one-shot flag */
4300 GvLINE(dstr) = CopLINE(PL_curcop);
4301 GvEGV(dstr) = (GV*)dstr;
4304 switch (SvTYPE(sref)) {
4307 SAVEGENERICSV(GvAV(dstr));
4309 dref = (SV*)GvAV(dstr);
4310 GvAV(dstr) = (AV*)sref;
4311 if (!GvIMPORTED_AV(dstr)
4312 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4314 GvIMPORTED_AV_on(dstr);
4319 SAVEGENERICSV(GvHV(dstr));
4321 dref = (SV*)GvHV(dstr);
4322 GvHV(dstr) = (HV*)sref;
4323 if (!GvIMPORTED_HV(dstr)
4324 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4326 GvIMPORTED_HV_on(dstr);
4331 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4332 SvREFCNT_dec(GvCV(dstr));
4333 GvCV(dstr) = Nullcv;
4334 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4335 PL_sub_generation++;
4337 SAVEGENERICSV(GvCV(dstr));
4340 dref = (SV*)GvCV(dstr);
4341 if (GvCV(dstr) != (CV*)sref) {
4342 CV* cv = GvCV(dstr);
4344 if (!GvCVGEN((GV*)dstr) &&
4345 (CvROOT(cv) || CvXSUB(cv)))
4347 /* ahem, death to those who redefine
4348 * active sort subs */
4349 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4350 PL_sortcop == CvSTART(cv))
4352 "Can't redefine active sort subroutine %s",
4353 GvENAME((GV*)dstr));
4354 /* Redefining a sub - warning is mandatory if
4355 it was a const and its value changed. */
4356 if (ckWARN(WARN_REDEFINE)
4358 && (!CvCONST((CV*)sref)
4359 || sv_cmp(cv_const_sv(cv),
4360 cv_const_sv((CV*)sref)))))
4362 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4364 ? "Constant subroutine %s::%s redefined"
4365 : "Subroutine %s::%s redefined",
4366 HvNAME(GvSTASH((GV*)dstr)),
4367 GvENAME((GV*)dstr));
4371 cv_ckproto(cv, (GV*)dstr,
4372 SvPOK(sref) ? SvPVX(sref) : Nullch);
4374 GvCV(dstr) = (CV*)sref;
4375 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4376 GvASSUMECV_on(dstr);
4377 PL_sub_generation++;
4379 if (!GvIMPORTED_CV(dstr)
4380 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4382 GvIMPORTED_CV_on(dstr);
4387 SAVEGENERICSV(GvIOp(dstr));
4389 dref = (SV*)GvIOp(dstr);
4390 GvIOp(dstr) = (IO*)sref;
4394 SAVEGENERICSV(GvFORM(dstr));
4396 dref = (SV*)GvFORM(dstr);
4397 GvFORM(dstr) = (CV*)sref;
4401 SAVEGENERICSV(GvSV(dstr));
4403 dref = (SV*)GvSV(dstr);
4405 if (!GvIMPORTED_SV(dstr)
4406 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4408 GvIMPORTED_SV_on(dstr);
4414 if (SvTAINTED(sstr))
4424 (void)SvOK_off(dstr);
4425 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4427 if (sflags & SVp_NOK) {
4429 /* Only set the public OK flag if the source has public OK. */
4430 if (sflags & SVf_NOK)
4431 SvFLAGS(dstr) |= SVf_NOK;
4432 SvNV_set(dstr, SvNVX(sstr));
4434 if (sflags & SVp_IOK) {
4435 (void)SvIOKp_on(dstr);
4436 if (sflags & SVf_IOK)
4437 SvFLAGS(dstr) |= SVf_IOK;
4438 if (sflags & SVf_IVisUV)
4440 SvIV_set(dstr, SvIVX(sstr));
4442 if (SvAMAGIC(sstr)) {
4446 else if (sflags & SVp_POK) {
4450 * Check to see if we can just swipe the string. If so, it's a
4451 * possible small lose on short strings, but a big win on long ones.
4452 * It might even be a win on short strings if SvPVX(dstr)
4453 * has to be allocated and SvPVX(sstr) has to be freed.
4456 /* Whichever path we take through the next code, we want this true,
4457 and doing it now facilitates the COW check. */
4458 (void)SvPOK_only(dstr);
4461 #ifdef PERL_COPY_ON_WRITE
4462 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4466 (sflags & SVs_TEMP) && /* slated for free anyway? */
4467 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4468 (!(flags & SV_NOSTEAL)) &&
4469 /* and we're allowed to steal temps */
4470 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4471 SvLEN(sstr) && /* and really is a string */
4472 /* and won't be needed again, potentially */
4473 !(PL_op && PL_op->op_type == OP_AASSIGN))
4474 #ifdef PERL_COPY_ON_WRITE
4475 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4476 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4477 && SvTYPE(sstr) >= SVt_PVIV)
4480 /* Failed the swipe test, and it's not a shared hash key either.
4481 Have to copy the string. */
4482 STRLEN len = SvCUR(sstr);
4483 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4484 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4485 SvCUR_set(dstr, len);
4486 *SvEND(dstr) = '\0';
4488 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4490 #ifdef PERL_COPY_ON_WRITE
4491 /* Either it's a shared hash key, or it's suitable for
4492 copy-on-write or we can swipe the string. */
4494 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4499 /* I believe I should acquire a global SV mutex if
4500 it's a COW sv (not a shared hash key) to stop
4501 it going un copy-on-write.
4502 If the source SV has gone un copy on write between up there
4503 and down here, then (assert() that) it is of the correct
4504 form to make it copy on write again */
4505 if ((sflags & (SVf_FAKE | SVf_READONLY))
4506 != (SVf_FAKE | SVf_READONLY)) {
4507 SvREADONLY_on(sstr);
4509 /* Make the source SV into a loop of 1.
4510 (about to become 2) */
4511 SV_COW_NEXT_SV_SET(sstr, sstr);
4515 /* Initial code is common. */
4516 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4518 SvFLAGS(dstr) &= ~SVf_OOK;
4519 Safefree(SvPVX(dstr) - SvIVX(dstr));
4521 else if (SvLEN(dstr))
4522 Safefree(SvPVX(dstr));
4525 #ifdef PERL_COPY_ON_WRITE
4527 /* making another shared SV. */
4528 STRLEN cur = SvCUR(sstr);
4529 STRLEN len = SvLEN(sstr);
4530 assert (SvTYPE(dstr) >= SVt_PVIV);
4532 /* SvIsCOW_normal */
4533 /* splice us in between source and next-after-source. */
4534 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4535 SV_COW_NEXT_SV_SET(sstr, dstr);
4536 SvPV_set(dstr, SvPVX(sstr));
4538 /* SvIsCOW_shared_hash */
4539 UV hash = SvUVX(sstr);
4540 DEBUG_C(PerlIO_printf(Perl_debug_log,
4541 "Copy on write: Sharing hash\n"));
4543 sharepvn(SvPVX(sstr),
4544 (sflags & SVf_UTF8?-cur:cur), hash));
4545 SvUV_set(dstr, hash);
4547 SvLEN_set(dstr, len);
4548 SvCUR_set(dstr, cur);
4549 SvREADONLY_on(dstr);
4551 /* Relesase a global SV mutex. */
4555 { /* Passes the swipe test. */
4556 SvPV_set(dstr, SvPVX(sstr));
4557 SvLEN_set(dstr, SvLEN(sstr));
4558 SvCUR_set(dstr, SvCUR(sstr));
4561 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4562 SvPV_set(sstr, Nullch);
4568 if (sflags & SVf_UTF8)
4571 if (sflags & SVp_NOK) {
4573 if (sflags & SVf_NOK)
4574 SvFLAGS(dstr) |= SVf_NOK;
4575 SvNV_set(dstr, SvNVX(sstr));
4577 if (sflags & SVp_IOK) {
4578 (void)SvIOKp_on(dstr);
4579 if (sflags & SVf_IOK)
4580 SvFLAGS(dstr) |= SVf_IOK;
4581 if (sflags & SVf_IVisUV)
4583 SvIV_set(dstr, SvIVX(sstr));
4586 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4587 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4588 smg->mg_ptr, smg->mg_len);
4589 SvRMAGICAL_on(dstr);
4592 else if (sflags & SVp_IOK) {
4593 if (sflags & SVf_IOK)
4594 (void)SvIOK_only(dstr);
4596 (void)SvOK_off(dstr);
4597 (void)SvIOKp_on(dstr);
4599 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4600 if (sflags & SVf_IVisUV)
4602 SvIV_set(dstr, SvIVX(sstr));
4603 if (sflags & SVp_NOK) {
4604 if (sflags & SVf_NOK)
4605 (void)SvNOK_on(dstr);
4607 (void)SvNOKp_on(dstr);
4608 SvNV_set(dstr, SvNVX(sstr));
4611 else if (sflags & SVp_NOK) {
4612 if (sflags & SVf_NOK)
4613 (void)SvNOK_only(dstr);
4615 (void)SvOK_off(dstr);
4618 SvNV_set(dstr, SvNVX(sstr));
4621 if (dtype == SVt_PVGV) {
4622 if (ckWARN(WARN_MISC))
4623 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4626 (void)SvOK_off(dstr);
4628 if (SvTAINTED(sstr))
4633 =for apidoc sv_setsv_mg
4635 Like C<sv_setsv>, but also handles 'set' magic.
4641 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4643 sv_setsv(dstr,sstr);
4647 #ifdef PERL_COPY_ON_WRITE
4649 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4651 STRLEN cur = SvCUR(sstr);
4652 STRLEN len = SvLEN(sstr);
4653 register char *new_pv;
4656 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4664 if (SvTHINKFIRST(dstr))
4665 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4666 else if (SvPVX(dstr))
4667 Safefree(SvPVX(dstr));
4671 (void)SvUPGRADE (dstr, SVt_PVIV);
4673 assert (SvPOK(sstr));
4674 assert (SvPOKp(sstr));
4675 assert (!SvIOK(sstr));
4676 assert (!SvIOKp(sstr));
4677 assert (!SvNOK(sstr));
4678 assert (!SvNOKp(sstr));
4680 if (SvIsCOW(sstr)) {
4682 if (SvLEN(sstr) == 0) {
4683 /* source is a COW shared hash key. */
4684 UV hash = SvUVX(sstr);
4685 DEBUG_C(PerlIO_printf(Perl_debug_log,
4686 "Fast copy on write: Sharing hash\n"));
4687 SvUV_set(dstr, hash);
4688 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4691 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4693 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4694 (void)SvUPGRADE (sstr, SVt_PVIV);
4695 SvREADONLY_on(sstr);
4697 DEBUG_C(PerlIO_printf(Perl_debug_log,
4698 "Fast copy on write: Converting sstr to COW\n"));
4699 SV_COW_NEXT_SV_SET(dstr, sstr);
4701 SV_COW_NEXT_SV_SET(sstr, dstr);
4702 new_pv = SvPVX(sstr);
4705 SvPV_set(dstr, new_pv);
4706 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4709 SvLEN_set(dstr, len);
4710 SvCUR_set(dstr, cur);
4719 =for apidoc sv_setpvn
4721 Copies a string into an SV. The C<len> parameter indicates the number of
4722 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4723 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4729 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4731 register char *dptr;
4733 SV_CHECK_THINKFIRST_COW_DROP(sv);
4739 /* len is STRLEN which is unsigned, need to copy to signed */
4742 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4744 (void)SvUPGRADE(sv, SVt_PV);
4746 SvGROW(sv, len + 1);
4748 Move(ptr,dptr,len,char);
4751 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4756 =for apidoc sv_setpvn_mg
4758 Like C<sv_setpvn>, but also handles 'set' magic.
4764 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4766 sv_setpvn(sv,ptr,len);
4771 =for apidoc sv_setpv
4773 Copies a string into an SV. The string must be null-terminated. Does not
4774 handle 'set' magic. See C<sv_setpv_mg>.
4780 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4782 register STRLEN len;
4784 SV_CHECK_THINKFIRST_COW_DROP(sv);
4790 (void)SvUPGRADE(sv, SVt_PV);
4792 SvGROW(sv, len + 1);
4793 Move(ptr,SvPVX(sv),len+1,char);
4795 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4800 =for apidoc sv_setpv_mg
4802 Like C<sv_setpv>, but also handles 'set' magic.
4808 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4815 =for apidoc sv_usepvn
4817 Tells an SV to use C<ptr> to find its string value. Normally the string is
4818 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4819 The C<ptr> should point to memory that was allocated by C<malloc>. The
4820 string length, C<len>, must be supplied. This function will realloc the
4821 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4822 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4823 See C<sv_usepvn_mg>.
4829 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4831 SV_CHECK_THINKFIRST_COW_DROP(sv);
4832 (void)SvUPGRADE(sv, SVt_PV);
4839 Renew(ptr, len+1, char);
4842 SvLEN_set(sv, len+1);
4844 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4849 =for apidoc sv_usepvn_mg
4851 Like C<sv_usepvn>, but also handles 'set' magic.
4857 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4859 sv_usepvn(sv,ptr,len);
4863 #ifdef PERL_COPY_ON_WRITE
4864 /* Need to do this *after* making the SV normal, as we need the buffer
4865 pointer to remain valid until after we've copied it. If we let go too early,
4866 another thread could invalidate it by unsharing last of the same hash key
4867 (which it can do by means other than releasing copy-on-write Svs)
4868 or by changing the other copy-on-write SVs in the loop. */
4870 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4871 U32 hash, SV *after)
4873 if (len) { /* this SV was SvIsCOW_normal(sv) */
4874 /* we need to find the SV pointing to us. */
4875 SV *current = SV_COW_NEXT_SV(after);
4877 if (current == sv) {
4878 /* The SV we point to points back to us (there were only two of us
4880 Hence other SV is no longer copy on write either. */
4882 SvREADONLY_off(after);
4884 /* We need to follow the pointers around the loop. */
4886 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4889 /* don't loop forever if the structure is bust, and we have
4890 a pointer into a closed loop. */
4891 assert (current != after);
4892 assert (SvPVX(current) == pvx);
4894 /* Make the SV before us point to the SV after us. */
4895 SV_COW_NEXT_SV_SET(current, after);
4898 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4903 Perl_sv_release_IVX(pTHX_ register SV *sv)
4906 sv_force_normal_flags(sv, 0);
4912 =for apidoc sv_force_normal_flags
4914 Undo various types of fakery on an SV: if the PV is a shared string, make
4915 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4916 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4917 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4918 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4919 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4920 set to some other value.) In addition, the C<flags> parameter gets passed to
4921 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4922 with flags set to 0.
4928 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4930 #ifdef PERL_COPY_ON_WRITE
4931 if (SvREADONLY(sv)) {
4932 /* At this point I believe I should acquire a global SV mutex. */
4934 char *pvx = SvPVX(sv);
4935 STRLEN len = SvLEN(sv);
4936 STRLEN cur = SvCUR(sv);
4937 U32 hash = SvUVX(sv);
4938 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4940 PerlIO_printf(Perl_debug_log,
4941 "Copy on write: Force normal %ld\n",
4947 /* This SV doesn't own the buffer, so need to New() a new one: */
4948 SvPV_set(sv, (char*)0);
4950 if (flags & SV_COW_DROP_PV) {
4951 /* OK, so we don't need to copy our buffer. */
4954 SvGROW(sv, cur + 1);
4955 Move(pvx,SvPVX(sv),cur,char);
4959 sv_release_COW(sv, pvx, cur, len, hash, next);
4964 else if (IN_PERL_RUNTIME)
4965 Perl_croak(aTHX_ PL_no_modify);
4966 /* At this point I believe that I can drop the global SV mutex. */
4969 if (SvREADONLY(sv)) {
4971 char *pvx = SvPVX(sv);
4972 int is_utf8 = SvUTF8(sv);
4973 STRLEN len = SvCUR(sv);
4974 U32 hash = SvUVX(sv);
4977 SvPV_set(sv, (char*)0);
4979 SvGROW(sv, len + 1);
4980 Move(pvx,SvPVX(sv),len,char);
4982 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4984 else if (IN_PERL_RUNTIME)
4985 Perl_croak(aTHX_ PL_no_modify);
4989 sv_unref_flags(sv, flags);
4990 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4995 =for apidoc sv_force_normal
4997 Undo various types of fakery on an SV: if the PV is a shared string, make
4998 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4999 an xpvmg. See also C<sv_force_normal_flags>.
5005 Perl_sv_force_normal(pTHX_ register SV *sv)
5007 sv_force_normal_flags(sv, 0);
5013 Efficient removal of characters from the beginning of the string buffer.
5014 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5015 the string buffer. The C<ptr> becomes the first character of the adjusted
5016 string. Uses the "OOK hack".
5017 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
5018 refer to the same chunk of data.
5024 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
5026 register STRLEN delta;
5027 if (!ptr || !SvPOKp(sv))
5029 delta = ptr - SvPVX(sv);
5030 SV_CHECK_THINKFIRST(sv);
5031 if (SvTYPE(sv) < SVt_PVIV)
5032 sv_upgrade(sv,SVt_PVIV);
5035 if (!SvLEN(sv)) { /* make copy of shared string */
5036 char *pvx = SvPVX(sv);
5037 STRLEN len = SvCUR(sv);
5038 SvGROW(sv, len + 1);
5039 Move(pvx,SvPVX(sv),len,char);
5043 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5044 and we do that anyway inside the SvNIOK_off
5046 SvFLAGS(sv) |= SVf_OOK;
5049 SvLEN_set(sv, SvLEN(sv) - delta);
5050 SvCUR_set(sv, SvCUR(sv) - delta);
5051 SvPV_set(sv, SvPVX(sv) + delta);
5052 SvIV_set(sv, SvIVX(sv) + delta);
5055 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5056 * this function provided for binary compatibility only
5060 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5062 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5066 =for apidoc sv_catpvn
5068 Concatenates the string onto the end of the string which is in the SV. The
5069 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5070 status set, then the bytes appended should be valid UTF-8.
5071 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5073 =for apidoc sv_catpvn_flags
5075 Concatenates the string onto the end of the string which is in the SV. The
5076 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5077 status set, then the bytes appended should be valid UTF-8.
5078 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5079 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5080 in terms of this function.
5086 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5091 dstr = SvPV_force_flags(dsv, dlen, flags);
5092 SvGROW(dsv, dlen + slen + 1);
5095 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5096 SvCUR_set(dsv, SvCUR(dsv) + slen);
5098 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5103 =for apidoc sv_catpvn_mg
5105 Like C<sv_catpvn>, but also handles 'set' magic.
5111 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5113 sv_catpvn(sv,ptr,len);
5117 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5118 * this function provided for binary compatibility only
5122 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5124 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5128 =for apidoc sv_catsv
5130 Concatenates the string from SV C<ssv> onto the end of the string in
5131 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5132 not 'set' magic. See C<sv_catsv_mg>.
5134 =for apidoc sv_catsv_flags
5136 Concatenates the string from SV C<ssv> onto the end of the string in
5137 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5138 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5139 and C<sv_catsv_nomg> are implemented in terms of this function.
5144 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5150 if ((spv = SvPV(ssv, slen))) {
5151 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5152 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5153 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5154 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5155 dsv->sv_flags doesn't have that bit set.
5156 Andy Dougherty 12 Oct 2001
5158 I32 sutf8 = DO_UTF8(ssv);
5161 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5163 dutf8 = DO_UTF8(dsv);
5165 if (dutf8 != sutf8) {
5167 /* Not modifying source SV, so taking a temporary copy. */
5168 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5170 sv_utf8_upgrade(csv);
5171 spv = SvPV(csv, slen);
5174 sv_utf8_upgrade_nomg(dsv);
5176 sv_catpvn_nomg(dsv, spv, slen);
5181 =for apidoc sv_catsv_mg
5183 Like C<sv_catsv>, but also handles 'set' magic.
5189 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5196 =for apidoc sv_catpv
5198 Concatenates the string onto the end of the string which is in the SV.
5199 If the SV has the UTF-8 status set, then the bytes appended should be
5200 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5205 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5207 register STRLEN len;
5213 junk = SvPV_force(sv, tlen);
5215 SvGROW(sv, tlen + len + 1);
5218 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5219 SvCUR_set(sv, SvCUR(sv) + len);
5220 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5225 =for apidoc sv_catpv_mg
5227 Like C<sv_catpv>, but also handles 'set' magic.
5233 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5242 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5243 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5250 Perl_newSV(pTHX_ STRLEN len)
5256 sv_upgrade(sv, SVt_PV);
5257 SvGROW(sv, len + 1);
5262 =for apidoc sv_magicext
5264 Adds magic to an SV, upgrading it if necessary. Applies the
5265 supplied vtable and returns a pointer to the magic added.
5267 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5268 In particular, you can add magic to SvREADONLY SVs, and add more than
5269 one instance of the same 'how'.
5271 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5272 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5273 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5274 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5276 (This is now used as a subroutine by C<sv_magic>.)
5281 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5282 const char* name, I32 namlen)
5286 if (SvTYPE(sv) < SVt_PVMG) {
5287 (void)SvUPGRADE(sv, SVt_PVMG);
5289 Newz(702,mg, 1, MAGIC);
5290 mg->mg_moremagic = SvMAGIC(sv);
5291 SvMAGIC_set(sv, mg);
5293 /* Sometimes a magic contains a reference loop, where the sv and
5294 object refer to each other. To prevent a reference loop that
5295 would prevent such objects being freed, we look for such loops
5296 and if we find one we avoid incrementing the object refcount.
5298 Note we cannot do this to avoid self-tie loops as intervening RV must
5299 have its REFCNT incremented to keep it in existence.
5302 if (!obj || obj == sv ||
5303 how == PERL_MAGIC_arylen ||
5304 how == PERL_MAGIC_qr ||
5305 (SvTYPE(obj) == SVt_PVGV &&
5306 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5307 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5308 GvFORM(obj) == (CV*)sv)))
5313 mg->mg_obj = SvREFCNT_inc(obj);
5314 mg->mg_flags |= MGf_REFCOUNTED;
5317 /* Normal self-ties simply pass a null object, and instead of
5318 using mg_obj directly, use the SvTIED_obj macro to produce a
5319 new RV as needed. For glob "self-ties", we are tieing the PVIO
5320 with an RV obj pointing to the glob containing the PVIO. In
5321 this case, to avoid a reference loop, we need to weaken the
5325 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5326 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5332 mg->mg_len = namlen;
5335 mg->mg_ptr = savepvn(name, namlen);
5336 else if (namlen == HEf_SVKEY)
5337 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5339 mg->mg_ptr = (char *) name;
5341 mg->mg_virtual = vtable;
5345 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5350 =for apidoc sv_magic
5352 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5353 then adds a new magic item of type C<how> to the head of the magic list.
5355 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5356 handling of the C<name> and C<namlen> arguments.
5358 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5359 to add more than one instance of the same 'how'.
5365 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5367 const MGVTBL *vtable = 0;
5370 #ifdef PERL_COPY_ON_WRITE
5372 sv_force_normal_flags(sv, 0);
5374 if (SvREADONLY(sv)) {
5376 && how != PERL_MAGIC_regex_global
5377 && how != PERL_MAGIC_bm
5378 && how != PERL_MAGIC_fm
5379 && how != PERL_MAGIC_sv
5380 && how != PERL_MAGIC_backref
5383 Perl_croak(aTHX_ PL_no_modify);
5386 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5387 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5388 /* sv_magic() refuses to add a magic of the same 'how' as an
5391 if (how == PERL_MAGIC_taint)
5399 vtable = &PL_vtbl_sv;
5401 case PERL_MAGIC_overload:
5402 vtable = &PL_vtbl_amagic;
5404 case PERL_MAGIC_overload_elem:
5405 vtable = &PL_vtbl_amagicelem;
5407 case PERL_MAGIC_overload_table:
5408 vtable = &PL_vtbl_ovrld;
5411 vtable = &PL_vtbl_bm;
5413 case PERL_MAGIC_regdata:
5414 vtable = &PL_vtbl_regdata;
5416 case PERL_MAGIC_regdatum:
5417 vtable = &PL_vtbl_regdatum;
5419 case PERL_MAGIC_env:
5420 vtable = &PL_vtbl_env;
5423 vtable = &PL_vtbl_fm;
5425 case PERL_MAGIC_envelem:
5426 vtable = &PL_vtbl_envelem;
5428 case PERL_MAGIC_regex_global:
5429 vtable = &PL_vtbl_mglob;
5431 case PERL_MAGIC_isa:
5432 vtable = &PL_vtbl_isa;
5434 case PERL_MAGIC_isaelem:
5435 vtable = &PL_vtbl_isaelem;
5437 case PERL_MAGIC_nkeys:
5438 vtable = &PL_vtbl_nkeys;
5440 case PERL_MAGIC_dbfile:
5443 case PERL_MAGIC_dbline:
5444 vtable = &PL_vtbl_dbline;
5446 #ifdef USE_LOCALE_COLLATE
5447 case PERL_MAGIC_collxfrm:
5448 vtable = &PL_vtbl_collxfrm;
5450 #endif /* USE_LOCALE_COLLATE */
5451 case PERL_MAGIC_tied:
5452 vtable = &PL_vtbl_pack;
5454 case PERL_MAGIC_tiedelem:
5455 case PERL_MAGIC_tiedscalar:
5456 vtable = &PL_vtbl_packelem;
5459 vtable = &PL_vtbl_regexp;
5461 case PERL_MAGIC_sig:
5462 vtable = &PL_vtbl_sig;
5464 case PERL_MAGIC_sigelem:
5465 vtable = &PL_vtbl_sigelem;
5467 case PERL_MAGIC_taint:
5468 vtable = &PL_vtbl_taint;
5470 case PERL_MAGIC_uvar:
5471 vtable = &PL_vtbl_uvar;
5473 case PERL_MAGIC_vec:
5474 vtable = &PL_vtbl_vec;
5476 case PERL_MAGIC_vstring:
5479 case PERL_MAGIC_utf8:
5480 vtable = &PL_vtbl_utf8;
5482 case PERL_MAGIC_substr:
5483 vtable = &PL_vtbl_substr;
5485 case PERL_MAGIC_defelem:
5486 vtable = &PL_vtbl_defelem;
5488 case PERL_MAGIC_glob:
5489 vtable = &PL_vtbl_glob;
5491 case PERL_MAGIC_arylen:
5492 vtable = &PL_vtbl_arylen;
5494 case PERL_MAGIC_pos:
5495 vtable = &PL_vtbl_pos;
5497 case PERL_MAGIC_backref:
5498 vtable = &PL_vtbl_backref;
5500 case PERL_MAGIC_ext:
5501 /* Reserved for use by extensions not perl internals. */
5502 /* Useful for attaching extension internal data to perl vars. */
5503 /* Note that multiple extensions may clash if magical scalars */
5504 /* etc holding private data from one are passed to another. */
5507 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5510 /* Rest of work is done else where */
5511 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5514 case PERL_MAGIC_taint:
5517 case PERL_MAGIC_ext:
5518 case PERL_MAGIC_dbfile:
5525 =for apidoc sv_unmagic
5527 Removes all magic of type C<type> from an SV.
5533 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5537 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5540 for (mg = *mgp; mg; mg = *mgp) {
5541 if (mg->mg_type == type) {
5542 const MGVTBL* const vtbl = mg->mg_virtual;
5543 *mgp = mg->mg_moremagic;
5544 if (vtbl && vtbl->svt_free)
5545 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5546 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5548 Safefree(mg->mg_ptr);
5549 else if (mg->mg_len == HEf_SVKEY)
5550 SvREFCNT_dec((SV*)mg->mg_ptr);
5551 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5552 Safefree(mg->mg_ptr);
5554 if (mg->mg_flags & MGf_REFCOUNTED)
5555 SvREFCNT_dec(mg->mg_obj);
5559 mgp = &mg->mg_moremagic;
5563 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5570 =for apidoc sv_rvweaken
5572 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5573 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5574 push a back-reference to this RV onto the array of backreferences
5575 associated with that magic.
5581 Perl_sv_rvweaken(pTHX_ SV *sv)
5584 if (!SvOK(sv)) /* let undefs pass */
5587 Perl_croak(aTHX_ "Can't weaken a nonreference");
5588 else if (SvWEAKREF(sv)) {
5589 if (ckWARN(WARN_MISC))
5590 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5594 sv_add_backref(tsv, sv);
5600 /* Give tsv backref magic if it hasn't already got it, then push a
5601 * back-reference to sv onto the array associated with the backref magic.
5605 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5609 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5610 av = (AV*)mg->mg_obj;
5613 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5614 /* av now has a refcnt of 2, which avoids it getting freed
5615 * before us during global cleanup. The extra ref is removed
5616 * by magic_killbackrefs() when tsv is being freed */
5618 if (AvFILLp(av) >= AvMAX(av)) {
5620 SV **svp = AvARRAY(av);
5621 for (i = AvFILLp(av); i >= 0; i--)
5623 svp[i] = sv; /* reuse the slot */
5626 av_extend(av, AvFILLp(av)+1);
5628 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5631 /* delete a back-reference to ourselves from the backref magic associated
5632 * with the SV we point to.
5636 S_sv_del_backref(pTHX_ SV *sv)
5643 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5644 Perl_croak(aTHX_ "panic: del_backref");
5645 av = (AV *)mg->mg_obj;
5647 for (i = AvFILLp(av); i >= 0; i--)
5648 if (svp[i] == sv) svp[i] = Nullsv;
5652 =for apidoc sv_insert
5654 Inserts a string at the specified offset/length within the SV. Similar to
5655 the Perl substr() function.
5661 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5665 register char *midend;
5666 register char *bigend;
5672 Perl_croak(aTHX_ "Can't modify non-existent substring");
5673 SvPV_force(bigstr, curlen);
5674 (void)SvPOK_only_UTF8(bigstr);
5675 if (offset + len > curlen) {
5676 SvGROW(bigstr, offset+len+1);
5677 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5678 SvCUR_set(bigstr, offset+len);
5682 i = littlelen - len;
5683 if (i > 0) { /* string might grow */
5684 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5685 mid = big + offset + len;
5686 midend = bigend = big + SvCUR(bigstr);
5689 while (midend > mid) /* shove everything down */
5690 *--bigend = *--midend;
5691 Move(little,big+offset,littlelen,char);
5692 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5697 Move(little,SvPVX(bigstr)+offset,len,char);
5702 big = SvPVX(bigstr);
5705 bigend = big + SvCUR(bigstr);
5707 if (midend > bigend)
5708 Perl_croak(aTHX_ "panic: sv_insert");
5710 if (mid - big > bigend - midend) { /* faster to shorten from end */
5712 Move(little, mid, littlelen,char);
5715 i = bigend - midend;
5717 Move(midend, mid, i,char);
5721 SvCUR_set(bigstr, mid - big);
5724 else if ((i = mid - big)) { /* faster from front */
5725 midend -= littlelen;
5727 sv_chop(bigstr,midend-i);
5732 Move(little, mid, littlelen,char);
5734 else if (littlelen) {
5735 midend -= littlelen;
5736 sv_chop(bigstr,midend);
5737 Move(little,midend,littlelen,char);
5740 sv_chop(bigstr,midend);
5746 =for apidoc sv_replace
5748 Make the first argument a copy of the second, then delete the original.
5749 The target SV physically takes over ownership of the body of the source SV
5750 and inherits its flags; however, the target keeps any magic it owns,
5751 and any magic in the source is discarded.
5752 Note that this is a rather specialist SV copying operation; most of the
5753 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5759 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5761 U32 refcnt = SvREFCNT(sv);
5762 SV_CHECK_THINKFIRST_COW_DROP(sv);
5763 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5764 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5765 if (SvMAGICAL(sv)) {
5769 sv_upgrade(nsv, SVt_PVMG);
5770 SvMAGIC_set(nsv, SvMAGIC(sv));
5771 SvFLAGS(nsv) |= SvMAGICAL(sv);
5773 SvMAGIC_set(sv, NULL);
5777 assert(!SvREFCNT(sv));
5778 #ifdef DEBUG_LEAKING_SCALARS
5779 sv->sv_flags = nsv->sv_flags;
5780 sv->sv_any = nsv->sv_any;
5781 sv->sv_refcnt = nsv->sv_refcnt;
5783 StructCopy(nsv,sv,SV);
5786 #ifdef PERL_COPY_ON_WRITE
5787 if (SvIsCOW_normal(nsv)) {
5788 /* We need to follow the pointers around the loop to make the
5789 previous SV point to sv, rather than nsv. */
5792 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5795 assert(SvPVX(current) == SvPVX(nsv));
5797 /* Make the SV before us point to the SV after us. */
5799 PerlIO_printf(Perl_debug_log, "previous is\n");
5801 PerlIO_printf(Perl_debug_log,
5802 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5803 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5805 SV_COW_NEXT_SV_SET(current, sv);
5808 SvREFCNT(sv) = refcnt;
5809 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5815 =for apidoc sv_clear
5817 Clear an SV: call any destructors, free up any memory used by the body,
5818 and free the body itself. The SV's head is I<not> freed, although
5819 its type is set to all 1's so that it won't inadvertently be assumed
5820 to be live during global destruction etc.
5821 This function should only be called when REFCNT is zero. Most of the time
5822 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5829 Perl_sv_clear(pTHX_ register SV *sv)
5834 assert(SvREFCNT(sv) == 0);
5837 if (PL_defstash) { /* Still have a symbol table? */
5844 stash = SvSTASH(sv);
5845 destructor = StashHANDLER(stash,DESTROY);
5847 SV* tmpref = newRV(sv);
5848 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5850 PUSHSTACKi(PERLSI_DESTROY);
5855 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5861 if(SvREFCNT(tmpref) < 2) {
5862 /* tmpref is not kept alive! */
5864 SvRV_set(tmpref, NULL);
5867 SvREFCNT_dec(tmpref);
5869 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5873 if (PL_in_clean_objs)
5874 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5876 /* DESTROY gave object new lease on life */
5882 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5883 SvOBJECT_off(sv); /* Curse the object. */
5884 if (SvTYPE(sv) != SVt_PVIO)
5885 --PL_sv_objcount; /* XXX Might want something more general */
5888 if (SvTYPE(sv) >= SVt_PVMG) {
5891 if (SvFLAGS(sv) & SVpad_TYPED)
5892 SvREFCNT_dec(SvSTASH(sv));
5895 switch (SvTYPE(sv)) {
5898 IoIFP(sv) != PerlIO_stdin() &&
5899 IoIFP(sv) != PerlIO_stdout() &&
5900 IoIFP(sv) != PerlIO_stderr())
5902 io_close((IO*)sv, FALSE);
5904 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5905 PerlDir_close(IoDIRP(sv));
5906 IoDIRP(sv) = (DIR*)NULL;
5907 Safefree(IoTOP_NAME(sv));
5908 Safefree(IoFMT_NAME(sv));
5909 Safefree(IoBOTTOM_NAME(sv));
5924 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5925 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5926 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5927 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5929 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5930 SvREFCNT_dec(LvTARG(sv));
5934 Safefree(GvNAME(sv));
5935 /* cannot decrease stash refcount yet, as we might recursively delete
5936 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5937 of stash until current sv is completely gone.
5938 -- JohnPC, 27 Mar 1998 */
5939 stash = GvSTASH(sv);
5945 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5947 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5948 /* Don't even bother with turning off the OOK flag. */
5957 SvREFCNT_dec(SvRV(sv));
5959 #ifdef PERL_COPY_ON_WRITE
5960 else if (SvPVX(sv)) {
5962 /* I believe I need to grab the global SV mutex here and
5963 then recheck the COW status. */
5965 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5968 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5969 SvUVX(sv), SV_COW_NEXT_SV(sv));
5970 /* And drop it here. */
5972 } else if (SvLEN(sv)) {
5973 Safefree(SvPVX(sv));
5977 else if (SvPVX(sv) && SvLEN(sv))
5978 Safefree(SvPVX(sv));
5979 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5980 unsharepvn(SvPVX(sv),
5981 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5995 switch (SvTYPE(sv)) {
6011 del_XPVIV(SvANY(sv));
6014 del_XPVNV(SvANY(sv));
6017 del_XPVMG(SvANY(sv));
6020 del_XPVLV(SvANY(sv));
6023 del_XPVAV(SvANY(sv));
6026 del_XPVHV(SvANY(sv));
6029 del_XPVCV(SvANY(sv));
6032 del_XPVGV(SvANY(sv));
6033 /* code duplication for increased performance. */
6034 SvFLAGS(sv) &= SVf_BREAK;
6035 SvFLAGS(sv) |= SVTYPEMASK;
6036 /* decrease refcount of the stash that owns this GV, if any */
6038 SvREFCNT_dec(stash);
6039 return; /* not break, SvFLAGS reset already happened */
6041 del_XPVBM(SvANY(sv));
6044 del_XPVFM(SvANY(sv));
6047 del_XPVIO(SvANY(sv));
6050 SvFLAGS(sv) &= SVf_BREAK;
6051 SvFLAGS(sv) |= SVTYPEMASK;
6055 =for apidoc sv_newref
6057 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6064 Perl_sv_newref(pTHX_ SV *sv)
6074 Decrement an SV's reference count, and if it drops to zero, call
6075 C<sv_clear> to invoke destructors and free up any memory used by
6076 the body; finally, deallocate the SV's head itself.
6077 Normally called via a wrapper macro C<SvREFCNT_dec>.
6083 Perl_sv_free(pTHX_ SV *sv)
6088 if (SvREFCNT(sv) == 0) {
6089 if (SvFLAGS(sv) & SVf_BREAK)
6090 /* this SV's refcnt has been artificially decremented to
6091 * trigger cleanup */
6093 if (PL_in_clean_all) /* All is fair */
6095 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6096 /* make sure SvREFCNT(sv)==0 happens very seldom */
6097 SvREFCNT(sv) = (~(U32)0)/2;
6100 if (ckWARN_d(WARN_INTERNAL))
6101 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6102 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6103 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6106 if (--(SvREFCNT(sv)) > 0)
6108 Perl_sv_free2(aTHX_ sv);
6112 Perl_sv_free2(pTHX_ SV *sv)
6117 if (ckWARN_d(WARN_DEBUGGING))
6118 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6119 "Attempt to free temp prematurely: SV 0x%"UVxf
6120 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6124 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6125 /* make sure SvREFCNT(sv)==0 happens very seldom */
6126 SvREFCNT(sv) = (~(U32)0)/2;
6137 Returns the length of the string in the SV. Handles magic and type
6138 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6144 Perl_sv_len(pTHX_ register SV *sv)
6152 len = mg_length(sv);
6154 (void)SvPV(sv, len);
6159 =for apidoc sv_len_utf8
6161 Returns the number of characters in the string in an SV, counting wide
6162 UTF-8 bytes as a single character. Handles magic and type coercion.
6168 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6169 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6170 * (Note that the mg_len is not the length of the mg_ptr field.)
6175 Perl_sv_len_utf8(pTHX_ register SV *sv)
6181 return mg_length(sv);
6185 U8 *s = (U8*)SvPV(sv, len);
6186 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6188 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6190 #ifdef PERL_UTF8_CACHE_ASSERT
6191 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6195 ulen = Perl_utf8_length(aTHX_ s, s + len);
6196 if (!mg && !SvREADONLY(sv)) {
6197 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6198 mg = mg_find(sv, PERL_MAGIC_utf8);
6208 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6209 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6210 * between UTF-8 and byte offsets. There are two (substr offset and substr
6211 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6212 * and byte offset) cache positions.
6214 * The mg_len field is used by sv_len_utf8(), see its comments.
6215 * Note that the mg_len is not the length of the mg_ptr field.
6219 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
6223 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6225 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6229 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6231 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6232 (*mgp)->mg_ptr = (char *) *cachep;
6236 (*cachep)[i] = *offsetp;
6237 (*cachep)[i+1] = s - start;
6245 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6246 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6247 * between UTF-8 and byte offsets. See also the comments of
6248 * S_utf8_mg_pos_init().
6252 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6256 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6258 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6259 if (*mgp && (*mgp)->mg_ptr) {
6260 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6261 ASSERT_UTF8_CACHE(*cachep);
6262 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6264 else { /* We will skip to the right spot. */
6269 /* The assumption is that going backward is half
6270 * the speed of going forward (that's where the
6271 * 2 * backw in the below comes from). (The real
6272 * figure of course depends on the UTF-8 data.) */
6274 if ((*cachep)[i] > (STRLEN)uoff) {
6276 backw = (*cachep)[i] - (STRLEN)uoff;
6278 if (forw < 2 * backw)
6281 p = start + (*cachep)[i+1];
6283 /* Try this only for the substr offset (i == 0),
6284 * not for the substr length (i == 2). */
6285 else if (i == 0) { /* (*cachep)[i] < uoff */
6286 STRLEN ulen = sv_len_utf8(sv);
6288 if ((STRLEN)uoff < ulen) {
6289 forw = (STRLEN)uoff - (*cachep)[i];
6290 backw = ulen - (STRLEN)uoff;
6292 if (forw < 2 * backw)
6293 p = start + (*cachep)[i+1];
6298 /* If the string is not long enough for uoff,
6299 * we could extend it, but not at this low a level. */
6303 if (forw < 2 * backw) {
6310 while (UTF8_IS_CONTINUATION(*p))
6315 /* Update the cache. */
6316 (*cachep)[i] = (STRLEN)uoff;
6317 (*cachep)[i+1] = p - start;
6319 /* Drop the stale "length" cache */
6328 if (found) { /* Setup the return values. */
6329 *offsetp = (*cachep)[i+1];
6330 *sp = start + *offsetp;
6333 *offsetp = send - start;
6335 else if (*sp < start) {
6341 #ifdef PERL_UTF8_CACHE_ASSERT
6346 while (n-- && s < send)
6350 assert(*offsetp == s - start);
6351 assert((*cachep)[0] == (STRLEN)uoff);
6352 assert((*cachep)[1] == *offsetp);
6354 ASSERT_UTF8_CACHE(*cachep);
6363 =for apidoc sv_pos_u2b
6365 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6366 the start of the string, to a count of the equivalent number of bytes; if
6367 lenp is non-zero, it does the same to lenp, but this time starting from
6368 the offset, rather than from the start of the string. Handles magic and
6375 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6376 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6377 * byte offsets. See also the comments of S_utf8_mg_pos().
6382 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6393 start = s = (U8*)SvPV(sv, len);
6395 I32 uoffset = *offsetp;
6400 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6402 if (!found && uoffset > 0) {
6403 while (s < send && uoffset--)
6407 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
6409 *offsetp = s - start;
6414 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6418 if (!found && *lenp > 0) {
6421 while (s < send && ulen--)
6425 utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start);
6429 ASSERT_UTF8_CACHE(cache);
6441 =for apidoc sv_pos_b2u
6443 Converts the value pointed to by offsetp from a count of bytes from the
6444 start of the string, to a count of the equivalent number of UTF-8 chars.
6445 Handles magic and type coercion.
6451 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6452 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6453 * byte offsets. See also the comments of S_utf8_mg_pos().
6458 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6466 s = (U8*)SvPV(sv, len);
6467 if ((I32)len < *offsetp)
6468 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6470 U8* send = s + *offsetp;
6472 STRLEN *cache = NULL;
6476 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6477 mg = mg_find(sv, PERL_MAGIC_utf8);
6478 if (mg && mg->mg_ptr) {
6479 cache = (STRLEN *) mg->mg_ptr;
6480 if (cache[1] == (STRLEN)*offsetp) {
6481 /* An exact match. */
6482 *offsetp = cache[0];
6486 else if (cache[1] < (STRLEN)*offsetp) {
6487 /* We already know part of the way. */
6490 /* Let the below loop do the rest. */
6492 else { /* cache[1] > *offsetp */
6493 /* We already know all of the way, now we may
6494 * be able to walk back. The same assumption
6495 * is made as in S_utf8_mg_pos(), namely that
6496 * walking backward is twice slower than
6497 * walking forward. */
6498 STRLEN forw = *offsetp;
6499 STRLEN backw = cache[1] - *offsetp;
6501 if (!(forw < 2 * backw)) {
6502 U8 *p = s + cache[1];
6509 while (UTF8_IS_CONTINUATION(*p)) {
6517 *offsetp = cache[0];
6519 /* Drop the stale "length" cache */
6527 ASSERT_UTF8_CACHE(cache);
6533 /* Call utf8n_to_uvchr() to validate the sequence
6534 * (unless a simple non-UTF character) */
6535 if (!UTF8_IS_INVARIANT(*s))
6536 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6545 if (!SvREADONLY(sv)) {
6547 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6548 mg = mg_find(sv, PERL_MAGIC_utf8);
6553 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6554 mg->mg_ptr = (char *) cache;
6559 cache[1] = *offsetp;
6560 /* Drop the stale "length" cache */
6573 Returns a boolean indicating whether the strings in the two SVs are
6574 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6575 coerce its args to strings if necessary.
6581 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6589 SV* svrecode = Nullsv;
6596 pv1 = SvPV(sv1, cur1);
6603 pv2 = SvPV(sv2, cur2);
6605 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6606 /* Differing utf8ness.
6607 * Do not UTF8size the comparands as a side-effect. */
6610 svrecode = newSVpvn(pv2, cur2);
6611 sv_recode_to_utf8(svrecode, PL_encoding);
6612 pv2 = SvPV(svrecode, cur2);
6615 svrecode = newSVpvn(pv1, cur1);
6616 sv_recode_to_utf8(svrecode, PL_encoding);
6617 pv1 = SvPV(svrecode, cur1);
6619 /* Now both are in UTF-8. */
6621 SvREFCNT_dec(svrecode);
6626 bool is_utf8 = TRUE;
6629 /* sv1 is the UTF-8 one,
6630 * if is equal it must be downgrade-able */
6631 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6637 /* sv2 is the UTF-8 one,
6638 * if is equal it must be downgrade-able */
6639 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6645 /* Downgrade not possible - cannot be eq */
6653 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6656 SvREFCNT_dec(svrecode);
6667 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6668 string in C<sv1> is less than, equal to, or greater than the string in
6669 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6670 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6676 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6679 const char *pv1, *pv2;
6682 SV *svrecode = Nullsv;
6689 pv1 = SvPV(sv1, cur1);
6696 pv2 = SvPV(sv2, cur2);
6698 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6699 /* Differing utf8ness.
6700 * Do not UTF8size the comparands as a side-effect. */
6703 svrecode = newSVpvn(pv2, cur2);
6704 sv_recode_to_utf8(svrecode, PL_encoding);
6705 pv2 = SvPV(svrecode, cur2);
6708 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6713 svrecode = newSVpvn(pv1, cur1);
6714 sv_recode_to_utf8(svrecode, PL_encoding);
6715 pv1 = SvPV(svrecode, cur1);
6718 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6724 cmp = cur2 ? -1 : 0;
6728 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6731 cmp = retval < 0 ? -1 : 1;
6732 } else if (cur1 == cur2) {
6735 cmp = cur1 < cur2 ? -1 : 1;
6740 SvREFCNT_dec(svrecode);
6749 =for apidoc sv_cmp_locale
6751 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6752 'use bytes' aware, handles get magic, and will coerce its args to strings
6753 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6759 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6761 #ifdef USE_LOCALE_COLLATE
6767 if (PL_collation_standard)
6771 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6773 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6775 if (!pv1 || !len1) {
6786 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6789 return retval < 0 ? -1 : 1;
6792 * When the result of collation is equality, that doesn't mean
6793 * that there are no differences -- some locales exclude some
6794 * characters from consideration. So to avoid false equalities,
6795 * we use the raw string as a tiebreaker.
6801 #endif /* USE_LOCALE_COLLATE */
6803 return sv_cmp(sv1, sv2);
6807 #ifdef USE_LOCALE_COLLATE
6810 =for apidoc sv_collxfrm
6812 Add Collate Transform magic to an SV if it doesn't already have it.
6814 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6815 scalar data of the variable, but transformed to such a format that a normal
6816 memory comparison can be used to compare the data according to the locale
6823 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6827 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6828 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6833 Safefree(mg->mg_ptr);
6835 if ((xf = mem_collxfrm(s, len, &xlen))) {
6836 if (SvREADONLY(sv)) {
6839 return xf + sizeof(PL_collation_ix);
6842 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6843 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6856 if (mg && mg->mg_ptr) {
6858 return mg->mg_ptr + sizeof(PL_collation_ix);
6866 #endif /* USE_LOCALE_COLLATE */
6871 Get a line from the filehandle and store it into the SV, optionally
6872 appending to the currently-stored string.
6878 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6882 register STDCHAR rslast;
6883 register STDCHAR *bp;
6889 if (SvTHINKFIRST(sv))
6890 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6891 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6893 However, perlbench says it's slower, because the existing swipe code
6894 is faster than copy on write.
6895 Swings and roundabouts. */
6896 (void)SvUPGRADE(sv, SVt_PV);
6901 if (PerlIO_isutf8(fp)) {
6903 sv_utf8_upgrade_nomg(sv);
6904 sv_pos_u2b(sv,&append,0);
6906 } else if (SvUTF8(sv)) {
6907 SV *tsv = NEWSV(0,0);
6908 sv_gets(tsv, fp, 0);
6909 sv_utf8_upgrade_nomg(tsv);
6910 SvCUR_set(sv,append);
6913 goto return_string_or_null;
6918 if (PerlIO_isutf8(fp))
6921 if (IN_PERL_COMPILETIME) {
6922 /* we always read code in line mode */
6926 else if (RsSNARF(PL_rs)) {
6927 /* If it is a regular disk file use size from stat() as estimate
6928 of amount we are going to read - may result in malloc-ing
6929 more memory than we realy need if layers bellow reduce
6930 size we read (e.g. CRLF or a gzip layer)
6933 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6934 Off_t offset = PerlIO_tell(fp);
6935 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6936 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6942 else if (RsRECORD(PL_rs)) {
6946 /* Grab the size of the record we're getting */
6947 recsize = SvIV(SvRV(PL_rs));
6948 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6951 /* VMS wants read instead of fread, because fread doesn't respect */
6952 /* RMS record boundaries. This is not necessarily a good thing to be */
6953 /* doing, but we've got no other real choice - except avoid stdio
6954 as implementation - perhaps write a :vms layer ?
6956 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6958 bytesread = PerlIO_read(fp, buffer, recsize);
6962 SvCUR_set(sv, bytesread += append);
6963 buffer[bytesread] = '\0';
6964 goto return_string_or_null;
6966 else if (RsPARA(PL_rs)) {
6972 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6973 if (PerlIO_isutf8(fp)) {
6974 rsptr = SvPVutf8(PL_rs, rslen);
6977 if (SvUTF8(PL_rs)) {
6978 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6979 Perl_croak(aTHX_ "Wide character in $/");
6982 rsptr = SvPV(PL_rs, rslen);
6986 rslast = rslen ? rsptr[rslen - 1] : '\0';
6988 if (rspara) { /* have to do this both before and after */
6989 do { /* to make sure file boundaries work right */
6992 i = PerlIO_getc(fp);
6996 PerlIO_ungetc(fp,i);
7002 /* See if we know enough about I/O mechanism to cheat it ! */
7004 /* This used to be #ifdef test - it is made run-time test for ease
7005 of abstracting out stdio interface. One call should be cheap
7006 enough here - and may even be a macro allowing compile
7010 if (PerlIO_fast_gets(fp)) {
7013 * We're going to steal some values from the stdio struct
7014 * and put EVERYTHING in the innermost loop into registers.
7016 register STDCHAR *ptr;
7020 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7021 /* An ungetc()d char is handled separately from the regular
7022 * buffer, so we getc() it back out and stuff it in the buffer.
7024 i = PerlIO_getc(fp);
7025 if (i == EOF) return 0;
7026 *(--((*fp)->_ptr)) = (unsigned char) i;
7030 /* Here is some breathtakingly efficient cheating */
7032 cnt = PerlIO_get_cnt(fp); /* get count into register */
7033 /* make sure we have the room */
7034 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7035 /* Not room for all of it
7036 if we are looking for a separator and room for some
7038 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7039 /* just process what we have room for */
7040 shortbuffered = cnt - SvLEN(sv) + append + 1;
7041 cnt -= shortbuffered;
7045 /* remember that cnt can be negative */
7046 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7051 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7052 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7053 DEBUG_P(PerlIO_printf(Perl_debug_log,
7054 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7055 DEBUG_P(PerlIO_printf(Perl_debug_log,
7056 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7057 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7058 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7063 while (cnt > 0) { /* this | eat */
7065 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7066 goto thats_all_folks; /* screams | sed :-) */
7070 Copy(ptr, bp, cnt, char); /* this | eat */
7071 bp += cnt; /* screams | dust */
7072 ptr += cnt; /* louder | sed :-) */
7077 if (shortbuffered) { /* oh well, must extend */
7078 cnt = shortbuffered;
7080 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7082 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7083 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7087 DEBUG_P(PerlIO_printf(Perl_debug_log,
7088 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7089 PTR2UV(ptr),(long)cnt));
7090 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7092 DEBUG_P(PerlIO_printf(Perl_debug_log,
7093 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7094 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7095 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7097 /* This used to call 'filbuf' in stdio form, but as that behaves like
7098 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7099 another abstraction. */
7100 i = PerlIO_getc(fp); /* get more characters */
7102 DEBUG_P(PerlIO_printf(Perl_debug_log,
7103 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7104 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7105 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7107 cnt = PerlIO_get_cnt(fp);
7108 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7109 DEBUG_P(PerlIO_printf(Perl_debug_log,
7110 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7112 if (i == EOF) /* all done for ever? */
7113 goto thats_really_all_folks;
7115 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7117 SvGROW(sv, bpx + cnt + 2);
7118 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7120 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7122 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7123 goto thats_all_folks;
7127 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7128 memNE((char*)bp - rslen, rsptr, rslen))
7129 goto screamer; /* go back to the fray */
7130 thats_really_all_folks:
7132 cnt += shortbuffered;
7133 DEBUG_P(PerlIO_printf(Perl_debug_log,
7134 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7135 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7136 DEBUG_P(PerlIO_printf(Perl_debug_log,
7137 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7138 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7139 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7141 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7142 DEBUG_P(PerlIO_printf(Perl_debug_log,
7143 "Screamer: done, len=%ld, string=|%.*s|\n",
7144 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7148 /*The big, slow, and stupid way. */
7149 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7151 New(0, buf, 8192, STDCHAR);
7159 const register STDCHAR *bpe = buf + sizeof(buf);
7161 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7162 ; /* keep reading */
7166 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7167 /* Accomodate broken VAXC compiler, which applies U8 cast to
7168 * both args of ?: operator, causing EOF to change into 255
7171 i = (U8)buf[cnt - 1];
7177 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7179 sv_catpvn(sv, (char *) buf, cnt);
7181 sv_setpvn(sv, (char *) buf, cnt);
7183 if (i != EOF && /* joy */
7185 SvCUR(sv) < rslen ||
7186 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7190 * If we're reading from a TTY and we get a short read,
7191 * indicating that the user hit his EOF character, we need
7192 * to notice it now, because if we try to read from the TTY
7193 * again, the EOF condition will disappear.
7195 * The comparison of cnt to sizeof(buf) is an optimization
7196 * that prevents unnecessary calls to feof().
7200 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7204 #ifdef USE_HEAP_INSTEAD_OF_STACK
7209 if (rspara) { /* have to do this both before and after */
7210 while (i != EOF) { /* to make sure file boundaries work right */
7211 i = PerlIO_getc(fp);
7213 PerlIO_ungetc(fp,i);
7219 return_string_or_null:
7220 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7226 Auto-increment of the value in the SV, doing string to numeric conversion
7227 if necessary. Handles 'get' magic.
7233 Perl_sv_inc(pTHX_ register SV *sv)
7242 if (SvTHINKFIRST(sv)) {
7244 sv_force_normal_flags(sv, 0);
7245 if (SvREADONLY(sv)) {
7246 if (IN_PERL_RUNTIME)
7247 Perl_croak(aTHX_ PL_no_modify);
7251 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7253 i = PTR2IV(SvRV(sv));
7258 flags = SvFLAGS(sv);
7259 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7260 /* It's (privately or publicly) a float, but not tested as an
7261 integer, so test it to see. */
7263 flags = SvFLAGS(sv);
7265 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7266 /* It's publicly an integer, or privately an integer-not-float */
7267 #ifdef PERL_PRESERVE_IVUV
7271 if (SvUVX(sv) == UV_MAX)
7272 sv_setnv(sv, UV_MAX_P1);
7274 (void)SvIOK_only_UV(sv);
7275 SvUV_set(sv, SvUVX(sv) + 1);
7277 if (SvIVX(sv) == IV_MAX)
7278 sv_setuv(sv, (UV)IV_MAX + 1);
7280 (void)SvIOK_only(sv);
7281 SvIV_set(sv, SvIVX(sv) + 1);
7286 if (flags & SVp_NOK) {
7287 (void)SvNOK_only(sv);
7288 SvNV_set(sv, SvNVX(sv) + 1.0);
7292 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7293 if ((flags & SVTYPEMASK) < SVt_PVIV)
7294 sv_upgrade(sv, SVt_IV);
7295 (void)SvIOK_only(sv);
7300 while (isALPHA(*d)) d++;
7301 while (isDIGIT(*d)) d++;
7303 #ifdef PERL_PRESERVE_IVUV
7304 /* Got to punt this as an integer if needs be, but we don't issue
7305 warnings. Probably ought to make the sv_iv_please() that does
7306 the conversion if possible, and silently. */
7307 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7308 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7309 /* Need to try really hard to see if it's an integer.
7310 9.22337203685478e+18 is an integer.
7311 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7312 so $a="9.22337203685478e+18"; $a+0; $a++
7313 needs to be the same as $a="9.22337203685478e+18"; $a++
7320 /* sv_2iv *should* have made this an NV */
7321 if (flags & SVp_NOK) {
7322 (void)SvNOK_only(sv);
7323 SvNV_set(sv, SvNVX(sv) + 1.0);
7326 /* I don't think we can get here. Maybe I should assert this
7327 And if we do get here I suspect that sv_setnv will croak. NWC
7329 #if defined(USE_LONG_DOUBLE)
7330 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",
7331 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7333 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7334 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7337 #endif /* PERL_PRESERVE_IVUV */
7338 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7342 while (d >= SvPVX(sv)) {
7350 /* MKS: The original code here died if letters weren't consecutive.
7351 * at least it didn't have to worry about non-C locales. The
7352 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7353 * arranged in order (although not consecutively) and that only
7354 * [A-Za-z] are accepted by isALPHA in the C locale.
7356 if (*d != 'z' && *d != 'Z') {
7357 do { ++*d; } while (!isALPHA(*d));
7360 *(d--) -= 'z' - 'a';
7365 *(d--) -= 'z' - 'a' + 1;
7369 /* oh,oh, the number grew */
7370 SvGROW(sv, SvCUR(sv) + 2);
7371 SvCUR_set(sv, SvCUR(sv) + 1);
7372 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7383 Auto-decrement of the value in the SV, doing string to numeric conversion
7384 if necessary. Handles 'get' magic.
7390 Perl_sv_dec(pTHX_ register SV *sv)
7398 if (SvTHINKFIRST(sv)) {
7400 sv_force_normal_flags(sv, 0);
7401 if (SvREADONLY(sv)) {
7402 if (IN_PERL_RUNTIME)
7403 Perl_croak(aTHX_ PL_no_modify);
7407 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7409 i = PTR2IV(SvRV(sv));
7414 /* Unlike sv_inc we don't have to worry about string-never-numbers
7415 and keeping them magic. But we mustn't warn on punting */
7416 flags = SvFLAGS(sv);
7417 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7418 /* It's publicly an integer, or privately an integer-not-float */
7419 #ifdef PERL_PRESERVE_IVUV
7423 if (SvUVX(sv) == 0) {
7424 (void)SvIOK_only(sv);
7428 (void)SvIOK_only_UV(sv);
7429 SvUV_set(sv, SvUVX(sv) + 1);
7432 if (SvIVX(sv) == IV_MIN)
7433 sv_setnv(sv, (NV)IV_MIN - 1.0);
7435 (void)SvIOK_only(sv);
7436 SvIV_set(sv, SvIVX(sv) - 1);
7441 if (flags & SVp_NOK) {
7442 SvNV_set(sv, SvNVX(sv) - 1.0);
7443 (void)SvNOK_only(sv);
7446 if (!(flags & SVp_POK)) {
7447 if ((flags & SVTYPEMASK) < SVt_PVNV)
7448 sv_upgrade(sv, SVt_NV);
7450 (void)SvNOK_only(sv);
7453 #ifdef PERL_PRESERVE_IVUV
7455 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7456 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7457 /* Need to try really hard to see if it's an integer.
7458 9.22337203685478e+18 is an integer.
7459 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7460 so $a="9.22337203685478e+18"; $a+0; $a--
7461 needs to be the same as $a="9.22337203685478e+18"; $a--
7468 /* sv_2iv *should* have made this an NV */
7469 if (flags & SVp_NOK) {
7470 (void)SvNOK_only(sv);
7471 SvNV_set(sv, SvNVX(sv) - 1.0);
7474 /* I don't think we can get here. Maybe I should assert this
7475 And if we do get here I suspect that sv_setnv will croak. NWC
7477 #if defined(USE_LONG_DOUBLE)
7478 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",
7479 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7481 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7482 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7486 #endif /* PERL_PRESERVE_IVUV */
7487 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7491 =for apidoc sv_mortalcopy
7493 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7494 The new SV is marked as mortal. It will be destroyed "soon", either by an
7495 explicit call to FREETMPS, or by an implicit call at places such as
7496 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7501 /* Make a string that will exist for the duration of the expression
7502 * evaluation. Actually, it may have to last longer than that, but
7503 * hopefully we won't free it until it has been assigned to a
7504 * permanent location. */
7507 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7512 sv_setsv(sv,oldstr);
7514 PL_tmps_stack[++PL_tmps_ix] = sv;
7520 =for apidoc sv_newmortal
7522 Creates a new null SV which is mortal. The reference count of the SV is
7523 set to 1. It will be destroyed "soon", either by an explicit call to
7524 FREETMPS, or by an implicit call at places such as statement boundaries.
7525 See also C<sv_mortalcopy> and C<sv_2mortal>.
7531 Perl_sv_newmortal(pTHX)
7536 SvFLAGS(sv) = SVs_TEMP;
7538 PL_tmps_stack[++PL_tmps_ix] = sv;
7543 =for apidoc sv_2mortal
7545 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7546 by an explicit call to FREETMPS, or by an implicit call at places such as
7547 statement boundaries. SvTEMP() is turned on which means that the SV's
7548 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7549 and C<sv_mortalcopy>.
7555 Perl_sv_2mortal(pTHX_ register SV *sv)
7560 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7563 PL_tmps_stack[++PL_tmps_ix] = sv;
7571 Creates a new SV and copies a string into it. The reference count for the
7572 SV is set to 1. If C<len> is zero, Perl will compute the length using
7573 strlen(). For efficiency, consider using C<newSVpvn> instead.
7579 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7586 sv_setpvn(sv,s,len);
7591 =for apidoc newSVpvn
7593 Creates a new SV and copies a string into it. The reference count for the
7594 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7595 string. You are responsible for ensuring that the source string is at least
7596 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7602 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7607 sv_setpvn(sv,s,len);
7612 =for apidoc newSVpvn_share
7614 Creates a new SV with its SvPVX pointing to a shared string in the string
7615 table. If the string does not already exist in the table, it is created
7616 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7617 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7618 otherwise the hash is computed. The idea here is that as the string table
7619 is used for shared hash keys these strings will have SvPVX == HeKEY and
7620 hash lookup will avoid string compare.
7626 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7629 bool is_utf8 = FALSE;
7631 STRLEN tmplen = -len;
7633 /* See the note in hv.c:hv_fetch() --jhi */
7634 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7638 PERL_HASH(hash, src, len);
7640 sv_upgrade(sv, SVt_PVIV);
7641 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7654 #if defined(PERL_IMPLICIT_CONTEXT)
7656 /* pTHX_ magic can't cope with varargs, so this is a no-context
7657 * version of the main function, (which may itself be aliased to us).
7658 * Don't access this version directly.
7662 Perl_newSVpvf_nocontext(const char* pat, ...)
7667 va_start(args, pat);
7668 sv = vnewSVpvf(pat, &args);
7675 =for apidoc newSVpvf
7677 Creates a new SV and initializes it with the string formatted like
7684 Perl_newSVpvf(pTHX_ const char* pat, ...)
7688 va_start(args, pat);
7689 sv = vnewSVpvf(pat, &args);
7694 /* backend for newSVpvf() and newSVpvf_nocontext() */
7697 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7701 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7708 Creates a new SV and copies a floating point value into it.
7709 The reference count for the SV is set to 1.
7715 Perl_newSVnv(pTHX_ NV n)
7727 Creates a new SV and copies an integer into it. The reference count for the
7734 Perl_newSViv(pTHX_ IV i)
7746 Creates a new SV and copies an unsigned integer into it.
7747 The reference count for the SV is set to 1.
7753 Perl_newSVuv(pTHX_ UV u)
7763 =for apidoc newRV_noinc
7765 Creates an RV wrapper for an SV. The reference count for the original
7766 SV is B<not> incremented.
7772 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7777 sv_upgrade(sv, SVt_RV);
7779 SvRV_set(sv, tmpRef);
7784 /* newRV_inc is the official function name to use now.
7785 * newRV_inc is in fact #defined to newRV in sv.h
7789 Perl_newRV(pTHX_ SV *tmpRef)
7791 return newRV_noinc(SvREFCNT_inc(tmpRef));
7797 Creates a new SV which is an exact duplicate of the original SV.
7804 Perl_newSVsv(pTHX_ register SV *old)
7810 if (SvTYPE(old) == SVTYPEMASK) {
7811 if (ckWARN_d(WARN_INTERNAL))
7812 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7816 /* SV_GMAGIC is the default for sv_setv()
7817 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7818 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7819 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7824 =for apidoc sv_reset
7826 Underlying implementation for the C<reset> Perl function.
7827 Note that the perl-level function is vaguely deprecated.
7833 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7842 char todo[PERL_UCHAR_MAX+1];
7847 if (!*s) { /* reset ?? searches */
7848 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7849 pm->op_pmdynflags &= ~PMdf_USED;
7854 /* reset variables */
7856 if (!HvARRAY(stash))
7859 Zero(todo, 256, char);
7861 i = (unsigned char)*s;
7865 max = (unsigned char)*s++;
7866 for ( ; i <= max; i++) {
7869 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7870 for (entry = HvARRAY(stash)[i];
7872 entry = HeNEXT(entry))
7874 if (!todo[(U8)*HeKEY(entry)])
7876 gv = (GV*)HeVAL(entry);
7878 if (SvTHINKFIRST(sv)) {
7879 if (!SvREADONLY(sv) && SvROK(sv))
7884 if (SvTYPE(sv) >= SVt_PV) {
7886 if (SvPVX(sv) != Nullch)
7893 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7896 #ifdef USE_ENVIRON_ARRAY
7898 # ifdef USE_ITHREADS
7899 && PL_curinterp == aTHX
7903 environ[0] = Nullch;
7906 #endif /* !PERL_MICRO */
7916 Using various gambits, try to get an IO from an SV: the IO slot if its a
7917 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7918 named after the PV if we're a string.
7924 Perl_sv_2io(pTHX_ SV *sv)
7929 switch (SvTYPE(sv)) {
7937 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7941 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7943 return sv_2io(SvRV(sv));
7944 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7950 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7959 Using various gambits, try to get a CV from an SV; in addition, try if
7960 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7966 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7973 return *gvp = Nullgv, Nullcv;
7974 switch (SvTYPE(sv)) {
7993 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7994 tryAMAGICunDEREF(to_cv);
7997 if (SvTYPE(sv) == SVt_PVCV) {
8006 Perl_croak(aTHX_ "Not a subroutine reference");
8011 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8017 if (lref && !GvCVu(gv)) {
8020 tmpsv = NEWSV(704,0);
8021 gv_efullname3(tmpsv, gv, Nullch);
8022 /* XXX this is probably not what they think they're getting.
8023 * It has the same effect as "sub name;", i.e. just a forward
8025 newSUB(start_subparse(FALSE, 0),
8026 newSVOP(OP_CONST, 0, tmpsv),
8031 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8041 Returns true if the SV has a true value by Perl's rules.
8042 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8043 instead use an in-line version.
8049 Perl_sv_true(pTHX_ register SV *sv)
8054 const register XPV* tXpv;
8055 if ((tXpv = (XPV*)SvANY(sv)) &&
8056 (tXpv->xpv_cur > 1 ||
8057 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
8064 return SvIVX(sv) != 0;
8067 return SvNVX(sv) != 0.0;
8069 return sv_2bool(sv);
8077 A private implementation of the C<SvIVx> macro for compilers which can't
8078 cope with complex macro expressions. Always use the macro instead.
8084 Perl_sv_iv(pTHX_ register SV *sv)
8088 return (IV)SvUVX(sv);
8097 A private implementation of the C<SvUVx> macro for compilers which can't
8098 cope with complex macro expressions. Always use the macro instead.
8104 Perl_sv_uv(pTHX_ register SV *sv)
8109 return (UV)SvIVX(sv);
8117 A private implementation of the C<SvNVx> macro for compilers which can't
8118 cope with complex macro expressions. Always use the macro instead.
8124 Perl_sv_nv(pTHX_ register SV *sv)
8131 /* sv_pv() is now a macro using SvPV_nolen();
8132 * this function provided for binary compatibility only
8136 Perl_sv_pv(pTHX_ SV *sv)
8143 return sv_2pv(sv, &n_a);
8149 Use the C<SvPV_nolen> macro instead
8153 A private implementation of the C<SvPV> macro for compilers which can't
8154 cope with complex macro expressions. Always use the macro instead.
8160 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8166 return sv_2pv(sv, lp);
8171 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8177 return sv_2pv_flags(sv, lp, 0);
8180 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8181 * this function provided for binary compatibility only
8185 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8187 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8191 =for apidoc sv_pvn_force
8193 Get a sensible string out of the SV somehow.
8194 A private implementation of the C<SvPV_force> macro for compilers which
8195 can't cope with complex macro expressions. Always use the macro instead.
8197 =for apidoc sv_pvn_force_flags
8199 Get a sensible string out of the SV somehow.
8200 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8201 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8202 implemented in terms of this function.
8203 You normally want to use the various wrapper macros instead: see
8204 C<SvPV_force> and C<SvPV_force_nomg>
8210 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8214 if (SvTHINKFIRST(sv) && !SvROK(sv))
8215 sv_force_normal_flags(sv, 0);
8221 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8222 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8226 s = sv_2pv_flags(sv, lp, flags);
8227 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8232 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8233 SvGROW(sv, len + 1);
8234 Move(s,SvPVX(sv),len,char);
8239 SvPOK_on(sv); /* validate pointer */
8241 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8242 PTR2UV(sv),SvPVX(sv)));
8248 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8249 * this function provided for binary compatibility only
8253 Perl_sv_pvbyte(pTHX_ SV *sv)
8255 sv_utf8_downgrade(sv,0);
8260 =for apidoc sv_pvbyte
8262 Use C<SvPVbyte_nolen> instead.
8264 =for apidoc sv_pvbyten
8266 A private implementation of the C<SvPVbyte> macro for compilers
8267 which can't cope with complex macro expressions. Always use the macro
8274 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8276 sv_utf8_downgrade(sv,0);
8277 return sv_pvn(sv,lp);
8281 =for apidoc sv_pvbyten_force
8283 A private implementation of the C<SvPVbytex_force> macro for compilers
8284 which can't cope with complex macro expressions. Always use the macro
8291 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8293 sv_pvn_force(sv,lp);
8294 sv_utf8_downgrade(sv,0);
8299 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8300 * this function provided for binary compatibility only
8304 Perl_sv_pvutf8(pTHX_ SV *sv)
8306 sv_utf8_upgrade(sv);
8311 =for apidoc sv_pvutf8
8313 Use the C<SvPVutf8_nolen> macro instead
8315 =for apidoc sv_pvutf8n
8317 A private implementation of the C<SvPVutf8> macro for compilers
8318 which can't cope with complex macro expressions. Always use the macro
8325 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8327 sv_utf8_upgrade(sv);
8328 return sv_pvn(sv,lp);
8332 =for apidoc sv_pvutf8n_force
8334 A private implementation of the C<SvPVutf8_force> macro for compilers
8335 which can't cope with complex macro expressions. Always use the macro
8342 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8344 sv_pvn_force(sv,lp);
8345 sv_utf8_upgrade(sv);
8351 =for apidoc sv_reftype
8353 Returns a string describing what the SV is a reference to.
8359 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8361 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8362 inside return suggests a const propagation bug in g++. */
8363 if (ob && SvOBJECT(sv)) {
8364 char *name = HvNAME(SvSTASH(sv));
8365 return name ? name : (char *) "__ANON__";
8368 switch (SvTYPE(sv)) {
8385 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8386 /* tied lvalues should appear to be
8387 * scalars for backwards compatitbility */
8388 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8389 ? "SCALAR" : "LVALUE");
8390 case SVt_PVAV: return "ARRAY";
8391 case SVt_PVHV: return "HASH";
8392 case SVt_PVCV: return "CODE";
8393 case SVt_PVGV: return "GLOB";
8394 case SVt_PVFM: return "FORMAT";
8395 case SVt_PVIO: return "IO";
8396 default: return "UNKNOWN";
8402 =for apidoc sv_isobject
8404 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8405 object. If the SV is not an RV, or if the object is not blessed, then this
8412 Perl_sv_isobject(pTHX_ SV *sv)
8429 Returns a boolean indicating whether the SV is blessed into the specified
8430 class. This does not check for subtypes; use C<sv_derived_from> to verify
8431 an inheritance relationship.
8437 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8448 if (!HvNAME(SvSTASH(sv)))
8451 return strEQ(HvNAME(SvSTASH(sv)), name);
8457 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8458 it will be upgraded to one. If C<classname> is non-null then the new SV will
8459 be blessed in the specified package. The new SV is returned and its
8460 reference count is 1.
8466 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8472 SV_CHECK_THINKFIRST_COW_DROP(rv);
8475 if (SvTYPE(rv) >= SVt_PVMG) {
8476 U32 refcnt = SvREFCNT(rv);
8480 SvREFCNT(rv) = refcnt;
8483 if (SvTYPE(rv) < SVt_RV)
8484 sv_upgrade(rv, SVt_RV);
8485 else if (SvTYPE(rv) > SVt_RV) {
8496 HV* stash = gv_stashpv(classname, TRUE);
8497 (void)sv_bless(rv, stash);
8503 =for apidoc sv_setref_pv
8505 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8506 argument will be upgraded to an RV. That RV will be modified to point to
8507 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8508 into the SV. The C<classname> argument indicates the package for the
8509 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8510 will have a reference count of 1, and the RV will be returned.
8512 Do not use with other Perl types such as HV, AV, SV, CV, because those
8513 objects will become corrupted by the pointer copy process.
8515 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8521 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8524 sv_setsv(rv, &PL_sv_undef);
8528 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8533 =for apidoc sv_setref_iv
8535 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8536 argument will be upgraded to an RV. That RV will be modified to point to
8537 the new SV. The C<classname> argument indicates the package for the
8538 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8539 will have a reference count of 1, and the RV will be returned.
8545 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8547 sv_setiv(newSVrv(rv,classname), iv);
8552 =for apidoc sv_setref_uv
8554 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8555 argument will be upgraded to an RV. That RV will be modified to point to
8556 the new SV. The C<classname> argument indicates the package for the
8557 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8558 will have a reference count of 1, and the RV will be returned.
8564 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8566 sv_setuv(newSVrv(rv,classname), uv);
8571 =for apidoc sv_setref_nv
8573 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8574 argument will be upgraded to an RV. That RV will be modified to point to
8575 the new SV. The C<classname> argument indicates the package for the
8576 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8577 will have a reference count of 1, and the RV will be returned.
8583 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8585 sv_setnv(newSVrv(rv,classname), nv);
8590 =for apidoc sv_setref_pvn
8592 Copies a string into a new SV, optionally blessing the SV. The length of the
8593 string must be specified with C<n>. The C<rv> argument will be upgraded to
8594 an RV. That RV will be modified to point to the new SV. The C<classname>
8595 argument indicates the package for the blessing. Set C<classname> to
8596 C<Nullch> to avoid the blessing. The new SV will have a reference count
8597 of 1, and the RV will be returned.
8599 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8605 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8607 sv_setpvn(newSVrv(rv,classname), pv, n);
8612 =for apidoc sv_bless
8614 Blesses an SV into a specified package. The SV must be an RV. The package
8615 must be designated by its stash (see C<gv_stashpv()>). The reference count
8616 of the SV is unaffected.
8622 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8626 Perl_croak(aTHX_ "Can't bless non-reference value");
8628 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8629 if (SvREADONLY(tmpRef))
8630 Perl_croak(aTHX_ PL_no_modify);
8631 if (SvOBJECT(tmpRef)) {
8632 if (SvTYPE(tmpRef) != SVt_PVIO)
8634 SvREFCNT_dec(SvSTASH(tmpRef));
8637 SvOBJECT_on(tmpRef);
8638 if (SvTYPE(tmpRef) != SVt_PVIO)
8640 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8641 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8648 if(SvSMAGICAL(tmpRef))
8649 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8657 /* Downgrades a PVGV to a PVMG.
8661 S_sv_unglob(pTHX_ SV *sv)
8665 assert(SvTYPE(sv) == SVt_PVGV);
8670 SvREFCNT_dec(GvSTASH(sv));
8671 GvSTASH(sv) = Nullhv;
8673 sv_unmagic(sv, PERL_MAGIC_glob);
8674 Safefree(GvNAME(sv));
8677 /* need to keep SvANY(sv) in the right arena */
8678 xpvmg = new_XPVMG();
8679 StructCopy(SvANY(sv), xpvmg, XPVMG);
8680 del_XPVGV(SvANY(sv));
8683 SvFLAGS(sv) &= ~SVTYPEMASK;
8684 SvFLAGS(sv) |= SVt_PVMG;
8688 =for apidoc sv_unref_flags
8690 Unsets the RV status of the SV, and decrements the reference count of
8691 whatever was being referenced by the RV. This can almost be thought of
8692 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8693 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8694 (otherwise the decrementing is conditional on the reference count being
8695 different from one or the reference being a readonly SV).
8702 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8706 if (SvWEAKREF(sv)) {
8714 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8715 assigned to as BEGIN {$a = \"Foo"} will fail. */
8716 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8718 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8719 sv_2mortal(rv); /* Schedule for freeing later */
8723 =for apidoc sv_unref
8725 Unsets the RV status of the SV, and decrements the reference count of
8726 whatever was being referenced by the RV. This can almost be thought of
8727 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8728 being zero. See C<SvROK_off>.
8734 Perl_sv_unref(pTHX_ SV *sv)
8736 sv_unref_flags(sv, 0);
8740 =for apidoc sv_taint
8742 Taint an SV. Use C<SvTAINTED_on> instead.
8747 Perl_sv_taint(pTHX_ SV *sv)
8749 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8753 =for apidoc sv_untaint
8755 Untaint an SV. Use C<SvTAINTED_off> instead.
8760 Perl_sv_untaint(pTHX_ SV *sv)
8762 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8763 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8770 =for apidoc sv_tainted
8772 Test an SV for taintedness. Use C<SvTAINTED> instead.
8777 Perl_sv_tainted(pTHX_ SV *sv)
8779 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8780 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8781 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8788 =for apidoc sv_setpviv
8790 Copies an integer into the given SV, also updating its string value.
8791 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8797 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8799 char buf[TYPE_CHARS(UV)];
8801 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8803 sv_setpvn(sv, ptr, ebuf - ptr);
8807 =for apidoc sv_setpviv_mg
8809 Like C<sv_setpviv>, but also handles 'set' magic.
8815 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8817 char buf[TYPE_CHARS(UV)];
8819 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8821 sv_setpvn(sv, ptr, ebuf - ptr);
8825 #if defined(PERL_IMPLICIT_CONTEXT)
8827 /* pTHX_ magic can't cope with varargs, so this is a no-context
8828 * version of the main function, (which may itself be aliased to us).
8829 * Don't access this version directly.
8833 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8837 va_start(args, pat);
8838 sv_vsetpvf(sv, pat, &args);
8842 /* pTHX_ magic can't cope with varargs, so this is a no-context
8843 * version of the main function, (which may itself be aliased to us).
8844 * Don't access this version directly.
8848 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8852 va_start(args, pat);
8853 sv_vsetpvf_mg(sv, pat, &args);
8859 =for apidoc sv_setpvf
8861 Works like C<sv_catpvf> but copies the text into the SV instead of
8862 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8868 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8871 va_start(args, pat);
8872 sv_vsetpvf(sv, pat, &args);
8877 =for apidoc sv_vsetpvf
8879 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8880 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8882 Usually used via its frontend C<sv_setpvf>.
8888 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8890 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8894 =for apidoc sv_setpvf_mg
8896 Like C<sv_setpvf>, but also handles 'set' magic.
8902 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8905 va_start(args, pat);
8906 sv_vsetpvf_mg(sv, pat, &args);
8911 =for apidoc sv_vsetpvf_mg
8913 Like C<sv_vsetpvf>, but also handles 'set' magic.
8915 Usually used via its frontend C<sv_setpvf_mg>.
8921 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8923 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8927 #if defined(PERL_IMPLICIT_CONTEXT)
8929 /* pTHX_ magic can't cope with varargs, so this is a no-context
8930 * version of the main function, (which may itself be aliased to us).
8931 * Don't access this version directly.
8935 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8939 va_start(args, pat);
8940 sv_vcatpvf(sv, pat, &args);
8944 /* pTHX_ magic can't cope with varargs, so this is a no-context
8945 * version of the main function, (which may itself be aliased to us).
8946 * Don't access this version directly.
8950 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8954 va_start(args, pat);
8955 sv_vcatpvf_mg(sv, pat, &args);
8961 =for apidoc sv_catpvf
8963 Processes its arguments like C<sprintf> and appends the formatted
8964 output to an SV. If the appended data contains "wide" characters
8965 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8966 and characters >255 formatted with %c), the original SV might get
8967 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8968 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8969 valid UTF-8; if the original SV was bytes, the pattern should be too.
8974 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8977 va_start(args, pat);
8978 sv_vcatpvf(sv, pat, &args);
8983 =for apidoc sv_vcatpvf
8985 Processes its arguments like C<vsprintf> and appends the formatted output
8986 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8988 Usually used via its frontend C<sv_catpvf>.
8994 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8996 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9000 =for apidoc sv_catpvf_mg
9002 Like C<sv_catpvf>, but also handles 'set' magic.
9008 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9011 va_start(args, pat);
9012 sv_vcatpvf_mg(sv, pat, &args);
9017 =for apidoc sv_vcatpvf_mg
9019 Like C<sv_vcatpvf>, but also handles 'set' magic.
9021 Usually used via its frontend C<sv_catpvf_mg>.
9027 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9029 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9034 =for apidoc sv_vsetpvfn
9036 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9039 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9045 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9047 sv_setpvn(sv, "", 0);
9048 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9051 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9054 S_expect_number(pTHX_ char** pattern)
9057 switch (**pattern) {
9058 case '1': case '2': case '3':
9059 case '4': case '5': case '6':
9060 case '7': case '8': case '9':
9061 while (isDIGIT(**pattern))
9062 var = var * 10 + (*(*pattern)++ - '0');
9066 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9069 F0convert(NV nv, char *endbuf, STRLEN *len)
9080 if (uv & 1 && uv == nv)
9081 uv--; /* Round to even */
9083 unsigned dig = uv % 10;
9096 =for apidoc sv_vcatpvfn
9098 Processes its arguments like C<vsprintf> and appends the formatted output
9099 to an SV. Uses an array of SVs if the C style variable argument list is
9100 missing (NULL). When running with taint checks enabled, indicates via
9101 C<maybe_tainted> if results are untrustworthy (often due to the use of
9104 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9109 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9112 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9119 static const char nullstr[] = "(null)";
9121 bool has_utf8; /* has the result utf8? */
9122 bool pat_utf8; /* the pattern is in utf8? */
9124 /* Times 4: a decimal digit takes more than 3 binary digits.
9125 * NV_DIG: mantissa takes than many decimal digits.
9126 * Plus 32: Playing safe. */
9127 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9128 /* large enough for "%#.#f" --chip */
9129 /* what about long double NVs? --jhi */
9131 has_utf8 = pat_utf8 = DO_UTF8(sv);
9133 /* no matter what, this is a string now */
9134 (void)SvPV_force(sv, origlen);
9136 /* special-case "", "%s", and "%_" */
9139 if (patlen == 2 && pat[0] == '%') {
9143 const char *s = va_arg(*args, char*);
9144 sv_catpv(sv, s ? s : nullstr);
9146 else if (svix < svmax) {
9147 sv_catsv(sv, *svargs);
9148 if (DO_UTF8(*svargs))
9154 argsv = va_arg(*args, SV*);
9155 sv_catsv(sv, argsv);
9160 /* See comment on '_' below */
9165 #ifndef USE_LONG_DOUBLE
9166 /* special-case "%.<number>[gf]" */
9167 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9168 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9169 unsigned digits = 0;
9173 while (*pp >= '0' && *pp <= '9')
9174 digits = 10 * digits + (*pp++ - '0');
9175 if (pp - pat == (int)patlen - 1) {
9179 nv = (NV)va_arg(*args, double);
9180 else if (svix < svmax)
9185 /* Add check for digits != 0 because it seems that some
9186 gconverts are buggy in this case, and we don't yet have
9187 a Configure test for this. */
9188 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9189 /* 0, point, slack */
9190 Gconvert(nv, (int)digits, 0, ebuf);
9192 if (*ebuf) /* May return an empty string for digits==0 */
9195 } else if (!digits) {
9198 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9199 sv_catpvn(sv, p, l);
9205 #endif /* !USE_LONG_DOUBLE */
9207 if (!args && svix < svmax && DO_UTF8(*svargs))
9210 patend = (char*)pat + patlen;
9211 for (p = (char*)pat; p < patend; p = q) {
9214 bool vectorize = FALSE;
9215 bool vectorarg = FALSE;
9216 bool vec_utf8 = FALSE;
9222 bool has_precis = FALSE;
9225 bool is_utf8 = FALSE; /* is this item utf8? */
9226 #ifdef HAS_LDBL_SPRINTF_BUG
9227 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9228 with sfio - Allen <allens@cpan.org> */
9229 bool fix_ldbl_sprintf_bug = FALSE;
9233 U8 utf8buf[UTF8_MAXBYTES+1];
9234 STRLEN esignlen = 0;
9236 char *eptr = Nullch;
9239 U8 *vecstr = Null(U8*);
9246 /* we need a long double target in case HAS_LONG_DOUBLE but
9249 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9257 const char *dotstr = ".";
9258 STRLEN dotstrlen = 1;
9259 I32 efix = 0; /* explicit format parameter index */
9260 I32 ewix = 0; /* explicit width index */
9261 I32 epix = 0; /* explicit precision index */
9262 I32 evix = 0; /* explicit vector index */
9263 bool asterisk = FALSE;
9265 /* echo everything up to the next format specification */
9266 for (q = p; q < patend && *q != '%'; ++q) ;
9268 if (has_utf8 && !pat_utf8)
9269 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9271 sv_catpvn(sv, p, q - p);
9278 We allow format specification elements in this order:
9279 \d+\$ explicit format parameter index
9281 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9282 0 flag (as above): repeated to allow "v02"
9283 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9284 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9286 [%bcdefginopsux_DFOUX] format (mandatory)
9288 if (EXPECT_NUMBER(q, width)) {
9329 if (EXPECT_NUMBER(q, ewix))
9338 if ((vectorarg = asterisk)) {
9350 EXPECT_NUMBER(q, width);
9355 vecsv = va_arg(*args, SV*);
9357 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9358 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9359 dotstr = SvPVx(vecsv, dotstrlen);
9364 vecsv = va_arg(*args, SV*);
9365 vecstr = (U8*)SvPVx(vecsv,veclen);
9366 vec_utf8 = DO_UTF8(vecsv);
9368 else if (efix ? efix <= svmax : svix < svmax) {
9369 vecsv = svargs[efix ? efix-1 : svix++];
9370 vecstr = (U8*)SvPVx(vecsv,veclen);
9371 vec_utf8 = DO_UTF8(vecsv);
9372 /* if this is a version object, we need to return the
9373 * stringified representation (which the SvPVX has
9374 * already done for us), but not vectorize the args
9376 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9378 q++; /* skip past the rest of the %vd format */
9379 eptr = (char *) vecstr;
9380 elen = strlen(eptr);
9393 i = va_arg(*args, int);
9395 i = (ewix ? ewix <= svmax : svix < svmax) ?
9396 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9398 width = (i < 0) ? -i : i;
9408 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9410 /* XXX: todo, support specified precision parameter */
9414 i = va_arg(*args, int);
9416 i = (ewix ? ewix <= svmax : svix < svmax)
9417 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9418 precis = (i < 0) ? 0 : i;
9423 precis = precis * 10 + (*q++ - '0');
9432 case 'I': /* Ix, I32x, and I64x */
9434 if (q[1] == '6' && q[2] == '4') {
9440 if (q[1] == '3' && q[2] == '2') {
9450 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9461 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9462 if (*(q + 1) == 'l') { /* lld, llf */
9487 argsv = (efix ? efix <= svmax : svix < svmax) ?
9488 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9495 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9497 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9499 eptr = (char*)utf8buf;
9500 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9511 if (args && !vectorize) {
9512 eptr = va_arg(*args, char*);
9514 #ifdef MACOS_TRADITIONAL
9515 /* On MacOS, %#s format is used for Pascal strings */
9520 elen = strlen(eptr);
9522 eptr = (char *)nullstr;
9523 elen = sizeof nullstr - 1;
9527 eptr = SvPVx(argsv, elen);
9528 if (DO_UTF8(argsv)) {
9529 if (has_precis && precis < elen) {
9531 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9534 if (width) { /* fudge width (can't fudge elen) */
9535 width += elen - sv_len_utf8(argsv);
9547 * The "%_" hack might have to be changed someday,
9548 * if ISO or ANSI decide to use '_' for something.
9549 * So we keep it hidden from users' code.
9551 if (!args || vectorize)
9553 argsv = va_arg(*args, SV*);
9554 eptr = SvPVx(argsv, elen);
9560 if (has_precis && elen > precis)
9571 goto format_sv; /* %-p -> %_ */
9575 goto format_sv; /* %-Np -> %.N_ */
9578 if (alt || vectorize)
9580 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9598 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9607 esignbuf[esignlen++] = plus;
9611 case 'h': iv = (short)va_arg(*args, int); break;
9612 case 'l': iv = va_arg(*args, long); break;
9613 case 'V': iv = va_arg(*args, IV); break;
9614 default: iv = va_arg(*args, int); break;
9616 case 'q': iv = va_arg(*args, Quad_t); break;
9621 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9623 case 'h': iv = (short)tiv; break;
9624 case 'l': iv = (long)tiv; break;
9626 default: iv = tiv; break;
9628 case 'q': iv = (Quad_t)tiv; break;
9632 if ( !vectorize ) /* we already set uv above */
9637 esignbuf[esignlen++] = plus;
9641 esignbuf[esignlen++] = '-';
9684 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9695 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9696 case 'l': uv = va_arg(*args, unsigned long); break;
9697 case 'V': uv = va_arg(*args, UV); break;
9698 default: uv = va_arg(*args, unsigned); break;
9700 case 'q': uv = va_arg(*args, Uquad_t); break;
9705 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9707 case 'h': uv = (unsigned short)tuv; break;
9708 case 'l': uv = (unsigned long)tuv; break;
9710 default: uv = tuv; break;
9712 case 'q': uv = (Uquad_t)tuv; break;
9718 eptr = ebuf + sizeof ebuf;
9724 p = (char*)((c == 'X')
9725 ? "0123456789ABCDEF" : "0123456789abcdef");
9731 esignbuf[esignlen++] = '0';
9732 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9738 *--eptr = '0' + dig;
9740 if (alt && *eptr != '0')
9746 *--eptr = '0' + dig;
9749 esignbuf[esignlen++] = '0';
9750 esignbuf[esignlen++] = 'b';
9753 default: /* it had better be ten or less */
9756 *--eptr = '0' + dig;
9757 } while (uv /= base);
9760 elen = (ebuf + sizeof ebuf) - eptr;
9763 zeros = precis - elen;
9764 else if (precis == 0 && elen == 1 && *eptr == '0')
9769 /* FLOATING POINT */
9772 c = 'f'; /* maybe %F isn't supported here */
9778 /* This is evil, but floating point is even more evil */
9780 /* for SV-style calling, we can only get NV
9781 for C-style calling, we assume %f is double;
9782 for simplicity we allow any of %Lf, %llf, %qf for long double
9786 #if defined(USE_LONG_DOUBLE)
9790 /* [perl #20339] - we should accept and ignore %lf rather than die */
9794 #if defined(USE_LONG_DOUBLE)
9795 intsize = args ? 0 : 'q';
9799 #if defined(HAS_LONG_DOUBLE)
9808 /* now we need (long double) if intsize == 'q', else (double) */
9809 nv = (args && !vectorize) ?
9810 #if LONG_DOUBLESIZE > DOUBLESIZE
9812 va_arg(*args, long double) :
9813 va_arg(*args, double)
9815 va_arg(*args, double)
9821 if (c != 'e' && c != 'E') {
9823 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9824 will cast our (long double) to (double) */
9825 (void)Perl_frexp(nv, &i);
9826 if (i == PERL_INT_MIN)
9827 Perl_die(aTHX_ "panic: frexp");
9829 need = BIT_DIGITS(i);
9831 need += has_precis ? precis : 6; /* known default */
9836 #ifdef HAS_LDBL_SPRINTF_BUG
9837 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9838 with sfio - Allen <allens@cpan.org> */
9841 # define MY_DBL_MAX DBL_MAX
9842 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9843 # if DOUBLESIZE >= 8
9844 # define MY_DBL_MAX 1.7976931348623157E+308L
9846 # define MY_DBL_MAX 3.40282347E+38L
9850 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9851 # define MY_DBL_MAX_BUG 1L
9853 # define MY_DBL_MAX_BUG MY_DBL_MAX
9857 # define MY_DBL_MIN DBL_MIN
9858 # else /* XXX guessing! -Allen */
9859 # if DOUBLESIZE >= 8
9860 # define MY_DBL_MIN 2.2250738585072014E-308L
9862 # define MY_DBL_MIN 1.17549435E-38L
9866 if ((intsize == 'q') && (c == 'f') &&
9867 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9869 /* it's going to be short enough that
9870 * long double precision is not needed */
9872 if ((nv <= 0L) && (nv >= -0L))
9873 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9875 /* would use Perl_fp_class as a double-check but not
9876 * functional on IRIX - see perl.h comments */
9878 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9879 /* It's within the range that a double can represent */
9880 #if defined(DBL_MAX) && !defined(DBL_MIN)
9881 if ((nv >= ((long double)1/DBL_MAX)) ||
9882 (nv <= (-(long double)1/DBL_MAX)))
9884 fix_ldbl_sprintf_bug = TRUE;
9887 if (fix_ldbl_sprintf_bug == TRUE) {
9897 # undef MY_DBL_MAX_BUG
9900 #endif /* HAS_LDBL_SPRINTF_BUG */
9902 need += 20; /* fudge factor */
9903 if (PL_efloatsize < need) {
9904 Safefree(PL_efloatbuf);
9905 PL_efloatsize = need + 20; /* more fudge */
9906 New(906, PL_efloatbuf, PL_efloatsize, char);
9907 PL_efloatbuf[0] = '\0';
9910 if ( !(width || left || plus || alt) && fill != '0'
9911 && has_precis && intsize != 'q' ) { /* Shortcuts */
9912 /* See earlier comment about buggy Gconvert when digits,
9914 if ( c == 'g' && precis) {
9915 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9916 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9917 goto float_converted;
9918 } else if ( c == 'f' && !precis) {
9919 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9923 eptr = ebuf + sizeof ebuf;
9926 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9927 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9928 if (intsize == 'q') {
9929 /* Copy the one or more characters in a long double
9930 * format before the 'base' ([efgEFG]) character to
9931 * the format string. */
9932 static char const prifldbl[] = PERL_PRIfldbl;
9933 char const *p = prifldbl + sizeof(prifldbl) - 3;
9934 while (p >= prifldbl) { *--eptr = *p--; }
9939 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9944 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9956 /* No taint. Otherwise we are in the strange situation
9957 * where printf() taints but print($float) doesn't.
9959 #if defined(HAS_LONG_DOUBLE)
9961 (void)sprintf(PL_efloatbuf, eptr, nv);
9963 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9965 (void)sprintf(PL_efloatbuf, eptr, nv);
9968 eptr = PL_efloatbuf;
9969 elen = strlen(PL_efloatbuf);
9975 i = SvCUR(sv) - origlen;
9976 if (args && !vectorize) {
9978 case 'h': *(va_arg(*args, short*)) = i; break;
9979 default: *(va_arg(*args, int*)) = i; break;
9980 case 'l': *(va_arg(*args, long*)) = i; break;
9981 case 'V': *(va_arg(*args, IV*)) = i; break;
9983 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9988 sv_setuv_mg(argsv, (UV)i);
9990 continue; /* not "break" */
9996 if (!args && ckWARN(WARN_PRINTF) &&
9997 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9998 SV *msg = sv_newmortal();
9999 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
10000 (PL_op->op_type == OP_PRTF) ? "" : "s");
10003 Perl_sv_catpvf(aTHX_ msg,
10004 "\"%%%c\"", c & 0xFF);
10006 Perl_sv_catpvf(aTHX_ msg,
10007 "\"%%\\%03"UVof"\"",
10010 sv_catpv(msg, "end of string");
10011 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10014 /* output mangled stuff ... */
10020 /* ... right here, because formatting flags should not apply */
10021 SvGROW(sv, SvCUR(sv) + elen + 1);
10023 Copy(eptr, p, elen, char);
10026 SvCUR_set(sv, p - SvPVX(sv));
10028 continue; /* not "break" */
10031 /* calculate width before utf8_upgrade changes it */
10032 have = esignlen + zeros + elen;
10034 if (is_utf8 != has_utf8) {
10037 sv_utf8_upgrade(sv);
10040 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10041 sv_utf8_upgrade(nsv);
10045 SvGROW(sv, SvCUR(sv) + elen + 1);
10050 need = (have > width ? have : width);
10053 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10055 if (esignlen && fill == '0') {
10056 for (i = 0; i < (int)esignlen; i++)
10057 *p++ = esignbuf[i];
10059 if (gap && !left) {
10060 memset(p, fill, gap);
10063 if (esignlen && fill != '0') {
10064 for (i = 0; i < (int)esignlen; i++)
10065 *p++ = esignbuf[i];
10068 for (i = zeros; i; i--)
10072 Copy(eptr, p, elen, char);
10076 memset(p, ' ', gap);
10081 Copy(dotstr, p, dotstrlen, char);
10085 vectorize = FALSE; /* done iterating over vecstr */
10092 SvCUR_set(sv, p - SvPVX(sv));
10100 /* =========================================================================
10102 =head1 Cloning an interpreter
10104 All the macros and functions in this section are for the private use of
10105 the main function, perl_clone().
10107 The foo_dup() functions make an exact copy of an existing foo thinngy.
10108 During the course of a cloning, a hash table is used to map old addresses
10109 to new addresses. The table is created and manipulated with the
10110 ptr_table_* functions.
10114 ============================================================================*/
10117 #if defined(USE_ITHREADS)
10119 #ifndef GpREFCNT_inc
10120 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10124 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10125 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10126 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10127 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10128 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10129 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10130 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10131 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10132 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10133 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10134 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10135 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10136 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10139 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10140 regcomp.c. AMS 20010712 */
10143 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10148 struct reg_substr_datum *s;
10151 return (REGEXP *)NULL;
10153 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10156 len = r->offsets[0];
10157 npar = r->nparens+1;
10159 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10160 Copy(r->program, ret->program, len+1, regnode);
10162 New(0, ret->startp, npar, I32);
10163 Copy(r->startp, ret->startp, npar, I32);
10164 New(0, ret->endp, npar, I32);
10165 Copy(r->startp, ret->startp, npar, I32);
10167 New(0, ret->substrs, 1, struct reg_substr_data);
10168 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10169 s->min_offset = r->substrs->data[i].min_offset;
10170 s->max_offset = r->substrs->data[i].max_offset;
10171 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10172 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10175 ret->regstclass = NULL;
10177 struct reg_data *d;
10178 const int count = r->data->count;
10180 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10181 char, struct reg_data);
10182 New(0, d->what, count, U8);
10185 for (i = 0; i < count; i++) {
10186 d->what[i] = r->data->what[i];
10187 switch (d->what[i]) {
10188 /* legal options are one of: sfpont
10189 see also regcomp.h and pregfree() */
10191 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10194 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10197 /* This is cheating. */
10198 New(0, d->data[i], 1, struct regnode_charclass_class);
10199 StructCopy(r->data->data[i], d->data[i],
10200 struct regnode_charclass_class);
10201 ret->regstclass = (regnode*)d->data[i];
10204 /* Compiled op trees are readonly, and can thus be
10205 shared without duplication. */
10207 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10211 d->data[i] = r->data->data[i];
10214 d->data[i] = r->data->data[i];
10216 ((reg_trie_data*)d->data[i])->refcount++;
10220 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10229 New(0, ret->offsets, 2*len+1, U32);
10230 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10232 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10233 ret->refcnt = r->refcnt;
10234 ret->minlen = r->minlen;
10235 ret->prelen = r->prelen;
10236 ret->nparens = r->nparens;
10237 ret->lastparen = r->lastparen;
10238 ret->lastcloseparen = r->lastcloseparen;
10239 ret->reganch = r->reganch;
10241 ret->sublen = r->sublen;
10243 if (RX_MATCH_COPIED(ret))
10244 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10246 ret->subbeg = Nullch;
10247 #ifdef PERL_COPY_ON_WRITE
10248 ret->saved_copy = Nullsv;
10251 ptr_table_store(PL_ptr_table, r, ret);
10255 /* duplicate a file handle */
10258 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10264 return (PerlIO*)NULL;
10266 /* look for it in the table first */
10267 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10271 /* create anew and remember what it is */
10272 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10273 ptr_table_store(PL_ptr_table, fp, ret);
10277 /* duplicate a directory handle */
10280 Perl_dirp_dup(pTHX_ DIR *dp)
10288 /* duplicate a typeglob */
10291 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10296 /* look for it in the table first */
10297 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10301 /* create anew and remember what it is */
10302 Newz(0, ret, 1, GP);
10303 ptr_table_store(PL_ptr_table, gp, ret);
10306 ret->gp_refcnt = 0; /* must be before any other dups! */
10307 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10308 ret->gp_io = io_dup_inc(gp->gp_io, param);
10309 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10310 ret->gp_av = av_dup_inc(gp->gp_av, param);
10311 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10312 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10313 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10314 ret->gp_cvgen = gp->gp_cvgen;
10315 ret->gp_flags = gp->gp_flags;
10316 ret->gp_line = gp->gp_line;
10317 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10321 /* duplicate a chain of magic */
10324 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10326 MAGIC *mgprev = (MAGIC*)NULL;
10329 return (MAGIC*)NULL;
10330 /* look for it in the table first */
10331 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10335 for (; mg; mg = mg->mg_moremagic) {
10337 Newz(0, nmg, 1, MAGIC);
10339 mgprev->mg_moremagic = nmg;
10342 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10343 nmg->mg_private = mg->mg_private;
10344 nmg->mg_type = mg->mg_type;
10345 nmg->mg_flags = mg->mg_flags;
10346 if (mg->mg_type == PERL_MAGIC_qr) {
10347 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10349 else if(mg->mg_type == PERL_MAGIC_backref) {
10350 const AV * const av = (AV*) mg->mg_obj;
10353 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10355 for (i = AvFILLp(av); i >= 0; i--) {
10356 if (!svp[i]) continue;
10357 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10361 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10362 ? sv_dup_inc(mg->mg_obj, param)
10363 : sv_dup(mg->mg_obj, param);
10365 nmg->mg_len = mg->mg_len;
10366 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10367 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10368 if (mg->mg_len > 0) {
10369 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10370 if (mg->mg_type == PERL_MAGIC_overload_table &&
10371 AMT_AMAGIC((AMT*)mg->mg_ptr))
10373 AMT *amtp = (AMT*)mg->mg_ptr;
10374 AMT *namtp = (AMT*)nmg->mg_ptr;
10376 for (i = 1; i < NofAMmeth; i++) {
10377 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10381 else if (mg->mg_len == HEf_SVKEY)
10382 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10384 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10385 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10392 /* create a new pointer-mapping table */
10395 Perl_ptr_table_new(pTHX)
10398 Newz(0, tbl, 1, PTR_TBL_t);
10399 tbl->tbl_max = 511;
10400 tbl->tbl_items = 0;
10401 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10406 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10408 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10411 /* map an existing pointer using a table */
10414 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10416 PTR_TBL_ENT_t *tblent;
10417 UV hash = PTR_TABLE_HASH(sv);
10419 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10420 for (; tblent; tblent = tblent->next) {
10421 if (tblent->oldval == sv)
10422 return tblent->newval;
10424 return (void*)NULL;
10427 /* add a new entry to a pointer-mapping table */
10430 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10432 PTR_TBL_ENT_t *tblent, **otblent;
10433 /* XXX this may be pessimal on platforms where pointers aren't good
10434 * hash values e.g. if they grow faster in the most significant
10436 UV hash = PTR_TABLE_HASH(oldv);
10440 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10441 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10442 if (tblent->oldval == oldv) {
10443 tblent->newval = newv;
10447 Newz(0, tblent, 1, PTR_TBL_ENT_t);
10448 tblent->oldval = oldv;
10449 tblent->newval = newv;
10450 tblent->next = *otblent;
10453 if (!empty && tbl->tbl_items > tbl->tbl_max)
10454 ptr_table_split(tbl);
10457 /* double the hash bucket size of an existing ptr table */
10460 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10462 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10463 UV oldsize = tbl->tbl_max + 1;
10464 UV newsize = oldsize * 2;
10467 Renew(ary, newsize, PTR_TBL_ENT_t*);
10468 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10469 tbl->tbl_max = --newsize;
10470 tbl->tbl_ary = ary;
10471 for (i=0; i < oldsize; i++, ary++) {
10472 PTR_TBL_ENT_t **curentp, **entp, *ent;
10475 curentp = ary + oldsize;
10476 for (entp = ary, ent = *ary; ent; ent = *entp) {
10477 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10479 ent->next = *curentp;
10489 /* remove all the entries from a ptr table */
10492 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10494 register PTR_TBL_ENT_t **array;
10495 register PTR_TBL_ENT_t *entry;
10496 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
10500 if (!tbl || !tbl->tbl_items) {
10504 array = tbl->tbl_ary;
10506 max = tbl->tbl_max;
10511 entry = entry->next;
10515 if (++riter > max) {
10518 entry = array[riter];
10522 tbl->tbl_items = 0;
10525 /* clear and free a ptr table */
10528 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10533 ptr_table_clear(tbl);
10534 Safefree(tbl->tbl_ary);
10538 /* attempt to make everything in the typeglob readonly */
10541 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10543 GV *gv = (GV*)sstr;
10544 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10546 if (GvIO(gv) || GvFORM(gv)) {
10547 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10549 else if (!GvCV(gv)) {
10550 GvCV(gv) = (CV*)sv;
10553 /* CvPADLISTs cannot be shared */
10554 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10559 if (!GvUNIQUE(gv)) {
10561 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10562 HvNAME(GvSTASH(gv)), GvNAME(gv));
10568 * write attempts will die with
10569 * "Modification of a read-only value attempted"
10575 SvREADONLY_on(GvSV(gv));
10579 GvAV(gv) = (AV*)sv;
10582 SvREADONLY_on(GvAV(gv));
10586 GvHV(gv) = (HV*)sv;
10589 SvREADONLY_on(GvHV(gv));
10592 return sstr; /* he_dup() will SvREFCNT_inc() */
10595 /* duplicate an SV of any type (including AV, HV etc) */
10598 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10601 SvRV_set(dstr, SvWEAKREF(sstr)
10602 ? sv_dup(SvRV(sstr), param)
10603 : sv_dup_inc(SvRV(sstr), param));
10606 else if (SvPVX(sstr)) {
10607 /* Has something there */
10609 /* Normal PV - clone whole allocated space */
10610 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10611 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10612 /* Not that normal - actually sstr is copy on write.
10613 But we are a true, independant SV, so: */
10614 SvREADONLY_off(dstr);
10619 /* Special case - not normally malloced for some reason */
10620 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10621 /* A "shared" PV - clone it as unshared string */
10622 if(SvPADTMP(sstr)) {
10623 /* However, some of them live in the pad
10624 and they should not have these flags
10627 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10629 SvUV_set(dstr, SvUVX(sstr));
10632 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10634 SvREADONLY_off(dstr);
10638 /* Some other special case - random pointer */
10639 SvPV_set(dstr, SvPVX(sstr));
10644 /* Copy the Null */
10645 if (SvTYPE(dstr) == SVt_RV)
10646 SvRV_set(dstr, NULL);
10653 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10658 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10660 /* look for it in the table first */
10661 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10665 if(param->flags & CLONEf_JOIN_IN) {
10666 /** We are joining here so we don't want do clone
10667 something that is bad **/
10669 if(SvTYPE(sstr) == SVt_PVHV &&
10671 /** don't clone stashes if they already exist **/
10672 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10673 return (SV*) old_stash;
10677 /* create anew and remember what it is */
10680 #ifdef DEBUG_LEAKING_SCALARS
10681 dstr->sv_debug_optype = sstr->sv_debug_optype;
10682 dstr->sv_debug_line = sstr->sv_debug_line;
10683 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10684 dstr->sv_debug_cloned = 1;
10686 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10688 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10692 ptr_table_store(PL_ptr_table, sstr, dstr);
10695 SvFLAGS(dstr) = SvFLAGS(sstr);
10696 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10697 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10700 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10701 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10702 PL_watch_pvx, SvPVX(sstr));
10705 /* don't clone objects whose class has asked us not to */
10706 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10707 SvFLAGS(dstr) &= ~SVTYPEMASK;
10708 SvOBJECT_off(dstr);
10712 switch (SvTYPE(sstr)) {
10714 SvANY(dstr) = NULL;
10717 SvANY(dstr) = new_XIV();
10718 SvIV_set(dstr, SvIVX(sstr));
10721 SvANY(dstr) = new_XNV();
10722 SvNV_set(dstr, SvNVX(sstr));
10725 SvANY(dstr) = new_XRV();
10726 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10729 SvANY(dstr) = new_XPV();
10730 SvCUR_set(dstr, SvCUR(sstr));
10731 SvLEN_set(dstr, SvLEN(sstr));
10732 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10735 SvANY(dstr) = new_XPVIV();
10736 SvCUR_set(dstr, SvCUR(sstr));
10737 SvLEN_set(dstr, SvLEN(sstr));
10738 SvIV_set(dstr, SvIVX(sstr));
10739 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10742 SvANY(dstr) = new_XPVNV();
10743 SvCUR_set(dstr, SvCUR(sstr));
10744 SvLEN_set(dstr, SvLEN(sstr));
10745 SvIV_set(dstr, SvIVX(sstr));
10746 SvNV_set(dstr, SvNVX(sstr));
10747 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10750 SvANY(dstr) = new_XPVMG();
10751 SvCUR_set(dstr, SvCUR(sstr));
10752 SvLEN_set(dstr, SvLEN(sstr));
10753 SvIV_set(dstr, SvIVX(sstr));
10754 SvNV_set(dstr, SvNVX(sstr));
10755 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10756 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10757 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10760 SvANY(dstr) = new_XPVBM();
10761 SvCUR_set(dstr, SvCUR(sstr));
10762 SvLEN_set(dstr, SvLEN(sstr));
10763 SvIV_set(dstr, SvIVX(sstr));
10764 SvNV_set(dstr, SvNVX(sstr));
10765 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10766 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10767 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10768 BmRARE(dstr) = BmRARE(sstr);
10769 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10770 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10773 SvANY(dstr) = new_XPVLV();
10774 SvCUR_set(dstr, SvCUR(sstr));
10775 SvLEN_set(dstr, SvLEN(sstr));
10776 SvIV_set(dstr, SvIVX(sstr));
10777 SvNV_set(dstr, SvNVX(sstr));
10778 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10779 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10780 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10781 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10782 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10783 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10784 LvTARG(dstr) = dstr;
10785 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10786 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10788 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10789 LvTYPE(dstr) = LvTYPE(sstr);
10792 if (GvUNIQUE((GV*)sstr)) {
10794 if ((share = gv_share(sstr, param))) {
10797 ptr_table_store(PL_ptr_table, sstr, dstr);
10799 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10800 HvNAME(GvSTASH(share)), GvNAME(share));
10805 SvANY(dstr) = new_XPVGV();
10806 SvCUR_set(dstr, SvCUR(sstr));
10807 SvLEN_set(dstr, SvLEN(sstr));
10808 SvIV_set(dstr, SvIVX(sstr));
10809 SvNV_set(dstr, SvNVX(sstr));
10810 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10811 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10812 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10813 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10814 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10815 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10816 GvFLAGS(dstr) = GvFLAGS(sstr);
10817 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10818 (void)GpREFCNT_inc(GvGP(dstr));
10821 SvANY(dstr) = new_XPVIO();
10822 SvCUR_set(dstr, SvCUR(sstr));
10823 SvLEN_set(dstr, SvLEN(sstr));
10824 SvIV_set(dstr, SvIVX(sstr));
10825 SvNV_set(dstr, SvNVX(sstr));
10826 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10827 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10828 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10829 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10830 if (IoOFP(sstr) == IoIFP(sstr))
10831 IoOFP(dstr) = IoIFP(dstr);
10833 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10834 /* PL_rsfp_filters entries have fake IoDIRP() */
10835 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10836 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10838 IoDIRP(dstr) = IoDIRP(sstr);
10839 IoLINES(dstr) = IoLINES(sstr);
10840 IoPAGE(dstr) = IoPAGE(sstr);
10841 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10842 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10843 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10844 /* I have no idea why fake dirp (rsfps)
10845 should be treaded differently but otherwise
10846 we end up with leaks -- sky*/
10847 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10848 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10849 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10851 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10852 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10853 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10855 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10856 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10857 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10858 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10859 IoTYPE(dstr) = IoTYPE(sstr);
10860 IoFLAGS(dstr) = IoFLAGS(sstr);
10863 SvANY(dstr) = new_XPVAV();
10864 SvCUR_set(dstr, SvCUR(sstr));
10865 SvLEN_set(dstr, SvLEN(sstr));
10866 SvIV_set(dstr, SvIVX(sstr));
10867 SvNV_set(dstr, SvNVX(sstr));
10868 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10869 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10870 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10871 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10872 if (AvARRAY((AV*)sstr)) {
10873 SV **dst_ary, **src_ary;
10874 SSize_t items = AvFILLp((AV*)sstr) + 1;
10876 src_ary = AvARRAY((AV*)sstr);
10877 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10878 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10879 SvPV_set(dstr, (char*)dst_ary);
10880 AvALLOC((AV*)dstr) = dst_ary;
10881 if (AvREAL((AV*)sstr)) {
10882 while (items-- > 0)
10883 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10886 while (items-- > 0)
10887 *dst_ary++ = sv_dup(*src_ary++, param);
10889 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10890 while (items-- > 0) {
10891 *dst_ary++ = &PL_sv_undef;
10895 SvPV_set(dstr, Nullch);
10896 AvALLOC((AV*)dstr) = (SV**)NULL;
10900 SvANY(dstr) = new_XPVHV();
10901 SvCUR_set(dstr, SvCUR(sstr));
10902 SvLEN_set(dstr, SvLEN(sstr));
10903 SvIV_set(dstr, SvIVX(sstr));
10904 SvNV_set(dstr, SvNVX(sstr));
10905 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10906 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10907 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10908 if (HvARRAY((HV*)sstr)) {
10910 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10911 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10912 Newz(0, dxhv->xhv_array,
10913 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10914 while (i <= sxhv->xhv_max) {
10915 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10916 (bool)!!HvSHAREKEYS(sstr),
10920 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10921 (bool)!!HvSHAREKEYS(sstr), param);
10924 SvPV_set(dstr, Nullch);
10925 HvEITER((HV*)dstr) = (HE*)NULL;
10927 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10928 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10929 /* Record stashes for possible cloning in Perl_clone(). */
10930 if(HvNAME((HV*)dstr))
10931 av_push(param->stashes, dstr);
10934 SvANY(dstr) = new_XPVFM();
10935 FmLINES(dstr) = FmLINES(sstr);
10939 SvANY(dstr) = new_XPVCV();
10941 SvCUR_set(dstr, SvCUR(sstr));
10942 SvLEN_set(dstr, SvLEN(sstr));
10943 SvIV_set(dstr, SvIVX(sstr));
10944 SvNV_set(dstr, SvNVX(sstr));
10945 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10946 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10947 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10948 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10949 CvSTART(dstr) = CvSTART(sstr);
10951 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10953 CvXSUB(dstr) = CvXSUB(sstr);
10954 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10955 if (CvCONST(sstr)) {
10956 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10957 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10958 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
10960 /* don't dup if copying back - CvGV isn't refcounted, so the
10961 * duped GV may never be freed. A bit of a hack! DAPM */
10962 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10963 Nullgv : gv_dup(CvGV(sstr), param) ;
10964 if (param->flags & CLONEf_COPY_STACKS) {
10965 CvDEPTH(dstr) = CvDEPTH(sstr);
10969 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10970 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10972 CvWEAKOUTSIDE(sstr)
10973 ? cv_dup( CvOUTSIDE(sstr), param)
10974 : cv_dup_inc(CvOUTSIDE(sstr), param);
10975 CvFLAGS(dstr) = CvFLAGS(sstr);
10976 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10979 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10983 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10989 /* duplicate a context */
10992 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10994 PERL_CONTEXT *ncxs;
10997 return (PERL_CONTEXT*)NULL;
10999 /* look for it in the table first */
11000 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11004 /* create anew and remember what it is */
11005 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11006 ptr_table_store(PL_ptr_table, cxs, ncxs);
11009 PERL_CONTEXT *cx = &cxs[ix];
11010 PERL_CONTEXT *ncx = &ncxs[ix];
11011 ncx->cx_type = cx->cx_type;
11012 if (CxTYPE(cx) == CXt_SUBST) {
11013 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11016 ncx->blk_oldsp = cx->blk_oldsp;
11017 ncx->blk_oldcop = cx->blk_oldcop;
11018 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11019 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11020 ncx->blk_oldpm = cx->blk_oldpm;
11021 ncx->blk_gimme = cx->blk_gimme;
11022 switch (CxTYPE(cx)) {
11024 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11025 ? cv_dup_inc(cx->blk_sub.cv, param)
11026 : cv_dup(cx->blk_sub.cv,param));
11027 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11028 ? av_dup_inc(cx->blk_sub.argarray, param)
11030 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11031 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11032 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11033 ncx->blk_sub.lval = cx->blk_sub.lval;
11034 ncx->blk_sub.retop = cx->blk_sub.retop;
11037 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11038 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11039 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11040 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11041 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11042 ncx->blk_eval.retop = cx->blk_eval.retop;
11045 ncx->blk_loop.label = cx->blk_loop.label;
11046 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11047 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11048 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11049 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11050 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11051 ? cx->blk_loop.iterdata
11052 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11053 ncx->blk_loop.oldcomppad
11054 = (PAD*)ptr_table_fetch(PL_ptr_table,
11055 cx->blk_loop.oldcomppad);
11056 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11057 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11058 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11059 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11060 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11063 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11064 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11065 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11066 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11067 ncx->blk_sub.retop = cx->blk_sub.retop;
11079 /* duplicate a stack info structure */
11082 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11087 return (PERL_SI*)NULL;
11089 /* look for it in the table first */
11090 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11094 /* create anew and remember what it is */
11095 Newz(56, nsi, 1, PERL_SI);
11096 ptr_table_store(PL_ptr_table, si, nsi);
11098 nsi->si_stack = av_dup_inc(si->si_stack, param);
11099 nsi->si_cxix = si->si_cxix;
11100 nsi->si_cxmax = si->si_cxmax;
11101 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11102 nsi->si_type = si->si_type;
11103 nsi->si_prev = si_dup(si->si_prev, param);
11104 nsi->si_next = si_dup(si->si_next, param);
11105 nsi->si_markoff = si->si_markoff;
11110 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11111 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11112 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11113 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11114 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11115 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11116 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11117 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11118 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11119 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11120 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11121 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11122 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11123 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11126 #define pv_dup_inc(p) SAVEPV(p)
11127 #define pv_dup(p) SAVEPV(p)
11128 #define svp_dup_inc(p,pp) any_dup(p,pp)
11130 /* map any object to the new equivent - either something in the
11131 * ptr table, or something in the interpreter structure
11135 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11140 return (void*)NULL;
11142 /* look for it in the table first */
11143 ret = ptr_table_fetch(PL_ptr_table, v);
11147 /* see if it is part of the interpreter structure */
11148 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11149 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11157 /* duplicate the save stack */
11160 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11162 ANY *ss = proto_perl->Tsavestack;
11163 I32 ix = proto_perl->Tsavestack_ix;
11164 I32 max = proto_perl->Tsavestack_max;
11177 void (*dptr) (void*);
11178 void (*dxptr) (pTHX_ void*);
11181 Newz(54, nss, max, ANY);
11185 TOPINT(nss,ix) = i;
11187 case SAVEt_ITEM: /* normal string */
11188 sv = (SV*)POPPTR(ss,ix);
11189 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11190 sv = (SV*)POPPTR(ss,ix);
11191 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11193 case SAVEt_SV: /* scalar reference */
11194 sv = (SV*)POPPTR(ss,ix);
11195 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11196 gv = (GV*)POPPTR(ss,ix);
11197 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11199 case SAVEt_GENERIC_PVREF: /* generic char* */
11200 c = (char*)POPPTR(ss,ix);
11201 TOPPTR(nss,ix) = pv_dup(c);
11202 ptr = POPPTR(ss,ix);
11203 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11205 case SAVEt_SHARED_PVREF: /* char* in shared space */
11206 c = (char*)POPPTR(ss,ix);
11207 TOPPTR(nss,ix) = savesharedpv(c);
11208 ptr = POPPTR(ss,ix);
11209 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11211 case SAVEt_GENERIC_SVREF: /* generic sv */
11212 case SAVEt_SVREF: /* scalar reference */
11213 sv = (SV*)POPPTR(ss,ix);
11214 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11215 ptr = POPPTR(ss,ix);
11216 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11218 case SAVEt_AV: /* array reference */
11219 av = (AV*)POPPTR(ss,ix);
11220 TOPPTR(nss,ix) = av_dup_inc(av, param);
11221 gv = (GV*)POPPTR(ss,ix);
11222 TOPPTR(nss,ix) = gv_dup(gv, param);
11224 case SAVEt_HV: /* hash reference */
11225 hv = (HV*)POPPTR(ss,ix);
11226 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11227 gv = (GV*)POPPTR(ss,ix);
11228 TOPPTR(nss,ix) = gv_dup(gv, param);
11230 case SAVEt_INT: /* int reference */
11231 ptr = POPPTR(ss,ix);
11232 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11233 intval = (int)POPINT(ss,ix);
11234 TOPINT(nss,ix) = intval;
11236 case SAVEt_LONG: /* long reference */
11237 ptr = POPPTR(ss,ix);
11238 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11239 longval = (long)POPLONG(ss,ix);
11240 TOPLONG(nss,ix) = longval;
11242 case SAVEt_I32: /* I32 reference */
11243 case SAVEt_I16: /* I16 reference */
11244 case SAVEt_I8: /* I8 reference */
11245 ptr = POPPTR(ss,ix);
11246 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11248 TOPINT(nss,ix) = i;
11250 case SAVEt_IV: /* IV reference */
11251 ptr = POPPTR(ss,ix);
11252 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11254 TOPIV(nss,ix) = iv;
11256 case SAVEt_SPTR: /* SV* reference */
11257 ptr = POPPTR(ss,ix);
11258 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11259 sv = (SV*)POPPTR(ss,ix);
11260 TOPPTR(nss,ix) = sv_dup(sv, param);
11262 case SAVEt_VPTR: /* random* reference */
11263 ptr = POPPTR(ss,ix);
11264 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11265 ptr = POPPTR(ss,ix);
11266 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11268 case SAVEt_PPTR: /* char* reference */
11269 ptr = POPPTR(ss,ix);
11270 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11271 c = (char*)POPPTR(ss,ix);
11272 TOPPTR(nss,ix) = pv_dup(c);
11274 case SAVEt_HPTR: /* HV* reference */
11275 ptr = POPPTR(ss,ix);
11276 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11277 hv = (HV*)POPPTR(ss,ix);
11278 TOPPTR(nss,ix) = hv_dup(hv, param);
11280 case SAVEt_APTR: /* AV* reference */
11281 ptr = POPPTR(ss,ix);
11282 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11283 av = (AV*)POPPTR(ss,ix);
11284 TOPPTR(nss,ix) = av_dup(av, param);
11287 gv = (GV*)POPPTR(ss,ix);
11288 TOPPTR(nss,ix) = gv_dup(gv, param);
11290 case SAVEt_GP: /* scalar reference */
11291 gp = (GP*)POPPTR(ss,ix);
11292 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11293 (void)GpREFCNT_inc(gp);
11294 gv = (GV*)POPPTR(ss,ix);
11295 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11296 c = (char*)POPPTR(ss,ix);
11297 TOPPTR(nss,ix) = pv_dup(c);
11299 TOPIV(nss,ix) = iv;
11301 TOPIV(nss,ix) = iv;
11304 case SAVEt_MORTALIZESV:
11305 sv = (SV*)POPPTR(ss,ix);
11306 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11309 ptr = POPPTR(ss,ix);
11310 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11311 /* these are assumed to be refcounted properly */
11312 switch (((OP*)ptr)->op_type) {
11314 case OP_LEAVESUBLV:
11318 case OP_LEAVEWRITE:
11319 TOPPTR(nss,ix) = ptr;
11324 TOPPTR(nss,ix) = Nullop;
11329 TOPPTR(nss,ix) = Nullop;
11332 c = (char*)POPPTR(ss,ix);
11333 TOPPTR(nss,ix) = pv_dup_inc(c);
11335 case SAVEt_CLEARSV:
11336 longval = POPLONG(ss,ix);
11337 TOPLONG(nss,ix) = longval;
11340 hv = (HV*)POPPTR(ss,ix);
11341 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11342 c = (char*)POPPTR(ss,ix);
11343 TOPPTR(nss,ix) = pv_dup_inc(c);
11345 TOPINT(nss,ix) = i;
11347 case SAVEt_DESTRUCTOR:
11348 ptr = POPPTR(ss,ix);
11349 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11350 dptr = POPDPTR(ss,ix);
11351 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11353 case SAVEt_DESTRUCTOR_X:
11354 ptr = POPPTR(ss,ix);
11355 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11356 dxptr = POPDXPTR(ss,ix);
11357 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11359 case SAVEt_REGCONTEXT:
11362 TOPINT(nss,ix) = i;
11365 case SAVEt_STACK_POS: /* Position on Perl stack */
11367 TOPINT(nss,ix) = i;
11369 case SAVEt_AELEM: /* array element */
11370 sv = (SV*)POPPTR(ss,ix);
11371 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11373 TOPINT(nss,ix) = i;
11374 av = (AV*)POPPTR(ss,ix);
11375 TOPPTR(nss,ix) = av_dup_inc(av, param);
11377 case SAVEt_HELEM: /* hash element */
11378 sv = (SV*)POPPTR(ss,ix);
11379 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11380 sv = (SV*)POPPTR(ss,ix);
11381 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11382 hv = (HV*)POPPTR(ss,ix);
11383 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11386 ptr = POPPTR(ss,ix);
11387 TOPPTR(nss,ix) = ptr;
11391 TOPINT(nss,ix) = i;
11393 case SAVEt_COMPPAD:
11394 av = (AV*)POPPTR(ss,ix);
11395 TOPPTR(nss,ix) = av_dup(av, param);
11398 longval = (long)POPLONG(ss,ix);
11399 TOPLONG(nss,ix) = longval;
11400 ptr = POPPTR(ss,ix);
11401 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11402 sv = (SV*)POPPTR(ss,ix);
11403 TOPPTR(nss,ix) = sv_dup(sv, param);
11406 ptr = POPPTR(ss,ix);
11407 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11408 longval = (long)POPBOOL(ss,ix);
11409 TOPBOOL(nss,ix) = (bool)longval;
11411 case SAVEt_SET_SVFLAGS:
11413 TOPINT(nss,ix) = i;
11415 TOPINT(nss,ix) = i;
11416 sv = (SV*)POPPTR(ss,ix);
11417 TOPPTR(nss,ix) = sv_dup(sv, param);
11420 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11428 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11429 * flag to the result. This is done for each stash before cloning starts,
11430 * so we know which stashes want their objects cloned */
11433 do_mark_cloneable_stash(pTHX_ SV *sv)
11435 if (HvNAME((HV*)sv)) {
11436 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11437 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11438 if (cloner && GvCV(cloner)) {
11445 XPUSHs(sv_2mortal(newSVpv(HvNAME((HV*)sv), 0)));
11447 call_sv((SV*)GvCV(cloner), G_SCALAR);
11454 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11462 =for apidoc perl_clone
11464 Create and return a new interpreter by cloning the current one.
11466 perl_clone takes these flags as parameters:
11468 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11469 without it we only clone the data and zero the stacks,
11470 with it we copy the stacks and the new perl interpreter is
11471 ready to run at the exact same point as the previous one.
11472 The pseudo-fork code uses COPY_STACKS while the
11473 threads->new doesn't.
11475 CLONEf_KEEP_PTR_TABLE
11476 perl_clone keeps a ptr_table with the pointer of the old
11477 variable as a key and the new variable as a value,
11478 this allows it to check if something has been cloned and not
11479 clone it again but rather just use the value and increase the
11480 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11481 the ptr_table using the function
11482 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11483 reason to keep it around is if you want to dup some of your own
11484 variable who are outside the graph perl scans, example of this
11485 code is in threads.xs create
11488 This is a win32 thing, it is ignored on unix, it tells perls
11489 win32host code (which is c++) to clone itself, this is needed on
11490 win32 if you want to run two threads at the same time,
11491 if you just want to do some stuff in a separate perl interpreter
11492 and then throw it away and return to the original one,
11493 you don't need to do anything.
11498 /* XXX the above needs expanding by someone who actually understands it ! */
11499 EXTERN_C PerlInterpreter *
11500 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11503 perl_clone(PerlInterpreter *proto_perl, UV flags)
11506 #ifdef PERL_IMPLICIT_SYS
11508 /* perlhost.h so we need to call into it
11509 to clone the host, CPerlHost should have a c interface, sky */
11511 if (flags & CLONEf_CLONE_HOST) {
11512 return perl_clone_host(proto_perl,flags);
11514 return perl_clone_using(proto_perl, flags,
11516 proto_perl->IMemShared,
11517 proto_perl->IMemParse,
11519 proto_perl->IStdIO,
11523 proto_perl->IProc);
11527 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11528 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11529 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11530 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11531 struct IPerlDir* ipD, struct IPerlSock* ipS,
11532 struct IPerlProc* ipP)
11534 /* XXX many of the string copies here can be optimized if they're
11535 * constants; they need to be allocated as common memory and just
11536 * their pointers copied. */
11539 CLONE_PARAMS clone_params;
11540 CLONE_PARAMS* param = &clone_params;
11542 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11543 /* for each stash, determine whether its objects should be cloned */
11544 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11545 PERL_SET_THX(my_perl);
11548 Poison(my_perl, 1, PerlInterpreter);
11550 PL_curcop = (COP *)Nullop;
11554 PL_savestack_ix = 0;
11555 PL_savestack_max = -1;
11556 PL_sig_pending = 0;
11557 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11558 # else /* !DEBUGGING */
11559 Zero(my_perl, 1, PerlInterpreter);
11560 # endif /* DEBUGGING */
11562 /* host pointers */
11564 PL_MemShared = ipMS;
11565 PL_MemParse = ipMP;
11572 #else /* !PERL_IMPLICIT_SYS */
11574 CLONE_PARAMS clone_params;
11575 CLONE_PARAMS* param = &clone_params;
11576 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11577 /* for each stash, determine whether its objects should be cloned */
11578 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11579 PERL_SET_THX(my_perl);
11582 Poison(my_perl, 1, PerlInterpreter);
11584 PL_curcop = (COP *)Nullop;
11588 PL_savestack_ix = 0;
11589 PL_savestack_max = -1;
11590 PL_sig_pending = 0;
11591 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11592 # else /* !DEBUGGING */
11593 Zero(my_perl, 1, PerlInterpreter);
11594 # endif /* DEBUGGING */
11595 #endif /* PERL_IMPLICIT_SYS */
11596 param->flags = flags;
11597 param->proto_perl = proto_perl;
11600 PL_xiv_arenaroot = NULL;
11601 PL_xiv_root = NULL;
11602 PL_xnv_arenaroot = NULL;
11603 PL_xnv_root = NULL;
11604 PL_xrv_arenaroot = NULL;
11605 PL_xrv_root = NULL;
11606 PL_xpv_arenaroot = NULL;
11607 PL_xpv_root = NULL;
11608 PL_xpviv_arenaroot = NULL;
11609 PL_xpviv_root = NULL;
11610 PL_xpvnv_arenaroot = NULL;
11611 PL_xpvnv_root = NULL;
11612 PL_xpvcv_arenaroot = NULL;
11613 PL_xpvcv_root = NULL;
11614 PL_xpvav_arenaroot = NULL;
11615 PL_xpvav_root = NULL;
11616 PL_xpvhv_arenaroot = NULL;
11617 PL_xpvhv_root = NULL;
11618 PL_xpvmg_arenaroot = NULL;
11619 PL_xpvmg_root = NULL;
11620 PL_xpvlv_arenaroot = NULL;
11621 PL_xpvlv_root = NULL;
11622 PL_xpvbm_arenaroot = NULL;
11623 PL_xpvbm_root = NULL;
11624 PL_he_arenaroot = NULL;
11626 PL_nice_chunk = NULL;
11627 PL_nice_chunk_size = 0;
11629 PL_sv_objcount = 0;
11630 PL_sv_root = Nullsv;
11631 PL_sv_arenaroot = Nullsv;
11633 PL_debug = proto_perl->Idebug;
11635 #ifdef USE_REENTRANT_API
11636 /* XXX: things like -Dm will segfault here in perlio, but doing
11637 * PERL_SET_CONTEXT(proto_perl);
11638 * breaks too many other things
11640 Perl_reentrant_init(aTHX);
11643 /* create SV map for pointer relocation */
11644 PL_ptr_table = ptr_table_new();
11646 /* initialize these special pointers as early as possible */
11647 SvANY(&PL_sv_undef) = NULL;
11648 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11649 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11650 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11652 SvANY(&PL_sv_no) = new_XPVNV();
11653 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11654 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11655 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11656 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11657 SvCUR_set(&PL_sv_no, 0);
11658 SvLEN_set(&PL_sv_no, 1);
11659 SvIV_set(&PL_sv_no, 0);
11660 SvNV_set(&PL_sv_no, 0);
11661 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11663 SvANY(&PL_sv_yes) = new_XPVNV();
11664 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11665 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11666 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11667 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11668 SvCUR_set(&PL_sv_yes, 1);
11669 SvLEN_set(&PL_sv_yes, 2);
11670 SvIV_set(&PL_sv_yes, 1);
11671 SvNV_set(&PL_sv_yes, 1);
11672 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11674 /* create (a non-shared!) shared string table */
11675 PL_strtab = newHV();
11676 HvSHAREKEYS_off(PL_strtab);
11677 hv_ksplit(PL_strtab, 512);
11678 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11680 PL_compiling = proto_perl->Icompiling;
11682 /* These two PVs will be free'd special way so must set them same way op.c does */
11683 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11684 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11686 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11687 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11689 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11690 if (!specialWARN(PL_compiling.cop_warnings))
11691 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11692 if (!specialCopIO(PL_compiling.cop_io))
11693 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11694 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11696 /* pseudo environmental stuff */
11697 PL_origargc = proto_perl->Iorigargc;
11698 PL_origargv = proto_perl->Iorigargv;
11700 param->stashes = newAV(); /* Setup array of objects to call clone on */
11702 #ifdef PERLIO_LAYERS
11703 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11704 PerlIO_clone(aTHX_ proto_perl, param);
11707 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11708 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11709 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11710 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11711 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11712 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11715 PL_minus_c = proto_perl->Iminus_c;
11716 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11717 PL_localpatches = proto_perl->Ilocalpatches;
11718 PL_splitstr = proto_perl->Isplitstr;
11719 PL_preprocess = proto_perl->Ipreprocess;
11720 PL_minus_n = proto_perl->Iminus_n;
11721 PL_minus_p = proto_perl->Iminus_p;
11722 PL_minus_l = proto_perl->Iminus_l;
11723 PL_minus_a = proto_perl->Iminus_a;
11724 PL_minus_F = proto_perl->Iminus_F;
11725 PL_doswitches = proto_perl->Idoswitches;
11726 PL_dowarn = proto_perl->Idowarn;
11727 PL_doextract = proto_perl->Idoextract;
11728 PL_sawampersand = proto_perl->Isawampersand;
11729 PL_unsafe = proto_perl->Iunsafe;
11730 PL_inplace = SAVEPV(proto_perl->Iinplace);
11731 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11732 PL_perldb = proto_perl->Iperldb;
11733 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11734 PL_exit_flags = proto_perl->Iexit_flags;
11736 /* magical thingies */
11737 /* XXX time(&PL_basetime) when asked for? */
11738 PL_basetime = proto_perl->Ibasetime;
11739 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11741 PL_maxsysfd = proto_perl->Imaxsysfd;
11742 PL_multiline = proto_perl->Imultiline;
11743 PL_statusvalue = proto_perl->Istatusvalue;
11745 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11747 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11749 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11750 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11751 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11753 /* Clone the regex array */
11754 PL_regex_padav = newAV();
11756 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11757 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11758 av_push(PL_regex_padav,
11759 sv_dup_inc(regexen[0],param));
11760 for(i = 1; i <= len; i++) {
11761 if(SvREPADTMP(regexen[i])) {
11762 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11764 av_push(PL_regex_padav,
11766 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11767 SvIVX(regexen[i])), param)))
11772 PL_regex_pad = AvARRAY(PL_regex_padav);
11774 /* shortcuts to various I/O objects */
11775 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11776 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11777 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11778 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11779 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11780 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11782 /* shortcuts to regexp stuff */
11783 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11785 /* shortcuts to misc objects */
11786 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11788 /* shortcuts to debugging objects */
11789 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11790 PL_DBline = gv_dup(proto_perl->IDBline, param);
11791 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11792 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11793 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11794 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11795 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11796 PL_lineary = av_dup(proto_perl->Ilineary, param);
11797 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11799 /* symbol tables */
11800 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11801 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11802 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11803 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11804 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11806 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11807 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11808 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11809 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11810 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11811 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11813 PL_sub_generation = proto_perl->Isub_generation;
11815 /* funky return mechanisms */
11816 PL_forkprocess = proto_perl->Iforkprocess;
11818 /* subprocess state */
11819 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11821 /* internal state */
11822 PL_tainting = proto_perl->Itainting;
11823 PL_taint_warn = proto_perl->Itaint_warn;
11824 PL_maxo = proto_perl->Imaxo;
11825 if (proto_perl->Iop_mask)
11826 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11828 PL_op_mask = Nullch;
11829 /* PL_asserting = proto_perl->Iasserting; */
11831 /* current interpreter roots */
11832 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11833 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11834 PL_main_start = proto_perl->Imain_start;
11835 PL_eval_root = proto_perl->Ieval_root;
11836 PL_eval_start = proto_perl->Ieval_start;
11838 /* runtime control stuff */
11839 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11840 PL_copline = proto_perl->Icopline;
11842 PL_filemode = proto_perl->Ifilemode;
11843 PL_lastfd = proto_perl->Ilastfd;
11844 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11847 PL_gensym = proto_perl->Igensym;
11848 PL_preambled = proto_perl->Ipreambled;
11849 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11850 PL_laststatval = proto_perl->Ilaststatval;
11851 PL_laststype = proto_perl->Ilaststype;
11852 PL_mess_sv = Nullsv;
11854 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11855 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11857 /* interpreter atexit processing */
11858 PL_exitlistlen = proto_perl->Iexitlistlen;
11859 if (PL_exitlistlen) {
11860 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11861 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11864 PL_exitlist = (PerlExitListEntry*)NULL;
11865 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11866 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11867 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11869 PL_profiledata = NULL;
11870 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11871 /* PL_rsfp_filters entries have fake IoDIRP() */
11872 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11874 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11876 PAD_CLONE_VARS(proto_perl, param);
11878 #ifdef HAVE_INTERP_INTERN
11879 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11882 /* more statics moved here */
11883 PL_generation = proto_perl->Igeneration;
11884 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11886 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11887 PL_in_clean_all = proto_perl->Iin_clean_all;
11889 PL_uid = proto_perl->Iuid;
11890 PL_euid = proto_perl->Ieuid;
11891 PL_gid = proto_perl->Igid;
11892 PL_egid = proto_perl->Iegid;
11893 PL_nomemok = proto_perl->Inomemok;
11894 PL_an = proto_perl->Ian;
11895 PL_evalseq = proto_perl->Ievalseq;
11896 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11897 PL_origalen = proto_perl->Iorigalen;
11898 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11899 PL_osname = SAVEPV(proto_perl->Iosname);
11900 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11901 PL_sighandlerp = proto_perl->Isighandlerp;
11904 PL_runops = proto_perl->Irunops;
11906 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11909 PL_cshlen = proto_perl->Icshlen;
11910 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11913 PL_lex_state = proto_perl->Ilex_state;
11914 PL_lex_defer = proto_perl->Ilex_defer;
11915 PL_lex_expect = proto_perl->Ilex_expect;
11916 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11917 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11918 PL_lex_starts = proto_perl->Ilex_starts;
11919 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11920 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11921 PL_lex_op = proto_perl->Ilex_op;
11922 PL_lex_inpat = proto_perl->Ilex_inpat;
11923 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11924 PL_lex_brackets = proto_perl->Ilex_brackets;
11925 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11926 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11927 PL_lex_casemods = proto_perl->Ilex_casemods;
11928 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11929 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11931 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11932 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11933 PL_nexttoke = proto_perl->Inexttoke;
11935 /* XXX This is probably masking the deeper issue of why
11936 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11937 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11938 * (A little debugging with a watchpoint on it may help.)
11940 if (SvANY(proto_perl->Ilinestr)) {
11941 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11942 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11943 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11944 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11945 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11946 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11947 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11948 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11949 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11952 PL_linestr = NEWSV(65,79);
11953 sv_upgrade(PL_linestr,SVt_PVIV);
11954 sv_setpvn(PL_linestr,"",0);
11955 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11957 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11958 PL_pending_ident = proto_perl->Ipending_ident;
11959 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11961 PL_expect = proto_perl->Iexpect;
11963 PL_multi_start = proto_perl->Imulti_start;
11964 PL_multi_end = proto_perl->Imulti_end;
11965 PL_multi_open = proto_perl->Imulti_open;
11966 PL_multi_close = proto_perl->Imulti_close;
11968 PL_error_count = proto_perl->Ierror_count;
11969 PL_subline = proto_perl->Isubline;
11970 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11972 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11973 if (SvANY(proto_perl->Ilinestr)) {
11974 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11975 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11976 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11977 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11978 PL_last_lop_op = proto_perl->Ilast_lop_op;
11981 PL_last_uni = SvPVX(PL_linestr);
11982 PL_last_lop = SvPVX(PL_linestr);
11983 PL_last_lop_op = 0;
11985 PL_in_my = proto_perl->Iin_my;
11986 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11988 PL_cryptseen = proto_perl->Icryptseen;
11991 PL_hints = proto_perl->Ihints;
11993 PL_amagic_generation = proto_perl->Iamagic_generation;
11995 #ifdef USE_LOCALE_COLLATE
11996 PL_collation_ix = proto_perl->Icollation_ix;
11997 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11998 PL_collation_standard = proto_perl->Icollation_standard;
11999 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12000 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12001 #endif /* USE_LOCALE_COLLATE */
12003 #ifdef USE_LOCALE_NUMERIC
12004 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12005 PL_numeric_standard = proto_perl->Inumeric_standard;
12006 PL_numeric_local = proto_perl->Inumeric_local;
12007 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12008 #endif /* !USE_LOCALE_NUMERIC */
12010 /* utf8 character classes */
12011 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12012 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12013 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12014 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12015 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12016 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12017 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12018 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12019 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12020 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12021 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12022 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12023 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12024 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12025 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12026 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12027 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12028 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12029 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12030 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12032 /* Did the locale setup indicate UTF-8? */
12033 PL_utf8locale = proto_perl->Iutf8locale;
12034 /* Unicode features (see perlrun/-C) */
12035 PL_unicode = proto_perl->Iunicode;
12037 /* Pre-5.8 signals control */
12038 PL_signals = proto_perl->Isignals;
12040 /* times() ticks per second */
12041 PL_clocktick = proto_perl->Iclocktick;
12043 /* Recursion stopper for PerlIO_find_layer */
12044 PL_in_load_module = proto_perl->Iin_load_module;
12046 /* sort() routine */
12047 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12049 /* Not really needed/useful since the reenrant_retint is "volatile",
12050 * but do it for consistency's sake. */
12051 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12053 /* Hooks to shared SVs and locks. */
12054 PL_sharehook = proto_perl->Isharehook;
12055 PL_lockhook = proto_perl->Ilockhook;
12056 PL_unlockhook = proto_perl->Iunlockhook;
12057 PL_threadhook = proto_perl->Ithreadhook;
12059 PL_runops_std = proto_perl->Irunops_std;
12060 PL_runops_dbg = proto_perl->Irunops_dbg;
12062 #ifdef THREADS_HAVE_PIDS
12063 PL_ppid = proto_perl->Ippid;
12067 PL_last_swash_hv = Nullhv; /* reinits on demand */
12068 PL_last_swash_klen = 0;
12069 PL_last_swash_key[0]= '\0';
12070 PL_last_swash_tmps = (U8*)NULL;
12071 PL_last_swash_slen = 0;
12073 PL_glob_index = proto_perl->Iglob_index;
12074 PL_srand_called = proto_perl->Isrand_called;
12075 PL_hash_seed = proto_perl->Ihash_seed;
12076 PL_rehash_seed = proto_perl->Irehash_seed;
12077 PL_uudmap['M'] = 0; /* reinits on demand */
12078 PL_bitcount = Nullch; /* reinits on demand */
12080 if (proto_perl->Ipsig_pend) {
12081 Newz(0, PL_psig_pend, SIG_SIZE, int);
12084 PL_psig_pend = (int*)NULL;
12087 if (proto_perl->Ipsig_ptr) {
12088 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12089 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12090 for (i = 1; i < SIG_SIZE; i++) {
12091 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12092 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12096 PL_psig_ptr = (SV**)NULL;
12097 PL_psig_name = (SV**)NULL;
12100 /* thrdvar.h stuff */
12102 if (flags & CLONEf_COPY_STACKS) {
12103 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12104 PL_tmps_ix = proto_perl->Ttmps_ix;
12105 PL_tmps_max = proto_perl->Ttmps_max;
12106 PL_tmps_floor = proto_perl->Ttmps_floor;
12107 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12109 while (i <= PL_tmps_ix) {
12110 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12114 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12115 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12116 Newz(54, PL_markstack, i, I32);
12117 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12118 - proto_perl->Tmarkstack);
12119 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12120 - proto_perl->Tmarkstack);
12121 Copy(proto_perl->Tmarkstack, PL_markstack,
12122 PL_markstack_ptr - PL_markstack + 1, I32);
12124 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12125 * NOTE: unlike the others! */
12126 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12127 PL_scopestack_max = proto_perl->Tscopestack_max;
12128 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12129 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12131 /* NOTE: si_dup() looks at PL_markstack */
12132 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12134 /* PL_curstack = PL_curstackinfo->si_stack; */
12135 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12136 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12138 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12139 PL_stack_base = AvARRAY(PL_curstack);
12140 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12141 - proto_perl->Tstack_base);
12142 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12144 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12145 * NOTE: unlike the others! */
12146 PL_savestack_ix = proto_perl->Tsavestack_ix;
12147 PL_savestack_max = proto_perl->Tsavestack_max;
12148 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12149 PL_savestack = ss_dup(proto_perl, param);
12153 ENTER; /* perl_destruct() wants to LEAVE; */
12156 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12157 PL_top_env = &PL_start_env;
12159 PL_op = proto_perl->Top;
12162 PL_Xpv = (XPV*)NULL;
12163 PL_na = proto_perl->Tna;
12165 PL_statbuf = proto_perl->Tstatbuf;
12166 PL_statcache = proto_perl->Tstatcache;
12167 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12168 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12170 PL_timesbuf = proto_perl->Ttimesbuf;
12173 PL_tainted = proto_perl->Ttainted;
12174 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12175 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12176 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12177 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12178 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12179 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12180 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12181 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12182 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12184 PL_restartop = proto_perl->Trestartop;
12185 PL_in_eval = proto_perl->Tin_eval;
12186 PL_delaymagic = proto_perl->Tdelaymagic;
12187 PL_dirty = proto_perl->Tdirty;
12188 PL_localizing = proto_perl->Tlocalizing;
12190 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12191 PL_hv_fetch_ent_mh = Nullhe;
12192 PL_modcount = proto_perl->Tmodcount;
12193 PL_lastgotoprobe = Nullop;
12194 PL_dumpindent = proto_perl->Tdumpindent;
12196 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12197 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12198 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12199 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12200 PL_sortcxix = proto_perl->Tsortcxix;
12201 PL_efloatbuf = Nullch; /* reinits on demand */
12202 PL_efloatsize = 0; /* reinits on demand */
12206 PL_screamfirst = NULL;
12207 PL_screamnext = NULL;
12208 PL_maxscream = -1; /* reinits on demand */
12209 PL_lastscream = Nullsv;
12211 PL_watchaddr = NULL;
12212 PL_watchok = Nullch;
12214 PL_regdummy = proto_perl->Tregdummy;
12215 PL_regprecomp = Nullch;
12218 PL_colorset = 0; /* reinits PL_colors[] */
12219 /*PL_colors[6] = {0,0,0,0,0,0};*/
12220 PL_reginput = Nullch;
12221 PL_regbol = Nullch;
12222 PL_regeol = Nullch;
12223 PL_regstartp = (I32*)NULL;
12224 PL_regendp = (I32*)NULL;
12225 PL_reglastparen = (U32*)NULL;
12226 PL_reglastcloseparen = (U32*)NULL;
12227 PL_regtill = Nullch;
12228 PL_reg_start_tmp = (char**)NULL;
12229 PL_reg_start_tmpl = 0;
12230 PL_regdata = (struct reg_data*)NULL;
12233 PL_reg_eval_set = 0;
12235 PL_regprogram = (regnode*)NULL;
12237 PL_regcc = (CURCUR*)NULL;
12238 PL_reg_call_cc = (struct re_cc_state*)NULL;
12239 PL_reg_re = (regexp*)NULL;
12240 PL_reg_ganch = Nullch;
12241 PL_reg_sv = Nullsv;
12242 PL_reg_match_utf8 = FALSE;
12243 PL_reg_magic = (MAGIC*)NULL;
12245 PL_reg_oldcurpm = (PMOP*)NULL;
12246 PL_reg_curpm = (PMOP*)NULL;
12247 PL_reg_oldsaved = Nullch;
12248 PL_reg_oldsavedlen = 0;
12249 #ifdef PERL_COPY_ON_WRITE
12252 PL_reg_maxiter = 0;
12253 PL_reg_leftiter = 0;
12254 PL_reg_poscache = Nullch;
12255 PL_reg_poscache_size= 0;
12257 /* RE engine - function pointers */
12258 PL_regcompp = proto_perl->Tregcompp;
12259 PL_regexecp = proto_perl->Tregexecp;
12260 PL_regint_start = proto_perl->Tregint_start;
12261 PL_regint_string = proto_perl->Tregint_string;
12262 PL_regfree = proto_perl->Tregfree;
12264 PL_reginterp_cnt = 0;
12265 PL_reg_starttry = 0;
12267 /* Pluggable optimizer */
12268 PL_peepp = proto_perl->Tpeepp;
12270 PL_stashcache = newHV();
12272 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12273 ptr_table_free(PL_ptr_table);
12274 PL_ptr_table = NULL;
12277 /* Call the ->CLONE method, if it exists, for each of the stashes
12278 identified by sv_dup() above.
12280 while(av_len(param->stashes) != -1) {
12281 HV* stash = (HV*) av_shift(param->stashes);
12282 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12283 if (cloner && GvCV(cloner)) {
12288 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
12290 call_sv((SV*)GvCV(cloner), G_DISCARD);
12296 SvREFCNT_dec(param->stashes);
12301 #endif /* USE_ITHREADS */
12304 =head1 Unicode Support
12306 =for apidoc sv_recode_to_utf8
12308 The encoding is assumed to be an Encode object, on entry the PV
12309 of the sv is assumed to be octets in that encoding, and the sv
12310 will be converted into Unicode (and UTF-8).
12312 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12313 is not a reference, nothing is done to the sv. If the encoding is not
12314 an C<Encode::XS> Encoding object, bad things will happen.
12315 (See F<lib/encoding.pm> and L<Encode>).
12317 The PV of the sv is returned.
12322 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12325 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12339 Passing sv_yes is wrong - it needs to be or'ed set of constants
12340 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12341 remove converted chars from source.
12343 Both will default the value - let them.
12345 XPUSHs(&PL_sv_yes);
12348 call_method("decode", G_SCALAR);
12352 s = SvPV(uni, len);
12353 if (s != SvPVX(sv)) {
12354 SvGROW(sv, len + 1);
12355 Move(s, SvPVX(sv), len, char);
12356 SvCUR_set(sv, len);
12357 SvPVX(sv)[len] = 0;
12364 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12368 =for apidoc sv_cat_decode
12370 The encoding is assumed to be an Encode object, the PV of the ssv is
12371 assumed to be octets in that encoding and decoding the input starts
12372 from the position which (PV + *offset) pointed to. The dsv will be
12373 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12374 when the string tstr appears in decoding output or the input ends on
12375 the PV of the ssv. The value which the offset points will be modified
12376 to the last input position on the ssv.
12378 Returns TRUE if the terminator was found, else returns FALSE.
12383 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12384 SV *ssv, int *offset, char *tstr, int tlen)
12388 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12399 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12400 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12402 call_method("cat_decode", G_SCALAR);
12404 ret = SvTRUE(TOPs);
12405 *offset = SvIV(offsv);
12411 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12417 * c-indentation-style: bsd
12418 * c-basic-offset: 4
12419 * indent-tabs-mode: t
12422 * vim: shiftwidth=4: