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 by default are
67 approximately 4K chunks of memory parcelled up into N heads or bodies. The
68 first slot in each arena is reserved, and is used to hold a link to the next
69 arena. In the case of heads, the unused first slot also contains some flags
70 and 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 list.
74 The following global variables are associated with arenas:
76 PL_sv_arenaroot pointer to list of SV arenas
77 PL_sv_root pointer to list of free SV structures
79 PL_foo_arenaroot pointer to list of foo arenas,
80 PL_foo_root pointer to list of free foo bodies
81 ... for foo in xiv, xnv, xrv, xpv etc.
83 Note that some of the larger and more rarely used body types (eg xpvio)
84 are not allocated using arenas, but are instead just malloc()/free()ed as
85 required. Also, if PURIFY is defined, arenas are abandoned altogether,
86 with all items individually malloc()ed. In addition, a few SV heads are
87 not allocated from an arena, but are instead directly created as static
88 or auto variables, eg PL_sv_undef. The size of arenas can be changed from
89 the default by setting PERL_ARENA_SIZE appropriately at compile time.
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..."
169 #ifdef DEBUG_LEAKING_SCALARS
171 # define FREE_SV_DEBUG_FILE(sv) PerlMemfree((sv)->sv_debug_file)
173 # define FREE_SV_DEBUG_FILE(sv) PerlMemShared_free((sv)->sv_debug_file)
176 # define FREE_SV_DEBUG_FILE(sv)
179 #define plant_SV(p) \
181 FREE_SV_DEBUG_FILE(p); \
182 SvANY(p) = (void *)PL_sv_root; \
183 SvFLAGS(p) = SVTYPEMASK; \
188 /* sv_mutex must be held while calling uproot_SV() */
189 #define uproot_SV(p) \
192 PL_sv_root = (SV*)SvANY(p); \
197 /* make some more SVs by adding another arena */
199 /* sv_mutex must be held while calling more_sv() */
206 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
207 PL_nice_chunk = Nullch;
208 PL_nice_chunk_size = 0;
211 char *chunk; /* must use New here to match call to */
212 New(704,chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
213 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
219 /* new_SV(): return a new, empty SV head */
221 #ifdef DEBUG_LEAKING_SCALARS
222 /* provide a real function for a debugger to play with */
232 sv = S_more_sv(aTHX);
237 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
238 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
239 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
240 sv->sv_debug_inpad = 0;
241 sv->sv_debug_cloned = 0;
243 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
245 sv->sv_debug_file = PL_curcop ? savesharedpv(CopFILE(PL_curcop)): NULL;
250 # define new_SV(p) (p)=S_new_SV(aTHX)
259 (p) = S_more_sv(aTHX); \
268 /* del_SV(): return an empty SV head to the free list */
283 S_del_sv(pTHX_ SV *p)
288 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
290 SV *svend = &sva[SvREFCNT(sva)];
291 if (p >= sv && p < svend) {
297 if (ckWARN_d(WARN_INTERNAL))
298 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
299 "Attempt to free non-arena SV: 0x%"UVxf
300 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
307 #else /* ! DEBUGGING */
309 #define del_SV(p) plant_SV(p)
311 #endif /* DEBUGGING */
315 =head1 SV Manipulation Functions
317 =for apidoc sv_add_arena
319 Given a chunk of memory, link it to the head of the list of arenas,
320 and split it into a list of free SVs.
326 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
332 /* The first SV in an arena isn't an SV. */
333 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
334 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
335 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
337 PL_sv_arenaroot = sva;
338 PL_sv_root = sva + 1;
340 svend = &sva[SvREFCNT(sva) - 1];
343 SvANY(sv) = (void *)(SV*)(sv + 1);
347 /* Must always set typemask because it's awlays checked in on cleanup
348 when the arenas are walked looking for objects. */
349 SvFLAGS(sv) = SVTYPEMASK;
356 SvFLAGS(sv) = SVTYPEMASK;
359 /* visit(): call the named function for each non-free SV in the arenas
360 * whose flags field matches the flags/mask args. */
363 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
368 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
369 register SV * const svend = &sva[SvREFCNT(sva)];
371 for (sv = sva + 1; sv < svend; ++sv) {
372 if (SvTYPE(sv) != SVTYPEMASK
373 && (sv->sv_flags & mask) == flags
386 /* called by sv_report_used() for each live SV */
389 do_report_used(pTHX_ SV *sv)
391 if (SvTYPE(sv) != SVTYPEMASK) {
392 PerlIO_printf(Perl_debug_log, "****\n");
399 =for apidoc sv_report_used
401 Dump the contents of all SVs not yet freed. (Debugging aid).
407 Perl_sv_report_used(pTHX)
410 visit(do_report_used, 0, 0);
414 /* called by sv_clean_objs() for each live SV */
417 do_clean_objs(pTHX_ SV *sv)
421 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
422 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
434 /* XXX Might want to check arrays, etc. */
437 /* called by sv_clean_objs() for each live SV */
439 #ifndef DISABLE_DESTRUCTOR_KLUDGE
441 do_clean_named_objs(pTHX_ SV *sv)
443 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
444 if ( SvOBJECT(GvSV(sv)) ||
445 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
446 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
447 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
448 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
450 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
451 SvFLAGS(sv) |= SVf_BREAK;
459 =for apidoc sv_clean_objs
461 Attempt to destroy all objects not yet freed
467 Perl_sv_clean_objs(pTHX)
469 PL_in_clean_objs = TRUE;
470 visit(do_clean_objs, SVf_ROK, SVf_ROK);
471 #ifndef DISABLE_DESTRUCTOR_KLUDGE
472 /* some barnacles may yet remain, clinging to typeglobs */
473 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
475 PL_in_clean_objs = FALSE;
478 /* called by sv_clean_all() for each live SV */
481 do_clean_all(pTHX_ SV *sv)
483 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
484 SvFLAGS(sv) |= SVf_BREAK;
485 if (PL_comppad == (AV*)sv) {
487 PL_curpad = Null(SV**);
493 =for apidoc sv_clean_all
495 Decrement the refcnt of each remaining SV, possibly triggering a
496 cleanup. This function may have to be called multiple times to free
497 SVs which are in complex self-referential hierarchies.
503 Perl_sv_clean_all(pTHX)
506 PL_in_clean_all = TRUE;
507 cleaned = visit(do_clean_all, 0,0);
508 PL_in_clean_all = FALSE;
513 =for apidoc sv_free_arenas
515 Deallocate the memory used by all arenas. Note that all the individual SV
516 heads and bodies within the arenas must already have been freed.
522 Perl_sv_free_arenas(pTHX)
526 void *arena, *arenanext;
528 /* Free arenas here, but be careful about fake ones. (We assume
529 contiguity of the fake ones with the corresponding real ones.) */
531 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
532 svanext = (SV*) SvANY(sva);
533 while (svanext && SvFAKE(svanext))
534 svanext = (SV*) SvANY(svanext);
540 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
541 arenanext = *(void **)arena;
544 PL_xnv_arenaroot = 0;
547 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
548 arenanext = *(void **)arena;
551 PL_xpv_arenaroot = 0;
554 for (arena = PL_xpviv_arenaroot; arena; arena = arenanext) {
555 arenanext = *(void **)arena;
558 PL_xpviv_arenaroot = 0;
561 for (arena = PL_xpvnv_arenaroot; arena; arena = arenanext) {
562 arenanext = *(void **)arena;
565 PL_xpvnv_arenaroot = 0;
568 for (arena = PL_xpvcv_arenaroot; arena; arena = arenanext) {
569 arenanext = *(void **)arena;
572 PL_xpvcv_arenaroot = 0;
575 for (arena = PL_xpvav_arenaroot; arena; arena = arenanext) {
576 arenanext = *(void **)arena;
579 PL_xpvav_arenaroot = 0;
582 for (arena = PL_xpvhv_arenaroot; arena; arena = arenanext) {
583 arenanext = *(void **)arena;
586 PL_xpvhv_arenaroot = 0;
589 for (arena = PL_xpvmg_arenaroot; arena; arena = arenanext) {
590 arenanext = *(void **)arena;
593 PL_xpvmg_arenaroot = 0;
596 for (arena = PL_xpvgv_arenaroot; arena; arena = arenanext) {
597 arenanext = *(void **)arena;
600 PL_xpvgv_arenaroot = 0;
603 for (arena = PL_xpvlv_arenaroot; arena; arena = arenanext) {
604 arenanext = *(void **)arena;
607 PL_xpvlv_arenaroot = 0;
610 for (arena = PL_xpvbm_arenaroot; arena; arena = arenanext) {
611 arenanext = *(void **)arena;
614 PL_xpvbm_arenaroot = 0;
620 for (he = PL_he_arenaroot; he; he = he_next) {
621 he_next = HeNEXT(he);
628 #if defined(USE_ITHREADS)
630 struct ptr_tbl_ent *pte;
631 struct ptr_tbl_ent *pte_next;
632 for (pte = PL_pte_arenaroot; pte; pte = pte_next) {
633 pte_next = pte->next;
637 PL_pte_arenaroot = 0;
642 Safefree(PL_nice_chunk);
643 PL_nice_chunk = Nullch;
644 PL_nice_chunk_size = 0;
649 /* ---------------------------------------------------------------------
651 * support functions for report_uninit()
654 /* the maxiumum size of array or hash where we will scan looking
655 * for the undefined element that triggered the warning */
657 #define FUV_MAX_SEARCH_SIZE 1000
659 /* Look for an entry in the hash whose value has the same SV as val;
660 * If so, return a mortal copy of the key. */
663 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
669 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
670 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
675 for (i=HvMAX(hv); i>0; i--) {
677 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
678 if (HeVAL(entry) != val)
680 if ( HeVAL(entry) == &PL_sv_undef ||
681 HeVAL(entry) == &PL_sv_placeholder)
685 if (HeKLEN(entry) == HEf_SVKEY)
686 return sv_mortalcopy(HeKEY_sv(entry));
687 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
693 /* Look for an entry in the array whose value has the same SV as val;
694 * If so, return the index, otherwise return -1. */
697 S_find_array_subscript(pTHX_ AV *av, SV* val)
701 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
702 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
706 for (i=AvFILLp(av); i>=0; i--) {
707 if (svp[i] == val && svp[i] != &PL_sv_undef)
713 /* S_varname(): return the name of a variable, optionally with a subscript.
714 * If gv is non-zero, use the name of that global, along with gvtype (one
715 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
716 * targ. Depending on the value of the subscript_type flag, return:
719 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
720 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
721 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
722 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
725 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
726 SV* keyname, I32 aindex, int subscript_type)
731 SV * const name = sv_newmortal();
734 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
735 * XXX get rid of all this if gv_fullnameX() ever supports this
739 HV *hv = GvSTASH(gv);
740 sv_setpv(name, gvtype);
743 else if (!(p=HvNAME_get(hv)))
745 if (strNE(p, "main")) {
747 sv_catpvn(name,"::", 2);
749 if (GvNAMELEN(gv)>= 1 &&
750 ((unsigned int)*GvNAME(gv)) <= 26)
752 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
753 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
756 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
760 CV *cv = find_runcv(&u);
763 if (!cv || !CvPADLIST(cv))
765 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
766 sv = *av_fetch(av, targ, FALSE);
767 /* SvLEN in a pad name is not to be trusted */
769 sv_setpvn(name, str, len);
772 if (subscript_type == FUV_SUBSCRIPT_HASH) {
775 Perl_sv_catpvf(aTHX_ name, "{%s}",
776 pv_display(sv,SvPVX(keyname), SvCUR(keyname), 0, 32));
779 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
781 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
783 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
784 sv_insert(name, 0, 0, "within ", 7);
791 =for apidoc find_uninit_var
793 Find the name of the undefined variable (if any) that caused the operator o
794 to issue a "Use of uninitialized value" warning.
795 If match is true, only return a name if it's value matches uninit_sv.
796 So roughly speaking, if a unary operator (such as OP_COS) generates a
797 warning, then following the direct child of the op may yield an
798 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
799 other hand, with OP_ADD there are two branches to follow, so we only print
800 the variable name if we get an exact match.
802 The name is returned as a mortal SV.
804 Assumes that PL_op is the op that originally triggered the error, and that
805 PL_comppad/PL_curpad points to the currently executing pad.
811 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
820 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
821 uninit_sv == &PL_sv_placeholder)))
824 switch (obase->op_type) {
831 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
832 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
835 int subscript_type = FUV_SUBSCRIPT_WITHIN;
837 if (pad) { /* @lex, %lex */
838 sv = PAD_SVl(obase->op_targ);
842 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
843 /* @global, %global */
844 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
847 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
849 else /* @{expr}, %{expr} */
850 return find_uninit_var(cUNOPx(obase)->op_first,
854 /* attempt to find a match within the aggregate */
856 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
858 subscript_type = FUV_SUBSCRIPT_HASH;
861 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
863 subscript_type = FUV_SUBSCRIPT_ARRAY;
866 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
869 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
870 keysv, index, subscript_type);
874 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
876 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
877 Nullsv, 0, FUV_SUBSCRIPT_NONE);
880 gv = cGVOPx_gv(obase);
881 if (!gv || (match && GvSV(gv) != uninit_sv))
883 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
886 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
888 av = (AV*)PAD_SV(obase->op_targ);
889 if (!av || SvRMAGICAL(av))
891 svp = av_fetch(av, (I32)obase->op_private, FALSE);
892 if (!svp || *svp != uninit_sv)
895 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
896 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
899 gv = cGVOPx_gv(obase);
904 if (!av || SvRMAGICAL(av))
906 svp = av_fetch(av, (I32)obase->op_private, FALSE);
907 if (!svp || *svp != uninit_sv)
910 return S_varname(aTHX_ gv, "$", 0,
911 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
916 o = cUNOPx(obase)->op_first;
917 if (!o || o->op_type != OP_NULL ||
918 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
920 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
925 /* $a[uninit_expr] or $h{uninit_expr} */
926 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
929 o = cBINOPx(obase)->op_first;
930 kid = cBINOPx(obase)->op_last;
932 /* get the av or hv, and optionally the gv */
934 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
935 sv = PAD_SV(o->op_targ);
937 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
938 && cUNOPo->op_first->op_type == OP_GV)
940 gv = cGVOPx_gv(cUNOPo->op_first);
943 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
948 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
949 /* index is constant */
953 if (obase->op_type == OP_HELEM) {
954 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
955 if (!he || HeVAL(he) != uninit_sv)
959 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
960 if (!svp || *svp != uninit_sv)
964 if (obase->op_type == OP_HELEM)
965 return S_varname(aTHX_ gv, "%", o->op_targ,
966 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
968 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
969 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
973 /* index is an expression;
974 * attempt to find a match within the aggregate */
975 if (obase->op_type == OP_HELEM) {
976 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
978 return S_varname(aTHX_ gv, "%", o->op_targ,
979 keysv, 0, FUV_SUBSCRIPT_HASH);
982 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
984 return S_varname(aTHX_ gv, "@", o->op_targ,
985 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
989 return S_varname(aTHX_ gv,
990 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
992 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
998 /* only examine RHS */
999 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
1002 o = cUNOPx(obase)->op_first;
1003 if (o->op_type == OP_PUSHMARK)
1006 if (!o->op_sibling) {
1007 /* one-arg version of open is highly magical */
1009 if (o->op_type == OP_GV) { /* open FOO; */
1011 if (match && GvSV(gv) != uninit_sv)
1013 return S_varname(aTHX_ gv, "$", 0,
1014 Nullsv, 0, FUV_SUBSCRIPT_NONE);
1016 /* other possibilities not handled are:
1017 * open $x; or open my $x; should return '${*$x}'
1018 * open expr; should return '$'.expr ideally
1024 /* ops where $_ may be an implicit arg */
1028 if ( !(obase->op_flags & OPf_STACKED)) {
1029 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1030 ? PAD_SVl(obase->op_targ)
1033 sv = sv_newmortal();
1034 sv_setpvn(sv, "$_", 2);
1042 /* skip filehandle as it can't produce 'undef' warning */
1043 o = cUNOPx(obase)->op_first;
1044 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1045 o = o->op_sibling->op_sibling;
1052 match = 1; /* XS or custom code could trigger random warnings */
1057 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1058 return sv_2mortal(newSVpv("${$/}", 0));
1063 if (!(obase->op_flags & OPf_KIDS))
1065 o = cUNOPx(obase)->op_first;
1071 /* if all except one arg are constant, or have no side-effects,
1072 * or are optimized away, then it's unambiguous */
1074 for (kid=o; kid; kid = kid->op_sibling) {
1076 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1077 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1078 || (kid->op_type == OP_PUSHMARK)
1082 if (o2) { /* more than one found */
1089 return find_uninit_var(o2, uninit_sv, match);
1093 sv = find_uninit_var(o, uninit_sv, 1);
1105 =for apidoc report_uninit
1107 Print appropriate "Use of uninitialized variable" warning
1113 Perl_report_uninit(pTHX_ SV* uninit_sv)
1116 SV* varname = Nullsv;
1118 varname = find_uninit_var(PL_op, uninit_sv,0);
1120 sv_insert(varname, 0, 0, " ", 1);
1122 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1123 varname ? SvPV_nolen(varname) : "",
1124 " in ", OP_DESC(PL_op));
1127 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1131 /* allocate another arena's worth of NV bodies */
1139 New(711, ptr, PERL_ARENA_SIZE/sizeof(NV), NV);
1140 *((void **) ptr) = (void *)PL_xnv_arenaroot;
1141 PL_xnv_arenaroot = ptr;
1144 xnvend = &xnv[PERL_ARENA_SIZE / sizeof(NV) - 1];
1145 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1147 while (xnv < xnvend) {
1148 *(NV**)xnv = (NV*)(xnv + 1);
1154 /* allocate another arena's worth of struct xpv */
1160 xpv_allocated* xpvend;
1161 New(713, xpv, PERL_ARENA_SIZE/sizeof(xpv_allocated), xpv_allocated);
1162 *((xpv_allocated**)xpv) = PL_xpv_arenaroot;
1163 PL_xpv_arenaroot = xpv;
1165 xpvend = &xpv[PERL_ARENA_SIZE / sizeof(xpv_allocated) - 1];
1166 PL_xpv_root = ++xpv;
1167 while (xpv < xpvend) {
1168 *((xpv_allocated**)xpv) = xpv + 1;
1171 *((xpv_allocated**)xpv) = 0;
1174 /* allocate another arena's worth of struct xpviv */
1179 xpviv_allocated* xpviv;
1180 xpviv_allocated* xpvivend;
1181 New(713, xpviv, PERL_ARENA_SIZE/sizeof(xpviv_allocated), xpviv_allocated);
1182 *((xpviv_allocated**)xpviv) = PL_xpviv_arenaroot;
1183 PL_xpviv_arenaroot = xpviv;
1185 xpvivend = &xpviv[PERL_ARENA_SIZE / sizeof(xpviv_allocated) - 1];
1186 PL_xpviv_root = ++xpviv;
1187 while (xpviv < xpvivend) {
1188 *((xpviv_allocated**)xpviv) = xpviv + 1;
1191 *((xpviv_allocated**)xpviv) = 0;
1194 /* allocate another arena's worth of struct xpvnv */
1201 New(715, xpvnv, PERL_ARENA_SIZE/sizeof(XPVNV), XPVNV);
1202 *((XPVNV**)xpvnv) = PL_xpvnv_arenaroot;
1203 PL_xpvnv_arenaroot = xpvnv;
1205 xpvnvend = &xpvnv[PERL_ARENA_SIZE / sizeof(XPVNV) - 1];
1206 PL_xpvnv_root = ++xpvnv;
1207 while (xpvnv < xpvnvend) {
1208 *((XPVNV**)xpvnv) = xpvnv + 1;
1211 *((XPVNV**)xpvnv) = 0;
1214 /* allocate another arena's worth of struct xpvcv */
1221 New(716, xpvcv, PERL_ARENA_SIZE/sizeof(XPVCV), XPVCV);
1222 *((XPVCV**)xpvcv) = PL_xpvcv_arenaroot;
1223 PL_xpvcv_arenaroot = xpvcv;
1225 xpvcvend = &xpvcv[PERL_ARENA_SIZE / sizeof(XPVCV) - 1];
1226 PL_xpvcv_root = ++xpvcv;
1227 while (xpvcv < xpvcvend) {
1228 *((XPVCV**)xpvcv) = xpvcv + 1;
1231 *((XPVCV**)xpvcv) = 0;
1234 /* allocate another arena's worth of struct xpvav */
1239 xpvav_allocated* xpvav;
1240 xpvav_allocated* xpvavend;
1241 New(717, xpvav, PERL_ARENA_SIZE/sizeof(xpvav_allocated),
1243 *((xpvav_allocated**)xpvav) = PL_xpvav_arenaroot;
1244 PL_xpvav_arenaroot = xpvav;
1246 xpvavend = &xpvav[PERL_ARENA_SIZE / sizeof(xpvav_allocated) - 1];
1247 PL_xpvav_root = ++xpvav;
1248 while (xpvav < xpvavend) {
1249 *((xpvav_allocated**)xpvav) = xpvav + 1;
1252 *((xpvav_allocated**)xpvav) = 0;
1255 /* allocate another arena's worth of struct xpvhv */
1260 xpvhv_allocated* xpvhv;
1261 xpvhv_allocated* xpvhvend;
1262 New(718, xpvhv, PERL_ARENA_SIZE/sizeof(xpvhv_allocated),
1264 *((xpvhv_allocated**)xpvhv) = PL_xpvhv_arenaroot;
1265 PL_xpvhv_arenaroot = xpvhv;
1267 xpvhvend = &xpvhv[PERL_ARENA_SIZE / sizeof(xpvhv_allocated) - 1];
1268 PL_xpvhv_root = ++xpvhv;
1269 while (xpvhv < xpvhvend) {
1270 *((xpvhv_allocated**)xpvhv) = xpvhv + 1;
1273 *((xpvhv_allocated**)xpvhv) = 0;
1276 /* allocate another arena's worth of struct xpvmg */
1283 New(719, xpvmg, PERL_ARENA_SIZE/sizeof(XPVMG), XPVMG);
1284 *((XPVMG**)xpvmg) = PL_xpvmg_arenaroot;
1285 PL_xpvmg_arenaroot = xpvmg;
1287 xpvmgend = &xpvmg[PERL_ARENA_SIZE / sizeof(XPVMG) - 1];
1288 PL_xpvmg_root = ++xpvmg;
1289 while (xpvmg < xpvmgend) {
1290 *((XPVMG**)xpvmg) = xpvmg + 1;
1293 *((XPVMG**)xpvmg) = 0;
1296 /* allocate another arena's worth of struct xpvgv */
1303 New(720, xpvgv, PERL_ARENA_SIZE/sizeof(XPVGV), XPVGV);
1304 *((XPVGV**)xpvgv) = PL_xpvgv_arenaroot;
1305 PL_xpvgv_arenaroot = xpvgv;
1307 xpvgvend = &xpvgv[PERL_ARENA_SIZE / sizeof(XPVGV) - 1];
1308 PL_xpvgv_root = ++xpvgv;
1309 while (xpvgv < xpvgvend) {
1310 *((XPVGV**)xpvgv) = xpvgv + 1;
1313 *((XPVGV**)xpvgv) = 0;
1316 /* allocate another arena's worth of struct xpvlv */
1323 New(720, xpvlv, PERL_ARENA_SIZE/sizeof(XPVLV), XPVLV);
1324 *((XPVLV**)xpvlv) = PL_xpvlv_arenaroot;
1325 PL_xpvlv_arenaroot = xpvlv;
1327 xpvlvend = &xpvlv[PERL_ARENA_SIZE / sizeof(XPVLV) - 1];
1328 PL_xpvlv_root = ++xpvlv;
1329 while (xpvlv < xpvlvend) {
1330 *((XPVLV**)xpvlv) = xpvlv + 1;
1333 *((XPVLV**)xpvlv) = 0;
1336 /* allocate another arena's worth of struct xpvbm */
1343 New(721, xpvbm, PERL_ARENA_SIZE/sizeof(XPVBM), XPVBM);
1344 *((XPVBM**)xpvbm) = PL_xpvbm_arenaroot;
1345 PL_xpvbm_arenaroot = xpvbm;
1347 xpvbmend = &xpvbm[PERL_ARENA_SIZE / sizeof(XPVBM) - 1];
1348 PL_xpvbm_root = ++xpvbm;
1349 while (xpvbm < xpvbmend) {
1350 *((XPVBM**)xpvbm) = xpvbm + 1;
1353 *((XPVBM**)xpvbm) = 0;
1356 /* grab a new NV body from the free list, allocating more if necessary */
1366 PL_xnv_root = *(NV**)xnv;
1368 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1371 /* return an NV body to the free list */
1374 S_del_xnv(pTHX_ XPVNV *p)
1376 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1378 *(NV**)xnv = PL_xnv_root;
1383 /* grab a new struct xpv from the free list, allocating more if necessary */
1393 PL_xpv_root = *(xpv_allocated**)xpv;
1395 /* If xpv_allocated is the same structure as XPV then the two OFFSETs
1396 sum to zero, and the pointer is unchanged. If the allocated structure
1397 is smaller (no initial IV actually allocated) then the net effect is
1398 to subtract the size of the IV from the pointer, to return a new pointer
1399 as if an initial IV were actually allocated. */
1400 return (XPV*)((char*)xpv - STRUCT_OFFSET(XPV, xpv_cur)
1401 + STRUCT_OFFSET(xpv_allocated, xpv_cur));
1404 /* return a struct xpv to the free list */
1407 S_del_xpv(pTHX_ XPV *p)
1410 = (xpv_allocated*)((char*)(p) + STRUCT_OFFSET(XPV, xpv_cur)
1411 - STRUCT_OFFSET(xpv_allocated, xpv_cur));
1413 *(xpv_allocated**)xpv = PL_xpv_root;
1418 /* grab a new struct xpviv from the free list, allocating more if necessary */
1423 xpviv_allocated* xpviv;
1427 xpviv = PL_xpviv_root;
1428 PL_xpviv_root = *(xpviv_allocated**)xpviv;
1430 /* If xpviv_allocated is the same structure as XPVIV then the two OFFSETs
1431 sum to zero, and the pointer is unchanged. If the allocated structure
1432 is smaller (no initial IV actually allocated) then the net effect is
1433 to subtract the size of the IV from the pointer, to return a new pointer
1434 as if an initial IV were actually allocated. */
1435 return (XPVIV*)((char*)xpviv - STRUCT_OFFSET(XPVIV, xpv_cur)
1436 + STRUCT_OFFSET(xpviv_allocated, xpv_cur));
1439 /* return a struct xpviv to the free list */
1442 S_del_xpviv(pTHX_ XPVIV *p)
1444 xpviv_allocated* xpviv
1445 = (xpviv_allocated*)((char*)(p) + STRUCT_OFFSET(XPVIV, xpv_cur)
1446 - STRUCT_OFFSET(xpviv_allocated, xpv_cur));
1448 *(xpviv_allocated**)xpviv = PL_xpviv_root;
1449 PL_xpviv_root = xpviv;
1453 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1462 xpvnv = PL_xpvnv_root;
1463 PL_xpvnv_root = *(XPVNV**)xpvnv;
1468 /* return a struct xpvnv to the free list */
1471 S_del_xpvnv(pTHX_ XPVNV *p)
1474 *(XPVNV**)p = PL_xpvnv_root;
1479 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1488 xpvcv = PL_xpvcv_root;
1489 PL_xpvcv_root = *(XPVCV**)xpvcv;
1494 /* return a struct xpvcv to the free list */
1497 S_del_xpvcv(pTHX_ XPVCV *p)
1500 *(XPVCV**)p = PL_xpvcv_root;
1505 /* grab a new struct xpvav from the free list, allocating more if necessary */
1510 xpvav_allocated* xpvav;
1514 xpvav = PL_xpvav_root;
1515 PL_xpvav_root = *(xpvav_allocated**)xpvav;
1517 return (XPVAV*)((char*)xpvav - STRUCT_OFFSET(XPVAV, xav_fill)
1518 + STRUCT_OFFSET(xpvav_allocated, xav_fill));
1521 /* return a struct xpvav to the free list */
1524 S_del_xpvav(pTHX_ XPVAV *p)
1526 xpvav_allocated* xpvav
1527 = (xpvav_allocated*)((char*)(p) + STRUCT_OFFSET(XPVAV, xav_fill)
1528 - STRUCT_OFFSET(xpvav_allocated, xav_fill));
1530 *(xpvav_allocated**)xpvav = PL_xpvav_root;
1531 PL_xpvav_root = xpvav;
1535 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1540 xpvhv_allocated* xpvhv;
1544 xpvhv = PL_xpvhv_root;
1545 PL_xpvhv_root = *(xpvhv_allocated**)xpvhv;
1547 return (XPVHV*)((char*)xpvhv - STRUCT_OFFSET(XPVHV, xhv_fill)
1548 + STRUCT_OFFSET(xpvhv_allocated, xhv_fill));
1551 /* return a struct xpvhv to the free list */
1554 S_del_xpvhv(pTHX_ XPVHV *p)
1556 xpvhv_allocated* xpvhv
1557 = (xpvhv_allocated*)((char*)(p) + STRUCT_OFFSET(XPVHV, xhv_fill)
1558 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill));
1560 *(xpvhv_allocated**)xpvhv = PL_xpvhv_root;
1561 PL_xpvhv_root = xpvhv;
1565 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1574 xpvmg = PL_xpvmg_root;
1575 PL_xpvmg_root = *(XPVMG**)xpvmg;
1580 /* return a struct xpvmg to the free list */
1583 S_del_xpvmg(pTHX_ XPVMG *p)
1586 *(XPVMG**)p = PL_xpvmg_root;
1591 /* grab a new struct xpvgv from the free list, allocating more if necessary */
1600 xpvgv = PL_xpvgv_root;
1601 PL_xpvgv_root = *(XPVGV**)xpvgv;
1606 /* return a struct xpvgv to the free list */
1609 S_del_xpvgv(pTHX_ XPVGV *p)
1612 *(XPVGV**)p = PL_xpvgv_root;
1617 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1626 xpvlv = PL_xpvlv_root;
1627 PL_xpvlv_root = *(XPVLV**)xpvlv;
1632 /* return a struct xpvlv to the free list */
1635 S_del_xpvlv(pTHX_ XPVLV *p)
1638 *(XPVLV**)p = PL_xpvlv_root;
1643 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1652 xpvbm = PL_xpvbm_root;
1653 PL_xpvbm_root = *(XPVBM**)xpvbm;
1658 /* return a struct xpvbm to the free list */
1661 S_del_xpvbm(pTHX_ XPVBM *p)
1664 *(XPVBM**)p = PL_xpvbm_root;
1669 #define my_safemalloc(s) (void*)safemalloc(s)
1670 #define my_safefree(p) safefree((char*)p)
1674 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1675 #define del_XNV(p) my_safefree(p)
1677 #define new_XPV() my_safemalloc(sizeof(XPV))
1678 #define del_XPV(p) my_safefree(p)
1680 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1681 #define del_XPVIV(p) my_safefree(p)
1683 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1684 #define del_XPVNV(p) my_safefree(p)
1686 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1687 #define del_XPVCV(p) my_safefree(p)
1689 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1690 #define del_XPVAV(p) my_safefree(p)
1692 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1693 #define del_XPVHV(p) my_safefree(p)
1695 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1696 #define del_XPVMG(p) my_safefree(p)
1698 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1699 #define del_XPVGV(p) my_safefree(p)
1701 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1702 #define del_XPVLV(p) my_safefree(p)
1704 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1705 #define del_XPVBM(p) my_safefree(p)
1709 #define new_XNV() (void*)new_xnv()
1710 #define del_XNV(p) del_xnv((XPVNV*) p)
1712 #define new_XPV() (void*)new_xpv()
1713 #define del_XPV(p) del_xpv((XPV *)p)
1715 #define new_XPVIV() (void*)new_xpviv()
1716 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1718 #define new_XPVNV() (void*)new_xpvnv()
1719 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1721 #define new_XPVCV() (void*)new_xpvcv()
1722 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1724 #define new_XPVAV() (void*)new_xpvav()
1725 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1727 #define new_XPVHV() (void*)new_xpvhv()
1728 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1730 #define new_XPVMG() (void*)new_xpvmg()
1731 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1733 #define new_XPVGV() (void*)new_xpvgv()
1734 #define del_XPVGV(p) del_xpvgv((XPVGV *)p)
1736 #define new_XPVLV() (void*)new_xpvlv()
1737 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1739 #define new_XPVBM() (void*)new_xpvbm()
1740 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1744 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1745 #define del_XPVFM(p) my_safefree(p)
1747 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1748 #define del_XPVIO(p) my_safefree(p)
1751 =for apidoc sv_upgrade
1753 Upgrade an SV to a more complex form. Generally adds a new body type to the
1754 SV, then copies across as much information as possible from the old body.
1755 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1761 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1772 if (mt != SVt_PV && SvIsCOW(sv)) {
1773 sv_force_normal_flags(sv, 0);
1776 if (SvTYPE(sv) == mt)
1787 switch (SvTYPE(sv)) {
1794 else if (mt < SVt_PVIV)
1804 pv = (char*)SvRV(sv);
1813 else if (mt == SVt_NV)
1821 del_XPVIV(SvANY(sv));
1829 del_XPVNV(SvANY(sv));
1832 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1833 there's no way that it can be safely upgraded, because perl.c
1834 expects to Safefree(SvANY(PL_mess_sv)) */
1835 assert(sv != PL_mess_sv);
1836 /* This flag bit is used to mean other things in other scalar types.
1837 Given that it only has meaning inside the pad, it shouldn't be set
1838 on anything that can get upgraded. */
1839 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1845 magic = SvMAGIC(sv);
1846 stash = SvSTASH(sv);
1847 del_XPVMG(SvANY(sv));
1850 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1853 SvFLAGS(sv) &= ~SVTYPEMASK;
1858 Perl_croak(aTHX_ "Can't upgrade to undef");
1860 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1864 SvANY(sv) = new_XNV();
1868 SvANY(sv) = &sv->sv_u.svu_rv;
1869 SvRV_set(sv, (SV*)pv);
1872 SvANY(sv) = new_XPVHV();
1875 HvTOTALKEYS(sv) = 0;
1877 /* Fall through... */
1880 SvANY(sv) = new_XPVAV();
1887 /* XXX? Only SVt_NULL is ever upgraded to AV or HV? */
1889 /* FIXME. Should be able to remove all this if()... if the above
1890 assertion is genuinely always true. */
1893 SvFLAGS(sv) &= ~SVf_OOK;
1896 SvPV_set(sv, (char*)0);
1897 SvMAGIC_set(sv, magic);
1898 SvSTASH_set(sv, stash);
1902 SvANY(sv) = new_XPVIO();
1903 Zero(SvANY(sv), 1, XPVIO);
1904 IoPAGE_LEN(sv) = 60;
1905 goto set_magic_common;
1907 SvANY(sv) = new_XPVFM();
1908 Zero(SvANY(sv), 1, XPVFM);
1909 goto set_magic_common;
1911 SvANY(sv) = new_XPVBM();
1915 goto set_magic_common;
1917 SvANY(sv) = new_XPVGV();
1923 goto set_magic_common;
1925 SvANY(sv) = new_XPVCV();
1926 Zero(SvANY(sv), 1, XPVCV);
1927 goto set_magic_common;
1929 SvANY(sv) = new_XPVLV();
1942 SvANY(sv) = new_XPVMG();
1945 SvMAGIC_set(sv, magic);
1946 SvSTASH_set(sv, stash);
1950 SvANY(sv) = new_XPVNV();
1956 SvANY(sv) = new_XPVIV();
1965 SvANY(sv) = new_XPV();
1976 =for apidoc sv_backoff
1978 Remove any string offset. You should normally use the C<SvOOK_off> macro
1985 Perl_sv_backoff(pTHX_ register SV *sv)
1988 assert(SvTYPE(sv) != SVt_PVHV);
1989 assert(SvTYPE(sv) != SVt_PVAV);
1991 char *s = SvPVX(sv);
1992 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1993 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1995 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1997 SvFLAGS(sv) &= ~SVf_OOK;
2004 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2005 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2006 Use the C<SvGROW> wrapper instead.
2012 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2016 #ifdef HAS_64K_LIMIT
2017 if (newlen >= 0x10000) {
2018 PerlIO_printf(Perl_debug_log,
2019 "Allocation too large: %"UVxf"\n", (UV)newlen);
2022 #endif /* HAS_64K_LIMIT */
2025 if (SvTYPE(sv) < SVt_PV) {
2026 sv_upgrade(sv, SVt_PV);
2029 else if (SvOOK(sv)) { /* pv is offset? */
2032 if (newlen > SvLEN(sv))
2033 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2034 #ifdef HAS_64K_LIMIT
2035 if (newlen >= 0x10000)
2042 if (newlen > SvLEN(sv)) { /* need more room? */
2043 if (SvLEN(sv) && s) {
2044 newlen = PERL_STRLEN_ROUNDUP(newlen);
2046 const STRLEN l = malloced_size((void*)SvPVX(sv));
2052 s = saferealloc(s, newlen);
2055 newlen = PERL_STRLEN_ROUNDUP(newlen);
2056 s = safemalloc(newlen);
2057 if (SvPVX(sv) && SvCUR(sv)) {
2058 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2062 SvLEN_set(sv, newlen);
2068 =for apidoc sv_setiv
2070 Copies an integer into the given SV, upgrading first if necessary.
2071 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2077 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2079 SV_CHECK_THINKFIRST_COW_DROP(sv);
2080 switch (SvTYPE(sv)) {
2082 sv_upgrade(sv, SVt_IV);
2085 sv_upgrade(sv, SVt_PVNV);
2089 sv_upgrade(sv, SVt_PVIV);
2098 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2101 (void)SvIOK_only(sv); /* validate number */
2107 =for apidoc sv_setiv_mg
2109 Like C<sv_setiv>, but also handles 'set' magic.
2115 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2122 =for apidoc sv_setuv
2124 Copies an unsigned integer into the given SV, upgrading first if necessary.
2125 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2131 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2133 /* With these two if statements:
2134 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2137 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2139 If you wish to remove them, please benchmark to see what the effect is
2141 if (u <= (UV)IV_MAX) {
2142 sv_setiv(sv, (IV)u);
2151 =for apidoc sv_setuv_mg
2153 Like C<sv_setuv>, but also handles 'set' magic.
2159 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2161 /* With these two if statements:
2162 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2165 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2167 If you wish to remove them, please benchmark to see what the effect is
2169 if (u <= (UV)IV_MAX) {
2170 sv_setiv(sv, (IV)u);
2180 =for apidoc sv_setnv
2182 Copies a double into the given SV, upgrading first if necessary.
2183 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2189 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2191 SV_CHECK_THINKFIRST_COW_DROP(sv);
2192 switch (SvTYPE(sv)) {
2195 sv_upgrade(sv, SVt_NV);
2200 sv_upgrade(sv, SVt_PVNV);
2209 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2213 (void)SvNOK_only(sv); /* validate number */
2218 =for apidoc sv_setnv_mg
2220 Like C<sv_setnv>, but also handles 'set' magic.
2226 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2232 /* Print an "isn't numeric" warning, using a cleaned-up,
2233 * printable version of the offending string
2237 S_not_a_number(pTHX_ SV *sv)
2244 dsv = sv_2mortal(newSVpv("", 0));
2245 pv = sv_uni_display(dsv, sv, 10, 0);
2248 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2249 /* each *s can expand to 4 chars + "...\0",
2250 i.e. need room for 8 chars */
2253 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2255 if (ch & 128 && !isPRINT_LC(ch)) {
2264 else if (ch == '\r') {
2268 else if (ch == '\f') {
2272 else if (ch == '\\') {
2276 else if (ch == '\0') {
2280 else if (isPRINT_LC(ch))
2297 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2298 "Argument \"%s\" isn't numeric in %s", pv,
2301 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2302 "Argument \"%s\" isn't numeric", pv);
2306 =for apidoc looks_like_number
2308 Test if the content of an SV looks like a number (or is a number).
2309 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2310 non-numeric warning), even if your atof() doesn't grok them.
2316 Perl_looks_like_number(pTHX_ SV *sv)
2318 register const char *sbegin;
2325 else if (SvPOKp(sv))
2326 sbegin = SvPV(sv, len);
2328 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2329 return grok_number(sbegin, len, NULL);
2332 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2333 until proven guilty, assume that things are not that bad... */
2338 As 64 bit platforms often have an NV that doesn't preserve all bits of
2339 an IV (an assumption perl has been based on to date) it becomes necessary
2340 to remove the assumption that the NV always carries enough precision to
2341 recreate the IV whenever needed, and that the NV is the canonical form.
2342 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2343 precision as a side effect of conversion (which would lead to insanity
2344 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2345 1) to distinguish between IV/UV/NV slots that have cached a valid
2346 conversion where precision was lost and IV/UV/NV slots that have a
2347 valid conversion which has lost no precision
2348 2) to ensure that if a numeric conversion to one form is requested that
2349 would lose precision, the precise conversion (or differently
2350 imprecise conversion) is also performed and cached, to prevent
2351 requests for different numeric formats on the same SV causing
2352 lossy conversion chains. (lossless conversion chains are perfectly
2357 SvIOKp is true if the IV slot contains a valid value
2358 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2359 SvNOKp is true if the NV slot contains a valid value
2360 SvNOK is true only if the NV value is accurate
2363 while converting from PV to NV, check to see if converting that NV to an
2364 IV(or UV) would lose accuracy over a direct conversion from PV to
2365 IV(or UV). If it would, cache both conversions, return NV, but mark
2366 SV as IOK NOKp (ie not NOK).
2368 While converting from PV to IV, check to see if converting that IV to an
2369 NV would lose accuracy over a direct conversion from PV to NV. If it
2370 would, cache both conversions, flag similarly.
2372 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2373 correctly because if IV & NV were set NV *always* overruled.
2374 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2375 changes - now IV and NV together means that the two are interchangeable:
2376 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2378 The benefit of this is that operations such as pp_add know that if
2379 SvIOK is true for both left and right operands, then integer addition
2380 can be used instead of floating point (for cases where the result won't
2381 overflow). Before, floating point was always used, which could lead to
2382 loss of precision compared with integer addition.
2384 * making IV and NV equal status should make maths accurate on 64 bit
2386 * may speed up maths somewhat if pp_add and friends start to use
2387 integers when possible instead of fp. (Hopefully the overhead in
2388 looking for SvIOK and checking for overflow will not outweigh the
2389 fp to integer speedup)
2390 * will slow down integer operations (callers of SvIV) on "inaccurate"
2391 values, as the change from SvIOK to SvIOKp will cause a call into
2392 sv_2iv each time rather than a macro access direct to the IV slot
2393 * should speed up number->string conversion on integers as IV is
2394 favoured when IV and NV are equally accurate
2396 ####################################################################
2397 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2398 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2399 On the other hand, SvUOK is true iff UV.
2400 ####################################################################
2402 Your mileage will vary depending your CPU's relative fp to integer
2406 #ifndef NV_PRESERVES_UV
2407 # define IS_NUMBER_UNDERFLOW_IV 1
2408 # define IS_NUMBER_UNDERFLOW_UV 2
2409 # define IS_NUMBER_IV_AND_UV 2
2410 # define IS_NUMBER_OVERFLOW_IV 4
2411 # define IS_NUMBER_OVERFLOW_UV 5
2413 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2415 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2417 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2419 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));
2420 if (SvNVX(sv) < (NV)IV_MIN) {
2421 (void)SvIOKp_on(sv);
2423 SvIV_set(sv, IV_MIN);
2424 return IS_NUMBER_UNDERFLOW_IV;
2426 if (SvNVX(sv) > (NV)UV_MAX) {
2427 (void)SvIOKp_on(sv);
2430 SvUV_set(sv, UV_MAX);
2431 return IS_NUMBER_OVERFLOW_UV;
2433 (void)SvIOKp_on(sv);
2435 /* Can't use strtol etc to convert this string. (See truth table in
2437 if (SvNVX(sv) <= (UV)IV_MAX) {
2438 SvIV_set(sv, I_V(SvNVX(sv)));
2439 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2440 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2442 /* Integer is imprecise. NOK, IOKp */
2444 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2447 SvUV_set(sv, U_V(SvNVX(sv)));
2448 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2449 if (SvUVX(sv) == UV_MAX) {
2450 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2451 possibly be preserved by NV. Hence, it must be overflow.
2453 return IS_NUMBER_OVERFLOW_UV;
2455 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2457 /* Integer is imprecise. NOK, IOKp */
2459 return IS_NUMBER_OVERFLOW_IV;
2461 #endif /* !NV_PRESERVES_UV*/
2463 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2464 * this function provided for binary compatibility only
2468 Perl_sv_2iv(pTHX_ register SV *sv)
2470 return sv_2iv_flags(sv, SV_GMAGIC);
2474 =for apidoc sv_2iv_flags
2476 Return the integer value of an SV, doing any necessary string
2477 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2478 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2484 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2488 if (SvGMAGICAL(sv)) {
2489 if (flags & SV_GMAGIC)
2494 return I_V(SvNVX(sv));
2496 if (SvPOKp(sv) && SvLEN(sv))
2499 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2500 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2506 if (SvTHINKFIRST(sv)) {
2509 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2510 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2511 return SvIV(tmpstr);
2512 return PTR2IV(SvRV(sv));
2515 sv_force_normal_flags(sv, 0);
2517 if (SvREADONLY(sv) && !SvOK(sv)) {
2518 if (ckWARN(WARN_UNINITIALIZED))
2525 return (IV)(SvUVX(sv));
2532 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2533 * without also getting a cached IV/UV from it at the same time
2534 * (ie PV->NV conversion should detect loss of accuracy and cache
2535 * IV or UV at same time to avoid this. NWC */
2537 if (SvTYPE(sv) == SVt_NV)
2538 sv_upgrade(sv, SVt_PVNV);
2540 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2541 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2542 certainly cast into the IV range at IV_MAX, whereas the correct
2543 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2545 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2546 SvIV_set(sv, I_V(SvNVX(sv)));
2547 if (SvNVX(sv) == (NV) SvIVX(sv)
2548 #ifndef NV_PRESERVES_UV
2549 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2550 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2551 /* Don't flag it as "accurately an integer" if the number
2552 came from a (by definition imprecise) NV operation, and
2553 we're outside the range of NV integer precision */
2556 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2557 DEBUG_c(PerlIO_printf(Perl_debug_log,
2558 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2564 /* IV not precise. No need to convert from PV, as NV
2565 conversion would already have cached IV if it detected
2566 that PV->IV would be better than PV->NV->IV
2567 flags already correct - don't set public IOK. */
2568 DEBUG_c(PerlIO_printf(Perl_debug_log,
2569 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2574 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2575 but the cast (NV)IV_MIN rounds to a the value less (more
2576 negative) than IV_MIN which happens to be equal to SvNVX ??
2577 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2578 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2579 (NV)UVX == NVX are both true, but the values differ. :-(
2580 Hopefully for 2s complement IV_MIN is something like
2581 0x8000000000000000 which will be exact. NWC */
2584 SvUV_set(sv, U_V(SvNVX(sv)));
2586 (SvNVX(sv) == (NV) SvUVX(sv))
2587 #ifndef NV_PRESERVES_UV
2588 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2589 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2590 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2591 /* Don't flag it as "accurately an integer" if the number
2592 came from a (by definition imprecise) NV operation, and
2593 we're outside the range of NV integer precision */
2599 DEBUG_c(PerlIO_printf(Perl_debug_log,
2600 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2604 return (IV)SvUVX(sv);
2607 else if (SvPOKp(sv) && SvLEN(sv)) {
2609 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2610 /* We want to avoid a possible problem when we cache an IV which
2611 may be later translated to an NV, and the resulting NV is not
2612 the same as the direct translation of the initial string
2613 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2614 be careful to ensure that the value with the .456 is around if the
2615 NV value is requested in the future).
2617 This means that if we cache such an IV, we need to cache the
2618 NV as well. Moreover, we trade speed for space, and do not
2619 cache the NV if we are sure it's not needed.
2622 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2623 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2624 == IS_NUMBER_IN_UV) {
2625 /* It's definitely an integer, only upgrade to PVIV */
2626 if (SvTYPE(sv) < SVt_PVIV)
2627 sv_upgrade(sv, SVt_PVIV);
2629 } else if (SvTYPE(sv) < SVt_PVNV)
2630 sv_upgrade(sv, SVt_PVNV);
2632 /* If NV preserves UV then we only use the UV value if we know that
2633 we aren't going to call atof() below. If NVs don't preserve UVs
2634 then the value returned may have more precision than atof() will
2635 return, even though value isn't perfectly accurate. */
2636 if ((numtype & (IS_NUMBER_IN_UV
2637 #ifdef NV_PRESERVES_UV
2640 )) == IS_NUMBER_IN_UV) {
2641 /* This won't turn off the public IOK flag if it was set above */
2642 (void)SvIOKp_on(sv);
2644 if (!(numtype & IS_NUMBER_NEG)) {
2646 if (value <= (UV)IV_MAX) {
2647 SvIV_set(sv, (IV)value);
2649 SvUV_set(sv, value);
2653 /* 2s complement assumption */
2654 if (value <= (UV)IV_MIN) {
2655 SvIV_set(sv, -(IV)value);
2657 /* Too negative for an IV. This is a double upgrade, but
2658 I'm assuming it will be rare. */
2659 if (SvTYPE(sv) < SVt_PVNV)
2660 sv_upgrade(sv, SVt_PVNV);
2664 SvNV_set(sv, -(NV)value);
2665 SvIV_set(sv, IV_MIN);
2669 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2670 will be in the previous block to set the IV slot, and the next
2671 block to set the NV slot. So no else here. */
2673 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2674 != IS_NUMBER_IN_UV) {
2675 /* It wasn't an (integer that doesn't overflow the UV). */
2676 SvNV_set(sv, Atof(SvPVX(sv)));
2678 if (! numtype && ckWARN(WARN_NUMERIC))
2681 #if defined(USE_LONG_DOUBLE)
2682 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2683 PTR2UV(sv), SvNVX(sv)));
2685 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2686 PTR2UV(sv), SvNVX(sv)));
2690 #ifdef NV_PRESERVES_UV
2691 (void)SvIOKp_on(sv);
2693 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2694 SvIV_set(sv, I_V(SvNVX(sv)));
2695 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2698 /* Integer is imprecise. NOK, IOKp */
2700 /* UV will not work better than IV */
2702 if (SvNVX(sv) > (NV)UV_MAX) {
2704 /* Integer is inaccurate. NOK, IOKp, is UV */
2705 SvUV_set(sv, UV_MAX);
2708 SvUV_set(sv, U_V(SvNVX(sv)));
2709 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2710 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2714 /* Integer is imprecise. NOK, IOKp, is UV */
2720 #else /* NV_PRESERVES_UV */
2721 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2722 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2723 /* The IV slot will have been set from value returned by
2724 grok_number above. The NV slot has just been set using
2727 assert (SvIOKp(sv));
2729 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2730 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2731 /* Small enough to preserve all bits. */
2732 (void)SvIOKp_on(sv);
2734 SvIV_set(sv, I_V(SvNVX(sv)));
2735 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2737 /* Assumption: first non-preserved integer is < IV_MAX,
2738 this NV is in the preserved range, therefore: */
2739 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2741 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);
2745 0 0 already failed to read UV.
2746 0 1 already failed to read UV.
2747 1 0 you won't get here in this case. IV/UV
2748 slot set, public IOK, Atof() unneeded.
2749 1 1 already read UV.
2750 so there's no point in sv_2iuv_non_preserve() attempting
2751 to use atol, strtol, strtoul etc. */
2752 if (sv_2iuv_non_preserve (sv, numtype)
2753 >= IS_NUMBER_OVERFLOW_IV)
2757 #endif /* NV_PRESERVES_UV */
2760 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2762 if (SvTYPE(sv) < SVt_IV)
2763 /* Typically the caller expects that sv_any is not NULL now. */
2764 sv_upgrade(sv, SVt_IV);
2767 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2768 PTR2UV(sv),SvIVX(sv)));
2769 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2772 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2773 * this function provided for binary compatibility only
2777 Perl_sv_2uv(pTHX_ register SV *sv)
2779 return sv_2uv_flags(sv, SV_GMAGIC);
2783 =for apidoc sv_2uv_flags
2785 Return the unsigned integer value of an SV, doing any necessary string
2786 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2787 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2793 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2797 if (SvGMAGICAL(sv)) {
2798 if (flags & SV_GMAGIC)
2803 return U_V(SvNVX(sv));
2804 if (SvPOKp(sv) && SvLEN(sv))
2807 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2808 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2814 if (SvTHINKFIRST(sv)) {
2817 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2818 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2819 return SvUV(tmpstr);
2820 return PTR2UV(SvRV(sv));
2823 sv_force_normal_flags(sv, 0);
2825 if (SvREADONLY(sv) && !SvOK(sv)) {
2826 if (ckWARN(WARN_UNINITIALIZED))
2836 return (UV)SvIVX(sv);
2840 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2841 * without also getting a cached IV/UV from it at the same time
2842 * (ie PV->NV conversion should detect loss of accuracy and cache
2843 * IV or UV at same time to avoid this. */
2844 /* IV-over-UV optimisation - choose to cache IV if possible */
2846 if (SvTYPE(sv) == SVt_NV)
2847 sv_upgrade(sv, SVt_PVNV);
2849 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2850 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2851 SvIV_set(sv, I_V(SvNVX(sv)));
2852 if (SvNVX(sv) == (NV) SvIVX(sv)
2853 #ifndef NV_PRESERVES_UV
2854 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2855 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2856 /* Don't flag it as "accurately an integer" if the number
2857 came from a (by definition imprecise) NV operation, and
2858 we're outside the range of NV integer precision */
2861 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2862 DEBUG_c(PerlIO_printf(Perl_debug_log,
2863 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2869 /* IV not precise. No need to convert from PV, as NV
2870 conversion would already have cached IV if it detected
2871 that PV->IV would be better than PV->NV->IV
2872 flags already correct - don't set public IOK. */
2873 DEBUG_c(PerlIO_printf(Perl_debug_log,
2874 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2879 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2880 but the cast (NV)IV_MIN rounds to a the value less (more
2881 negative) than IV_MIN which happens to be equal to SvNVX ??
2882 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2883 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2884 (NV)UVX == NVX are both true, but the values differ. :-(
2885 Hopefully for 2s complement IV_MIN is something like
2886 0x8000000000000000 which will be exact. NWC */
2889 SvUV_set(sv, U_V(SvNVX(sv)));
2891 (SvNVX(sv) == (NV) SvUVX(sv))
2892 #ifndef NV_PRESERVES_UV
2893 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2894 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2895 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2896 /* Don't flag it as "accurately an integer" if the number
2897 came from a (by definition imprecise) NV operation, and
2898 we're outside the range of NV integer precision */
2903 DEBUG_c(PerlIO_printf(Perl_debug_log,
2904 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2910 else if (SvPOKp(sv) && SvLEN(sv)) {
2912 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2914 /* We want to avoid a possible problem when we cache a UV which
2915 may be later translated to an NV, and the resulting NV is not
2916 the translation of the initial data.
2918 This means that if we cache such a UV, we need to cache the
2919 NV as well. Moreover, we trade speed for space, and do not
2920 cache the NV if not needed.
2923 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2924 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2925 == IS_NUMBER_IN_UV) {
2926 /* It's definitely an integer, only upgrade to PVIV */
2927 if (SvTYPE(sv) < SVt_PVIV)
2928 sv_upgrade(sv, SVt_PVIV);
2930 } else if (SvTYPE(sv) < SVt_PVNV)
2931 sv_upgrade(sv, SVt_PVNV);
2933 /* If NV preserves UV then we only use the UV value if we know that
2934 we aren't going to call atof() below. If NVs don't preserve UVs
2935 then the value returned may have more precision than atof() will
2936 return, even though it isn't accurate. */
2937 if ((numtype & (IS_NUMBER_IN_UV
2938 #ifdef NV_PRESERVES_UV
2941 )) == IS_NUMBER_IN_UV) {
2942 /* This won't turn off the public IOK flag if it was set above */
2943 (void)SvIOKp_on(sv);
2945 if (!(numtype & IS_NUMBER_NEG)) {
2947 if (value <= (UV)IV_MAX) {
2948 SvIV_set(sv, (IV)value);
2950 /* it didn't overflow, and it was positive. */
2951 SvUV_set(sv, value);
2955 /* 2s complement assumption */
2956 if (value <= (UV)IV_MIN) {
2957 SvIV_set(sv, -(IV)value);
2959 /* Too negative for an IV. This is a double upgrade, but
2960 I'm assuming it will be rare. */
2961 if (SvTYPE(sv) < SVt_PVNV)
2962 sv_upgrade(sv, SVt_PVNV);
2966 SvNV_set(sv, -(NV)value);
2967 SvIV_set(sv, IV_MIN);
2972 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2973 != IS_NUMBER_IN_UV) {
2974 /* It wasn't an integer, or it overflowed the UV. */
2975 SvNV_set(sv, Atof(SvPVX(sv)));
2977 if (! numtype && ckWARN(WARN_NUMERIC))
2980 #if defined(USE_LONG_DOUBLE)
2981 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2982 PTR2UV(sv), SvNVX(sv)));
2984 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2985 PTR2UV(sv), SvNVX(sv)));
2988 #ifdef NV_PRESERVES_UV
2989 (void)SvIOKp_on(sv);
2991 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2992 SvIV_set(sv, I_V(SvNVX(sv)));
2993 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2996 /* Integer is imprecise. NOK, IOKp */
2998 /* UV will not work better than IV */
3000 if (SvNVX(sv) > (NV)UV_MAX) {
3002 /* Integer is inaccurate. NOK, IOKp, is UV */
3003 SvUV_set(sv, UV_MAX);
3006 SvUV_set(sv, U_V(SvNVX(sv)));
3007 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3008 NV preservse UV so can do correct comparison. */
3009 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3013 /* Integer is imprecise. NOK, IOKp, is UV */
3018 #else /* NV_PRESERVES_UV */
3019 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3020 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3021 /* The UV slot will have been set from value returned by
3022 grok_number above. The NV slot has just been set using
3025 assert (SvIOKp(sv));
3027 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3028 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3029 /* Small enough to preserve all bits. */
3030 (void)SvIOKp_on(sv);
3032 SvIV_set(sv, I_V(SvNVX(sv)));
3033 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3035 /* Assumption: first non-preserved integer is < IV_MAX,
3036 this NV is in the preserved range, therefore: */
3037 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3039 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);
3042 sv_2iuv_non_preserve (sv, numtype);
3044 #endif /* NV_PRESERVES_UV */
3048 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3049 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3052 if (SvTYPE(sv) < SVt_IV)
3053 /* Typically the caller expects that sv_any is not NULL now. */
3054 sv_upgrade(sv, SVt_IV);
3058 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3059 PTR2UV(sv),SvUVX(sv)));
3060 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3066 Return the num value of an SV, doing any necessary string or integer
3067 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3074 Perl_sv_2nv(pTHX_ register SV *sv)
3078 if (SvGMAGICAL(sv)) {
3082 if (SvPOKp(sv) && SvLEN(sv)) {
3083 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3084 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
3086 return Atof(SvPVX(sv));
3090 return (NV)SvUVX(sv);
3092 return (NV)SvIVX(sv);
3095 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3096 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3102 if (SvTHINKFIRST(sv)) {
3105 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3106 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3107 return SvNV(tmpstr);
3108 return PTR2NV(SvRV(sv));
3111 sv_force_normal_flags(sv, 0);
3113 if (SvREADONLY(sv) && !SvOK(sv)) {
3114 if (ckWARN(WARN_UNINITIALIZED))
3119 if (SvTYPE(sv) < SVt_NV) {
3120 if (SvTYPE(sv) == SVt_IV)
3121 sv_upgrade(sv, SVt_PVNV);
3123 sv_upgrade(sv, SVt_NV);
3124 #ifdef USE_LONG_DOUBLE
3126 STORE_NUMERIC_LOCAL_SET_STANDARD();
3127 PerlIO_printf(Perl_debug_log,
3128 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3129 PTR2UV(sv), SvNVX(sv));
3130 RESTORE_NUMERIC_LOCAL();
3134 STORE_NUMERIC_LOCAL_SET_STANDARD();
3135 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3136 PTR2UV(sv), SvNVX(sv));
3137 RESTORE_NUMERIC_LOCAL();
3141 else if (SvTYPE(sv) < SVt_PVNV)
3142 sv_upgrade(sv, SVt_PVNV);
3147 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3148 #ifdef NV_PRESERVES_UV
3151 /* Only set the public NV OK flag if this NV preserves the IV */
3152 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3153 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3154 : (SvIVX(sv) == I_V(SvNVX(sv))))
3160 else if (SvPOKp(sv) && SvLEN(sv)) {
3162 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3163 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3165 #ifdef NV_PRESERVES_UV
3166 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3167 == IS_NUMBER_IN_UV) {
3168 /* It's definitely an integer */
3169 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3171 SvNV_set(sv, Atof(SvPVX(sv)));
3174 SvNV_set(sv, Atof(SvPVX(sv)));
3175 /* Only set the public NV OK flag if this NV preserves the value in
3176 the PV at least as well as an IV/UV would.
3177 Not sure how to do this 100% reliably. */
3178 /* if that shift count is out of range then Configure's test is
3179 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3181 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3182 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3183 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3184 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3185 /* Can't use strtol etc to convert this string, so don't try.
3186 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3189 /* value has been set. It may not be precise. */
3190 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3191 /* 2s complement assumption for (UV)IV_MIN */
3192 SvNOK_on(sv); /* Integer is too negative. */
3197 if (numtype & IS_NUMBER_NEG) {
3198 SvIV_set(sv, -(IV)value);
3199 } else if (value <= (UV)IV_MAX) {
3200 SvIV_set(sv, (IV)value);
3202 SvUV_set(sv, value);
3206 if (numtype & IS_NUMBER_NOT_INT) {
3207 /* I believe that even if the original PV had decimals,
3208 they are lost beyond the limit of the FP precision.
3209 However, neither is canonical, so both only get p
3210 flags. NWC, 2000/11/25 */
3211 /* Both already have p flags, so do nothing */
3214 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3215 if (SvIVX(sv) == I_V(nv)) {
3220 /* It had no "." so it must be integer. */
3223 /* between IV_MAX and NV(UV_MAX).
3224 Could be slightly > UV_MAX */
3226 if (numtype & IS_NUMBER_NOT_INT) {
3227 /* UV and NV both imprecise. */
3229 UV nv_as_uv = U_V(nv);
3231 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3242 #endif /* NV_PRESERVES_UV */
3245 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3247 if (SvTYPE(sv) < SVt_NV)
3248 /* Typically the caller expects that sv_any is not NULL now. */
3249 /* XXX Ilya implies that this is a bug in callers that assume this
3250 and ideally should be fixed. */
3251 sv_upgrade(sv, SVt_NV);
3254 #if defined(USE_LONG_DOUBLE)
3256 STORE_NUMERIC_LOCAL_SET_STANDARD();
3257 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3258 PTR2UV(sv), SvNVX(sv));
3259 RESTORE_NUMERIC_LOCAL();
3263 STORE_NUMERIC_LOCAL_SET_STANDARD();
3264 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3265 PTR2UV(sv), SvNVX(sv));
3266 RESTORE_NUMERIC_LOCAL();
3272 /* asIV(): extract an integer from the string value of an SV.
3273 * Caller must validate PVX */
3276 S_asIV(pTHX_ SV *sv)
3279 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3281 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3282 == IS_NUMBER_IN_UV) {
3283 /* It's definitely an integer */
3284 if (numtype & IS_NUMBER_NEG) {
3285 if (value < (UV)IV_MIN)
3288 if (value < (UV)IV_MAX)
3293 if (ckWARN(WARN_NUMERIC))
3296 return I_V(Atof(SvPVX(sv)));
3299 /* asUV(): extract an unsigned integer from the string value of an SV
3300 * Caller must validate PVX */
3303 S_asUV(pTHX_ SV *sv)
3306 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
3308 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3309 == IS_NUMBER_IN_UV) {
3310 /* It's definitely an integer */
3311 if (!(numtype & IS_NUMBER_NEG))
3315 if (ckWARN(WARN_NUMERIC))
3318 return U_V(Atof(SvPVX(sv)));
3322 =for apidoc sv_2pv_nolen
3324 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3325 use the macro wrapper C<SvPV_nolen(sv)> instead.
3330 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3333 return sv_2pv(sv, &n_a);
3336 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3337 * UV as a string towards the end of buf, and return pointers to start and
3340 * We assume that buf is at least TYPE_CHARS(UV) long.
3344 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3346 char *ptr = buf + TYPE_CHARS(UV);
3360 *--ptr = '0' + (char)(uv % 10);
3368 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3369 * this function provided for binary compatibility only
3373 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3375 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3379 =for apidoc sv_2pv_flags
3381 Returns a pointer to the string value of an SV, and sets *lp to its length.
3382 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3384 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3385 usually end up here too.
3391 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3396 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3397 char *tmpbuf = tbuf;
3403 if (SvGMAGICAL(sv)) {
3404 if (flags & SV_GMAGIC)
3412 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3414 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3419 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3424 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3425 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3432 if (SvTHINKFIRST(sv)) {
3435 register const char *typestr;
3436 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3437 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3438 char *pv = SvPV(tmpstr, *lp);
3448 typestr = "NULLREF";
3452 switch (SvTYPE(sv)) {
3454 if ( ((SvFLAGS(sv) &
3455 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3456 == (SVs_OBJECT|SVs_SMG))
3457 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3458 const regexp *re = (regexp *)mg->mg_obj;
3461 const char *fptr = "msix";
3466 char need_newline = 0;
3467 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3469 while((ch = *fptr++)) {
3471 reflags[left++] = ch;
3474 reflags[right--] = ch;
3479 reflags[left] = '-';
3483 mg->mg_len = re->prelen + 4 + left;
3485 * If /x was used, we have to worry about a regex
3486 * ending with a comment later being embedded
3487 * within another regex. If so, we don't want this
3488 * regex's "commentization" to leak out to the
3489 * right part of the enclosing regex, we must cap
3490 * it with a newline.
3492 * So, if /x was used, we scan backwards from the
3493 * end of the regex. If we find a '#' before we
3494 * find a newline, we need to add a newline
3495 * ourself. If we find a '\n' first (or if we
3496 * don't find '#' or '\n'), we don't need to add
3497 * anything. -jfriedl
3499 if (PMf_EXTENDED & re->reganch)
3501 const char *endptr = re->precomp + re->prelen;
3502 while (endptr >= re->precomp)
3504 const char c = *(endptr--);
3506 break; /* don't need another */
3508 /* we end while in a comment, so we
3510 mg->mg_len++; /* save space for it */
3511 need_newline = 1; /* note to add it */
3517 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3518 Copy("(?", mg->mg_ptr, 2, char);
3519 Copy(reflags, mg->mg_ptr+2, left, char);
3520 Copy(":", mg->mg_ptr+left+2, 1, char);
3521 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3523 mg->mg_ptr[mg->mg_len - 2] = '\n';
3524 mg->mg_ptr[mg->mg_len - 1] = ')';
3525 mg->mg_ptr[mg->mg_len] = 0;
3527 PL_reginterp_cnt += re->program[0].next_off;
3529 if (re->reganch & ROPT_UTF8)
3544 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3545 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3546 /* tied lvalues should appear to be
3547 * scalars for backwards compatitbility */
3548 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3549 ? "SCALAR" : "LVALUE"; break;
3550 case SVt_PVAV: typestr = "ARRAY"; break;
3551 case SVt_PVHV: typestr = "HASH"; break;
3552 case SVt_PVCV: typestr = "CODE"; break;
3553 case SVt_PVGV: typestr = "GLOB"; break;
3554 case SVt_PVFM: typestr = "FORMAT"; break;
3555 case SVt_PVIO: typestr = "IO"; break;
3556 default: typestr = "UNKNOWN"; break;
3560 const char *name = HvNAME_get(SvSTASH(sv));
3561 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3562 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3565 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3568 *lp = strlen(typestr);
3569 return (char *)typestr;
3571 if (SvREADONLY(sv) && !SvOK(sv)) {
3572 if (ckWARN(WARN_UNINITIALIZED))
3578 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3579 /* I'm assuming that if both IV and NV are equally valid then
3580 converting the IV is going to be more efficient */
3581 const U32 isIOK = SvIOK(sv);
3582 const U32 isUIOK = SvIsUV(sv);
3583 char buf[TYPE_CHARS(UV)];
3586 if (SvTYPE(sv) < SVt_PVIV)
3587 sv_upgrade(sv, SVt_PVIV);
3589 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3591 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3592 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3593 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3594 SvCUR_set(sv, ebuf - ptr);
3604 else if (SvNOKp(sv)) {
3605 if (SvTYPE(sv) < SVt_PVNV)
3606 sv_upgrade(sv, SVt_PVNV);
3607 /* The +20 is pure guesswork. Configure test needed. --jhi */
3608 SvGROW(sv, NV_DIG + 20);
3610 olderrno = errno; /* some Xenix systems wipe out errno here */
3612 if (SvNVX(sv) == 0.0)
3613 (void)strcpy(s,"0");
3617 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3620 #ifdef FIXNEGATIVEZERO
3621 if (*s == '-' && s[1] == '0' && !s[2])
3631 if (ckWARN(WARN_UNINITIALIZED)
3632 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3635 if (SvTYPE(sv) < SVt_PV)
3636 /* Typically the caller expects that sv_any is not NULL now. */
3637 sv_upgrade(sv, SVt_PV);
3640 *lp = s - SvPVX(sv);
3643 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3644 PTR2UV(sv),SvPVX(sv)));
3648 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3649 /* Sneaky stuff here */
3653 tsv = newSVpv(tmpbuf, 0);
3670 len = strlen(tmpbuf);
3672 #ifdef FIXNEGATIVEZERO
3673 if (len == 2 && t[0] == '-' && t[1] == '0') {
3678 (void)SvUPGRADE(sv, SVt_PV);
3680 s = SvGROW(sv, len + 1);
3683 return strcpy(s, t);
3688 =for apidoc sv_copypv
3690 Copies a stringified representation of the source SV into the
3691 destination SV. Automatically performs any necessary mg_get and
3692 coercion of numeric values into strings. Guaranteed to preserve
3693 UTF-8 flag even from overloaded objects. Similar in nature to
3694 sv_2pv[_flags] but operates directly on an SV instead of just the
3695 string. Mostly uses sv_2pv_flags to do its work, except when that
3696 would lose the UTF-8'ness of the PV.
3702 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3707 sv_setpvn(dsv,s,len);
3715 =for apidoc sv_2pvbyte_nolen
3717 Return a pointer to the byte-encoded representation of the SV.
3718 May cause the SV to be downgraded from UTF-8 as a side-effect.
3720 Usually accessed via the C<SvPVbyte_nolen> macro.
3726 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3729 return sv_2pvbyte(sv, &n_a);
3733 =for apidoc sv_2pvbyte
3735 Return a pointer to the byte-encoded representation of the SV, and set *lp
3736 to its length. May cause the SV to be downgraded from UTF-8 as a
3739 Usually accessed via the C<SvPVbyte> macro.
3745 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3747 sv_utf8_downgrade(sv,0);
3748 return SvPV(sv,*lp);
3752 =for apidoc sv_2pvutf8_nolen
3754 Return a pointer to the UTF-8-encoded representation of the SV.
3755 May cause the SV to be upgraded to UTF-8 as a side-effect.
3757 Usually accessed via the C<SvPVutf8_nolen> macro.
3763 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3766 return sv_2pvutf8(sv, &n_a);
3770 =for apidoc sv_2pvutf8
3772 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3773 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3775 Usually accessed via the C<SvPVutf8> macro.
3781 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3783 sv_utf8_upgrade(sv);
3784 return SvPV(sv,*lp);
3788 =for apidoc sv_2bool
3790 This function is only called on magical items, and is only used by
3791 sv_true() or its macro equivalent.
3797 Perl_sv_2bool(pTHX_ register SV *sv)
3806 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3807 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3808 return (bool)SvTRUE(tmpsv);
3809 return SvRV(sv) != 0;
3812 register XPV* Xpvtmp;
3813 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3814 (*sv->sv_u.svu_pv > '0' ||
3815 Xpvtmp->xpv_cur > 1 ||
3816 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3823 return SvIVX(sv) != 0;
3826 return SvNVX(sv) != 0.0;
3833 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3834 * this function provided for binary compatibility only
3839 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3841 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3845 =for apidoc sv_utf8_upgrade
3847 Converts the PV of an SV to its UTF-8-encoded form.
3848 Forces the SV to string form if it is not already.
3849 Always sets the SvUTF8 flag to avoid future validity checks even
3850 if all the bytes have hibit clear.
3852 This is not as a general purpose byte encoding to Unicode interface:
3853 use the Encode extension for that.
3855 =for apidoc sv_utf8_upgrade_flags
3857 Converts the PV of an SV to its UTF-8-encoded form.
3858 Forces the SV to string form if it is not already.
3859 Always sets the SvUTF8 flag to avoid future validity checks even
3860 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3861 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3862 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3864 This is not as a general purpose byte encoding to Unicode interface:
3865 use the Encode extension for that.
3871 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3873 if (sv == &PL_sv_undef)
3877 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3878 (void) sv_2pv_flags(sv,&len, flags);
3882 (void) SvPV_force(sv,len);
3891 sv_force_normal_flags(sv, 0);
3894 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3895 sv_recode_to_utf8(sv, PL_encoding);
3896 else { /* Assume Latin-1/EBCDIC */
3897 /* This function could be much more efficient if we
3898 * had a FLAG in SVs to signal if there are any hibit
3899 * chars in the PV. Given that there isn't such a flag
3900 * make the loop as fast as possible. */
3901 U8 *s = (U8 *) SvPVX(sv);
3902 U8 *e = (U8 *) SvEND(sv);
3908 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3912 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3913 s = bytes_to_utf8((U8*)s, &len);
3915 SvPV_free(sv); /* No longer using what was there before. */
3917 SvPV_set(sv, (char*)s);
3918 SvCUR_set(sv, len - 1);
3919 SvLEN_set(sv, len); /* No longer know the real size. */
3921 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3928 =for apidoc sv_utf8_downgrade
3930 Attempts to convert the PV of an SV from characters to bytes.
3931 If the PV contains a character beyond byte, this conversion will fail;
3932 in this case, either returns false or, if C<fail_ok> is not
3935 This is not as a general purpose Unicode to byte encoding interface:
3936 use the Encode extension for that.
3942 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3944 if (SvPOKp(sv) && SvUTF8(sv)) {
3950 sv_force_normal_flags(sv, 0);
3952 s = (U8 *) SvPV(sv, len);
3953 if (!utf8_to_bytes(s, &len)) {
3958 Perl_croak(aTHX_ "Wide character in %s",
3961 Perl_croak(aTHX_ "Wide character");
3972 =for apidoc sv_utf8_encode
3974 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3975 flag off so that it looks like octets again.
3981 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3983 (void) sv_utf8_upgrade(sv);
3985 sv_force_normal_flags(sv, 0);
3987 if (SvREADONLY(sv)) {
3988 Perl_croak(aTHX_ PL_no_modify);
3994 =for apidoc sv_utf8_decode
3996 If the PV of the SV is an octet sequence in UTF-8
3997 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3998 so that it looks like a character. If the PV contains only single-byte
3999 characters, the C<SvUTF8> flag stays being off.
4000 Scans PV for validity and returns false if the PV is invalid UTF-8.
4006 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4012 /* The octets may have got themselves encoded - get them back as
4015 if (!sv_utf8_downgrade(sv, TRUE))
4018 /* it is actually just a matter of turning the utf8 flag on, but
4019 * we want to make sure everything inside is valid utf8 first.
4021 c = (U8 *) SvPVX(sv);
4022 if (!is_utf8_string(c, SvCUR(sv)+1))
4024 e = (U8 *) SvEND(sv);
4027 if (!UTF8_IS_INVARIANT(ch)) {
4036 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4037 * this function provided for binary compatibility only
4041 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4043 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4047 =for apidoc sv_setsv
4049 Copies the contents of the source SV C<ssv> into the destination SV
4050 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4051 function if the source SV needs to be reused. Does not handle 'set' magic.
4052 Loosely speaking, it performs a copy-by-value, obliterating any previous
4053 content of the destination.
4055 You probably want to use one of the assortment of wrappers, such as
4056 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4057 C<SvSetMagicSV_nosteal>.
4059 =for apidoc sv_setsv_flags
4061 Copies the contents of the source SV C<ssv> into the destination SV
4062 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4063 function if the source SV needs to be reused. Does not handle 'set' magic.
4064 Loosely speaking, it performs a copy-by-value, obliterating any previous
4065 content of the destination.
4066 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4067 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4068 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4069 and C<sv_setsv_nomg> are implemented in terms of this function.
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 This is the primary function for copying scalars, and most other
4076 copy-ish functions and macros use this underneath.
4082 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4084 register U32 sflags;
4090 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4092 sstr = &PL_sv_undef;
4093 stype = SvTYPE(sstr);
4094 dtype = SvTYPE(dstr);
4099 /* need to nuke the magic */
4101 SvRMAGICAL_off(dstr);
4104 /* There's a lot of redundancy below but we're going for speed here */
4109 if (dtype != SVt_PVGV) {
4110 (void)SvOK_off(dstr);
4118 sv_upgrade(dstr, SVt_IV);
4121 sv_upgrade(dstr, SVt_PVNV);
4125 sv_upgrade(dstr, SVt_PVIV);
4128 (void)SvIOK_only(dstr);
4129 SvIV_set(dstr, SvIVX(sstr));
4132 if (SvTAINTED(sstr))
4143 sv_upgrade(dstr, SVt_NV);
4148 sv_upgrade(dstr, SVt_PVNV);
4151 SvNV_set(dstr, SvNVX(sstr));
4152 (void)SvNOK_only(dstr);
4153 if (SvTAINTED(sstr))
4161 sv_upgrade(dstr, SVt_RV);
4162 else if (dtype == SVt_PVGV &&
4163 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4166 if (GvIMPORTED(dstr) != GVf_IMPORTED
4167 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4169 GvIMPORTED_on(dstr);
4178 #ifdef PERL_COPY_ON_WRITE
4179 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4180 if (dtype < SVt_PVIV)
4181 sv_upgrade(dstr, SVt_PVIV);
4188 sv_upgrade(dstr, SVt_PV);
4191 if (dtype < SVt_PVIV)
4192 sv_upgrade(dstr, SVt_PVIV);
4195 if (dtype < SVt_PVNV)
4196 sv_upgrade(dstr, SVt_PVNV);
4203 const char * const type = sv_reftype(sstr,0);
4205 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
4207 Perl_croak(aTHX_ "Bizarre copy of %s", type);
4212 if (dtype <= SVt_PVGV) {
4214 if (dtype != SVt_PVGV) {
4215 const char * const name = GvNAME(sstr);
4216 const STRLEN len = GvNAMELEN(sstr);
4217 /* don't upgrade SVt_PVLV: it can hold a glob */
4218 if (dtype != SVt_PVLV)
4219 sv_upgrade(dstr, SVt_PVGV);
4220 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4221 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4222 GvNAME(dstr) = savepvn(name, len);
4223 GvNAMELEN(dstr) = len;
4224 SvFAKE_on(dstr); /* can coerce to non-glob */
4226 /* ahem, death to those who redefine active sort subs */
4227 else if (PL_curstackinfo->si_type == PERLSI_SORT
4228 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4229 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4232 #ifdef GV_UNIQUE_CHECK
4233 if (GvUNIQUE((GV*)dstr)) {
4234 Perl_croak(aTHX_ PL_no_modify);
4238 (void)SvOK_off(dstr);
4239 GvINTRO_off(dstr); /* one-shot flag */
4241 GvGP(dstr) = gp_ref(GvGP(sstr));
4242 if (SvTAINTED(sstr))
4244 if (GvIMPORTED(dstr) != GVf_IMPORTED
4245 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4247 GvIMPORTED_on(dstr);
4255 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4257 if ((int)SvTYPE(sstr) != stype) {
4258 stype = SvTYPE(sstr);
4259 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4263 if (stype == SVt_PVLV)
4264 (void)SvUPGRADE(dstr, SVt_PVNV);
4266 (void)SvUPGRADE(dstr, (U32)stype);
4269 sflags = SvFLAGS(sstr);
4271 if (sflags & SVf_ROK) {
4272 if (dtype >= SVt_PV) {
4273 if (dtype == SVt_PVGV) {
4274 SV *sref = SvREFCNT_inc(SvRV(sstr));
4276 const int intro = GvINTRO(dstr);
4278 #ifdef GV_UNIQUE_CHECK
4279 if (GvUNIQUE((GV*)dstr)) {
4280 Perl_croak(aTHX_ PL_no_modify);
4285 GvINTRO_off(dstr); /* one-shot flag */
4286 GvLINE(dstr) = CopLINE(PL_curcop);
4287 GvEGV(dstr) = (GV*)dstr;
4290 switch (SvTYPE(sref)) {
4293 SAVEGENERICSV(GvAV(dstr));
4295 dref = (SV*)GvAV(dstr);
4296 GvAV(dstr) = (AV*)sref;
4297 if (!GvIMPORTED_AV(dstr)
4298 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4300 GvIMPORTED_AV_on(dstr);
4305 SAVEGENERICSV(GvHV(dstr));
4307 dref = (SV*)GvHV(dstr);
4308 GvHV(dstr) = (HV*)sref;
4309 if (!GvIMPORTED_HV(dstr)
4310 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4312 GvIMPORTED_HV_on(dstr);
4317 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4318 SvREFCNT_dec(GvCV(dstr));
4319 GvCV(dstr) = Nullcv;
4320 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4321 PL_sub_generation++;
4323 SAVEGENERICSV(GvCV(dstr));
4326 dref = (SV*)GvCV(dstr);
4327 if (GvCV(dstr) != (CV*)sref) {
4328 CV* cv = GvCV(dstr);
4330 if (!GvCVGEN((GV*)dstr) &&
4331 (CvROOT(cv) || CvXSUB(cv)))
4333 /* ahem, death to those who redefine
4334 * active sort subs */
4335 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4336 PL_sortcop == CvSTART(cv))
4338 "Can't redefine active sort subroutine %s",
4339 GvENAME((GV*)dstr));
4340 /* Redefining a sub - warning is mandatory if
4341 it was a const and its value changed. */
4342 if (ckWARN(WARN_REDEFINE)
4344 && (!CvCONST((CV*)sref)
4345 || sv_cmp(cv_const_sv(cv),
4346 cv_const_sv((CV*)sref)))))
4348 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4350 ? "Constant subroutine %s::%s redefined"
4351 : "Subroutine %s::%s redefined",
4352 HvNAME_get(GvSTASH((GV*)dstr)),
4353 GvENAME((GV*)dstr));
4357 cv_ckproto(cv, (GV*)dstr,
4358 SvPOK(sref) ? SvPVX(sref) : Nullch);
4360 GvCV(dstr) = (CV*)sref;
4361 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4362 GvASSUMECV_on(dstr);
4363 PL_sub_generation++;
4365 if (!GvIMPORTED_CV(dstr)
4366 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4368 GvIMPORTED_CV_on(dstr);
4373 SAVEGENERICSV(GvIOp(dstr));
4375 dref = (SV*)GvIOp(dstr);
4376 GvIOp(dstr) = (IO*)sref;
4380 SAVEGENERICSV(GvFORM(dstr));
4382 dref = (SV*)GvFORM(dstr);
4383 GvFORM(dstr) = (CV*)sref;
4387 SAVEGENERICSV(GvSV(dstr));
4389 dref = (SV*)GvSV(dstr);
4391 if (!GvIMPORTED_SV(dstr)
4392 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4394 GvIMPORTED_SV_on(dstr);
4400 if (SvTAINTED(sstr))
4410 (void)SvOK_off(dstr);
4411 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4413 if (sflags & SVp_NOK) {
4415 /* Only set the public OK flag if the source has public OK. */
4416 if (sflags & SVf_NOK)
4417 SvFLAGS(dstr) |= SVf_NOK;
4418 SvNV_set(dstr, SvNVX(sstr));
4420 if (sflags & SVp_IOK) {
4421 (void)SvIOKp_on(dstr);
4422 if (sflags & SVf_IOK)
4423 SvFLAGS(dstr) |= SVf_IOK;
4424 if (sflags & SVf_IVisUV)
4426 SvIV_set(dstr, SvIVX(sstr));
4428 if (SvAMAGIC(sstr)) {
4432 else if (sflags & SVp_POK) {
4436 * Check to see if we can just swipe the string. If so, it's a
4437 * possible small lose on short strings, but a big win on long ones.
4438 * It might even be a win on short strings if SvPVX(dstr)
4439 * has to be allocated and SvPVX(sstr) has to be freed.
4442 /* Whichever path we take through the next code, we want this true,
4443 and doing it now facilitates the COW check. */
4444 (void)SvPOK_only(dstr);
4447 #ifdef PERL_COPY_ON_WRITE
4448 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4452 (sflags & SVs_TEMP) && /* slated for free anyway? */
4453 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4454 (!(flags & SV_NOSTEAL)) &&
4455 /* and we're allowed to steal temps */
4456 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4457 SvLEN(sstr) && /* and really is a string */
4458 /* and won't be needed again, potentially */
4459 !(PL_op && PL_op->op_type == OP_AASSIGN))
4460 #ifdef PERL_COPY_ON_WRITE
4461 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4462 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4463 && SvTYPE(sstr) >= SVt_PVIV)
4466 /* Failed the swipe test, and it's not a shared hash key either.
4467 Have to copy the string. */
4468 STRLEN len = SvCUR(sstr);
4469 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4470 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4471 SvCUR_set(dstr, len);
4472 *SvEND(dstr) = '\0';
4474 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4476 #ifdef PERL_COPY_ON_WRITE
4477 /* Either it's a shared hash key, or it's suitable for
4478 copy-on-write or we can swipe the string. */
4480 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4485 /* I believe I should acquire a global SV mutex if
4486 it's a COW sv (not a shared hash key) to stop
4487 it going un copy-on-write.
4488 If the source SV has gone un copy on write between up there
4489 and down here, then (assert() that) it is of the correct
4490 form to make it copy on write again */
4491 if ((sflags & (SVf_FAKE | SVf_READONLY))
4492 != (SVf_FAKE | SVf_READONLY)) {
4493 SvREADONLY_on(sstr);
4495 /* Make the source SV into a loop of 1.
4496 (about to become 2) */
4497 SV_COW_NEXT_SV_SET(sstr, sstr);
4501 /* Initial code is common. */
4502 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4504 SvFLAGS(dstr) &= ~SVf_OOK;
4505 Safefree(SvPVX(dstr) - SvIVX(dstr));
4507 else if (SvLEN(dstr))
4508 Safefree(SvPVX(dstr));
4511 #ifdef PERL_COPY_ON_WRITE
4513 /* making another shared SV. */
4514 STRLEN cur = SvCUR(sstr);
4515 STRLEN len = SvLEN(sstr);
4516 assert (SvTYPE(dstr) >= SVt_PVIV);
4518 /* SvIsCOW_normal */
4519 /* splice us in between source and next-after-source. */
4520 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4521 SV_COW_NEXT_SV_SET(sstr, dstr);
4522 SvPV_set(dstr, SvPVX(sstr));
4524 /* SvIsCOW_shared_hash */
4525 UV hash = SvUVX(sstr);
4526 DEBUG_C(PerlIO_printf(Perl_debug_log,
4527 "Copy on write: Sharing hash\n"));
4529 sharepvn(SvPVX(sstr),
4530 (sflags & SVf_UTF8?-cur:cur), hash));
4531 SvUV_set(dstr, hash);
4533 SvLEN_set(dstr, len);
4534 SvCUR_set(dstr, cur);
4535 SvREADONLY_on(dstr);
4537 /* Relesase a global SV mutex. */
4541 { /* Passes the swipe test. */
4542 SvPV_set(dstr, SvPVX(sstr));
4543 SvLEN_set(dstr, SvLEN(sstr));
4544 SvCUR_set(dstr, SvCUR(sstr));
4547 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4548 SvPV_set(sstr, Nullch);
4554 if (sflags & SVf_UTF8)
4557 if (sflags & SVp_NOK) {
4559 if (sflags & SVf_NOK)
4560 SvFLAGS(dstr) |= SVf_NOK;
4561 SvNV_set(dstr, SvNVX(sstr));
4563 if (sflags & SVp_IOK) {
4564 (void)SvIOKp_on(dstr);
4565 if (sflags & SVf_IOK)
4566 SvFLAGS(dstr) |= SVf_IOK;
4567 if (sflags & SVf_IVisUV)
4569 SvIV_set(dstr, SvIVX(sstr));
4572 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4573 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4574 smg->mg_ptr, smg->mg_len);
4575 SvRMAGICAL_on(dstr);
4578 else if (sflags & SVp_IOK) {
4579 if (sflags & SVf_IOK)
4580 (void)SvIOK_only(dstr);
4582 (void)SvOK_off(dstr);
4583 (void)SvIOKp_on(dstr);
4585 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4586 if (sflags & SVf_IVisUV)
4588 SvIV_set(dstr, SvIVX(sstr));
4589 if (sflags & SVp_NOK) {
4590 if (sflags & SVf_NOK)
4591 (void)SvNOK_on(dstr);
4593 (void)SvNOKp_on(dstr);
4594 SvNV_set(dstr, SvNVX(sstr));
4597 else if (sflags & SVp_NOK) {
4598 if (sflags & SVf_NOK)
4599 (void)SvNOK_only(dstr);
4601 (void)SvOK_off(dstr);
4604 SvNV_set(dstr, SvNVX(sstr));
4607 if (dtype == SVt_PVGV) {
4608 if (ckWARN(WARN_MISC))
4609 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4612 (void)SvOK_off(dstr);
4614 if (SvTAINTED(sstr))
4619 =for apidoc sv_setsv_mg
4621 Like C<sv_setsv>, but also handles 'set' magic.
4627 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4629 sv_setsv(dstr,sstr);
4633 #ifdef PERL_COPY_ON_WRITE
4635 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4637 STRLEN cur = SvCUR(sstr);
4638 STRLEN len = SvLEN(sstr);
4639 register char *new_pv;
4642 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4650 if (SvTHINKFIRST(dstr))
4651 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4652 else if (SvPVX(dstr))
4653 Safefree(SvPVX(dstr));
4657 (void)SvUPGRADE (dstr, SVt_PVIV);
4659 assert (SvPOK(sstr));
4660 assert (SvPOKp(sstr));
4661 assert (!SvIOK(sstr));
4662 assert (!SvIOKp(sstr));
4663 assert (!SvNOK(sstr));
4664 assert (!SvNOKp(sstr));
4666 if (SvIsCOW(sstr)) {
4668 if (SvLEN(sstr) == 0) {
4669 /* source is a COW shared hash key. */
4670 UV hash = SvUVX(sstr);
4671 DEBUG_C(PerlIO_printf(Perl_debug_log,
4672 "Fast copy on write: Sharing hash\n"));
4673 SvUV_set(dstr, hash);
4674 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4677 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4679 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4680 (void)SvUPGRADE (sstr, SVt_PVIV);
4681 SvREADONLY_on(sstr);
4683 DEBUG_C(PerlIO_printf(Perl_debug_log,
4684 "Fast copy on write: Converting sstr to COW\n"));
4685 SV_COW_NEXT_SV_SET(dstr, sstr);
4687 SV_COW_NEXT_SV_SET(sstr, dstr);
4688 new_pv = SvPVX(sstr);
4691 SvPV_set(dstr, new_pv);
4692 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4695 SvLEN_set(dstr, len);
4696 SvCUR_set(dstr, cur);
4705 =for apidoc sv_setpvn
4707 Copies a string into an SV. The C<len> parameter indicates the number of
4708 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4709 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4715 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4717 register char *dptr;
4719 SV_CHECK_THINKFIRST_COW_DROP(sv);
4725 /* len is STRLEN which is unsigned, need to copy to signed */
4728 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4730 (void)SvUPGRADE(sv, SVt_PV);
4732 SvGROW(sv, len + 1);
4734 Move(ptr,dptr,len,char);
4737 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4742 =for apidoc sv_setpvn_mg
4744 Like C<sv_setpvn>, but also handles 'set' magic.
4750 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4752 sv_setpvn(sv,ptr,len);
4757 =for apidoc sv_setpv
4759 Copies a string into an SV. The string must be null-terminated. Does not
4760 handle 'set' magic. See C<sv_setpv_mg>.
4766 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4768 register STRLEN len;
4770 SV_CHECK_THINKFIRST_COW_DROP(sv);
4776 (void)SvUPGRADE(sv, SVt_PV);
4778 SvGROW(sv, len + 1);
4779 Move(ptr,SvPVX(sv),len+1,char);
4781 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4786 =for apidoc sv_setpv_mg
4788 Like C<sv_setpv>, but also handles 'set' magic.
4794 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4801 =for apidoc sv_usepvn
4803 Tells an SV to use C<ptr> to find its string value. Normally the string is
4804 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4805 The C<ptr> should point to memory that was allocated by C<malloc>. The
4806 string length, C<len>, must be supplied. This function will realloc the
4807 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4808 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4809 See C<sv_usepvn_mg>.
4815 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4818 SV_CHECK_THINKFIRST_COW_DROP(sv);
4819 (void)SvUPGRADE(sv, SVt_PV);
4827 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4828 ptr = safesysrealloc (ptr, allocate);
4831 SvLEN_set(sv, allocate);
4833 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4838 =for apidoc sv_usepvn_mg
4840 Like C<sv_usepvn>, but also handles 'set' magic.
4846 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4848 sv_usepvn(sv,ptr,len);
4852 #ifdef PERL_COPY_ON_WRITE
4853 /* Need to do this *after* making the SV normal, as we need the buffer
4854 pointer to remain valid until after we've copied it. If we let go too early,
4855 another thread could invalidate it by unsharing last of the same hash key
4856 (which it can do by means other than releasing copy-on-write Svs)
4857 or by changing the other copy-on-write SVs in the loop. */
4859 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4860 U32 hash, SV *after)
4862 if (len) { /* this SV was SvIsCOW_normal(sv) */
4863 /* we need to find the SV pointing to us. */
4864 SV *current = SV_COW_NEXT_SV(after);
4866 if (current == sv) {
4867 /* The SV we point to points back to us (there were only two of us
4869 Hence other SV is no longer copy on write either. */
4871 SvREADONLY_off(after);
4873 /* We need to follow the pointers around the loop. */
4875 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4878 /* don't loop forever if the structure is bust, and we have
4879 a pointer into a closed loop. */
4880 assert (current != after);
4881 assert (SvPVX(current) == pvx);
4883 /* Make the SV before us point to the SV after us. */
4884 SV_COW_NEXT_SV_SET(current, after);
4887 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4892 Perl_sv_release_IVX(pTHX_ register SV *sv)
4895 sv_force_normal_flags(sv, 0);
4901 =for apidoc sv_force_normal_flags
4903 Undo various types of fakery on an SV: if the PV is a shared string, make
4904 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4905 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4906 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4907 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4908 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4909 set to some other value.) In addition, the C<flags> parameter gets passed to
4910 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4911 with flags set to 0.
4917 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4919 #ifdef PERL_COPY_ON_WRITE
4920 if (SvREADONLY(sv)) {
4921 /* At this point I believe I should acquire a global SV mutex. */
4923 char *pvx = SvPVX(sv);
4924 STRLEN len = SvLEN(sv);
4925 STRLEN cur = SvCUR(sv);
4926 U32 hash = SvUVX(sv);
4927 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4929 PerlIO_printf(Perl_debug_log,
4930 "Copy on write: Force normal %ld\n",
4936 /* This SV doesn't own the buffer, so need to New() a new one: */
4937 SvPV_set(sv, (char*)0);
4939 if (flags & SV_COW_DROP_PV) {
4940 /* OK, so we don't need to copy our buffer. */
4943 SvGROW(sv, cur + 1);
4944 Move(pvx,SvPVX(sv),cur,char);
4948 sv_release_COW(sv, pvx, cur, len, hash, next);
4953 else if (IN_PERL_RUNTIME)
4954 Perl_croak(aTHX_ PL_no_modify);
4955 /* At this point I believe that I can drop the global SV mutex. */
4958 if (SvREADONLY(sv)) {
4960 char *pvx = SvPVX(sv);
4961 const int is_utf8 = SvUTF8(sv);
4962 STRLEN len = SvCUR(sv);
4963 U32 hash = SvUVX(sv);
4966 SvPV_set(sv, (char*)0);
4968 SvGROW(sv, len + 1);
4969 Move(pvx,SvPVX(sv),len,char);
4971 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4973 else if (IN_PERL_RUNTIME)
4974 Perl_croak(aTHX_ PL_no_modify);
4978 sv_unref_flags(sv, flags);
4979 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4984 =for apidoc sv_force_normal
4986 Undo various types of fakery on an SV: if the PV is a shared string, make
4987 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4988 an xpvmg. See also C<sv_force_normal_flags>.
4994 Perl_sv_force_normal(pTHX_ register SV *sv)
4996 sv_force_normal_flags(sv, 0);
5002 Efficient removal of characters from the beginning of the string buffer.
5003 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5004 the string buffer. The C<ptr> becomes the first character of the adjusted
5005 string. Uses the "OOK hack".
5006 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
5007 refer to the same chunk of data.
5013 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
5015 register STRLEN delta;
5016 if (!ptr || !SvPOKp(sv))
5018 delta = ptr - SvPVX(sv);
5019 SV_CHECK_THINKFIRST(sv);
5020 if (SvTYPE(sv) < SVt_PVIV)
5021 sv_upgrade(sv,SVt_PVIV);
5024 if (!SvLEN(sv)) { /* make copy of shared string */
5025 const char *pvx = SvPVX(sv);
5026 STRLEN len = SvCUR(sv);
5027 SvGROW(sv, len + 1);
5028 Move(pvx,SvPVX(sv),len,char);
5032 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5033 and we do that anyway inside the SvNIOK_off
5035 SvFLAGS(sv) |= SVf_OOK;
5038 SvLEN_set(sv, SvLEN(sv) - delta);
5039 SvCUR_set(sv, SvCUR(sv) - delta);
5040 SvPV_set(sv, SvPVX(sv) + delta);
5041 SvIV_set(sv, SvIVX(sv) + delta);
5044 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5045 * this function provided for binary compatibility only
5049 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5051 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5055 =for apidoc sv_catpvn
5057 Concatenates the string onto the end of the string which is in the SV. The
5058 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5059 status set, then the bytes appended should be valid UTF-8.
5060 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5062 =for apidoc sv_catpvn_flags
5064 Concatenates the string onto the end of the string which is in the SV. The
5065 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5066 status set, then the bytes appended should be valid UTF-8.
5067 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5068 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5069 in terms of this function.
5075 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5078 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
5080 SvGROW(dsv, dlen + slen + 1);
5083 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5084 SvCUR_set(dsv, SvCUR(dsv) + slen);
5086 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5091 =for apidoc sv_catpvn_mg
5093 Like C<sv_catpvn>, but also handles 'set' magic.
5099 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5101 sv_catpvn(sv,ptr,len);
5105 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5106 * this function provided for binary compatibility only
5110 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5112 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5116 =for apidoc sv_catsv
5118 Concatenates the string from SV C<ssv> onto the end of the string in
5119 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5120 not 'set' magic. See C<sv_catsv_mg>.
5122 =for apidoc sv_catsv_flags
5124 Concatenates the string from SV C<ssv> onto the end of the string in
5125 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5126 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5127 and C<sv_catsv_nomg> are implemented in terms of this function.
5132 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5138 if ((spv = SvPV(ssv, slen))) {
5139 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5140 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5141 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5142 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5143 dsv->sv_flags doesn't have that bit set.
5144 Andy Dougherty 12 Oct 2001
5146 I32 sutf8 = DO_UTF8(ssv);
5149 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5151 dutf8 = DO_UTF8(dsv);
5153 if (dutf8 != sutf8) {
5155 /* Not modifying source SV, so taking a temporary copy. */
5156 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5158 sv_utf8_upgrade(csv);
5159 spv = SvPV(csv, slen);
5162 sv_utf8_upgrade_nomg(dsv);
5164 sv_catpvn_nomg(dsv, spv, slen);
5169 =for apidoc sv_catsv_mg
5171 Like C<sv_catsv>, but also handles 'set' magic.
5177 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5184 =for apidoc sv_catpv
5186 Concatenates the string onto the end of the string which is in the SV.
5187 If the SV has the UTF-8 status set, then the bytes appended should be
5188 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5193 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5195 register STRLEN len;
5201 junk = SvPV_force(sv, tlen);
5203 SvGROW(sv, tlen + len + 1);
5206 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5207 SvCUR_set(sv, SvCUR(sv) + len);
5208 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5213 =for apidoc sv_catpv_mg
5215 Like C<sv_catpv>, but also handles 'set' magic.
5221 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5230 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5231 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5238 Perl_newSV(pTHX_ STRLEN len)
5244 sv_upgrade(sv, SVt_PV);
5245 SvGROW(sv, len + 1);
5250 =for apidoc sv_magicext
5252 Adds magic to an SV, upgrading it if necessary. Applies the
5253 supplied vtable and returns a pointer to the magic added.
5255 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5256 In particular, you can add magic to SvREADONLY SVs, and add more than
5257 one instance of the same 'how'.
5259 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5260 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5261 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5262 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5264 (This is now used as a subroutine by C<sv_magic>.)
5269 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5270 const char* name, I32 namlen)
5274 if (SvTYPE(sv) < SVt_PVMG) {
5275 (void)SvUPGRADE(sv, SVt_PVMG);
5277 Newz(702,mg, 1, MAGIC);
5278 mg->mg_moremagic = SvMAGIC(sv);
5279 SvMAGIC_set(sv, mg);
5281 /* Sometimes a magic contains a reference loop, where the sv and
5282 object refer to each other. To prevent a reference loop that
5283 would prevent such objects being freed, we look for such loops
5284 and if we find one we avoid incrementing the object refcount.
5286 Note we cannot do this to avoid self-tie loops as intervening RV must
5287 have its REFCNT incremented to keep it in existence.
5290 if (!obj || obj == sv ||
5291 how == PERL_MAGIC_arylen ||
5292 how == PERL_MAGIC_qr ||
5293 how == PERL_MAGIC_symtab ||
5294 (SvTYPE(obj) == SVt_PVGV &&
5295 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5296 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5297 GvFORM(obj) == (CV*)sv)))
5302 mg->mg_obj = SvREFCNT_inc(obj);
5303 mg->mg_flags |= MGf_REFCOUNTED;
5306 /* Normal self-ties simply pass a null object, and instead of
5307 using mg_obj directly, use the SvTIED_obj macro to produce a
5308 new RV as needed. For glob "self-ties", we are tieing the PVIO
5309 with an RV obj pointing to the glob containing the PVIO. In
5310 this case, to avoid a reference loop, we need to weaken the
5314 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5315 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5321 mg->mg_len = namlen;
5324 mg->mg_ptr = savepvn(name, namlen);
5325 else if (namlen == HEf_SVKEY)
5326 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5328 mg->mg_ptr = (char *) name;
5330 mg->mg_virtual = vtable;
5334 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5339 =for apidoc sv_magic
5341 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5342 then adds a new magic item of type C<how> to the head of the magic list.
5344 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5345 handling of the C<name> and C<namlen> arguments.
5347 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5348 to add more than one instance of the same 'how'.
5354 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5356 const MGVTBL *vtable = 0;
5359 #ifdef PERL_COPY_ON_WRITE
5361 sv_force_normal_flags(sv, 0);
5363 if (SvREADONLY(sv)) {
5365 && how != PERL_MAGIC_regex_global
5366 && how != PERL_MAGIC_bm
5367 && how != PERL_MAGIC_fm
5368 && how != PERL_MAGIC_sv
5369 && how != PERL_MAGIC_backref
5372 Perl_croak(aTHX_ PL_no_modify);
5375 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5376 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5377 /* sv_magic() refuses to add a magic of the same 'how' as an
5380 if (how == PERL_MAGIC_taint)
5388 vtable = &PL_vtbl_sv;
5390 case PERL_MAGIC_overload:
5391 vtable = &PL_vtbl_amagic;
5393 case PERL_MAGIC_overload_elem:
5394 vtable = &PL_vtbl_amagicelem;
5396 case PERL_MAGIC_overload_table:
5397 vtable = &PL_vtbl_ovrld;
5400 vtable = &PL_vtbl_bm;
5402 case PERL_MAGIC_regdata:
5403 vtable = &PL_vtbl_regdata;
5405 case PERL_MAGIC_regdatum:
5406 vtable = &PL_vtbl_regdatum;
5408 case PERL_MAGIC_env:
5409 vtable = &PL_vtbl_env;
5412 vtable = &PL_vtbl_fm;
5414 case PERL_MAGIC_envelem:
5415 vtable = &PL_vtbl_envelem;
5417 case PERL_MAGIC_regex_global:
5418 vtable = &PL_vtbl_mglob;
5420 case PERL_MAGIC_isa:
5421 vtable = &PL_vtbl_isa;
5423 case PERL_MAGIC_isaelem:
5424 vtable = &PL_vtbl_isaelem;
5426 case PERL_MAGIC_nkeys:
5427 vtable = &PL_vtbl_nkeys;
5429 case PERL_MAGIC_dbfile:
5432 case PERL_MAGIC_dbline:
5433 vtable = &PL_vtbl_dbline;
5435 #ifdef USE_LOCALE_COLLATE
5436 case PERL_MAGIC_collxfrm:
5437 vtable = &PL_vtbl_collxfrm;
5439 #endif /* USE_LOCALE_COLLATE */
5440 case PERL_MAGIC_tied:
5441 vtable = &PL_vtbl_pack;
5443 case PERL_MAGIC_tiedelem:
5444 case PERL_MAGIC_tiedscalar:
5445 vtable = &PL_vtbl_packelem;
5448 vtable = &PL_vtbl_regexp;
5450 case PERL_MAGIC_sig:
5451 vtable = &PL_vtbl_sig;
5453 case PERL_MAGIC_sigelem:
5454 vtable = &PL_vtbl_sigelem;
5456 case PERL_MAGIC_taint:
5457 vtable = &PL_vtbl_taint;
5459 case PERL_MAGIC_uvar:
5460 vtable = &PL_vtbl_uvar;
5462 case PERL_MAGIC_vec:
5463 vtable = &PL_vtbl_vec;
5465 case PERL_MAGIC_arylen_p:
5466 case PERL_MAGIC_rhash:
5467 case PERL_MAGIC_symtab:
5468 case PERL_MAGIC_vstring:
5471 case PERL_MAGIC_utf8:
5472 vtable = &PL_vtbl_utf8;
5474 case PERL_MAGIC_substr:
5475 vtable = &PL_vtbl_substr;
5477 case PERL_MAGIC_defelem:
5478 vtable = &PL_vtbl_defelem;
5480 case PERL_MAGIC_glob:
5481 vtable = &PL_vtbl_glob;
5483 case PERL_MAGIC_arylen:
5484 vtable = &PL_vtbl_arylen;
5486 case PERL_MAGIC_pos:
5487 vtable = &PL_vtbl_pos;
5489 case PERL_MAGIC_backref:
5490 vtable = &PL_vtbl_backref;
5492 case PERL_MAGIC_ext:
5493 /* Reserved for use by extensions not perl internals. */
5494 /* Useful for attaching extension internal data to perl vars. */
5495 /* Note that multiple extensions may clash if magical scalars */
5496 /* etc holding private data from one are passed to another. */
5499 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5502 /* Rest of work is done else where */
5503 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5506 case PERL_MAGIC_taint:
5509 case PERL_MAGIC_ext:
5510 case PERL_MAGIC_dbfile:
5517 =for apidoc sv_unmagic
5519 Removes all magic of type C<type> from an SV.
5525 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5529 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5532 for (mg = *mgp; mg; mg = *mgp) {
5533 if (mg->mg_type == type) {
5534 const MGVTBL* const vtbl = mg->mg_virtual;
5535 *mgp = mg->mg_moremagic;
5536 if (vtbl && vtbl->svt_free)
5537 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5538 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5540 Safefree(mg->mg_ptr);
5541 else if (mg->mg_len == HEf_SVKEY)
5542 SvREFCNT_dec((SV*)mg->mg_ptr);
5543 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5544 Safefree(mg->mg_ptr);
5546 if (mg->mg_flags & MGf_REFCOUNTED)
5547 SvREFCNT_dec(mg->mg_obj);
5551 mgp = &mg->mg_moremagic;
5555 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5562 =for apidoc sv_rvweaken
5564 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5565 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5566 push a back-reference to this RV onto the array of backreferences
5567 associated with that magic.
5573 Perl_sv_rvweaken(pTHX_ SV *sv)
5576 if (!SvOK(sv)) /* let undefs pass */
5579 Perl_croak(aTHX_ "Can't weaken a nonreference");
5580 else if (SvWEAKREF(sv)) {
5581 if (ckWARN(WARN_MISC))
5582 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5586 sv_add_backref(tsv, sv);
5592 /* Give tsv backref magic if it hasn't already got it, then push a
5593 * back-reference to sv onto the array associated with the backref magic.
5597 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5601 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5602 av = (AV*)mg->mg_obj;
5605 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5606 /* av now has a refcnt of 2, which avoids it getting freed
5607 * before us during global cleanup. The extra ref is removed
5608 * by magic_killbackrefs() when tsv is being freed */
5610 if (AvFILLp(av) >= AvMAX(av)) {
5612 SV **svp = AvARRAY(av);
5613 for (i = AvFILLp(av); i >= 0; i--)
5615 svp[i] = sv; /* reuse the slot */
5618 av_extend(av, AvFILLp(av)+1);
5620 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5623 /* delete a back-reference to ourselves from the backref magic associated
5624 * with the SV we point to.
5628 S_sv_del_backref(pTHX_ SV *sv)
5635 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5636 Perl_croak(aTHX_ "panic: del_backref");
5637 av = (AV *)mg->mg_obj;
5639 for (i = AvFILLp(av); i >= 0; i--)
5640 if (svp[i] == sv) svp[i] = Nullsv;
5644 =for apidoc sv_insert
5646 Inserts a string at the specified offset/length within the SV. Similar to
5647 the Perl substr() function.
5653 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5657 register char *midend;
5658 register char *bigend;
5664 Perl_croak(aTHX_ "Can't modify non-existent substring");
5665 SvPV_force(bigstr, curlen);
5666 (void)SvPOK_only_UTF8(bigstr);
5667 if (offset + len > curlen) {
5668 SvGROW(bigstr, offset+len+1);
5669 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5670 SvCUR_set(bigstr, offset+len);
5674 i = littlelen - len;
5675 if (i > 0) { /* string might grow */
5676 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5677 mid = big + offset + len;
5678 midend = bigend = big + SvCUR(bigstr);
5681 while (midend > mid) /* shove everything down */
5682 *--bigend = *--midend;
5683 Move(little,big+offset,littlelen,char);
5684 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5689 Move(little,SvPVX(bigstr)+offset,len,char);
5694 big = SvPVX(bigstr);
5697 bigend = big + SvCUR(bigstr);
5699 if (midend > bigend)
5700 Perl_croak(aTHX_ "panic: sv_insert");
5702 if (mid - big > bigend - midend) { /* faster to shorten from end */
5704 Move(little, mid, littlelen,char);
5707 i = bigend - midend;
5709 Move(midend, mid, i,char);
5713 SvCUR_set(bigstr, mid - big);
5716 else if ((i = mid - big)) { /* faster from front */
5717 midend -= littlelen;
5719 sv_chop(bigstr,midend-i);
5724 Move(little, mid, littlelen,char);
5726 else if (littlelen) {
5727 midend -= littlelen;
5728 sv_chop(bigstr,midend);
5729 Move(little,midend,littlelen,char);
5732 sv_chop(bigstr,midend);
5738 =for apidoc sv_replace
5740 Make the first argument a copy of the second, then delete the original.
5741 The target SV physically takes over ownership of the body of the source SV
5742 and inherits its flags; however, the target keeps any magic it owns,
5743 and any magic in the source is discarded.
5744 Note that this is a rather specialist SV copying operation; most of the
5745 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5751 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5753 const U32 refcnt = SvREFCNT(sv);
5754 SV_CHECK_THINKFIRST_COW_DROP(sv);
5755 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5756 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5757 if (SvMAGICAL(sv)) {
5761 sv_upgrade(nsv, SVt_PVMG);
5762 SvMAGIC_set(nsv, SvMAGIC(sv));
5763 SvFLAGS(nsv) |= SvMAGICAL(sv);
5765 SvMAGIC_set(sv, NULL);
5769 assert(!SvREFCNT(sv));
5770 #ifdef DEBUG_LEAKING_SCALARS
5771 sv->sv_flags = nsv->sv_flags;
5772 sv->sv_any = nsv->sv_any;
5773 sv->sv_refcnt = nsv->sv_refcnt;
5775 StructCopy(nsv,sv,SV);
5777 /* Currently could join these into one piece of pointer arithmetic, but
5778 it would be unclear. */
5779 if(SvTYPE(sv) == SVt_IV)
5781 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5782 else if (SvTYPE(sv) == SVt_RV) {
5783 SvANY(sv) = &sv->sv_u.svu_rv;
5787 #ifdef PERL_COPY_ON_WRITE
5788 if (SvIsCOW_normal(nsv)) {
5789 /* We need to follow the pointers around the loop to make the
5790 previous SV point to sv, rather than nsv. */
5793 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5796 assert(SvPVX(current) == SvPVX(nsv));
5798 /* Make the SV before us point to the SV after us. */
5800 PerlIO_printf(Perl_debug_log, "previous is\n");
5802 PerlIO_printf(Perl_debug_log,
5803 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5804 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5806 SV_COW_NEXT_SV_SET(current, sv);
5809 SvREFCNT(sv) = refcnt;
5810 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5816 =for apidoc sv_clear
5818 Clear an SV: call any destructors, free up any memory used by the body,
5819 and free the body itself. The SV's head is I<not> freed, although
5820 its type is set to all 1's so that it won't inadvertently be assumed
5821 to be live during global destruction etc.
5822 This function should only be called when REFCNT is zero. Most of the time
5823 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5830 Perl_sv_clear(pTHX_ register SV *sv)
5835 assert(SvREFCNT(sv) == 0);
5838 if (PL_defstash) { /* Still have a symbol table? */
5845 stash = SvSTASH(sv);
5846 destructor = StashHANDLER(stash,DESTROY);
5848 SV* tmpref = newRV(sv);
5849 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5851 PUSHSTACKi(PERLSI_DESTROY);
5856 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5862 if(SvREFCNT(tmpref) < 2) {
5863 /* tmpref is not kept alive! */
5865 SvRV_set(tmpref, NULL);
5868 SvREFCNT_dec(tmpref);
5870 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5874 if (PL_in_clean_objs)
5875 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5877 /* DESTROY gave object new lease on life */
5883 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5884 SvOBJECT_off(sv); /* Curse the object. */
5885 if (SvTYPE(sv) != SVt_PVIO)
5886 --PL_sv_objcount; /* XXX Might want something more general */
5889 if (SvTYPE(sv) >= SVt_PVMG) {
5892 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5893 SvREFCNT_dec(SvSTASH(sv));
5896 switch (SvTYPE(sv)) {
5899 IoIFP(sv) != PerlIO_stdin() &&
5900 IoIFP(sv) != PerlIO_stdout() &&
5901 IoIFP(sv) != PerlIO_stderr())
5903 io_close((IO*)sv, FALSE);
5905 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5906 PerlDir_close(IoDIRP(sv));
5907 IoDIRP(sv) = (DIR*)NULL;
5908 Safefree(IoTOP_NAME(sv));
5909 Safefree(IoFMT_NAME(sv));
5910 Safefree(IoBOTTOM_NAME(sv));
5925 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5926 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5927 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5928 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5930 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5931 SvREFCNT_dec(LvTARG(sv));
5935 Safefree(GvNAME(sv));
5936 /* cannot decrease stash refcount yet, as we might recursively delete
5937 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5938 of stash until current sv is completely gone.
5939 -- JohnPC, 27 Mar 1998 */
5940 stash = GvSTASH(sv);
5946 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5948 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5949 /* Don't even bother with turning off the OOK flag. */
5958 SvREFCNT_dec(SvRV(sv));
5960 #ifdef PERL_COPY_ON_WRITE
5961 else if (SvPVX(sv)) {
5963 /* I believe I need to grab the global SV mutex here and
5964 then recheck the COW status. */
5966 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5969 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5970 SvUVX(sv), SV_COW_NEXT_SV(sv));
5971 /* And drop it here. */
5973 } else if (SvLEN(sv)) {
5974 Safefree(SvPVX(sv));
5978 else if (SvPVX(sv) && SvLEN(sv))
5979 Safefree(SvPVX(sv));
5980 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5981 unsharepvn(SvPVX(sv),
5982 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5996 switch (SvTYPE(sv)) {
6010 del_XPVIV(SvANY(sv));
6013 del_XPVNV(SvANY(sv));
6016 del_XPVMG(SvANY(sv));
6019 del_XPVLV(SvANY(sv));
6022 del_XPVAV(SvANY(sv));
6025 del_XPVHV(SvANY(sv));
6028 del_XPVCV(SvANY(sv));
6031 del_XPVGV(SvANY(sv));
6032 /* code duplication for increased performance. */
6033 SvFLAGS(sv) &= SVf_BREAK;
6034 SvFLAGS(sv) |= SVTYPEMASK;
6035 /* decrease refcount of the stash that owns this GV, if any */
6037 SvREFCNT_dec(stash);
6038 return; /* not break, SvFLAGS reset already happened */
6040 del_XPVBM(SvANY(sv));
6043 del_XPVFM(SvANY(sv));
6046 del_XPVIO(SvANY(sv));
6049 SvFLAGS(sv) &= SVf_BREAK;
6050 SvFLAGS(sv) |= SVTYPEMASK;
6054 =for apidoc sv_newref
6056 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6063 Perl_sv_newref(pTHX_ SV *sv)
6073 Decrement an SV's reference count, and if it drops to zero, call
6074 C<sv_clear> to invoke destructors and free up any memory used by
6075 the body; finally, deallocate the SV's head itself.
6076 Normally called via a wrapper macro C<SvREFCNT_dec>.
6082 Perl_sv_free(pTHX_ SV *sv)
6087 if (SvREFCNT(sv) == 0) {
6088 if (SvFLAGS(sv) & SVf_BREAK)
6089 /* this SV's refcnt has been artificially decremented to
6090 * trigger cleanup */
6092 if (PL_in_clean_all) /* All is fair */
6094 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6095 /* make sure SvREFCNT(sv)==0 happens very seldom */
6096 SvREFCNT(sv) = (~(U32)0)/2;
6099 if (ckWARN_d(WARN_INTERNAL))
6100 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6101 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6102 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6105 if (--(SvREFCNT(sv)) > 0)
6107 Perl_sv_free2(aTHX_ sv);
6111 Perl_sv_free2(pTHX_ SV *sv)
6116 if (ckWARN_d(WARN_DEBUGGING))
6117 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6118 "Attempt to free temp prematurely: SV 0x%"UVxf
6119 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6123 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6124 /* make sure SvREFCNT(sv)==0 happens very seldom */
6125 SvREFCNT(sv) = (~(U32)0)/2;
6136 Returns the length of the string in the SV. Handles magic and type
6137 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6143 Perl_sv_len(pTHX_ register SV *sv)
6151 len = mg_length(sv);
6153 (void)SvPV(sv, len);
6158 =for apidoc sv_len_utf8
6160 Returns the number of characters in the string in an SV, counting wide
6161 UTF-8 bytes as a single character. Handles magic and type coercion.
6167 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6168 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6169 * (Note that the mg_len is not the length of the mg_ptr field.)
6174 Perl_sv_len_utf8(pTHX_ register SV *sv)
6180 return mg_length(sv);
6184 const U8 *s = (U8*)SvPV(sv, len);
6185 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6187 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6189 #ifdef PERL_UTF8_CACHE_ASSERT
6190 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6194 ulen = Perl_utf8_length(aTHX_ s, s + len);
6195 if (!mg && !SvREADONLY(sv)) {
6196 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6197 mg = mg_find(sv, PERL_MAGIC_utf8);
6207 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6208 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6209 * between UTF-8 and byte offsets. There are two (substr offset and substr
6210 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6211 * and byte offset) cache positions.
6213 * The mg_len field is used by sv_len_utf8(), see its comments.
6214 * Note that the mg_len is not the length of the mg_ptr field.
6218 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 offsetp, U8 *s, U8 *start)
6222 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6224 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6228 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6230 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6231 (*mgp)->mg_ptr = (char *) *cachep;
6235 (*cachep)[i] = offsetp;
6236 (*cachep)[i+1] = s - start;
6244 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6245 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6246 * between UTF-8 and byte offsets. See also the comments of
6247 * S_utf8_mg_pos_init().
6251 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6255 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6257 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6258 if (*mgp && (*mgp)->mg_ptr) {
6259 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6260 ASSERT_UTF8_CACHE(*cachep);
6261 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6263 else { /* We will skip to the right spot. */
6268 /* The assumption is that going backward is half
6269 * the speed of going forward (that's where the
6270 * 2 * backw in the below comes from). (The real
6271 * figure of course depends on the UTF-8 data.) */
6273 if ((*cachep)[i] > (STRLEN)uoff) {
6275 backw = (*cachep)[i] - (STRLEN)uoff;
6277 if (forw < 2 * backw)
6280 p = start + (*cachep)[i+1];
6282 /* Try this only for the substr offset (i == 0),
6283 * not for the substr length (i == 2). */
6284 else if (i == 0) { /* (*cachep)[i] < uoff */
6285 const STRLEN ulen = sv_len_utf8(sv);
6287 if ((STRLEN)uoff < ulen) {
6288 forw = (STRLEN)uoff - (*cachep)[i];
6289 backw = ulen - (STRLEN)uoff;
6291 if (forw < 2 * backw)
6292 p = start + (*cachep)[i+1];
6297 /* If the string is not long enough for uoff,
6298 * we could extend it, but not at this low a level. */
6302 if (forw < 2 * backw) {
6309 while (UTF8_IS_CONTINUATION(*p))
6314 /* Update the cache. */
6315 (*cachep)[i] = (STRLEN)uoff;
6316 (*cachep)[i+1] = p - start;
6318 /* Drop the stale "length" cache */
6327 if (found) { /* Setup the return values. */
6328 *offsetp = (*cachep)[i+1];
6329 *sp = start + *offsetp;
6332 *offsetp = send - start;
6334 else if (*sp < start) {
6340 #ifdef PERL_UTF8_CACHE_ASSERT
6345 while (n-- && s < send)
6349 assert(*offsetp == s - start);
6350 assert((*cachep)[0] == (STRLEN)uoff);
6351 assert((*cachep)[1] == *offsetp);
6353 ASSERT_UTF8_CACHE(*cachep);
6362 =for apidoc sv_pos_u2b
6364 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6365 the start of the string, to a count of the equivalent number of bytes; if
6366 lenp is non-zero, it does the same to lenp, but this time starting from
6367 the offset, rather than from the start of the string. Handles magic and
6374 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6375 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6376 * byte offsets. See also the comments of S_utf8_mg_pos().
6381 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6392 start = s = (U8*)SvPV(sv, len);
6394 I32 uoffset = *offsetp;
6399 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6401 if (!found && uoffset > 0) {
6402 while (s < send && uoffset--)
6406 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6408 *offsetp = s - start;
6413 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6417 if (!found && *lenp > 0) {
6420 while (s < send && ulen--)
6424 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6428 ASSERT_UTF8_CACHE(cache);
6440 =for apidoc sv_pos_b2u
6442 Converts the value pointed to by offsetp from a count of bytes from the
6443 start of the string, to a count of the equivalent number of UTF-8 chars.
6444 Handles magic and type coercion.
6450 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6451 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6452 * byte offsets. See also the comments of S_utf8_mg_pos().
6457 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6465 s = (U8*)SvPV(sv, len);
6466 if ((I32)len < *offsetp)
6467 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6469 U8* send = s + *offsetp;
6471 STRLEN *cache = NULL;
6475 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6476 mg = mg_find(sv, PERL_MAGIC_utf8);
6477 if (mg && mg->mg_ptr) {
6478 cache = (STRLEN *) mg->mg_ptr;
6479 if (cache[1] == (STRLEN)*offsetp) {
6480 /* An exact match. */
6481 *offsetp = cache[0];
6485 else if (cache[1] < (STRLEN)*offsetp) {
6486 /* We already know part of the way. */
6489 /* Let the below loop do the rest. */
6491 else { /* cache[1] > *offsetp */
6492 /* We already know all of the way, now we may
6493 * be able to walk back. The same assumption
6494 * is made as in S_utf8_mg_pos(), namely that
6495 * walking backward is twice slower than
6496 * walking forward. */
6497 STRLEN forw = *offsetp;
6498 STRLEN backw = cache[1] - *offsetp;
6500 if (!(forw < 2 * backw)) {
6501 U8 *p = s + cache[1];
6508 while (UTF8_IS_CONTINUATION(*p)) {
6516 *offsetp = cache[0];
6518 /* Drop the stale "length" cache */
6526 ASSERT_UTF8_CACHE(cache);
6532 /* Call utf8n_to_uvchr() to validate the sequence
6533 * (unless a simple non-UTF character) */
6534 if (!UTF8_IS_INVARIANT(*s))
6535 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6544 if (!SvREADONLY(sv)) {
6546 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6547 mg = mg_find(sv, PERL_MAGIC_utf8);
6552 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6553 mg->mg_ptr = (char *) cache;
6558 cache[1] = *offsetp;
6559 /* Drop the stale "length" cache */
6572 Returns a boolean indicating whether the strings in the two SVs are
6573 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6574 coerce its args to strings if necessary.
6580 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6588 SV* svrecode = Nullsv;
6595 pv1 = SvPV(sv1, cur1);
6602 pv2 = SvPV(sv2, cur2);
6604 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6605 /* Differing utf8ness.
6606 * Do not UTF8size the comparands as a side-effect. */
6609 svrecode = newSVpvn(pv2, cur2);
6610 sv_recode_to_utf8(svrecode, PL_encoding);
6611 pv2 = SvPV(svrecode, cur2);
6614 svrecode = newSVpvn(pv1, cur1);
6615 sv_recode_to_utf8(svrecode, PL_encoding);
6616 pv1 = SvPV(svrecode, cur1);
6618 /* Now both are in UTF-8. */
6620 SvREFCNT_dec(svrecode);
6625 bool is_utf8 = TRUE;
6628 /* sv1 is the UTF-8 one,
6629 * if is equal it must be downgrade-able */
6630 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6636 /* sv2 is the UTF-8 one,
6637 * if is equal it must be downgrade-able */
6638 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6644 /* Downgrade not possible - cannot be eq */
6652 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6655 SvREFCNT_dec(svrecode);
6666 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6667 string in C<sv1> is less than, equal to, or greater than the string in
6668 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6669 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6675 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6678 const char *pv1, *pv2;
6681 SV *svrecode = Nullsv;
6688 pv1 = SvPV(sv1, cur1);
6695 pv2 = SvPV(sv2, cur2);
6697 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6698 /* Differing utf8ness.
6699 * Do not UTF8size the comparands as a side-effect. */
6702 svrecode = newSVpvn(pv2, cur2);
6703 sv_recode_to_utf8(svrecode, PL_encoding);
6704 pv2 = SvPV(svrecode, cur2);
6707 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6712 svrecode = newSVpvn(pv1, cur1);
6713 sv_recode_to_utf8(svrecode, PL_encoding);
6714 pv1 = SvPV(svrecode, cur1);
6717 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6723 cmp = cur2 ? -1 : 0;
6727 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6730 cmp = retval < 0 ? -1 : 1;
6731 } else if (cur1 == cur2) {
6734 cmp = cur1 < cur2 ? -1 : 1;
6739 SvREFCNT_dec(svrecode);
6748 =for apidoc sv_cmp_locale
6750 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6751 'use bytes' aware, handles get magic, and will coerce its args to strings
6752 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6758 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6760 #ifdef USE_LOCALE_COLLATE
6766 if (PL_collation_standard)
6770 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6772 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6774 if (!pv1 || !len1) {
6785 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6788 return retval < 0 ? -1 : 1;
6791 * When the result of collation is equality, that doesn't mean
6792 * that there are no differences -- some locales exclude some
6793 * characters from consideration. So to avoid false equalities,
6794 * we use the raw string as a tiebreaker.
6800 #endif /* USE_LOCALE_COLLATE */
6802 return sv_cmp(sv1, sv2);
6806 #ifdef USE_LOCALE_COLLATE
6809 =for apidoc sv_collxfrm
6811 Add Collate Transform magic to an SV if it doesn't already have it.
6813 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6814 scalar data of the variable, but transformed to such a format that a normal
6815 memory comparison can be used to compare the data according to the locale
6822 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6826 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6827 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6832 Safefree(mg->mg_ptr);
6834 if ((xf = mem_collxfrm(s, len, &xlen))) {
6835 if (SvREADONLY(sv)) {
6838 return xf + sizeof(PL_collation_ix);
6841 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6842 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6855 if (mg && mg->mg_ptr) {
6857 return mg->mg_ptr + sizeof(PL_collation_ix);
6865 #endif /* USE_LOCALE_COLLATE */
6870 Get a line from the filehandle and store it into the SV, optionally
6871 appending to the currently-stored string.
6877 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6881 register STDCHAR rslast;
6882 register STDCHAR *bp;
6888 if (SvTHINKFIRST(sv))
6889 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6890 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6892 However, perlbench says it's slower, because the existing swipe code
6893 is faster than copy on write.
6894 Swings and roundabouts. */
6895 (void)SvUPGRADE(sv, SVt_PV);
6900 if (PerlIO_isutf8(fp)) {
6902 sv_utf8_upgrade_nomg(sv);
6903 sv_pos_u2b(sv,&append,0);
6905 } else if (SvUTF8(sv)) {
6906 SV *tsv = NEWSV(0,0);
6907 sv_gets(tsv, fp, 0);
6908 sv_utf8_upgrade_nomg(tsv);
6909 SvCUR_set(sv,append);
6912 goto return_string_or_null;
6917 if (PerlIO_isutf8(fp))
6920 if (IN_PERL_COMPILETIME) {
6921 /* we always read code in line mode */
6925 else if (RsSNARF(PL_rs)) {
6926 /* If it is a regular disk file use size from stat() as estimate
6927 of amount we are going to read - may result in malloc-ing
6928 more memory than we realy need if layers bellow reduce
6929 size we read (e.g. CRLF or a gzip layer)
6932 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6933 const Off_t offset = PerlIO_tell(fp);
6934 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6935 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6941 else if (RsRECORD(PL_rs)) {
6945 /* Grab the size of the record we're getting */
6946 recsize = SvIV(SvRV(PL_rs));
6947 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6950 /* VMS wants read instead of fread, because fread doesn't respect */
6951 /* RMS record boundaries. This is not necessarily a good thing to be */
6952 /* doing, but we've got no other real choice - except avoid stdio
6953 as implementation - perhaps write a :vms layer ?
6955 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6957 bytesread = PerlIO_read(fp, buffer, recsize);
6961 SvCUR_set(sv, bytesread += append);
6962 buffer[bytesread] = '\0';
6963 goto return_string_or_null;
6965 else if (RsPARA(PL_rs)) {
6971 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6972 if (PerlIO_isutf8(fp)) {
6973 rsptr = SvPVutf8(PL_rs, rslen);
6976 if (SvUTF8(PL_rs)) {
6977 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6978 Perl_croak(aTHX_ "Wide character in $/");
6981 rsptr = SvPV(PL_rs, rslen);
6985 rslast = rslen ? rsptr[rslen - 1] : '\0';
6987 if (rspara) { /* have to do this both before and after */
6988 do { /* to make sure file boundaries work right */
6991 i = PerlIO_getc(fp);
6995 PerlIO_ungetc(fp,i);
7001 /* See if we know enough about I/O mechanism to cheat it ! */
7003 /* This used to be #ifdef test - it is made run-time test for ease
7004 of abstracting out stdio interface. One call should be cheap
7005 enough here - and may even be a macro allowing compile
7009 if (PerlIO_fast_gets(fp)) {
7012 * We're going to steal some values from the stdio struct
7013 * and put EVERYTHING in the innermost loop into registers.
7015 register STDCHAR *ptr;
7019 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7020 /* An ungetc()d char is handled separately from the regular
7021 * buffer, so we getc() it back out and stuff it in the buffer.
7023 i = PerlIO_getc(fp);
7024 if (i == EOF) return 0;
7025 *(--((*fp)->_ptr)) = (unsigned char) i;
7029 /* Here is some breathtakingly efficient cheating */
7031 cnt = PerlIO_get_cnt(fp); /* get count into register */
7032 /* make sure we have the room */
7033 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7034 /* Not room for all of it
7035 if we are looking for a separator and room for some
7037 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7038 /* just process what we have room for */
7039 shortbuffered = cnt - SvLEN(sv) + append + 1;
7040 cnt -= shortbuffered;
7044 /* remember that cnt can be negative */
7045 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7050 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7051 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7052 DEBUG_P(PerlIO_printf(Perl_debug_log,
7053 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7054 DEBUG_P(PerlIO_printf(Perl_debug_log,
7055 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7056 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7057 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7062 while (cnt > 0) { /* this | eat */
7064 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7065 goto thats_all_folks; /* screams | sed :-) */
7069 Copy(ptr, bp, cnt, char); /* this | eat */
7070 bp += cnt; /* screams | dust */
7071 ptr += cnt; /* louder | sed :-) */
7076 if (shortbuffered) { /* oh well, must extend */
7077 cnt = shortbuffered;
7079 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7081 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7082 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7086 DEBUG_P(PerlIO_printf(Perl_debug_log,
7087 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7088 PTR2UV(ptr),(long)cnt));
7089 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7091 DEBUG_P(PerlIO_printf(Perl_debug_log,
7092 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7093 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7094 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7096 /* This used to call 'filbuf' in stdio form, but as that behaves like
7097 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7098 another abstraction. */
7099 i = PerlIO_getc(fp); /* get more characters */
7101 DEBUG_P(PerlIO_printf(Perl_debug_log,
7102 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7103 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7104 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7106 cnt = PerlIO_get_cnt(fp);
7107 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7108 DEBUG_P(PerlIO_printf(Perl_debug_log,
7109 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7111 if (i == EOF) /* all done for ever? */
7112 goto thats_really_all_folks;
7114 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7116 SvGROW(sv, bpx + cnt + 2);
7117 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7119 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7121 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7122 goto thats_all_folks;
7126 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7127 memNE((char*)bp - rslen, rsptr, rslen))
7128 goto screamer; /* go back to the fray */
7129 thats_really_all_folks:
7131 cnt += shortbuffered;
7132 DEBUG_P(PerlIO_printf(Perl_debug_log,
7133 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7134 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7135 DEBUG_P(PerlIO_printf(Perl_debug_log,
7136 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7137 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7138 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7140 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7141 DEBUG_P(PerlIO_printf(Perl_debug_log,
7142 "Screamer: done, len=%ld, string=|%.*s|\n",
7143 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7147 /*The big, slow, and stupid way. */
7148 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7150 New(0, buf, 8192, STDCHAR);
7158 const register STDCHAR *bpe = buf + sizeof(buf);
7160 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7161 ; /* keep reading */
7165 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7166 /* Accomodate broken VAXC compiler, which applies U8 cast to
7167 * both args of ?: operator, causing EOF to change into 255
7170 i = (U8)buf[cnt - 1];
7176 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7178 sv_catpvn(sv, (char *) buf, cnt);
7180 sv_setpvn(sv, (char *) buf, cnt);
7182 if (i != EOF && /* joy */
7184 SvCUR(sv) < rslen ||
7185 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7189 * If we're reading from a TTY and we get a short read,
7190 * indicating that the user hit his EOF character, we need
7191 * to notice it now, because if we try to read from the TTY
7192 * again, the EOF condition will disappear.
7194 * The comparison of cnt to sizeof(buf) is an optimization
7195 * that prevents unnecessary calls to feof().
7199 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7203 #ifdef USE_HEAP_INSTEAD_OF_STACK
7208 if (rspara) { /* have to do this both before and after */
7209 while (i != EOF) { /* to make sure file boundaries work right */
7210 i = PerlIO_getc(fp);
7212 PerlIO_ungetc(fp,i);
7218 return_string_or_null:
7219 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7225 Auto-increment of the value in the SV, doing string to numeric conversion
7226 if necessary. Handles 'get' magic.
7232 Perl_sv_inc(pTHX_ register SV *sv)
7241 if (SvTHINKFIRST(sv)) {
7243 sv_force_normal_flags(sv, 0);
7244 if (SvREADONLY(sv)) {
7245 if (IN_PERL_RUNTIME)
7246 Perl_croak(aTHX_ PL_no_modify);
7250 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7252 i = PTR2IV(SvRV(sv));
7257 flags = SvFLAGS(sv);
7258 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7259 /* It's (privately or publicly) a float, but not tested as an
7260 integer, so test it to see. */
7262 flags = SvFLAGS(sv);
7264 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7265 /* It's publicly an integer, or privately an integer-not-float */
7266 #ifdef PERL_PRESERVE_IVUV
7270 if (SvUVX(sv) == UV_MAX)
7271 sv_setnv(sv, UV_MAX_P1);
7273 (void)SvIOK_only_UV(sv);
7274 SvUV_set(sv, SvUVX(sv) + 1);
7276 if (SvIVX(sv) == IV_MAX)
7277 sv_setuv(sv, (UV)IV_MAX + 1);
7279 (void)SvIOK_only(sv);
7280 SvIV_set(sv, SvIVX(sv) + 1);
7285 if (flags & SVp_NOK) {
7286 (void)SvNOK_only(sv);
7287 SvNV_set(sv, SvNVX(sv) + 1.0);
7291 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7292 if ((flags & SVTYPEMASK) < SVt_PVIV)
7293 sv_upgrade(sv, SVt_IV);
7294 (void)SvIOK_only(sv);
7299 while (isALPHA(*d)) d++;
7300 while (isDIGIT(*d)) d++;
7302 #ifdef PERL_PRESERVE_IVUV
7303 /* Got to punt this as an integer if needs be, but we don't issue
7304 warnings. Probably ought to make the sv_iv_please() that does
7305 the conversion if possible, and silently. */
7306 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7307 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7308 /* Need to try really hard to see if it's an integer.
7309 9.22337203685478e+18 is an integer.
7310 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7311 so $a="9.22337203685478e+18"; $a+0; $a++
7312 needs to be the same as $a="9.22337203685478e+18"; $a++
7319 /* sv_2iv *should* have made this an NV */
7320 if (flags & SVp_NOK) {
7321 (void)SvNOK_only(sv);
7322 SvNV_set(sv, SvNVX(sv) + 1.0);
7325 /* I don't think we can get here. Maybe I should assert this
7326 And if we do get here I suspect that sv_setnv will croak. NWC
7328 #if defined(USE_LONG_DOUBLE)
7329 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",
7330 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7332 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7333 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7336 #endif /* PERL_PRESERVE_IVUV */
7337 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7341 while (d >= SvPVX(sv)) {
7349 /* MKS: The original code here died if letters weren't consecutive.
7350 * at least it didn't have to worry about non-C locales. The
7351 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7352 * arranged in order (although not consecutively) and that only
7353 * [A-Za-z] are accepted by isALPHA in the C locale.
7355 if (*d != 'z' && *d != 'Z') {
7356 do { ++*d; } while (!isALPHA(*d));
7359 *(d--) -= 'z' - 'a';
7364 *(d--) -= 'z' - 'a' + 1;
7368 /* oh,oh, the number grew */
7369 SvGROW(sv, SvCUR(sv) + 2);
7370 SvCUR_set(sv, SvCUR(sv) + 1);
7371 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7382 Auto-decrement of the value in the SV, doing string to numeric conversion
7383 if necessary. Handles 'get' magic.
7389 Perl_sv_dec(pTHX_ register SV *sv)
7397 if (SvTHINKFIRST(sv)) {
7399 sv_force_normal_flags(sv, 0);
7400 if (SvREADONLY(sv)) {
7401 if (IN_PERL_RUNTIME)
7402 Perl_croak(aTHX_ PL_no_modify);
7406 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7408 i = PTR2IV(SvRV(sv));
7413 /* Unlike sv_inc we don't have to worry about string-never-numbers
7414 and keeping them magic. But we mustn't warn on punting */
7415 flags = SvFLAGS(sv);
7416 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7417 /* It's publicly an integer, or privately an integer-not-float */
7418 #ifdef PERL_PRESERVE_IVUV
7422 if (SvUVX(sv) == 0) {
7423 (void)SvIOK_only(sv);
7427 (void)SvIOK_only_UV(sv);
7428 SvUV_set(sv, SvUVX(sv) + 1);
7431 if (SvIVX(sv) == IV_MIN)
7432 sv_setnv(sv, (NV)IV_MIN - 1.0);
7434 (void)SvIOK_only(sv);
7435 SvIV_set(sv, SvIVX(sv) - 1);
7440 if (flags & SVp_NOK) {
7441 SvNV_set(sv, SvNVX(sv) - 1.0);
7442 (void)SvNOK_only(sv);
7445 if (!(flags & SVp_POK)) {
7446 if ((flags & SVTYPEMASK) < SVt_PVNV)
7447 sv_upgrade(sv, SVt_NV);
7449 (void)SvNOK_only(sv);
7452 #ifdef PERL_PRESERVE_IVUV
7454 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7455 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7456 /* Need to try really hard to see if it's an integer.
7457 9.22337203685478e+18 is an integer.
7458 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7459 so $a="9.22337203685478e+18"; $a+0; $a--
7460 needs to be the same as $a="9.22337203685478e+18"; $a--
7467 /* sv_2iv *should* have made this an NV */
7468 if (flags & SVp_NOK) {
7469 (void)SvNOK_only(sv);
7470 SvNV_set(sv, SvNVX(sv) - 1.0);
7473 /* I don't think we can get here. Maybe I should assert this
7474 And if we do get here I suspect that sv_setnv will croak. NWC
7476 #if defined(USE_LONG_DOUBLE)
7477 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",
7478 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7480 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7481 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7485 #endif /* PERL_PRESERVE_IVUV */
7486 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7490 =for apidoc sv_mortalcopy
7492 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7493 The new SV is marked as mortal. It will be destroyed "soon", either by an
7494 explicit call to FREETMPS, or by an implicit call at places such as
7495 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7500 /* Make a string that will exist for the duration of the expression
7501 * evaluation. Actually, it may have to last longer than that, but
7502 * hopefully we won't free it until it has been assigned to a
7503 * permanent location. */
7506 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7511 sv_setsv(sv,oldstr);
7513 PL_tmps_stack[++PL_tmps_ix] = sv;
7519 =for apidoc sv_newmortal
7521 Creates a new null SV which is mortal. The reference count of the SV is
7522 set to 1. It will be destroyed "soon", either by an explicit call to
7523 FREETMPS, or by an implicit call at places such as statement boundaries.
7524 See also C<sv_mortalcopy> and C<sv_2mortal>.
7530 Perl_sv_newmortal(pTHX)
7535 SvFLAGS(sv) = SVs_TEMP;
7537 PL_tmps_stack[++PL_tmps_ix] = sv;
7542 =for apidoc sv_2mortal
7544 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7545 by an explicit call to FREETMPS, or by an implicit call at places such as
7546 statement boundaries. SvTEMP() is turned on which means that the SV's
7547 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7548 and C<sv_mortalcopy>.
7554 Perl_sv_2mortal(pTHX_ register SV *sv)
7559 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7562 PL_tmps_stack[++PL_tmps_ix] = sv;
7570 Creates a new SV and copies a string into it. The reference count for the
7571 SV is set to 1. If C<len> is zero, Perl will compute the length using
7572 strlen(). For efficiency, consider using C<newSVpvn> instead.
7578 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7583 sv_setpvn(sv,s,len ? len : strlen(s));
7588 =for apidoc newSVpvn
7590 Creates a new SV and copies a string into it. The reference count for the
7591 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7592 string. You are responsible for ensuring that the source string is at least
7593 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7599 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7604 sv_setpvn(sv,s,len);
7609 =for apidoc newSVpvn_share
7611 Creates a new SV with its SvPVX pointing to a shared string in the string
7612 table. If the string does not already exist in the table, it is created
7613 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7614 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7615 otherwise the hash is computed. The idea here is that as the string table
7616 is used for shared hash keys these strings will have SvPVX == HeKEY and
7617 hash lookup will avoid string compare.
7623 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7626 bool is_utf8 = FALSE;
7628 STRLEN tmplen = -len;
7630 /* See the note in hv.c:hv_fetch() --jhi */
7631 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7635 PERL_HASH(hash, src, len);
7637 sv_upgrade(sv, SVt_PVIV);
7638 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7651 #if defined(PERL_IMPLICIT_CONTEXT)
7653 /* pTHX_ magic can't cope with varargs, so this is a no-context
7654 * version of the main function, (which may itself be aliased to us).
7655 * Don't access this version directly.
7659 Perl_newSVpvf_nocontext(const char* pat, ...)
7664 va_start(args, pat);
7665 sv = vnewSVpvf(pat, &args);
7672 =for apidoc newSVpvf
7674 Creates a new SV and initializes it with the string formatted like
7681 Perl_newSVpvf(pTHX_ const char* pat, ...)
7685 va_start(args, pat);
7686 sv = vnewSVpvf(pat, &args);
7691 /* backend for newSVpvf() and newSVpvf_nocontext() */
7694 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7698 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7705 Creates a new SV and copies a floating point value into it.
7706 The reference count for the SV is set to 1.
7712 Perl_newSVnv(pTHX_ NV n)
7724 Creates a new SV and copies an integer into it. The reference count for the
7731 Perl_newSViv(pTHX_ IV i)
7743 Creates a new SV and copies an unsigned integer into it.
7744 The reference count for the SV is set to 1.
7750 Perl_newSVuv(pTHX_ UV u)
7760 =for apidoc newRV_noinc
7762 Creates an RV wrapper for an SV. The reference count for the original
7763 SV is B<not> incremented.
7769 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7774 sv_upgrade(sv, SVt_RV);
7776 SvRV_set(sv, tmpRef);
7781 /* newRV_inc is the official function name to use now.
7782 * newRV_inc is in fact #defined to newRV in sv.h
7786 Perl_newRV(pTHX_ SV *tmpRef)
7788 return newRV_noinc(SvREFCNT_inc(tmpRef));
7794 Creates a new SV which is an exact duplicate of the original SV.
7801 Perl_newSVsv(pTHX_ register SV *old)
7807 if (SvTYPE(old) == SVTYPEMASK) {
7808 if (ckWARN_d(WARN_INTERNAL))
7809 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7813 /* SV_GMAGIC is the default for sv_setv()
7814 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7815 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7816 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7821 =for apidoc sv_reset
7823 Underlying implementation for the C<reset> Perl function.
7824 Note that the perl-level function is vaguely deprecated.
7830 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7838 char todo[PERL_UCHAR_MAX+1];
7843 if (!*s) { /* reset ?? searches */
7844 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7846 PMOP *pm = (PMOP *) mg->mg_obj;
7848 pm->op_pmdynflags &= ~PMdf_USED;
7855 /* reset variables */
7857 if (!HvARRAY(stash))
7860 Zero(todo, 256, char);
7862 i = (unsigned char)*s;
7866 max = (unsigned char)*s++;
7867 for ( ; i <= max; i++) {
7870 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7871 for (entry = HvARRAY(stash)[i];
7873 entry = HeNEXT(entry))
7875 if (!todo[(U8)*HeKEY(entry)])
7877 gv = (GV*)HeVAL(entry);
7879 if (SvTHINKFIRST(sv)) {
7880 if (!SvREADONLY(sv) && SvROK(sv))
7885 if (SvTYPE(sv) >= SVt_PV) {
7887 if (SvPVX(sv) != Nullch)
7894 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7897 #ifdef USE_ENVIRON_ARRAY
7899 # ifdef USE_ITHREADS
7900 && PL_curinterp == aTHX
7904 environ[0] = Nullch;
7907 #endif /* !PERL_MICRO */
7917 Using various gambits, try to get an IO from an SV: the IO slot if its a
7918 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7919 named after the PV if we're a string.
7925 Perl_sv_2io(pTHX_ SV *sv)
7930 switch (SvTYPE(sv)) {
7938 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7942 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7944 return sv_2io(SvRV(sv));
7945 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7951 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7960 Using various gambits, try to get a CV from an SV; in addition, try if
7961 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7967 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7974 return *gvp = Nullgv, Nullcv;
7975 switch (SvTYPE(sv)) {
7994 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7995 tryAMAGICunDEREF(to_cv);
7998 if (SvTYPE(sv) == SVt_PVCV) {
8007 Perl_croak(aTHX_ "Not a subroutine reference");
8012 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8018 if (lref && !GvCVu(gv)) {
8021 tmpsv = NEWSV(704,0);
8022 gv_efullname3(tmpsv, gv, Nullch);
8023 /* XXX this is probably not what they think they're getting.
8024 * It has the same effect as "sub name;", i.e. just a forward
8026 newSUB(start_subparse(FALSE, 0),
8027 newSVOP(OP_CONST, 0, tmpsv),
8032 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8042 Returns true if the SV has a true value by Perl's rules.
8043 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8044 instead use an in-line version.
8050 Perl_sv_true(pTHX_ register SV *sv)
8055 const register XPV* tXpv;
8056 if ((tXpv = (XPV*)SvANY(sv)) &&
8057 (tXpv->xpv_cur > 1 ||
8058 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
8065 return SvIVX(sv) != 0;
8068 return SvNVX(sv) != 0.0;
8070 return sv_2bool(sv);
8078 A private implementation of the C<SvIVx> macro for compilers which can't
8079 cope with complex macro expressions. Always use the macro instead.
8085 Perl_sv_iv(pTHX_ register SV *sv)
8089 return (IV)SvUVX(sv);
8098 A private implementation of the C<SvUVx> macro for compilers which can't
8099 cope with complex macro expressions. Always use the macro instead.
8105 Perl_sv_uv(pTHX_ register SV *sv)
8110 return (UV)SvIVX(sv);
8118 A private implementation of the C<SvNVx> macro for compilers which can't
8119 cope with complex macro expressions. Always use the macro instead.
8125 Perl_sv_nv(pTHX_ register SV *sv)
8132 /* sv_pv() is now a macro using SvPV_nolen();
8133 * this function provided for binary compatibility only
8137 Perl_sv_pv(pTHX_ SV *sv)
8144 return sv_2pv(sv, &n_a);
8150 Use the C<SvPV_nolen> macro instead
8154 A private implementation of the C<SvPV> macro for compilers which can't
8155 cope with complex macro expressions. Always use the macro instead.
8161 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8167 return sv_2pv(sv, lp);
8172 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8178 return sv_2pv_flags(sv, lp, 0);
8181 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8182 * this function provided for binary compatibility only
8186 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8188 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8192 =for apidoc sv_pvn_force
8194 Get a sensible string out of the SV somehow.
8195 A private implementation of the C<SvPV_force> macro for compilers which
8196 can't cope with complex macro expressions. Always use the macro instead.
8198 =for apidoc sv_pvn_force_flags
8200 Get a sensible string out of the SV somehow.
8201 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8202 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8203 implemented in terms of this function.
8204 You normally want to use the various wrapper macros instead: see
8205 C<SvPV_force> and C<SvPV_force_nomg>
8211 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);
8222 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8223 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8227 s = sv_2pv_flags(sv, lp, flags);
8228 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8229 const STRLEN len = *lp;
8233 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8234 SvGROW(sv, len + 1);
8235 Move(s,SvPVX(sv),len,char);
8240 SvPOK_on(sv); /* validate pointer */
8242 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8243 PTR2UV(sv),SvPVX(sv)));
8249 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8250 * this function provided for binary compatibility only
8254 Perl_sv_pvbyte(pTHX_ SV *sv)
8256 sv_utf8_downgrade(sv,0);
8261 =for apidoc sv_pvbyte
8263 Use C<SvPVbyte_nolen> instead.
8265 =for apidoc sv_pvbyten
8267 A private implementation of the C<SvPVbyte> macro for compilers
8268 which can't cope with complex macro expressions. Always use the macro
8275 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8277 sv_utf8_downgrade(sv,0);
8278 return sv_pvn(sv,lp);
8282 =for apidoc sv_pvbyten_force
8284 A private implementation of the C<SvPVbytex_force> macro for compilers
8285 which can't cope with complex macro expressions. Always use the macro
8292 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8294 sv_pvn_force(sv,lp);
8295 sv_utf8_downgrade(sv,0);
8300 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8301 * this function provided for binary compatibility only
8305 Perl_sv_pvutf8(pTHX_ SV *sv)
8307 sv_utf8_upgrade(sv);
8312 =for apidoc sv_pvutf8
8314 Use the C<SvPVutf8_nolen> macro instead
8316 =for apidoc sv_pvutf8n
8318 A private implementation of the C<SvPVutf8> macro for compilers
8319 which can't cope with complex macro expressions. Always use the macro
8326 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8328 sv_utf8_upgrade(sv);
8329 return sv_pvn(sv,lp);
8333 =for apidoc sv_pvutf8n_force
8335 A private implementation of the C<SvPVutf8_force> macro for compilers
8336 which can't cope with complex macro expressions. Always use the macro
8343 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8345 sv_pvn_force(sv,lp);
8346 sv_utf8_upgrade(sv);
8352 =for apidoc sv_reftype
8354 Returns a string describing what the SV is a reference to.
8360 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8362 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8363 inside return suggests a const propagation bug in g++. */
8364 if (ob && SvOBJECT(sv)) {
8365 char *name = HvNAME_get(SvSTASH(sv));
8366 return name ? name : (char *) "__ANON__";
8369 switch (SvTYPE(sv)) {
8386 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8387 /* tied lvalues should appear to be
8388 * scalars for backwards compatitbility */
8389 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8390 ? "SCALAR" : "LVALUE");
8391 case SVt_PVAV: return "ARRAY";
8392 case SVt_PVHV: return "HASH";
8393 case SVt_PVCV: return "CODE";
8394 case SVt_PVGV: return "GLOB";
8395 case SVt_PVFM: return "FORMAT";
8396 case SVt_PVIO: return "IO";
8397 default: return "UNKNOWN";
8403 =for apidoc sv_isobject
8405 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8406 object. If the SV is not an RV, or if the object is not blessed, then this
8413 Perl_sv_isobject(pTHX_ SV *sv)
8430 Returns a boolean indicating whether the SV is blessed into the specified
8431 class. This does not check for subtypes; use C<sv_derived_from> to verify
8432 an inheritance relationship.
8438 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8450 hvname = HvNAME_get(SvSTASH(sv));
8454 return strEQ(hvname, name);
8460 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8461 it will be upgraded to one. If C<classname> is non-null then the new SV will
8462 be blessed in the specified package. The new SV is returned and its
8463 reference count is 1.
8469 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8475 SV_CHECK_THINKFIRST_COW_DROP(rv);
8478 if (SvTYPE(rv) >= SVt_PVMG) {
8479 const U32 refcnt = SvREFCNT(rv);
8483 SvREFCNT(rv) = refcnt;
8486 if (SvTYPE(rv) < SVt_RV)
8487 sv_upgrade(rv, SVt_RV);
8488 else if (SvTYPE(rv) > SVt_RV) {
8499 HV* stash = gv_stashpv(classname, TRUE);
8500 (void)sv_bless(rv, stash);
8506 =for apidoc sv_setref_pv
8508 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8509 argument will be upgraded to an RV. That RV will be modified to point to
8510 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8511 into the SV. The C<classname> argument indicates the package for the
8512 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8513 will have a reference count of 1, and the RV will be returned.
8515 Do not use with other Perl types such as HV, AV, SV, CV, because those
8516 objects will become corrupted by the pointer copy process.
8518 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8524 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8527 sv_setsv(rv, &PL_sv_undef);
8531 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8536 =for apidoc sv_setref_iv
8538 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8539 argument will be upgraded to an RV. That RV will be modified to point to
8540 the new SV. The C<classname> argument indicates the package for the
8541 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8542 will have a reference count of 1, and the RV will be returned.
8548 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8550 sv_setiv(newSVrv(rv,classname), iv);
8555 =for apidoc sv_setref_uv
8557 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8558 argument will be upgraded to an RV. That RV will be modified to point to
8559 the new SV. The C<classname> argument indicates the package for the
8560 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8561 will have a reference count of 1, and the RV will be returned.
8567 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8569 sv_setuv(newSVrv(rv,classname), uv);
8574 =for apidoc sv_setref_nv
8576 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8577 argument will be upgraded to an RV. That RV will be modified to point to
8578 the new SV. The C<classname> argument indicates the package for the
8579 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8580 will have a reference count of 1, and the RV will be returned.
8586 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8588 sv_setnv(newSVrv(rv,classname), nv);
8593 =for apidoc sv_setref_pvn
8595 Copies a string into a new SV, optionally blessing the SV. The length of the
8596 string must be specified with C<n>. The C<rv> argument will be upgraded to
8597 an RV. That RV will be modified to point to the new SV. The C<classname>
8598 argument indicates the package for the blessing. Set C<classname> to
8599 C<Nullch> to avoid the blessing. The new SV will have a reference count
8600 of 1, and the RV will be returned.
8602 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8608 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8610 sv_setpvn(newSVrv(rv,classname), pv, n);
8615 =for apidoc sv_bless
8617 Blesses an SV into a specified package. The SV must be an RV. The package
8618 must be designated by its stash (see C<gv_stashpv()>). The reference count
8619 of the SV is unaffected.
8625 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8629 Perl_croak(aTHX_ "Can't bless non-reference value");
8631 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8632 if (SvREADONLY(tmpRef))
8633 Perl_croak(aTHX_ PL_no_modify);
8634 if (SvOBJECT(tmpRef)) {
8635 if (SvTYPE(tmpRef) != SVt_PVIO)
8637 SvREFCNT_dec(SvSTASH(tmpRef));
8640 SvOBJECT_on(tmpRef);
8641 if (SvTYPE(tmpRef) != SVt_PVIO)
8643 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8644 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8651 if(SvSMAGICAL(tmpRef))
8652 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8660 /* Downgrades a PVGV to a PVMG.
8664 S_sv_unglob(pTHX_ SV *sv)
8668 assert(SvTYPE(sv) == SVt_PVGV);
8673 SvREFCNT_dec(GvSTASH(sv));
8674 GvSTASH(sv) = Nullhv;
8676 sv_unmagic(sv, PERL_MAGIC_glob);
8677 Safefree(GvNAME(sv));
8680 /* need to keep SvANY(sv) in the right arena */
8681 xpvmg = new_XPVMG();
8682 StructCopy(SvANY(sv), xpvmg, XPVMG);
8683 del_XPVGV(SvANY(sv));
8686 SvFLAGS(sv) &= ~SVTYPEMASK;
8687 SvFLAGS(sv) |= SVt_PVMG;
8691 =for apidoc sv_unref_flags
8693 Unsets the RV status of the SV, and decrements the reference count of
8694 whatever was being referenced by the RV. This can almost be thought of
8695 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8696 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8697 (otherwise the decrementing is conditional on the reference count being
8698 different from one or the reference being a readonly SV).
8705 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8709 if (SvWEAKREF(sv)) {
8717 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8718 assigned to as BEGIN {$a = \"Foo"} will fail. */
8719 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8721 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8722 sv_2mortal(rv); /* Schedule for freeing later */
8726 =for apidoc sv_unref
8728 Unsets the RV status of the SV, and decrements the reference count of
8729 whatever was being referenced by the RV. This can almost be thought of
8730 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8731 being zero. See C<SvROK_off>.
8737 Perl_sv_unref(pTHX_ SV *sv)
8739 sv_unref_flags(sv, 0);
8743 =for apidoc sv_taint
8745 Taint an SV. Use C<SvTAINTED_on> instead.
8750 Perl_sv_taint(pTHX_ SV *sv)
8752 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8756 =for apidoc sv_untaint
8758 Untaint an SV. Use C<SvTAINTED_off> instead.
8763 Perl_sv_untaint(pTHX_ SV *sv)
8765 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8766 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8773 =for apidoc sv_tainted
8775 Test an SV for taintedness. Use C<SvTAINTED> instead.
8780 Perl_sv_tainted(pTHX_ SV *sv)
8782 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8783 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8784 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8791 =for apidoc sv_setpviv
8793 Copies an integer into the given SV, also updating its string value.
8794 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8800 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8802 char buf[TYPE_CHARS(UV)];
8804 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8806 sv_setpvn(sv, ptr, ebuf - ptr);
8810 =for apidoc sv_setpviv_mg
8812 Like C<sv_setpviv>, but also handles 'set' magic.
8818 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8820 char buf[TYPE_CHARS(UV)];
8822 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8824 sv_setpvn(sv, ptr, ebuf - ptr);
8828 #if defined(PERL_IMPLICIT_CONTEXT)
8830 /* pTHX_ magic can't cope with varargs, so this is a no-context
8831 * version of the main function, (which may itself be aliased to us).
8832 * Don't access this version directly.
8836 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8840 va_start(args, pat);
8841 sv_vsetpvf(sv, pat, &args);
8845 /* pTHX_ magic can't cope with varargs, so this is a no-context
8846 * version of the main function, (which may itself be aliased to us).
8847 * Don't access this version directly.
8851 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8855 va_start(args, pat);
8856 sv_vsetpvf_mg(sv, pat, &args);
8862 =for apidoc sv_setpvf
8864 Works like C<sv_catpvf> but copies the text into the SV instead of
8865 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8871 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8874 va_start(args, pat);
8875 sv_vsetpvf(sv, pat, &args);
8880 =for apidoc sv_vsetpvf
8882 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8883 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8885 Usually used via its frontend C<sv_setpvf>.
8891 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8893 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8897 =for apidoc sv_setpvf_mg
8899 Like C<sv_setpvf>, but also handles 'set' magic.
8905 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8908 va_start(args, pat);
8909 sv_vsetpvf_mg(sv, pat, &args);
8914 =for apidoc sv_vsetpvf_mg
8916 Like C<sv_vsetpvf>, but also handles 'set' magic.
8918 Usually used via its frontend C<sv_setpvf_mg>.
8924 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8926 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8930 #if defined(PERL_IMPLICIT_CONTEXT)
8932 /* pTHX_ magic can't cope with varargs, so this is a no-context
8933 * version of the main function, (which may itself be aliased to us).
8934 * Don't access this version directly.
8938 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8942 va_start(args, pat);
8943 sv_vcatpvf(sv, pat, &args);
8947 /* pTHX_ magic can't cope with varargs, so this is a no-context
8948 * version of the main function, (which may itself be aliased to us).
8949 * Don't access this version directly.
8953 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8957 va_start(args, pat);
8958 sv_vcatpvf_mg(sv, pat, &args);
8964 =for apidoc sv_catpvf
8966 Processes its arguments like C<sprintf> and appends the formatted
8967 output to an SV. If the appended data contains "wide" characters
8968 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8969 and characters >255 formatted with %c), the original SV might get
8970 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8971 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8972 valid UTF-8; if the original SV was bytes, the pattern should be too.
8977 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8980 va_start(args, pat);
8981 sv_vcatpvf(sv, pat, &args);
8986 =for apidoc sv_vcatpvf
8988 Processes its arguments like C<vsprintf> and appends the formatted output
8989 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8991 Usually used via its frontend C<sv_catpvf>.
8997 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8999 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9003 =for apidoc sv_catpvf_mg
9005 Like C<sv_catpvf>, but also handles 'set' magic.
9011 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9014 va_start(args, pat);
9015 sv_vcatpvf_mg(sv, pat, &args);
9020 =for apidoc sv_vcatpvf_mg
9022 Like C<sv_vcatpvf>, but also handles 'set' magic.
9024 Usually used via its frontend C<sv_catpvf_mg>.
9030 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9032 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9037 =for apidoc sv_vsetpvfn
9039 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9042 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9048 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9050 sv_setpvn(sv, "", 0);
9051 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9054 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9057 S_expect_number(pTHX_ char** pattern)
9060 switch (**pattern) {
9061 case '1': case '2': case '3':
9062 case '4': case '5': case '6':
9063 case '7': case '8': case '9':
9064 while (isDIGIT(**pattern))
9065 var = var * 10 + (*(*pattern)++ - '0');
9069 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9072 F0convert(NV nv, char *endbuf, STRLEN *len)
9074 const int neg = nv < 0;
9083 if (uv & 1 && uv == nv)
9084 uv--; /* Round to even */
9086 const unsigned dig = uv % 10;
9099 =for apidoc sv_vcatpvfn
9101 Processes its arguments like C<vsprintf> and appends the formatted output
9102 to an SV. Uses an array of SVs if the C style variable argument list is
9103 missing (NULL). When running with taint checks enabled, indicates via
9104 C<maybe_tainted> if results are untrustworthy (often due to the use of
9107 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9112 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9115 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9122 static const char nullstr[] = "(null)";
9124 bool has_utf8; /* has the result utf8? */
9125 bool pat_utf8; /* the pattern is in utf8? */
9127 /* Times 4: a decimal digit takes more than 3 binary digits.
9128 * NV_DIG: mantissa takes than many decimal digits.
9129 * Plus 32: Playing safe. */
9130 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9131 /* large enough for "%#.#f" --chip */
9132 /* what about long double NVs? --jhi */
9134 has_utf8 = pat_utf8 = DO_UTF8(sv);
9136 /* no matter what, this is a string now */
9137 (void)SvPV_force(sv, origlen);
9139 /* special-case "", "%s", and "%-p" (SVf) */
9142 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
9144 const char *s = va_arg(*args, char*);
9145 sv_catpv(sv, s ? s : nullstr);
9147 else if (svix < svmax) {
9148 sv_catsv(sv, *svargs);
9149 if (DO_UTF8(*svargs))
9154 if (patlen == 3 && pat[0] == '%' &&
9155 pat[1] == '-' && pat[2] == 'p') {
9157 argsv = va_arg(*args, SV*);
9158 sv_catsv(sv, argsv);
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);
9543 if (has_precis && elen > precis)
9550 if (left && args) { /* SVf */
9559 argsv = va_arg(*args, SV*);
9560 eptr = SvPVx(argsv, elen);
9565 if (alt || vectorize)
9567 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9585 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9594 esignbuf[esignlen++] = plus;
9598 case 'h': iv = (short)va_arg(*args, int); break;
9599 case 'l': iv = va_arg(*args, long); break;
9600 case 'V': iv = va_arg(*args, IV); break;
9601 default: iv = va_arg(*args, int); break;
9603 case 'q': iv = va_arg(*args, Quad_t); break;
9608 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9610 case 'h': iv = (short)tiv; break;
9611 case 'l': iv = (long)tiv; break;
9613 default: iv = tiv; break;
9615 case 'q': iv = (Quad_t)tiv; break;
9619 if ( !vectorize ) /* we already set uv above */
9624 esignbuf[esignlen++] = plus;
9628 esignbuf[esignlen++] = '-';
9671 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9682 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9683 case 'l': uv = va_arg(*args, unsigned long); break;
9684 case 'V': uv = va_arg(*args, UV); break;
9685 default: uv = va_arg(*args, unsigned); break;
9687 case 'q': uv = va_arg(*args, Uquad_t); break;
9692 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9694 case 'h': uv = (unsigned short)tuv; break;
9695 case 'l': uv = (unsigned long)tuv; break;
9697 default: uv = tuv; break;
9699 case 'q': uv = (Uquad_t)tuv; break;
9705 eptr = ebuf + sizeof ebuf;
9711 p = (char*)((c == 'X')
9712 ? "0123456789ABCDEF" : "0123456789abcdef");
9718 esignbuf[esignlen++] = '0';
9719 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9725 *--eptr = '0' + dig;
9727 if (alt && *eptr != '0')
9733 *--eptr = '0' + dig;
9736 esignbuf[esignlen++] = '0';
9737 esignbuf[esignlen++] = 'b';
9740 default: /* it had better be ten or less */
9743 *--eptr = '0' + dig;
9744 } while (uv /= base);
9747 elen = (ebuf + sizeof ebuf) - eptr;
9750 zeros = precis - elen;
9751 else if (precis == 0 && elen == 1 && *eptr == '0')
9756 /* FLOATING POINT */
9759 c = 'f'; /* maybe %F isn't supported here */
9765 /* This is evil, but floating point is even more evil */
9767 /* for SV-style calling, we can only get NV
9768 for C-style calling, we assume %f is double;
9769 for simplicity we allow any of %Lf, %llf, %qf for long double
9773 #if defined(USE_LONG_DOUBLE)
9777 /* [perl #20339] - we should accept and ignore %lf rather than die */
9781 #if defined(USE_LONG_DOUBLE)
9782 intsize = args ? 0 : 'q';
9786 #if defined(HAS_LONG_DOUBLE)
9795 /* now we need (long double) if intsize == 'q', else (double) */
9796 nv = (args && !vectorize) ?
9797 #if LONG_DOUBLESIZE > DOUBLESIZE
9799 va_arg(*args, long double) :
9800 va_arg(*args, double)
9802 va_arg(*args, double)
9808 if (c != 'e' && c != 'E') {
9810 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9811 will cast our (long double) to (double) */
9812 (void)Perl_frexp(nv, &i);
9813 if (i == PERL_INT_MIN)
9814 Perl_die(aTHX_ "panic: frexp");
9816 need = BIT_DIGITS(i);
9818 need += has_precis ? precis : 6; /* known default */
9823 #ifdef HAS_LDBL_SPRINTF_BUG
9824 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9825 with sfio - Allen <allens@cpan.org> */
9828 # define MY_DBL_MAX DBL_MAX
9829 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9830 # if DOUBLESIZE >= 8
9831 # define MY_DBL_MAX 1.7976931348623157E+308L
9833 # define MY_DBL_MAX 3.40282347E+38L
9837 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9838 # define MY_DBL_MAX_BUG 1L
9840 # define MY_DBL_MAX_BUG MY_DBL_MAX
9844 # define MY_DBL_MIN DBL_MIN
9845 # else /* XXX guessing! -Allen */
9846 # if DOUBLESIZE >= 8
9847 # define MY_DBL_MIN 2.2250738585072014E-308L
9849 # define MY_DBL_MIN 1.17549435E-38L
9853 if ((intsize == 'q') && (c == 'f') &&
9854 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9856 /* it's going to be short enough that
9857 * long double precision is not needed */
9859 if ((nv <= 0L) && (nv >= -0L))
9860 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9862 /* would use Perl_fp_class as a double-check but not
9863 * functional on IRIX - see perl.h comments */
9865 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9866 /* It's within the range that a double can represent */
9867 #if defined(DBL_MAX) && !defined(DBL_MIN)
9868 if ((nv >= ((long double)1/DBL_MAX)) ||
9869 (nv <= (-(long double)1/DBL_MAX)))
9871 fix_ldbl_sprintf_bug = TRUE;
9874 if (fix_ldbl_sprintf_bug == TRUE) {
9884 # undef MY_DBL_MAX_BUG
9887 #endif /* HAS_LDBL_SPRINTF_BUG */
9889 need += 20; /* fudge factor */
9890 if (PL_efloatsize < need) {
9891 Safefree(PL_efloatbuf);
9892 PL_efloatsize = need + 20; /* more fudge */
9893 New(906, PL_efloatbuf, PL_efloatsize, char);
9894 PL_efloatbuf[0] = '\0';
9897 if ( !(width || left || plus || alt) && fill != '0'
9898 && has_precis && intsize != 'q' ) { /* Shortcuts */
9899 /* See earlier comment about buggy Gconvert when digits,
9901 if ( c == 'g' && precis) {
9902 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9903 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9904 goto float_converted;
9905 } else if ( c == 'f' && !precis) {
9906 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9910 eptr = ebuf + sizeof ebuf;
9913 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9914 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9915 if (intsize == 'q') {
9916 /* Copy the one or more characters in a long double
9917 * format before the 'base' ([efgEFG]) character to
9918 * the format string. */
9919 static char const prifldbl[] = PERL_PRIfldbl;
9920 char const *p = prifldbl + sizeof(prifldbl) - 3;
9921 while (p >= prifldbl) { *--eptr = *p--; }
9926 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9931 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9943 /* No taint. Otherwise we are in the strange situation
9944 * where printf() taints but print($float) doesn't.
9946 #if defined(HAS_LONG_DOUBLE)
9948 (void)sprintf(PL_efloatbuf, eptr, nv);
9950 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9952 (void)sprintf(PL_efloatbuf, eptr, nv);
9955 eptr = PL_efloatbuf;
9956 elen = strlen(PL_efloatbuf);
9962 i = SvCUR(sv) - origlen;
9963 if (args && !vectorize) {
9965 case 'h': *(va_arg(*args, short*)) = i; break;
9966 default: *(va_arg(*args, int*)) = i; break;
9967 case 'l': *(va_arg(*args, long*)) = i; break;
9968 case 'V': *(va_arg(*args, IV*)) = i; break;
9970 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9975 sv_setuv_mg(argsv, (UV)i);
9977 continue; /* not "break" */
9983 if (!args && ckWARN(WARN_PRINTF) &&
9984 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9985 SV *msg = sv_newmortal();
9986 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9987 (PL_op->op_type == OP_PRTF) ? "" : "s");
9990 Perl_sv_catpvf(aTHX_ msg,
9991 "\"%%%c\"", c & 0xFF);
9993 Perl_sv_catpvf(aTHX_ msg,
9994 "\"%%\\%03"UVof"\"",
9997 sv_catpv(msg, "end of string");
9998 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10001 /* output mangled stuff ... */
10007 /* ... right here, because formatting flags should not apply */
10008 SvGROW(sv, SvCUR(sv) + elen + 1);
10010 Copy(eptr, p, elen, char);
10013 SvCUR_set(sv, p - SvPVX(sv));
10015 continue; /* not "break" */
10018 /* calculate width before utf8_upgrade changes it */
10019 have = esignlen + zeros + elen;
10021 if (is_utf8 != has_utf8) {
10024 sv_utf8_upgrade(sv);
10027 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10028 sv_utf8_upgrade(nsv);
10032 SvGROW(sv, SvCUR(sv) + elen + 1);
10037 need = (have > width ? have : width);
10040 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10042 if (esignlen && fill == '0') {
10043 for (i = 0; i < (int)esignlen; i++)
10044 *p++ = esignbuf[i];
10046 if (gap && !left) {
10047 memset(p, fill, gap);
10050 if (esignlen && fill != '0') {
10051 for (i = 0; i < (int)esignlen; i++)
10052 *p++ = esignbuf[i];
10055 for (i = zeros; i; i--)
10059 Copy(eptr, p, elen, char);
10063 memset(p, ' ', gap);
10068 Copy(dotstr, p, dotstrlen, char);
10072 vectorize = FALSE; /* done iterating over vecstr */
10079 SvCUR_set(sv, p - SvPVX(sv));
10087 /* =========================================================================
10089 =head1 Cloning an interpreter
10091 All the macros and functions in this section are for the private use of
10092 the main function, perl_clone().
10094 The foo_dup() functions make an exact copy of an existing foo thinngy.
10095 During the course of a cloning, a hash table is used to map old addresses
10096 to new addresses. The table is created and manipulated with the
10097 ptr_table_* functions.
10101 ============================================================================*/
10104 #if defined(USE_ITHREADS)
10106 #ifndef GpREFCNT_inc
10107 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10111 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10112 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10113 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10114 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10115 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10116 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10117 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10118 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10119 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10120 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10121 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10122 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10123 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10126 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10127 regcomp.c. AMS 20010712 */
10130 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10135 struct reg_substr_datum *s;
10138 return (REGEXP *)NULL;
10140 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10143 len = r->offsets[0];
10144 npar = r->nparens+1;
10146 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10147 Copy(r->program, ret->program, len+1, regnode);
10149 New(0, ret->startp, npar, I32);
10150 Copy(r->startp, ret->startp, npar, I32);
10151 New(0, ret->endp, npar, I32);
10152 Copy(r->startp, ret->startp, npar, I32);
10154 New(0, ret->substrs, 1, struct reg_substr_data);
10155 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10156 s->min_offset = r->substrs->data[i].min_offset;
10157 s->max_offset = r->substrs->data[i].max_offset;
10158 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10159 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10162 ret->regstclass = NULL;
10164 struct reg_data *d;
10165 const int count = r->data->count;
10167 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10168 char, struct reg_data);
10169 New(0, d->what, count, U8);
10172 for (i = 0; i < count; i++) {
10173 d->what[i] = r->data->what[i];
10174 switch (d->what[i]) {
10175 /* legal options are one of: sfpont
10176 see also regcomp.h and pregfree() */
10178 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10181 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10184 /* This is cheating. */
10185 New(0, d->data[i], 1, struct regnode_charclass_class);
10186 StructCopy(r->data->data[i], d->data[i],
10187 struct regnode_charclass_class);
10188 ret->regstclass = (regnode*)d->data[i];
10191 /* Compiled op trees are readonly, and can thus be
10192 shared without duplication. */
10194 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10198 d->data[i] = r->data->data[i];
10201 d->data[i] = r->data->data[i];
10203 ((reg_trie_data*)d->data[i])->refcount++;
10207 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10216 New(0, ret->offsets, 2*len+1, U32);
10217 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10219 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10220 ret->refcnt = r->refcnt;
10221 ret->minlen = r->minlen;
10222 ret->prelen = r->prelen;
10223 ret->nparens = r->nparens;
10224 ret->lastparen = r->lastparen;
10225 ret->lastcloseparen = r->lastcloseparen;
10226 ret->reganch = r->reganch;
10228 ret->sublen = r->sublen;
10230 if (RX_MATCH_COPIED(ret))
10231 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10233 ret->subbeg = Nullch;
10234 #ifdef PERL_COPY_ON_WRITE
10235 ret->saved_copy = Nullsv;
10238 ptr_table_store(PL_ptr_table, r, ret);
10242 /* duplicate a file handle */
10245 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10251 return (PerlIO*)NULL;
10253 /* look for it in the table first */
10254 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10258 /* create anew and remember what it is */
10259 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10260 ptr_table_store(PL_ptr_table, fp, ret);
10264 /* duplicate a directory handle */
10267 Perl_dirp_dup(pTHX_ DIR *dp)
10275 /* duplicate a typeglob */
10278 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10283 /* look for it in the table first */
10284 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10288 /* create anew and remember what it is */
10289 Newz(0, ret, 1, GP);
10290 ptr_table_store(PL_ptr_table, gp, ret);
10293 ret->gp_refcnt = 0; /* must be before any other dups! */
10294 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10295 ret->gp_io = io_dup_inc(gp->gp_io, param);
10296 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10297 ret->gp_av = av_dup_inc(gp->gp_av, param);
10298 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10299 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10300 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10301 ret->gp_cvgen = gp->gp_cvgen;
10302 ret->gp_flags = gp->gp_flags;
10303 ret->gp_line = gp->gp_line;
10304 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10308 /* duplicate a chain of magic */
10311 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10313 MAGIC *mgprev = (MAGIC*)NULL;
10316 return (MAGIC*)NULL;
10317 /* look for it in the table first */
10318 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10322 for (; mg; mg = mg->mg_moremagic) {
10324 Newz(0, nmg, 1, MAGIC);
10326 mgprev->mg_moremagic = nmg;
10329 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10330 nmg->mg_private = mg->mg_private;
10331 nmg->mg_type = mg->mg_type;
10332 nmg->mg_flags = mg->mg_flags;
10333 if (mg->mg_type == PERL_MAGIC_qr) {
10334 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10336 else if(mg->mg_type == PERL_MAGIC_backref) {
10337 const AV * const av = (AV*) mg->mg_obj;
10340 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10342 for (i = AvFILLp(av); i >= 0; i--) {
10343 if (!svp[i]) continue;
10344 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10347 else if (mg->mg_type == PERL_MAGIC_symtab) {
10348 nmg->mg_obj = mg->mg_obj;
10351 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10352 ? sv_dup_inc(mg->mg_obj, param)
10353 : sv_dup(mg->mg_obj, param);
10355 nmg->mg_len = mg->mg_len;
10356 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10357 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10358 if (mg->mg_len > 0) {
10359 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10360 if (mg->mg_type == PERL_MAGIC_overload_table &&
10361 AMT_AMAGIC((AMT*)mg->mg_ptr))
10363 AMT *amtp = (AMT*)mg->mg_ptr;
10364 AMT *namtp = (AMT*)nmg->mg_ptr;
10366 for (i = 1; i < NofAMmeth; i++) {
10367 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10371 else if (mg->mg_len == HEf_SVKEY)
10372 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10374 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10375 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10382 /* create a new pointer-mapping table */
10385 Perl_ptr_table_new(pTHX)
10388 Newz(0, tbl, 1, PTR_TBL_t);
10389 tbl->tbl_max = 511;
10390 tbl->tbl_items = 0;
10391 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10396 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10398 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10406 struct ptr_tbl_ent* pte;
10407 struct ptr_tbl_ent* pteend;
10408 New(0, pte, PERL_ARENA_SIZE/sizeof(struct ptr_tbl_ent), struct ptr_tbl_ent);
10409 pte->next = PL_pte_arenaroot;
10410 PL_pte_arenaroot = pte;
10412 pteend = &pte[PERL_ARENA_SIZE / sizeof(struct ptr_tbl_ent) - 1];
10413 PL_pte_root = ++pte;
10414 while (pte < pteend) {
10415 pte->next = pte + 1;
10421 STATIC struct ptr_tbl_ent*
10424 struct ptr_tbl_ent* pte;
10428 PL_pte_root = pte->next;
10433 S_del_pte(pTHX_ struct ptr_tbl_ent*p)
10435 p->next = PL_pte_root;
10439 /* map an existing pointer using a table */
10442 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10444 PTR_TBL_ENT_t *tblent;
10445 const UV hash = PTR_TABLE_HASH(sv);
10447 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10448 for (; tblent; tblent = tblent->next) {
10449 if (tblent->oldval == sv)
10450 return tblent->newval;
10452 return (void*)NULL;
10455 /* add a new entry to a pointer-mapping table */
10458 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10460 PTR_TBL_ENT_t *tblent, **otblent;
10461 /* XXX this may be pessimal on platforms where pointers aren't good
10462 * hash values e.g. if they grow faster in the most significant
10464 const UV hash = PTR_TABLE_HASH(oldv);
10468 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10469 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10470 if (tblent->oldval == oldv) {
10471 tblent->newval = newv;
10475 tblent = S_new_pte(aTHX);
10476 tblent->oldval = oldv;
10477 tblent->newval = newv;
10478 tblent->next = *otblent;
10481 if (!empty && tbl->tbl_items > tbl->tbl_max)
10482 ptr_table_split(tbl);
10485 /* double the hash bucket size of an existing ptr table */
10488 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10490 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10491 const UV oldsize = tbl->tbl_max + 1;
10492 UV newsize = oldsize * 2;
10495 Renew(ary, newsize, PTR_TBL_ENT_t*);
10496 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10497 tbl->tbl_max = --newsize;
10498 tbl->tbl_ary = ary;
10499 for (i=0; i < oldsize; i++, ary++) {
10500 PTR_TBL_ENT_t **curentp, **entp, *ent;
10503 curentp = ary + oldsize;
10504 for (entp = ary, ent = *ary; ent; ent = *entp) {
10505 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10507 ent->next = *curentp;
10517 /* remove all the entries from a ptr table */
10520 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10522 register PTR_TBL_ENT_t **array;
10523 register PTR_TBL_ENT_t *entry;
10527 if (!tbl || !tbl->tbl_items) {
10531 array = tbl->tbl_ary;
10533 max = tbl->tbl_max;
10537 PTR_TBL_ENT_t *oentry = entry;
10538 entry = entry->next;
10539 S_del_pte(aTHX_ oentry);
10542 if (++riter > max) {
10545 entry = array[riter];
10549 tbl->tbl_items = 0;
10552 /* clear and free a ptr table */
10555 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10560 ptr_table_clear(tbl);
10561 Safefree(tbl->tbl_ary);
10565 /* attempt to make everything in the typeglob readonly */
10568 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10570 GV *gv = (GV*)sstr;
10571 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10573 if (GvIO(gv) || GvFORM(gv)) {
10574 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10576 else if (!GvCV(gv)) {
10577 GvCV(gv) = (CV*)sv;
10580 /* CvPADLISTs cannot be shared */
10581 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10586 if (!GvUNIQUE(gv)) {
10588 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10589 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10595 * write attempts will die with
10596 * "Modification of a read-only value attempted"
10602 SvREADONLY_on(GvSV(gv));
10606 GvAV(gv) = (AV*)sv;
10609 SvREADONLY_on(GvAV(gv));
10613 GvHV(gv) = (HV*)sv;
10616 SvREADONLY_on(GvHV(gv));
10619 return sstr; /* he_dup() will SvREFCNT_inc() */
10622 /* duplicate an SV of any type (including AV, HV etc) */
10625 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10628 SvRV_set(dstr, SvWEAKREF(sstr)
10629 ? sv_dup(SvRV(sstr), param)
10630 : sv_dup_inc(SvRV(sstr), param));
10633 else if (SvPVX(sstr)) {
10634 /* Has something there */
10636 /* Normal PV - clone whole allocated space */
10637 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10638 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10639 /* Not that normal - actually sstr is copy on write.
10640 But we are a true, independant SV, so: */
10641 SvREADONLY_off(dstr);
10646 /* Special case - not normally malloced for some reason */
10647 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10648 /* A "shared" PV - clone it as unshared string */
10649 if(SvPADTMP(sstr)) {
10650 /* However, some of them live in the pad
10651 and they should not have these flags
10654 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10656 SvUV_set(dstr, SvUVX(sstr));
10659 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10661 SvREADONLY_off(dstr);
10665 /* Some other special case - random pointer */
10666 SvPV_set(dstr, SvPVX(sstr));
10671 /* Copy the Null */
10672 if (SvTYPE(dstr) == SVt_RV)
10673 SvRV_set(dstr, NULL);
10680 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10685 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10687 /* look for it in the table first */
10688 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10692 if(param->flags & CLONEf_JOIN_IN) {
10693 /** We are joining here so we don't want do clone
10694 something that is bad **/
10695 const char *hvname;
10697 if(SvTYPE(sstr) == SVt_PVHV &&
10698 (hvname = HvNAME_get(sstr))) {
10699 /** don't clone stashes if they already exist **/
10700 HV* old_stash = gv_stashpv(hvname,0);
10701 return (SV*) old_stash;
10705 /* create anew and remember what it is */
10708 #ifdef DEBUG_LEAKING_SCALARS
10709 dstr->sv_debug_optype = sstr->sv_debug_optype;
10710 dstr->sv_debug_line = sstr->sv_debug_line;
10711 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10712 dstr->sv_debug_cloned = 1;
10714 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10716 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10720 ptr_table_store(PL_ptr_table, sstr, dstr);
10723 SvFLAGS(dstr) = SvFLAGS(sstr);
10724 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10725 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10728 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10729 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10730 PL_watch_pvx, SvPVX(sstr));
10733 /* don't clone objects whose class has asked us not to */
10734 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10735 SvFLAGS(dstr) &= ~SVTYPEMASK;
10736 SvOBJECT_off(dstr);
10740 switch (SvTYPE(sstr)) {
10742 SvANY(dstr) = NULL;
10745 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10746 SvIV_set(dstr, SvIVX(sstr));
10749 SvANY(dstr) = new_XNV();
10750 SvNV_set(dstr, SvNVX(sstr));
10753 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10754 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10757 SvANY(dstr) = new_XPV();
10758 SvCUR_set(dstr, SvCUR(sstr));
10759 SvLEN_set(dstr, SvLEN(sstr));
10760 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10763 SvANY(dstr) = new_XPVIV();
10764 SvCUR_set(dstr, SvCUR(sstr));
10765 SvLEN_set(dstr, SvLEN(sstr));
10766 SvIV_set(dstr, SvIVX(sstr));
10767 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10770 SvANY(dstr) = new_XPVNV();
10771 SvCUR_set(dstr, SvCUR(sstr));
10772 SvLEN_set(dstr, SvLEN(sstr));
10773 SvIV_set(dstr, SvIVX(sstr));
10774 SvNV_set(dstr, SvNVX(sstr));
10775 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10778 SvANY(dstr) = new_XPVMG();
10779 SvCUR_set(dstr, SvCUR(sstr));
10780 SvLEN_set(dstr, SvLEN(sstr));
10781 SvIV_set(dstr, SvIVX(sstr));
10782 SvNV_set(dstr, SvNVX(sstr));
10783 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10784 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10785 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10788 SvANY(dstr) = new_XPVBM();
10789 SvCUR_set(dstr, SvCUR(sstr));
10790 SvLEN_set(dstr, SvLEN(sstr));
10791 SvIV_set(dstr, SvIVX(sstr));
10792 SvNV_set(dstr, SvNVX(sstr));
10793 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10794 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10795 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10796 BmRARE(dstr) = BmRARE(sstr);
10797 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10798 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10801 SvANY(dstr) = new_XPVLV();
10802 SvCUR_set(dstr, SvCUR(sstr));
10803 SvLEN_set(dstr, SvLEN(sstr));
10804 SvIV_set(dstr, SvIVX(sstr));
10805 SvNV_set(dstr, SvNVX(sstr));
10806 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10807 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10808 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10809 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10810 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10811 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10812 LvTARG(dstr) = dstr;
10813 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10814 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10816 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10817 LvTYPE(dstr) = LvTYPE(sstr);
10820 if (GvUNIQUE((GV*)sstr)) {
10822 if ((share = gv_share(sstr, param))) {
10825 ptr_table_store(PL_ptr_table, sstr, dstr);
10827 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10828 HvNAME_get(GvSTASH(share)), GvNAME(share));
10833 SvANY(dstr) = new_XPVGV();
10834 SvCUR_set(dstr, SvCUR(sstr));
10835 SvLEN_set(dstr, SvLEN(sstr));
10836 SvIV_set(dstr, SvIVX(sstr));
10837 SvNV_set(dstr, SvNVX(sstr));
10838 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10839 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10840 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10841 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10842 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10843 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10844 GvFLAGS(dstr) = GvFLAGS(sstr);
10845 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10846 (void)GpREFCNT_inc(GvGP(dstr));
10849 SvANY(dstr) = new_XPVIO();
10850 SvCUR_set(dstr, SvCUR(sstr));
10851 SvLEN_set(dstr, SvLEN(sstr));
10852 SvIV_set(dstr, SvIVX(sstr));
10853 SvNV_set(dstr, SvNVX(sstr));
10854 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10855 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10856 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10857 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10858 if (IoOFP(sstr) == IoIFP(sstr))
10859 IoOFP(dstr) = IoIFP(dstr);
10861 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10862 /* PL_rsfp_filters entries have fake IoDIRP() */
10863 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10864 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10866 IoDIRP(dstr) = IoDIRP(sstr);
10867 IoLINES(dstr) = IoLINES(sstr);
10868 IoPAGE(dstr) = IoPAGE(sstr);
10869 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10870 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10871 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10872 /* I have no idea why fake dirp (rsfps)
10873 should be treaded differently but otherwise
10874 we end up with leaks -- sky*/
10875 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10876 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10877 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10879 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10880 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10881 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10883 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10884 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10885 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10886 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10887 IoTYPE(dstr) = IoTYPE(sstr);
10888 IoFLAGS(dstr) = IoFLAGS(sstr);
10891 SvANY(dstr) = new_XPVAV();
10892 SvCUR_set(dstr, SvCUR(sstr));
10893 SvLEN_set(dstr, SvLEN(sstr));
10894 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10895 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10896 if (AvARRAY((AV*)sstr)) {
10897 SV **dst_ary, **src_ary;
10898 SSize_t items = AvFILLp((AV*)sstr) + 1;
10900 src_ary = AvARRAY((AV*)sstr);
10901 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10902 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10903 SvPV_set(dstr, (char*)dst_ary);
10904 AvALLOC((AV*)dstr) = dst_ary;
10905 if (AvREAL((AV*)sstr)) {
10906 while (items-- > 0)
10907 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10910 while (items-- > 0)
10911 *dst_ary++ = sv_dup(*src_ary++, param);
10913 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10914 while (items-- > 0) {
10915 *dst_ary++ = &PL_sv_undef;
10919 SvPV_set(dstr, Nullch);
10920 AvALLOC((AV*)dstr) = (SV**)NULL;
10924 SvANY(dstr) = new_XPVHV();
10925 SvCUR_set(dstr, SvCUR(sstr));
10926 SvLEN_set(dstr, SvLEN(sstr));
10927 HvTOTALKEYS(dstr) = HvTOTALKEYS(sstr);
10928 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10929 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10933 if (HvARRAY((HV*)sstr)) {
10935 const bool sharekeys = !!HvSHAREKEYS(sstr);
10936 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10937 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10940 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10941 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0), char);
10942 HvARRAY(dstr) = (HE**)darray;
10943 while (i <= sxhv->xhv_max) {
10944 HE *source = HvARRAY(sstr)[i];
10946 = source ? he_dup(source, sharekeys, param) : 0;
10950 struct xpvhv_aux *saux = HvAUX(sstr);
10951 struct xpvhv_aux *daux = HvAUX(dstr);
10952 /* This flag isn't copied. */
10953 /* SvOOK_on(hv) attacks the IV flags. */
10954 SvFLAGS(dstr) |= SVf_OOK;
10956 hvname = saux->xhv_name;
10957 daux->xhv_name = hvname ? hek_dup(hvname, param) : hvname;
10959 daux->xhv_riter = saux->xhv_riter;
10960 daux->xhv_eiter = saux->xhv_eiter
10961 ? he_dup(saux->xhv_eiter, (bool)!!HvSHAREKEYS(sstr),
10966 SvPV_set(dstr, Nullch);
10968 /* Record stashes for possible cloning in Perl_clone(). */
10970 av_push(param->stashes, dstr);
10974 SvANY(dstr) = new_XPVFM();
10975 FmLINES(dstr) = FmLINES(sstr);
10979 SvANY(dstr) = new_XPVCV();
10981 SvCUR_set(dstr, SvCUR(sstr));
10982 SvLEN_set(dstr, SvLEN(sstr));
10983 SvIV_set(dstr, SvIVX(sstr));
10984 SvNV_set(dstr, SvNVX(sstr));
10985 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10986 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10987 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10988 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10989 CvSTART(dstr) = CvSTART(sstr);
10991 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10993 CvXSUB(dstr) = CvXSUB(sstr);
10994 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10995 if (CvCONST(sstr)) {
10996 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10997 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10998 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
11000 /* don't dup if copying back - CvGV isn't refcounted, so the
11001 * duped GV may never be freed. A bit of a hack! DAPM */
11002 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
11003 Nullgv : gv_dup(CvGV(sstr), param) ;
11004 if (param->flags & CLONEf_COPY_STACKS) {
11005 CvDEPTH(dstr) = CvDEPTH(sstr);
11009 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
11010 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
11012 CvWEAKOUTSIDE(sstr)
11013 ? cv_dup( CvOUTSIDE(sstr), param)
11014 : cv_dup_inc(CvOUTSIDE(sstr), param);
11015 CvFLAGS(dstr) = CvFLAGS(sstr);
11016 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
11019 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
11023 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
11029 /* duplicate a context */
11032 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11034 PERL_CONTEXT *ncxs;
11037 return (PERL_CONTEXT*)NULL;
11039 /* look for it in the table first */
11040 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11044 /* create anew and remember what it is */
11045 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11046 ptr_table_store(PL_ptr_table, cxs, ncxs);
11049 PERL_CONTEXT *cx = &cxs[ix];
11050 PERL_CONTEXT *ncx = &ncxs[ix];
11051 ncx->cx_type = cx->cx_type;
11052 if (CxTYPE(cx) == CXt_SUBST) {
11053 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11056 ncx->blk_oldsp = cx->blk_oldsp;
11057 ncx->blk_oldcop = cx->blk_oldcop;
11058 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11059 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11060 ncx->blk_oldpm = cx->blk_oldpm;
11061 ncx->blk_gimme = cx->blk_gimme;
11062 switch (CxTYPE(cx)) {
11064 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11065 ? cv_dup_inc(cx->blk_sub.cv, param)
11066 : cv_dup(cx->blk_sub.cv,param));
11067 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11068 ? av_dup_inc(cx->blk_sub.argarray, param)
11070 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11071 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11072 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11073 ncx->blk_sub.lval = cx->blk_sub.lval;
11074 ncx->blk_sub.retop = cx->blk_sub.retop;
11077 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11078 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11079 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11080 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11081 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11082 ncx->blk_eval.retop = cx->blk_eval.retop;
11085 ncx->blk_loop.label = cx->blk_loop.label;
11086 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11087 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11088 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11089 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11090 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11091 ? cx->blk_loop.iterdata
11092 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11093 ncx->blk_loop.oldcomppad
11094 = (PAD*)ptr_table_fetch(PL_ptr_table,
11095 cx->blk_loop.oldcomppad);
11096 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11097 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11098 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11099 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11100 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11103 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11104 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11105 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11106 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11107 ncx->blk_sub.retop = cx->blk_sub.retop;
11119 /* duplicate a stack info structure */
11122 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11127 return (PERL_SI*)NULL;
11129 /* look for it in the table first */
11130 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11134 /* create anew and remember what it is */
11135 Newz(56, nsi, 1, PERL_SI);
11136 ptr_table_store(PL_ptr_table, si, nsi);
11138 nsi->si_stack = av_dup_inc(si->si_stack, param);
11139 nsi->si_cxix = si->si_cxix;
11140 nsi->si_cxmax = si->si_cxmax;
11141 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11142 nsi->si_type = si->si_type;
11143 nsi->si_prev = si_dup(si->si_prev, param);
11144 nsi->si_next = si_dup(si->si_next, param);
11145 nsi->si_markoff = si->si_markoff;
11150 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11151 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11152 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11153 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11154 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11155 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11156 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11157 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11158 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11159 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11160 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11161 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11162 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11163 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11166 #define pv_dup_inc(p) SAVEPV(p)
11167 #define pv_dup(p) SAVEPV(p)
11168 #define svp_dup_inc(p,pp) any_dup(p,pp)
11170 /* map any object to the new equivent - either something in the
11171 * ptr table, or something in the interpreter structure
11175 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11180 return (void*)NULL;
11182 /* look for it in the table first */
11183 ret = ptr_table_fetch(PL_ptr_table, v);
11187 /* see if it is part of the interpreter structure */
11188 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11189 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11197 /* duplicate the save stack */
11200 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11202 ANY *ss = proto_perl->Tsavestack;
11203 I32 ix = proto_perl->Tsavestack_ix;
11204 I32 max = proto_perl->Tsavestack_max;
11217 void (*dptr) (void*);
11218 void (*dxptr) (pTHX_ void*);
11220 /* Unions for circumventing strict ANSI C89 casting rules. */
11221 union { void *vptr; void (*dptr)(void*); } u1, u2;
11222 union { void *vptr; void (*dxptr)(pTHX_ void*); } u3, u4;
11224 Newz(54, nss, max, ANY);
11228 TOPINT(nss,ix) = i;
11230 case SAVEt_ITEM: /* normal string */
11231 sv = (SV*)POPPTR(ss,ix);
11232 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11233 sv = (SV*)POPPTR(ss,ix);
11234 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11236 case SAVEt_SV: /* scalar reference */
11237 sv = (SV*)POPPTR(ss,ix);
11238 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11239 gv = (GV*)POPPTR(ss,ix);
11240 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11242 case SAVEt_GENERIC_PVREF: /* generic char* */
11243 c = (char*)POPPTR(ss,ix);
11244 TOPPTR(nss,ix) = pv_dup(c);
11245 ptr = POPPTR(ss,ix);
11246 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11248 case SAVEt_SHARED_PVREF: /* char* in shared space */
11249 c = (char*)POPPTR(ss,ix);
11250 TOPPTR(nss,ix) = savesharedpv(c);
11251 ptr = POPPTR(ss,ix);
11252 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11254 case SAVEt_GENERIC_SVREF: /* generic sv */
11255 case SAVEt_SVREF: /* scalar reference */
11256 sv = (SV*)POPPTR(ss,ix);
11257 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11258 ptr = POPPTR(ss,ix);
11259 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11261 case SAVEt_AV: /* array reference */
11262 av = (AV*)POPPTR(ss,ix);
11263 TOPPTR(nss,ix) = av_dup_inc(av, param);
11264 gv = (GV*)POPPTR(ss,ix);
11265 TOPPTR(nss,ix) = gv_dup(gv, param);
11267 case SAVEt_HV: /* hash reference */
11268 hv = (HV*)POPPTR(ss,ix);
11269 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11270 gv = (GV*)POPPTR(ss,ix);
11271 TOPPTR(nss,ix) = gv_dup(gv, param);
11273 case SAVEt_INT: /* int reference */
11274 ptr = POPPTR(ss,ix);
11275 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11276 intval = (int)POPINT(ss,ix);
11277 TOPINT(nss,ix) = intval;
11279 case SAVEt_LONG: /* long reference */
11280 ptr = POPPTR(ss,ix);
11281 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11282 longval = (long)POPLONG(ss,ix);
11283 TOPLONG(nss,ix) = longval;
11285 case SAVEt_I32: /* I32 reference */
11286 case SAVEt_I16: /* I16 reference */
11287 case SAVEt_I8: /* I8 reference */
11288 ptr = POPPTR(ss,ix);
11289 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11291 TOPINT(nss,ix) = i;
11293 case SAVEt_IV: /* IV reference */
11294 ptr = POPPTR(ss,ix);
11295 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11297 TOPIV(nss,ix) = iv;
11299 case SAVEt_SPTR: /* SV* reference */
11300 ptr = POPPTR(ss,ix);
11301 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11302 sv = (SV*)POPPTR(ss,ix);
11303 TOPPTR(nss,ix) = sv_dup(sv, param);
11305 case SAVEt_VPTR: /* random* reference */
11306 ptr = POPPTR(ss,ix);
11307 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11308 ptr = POPPTR(ss,ix);
11309 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11311 case SAVEt_PPTR: /* char* reference */
11312 ptr = POPPTR(ss,ix);
11313 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11314 c = (char*)POPPTR(ss,ix);
11315 TOPPTR(nss,ix) = pv_dup(c);
11317 case SAVEt_HPTR: /* HV* reference */
11318 ptr = POPPTR(ss,ix);
11319 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11320 hv = (HV*)POPPTR(ss,ix);
11321 TOPPTR(nss,ix) = hv_dup(hv, param);
11323 case SAVEt_APTR: /* AV* reference */
11324 ptr = POPPTR(ss,ix);
11325 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11326 av = (AV*)POPPTR(ss,ix);
11327 TOPPTR(nss,ix) = av_dup(av, param);
11330 gv = (GV*)POPPTR(ss,ix);
11331 TOPPTR(nss,ix) = gv_dup(gv, param);
11333 case SAVEt_GP: /* scalar reference */
11334 gp = (GP*)POPPTR(ss,ix);
11335 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11336 (void)GpREFCNT_inc(gp);
11337 gv = (GV*)POPPTR(ss,ix);
11338 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11339 c = (char*)POPPTR(ss,ix);
11340 TOPPTR(nss,ix) = pv_dup(c);
11342 TOPIV(nss,ix) = iv;
11344 TOPIV(nss,ix) = iv;
11347 case SAVEt_MORTALIZESV:
11348 sv = (SV*)POPPTR(ss,ix);
11349 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11352 ptr = POPPTR(ss,ix);
11353 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11354 /* these are assumed to be refcounted properly */
11355 switch (((OP*)ptr)->op_type) {
11357 case OP_LEAVESUBLV:
11361 case OP_LEAVEWRITE:
11362 TOPPTR(nss,ix) = ptr;
11367 TOPPTR(nss,ix) = Nullop;
11372 TOPPTR(nss,ix) = Nullop;
11375 c = (char*)POPPTR(ss,ix);
11376 TOPPTR(nss,ix) = pv_dup_inc(c);
11378 case SAVEt_CLEARSV:
11379 longval = POPLONG(ss,ix);
11380 TOPLONG(nss,ix) = longval;
11383 hv = (HV*)POPPTR(ss,ix);
11384 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11385 c = (char*)POPPTR(ss,ix);
11386 TOPPTR(nss,ix) = pv_dup_inc(c);
11388 TOPINT(nss,ix) = i;
11390 case SAVEt_DESTRUCTOR:
11391 ptr = POPPTR(ss,ix);
11392 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11393 dptr = POPDPTR(ss,ix);
11395 u2.vptr = any_dup(u1.vptr, proto_perl);
11396 TOPDPTR(nss,ix) = u2.dptr;
11398 case SAVEt_DESTRUCTOR_X:
11399 ptr = POPPTR(ss,ix);
11400 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11401 dxptr = POPDXPTR(ss,ix);
11403 u4.vptr = any_dup(u3.vptr, proto_perl);;
11404 TOPDXPTR(nss,ix) = u4.dxptr;
11406 case SAVEt_REGCONTEXT:
11409 TOPINT(nss,ix) = i;
11412 case SAVEt_STACK_POS: /* Position on Perl stack */
11414 TOPINT(nss,ix) = i;
11416 case SAVEt_AELEM: /* array element */
11417 sv = (SV*)POPPTR(ss,ix);
11418 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11420 TOPINT(nss,ix) = i;
11421 av = (AV*)POPPTR(ss,ix);
11422 TOPPTR(nss,ix) = av_dup_inc(av, param);
11424 case SAVEt_HELEM: /* hash element */
11425 sv = (SV*)POPPTR(ss,ix);
11426 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11427 sv = (SV*)POPPTR(ss,ix);
11428 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11429 hv = (HV*)POPPTR(ss,ix);
11430 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11433 ptr = POPPTR(ss,ix);
11434 TOPPTR(nss,ix) = ptr;
11438 TOPINT(nss,ix) = i;
11440 case SAVEt_COMPPAD:
11441 av = (AV*)POPPTR(ss,ix);
11442 TOPPTR(nss,ix) = av_dup(av, param);
11445 longval = (long)POPLONG(ss,ix);
11446 TOPLONG(nss,ix) = longval;
11447 ptr = POPPTR(ss,ix);
11448 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11449 sv = (SV*)POPPTR(ss,ix);
11450 TOPPTR(nss,ix) = sv_dup(sv, param);
11453 ptr = POPPTR(ss,ix);
11454 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11455 longval = (long)POPBOOL(ss,ix);
11456 TOPBOOL(nss,ix) = (bool)longval;
11458 case SAVEt_SET_SVFLAGS:
11460 TOPINT(nss,ix) = i;
11462 TOPINT(nss,ix) = i;
11463 sv = (SV*)POPPTR(ss,ix);
11464 TOPPTR(nss,ix) = sv_dup(sv, param);
11467 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11475 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11476 * flag to the result. This is done for each stash before cloning starts,
11477 * so we know which stashes want their objects cloned */
11480 do_mark_cloneable_stash(pTHX_ SV *sv)
11482 const char *hvname = HvNAME_get((HV*)sv);
11484 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11485 STRLEN len = HvNAMELEN_get((HV*)sv);
11486 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11487 if (cloner && GvCV(cloner)) {
11494 XPUSHs(sv_2mortal(newSVpvn(hvname, len)));
11496 call_sv((SV*)GvCV(cloner), G_SCALAR);
11503 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11511 =for apidoc perl_clone
11513 Create and return a new interpreter by cloning the current one.
11515 perl_clone takes these flags as parameters:
11517 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11518 without it we only clone the data and zero the stacks,
11519 with it we copy the stacks and the new perl interpreter is
11520 ready to run at the exact same point as the previous one.
11521 The pseudo-fork code uses COPY_STACKS while the
11522 threads->new doesn't.
11524 CLONEf_KEEP_PTR_TABLE
11525 perl_clone keeps a ptr_table with the pointer of the old
11526 variable as a key and the new variable as a value,
11527 this allows it to check if something has been cloned and not
11528 clone it again but rather just use the value and increase the
11529 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11530 the ptr_table using the function
11531 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11532 reason to keep it around is if you want to dup some of your own
11533 variable who are outside the graph perl scans, example of this
11534 code is in threads.xs create
11537 This is a win32 thing, it is ignored on unix, it tells perls
11538 win32host code (which is c++) to clone itself, this is needed on
11539 win32 if you want to run two threads at the same time,
11540 if you just want to do some stuff in a separate perl interpreter
11541 and then throw it away and return to the original one,
11542 you don't need to do anything.
11547 /* XXX the above needs expanding by someone who actually understands it ! */
11548 EXTERN_C PerlInterpreter *
11549 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11552 perl_clone(PerlInterpreter *proto_perl, UV flags)
11555 #ifdef PERL_IMPLICIT_SYS
11557 /* perlhost.h so we need to call into it
11558 to clone the host, CPerlHost should have a c interface, sky */
11560 if (flags & CLONEf_CLONE_HOST) {
11561 return perl_clone_host(proto_perl,flags);
11563 return perl_clone_using(proto_perl, flags,
11565 proto_perl->IMemShared,
11566 proto_perl->IMemParse,
11568 proto_perl->IStdIO,
11572 proto_perl->IProc);
11576 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11577 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11578 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11579 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11580 struct IPerlDir* ipD, struct IPerlSock* ipS,
11581 struct IPerlProc* ipP)
11583 /* XXX many of the string copies here can be optimized if they're
11584 * constants; they need to be allocated as common memory and just
11585 * their pointers copied. */
11588 CLONE_PARAMS clone_params;
11589 CLONE_PARAMS* param = &clone_params;
11591 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11592 /* for each stash, determine whether its objects should be cloned */
11593 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11594 PERL_SET_THX(my_perl);
11597 Poison(my_perl, 1, PerlInterpreter);
11599 PL_curcop = (COP *)Nullop;
11603 PL_savestack_ix = 0;
11604 PL_savestack_max = -1;
11605 PL_sig_pending = 0;
11606 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11607 # else /* !DEBUGGING */
11608 Zero(my_perl, 1, PerlInterpreter);
11609 # endif /* DEBUGGING */
11611 /* host pointers */
11613 PL_MemShared = ipMS;
11614 PL_MemParse = ipMP;
11621 #else /* !PERL_IMPLICIT_SYS */
11623 CLONE_PARAMS clone_params;
11624 CLONE_PARAMS* param = &clone_params;
11625 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11626 /* for each stash, determine whether its objects should be cloned */
11627 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11628 PERL_SET_THX(my_perl);
11631 Poison(my_perl, 1, PerlInterpreter);
11633 PL_curcop = (COP *)Nullop;
11637 PL_savestack_ix = 0;
11638 PL_savestack_max = -1;
11639 PL_sig_pending = 0;
11640 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11641 # else /* !DEBUGGING */
11642 Zero(my_perl, 1, PerlInterpreter);
11643 # endif /* DEBUGGING */
11644 #endif /* PERL_IMPLICIT_SYS */
11645 param->flags = flags;
11646 param->proto_perl = proto_perl;
11649 PL_xnv_arenaroot = NULL;
11650 PL_xnv_root = NULL;
11651 PL_xpv_arenaroot = NULL;
11652 PL_xpv_root = NULL;
11653 PL_xpviv_arenaroot = NULL;
11654 PL_xpviv_root = NULL;
11655 PL_xpvnv_arenaroot = NULL;
11656 PL_xpvnv_root = NULL;
11657 PL_xpvcv_arenaroot = NULL;
11658 PL_xpvcv_root = NULL;
11659 PL_xpvav_arenaroot = NULL;
11660 PL_xpvav_root = NULL;
11661 PL_xpvhv_arenaroot = NULL;
11662 PL_xpvhv_root = NULL;
11663 PL_xpvmg_arenaroot = NULL;
11664 PL_xpvmg_root = NULL;
11665 PL_xpvgv_arenaroot = NULL;
11666 PL_xpvgv_root = NULL;
11667 PL_xpvlv_arenaroot = NULL;
11668 PL_xpvlv_root = NULL;
11669 PL_xpvbm_arenaroot = NULL;
11670 PL_xpvbm_root = NULL;
11671 PL_he_arenaroot = NULL;
11673 #if defined(USE_ITHREADS)
11674 PL_pte_arenaroot = NULL;
11675 PL_pte_root = NULL;
11677 PL_nice_chunk = NULL;
11678 PL_nice_chunk_size = 0;
11680 PL_sv_objcount = 0;
11681 PL_sv_root = Nullsv;
11682 PL_sv_arenaroot = Nullsv;
11684 PL_debug = proto_perl->Idebug;
11686 PL_hash_seed = proto_perl->Ihash_seed;
11687 PL_rehash_seed = proto_perl->Irehash_seed;
11689 #ifdef USE_REENTRANT_API
11690 /* XXX: things like -Dm will segfault here in perlio, but doing
11691 * PERL_SET_CONTEXT(proto_perl);
11692 * breaks too many other things
11694 Perl_reentrant_init(aTHX);
11697 /* create SV map for pointer relocation */
11698 PL_ptr_table = ptr_table_new();
11699 /* and one for finding shared hash keys quickly */
11700 PL_shared_hek_table = ptr_table_new();
11702 /* initialize these special pointers as early as possible */
11703 SvANY(&PL_sv_undef) = NULL;
11704 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11705 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11706 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11708 SvANY(&PL_sv_no) = new_XPVNV();
11709 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11710 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11711 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11712 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11713 SvCUR_set(&PL_sv_no, 0);
11714 SvLEN_set(&PL_sv_no, 1);
11715 SvIV_set(&PL_sv_no, 0);
11716 SvNV_set(&PL_sv_no, 0);
11717 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11719 SvANY(&PL_sv_yes) = new_XPVNV();
11720 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11721 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11722 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11723 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11724 SvCUR_set(&PL_sv_yes, 1);
11725 SvLEN_set(&PL_sv_yes, 2);
11726 SvIV_set(&PL_sv_yes, 1);
11727 SvNV_set(&PL_sv_yes, 1);
11728 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11730 /* create (a non-shared!) shared string table */
11731 PL_strtab = newHV();
11732 HvSHAREKEYS_off(PL_strtab);
11733 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11734 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11736 PL_compiling = proto_perl->Icompiling;
11738 /* These two PVs will be free'd special way so must set them same way op.c does */
11739 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11740 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11742 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11743 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11745 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11746 if (!specialWARN(PL_compiling.cop_warnings))
11747 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11748 if (!specialCopIO(PL_compiling.cop_io))
11749 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11750 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11752 /* pseudo environmental stuff */
11753 PL_origargc = proto_perl->Iorigargc;
11754 PL_origargv = proto_perl->Iorigargv;
11756 param->stashes = newAV(); /* Setup array of objects to call clone on */
11758 #ifdef PERLIO_LAYERS
11759 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11760 PerlIO_clone(aTHX_ proto_perl, param);
11763 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11764 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11765 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11766 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11767 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11768 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11771 PL_minus_c = proto_perl->Iminus_c;
11772 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11773 PL_localpatches = proto_perl->Ilocalpatches;
11774 PL_splitstr = proto_perl->Isplitstr;
11775 PL_preprocess = proto_perl->Ipreprocess;
11776 PL_minus_n = proto_perl->Iminus_n;
11777 PL_minus_p = proto_perl->Iminus_p;
11778 PL_minus_l = proto_perl->Iminus_l;
11779 PL_minus_a = proto_perl->Iminus_a;
11780 PL_minus_F = proto_perl->Iminus_F;
11781 PL_doswitches = proto_perl->Idoswitches;
11782 PL_dowarn = proto_perl->Idowarn;
11783 PL_doextract = proto_perl->Idoextract;
11784 PL_sawampersand = proto_perl->Isawampersand;
11785 PL_unsafe = proto_perl->Iunsafe;
11786 PL_inplace = SAVEPV(proto_perl->Iinplace);
11787 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11788 PL_perldb = proto_perl->Iperldb;
11789 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11790 PL_exit_flags = proto_perl->Iexit_flags;
11792 /* magical thingies */
11793 /* XXX time(&PL_basetime) when asked for? */
11794 PL_basetime = proto_perl->Ibasetime;
11795 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11797 PL_maxsysfd = proto_perl->Imaxsysfd;
11798 PL_multiline = proto_perl->Imultiline;
11799 PL_statusvalue = proto_perl->Istatusvalue;
11801 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11803 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11805 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11806 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11807 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11809 /* Clone the regex array */
11810 PL_regex_padav = newAV();
11812 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11813 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11814 av_push(PL_regex_padav,
11815 sv_dup_inc(regexen[0],param));
11816 for(i = 1; i <= len; i++) {
11817 if(SvREPADTMP(regexen[i])) {
11818 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11820 av_push(PL_regex_padav,
11822 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11823 SvIVX(regexen[i])), param)))
11828 PL_regex_pad = AvARRAY(PL_regex_padav);
11830 /* shortcuts to various I/O objects */
11831 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11832 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11833 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11834 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11835 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11836 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11838 /* shortcuts to regexp stuff */
11839 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11841 /* shortcuts to misc objects */
11842 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11844 /* shortcuts to debugging objects */
11845 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11846 PL_DBline = gv_dup(proto_perl->IDBline, param);
11847 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11848 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11849 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11850 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11851 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11852 PL_lineary = av_dup(proto_perl->Ilineary, param);
11853 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11855 /* symbol tables */
11856 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11857 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11858 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11859 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11860 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11862 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11863 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11864 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11865 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11866 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11867 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11869 PL_sub_generation = proto_perl->Isub_generation;
11871 /* funky return mechanisms */
11872 PL_forkprocess = proto_perl->Iforkprocess;
11874 /* subprocess state */
11875 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11877 /* internal state */
11878 PL_tainting = proto_perl->Itainting;
11879 PL_taint_warn = proto_perl->Itaint_warn;
11880 PL_maxo = proto_perl->Imaxo;
11881 if (proto_perl->Iop_mask)
11882 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11884 PL_op_mask = Nullch;
11885 /* PL_asserting = proto_perl->Iasserting; */
11887 /* current interpreter roots */
11888 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11889 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11890 PL_main_start = proto_perl->Imain_start;
11891 PL_eval_root = proto_perl->Ieval_root;
11892 PL_eval_start = proto_perl->Ieval_start;
11894 /* runtime control stuff */
11895 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11896 PL_copline = proto_perl->Icopline;
11898 PL_filemode = proto_perl->Ifilemode;
11899 PL_lastfd = proto_perl->Ilastfd;
11900 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11903 PL_gensym = proto_perl->Igensym;
11904 PL_preambled = proto_perl->Ipreambled;
11905 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11906 PL_laststatval = proto_perl->Ilaststatval;
11907 PL_laststype = proto_perl->Ilaststype;
11908 PL_mess_sv = Nullsv;
11910 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11911 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11913 /* interpreter atexit processing */
11914 PL_exitlistlen = proto_perl->Iexitlistlen;
11915 if (PL_exitlistlen) {
11916 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11917 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11920 PL_exitlist = (PerlExitListEntry*)NULL;
11921 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11922 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11923 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11925 PL_profiledata = NULL;
11926 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11927 /* PL_rsfp_filters entries have fake IoDIRP() */
11928 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11930 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11932 PAD_CLONE_VARS(proto_perl, param);
11934 #ifdef HAVE_INTERP_INTERN
11935 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11938 /* more statics moved here */
11939 PL_generation = proto_perl->Igeneration;
11940 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11942 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11943 PL_in_clean_all = proto_perl->Iin_clean_all;
11945 PL_uid = proto_perl->Iuid;
11946 PL_euid = proto_perl->Ieuid;
11947 PL_gid = proto_perl->Igid;
11948 PL_egid = proto_perl->Iegid;
11949 PL_nomemok = proto_perl->Inomemok;
11950 PL_an = proto_perl->Ian;
11951 PL_evalseq = proto_perl->Ievalseq;
11952 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11953 PL_origalen = proto_perl->Iorigalen;
11954 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11955 PL_osname = SAVEPV(proto_perl->Iosname);
11956 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11957 PL_sighandlerp = proto_perl->Isighandlerp;
11960 PL_runops = proto_perl->Irunops;
11962 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11965 PL_cshlen = proto_perl->Icshlen;
11966 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11969 PL_lex_state = proto_perl->Ilex_state;
11970 PL_lex_defer = proto_perl->Ilex_defer;
11971 PL_lex_expect = proto_perl->Ilex_expect;
11972 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11973 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11974 PL_lex_starts = proto_perl->Ilex_starts;
11975 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11976 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11977 PL_lex_op = proto_perl->Ilex_op;
11978 PL_lex_inpat = proto_perl->Ilex_inpat;
11979 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11980 PL_lex_brackets = proto_perl->Ilex_brackets;
11981 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11982 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11983 PL_lex_casemods = proto_perl->Ilex_casemods;
11984 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11985 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11987 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11988 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11989 PL_nexttoke = proto_perl->Inexttoke;
11991 /* XXX This is probably masking the deeper issue of why
11992 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11993 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11994 * (A little debugging with a watchpoint on it may help.)
11996 if (SvANY(proto_perl->Ilinestr)) {
11997 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11998 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11999 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12000 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
12001 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12002 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
12003 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12004 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
12005 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12008 PL_linestr = NEWSV(65,79);
12009 sv_upgrade(PL_linestr,SVt_PVIV);
12010 sv_setpvn(PL_linestr,"",0);
12011 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
12013 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12014 PL_pending_ident = proto_perl->Ipending_ident;
12015 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
12017 PL_expect = proto_perl->Iexpect;
12019 PL_multi_start = proto_perl->Imulti_start;
12020 PL_multi_end = proto_perl->Imulti_end;
12021 PL_multi_open = proto_perl->Imulti_open;
12022 PL_multi_close = proto_perl->Imulti_close;
12024 PL_error_count = proto_perl->Ierror_count;
12025 PL_subline = proto_perl->Isubline;
12026 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
12028 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
12029 if (SvANY(proto_perl->Ilinestr)) {
12030 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
12031 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12032 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
12033 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12034 PL_last_lop_op = proto_perl->Ilast_lop_op;
12037 PL_last_uni = SvPVX(PL_linestr);
12038 PL_last_lop = SvPVX(PL_linestr);
12039 PL_last_lop_op = 0;
12041 PL_in_my = proto_perl->Iin_my;
12042 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12044 PL_cryptseen = proto_perl->Icryptseen;
12047 PL_hints = proto_perl->Ihints;
12049 PL_amagic_generation = proto_perl->Iamagic_generation;
12051 #ifdef USE_LOCALE_COLLATE
12052 PL_collation_ix = proto_perl->Icollation_ix;
12053 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12054 PL_collation_standard = proto_perl->Icollation_standard;
12055 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12056 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12057 #endif /* USE_LOCALE_COLLATE */
12059 #ifdef USE_LOCALE_NUMERIC
12060 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12061 PL_numeric_standard = proto_perl->Inumeric_standard;
12062 PL_numeric_local = proto_perl->Inumeric_local;
12063 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12064 #endif /* !USE_LOCALE_NUMERIC */
12066 /* utf8 character classes */
12067 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12068 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12069 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12070 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12071 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12072 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12073 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12074 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12075 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12076 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12077 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12078 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12079 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12080 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12081 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12082 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12083 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12084 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12085 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12086 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12088 /* Did the locale setup indicate UTF-8? */
12089 PL_utf8locale = proto_perl->Iutf8locale;
12090 /* Unicode features (see perlrun/-C) */
12091 PL_unicode = proto_perl->Iunicode;
12093 /* Pre-5.8 signals control */
12094 PL_signals = proto_perl->Isignals;
12096 /* times() ticks per second */
12097 PL_clocktick = proto_perl->Iclocktick;
12099 /* Recursion stopper for PerlIO_find_layer */
12100 PL_in_load_module = proto_perl->Iin_load_module;
12102 /* sort() routine */
12103 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12105 /* Not really needed/useful since the reenrant_retint is "volatile",
12106 * but do it for consistency's sake. */
12107 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12109 /* Hooks to shared SVs and locks. */
12110 PL_sharehook = proto_perl->Isharehook;
12111 PL_lockhook = proto_perl->Ilockhook;
12112 PL_unlockhook = proto_perl->Iunlockhook;
12113 PL_threadhook = proto_perl->Ithreadhook;
12115 PL_runops_std = proto_perl->Irunops_std;
12116 PL_runops_dbg = proto_perl->Irunops_dbg;
12118 #ifdef THREADS_HAVE_PIDS
12119 PL_ppid = proto_perl->Ippid;
12123 PL_last_swash_hv = Nullhv; /* reinits on demand */
12124 PL_last_swash_klen = 0;
12125 PL_last_swash_key[0]= '\0';
12126 PL_last_swash_tmps = (U8*)NULL;
12127 PL_last_swash_slen = 0;
12129 PL_glob_index = proto_perl->Iglob_index;
12130 PL_srand_called = proto_perl->Isrand_called;
12131 PL_uudmap['M'] = 0; /* reinits on demand */
12132 PL_bitcount = Nullch; /* reinits on demand */
12134 if (proto_perl->Ipsig_pend) {
12135 Newz(0, PL_psig_pend, SIG_SIZE, int);
12138 PL_psig_pend = (int*)NULL;
12141 if (proto_perl->Ipsig_ptr) {
12142 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12143 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12144 for (i = 1; i < SIG_SIZE; i++) {
12145 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12146 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12150 PL_psig_ptr = (SV**)NULL;
12151 PL_psig_name = (SV**)NULL;
12154 /* thrdvar.h stuff */
12156 if (flags & CLONEf_COPY_STACKS) {
12157 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12158 PL_tmps_ix = proto_perl->Ttmps_ix;
12159 PL_tmps_max = proto_perl->Ttmps_max;
12160 PL_tmps_floor = proto_perl->Ttmps_floor;
12161 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12163 while (i <= PL_tmps_ix) {
12164 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12168 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12169 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12170 Newz(54, PL_markstack, i, I32);
12171 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12172 - proto_perl->Tmarkstack);
12173 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12174 - proto_perl->Tmarkstack);
12175 Copy(proto_perl->Tmarkstack, PL_markstack,
12176 PL_markstack_ptr - PL_markstack + 1, I32);
12178 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12179 * NOTE: unlike the others! */
12180 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12181 PL_scopestack_max = proto_perl->Tscopestack_max;
12182 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12183 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12185 /* NOTE: si_dup() looks at PL_markstack */
12186 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12188 /* PL_curstack = PL_curstackinfo->si_stack; */
12189 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12190 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12192 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12193 PL_stack_base = AvARRAY(PL_curstack);
12194 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12195 - proto_perl->Tstack_base);
12196 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12198 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12199 * NOTE: unlike the others! */
12200 PL_savestack_ix = proto_perl->Tsavestack_ix;
12201 PL_savestack_max = proto_perl->Tsavestack_max;
12202 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12203 PL_savestack = ss_dup(proto_perl, param);
12207 ENTER; /* perl_destruct() wants to LEAVE; */
12210 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12211 PL_top_env = &PL_start_env;
12213 PL_op = proto_perl->Top;
12216 PL_Xpv = (XPV*)NULL;
12217 PL_na = proto_perl->Tna;
12219 PL_statbuf = proto_perl->Tstatbuf;
12220 PL_statcache = proto_perl->Tstatcache;
12221 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12222 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12224 PL_timesbuf = proto_perl->Ttimesbuf;
12227 PL_tainted = proto_perl->Ttainted;
12228 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12229 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12230 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12231 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12232 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12233 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12234 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12235 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12236 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12238 PL_restartop = proto_perl->Trestartop;
12239 PL_in_eval = proto_perl->Tin_eval;
12240 PL_delaymagic = proto_perl->Tdelaymagic;
12241 PL_dirty = proto_perl->Tdirty;
12242 PL_localizing = proto_perl->Tlocalizing;
12244 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12245 PL_hv_fetch_ent_mh = Nullhe;
12246 PL_modcount = proto_perl->Tmodcount;
12247 PL_lastgotoprobe = Nullop;
12248 PL_dumpindent = proto_perl->Tdumpindent;
12250 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12251 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12252 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12253 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12254 PL_sortcxix = proto_perl->Tsortcxix;
12255 PL_efloatbuf = Nullch; /* reinits on demand */
12256 PL_efloatsize = 0; /* reinits on demand */
12260 PL_screamfirst = NULL;
12261 PL_screamnext = NULL;
12262 PL_maxscream = -1; /* reinits on demand */
12263 PL_lastscream = Nullsv;
12265 PL_watchaddr = NULL;
12266 PL_watchok = Nullch;
12268 PL_regdummy = proto_perl->Tregdummy;
12269 PL_regprecomp = Nullch;
12272 PL_colorset = 0; /* reinits PL_colors[] */
12273 /*PL_colors[6] = {0,0,0,0,0,0};*/
12274 PL_reginput = Nullch;
12275 PL_regbol = Nullch;
12276 PL_regeol = Nullch;
12277 PL_regstartp = (I32*)NULL;
12278 PL_regendp = (I32*)NULL;
12279 PL_reglastparen = (U32*)NULL;
12280 PL_reglastcloseparen = (U32*)NULL;
12281 PL_regtill = Nullch;
12282 PL_reg_start_tmp = (char**)NULL;
12283 PL_reg_start_tmpl = 0;
12284 PL_regdata = (struct reg_data*)NULL;
12287 PL_reg_eval_set = 0;
12289 PL_regprogram = (regnode*)NULL;
12291 PL_regcc = (CURCUR*)NULL;
12292 PL_reg_call_cc = (struct re_cc_state*)NULL;
12293 PL_reg_re = (regexp*)NULL;
12294 PL_reg_ganch = Nullch;
12295 PL_reg_sv = Nullsv;
12296 PL_reg_match_utf8 = FALSE;
12297 PL_reg_magic = (MAGIC*)NULL;
12299 PL_reg_oldcurpm = (PMOP*)NULL;
12300 PL_reg_curpm = (PMOP*)NULL;
12301 PL_reg_oldsaved = Nullch;
12302 PL_reg_oldsavedlen = 0;
12303 #ifdef PERL_COPY_ON_WRITE
12306 PL_reg_maxiter = 0;
12307 PL_reg_leftiter = 0;
12308 PL_reg_poscache = Nullch;
12309 PL_reg_poscache_size= 0;
12311 /* RE engine - function pointers */
12312 PL_regcompp = proto_perl->Tregcompp;
12313 PL_regexecp = proto_perl->Tregexecp;
12314 PL_regint_start = proto_perl->Tregint_start;
12315 PL_regint_string = proto_perl->Tregint_string;
12316 PL_regfree = proto_perl->Tregfree;
12318 PL_reginterp_cnt = 0;
12319 PL_reg_starttry = 0;
12321 /* Pluggable optimizer */
12322 PL_peepp = proto_perl->Tpeepp;
12324 PL_stashcache = newHV();
12326 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12327 ptr_table_free(PL_ptr_table);
12328 PL_ptr_table = NULL;
12329 ptr_table_free(PL_shared_hek_table);
12330 PL_shared_hek_table = NULL;
12333 /* Call the ->CLONE method, if it exists, for each of the stashes
12334 identified by sv_dup() above.
12336 while(av_len(param->stashes) != -1) {
12337 HV* stash = (HV*) av_shift(param->stashes);
12338 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12339 if (cloner && GvCV(cloner)) {
12344 XPUSHs(sv_2mortal(newSVpvn(HvNAME_get(stash), HvNAMELEN_get(stash))));
12346 call_sv((SV*)GvCV(cloner), G_DISCARD);
12352 SvREFCNT_dec(param->stashes);
12354 /* orphaned? eg threads->new inside BEGIN or use */
12355 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12356 (void)SvREFCNT_inc(PL_compcv);
12357 SAVEFREESV(PL_compcv);
12363 #endif /* USE_ITHREADS */
12366 =head1 Unicode Support
12368 =for apidoc sv_recode_to_utf8
12370 The encoding is assumed to be an Encode object, on entry the PV
12371 of the sv is assumed to be octets in that encoding, and the sv
12372 will be converted into Unicode (and UTF-8).
12374 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12375 is not a reference, nothing is done to the sv. If the encoding is not
12376 an C<Encode::XS> Encoding object, bad things will happen.
12377 (See F<lib/encoding.pm> and L<Encode>).
12379 The PV of the sv is returned.
12384 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12387 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12401 Passing sv_yes is wrong - it needs to be or'ed set of constants
12402 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12403 remove converted chars from source.
12405 Both will default the value - let them.
12407 XPUSHs(&PL_sv_yes);
12410 call_method("decode", G_SCALAR);
12414 s = SvPV(uni, len);
12415 if (s != SvPVX(sv)) {
12416 SvGROW(sv, len + 1);
12417 Move(s, SvPVX(sv), len, char);
12418 SvCUR_set(sv, len);
12419 SvPVX(sv)[len] = 0;
12426 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12430 =for apidoc sv_cat_decode
12432 The encoding is assumed to be an Encode object, the PV of the ssv is
12433 assumed to be octets in that encoding and decoding the input starts
12434 from the position which (PV + *offset) pointed to. The dsv will be
12435 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12436 when the string tstr appears in decoding output or the input ends on
12437 the PV of the ssv. The value which the offset points will be modified
12438 to the last input position on the ssv.
12440 Returns TRUE if the terminator was found, else returns FALSE.
12445 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12446 SV *ssv, int *offset, char *tstr, int tlen)
12450 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12461 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12462 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12464 call_method("cat_decode", G_SCALAR);
12466 ret = SvTRUE(TOPs);
12467 *offset = SvIV(offsv);
12473 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12479 * c-indentation-style: bsd
12480 * c-basic-offset: 4
12481 * indent-tabs-mode: t
12484 * ex: set ts=8 sts=4 sw=4 noet: