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);
761 if (!cv || !CvPADLIST(cv))
763 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
764 sv = *av_fetch(av, targ, FALSE);
765 /* SvLEN in a pad name is not to be trusted */
766 sv_setpv(name, SvPV_nolen(sv));
769 if (subscript_type == FUV_SUBSCRIPT_HASH) {
772 Perl_sv_catpvf(aTHX_ name, "{%s}",
773 pv_display(sv,SvPVX(keyname), SvCUR(keyname), 0, 32));
776 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
778 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
780 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
781 sv_insert(name, 0, 0, "within ", 7);
788 =for apidoc find_uninit_var
790 Find the name of the undefined variable (if any) that caused the operator o
791 to issue a "Use of uninitialized value" warning.
792 If match is true, only return a name if it's value matches uninit_sv.
793 So roughly speaking, if a unary operator (such as OP_COS) generates a
794 warning, then following the direct child of the op may yield an
795 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
796 other hand, with OP_ADD there are two branches to follow, so we only print
797 the variable name if we get an exact match.
799 The name is returned as a mortal SV.
801 Assumes that PL_op is the op that originally triggered the error, and that
802 PL_comppad/PL_curpad points to the currently executing pad.
808 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
817 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
818 uninit_sv == &PL_sv_placeholder)))
821 switch (obase->op_type) {
828 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
829 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
832 int subscript_type = FUV_SUBSCRIPT_WITHIN;
834 if (pad) { /* @lex, %lex */
835 sv = PAD_SVl(obase->op_targ);
839 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
840 /* @global, %global */
841 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
844 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
846 else /* @{expr}, %{expr} */
847 return find_uninit_var(cUNOPx(obase)->op_first,
851 /* attempt to find a match within the aggregate */
853 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
855 subscript_type = FUV_SUBSCRIPT_HASH;
858 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
860 subscript_type = FUV_SUBSCRIPT_ARRAY;
863 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
866 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
867 keysv, index, subscript_type);
871 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
873 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
874 Nullsv, 0, FUV_SUBSCRIPT_NONE);
877 gv = cGVOPx_gv(obase);
878 if (!gv || (match && GvSV(gv) != uninit_sv))
880 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
883 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
885 av = (AV*)PAD_SV(obase->op_targ);
886 if (!av || SvRMAGICAL(av))
888 svp = av_fetch(av, (I32)obase->op_private, FALSE);
889 if (!svp || *svp != uninit_sv)
892 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
893 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
896 gv = cGVOPx_gv(obase);
901 if (!av || SvRMAGICAL(av))
903 svp = av_fetch(av, (I32)obase->op_private, FALSE);
904 if (!svp || *svp != uninit_sv)
907 return S_varname(aTHX_ gv, "$", 0,
908 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
913 o = cUNOPx(obase)->op_first;
914 if (!o || o->op_type != OP_NULL ||
915 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
917 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
922 /* $a[uninit_expr] or $h{uninit_expr} */
923 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
926 o = cBINOPx(obase)->op_first;
927 kid = cBINOPx(obase)->op_last;
929 /* get the av or hv, and optionally the gv */
931 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
932 sv = PAD_SV(o->op_targ);
934 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
935 && cUNOPo->op_first->op_type == OP_GV)
937 gv = cGVOPx_gv(cUNOPo->op_first);
940 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
945 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
946 /* index is constant */
950 if (obase->op_type == OP_HELEM) {
951 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
952 if (!he || HeVAL(he) != uninit_sv)
956 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
957 if (!svp || *svp != uninit_sv)
961 if (obase->op_type == OP_HELEM)
962 return S_varname(aTHX_ gv, "%", o->op_targ,
963 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
965 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
966 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
970 /* index is an expression;
971 * attempt to find a match within the aggregate */
972 if (obase->op_type == OP_HELEM) {
973 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
975 return S_varname(aTHX_ gv, "%", o->op_targ,
976 keysv, 0, FUV_SUBSCRIPT_HASH);
979 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
981 return S_varname(aTHX_ gv, "@", o->op_targ,
982 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
986 return S_varname(aTHX_ gv,
987 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
989 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
995 /* only examine RHS */
996 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
999 o = cUNOPx(obase)->op_first;
1000 if (o->op_type == OP_PUSHMARK)
1003 if (!o->op_sibling) {
1004 /* one-arg version of open is highly magical */
1006 if (o->op_type == OP_GV) { /* open FOO; */
1008 if (match && GvSV(gv) != uninit_sv)
1010 return S_varname(aTHX_ gv, "$", 0,
1011 Nullsv, 0, FUV_SUBSCRIPT_NONE);
1013 /* other possibilities not handled are:
1014 * open $x; or open my $x; should return '${*$x}'
1015 * open expr; should return '$'.expr ideally
1021 /* ops where $_ may be an implicit arg */
1025 if ( !(obase->op_flags & OPf_STACKED)) {
1026 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1027 ? PAD_SVl(obase->op_targ)
1030 sv = sv_newmortal();
1039 /* skip filehandle as it can't produce 'undef' warning */
1040 o = cUNOPx(obase)->op_first;
1041 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1042 o = o->op_sibling->op_sibling;
1049 match = 1; /* XS or custom code could trigger random warnings */
1054 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1055 return sv_2mortal(newSVpv("${$/}", 0));
1060 if (!(obase->op_flags & OPf_KIDS))
1062 o = cUNOPx(obase)->op_first;
1068 /* if all except one arg are constant, or have no side-effects,
1069 * or are optimized away, then it's unambiguous */
1071 for (kid=o; kid; kid = kid->op_sibling) {
1073 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1074 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1075 || (kid->op_type == OP_PUSHMARK)
1079 if (o2) { /* more than one found */
1086 return find_uninit_var(o2, uninit_sv, match);
1090 sv = find_uninit_var(o, uninit_sv, 1);
1102 =for apidoc report_uninit
1104 Print appropriate "Use of uninitialized variable" warning
1110 Perl_report_uninit(pTHX_ SV* uninit_sv)
1113 SV* varname = Nullsv;
1115 varname = find_uninit_var(PL_op, uninit_sv,0);
1117 sv_insert(varname, 0, 0, " ", 1);
1119 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1120 varname ? SvPV_nolen(varname) : "",
1121 " in ", OP_DESC(PL_op));
1124 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1128 /* allocate another arena's worth of NV bodies */
1136 New(711, ptr, PERL_ARENA_SIZE/sizeof(NV), NV);
1137 *((void **) ptr) = (void *)PL_xnv_arenaroot;
1138 PL_xnv_arenaroot = ptr;
1141 xnvend = &xnv[PERL_ARENA_SIZE / sizeof(NV) - 1];
1142 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1144 while (xnv < xnvend) {
1145 *(NV**)xnv = (NV*)(xnv + 1);
1151 /* allocate another arena's worth of struct xpv */
1157 xpv_allocated* xpvend;
1158 New(713, xpv, PERL_ARENA_SIZE/sizeof(xpv_allocated), xpv_allocated);
1159 *((xpv_allocated**)xpv) = PL_xpv_arenaroot;
1160 PL_xpv_arenaroot = xpv;
1162 xpvend = &xpv[PERL_ARENA_SIZE / sizeof(xpv_allocated) - 1];
1163 PL_xpv_root = ++xpv;
1164 while (xpv < xpvend) {
1165 *((xpv_allocated**)xpv) = xpv + 1;
1168 *((xpv_allocated**)xpv) = 0;
1171 /* allocate another arena's worth of struct xpviv */
1176 xpviv_allocated* xpviv;
1177 xpviv_allocated* xpvivend;
1178 New(713, xpviv, PERL_ARENA_SIZE/sizeof(xpviv_allocated), xpviv_allocated);
1179 *((xpviv_allocated**)xpviv) = PL_xpviv_arenaroot;
1180 PL_xpviv_arenaroot = xpviv;
1182 xpvivend = &xpviv[PERL_ARENA_SIZE / sizeof(xpviv_allocated) - 1];
1183 PL_xpviv_root = ++xpviv;
1184 while (xpviv < xpvivend) {
1185 *((xpviv_allocated**)xpviv) = xpviv + 1;
1188 *((xpviv_allocated**)xpviv) = 0;
1191 /* allocate another arena's worth of struct xpvnv */
1198 New(715, xpvnv, PERL_ARENA_SIZE/sizeof(XPVNV), XPVNV);
1199 *((XPVNV**)xpvnv) = PL_xpvnv_arenaroot;
1200 PL_xpvnv_arenaroot = xpvnv;
1202 xpvnvend = &xpvnv[PERL_ARENA_SIZE / sizeof(XPVNV) - 1];
1203 PL_xpvnv_root = ++xpvnv;
1204 while (xpvnv < xpvnvend) {
1205 *((XPVNV**)xpvnv) = xpvnv + 1;
1208 *((XPVNV**)xpvnv) = 0;
1211 /* allocate another arena's worth of struct xpvcv */
1218 New(716, xpvcv, PERL_ARENA_SIZE/sizeof(XPVCV), XPVCV);
1219 *((XPVCV**)xpvcv) = PL_xpvcv_arenaroot;
1220 PL_xpvcv_arenaroot = xpvcv;
1222 xpvcvend = &xpvcv[PERL_ARENA_SIZE / sizeof(XPVCV) - 1];
1223 PL_xpvcv_root = ++xpvcv;
1224 while (xpvcv < xpvcvend) {
1225 *((XPVCV**)xpvcv) = xpvcv + 1;
1228 *((XPVCV**)xpvcv) = 0;
1231 /* allocate another arena's worth of struct xpvav */
1236 xpvav_allocated* xpvav;
1237 xpvav_allocated* xpvavend;
1238 New(717, xpvav, PERL_ARENA_SIZE/sizeof(xpvav_allocated),
1240 *((xpvav_allocated**)xpvav) = PL_xpvav_arenaroot;
1241 PL_xpvav_arenaroot = xpvav;
1243 xpvavend = &xpvav[PERL_ARENA_SIZE / sizeof(xpvav_allocated) - 1];
1244 PL_xpvav_root = ++xpvav;
1245 while (xpvav < xpvavend) {
1246 *((xpvav_allocated**)xpvav) = xpvav + 1;
1249 *((xpvav_allocated**)xpvav) = 0;
1252 /* allocate another arena's worth of struct xpvhv */
1257 xpvhv_allocated* xpvhv;
1258 xpvhv_allocated* xpvhvend;
1259 New(718, xpvhv, PERL_ARENA_SIZE/sizeof(xpvhv_allocated),
1261 *((xpvhv_allocated**)xpvhv) = PL_xpvhv_arenaroot;
1262 PL_xpvhv_arenaroot = xpvhv;
1264 xpvhvend = &xpvhv[PERL_ARENA_SIZE / sizeof(xpvhv_allocated) - 1];
1265 PL_xpvhv_root = ++xpvhv;
1266 while (xpvhv < xpvhvend) {
1267 *((xpvhv_allocated**)xpvhv) = xpvhv + 1;
1270 *((xpvhv_allocated**)xpvhv) = 0;
1273 /* allocate another arena's worth of struct xpvmg */
1280 New(719, xpvmg, PERL_ARENA_SIZE/sizeof(XPVMG), XPVMG);
1281 *((XPVMG**)xpvmg) = PL_xpvmg_arenaroot;
1282 PL_xpvmg_arenaroot = xpvmg;
1284 xpvmgend = &xpvmg[PERL_ARENA_SIZE / sizeof(XPVMG) - 1];
1285 PL_xpvmg_root = ++xpvmg;
1286 while (xpvmg < xpvmgend) {
1287 *((XPVMG**)xpvmg) = xpvmg + 1;
1290 *((XPVMG**)xpvmg) = 0;
1293 /* allocate another arena's worth of struct xpvgv */
1300 New(720, xpvgv, PERL_ARENA_SIZE/sizeof(XPVGV), XPVGV);
1301 *((XPVGV**)xpvgv) = PL_xpvgv_arenaroot;
1302 PL_xpvgv_arenaroot = xpvgv;
1304 xpvgvend = &xpvgv[PERL_ARENA_SIZE / sizeof(XPVGV) - 1];
1305 PL_xpvgv_root = ++xpvgv;
1306 while (xpvgv < xpvgvend) {
1307 *((XPVGV**)xpvgv) = xpvgv + 1;
1310 *((XPVGV**)xpvgv) = 0;
1313 /* allocate another arena's worth of struct xpvlv */
1320 New(720, xpvlv, PERL_ARENA_SIZE/sizeof(XPVLV), XPVLV);
1321 *((XPVLV**)xpvlv) = PL_xpvlv_arenaroot;
1322 PL_xpvlv_arenaroot = xpvlv;
1324 xpvlvend = &xpvlv[PERL_ARENA_SIZE / sizeof(XPVLV) - 1];
1325 PL_xpvlv_root = ++xpvlv;
1326 while (xpvlv < xpvlvend) {
1327 *((XPVLV**)xpvlv) = xpvlv + 1;
1330 *((XPVLV**)xpvlv) = 0;
1333 /* allocate another arena's worth of struct xpvbm */
1340 New(721, xpvbm, PERL_ARENA_SIZE/sizeof(XPVBM), XPVBM);
1341 *((XPVBM**)xpvbm) = PL_xpvbm_arenaroot;
1342 PL_xpvbm_arenaroot = xpvbm;
1344 xpvbmend = &xpvbm[PERL_ARENA_SIZE / sizeof(XPVBM) - 1];
1345 PL_xpvbm_root = ++xpvbm;
1346 while (xpvbm < xpvbmend) {
1347 *((XPVBM**)xpvbm) = xpvbm + 1;
1350 *((XPVBM**)xpvbm) = 0;
1353 /* grab a new NV body from the free list, allocating more if necessary */
1363 PL_xnv_root = *(NV**)xnv;
1365 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1368 /* return an NV body to the free list */
1371 S_del_xnv(pTHX_ XPVNV *p)
1373 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1375 *(NV**)xnv = PL_xnv_root;
1380 /* grab a new struct xpv from the free list, allocating more if necessary */
1390 PL_xpv_root = *(xpv_allocated**)xpv;
1392 /* If xpv_allocated is the same structure as XPV then the two OFFSETs
1393 sum to zero, and the pointer is unchanged. If the allocated structure
1394 is smaller (no initial IV actually allocated) then the net effect is
1395 to subtract the size of the IV from the pointer, to return a new pointer
1396 as if an initial IV were actually allocated. */
1397 return (XPV*)((char*)xpv - STRUCT_OFFSET(XPV, xpv_cur)
1398 + STRUCT_OFFSET(xpv_allocated, xpv_cur));
1401 /* return a struct xpv to the free list */
1404 S_del_xpv(pTHX_ XPV *p)
1407 = (xpv_allocated*)((char*)(p) + STRUCT_OFFSET(XPV, xpv_cur)
1408 - STRUCT_OFFSET(xpv_allocated, xpv_cur));
1410 *(xpv_allocated**)xpv = PL_xpv_root;
1415 /* grab a new struct xpviv from the free list, allocating more if necessary */
1420 xpviv_allocated* xpviv;
1424 xpviv = PL_xpviv_root;
1425 PL_xpviv_root = *(xpviv_allocated**)xpviv;
1427 /* If xpviv_allocated is the same structure as XPVIV then the two OFFSETs
1428 sum to zero, and the pointer is unchanged. If the allocated structure
1429 is smaller (no initial IV actually allocated) then the net effect is
1430 to subtract the size of the IV from the pointer, to return a new pointer
1431 as if an initial IV were actually allocated. */
1432 return (XPVIV*)((char*)xpviv - STRUCT_OFFSET(XPVIV, xpv_cur)
1433 + STRUCT_OFFSET(xpviv_allocated, xpv_cur));
1436 /* return a struct xpviv to the free list */
1439 S_del_xpviv(pTHX_ XPVIV *p)
1441 xpviv_allocated* xpviv
1442 = (xpviv_allocated*)((char*)(p) + STRUCT_OFFSET(XPVIV, xpv_cur)
1443 - STRUCT_OFFSET(xpviv_allocated, xpv_cur));
1445 *(xpviv_allocated**)xpviv = PL_xpviv_root;
1446 PL_xpviv_root = xpviv;
1450 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1459 xpvnv = PL_xpvnv_root;
1460 PL_xpvnv_root = *(XPVNV**)xpvnv;
1465 /* return a struct xpvnv to the free list */
1468 S_del_xpvnv(pTHX_ XPVNV *p)
1471 *(XPVNV**)p = PL_xpvnv_root;
1476 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1485 xpvcv = PL_xpvcv_root;
1486 PL_xpvcv_root = *(XPVCV**)xpvcv;
1491 /* return a struct xpvcv to the free list */
1494 S_del_xpvcv(pTHX_ XPVCV *p)
1497 *(XPVCV**)p = PL_xpvcv_root;
1502 /* grab a new struct xpvav from the free list, allocating more if necessary */
1507 xpvav_allocated* xpvav;
1511 xpvav = PL_xpvav_root;
1512 PL_xpvav_root = *(xpvav_allocated**)xpvav;
1514 return (XPVAV*)((char*)xpvav - STRUCT_OFFSET(XPVAV, xav_fill)
1515 + STRUCT_OFFSET(xpvav_allocated, xav_fill));
1518 /* return a struct xpvav to the free list */
1521 S_del_xpvav(pTHX_ XPVAV *p)
1523 xpvav_allocated* xpvav
1524 = (xpvav_allocated*)((char*)(p) + STRUCT_OFFSET(XPVAV, xav_fill)
1525 - STRUCT_OFFSET(xpvav_allocated, xav_fill));
1527 *(xpvav_allocated**)xpvav = PL_xpvav_root;
1528 PL_xpvav_root = xpvav;
1532 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1537 xpvhv_allocated* xpvhv;
1541 xpvhv = PL_xpvhv_root;
1542 PL_xpvhv_root = *(xpvhv_allocated**)xpvhv;
1544 return (XPVHV*)((char*)xpvhv - STRUCT_OFFSET(XPVHV, xhv_fill)
1545 + STRUCT_OFFSET(xpvhv_allocated, xhv_fill));
1548 /* return a struct xpvhv to the free list */
1551 S_del_xpvhv(pTHX_ XPVHV *p)
1553 xpvhv_allocated* xpvhv
1554 = (xpvhv_allocated*)((char*)(p) + STRUCT_OFFSET(XPVHV, xhv_fill)
1555 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill));
1557 *(xpvhv_allocated**)xpvhv = PL_xpvhv_root;
1558 PL_xpvhv_root = xpvhv;
1562 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1571 xpvmg = PL_xpvmg_root;
1572 PL_xpvmg_root = *(XPVMG**)xpvmg;
1577 /* return a struct xpvmg to the free list */
1580 S_del_xpvmg(pTHX_ XPVMG *p)
1583 *(XPVMG**)p = PL_xpvmg_root;
1588 /* grab a new struct xpvgv from the free list, allocating more if necessary */
1597 xpvgv = PL_xpvgv_root;
1598 PL_xpvgv_root = *(XPVGV**)xpvgv;
1603 /* return a struct xpvgv to the free list */
1606 S_del_xpvgv(pTHX_ XPVGV *p)
1609 *(XPVGV**)p = PL_xpvgv_root;
1614 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1623 xpvlv = PL_xpvlv_root;
1624 PL_xpvlv_root = *(XPVLV**)xpvlv;
1629 /* return a struct xpvlv to the free list */
1632 S_del_xpvlv(pTHX_ XPVLV *p)
1635 *(XPVLV**)p = PL_xpvlv_root;
1640 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1649 xpvbm = PL_xpvbm_root;
1650 PL_xpvbm_root = *(XPVBM**)xpvbm;
1655 /* return a struct xpvbm to the free list */
1658 S_del_xpvbm(pTHX_ XPVBM *p)
1661 *(XPVBM**)p = PL_xpvbm_root;
1666 #define my_safemalloc(s) (void*)safemalloc(s)
1667 #define my_safefree(p) safefree((char*)p)
1671 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1672 #define del_XNV(p) my_safefree(p)
1674 #define new_XPV() my_safemalloc(sizeof(XPV))
1675 #define del_XPV(p) my_safefree(p)
1677 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1678 #define del_XPVIV(p) my_safefree(p)
1680 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1681 #define del_XPVNV(p) my_safefree(p)
1683 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1684 #define del_XPVCV(p) my_safefree(p)
1686 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1687 #define del_XPVAV(p) my_safefree(p)
1689 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1690 #define del_XPVHV(p) my_safefree(p)
1692 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1693 #define del_XPVMG(p) my_safefree(p)
1695 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1696 #define del_XPVGV(p) my_safefree(p)
1698 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1699 #define del_XPVLV(p) my_safefree(p)
1701 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1702 #define del_XPVBM(p) my_safefree(p)
1706 #define new_XNV() (void*)new_xnv()
1707 #define del_XNV(p) del_xnv((XPVNV*) p)
1709 #define new_XPV() (void*)new_xpv()
1710 #define del_XPV(p) del_xpv((XPV *)p)
1712 #define new_XPVIV() (void*)new_xpviv()
1713 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1715 #define new_XPVNV() (void*)new_xpvnv()
1716 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1718 #define new_XPVCV() (void*)new_xpvcv()
1719 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1721 #define new_XPVAV() (void*)new_xpvav()
1722 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1724 #define new_XPVHV() (void*)new_xpvhv()
1725 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1727 #define new_XPVMG() (void*)new_xpvmg()
1728 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1730 #define new_XPVGV() (void*)new_xpvgv()
1731 #define del_XPVGV(p) del_xpvgv((XPVGV *)p)
1733 #define new_XPVLV() (void*)new_xpvlv()
1734 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1736 #define new_XPVBM() (void*)new_xpvbm()
1737 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1741 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1742 #define del_XPVFM(p) my_safefree(p)
1744 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1745 #define del_XPVIO(p) my_safefree(p)
1748 =for apidoc sv_upgrade
1750 Upgrade an SV to a more complex form. Generally adds a new body type to the
1751 SV, then copies across as much information as possible from the old body.
1752 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1758 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1769 if (mt != SVt_PV && SvIsCOW(sv)) {
1770 sv_force_normal_flags(sv, 0);
1773 if (SvTYPE(sv) == mt)
1784 switch (SvTYPE(sv)) {
1791 else if (mt < SVt_PVIV)
1801 pv = (char*)SvRV(sv);
1810 else if (mt == SVt_NV)
1818 del_XPVIV(SvANY(sv));
1826 del_XPVNV(SvANY(sv));
1829 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1830 there's no way that it can be safely upgraded, because perl.c
1831 expects to Safefree(SvANY(PL_mess_sv)) */
1832 assert(sv != PL_mess_sv);
1833 /* This flag bit is used to mean other things in other scalar types.
1834 Given that it only has meaning inside the pad, it shouldn't be set
1835 on anything that can get upgraded. */
1836 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1842 magic = SvMAGIC(sv);
1843 stash = SvSTASH(sv);
1844 del_XPVMG(SvANY(sv));
1847 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1850 SvFLAGS(sv) &= ~SVTYPEMASK;
1855 Perl_croak(aTHX_ "Can't upgrade to undef");
1857 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1861 SvANY(sv) = new_XNV();
1865 SvANY(sv) = &sv->sv_u.svu_rv;
1866 SvRV_set(sv, (SV*)pv);
1869 SvANY(sv) = new_XPVHV();
1872 HvTOTALKEYS(sv) = 0;
1874 /* Fall through... */
1877 SvANY(sv) = new_XPVAV();
1884 /* XXX? Only SVt_NULL is ever upgraded to AV or HV? */
1886 /* FIXME. Should be able to remove all this if()... if the above
1887 assertion is genuinely always true. */
1890 SvFLAGS(sv) &= ~SVf_OOK;
1893 SvPV_set(sv, (char*)0);
1894 SvMAGIC_set(sv, magic);
1895 SvSTASH_set(sv, stash);
1899 SvANY(sv) = new_XPVIO();
1900 Zero(SvANY(sv), 1, XPVIO);
1901 IoPAGE_LEN(sv) = 60;
1902 goto set_magic_common;
1904 SvANY(sv) = new_XPVFM();
1905 Zero(SvANY(sv), 1, XPVFM);
1906 goto set_magic_common;
1908 SvANY(sv) = new_XPVBM();
1912 goto set_magic_common;
1914 SvANY(sv) = new_XPVGV();
1920 goto set_magic_common;
1922 SvANY(sv) = new_XPVCV();
1923 Zero(SvANY(sv), 1, XPVCV);
1924 goto set_magic_common;
1926 SvANY(sv) = new_XPVLV();
1939 SvANY(sv) = new_XPVMG();
1942 SvMAGIC_set(sv, magic);
1943 SvSTASH_set(sv, stash);
1947 SvANY(sv) = new_XPVNV();
1953 SvANY(sv) = new_XPVIV();
1962 SvANY(sv) = new_XPV();
1973 =for apidoc sv_backoff
1975 Remove any string offset. You should normally use the C<SvOOK_off> macro
1982 Perl_sv_backoff(pTHX_ register SV *sv)
1985 assert(SvTYPE(sv) != SVt_PVHV);
1986 assert(SvTYPE(sv) != SVt_PVAV);
1988 char *s = SvPVX(sv);
1989 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1990 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1992 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1994 SvFLAGS(sv) &= ~SVf_OOK;
2001 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2002 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2003 Use the C<SvGROW> wrapper instead.
2009 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2013 #ifdef HAS_64K_LIMIT
2014 if (newlen >= 0x10000) {
2015 PerlIO_printf(Perl_debug_log,
2016 "Allocation too large: %"UVxf"\n", (UV)newlen);
2019 #endif /* HAS_64K_LIMIT */
2022 if (SvTYPE(sv) < SVt_PV) {
2023 sv_upgrade(sv, SVt_PV);
2026 else if (SvOOK(sv)) { /* pv is offset? */
2029 if (newlen > SvLEN(sv))
2030 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2031 #ifdef HAS_64K_LIMIT
2032 if (newlen >= 0x10000)
2039 if (newlen > SvLEN(sv)) { /* need more room? */
2040 if (SvLEN(sv) && s) {
2042 const STRLEN l = malloced_size((void*)SvPVX(sv));
2048 Renew(s,newlen,char);
2051 New(703, s, newlen, char);
2052 if (SvPVX(sv) && SvCUR(sv)) {
2053 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2057 SvLEN_set(sv, newlen);
2063 =for apidoc sv_setiv
2065 Copies an integer into the given SV, upgrading first if necessary.
2066 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2072 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2074 SV_CHECK_THINKFIRST_COW_DROP(sv);
2075 switch (SvTYPE(sv)) {
2077 sv_upgrade(sv, SVt_IV);
2080 sv_upgrade(sv, SVt_PVNV);
2084 sv_upgrade(sv, SVt_PVIV);
2093 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2096 (void)SvIOK_only(sv); /* validate number */
2102 =for apidoc sv_setiv_mg
2104 Like C<sv_setiv>, but also handles 'set' magic.
2110 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2117 =for apidoc sv_setuv
2119 Copies an unsigned integer into the given SV, upgrading first if necessary.
2120 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2126 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2128 /* With these two if statements:
2129 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2132 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2134 If you wish to remove them, please benchmark to see what the effect is
2136 if (u <= (UV)IV_MAX) {
2137 sv_setiv(sv, (IV)u);
2146 =for apidoc sv_setuv_mg
2148 Like C<sv_setuv>, but also handles 'set' magic.
2154 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2156 /* With these two if statements:
2157 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2160 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2162 If you wish to remove them, please benchmark to see what the effect is
2164 if (u <= (UV)IV_MAX) {
2165 sv_setiv(sv, (IV)u);
2175 =for apidoc sv_setnv
2177 Copies a double into the given SV, upgrading first if necessary.
2178 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2184 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2186 SV_CHECK_THINKFIRST_COW_DROP(sv);
2187 switch (SvTYPE(sv)) {
2190 sv_upgrade(sv, SVt_NV);
2195 sv_upgrade(sv, SVt_PVNV);
2204 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2208 (void)SvNOK_only(sv); /* validate number */
2213 =for apidoc sv_setnv_mg
2215 Like C<sv_setnv>, but also handles 'set' magic.
2221 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2227 /* Print an "isn't numeric" warning, using a cleaned-up,
2228 * printable version of the offending string
2232 S_not_a_number(pTHX_ SV *sv)
2239 dsv = sv_2mortal(newSVpv("", 0));
2240 pv = sv_uni_display(dsv, sv, 10, 0);
2243 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2244 /* each *s can expand to 4 chars + "...\0",
2245 i.e. need room for 8 chars */
2248 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2250 if (ch & 128 && !isPRINT_LC(ch)) {
2259 else if (ch == '\r') {
2263 else if (ch == '\f') {
2267 else if (ch == '\\') {
2271 else if (ch == '\0') {
2275 else if (isPRINT_LC(ch))
2292 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2293 "Argument \"%s\" isn't numeric in %s", pv,
2296 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2297 "Argument \"%s\" isn't numeric", pv);
2301 =for apidoc looks_like_number
2303 Test if the content of an SV looks like a number (or is a number).
2304 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2305 non-numeric warning), even if your atof() doesn't grok them.
2311 Perl_looks_like_number(pTHX_ SV *sv)
2313 register const char *sbegin;
2320 else if (SvPOKp(sv))
2321 sbegin = SvPV(sv, len);
2323 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2324 return grok_number(sbegin, len, NULL);
2327 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2328 until proven guilty, assume that things are not that bad... */
2333 As 64 bit platforms often have an NV that doesn't preserve all bits of
2334 an IV (an assumption perl has been based on to date) it becomes necessary
2335 to remove the assumption that the NV always carries enough precision to
2336 recreate the IV whenever needed, and that the NV is the canonical form.
2337 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2338 precision as a side effect of conversion (which would lead to insanity
2339 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2340 1) to distinguish between IV/UV/NV slots that have cached a valid
2341 conversion where precision was lost and IV/UV/NV slots that have a
2342 valid conversion which has lost no precision
2343 2) to ensure that if a numeric conversion to one form is requested that
2344 would lose precision, the precise conversion (or differently
2345 imprecise conversion) is also performed and cached, to prevent
2346 requests for different numeric formats on the same SV causing
2347 lossy conversion chains. (lossless conversion chains are perfectly
2352 SvIOKp is true if the IV slot contains a valid value
2353 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2354 SvNOKp is true if the NV slot contains a valid value
2355 SvNOK is true only if the NV value is accurate
2358 while converting from PV to NV, check to see if converting that NV to an
2359 IV(or UV) would lose accuracy over a direct conversion from PV to
2360 IV(or UV). If it would, cache both conversions, return NV, but mark
2361 SV as IOK NOKp (ie not NOK).
2363 While converting from PV to IV, check to see if converting that IV to an
2364 NV would lose accuracy over a direct conversion from PV to NV. If it
2365 would, cache both conversions, flag similarly.
2367 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2368 correctly because if IV & NV were set NV *always* overruled.
2369 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2370 changes - now IV and NV together means that the two are interchangeable:
2371 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2373 The benefit of this is that operations such as pp_add know that if
2374 SvIOK is true for both left and right operands, then integer addition
2375 can be used instead of floating point (for cases where the result won't
2376 overflow). Before, floating point was always used, which could lead to
2377 loss of precision compared with integer addition.
2379 * making IV and NV equal status should make maths accurate on 64 bit
2381 * may speed up maths somewhat if pp_add and friends start to use
2382 integers when possible instead of fp. (Hopefully the overhead in
2383 looking for SvIOK and checking for overflow will not outweigh the
2384 fp to integer speedup)
2385 * will slow down integer operations (callers of SvIV) on "inaccurate"
2386 values, as the change from SvIOK to SvIOKp will cause a call into
2387 sv_2iv each time rather than a macro access direct to the IV slot
2388 * should speed up number->string conversion on integers as IV is
2389 favoured when IV and NV are equally accurate
2391 ####################################################################
2392 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2393 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2394 On the other hand, SvUOK is true iff UV.
2395 ####################################################################
2397 Your mileage will vary depending your CPU's relative fp to integer
2401 #ifndef NV_PRESERVES_UV
2402 # define IS_NUMBER_UNDERFLOW_IV 1
2403 # define IS_NUMBER_UNDERFLOW_UV 2
2404 # define IS_NUMBER_IV_AND_UV 2
2405 # define IS_NUMBER_OVERFLOW_IV 4
2406 # define IS_NUMBER_OVERFLOW_UV 5
2408 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2410 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2412 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2414 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));
2415 if (SvNVX(sv) < (NV)IV_MIN) {
2416 (void)SvIOKp_on(sv);
2418 SvIV_set(sv, IV_MIN);
2419 return IS_NUMBER_UNDERFLOW_IV;
2421 if (SvNVX(sv) > (NV)UV_MAX) {
2422 (void)SvIOKp_on(sv);
2425 SvUV_set(sv, UV_MAX);
2426 return IS_NUMBER_OVERFLOW_UV;
2428 (void)SvIOKp_on(sv);
2430 /* Can't use strtol etc to convert this string. (See truth table in
2432 if (SvNVX(sv) <= (UV)IV_MAX) {
2433 SvIV_set(sv, I_V(SvNVX(sv)));
2434 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2435 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2437 /* Integer is imprecise. NOK, IOKp */
2439 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2442 SvUV_set(sv, U_V(SvNVX(sv)));
2443 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2444 if (SvUVX(sv) == UV_MAX) {
2445 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2446 possibly be preserved by NV. Hence, it must be overflow.
2448 return IS_NUMBER_OVERFLOW_UV;
2450 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2452 /* Integer is imprecise. NOK, IOKp */
2454 return IS_NUMBER_OVERFLOW_IV;
2456 #endif /* !NV_PRESERVES_UV*/
2458 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2459 * this function provided for binary compatibility only
2463 Perl_sv_2iv(pTHX_ register SV *sv)
2465 return sv_2iv_flags(sv, SV_GMAGIC);
2469 =for apidoc sv_2iv_flags
2471 Return the integer value of an SV, doing any necessary string
2472 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2473 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2479 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2483 if (SvGMAGICAL(sv)) {
2484 if (flags & SV_GMAGIC)
2489 return I_V(SvNVX(sv));
2491 if (SvPOKp(sv) && SvLEN(sv))
2494 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2495 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2501 if (SvTHINKFIRST(sv)) {
2504 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2505 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2506 return SvIV(tmpstr);
2507 return PTR2IV(SvRV(sv));
2510 sv_force_normal_flags(sv, 0);
2512 if (SvREADONLY(sv) && !SvOK(sv)) {
2513 if (ckWARN(WARN_UNINITIALIZED))
2520 return (IV)(SvUVX(sv));
2527 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2528 * without also getting a cached IV/UV from it at the same time
2529 * (ie PV->NV conversion should detect loss of accuracy and cache
2530 * IV or UV at same time to avoid this. NWC */
2532 if (SvTYPE(sv) == SVt_NV)
2533 sv_upgrade(sv, SVt_PVNV);
2535 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2536 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2537 certainly cast into the IV range at IV_MAX, whereas the correct
2538 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2540 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2541 SvIV_set(sv, I_V(SvNVX(sv)));
2542 if (SvNVX(sv) == (NV) SvIVX(sv)
2543 #ifndef NV_PRESERVES_UV
2544 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2545 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2546 /* Don't flag it as "accurately an integer" if the number
2547 came from a (by definition imprecise) NV operation, and
2548 we're outside the range of NV integer precision */
2551 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2552 DEBUG_c(PerlIO_printf(Perl_debug_log,
2553 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2559 /* IV not precise. No need to convert from PV, as NV
2560 conversion would already have cached IV if it detected
2561 that PV->IV would be better than PV->NV->IV
2562 flags already correct - don't set public IOK. */
2563 DEBUG_c(PerlIO_printf(Perl_debug_log,
2564 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2569 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2570 but the cast (NV)IV_MIN rounds to a the value less (more
2571 negative) than IV_MIN which happens to be equal to SvNVX ??
2572 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2573 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2574 (NV)UVX == NVX are both true, but the values differ. :-(
2575 Hopefully for 2s complement IV_MIN is something like
2576 0x8000000000000000 which will be exact. NWC */
2579 SvUV_set(sv, U_V(SvNVX(sv)));
2581 (SvNVX(sv) == (NV) SvUVX(sv))
2582 #ifndef NV_PRESERVES_UV
2583 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2584 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2585 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2586 /* Don't flag it as "accurately an integer" if the number
2587 came from a (by definition imprecise) NV operation, and
2588 we're outside the range of NV integer precision */
2594 DEBUG_c(PerlIO_printf(Perl_debug_log,
2595 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2599 return (IV)SvUVX(sv);
2602 else if (SvPOKp(sv) && SvLEN(sv)) {
2604 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2605 /* We want to avoid a possible problem when we cache an IV which
2606 may be later translated to an NV, and the resulting NV is not
2607 the same as the direct translation of the initial string
2608 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2609 be careful to ensure that the value with the .456 is around if the
2610 NV value is requested in the future).
2612 This means that if we cache such an IV, we need to cache the
2613 NV as well. Moreover, we trade speed for space, and do not
2614 cache the NV if we are sure it's not needed.
2617 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2618 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2619 == IS_NUMBER_IN_UV) {
2620 /* It's definitely an integer, only upgrade to PVIV */
2621 if (SvTYPE(sv) < SVt_PVIV)
2622 sv_upgrade(sv, SVt_PVIV);
2624 } else if (SvTYPE(sv) < SVt_PVNV)
2625 sv_upgrade(sv, SVt_PVNV);
2627 /* If NV preserves UV then we only use the UV value if we know that
2628 we aren't going to call atof() below. If NVs don't preserve UVs
2629 then the value returned may have more precision than atof() will
2630 return, even though value isn't perfectly accurate. */
2631 if ((numtype & (IS_NUMBER_IN_UV
2632 #ifdef NV_PRESERVES_UV
2635 )) == IS_NUMBER_IN_UV) {
2636 /* This won't turn off the public IOK flag if it was set above */
2637 (void)SvIOKp_on(sv);
2639 if (!(numtype & IS_NUMBER_NEG)) {
2641 if (value <= (UV)IV_MAX) {
2642 SvIV_set(sv, (IV)value);
2644 SvUV_set(sv, value);
2648 /* 2s complement assumption */
2649 if (value <= (UV)IV_MIN) {
2650 SvIV_set(sv, -(IV)value);
2652 /* Too negative for an IV. This is a double upgrade, but
2653 I'm assuming it will be rare. */
2654 if (SvTYPE(sv) < SVt_PVNV)
2655 sv_upgrade(sv, SVt_PVNV);
2659 SvNV_set(sv, -(NV)value);
2660 SvIV_set(sv, IV_MIN);
2664 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2665 will be in the previous block to set the IV slot, and the next
2666 block to set the NV slot. So no else here. */
2668 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2669 != IS_NUMBER_IN_UV) {
2670 /* It wasn't an (integer that doesn't overflow the UV). */
2671 SvNV_set(sv, Atof(SvPVX(sv)));
2673 if (! numtype && ckWARN(WARN_NUMERIC))
2676 #if defined(USE_LONG_DOUBLE)
2677 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2678 PTR2UV(sv), SvNVX(sv)));
2680 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2681 PTR2UV(sv), SvNVX(sv)));
2685 #ifdef NV_PRESERVES_UV
2686 (void)SvIOKp_on(sv);
2688 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2689 SvIV_set(sv, I_V(SvNVX(sv)));
2690 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2693 /* Integer is imprecise. NOK, IOKp */
2695 /* UV will not work better than IV */
2697 if (SvNVX(sv) > (NV)UV_MAX) {
2699 /* Integer is inaccurate. NOK, IOKp, is UV */
2700 SvUV_set(sv, UV_MAX);
2703 SvUV_set(sv, U_V(SvNVX(sv)));
2704 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2705 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2709 /* Integer is imprecise. NOK, IOKp, is UV */
2715 #else /* NV_PRESERVES_UV */
2716 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2717 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2718 /* The IV slot will have been set from value returned by
2719 grok_number above. The NV slot has just been set using
2722 assert (SvIOKp(sv));
2724 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2725 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2726 /* Small enough to preserve all bits. */
2727 (void)SvIOKp_on(sv);
2729 SvIV_set(sv, I_V(SvNVX(sv)));
2730 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2732 /* Assumption: first non-preserved integer is < IV_MAX,
2733 this NV is in the preserved range, therefore: */
2734 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2736 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);
2740 0 0 already failed to read UV.
2741 0 1 already failed to read UV.
2742 1 0 you won't get here in this case. IV/UV
2743 slot set, public IOK, Atof() unneeded.
2744 1 1 already read UV.
2745 so there's no point in sv_2iuv_non_preserve() attempting
2746 to use atol, strtol, strtoul etc. */
2747 if (sv_2iuv_non_preserve (sv, numtype)
2748 >= IS_NUMBER_OVERFLOW_IV)
2752 #endif /* NV_PRESERVES_UV */
2755 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2757 if (SvTYPE(sv) < SVt_IV)
2758 /* Typically the caller expects that sv_any is not NULL now. */
2759 sv_upgrade(sv, SVt_IV);
2762 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2763 PTR2UV(sv),SvIVX(sv)));
2764 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2767 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2768 * this function provided for binary compatibility only
2772 Perl_sv_2uv(pTHX_ register SV *sv)
2774 return sv_2uv_flags(sv, SV_GMAGIC);
2778 =for apidoc sv_2uv_flags
2780 Return the unsigned integer value of an SV, doing any necessary string
2781 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2782 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2788 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2792 if (SvGMAGICAL(sv)) {
2793 if (flags & SV_GMAGIC)
2798 return U_V(SvNVX(sv));
2799 if (SvPOKp(sv) && SvLEN(sv))
2802 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2803 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2809 if (SvTHINKFIRST(sv)) {
2812 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2813 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2814 return SvUV(tmpstr);
2815 return PTR2UV(SvRV(sv));
2818 sv_force_normal_flags(sv, 0);
2820 if (SvREADONLY(sv) && !SvOK(sv)) {
2821 if (ckWARN(WARN_UNINITIALIZED))
2831 return (UV)SvIVX(sv);
2835 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2836 * without also getting a cached IV/UV from it at the same time
2837 * (ie PV->NV conversion should detect loss of accuracy and cache
2838 * IV or UV at same time to avoid this. */
2839 /* IV-over-UV optimisation - choose to cache IV if possible */
2841 if (SvTYPE(sv) == SVt_NV)
2842 sv_upgrade(sv, SVt_PVNV);
2844 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2845 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2846 SvIV_set(sv, I_V(SvNVX(sv)));
2847 if (SvNVX(sv) == (NV) SvIVX(sv)
2848 #ifndef NV_PRESERVES_UV
2849 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2850 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2851 /* Don't flag it as "accurately an integer" if the number
2852 came from a (by definition imprecise) NV operation, and
2853 we're outside the range of NV integer precision */
2856 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2857 DEBUG_c(PerlIO_printf(Perl_debug_log,
2858 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2864 /* IV not precise. No need to convert from PV, as NV
2865 conversion would already have cached IV if it detected
2866 that PV->IV would be better than PV->NV->IV
2867 flags already correct - don't set public IOK. */
2868 DEBUG_c(PerlIO_printf(Perl_debug_log,
2869 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2874 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2875 but the cast (NV)IV_MIN rounds to a the value less (more
2876 negative) than IV_MIN which happens to be equal to SvNVX ??
2877 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2878 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2879 (NV)UVX == NVX are both true, but the values differ. :-(
2880 Hopefully for 2s complement IV_MIN is something like
2881 0x8000000000000000 which will be exact. NWC */
2884 SvUV_set(sv, U_V(SvNVX(sv)));
2886 (SvNVX(sv) == (NV) SvUVX(sv))
2887 #ifndef NV_PRESERVES_UV
2888 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2889 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2890 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2891 /* Don't flag it as "accurately an integer" if the number
2892 came from a (by definition imprecise) NV operation, and
2893 we're outside the range of NV integer precision */
2898 DEBUG_c(PerlIO_printf(Perl_debug_log,
2899 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2905 else if (SvPOKp(sv) && SvLEN(sv)) {
2907 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2909 /* We want to avoid a possible problem when we cache a UV which
2910 may be later translated to an NV, and the resulting NV is not
2911 the translation of the initial data.
2913 This means that if we cache such a UV, we need to cache the
2914 NV as well. Moreover, we trade speed for space, and do not
2915 cache the NV if not needed.
2918 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2919 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2920 == IS_NUMBER_IN_UV) {
2921 /* It's definitely an integer, only upgrade to PVIV */
2922 if (SvTYPE(sv) < SVt_PVIV)
2923 sv_upgrade(sv, SVt_PVIV);
2925 } else if (SvTYPE(sv) < SVt_PVNV)
2926 sv_upgrade(sv, SVt_PVNV);
2928 /* If NV preserves UV then we only use the UV value if we know that
2929 we aren't going to call atof() below. If NVs don't preserve UVs
2930 then the value returned may have more precision than atof() will
2931 return, even though it isn't accurate. */
2932 if ((numtype & (IS_NUMBER_IN_UV
2933 #ifdef NV_PRESERVES_UV
2936 )) == IS_NUMBER_IN_UV) {
2937 /* This won't turn off the public IOK flag if it was set above */
2938 (void)SvIOKp_on(sv);
2940 if (!(numtype & IS_NUMBER_NEG)) {
2942 if (value <= (UV)IV_MAX) {
2943 SvIV_set(sv, (IV)value);
2945 /* it didn't overflow, and it was positive. */
2946 SvUV_set(sv, value);
2950 /* 2s complement assumption */
2951 if (value <= (UV)IV_MIN) {
2952 SvIV_set(sv, -(IV)value);
2954 /* Too negative for an IV. This is a double upgrade, but
2955 I'm assuming it will be rare. */
2956 if (SvTYPE(sv) < SVt_PVNV)
2957 sv_upgrade(sv, SVt_PVNV);
2961 SvNV_set(sv, -(NV)value);
2962 SvIV_set(sv, IV_MIN);
2967 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2968 != IS_NUMBER_IN_UV) {
2969 /* It wasn't an integer, or it overflowed the UV. */
2970 SvNV_set(sv, Atof(SvPVX(sv)));
2972 if (! numtype && ckWARN(WARN_NUMERIC))
2975 #if defined(USE_LONG_DOUBLE)
2976 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2977 PTR2UV(sv), SvNVX(sv)));
2979 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2980 PTR2UV(sv), SvNVX(sv)));
2983 #ifdef NV_PRESERVES_UV
2984 (void)SvIOKp_on(sv);
2986 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2987 SvIV_set(sv, I_V(SvNVX(sv)));
2988 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2991 /* Integer is imprecise. NOK, IOKp */
2993 /* UV will not work better than IV */
2995 if (SvNVX(sv) > (NV)UV_MAX) {
2997 /* Integer is inaccurate. NOK, IOKp, is UV */
2998 SvUV_set(sv, UV_MAX);
3001 SvUV_set(sv, U_V(SvNVX(sv)));
3002 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3003 NV preservse UV so can do correct comparison. */
3004 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3008 /* Integer is imprecise. NOK, IOKp, is UV */
3013 #else /* NV_PRESERVES_UV */
3014 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3015 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3016 /* The UV slot will have been set from value returned by
3017 grok_number above. The NV slot has just been set using
3020 assert (SvIOKp(sv));
3022 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3023 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3024 /* Small enough to preserve all bits. */
3025 (void)SvIOKp_on(sv);
3027 SvIV_set(sv, I_V(SvNVX(sv)));
3028 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3030 /* Assumption: first non-preserved integer is < IV_MAX,
3031 this NV is in the preserved range, therefore: */
3032 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3034 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);
3037 sv_2iuv_non_preserve (sv, numtype);
3039 #endif /* NV_PRESERVES_UV */
3043 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3044 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3047 if (SvTYPE(sv) < SVt_IV)
3048 /* Typically the caller expects that sv_any is not NULL now. */
3049 sv_upgrade(sv, SVt_IV);
3053 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3054 PTR2UV(sv),SvUVX(sv)));
3055 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3061 Return the num value of an SV, doing any necessary string or integer
3062 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3069 Perl_sv_2nv(pTHX_ register SV *sv)
3073 if (SvGMAGICAL(sv)) {
3077 if (SvPOKp(sv) && SvLEN(sv)) {
3078 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3079 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
3081 return Atof(SvPVX(sv));
3085 return (NV)SvUVX(sv);
3087 return (NV)SvIVX(sv);
3090 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3091 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3097 if (SvTHINKFIRST(sv)) {
3100 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3101 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3102 return SvNV(tmpstr);
3103 return PTR2NV(SvRV(sv));
3106 sv_force_normal_flags(sv, 0);
3108 if (SvREADONLY(sv) && !SvOK(sv)) {
3109 if (ckWARN(WARN_UNINITIALIZED))
3114 if (SvTYPE(sv) < SVt_NV) {
3115 if (SvTYPE(sv) == SVt_IV)
3116 sv_upgrade(sv, SVt_PVNV);
3118 sv_upgrade(sv, SVt_NV);
3119 #ifdef USE_LONG_DOUBLE
3121 STORE_NUMERIC_LOCAL_SET_STANDARD();
3122 PerlIO_printf(Perl_debug_log,
3123 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3124 PTR2UV(sv), SvNVX(sv));
3125 RESTORE_NUMERIC_LOCAL();
3129 STORE_NUMERIC_LOCAL_SET_STANDARD();
3130 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3131 PTR2UV(sv), SvNVX(sv));
3132 RESTORE_NUMERIC_LOCAL();
3136 else if (SvTYPE(sv) < SVt_PVNV)
3137 sv_upgrade(sv, SVt_PVNV);
3142 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3143 #ifdef NV_PRESERVES_UV
3146 /* Only set the public NV OK flag if this NV preserves the IV */
3147 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3148 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3149 : (SvIVX(sv) == I_V(SvNVX(sv))))
3155 else if (SvPOKp(sv) && SvLEN(sv)) {
3157 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3158 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3160 #ifdef NV_PRESERVES_UV
3161 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3162 == IS_NUMBER_IN_UV) {
3163 /* It's definitely an integer */
3164 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3166 SvNV_set(sv, Atof(SvPVX(sv)));
3169 SvNV_set(sv, Atof(SvPVX(sv)));
3170 /* Only set the public NV OK flag if this NV preserves the value in
3171 the PV at least as well as an IV/UV would.
3172 Not sure how to do this 100% reliably. */
3173 /* if that shift count is out of range then Configure's test is
3174 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3176 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3177 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3178 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3179 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3180 /* Can't use strtol etc to convert this string, so don't try.
3181 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3184 /* value has been set. It may not be precise. */
3185 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3186 /* 2s complement assumption for (UV)IV_MIN */
3187 SvNOK_on(sv); /* Integer is too negative. */
3192 if (numtype & IS_NUMBER_NEG) {
3193 SvIV_set(sv, -(IV)value);
3194 } else if (value <= (UV)IV_MAX) {
3195 SvIV_set(sv, (IV)value);
3197 SvUV_set(sv, value);
3201 if (numtype & IS_NUMBER_NOT_INT) {
3202 /* I believe that even if the original PV had decimals,
3203 they are lost beyond the limit of the FP precision.
3204 However, neither is canonical, so both only get p
3205 flags. NWC, 2000/11/25 */
3206 /* Both already have p flags, so do nothing */
3209 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3210 if (SvIVX(sv) == I_V(nv)) {
3215 /* It had no "." so it must be integer. */
3218 /* between IV_MAX and NV(UV_MAX).
3219 Could be slightly > UV_MAX */
3221 if (numtype & IS_NUMBER_NOT_INT) {
3222 /* UV and NV both imprecise. */
3224 UV nv_as_uv = U_V(nv);
3226 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3237 #endif /* NV_PRESERVES_UV */
3240 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3242 if (SvTYPE(sv) < SVt_NV)
3243 /* Typically the caller expects that sv_any is not NULL now. */
3244 /* XXX Ilya implies that this is a bug in callers that assume this
3245 and ideally should be fixed. */
3246 sv_upgrade(sv, SVt_NV);
3249 #if defined(USE_LONG_DOUBLE)
3251 STORE_NUMERIC_LOCAL_SET_STANDARD();
3252 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3253 PTR2UV(sv), SvNVX(sv));
3254 RESTORE_NUMERIC_LOCAL();
3258 STORE_NUMERIC_LOCAL_SET_STANDARD();
3259 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3260 PTR2UV(sv), SvNVX(sv));
3261 RESTORE_NUMERIC_LOCAL();
3267 /* asIV(): extract an integer from the string value of an SV.
3268 * Caller must validate PVX */
3271 S_asIV(pTHX_ SV *sv)
3274 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3276 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3277 == IS_NUMBER_IN_UV) {
3278 /* It's definitely an integer */
3279 if (numtype & IS_NUMBER_NEG) {
3280 if (value < (UV)IV_MIN)
3283 if (value < (UV)IV_MAX)
3288 if (ckWARN(WARN_NUMERIC))
3291 return I_V(Atof(SvPVX(sv)));
3294 /* asUV(): extract an unsigned integer from the string value of an SV
3295 * Caller must validate PVX */
3298 S_asUV(pTHX_ SV *sv)
3301 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
3303 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3304 == IS_NUMBER_IN_UV) {
3305 /* It's definitely an integer */
3306 if (!(numtype & IS_NUMBER_NEG))
3310 if (ckWARN(WARN_NUMERIC))
3313 return U_V(Atof(SvPVX(sv)));
3317 =for apidoc sv_2pv_nolen
3319 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3320 use the macro wrapper C<SvPV_nolen(sv)> instead.
3325 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3328 return sv_2pv(sv, &n_a);
3331 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3332 * UV as a string towards the end of buf, and return pointers to start and
3335 * We assume that buf is at least TYPE_CHARS(UV) long.
3339 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3341 char *ptr = buf + TYPE_CHARS(UV);
3355 *--ptr = '0' + (char)(uv % 10);
3363 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3364 * this function provided for binary compatibility only
3368 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3370 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3374 =for apidoc sv_2pv_flags
3376 Returns a pointer to the string value of an SV, and sets *lp to its length.
3377 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3379 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3380 usually end up here too.
3386 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3391 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3392 char *tmpbuf = tbuf;
3398 if (SvGMAGICAL(sv)) {
3399 if (flags & SV_GMAGIC)
3407 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3409 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3414 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3419 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3420 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3427 if (SvTHINKFIRST(sv)) {
3430 register const char *typestr;
3431 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3432 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3433 char *pv = SvPV(tmpstr, *lp);
3443 typestr = "NULLREF";
3447 switch (SvTYPE(sv)) {
3449 if ( ((SvFLAGS(sv) &
3450 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3451 == (SVs_OBJECT|SVs_SMG))
3452 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3453 const regexp *re = (regexp *)mg->mg_obj;
3456 const char *fptr = "msix";
3461 char need_newline = 0;
3462 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3464 while((ch = *fptr++)) {
3466 reflags[left++] = ch;
3469 reflags[right--] = ch;
3474 reflags[left] = '-';
3478 mg->mg_len = re->prelen + 4 + left;
3480 * If /x was used, we have to worry about a regex
3481 * ending with a comment later being embedded
3482 * within another regex. If so, we don't want this
3483 * regex's "commentization" to leak out to the
3484 * right part of the enclosing regex, we must cap
3485 * it with a newline.
3487 * So, if /x was used, we scan backwards from the
3488 * end of the regex. If we find a '#' before we
3489 * find a newline, we need to add a newline
3490 * ourself. If we find a '\n' first (or if we
3491 * don't find '#' or '\n'), we don't need to add
3492 * anything. -jfriedl
3494 if (PMf_EXTENDED & re->reganch)
3496 const char *endptr = re->precomp + re->prelen;
3497 while (endptr >= re->precomp)
3499 const char c = *(endptr--);
3501 break; /* don't need another */
3503 /* we end while in a comment, so we
3505 mg->mg_len++; /* save space for it */
3506 need_newline = 1; /* note to add it */
3512 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3513 Copy("(?", mg->mg_ptr, 2, char);
3514 Copy(reflags, mg->mg_ptr+2, left, char);
3515 Copy(":", mg->mg_ptr+left+2, 1, char);
3516 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3518 mg->mg_ptr[mg->mg_len - 2] = '\n';
3519 mg->mg_ptr[mg->mg_len - 1] = ')';
3520 mg->mg_ptr[mg->mg_len] = 0;
3522 PL_reginterp_cnt += re->program[0].next_off;
3524 if (re->reganch & ROPT_UTF8)
3539 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3540 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3541 /* tied lvalues should appear to be
3542 * scalars for backwards compatitbility */
3543 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3544 ? "SCALAR" : "LVALUE"; break;
3545 case SVt_PVAV: typestr = "ARRAY"; break;
3546 case SVt_PVHV: typestr = "HASH"; break;
3547 case SVt_PVCV: typestr = "CODE"; break;
3548 case SVt_PVGV: typestr = "GLOB"; break;
3549 case SVt_PVFM: typestr = "FORMAT"; break;
3550 case SVt_PVIO: typestr = "IO"; break;
3551 default: typestr = "UNKNOWN"; break;
3555 const char *name = HvNAME_get(SvSTASH(sv));
3556 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3557 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3560 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3563 *lp = strlen(typestr);
3564 return (char *)typestr;
3566 if (SvREADONLY(sv) && !SvOK(sv)) {
3567 if (ckWARN(WARN_UNINITIALIZED))
3573 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3574 /* I'm assuming that if both IV and NV are equally valid then
3575 converting the IV is going to be more efficient */
3576 const U32 isIOK = SvIOK(sv);
3577 const U32 isUIOK = SvIsUV(sv);
3578 char buf[TYPE_CHARS(UV)];
3581 if (SvTYPE(sv) < SVt_PVIV)
3582 sv_upgrade(sv, SVt_PVIV);
3584 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3586 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3587 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3588 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3589 SvCUR_set(sv, ebuf - ptr);
3599 else if (SvNOKp(sv)) {
3600 if (SvTYPE(sv) < SVt_PVNV)
3601 sv_upgrade(sv, SVt_PVNV);
3602 /* The +20 is pure guesswork. Configure test needed. --jhi */
3603 SvGROW(sv, NV_DIG + 20);
3605 olderrno = errno; /* some Xenix systems wipe out errno here */
3607 if (SvNVX(sv) == 0.0)
3608 (void)strcpy(s,"0");
3612 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3615 #ifdef FIXNEGATIVEZERO
3616 if (*s == '-' && s[1] == '0' && !s[2])
3626 if (ckWARN(WARN_UNINITIALIZED)
3627 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3630 if (SvTYPE(sv) < SVt_PV)
3631 /* Typically the caller expects that sv_any is not NULL now. */
3632 sv_upgrade(sv, SVt_PV);
3635 *lp = s - SvPVX(sv);
3638 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3639 PTR2UV(sv),SvPVX(sv)));
3643 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3644 /* Sneaky stuff here */
3648 tsv = newSVpv(tmpbuf, 0);
3665 len = strlen(tmpbuf);
3667 #ifdef FIXNEGATIVEZERO
3668 if (len == 2 && t[0] == '-' && t[1] == '0') {
3673 (void)SvUPGRADE(sv, SVt_PV);
3675 s = SvGROW(sv, len + 1);
3678 return strcpy(s, t);
3683 =for apidoc sv_copypv
3685 Copies a stringified representation of the source SV into the
3686 destination SV. Automatically performs any necessary mg_get and
3687 coercion of numeric values into strings. Guaranteed to preserve
3688 UTF-8 flag even from overloaded objects. Similar in nature to
3689 sv_2pv[_flags] but operates directly on an SV instead of just the
3690 string. Mostly uses sv_2pv_flags to do its work, except when that
3691 would lose the UTF-8'ness of the PV.
3697 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3702 sv_setpvn(dsv,s,len);
3710 =for apidoc sv_2pvbyte_nolen
3712 Return a pointer to the byte-encoded representation of the SV.
3713 May cause the SV to be downgraded from UTF-8 as a side-effect.
3715 Usually accessed via the C<SvPVbyte_nolen> macro.
3721 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3724 return sv_2pvbyte(sv, &n_a);
3728 =for apidoc sv_2pvbyte
3730 Return a pointer to the byte-encoded representation of the SV, and set *lp
3731 to its length. May cause the SV to be downgraded from UTF-8 as a
3734 Usually accessed via the C<SvPVbyte> macro.
3740 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3742 sv_utf8_downgrade(sv,0);
3743 return SvPV(sv,*lp);
3747 =for apidoc sv_2pvutf8_nolen
3749 Return a pointer to the UTF-8-encoded representation of the SV.
3750 May cause the SV to be upgraded to UTF-8 as a side-effect.
3752 Usually accessed via the C<SvPVutf8_nolen> macro.
3758 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3761 return sv_2pvutf8(sv, &n_a);
3765 =for apidoc sv_2pvutf8
3767 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3768 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3770 Usually accessed via the C<SvPVutf8> macro.
3776 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3778 sv_utf8_upgrade(sv);
3779 return SvPV(sv,*lp);
3783 =for apidoc sv_2bool
3785 This function is only called on magical items, and is only used by
3786 sv_true() or its macro equivalent.
3792 Perl_sv_2bool(pTHX_ register SV *sv)
3801 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3802 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3803 return (bool)SvTRUE(tmpsv);
3804 return SvRV(sv) != 0;
3807 register XPV* Xpvtmp;
3808 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3809 (*sv->sv_u.svu_pv > '0' ||
3810 Xpvtmp->xpv_cur > 1 ||
3811 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3818 return SvIVX(sv) != 0;
3821 return SvNVX(sv) != 0.0;
3828 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3829 * this function provided for binary compatibility only
3834 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3836 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3840 =for apidoc sv_utf8_upgrade
3842 Converts the PV of an SV to its UTF-8-encoded form.
3843 Forces the SV to string form if it is not already.
3844 Always sets the SvUTF8 flag to avoid future validity checks even
3845 if all the bytes have hibit clear.
3847 This is not as a general purpose byte encoding to Unicode interface:
3848 use the Encode extension for that.
3850 =for apidoc sv_utf8_upgrade_flags
3852 Converts the PV of an SV to its UTF-8-encoded form.
3853 Forces the SV to string form if it is not already.
3854 Always sets the SvUTF8 flag to avoid future validity checks even
3855 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3856 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3857 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3859 This is not as a general purpose byte encoding to Unicode interface:
3860 use the Encode extension for that.
3866 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3868 if (sv == &PL_sv_undef)
3872 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3873 (void) sv_2pv_flags(sv,&len, flags);
3877 (void) SvPV_force(sv,len);
3886 sv_force_normal_flags(sv, 0);
3889 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3890 sv_recode_to_utf8(sv, PL_encoding);
3891 else { /* Assume Latin-1/EBCDIC */
3892 /* This function could be much more efficient if we
3893 * had a FLAG in SVs to signal if there are any hibit
3894 * chars in the PV. Given that there isn't such a flag
3895 * make the loop as fast as possible. */
3896 U8 *s = (U8 *) SvPVX(sv);
3897 U8 *e = (U8 *) SvEND(sv);
3903 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3907 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3908 s = bytes_to_utf8((U8*)s, &len);
3910 SvPV_free(sv); /* No longer using what was there before. */
3912 SvPV_set(sv, (char*)s);
3913 SvCUR_set(sv, len - 1);
3914 SvLEN_set(sv, len); /* No longer know the real size. */
3916 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3923 =for apidoc sv_utf8_downgrade
3925 Attempts to convert the PV of an SV from characters to bytes.
3926 If the PV contains a character beyond byte, this conversion will fail;
3927 in this case, either returns false or, if C<fail_ok> is not
3930 This is not as a general purpose Unicode to byte encoding interface:
3931 use the Encode extension for that.
3937 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3939 if (SvPOKp(sv) && SvUTF8(sv)) {
3945 sv_force_normal_flags(sv, 0);
3947 s = (U8 *) SvPV(sv, len);
3948 if (!utf8_to_bytes(s, &len)) {
3953 Perl_croak(aTHX_ "Wide character in %s",
3956 Perl_croak(aTHX_ "Wide character");
3967 =for apidoc sv_utf8_encode
3969 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3970 flag off so that it looks like octets again.
3976 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3978 (void) sv_utf8_upgrade(sv);
3980 sv_force_normal_flags(sv, 0);
3982 if (SvREADONLY(sv)) {
3983 Perl_croak(aTHX_ PL_no_modify);
3989 =for apidoc sv_utf8_decode
3991 If the PV of the SV is an octet sequence in UTF-8
3992 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3993 so that it looks like a character. If the PV contains only single-byte
3994 characters, the C<SvUTF8> flag stays being off.
3995 Scans PV for validity and returns false if the PV is invalid UTF-8.
4001 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4007 /* The octets may have got themselves encoded - get them back as
4010 if (!sv_utf8_downgrade(sv, TRUE))
4013 /* it is actually just a matter of turning the utf8 flag on, but
4014 * we want to make sure everything inside is valid utf8 first.
4016 c = (U8 *) SvPVX(sv);
4017 if (!is_utf8_string(c, SvCUR(sv)+1))
4019 e = (U8 *) SvEND(sv);
4022 if (!UTF8_IS_INVARIANT(ch)) {
4031 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4032 * this function provided for binary compatibility only
4036 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4038 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4042 =for apidoc sv_setsv
4044 Copies the contents of the source SV C<ssv> into the destination SV
4045 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4046 function if the source SV needs to be reused. Does not handle 'set' magic.
4047 Loosely speaking, it performs a copy-by-value, obliterating any previous
4048 content of the destination.
4050 You probably want to use one of the assortment of wrappers, such as
4051 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4052 C<SvSetMagicSV_nosteal>.
4054 =for apidoc sv_setsv_flags
4056 Copies the contents of the source SV C<ssv> into the destination SV
4057 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4058 function if the source SV needs to be reused. Does not handle 'set' magic.
4059 Loosely speaking, it performs a copy-by-value, obliterating any previous
4060 content of the destination.
4061 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4062 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4063 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4064 and C<sv_setsv_nomg> are implemented in terms of this function.
4066 You probably want to use one of the assortment of wrappers, such as
4067 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4068 C<SvSetMagicSV_nosteal>.
4070 This is the primary function for copying scalars, and most other
4071 copy-ish functions and macros use this underneath.
4077 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4079 register U32 sflags;
4085 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4087 sstr = &PL_sv_undef;
4088 stype = SvTYPE(sstr);
4089 dtype = SvTYPE(dstr);
4094 /* need to nuke the magic */
4096 SvRMAGICAL_off(dstr);
4099 /* There's a lot of redundancy below but we're going for speed here */
4104 if (dtype != SVt_PVGV) {
4105 (void)SvOK_off(dstr);
4113 sv_upgrade(dstr, SVt_IV);
4116 sv_upgrade(dstr, SVt_PVNV);
4120 sv_upgrade(dstr, SVt_PVIV);
4123 (void)SvIOK_only(dstr);
4124 SvIV_set(dstr, SvIVX(sstr));
4127 if (SvTAINTED(sstr))
4138 sv_upgrade(dstr, SVt_NV);
4143 sv_upgrade(dstr, SVt_PVNV);
4146 SvNV_set(dstr, SvNVX(sstr));
4147 (void)SvNOK_only(dstr);
4148 if (SvTAINTED(sstr))
4156 sv_upgrade(dstr, SVt_RV);
4157 else if (dtype == SVt_PVGV &&
4158 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4161 if (GvIMPORTED(dstr) != GVf_IMPORTED
4162 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4164 GvIMPORTED_on(dstr);
4173 #ifdef PERL_COPY_ON_WRITE
4174 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4175 if (dtype < SVt_PVIV)
4176 sv_upgrade(dstr, SVt_PVIV);
4183 sv_upgrade(dstr, SVt_PV);
4186 if (dtype < SVt_PVIV)
4187 sv_upgrade(dstr, SVt_PVIV);
4190 if (dtype < SVt_PVNV)
4191 sv_upgrade(dstr, SVt_PVNV);
4198 const char * const type = sv_reftype(sstr,0);
4200 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
4202 Perl_croak(aTHX_ "Bizarre copy of %s", type);
4207 if (dtype <= SVt_PVGV) {
4209 if (dtype != SVt_PVGV) {
4210 const char * const name = GvNAME(sstr);
4211 const STRLEN len = GvNAMELEN(sstr);
4212 /* don't upgrade SVt_PVLV: it can hold a glob */
4213 if (dtype != SVt_PVLV)
4214 sv_upgrade(dstr, SVt_PVGV);
4215 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4216 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4217 GvNAME(dstr) = savepvn(name, len);
4218 GvNAMELEN(dstr) = len;
4219 SvFAKE_on(dstr); /* can coerce to non-glob */
4221 /* ahem, death to those who redefine active sort subs */
4222 else if (PL_curstackinfo->si_type == PERLSI_SORT
4223 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4224 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4227 #ifdef GV_UNIQUE_CHECK
4228 if (GvUNIQUE((GV*)dstr)) {
4229 Perl_croak(aTHX_ PL_no_modify);
4233 (void)SvOK_off(dstr);
4234 GvINTRO_off(dstr); /* one-shot flag */
4236 GvGP(dstr) = gp_ref(GvGP(sstr));
4237 if (SvTAINTED(sstr))
4239 if (GvIMPORTED(dstr) != GVf_IMPORTED
4240 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4242 GvIMPORTED_on(dstr);
4250 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4252 if ((int)SvTYPE(sstr) != stype) {
4253 stype = SvTYPE(sstr);
4254 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4258 if (stype == SVt_PVLV)
4259 (void)SvUPGRADE(dstr, SVt_PVNV);
4261 (void)SvUPGRADE(dstr, (U32)stype);
4264 sflags = SvFLAGS(sstr);
4266 if (sflags & SVf_ROK) {
4267 if (dtype >= SVt_PV) {
4268 if (dtype == SVt_PVGV) {
4269 SV *sref = SvREFCNT_inc(SvRV(sstr));
4271 const int intro = GvINTRO(dstr);
4273 #ifdef GV_UNIQUE_CHECK
4274 if (GvUNIQUE((GV*)dstr)) {
4275 Perl_croak(aTHX_ PL_no_modify);
4280 GvINTRO_off(dstr); /* one-shot flag */
4281 GvLINE(dstr) = CopLINE(PL_curcop);
4282 GvEGV(dstr) = (GV*)dstr;
4285 switch (SvTYPE(sref)) {
4288 SAVEGENERICSV(GvAV(dstr));
4290 dref = (SV*)GvAV(dstr);
4291 GvAV(dstr) = (AV*)sref;
4292 if (!GvIMPORTED_AV(dstr)
4293 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4295 GvIMPORTED_AV_on(dstr);
4300 SAVEGENERICSV(GvHV(dstr));
4302 dref = (SV*)GvHV(dstr);
4303 GvHV(dstr) = (HV*)sref;
4304 if (!GvIMPORTED_HV(dstr)
4305 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4307 GvIMPORTED_HV_on(dstr);
4312 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4313 SvREFCNT_dec(GvCV(dstr));
4314 GvCV(dstr) = Nullcv;
4315 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4316 PL_sub_generation++;
4318 SAVEGENERICSV(GvCV(dstr));
4321 dref = (SV*)GvCV(dstr);
4322 if (GvCV(dstr) != (CV*)sref) {
4323 CV* cv = GvCV(dstr);
4325 if (!GvCVGEN((GV*)dstr) &&
4326 (CvROOT(cv) || CvXSUB(cv)))
4328 /* ahem, death to those who redefine
4329 * active sort subs */
4330 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4331 PL_sortcop == CvSTART(cv))
4333 "Can't redefine active sort subroutine %s",
4334 GvENAME((GV*)dstr));
4335 /* Redefining a sub - warning is mandatory if
4336 it was a const and its value changed. */
4337 if (ckWARN(WARN_REDEFINE)
4339 && (!CvCONST((CV*)sref)
4340 || sv_cmp(cv_const_sv(cv),
4341 cv_const_sv((CV*)sref)))))
4343 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4345 ? "Constant subroutine %s::%s redefined"
4346 : "Subroutine %s::%s redefined",
4347 HvNAME_get(GvSTASH((GV*)dstr)),
4348 GvENAME((GV*)dstr));
4352 cv_ckproto(cv, (GV*)dstr,
4353 SvPOK(sref) ? SvPVX(sref) : Nullch);
4355 GvCV(dstr) = (CV*)sref;
4356 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4357 GvASSUMECV_on(dstr);
4358 PL_sub_generation++;
4360 if (!GvIMPORTED_CV(dstr)
4361 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4363 GvIMPORTED_CV_on(dstr);
4368 SAVEGENERICSV(GvIOp(dstr));
4370 dref = (SV*)GvIOp(dstr);
4371 GvIOp(dstr) = (IO*)sref;
4375 SAVEGENERICSV(GvFORM(dstr));
4377 dref = (SV*)GvFORM(dstr);
4378 GvFORM(dstr) = (CV*)sref;
4382 SAVEGENERICSV(GvSV(dstr));
4384 dref = (SV*)GvSV(dstr);
4386 if (!GvIMPORTED_SV(dstr)
4387 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4389 GvIMPORTED_SV_on(dstr);
4395 if (SvTAINTED(sstr))
4405 (void)SvOK_off(dstr);
4406 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4408 if (sflags & SVp_NOK) {
4410 /* Only set the public OK flag if the source has public OK. */
4411 if (sflags & SVf_NOK)
4412 SvFLAGS(dstr) |= SVf_NOK;
4413 SvNV_set(dstr, SvNVX(sstr));
4415 if (sflags & SVp_IOK) {
4416 (void)SvIOKp_on(dstr);
4417 if (sflags & SVf_IOK)
4418 SvFLAGS(dstr) |= SVf_IOK;
4419 if (sflags & SVf_IVisUV)
4421 SvIV_set(dstr, SvIVX(sstr));
4423 if (SvAMAGIC(sstr)) {
4427 else if (sflags & SVp_POK) {
4431 * Check to see if we can just swipe the string. If so, it's a
4432 * possible small lose on short strings, but a big win on long ones.
4433 * It might even be a win on short strings if SvPVX(dstr)
4434 * has to be allocated and SvPVX(sstr) has to be freed.
4437 /* Whichever path we take through the next code, we want this true,
4438 and doing it now facilitates the COW check. */
4439 (void)SvPOK_only(dstr);
4442 #ifdef PERL_COPY_ON_WRITE
4443 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4447 (sflags & SVs_TEMP) && /* slated for free anyway? */
4448 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4449 (!(flags & SV_NOSTEAL)) &&
4450 /* and we're allowed to steal temps */
4451 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4452 SvLEN(sstr) && /* and really is a string */
4453 /* and won't be needed again, potentially */
4454 !(PL_op && PL_op->op_type == OP_AASSIGN))
4455 #ifdef PERL_COPY_ON_WRITE
4456 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4457 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4458 && SvTYPE(sstr) >= SVt_PVIV)
4461 /* Failed the swipe test, and it's not a shared hash key either.
4462 Have to copy the string. */
4463 STRLEN len = SvCUR(sstr);
4464 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4465 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4466 SvCUR_set(dstr, len);
4467 *SvEND(dstr) = '\0';
4469 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4471 #ifdef PERL_COPY_ON_WRITE
4472 /* Either it's a shared hash key, or it's suitable for
4473 copy-on-write or we can swipe the string. */
4475 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4480 /* I believe I should acquire a global SV mutex if
4481 it's a COW sv (not a shared hash key) to stop
4482 it going un copy-on-write.
4483 If the source SV has gone un copy on write between up there
4484 and down here, then (assert() that) it is of the correct
4485 form to make it copy on write again */
4486 if ((sflags & (SVf_FAKE | SVf_READONLY))
4487 != (SVf_FAKE | SVf_READONLY)) {
4488 SvREADONLY_on(sstr);
4490 /* Make the source SV into a loop of 1.
4491 (about to become 2) */
4492 SV_COW_NEXT_SV_SET(sstr, sstr);
4496 /* Initial code is common. */
4497 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4499 SvFLAGS(dstr) &= ~SVf_OOK;
4500 Safefree(SvPVX(dstr) - SvIVX(dstr));
4502 else if (SvLEN(dstr))
4503 Safefree(SvPVX(dstr));
4506 #ifdef PERL_COPY_ON_WRITE
4508 /* making another shared SV. */
4509 STRLEN cur = SvCUR(sstr);
4510 STRLEN len = SvLEN(sstr);
4511 assert (SvTYPE(dstr) >= SVt_PVIV);
4513 /* SvIsCOW_normal */
4514 /* splice us in between source and next-after-source. */
4515 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4516 SV_COW_NEXT_SV_SET(sstr, dstr);
4517 SvPV_set(dstr, SvPVX(sstr));
4519 /* SvIsCOW_shared_hash */
4520 UV hash = SvUVX(sstr);
4521 DEBUG_C(PerlIO_printf(Perl_debug_log,
4522 "Copy on write: Sharing hash\n"));
4524 sharepvn(SvPVX(sstr),
4525 (sflags & SVf_UTF8?-cur:cur), hash));
4526 SvUV_set(dstr, hash);
4528 SvLEN_set(dstr, len);
4529 SvCUR_set(dstr, cur);
4530 SvREADONLY_on(dstr);
4532 /* Relesase a global SV mutex. */
4536 { /* Passes the swipe test. */
4537 SvPV_set(dstr, SvPVX(sstr));
4538 SvLEN_set(dstr, SvLEN(sstr));
4539 SvCUR_set(dstr, SvCUR(sstr));
4542 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4543 SvPV_set(sstr, Nullch);
4549 if (sflags & SVf_UTF8)
4552 if (sflags & SVp_NOK) {
4554 if (sflags & SVf_NOK)
4555 SvFLAGS(dstr) |= SVf_NOK;
4556 SvNV_set(dstr, SvNVX(sstr));
4558 if (sflags & SVp_IOK) {
4559 (void)SvIOKp_on(dstr);
4560 if (sflags & SVf_IOK)
4561 SvFLAGS(dstr) |= SVf_IOK;
4562 if (sflags & SVf_IVisUV)
4564 SvIV_set(dstr, SvIVX(sstr));
4567 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4568 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4569 smg->mg_ptr, smg->mg_len);
4570 SvRMAGICAL_on(dstr);
4573 else if (sflags & SVp_IOK) {
4574 if (sflags & SVf_IOK)
4575 (void)SvIOK_only(dstr);
4577 (void)SvOK_off(dstr);
4578 (void)SvIOKp_on(dstr);
4580 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4581 if (sflags & SVf_IVisUV)
4583 SvIV_set(dstr, SvIVX(sstr));
4584 if (sflags & SVp_NOK) {
4585 if (sflags & SVf_NOK)
4586 (void)SvNOK_on(dstr);
4588 (void)SvNOKp_on(dstr);
4589 SvNV_set(dstr, SvNVX(sstr));
4592 else if (sflags & SVp_NOK) {
4593 if (sflags & SVf_NOK)
4594 (void)SvNOK_only(dstr);
4596 (void)SvOK_off(dstr);
4599 SvNV_set(dstr, SvNVX(sstr));
4602 if (dtype == SVt_PVGV) {
4603 if (ckWARN(WARN_MISC))
4604 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4607 (void)SvOK_off(dstr);
4609 if (SvTAINTED(sstr))
4614 =for apidoc sv_setsv_mg
4616 Like C<sv_setsv>, but also handles 'set' magic.
4622 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4624 sv_setsv(dstr,sstr);
4628 #ifdef PERL_COPY_ON_WRITE
4630 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4632 STRLEN cur = SvCUR(sstr);
4633 STRLEN len = SvLEN(sstr);
4634 register char *new_pv;
4637 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4645 if (SvTHINKFIRST(dstr))
4646 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4647 else if (SvPVX(dstr))
4648 Safefree(SvPVX(dstr));
4652 (void)SvUPGRADE (dstr, SVt_PVIV);
4654 assert (SvPOK(sstr));
4655 assert (SvPOKp(sstr));
4656 assert (!SvIOK(sstr));
4657 assert (!SvIOKp(sstr));
4658 assert (!SvNOK(sstr));
4659 assert (!SvNOKp(sstr));
4661 if (SvIsCOW(sstr)) {
4663 if (SvLEN(sstr) == 0) {
4664 /* source is a COW shared hash key. */
4665 UV hash = SvUVX(sstr);
4666 DEBUG_C(PerlIO_printf(Perl_debug_log,
4667 "Fast copy on write: Sharing hash\n"));
4668 SvUV_set(dstr, hash);
4669 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4672 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4674 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4675 (void)SvUPGRADE (sstr, SVt_PVIV);
4676 SvREADONLY_on(sstr);
4678 DEBUG_C(PerlIO_printf(Perl_debug_log,
4679 "Fast copy on write: Converting sstr to COW\n"));
4680 SV_COW_NEXT_SV_SET(dstr, sstr);
4682 SV_COW_NEXT_SV_SET(sstr, dstr);
4683 new_pv = SvPVX(sstr);
4686 SvPV_set(dstr, new_pv);
4687 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4690 SvLEN_set(dstr, len);
4691 SvCUR_set(dstr, cur);
4700 =for apidoc sv_setpvn
4702 Copies a string into an SV. The C<len> parameter indicates the number of
4703 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4704 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4710 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4712 register char *dptr;
4714 SV_CHECK_THINKFIRST_COW_DROP(sv);
4720 /* len is STRLEN which is unsigned, need to copy to signed */
4723 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4725 (void)SvUPGRADE(sv, SVt_PV);
4727 SvGROW(sv, len + 1);
4729 Move(ptr,dptr,len,char);
4732 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4737 =for apidoc sv_setpvn_mg
4739 Like C<sv_setpvn>, but also handles 'set' magic.
4745 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4747 sv_setpvn(sv,ptr,len);
4752 =for apidoc sv_setpv
4754 Copies a string into an SV. The string must be null-terminated. Does not
4755 handle 'set' magic. See C<sv_setpv_mg>.
4761 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4763 register STRLEN len;
4765 SV_CHECK_THINKFIRST_COW_DROP(sv);
4771 (void)SvUPGRADE(sv, SVt_PV);
4773 SvGROW(sv, len + 1);
4774 Move(ptr,SvPVX(sv),len+1,char);
4776 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4781 =for apidoc sv_setpv_mg
4783 Like C<sv_setpv>, but also handles 'set' magic.
4789 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4796 =for apidoc sv_usepvn
4798 Tells an SV to use C<ptr> to find its string value. Normally the string is
4799 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4800 The C<ptr> should point to memory that was allocated by C<malloc>. The
4801 string length, C<len>, must be supplied. This function will realloc the
4802 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4803 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4804 See C<sv_usepvn_mg>.
4810 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4812 SV_CHECK_THINKFIRST_COW_DROP(sv);
4813 (void)SvUPGRADE(sv, SVt_PV);
4820 Renew(ptr, len+1, char);
4823 SvLEN_set(sv, len+1);
4825 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4830 =for apidoc sv_usepvn_mg
4832 Like C<sv_usepvn>, but also handles 'set' magic.
4838 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4840 sv_usepvn(sv,ptr,len);
4844 #ifdef PERL_COPY_ON_WRITE
4845 /* Need to do this *after* making the SV normal, as we need the buffer
4846 pointer to remain valid until after we've copied it. If we let go too early,
4847 another thread could invalidate it by unsharing last of the same hash key
4848 (which it can do by means other than releasing copy-on-write Svs)
4849 or by changing the other copy-on-write SVs in the loop. */
4851 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4852 U32 hash, SV *after)
4854 if (len) { /* this SV was SvIsCOW_normal(sv) */
4855 /* we need to find the SV pointing to us. */
4856 SV *current = SV_COW_NEXT_SV(after);
4858 if (current == sv) {
4859 /* The SV we point to points back to us (there were only two of us
4861 Hence other SV is no longer copy on write either. */
4863 SvREADONLY_off(after);
4865 /* We need to follow the pointers around the loop. */
4867 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4870 /* don't loop forever if the structure is bust, and we have
4871 a pointer into a closed loop. */
4872 assert (current != after);
4873 assert (SvPVX(current) == pvx);
4875 /* Make the SV before us point to the SV after us. */
4876 SV_COW_NEXT_SV_SET(current, after);
4879 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4884 Perl_sv_release_IVX(pTHX_ register SV *sv)
4887 sv_force_normal_flags(sv, 0);
4893 =for apidoc sv_force_normal_flags
4895 Undo various types of fakery on an SV: if the PV is a shared string, make
4896 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4897 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4898 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4899 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4900 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4901 set to some other value.) In addition, the C<flags> parameter gets passed to
4902 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4903 with flags set to 0.
4909 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4911 #ifdef PERL_COPY_ON_WRITE
4912 if (SvREADONLY(sv)) {
4913 /* At this point I believe I should acquire a global SV mutex. */
4915 char *pvx = SvPVX(sv);
4916 STRLEN len = SvLEN(sv);
4917 STRLEN cur = SvCUR(sv);
4918 U32 hash = SvUVX(sv);
4919 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4921 PerlIO_printf(Perl_debug_log,
4922 "Copy on write: Force normal %ld\n",
4928 /* This SV doesn't own the buffer, so need to New() a new one: */
4929 SvPV_set(sv, (char*)0);
4931 if (flags & SV_COW_DROP_PV) {
4932 /* OK, so we don't need to copy our buffer. */
4935 SvGROW(sv, cur + 1);
4936 Move(pvx,SvPVX(sv),cur,char);
4940 sv_release_COW(sv, pvx, cur, len, hash, next);
4945 else if (IN_PERL_RUNTIME)
4946 Perl_croak(aTHX_ PL_no_modify);
4947 /* At this point I believe that I can drop the global SV mutex. */
4950 if (SvREADONLY(sv)) {
4952 char *pvx = SvPVX(sv);
4953 const int is_utf8 = SvUTF8(sv);
4954 STRLEN len = SvCUR(sv);
4955 U32 hash = SvUVX(sv);
4958 SvPV_set(sv, (char*)0);
4960 SvGROW(sv, len + 1);
4961 Move(pvx,SvPVX(sv),len,char);
4963 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4965 else if (IN_PERL_RUNTIME)
4966 Perl_croak(aTHX_ PL_no_modify);
4970 sv_unref_flags(sv, flags);
4971 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4976 =for apidoc sv_force_normal
4978 Undo various types of fakery on an SV: if the PV is a shared string, make
4979 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4980 an xpvmg. See also C<sv_force_normal_flags>.
4986 Perl_sv_force_normal(pTHX_ register SV *sv)
4988 sv_force_normal_flags(sv, 0);
4994 Efficient removal of characters from the beginning of the string buffer.
4995 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4996 the string buffer. The C<ptr> becomes the first character of the adjusted
4997 string. Uses the "OOK hack".
4998 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4999 refer to the same chunk of data.
5005 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
5007 register STRLEN delta;
5008 if (!ptr || !SvPOKp(sv))
5010 delta = ptr - SvPVX(sv);
5011 SV_CHECK_THINKFIRST(sv);
5012 if (SvTYPE(sv) < SVt_PVIV)
5013 sv_upgrade(sv,SVt_PVIV);
5016 if (!SvLEN(sv)) { /* make copy of shared string */
5017 const char *pvx = SvPVX(sv);
5018 STRLEN len = SvCUR(sv);
5019 SvGROW(sv, len + 1);
5020 Move(pvx,SvPVX(sv),len,char);
5024 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5025 and we do that anyway inside the SvNIOK_off
5027 SvFLAGS(sv) |= SVf_OOK;
5030 SvLEN_set(sv, SvLEN(sv) - delta);
5031 SvCUR_set(sv, SvCUR(sv) - delta);
5032 SvPV_set(sv, SvPVX(sv) + delta);
5033 SvIV_set(sv, SvIVX(sv) + delta);
5036 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5037 * this function provided for binary compatibility only
5041 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5043 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5047 =for apidoc sv_catpvn
5049 Concatenates the string onto the end of the string which is in the SV. The
5050 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5051 status set, then the bytes appended should be valid UTF-8.
5052 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5054 =for apidoc sv_catpvn_flags
5056 Concatenates the string onto the end of the string which is in the SV. The
5057 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5058 status set, then the bytes appended should be valid UTF-8.
5059 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5060 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5061 in terms of this function.
5067 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5070 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
5072 SvGROW(dsv, dlen + slen + 1);
5075 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5076 SvCUR_set(dsv, SvCUR(dsv) + slen);
5078 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5083 =for apidoc sv_catpvn_mg
5085 Like C<sv_catpvn>, but also handles 'set' magic.
5091 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5093 sv_catpvn(sv,ptr,len);
5097 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5098 * this function provided for binary compatibility only
5102 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5104 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5108 =for apidoc sv_catsv
5110 Concatenates the string from SV C<ssv> onto the end of the string in
5111 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5112 not 'set' magic. See C<sv_catsv_mg>.
5114 =for apidoc sv_catsv_flags
5116 Concatenates the string from SV C<ssv> onto the end of the string in
5117 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5118 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5119 and C<sv_catsv_nomg> are implemented in terms of this function.
5124 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5130 if ((spv = SvPV(ssv, slen))) {
5131 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5132 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5133 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5134 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5135 dsv->sv_flags doesn't have that bit set.
5136 Andy Dougherty 12 Oct 2001
5138 I32 sutf8 = DO_UTF8(ssv);
5141 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5143 dutf8 = DO_UTF8(dsv);
5145 if (dutf8 != sutf8) {
5147 /* Not modifying source SV, so taking a temporary copy. */
5148 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5150 sv_utf8_upgrade(csv);
5151 spv = SvPV(csv, slen);
5154 sv_utf8_upgrade_nomg(dsv);
5156 sv_catpvn_nomg(dsv, spv, slen);
5161 =for apidoc sv_catsv_mg
5163 Like C<sv_catsv>, but also handles 'set' magic.
5169 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5176 =for apidoc sv_catpv
5178 Concatenates the string onto the end of the string which is in the SV.
5179 If the SV has the UTF-8 status set, then the bytes appended should be
5180 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5185 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5187 register STRLEN len;
5193 junk = SvPV_force(sv, tlen);
5195 SvGROW(sv, tlen + len + 1);
5198 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5199 SvCUR_set(sv, SvCUR(sv) + len);
5200 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5205 =for apidoc sv_catpv_mg
5207 Like C<sv_catpv>, but also handles 'set' magic.
5213 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5222 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5223 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5230 Perl_newSV(pTHX_ STRLEN len)
5236 sv_upgrade(sv, SVt_PV);
5237 SvGROW(sv, len + 1);
5242 =for apidoc sv_magicext
5244 Adds magic to an SV, upgrading it if necessary. Applies the
5245 supplied vtable and returns a pointer to the magic added.
5247 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5248 In particular, you can add magic to SvREADONLY SVs, and add more than
5249 one instance of the same 'how'.
5251 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5252 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5253 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5254 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5256 (This is now used as a subroutine by C<sv_magic>.)
5261 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5262 const char* name, I32 namlen)
5266 if (SvTYPE(sv) < SVt_PVMG) {
5267 (void)SvUPGRADE(sv, SVt_PVMG);
5269 Newz(702,mg, 1, MAGIC);
5270 mg->mg_moremagic = SvMAGIC(sv);
5271 SvMAGIC_set(sv, mg);
5273 /* Sometimes a magic contains a reference loop, where the sv and
5274 object refer to each other. To prevent a reference loop that
5275 would prevent such objects being freed, we look for such loops
5276 and if we find one we avoid incrementing the object refcount.
5278 Note we cannot do this to avoid self-tie loops as intervening RV must
5279 have its REFCNT incremented to keep it in existence.
5282 if (!obj || obj == sv ||
5283 how == PERL_MAGIC_arylen ||
5284 how == PERL_MAGIC_qr ||
5285 how == PERL_MAGIC_symtab ||
5286 (SvTYPE(obj) == SVt_PVGV &&
5287 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5288 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5289 GvFORM(obj) == (CV*)sv)))
5294 mg->mg_obj = SvREFCNT_inc(obj);
5295 mg->mg_flags |= MGf_REFCOUNTED;
5298 /* Normal self-ties simply pass a null object, and instead of
5299 using mg_obj directly, use the SvTIED_obj macro to produce a
5300 new RV as needed. For glob "self-ties", we are tieing the PVIO
5301 with an RV obj pointing to the glob containing the PVIO. In
5302 this case, to avoid a reference loop, we need to weaken the
5306 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5307 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5313 mg->mg_len = namlen;
5316 mg->mg_ptr = savepvn(name, namlen);
5317 else if (namlen == HEf_SVKEY)
5318 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5320 mg->mg_ptr = (char *) name;
5322 mg->mg_virtual = vtable;
5326 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5331 =for apidoc sv_magic
5333 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5334 then adds a new magic item of type C<how> to the head of the magic list.
5336 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5337 handling of the C<name> and C<namlen> arguments.
5339 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5340 to add more than one instance of the same 'how'.
5346 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5348 const MGVTBL *vtable = 0;
5351 #ifdef PERL_COPY_ON_WRITE
5353 sv_force_normal_flags(sv, 0);
5355 if (SvREADONLY(sv)) {
5357 && how != PERL_MAGIC_regex_global
5358 && how != PERL_MAGIC_bm
5359 && how != PERL_MAGIC_fm
5360 && how != PERL_MAGIC_sv
5361 && how != PERL_MAGIC_backref
5364 Perl_croak(aTHX_ PL_no_modify);
5367 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5368 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5369 /* sv_magic() refuses to add a magic of the same 'how' as an
5372 if (how == PERL_MAGIC_taint)
5380 vtable = &PL_vtbl_sv;
5382 case PERL_MAGIC_overload:
5383 vtable = &PL_vtbl_amagic;
5385 case PERL_MAGIC_overload_elem:
5386 vtable = &PL_vtbl_amagicelem;
5388 case PERL_MAGIC_overload_table:
5389 vtable = &PL_vtbl_ovrld;
5392 vtable = &PL_vtbl_bm;
5394 case PERL_MAGIC_regdata:
5395 vtable = &PL_vtbl_regdata;
5397 case PERL_MAGIC_regdatum:
5398 vtable = &PL_vtbl_regdatum;
5400 case PERL_MAGIC_env:
5401 vtable = &PL_vtbl_env;
5404 vtable = &PL_vtbl_fm;
5406 case PERL_MAGIC_envelem:
5407 vtable = &PL_vtbl_envelem;
5409 case PERL_MAGIC_regex_global:
5410 vtable = &PL_vtbl_mglob;
5412 case PERL_MAGIC_isa:
5413 vtable = &PL_vtbl_isa;
5415 case PERL_MAGIC_isaelem:
5416 vtable = &PL_vtbl_isaelem;
5418 case PERL_MAGIC_nkeys:
5419 vtable = &PL_vtbl_nkeys;
5421 case PERL_MAGIC_dbfile:
5424 case PERL_MAGIC_dbline:
5425 vtable = &PL_vtbl_dbline;
5427 #ifdef USE_LOCALE_COLLATE
5428 case PERL_MAGIC_collxfrm:
5429 vtable = &PL_vtbl_collxfrm;
5431 #endif /* USE_LOCALE_COLLATE */
5432 case PERL_MAGIC_tied:
5433 vtable = &PL_vtbl_pack;
5435 case PERL_MAGIC_tiedelem:
5436 case PERL_MAGIC_tiedscalar:
5437 vtable = &PL_vtbl_packelem;
5440 vtable = &PL_vtbl_regexp;
5442 case PERL_MAGIC_sig:
5443 vtable = &PL_vtbl_sig;
5445 case PERL_MAGIC_sigelem:
5446 vtable = &PL_vtbl_sigelem;
5448 case PERL_MAGIC_taint:
5449 vtable = &PL_vtbl_taint;
5451 case PERL_MAGIC_uvar:
5452 vtable = &PL_vtbl_uvar;
5454 case PERL_MAGIC_vec:
5455 vtable = &PL_vtbl_vec;
5457 case PERL_MAGIC_arylen_p:
5458 case PERL_MAGIC_rhash:
5459 case PERL_MAGIC_symtab:
5460 case PERL_MAGIC_vstring:
5463 case PERL_MAGIC_utf8:
5464 vtable = &PL_vtbl_utf8;
5466 case PERL_MAGIC_substr:
5467 vtable = &PL_vtbl_substr;
5469 case PERL_MAGIC_defelem:
5470 vtable = &PL_vtbl_defelem;
5472 case PERL_MAGIC_glob:
5473 vtable = &PL_vtbl_glob;
5475 case PERL_MAGIC_arylen:
5476 vtable = &PL_vtbl_arylen;
5478 case PERL_MAGIC_pos:
5479 vtable = &PL_vtbl_pos;
5481 case PERL_MAGIC_backref:
5482 vtable = &PL_vtbl_backref;
5484 case PERL_MAGIC_ext:
5485 /* Reserved for use by extensions not perl internals. */
5486 /* Useful for attaching extension internal data to perl vars. */
5487 /* Note that multiple extensions may clash if magical scalars */
5488 /* etc holding private data from one are passed to another. */
5491 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5494 /* Rest of work is done else where */
5495 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5498 case PERL_MAGIC_taint:
5501 case PERL_MAGIC_ext:
5502 case PERL_MAGIC_dbfile:
5509 =for apidoc sv_unmagic
5511 Removes all magic of type C<type> from an SV.
5517 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5521 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5524 for (mg = *mgp; mg; mg = *mgp) {
5525 if (mg->mg_type == type) {
5526 const MGVTBL* const vtbl = mg->mg_virtual;
5527 *mgp = mg->mg_moremagic;
5528 if (vtbl && vtbl->svt_free)
5529 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5530 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5532 Safefree(mg->mg_ptr);
5533 else if (mg->mg_len == HEf_SVKEY)
5534 SvREFCNT_dec((SV*)mg->mg_ptr);
5535 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5536 Safefree(mg->mg_ptr);
5538 if (mg->mg_flags & MGf_REFCOUNTED)
5539 SvREFCNT_dec(mg->mg_obj);
5543 mgp = &mg->mg_moremagic;
5547 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5554 =for apidoc sv_rvweaken
5556 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5557 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5558 push a back-reference to this RV onto the array of backreferences
5559 associated with that magic.
5565 Perl_sv_rvweaken(pTHX_ SV *sv)
5568 if (!SvOK(sv)) /* let undefs pass */
5571 Perl_croak(aTHX_ "Can't weaken a nonreference");
5572 else if (SvWEAKREF(sv)) {
5573 if (ckWARN(WARN_MISC))
5574 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5578 sv_add_backref(tsv, sv);
5584 /* Give tsv backref magic if it hasn't already got it, then push a
5585 * back-reference to sv onto the array associated with the backref magic.
5589 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5593 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5594 av = (AV*)mg->mg_obj;
5597 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5598 /* av now has a refcnt of 2, which avoids it getting freed
5599 * before us during global cleanup. The extra ref is removed
5600 * by magic_killbackrefs() when tsv is being freed */
5602 if (AvFILLp(av) >= AvMAX(av)) {
5604 SV **svp = AvARRAY(av);
5605 for (i = AvFILLp(av); i >= 0; i--)
5607 svp[i] = sv; /* reuse the slot */
5610 av_extend(av, AvFILLp(av)+1);
5612 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5615 /* delete a back-reference to ourselves from the backref magic associated
5616 * with the SV we point to.
5620 S_sv_del_backref(pTHX_ SV *sv)
5627 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5628 Perl_croak(aTHX_ "panic: del_backref");
5629 av = (AV *)mg->mg_obj;
5631 for (i = AvFILLp(av); i >= 0; i--)
5632 if (svp[i] == sv) svp[i] = Nullsv;
5636 =for apidoc sv_insert
5638 Inserts a string at the specified offset/length within the SV. Similar to
5639 the Perl substr() function.
5645 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5649 register char *midend;
5650 register char *bigend;
5656 Perl_croak(aTHX_ "Can't modify non-existent substring");
5657 SvPV_force(bigstr, curlen);
5658 (void)SvPOK_only_UTF8(bigstr);
5659 if (offset + len > curlen) {
5660 SvGROW(bigstr, offset+len+1);
5661 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5662 SvCUR_set(bigstr, offset+len);
5666 i = littlelen - len;
5667 if (i > 0) { /* string might grow */
5668 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5669 mid = big + offset + len;
5670 midend = bigend = big + SvCUR(bigstr);
5673 while (midend > mid) /* shove everything down */
5674 *--bigend = *--midend;
5675 Move(little,big+offset,littlelen,char);
5676 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5681 Move(little,SvPVX(bigstr)+offset,len,char);
5686 big = SvPVX(bigstr);
5689 bigend = big + SvCUR(bigstr);
5691 if (midend > bigend)
5692 Perl_croak(aTHX_ "panic: sv_insert");
5694 if (mid - big > bigend - midend) { /* faster to shorten from end */
5696 Move(little, mid, littlelen,char);
5699 i = bigend - midend;
5701 Move(midend, mid, i,char);
5705 SvCUR_set(bigstr, mid - big);
5708 else if ((i = mid - big)) { /* faster from front */
5709 midend -= littlelen;
5711 sv_chop(bigstr,midend-i);
5716 Move(little, mid, littlelen,char);
5718 else if (littlelen) {
5719 midend -= littlelen;
5720 sv_chop(bigstr,midend);
5721 Move(little,midend,littlelen,char);
5724 sv_chop(bigstr,midend);
5730 =for apidoc sv_replace
5732 Make the first argument a copy of the second, then delete the original.
5733 The target SV physically takes over ownership of the body of the source SV
5734 and inherits its flags; however, the target keeps any magic it owns,
5735 and any magic in the source is discarded.
5736 Note that this is a rather specialist SV copying operation; most of the
5737 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5743 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5745 const U32 refcnt = SvREFCNT(sv);
5746 SV_CHECK_THINKFIRST_COW_DROP(sv);
5747 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5748 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5749 if (SvMAGICAL(sv)) {
5753 sv_upgrade(nsv, SVt_PVMG);
5754 SvMAGIC_set(nsv, SvMAGIC(sv));
5755 SvFLAGS(nsv) |= SvMAGICAL(sv);
5757 SvMAGIC_set(sv, NULL);
5761 assert(!SvREFCNT(sv));
5762 #ifdef DEBUG_LEAKING_SCALARS
5763 sv->sv_flags = nsv->sv_flags;
5764 sv->sv_any = nsv->sv_any;
5765 sv->sv_refcnt = nsv->sv_refcnt;
5767 StructCopy(nsv,sv,SV);
5769 /* Currently could join these into one piece of pointer arithmetic, but
5770 it would be unclear. */
5771 if(SvTYPE(sv) == SVt_IV)
5773 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5774 else if (SvTYPE(sv) == SVt_RV) {
5775 SvANY(sv) = &sv->sv_u.svu_rv;
5779 #ifdef PERL_COPY_ON_WRITE
5780 if (SvIsCOW_normal(nsv)) {
5781 /* We need to follow the pointers around the loop to make the
5782 previous SV point to sv, rather than nsv. */
5785 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5788 assert(SvPVX(current) == SvPVX(nsv));
5790 /* Make the SV before us point to the SV after us. */
5792 PerlIO_printf(Perl_debug_log, "previous is\n");
5794 PerlIO_printf(Perl_debug_log,
5795 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5796 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5798 SV_COW_NEXT_SV_SET(current, sv);
5801 SvREFCNT(sv) = refcnt;
5802 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5808 =for apidoc sv_clear
5810 Clear an SV: call any destructors, free up any memory used by the body,
5811 and free the body itself. The SV's head is I<not> freed, although
5812 its type is set to all 1's so that it won't inadvertently be assumed
5813 to be live during global destruction etc.
5814 This function should only be called when REFCNT is zero. Most of the time
5815 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5822 Perl_sv_clear(pTHX_ register SV *sv)
5827 assert(SvREFCNT(sv) == 0);
5830 if (PL_defstash) { /* Still have a symbol table? */
5837 stash = SvSTASH(sv);
5838 destructor = StashHANDLER(stash,DESTROY);
5840 SV* tmpref = newRV(sv);
5841 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5843 PUSHSTACKi(PERLSI_DESTROY);
5848 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5854 if(SvREFCNT(tmpref) < 2) {
5855 /* tmpref is not kept alive! */
5857 SvRV_set(tmpref, NULL);
5860 SvREFCNT_dec(tmpref);
5862 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5866 if (PL_in_clean_objs)
5867 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5869 /* DESTROY gave object new lease on life */
5875 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5876 SvOBJECT_off(sv); /* Curse the object. */
5877 if (SvTYPE(sv) != SVt_PVIO)
5878 --PL_sv_objcount; /* XXX Might want something more general */
5881 if (SvTYPE(sv) >= SVt_PVMG) {
5884 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5885 SvREFCNT_dec(SvSTASH(sv));
5888 switch (SvTYPE(sv)) {
5891 IoIFP(sv) != PerlIO_stdin() &&
5892 IoIFP(sv) != PerlIO_stdout() &&
5893 IoIFP(sv) != PerlIO_stderr())
5895 io_close((IO*)sv, FALSE);
5897 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5898 PerlDir_close(IoDIRP(sv));
5899 IoDIRP(sv) = (DIR*)NULL;
5900 Safefree(IoTOP_NAME(sv));
5901 Safefree(IoFMT_NAME(sv));
5902 Safefree(IoBOTTOM_NAME(sv));
5917 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5918 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5919 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5920 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5922 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5923 SvREFCNT_dec(LvTARG(sv));
5927 Safefree(GvNAME(sv));
5928 /* cannot decrease stash refcount yet, as we might recursively delete
5929 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5930 of stash until current sv is completely gone.
5931 -- JohnPC, 27 Mar 1998 */
5932 stash = GvSTASH(sv);
5938 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5940 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5941 /* Don't even bother with turning off the OOK flag. */
5950 SvREFCNT_dec(SvRV(sv));
5952 #ifdef PERL_COPY_ON_WRITE
5953 else if (SvPVX(sv)) {
5955 /* I believe I need to grab the global SV mutex here and
5956 then recheck the COW status. */
5958 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5961 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5962 SvUVX(sv), SV_COW_NEXT_SV(sv));
5963 /* And drop it here. */
5965 } else if (SvLEN(sv)) {
5966 Safefree(SvPVX(sv));
5970 else if (SvPVX(sv) && SvLEN(sv))
5971 Safefree(SvPVX(sv));
5972 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5973 unsharepvn(SvPVX(sv),
5974 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5988 switch (SvTYPE(sv)) {
6002 del_XPVIV(SvANY(sv));
6005 del_XPVNV(SvANY(sv));
6008 del_XPVMG(SvANY(sv));
6011 del_XPVLV(SvANY(sv));
6014 del_XPVAV(SvANY(sv));
6017 del_XPVHV(SvANY(sv));
6020 del_XPVCV(SvANY(sv));
6023 del_XPVGV(SvANY(sv));
6024 /* code duplication for increased performance. */
6025 SvFLAGS(sv) &= SVf_BREAK;
6026 SvFLAGS(sv) |= SVTYPEMASK;
6027 /* decrease refcount of the stash that owns this GV, if any */
6029 SvREFCNT_dec(stash);
6030 return; /* not break, SvFLAGS reset already happened */
6032 del_XPVBM(SvANY(sv));
6035 del_XPVFM(SvANY(sv));
6038 del_XPVIO(SvANY(sv));
6041 SvFLAGS(sv) &= SVf_BREAK;
6042 SvFLAGS(sv) |= SVTYPEMASK;
6046 =for apidoc sv_newref
6048 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6055 Perl_sv_newref(pTHX_ SV *sv)
6065 Decrement an SV's reference count, and if it drops to zero, call
6066 C<sv_clear> to invoke destructors and free up any memory used by
6067 the body; finally, deallocate the SV's head itself.
6068 Normally called via a wrapper macro C<SvREFCNT_dec>.
6074 Perl_sv_free(pTHX_ SV *sv)
6079 if (SvREFCNT(sv) == 0) {
6080 if (SvFLAGS(sv) & SVf_BREAK)
6081 /* this SV's refcnt has been artificially decremented to
6082 * trigger cleanup */
6084 if (PL_in_clean_all) /* All is fair */
6086 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6087 /* make sure SvREFCNT(sv)==0 happens very seldom */
6088 SvREFCNT(sv) = (~(U32)0)/2;
6091 if (ckWARN_d(WARN_INTERNAL))
6092 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6093 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6094 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6097 if (--(SvREFCNT(sv)) > 0)
6099 Perl_sv_free2(aTHX_ sv);
6103 Perl_sv_free2(pTHX_ SV *sv)
6108 if (ckWARN_d(WARN_DEBUGGING))
6109 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6110 "Attempt to free temp prematurely: SV 0x%"UVxf
6111 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6115 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6116 /* make sure SvREFCNT(sv)==0 happens very seldom */
6117 SvREFCNT(sv) = (~(U32)0)/2;
6128 Returns the length of the string in the SV. Handles magic and type
6129 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6135 Perl_sv_len(pTHX_ register SV *sv)
6143 len = mg_length(sv);
6145 (void)SvPV(sv, len);
6150 =for apidoc sv_len_utf8
6152 Returns the number of characters in the string in an SV, counting wide
6153 UTF-8 bytes as a single character. Handles magic and type coercion.
6159 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6160 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6161 * (Note that the mg_len is not the length of the mg_ptr field.)
6166 Perl_sv_len_utf8(pTHX_ register SV *sv)
6172 return mg_length(sv);
6176 const U8 *s = (U8*)SvPV(sv, len);
6177 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6179 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6181 #ifdef PERL_UTF8_CACHE_ASSERT
6182 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6186 ulen = Perl_utf8_length(aTHX_ s, s + len);
6187 if (!mg && !SvREADONLY(sv)) {
6188 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6189 mg = mg_find(sv, PERL_MAGIC_utf8);
6199 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6200 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6201 * between UTF-8 and byte offsets. There are two (substr offset and substr
6202 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6203 * and byte offset) cache positions.
6205 * The mg_len field is used by sv_len_utf8(), see its comments.
6206 * Note that the mg_len is not the length of the mg_ptr field.
6210 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 offsetp, U8 *s, U8 *start)
6214 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6216 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6220 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6222 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6223 (*mgp)->mg_ptr = (char *) *cachep;
6227 (*cachep)[i] = offsetp;
6228 (*cachep)[i+1] = s - start;
6236 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6237 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6238 * between UTF-8 and byte offsets. See also the comments of
6239 * S_utf8_mg_pos_init().
6243 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6247 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6249 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6250 if (*mgp && (*mgp)->mg_ptr) {
6251 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6252 ASSERT_UTF8_CACHE(*cachep);
6253 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6255 else { /* We will skip to the right spot. */
6260 /* The assumption is that going backward is half
6261 * the speed of going forward (that's where the
6262 * 2 * backw in the below comes from). (The real
6263 * figure of course depends on the UTF-8 data.) */
6265 if ((*cachep)[i] > (STRLEN)uoff) {
6267 backw = (*cachep)[i] - (STRLEN)uoff;
6269 if (forw < 2 * backw)
6272 p = start + (*cachep)[i+1];
6274 /* Try this only for the substr offset (i == 0),
6275 * not for the substr length (i == 2). */
6276 else if (i == 0) { /* (*cachep)[i] < uoff */
6277 const STRLEN ulen = sv_len_utf8(sv);
6279 if ((STRLEN)uoff < ulen) {
6280 forw = (STRLEN)uoff - (*cachep)[i];
6281 backw = ulen - (STRLEN)uoff;
6283 if (forw < 2 * backw)
6284 p = start + (*cachep)[i+1];
6289 /* If the string is not long enough for uoff,
6290 * we could extend it, but not at this low a level. */
6294 if (forw < 2 * backw) {
6301 while (UTF8_IS_CONTINUATION(*p))
6306 /* Update the cache. */
6307 (*cachep)[i] = (STRLEN)uoff;
6308 (*cachep)[i+1] = p - start;
6310 /* Drop the stale "length" cache */
6319 if (found) { /* Setup the return values. */
6320 *offsetp = (*cachep)[i+1];
6321 *sp = start + *offsetp;
6324 *offsetp = send - start;
6326 else if (*sp < start) {
6332 #ifdef PERL_UTF8_CACHE_ASSERT
6337 while (n-- && s < send)
6341 assert(*offsetp == s - start);
6342 assert((*cachep)[0] == (STRLEN)uoff);
6343 assert((*cachep)[1] == *offsetp);
6345 ASSERT_UTF8_CACHE(*cachep);
6354 =for apidoc sv_pos_u2b
6356 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6357 the start of the string, to a count of the equivalent number of bytes; if
6358 lenp is non-zero, it does the same to lenp, but this time starting from
6359 the offset, rather than from the start of the string. Handles magic and
6366 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6367 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6368 * byte offsets. See also the comments of S_utf8_mg_pos().
6373 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6384 start = s = (U8*)SvPV(sv, len);
6386 I32 uoffset = *offsetp;
6391 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6393 if (!found && uoffset > 0) {
6394 while (s < send && uoffset--)
6398 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6400 *offsetp = s - start;
6405 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6409 if (!found && *lenp > 0) {
6412 while (s < send && ulen--)
6416 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6420 ASSERT_UTF8_CACHE(cache);
6432 =for apidoc sv_pos_b2u
6434 Converts the value pointed to by offsetp from a count of bytes from the
6435 start of the string, to a count of the equivalent number of UTF-8 chars.
6436 Handles magic and type coercion.
6442 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6443 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6444 * byte offsets. See also the comments of S_utf8_mg_pos().
6449 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6457 s = (U8*)SvPV(sv, len);
6458 if ((I32)len < *offsetp)
6459 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6461 U8* send = s + *offsetp;
6463 STRLEN *cache = NULL;
6467 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6468 mg = mg_find(sv, PERL_MAGIC_utf8);
6469 if (mg && mg->mg_ptr) {
6470 cache = (STRLEN *) mg->mg_ptr;
6471 if (cache[1] == (STRLEN)*offsetp) {
6472 /* An exact match. */
6473 *offsetp = cache[0];
6477 else if (cache[1] < (STRLEN)*offsetp) {
6478 /* We already know part of the way. */
6481 /* Let the below loop do the rest. */
6483 else { /* cache[1] > *offsetp */
6484 /* We already know all of the way, now we may
6485 * be able to walk back. The same assumption
6486 * is made as in S_utf8_mg_pos(), namely that
6487 * walking backward is twice slower than
6488 * walking forward. */
6489 STRLEN forw = *offsetp;
6490 STRLEN backw = cache[1] - *offsetp;
6492 if (!(forw < 2 * backw)) {
6493 U8 *p = s + cache[1];
6500 while (UTF8_IS_CONTINUATION(*p)) {
6508 *offsetp = cache[0];
6510 /* Drop the stale "length" cache */
6518 ASSERT_UTF8_CACHE(cache);
6524 /* Call utf8n_to_uvchr() to validate the sequence
6525 * (unless a simple non-UTF character) */
6526 if (!UTF8_IS_INVARIANT(*s))
6527 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6536 if (!SvREADONLY(sv)) {
6538 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6539 mg = mg_find(sv, PERL_MAGIC_utf8);
6544 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6545 mg->mg_ptr = (char *) cache;
6550 cache[1] = *offsetp;
6551 /* Drop the stale "length" cache */
6564 Returns a boolean indicating whether the strings in the two SVs are
6565 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6566 coerce its args to strings if necessary.
6572 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6580 SV* svrecode = Nullsv;
6587 pv1 = SvPV(sv1, cur1);
6594 pv2 = SvPV(sv2, cur2);
6596 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6597 /* Differing utf8ness.
6598 * Do not UTF8size the comparands as a side-effect. */
6601 svrecode = newSVpvn(pv2, cur2);
6602 sv_recode_to_utf8(svrecode, PL_encoding);
6603 pv2 = SvPV(svrecode, cur2);
6606 svrecode = newSVpvn(pv1, cur1);
6607 sv_recode_to_utf8(svrecode, PL_encoding);
6608 pv1 = SvPV(svrecode, cur1);
6610 /* Now both are in UTF-8. */
6612 SvREFCNT_dec(svrecode);
6617 bool is_utf8 = TRUE;
6620 /* sv1 is the UTF-8 one,
6621 * if is equal it must be downgrade-able */
6622 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6628 /* sv2 is the UTF-8 one,
6629 * if is equal it must be downgrade-able */
6630 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6636 /* Downgrade not possible - cannot be eq */
6644 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6647 SvREFCNT_dec(svrecode);
6658 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6659 string in C<sv1> is less than, equal to, or greater than the string in
6660 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6661 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6667 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6670 const char *pv1, *pv2;
6673 SV *svrecode = Nullsv;
6680 pv1 = SvPV(sv1, cur1);
6687 pv2 = SvPV(sv2, cur2);
6689 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6690 /* Differing utf8ness.
6691 * Do not UTF8size the comparands as a side-effect. */
6694 svrecode = newSVpvn(pv2, cur2);
6695 sv_recode_to_utf8(svrecode, PL_encoding);
6696 pv2 = SvPV(svrecode, cur2);
6699 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6704 svrecode = newSVpvn(pv1, cur1);
6705 sv_recode_to_utf8(svrecode, PL_encoding);
6706 pv1 = SvPV(svrecode, cur1);
6709 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6715 cmp = cur2 ? -1 : 0;
6719 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6722 cmp = retval < 0 ? -1 : 1;
6723 } else if (cur1 == cur2) {
6726 cmp = cur1 < cur2 ? -1 : 1;
6731 SvREFCNT_dec(svrecode);
6740 =for apidoc sv_cmp_locale
6742 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6743 'use bytes' aware, handles get magic, and will coerce its args to strings
6744 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6750 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6752 #ifdef USE_LOCALE_COLLATE
6758 if (PL_collation_standard)
6762 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6764 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6766 if (!pv1 || !len1) {
6777 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6780 return retval < 0 ? -1 : 1;
6783 * When the result of collation is equality, that doesn't mean
6784 * that there are no differences -- some locales exclude some
6785 * characters from consideration. So to avoid false equalities,
6786 * we use the raw string as a tiebreaker.
6792 #endif /* USE_LOCALE_COLLATE */
6794 return sv_cmp(sv1, sv2);
6798 #ifdef USE_LOCALE_COLLATE
6801 =for apidoc sv_collxfrm
6803 Add Collate Transform magic to an SV if it doesn't already have it.
6805 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6806 scalar data of the variable, but transformed to such a format that a normal
6807 memory comparison can be used to compare the data according to the locale
6814 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6818 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6819 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6824 Safefree(mg->mg_ptr);
6826 if ((xf = mem_collxfrm(s, len, &xlen))) {
6827 if (SvREADONLY(sv)) {
6830 return xf + sizeof(PL_collation_ix);
6833 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6834 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6847 if (mg && mg->mg_ptr) {
6849 return mg->mg_ptr + sizeof(PL_collation_ix);
6857 #endif /* USE_LOCALE_COLLATE */
6862 Get a line from the filehandle and store it into the SV, optionally
6863 appending to the currently-stored string.
6869 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6873 register STDCHAR rslast;
6874 register STDCHAR *bp;
6880 if (SvTHINKFIRST(sv))
6881 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6882 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6884 However, perlbench says it's slower, because the existing swipe code
6885 is faster than copy on write.
6886 Swings and roundabouts. */
6887 (void)SvUPGRADE(sv, SVt_PV);
6892 if (PerlIO_isutf8(fp)) {
6894 sv_utf8_upgrade_nomg(sv);
6895 sv_pos_u2b(sv,&append,0);
6897 } else if (SvUTF8(sv)) {
6898 SV *tsv = NEWSV(0,0);
6899 sv_gets(tsv, fp, 0);
6900 sv_utf8_upgrade_nomg(tsv);
6901 SvCUR_set(sv,append);
6904 goto return_string_or_null;
6909 if (PerlIO_isutf8(fp))
6912 if (IN_PERL_COMPILETIME) {
6913 /* we always read code in line mode */
6917 else if (RsSNARF(PL_rs)) {
6918 /* If it is a regular disk file use size from stat() as estimate
6919 of amount we are going to read - may result in malloc-ing
6920 more memory than we realy need if layers bellow reduce
6921 size we read (e.g. CRLF or a gzip layer)
6924 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6925 const Off_t offset = PerlIO_tell(fp);
6926 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6927 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6933 else if (RsRECORD(PL_rs)) {
6937 /* Grab the size of the record we're getting */
6938 recsize = SvIV(SvRV(PL_rs));
6939 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6942 /* VMS wants read instead of fread, because fread doesn't respect */
6943 /* RMS record boundaries. This is not necessarily a good thing to be */
6944 /* doing, but we've got no other real choice - except avoid stdio
6945 as implementation - perhaps write a :vms layer ?
6947 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6949 bytesread = PerlIO_read(fp, buffer, recsize);
6953 SvCUR_set(sv, bytesread += append);
6954 buffer[bytesread] = '\0';
6955 goto return_string_or_null;
6957 else if (RsPARA(PL_rs)) {
6963 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6964 if (PerlIO_isutf8(fp)) {
6965 rsptr = SvPVutf8(PL_rs, rslen);
6968 if (SvUTF8(PL_rs)) {
6969 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6970 Perl_croak(aTHX_ "Wide character in $/");
6973 rsptr = SvPV(PL_rs, rslen);
6977 rslast = rslen ? rsptr[rslen - 1] : '\0';
6979 if (rspara) { /* have to do this both before and after */
6980 do { /* to make sure file boundaries work right */
6983 i = PerlIO_getc(fp);
6987 PerlIO_ungetc(fp,i);
6993 /* See if we know enough about I/O mechanism to cheat it ! */
6995 /* This used to be #ifdef test - it is made run-time test for ease
6996 of abstracting out stdio interface. One call should be cheap
6997 enough here - and may even be a macro allowing compile
7001 if (PerlIO_fast_gets(fp)) {
7004 * We're going to steal some values from the stdio struct
7005 * and put EVERYTHING in the innermost loop into registers.
7007 register STDCHAR *ptr;
7011 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7012 /* An ungetc()d char is handled separately from the regular
7013 * buffer, so we getc() it back out and stuff it in the buffer.
7015 i = PerlIO_getc(fp);
7016 if (i == EOF) return 0;
7017 *(--((*fp)->_ptr)) = (unsigned char) i;
7021 /* Here is some breathtakingly efficient cheating */
7023 cnt = PerlIO_get_cnt(fp); /* get count into register */
7024 /* make sure we have the room */
7025 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7026 /* Not room for all of it
7027 if we are looking for a separator and room for some
7029 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7030 /* just process what we have room for */
7031 shortbuffered = cnt - SvLEN(sv) + append + 1;
7032 cnt -= shortbuffered;
7036 /* remember that cnt can be negative */
7037 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7042 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7043 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7044 DEBUG_P(PerlIO_printf(Perl_debug_log,
7045 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7046 DEBUG_P(PerlIO_printf(Perl_debug_log,
7047 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7048 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7049 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7054 while (cnt > 0) { /* this | eat */
7056 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7057 goto thats_all_folks; /* screams | sed :-) */
7061 Copy(ptr, bp, cnt, char); /* this | eat */
7062 bp += cnt; /* screams | dust */
7063 ptr += cnt; /* louder | sed :-) */
7068 if (shortbuffered) { /* oh well, must extend */
7069 cnt = shortbuffered;
7071 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7073 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7074 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7078 DEBUG_P(PerlIO_printf(Perl_debug_log,
7079 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7080 PTR2UV(ptr),(long)cnt));
7081 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7083 DEBUG_P(PerlIO_printf(Perl_debug_log,
7084 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7085 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7086 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7088 /* This used to call 'filbuf' in stdio form, but as that behaves like
7089 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7090 another abstraction. */
7091 i = PerlIO_getc(fp); /* get more characters */
7093 DEBUG_P(PerlIO_printf(Perl_debug_log,
7094 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7095 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7096 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7098 cnt = PerlIO_get_cnt(fp);
7099 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7100 DEBUG_P(PerlIO_printf(Perl_debug_log,
7101 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7103 if (i == EOF) /* all done for ever? */
7104 goto thats_really_all_folks;
7106 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7108 SvGROW(sv, bpx + cnt + 2);
7109 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7111 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7113 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7114 goto thats_all_folks;
7118 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7119 memNE((char*)bp - rslen, rsptr, rslen))
7120 goto screamer; /* go back to the fray */
7121 thats_really_all_folks:
7123 cnt += shortbuffered;
7124 DEBUG_P(PerlIO_printf(Perl_debug_log,
7125 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7126 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7127 DEBUG_P(PerlIO_printf(Perl_debug_log,
7128 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7129 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7130 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7132 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7133 DEBUG_P(PerlIO_printf(Perl_debug_log,
7134 "Screamer: done, len=%ld, string=|%.*s|\n",
7135 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7139 /*The big, slow, and stupid way. */
7140 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7142 New(0, buf, 8192, STDCHAR);
7150 const register STDCHAR *bpe = buf + sizeof(buf);
7152 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7153 ; /* keep reading */
7157 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7158 /* Accomodate broken VAXC compiler, which applies U8 cast to
7159 * both args of ?: operator, causing EOF to change into 255
7162 i = (U8)buf[cnt - 1];
7168 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7170 sv_catpvn(sv, (char *) buf, cnt);
7172 sv_setpvn(sv, (char *) buf, cnt);
7174 if (i != EOF && /* joy */
7176 SvCUR(sv) < rslen ||
7177 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7181 * If we're reading from a TTY and we get a short read,
7182 * indicating that the user hit his EOF character, we need
7183 * to notice it now, because if we try to read from the TTY
7184 * again, the EOF condition will disappear.
7186 * The comparison of cnt to sizeof(buf) is an optimization
7187 * that prevents unnecessary calls to feof().
7191 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7195 #ifdef USE_HEAP_INSTEAD_OF_STACK
7200 if (rspara) { /* have to do this both before and after */
7201 while (i != EOF) { /* to make sure file boundaries work right */
7202 i = PerlIO_getc(fp);
7204 PerlIO_ungetc(fp,i);
7210 return_string_or_null:
7211 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7217 Auto-increment of the value in the SV, doing string to numeric conversion
7218 if necessary. Handles 'get' magic.
7224 Perl_sv_inc(pTHX_ register SV *sv)
7233 if (SvTHINKFIRST(sv)) {
7235 sv_force_normal_flags(sv, 0);
7236 if (SvREADONLY(sv)) {
7237 if (IN_PERL_RUNTIME)
7238 Perl_croak(aTHX_ PL_no_modify);
7242 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7244 i = PTR2IV(SvRV(sv));
7249 flags = SvFLAGS(sv);
7250 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7251 /* It's (privately or publicly) a float, but not tested as an
7252 integer, so test it to see. */
7254 flags = SvFLAGS(sv);
7256 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7257 /* It's publicly an integer, or privately an integer-not-float */
7258 #ifdef PERL_PRESERVE_IVUV
7262 if (SvUVX(sv) == UV_MAX)
7263 sv_setnv(sv, UV_MAX_P1);
7265 (void)SvIOK_only_UV(sv);
7266 SvUV_set(sv, SvUVX(sv) + 1);
7268 if (SvIVX(sv) == IV_MAX)
7269 sv_setuv(sv, (UV)IV_MAX + 1);
7271 (void)SvIOK_only(sv);
7272 SvIV_set(sv, SvIVX(sv) + 1);
7277 if (flags & SVp_NOK) {
7278 (void)SvNOK_only(sv);
7279 SvNV_set(sv, SvNVX(sv) + 1.0);
7283 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7284 if ((flags & SVTYPEMASK) < SVt_PVIV)
7285 sv_upgrade(sv, SVt_IV);
7286 (void)SvIOK_only(sv);
7291 while (isALPHA(*d)) d++;
7292 while (isDIGIT(*d)) d++;
7294 #ifdef PERL_PRESERVE_IVUV
7295 /* Got to punt this as an integer if needs be, but we don't issue
7296 warnings. Probably ought to make the sv_iv_please() that does
7297 the conversion if possible, and silently. */
7298 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7299 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7300 /* Need to try really hard to see if it's an integer.
7301 9.22337203685478e+18 is an integer.
7302 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7303 so $a="9.22337203685478e+18"; $a+0; $a++
7304 needs to be the same as $a="9.22337203685478e+18"; $a++
7311 /* sv_2iv *should* have made this an NV */
7312 if (flags & SVp_NOK) {
7313 (void)SvNOK_only(sv);
7314 SvNV_set(sv, SvNVX(sv) + 1.0);
7317 /* I don't think we can get here. Maybe I should assert this
7318 And if we do get here I suspect that sv_setnv will croak. NWC
7320 #if defined(USE_LONG_DOUBLE)
7321 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",
7322 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7324 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7325 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7328 #endif /* PERL_PRESERVE_IVUV */
7329 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7333 while (d >= SvPVX(sv)) {
7341 /* MKS: The original code here died if letters weren't consecutive.
7342 * at least it didn't have to worry about non-C locales. The
7343 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7344 * arranged in order (although not consecutively) and that only
7345 * [A-Za-z] are accepted by isALPHA in the C locale.
7347 if (*d != 'z' && *d != 'Z') {
7348 do { ++*d; } while (!isALPHA(*d));
7351 *(d--) -= 'z' - 'a';
7356 *(d--) -= 'z' - 'a' + 1;
7360 /* oh,oh, the number grew */
7361 SvGROW(sv, SvCUR(sv) + 2);
7362 SvCUR_set(sv, SvCUR(sv) + 1);
7363 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7374 Auto-decrement of the value in the SV, doing string to numeric conversion
7375 if necessary. Handles 'get' magic.
7381 Perl_sv_dec(pTHX_ register SV *sv)
7389 if (SvTHINKFIRST(sv)) {
7391 sv_force_normal_flags(sv, 0);
7392 if (SvREADONLY(sv)) {
7393 if (IN_PERL_RUNTIME)
7394 Perl_croak(aTHX_ PL_no_modify);
7398 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7400 i = PTR2IV(SvRV(sv));
7405 /* Unlike sv_inc we don't have to worry about string-never-numbers
7406 and keeping them magic. But we mustn't warn on punting */
7407 flags = SvFLAGS(sv);
7408 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7409 /* It's publicly an integer, or privately an integer-not-float */
7410 #ifdef PERL_PRESERVE_IVUV
7414 if (SvUVX(sv) == 0) {
7415 (void)SvIOK_only(sv);
7419 (void)SvIOK_only_UV(sv);
7420 SvUV_set(sv, SvUVX(sv) + 1);
7423 if (SvIVX(sv) == IV_MIN)
7424 sv_setnv(sv, (NV)IV_MIN - 1.0);
7426 (void)SvIOK_only(sv);
7427 SvIV_set(sv, SvIVX(sv) - 1);
7432 if (flags & SVp_NOK) {
7433 SvNV_set(sv, SvNVX(sv) - 1.0);
7434 (void)SvNOK_only(sv);
7437 if (!(flags & SVp_POK)) {
7438 if ((flags & SVTYPEMASK) < SVt_PVNV)
7439 sv_upgrade(sv, SVt_NV);
7441 (void)SvNOK_only(sv);
7444 #ifdef PERL_PRESERVE_IVUV
7446 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7447 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7448 /* Need to try really hard to see if it's an integer.
7449 9.22337203685478e+18 is an integer.
7450 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7451 so $a="9.22337203685478e+18"; $a+0; $a--
7452 needs to be the same as $a="9.22337203685478e+18"; $a--
7459 /* sv_2iv *should* have made this an NV */
7460 if (flags & SVp_NOK) {
7461 (void)SvNOK_only(sv);
7462 SvNV_set(sv, SvNVX(sv) - 1.0);
7465 /* I don't think we can get here. Maybe I should assert this
7466 And if we do get here I suspect that sv_setnv will croak. NWC
7468 #if defined(USE_LONG_DOUBLE)
7469 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",
7470 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7472 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7473 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7477 #endif /* PERL_PRESERVE_IVUV */
7478 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7482 =for apidoc sv_mortalcopy
7484 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7485 The new SV is marked as mortal. It will be destroyed "soon", either by an
7486 explicit call to FREETMPS, or by an implicit call at places such as
7487 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7492 /* Make a string that will exist for the duration of the expression
7493 * evaluation. Actually, it may have to last longer than that, but
7494 * hopefully we won't free it until it has been assigned to a
7495 * permanent location. */
7498 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7503 sv_setsv(sv,oldstr);
7505 PL_tmps_stack[++PL_tmps_ix] = sv;
7511 =for apidoc sv_newmortal
7513 Creates a new null SV which is mortal. The reference count of the SV is
7514 set to 1. It will be destroyed "soon", either by an explicit call to
7515 FREETMPS, or by an implicit call at places such as statement boundaries.
7516 See also C<sv_mortalcopy> and C<sv_2mortal>.
7522 Perl_sv_newmortal(pTHX)
7527 SvFLAGS(sv) = SVs_TEMP;
7529 PL_tmps_stack[++PL_tmps_ix] = sv;
7534 =for apidoc sv_2mortal
7536 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7537 by an explicit call to FREETMPS, or by an implicit call at places such as
7538 statement boundaries. SvTEMP() is turned on which means that the SV's
7539 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7540 and C<sv_mortalcopy>.
7546 Perl_sv_2mortal(pTHX_ register SV *sv)
7551 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7554 PL_tmps_stack[++PL_tmps_ix] = sv;
7562 Creates a new SV and copies a string into it. The reference count for the
7563 SV is set to 1. If C<len> is zero, Perl will compute the length using
7564 strlen(). For efficiency, consider using C<newSVpvn> instead.
7570 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7577 sv_setpvn(sv,s,len);
7582 =for apidoc newSVpvn
7584 Creates a new SV and copies a string into it. The reference count for the
7585 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7586 string. You are responsible for ensuring that the source string is at least
7587 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7593 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7598 sv_setpvn(sv,s,len);
7603 =for apidoc newSVpvn_share
7605 Creates a new SV with its SvPVX pointing to a shared string in the string
7606 table. If the string does not already exist in the table, it is created
7607 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7608 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7609 otherwise the hash is computed. The idea here is that as the string table
7610 is used for shared hash keys these strings will have SvPVX == HeKEY and
7611 hash lookup will avoid string compare.
7617 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7620 bool is_utf8 = FALSE;
7622 STRLEN tmplen = -len;
7624 /* See the note in hv.c:hv_fetch() --jhi */
7625 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7629 PERL_HASH(hash, src, len);
7631 sv_upgrade(sv, SVt_PVIV);
7632 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7645 #if defined(PERL_IMPLICIT_CONTEXT)
7647 /* pTHX_ magic can't cope with varargs, so this is a no-context
7648 * version of the main function, (which may itself be aliased to us).
7649 * Don't access this version directly.
7653 Perl_newSVpvf_nocontext(const char* pat, ...)
7658 va_start(args, pat);
7659 sv = vnewSVpvf(pat, &args);
7666 =for apidoc newSVpvf
7668 Creates a new SV and initializes it with the string formatted like
7675 Perl_newSVpvf(pTHX_ const char* pat, ...)
7679 va_start(args, pat);
7680 sv = vnewSVpvf(pat, &args);
7685 /* backend for newSVpvf() and newSVpvf_nocontext() */
7688 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7692 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7699 Creates a new SV and copies a floating point value into it.
7700 The reference count for the SV is set to 1.
7706 Perl_newSVnv(pTHX_ NV n)
7718 Creates a new SV and copies an integer into it. The reference count for the
7725 Perl_newSViv(pTHX_ IV i)
7737 Creates a new SV and copies an unsigned integer into it.
7738 The reference count for the SV is set to 1.
7744 Perl_newSVuv(pTHX_ UV u)
7754 =for apidoc newRV_noinc
7756 Creates an RV wrapper for an SV. The reference count for the original
7757 SV is B<not> incremented.
7763 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7768 sv_upgrade(sv, SVt_RV);
7770 SvRV_set(sv, tmpRef);
7775 /* newRV_inc is the official function name to use now.
7776 * newRV_inc is in fact #defined to newRV in sv.h
7780 Perl_newRV(pTHX_ SV *tmpRef)
7782 return newRV_noinc(SvREFCNT_inc(tmpRef));
7788 Creates a new SV which is an exact duplicate of the original SV.
7795 Perl_newSVsv(pTHX_ register SV *old)
7801 if (SvTYPE(old) == SVTYPEMASK) {
7802 if (ckWARN_d(WARN_INTERNAL))
7803 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7807 /* SV_GMAGIC is the default for sv_setv()
7808 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7809 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7810 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7815 =for apidoc sv_reset
7817 Underlying implementation for the C<reset> Perl function.
7818 Note that the perl-level function is vaguely deprecated.
7824 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7832 char todo[PERL_UCHAR_MAX+1];
7837 if (!*s) { /* reset ?? searches */
7838 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7840 PMOP *pm = (PMOP *) mg->mg_obj;
7842 pm->op_pmdynflags &= ~PMdf_USED;
7849 /* reset variables */
7851 if (!HvARRAY(stash))
7854 Zero(todo, 256, char);
7856 i = (unsigned char)*s;
7860 max = (unsigned char)*s++;
7861 for ( ; i <= max; i++) {
7864 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7865 for (entry = HvARRAY(stash)[i];
7867 entry = HeNEXT(entry))
7869 if (!todo[(U8)*HeKEY(entry)])
7871 gv = (GV*)HeVAL(entry);
7873 if (SvTHINKFIRST(sv)) {
7874 if (!SvREADONLY(sv) && SvROK(sv))
7879 if (SvTYPE(sv) >= SVt_PV) {
7881 if (SvPVX(sv) != Nullch)
7888 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7891 #ifdef USE_ENVIRON_ARRAY
7893 # ifdef USE_ITHREADS
7894 && PL_curinterp == aTHX
7898 environ[0] = Nullch;
7901 #endif /* !PERL_MICRO */
7911 Using various gambits, try to get an IO from an SV: the IO slot if its a
7912 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7913 named after the PV if we're a string.
7919 Perl_sv_2io(pTHX_ SV *sv)
7924 switch (SvTYPE(sv)) {
7932 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7936 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7938 return sv_2io(SvRV(sv));
7939 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7945 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7954 Using various gambits, try to get a CV from an SV; in addition, try if
7955 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7961 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7968 return *gvp = Nullgv, Nullcv;
7969 switch (SvTYPE(sv)) {
7988 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7989 tryAMAGICunDEREF(to_cv);
7992 if (SvTYPE(sv) == SVt_PVCV) {
8001 Perl_croak(aTHX_ "Not a subroutine reference");
8006 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8012 if (lref && !GvCVu(gv)) {
8015 tmpsv = NEWSV(704,0);
8016 gv_efullname3(tmpsv, gv, Nullch);
8017 /* XXX this is probably not what they think they're getting.
8018 * It has the same effect as "sub name;", i.e. just a forward
8020 newSUB(start_subparse(FALSE, 0),
8021 newSVOP(OP_CONST, 0, tmpsv),
8026 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8036 Returns true if the SV has a true value by Perl's rules.
8037 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8038 instead use an in-line version.
8044 Perl_sv_true(pTHX_ register SV *sv)
8049 const register XPV* tXpv;
8050 if ((tXpv = (XPV*)SvANY(sv)) &&
8051 (tXpv->xpv_cur > 1 ||
8052 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
8059 return SvIVX(sv) != 0;
8062 return SvNVX(sv) != 0.0;
8064 return sv_2bool(sv);
8072 A private implementation of the C<SvIVx> macro for compilers which can't
8073 cope with complex macro expressions. Always use the macro instead.
8079 Perl_sv_iv(pTHX_ register SV *sv)
8083 return (IV)SvUVX(sv);
8092 A private implementation of the C<SvUVx> macro for compilers which can't
8093 cope with complex macro expressions. Always use the macro instead.
8099 Perl_sv_uv(pTHX_ register SV *sv)
8104 return (UV)SvIVX(sv);
8112 A private implementation of the C<SvNVx> macro for compilers which can't
8113 cope with complex macro expressions. Always use the macro instead.
8119 Perl_sv_nv(pTHX_ register SV *sv)
8126 /* sv_pv() is now a macro using SvPV_nolen();
8127 * this function provided for binary compatibility only
8131 Perl_sv_pv(pTHX_ SV *sv)
8138 return sv_2pv(sv, &n_a);
8144 Use the C<SvPV_nolen> macro instead
8148 A private implementation of the C<SvPV> macro for compilers which can't
8149 cope with complex macro expressions. Always use the macro instead.
8155 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8161 return sv_2pv(sv, lp);
8166 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8172 return sv_2pv_flags(sv, lp, 0);
8175 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8176 * this function provided for binary compatibility only
8180 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8182 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8186 =for apidoc sv_pvn_force
8188 Get a sensible string out of the SV somehow.
8189 A private implementation of the C<SvPV_force> macro for compilers which
8190 can't cope with complex macro expressions. Always use the macro instead.
8192 =for apidoc sv_pvn_force_flags
8194 Get a sensible string out of the SV somehow.
8195 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8196 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8197 implemented in terms of this function.
8198 You normally want to use the various wrapper macros instead: see
8199 C<SvPV_force> and C<SvPV_force_nomg>
8205 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8208 if (SvTHINKFIRST(sv) && !SvROK(sv))
8209 sv_force_normal_flags(sv, 0);
8216 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8217 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8221 s = sv_2pv_flags(sv, lp, flags);
8222 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8223 const STRLEN len = *lp;
8227 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8228 SvGROW(sv, len + 1);
8229 Move(s,SvPVX(sv),len,char);
8234 SvPOK_on(sv); /* validate pointer */
8236 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8237 PTR2UV(sv),SvPVX(sv)));
8243 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8244 * this function provided for binary compatibility only
8248 Perl_sv_pvbyte(pTHX_ SV *sv)
8250 sv_utf8_downgrade(sv,0);
8255 =for apidoc sv_pvbyte
8257 Use C<SvPVbyte_nolen> instead.
8259 =for apidoc sv_pvbyten
8261 A private implementation of the C<SvPVbyte> macro for compilers
8262 which can't cope with complex macro expressions. Always use the macro
8269 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8271 sv_utf8_downgrade(sv,0);
8272 return sv_pvn(sv,lp);
8276 =for apidoc sv_pvbyten_force
8278 A private implementation of the C<SvPVbytex_force> macro for compilers
8279 which can't cope with complex macro expressions. Always use the macro
8286 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8288 sv_pvn_force(sv,lp);
8289 sv_utf8_downgrade(sv,0);
8294 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8295 * this function provided for binary compatibility only
8299 Perl_sv_pvutf8(pTHX_ SV *sv)
8301 sv_utf8_upgrade(sv);
8306 =for apidoc sv_pvutf8
8308 Use the C<SvPVutf8_nolen> macro instead
8310 =for apidoc sv_pvutf8n
8312 A private implementation of the C<SvPVutf8> macro for compilers
8313 which can't cope with complex macro expressions. Always use the macro
8320 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8322 sv_utf8_upgrade(sv);
8323 return sv_pvn(sv,lp);
8327 =for apidoc sv_pvutf8n_force
8329 A private implementation of the C<SvPVutf8_force> macro for compilers
8330 which can't cope with complex macro expressions. Always use the macro
8337 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8339 sv_pvn_force(sv,lp);
8340 sv_utf8_upgrade(sv);
8346 =for apidoc sv_reftype
8348 Returns a string describing what the SV is a reference to.
8354 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8356 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8357 inside return suggests a const propagation bug in g++. */
8358 if (ob && SvOBJECT(sv)) {
8359 char *name = HvNAME_get(SvSTASH(sv));
8360 return name ? name : (char *) "__ANON__";
8363 switch (SvTYPE(sv)) {
8380 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8381 /* tied lvalues should appear to be
8382 * scalars for backwards compatitbility */
8383 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8384 ? "SCALAR" : "LVALUE");
8385 case SVt_PVAV: return "ARRAY";
8386 case SVt_PVHV: return "HASH";
8387 case SVt_PVCV: return "CODE";
8388 case SVt_PVGV: return "GLOB";
8389 case SVt_PVFM: return "FORMAT";
8390 case SVt_PVIO: return "IO";
8391 default: return "UNKNOWN";
8397 =for apidoc sv_isobject
8399 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8400 object. If the SV is not an RV, or if the object is not blessed, then this
8407 Perl_sv_isobject(pTHX_ SV *sv)
8424 Returns a boolean indicating whether the SV is blessed into the specified
8425 class. This does not check for subtypes; use C<sv_derived_from> to verify
8426 an inheritance relationship.
8432 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8444 hvname = HvNAME_get(SvSTASH(sv));
8448 return strEQ(hvname, name);
8454 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8455 it will be upgraded to one. If C<classname> is non-null then the new SV will
8456 be blessed in the specified package. The new SV is returned and its
8457 reference count is 1.
8463 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8469 SV_CHECK_THINKFIRST_COW_DROP(rv);
8472 if (SvTYPE(rv) >= SVt_PVMG) {
8473 const U32 refcnt = SvREFCNT(rv);
8477 SvREFCNT(rv) = refcnt;
8480 if (SvTYPE(rv) < SVt_RV)
8481 sv_upgrade(rv, SVt_RV);
8482 else if (SvTYPE(rv) > SVt_RV) {
8493 HV* stash = gv_stashpv(classname, TRUE);
8494 (void)sv_bless(rv, stash);
8500 =for apidoc sv_setref_pv
8502 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8503 argument will be upgraded to an RV. That RV will be modified to point to
8504 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8505 into the SV. The C<classname> argument indicates the package for the
8506 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8507 will have a reference count of 1, and the RV will be returned.
8509 Do not use with other Perl types such as HV, AV, SV, CV, because those
8510 objects will become corrupted by the pointer copy process.
8512 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8518 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8521 sv_setsv(rv, &PL_sv_undef);
8525 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8530 =for apidoc sv_setref_iv
8532 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8533 argument will be upgraded to an RV. That RV will be modified to point to
8534 the new SV. The C<classname> argument indicates the package for the
8535 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8536 will have a reference count of 1, and the RV will be returned.
8542 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8544 sv_setiv(newSVrv(rv,classname), iv);
8549 =for apidoc sv_setref_uv
8551 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8552 argument will be upgraded to an RV. That RV will be modified to point to
8553 the new SV. The C<classname> argument indicates the package for the
8554 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8555 will have a reference count of 1, and the RV will be returned.
8561 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8563 sv_setuv(newSVrv(rv,classname), uv);
8568 =for apidoc sv_setref_nv
8570 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8571 argument will be upgraded to an RV. That RV will be modified to point to
8572 the new SV. The C<classname> argument indicates the package for the
8573 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8574 will have a reference count of 1, and the RV will be returned.
8580 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8582 sv_setnv(newSVrv(rv,classname), nv);
8587 =for apidoc sv_setref_pvn
8589 Copies a string into a new SV, optionally blessing the SV. The length of the
8590 string must be specified with C<n>. The C<rv> argument will be upgraded to
8591 an RV. That RV will be modified to point to the new SV. The C<classname>
8592 argument indicates the package for the blessing. Set C<classname> to
8593 C<Nullch> to avoid the blessing. The new SV will have a reference count
8594 of 1, and the RV will be returned.
8596 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8602 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8604 sv_setpvn(newSVrv(rv,classname), pv, n);
8609 =for apidoc sv_bless
8611 Blesses an SV into a specified package. The SV must be an RV. The package
8612 must be designated by its stash (see C<gv_stashpv()>). The reference count
8613 of the SV is unaffected.
8619 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8623 Perl_croak(aTHX_ "Can't bless non-reference value");
8625 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8626 if (SvREADONLY(tmpRef))
8627 Perl_croak(aTHX_ PL_no_modify);
8628 if (SvOBJECT(tmpRef)) {
8629 if (SvTYPE(tmpRef) != SVt_PVIO)
8631 SvREFCNT_dec(SvSTASH(tmpRef));
8634 SvOBJECT_on(tmpRef);
8635 if (SvTYPE(tmpRef) != SVt_PVIO)
8637 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8638 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8645 if(SvSMAGICAL(tmpRef))
8646 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8654 /* Downgrades a PVGV to a PVMG.
8658 S_sv_unglob(pTHX_ SV *sv)
8662 assert(SvTYPE(sv) == SVt_PVGV);
8667 SvREFCNT_dec(GvSTASH(sv));
8668 GvSTASH(sv) = Nullhv;
8670 sv_unmagic(sv, PERL_MAGIC_glob);
8671 Safefree(GvNAME(sv));
8674 /* need to keep SvANY(sv) in the right arena */
8675 xpvmg = new_XPVMG();
8676 StructCopy(SvANY(sv), xpvmg, XPVMG);
8677 del_XPVGV(SvANY(sv));
8680 SvFLAGS(sv) &= ~SVTYPEMASK;
8681 SvFLAGS(sv) |= SVt_PVMG;
8685 =for apidoc sv_unref_flags
8687 Unsets the RV status of the SV, and decrements the reference count of
8688 whatever was being referenced by the RV. This can almost be thought of
8689 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8690 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8691 (otherwise the decrementing is conditional on the reference count being
8692 different from one or the reference being a readonly SV).
8699 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8703 if (SvWEAKREF(sv)) {
8711 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8712 assigned to as BEGIN {$a = \"Foo"} will fail. */
8713 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8715 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8716 sv_2mortal(rv); /* Schedule for freeing later */
8720 =for apidoc sv_unref
8722 Unsets the RV status of the SV, and decrements the reference count of
8723 whatever was being referenced by the RV. This can almost be thought of
8724 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8725 being zero. See C<SvROK_off>.
8731 Perl_sv_unref(pTHX_ SV *sv)
8733 sv_unref_flags(sv, 0);
8737 =for apidoc sv_taint
8739 Taint an SV. Use C<SvTAINTED_on> instead.
8744 Perl_sv_taint(pTHX_ SV *sv)
8746 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8750 =for apidoc sv_untaint
8752 Untaint an SV. Use C<SvTAINTED_off> instead.
8757 Perl_sv_untaint(pTHX_ SV *sv)
8759 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8760 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8767 =for apidoc sv_tainted
8769 Test an SV for taintedness. Use C<SvTAINTED> instead.
8774 Perl_sv_tainted(pTHX_ SV *sv)
8776 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8777 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8778 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8785 =for apidoc sv_setpviv
8787 Copies an integer into the given SV, also updating its string value.
8788 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8794 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8796 char buf[TYPE_CHARS(UV)];
8798 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8800 sv_setpvn(sv, ptr, ebuf - ptr);
8804 =for apidoc sv_setpviv_mg
8806 Like C<sv_setpviv>, but also handles 'set' magic.
8812 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8814 char buf[TYPE_CHARS(UV)];
8816 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8818 sv_setpvn(sv, ptr, ebuf - ptr);
8822 #if defined(PERL_IMPLICIT_CONTEXT)
8824 /* pTHX_ magic can't cope with varargs, so this is a no-context
8825 * version of the main function, (which may itself be aliased to us).
8826 * Don't access this version directly.
8830 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8834 va_start(args, pat);
8835 sv_vsetpvf(sv, pat, &args);
8839 /* pTHX_ magic can't cope with varargs, so this is a no-context
8840 * version of the main function, (which may itself be aliased to us).
8841 * Don't access this version directly.
8845 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8849 va_start(args, pat);
8850 sv_vsetpvf_mg(sv, pat, &args);
8856 =for apidoc sv_setpvf
8858 Works like C<sv_catpvf> but copies the text into the SV instead of
8859 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8865 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8868 va_start(args, pat);
8869 sv_vsetpvf(sv, pat, &args);
8874 =for apidoc sv_vsetpvf
8876 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8877 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8879 Usually used via its frontend C<sv_setpvf>.
8885 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8887 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8891 =for apidoc sv_setpvf_mg
8893 Like C<sv_setpvf>, but also handles 'set' magic.
8899 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8902 va_start(args, pat);
8903 sv_vsetpvf_mg(sv, pat, &args);
8908 =for apidoc sv_vsetpvf_mg
8910 Like C<sv_vsetpvf>, but also handles 'set' magic.
8912 Usually used via its frontend C<sv_setpvf_mg>.
8918 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8920 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8924 #if defined(PERL_IMPLICIT_CONTEXT)
8926 /* pTHX_ magic can't cope with varargs, so this is a no-context
8927 * version of the main function, (which may itself be aliased to us).
8928 * Don't access this version directly.
8932 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8936 va_start(args, pat);
8937 sv_vcatpvf(sv, pat, &args);
8941 /* pTHX_ magic can't cope with varargs, so this is a no-context
8942 * version of the main function, (which may itself be aliased to us).
8943 * Don't access this version directly.
8947 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8951 va_start(args, pat);
8952 sv_vcatpvf_mg(sv, pat, &args);
8958 =for apidoc sv_catpvf
8960 Processes its arguments like C<sprintf> and appends the formatted
8961 output to an SV. If the appended data contains "wide" characters
8962 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8963 and characters >255 formatted with %c), the original SV might get
8964 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8965 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8966 valid UTF-8; if the original SV was bytes, the pattern should be too.
8971 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8974 va_start(args, pat);
8975 sv_vcatpvf(sv, pat, &args);
8980 =for apidoc sv_vcatpvf
8982 Processes its arguments like C<vsprintf> and appends the formatted output
8983 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8985 Usually used via its frontend C<sv_catpvf>.
8991 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8993 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8997 =for apidoc sv_catpvf_mg
8999 Like C<sv_catpvf>, but also handles 'set' magic.
9005 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9008 va_start(args, pat);
9009 sv_vcatpvf_mg(sv, pat, &args);
9014 =for apidoc sv_vcatpvf_mg
9016 Like C<sv_vcatpvf>, but also handles 'set' magic.
9018 Usually used via its frontend C<sv_catpvf_mg>.
9024 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9026 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9031 =for apidoc sv_vsetpvfn
9033 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9036 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9042 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9044 sv_setpvn(sv, "", 0);
9045 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9048 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9051 S_expect_number(pTHX_ char** pattern)
9054 switch (**pattern) {
9055 case '1': case '2': case '3':
9056 case '4': case '5': case '6':
9057 case '7': case '8': case '9':
9058 while (isDIGIT(**pattern))
9059 var = var * 10 + (*(*pattern)++ - '0');
9063 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9066 F0convert(NV nv, char *endbuf, STRLEN *len)
9068 const int neg = nv < 0;
9077 if (uv & 1 && uv == nv)
9078 uv--; /* Round to even */
9080 const unsigned dig = uv % 10;
9093 =for apidoc sv_vcatpvfn
9095 Processes its arguments like C<vsprintf> and appends the formatted output
9096 to an SV. Uses an array of SVs if the C style variable argument list is
9097 missing (NULL). When running with taint checks enabled, indicates via
9098 C<maybe_tainted> if results are untrustworthy (often due to the use of
9101 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9106 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9109 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9116 static const char nullstr[] = "(null)";
9118 bool has_utf8; /* has the result utf8? */
9119 bool pat_utf8; /* the pattern is in utf8? */
9121 /* Times 4: a decimal digit takes more than 3 binary digits.
9122 * NV_DIG: mantissa takes than many decimal digits.
9123 * Plus 32: Playing safe. */
9124 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9125 /* large enough for "%#.#f" --chip */
9126 /* what about long double NVs? --jhi */
9128 has_utf8 = pat_utf8 = DO_UTF8(sv);
9130 /* no matter what, this is a string now */
9131 (void)SvPV_force(sv, origlen);
9133 /* special-case "", "%s", and "%-p" (SVf) */
9136 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
9138 const char *s = va_arg(*args, char*);
9139 sv_catpv(sv, s ? s : nullstr);
9141 else if (svix < svmax) {
9142 sv_catsv(sv, *svargs);
9143 if (DO_UTF8(*svargs))
9148 if (patlen == 3 && pat[0] == '%' &&
9149 pat[1] == '-' && pat[2] == 'p') {
9151 argsv = va_arg(*args, SV*);
9152 sv_catsv(sv, argsv);
9159 #ifndef USE_LONG_DOUBLE
9160 /* special-case "%.<number>[gf]" */
9161 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9162 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9163 unsigned digits = 0;
9167 while (*pp >= '0' && *pp <= '9')
9168 digits = 10 * digits + (*pp++ - '0');
9169 if (pp - pat == (int)patlen - 1) {
9173 nv = (NV)va_arg(*args, double);
9174 else if (svix < svmax)
9179 /* Add check for digits != 0 because it seems that some
9180 gconverts are buggy in this case, and we don't yet have
9181 a Configure test for this. */
9182 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9183 /* 0, point, slack */
9184 Gconvert(nv, (int)digits, 0, ebuf);
9186 if (*ebuf) /* May return an empty string for digits==0 */
9189 } else if (!digits) {
9192 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9193 sv_catpvn(sv, p, l);
9199 #endif /* !USE_LONG_DOUBLE */
9201 if (!args && svix < svmax && DO_UTF8(*svargs))
9204 patend = (char*)pat + patlen;
9205 for (p = (char*)pat; p < patend; p = q) {
9208 bool vectorize = FALSE;
9209 bool vectorarg = FALSE;
9210 bool vec_utf8 = FALSE;
9216 bool has_precis = FALSE;
9219 bool is_utf8 = FALSE; /* is this item utf8? */
9220 #ifdef HAS_LDBL_SPRINTF_BUG
9221 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9222 with sfio - Allen <allens@cpan.org> */
9223 bool fix_ldbl_sprintf_bug = FALSE;
9227 U8 utf8buf[UTF8_MAXBYTES+1];
9228 STRLEN esignlen = 0;
9230 char *eptr = Nullch;
9233 U8 *vecstr = Null(U8*);
9240 /* we need a long double target in case HAS_LONG_DOUBLE but
9243 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9251 const char *dotstr = ".";
9252 STRLEN dotstrlen = 1;
9253 I32 efix = 0; /* explicit format parameter index */
9254 I32 ewix = 0; /* explicit width index */
9255 I32 epix = 0; /* explicit precision index */
9256 I32 evix = 0; /* explicit vector index */
9257 bool asterisk = FALSE;
9259 /* echo everything up to the next format specification */
9260 for (q = p; q < patend && *q != '%'; ++q) ;
9262 if (has_utf8 && !pat_utf8)
9263 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9265 sv_catpvn(sv, p, q - p);
9272 We allow format specification elements in this order:
9273 \d+\$ explicit format parameter index
9275 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9276 0 flag (as above): repeated to allow "v02"
9277 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9278 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9280 [%bcdefginopsux_DFOUX] format (mandatory)
9282 if (EXPECT_NUMBER(q, width)) {
9323 if (EXPECT_NUMBER(q, ewix))
9332 if ((vectorarg = asterisk)) {
9344 EXPECT_NUMBER(q, width);
9349 vecsv = va_arg(*args, SV*);
9351 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9352 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9353 dotstr = SvPVx(vecsv, dotstrlen);
9358 vecsv = va_arg(*args, SV*);
9359 vecstr = (U8*)SvPVx(vecsv,veclen);
9360 vec_utf8 = DO_UTF8(vecsv);
9362 else if (efix ? efix <= svmax : svix < svmax) {
9363 vecsv = svargs[efix ? efix-1 : svix++];
9364 vecstr = (U8*)SvPVx(vecsv,veclen);
9365 vec_utf8 = DO_UTF8(vecsv);
9366 /* if this is a version object, we need to return the
9367 * stringified representation (which the SvPVX has
9368 * already done for us), but not vectorize the args
9370 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9372 q++; /* skip past the rest of the %vd format */
9373 eptr = (char *) vecstr;
9374 elen = strlen(eptr);
9387 i = va_arg(*args, int);
9389 i = (ewix ? ewix <= svmax : svix < svmax) ?
9390 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9392 width = (i < 0) ? -i : i;
9402 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9404 /* XXX: todo, support specified precision parameter */
9408 i = va_arg(*args, int);
9410 i = (ewix ? ewix <= svmax : svix < svmax)
9411 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9412 precis = (i < 0) ? 0 : i;
9417 precis = precis * 10 + (*q++ - '0');
9426 case 'I': /* Ix, I32x, and I64x */
9428 if (q[1] == '6' && q[2] == '4') {
9434 if (q[1] == '3' && q[2] == '2') {
9444 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9455 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9456 if (*(q + 1) == 'l') { /* lld, llf */
9481 argsv = (efix ? efix <= svmax : svix < svmax) ?
9482 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9489 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9491 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9493 eptr = (char*)utf8buf;
9494 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9505 if (args && !vectorize) {
9506 eptr = va_arg(*args, char*);
9508 #ifdef MACOS_TRADITIONAL
9509 /* On MacOS, %#s format is used for Pascal strings */
9514 elen = strlen(eptr);
9516 eptr = (char *)nullstr;
9517 elen = sizeof nullstr - 1;
9521 eptr = SvPVx(argsv, elen);
9522 if (DO_UTF8(argsv)) {
9523 if (has_precis && precis < elen) {
9525 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9528 if (width) { /* fudge width (can't fudge elen) */
9529 width += elen - sv_len_utf8(argsv);
9537 if (has_precis && elen > precis)
9544 if (left && args) { /* SVf */
9553 argsv = va_arg(*args, SV*);
9554 eptr = SvPVx(argsv, elen);
9559 if (alt || vectorize)
9561 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9579 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9588 esignbuf[esignlen++] = plus;
9592 case 'h': iv = (short)va_arg(*args, int); break;
9593 case 'l': iv = va_arg(*args, long); break;
9594 case 'V': iv = va_arg(*args, IV); break;
9595 default: iv = va_arg(*args, int); break;
9597 case 'q': iv = va_arg(*args, Quad_t); break;
9602 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9604 case 'h': iv = (short)tiv; break;
9605 case 'l': iv = (long)tiv; break;
9607 default: iv = tiv; break;
9609 case 'q': iv = (Quad_t)tiv; break;
9613 if ( !vectorize ) /* we already set uv above */
9618 esignbuf[esignlen++] = plus;
9622 esignbuf[esignlen++] = '-';
9665 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9676 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9677 case 'l': uv = va_arg(*args, unsigned long); break;
9678 case 'V': uv = va_arg(*args, UV); break;
9679 default: uv = va_arg(*args, unsigned); break;
9681 case 'q': uv = va_arg(*args, Uquad_t); break;
9686 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9688 case 'h': uv = (unsigned short)tuv; break;
9689 case 'l': uv = (unsigned long)tuv; break;
9691 default: uv = tuv; break;
9693 case 'q': uv = (Uquad_t)tuv; break;
9699 eptr = ebuf + sizeof ebuf;
9705 p = (char*)((c == 'X')
9706 ? "0123456789ABCDEF" : "0123456789abcdef");
9712 esignbuf[esignlen++] = '0';
9713 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9719 *--eptr = '0' + dig;
9721 if (alt && *eptr != '0')
9727 *--eptr = '0' + dig;
9730 esignbuf[esignlen++] = '0';
9731 esignbuf[esignlen++] = 'b';
9734 default: /* it had better be ten or less */
9737 *--eptr = '0' + dig;
9738 } while (uv /= base);
9741 elen = (ebuf + sizeof ebuf) - eptr;
9744 zeros = precis - elen;
9745 else if (precis == 0 && elen == 1 && *eptr == '0')
9750 /* FLOATING POINT */
9753 c = 'f'; /* maybe %F isn't supported here */
9759 /* This is evil, but floating point is even more evil */
9761 /* for SV-style calling, we can only get NV
9762 for C-style calling, we assume %f is double;
9763 for simplicity we allow any of %Lf, %llf, %qf for long double
9767 #if defined(USE_LONG_DOUBLE)
9771 /* [perl #20339] - we should accept and ignore %lf rather than die */
9775 #if defined(USE_LONG_DOUBLE)
9776 intsize = args ? 0 : 'q';
9780 #if defined(HAS_LONG_DOUBLE)
9789 /* now we need (long double) if intsize == 'q', else (double) */
9790 nv = (args && !vectorize) ?
9791 #if LONG_DOUBLESIZE > DOUBLESIZE
9793 va_arg(*args, long double) :
9794 va_arg(*args, double)
9796 va_arg(*args, double)
9802 if (c != 'e' && c != 'E') {
9804 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9805 will cast our (long double) to (double) */
9806 (void)Perl_frexp(nv, &i);
9807 if (i == PERL_INT_MIN)
9808 Perl_die(aTHX_ "panic: frexp");
9810 need = BIT_DIGITS(i);
9812 need += has_precis ? precis : 6; /* known default */
9817 #ifdef HAS_LDBL_SPRINTF_BUG
9818 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9819 with sfio - Allen <allens@cpan.org> */
9822 # define MY_DBL_MAX DBL_MAX
9823 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9824 # if DOUBLESIZE >= 8
9825 # define MY_DBL_MAX 1.7976931348623157E+308L
9827 # define MY_DBL_MAX 3.40282347E+38L
9831 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9832 # define MY_DBL_MAX_BUG 1L
9834 # define MY_DBL_MAX_BUG MY_DBL_MAX
9838 # define MY_DBL_MIN DBL_MIN
9839 # else /* XXX guessing! -Allen */
9840 # if DOUBLESIZE >= 8
9841 # define MY_DBL_MIN 2.2250738585072014E-308L
9843 # define MY_DBL_MIN 1.17549435E-38L
9847 if ((intsize == 'q') && (c == 'f') &&
9848 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9850 /* it's going to be short enough that
9851 * long double precision is not needed */
9853 if ((nv <= 0L) && (nv >= -0L))
9854 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9856 /* would use Perl_fp_class as a double-check but not
9857 * functional on IRIX - see perl.h comments */
9859 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9860 /* It's within the range that a double can represent */
9861 #if defined(DBL_MAX) && !defined(DBL_MIN)
9862 if ((nv >= ((long double)1/DBL_MAX)) ||
9863 (nv <= (-(long double)1/DBL_MAX)))
9865 fix_ldbl_sprintf_bug = TRUE;
9868 if (fix_ldbl_sprintf_bug == TRUE) {
9878 # undef MY_DBL_MAX_BUG
9881 #endif /* HAS_LDBL_SPRINTF_BUG */
9883 need += 20; /* fudge factor */
9884 if (PL_efloatsize < need) {
9885 Safefree(PL_efloatbuf);
9886 PL_efloatsize = need + 20; /* more fudge */
9887 New(906, PL_efloatbuf, PL_efloatsize, char);
9888 PL_efloatbuf[0] = '\0';
9891 if ( !(width || left || plus || alt) && fill != '0'
9892 && has_precis && intsize != 'q' ) { /* Shortcuts */
9893 /* See earlier comment about buggy Gconvert when digits,
9895 if ( c == 'g' && precis) {
9896 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9897 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9898 goto float_converted;
9899 } else if ( c == 'f' && !precis) {
9900 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9904 eptr = ebuf + sizeof ebuf;
9907 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9908 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9909 if (intsize == 'q') {
9910 /* Copy the one or more characters in a long double
9911 * format before the 'base' ([efgEFG]) character to
9912 * the format string. */
9913 static char const prifldbl[] = PERL_PRIfldbl;
9914 char const *p = prifldbl + sizeof(prifldbl) - 3;
9915 while (p >= prifldbl) { *--eptr = *p--; }
9920 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9925 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9937 /* No taint. Otherwise we are in the strange situation
9938 * where printf() taints but print($float) doesn't.
9940 #if defined(HAS_LONG_DOUBLE)
9942 (void)sprintf(PL_efloatbuf, eptr, nv);
9944 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9946 (void)sprintf(PL_efloatbuf, eptr, nv);
9949 eptr = PL_efloatbuf;
9950 elen = strlen(PL_efloatbuf);
9956 i = SvCUR(sv) - origlen;
9957 if (args && !vectorize) {
9959 case 'h': *(va_arg(*args, short*)) = i; break;
9960 default: *(va_arg(*args, int*)) = i; break;
9961 case 'l': *(va_arg(*args, long*)) = i; break;
9962 case 'V': *(va_arg(*args, IV*)) = i; break;
9964 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9969 sv_setuv_mg(argsv, (UV)i);
9971 continue; /* not "break" */
9977 if (!args && ckWARN(WARN_PRINTF) &&
9978 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9979 SV *msg = sv_newmortal();
9980 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9981 (PL_op->op_type == OP_PRTF) ? "" : "s");
9984 Perl_sv_catpvf(aTHX_ msg,
9985 "\"%%%c\"", c & 0xFF);
9987 Perl_sv_catpvf(aTHX_ msg,
9988 "\"%%\\%03"UVof"\"",
9991 sv_catpv(msg, "end of string");
9992 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9995 /* output mangled stuff ... */
10001 /* ... right here, because formatting flags should not apply */
10002 SvGROW(sv, SvCUR(sv) + elen + 1);
10004 Copy(eptr, p, elen, char);
10007 SvCUR_set(sv, p - SvPVX(sv));
10009 continue; /* not "break" */
10012 /* calculate width before utf8_upgrade changes it */
10013 have = esignlen + zeros + elen;
10015 if (is_utf8 != has_utf8) {
10018 sv_utf8_upgrade(sv);
10021 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10022 sv_utf8_upgrade(nsv);
10026 SvGROW(sv, SvCUR(sv) + elen + 1);
10031 need = (have > width ? have : width);
10034 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10036 if (esignlen && fill == '0') {
10037 for (i = 0; i < (int)esignlen; i++)
10038 *p++ = esignbuf[i];
10040 if (gap && !left) {
10041 memset(p, fill, gap);
10044 if (esignlen && fill != '0') {
10045 for (i = 0; i < (int)esignlen; i++)
10046 *p++ = esignbuf[i];
10049 for (i = zeros; i; i--)
10053 Copy(eptr, p, elen, char);
10057 memset(p, ' ', gap);
10062 Copy(dotstr, p, dotstrlen, char);
10066 vectorize = FALSE; /* done iterating over vecstr */
10073 SvCUR_set(sv, p - SvPVX(sv));
10081 /* =========================================================================
10083 =head1 Cloning an interpreter
10085 All the macros and functions in this section are for the private use of
10086 the main function, perl_clone().
10088 The foo_dup() functions make an exact copy of an existing foo thinngy.
10089 During the course of a cloning, a hash table is used to map old addresses
10090 to new addresses. The table is created and manipulated with the
10091 ptr_table_* functions.
10095 ============================================================================*/
10098 #if defined(USE_ITHREADS)
10100 #ifndef GpREFCNT_inc
10101 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10105 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10106 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10107 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10108 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10109 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10110 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10111 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10112 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10113 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10114 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10115 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10116 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10117 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10120 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10121 regcomp.c. AMS 20010712 */
10124 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10129 struct reg_substr_datum *s;
10132 return (REGEXP *)NULL;
10134 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10137 len = r->offsets[0];
10138 npar = r->nparens+1;
10140 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10141 Copy(r->program, ret->program, len+1, regnode);
10143 New(0, ret->startp, npar, I32);
10144 Copy(r->startp, ret->startp, npar, I32);
10145 New(0, ret->endp, npar, I32);
10146 Copy(r->startp, ret->startp, npar, I32);
10148 New(0, ret->substrs, 1, struct reg_substr_data);
10149 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10150 s->min_offset = r->substrs->data[i].min_offset;
10151 s->max_offset = r->substrs->data[i].max_offset;
10152 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10153 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10156 ret->regstclass = NULL;
10158 struct reg_data *d;
10159 const int count = r->data->count;
10161 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10162 char, struct reg_data);
10163 New(0, d->what, count, U8);
10166 for (i = 0; i < count; i++) {
10167 d->what[i] = r->data->what[i];
10168 switch (d->what[i]) {
10169 /* legal options are one of: sfpont
10170 see also regcomp.h and pregfree() */
10172 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10175 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10178 /* This is cheating. */
10179 New(0, d->data[i], 1, struct regnode_charclass_class);
10180 StructCopy(r->data->data[i], d->data[i],
10181 struct regnode_charclass_class);
10182 ret->regstclass = (regnode*)d->data[i];
10185 /* Compiled op trees are readonly, and can thus be
10186 shared without duplication. */
10188 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10192 d->data[i] = r->data->data[i];
10195 d->data[i] = r->data->data[i];
10197 ((reg_trie_data*)d->data[i])->refcount++;
10201 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10210 New(0, ret->offsets, 2*len+1, U32);
10211 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10213 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10214 ret->refcnt = r->refcnt;
10215 ret->minlen = r->minlen;
10216 ret->prelen = r->prelen;
10217 ret->nparens = r->nparens;
10218 ret->lastparen = r->lastparen;
10219 ret->lastcloseparen = r->lastcloseparen;
10220 ret->reganch = r->reganch;
10222 ret->sublen = r->sublen;
10224 if (RX_MATCH_COPIED(ret))
10225 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10227 ret->subbeg = Nullch;
10228 #ifdef PERL_COPY_ON_WRITE
10229 ret->saved_copy = Nullsv;
10232 ptr_table_store(PL_ptr_table, r, ret);
10236 /* duplicate a file handle */
10239 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10245 return (PerlIO*)NULL;
10247 /* look for it in the table first */
10248 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10252 /* create anew and remember what it is */
10253 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10254 ptr_table_store(PL_ptr_table, fp, ret);
10258 /* duplicate a directory handle */
10261 Perl_dirp_dup(pTHX_ DIR *dp)
10269 /* duplicate a typeglob */
10272 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10277 /* look for it in the table first */
10278 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10282 /* create anew and remember what it is */
10283 Newz(0, ret, 1, GP);
10284 ptr_table_store(PL_ptr_table, gp, ret);
10287 ret->gp_refcnt = 0; /* must be before any other dups! */
10288 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10289 ret->gp_io = io_dup_inc(gp->gp_io, param);
10290 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10291 ret->gp_av = av_dup_inc(gp->gp_av, param);
10292 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10293 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10294 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10295 ret->gp_cvgen = gp->gp_cvgen;
10296 ret->gp_flags = gp->gp_flags;
10297 ret->gp_line = gp->gp_line;
10298 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10302 /* duplicate a chain of magic */
10305 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10307 MAGIC *mgprev = (MAGIC*)NULL;
10310 return (MAGIC*)NULL;
10311 /* look for it in the table first */
10312 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10316 for (; mg; mg = mg->mg_moremagic) {
10318 Newz(0, nmg, 1, MAGIC);
10320 mgprev->mg_moremagic = nmg;
10323 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10324 nmg->mg_private = mg->mg_private;
10325 nmg->mg_type = mg->mg_type;
10326 nmg->mg_flags = mg->mg_flags;
10327 if (mg->mg_type == PERL_MAGIC_qr) {
10328 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10330 else if(mg->mg_type == PERL_MAGIC_backref) {
10331 const AV * const av = (AV*) mg->mg_obj;
10334 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10336 for (i = AvFILLp(av); i >= 0; i--) {
10337 if (!svp[i]) continue;
10338 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10341 else if (mg->mg_type == PERL_MAGIC_symtab) {
10342 nmg->mg_obj = mg->mg_obj;
10345 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10346 ? sv_dup_inc(mg->mg_obj, param)
10347 : sv_dup(mg->mg_obj, param);
10349 nmg->mg_len = mg->mg_len;
10350 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10351 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10352 if (mg->mg_len > 0) {
10353 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10354 if (mg->mg_type == PERL_MAGIC_overload_table &&
10355 AMT_AMAGIC((AMT*)mg->mg_ptr))
10357 AMT *amtp = (AMT*)mg->mg_ptr;
10358 AMT *namtp = (AMT*)nmg->mg_ptr;
10360 for (i = 1; i < NofAMmeth; i++) {
10361 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10365 else if (mg->mg_len == HEf_SVKEY)
10366 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10368 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10369 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10376 /* create a new pointer-mapping table */
10379 Perl_ptr_table_new(pTHX)
10382 Newz(0, tbl, 1, PTR_TBL_t);
10383 tbl->tbl_max = 511;
10384 tbl->tbl_items = 0;
10385 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10390 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10392 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10400 struct ptr_tbl_ent* pte;
10401 struct ptr_tbl_ent* pteend;
10402 New(0, pte, PERL_ARENA_SIZE/sizeof(struct ptr_tbl_ent), struct ptr_tbl_ent);
10403 pte->next = PL_pte_arenaroot;
10404 PL_pte_arenaroot = pte;
10406 pteend = &pte[PERL_ARENA_SIZE / sizeof(struct ptr_tbl_ent) - 1];
10407 PL_pte_root = ++pte;
10408 while (pte < pteend) {
10409 pte->next = pte + 1;
10415 STATIC struct ptr_tbl_ent*
10418 struct ptr_tbl_ent* pte;
10422 PL_pte_root = pte->next;
10427 S_del_pte(pTHX_ struct ptr_tbl_ent*p)
10429 p->next = PL_pte_root;
10433 /* map an existing pointer using a table */
10436 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10438 PTR_TBL_ENT_t *tblent;
10439 const UV hash = PTR_TABLE_HASH(sv);
10441 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10442 for (; tblent; tblent = tblent->next) {
10443 if (tblent->oldval == sv)
10444 return tblent->newval;
10446 return (void*)NULL;
10449 /* add a new entry to a pointer-mapping table */
10452 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10454 PTR_TBL_ENT_t *tblent, **otblent;
10455 /* XXX this may be pessimal on platforms where pointers aren't good
10456 * hash values e.g. if they grow faster in the most significant
10458 const UV hash = PTR_TABLE_HASH(oldv);
10462 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10463 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10464 if (tblent->oldval == oldv) {
10465 tblent->newval = newv;
10469 tblent = S_new_pte(aTHX);
10470 tblent->oldval = oldv;
10471 tblent->newval = newv;
10472 tblent->next = *otblent;
10475 if (!empty && tbl->tbl_items > tbl->tbl_max)
10476 ptr_table_split(tbl);
10479 /* double the hash bucket size of an existing ptr table */
10482 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10484 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10485 const UV oldsize = tbl->tbl_max + 1;
10486 UV newsize = oldsize * 2;
10489 Renew(ary, newsize, PTR_TBL_ENT_t*);
10490 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10491 tbl->tbl_max = --newsize;
10492 tbl->tbl_ary = ary;
10493 for (i=0; i < oldsize; i++, ary++) {
10494 PTR_TBL_ENT_t **curentp, **entp, *ent;
10497 curentp = ary + oldsize;
10498 for (entp = ary, ent = *ary; ent; ent = *entp) {
10499 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10501 ent->next = *curentp;
10511 /* remove all the entries from a ptr table */
10514 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10516 register PTR_TBL_ENT_t **array;
10517 register PTR_TBL_ENT_t *entry;
10521 if (!tbl || !tbl->tbl_items) {
10525 array = tbl->tbl_ary;
10527 max = tbl->tbl_max;
10531 PTR_TBL_ENT_t *oentry = entry;
10532 entry = entry->next;
10533 S_del_pte(aTHX_ oentry);
10536 if (++riter > max) {
10539 entry = array[riter];
10543 tbl->tbl_items = 0;
10546 /* clear and free a ptr table */
10549 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10554 ptr_table_clear(tbl);
10555 Safefree(tbl->tbl_ary);
10559 /* attempt to make everything in the typeglob readonly */
10562 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10564 GV *gv = (GV*)sstr;
10565 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10567 if (GvIO(gv) || GvFORM(gv)) {
10568 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10570 else if (!GvCV(gv)) {
10571 GvCV(gv) = (CV*)sv;
10574 /* CvPADLISTs cannot be shared */
10575 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10580 if (!GvUNIQUE(gv)) {
10582 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10583 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10589 * write attempts will die with
10590 * "Modification of a read-only value attempted"
10596 SvREADONLY_on(GvSV(gv));
10600 GvAV(gv) = (AV*)sv;
10603 SvREADONLY_on(GvAV(gv));
10607 GvHV(gv) = (HV*)sv;
10610 SvREADONLY_on(GvHV(gv));
10613 return sstr; /* he_dup() will SvREFCNT_inc() */
10616 /* duplicate an SV of any type (including AV, HV etc) */
10619 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10622 SvRV_set(dstr, SvWEAKREF(sstr)
10623 ? sv_dup(SvRV(sstr), param)
10624 : sv_dup_inc(SvRV(sstr), param));
10627 else if (SvPVX(sstr)) {
10628 /* Has something there */
10630 /* Normal PV - clone whole allocated space */
10631 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10632 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10633 /* Not that normal - actually sstr is copy on write.
10634 But we are a true, independant SV, so: */
10635 SvREADONLY_off(dstr);
10640 /* Special case - not normally malloced for some reason */
10641 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10642 /* A "shared" PV - clone it as unshared string */
10643 if(SvPADTMP(sstr)) {
10644 /* However, some of them live in the pad
10645 and they should not have these flags
10648 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10650 SvUV_set(dstr, SvUVX(sstr));
10653 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10655 SvREADONLY_off(dstr);
10659 /* Some other special case - random pointer */
10660 SvPV_set(dstr, SvPVX(sstr));
10665 /* Copy the Null */
10666 if (SvTYPE(dstr) == SVt_RV)
10667 SvRV_set(dstr, NULL);
10674 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10679 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10681 /* look for it in the table first */
10682 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10686 if(param->flags & CLONEf_JOIN_IN) {
10687 /** We are joining here so we don't want do clone
10688 something that is bad **/
10689 const char *hvname;
10691 if(SvTYPE(sstr) == SVt_PVHV &&
10692 (hvname = HvNAME_get(sstr))) {
10693 /** don't clone stashes if they already exist **/
10694 HV* old_stash = gv_stashpv(hvname,0);
10695 return (SV*) old_stash;
10699 /* create anew and remember what it is */
10702 #ifdef DEBUG_LEAKING_SCALARS
10703 dstr->sv_debug_optype = sstr->sv_debug_optype;
10704 dstr->sv_debug_line = sstr->sv_debug_line;
10705 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10706 dstr->sv_debug_cloned = 1;
10708 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10710 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10714 ptr_table_store(PL_ptr_table, sstr, dstr);
10717 SvFLAGS(dstr) = SvFLAGS(sstr);
10718 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10719 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10722 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10723 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10724 PL_watch_pvx, SvPVX(sstr));
10727 /* don't clone objects whose class has asked us not to */
10728 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10729 SvFLAGS(dstr) &= ~SVTYPEMASK;
10730 SvOBJECT_off(dstr);
10734 switch (SvTYPE(sstr)) {
10736 SvANY(dstr) = NULL;
10739 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10740 SvIV_set(dstr, SvIVX(sstr));
10743 SvANY(dstr) = new_XNV();
10744 SvNV_set(dstr, SvNVX(sstr));
10747 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10748 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10751 SvANY(dstr) = new_XPV();
10752 SvCUR_set(dstr, SvCUR(sstr));
10753 SvLEN_set(dstr, SvLEN(sstr));
10754 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10757 SvANY(dstr) = new_XPVIV();
10758 SvCUR_set(dstr, SvCUR(sstr));
10759 SvLEN_set(dstr, SvLEN(sstr));
10760 SvIV_set(dstr, SvIVX(sstr));
10761 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10764 SvANY(dstr) = new_XPVNV();
10765 SvCUR_set(dstr, SvCUR(sstr));
10766 SvLEN_set(dstr, SvLEN(sstr));
10767 SvIV_set(dstr, SvIVX(sstr));
10768 SvNV_set(dstr, SvNVX(sstr));
10769 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10772 SvANY(dstr) = new_XPVMG();
10773 SvCUR_set(dstr, SvCUR(sstr));
10774 SvLEN_set(dstr, SvLEN(sstr));
10775 SvIV_set(dstr, SvIVX(sstr));
10776 SvNV_set(dstr, SvNVX(sstr));
10777 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10778 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10779 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10782 SvANY(dstr) = new_XPVBM();
10783 SvCUR_set(dstr, SvCUR(sstr));
10784 SvLEN_set(dstr, SvLEN(sstr));
10785 SvIV_set(dstr, SvIVX(sstr));
10786 SvNV_set(dstr, SvNVX(sstr));
10787 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10788 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10789 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10790 BmRARE(dstr) = BmRARE(sstr);
10791 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10792 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10795 SvANY(dstr) = new_XPVLV();
10796 SvCUR_set(dstr, SvCUR(sstr));
10797 SvLEN_set(dstr, SvLEN(sstr));
10798 SvIV_set(dstr, SvIVX(sstr));
10799 SvNV_set(dstr, SvNVX(sstr));
10800 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10801 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10802 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10803 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10804 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10805 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10806 LvTARG(dstr) = dstr;
10807 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10808 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10810 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10811 LvTYPE(dstr) = LvTYPE(sstr);
10814 if (GvUNIQUE((GV*)sstr)) {
10816 if ((share = gv_share(sstr, param))) {
10819 ptr_table_store(PL_ptr_table, sstr, dstr);
10821 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10822 HvNAME_get(GvSTASH(share)), GvNAME(share));
10827 SvANY(dstr) = new_XPVGV();
10828 SvCUR_set(dstr, SvCUR(sstr));
10829 SvLEN_set(dstr, SvLEN(sstr));
10830 SvIV_set(dstr, SvIVX(sstr));
10831 SvNV_set(dstr, SvNVX(sstr));
10832 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10833 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10834 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10835 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10836 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10837 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10838 GvFLAGS(dstr) = GvFLAGS(sstr);
10839 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10840 (void)GpREFCNT_inc(GvGP(dstr));
10843 SvANY(dstr) = new_XPVIO();
10844 SvCUR_set(dstr, SvCUR(sstr));
10845 SvLEN_set(dstr, SvLEN(sstr));
10846 SvIV_set(dstr, SvIVX(sstr));
10847 SvNV_set(dstr, SvNVX(sstr));
10848 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10849 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10850 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10851 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10852 if (IoOFP(sstr) == IoIFP(sstr))
10853 IoOFP(dstr) = IoIFP(dstr);
10855 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10856 /* PL_rsfp_filters entries have fake IoDIRP() */
10857 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10858 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10860 IoDIRP(dstr) = IoDIRP(sstr);
10861 IoLINES(dstr) = IoLINES(sstr);
10862 IoPAGE(dstr) = IoPAGE(sstr);
10863 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10864 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10865 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10866 /* I have no idea why fake dirp (rsfps)
10867 should be treaded differently but otherwise
10868 we end up with leaks -- sky*/
10869 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10870 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10871 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10873 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10874 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10875 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10877 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10878 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10879 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10880 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10881 IoTYPE(dstr) = IoTYPE(sstr);
10882 IoFLAGS(dstr) = IoFLAGS(sstr);
10885 SvANY(dstr) = new_XPVAV();
10886 SvCUR_set(dstr, SvCUR(sstr));
10887 SvLEN_set(dstr, SvLEN(sstr));
10888 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10889 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10890 if (AvARRAY((AV*)sstr)) {
10891 SV **dst_ary, **src_ary;
10892 SSize_t items = AvFILLp((AV*)sstr) + 1;
10894 src_ary = AvARRAY((AV*)sstr);
10895 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10896 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10897 SvPV_set(dstr, (char*)dst_ary);
10898 AvALLOC((AV*)dstr) = dst_ary;
10899 if (AvREAL((AV*)sstr)) {
10900 while (items-- > 0)
10901 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10904 while (items-- > 0)
10905 *dst_ary++ = sv_dup(*src_ary++, param);
10907 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10908 while (items-- > 0) {
10909 *dst_ary++ = &PL_sv_undef;
10913 SvPV_set(dstr, Nullch);
10914 AvALLOC((AV*)dstr) = (SV**)NULL;
10918 SvANY(dstr) = new_XPVHV();
10919 SvCUR_set(dstr, SvCUR(sstr));
10920 SvLEN_set(dstr, SvLEN(sstr));
10921 HvTOTALKEYS(dstr) = HvTOTALKEYS(sstr);
10922 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10923 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10927 if (HvARRAY((HV*)sstr)) {
10929 bool sharekeys = !!HvSHAREKEYS(sstr);
10930 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10931 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10934 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10935 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0), char);
10936 HvARRAY(dstr) = (HE**)darray;
10937 while (i <= sxhv->xhv_max) {
10938 HE *source = HvARRAY(sstr)[i];
10940 = source ? he_dup(source, sharekeys, param) : 0;
10944 struct xpvhv_aux *saux = HvAUX(sstr);
10945 struct xpvhv_aux *daux = HvAUX(dstr);
10946 /* This flag isn't copied. */
10947 /* SvOOK_on(hv) attacks the IV flags. */
10948 SvFLAGS(dstr) |= SVf_OOK;
10950 hvname = saux->xhv_name;
10951 daux->xhv_name = hvname ? hek_dup(hvname, param) : hvname;
10953 daux->xhv_riter = saux->xhv_riter;
10954 daux->xhv_eiter = saux->xhv_eiter
10955 ? he_dup(saux->xhv_eiter, (bool)!!HvSHAREKEYS(sstr),
10960 SvPV_set(dstr, Nullch);
10962 /* Record stashes for possible cloning in Perl_clone(). */
10964 av_push(param->stashes, dstr);
10968 SvANY(dstr) = new_XPVFM();
10969 FmLINES(dstr) = FmLINES(sstr);
10973 SvANY(dstr) = new_XPVCV();
10975 SvCUR_set(dstr, SvCUR(sstr));
10976 SvLEN_set(dstr, SvLEN(sstr));
10977 SvIV_set(dstr, SvIVX(sstr));
10978 SvNV_set(dstr, SvNVX(sstr));
10979 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10980 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10981 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10982 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10983 CvSTART(dstr) = CvSTART(sstr);
10985 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10987 CvXSUB(dstr) = CvXSUB(sstr);
10988 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10989 if (CvCONST(sstr)) {
10990 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10991 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10992 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
10994 /* don't dup if copying back - CvGV isn't refcounted, so the
10995 * duped GV may never be freed. A bit of a hack! DAPM */
10996 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10997 Nullgv : gv_dup(CvGV(sstr), param) ;
10998 if (param->flags & CLONEf_COPY_STACKS) {
10999 CvDEPTH(dstr) = CvDEPTH(sstr);
11003 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
11004 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
11006 CvWEAKOUTSIDE(sstr)
11007 ? cv_dup( CvOUTSIDE(sstr), param)
11008 : cv_dup_inc(CvOUTSIDE(sstr), param);
11009 CvFLAGS(dstr) = CvFLAGS(sstr);
11010 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
11013 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
11017 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
11023 /* duplicate a context */
11026 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11028 PERL_CONTEXT *ncxs;
11031 return (PERL_CONTEXT*)NULL;
11033 /* look for it in the table first */
11034 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11038 /* create anew and remember what it is */
11039 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11040 ptr_table_store(PL_ptr_table, cxs, ncxs);
11043 PERL_CONTEXT *cx = &cxs[ix];
11044 PERL_CONTEXT *ncx = &ncxs[ix];
11045 ncx->cx_type = cx->cx_type;
11046 if (CxTYPE(cx) == CXt_SUBST) {
11047 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11050 ncx->blk_oldsp = cx->blk_oldsp;
11051 ncx->blk_oldcop = cx->blk_oldcop;
11052 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11053 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11054 ncx->blk_oldpm = cx->blk_oldpm;
11055 ncx->blk_gimme = cx->blk_gimme;
11056 switch (CxTYPE(cx)) {
11058 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11059 ? cv_dup_inc(cx->blk_sub.cv, param)
11060 : cv_dup(cx->blk_sub.cv,param));
11061 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11062 ? av_dup_inc(cx->blk_sub.argarray, param)
11064 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11065 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11066 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11067 ncx->blk_sub.lval = cx->blk_sub.lval;
11068 ncx->blk_sub.retop = cx->blk_sub.retop;
11071 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11072 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11073 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11074 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11075 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11076 ncx->blk_eval.retop = cx->blk_eval.retop;
11079 ncx->blk_loop.label = cx->blk_loop.label;
11080 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11081 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11082 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11083 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11084 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11085 ? cx->blk_loop.iterdata
11086 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11087 ncx->blk_loop.oldcomppad
11088 = (PAD*)ptr_table_fetch(PL_ptr_table,
11089 cx->blk_loop.oldcomppad);
11090 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11091 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11092 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11093 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11094 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11097 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11098 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11099 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11100 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11101 ncx->blk_sub.retop = cx->blk_sub.retop;
11113 /* duplicate a stack info structure */
11116 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11121 return (PERL_SI*)NULL;
11123 /* look for it in the table first */
11124 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11128 /* create anew and remember what it is */
11129 Newz(56, nsi, 1, PERL_SI);
11130 ptr_table_store(PL_ptr_table, si, nsi);
11132 nsi->si_stack = av_dup_inc(si->si_stack, param);
11133 nsi->si_cxix = si->si_cxix;
11134 nsi->si_cxmax = si->si_cxmax;
11135 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11136 nsi->si_type = si->si_type;
11137 nsi->si_prev = si_dup(si->si_prev, param);
11138 nsi->si_next = si_dup(si->si_next, param);
11139 nsi->si_markoff = si->si_markoff;
11144 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11145 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11146 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11147 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11148 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11149 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11150 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11151 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11152 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11153 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11154 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11155 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11156 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11157 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11160 #define pv_dup_inc(p) SAVEPV(p)
11161 #define pv_dup(p) SAVEPV(p)
11162 #define svp_dup_inc(p,pp) any_dup(p,pp)
11164 /* map any object to the new equivent - either something in the
11165 * ptr table, or something in the interpreter structure
11169 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11174 return (void*)NULL;
11176 /* look for it in the table first */
11177 ret = ptr_table_fetch(PL_ptr_table, v);
11181 /* see if it is part of the interpreter structure */
11182 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11183 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11191 /* duplicate the save stack */
11194 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11196 ANY *ss = proto_perl->Tsavestack;
11197 I32 ix = proto_perl->Tsavestack_ix;
11198 I32 max = proto_perl->Tsavestack_max;
11211 void (*dptr) (void*);
11212 void (*dxptr) (pTHX_ void*);
11214 /* Unions for circumventing strict ANSI C89 casting rules. */
11215 union { void *vptr; void (*dptr)(void*); } u1, u2;
11216 union { void *vptr; void (*dxptr)(pTHX_ void*); } u3, u4;
11218 Newz(54, nss, max, ANY);
11222 TOPINT(nss,ix) = i;
11224 case SAVEt_ITEM: /* normal string */
11225 sv = (SV*)POPPTR(ss,ix);
11226 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11227 sv = (SV*)POPPTR(ss,ix);
11228 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11230 case SAVEt_SV: /* scalar reference */
11231 sv = (SV*)POPPTR(ss,ix);
11232 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11233 gv = (GV*)POPPTR(ss,ix);
11234 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11236 case SAVEt_GENERIC_PVREF: /* generic char* */
11237 c = (char*)POPPTR(ss,ix);
11238 TOPPTR(nss,ix) = pv_dup(c);
11239 ptr = POPPTR(ss,ix);
11240 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11242 case SAVEt_SHARED_PVREF: /* char* in shared space */
11243 c = (char*)POPPTR(ss,ix);
11244 TOPPTR(nss,ix) = savesharedpv(c);
11245 ptr = POPPTR(ss,ix);
11246 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11248 case SAVEt_GENERIC_SVREF: /* generic sv */
11249 case SAVEt_SVREF: /* scalar reference */
11250 sv = (SV*)POPPTR(ss,ix);
11251 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11252 ptr = POPPTR(ss,ix);
11253 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11255 case SAVEt_AV: /* array reference */
11256 av = (AV*)POPPTR(ss,ix);
11257 TOPPTR(nss,ix) = av_dup_inc(av, param);
11258 gv = (GV*)POPPTR(ss,ix);
11259 TOPPTR(nss,ix) = gv_dup(gv, param);
11261 case SAVEt_HV: /* hash reference */
11262 hv = (HV*)POPPTR(ss,ix);
11263 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11264 gv = (GV*)POPPTR(ss,ix);
11265 TOPPTR(nss,ix) = gv_dup(gv, param);
11267 case SAVEt_INT: /* int reference */
11268 ptr = POPPTR(ss,ix);
11269 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11270 intval = (int)POPINT(ss,ix);
11271 TOPINT(nss,ix) = intval;
11273 case SAVEt_LONG: /* long reference */
11274 ptr = POPPTR(ss,ix);
11275 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11276 longval = (long)POPLONG(ss,ix);
11277 TOPLONG(nss,ix) = longval;
11279 case SAVEt_I32: /* I32 reference */
11280 case SAVEt_I16: /* I16 reference */
11281 case SAVEt_I8: /* I8 reference */
11282 ptr = POPPTR(ss,ix);
11283 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11285 TOPINT(nss,ix) = i;
11287 case SAVEt_IV: /* IV reference */
11288 ptr = POPPTR(ss,ix);
11289 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11291 TOPIV(nss,ix) = iv;
11293 case SAVEt_SPTR: /* SV* reference */
11294 ptr = POPPTR(ss,ix);
11295 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11296 sv = (SV*)POPPTR(ss,ix);
11297 TOPPTR(nss,ix) = sv_dup(sv, param);
11299 case SAVEt_VPTR: /* random* reference */
11300 ptr = POPPTR(ss,ix);
11301 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11302 ptr = POPPTR(ss,ix);
11303 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11305 case SAVEt_PPTR: /* char* reference */
11306 ptr = POPPTR(ss,ix);
11307 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11308 c = (char*)POPPTR(ss,ix);
11309 TOPPTR(nss,ix) = pv_dup(c);
11311 case SAVEt_HPTR: /* HV* reference */
11312 ptr = POPPTR(ss,ix);
11313 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11314 hv = (HV*)POPPTR(ss,ix);
11315 TOPPTR(nss,ix) = hv_dup(hv, param);
11317 case SAVEt_APTR: /* AV* reference */
11318 ptr = POPPTR(ss,ix);
11319 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11320 av = (AV*)POPPTR(ss,ix);
11321 TOPPTR(nss,ix) = av_dup(av, param);
11324 gv = (GV*)POPPTR(ss,ix);
11325 TOPPTR(nss,ix) = gv_dup(gv, param);
11327 case SAVEt_GP: /* scalar reference */
11328 gp = (GP*)POPPTR(ss,ix);
11329 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11330 (void)GpREFCNT_inc(gp);
11331 gv = (GV*)POPPTR(ss,ix);
11332 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11333 c = (char*)POPPTR(ss,ix);
11334 TOPPTR(nss,ix) = pv_dup(c);
11336 TOPIV(nss,ix) = iv;
11338 TOPIV(nss,ix) = iv;
11341 case SAVEt_MORTALIZESV:
11342 sv = (SV*)POPPTR(ss,ix);
11343 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11346 ptr = POPPTR(ss,ix);
11347 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11348 /* these are assumed to be refcounted properly */
11349 switch (((OP*)ptr)->op_type) {
11351 case OP_LEAVESUBLV:
11355 case OP_LEAVEWRITE:
11356 TOPPTR(nss,ix) = ptr;
11361 TOPPTR(nss,ix) = Nullop;
11366 TOPPTR(nss,ix) = Nullop;
11369 c = (char*)POPPTR(ss,ix);
11370 TOPPTR(nss,ix) = pv_dup_inc(c);
11372 case SAVEt_CLEARSV:
11373 longval = POPLONG(ss,ix);
11374 TOPLONG(nss,ix) = longval;
11377 hv = (HV*)POPPTR(ss,ix);
11378 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11379 c = (char*)POPPTR(ss,ix);
11380 TOPPTR(nss,ix) = pv_dup_inc(c);
11382 TOPINT(nss,ix) = i;
11384 case SAVEt_DESTRUCTOR:
11385 ptr = POPPTR(ss,ix);
11386 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11387 dptr = POPDPTR(ss,ix);
11389 u2.vptr = any_dup(u1.vptr, proto_perl);
11390 TOPDPTR(nss,ix) = u2.dptr;
11392 case SAVEt_DESTRUCTOR_X:
11393 ptr = POPPTR(ss,ix);
11394 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11395 dxptr = POPDXPTR(ss,ix);
11397 u4.vptr = any_dup(u3.vptr, proto_perl);;
11398 TOPDXPTR(nss,ix) = u4.dxptr;
11400 case SAVEt_REGCONTEXT:
11403 TOPINT(nss,ix) = i;
11406 case SAVEt_STACK_POS: /* Position on Perl stack */
11408 TOPINT(nss,ix) = i;
11410 case SAVEt_AELEM: /* array element */
11411 sv = (SV*)POPPTR(ss,ix);
11412 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11414 TOPINT(nss,ix) = i;
11415 av = (AV*)POPPTR(ss,ix);
11416 TOPPTR(nss,ix) = av_dup_inc(av, param);
11418 case SAVEt_HELEM: /* hash element */
11419 sv = (SV*)POPPTR(ss,ix);
11420 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11421 sv = (SV*)POPPTR(ss,ix);
11422 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11423 hv = (HV*)POPPTR(ss,ix);
11424 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11427 ptr = POPPTR(ss,ix);
11428 TOPPTR(nss,ix) = ptr;
11432 TOPINT(nss,ix) = i;
11434 case SAVEt_COMPPAD:
11435 av = (AV*)POPPTR(ss,ix);
11436 TOPPTR(nss,ix) = av_dup(av, param);
11439 longval = (long)POPLONG(ss,ix);
11440 TOPLONG(nss,ix) = longval;
11441 ptr = POPPTR(ss,ix);
11442 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11443 sv = (SV*)POPPTR(ss,ix);
11444 TOPPTR(nss,ix) = sv_dup(sv, param);
11447 ptr = POPPTR(ss,ix);
11448 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11449 longval = (long)POPBOOL(ss,ix);
11450 TOPBOOL(nss,ix) = (bool)longval;
11452 case SAVEt_SET_SVFLAGS:
11454 TOPINT(nss,ix) = i;
11456 TOPINT(nss,ix) = i;
11457 sv = (SV*)POPPTR(ss,ix);
11458 TOPPTR(nss,ix) = sv_dup(sv, param);
11461 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11469 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11470 * flag to the result. This is done for each stash before cloning starts,
11471 * so we know which stashes want their objects cloned */
11474 do_mark_cloneable_stash(pTHX_ SV *sv)
11476 const char *hvname = HvNAME_get((HV*)sv);
11478 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11479 STRLEN len = HvNAMELEN_get((HV*)sv);
11480 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11481 if (cloner && GvCV(cloner)) {
11488 XPUSHs(sv_2mortal(newSVpvn(hvname, len)));
11490 call_sv((SV*)GvCV(cloner), G_SCALAR);
11497 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11505 =for apidoc perl_clone
11507 Create and return a new interpreter by cloning the current one.
11509 perl_clone takes these flags as parameters:
11511 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11512 without it we only clone the data and zero the stacks,
11513 with it we copy the stacks and the new perl interpreter is
11514 ready to run at the exact same point as the previous one.
11515 The pseudo-fork code uses COPY_STACKS while the
11516 threads->new doesn't.
11518 CLONEf_KEEP_PTR_TABLE
11519 perl_clone keeps a ptr_table with the pointer of the old
11520 variable as a key and the new variable as a value,
11521 this allows it to check if something has been cloned and not
11522 clone it again but rather just use the value and increase the
11523 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11524 the ptr_table using the function
11525 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11526 reason to keep it around is if you want to dup some of your own
11527 variable who are outside the graph perl scans, example of this
11528 code is in threads.xs create
11531 This is a win32 thing, it is ignored on unix, it tells perls
11532 win32host code (which is c++) to clone itself, this is needed on
11533 win32 if you want to run two threads at the same time,
11534 if you just want to do some stuff in a separate perl interpreter
11535 and then throw it away and return to the original one,
11536 you don't need to do anything.
11541 /* XXX the above needs expanding by someone who actually understands it ! */
11542 EXTERN_C PerlInterpreter *
11543 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11546 perl_clone(PerlInterpreter *proto_perl, UV flags)
11549 #ifdef PERL_IMPLICIT_SYS
11551 /* perlhost.h so we need to call into it
11552 to clone the host, CPerlHost should have a c interface, sky */
11554 if (flags & CLONEf_CLONE_HOST) {
11555 return perl_clone_host(proto_perl,flags);
11557 return perl_clone_using(proto_perl, flags,
11559 proto_perl->IMemShared,
11560 proto_perl->IMemParse,
11562 proto_perl->IStdIO,
11566 proto_perl->IProc);
11570 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11571 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11572 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11573 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11574 struct IPerlDir* ipD, struct IPerlSock* ipS,
11575 struct IPerlProc* ipP)
11577 /* XXX many of the string copies here can be optimized if they're
11578 * constants; they need to be allocated as common memory and just
11579 * their pointers copied. */
11582 CLONE_PARAMS clone_params;
11583 CLONE_PARAMS* param = &clone_params;
11585 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11586 /* for each stash, determine whether its objects should be cloned */
11587 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11588 PERL_SET_THX(my_perl);
11591 Poison(my_perl, 1, PerlInterpreter);
11593 PL_curcop = (COP *)Nullop;
11597 PL_savestack_ix = 0;
11598 PL_savestack_max = -1;
11599 PL_sig_pending = 0;
11600 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11601 # else /* !DEBUGGING */
11602 Zero(my_perl, 1, PerlInterpreter);
11603 # endif /* DEBUGGING */
11605 /* host pointers */
11607 PL_MemShared = ipMS;
11608 PL_MemParse = ipMP;
11615 #else /* !PERL_IMPLICIT_SYS */
11617 CLONE_PARAMS clone_params;
11618 CLONE_PARAMS* param = &clone_params;
11619 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11620 /* for each stash, determine whether its objects should be cloned */
11621 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11622 PERL_SET_THX(my_perl);
11625 Poison(my_perl, 1, PerlInterpreter);
11627 PL_curcop = (COP *)Nullop;
11631 PL_savestack_ix = 0;
11632 PL_savestack_max = -1;
11633 PL_sig_pending = 0;
11634 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11635 # else /* !DEBUGGING */
11636 Zero(my_perl, 1, PerlInterpreter);
11637 # endif /* DEBUGGING */
11638 #endif /* PERL_IMPLICIT_SYS */
11639 param->flags = flags;
11640 param->proto_perl = proto_perl;
11643 PL_xnv_arenaroot = NULL;
11644 PL_xnv_root = NULL;
11645 PL_xpv_arenaroot = NULL;
11646 PL_xpv_root = NULL;
11647 PL_xpviv_arenaroot = NULL;
11648 PL_xpviv_root = NULL;
11649 PL_xpvnv_arenaroot = NULL;
11650 PL_xpvnv_root = NULL;
11651 PL_xpvcv_arenaroot = NULL;
11652 PL_xpvcv_root = NULL;
11653 PL_xpvav_arenaroot = NULL;
11654 PL_xpvav_root = NULL;
11655 PL_xpvhv_arenaroot = NULL;
11656 PL_xpvhv_root = NULL;
11657 PL_xpvmg_arenaroot = NULL;
11658 PL_xpvmg_root = NULL;
11659 PL_xpvgv_arenaroot = NULL;
11660 PL_xpvgv_root = NULL;
11661 PL_xpvlv_arenaroot = NULL;
11662 PL_xpvlv_root = NULL;
11663 PL_xpvbm_arenaroot = NULL;
11664 PL_xpvbm_root = NULL;
11665 PL_he_arenaroot = NULL;
11667 #if defined(USE_ITHREADS)
11668 PL_pte_arenaroot = NULL;
11669 PL_pte_root = NULL;
11671 PL_nice_chunk = NULL;
11672 PL_nice_chunk_size = 0;
11674 PL_sv_objcount = 0;
11675 PL_sv_root = Nullsv;
11676 PL_sv_arenaroot = Nullsv;
11678 PL_debug = proto_perl->Idebug;
11680 PL_hash_seed = proto_perl->Ihash_seed;
11681 PL_rehash_seed = proto_perl->Irehash_seed;
11683 #ifdef USE_REENTRANT_API
11684 /* XXX: things like -Dm will segfault here in perlio, but doing
11685 * PERL_SET_CONTEXT(proto_perl);
11686 * breaks too many other things
11688 Perl_reentrant_init(aTHX);
11691 /* create SV map for pointer relocation */
11692 PL_ptr_table = ptr_table_new();
11693 /* and one for finding shared hash keys quickly */
11694 PL_shared_hek_table = ptr_table_new();
11696 /* initialize these special pointers as early as possible */
11697 SvANY(&PL_sv_undef) = NULL;
11698 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11699 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11700 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11702 SvANY(&PL_sv_no) = new_XPVNV();
11703 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11704 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11705 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11706 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11707 SvCUR_set(&PL_sv_no, 0);
11708 SvLEN_set(&PL_sv_no, 1);
11709 SvIV_set(&PL_sv_no, 0);
11710 SvNV_set(&PL_sv_no, 0);
11711 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11713 SvANY(&PL_sv_yes) = new_XPVNV();
11714 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11715 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11716 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11717 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11718 SvCUR_set(&PL_sv_yes, 1);
11719 SvLEN_set(&PL_sv_yes, 2);
11720 SvIV_set(&PL_sv_yes, 1);
11721 SvNV_set(&PL_sv_yes, 1);
11722 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11724 /* create (a non-shared!) shared string table */
11725 PL_strtab = newHV();
11726 HvSHAREKEYS_off(PL_strtab);
11727 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11728 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11730 PL_compiling = proto_perl->Icompiling;
11732 /* These two PVs will be free'd special way so must set them same way op.c does */
11733 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11734 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11736 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11737 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11739 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11740 if (!specialWARN(PL_compiling.cop_warnings))
11741 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11742 if (!specialCopIO(PL_compiling.cop_io))
11743 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11744 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11746 /* pseudo environmental stuff */
11747 PL_origargc = proto_perl->Iorigargc;
11748 PL_origargv = proto_perl->Iorigargv;
11750 param->stashes = newAV(); /* Setup array of objects to call clone on */
11752 #ifdef PERLIO_LAYERS
11753 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11754 PerlIO_clone(aTHX_ proto_perl, param);
11757 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11758 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11759 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11760 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11761 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11762 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11765 PL_minus_c = proto_perl->Iminus_c;
11766 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11767 PL_localpatches = proto_perl->Ilocalpatches;
11768 PL_splitstr = proto_perl->Isplitstr;
11769 PL_preprocess = proto_perl->Ipreprocess;
11770 PL_minus_n = proto_perl->Iminus_n;
11771 PL_minus_p = proto_perl->Iminus_p;
11772 PL_minus_l = proto_perl->Iminus_l;
11773 PL_minus_a = proto_perl->Iminus_a;
11774 PL_minus_F = proto_perl->Iminus_F;
11775 PL_doswitches = proto_perl->Idoswitches;
11776 PL_dowarn = proto_perl->Idowarn;
11777 PL_doextract = proto_perl->Idoextract;
11778 PL_sawampersand = proto_perl->Isawampersand;
11779 PL_unsafe = proto_perl->Iunsafe;
11780 PL_inplace = SAVEPV(proto_perl->Iinplace);
11781 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11782 PL_perldb = proto_perl->Iperldb;
11783 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11784 PL_exit_flags = proto_perl->Iexit_flags;
11786 /* magical thingies */
11787 /* XXX time(&PL_basetime) when asked for? */
11788 PL_basetime = proto_perl->Ibasetime;
11789 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11791 PL_maxsysfd = proto_perl->Imaxsysfd;
11792 PL_multiline = proto_perl->Imultiline;
11793 PL_statusvalue = proto_perl->Istatusvalue;
11795 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11797 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11799 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11800 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11801 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11803 /* Clone the regex array */
11804 PL_regex_padav = newAV();
11806 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11807 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11808 av_push(PL_regex_padav,
11809 sv_dup_inc(regexen[0],param));
11810 for(i = 1; i <= len; i++) {
11811 if(SvREPADTMP(regexen[i])) {
11812 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11814 av_push(PL_regex_padav,
11816 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11817 SvIVX(regexen[i])), param)))
11822 PL_regex_pad = AvARRAY(PL_regex_padav);
11824 /* shortcuts to various I/O objects */
11825 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11826 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11827 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11828 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11829 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11830 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11832 /* shortcuts to regexp stuff */
11833 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11835 /* shortcuts to misc objects */
11836 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11838 /* shortcuts to debugging objects */
11839 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11840 PL_DBline = gv_dup(proto_perl->IDBline, param);
11841 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11842 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11843 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11844 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11845 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11846 PL_lineary = av_dup(proto_perl->Ilineary, param);
11847 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11849 /* symbol tables */
11850 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11851 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11852 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11853 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11854 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11856 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11857 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11858 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11859 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11860 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11861 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11863 PL_sub_generation = proto_perl->Isub_generation;
11865 /* funky return mechanisms */
11866 PL_forkprocess = proto_perl->Iforkprocess;
11868 /* subprocess state */
11869 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11871 /* internal state */
11872 PL_tainting = proto_perl->Itainting;
11873 PL_taint_warn = proto_perl->Itaint_warn;
11874 PL_maxo = proto_perl->Imaxo;
11875 if (proto_perl->Iop_mask)
11876 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11878 PL_op_mask = Nullch;
11879 /* PL_asserting = proto_perl->Iasserting; */
11881 /* current interpreter roots */
11882 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11883 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11884 PL_main_start = proto_perl->Imain_start;
11885 PL_eval_root = proto_perl->Ieval_root;
11886 PL_eval_start = proto_perl->Ieval_start;
11888 /* runtime control stuff */
11889 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11890 PL_copline = proto_perl->Icopline;
11892 PL_filemode = proto_perl->Ifilemode;
11893 PL_lastfd = proto_perl->Ilastfd;
11894 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11897 PL_gensym = proto_perl->Igensym;
11898 PL_preambled = proto_perl->Ipreambled;
11899 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11900 PL_laststatval = proto_perl->Ilaststatval;
11901 PL_laststype = proto_perl->Ilaststype;
11902 PL_mess_sv = Nullsv;
11904 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11905 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11907 /* interpreter atexit processing */
11908 PL_exitlistlen = proto_perl->Iexitlistlen;
11909 if (PL_exitlistlen) {
11910 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11911 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11914 PL_exitlist = (PerlExitListEntry*)NULL;
11915 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11916 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11917 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11919 PL_profiledata = NULL;
11920 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11921 /* PL_rsfp_filters entries have fake IoDIRP() */
11922 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11924 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11926 PAD_CLONE_VARS(proto_perl, param);
11928 #ifdef HAVE_INTERP_INTERN
11929 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11932 /* more statics moved here */
11933 PL_generation = proto_perl->Igeneration;
11934 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11936 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11937 PL_in_clean_all = proto_perl->Iin_clean_all;
11939 PL_uid = proto_perl->Iuid;
11940 PL_euid = proto_perl->Ieuid;
11941 PL_gid = proto_perl->Igid;
11942 PL_egid = proto_perl->Iegid;
11943 PL_nomemok = proto_perl->Inomemok;
11944 PL_an = proto_perl->Ian;
11945 PL_evalseq = proto_perl->Ievalseq;
11946 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11947 PL_origalen = proto_perl->Iorigalen;
11948 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11949 PL_osname = SAVEPV(proto_perl->Iosname);
11950 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11951 PL_sighandlerp = proto_perl->Isighandlerp;
11954 PL_runops = proto_perl->Irunops;
11956 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11959 PL_cshlen = proto_perl->Icshlen;
11960 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11963 PL_lex_state = proto_perl->Ilex_state;
11964 PL_lex_defer = proto_perl->Ilex_defer;
11965 PL_lex_expect = proto_perl->Ilex_expect;
11966 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11967 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11968 PL_lex_starts = proto_perl->Ilex_starts;
11969 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11970 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11971 PL_lex_op = proto_perl->Ilex_op;
11972 PL_lex_inpat = proto_perl->Ilex_inpat;
11973 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11974 PL_lex_brackets = proto_perl->Ilex_brackets;
11975 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11976 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11977 PL_lex_casemods = proto_perl->Ilex_casemods;
11978 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11979 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11981 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11982 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11983 PL_nexttoke = proto_perl->Inexttoke;
11985 /* XXX This is probably masking the deeper issue of why
11986 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11987 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11988 * (A little debugging with a watchpoint on it may help.)
11990 if (SvANY(proto_perl->Ilinestr)) {
11991 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11992 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11993 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11994 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11995 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11996 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11997 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11998 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11999 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12002 PL_linestr = NEWSV(65,79);
12003 sv_upgrade(PL_linestr,SVt_PVIV);
12004 sv_setpvn(PL_linestr,"",0);
12005 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
12007 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12008 PL_pending_ident = proto_perl->Ipending_ident;
12009 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
12011 PL_expect = proto_perl->Iexpect;
12013 PL_multi_start = proto_perl->Imulti_start;
12014 PL_multi_end = proto_perl->Imulti_end;
12015 PL_multi_open = proto_perl->Imulti_open;
12016 PL_multi_close = proto_perl->Imulti_close;
12018 PL_error_count = proto_perl->Ierror_count;
12019 PL_subline = proto_perl->Isubline;
12020 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
12022 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
12023 if (SvANY(proto_perl->Ilinestr)) {
12024 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
12025 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12026 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
12027 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12028 PL_last_lop_op = proto_perl->Ilast_lop_op;
12031 PL_last_uni = SvPVX(PL_linestr);
12032 PL_last_lop = SvPVX(PL_linestr);
12033 PL_last_lop_op = 0;
12035 PL_in_my = proto_perl->Iin_my;
12036 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12038 PL_cryptseen = proto_perl->Icryptseen;
12041 PL_hints = proto_perl->Ihints;
12043 PL_amagic_generation = proto_perl->Iamagic_generation;
12045 #ifdef USE_LOCALE_COLLATE
12046 PL_collation_ix = proto_perl->Icollation_ix;
12047 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12048 PL_collation_standard = proto_perl->Icollation_standard;
12049 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12050 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12051 #endif /* USE_LOCALE_COLLATE */
12053 #ifdef USE_LOCALE_NUMERIC
12054 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12055 PL_numeric_standard = proto_perl->Inumeric_standard;
12056 PL_numeric_local = proto_perl->Inumeric_local;
12057 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12058 #endif /* !USE_LOCALE_NUMERIC */
12060 /* utf8 character classes */
12061 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12062 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12063 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12064 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12065 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12066 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12067 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12068 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12069 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12070 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12071 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12072 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12073 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12074 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12075 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12076 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12077 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12078 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12079 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12080 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12082 /* Did the locale setup indicate UTF-8? */
12083 PL_utf8locale = proto_perl->Iutf8locale;
12084 /* Unicode features (see perlrun/-C) */
12085 PL_unicode = proto_perl->Iunicode;
12087 /* Pre-5.8 signals control */
12088 PL_signals = proto_perl->Isignals;
12090 /* times() ticks per second */
12091 PL_clocktick = proto_perl->Iclocktick;
12093 /* Recursion stopper for PerlIO_find_layer */
12094 PL_in_load_module = proto_perl->Iin_load_module;
12096 /* sort() routine */
12097 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12099 /* Not really needed/useful since the reenrant_retint is "volatile",
12100 * but do it for consistency's sake. */
12101 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12103 /* Hooks to shared SVs and locks. */
12104 PL_sharehook = proto_perl->Isharehook;
12105 PL_lockhook = proto_perl->Ilockhook;
12106 PL_unlockhook = proto_perl->Iunlockhook;
12107 PL_threadhook = proto_perl->Ithreadhook;
12109 PL_runops_std = proto_perl->Irunops_std;
12110 PL_runops_dbg = proto_perl->Irunops_dbg;
12112 #ifdef THREADS_HAVE_PIDS
12113 PL_ppid = proto_perl->Ippid;
12117 PL_last_swash_hv = Nullhv; /* reinits on demand */
12118 PL_last_swash_klen = 0;
12119 PL_last_swash_key[0]= '\0';
12120 PL_last_swash_tmps = (U8*)NULL;
12121 PL_last_swash_slen = 0;
12123 PL_glob_index = proto_perl->Iglob_index;
12124 PL_srand_called = proto_perl->Isrand_called;
12125 PL_uudmap['M'] = 0; /* reinits on demand */
12126 PL_bitcount = Nullch; /* reinits on demand */
12128 if (proto_perl->Ipsig_pend) {
12129 Newz(0, PL_psig_pend, SIG_SIZE, int);
12132 PL_psig_pend = (int*)NULL;
12135 if (proto_perl->Ipsig_ptr) {
12136 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12137 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12138 for (i = 1; i < SIG_SIZE; i++) {
12139 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12140 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12144 PL_psig_ptr = (SV**)NULL;
12145 PL_psig_name = (SV**)NULL;
12148 /* thrdvar.h stuff */
12150 if (flags & CLONEf_COPY_STACKS) {
12151 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12152 PL_tmps_ix = proto_perl->Ttmps_ix;
12153 PL_tmps_max = proto_perl->Ttmps_max;
12154 PL_tmps_floor = proto_perl->Ttmps_floor;
12155 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12157 while (i <= PL_tmps_ix) {
12158 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12162 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12163 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12164 Newz(54, PL_markstack, i, I32);
12165 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12166 - proto_perl->Tmarkstack);
12167 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12168 - proto_perl->Tmarkstack);
12169 Copy(proto_perl->Tmarkstack, PL_markstack,
12170 PL_markstack_ptr - PL_markstack + 1, I32);
12172 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12173 * NOTE: unlike the others! */
12174 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12175 PL_scopestack_max = proto_perl->Tscopestack_max;
12176 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12177 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12179 /* NOTE: si_dup() looks at PL_markstack */
12180 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12182 /* PL_curstack = PL_curstackinfo->si_stack; */
12183 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12184 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12186 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12187 PL_stack_base = AvARRAY(PL_curstack);
12188 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12189 - proto_perl->Tstack_base);
12190 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12192 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12193 * NOTE: unlike the others! */
12194 PL_savestack_ix = proto_perl->Tsavestack_ix;
12195 PL_savestack_max = proto_perl->Tsavestack_max;
12196 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12197 PL_savestack = ss_dup(proto_perl, param);
12201 ENTER; /* perl_destruct() wants to LEAVE; */
12204 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12205 PL_top_env = &PL_start_env;
12207 PL_op = proto_perl->Top;
12210 PL_Xpv = (XPV*)NULL;
12211 PL_na = proto_perl->Tna;
12213 PL_statbuf = proto_perl->Tstatbuf;
12214 PL_statcache = proto_perl->Tstatcache;
12215 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12216 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12218 PL_timesbuf = proto_perl->Ttimesbuf;
12221 PL_tainted = proto_perl->Ttainted;
12222 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12223 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12224 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12225 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12226 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12227 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12228 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12229 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12230 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12232 PL_restartop = proto_perl->Trestartop;
12233 PL_in_eval = proto_perl->Tin_eval;
12234 PL_delaymagic = proto_perl->Tdelaymagic;
12235 PL_dirty = proto_perl->Tdirty;
12236 PL_localizing = proto_perl->Tlocalizing;
12238 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12239 PL_hv_fetch_ent_mh = Nullhe;
12240 PL_modcount = proto_perl->Tmodcount;
12241 PL_lastgotoprobe = Nullop;
12242 PL_dumpindent = proto_perl->Tdumpindent;
12244 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12245 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12246 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12247 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12248 PL_sortcxix = proto_perl->Tsortcxix;
12249 PL_efloatbuf = Nullch; /* reinits on demand */
12250 PL_efloatsize = 0; /* reinits on demand */
12254 PL_screamfirst = NULL;
12255 PL_screamnext = NULL;
12256 PL_maxscream = -1; /* reinits on demand */
12257 PL_lastscream = Nullsv;
12259 PL_watchaddr = NULL;
12260 PL_watchok = Nullch;
12262 PL_regdummy = proto_perl->Tregdummy;
12263 PL_regprecomp = Nullch;
12266 PL_colorset = 0; /* reinits PL_colors[] */
12267 /*PL_colors[6] = {0,0,0,0,0,0};*/
12268 PL_reginput = Nullch;
12269 PL_regbol = Nullch;
12270 PL_regeol = Nullch;
12271 PL_regstartp = (I32*)NULL;
12272 PL_regendp = (I32*)NULL;
12273 PL_reglastparen = (U32*)NULL;
12274 PL_reglastcloseparen = (U32*)NULL;
12275 PL_regtill = Nullch;
12276 PL_reg_start_tmp = (char**)NULL;
12277 PL_reg_start_tmpl = 0;
12278 PL_regdata = (struct reg_data*)NULL;
12281 PL_reg_eval_set = 0;
12283 PL_regprogram = (regnode*)NULL;
12285 PL_regcc = (CURCUR*)NULL;
12286 PL_reg_call_cc = (struct re_cc_state*)NULL;
12287 PL_reg_re = (regexp*)NULL;
12288 PL_reg_ganch = Nullch;
12289 PL_reg_sv = Nullsv;
12290 PL_reg_match_utf8 = FALSE;
12291 PL_reg_magic = (MAGIC*)NULL;
12293 PL_reg_oldcurpm = (PMOP*)NULL;
12294 PL_reg_curpm = (PMOP*)NULL;
12295 PL_reg_oldsaved = Nullch;
12296 PL_reg_oldsavedlen = 0;
12297 #ifdef PERL_COPY_ON_WRITE
12300 PL_reg_maxiter = 0;
12301 PL_reg_leftiter = 0;
12302 PL_reg_poscache = Nullch;
12303 PL_reg_poscache_size= 0;
12305 /* RE engine - function pointers */
12306 PL_regcompp = proto_perl->Tregcompp;
12307 PL_regexecp = proto_perl->Tregexecp;
12308 PL_regint_start = proto_perl->Tregint_start;
12309 PL_regint_string = proto_perl->Tregint_string;
12310 PL_regfree = proto_perl->Tregfree;
12312 PL_reginterp_cnt = 0;
12313 PL_reg_starttry = 0;
12315 /* Pluggable optimizer */
12316 PL_peepp = proto_perl->Tpeepp;
12318 PL_stashcache = newHV();
12320 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12321 ptr_table_free(PL_ptr_table);
12322 PL_ptr_table = NULL;
12323 ptr_table_free(PL_shared_hek_table);
12324 PL_shared_hek_table = NULL;
12327 /* Call the ->CLONE method, if it exists, for each of the stashes
12328 identified by sv_dup() above.
12330 while(av_len(param->stashes) != -1) {
12331 HV* stash = (HV*) av_shift(param->stashes);
12332 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12333 if (cloner && GvCV(cloner)) {
12338 XPUSHs(sv_2mortal(newSVpvn(HvNAME_get(stash), HvNAMELEN_get(stash))));
12340 call_sv((SV*)GvCV(cloner), G_DISCARD);
12346 SvREFCNT_dec(param->stashes);
12348 /* orphaned? eg threads->new inside BEGIN or use */
12349 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12350 (void)SvREFCNT_inc(PL_compcv);
12351 SAVEFREESV(PL_compcv);
12357 #endif /* USE_ITHREADS */
12360 =head1 Unicode Support
12362 =for apidoc sv_recode_to_utf8
12364 The encoding is assumed to be an Encode object, on entry the PV
12365 of the sv is assumed to be octets in that encoding, and the sv
12366 will be converted into Unicode (and UTF-8).
12368 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12369 is not a reference, nothing is done to the sv. If the encoding is not
12370 an C<Encode::XS> Encoding object, bad things will happen.
12371 (See F<lib/encoding.pm> and L<Encode>).
12373 The PV of the sv is returned.
12378 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12381 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12395 Passing sv_yes is wrong - it needs to be or'ed set of constants
12396 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12397 remove converted chars from source.
12399 Both will default the value - let them.
12401 XPUSHs(&PL_sv_yes);
12404 call_method("decode", G_SCALAR);
12408 s = SvPV(uni, len);
12409 if (s != SvPVX(sv)) {
12410 SvGROW(sv, len + 1);
12411 Move(s, SvPVX(sv), len, char);
12412 SvCUR_set(sv, len);
12413 SvPVX(sv)[len] = 0;
12420 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12424 =for apidoc sv_cat_decode
12426 The encoding is assumed to be an Encode object, the PV of the ssv is
12427 assumed to be octets in that encoding and decoding the input starts
12428 from the position which (PV + *offset) pointed to. The dsv will be
12429 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12430 when the string tstr appears in decoding output or the input ends on
12431 the PV of the ssv. The value which the offset points will be modified
12432 to the last input position on the ssv.
12434 Returns TRUE if the terminator was found, else returns FALSE.
12439 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12440 SV *ssv, int *offset, char *tstr, int tlen)
12444 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12455 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12456 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12458 call_method("cat_decode", G_SCALAR);
12460 ret = SvTRUE(TOPs);
12461 *offset = SvIV(offsv);
12467 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12473 * c-indentation-style: bsd
12474 * c-basic-offset: 4
12475 * indent-tabs-mode: t
12478 * ex: set ts=8 sts=4 sw=4 noet: