3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
9 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
12 * This file contains the code that creates, manipulates and destroys
13 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
14 * structure of an SV, so their creation and destruction is handled
15 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
16 * level functions (eg. substr, split, join) for each of the types are
28 /* Missing proto on LynxOS */
29 char *gconvert(double, int, int, char *);
32 #ifdef PERL_UTF8_CACHE_ASSERT
33 /* The cache element 0 is the Unicode offset;
34 * the cache element 1 is the byte offset of the element 0;
35 * the cache element 2 is the Unicode length of the substring;
36 * the cache element 3 is the byte length of the substring;
37 * The checking of the substring side would be good
38 * but substr() has enough code paths to make my head spin;
39 * if adding more checks watch out for the following tests:
40 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
41 * lib/utf8.t lib/Unicode/Collate/t/index.t
44 #define ASSERT_UTF8_CACHE(cache) \
45 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
47 #define ASSERT_UTF8_CACHE(cache) NOOP
50 #ifdef PERL_COPY_ON_WRITE
51 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
52 #define SV_COW_NEXT_SV_SET(current,next) SvUV_set(current, PTR2UV(next))
53 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
57 /* ============================================================================
59 =head1 Allocation and deallocation of SVs.
61 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
62 av, hv...) contains type and reference count information, as well as a
63 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
64 specific to each type.
66 Normally, this allocation is done using arenas, which by default are
67 approximately 4K chunks of memory parcelled up into N heads or bodies. The
68 first slot in each arena is reserved, and is used to hold a link to the next
69 arena. In the case of heads, the unused first slot also contains some flags
70 and a note of the number of slots. Snaked through each arena chain is a
71 linked list of free items; when this becomes empty, an extra arena is
72 allocated and divided up into N items which are threaded into the free list.
74 The following global variables are associated with arenas:
76 PL_sv_arenaroot pointer to list of SV arenas
77 PL_sv_root pointer to list of free SV structures
79 PL_foo_arenaroot pointer to list of foo arenas,
80 PL_foo_root pointer to list of free foo bodies
81 ... for foo in xiv, xnv, xrv, xpv etc.
83 Note that some of the larger and more rarely used body types (eg xpvio)
84 are not allocated using arenas, but are instead just malloc()/free()ed as
85 required. Also, if PURIFY is defined, arenas are abandoned altogether,
86 with all items individually malloc()ed. In addition, a few SV heads are
87 not allocated from an arena, but are instead directly created as static
88 or auto variables, eg PL_sv_undef. The size of arenas can be changed from
89 the default by setting PERL_ARENA_SIZE appropriately at compile time.
91 The SV arena serves the secondary purpose of allowing still-live SVs
92 to be located and destroyed during final cleanup.
94 At the lowest level, the macros new_SV() and del_SV() grab and free
95 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
96 to return the SV to the free list with error checking.) new_SV() calls
97 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
98 SVs in the free list have their SvTYPE field set to all ones.
100 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
101 that allocate and return individual body types. Normally these are mapped
102 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
103 instead mapped directly to malloc()/free() if PURIFY is defined. The
104 new/del functions remove from, or add to, the appropriate PL_foo_root
105 list, and call more_xiv() etc to add a new arena if the list is empty.
107 At the time of very final cleanup, sv_free_arenas() is called from
108 perl_destruct() to physically free all the arenas allocated since the
109 start of the interpreter. Note that this also clears PL_he_arenaroot,
110 which is otherwise dealt with in hv.c.
112 Manipulation of any of the PL_*root pointers is protected by enclosing
113 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
114 if threads are enabled.
116 The function visit() scans the SV arenas list, and calls a specified
117 function for each SV it finds which is still live - ie which has an SvTYPE
118 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
119 following functions (specified as [function that calls visit()] / [function
120 called by visit() for each SV]):
122 sv_report_used() / do_report_used()
123 dump all remaining SVs (debugging aid)
125 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
126 Attempt to free all objects pointed to by RVs,
127 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
128 try to do the same for all objects indirectly
129 referenced by typeglobs too. Called once from
130 perl_destruct(), prior to calling sv_clean_all()
133 sv_clean_all() / do_clean_all()
134 SvREFCNT_dec(sv) each remaining SV, possibly
135 triggering an sv_free(). It also sets the
136 SVf_BREAK flag on the SV to indicate that the
137 refcnt has been artificially lowered, and thus
138 stopping sv_free() from giving spurious warnings
139 about SVs which unexpectedly have a refcnt
140 of zero. called repeatedly from perl_destruct()
141 until there are no SVs left.
145 Private API to rest of sv.c
149 new_XIV(), del_XIV(),
150 new_XNV(), del_XNV(),
155 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
160 ============================================================================ */
165 * "A time to plant, and a time to uproot what was planted..."
169 #ifdef DEBUG_LEAKING_SCALARS
171 # define FREE_SV_DEBUG_FILE(sv) PerlMemfree((sv)->sv_debug_file)
173 # define FREE_SV_DEBUG_FILE(sv) PerlMemShared_free((sv)->sv_debug_file)
176 # define FREE_SV_DEBUG_FILE(sv)
179 #define plant_SV(p) \
181 FREE_SV_DEBUG_FILE(p); \
182 SvANY(p) = (void *)PL_sv_root; \
183 SvFLAGS(p) = SVTYPEMASK; \
188 /* sv_mutex must be held while calling uproot_SV() */
189 #define uproot_SV(p) \
192 PL_sv_root = (SV*)SvANY(p); \
197 /* make some more SVs by adding another arena */
199 /* sv_mutex must be held while calling more_sv() */
206 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
207 PL_nice_chunk = Nullch;
208 PL_nice_chunk_size = 0;
211 char *chunk; /* must use New here to match call to */
212 New(704,chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
213 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
219 /* new_SV(): return a new, empty SV head */
221 #ifdef DEBUG_LEAKING_SCALARS
222 /* provide a real function for a debugger to play with */
232 sv = S_more_sv(aTHX);
237 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
238 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
239 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
240 sv->sv_debug_inpad = 0;
241 sv->sv_debug_cloned = 0;
243 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
245 sv->sv_debug_file = PL_curcop ? savesharedpv(CopFILE(PL_curcop)): NULL;
250 # define new_SV(p) (p)=S_new_SV(aTHX)
259 (p) = S_more_sv(aTHX); \
268 /* del_SV(): return an empty SV head to the free list */
283 S_del_sv(pTHX_ SV *p)
288 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
290 SV *svend = &sva[SvREFCNT(sva)];
291 if (p >= sv && p < svend) {
297 if (ckWARN_d(WARN_INTERNAL))
298 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
299 "Attempt to free non-arena SV: 0x%"UVxf
300 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
307 #else /* ! DEBUGGING */
309 #define del_SV(p) plant_SV(p)
311 #endif /* DEBUGGING */
315 =head1 SV Manipulation Functions
317 =for apidoc sv_add_arena
319 Given a chunk of memory, link it to the head of the list of arenas,
320 and split it into a list of free SVs.
326 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
332 /* The first SV in an arena isn't an SV. */
333 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
334 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
335 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
337 PL_sv_arenaroot = sva;
338 PL_sv_root = sva + 1;
340 svend = &sva[SvREFCNT(sva) - 1];
343 SvANY(sv) = (void *)(SV*)(sv + 1);
347 /* Must always set typemask because it's awlays checked in on cleanup
348 when the arenas are walked looking for objects. */
349 SvFLAGS(sv) = SVTYPEMASK;
356 SvFLAGS(sv) = SVTYPEMASK;
359 /* visit(): call the named function for each non-free SV in the arenas
360 * whose flags field matches the flags/mask args. */
363 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
368 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
369 register SV * const svend = &sva[SvREFCNT(sva)];
371 for (sv = sva + 1; sv < svend; ++sv) {
372 if (SvTYPE(sv) != SVTYPEMASK
373 && (sv->sv_flags & mask) == flags
386 /* called by sv_report_used() for each live SV */
389 do_report_used(pTHX_ SV *sv)
391 if (SvTYPE(sv) != SVTYPEMASK) {
392 PerlIO_printf(Perl_debug_log, "****\n");
399 =for apidoc sv_report_used
401 Dump the contents of all SVs not yet freed. (Debugging aid).
407 Perl_sv_report_used(pTHX)
410 visit(do_report_used, 0, 0);
414 /* called by sv_clean_objs() for each live SV */
417 do_clean_objs(pTHX_ SV *sv)
421 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
422 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
434 /* XXX Might want to check arrays, etc. */
437 /* called by sv_clean_objs() for each live SV */
439 #ifndef DISABLE_DESTRUCTOR_KLUDGE
441 do_clean_named_objs(pTHX_ SV *sv)
443 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
444 if ( SvOBJECT(GvSV(sv)) ||
445 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
446 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
447 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
448 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
450 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
451 SvFLAGS(sv) |= SVf_BREAK;
459 =for apidoc sv_clean_objs
461 Attempt to destroy all objects not yet freed
467 Perl_sv_clean_objs(pTHX)
469 PL_in_clean_objs = TRUE;
470 visit(do_clean_objs, SVf_ROK, SVf_ROK);
471 #ifndef DISABLE_DESTRUCTOR_KLUDGE
472 /* some barnacles may yet remain, clinging to typeglobs */
473 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
475 PL_in_clean_objs = FALSE;
478 /* called by sv_clean_all() for each live SV */
481 do_clean_all(pTHX_ SV *sv)
483 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
484 SvFLAGS(sv) |= SVf_BREAK;
485 if (PL_comppad == (AV*)sv) {
487 PL_curpad = Null(SV**);
493 =for apidoc sv_clean_all
495 Decrement the refcnt of each remaining SV, possibly triggering a
496 cleanup. This function may have to be called multiple times to free
497 SVs which are in complex self-referential hierarchies.
503 Perl_sv_clean_all(pTHX)
506 PL_in_clean_all = TRUE;
507 cleaned = visit(do_clean_all, 0,0);
508 PL_in_clean_all = FALSE;
513 =for apidoc sv_free_arenas
515 Deallocate the memory used by all arenas. Note that all the individual SV
516 heads and bodies within the arenas must already have been freed.
522 Perl_sv_free_arenas(pTHX)
526 void *arena, *arenanext;
528 /* Free arenas here, but be careful about fake ones. (We assume
529 contiguity of the fake ones with the corresponding real ones.) */
531 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
532 svanext = (SV*) SvANY(sva);
533 while (svanext && SvFAKE(svanext))
534 svanext = (SV*) SvANY(svanext);
540 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
541 arenanext = *(void **)arena;
544 PL_xnv_arenaroot = 0;
547 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
548 arenanext = *(void **)arena;
551 PL_xpv_arenaroot = 0;
554 for (arena = PL_xpviv_arenaroot; arena; arena = arenanext) {
555 arenanext = *(void **)arena;
558 PL_xpviv_arenaroot = 0;
561 for (arena = PL_xpvnv_arenaroot; arena; arena = arenanext) {
562 arenanext = *(void **)arena;
565 PL_xpvnv_arenaroot = 0;
568 for (arena = PL_xpvcv_arenaroot; arena; arena = arenanext) {
569 arenanext = *(void **)arena;
572 PL_xpvcv_arenaroot = 0;
575 for (arena = PL_xpvav_arenaroot; arena; arena = arenanext) {
576 arenanext = *(void **)arena;
579 PL_xpvav_arenaroot = 0;
582 for (arena = PL_xpvhv_arenaroot; arena; arena = arenanext) {
583 arenanext = *(void **)arena;
586 PL_xpvhv_arenaroot = 0;
589 for (arena = PL_xpvmg_arenaroot; arena; arena = arenanext) {
590 arenanext = *(void **)arena;
593 PL_xpvmg_arenaroot = 0;
596 for (arena = PL_xpvgv_arenaroot; arena; arena = arenanext) {
597 arenanext = *(void **)arena;
600 PL_xpvgv_arenaroot = 0;
603 for (arena = PL_xpvlv_arenaroot; arena; arena = arenanext) {
604 arenanext = *(void **)arena;
607 PL_xpvlv_arenaroot = 0;
610 for (arena = PL_xpvbm_arenaroot; arena; arena = arenanext) {
611 arenanext = *(void **)arena;
614 PL_xpvbm_arenaroot = 0;
620 for (he = PL_he_arenaroot; he; he = he_next) {
621 he_next = HeNEXT(he);
628 #if defined(USE_ITHREADS)
630 struct ptr_tbl_ent *pte;
631 struct ptr_tbl_ent *pte_next;
632 for (pte = PL_pte_arenaroot; pte; pte = pte_next) {
633 pte_next = pte->next;
637 PL_pte_arenaroot = 0;
642 Safefree(PL_nice_chunk);
643 PL_nice_chunk = Nullch;
644 PL_nice_chunk_size = 0;
649 /* ---------------------------------------------------------------------
651 * support functions for report_uninit()
654 /* the maxiumum size of array or hash where we will scan looking
655 * for the undefined element that triggered the warning */
657 #define FUV_MAX_SEARCH_SIZE 1000
659 /* Look for an entry in the hash whose value has the same SV as val;
660 * If so, return a mortal copy of the key. */
663 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
669 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
670 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
675 for (i=HvMAX(hv); i>0; i--) {
677 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
678 if (HeVAL(entry) != val)
680 if ( HeVAL(entry) == &PL_sv_undef ||
681 HeVAL(entry) == &PL_sv_placeholder)
685 if (HeKLEN(entry) == HEf_SVKEY)
686 return sv_mortalcopy(HeKEY_sv(entry));
687 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
693 /* Look for an entry in the array whose value has the same SV as val;
694 * If so, return the index, otherwise return -1. */
697 S_find_array_subscript(pTHX_ AV *av, SV* val)
701 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
702 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
706 for (i=AvFILLp(av); i>=0; i--) {
707 if (svp[i] == val && svp[i] != &PL_sv_undef)
713 /* S_varname(): return the name of a variable, optionally with a subscript.
714 * If gv is non-zero, use the name of that global, along with gvtype (one
715 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
716 * targ. Depending on the value of the subscript_type flag, return:
719 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
720 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
721 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
722 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
725 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
726 SV* keyname, I32 aindex, int subscript_type)
731 SV * const name = sv_newmortal();
734 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
735 * XXX get rid of all this if gv_fullnameX() ever supports this
739 HV *hv = GvSTASH(gv);
740 sv_setpv(name, gvtype);
743 else if (!(p=HvNAME_get(hv)))
745 if (strNE(p, "main")) {
747 sv_catpvn(name,"::", 2);
749 if (GvNAMELEN(gv)>= 1 &&
750 ((unsigned int)*GvNAME(gv)) <= 26)
752 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
753 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
756 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
760 CV *cv = find_runcv(&u);
763 if (!cv || !CvPADLIST(cv))
765 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
766 sv = *av_fetch(av, targ, FALSE);
767 /* SvLEN in a pad name is not to be trusted */
769 sv_setpvn(name, str, len);
772 if (subscript_type == FUV_SUBSCRIPT_HASH) {
775 Perl_sv_catpvf(aTHX_ name, "{%s}",
776 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
779 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
781 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
783 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
784 sv_insert(name, 0, 0, "within ", 7);
791 =for apidoc find_uninit_var
793 Find the name of the undefined variable (if any) that caused the operator o
794 to issue a "Use of uninitialized value" warning.
795 If match is true, only return a name if it's value matches uninit_sv.
796 So roughly speaking, if a unary operator (such as OP_COS) generates a
797 warning, then following the direct child of the op may yield an
798 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
799 other hand, with OP_ADD there are two branches to follow, so we only print
800 the variable name if we get an exact match.
802 The name is returned as a mortal SV.
804 Assumes that PL_op is the op that originally triggered the error, and that
805 PL_comppad/PL_curpad points to the currently executing pad.
811 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
820 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
821 uninit_sv == &PL_sv_placeholder)))
824 switch (obase->op_type) {
831 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
832 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
835 int subscript_type = FUV_SUBSCRIPT_WITHIN;
837 if (pad) { /* @lex, %lex */
838 sv = PAD_SVl(obase->op_targ);
842 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
843 /* @global, %global */
844 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
847 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
849 else /* @{expr}, %{expr} */
850 return find_uninit_var(cUNOPx(obase)->op_first,
854 /* attempt to find a match within the aggregate */
856 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
858 subscript_type = FUV_SUBSCRIPT_HASH;
861 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
863 subscript_type = FUV_SUBSCRIPT_ARRAY;
866 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
869 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
870 keysv, index, subscript_type);
874 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
876 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
877 Nullsv, 0, FUV_SUBSCRIPT_NONE);
880 gv = cGVOPx_gv(obase);
881 if (!gv || (match && GvSV(gv) != uninit_sv))
883 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
886 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
888 av = (AV*)PAD_SV(obase->op_targ);
889 if (!av || SvRMAGICAL(av))
891 svp = av_fetch(av, (I32)obase->op_private, FALSE);
892 if (!svp || *svp != uninit_sv)
895 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
896 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
899 gv = cGVOPx_gv(obase);
904 if (!av || SvRMAGICAL(av))
906 svp = av_fetch(av, (I32)obase->op_private, FALSE);
907 if (!svp || *svp != uninit_sv)
910 return S_varname(aTHX_ gv, "$", 0,
911 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
916 o = cUNOPx(obase)->op_first;
917 if (!o || o->op_type != OP_NULL ||
918 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
920 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
925 /* $a[uninit_expr] or $h{uninit_expr} */
926 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
929 o = cBINOPx(obase)->op_first;
930 kid = cBINOPx(obase)->op_last;
932 /* get the av or hv, and optionally the gv */
934 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
935 sv = PAD_SV(o->op_targ);
937 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
938 && cUNOPo->op_first->op_type == OP_GV)
940 gv = cGVOPx_gv(cUNOPo->op_first);
943 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
948 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
949 /* index is constant */
953 if (obase->op_type == OP_HELEM) {
954 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
955 if (!he || HeVAL(he) != uninit_sv)
959 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
960 if (!svp || *svp != uninit_sv)
964 if (obase->op_type == OP_HELEM)
965 return S_varname(aTHX_ gv, "%", o->op_targ,
966 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
968 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
969 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
973 /* index is an expression;
974 * attempt to find a match within the aggregate */
975 if (obase->op_type == OP_HELEM) {
976 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
978 return S_varname(aTHX_ gv, "%", o->op_targ,
979 keysv, 0, FUV_SUBSCRIPT_HASH);
982 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
984 return S_varname(aTHX_ gv, "@", o->op_targ,
985 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
989 return S_varname(aTHX_ gv,
990 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
992 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
998 /* only examine RHS */
999 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
1002 o = cUNOPx(obase)->op_first;
1003 if (o->op_type == OP_PUSHMARK)
1006 if (!o->op_sibling) {
1007 /* one-arg version of open is highly magical */
1009 if (o->op_type == OP_GV) { /* open FOO; */
1011 if (match && GvSV(gv) != uninit_sv)
1013 return S_varname(aTHX_ gv, "$", 0,
1014 Nullsv, 0, FUV_SUBSCRIPT_NONE);
1016 /* other possibilities not handled are:
1017 * open $x; or open my $x; should return '${*$x}'
1018 * open expr; should return '$'.expr ideally
1024 /* ops where $_ may be an implicit arg */
1028 if ( !(obase->op_flags & OPf_STACKED)) {
1029 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1030 ? PAD_SVl(obase->op_targ)
1033 sv = sv_newmortal();
1034 sv_setpvn(sv, "$_", 2);
1042 /* skip filehandle as it can't produce 'undef' warning */
1043 o = cUNOPx(obase)->op_first;
1044 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1045 o = o->op_sibling->op_sibling;
1052 match = 1; /* XS or custom code could trigger random warnings */
1057 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1058 return sv_2mortal(newSVpv("${$/}", 0));
1063 if (!(obase->op_flags & OPf_KIDS))
1065 o = cUNOPx(obase)->op_first;
1071 /* if all except one arg are constant, or have no side-effects,
1072 * or are optimized away, then it's unambiguous */
1074 for (kid=o; kid; kid = kid->op_sibling) {
1076 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1077 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1078 || (kid->op_type == OP_PUSHMARK)
1082 if (o2) { /* more than one found */
1089 return find_uninit_var(o2, uninit_sv, match);
1093 sv = find_uninit_var(o, uninit_sv, 1);
1105 =for apidoc report_uninit
1107 Print appropriate "Use of uninitialized variable" warning
1113 Perl_report_uninit(pTHX_ SV* uninit_sv)
1116 SV* varname = Nullsv;
1118 varname = find_uninit_var(PL_op, uninit_sv,0);
1120 sv_insert(varname, 0, 0, " ", 1);
1122 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1123 varname ? SvPV_nolen(varname) : "",
1124 " in ", OP_DESC(PL_op));
1127 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1131 /* allocate another arena's worth of NV bodies */
1139 New(711, ptr, PERL_ARENA_SIZE/sizeof(NV), NV);
1140 *((void **) ptr) = (void *)PL_xnv_arenaroot;
1141 PL_xnv_arenaroot = ptr;
1144 xnvend = &xnv[PERL_ARENA_SIZE / sizeof(NV) - 1];
1145 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1147 while (xnv < xnvend) {
1148 *(NV**)xnv = (NV*)(xnv + 1);
1154 /* allocate another arena's worth of struct xpv */
1160 xpv_allocated* xpvend;
1161 New(713, xpv, PERL_ARENA_SIZE/sizeof(xpv_allocated), xpv_allocated);
1162 *((xpv_allocated**)xpv) = PL_xpv_arenaroot;
1163 PL_xpv_arenaroot = xpv;
1165 xpvend = &xpv[PERL_ARENA_SIZE / sizeof(xpv_allocated) - 1];
1166 PL_xpv_root = ++xpv;
1167 while (xpv < xpvend) {
1168 *((xpv_allocated**)xpv) = xpv + 1;
1171 *((xpv_allocated**)xpv) = 0;
1174 /* allocate another arena's worth of struct xpviv */
1179 xpviv_allocated* xpviv;
1180 xpviv_allocated* xpvivend;
1181 New(713, xpviv, PERL_ARENA_SIZE/sizeof(xpviv_allocated), xpviv_allocated);
1182 *((xpviv_allocated**)xpviv) = PL_xpviv_arenaroot;
1183 PL_xpviv_arenaroot = xpviv;
1185 xpvivend = &xpviv[PERL_ARENA_SIZE / sizeof(xpviv_allocated) - 1];
1186 PL_xpviv_root = ++xpviv;
1187 while (xpviv < xpvivend) {
1188 *((xpviv_allocated**)xpviv) = xpviv + 1;
1191 *((xpviv_allocated**)xpviv) = 0;
1194 /* allocate another arena's worth of struct xpvnv */
1201 New(715, xpvnv, PERL_ARENA_SIZE/sizeof(XPVNV), XPVNV);
1202 *((XPVNV**)xpvnv) = PL_xpvnv_arenaroot;
1203 PL_xpvnv_arenaroot = xpvnv;
1205 xpvnvend = &xpvnv[PERL_ARENA_SIZE / sizeof(XPVNV) - 1];
1206 PL_xpvnv_root = ++xpvnv;
1207 while (xpvnv < xpvnvend) {
1208 *((XPVNV**)xpvnv) = xpvnv + 1;
1211 *((XPVNV**)xpvnv) = 0;
1214 /* allocate another arena's worth of struct xpvcv */
1221 New(716, xpvcv, PERL_ARENA_SIZE/sizeof(XPVCV), XPVCV);
1222 *((XPVCV**)xpvcv) = PL_xpvcv_arenaroot;
1223 PL_xpvcv_arenaroot = xpvcv;
1225 xpvcvend = &xpvcv[PERL_ARENA_SIZE / sizeof(XPVCV) - 1];
1226 PL_xpvcv_root = ++xpvcv;
1227 while (xpvcv < xpvcvend) {
1228 *((XPVCV**)xpvcv) = xpvcv + 1;
1231 *((XPVCV**)xpvcv) = 0;
1234 /* allocate another arena's worth of struct xpvav */
1239 xpvav_allocated* xpvav;
1240 xpvav_allocated* xpvavend;
1241 New(717, xpvav, PERL_ARENA_SIZE/sizeof(xpvav_allocated),
1243 *((xpvav_allocated**)xpvav) = PL_xpvav_arenaroot;
1244 PL_xpvav_arenaroot = xpvav;
1246 xpvavend = &xpvav[PERL_ARENA_SIZE / sizeof(xpvav_allocated) - 1];
1247 PL_xpvav_root = ++xpvav;
1248 while (xpvav < xpvavend) {
1249 *((xpvav_allocated**)xpvav) = xpvav + 1;
1252 *((xpvav_allocated**)xpvav) = 0;
1255 /* allocate another arena's worth of struct xpvhv */
1260 xpvhv_allocated* xpvhv;
1261 xpvhv_allocated* xpvhvend;
1262 New(718, xpvhv, PERL_ARENA_SIZE/sizeof(xpvhv_allocated),
1264 *((xpvhv_allocated**)xpvhv) = PL_xpvhv_arenaroot;
1265 PL_xpvhv_arenaroot = xpvhv;
1267 xpvhvend = &xpvhv[PERL_ARENA_SIZE / sizeof(xpvhv_allocated) - 1];
1268 PL_xpvhv_root = ++xpvhv;
1269 while (xpvhv < xpvhvend) {
1270 *((xpvhv_allocated**)xpvhv) = xpvhv + 1;
1273 *((xpvhv_allocated**)xpvhv) = 0;
1276 /* allocate another arena's worth of struct xpvmg */
1283 New(719, xpvmg, PERL_ARENA_SIZE/sizeof(XPVMG), XPVMG);
1284 *((XPVMG**)xpvmg) = PL_xpvmg_arenaroot;
1285 PL_xpvmg_arenaroot = xpvmg;
1287 xpvmgend = &xpvmg[PERL_ARENA_SIZE / sizeof(XPVMG) - 1];
1288 PL_xpvmg_root = ++xpvmg;
1289 while (xpvmg < xpvmgend) {
1290 *((XPVMG**)xpvmg) = xpvmg + 1;
1293 *((XPVMG**)xpvmg) = 0;
1296 /* allocate another arena's worth of struct xpvgv */
1303 New(720, xpvgv, PERL_ARENA_SIZE/sizeof(XPVGV), XPVGV);
1304 *((XPVGV**)xpvgv) = PL_xpvgv_arenaroot;
1305 PL_xpvgv_arenaroot = xpvgv;
1307 xpvgvend = &xpvgv[PERL_ARENA_SIZE / sizeof(XPVGV) - 1];
1308 PL_xpvgv_root = ++xpvgv;
1309 while (xpvgv < xpvgvend) {
1310 *((XPVGV**)xpvgv) = xpvgv + 1;
1313 *((XPVGV**)xpvgv) = 0;
1316 /* allocate another arena's worth of struct xpvlv */
1323 New(720, xpvlv, PERL_ARENA_SIZE/sizeof(XPVLV), XPVLV);
1324 *((XPVLV**)xpvlv) = PL_xpvlv_arenaroot;
1325 PL_xpvlv_arenaroot = xpvlv;
1327 xpvlvend = &xpvlv[PERL_ARENA_SIZE / sizeof(XPVLV) - 1];
1328 PL_xpvlv_root = ++xpvlv;
1329 while (xpvlv < xpvlvend) {
1330 *((XPVLV**)xpvlv) = xpvlv + 1;
1333 *((XPVLV**)xpvlv) = 0;
1336 /* allocate another arena's worth of struct xpvbm */
1343 New(721, xpvbm, PERL_ARENA_SIZE/sizeof(XPVBM), XPVBM);
1344 *((XPVBM**)xpvbm) = PL_xpvbm_arenaroot;
1345 PL_xpvbm_arenaroot = xpvbm;
1347 xpvbmend = &xpvbm[PERL_ARENA_SIZE / sizeof(XPVBM) - 1];
1348 PL_xpvbm_root = ++xpvbm;
1349 while (xpvbm < xpvbmend) {
1350 *((XPVBM**)xpvbm) = xpvbm + 1;
1353 *((XPVBM**)xpvbm) = 0;
1356 /* grab a new NV body from the free list, allocating more if necessary */
1366 PL_xnv_root = *(NV**)xnv;
1368 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1371 /* return an NV body to the free list */
1374 S_del_xnv(pTHX_ XPVNV *p)
1376 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1378 *(NV**)xnv = PL_xnv_root;
1383 /* grab a new struct xpv from the free list, allocating more if necessary */
1393 PL_xpv_root = *(xpv_allocated**)xpv;
1395 /* If xpv_allocated is the same structure as XPV then the two OFFSETs
1396 sum to zero, and the pointer is unchanged. If the allocated structure
1397 is smaller (no initial IV actually allocated) then the net effect is
1398 to subtract the size of the IV from the pointer, to return a new pointer
1399 as if an initial IV were actually allocated. */
1400 return (XPV*)((char*)xpv - STRUCT_OFFSET(XPV, xpv_cur)
1401 + STRUCT_OFFSET(xpv_allocated, xpv_cur));
1404 /* return a struct xpv to the free list */
1407 S_del_xpv(pTHX_ XPV *p)
1410 = (xpv_allocated*)((char*)(p) + STRUCT_OFFSET(XPV, xpv_cur)
1411 - STRUCT_OFFSET(xpv_allocated, xpv_cur));
1413 *(xpv_allocated**)xpv = PL_xpv_root;
1418 /* grab a new struct xpviv from the free list, allocating more if necessary */
1423 xpviv_allocated* xpviv;
1427 xpviv = PL_xpviv_root;
1428 PL_xpviv_root = *(xpviv_allocated**)xpviv;
1430 /* If xpviv_allocated is the same structure as XPVIV then the two OFFSETs
1431 sum to zero, and the pointer is unchanged. If the allocated structure
1432 is smaller (no initial IV actually allocated) then the net effect is
1433 to subtract the size of the IV from the pointer, to return a new pointer
1434 as if an initial IV were actually allocated. */
1435 return (XPVIV*)((char*)xpviv - STRUCT_OFFSET(XPVIV, xpv_cur)
1436 + STRUCT_OFFSET(xpviv_allocated, xpv_cur));
1439 /* return a struct xpviv to the free list */
1442 S_del_xpviv(pTHX_ XPVIV *p)
1444 xpviv_allocated* xpviv
1445 = (xpviv_allocated*)((char*)(p) + STRUCT_OFFSET(XPVIV, xpv_cur)
1446 - STRUCT_OFFSET(xpviv_allocated, xpv_cur));
1448 *(xpviv_allocated**)xpviv = PL_xpviv_root;
1449 PL_xpviv_root = xpviv;
1453 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1462 xpvnv = PL_xpvnv_root;
1463 PL_xpvnv_root = *(XPVNV**)xpvnv;
1468 /* return a struct xpvnv to the free list */
1471 S_del_xpvnv(pTHX_ XPVNV *p)
1474 *(XPVNV**)p = PL_xpvnv_root;
1479 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1488 xpvcv = PL_xpvcv_root;
1489 PL_xpvcv_root = *(XPVCV**)xpvcv;
1494 /* return a struct xpvcv to the free list */
1497 S_del_xpvcv(pTHX_ XPVCV *p)
1500 *(XPVCV**)p = PL_xpvcv_root;
1505 /* grab a new struct xpvav from the free list, allocating more if necessary */
1510 xpvav_allocated* xpvav;
1514 xpvav = PL_xpvav_root;
1515 PL_xpvav_root = *(xpvav_allocated**)xpvav;
1517 return (XPVAV*)((char*)xpvav - STRUCT_OFFSET(XPVAV, xav_fill)
1518 + STRUCT_OFFSET(xpvav_allocated, xav_fill));
1521 /* return a struct xpvav to the free list */
1524 S_del_xpvav(pTHX_ XPVAV *p)
1526 xpvav_allocated* xpvav
1527 = (xpvav_allocated*)((char*)(p) + STRUCT_OFFSET(XPVAV, xav_fill)
1528 - STRUCT_OFFSET(xpvav_allocated, xav_fill));
1530 *(xpvav_allocated**)xpvav = PL_xpvav_root;
1531 PL_xpvav_root = xpvav;
1535 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1540 xpvhv_allocated* xpvhv;
1544 xpvhv = PL_xpvhv_root;
1545 PL_xpvhv_root = *(xpvhv_allocated**)xpvhv;
1547 return (XPVHV*)((char*)xpvhv - STRUCT_OFFSET(XPVHV, xhv_fill)
1548 + STRUCT_OFFSET(xpvhv_allocated, xhv_fill));
1551 /* return a struct xpvhv to the free list */
1554 S_del_xpvhv(pTHX_ XPVHV *p)
1556 xpvhv_allocated* xpvhv
1557 = (xpvhv_allocated*)((char*)(p) + STRUCT_OFFSET(XPVHV, xhv_fill)
1558 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill));
1560 *(xpvhv_allocated**)xpvhv = PL_xpvhv_root;
1561 PL_xpvhv_root = xpvhv;
1565 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1574 xpvmg = PL_xpvmg_root;
1575 PL_xpvmg_root = *(XPVMG**)xpvmg;
1580 /* return a struct xpvmg to the free list */
1583 S_del_xpvmg(pTHX_ XPVMG *p)
1586 *(XPVMG**)p = PL_xpvmg_root;
1591 /* grab a new struct xpvgv from the free list, allocating more if necessary */
1600 xpvgv = PL_xpvgv_root;
1601 PL_xpvgv_root = *(XPVGV**)xpvgv;
1606 /* return a struct xpvgv to the free list */
1609 S_del_xpvgv(pTHX_ XPVGV *p)
1612 *(XPVGV**)p = PL_xpvgv_root;
1617 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1626 xpvlv = PL_xpvlv_root;
1627 PL_xpvlv_root = *(XPVLV**)xpvlv;
1632 /* return a struct xpvlv to the free list */
1635 S_del_xpvlv(pTHX_ XPVLV *p)
1638 *(XPVLV**)p = PL_xpvlv_root;
1643 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1652 xpvbm = PL_xpvbm_root;
1653 PL_xpvbm_root = *(XPVBM**)xpvbm;
1658 /* return a struct xpvbm to the free list */
1661 S_del_xpvbm(pTHX_ XPVBM *p)
1664 *(XPVBM**)p = PL_xpvbm_root;
1669 #define my_safemalloc(s) (void*)safemalloc(s)
1670 #define my_safefree(p) safefree((char*)p)
1674 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1675 #define del_XNV(p) my_safefree(p)
1677 #define new_XPV() my_safemalloc(sizeof(XPV))
1678 #define del_XPV(p) my_safefree(p)
1680 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1681 #define del_XPVIV(p) my_safefree(p)
1683 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1684 #define del_XPVNV(p) my_safefree(p)
1686 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1687 #define del_XPVCV(p) my_safefree(p)
1689 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1690 #define del_XPVAV(p) my_safefree(p)
1692 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1693 #define del_XPVHV(p) my_safefree(p)
1695 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1696 #define del_XPVMG(p) my_safefree(p)
1698 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1699 #define del_XPVGV(p) my_safefree(p)
1701 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1702 #define del_XPVLV(p) my_safefree(p)
1704 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1705 #define del_XPVBM(p) my_safefree(p)
1709 #define new_XNV() (void*)new_xnv()
1710 #define del_XNV(p) del_xnv((XPVNV*) p)
1712 #define new_XPV() (void*)new_xpv()
1713 #define del_XPV(p) del_xpv((XPV *)p)
1715 #define new_XPVIV() (void*)new_xpviv()
1716 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1718 #define new_XPVNV() (void*)new_xpvnv()
1719 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1721 #define new_XPVCV() (void*)new_xpvcv()
1722 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1724 #define new_XPVAV() (void*)new_xpvav()
1725 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1727 #define new_XPVHV() (void*)new_xpvhv()
1728 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1730 #define new_XPVMG() (void*)new_xpvmg()
1731 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1733 #define new_XPVGV() (void*)new_xpvgv()
1734 #define del_XPVGV(p) del_xpvgv((XPVGV *)p)
1736 #define new_XPVLV() (void*)new_xpvlv()
1737 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1739 #define new_XPVBM() (void*)new_xpvbm()
1740 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1744 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1745 #define del_XPVFM(p) my_safefree(p)
1747 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1748 #define del_XPVIO(p) my_safefree(p)
1751 =for apidoc sv_upgrade
1753 Upgrade an SV to a more complex form. Generally adds a new body type to the
1754 SV, then copies across as much information as possible from the old body.
1755 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1761 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1772 if (mt != SVt_PV && SvIsCOW(sv)) {
1773 sv_force_normal_flags(sv, 0);
1776 if (SvTYPE(sv) == mt)
1787 switch (SvTYPE(sv)) {
1794 else if (mt < SVt_PVIV)
1804 pv = (char*)SvRV(sv);
1807 pv = SvPVX_mutable(sv);
1813 else if (mt == SVt_NV)
1817 pv = SvPVX_mutable(sv);
1821 del_XPVIV(SvANY(sv));
1824 pv = SvPVX_mutable(sv);
1829 del_XPVNV(SvANY(sv));
1832 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1833 there's no way that it can be safely upgraded, because perl.c
1834 expects to Safefree(SvANY(PL_mess_sv)) */
1835 assert(sv != PL_mess_sv);
1836 /* This flag bit is used to mean other things in other scalar types.
1837 Given that it only has meaning inside the pad, it shouldn't be set
1838 on anything that can get upgraded. */
1839 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1840 pv = SvPVX_mutable(sv);
1845 magic = SvMAGIC(sv);
1846 stash = SvSTASH(sv);
1847 del_XPVMG(SvANY(sv));
1850 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1853 SvFLAGS(sv) &= ~SVTYPEMASK;
1858 Perl_croak(aTHX_ "Can't upgrade to undef");
1860 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1864 SvANY(sv) = new_XNV();
1868 SvANY(sv) = &sv->sv_u.svu_rv;
1869 SvRV_set(sv, (SV*)pv);
1872 SvANY(sv) = new_XPVHV();
1875 HvTOTALKEYS(sv) = 0;
1877 /* Fall through... */
1880 SvANY(sv) = new_XPVAV();
1887 /* XXX? Only SVt_NULL is ever upgraded to AV or HV? */
1889 /* FIXME. Should be able to remove all this if()... if the above
1890 assertion is genuinely always true. */
1893 SvFLAGS(sv) &= ~SVf_OOK;
1896 SvPV_set(sv, (char*)0);
1897 SvMAGIC_set(sv, magic);
1898 SvSTASH_set(sv, stash);
1902 SvANY(sv) = new_XPVIO();
1903 Zero(SvANY(sv), 1, XPVIO);
1904 IoPAGE_LEN(sv) = 60;
1905 goto set_magic_common;
1907 SvANY(sv) = new_XPVFM();
1908 Zero(SvANY(sv), 1, XPVFM);
1909 goto set_magic_common;
1911 SvANY(sv) = new_XPVBM();
1915 goto set_magic_common;
1917 SvANY(sv) = new_XPVGV();
1923 goto set_magic_common;
1925 SvANY(sv) = new_XPVCV();
1926 Zero(SvANY(sv), 1, XPVCV);
1927 goto set_magic_common;
1929 SvANY(sv) = new_XPVLV();
1942 SvANY(sv) = new_XPVMG();
1945 SvMAGIC_set(sv, magic);
1946 SvSTASH_set(sv, stash);
1950 SvANY(sv) = new_XPVNV();
1956 SvANY(sv) = new_XPVIV();
1965 SvANY(sv) = new_XPV();
1976 =for apidoc sv_backoff
1978 Remove any string offset. You should normally use the C<SvOOK_off> macro
1985 Perl_sv_backoff(pTHX_ register SV *sv)
1988 assert(SvTYPE(sv) != SVt_PVHV);
1989 assert(SvTYPE(sv) != SVt_PVAV);
1991 const char *s = SvPVX_const(sv);
1992 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1993 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1995 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1997 SvFLAGS(sv) &= ~SVf_OOK;
2004 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2005 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2006 Use the C<SvGROW> wrapper instead.
2012 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2016 #ifdef HAS_64K_LIMIT
2017 if (newlen >= 0x10000) {
2018 PerlIO_printf(Perl_debug_log,
2019 "Allocation too large: %"UVxf"\n", (UV)newlen);
2022 #endif /* HAS_64K_LIMIT */
2025 if (SvTYPE(sv) < SVt_PV) {
2026 sv_upgrade(sv, SVt_PV);
2029 else if (SvOOK(sv)) { /* pv is offset? */
2032 if (newlen > SvLEN(sv))
2033 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2034 #ifdef HAS_64K_LIMIT
2035 if (newlen >= 0x10000)
2040 s = SvPVX_mutable(sv);
2042 if (newlen > SvLEN(sv)) { /* need more room? */
2043 newlen = PERL_STRLEN_ROUNDUP(newlen);
2044 if (SvLEN(sv) && s) {
2046 const STRLEN l = malloced_size((void*)SvPVX(sv));
2052 s = saferealloc(s, newlen);
2055 s = safemalloc(newlen);
2056 if (SvPVX_const(sv) && SvCUR(sv)) {
2057 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2061 SvLEN_set(sv, newlen);
2067 =for apidoc sv_setiv
2069 Copies an integer into the given SV, upgrading first if necessary.
2070 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2076 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2078 SV_CHECK_THINKFIRST_COW_DROP(sv);
2079 switch (SvTYPE(sv)) {
2081 sv_upgrade(sv, SVt_IV);
2084 sv_upgrade(sv, SVt_PVNV);
2088 sv_upgrade(sv, SVt_PVIV);
2097 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2100 (void)SvIOK_only(sv); /* validate number */
2106 =for apidoc sv_setiv_mg
2108 Like C<sv_setiv>, but also handles 'set' magic.
2114 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2121 =for apidoc sv_setuv
2123 Copies an unsigned integer into the given SV, upgrading first if necessary.
2124 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2130 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2132 /* With these two if statements:
2133 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2136 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2138 If you wish to remove them, please benchmark to see what the effect is
2140 if (u <= (UV)IV_MAX) {
2141 sv_setiv(sv, (IV)u);
2150 =for apidoc sv_setuv_mg
2152 Like C<sv_setuv>, but also handles 'set' magic.
2158 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2160 /* With these two if statements:
2161 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2164 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2166 If you wish to remove them, please benchmark to see what the effect is
2168 if (u <= (UV)IV_MAX) {
2169 sv_setiv(sv, (IV)u);
2179 =for apidoc sv_setnv
2181 Copies a double into the given SV, upgrading first if necessary.
2182 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2188 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2190 SV_CHECK_THINKFIRST_COW_DROP(sv);
2191 switch (SvTYPE(sv)) {
2194 sv_upgrade(sv, SVt_NV);
2199 sv_upgrade(sv, SVt_PVNV);
2208 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2212 (void)SvNOK_only(sv); /* validate number */
2217 =for apidoc sv_setnv_mg
2219 Like C<sv_setnv>, but also handles 'set' magic.
2225 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2231 /* Print an "isn't numeric" warning, using a cleaned-up,
2232 * printable version of the offending string
2236 S_not_a_number(pTHX_ SV *sv)
2243 dsv = sv_2mortal(newSVpv("", 0));
2244 pv = sv_uni_display(dsv, sv, 10, 0);
2247 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2248 /* each *s can expand to 4 chars + "...\0",
2249 i.e. need room for 8 chars */
2251 const char *s, *end;
2252 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
2255 if (ch & 128 && !isPRINT_LC(ch)) {
2264 else if (ch == '\r') {
2268 else if (ch == '\f') {
2272 else if (ch == '\\') {
2276 else if (ch == '\0') {
2280 else if (isPRINT_LC(ch))
2297 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2298 "Argument \"%s\" isn't numeric in %s", pv,
2301 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2302 "Argument \"%s\" isn't numeric", pv);
2306 =for apidoc looks_like_number
2308 Test if the content of an SV looks like a number (or is a number).
2309 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2310 non-numeric warning), even if your atof() doesn't grok them.
2316 Perl_looks_like_number(pTHX_ SV *sv)
2318 register const char *sbegin;
2322 sbegin = SvPVX_const(sv);
2325 else if (SvPOKp(sv))
2326 sbegin = SvPV(sv, len);
2328 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2329 return grok_number(sbegin, len, NULL);
2332 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2333 until proven guilty, assume that things are not that bad... */
2338 As 64 bit platforms often have an NV that doesn't preserve all bits of
2339 an IV (an assumption perl has been based on to date) it becomes necessary
2340 to remove the assumption that the NV always carries enough precision to
2341 recreate the IV whenever needed, and that the NV is the canonical form.
2342 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2343 precision as a side effect of conversion (which would lead to insanity
2344 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2345 1) to distinguish between IV/UV/NV slots that have cached a valid
2346 conversion where precision was lost and IV/UV/NV slots that have a
2347 valid conversion which has lost no precision
2348 2) to ensure that if a numeric conversion to one form is requested that
2349 would lose precision, the precise conversion (or differently
2350 imprecise conversion) is also performed and cached, to prevent
2351 requests for different numeric formats on the same SV causing
2352 lossy conversion chains. (lossless conversion chains are perfectly
2357 SvIOKp is true if the IV slot contains a valid value
2358 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2359 SvNOKp is true if the NV slot contains a valid value
2360 SvNOK is true only if the NV value is accurate
2363 while converting from PV to NV, check to see if converting that NV to an
2364 IV(or UV) would lose accuracy over a direct conversion from PV to
2365 IV(or UV). If it would, cache both conversions, return NV, but mark
2366 SV as IOK NOKp (ie not NOK).
2368 While converting from PV to IV, check to see if converting that IV to an
2369 NV would lose accuracy over a direct conversion from PV to NV. If it
2370 would, cache both conversions, flag similarly.
2372 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2373 correctly because if IV & NV were set NV *always* overruled.
2374 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2375 changes - now IV and NV together means that the two are interchangeable:
2376 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2378 The benefit of this is that operations such as pp_add know that if
2379 SvIOK is true for both left and right operands, then integer addition
2380 can be used instead of floating point (for cases where the result won't
2381 overflow). Before, floating point was always used, which could lead to
2382 loss of precision compared with integer addition.
2384 * making IV and NV equal status should make maths accurate on 64 bit
2386 * may speed up maths somewhat if pp_add and friends start to use
2387 integers when possible instead of fp. (Hopefully the overhead in
2388 looking for SvIOK and checking for overflow will not outweigh the
2389 fp to integer speedup)
2390 * will slow down integer operations (callers of SvIV) on "inaccurate"
2391 values, as the change from SvIOK to SvIOKp will cause a call into
2392 sv_2iv each time rather than a macro access direct to the IV slot
2393 * should speed up number->string conversion on integers as IV is
2394 favoured when IV and NV are equally accurate
2396 ####################################################################
2397 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2398 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2399 On the other hand, SvUOK is true iff UV.
2400 ####################################################################
2402 Your mileage will vary depending your CPU's relative fp to integer
2406 #ifndef NV_PRESERVES_UV
2407 # define IS_NUMBER_UNDERFLOW_IV 1
2408 # define IS_NUMBER_UNDERFLOW_UV 2
2409 # define IS_NUMBER_IV_AND_UV 2
2410 # define IS_NUMBER_OVERFLOW_IV 4
2411 # define IS_NUMBER_OVERFLOW_UV 5
2413 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2415 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2417 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2419 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX_const(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
2420 if (SvNVX(sv) < (NV)IV_MIN) {
2421 (void)SvIOKp_on(sv);
2423 SvIV_set(sv, IV_MIN);
2424 return IS_NUMBER_UNDERFLOW_IV;
2426 if (SvNVX(sv) > (NV)UV_MAX) {
2427 (void)SvIOKp_on(sv);
2430 SvUV_set(sv, UV_MAX);
2431 return IS_NUMBER_OVERFLOW_UV;
2433 (void)SvIOKp_on(sv);
2435 /* Can't use strtol etc to convert this string. (See truth table in
2437 if (SvNVX(sv) <= (UV)IV_MAX) {
2438 SvIV_set(sv, I_V(SvNVX(sv)));
2439 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2440 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2442 /* Integer is imprecise. NOK, IOKp */
2444 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2447 SvUV_set(sv, U_V(SvNVX(sv)));
2448 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2449 if (SvUVX(sv) == UV_MAX) {
2450 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2451 possibly be preserved by NV. Hence, it must be overflow.
2453 return IS_NUMBER_OVERFLOW_UV;
2455 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2457 /* Integer is imprecise. NOK, IOKp */
2459 return IS_NUMBER_OVERFLOW_IV;
2461 #endif /* !NV_PRESERVES_UV*/
2463 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2464 * this function provided for binary compatibility only
2468 Perl_sv_2iv(pTHX_ register SV *sv)
2470 return sv_2iv_flags(sv, SV_GMAGIC);
2474 =for apidoc sv_2iv_flags
2476 Return the integer value of an SV, doing any necessary string
2477 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2478 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2484 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2488 if (SvGMAGICAL(sv)) {
2489 if (flags & SV_GMAGIC)
2494 return I_V(SvNVX(sv));
2496 if (SvPOKp(sv) && SvLEN(sv))
2499 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2500 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2506 if (SvTHINKFIRST(sv)) {
2509 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2510 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2511 return SvIV(tmpstr);
2512 return PTR2IV(SvRV(sv));
2515 sv_force_normal_flags(sv, 0);
2517 if (SvREADONLY(sv) && !SvOK(sv)) {
2518 if (ckWARN(WARN_UNINITIALIZED))
2525 return (IV)(SvUVX(sv));
2532 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2533 * without also getting a cached IV/UV from it at the same time
2534 * (ie PV->NV conversion should detect loss of accuracy and cache
2535 * IV or UV at same time to avoid this. NWC */
2537 if (SvTYPE(sv) == SVt_NV)
2538 sv_upgrade(sv, SVt_PVNV);
2540 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2541 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2542 certainly cast into the IV range at IV_MAX, whereas the correct
2543 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2545 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2546 SvIV_set(sv, I_V(SvNVX(sv)));
2547 if (SvNVX(sv) == (NV) SvIVX(sv)
2548 #ifndef NV_PRESERVES_UV
2549 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2550 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2551 /* Don't flag it as "accurately an integer" if the number
2552 came from a (by definition imprecise) NV operation, and
2553 we're outside the range of NV integer precision */
2556 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2557 DEBUG_c(PerlIO_printf(Perl_debug_log,
2558 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2564 /* IV not precise. No need to convert from PV, as NV
2565 conversion would already have cached IV if it detected
2566 that PV->IV would be better than PV->NV->IV
2567 flags already correct - don't set public IOK. */
2568 DEBUG_c(PerlIO_printf(Perl_debug_log,
2569 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2574 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2575 but the cast (NV)IV_MIN rounds to a the value less (more
2576 negative) than IV_MIN which happens to be equal to SvNVX ??
2577 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2578 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2579 (NV)UVX == NVX are both true, but the values differ. :-(
2580 Hopefully for 2s complement IV_MIN is something like
2581 0x8000000000000000 which will be exact. NWC */
2584 SvUV_set(sv, U_V(SvNVX(sv)));
2586 (SvNVX(sv) == (NV) SvUVX(sv))
2587 #ifndef NV_PRESERVES_UV
2588 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2589 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2590 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2591 /* Don't flag it as "accurately an integer" if the number
2592 came from a (by definition imprecise) NV operation, and
2593 we're outside the range of NV integer precision */
2599 DEBUG_c(PerlIO_printf(Perl_debug_log,
2600 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2604 return (IV)SvUVX(sv);
2607 else if (SvPOKp(sv) && SvLEN(sv)) {
2609 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2610 /* We want to avoid a possible problem when we cache an IV which
2611 may be later translated to an NV, and the resulting NV is not
2612 the same as the direct translation of the initial string
2613 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2614 be careful to ensure that the value with the .456 is around if the
2615 NV value is requested in the future).
2617 This means that if we cache such an IV, we need to cache the
2618 NV as well. Moreover, we trade speed for space, and do not
2619 cache the NV if we are sure it's not needed.
2622 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2623 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2624 == IS_NUMBER_IN_UV) {
2625 /* It's definitely an integer, only upgrade to PVIV */
2626 if (SvTYPE(sv) < SVt_PVIV)
2627 sv_upgrade(sv, SVt_PVIV);
2629 } else if (SvTYPE(sv) < SVt_PVNV)
2630 sv_upgrade(sv, SVt_PVNV);
2632 /* If NV preserves UV then we only use the UV value if we know that
2633 we aren't going to call atof() below. If NVs don't preserve UVs
2634 then the value returned may have more precision than atof() will
2635 return, even though value isn't perfectly accurate. */
2636 if ((numtype & (IS_NUMBER_IN_UV
2637 #ifdef NV_PRESERVES_UV
2640 )) == IS_NUMBER_IN_UV) {
2641 /* This won't turn off the public IOK flag if it was set above */
2642 (void)SvIOKp_on(sv);
2644 if (!(numtype & IS_NUMBER_NEG)) {
2646 if (value <= (UV)IV_MAX) {
2647 SvIV_set(sv, (IV)value);
2649 SvUV_set(sv, value);
2653 /* 2s complement assumption */
2654 if (value <= (UV)IV_MIN) {
2655 SvIV_set(sv, -(IV)value);
2657 /* Too negative for an IV. This is a double upgrade, but
2658 I'm assuming it will be rare. */
2659 if (SvTYPE(sv) < SVt_PVNV)
2660 sv_upgrade(sv, SVt_PVNV);
2664 SvNV_set(sv, -(NV)value);
2665 SvIV_set(sv, IV_MIN);
2669 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2670 will be in the previous block to set the IV slot, and the next
2671 block to set the NV slot. So no else here. */
2673 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2674 != IS_NUMBER_IN_UV) {
2675 /* It wasn't an (integer that doesn't overflow the UV). */
2676 SvNV_set(sv, Atof(SvPVX_const(sv)));
2678 if (! numtype && ckWARN(WARN_NUMERIC))
2681 #if defined(USE_LONG_DOUBLE)
2682 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2683 PTR2UV(sv), SvNVX(sv)));
2685 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2686 PTR2UV(sv), SvNVX(sv)));
2690 #ifdef NV_PRESERVES_UV
2691 (void)SvIOKp_on(sv);
2693 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2694 SvIV_set(sv, I_V(SvNVX(sv)));
2695 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2698 /* Integer is imprecise. NOK, IOKp */
2700 /* UV will not work better than IV */
2702 if (SvNVX(sv) > (NV)UV_MAX) {
2704 /* Integer is inaccurate. NOK, IOKp, is UV */
2705 SvUV_set(sv, UV_MAX);
2708 SvUV_set(sv, U_V(SvNVX(sv)));
2709 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2710 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2714 /* Integer is imprecise. NOK, IOKp, is UV */
2720 #else /* NV_PRESERVES_UV */
2721 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2722 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2723 /* The IV slot will have been set from value returned by
2724 grok_number above. The NV slot has just been set using
2727 assert (SvIOKp(sv));
2729 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2730 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2731 /* Small enough to preserve all bits. */
2732 (void)SvIOKp_on(sv);
2734 SvIV_set(sv, I_V(SvNVX(sv)));
2735 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2737 /* Assumption: first non-preserved integer is < IV_MAX,
2738 this NV is in the preserved range, therefore: */
2739 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2741 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs((double)SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2745 0 0 already failed to read UV.
2746 0 1 already failed to read UV.
2747 1 0 you won't get here in this case. IV/UV
2748 slot set, public IOK, Atof() unneeded.
2749 1 1 already read UV.
2750 so there's no point in sv_2iuv_non_preserve() attempting
2751 to use atol, strtol, strtoul etc. */
2752 if (sv_2iuv_non_preserve (sv, numtype)
2753 >= IS_NUMBER_OVERFLOW_IV)
2757 #endif /* NV_PRESERVES_UV */
2760 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2762 if (SvTYPE(sv) < SVt_IV)
2763 /* Typically the caller expects that sv_any is not NULL now. */
2764 sv_upgrade(sv, SVt_IV);
2767 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2768 PTR2UV(sv),SvIVX(sv)));
2769 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2772 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2773 * this function provided for binary compatibility only
2777 Perl_sv_2uv(pTHX_ register SV *sv)
2779 return sv_2uv_flags(sv, SV_GMAGIC);
2783 =for apidoc sv_2uv_flags
2785 Return the unsigned integer value of an SV, doing any necessary string
2786 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2787 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2793 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2797 if (SvGMAGICAL(sv)) {
2798 if (flags & SV_GMAGIC)
2803 return U_V(SvNVX(sv));
2804 if (SvPOKp(sv) && SvLEN(sv))
2807 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2808 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2814 if (SvTHINKFIRST(sv)) {
2817 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2818 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2819 return SvUV(tmpstr);
2820 return PTR2UV(SvRV(sv));
2823 sv_force_normal_flags(sv, 0);
2825 if (SvREADONLY(sv) && !SvOK(sv)) {
2826 if (ckWARN(WARN_UNINITIALIZED))
2836 return (UV)SvIVX(sv);
2840 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2841 * without also getting a cached IV/UV from it at the same time
2842 * (ie PV->NV conversion should detect loss of accuracy and cache
2843 * IV or UV at same time to avoid this. */
2844 /* IV-over-UV optimisation - choose to cache IV if possible */
2846 if (SvTYPE(sv) == SVt_NV)
2847 sv_upgrade(sv, SVt_PVNV);
2849 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2850 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2851 SvIV_set(sv, I_V(SvNVX(sv)));
2852 if (SvNVX(sv) == (NV) SvIVX(sv)
2853 #ifndef NV_PRESERVES_UV
2854 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2855 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2856 /* Don't flag it as "accurately an integer" if the number
2857 came from a (by definition imprecise) NV operation, and
2858 we're outside the range of NV integer precision */
2861 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2862 DEBUG_c(PerlIO_printf(Perl_debug_log,
2863 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2869 /* IV not precise. No need to convert from PV, as NV
2870 conversion would already have cached IV if it detected
2871 that PV->IV would be better than PV->NV->IV
2872 flags already correct - don't set public IOK. */
2873 DEBUG_c(PerlIO_printf(Perl_debug_log,
2874 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2879 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2880 but the cast (NV)IV_MIN rounds to a the value less (more
2881 negative) than IV_MIN which happens to be equal to SvNVX ??
2882 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2883 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2884 (NV)UVX == NVX are both true, but the values differ. :-(
2885 Hopefully for 2s complement IV_MIN is something like
2886 0x8000000000000000 which will be exact. NWC */
2889 SvUV_set(sv, U_V(SvNVX(sv)));
2891 (SvNVX(sv) == (NV) SvUVX(sv))
2892 #ifndef NV_PRESERVES_UV
2893 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2894 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2895 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2896 /* Don't flag it as "accurately an integer" if the number
2897 came from a (by definition imprecise) NV operation, and
2898 we're outside the range of NV integer precision */
2903 DEBUG_c(PerlIO_printf(Perl_debug_log,
2904 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2910 else if (SvPOKp(sv) && SvLEN(sv)) {
2912 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2914 /* We want to avoid a possible problem when we cache a UV which
2915 may be later translated to an NV, and the resulting NV is not
2916 the translation of the initial data.
2918 This means that if we cache such a UV, we need to cache the
2919 NV as well. Moreover, we trade speed for space, and do not
2920 cache the NV if not needed.
2923 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2924 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2925 == IS_NUMBER_IN_UV) {
2926 /* It's definitely an integer, only upgrade to PVIV */
2927 if (SvTYPE(sv) < SVt_PVIV)
2928 sv_upgrade(sv, SVt_PVIV);
2930 } else if (SvTYPE(sv) < SVt_PVNV)
2931 sv_upgrade(sv, SVt_PVNV);
2933 /* If NV preserves UV then we only use the UV value if we know that
2934 we aren't going to call atof() below. If NVs don't preserve UVs
2935 then the value returned may have more precision than atof() will
2936 return, even though it isn't accurate. */
2937 if ((numtype & (IS_NUMBER_IN_UV
2938 #ifdef NV_PRESERVES_UV
2941 )) == IS_NUMBER_IN_UV) {
2942 /* This won't turn off the public IOK flag if it was set above */
2943 (void)SvIOKp_on(sv);
2945 if (!(numtype & IS_NUMBER_NEG)) {
2947 if (value <= (UV)IV_MAX) {
2948 SvIV_set(sv, (IV)value);
2950 /* it didn't overflow, and it was positive. */
2951 SvUV_set(sv, value);
2955 /* 2s complement assumption */
2956 if (value <= (UV)IV_MIN) {
2957 SvIV_set(sv, -(IV)value);
2959 /* Too negative for an IV. This is a double upgrade, but
2960 I'm assuming it will be rare. */
2961 if (SvTYPE(sv) < SVt_PVNV)
2962 sv_upgrade(sv, SVt_PVNV);
2966 SvNV_set(sv, -(NV)value);
2967 SvIV_set(sv, IV_MIN);
2972 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2973 != IS_NUMBER_IN_UV) {
2974 /* It wasn't an integer, or it overflowed the UV. */
2975 SvNV_set(sv, Atof(SvPVX_const(sv)));
2977 if (! numtype && ckWARN(WARN_NUMERIC))
2980 #if defined(USE_LONG_DOUBLE)
2981 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2982 PTR2UV(sv), SvNVX(sv)));
2984 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2985 PTR2UV(sv), SvNVX(sv)));
2988 #ifdef NV_PRESERVES_UV
2989 (void)SvIOKp_on(sv);
2991 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2992 SvIV_set(sv, I_V(SvNVX(sv)));
2993 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2996 /* Integer is imprecise. NOK, IOKp */
2998 /* UV will not work better than IV */
3000 if (SvNVX(sv) > (NV)UV_MAX) {
3002 /* Integer is inaccurate. NOK, IOKp, is UV */
3003 SvUV_set(sv, UV_MAX);
3006 SvUV_set(sv, U_V(SvNVX(sv)));
3007 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3008 NV preservse UV so can do correct comparison. */
3009 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3013 /* Integer is imprecise. NOK, IOKp, is UV */
3018 #else /* NV_PRESERVES_UV */
3019 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3020 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3021 /* The UV slot will have been set from value returned by
3022 grok_number above. The NV slot has just been set using
3025 assert (SvIOKp(sv));
3027 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3028 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3029 /* Small enough to preserve all bits. */
3030 (void)SvIOKp_on(sv);
3032 SvIV_set(sv, I_V(SvNVX(sv)));
3033 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3035 /* Assumption: first non-preserved integer is < IV_MAX,
3036 this NV is in the preserved range, therefore: */
3037 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3039 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs((double)SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
3042 sv_2iuv_non_preserve (sv, numtype);
3044 #endif /* NV_PRESERVES_UV */
3048 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3049 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3052 if (SvTYPE(sv) < SVt_IV)
3053 /* Typically the caller expects that sv_any is not NULL now. */
3054 sv_upgrade(sv, SVt_IV);
3058 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3059 PTR2UV(sv),SvUVX(sv)));
3060 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3066 Return the num value of an SV, doing any necessary string or integer
3067 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3074 Perl_sv_2nv(pTHX_ register SV *sv)
3078 if (SvGMAGICAL(sv)) {
3082 if (SvPOKp(sv) && SvLEN(sv)) {
3083 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3084 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
3086 return Atof(SvPVX_const(sv));
3090 return (NV)SvUVX(sv);
3092 return (NV)SvIVX(sv);
3095 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3096 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3102 if (SvTHINKFIRST(sv)) {
3105 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3106 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3107 return SvNV(tmpstr);
3108 return PTR2NV(SvRV(sv));
3111 sv_force_normal_flags(sv, 0);
3113 if (SvREADONLY(sv) && !SvOK(sv)) {
3114 if (ckWARN(WARN_UNINITIALIZED))
3119 if (SvTYPE(sv) < SVt_NV) {
3120 if (SvTYPE(sv) == SVt_IV)
3121 sv_upgrade(sv, SVt_PVNV);
3123 sv_upgrade(sv, SVt_NV);
3124 #ifdef USE_LONG_DOUBLE
3126 STORE_NUMERIC_LOCAL_SET_STANDARD();
3127 PerlIO_printf(Perl_debug_log,
3128 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3129 PTR2UV(sv), SvNVX(sv));
3130 RESTORE_NUMERIC_LOCAL();
3134 STORE_NUMERIC_LOCAL_SET_STANDARD();
3135 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3136 PTR2UV(sv), SvNVX(sv));
3137 RESTORE_NUMERIC_LOCAL();
3141 else if (SvTYPE(sv) < SVt_PVNV)
3142 sv_upgrade(sv, SVt_PVNV);
3147 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3148 #ifdef NV_PRESERVES_UV
3151 /* Only set the public NV OK flag if this NV preserves the IV */
3152 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3153 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3154 : (SvIVX(sv) == I_V(SvNVX(sv))))
3160 else if (SvPOKp(sv) && SvLEN(sv)) {
3162 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
3163 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3165 #ifdef NV_PRESERVES_UV
3166 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3167 == IS_NUMBER_IN_UV) {
3168 /* It's definitely an integer */
3169 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3171 SvNV_set(sv, Atof(SvPVX_const(sv)));
3174 SvNV_set(sv, Atof(SvPVX_const(sv)));
3175 /* Only set the public NV OK flag if this NV preserves the value in
3176 the PV at least as well as an IV/UV would.
3177 Not sure how to do this 100% reliably. */
3178 /* if that shift count is out of range then Configure's test is
3179 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3181 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3182 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3183 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3184 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3185 /* Can't use strtol etc to convert this string, so don't try.
3186 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3189 /* value has been set. It may not be precise. */
3190 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3191 /* 2s complement assumption for (UV)IV_MIN */
3192 SvNOK_on(sv); /* Integer is too negative. */
3197 if (numtype & IS_NUMBER_NEG) {
3198 SvIV_set(sv, -(IV)value);
3199 } else if (value <= (UV)IV_MAX) {
3200 SvIV_set(sv, (IV)value);
3202 SvUV_set(sv, value);
3206 if (numtype & IS_NUMBER_NOT_INT) {
3207 /* I believe that even if the original PV had decimals,
3208 they are lost beyond the limit of the FP precision.
3209 However, neither is canonical, so both only get p
3210 flags. NWC, 2000/11/25 */
3211 /* Both already have p flags, so do nothing */
3213 const NV nv = SvNVX(sv);
3214 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3215 if (SvIVX(sv) == I_V(nv)) {
3220 /* It had no "." so it must be integer. */
3223 /* between IV_MAX and NV(UV_MAX).
3224 Could be slightly > UV_MAX */
3226 if (numtype & IS_NUMBER_NOT_INT) {
3227 /* UV and NV both imprecise. */
3229 const UV nv_as_uv = U_V(nv);
3231 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3242 #endif /* NV_PRESERVES_UV */
3245 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3247 if (SvTYPE(sv) < SVt_NV)
3248 /* Typically the caller expects that sv_any is not NULL now. */
3249 /* XXX Ilya implies that this is a bug in callers that assume this
3250 and ideally should be fixed. */
3251 sv_upgrade(sv, SVt_NV);
3254 #if defined(USE_LONG_DOUBLE)
3256 STORE_NUMERIC_LOCAL_SET_STANDARD();
3257 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3258 PTR2UV(sv), SvNVX(sv));
3259 RESTORE_NUMERIC_LOCAL();
3263 STORE_NUMERIC_LOCAL_SET_STANDARD();
3264 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3265 PTR2UV(sv), SvNVX(sv));
3266 RESTORE_NUMERIC_LOCAL();
3272 /* asIV(): extract an integer from the string value of an SV.
3273 * Caller must validate PVX */
3276 S_asIV(pTHX_ SV *sv)
3279 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
3281 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3282 == IS_NUMBER_IN_UV) {
3283 /* It's definitely an integer */
3284 if (numtype & IS_NUMBER_NEG) {
3285 if (value < (UV)IV_MIN)
3288 if (value < (UV)IV_MAX)
3293 if (ckWARN(WARN_NUMERIC))
3296 return I_V(Atof(SvPVX_const(sv)));
3299 /* asUV(): extract an unsigned integer from the string value of an SV
3300 * Caller must validate PVX */
3303 S_asUV(pTHX_ SV *sv)
3306 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
3308 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3309 == IS_NUMBER_IN_UV) {
3310 /* It's definitely an integer */
3311 if (!(numtype & IS_NUMBER_NEG))
3315 if (ckWARN(WARN_NUMERIC))
3318 return U_V(Atof(SvPVX_const(sv)));
3322 =for apidoc sv_2pv_nolen
3324 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3325 use the macro wrapper C<SvPV_nolen(sv)> instead.
3330 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3332 return sv_2pv(sv, 0);
3335 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3336 * UV as a string towards the end of buf, and return pointers to start and
3339 * We assume that buf is at least TYPE_CHARS(UV) long.
3343 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3345 char *ptr = buf + TYPE_CHARS(UV);
3359 *--ptr = '0' + (char)(uv % 10);
3367 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3368 * this function provided for binary compatibility only
3372 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3374 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3378 =for apidoc sv_2pv_flags
3380 Returns a pointer to the string value of an SV, and sets *lp to its length.
3381 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3383 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3384 usually end up here too.
3390 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3395 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3396 char *tmpbuf = tbuf;
3400 /* Saves needing to do lots of if (!lp) checks below */
3408 if (SvGMAGICAL(sv)) {
3409 if (flags & SV_GMAGIC)
3413 if (flags & SV_CONST_RETURN)
3414 return (char *)SvPVX_const(sv);
3419 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3421 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3426 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3431 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3432 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3439 if (SvTHINKFIRST(sv)) {
3442 register const char *typestr;
3443 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3444 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3445 char *pv = SvPV(tmpstr, *lp);
3455 typestr = "NULLREF";
3459 switch (SvTYPE(sv)) {
3461 if ( ((SvFLAGS(sv) &
3462 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3463 == (SVs_OBJECT|SVs_SMG))
3464 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3465 const regexp *re = (regexp *)mg->mg_obj;
3468 const char *fptr = "msix";
3473 char need_newline = 0;
3474 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3476 while((ch = *fptr++)) {
3478 reflags[left++] = ch;
3481 reflags[right--] = ch;
3486 reflags[left] = '-';
3490 mg->mg_len = re->prelen + 4 + left;
3492 * If /x was used, we have to worry about a regex
3493 * ending with a comment later being embedded
3494 * within another regex. If so, we don't want this
3495 * regex's "commentization" to leak out to the
3496 * right part of the enclosing regex, we must cap
3497 * it with a newline.
3499 * So, if /x was used, we scan backwards from the
3500 * end of the regex. If we find a '#' before we
3501 * find a newline, we need to add a newline
3502 * ourself. If we find a '\n' first (or if we
3503 * don't find '#' or '\n'), we don't need to add
3504 * anything. -jfriedl
3506 if (PMf_EXTENDED & re->reganch)
3508 const char *endptr = re->precomp + re->prelen;
3509 while (endptr >= re->precomp)
3511 const char c = *(endptr--);
3513 break; /* don't need another */
3515 /* we end while in a comment, so we
3517 mg->mg_len++; /* save space for it */
3518 need_newline = 1; /* note to add it */
3524 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3525 Copy("(?", mg->mg_ptr, 2, char);
3526 Copy(reflags, mg->mg_ptr+2, left, char);
3527 Copy(":", mg->mg_ptr+left+2, 1, char);
3528 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3530 mg->mg_ptr[mg->mg_len - 2] = '\n';
3531 mg->mg_ptr[mg->mg_len - 1] = ')';
3532 mg->mg_ptr[mg->mg_len] = 0;
3534 PL_reginterp_cnt += re->program[0].next_off;
3536 if (re->reganch & ROPT_UTF8)
3551 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3552 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3553 /* tied lvalues should appear to be
3554 * scalars for backwards compatitbility */
3555 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3556 ? "SCALAR" : "LVALUE"; break;
3557 case SVt_PVAV: typestr = "ARRAY"; break;
3558 case SVt_PVHV: typestr = "HASH"; break;
3559 case SVt_PVCV: typestr = "CODE"; break;
3560 case SVt_PVGV: typestr = "GLOB"; break;
3561 case SVt_PVFM: typestr = "FORMAT"; break;
3562 case SVt_PVIO: typestr = "IO"; break;
3563 default: typestr = "UNKNOWN"; break;
3567 const char *name = HvNAME_get(SvSTASH(sv));
3568 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3569 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3572 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3575 *lp = strlen(typestr);
3576 return (char *)typestr;
3578 if (SvREADONLY(sv) && !SvOK(sv)) {
3579 if (ckWARN(WARN_UNINITIALIZED))
3585 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3586 /* I'm assuming that if both IV and NV are equally valid then
3587 converting the IV is going to be more efficient */
3588 const U32 isIOK = SvIOK(sv);
3589 const U32 isUIOK = SvIsUV(sv);
3590 char buf[TYPE_CHARS(UV)];
3593 if (SvTYPE(sv) < SVt_PVIV)
3594 sv_upgrade(sv, SVt_PVIV);
3596 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3598 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3599 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3600 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3601 SvCUR_set(sv, ebuf - ptr);
3611 else if (SvNOKp(sv)) {
3612 if (SvTYPE(sv) < SVt_PVNV)
3613 sv_upgrade(sv, SVt_PVNV);
3614 /* The +20 is pure guesswork. Configure test needed. --jhi */
3615 SvGROW(sv, NV_DIG + 20);
3616 s = SvPVX_mutable(sv);
3617 olderrno = errno; /* some Xenix systems wipe out errno here */
3619 if (SvNVX(sv) == 0.0)
3620 (void)strcpy(s,"0");
3624 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3627 #ifdef FIXNEGATIVEZERO
3628 if (*s == '-' && s[1] == '0' && !s[2])
3638 if (ckWARN(WARN_UNINITIALIZED)
3639 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3642 if (SvTYPE(sv) < SVt_PV)
3643 /* Typically the caller expects that sv_any is not NULL now. */
3644 sv_upgrade(sv, SVt_PV);
3647 *lp = s - SvPVX_const(sv);
3650 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3651 PTR2UV(sv),SvPVX_const(sv)));
3652 if (flags & SV_CONST_RETURN)
3653 return (char *)SvPVX_const(sv);
3657 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3658 /* Sneaky stuff here */
3662 tsv = newSVpv(tmpbuf, 0);
3674 t = SvPVX_const(tsv);
3679 len = strlen(tmpbuf);
3681 #ifdef FIXNEGATIVEZERO
3682 if (len == 2 && t[0] == '-' && t[1] == '0') {
3687 SvUPGRADE(sv, SVt_PV);
3689 s = SvGROW(sv, len + 1);
3692 return strcpy(s, t);
3697 =for apidoc sv_copypv
3699 Copies a stringified representation of the source SV into the
3700 destination SV. Automatically performs any necessary mg_get and
3701 coercion of numeric values into strings. Guaranteed to preserve
3702 UTF-8 flag even from overloaded objects. Similar in nature to
3703 sv_2pv[_flags] but operates directly on an SV instead of just the
3704 string. Mostly uses sv_2pv_flags to do its work, except when that
3705 would lose the UTF-8'ness of the PV.
3711 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3715 s = SvPV_const(ssv,len);
3716 sv_setpvn(dsv,s,len);
3724 =for apidoc sv_2pvbyte_nolen
3726 Return a pointer to the byte-encoded representation of the SV.
3727 May cause the SV to be downgraded from UTF-8 as a side-effect.
3729 Usually accessed via the C<SvPVbyte_nolen> macro.
3735 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3737 return sv_2pvbyte(sv, 0);
3741 =for apidoc sv_2pvbyte
3743 Return a pointer to the byte-encoded representation of the SV, and set *lp
3744 to its length. May cause the SV to be downgraded from UTF-8 as a
3747 Usually accessed via the C<SvPVbyte> macro.
3753 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3755 sv_utf8_downgrade(sv,0);
3756 return SvPV(sv,*lp);
3760 =for apidoc sv_2pvutf8_nolen
3762 Return a pointer to the UTF-8-encoded representation of the SV.
3763 May cause the SV to be upgraded to UTF-8 as a side-effect.
3765 Usually accessed via the C<SvPVutf8_nolen> macro.
3771 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3773 return sv_2pvutf8(sv, 0);
3777 =for apidoc sv_2pvutf8
3779 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3780 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3782 Usually accessed via the C<SvPVutf8> macro.
3788 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3790 sv_utf8_upgrade(sv);
3791 return SvPV(sv,*lp);
3795 =for apidoc sv_2bool
3797 This function is only called on magical items, and is only used by
3798 sv_true() or its macro equivalent.
3804 Perl_sv_2bool(pTHX_ register SV *sv)
3813 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3814 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3815 return (bool)SvTRUE(tmpsv);
3816 return SvRV(sv) != 0;
3819 register XPV* Xpvtmp;
3820 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3821 (*sv->sv_u.svu_pv > '0' ||
3822 Xpvtmp->xpv_cur > 1 ||
3823 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3830 return SvIVX(sv) != 0;
3833 return SvNVX(sv) != 0.0;
3840 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3841 * this function provided for binary compatibility only
3846 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3848 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3852 =for apidoc sv_utf8_upgrade
3854 Converts the PV of an SV to its UTF-8-encoded form.
3855 Forces the SV to string form if it is not already.
3856 Always sets the SvUTF8 flag to avoid future validity checks even
3857 if all the bytes have hibit clear.
3859 This is not as a general purpose byte encoding to Unicode interface:
3860 use the Encode extension for that.
3862 =for apidoc sv_utf8_upgrade_flags
3864 Converts the PV of an SV to its UTF-8-encoded form.
3865 Forces the SV to string form if it is not already.
3866 Always sets the SvUTF8 flag to avoid future validity checks even
3867 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3868 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3869 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3871 This is not as a general purpose byte encoding to Unicode interface:
3872 use the Encode extension for that.
3878 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3880 if (sv == &PL_sv_undef)
3884 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3885 (void) sv_2pv_flags(sv,&len, flags);
3889 (void) SvPV_force(sv,len);
3898 sv_force_normal_flags(sv, 0);
3901 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3902 sv_recode_to_utf8(sv, PL_encoding);
3903 else { /* Assume Latin-1/EBCDIC */
3904 /* This function could be much more efficient if we
3905 * had a FLAG in SVs to signal if there are any hibit
3906 * chars in the PV. Given that there isn't such a flag
3907 * make the loop as fast as possible. */
3908 U8 *s = (U8 *) SvPVX(sv);
3909 U8 *e = (U8 *) SvEND(sv);
3915 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3919 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3920 s = bytes_to_utf8((U8*)s, &len);
3922 SvPV_free(sv); /* No longer using what was there before. */
3924 SvPV_set(sv, (char*)s);
3925 SvCUR_set(sv, len - 1);
3926 SvLEN_set(sv, len); /* No longer know the real size. */
3928 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3935 =for apidoc sv_utf8_downgrade
3937 Attempts to convert the PV of an SV from characters to bytes.
3938 If the PV contains a character beyond byte, this conversion will fail;
3939 in this case, either returns false or, if C<fail_ok> is not
3942 This is not as a general purpose Unicode to byte encoding interface:
3943 use the Encode extension for that.
3949 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3951 if (SvPOKp(sv) && SvUTF8(sv)) {
3957 sv_force_normal_flags(sv, 0);
3959 s = (U8 *) SvPV(sv, len);
3960 if (!utf8_to_bytes(s, &len)) {
3965 Perl_croak(aTHX_ "Wide character in %s",
3968 Perl_croak(aTHX_ "Wide character");
3979 =for apidoc sv_utf8_encode
3981 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3982 flag off so that it looks like octets again.
3988 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3990 (void) sv_utf8_upgrade(sv);
3992 sv_force_normal_flags(sv, 0);
3994 if (SvREADONLY(sv)) {
3995 Perl_croak(aTHX_ PL_no_modify);
4001 =for apidoc sv_utf8_decode
4003 If the PV of the SV is an octet sequence in UTF-8
4004 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
4005 so that it looks like a character. If the PV contains only single-byte
4006 characters, the C<SvUTF8> flag stays being off.
4007 Scans PV for validity and returns false if the PV is invalid UTF-8.
4013 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4019 /* The octets may have got themselves encoded - get them back as
4022 if (!sv_utf8_downgrade(sv, TRUE))
4025 /* it is actually just a matter of turning the utf8 flag on, but
4026 * we want to make sure everything inside is valid utf8 first.
4028 c = (U8 *) SvPVX(sv);
4029 if (!is_utf8_string(c, SvCUR(sv)+1))
4031 e = (U8 *) SvEND(sv);
4034 if (!UTF8_IS_INVARIANT(ch)) {
4043 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4044 * this function provided for binary compatibility only
4048 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4050 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4054 =for apidoc sv_setsv
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.
4062 You probably want to use one of the assortment of wrappers, such as
4063 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4064 C<SvSetMagicSV_nosteal>.
4066 =for apidoc sv_setsv_flags
4068 Copies the contents of the source SV C<ssv> into the destination SV
4069 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4070 function if the source SV needs to be reused. Does not handle 'set' magic.
4071 Loosely speaking, it performs a copy-by-value, obliterating any previous
4072 content of the destination.
4073 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4074 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4075 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4076 and C<sv_setsv_nomg> are implemented in terms of this function.
4078 You probably want to use one of the assortment of wrappers, such as
4079 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4080 C<SvSetMagicSV_nosteal>.
4082 This is the primary function for copying scalars, and most other
4083 copy-ish functions and macros use this underneath.
4089 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4091 register U32 sflags;
4097 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4099 sstr = &PL_sv_undef;
4100 stype = SvTYPE(sstr);
4101 dtype = SvTYPE(dstr);
4106 /* need to nuke the magic */
4108 SvRMAGICAL_off(dstr);
4111 /* There's a lot of redundancy below but we're going for speed here */
4116 if (dtype != SVt_PVGV) {
4117 (void)SvOK_off(dstr);
4125 sv_upgrade(dstr, SVt_IV);
4128 sv_upgrade(dstr, SVt_PVNV);
4132 sv_upgrade(dstr, SVt_PVIV);
4135 (void)SvIOK_only(dstr);
4136 SvIV_set(dstr, SvIVX(sstr));
4139 if (SvTAINTED(sstr))
4150 sv_upgrade(dstr, SVt_NV);
4155 sv_upgrade(dstr, SVt_PVNV);
4158 SvNV_set(dstr, SvNVX(sstr));
4159 (void)SvNOK_only(dstr);
4160 if (SvTAINTED(sstr))
4168 sv_upgrade(dstr, SVt_RV);
4169 else if (dtype == SVt_PVGV &&
4170 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4173 if (GvIMPORTED(dstr) != GVf_IMPORTED
4174 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4176 GvIMPORTED_on(dstr);
4185 #ifdef PERL_COPY_ON_WRITE
4186 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4187 if (dtype < SVt_PVIV)
4188 sv_upgrade(dstr, SVt_PVIV);
4195 sv_upgrade(dstr, SVt_PV);
4198 if (dtype < SVt_PVIV)
4199 sv_upgrade(dstr, SVt_PVIV);
4202 if (dtype < SVt_PVNV)
4203 sv_upgrade(dstr, SVt_PVNV);
4210 const char * const type = sv_reftype(sstr,0);
4212 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
4214 Perl_croak(aTHX_ "Bizarre copy of %s", type);
4219 if (dtype <= SVt_PVGV) {
4221 if (dtype != SVt_PVGV) {
4222 const char * const name = GvNAME(sstr);
4223 const STRLEN len = GvNAMELEN(sstr);
4224 /* don't upgrade SVt_PVLV: it can hold a glob */
4225 if (dtype != SVt_PVLV)
4226 sv_upgrade(dstr, SVt_PVGV);
4227 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4228 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4229 GvNAME(dstr) = savepvn(name, len);
4230 GvNAMELEN(dstr) = len;
4231 SvFAKE_on(dstr); /* can coerce to non-glob */
4233 /* ahem, death to those who redefine active sort subs */
4234 else if (PL_curstackinfo->si_type == PERLSI_SORT
4235 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4236 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4239 #ifdef GV_UNIQUE_CHECK
4240 if (GvUNIQUE((GV*)dstr)) {
4241 Perl_croak(aTHX_ PL_no_modify);
4245 (void)SvOK_off(dstr);
4246 GvINTRO_off(dstr); /* one-shot flag */
4248 GvGP(dstr) = gp_ref(GvGP(sstr));
4249 if (SvTAINTED(sstr))
4251 if (GvIMPORTED(dstr) != GVf_IMPORTED
4252 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4254 GvIMPORTED_on(dstr);
4262 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4264 if ((int)SvTYPE(sstr) != stype) {
4265 stype = SvTYPE(sstr);
4266 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4270 if (stype == SVt_PVLV)
4271 SvUPGRADE(dstr, SVt_PVNV);
4273 SvUPGRADE(dstr, (U32)stype);
4276 sflags = SvFLAGS(sstr);
4278 if (sflags & SVf_ROK) {
4279 if (dtype >= SVt_PV) {
4280 if (dtype == SVt_PVGV) {
4281 SV *sref = SvREFCNT_inc(SvRV(sstr));
4283 const int intro = GvINTRO(dstr);
4285 #ifdef GV_UNIQUE_CHECK
4286 if (GvUNIQUE((GV*)dstr)) {
4287 Perl_croak(aTHX_ PL_no_modify);
4292 GvINTRO_off(dstr); /* one-shot flag */
4293 GvLINE(dstr) = CopLINE(PL_curcop);
4294 GvEGV(dstr) = (GV*)dstr;
4297 switch (SvTYPE(sref)) {
4300 SAVEGENERICSV(GvAV(dstr));
4302 dref = (SV*)GvAV(dstr);
4303 GvAV(dstr) = (AV*)sref;
4304 if (!GvIMPORTED_AV(dstr)
4305 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4307 GvIMPORTED_AV_on(dstr);
4312 SAVEGENERICSV(GvHV(dstr));
4314 dref = (SV*)GvHV(dstr);
4315 GvHV(dstr) = (HV*)sref;
4316 if (!GvIMPORTED_HV(dstr)
4317 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4319 GvIMPORTED_HV_on(dstr);
4324 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4325 SvREFCNT_dec(GvCV(dstr));
4326 GvCV(dstr) = Nullcv;
4327 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4328 PL_sub_generation++;
4330 SAVEGENERICSV(GvCV(dstr));
4333 dref = (SV*)GvCV(dstr);
4334 if (GvCV(dstr) != (CV*)sref) {
4335 CV* cv = GvCV(dstr);
4337 if (!GvCVGEN((GV*)dstr) &&
4338 (CvROOT(cv) || CvXSUB(cv)))
4340 /* ahem, death to those who redefine
4341 * active sort subs */
4342 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4343 PL_sortcop == CvSTART(cv))
4345 "Can't redefine active sort subroutine %s",
4346 GvENAME((GV*)dstr));
4347 /* Redefining a sub - warning is mandatory if
4348 it was a const and its value changed. */
4349 if (ckWARN(WARN_REDEFINE)
4351 && (!CvCONST((CV*)sref)
4352 || sv_cmp(cv_const_sv(cv),
4353 cv_const_sv((CV*)sref)))))
4355 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4357 ? "Constant subroutine %s::%s redefined"
4358 : "Subroutine %s::%s redefined",
4359 HvNAME_get(GvSTASH((GV*)dstr)),
4360 GvENAME((GV*)dstr));
4364 cv_ckproto(cv, (GV*)dstr,
4365 SvPOK(sref) ? SvPVX(sref) : Nullch);
4367 GvCV(dstr) = (CV*)sref;
4368 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4369 GvASSUMECV_on(dstr);
4370 PL_sub_generation++;
4372 if (!GvIMPORTED_CV(dstr)
4373 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4375 GvIMPORTED_CV_on(dstr);
4380 SAVEGENERICSV(GvIOp(dstr));
4382 dref = (SV*)GvIOp(dstr);
4383 GvIOp(dstr) = (IO*)sref;
4387 SAVEGENERICSV(GvFORM(dstr));
4389 dref = (SV*)GvFORM(dstr);
4390 GvFORM(dstr) = (CV*)sref;
4394 SAVEGENERICSV(GvSV(dstr));
4396 dref = (SV*)GvSV(dstr);
4398 if (!GvIMPORTED_SV(dstr)
4399 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4401 GvIMPORTED_SV_on(dstr);
4407 if (SvTAINTED(sstr))
4411 if (SvPVX_const(dstr)) {
4417 (void)SvOK_off(dstr);
4418 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4420 if (sflags & SVp_NOK) {
4422 /* Only set the public OK flag if the source has public OK. */
4423 if (sflags & SVf_NOK)
4424 SvFLAGS(dstr) |= SVf_NOK;
4425 SvNV_set(dstr, SvNVX(sstr));
4427 if (sflags & SVp_IOK) {
4428 (void)SvIOKp_on(dstr);
4429 if (sflags & SVf_IOK)
4430 SvFLAGS(dstr) |= SVf_IOK;
4431 if (sflags & SVf_IVisUV)
4433 SvIV_set(dstr, SvIVX(sstr));
4435 if (SvAMAGIC(sstr)) {
4439 else if (sflags & SVp_POK) {
4443 * Check to see if we can just swipe the string. If so, it's a
4444 * possible small lose on short strings, but a big win on long ones.
4445 * It might even be a win on short strings if SvPVX_const(dstr)
4446 * has to be allocated and SvPVX_const(sstr) has to be freed.
4449 /* Whichever path we take through the next code, we want this true,
4450 and doing it now facilitates the COW check. */
4451 (void)SvPOK_only(dstr);
4454 /* We're not already COW */
4455 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4456 #ifndef PERL_COPY_ON_WRITE
4457 /* or we are, but dstr isn't a suitable target. */
4458 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4463 (sflags & SVs_TEMP) && /* slated for free anyway? */
4464 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4465 (!(flags & SV_NOSTEAL)) &&
4466 /* and we're allowed to steal temps */
4467 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4468 SvLEN(sstr) && /* and really is a string */
4469 /* and won't be needed again, potentially */
4470 !(PL_op && PL_op->op_type == OP_AASSIGN))
4471 #ifdef PERL_COPY_ON_WRITE
4472 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4473 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4474 && SvTYPE(sstr) >= SVt_PVIV)
4477 /* Failed the swipe test, and it's not a shared hash key either.
4478 Have to copy the string. */
4479 STRLEN len = SvCUR(sstr);
4480 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4481 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4482 SvCUR_set(dstr, len);
4483 *SvEND(dstr) = '\0';
4485 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4487 /* Either it's a shared hash key, or it's suitable for
4488 copy-on-write or we can swipe the string. */
4490 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4494 #ifdef PERL_COPY_ON_WRITE
4496 /* I believe I should acquire a global SV mutex if
4497 it's a COW sv (not a shared hash key) to stop
4498 it going un copy-on-write.
4499 If the source SV has gone un copy on write between up there
4500 and down here, then (assert() that) it is of the correct
4501 form to make it copy on write again */
4502 if ((sflags & (SVf_FAKE | SVf_READONLY))
4503 != (SVf_FAKE | SVf_READONLY)) {
4504 SvREADONLY_on(sstr);
4506 /* Make the source SV into a loop of 1.
4507 (about to become 2) */
4508 SV_COW_NEXT_SV_SET(sstr, sstr);
4512 /* Initial code is common. */
4513 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4515 SvFLAGS(dstr) &= ~SVf_OOK;
4516 Safefree(SvPVX_const(dstr) - SvIVX(dstr));
4518 else if (SvLEN(dstr))
4519 Safefree(SvPVX_const(dstr));
4523 /* making another shared SV. */
4524 STRLEN cur = SvCUR(sstr);
4525 STRLEN len = SvLEN(sstr);
4526 #ifdef PERL_COPY_ON_WRITE
4528 assert (SvTYPE(dstr) >= SVt_PVIV);
4529 /* SvIsCOW_normal */
4530 /* splice us in between source and next-after-source. */
4531 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4532 SV_COW_NEXT_SV_SET(sstr, dstr);
4533 SvPV_set(dstr, SvPVX(sstr));
4537 /* SvIsCOW_shared_hash */
4538 UV hash = SvSHARED_HASH(sstr);
4539 DEBUG_C(PerlIO_printf(Perl_debug_log,
4540 "Copy on write: Sharing hash\n"));
4542 assert (SvTYPE(dstr) >= SVt_PVIV);
4544 sharepvn(SvPVX_const(sstr),
4545 (sflags & SVf_UTF8?-cur:cur), hash));
4546 SvUV_set(dstr, hash);
4548 SvLEN_set(dstr, len);
4549 SvCUR_set(dstr, cur);
4550 SvREADONLY_on(dstr);
4552 /* Relesase a global SV mutex. */
4555 { /* Passes the swipe test. */
4556 SvPV_set(dstr, SvPVX(sstr));
4557 SvLEN_set(dstr, SvLEN(sstr));
4558 SvCUR_set(dstr, SvCUR(sstr));
4561 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4562 SvPV_set(sstr, Nullch);
4568 if (sflags & SVf_UTF8)
4571 if (sflags & SVp_NOK) {
4573 if (sflags & SVf_NOK)
4574 SvFLAGS(dstr) |= SVf_NOK;
4575 SvNV_set(dstr, SvNVX(sstr));
4577 if (sflags & SVp_IOK) {
4578 (void)SvIOKp_on(dstr);
4579 if (sflags & SVf_IOK)
4580 SvFLAGS(dstr) |= SVf_IOK;
4581 if (sflags & SVf_IVisUV)
4583 SvIV_set(dstr, SvIVX(sstr));
4586 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4587 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4588 smg->mg_ptr, smg->mg_len);
4589 SvRMAGICAL_on(dstr);
4592 else if (sflags & SVp_IOK) {
4593 if (sflags & SVf_IOK)
4594 (void)SvIOK_only(dstr);
4596 (void)SvOK_off(dstr);
4597 (void)SvIOKp_on(dstr);
4599 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4600 if (sflags & SVf_IVisUV)
4602 SvIV_set(dstr, SvIVX(sstr));
4603 if (sflags & SVp_NOK) {
4604 if (sflags & SVf_NOK)
4605 (void)SvNOK_on(dstr);
4607 (void)SvNOKp_on(dstr);
4608 SvNV_set(dstr, SvNVX(sstr));
4611 else if (sflags & SVp_NOK) {
4612 if (sflags & SVf_NOK)
4613 (void)SvNOK_only(dstr);
4615 (void)SvOK_off(dstr);
4618 SvNV_set(dstr, SvNVX(sstr));
4621 if (dtype == SVt_PVGV) {
4622 if (ckWARN(WARN_MISC))
4623 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4626 (void)SvOK_off(dstr);
4628 if (SvTAINTED(sstr))
4633 =for apidoc sv_setsv_mg
4635 Like C<sv_setsv>, but also handles 'set' magic.
4641 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4643 sv_setsv(dstr,sstr);
4647 #ifdef PERL_COPY_ON_WRITE
4649 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4651 STRLEN cur = SvCUR(sstr);
4652 STRLEN len = SvLEN(sstr);
4653 register char *new_pv;
4656 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4664 if (SvTHINKFIRST(dstr))
4665 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4666 else if (SvPVX_const(dstr))
4667 Safefree(SvPVX_const(dstr));
4671 SvUPGRADE(dstr, SVt_PVIV);
4673 assert (SvPOK(sstr));
4674 assert (SvPOKp(sstr));
4675 assert (!SvIOK(sstr));
4676 assert (!SvIOKp(sstr));
4677 assert (!SvNOK(sstr));
4678 assert (!SvNOKp(sstr));
4680 if (SvIsCOW(sstr)) {
4682 if (SvLEN(sstr) == 0) {
4683 /* source is a COW shared hash key. */
4684 UV hash = SvSHARED_HASH(sstr);
4685 DEBUG_C(PerlIO_printf(Perl_debug_log,
4686 "Fast copy on write: Sharing hash\n"));
4687 SvUV_set(dstr, hash);
4688 new_pv = sharepvn(SvPVX_const(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4691 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4693 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4694 SvUPGRADE(sstr, SVt_PVIV);
4695 SvREADONLY_on(sstr);
4697 DEBUG_C(PerlIO_printf(Perl_debug_log,
4698 "Fast copy on write: Converting sstr to COW\n"));
4699 SV_COW_NEXT_SV_SET(dstr, sstr);
4701 SV_COW_NEXT_SV_SET(sstr, dstr);
4702 new_pv = SvPVX(sstr);
4705 SvPV_set(dstr, new_pv);
4706 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4709 SvLEN_set(dstr, len);
4710 SvCUR_set(dstr, cur);
4719 =for apidoc sv_setpvn
4721 Copies a string into an SV. The C<len> parameter indicates the number of
4722 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4723 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4729 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4731 register char *dptr;
4733 SV_CHECK_THINKFIRST_COW_DROP(sv);
4739 /* len is STRLEN which is unsigned, need to copy to signed */
4742 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4744 SvUPGRADE(sv, SVt_PV);
4746 SvGROW(sv, len + 1);
4748 Move(ptr,dptr,len,char);
4751 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4756 =for apidoc sv_setpvn_mg
4758 Like C<sv_setpvn>, but also handles 'set' magic.
4764 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4766 sv_setpvn(sv,ptr,len);
4771 =for apidoc sv_setpv
4773 Copies a string into an SV. The string must be null-terminated. Does not
4774 handle 'set' magic. See C<sv_setpv_mg>.
4780 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4782 register STRLEN len;
4784 SV_CHECK_THINKFIRST_COW_DROP(sv);
4790 SvUPGRADE(sv, SVt_PV);
4792 SvGROW(sv, len + 1);
4793 Move(ptr,SvPVX(sv),len+1,char);
4795 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4800 =for apidoc sv_setpv_mg
4802 Like C<sv_setpv>, but also handles 'set' magic.
4808 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4815 =for apidoc sv_usepvn
4817 Tells an SV to use C<ptr> to find its string value. Normally the string is
4818 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4819 The C<ptr> should point to memory that was allocated by C<malloc>. The
4820 string length, C<len>, must be supplied. This function will realloc the
4821 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4822 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4823 See C<sv_usepvn_mg>.
4829 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4832 SV_CHECK_THINKFIRST_COW_DROP(sv);
4833 SvUPGRADE(sv, SVt_PV);
4838 if (SvPVX_const(sv))
4841 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4842 ptr = saferealloc (ptr, allocate);
4845 SvLEN_set(sv, allocate);
4847 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4852 =for apidoc sv_usepvn_mg
4854 Like C<sv_usepvn>, but also handles 'set' magic.
4860 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4862 sv_usepvn(sv,ptr,len);
4866 #ifdef PERL_COPY_ON_WRITE
4867 /* Need to do this *after* making the SV normal, as we need the buffer
4868 pointer to remain valid until after we've copied it. If we let go too early,
4869 another thread could invalidate it by unsharing last of the same hash key
4870 (which it can do by means other than releasing copy-on-write Svs)
4871 or by changing the other copy-on-write SVs in the loop. */
4873 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN cur, STRLEN len,
4874 U32 hash, SV *after)
4876 if (len) { /* this SV was SvIsCOW_normal(sv) */
4877 /* we need to find the SV pointing to us. */
4878 SV *current = SV_COW_NEXT_SV(after);
4880 if (current == sv) {
4881 /* The SV we point to points back to us (there were only two of us
4883 Hence other SV is no longer copy on write either. */
4885 SvREADONLY_off(after);
4887 /* We need to follow the pointers around the loop. */
4889 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4892 /* don't loop forever if the structure is bust, and we have
4893 a pointer into a closed loop. */
4894 assert (current != after);
4895 assert (SvPVX_const(current) == pvx);
4897 /* Make the SV before us point to the SV after us. */
4898 SV_COW_NEXT_SV_SET(current, after);
4901 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4906 Perl_sv_release_IVX(pTHX_ register SV *sv)
4909 sv_force_normal_flags(sv, 0);
4915 =for apidoc sv_force_normal_flags
4917 Undo various types of fakery on an SV: if the PV is a shared string, make
4918 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4919 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4920 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4921 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4922 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4923 set to some other value.) In addition, the C<flags> parameter gets passed to
4924 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4925 with flags set to 0.
4931 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4933 #ifdef PERL_COPY_ON_WRITE
4934 if (SvREADONLY(sv)) {
4935 /* At this point I believe I should acquire a global SV mutex. */
4937 const char *pvx = SvPVX_const(sv);
4938 const STRLEN len = SvLEN(sv);
4939 const STRLEN cur = SvCUR(sv);
4940 const U32 hash = SvSHARED_HASH(sv);
4941 SV *const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4943 PerlIO_printf(Perl_debug_log,
4944 "Copy on write: Force normal %ld\n",
4950 /* This SV doesn't own the buffer, so need to New() a new one: */
4951 SvPV_set(sv, (char*)0);
4953 if (flags & SV_COW_DROP_PV) {
4954 /* OK, so we don't need to copy our buffer. */
4957 SvGROW(sv, cur + 1);
4958 Move(pvx,SvPVX(sv),cur,char);
4962 sv_release_COW(sv, pvx, cur, len, hash, next);
4967 else if (IN_PERL_RUNTIME)
4968 Perl_croak(aTHX_ PL_no_modify);
4969 /* At this point I believe that I can drop the global SV mutex. */
4972 if (SvREADONLY(sv)) {
4974 const char *pvx = SvPVX_const(sv);
4975 const int is_utf8 = SvUTF8(sv);
4976 const STRLEN len = SvCUR(sv);
4977 const U32 hash = SvSHARED_HASH(sv);
4980 SvPV_set(sv, Nullch);
4982 SvGROW(sv, len + 1);
4983 Move(pvx,SvPVX_const(sv),len,char);
4985 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4987 else if (IN_PERL_RUNTIME)
4988 Perl_croak(aTHX_ PL_no_modify);
4992 sv_unref_flags(sv, flags);
4993 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4998 =for apidoc sv_force_normal
5000 Undo various types of fakery on an SV: if the PV is a shared string, make
5001 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
5002 an xpvmg. See also C<sv_force_normal_flags>.
5008 Perl_sv_force_normal(pTHX_ register SV *sv)
5010 sv_force_normal_flags(sv, 0);
5016 Efficient removal of characters from the beginning of the string buffer.
5017 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5018 the string buffer. The C<ptr> becomes the first character of the adjusted
5019 string. Uses the "OOK hack".
5020 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
5021 refer to the same chunk of data.
5027 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
5029 register STRLEN delta;
5030 if (!ptr || !SvPOKp(sv))
5032 delta = ptr - SvPVX_const(sv);
5033 SV_CHECK_THINKFIRST(sv);
5034 if (SvTYPE(sv) < SVt_PVIV)
5035 sv_upgrade(sv,SVt_PVIV);
5038 if (!SvLEN(sv)) { /* make copy of shared string */
5039 const char *pvx = SvPVX_const(sv);
5040 STRLEN len = SvCUR(sv);
5041 SvGROW(sv, len + 1);
5042 Move(pvx,SvPVX_const(sv),len,char);
5046 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5047 and we do that anyway inside the SvNIOK_off
5049 SvFLAGS(sv) |= SVf_OOK;
5052 SvLEN_set(sv, SvLEN(sv) - delta);
5053 SvCUR_set(sv, SvCUR(sv) - delta);
5054 SvPV_set(sv, SvPVX(sv) + delta);
5055 SvIV_set(sv, SvIVX(sv) + delta);
5058 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5059 * this function provided for binary compatibility only
5063 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5065 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5069 =for apidoc sv_catpvn
5071 Concatenates the string onto the end of the string which is in the SV. The
5072 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5073 status set, then the bytes appended should be valid UTF-8.
5074 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5076 =for apidoc sv_catpvn_flags
5078 Concatenates the string onto the end of the string which is in the SV. The
5079 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5080 status set, then the bytes appended should be valid UTF-8.
5081 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5082 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5083 in terms of this function.
5089 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5092 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
5094 SvGROW(dsv, dlen + slen + 1);
5096 sstr = SvPVX_const(dsv);
5097 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5098 SvCUR_set(dsv, SvCUR(dsv) + slen);
5100 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5105 =for apidoc sv_catpvn_mg
5107 Like C<sv_catpvn>, but also handles 'set' magic.
5113 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5115 sv_catpvn(sv,ptr,len);
5119 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5120 * this function provided for binary compatibility only
5124 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5126 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5130 =for apidoc sv_catsv
5132 Concatenates the string from SV C<ssv> onto the end of the string in
5133 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5134 not 'set' magic. See C<sv_catsv_mg>.
5136 =for apidoc sv_catsv_flags
5138 Concatenates the string from SV C<ssv> onto the end of the string in
5139 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5140 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5141 and C<sv_catsv_nomg> are implemented in terms of this function.
5146 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5152 if ((spv = SvPV_const(ssv, slen))) {
5153 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5154 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5155 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5156 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5157 dsv->sv_flags doesn't have that bit set.
5158 Andy Dougherty 12 Oct 2001
5160 const I32 sutf8 = DO_UTF8(ssv);
5163 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5165 dutf8 = DO_UTF8(dsv);
5167 if (dutf8 != sutf8) {
5169 /* Not modifying source SV, so taking a temporary copy. */
5170 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5172 sv_utf8_upgrade(csv);
5173 spv = SvPV(csv, slen);
5176 sv_utf8_upgrade_nomg(dsv);
5178 sv_catpvn_nomg(dsv, spv, slen);
5183 =for apidoc sv_catsv_mg
5185 Like C<sv_catsv>, but also handles 'set' magic.
5191 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5198 =for apidoc sv_catpv
5200 Concatenates the string onto the end of the string which is in the SV.
5201 If the SV has the UTF-8 status set, then the bytes appended should be
5202 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5207 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5209 register STRLEN len;
5215 junk = SvPV_force(sv, tlen);
5217 SvGROW(sv, tlen + len + 1);
5219 ptr = SvPVX_const(sv);
5220 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5221 SvCUR_set(sv, SvCUR(sv) + len);
5222 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5227 =for apidoc sv_catpv_mg
5229 Like C<sv_catpv>, but also handles 'set' magic.
5235 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5244 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5245 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5252 Perl_newSV(pTHX_ STRLEN len)
5258 sv_upgrade(sv, SVt_PV);
5259 SvGROW(sv, len + 1);
5264 =for apidoc sv_magicext
5266 Adds magic to an SV, upgrading it if necessary. Applies the
5267 supplied vtable and returns a pointer to the magic added.
5269 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5270 In particular, you can add magic to SvREADONLY SVs, and add more than
5271 one instance of the same 'how'.
5273 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5274 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5275 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5276 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5278 (This is now used as a subroutine by C<sv_magic>.)
5283 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5284 const char* name, I32 namlen)
5288 if (SvTYPE(sv) < SVt_PVMG) {
5289 SvUPGRADE(sv, SVt_PVMG);
5291 Newz(702,mg, 1, MAGIC);
5292 mg->mg_moremagic = SvMAGIC(sv);
5293 SvMAGIC_set(sv, mg);
5295 /* Sometimes a magic contains a reference loop, where the sv and
5296 object refer to each other. To prevent a reference loop that
5297 would prevent such objects being freed, we look for such loops
5298 and if we find one we avoid incrementing the object refcount.
5300 Note we cannot do this to avoid self-tie loops as intervening RV must
5301 have its REFCNT incremented to keep it in existence.
5304 if (!obj || obj == sv ||
5305 how == PERL_MAGIC_arylen ||
5306 how == PERL_MAGIC_qr ||
5307 how == PERL_MAGIC_symtab ||
5308 (SvTYPE(obj) == SVt_PVGV &&
5309 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5310 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5311 GvFORM(obj) == (CV*)sv)))
5316 mg->mg_obj = SvREFCNT_inc(obj);
5317 mg->mg_flags |= MGf_REFCOUNTED;
5320 /* Normal self-ties simply pass a null object, and instead of
5321 using mg_obj directly, use the SvTIED_obj macro to produce a
5322 new RV as needed. For glob "self-ties", we are tieing the PVIO
5323 with an RV obj pointing to the glob containing the PVIO. In
5324 this case, to avoid a reference loop, we need to weaken the
5328 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5329 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5335 mg->mg_len = namlen;
5338 mg->mg_ptr = savepvn(name, namlen);
5339 else if (namlen == HEf_SVKEY)
5340 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5342 mg->mg_ptr = (char *) name;
5344 mg->mg_virtual = vtable;
5348 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5353 =for apidoc sv_magic
5355 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5356 then adds a new magic item of type C<how> to the head of the magic list.
5358 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5359 handling of the C<name> and C<namlen> arguments.
5361 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5362 to add more than one instance of the same 'how'.
5368 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5370 const MGVTBL *vtable = 0;
5373 #ifdef PERL_COPY_ON_WRITE
5375 sv_force_normal_flags(sv, 0);
5377 if (SvREADONLY(sv)) {
5379 && how != PERL_MAGIC_regex_global
5380 && how != PERL_MAGIC_bm
5381 && how != PERL_MAGIC_fm
5382 && how != PERL_MAGIC_sv
5383 && how != PERL_MAGIC_backref
5386 Perl_croak(aTHX_ PL_no_modify);
5389 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5390 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5391 /* sv_magic() refuses to add a magic of the same 'how' as an
5394 if (how == PERL_MAGIC_taint)
5402 vtable = &PL_vtbl_sv;
5404 case PERL_MAGIC_overload:
5405 vtable = &PL_vtbl_amagic;
5407 case PERL_MAGIC_overload_elem:
5408 vtable = &PL_vtbl_amagicelem;
5410 case PERL_MAGIC_overload_table:
5411 vtable = &PL_vtbl_ovrld;
5414 vtable = &PL_vtbl_bm;
5416 case PERL_MAGIC_regdata:
5417 vtable = &PL_vtbl_regdata;
5419 case PERL_MAGIC_regdatum:
5420 vtable = &PL_vtbl_regdatum;
5422 case PERL_MAGIC_env:
5423 vtable = &PL_vtbl_env;
5426 vtable = &PL_vtbl_fm;
5428 case PERL_MAGIC_envelem:
5429 vtable = &PL_vtbl_envelem;
5431 case PERL_MAGIC_regex_global:
5432 vtable = &PL_vtbl_mglob;
5434 case PERL_MAGIC_isa:
5435 vtable = &PL_vtbl_isa;
5437 case PERL_MAGIC_isaelem:
5438 vtable = &PL_vtbl_isaelem;
5440 case PERL_MAGIC_nkeys:
5441 vtable = &PL_vtbl_nkeys;
5443 case PERL_MAGIC_dbfile:
5446 case PERL_MAGIC_dbline:
5447 vtable = &PL_vtbl_dbline;
5449 #ifdef USE_LOCALE_COLLATE
5450 case PERL_MAGIC_collxfrm:
5451 vtable = &PL_vtbl_collxfrm;
5453 #endif /* USE_LOCALE_COLLATE */
5454 case PERL_MAGIC_tied:
5455 vtable = &PL_vtbl_pack;
5457 case PERL_MAGIC_tiedelem:
5458 case PERL_MAGIC_tiedscalar:
5459 vtable = &PL_vtbl_packelem;
5462 vtable = &PL_vtbl_regexp;
5464 case PERL_MAGIC_sig:
5465 vtable = &PL_vtbl_sig;
5467 case PERL_MAGIC_sigelem:
5468 vtable = &PL_vtbl_sigelem;
5470 case PERL_MAGIC_taint:
5471 vtable = &PL_vtbl_taint;
5473 case PERL_MAGIC_uvar:
5474 vtable = &PL_vtbl_uvar;
5476 case PERL_MAGIC_vec:
5477 vtable = &PL_vtbl_vec;
5479 case PERL_MAGIC_arylen_p:
5480 case PERL_MAGIC_rhash:
5481 case PERL_MAGIC_symtab:
5482 case PERL_MAGIC_vstring:
5485 case PERL_MAGIC_utf8:
5486 vtable = &PL_vtbl_utf8;
5488 case PERL_MAGIC_substr:
5489 vtable = &PL_vtbl_substr;
5491 case PERL_MAGIC_defelem:
5492 vtable = &PL_vtbl_defelem;
5494 case PERL_MAGIC_glob:
5495 vtable = &PL_vtbl_glob;
5497 case PERL_MAGIC_arylen:
5498 vtable = &PL_vtbl_arylen;
5500 case PERL_MAGIC_pos:
5501 vtable = &PL_vtbl_pos;
5503 case PERL_MAGIC_backref:
5504 vtable = &PL_vtbl_backref;
5506 case PERL_MAGIC_ext:
5507 /* Reserved for use by extensions not perl internals. */
5508 /* Useful for attaching extension internal data to perl vars. */
5509 /* Note that multiple extensions may clash if magical scalars */
5510 /* etc holding private data from one are passed to another. */
5513 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5516 /* Rest of work is done else where */
5517 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5520 case PERL_MAGIC_taint:
5523 case PERL_MAGIC_ext:
5524 case PERL_MAGIC_dbfile:
5531 =for apidoc sv_unmagic
5533 Removes all magic of type C<type> from an SV.
5539 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5543 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5546 for (mg = *mgp; mg; mg = *mgp) {
5547 if (mg->mg_type == type) {
5548 const MGVTBL* const vtbl = mg->mg_virtual;
5549 *mgp = mg->mg_moremagic;
5550 if (vtbl && vtbl->svt_free)
5551 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5552 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5554 Safefree(mg->mg_ptr);
5555 else if (mg->mg_len == HEf_SVKEY)
5556 SvREFCNT_dec((SV*)mg->mg_ptr);
5557 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5558 Safefree(mg->mg_ptr);
5560 if (mg->mg_flags & MGf_REFCOUNTED)
5561 SvREFCNT_dec(mg->mg_obj);
5565 mgp = &mg->mg_moremagic;
5569 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5576 =for apidoc sv_rvweaken
5578 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5579 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5580 push a back-reference to this RV onto the array of backreferences
5581 associated with that magic.
5587 Perl_sv_rvweaken(pTHX_ SV *sv)
5590 if (!SvOK(sv)) /* let undefs pass */
5593 Perl_croak(aTHX_ "Can't weaken a nonreference");
5594 else if (SvWEAKREF(sv)) {
5595 if (ckWARN(WARN_MISC))
5596 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5600 sv_add_backref(tsv, sv);
5606 /* Give tsv backref magic if it hasn't already got it, then push a
5607 * back-reference to sv onto the array associated with the backref magic.
5611 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5615 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5616 av = (AV*)mg->mg_obj;
5619 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5620 /* av now has a refcnt of 2, which avoids it getting freed
5621 * before us during global cleanup. The extra ref is removed
5622 * by magic_killbackrefs() when tsv is being freed */
5624 if (AvFILLp(av) >= AvMAX(av)) {
5626 SV **svp = AvARRAY(av);
5627 for (i = AvFILLp(av); i >= 0; i--)
5629 svp[i] = sv; /* reuse the slot */
5632 av_extend(av, AvFILLp(av)+1);
5634 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5637 /* delete a back-reference to ourselves from the backref magic associated
5638 * with the SV we point to.
5642 S_sv_del_backref(pTHX_ SV *sv)
5649 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5650 Perl_croak(aTHX_ "panic: del_backref");
5651 av = (AV *)mg->mg_obj;
5653 for (i = AvFILLp(av); i >= 0; i--)
5654 if (svp[i] == sv) svp[i] = Nullsv;
5658 =for apidoc sv_insert
5660 Inserts a string at the specified offset/length within the SV. Similar to
5661 the Perl substr() function.
5667 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5671 register char *midend;
5672 register char *bigend;
5678 Perl_croak(aTHX_ "Can't modify non-existent substring");
5679 SvPV_force(bigstr, curlen);
5680 (void)SvPOK_only_UTF8(bigstr);
5681 if (offset + len > curlen) {
5682 SvGROW(bigstr, offset+len+1);
5683 Zero(SvPVX_const(bigstr)+curlen, offset+len-curlen, char);
5684 SvCUR_set(bigstr, offset+len);
5688 i = littlelen - len;
5689 if (i > 0) { /* string might grow */
5690 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5691 mid = big + offset + len;
5692 midend = bigend = big + SvCUR(bigstr);
5695 while (midend > mid) /* shove everything down */
5696 *--bigend = *--midend;
5697 Move(little,big+offset,littlelen,char);
5698 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5703 Move(little,SvPVX(bigstr)+offset,len,char);
5708 big = SvPVX(bigstr);
5711 bigend = big + SvCUR(bigstr);
5713 if (midend > bigend)
5714 Perl_croak(aTHX_ "panic: sv_insert");
5716 if (mid - big > bigend - midend) { /* faster to shorten from end */
5718 Move(little, mid, littlelen,char);
5721 i = bigend - midend;
5723 Move(midend, mid, i,char);
5727 SvCUR_set(bigstr, mid - big);
5730 else if ((i = mid - big)) { /* faster from front */
5731 midend -= littlelen;
5733 sv_chop(bigstr,midend-i);
5738 Move(little, mid, littlelen,char);
5740 else if (littlelen) {
5741 midend -= littlelen;
5742 sv_chop(bigstr,midend);
5743 Move(little,midend,littlelen,char);
5746 sv_chop(bigstr,midend);
5752 =for apidoc sv_replace
5754 Make the first argument a copy of the second, then delete the original.
5755 The target SV physically takes over ownership of the body of the source SV
5756 and inherits its flags; however, the target keeps any magic it owns,
5757 and any magic in the source is discarded.
5758 Note that this is a rather specialist SV copying operation; most of the
5759 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5765 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5767 const U32 refcnt = SvREFCNT(sv);
5768 SV_CHECK_THINKFIRST_COW_DROP(sv);
5769 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5770 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5771 if (SvMAGICAL(sv)) {
5775 sv_upgrade(nsv, SVt_PVMG);
5776 SvMAGIC_set(nsv, SvMAGIC(sv));
5777 SvFLAGS(nsv) |= SvMAGICAL(sv);
5779 SvMAGIC_set(sv, NULL);
5783 assert(!SvREFCNT(sv));
5784 #ifdef DEBUG_LEAKING_SCALARS
5785 sv->sv_flags = nsv->sv_flags;
5786 sv->sv_any = nsv->sv_any;
5787 sv->sv_refcnt = nsv->sv_refcnt;
5789 StructCopy(nsv,sv,SV);
5791 /* Currently could join these into one piece of pointer arithmetic, but
5792 it would be unclear. */
5793 if(SvTYPE(sv) == SVt_IV)
5795 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5796 else if (SvTYPE(sv) == SVt_RV) {
5797 SvANY(sv) = &sv->sv_u.svu_rv;
5801 #ifdef PERL_COPY_ON_WRITE
5802 if (SvIsCOW_normal(nsv)) {
5803 /* We need to follow the pointers around the loop to make the
5804 previous SV point to sv, rather than nsv. */
5807 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5810 assert(SvPVX_const(current) == SvPVX_const(nsv));
5812 /* Make the SV before us point to the SV after us. */
5814 PerlIO_printf(Perl_debug_log, "previous is\n");
5816 PerlIO_printf(Perl_debug_log,
5817 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5818 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5820 SV_COW_NEXT_SV_SET(current, sv);
5823 SvREFCNT(sv) = refcnt;
5824 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5830 =for apidoc sv_clear
5832 Clear an SV: call any destructors, free up any memory used by the body,
5833 and free the body itself. The SV's head is I<not> freed, although
5834 its type is set to all 1's so that it won't inadvertently be assumed
5835 to be live during global destruction etc.
5836 This function should only be called when REFCNT is zero. Most of the time
5837 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5844 Perl_sv_clear(pTHX_ register SV *sv)
5849 assert(SvREFCNT(sv) == 0);
5852 if (PL_defstash) { /* Still have a symbol table? */
5856 stash = SvSTASH(sv);
5857 destructor = StashHANDLER(stash,DESTROY);
5859 SV* tmpref = newRV(sv);
5860 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5862 PUSHSTACKi(PERLSI_DESTROY);
5867 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5873 if(SvREFCNT(tmpref) < 2) {
5874 /* tmpref is not kept alive! */
5876 SvRV_set(tmpref, NULL);
5879 SvREFCNT_dec(tmpref);
5881 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5885 if (PL_in_clean_objs)
5886 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5888 /* DESTROY gave object new lease on life */
5894 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5895 SvOBJECT_off(sv); /* Curse the object. */
5896 if (SvTYPE(sv) != SVt_PVIO)
5897 --PL_sv_objcount; /* XXX Might want something more general */
5900 if (SvTYPE(sv) >= SVt_PVMG) {
5903 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5904 SvREFCNT_dec(SvSTASH(sv));
5907 switch (SvTYPE(sv)) {
5910 IoIFP(sv) != PerlIO_stdin() &&
5911 IoIFP(sv) != PerlIO_stdout() &&
5912 IoIFP(sv) != PerlIO_stderr())
5914 io_close((IO*)sv, FALSE);
5916 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5917 PerlDir_close(IoDIRP(sv));
5918 IoDIRP(sv) = (DIR*)NULL;
5919 Safefree(IoTOP_NAME(sv));
5920 Safefree(IoFMT_NAME(sv));
5921 Safefree(IoBOTTOM_NAME(sv));
5936 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5937 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5938 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5939 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5941 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5942 SvREFCNT_dec(LvTARG(sv));
5946 Safefree(GvNAME(sv));
5947 /* cannot decrease stash refcount yet, as we might recursively delete
5948 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5949 of stash until current sv is completely gone.
5950 -- JohnPC, 27 Mar 1998 */
5951 stash = GvSTASH(sv);
5957 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5959 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5960 /* Don't even bother with turning off the OOK flag. */
5969 SvREFCNT_dec(SvRV(sv));
5971 #ifdef PERL_COPY_ON_WRITE
5972 else if (SvPVX_const(sv)) {
5974 /* I believe I need to grab the global SV mutex here and
5975 then recheck the COW status. */
5977 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5980 sv_release_COW(sv, SvPVX_const(sv), SvCUR(sv), SvLEN(sv),
5981 SvUVX(sv), SV_COW_NEXT_SV(sv));
5982 /* And drop it here. */
5984 } else if (SvLEN(sv)) {
5985 Safefree(SvPVX_const(sv));
5989 else if (SvPVX_const(sv) && SvLEN(sv))
5990 Safefree(SvPVX_const(sv));
5991 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5992 unsharepvn(SvPVX_const(sv),
5993 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
6007 switch (SvTYPE(sv)) {
6021 del_XPVIV(SvANY(sv));
6024 del_XPVNV(SvANY(sv));
6027 del_XPVMG(SvANY(sv));
6030 del_XPVLV(SvANY(sv));
6033 del_XPVAV(SvANY(sv));
6036 del_XPVHV(SvANY(sv));
6039 del_XPVCV(SvANY(sv));
6042 del_XPVGV(SvANY(sv));
6043 /* code duplication for increased performance. */
6044 SvFLAGS(sv) &= SVf_BREAK;
6045 SvFLAGS(sv) |= SVTYPEMASK;
6046 /* decrease refcount of the stash that owns this GV, if any */
6048 SvREFCNT_dec(stash);
6049 return; /* not break, SvFLAGS reset already happened */
6051 del_XPVBM(SvANY(sv));
6054 del_XPVFM(SvANY(sv));
6057 del_XPVIO(SvANY(sv));
6060 SvFLAGS(sv) &= SVf_BREAK;
6061 SvFLAGS(sv) |= SVTYPEMASK;
6065 =for apidoc sv_newref
6067 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6074 Perl_sv_newref(pTHX_ SV *sv)
6084 Decrement an SV's reference count, and if it drops to zero, call
6085 C<sv_clear> to invoke destructors and free up any memory used by
6086 the body; finally, deallocate the SV's head itself.
6087 Normally called via a wrapper macro C<SvREFCNT_dec>.
6093 Perl_sv_free(pTHX_ SV *sv)
6098 if (SvREFCNT(sv) == 0) {
6099 if (SvFLAGS(sv) & SVf_BREAK)
6100 /* this SV's refcnt has been artificially decremented to
6101 * trigger cleanup */
6103 if (PL_in_clean_all) /* All is fair */
6105 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6106 /* make sure SvREFCNT(sv)==0 happens very seldom */
6107 SvREFCNT(sv) = (~(U32)0)/2;
6110 if (ckWARN_d(WARN_INTERNAL))
6111 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6112 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6113 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6116 if (--(SvREFCNT(sv)) > 0)
6118 Perl_sv_free2(aTHX_ sv);
6122 Perl_sv_free2(pTHX_ SV *sv)
6127 if (ckWARN_d(WARN_DEBUGGING))
6128 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6129 "Attempt to free temp prematurely: SV 0x%"UVxf
6130 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6134 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6135 /* make sure SvREFCNT(sv)==0 happens very seldom */
6136 SvREFCNT(sv) = (~(U32)0)/2;
6147 Returns the length of the string in the SV. Handles magic and type
6148 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6154 Perl_sv_len(pTHX_ register SV *sv)
6162 len = mg_length(sv);
6164 (void)SvPV_const(sv, len);
6169 =for apidoc sv_len_utf8
6171 Returns the number of characters in the string in an SV, counting wide
6172 UTF-8 bytes as a single character. Handles magic and type coercion.
6178 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6179 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6180 * (Note that the mg_len is not the length of the mg_ptr field.)
6185 Perl_sv_len_utf8(pTHX_ register SV *sv)
6191 return mg_length(sv);
6195 const U8 *s = (U8*)SvPV_const(sv, len);
6196 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6198 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6200 #ifdef PERL_UTF8_CACHE_ASSERT
6201 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6205 ulen = Perl_utf8_length(aTHX_ s, s + len);
6206 if (!mg && !SvREADONLY(sv)) {
6207 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6208 mg = mg_find(sv, PERL_MAGIC_utf8);
6218 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6219 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6220 * between UTF-8 and byte offsets. There are two (substr offset and substr
6221 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6222 * and byte offset) cache positions.
6224 * The mg_len field is used by sv_len_utf8(), see its comments.
6225 * Note that the mg_len is not the length of the mg_ptr field.
6229 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 offsetp, U8 *s, U8 *start)
6233 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6235 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6239 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6241 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6242 (*mgp)->mg_ptr = (char *) *cachep;
6246 (*cachep)[i] = offsetp;
6247 (*cachep)[i+1] = s - start;
6255 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6256 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6257 * between UTF-8 and byte offsets. See also the comments of
6258 * S_utf8_mg_pos_init().
6262 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6266 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6268 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6269 if (*mgp && (*mgp)->mg_ptr) {
6270 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6271 ASSERT_UTF8_CACHE(*cachep);
6272 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6274 else { /* We will skip to the right spot. */
6279 /* The assumption is that going backward is half
6280 * the speed of going forward (that's where the
6281 * 2 * backw in the below comes from). (The real
6282 * figure of course depends on the UTF-8 data.) */
6284 if ((*cachep)[i] > (STRLEN)uoff) {
6286 backw = (*cachep)[i] - (STRLEN)uoff;
6288 if (forw < 2 * backw)
6291 p = start + (*cachep)[i+1];
6293 /* Try this only for the substr offset (i == 0),
6294 * not for the substr length (i == 2). */
6295 else if (i == 0) { /* (*cachep)[i] < uoff */
6296 const STRLEN ulen = sv_len_utf8(sv);
6298 if ((STRLEN)uoff < ulen) {
6299 forw = (STRLEN)uoff - (*cachep)[i];
6300 backw = ulen - (STRLEN)uoff;
6302 if (forw < 2 * backw)
6303 p = start + (*cachep)[i+1];
6308 /* If the string is not long enough for uoff,
6309 * we could extend it, but not at this low a level. */
6313 if (forw < 2 * backw) {
6320 while (UTF8_IS_CONTINUATION(*p))
6325 /* Update the cache. */
6326 (*cachep)[i] = (STRLEN)uoff;
6327 (*cachep)[i+1] = p - start;
6329 /* Drop the stale "length" cache */
6338 if (found) { /* Setup the return values. */
6339 *offsetp = (*cachep)[i+1];
6340 *sp = start + *offsetp;
6343 *offsetp = send - start;
6345 else if (*sp < start) {
6351 #ifdef PERL_UTF8_CACHE_ASSERT
6356 while (n-- && s < send)
6360 assert(*offsetp == s - start);
6361 assert((*cachep)[0] == (STRLEN)uoff);
6362 assert((*cachep)[1] == *offsetp);
6364 ASSERT_UTF8_CACHE(*cachep);
6373 =for apidoc sv_pos_u2b
6375 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6376 the start of the string, to a count of the equivalent number of bytes; if
6377 lenp is non-zero, it does the same to lenp, but this time starting from
6378 the offset, rather than from the start of the string. Handles magic and
6385 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6386 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6387 * byte offsets. See also the comments of S_utf8_mg_pos().
6392 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6400 start = (U8*)SvPV(sv, len);
6405 I32 uoffset = *offsetp;
6410 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6412 if (!found && uoffset > 0) {
6413 while (s < send && uoffset--)
6417 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6419 *offsetp = s - start;
6424 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6428 if (!found && *lenp > 0) {
6431 while (s < send && ulen--)
6435 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6439 ASSERT_UTF8_CACHE(cache);
6451 =for apidoc sv_pos_b2u
6453 Converts the value pointed to by offsetp from a count of bytes from the
6454 start of the string, to a count of the equivalent number of UTF-8 chars.
6455 Handles magic and type coercion.
6461 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6462 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6463 * byte offsets. See also the comments of S_utf8_mg_pos().
6468 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6476 s = (U8*)SvPV(sv, len);
6477 if ((I32)len < *offsetp)
6478 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6480 U8* send = s + *offsetp;
6482 STRLEN *cache = NULL;
6486 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6487 mg = mg_find(sv, PERL_MAGIC_utf8);
6488 if (mg && mg->mg_ptr) {
6489 cache = (STRLEN *) mg->mg_ptr;
6490 if (cache[1] == (STRLEN)*offsetp) {
6491 /* An exact match. */
6492 *offsetp = cache[0];
6496 else if (cache[1] < (STRLEN)*offsetp) {
6497 /* We already know part of the way. */
6500 /* Let the below loop do the rest. */
6502 else { /* cache[1] > *offsetp */
6503 /* We already know all of the way, now we may
6504 * be able to walk back. The same assumption
6505 * is made as in S_utf8_mg_pos(), namely that
6506 * walking backward is twice slower than
6507 * walking forward. */
6508 STRLEN forw = *offsetp;
6509 STRLEN backw = cache[1] - *offsetp;
6511 if (!(forw < 2 * backw)) {
6512 U8 *p = s + cache[1];
6519 while (UTF8_IS_CONTINUATION(*p)) {
6527 *offsetp = cache[0];
6529 /* Drop the stale "length" cache */
6537 ASSERT_UTF8_CACHE(cache);
6543 /* Call utf8n_to_uvchr() to validate the sequence
6544 * (unless a simple non-UTF character) */
6545 if (!UTF8_IS_INVARIANT(*s))
6546 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6555 if (!SvREADONLY(sv)) {
6557 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6558 mg = mg_find(sv, PERL_MAGIC_utf8);
6563 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6564 mg->mg_ptr = (char *) cache;
6569 cache[1] = *offsetp;
6570 /* Drop the stale "length" cache */
6583 Returns a boolean indicating whether the strings in the two SVs are
6584 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6585 coerce its args to strings if necessary.
6591 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6599 SV* svrecode = Nullsv;
6606 pv1 = SvPV_const(sv1, cur1);
6613 pv2 = SvPV_const(sv2, cur2);
6615 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6616 /* Differing utf8ness.
6617 * Do not UTF8size the comparands as a side-effect. */
6620 svrecode = newSVpvn(pv2, cur2);
6621 sv_recode_to_utf8(svrecode, PL_encoding);
6622 pv2 = SvPV(svrecode, cur2);
6625 svrecode = newSVpvn(pv1, cur1);
6626 sv_recode_to_utf8(svrecode, PL_encoding);
6627 pv1 = SvPV(svrecode, cur1);
6629 /* Now both are in UTF-8. */
6631 SvREFCNT_dec(svrecode);
6636 bool is_utf8 = TRUE;
6639 /* sv1 is the UTF-8 one,
6640 * if is equal it must be downgrade-able */
6641 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6647 /* sv2 is the UTF-8 one,
6648 * if is equal it must be downgrade-able */
6649 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6655 /* Downgrade not possible - cannot be eq */
6663 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6666 SvREFCNT_dec(svrecode);
6677 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6678 string in C<sv1> is less than, equal to, or greater than the string in
6679 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6680 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6686 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6689 const char *pv1, *pv2;
6692 SV *svrecode = Nullsv;
6699 pv1 = SvPV_const(sv1, cur1);
6706 pv2 = SvPV_const(sv2, cur2);
6708 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6709 /* Differing utf8ness.
6710 * Do not UTF8size the comparands as a side-effect. */
6713 svrecode = newSVpvn(pv2, cur2);
6714 sv_recode_to_utf8(svrecode, PL_encoding);
6715 pv2 = SvPV(svrecode, cur2);
6718 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6723 svrecode = newSVpvn(pv1, cur1);
6724 sv_recode_to_utf8(svrecode, PL_encoding);
6725 pv1 = SvPV(svrecode, cur1);
6728 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6734 cmp = cur2 ? -1 : 0;
6738 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6741 cmp = retval < 0 ? -1 : 1;
6742 } else if (cur1 == cur2) {
6745 cmp = cur1 < cur2 ? -1 : 1;
6750 SvREFCNT_dec(svrecode);
6759 =for apidoc sv_cmp_locale
6761 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6762 'use bytes' aware, handles get magic, and will coerce its args to strings
6763 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6769 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6771 #ifdef USE_LOCALE_COLLATE
6777 if (PL_collation_standard)
6781 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6783 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6785 if (!pv1 || !len1) {
6796 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6799 return retval < 0 ? -1 : 1;
6802 * When the result of collation is equality, that doesn't mean
6803 * that there are no differences -- some locales exclude some
6804 * characters from consideration. So to avoid false equalities,
6805 * we use the raw string as a tiebreaker.
6811 #endif /* USE_LOCALE_COLLATE */
6813 return sv_cmp(sv1, sv2);
6817 #ifdef USE_LOCALE_COLLATE
6820 =for apidoc sv_collxfrm
6822 Add Collate Transform magic to an SV if it doesn't already have it.
6824 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6825 scalar data of the variable, but transformed to such a format that a normal
6826 memory comparison can be used to compare the data according to the locale
6833 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6837 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6838 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6843 Safefree(mg->mg_ptr);
6845 if ((xf = mem_collxfrm(s, len, &xlen))) {
6846 if (SvREADONLY(sv)) {
6849 return xf + sizeof(PL_collation_ix);
6852 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6853 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6866 if (mg && mg->mg_ptr) {
6868 return mg->mg_ptr + sizeof(PL_collation_ix);
6876 #endif /* USE_LOCALE_COLLATE */
6881 Get a line from the filehandle and store it into the SV, optionally
6882 appending to the currently-stored string.
6888 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6892 register STDCHAR rslast;
6893 register STDCHAR *bp;
6899 if (SvTHINKFIRST(sv))
6900 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6901 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6903 However, perlbench says it's slower, because the existing swipe code
6904 is faster than copy on write.
6905 Swings and roundabouts. */
6906 SvUPGRADE(sv, SVt_PV);
6911 if (PerlIO_isutf8(fp)) {
6913 sv_utf8_upgrade_nomg(sv);
6914 sv_pos_u2b(sv,&append,0);
6916 } else if (SvUTF8(sv)) {
6917 SV *tsv = NEWSV(0,0);
6918 sv_gets(tsv, fp, 0);
6919 sv_utf8_upgrade_nomg(tsv);
6920 SvCUR_set(sv,append);
6923 goto return_string_or_null;
6928 if (PerlIO_isutf8(fp))
6931 if (IN_PERL_COMPILETIME) {
6932 /* we always read code in line mode */
6936 else if (RsSNARF(PL_rs)) {
6937 /* If it is a regular disk file use size from stat() as estimate
6938 of amount we are going to read - may result in malloc-ing
6939 more memory than we realy need if layers bellow reduce
6940 size we read (e.g. CRLF or a gzip layer)
6943 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6944 const Off_t offset = PerlIO_tell(fp);
6945 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6946 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6952 else if (RsRECORD(PL_rs)) {
6956 /* Grab the size of the record we're getting */
6957 recsize = SvIV(SvRV(PL_rs));
6958 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6961 /* VMS wants read instead of fread, because fread doesn't respect */
6962 /* RMS record boundaries. This is not necessarily a good thing to be */
6963 /* doing, but we've got no other real choice - except avoid stdio
6964 as implementation - perhaps write a :vms layer ?
6966 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6968 bytesread = PerlIO_read(fp, buffer, recsize);
6972 SvCUR_set(sv, bytesread += append);
6973 buffer[bytesread] = '\0';
6974 goto return_string_or_null;
6976 else if (RsPARA(PL_rs)) {
6982 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6983 if (PerlIO_isutf8(fp)) {
6984 rsptr = SvPVutf8(PL_rs, rslen);
6987 if (SvUTF8(PL_rs)) {
6988 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6989 Perl_croak(aTHX_ "Wide character in $/");
6992 rsptr = SvPV(PL_rs, rslen);
6996 rslast = rslen ? rsptr[rslen - 1] : '\0';
6998 if (rspara) { /* have to do this both before and after */
6999 do { /* to make sure file boundaries work right */
7002 i = PerlIO_getc(fp);
7006 PerlIO_ungetc(fp,i);
7012 /* See if we know enough about I/O mechanism to cheat it ! */
7014 /* This used to be #ifdef test - it is made run-time test for ease
7015 of abstracting out stdio interface. One call should be cheap
7016 enough here - and may even be a macro allowing compile
7020 if (PerlIO_fast_gets(fp)) {
7023 * We're going to steal some values from the stdio struct
7024 * and put EVERYTHING in the innermost loop into registers.
7026 register STDCHAR *ptr;
7030 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7031 /* An ungetc()d char is handled separately from the regular
7032 * buffer, so we getc() it back out and stuff it in the buffer.
7034 i = PerlIO_getc(fp);
7035 if (i == EOF) return 0;
7036 *(--((*fp)->_ptr)) = (unsigned char) i;
7040 /* Here is some breathtakingly efficient cheating */
7042 cnt = PerlIO_get_cnt(fp); /* get count into register */
7043 /* make sure we have the room */
7044 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7045 /* Not room for all of it
7046 if we are looking for a separator and room for some
7048 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7049 /* just process what we have room for */
7050 shortbuffered = cnt - SvLEN(sv) + append + 1;
7051 cnt -= shortbuffered;
7055 /* remember that cnt can be negative */
7056 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7061 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
7062 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7063 DEBUG_P(PerlIO_printf(Perl_debug_log,
7064 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7065 DEBUG_P(PerlIO_printf(Perl_debug_log,
7066 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7067 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7068 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7073 while (cnt > 0) { /* this | eat */
7075 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7076 goto thats_all_folks; /* screams | sed :-) */
7080 Copy(ptr, bp, cnt, char); /* this | eat */
7081 bp += cnt; /* screams | dust */
7082 ptr += cnt; /* louder | sed :-) */
7087 if (shortbuffered) { /* oh well, must extend */
7088 cnt = shortbuffered;
7090 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
7092 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7093 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
7097 DEBUG_P(PerlIO_printf(Perl_debug_log,
7098 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7099 PTR2UV(ptr),(long)cnt));
7100 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7102 DEBUG_P(PerlIO_printf(Perl_debug_log,
7103 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7104 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7105 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7107 /* This used to call 'filbuf' in stdio form, but as that behaves like
7108 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7109 another abstraction. */
7110 i = PerlIO_getc(fp); /* get more characters */
7112 DEBUG_P(PerlIO_printf(Perl_debug_log,
7113 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7114 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7115 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7117 cnt = PerlIO_get_cnt(fp);
7118 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7119 DEBUG_P(PerlIO_printf(Perl_debug_log,
7120 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7122 if (i == EOF) /* all done for ever? */
7123 goto thats_really_all_folks;
7125 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
7127 SvGROW(sv, bpx + cnt + 2);
7128 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
7130 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7132 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7133 goto thats_all_folks;
7137 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
7138 memNE((char*)bp - rslen, rsptr, rslen))
7139 goto screamer; /* go back to the fray */
7140 thats_really_all_folks:
7142 cnt += shortbuffered;
7143 DEBUG_P(PerlIO_printf(Perl_debug_log,
7144 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7145 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7146 DEBUG_P(PerlIO_printf(Perl_debug_log,
7147 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7148 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7149 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7151 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
7152 DEBUG_P(PerlIO_printf(Perl_debug_log,
7153 "Screamer: done, len=%ld, string=|%.*s|\n",
7154 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
7158 /*The big, slow, and stupid way. */
7159 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7161 New(0, buf, 8192, STDCHAR);
7169 const register STDCHAR *bpe = buf + sizeof(buf);
7171 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7172 ; /* keep reading */
7176 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7177 /* Accomodate broken VAXC compiler, which applies U8 cast to
7178 * both args of ?: operator, causing EOF to change into 255
7181 i = (U8)buf[cnt - 1];
7187 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7189 sv_catpvn(sv, (char *) buf, cnt);
7191 sv_setpvn(sv, (char *) buf, cnt);
7193 if (i != EOF && /* joy */
7195 SvCUR(sv) < rslen ||
7196 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7200 * If we're reading from a TTY and we get a short read,
7201 * indicating that the user hit his EOF character, we need
7202 * to notice it now, because if we try to read from the TTY
7203 * again, the EOF condition will disappear.
7205 * The comparison of cnt to sizeof(buf) is an optimization
7206 * that prevents unnecessary calls to feof().
7210 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7214 #ifdef USE_HEAP_INSTEAD_OF_STACK
7219 if (rspara) { /* have to do this both before and after */
7220 while (i != EOF) { /* to make sure file boundaries work right */
7221 i = PerlIO_getc(fp);
7223 PerlIO_ungetc(fp,i);
7229 return_string_or_null:
7230 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7236 Auto-increment of the value in the SV, doing string to numeric conversion
7237 if necessary. Handles 'get' magic.
7243 Perl_sv_inc(pTHX_ register SV *sv)
7252 if (SvTHINKFIRST(sv)) {
7254 sv_force_normal_flags(sv, 0);
7255 if (SvREADONLY(sv)) {
7256 if (IN_PERL_RUNTIME)
7257 Perl_croak(aTHX_ PL_no_modify);
7261 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7263 i = PTR2IV(SvRV(sv));
7268 flags = SvFLAGS(sv);
7269 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7270 /* It's (privately or publicly) a float, but not tested as an
7271 integer, so test it to see. */
7273 flags = SvFLAGS(sv);
7275 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7276 /* It's publicly an integer, or privately an integer-not-float */
7277 #ifdef PERL_PRESERVE_IVUV
7281 if (SvUVX(sv) == UV_MAX)
7282 sv_setnv(sv, UV_MAX_P1);
7284 (void)SvIOK_only_UV(sv);
7285 SvUV_set(sv, SvUVX(sv) + 1);
7287 if (SvIVX(sv) == IV_MAX)
7288 sv_setuv(sv, (UV)IV_MAX + 1);
7290 (void)SvIOK_only(sv);
7291 SvIV_set(sv, SvIVX(sv) + 1);
7296 if (flags & SVp_NOK) {
7297 (void)SvNOK_only(sv);
7298 SvNV_set(sv, SvNVX(sv) + 1.0);
7302 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
7303 if ((flags & SVTYPEMASK) < SVt_PVIV)
7304 sv_upgrade(sv, SVt_IV);
7305 (void)SvIOK_only(sv);
7310 while (isALPHA(*d)) d++;
7311 while (isDIGIT(*d)) d++;
7313 #ifdef PERL_PRESERVE_IVUV
7314 /* Got to punt this as an integer if needs be, but we don't issue
7315 warnings. Probably ought to make the sv_iv_please() that does
7316 the conversion if possible, and silently. */
7317 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7318 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7319 /* Need to try really hard to see if it's an integer.
7320 9.22337203685478e+18 is an integer.
7321 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7322 so $a="9.22337203685478e+18"; $a+0; $a++
7323 needs to be the same as $a="9.22337203685478e+18"; $a++
7330 /* sv_2iv *should* have made this an NV */
7331 if (flags & SVp_NOK) {
7332 (void)SvNOK_only(sv);
7333 SvNV_set(sv, SvNVX(sv) + 1.0);
7336 /* I don't think we can get here. Maybe I should assert this
7337 And if we do get here I suspect that sv_setnv will croak. NWC
7339 #if defined(USE_LONG_DOUBLE)
7340 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"PERL_PRIgldbl"\n",
7341 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7343 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7344 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7347 #endif /* PERL_PRESERVE_IVUV */
7348 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
7352 while (d >= SvPVX_const(sv)) {
7360 /* MKS: The original code here died if letters weren't consecutive.
7361 * at least it didn't have to worry about non-C locales. The
7362 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7363 * arranged in order (although not consecutively) and that only
7364 * [A-Za-z] are accepted by isALPHA in the C locale.
7366 if (*d != 'z' && *d != 'Z') {
7367 do { ++*d; } while (!isALPHA(*d));
7370 *(d--) -= 'z' - 'a';
7375 *(d--) -= 'z' - 'a' + 1;
7379 /* oh,oh, the number grew */
7380 SvGROW(sv, SvCUR(sv) + 2);
7381 SvCUR_set(sv, SvCUR(sv) + 1);
7382 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
7393 Auto-decrement of the value in the SV, doing string to numeric conversion
7394 if necessary. Handles 'get' magic.
7400 Perl_sv_dec(pTHX_ register SV *sv)
7408 if (SvTHINKFIRST(sv)) {
7410 sv_force_normal_flags(sv, 0);
7411 if (SvREADONLY(sv)) {
7412 if (IN_PERL_RUNTIME)
7413 Perl_croak(aTHX_ PL_no_modify);
7417 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7419 i = PTR2IV(SvRV(sv));
7424 /* Unlike sv_inc we don't have to worry about string-never-numbers
7425 and keeping them magic. But we mustn't warn on punting */
7426 flags = SvFLAGS(sv);
7427 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7428 /* It's publicly an integer, or privately an integer-not-float */
7429 #ifdef PERL_PRESERVE_IVUV
7433 if (SvUVX(sv) == 0) {
7434 (void)SvIOK_only(sv);
7438 (void)SvIOK_only_UV(sv);
7439 SvUV_set(sv, SvUVX(sv) + 1);
7442 if (SvIVX(sv) == IV_MIN)
7443 sv_setnv(sv, (NV)IV_MIN - 1.0);
7445 (void)SvIOK_only(sv);
7446 SvIV_set(sv, SvIVX(sv) - 1);
7451 if (flags & SVp_NOK) {
7452 SvNV_set(sv, SvNVX(sv) - 1.0);
7453 (void)SvNOK_only(sv);
7456 if (!(flags & SVp_POK)) {
7457 if ((flags & SVTYPEMASK) < SVt_PVNV)
7458 sv_upgrade(sv, SVt_NV);
7460 (void)SvNOK_only(sv);
7463 #ifdef PERL_PRESERVE_IVUV
7465 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7466 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7467 /* Need to try really hard to see if it's an integer.
7468 9.22337203685478e+18 is an integer.
7469 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7470 so $a="9.22337203685478e+18"; $a+0; $a--
7471 needs to be the same as $a="9.22337203685478e+18"; $a--
7478 /* sv_2iv *should* have made this an NV */
7479 if (flags & SVp_NOK) {
7480 (void)SvNOK_only(sv);
7481 SvNV_set(sv, SvNVX(sv) - 1.0);
7484 /* I don't think we can get here. Maybe I should assert this
7485 And if we do get here I suspect that sv_setnv will croak. NWC
7487 #if defined(USE_LONG_DOUBLE)
7488 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"PERL_PRIgldbl"\n",
7489 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7491 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7492 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7496 #endif /* PERL_PRESERVE_IVUV */
7497 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7501 =for apidoc sv_mortalcopy
7503 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7504 The new SV is marked as mortal. It will be destroyed "soon", either by an
7505 explicit call to FREETMPS, or by an implicit call at places such as
7506 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7511 /* Make a string that will exist for the duration of the expression
7512 * evaluation. Actually, it may have to last longer than that, but
7513 * hopefully we won't free it until it has been assigned to a
7514 * permanent location. */
7517 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7522 sv_setsv(sv,oldstr);
7524 PL_tmps_stack[++PL_tmps_ix] = sv;
7530 =for apidoc sv_newmortal
7532 Creates a new null SV which is mortal. The reference count of the SV is
7533 set to 1. It will be destroyed "soon", either by an explicit call to
7534 FREETMPS, or by an implicit call at places such as statement boundaries.
7535 See also C<sv_mortalcopy> and C<sv_2mortal>.
7541 Perl_sv_newmortal(pTHX)
7546 SvFLAGS(sv) = SVs_TEMP;
7548 PL_tmps_stack[++PL_tmps_ix] = sv;
7553 =for apidoc sv_2mortal
7555 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7556 by an explicit call to FREETMPS, or by an implicit call at places such as
7557 statement boundaries. SvTEMP() is turned on which means that the SV's
7558 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7559 and C<sv_mortalcopy>.
7565 Perl_sv_2mortal(pTHX_ register SV *sv)
7570 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7573 PL_tmps_stack[++PL_tmps_ix] = sv;
7581 Creates a new SV and copies a string into it. The reference count for the
7582 SV is set to 1. If C<len> is zero, Perl will compute the length using
7583 strlen(). For efficiency, consider using C<newSVpvn> instead.
7589 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7594 sv_setpvn(sv,s,len ? len : strlen(s));
7599 =for apidoc newSVpvn
7601 Creates a new SV and copies a string into it. The reference count for the
7602 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7603 string. You are responsible for ensuring that the source string is at least
7604 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7610 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7615 sv_setpvn(sv,s,len);
7621 =for apidoc newSVhek
7623 Creates a new SV from the hash key structure. It will generate scalars that
7624 point to the shared string table where possible. Returns a new (undefined)
7625 SV if the hek is NULL.
7631 Perl_newSVhek(pTHX_ const HEK *hek)
7640 if (HEK_LEN(hek) == HEf_SVKEY) {
7641 return newSVsv(*(SV**)HEK_KEY(hek));
7643 const int flags = HEK_FLAGS(hek);
7644 if (flags & HVhek_WASUTF8) {
7646 Andreas would like keys he put in as utf8 to come back as utf8
7648 STRLEN utf8_len = HEK_LEN(hek);
7649 U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7650 SV *sv = newSVpvn ((char*)as_utf8, utf8_len);
7653 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7655 } else if (flags & HVhek_REHASH) {
7656 /* We don't have a pointer to the hv, so we have to replicate the
7657 flag into every HEK. This hv is using custom a hasing
7658 algorithm. Hence we can't return a shared string scalar, as
7659 that would contain the (wrong) hash value, and might get passed
7660 into an hv routine with a regular hash */
7662 SV *sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7667 /* This will be overwhelminly the most common case. */
7668 return newSVpvn_share(HEK_KEY(hek),
7669 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7675 =for apidoc newSVpvn_share
7677 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7678 table. If the string does not already exist in the table, it is created
7679 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7680 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7681 otherwise the hash is computed. The idea here is that as the string table
7682 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7683 hash lookup will avoid string compare.
7689 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7692 bool is_utf8 = FALSE;
7694 STRLEN tmplen = -len;
7696 /* See the note in hv.c:hv_fetch() --jhi */
7697 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7701 PERL_HASH(hash, src, len);
7703 sv_upgrade(sv, SVt_PVIV);
7704 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7717 #if defined(PERL_IMPLICIT_CONTEXT)
7719 /* pTHX_ magic can't cope with varargs, so this is a no-context
7720 * version of the main function, (which may itself be aliased to us).
7721 * Don't access this version directly.
7725 Perl_newSVpvf_nocontext(const char* pat, ...)
7730 va_start(args, pat);
7731 sv = vnewSVpvf(pat, &args);
7738 =for apidoc newSVpvf
7740 Creates a new SV and initializes it with the string formatted like
7747 Perl_newSVpvf(pTHX_ const char* pat, ...)
7751 va_start(args, pat);
7752 sv = vnewSVpvf(pat, &args);
7757 /* backend for newSVpvf() and newSVpvf_nocontext() */
7760 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7764 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7771 Creates a new SV and copies a floating point value into it.
7772 The reference count for the SV is set to 1.
7778 Perl_newSVnv(pTHX_ NV n)
7790 Creates a new SV and copies an integer into it. The reference count for the
7797 Perl_newSViv(pTHX_ IV i)
7809 Creates a new SV and copies an unsigned integer into it.
7810 The reference count for the SV is set to 1.
7816 Perl_newSVuv(pTHX_ UV u)
7826 =for apidoc newRV_noinc
7828 Creates an RV wrapper for an SV. The reference count for the original
7829 SV is B<not> incremented.
7835 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7840 sv_upgrade(sv, SVt_RV);
7842 SvRV_set(sv, tmpRef);
7847 /* newRV_inc is the official function name to use now.
7848 * newRV_inc is in fact #defined to newRV in sv.h
7852 Perl_newRV(pTHX_ SV *tmpRef)
7854 return newRV_noinc(SvREFCNT_inc(tmpRef));
7860 Creates a new SV which is an exact duplicate of the original SV.
7867 Perl_newSVsv(pTHX_ register SV *old)
7873 if (SvTYPE(old) == SVTYPEMASK) {
7874 if (ckWARN_d(WARN_INTERNAL))
7875 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7879 /* SV_GMAGIC is the default for sv_setv()
7880 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7881 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7882 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7887 =for apidoc sv_reset
7889 Underlying implementation for the C<reset> Perl function.
7890 Note that the perl-level function is vaguely deprecated.
7896 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7899 char todo[PERL_UCHAR_MAX+1];
7904 if (!*s) { /* reset ?? searches */
7905 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7907 PMOP *pm = (PMOP *) mg->mg_obj;
7909 pm->op_pmdynflags &= ~PMdf_USED;
7916 /* reset variables */
7918 if (!HvARRAY(stash))
7921 Zero(todo, 256, char);
7924 I32 i = (unsigned char)*s;
7928 max = (unsigned char)*s++;
7929 for ( ; i <= max; i++) {
7932 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7934 for (entry = HvARRAY(stash)[i];
7936 entry = HeNEXT(entry))
7941 if (!todo[(U8)*HeKEY(entry)])
7943 gv = (GV*)HeVAL(entry);
7945 if (SvTHINKFIRST(sv)) {
7946 if (!SvREADONLY(sv) && SvROK(sv))
7951 if (SvTYPE(sv) >= SVt_PV) {
7953 if (SvPVX_const(sv) != Nullch)
7960 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7963 #ifdef USE_ENVIRON_ARRAY
7965 # ifdef USE_ITHREADS
7966 && PL_curinterp == aTHX
7970 environ[0] = Nullch;
7973 #endif /* !PERL_MICRO */
7983 Using various gambits, try to get an IO from an SV: the IO slot if its a
7984 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7985 named after the PV if we're a string.
7991 Perl_sv_2io(pTHX_ SV *sv)
7996 switch (SvTYPE(sv)) {
8004 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
8008 Perl_croak(aTHX_ PL_no_usym, "filehandle");
8010 return sv_2io(SvRV(sv));
8011 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
8017 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
8026 Using various gambits, try to get a CV from an SV; in addition, try if
8027 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
8033 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
8040 return *gvp = Nullgv, Nullcv;
8041 switch (SvTYPE(sv)) {
8060 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
8061 tryAMAGICunDEREF(to_cv);
8064 if (SvTYPE(sv) == SVt_PVCV) {
8073 Perl_croak(aTHX_ "Not a subroutine reference");
8078 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8084 if (lref && !GvCVu(gv)) {
8087 tmpsv = NEWSV(704,0);
8088 gv_efullname3(tmpsv, gv, Nullch);
8089 /* XXX this is probably not what they think they're getting.
8090 * It has the same effect as "sub name;", i.e. just a forward
8092 newSUB(start_subparse(FALSE, 0),
8093 newSVOP(OP_CONST, 0, tmpsv),
8098 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8108 Returns true if the SV has a true value by Perl's rules.
8109 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8110 instead use an in-line version.
8116 Perl_sv_true(pTHX_ register SV *sv)
8121 const register XPV* tXpv;
8122 if ((tXpv = (XPV*)SvANY(sv)) &&
8123 (tXpv->xpv_cur > 1 ||
8124 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
8131 return SvIVX(sv) != 0;
8134 return SvNVX(sv) != 0.0;
8136 return sv_2bool(sv);
8144 A private implementation of the C<SvIVx> macro for compilers which can't
8145 cope with complex macro expressions. Always use the macro instead.
8151 Perl_sv_iv(pTHX_ register SV *sv)
8155 return (IV)SvUVX(sv);
8164 A private implementation of the C<SvUVx> macro for compilers which can't
8165 cope with complex macro expressions. Always use the macro instead.
8171 Perl_sv_uv(pTHX_ register SV *sv)
8176 return (UV)SvIVX(sv);
8184 A private implementation of the C<SvNVx> macro for compilers which can't
8185 cope with complex macro expressions. Always use the macro instead.
8191 Perl_sv_nv(pTHX_ register SV *sv)
8198 /* sv_pv() is now a macro using SvPV_nolen();
8199 * this function provided for binary compatibility only
8203 Perl_sv_pv(pTHX_ SV *sv)
8210 return sv_2pv(sv, &n_a);
8216 Use the C<SvPV_nolen> macro instead
8220 A private implementation of the C<SvPV> macro for compilers which can't
8221 cope with complex macro expressions. Always use the macro instead.
8227 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8233 return sv_2pv(sv, lp);
8238 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8244 return sv_2pv_flags(sv, lp, 0);
8247 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8248 * this function provided for binary compatibility only
8252 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8254 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8258 =for apidoc sv_pvn_force
8260 Get a sensible string out of the SV somehow.
8261 A private implementation of the C<SvPV_force> macro for compilers which
8262 can't cope with complex macro expressions. Always use the macro instead.
8264 =for apidoc sv_pvn_force_flags
8266 Get a sensible string out of the SV somehow.
8267 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8268 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8269 implemented in terms of this function.
8270 You normally want to use the various wrapper macros instead: see
8271 C<SvPV_force> and C<SvPV_force_nomg>
8277 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8280 if (SvTHINKFIRST(sv) && !SvROK(sv))
8281 sv_force_normal_flags(sv, 0);
8289 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
8291 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
8292 sv_reftype(sv,0), OP_NAME(PL_op));
8294 Perl_croak(aTHX_ "Can't coerce readonly %s to string",
8297 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8298 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8302 s = sv_2pv_flags(sv, lp, flags);
8303 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
8304 const STRLEN len = *lp;
8308 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8309 SvGROW(sv, len + 1);
8310 Move(s,SvPVX_const(sv),len,char);
8315 SvPOK_on(sv); /* validate pointer */
8317 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8318 PTR2UV(sv),SvPVX_const(sv)));
8321 return SvPVX_mutable(sv);
8324 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8325 * this function provided for binary compatibility only
8329 Perl_sv_pvbyte(pTHX_ SV *sv)
8331 sv_utf8_downgrade(sv,0);
8336 =for apidoc sv_pvbyte
8338 Use C<SvPVbyte_nolen> instead.
8340 =for apidoc sv_pvbyten
8342 A private implementation of the C<SvPVbyte> macro for compilers
8343 which can't cope with complex macro expressions. Always use the macro
8350 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8352 sv_utf8_downgrade(sv,0);
8353 return sv_pvn(sv,lp);
8357 =for apidoc sv_pvbyten_force
8359 A private implementation of the C<SvPVbytex_force> macro for compilers
8360 which can't cope with complex macro expressions. Always use the macro
8367 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8369 sv_pvn_force(sv,lp);
8370 sv_utf8_downgrade(sv,0);
8375 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8376 * this function provided for binary compatibility only
8380 Perl_sv_pvutf8(pTHX_ SV *sv)
8382 sv_utf8_upgrade(sv);
8387 =for apidoc sv_pvutf8
8389 Use the C<SvPVutf8_nolen> macro instead
8391 =for apidoc sv_pvutf8n
8393 A private implementation of the C<SvPVutf8> macro for compilers
8394 which can't cope with complex macro expressions. Always use the macro
8401 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8403 sv_utf8_upgrade(sv);
8404 return sv_pvn(sv,lp);
8408 =for apidoc sv_pvutf8n_force
8410 A private implementation of the C<SvPVutf8_force> macro for compilers
8411 which can't cope with complex macro expressions. Always use the macro
8418 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8420 sv_pvn_force(sv,lp);
8421 sv_utf8_upgrade(sv);
8427 =for apidoc sv_reftype
8429 Returns a string describing what the SV is a reference to.
8435 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8437 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8438 inside return suggests a const propagation bug in g++. */
8439 if (ob && SvOBJECT(sv)) {
8440 char *name = HvNAME_get(SvSTASH(sv));
8441 return name ? name : (char *) "__ANON__";
8444 switch (SvTYPE(sv)) {
8461 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8462 /* tied lvalues should appear to be
8463 * scalars for backwards compatitbility */
8464 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8465 ? "SCALAR" : "LVALUE");
8466 case SVt_PVAV: return "ARRAY";
8467 case SVt_PVHV: return "HASH";
8468 case SVt_PVCV: return "CODE";
8469 case SVt_PVGV: return "GLOB";
8470 case SVt_PVFM: return "FORMAT";
8471 case SVt_PVIO: return "IO";
8472 default: return "UNKNOWN";
8478 =for apidoc sv_isobject
8480 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8481 object. If the SV is not an RV, or if the object is not blessed, then this
8488 Perl_sv_isobject(pTHX_ SV *sv)
8505 Returns a boolean indicating whether the SV is blessed into the specified
8506 class. This does not check for subtypes; use C<sv_derived_from> to verify
8507 an inheritance relationship.
8513 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8525 hvname = HvNAME_get(SvSTASH(sv));
8529 return strEQ(hvname, name);
8535 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8536 it will be upgraded to one. If C<classname> is non-null then the new SV will
8537 be blessed in the specified package. The new SV is returned and its
8538 reference count is 1.
8544 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8550 SV_CHECK_THINKFIRST_COW_DROP(rv);
8553 if (SvTYPE(rv) >= SVt_PVMG) {
8554 const U32 refcnt = SvREFCNT(rv);
8558 SvREFCNT(rv) = refcnt;
8561 if (SvTYPE(rv) < SVt_RV)
8562 sv_upgrade(rv, SVt_RV);
8563 else if (SvTYPE(rv) > SVt_RV) {
8574 HV* stash = gv_stashpv(classname, TRUE);
8575 (void)sv_bless(rv, stash);
8581 =for apidoc sv_setref_pv
8583 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8584 argument will be upgraded to an RV. That RV will be modified to point to
8585 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8586 into the SV. The C<classname> argument indicates the package for the
8587 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8588 will have a reference count of 1, and the RV will be returned.
8590 Do not use with other Perl types such as HV, AV, SV, CV, because those
8591 objects will become corrupted by the pointer copy process.
8593 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8599 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8602 sv_setsv(rv, &PL_sv_undef);
8606 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8611 =for apidoc sv_setref_iv
8613 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8614 argument will be upgraded to an RV. That RV will be modified to point to
8615 the new SV. The C<classname> argument indicates the package for the
8616 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8617 will have a reference count of 1, and the RV will be returned.
8623 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8625 sv_setiv(newSVrv(rv,classname), iv);
8630 =for apidoc sv_setref_uv
8632 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8633 argument will be upgraded to an RV. That RV will be modified to point to
8634 the new SV. The C<classname> argument indicates the package for the
8635 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8636 will have a reference count of 1, and the RV will be returned.
8642 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8644 sv_setuv(newSVrv(rv,classname), uv);
8649 =for apidoc sv_setref_nv
8651 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8652 argument will be upgraded to an RV. That RV will be modified to point to
8653 the new SV. The C<classname> argument indicates the package for the
8654 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8655 will have a reference count of 1, and the RV will be returned.
8661 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8663 sv_setnv(newSVrv(rv,classname), nv);
8668 =for apidoc sv_setref_pvn
8670 Copies a string into a new SV, optionally blessing the SV. The length of the
8671 string must be specified with C<n>. The C<rv> argument will be upgraded to
8672 an RV. That RV will be modified to point to the new SV. The C<classname>
8673 argument indicates the package for the blessing. Set C<classname> to
8674 C<Nullch> to avoid the blessing. The new SV will have a reference count
8675 of 1, and the RV will be returned.
8677 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8683 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8685 sv_setpvn(newSVrv(rv,classname), pv, n);
8690 =for apidoc sv_bless
8692 Blesses an SV into a specified package. The SV must be an RV. The package
8693 must be designated by its stash (see C<gv_stashpv()>). The reference count
8694 of the SV is unaffected.
8700 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8704 Perl_croak(aTHX_ "Can't bless non-reference value");
8706 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8707 if (SvREADONLY(tmpRef))
8708 Perl_croak(aTHX_ PL_no_modify);
8709 if (SvOBJECT(tmpRef)) {
8710 if (SvTYPE(tmpRef) != SVt_PVIO)
8712 SvREFCNT_dec(SvSTASH(tmpRef));
8715 SvOBJECT_on(tmpRef);
8716 if (SvTYPE(tmpRef) != SVt_PVIO)
8718 SvUPGRADE(tmpRef, SVt_PVMG);
8719 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8726 if(SvSMAGICAL(tmpRef))
8727 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8735 /* Downgrades a PVGV to a PVMG.
8739 S_sv_unglob(pTHX_ SV *sv)
8743 assert(SvTYPE(sv) == SVt_PVGV);
8748 SvREFCNT_dec(GvSTASH(sv));
8749 GvSTASH(sv) = Nullhv;
8751 sv_unmagic(sv, PERL_MAGIC_glob);
8752 Safefree(GvNAME(sv));
8755 /* need to keep SvANY(sv) in the right arena */
8756 xpvmg = new_XPVMG();
8757 StructCopy(SvANY(sv), xpvmg, XPVMG);
8758 del_XPVGV(SvANY(sv));
8761 SvFLAGS(sv) &= ~SVTYPEMASK;
8762 SvFLAGS(sv) |= SVt_PVMG;
8766 =for apidoc sv_unref_flags
8768 Unsets the RV status of the SV, and decrements the reference count of
8769 whatever was being referenced by the RV. This can almost be thought of
8770 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8771 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8772 (otherwise the decrementing is conditional on the reference count being
8773 different from one or the reference being a readonly SV).
8780 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8784 if (SvWEAKREF(sv)) {
8792 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8793 assigned to as BEGIN {$a = \"Foo"} will fail. */
8794 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8796 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8797 sv_2mortal(rv); /* Schedule for freeing later */
8801 =for apidoc sv_unref
8803 Unsets the RV status of the SV, and decrements the reference count of
8804 whatever was being referenced by the RV. This can almost be thought of
8805 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8806 being zero. See C<SvROK_off>.
8812 Perl_sv_unref(pTHX_ SV *sv)
8814 sv_unref_flags(sv, 0);
8818 =for apidoc sv_taint
8820 Taint an SV. Use C<SvTAINTED_on> instead.
8825 Perl_sv_taint(pTHX_ SV *sv)
8827 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8831 =for apidoc sv_untaint
8833 Untaint an SV. Use C<SvTAINTED_off> instead.
8838 Perl_sv_untaint(pTHX_ SV *sv)
8840 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8841 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8848 =for apidoc sv_tainted
8850 Test an SV for taintedness. Use C<SvTAINTED> instead.
8855 Perl_sv_tainted(pTHX_ SV *sv)
8857 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8858 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8859 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8866 =for apidoc sv_setpviv
8868 Copies an integer into the given SV, also updating its string value.
8869 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8875 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8877 char buf[TYPE_CHARS(UV)];
8879 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8881 sv_setpvn(sv, ptr, ebuf - ptr);
8885 =for apidoc sv_setpviv_mg
8887 Like C<sv_setpviv>, but also handles 'set' magic.
8893 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8895 char buf[TYPE_CHARS(UV)];
8897 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8899 sv_setpvn(sv, ptr, ebuf - ptr);
8903 #if defined(PERL_IMPLICIT_CONTEXT)
8905 /* pTHX_ magic can't cope with varargs, so this is a no-context
8906 * version of the main function, (which may itself be aliased to us).
8907 * Don't access this version directly.
8911 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8915 va_start(args, pat);
8916 sv_vsetpvf(sv, pat, &args);
8920 /* pTHX_ magic can't cope with varargs, so this is a no-context
8921 * version of the main function, (which may itself be aliased to us).
8922 * Don't access this version directly.
8926 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8930 va_start(args, pat);
8931 sv_vsetpvf_mg(sv, pat, &args);
8937 =for apidoc sv_setpvf
8939 Works like C<sv_catpvf> but copies the text into the SV instead of
8940 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8946 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8949 va_start(args, pat);
8950 sv_vsetpvf(sv, pat, &args);
8955 =for apidoc sv_vsetpvf
8957 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8958 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8960 Usually used via its frontend C<sv_setpvf>.
8966 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8968 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8972 =for apidoc sv_setpvf_mg
8974 Like C<sv_setpvf>, but also handles 'set' magic.
8980 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8983 va_start(args, pat);
8984 sv_vsetpvf_mg(sv, pat, &args);
8989 =for apidoc sv_vsetpvf_mg
8991 Like C<sv_vsetpvf>, but also handles 'set' magic.
8993 Usually used via its frontend C<sv_setpvf_mg>.
8999 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9001 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9005 #if defined(PERL_IMPLICIT_CONTEXT)
9007 /* pTHX_ magic can't cope with varargs, so this is a no-context
9008 * version of the main function, (which may itself be aliased to us).
9009 * Don't access this version directly.
9013 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
9017 va_start(args, pat);
9018 sv_vcatpvf(sv, pat, &args);
9022 /* pTHX_ magic can't cope with varargs, so this is a no-context
9023 * version of the main function, (which may itself be aliased to us).
9024 * Don't access this version directly.
9028 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
9032 va_start(args, pat);
9033 sv_vcatpvf_mg(sv, pat, &args);
9039 =for apidoc sv_catpvf
9041 Processes its arguments like C<sprintf> and appends the formatted
9042 output to an SV. If the appended data contains "wide" characters
9043 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
9044 and characters >255 formatted with %c), the original SV might get
9045 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
9046 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
9047 valid UTF-8; if the original SV was bytes, the pattern should be too.
9052 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
9055 va_start(args, pat);
9056 sv_vcatpvf(sv, pat, &args);
9061 =for apidoc sv_vcatpvf
9063 Processes its arguments like C<vsprintf> and appends the formatted output
9064 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
9066 Usually used via its frontend C<sv_catpvf>.
9072 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
9074 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9078 =for apidoc sv_catpvf_mg
9080 Like C<sv_catpvf>, but also handles 'set' magic.
9086 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9089 va_start(args, pat);
9090 sv_vcatpvf_mg(sv, pat, &args);
9095 =for apidoc sv_vcatpvf_mg
9097 Like C<sv_vcatpvf>, but also handles 'set' magic.
9099 Usually used via its frontend C<sv_catpvf_mg>.
9105 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9107 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9112 =for apidoc sv_vsetpvfn
9114 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9117 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9123 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9125 sv_setpvn(sv, "", 0);
9126 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9129 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9132 S_expect_number(pTHX_ char** pattern)
9135 switch (**pattern) {
9136 case '1': case '2': case '3':
9137 case '4': case '5': case '6':
9138 case '7': case '8': case '9':
9139 while (isDIGIT(**pattern))
9140 var = var * 10 + (*(*pattern)++ - '0');
9144 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9147 F0convert(NV nv, char *endbuf, STRLEN *len)
9149 const int neg = nv < 0;
9158 if (uv & 1 && uv == nv)
9159 uv--; /* Round to even */
9161 const unsigned dig = uv % 10;
9174 =for apidoc sv_vcatpvfn
9176 Processes its arguments like C<vsprintf> and appends the formatted output
9177 to an SV. Uses an array of SVs if the C style variable argument list is
9178 missing (NULL). When running with taint checks enabled, indicates via
9179 C<maybe_tainted> if results are untrustworthy (often due to the use of
9182 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9187 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9190 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9197 static const char nullstr[] = "(null)";
9199 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
9200 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
9202 /* Times 4: a decimal digit takes more than 3 binary digits.
9203 * NV_DIG: mantissa takes than many decimal digits.
9204 * Plus 32: Playing safe. */
9205 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9206 /* large enough for "%#.#f" --chip */
9207 /* what about long double NVs? --jhi */
9209 /* no matter what, this is a string now */
9210 (void)SvPV_force(sv, origlen);
9212 /* special-case "", "%s", and "%-p" (SVf) */
9215 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
9217 const char *s = va_arg(*args, char*);
9218 sv_catpv(sv, s ? s : nullstr);
9220 else if (svix < svmax) {
9221 sv_catsv(sv, *svargs);
9222 if (DO_UTF8(*svargs))
9227 if (patlen == 3 && pat[0] == '%' &&
9228 pat[1] == '-' && pat[2] == 'p') {
9230 argsv = va_arg(*args, SV*);
9231 sv_catsv(sv, argsv);
9238 #ifndef USE_LONG_DOUBLE
9239 /* special-case "%.<number>[gf]" */
9240 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9241 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9242 unsigned digits = 0;
9246 while (*pp >= '0' && *pp <= '9')
9247 digits = 10 * digits + (*pp++ - '0');
9248 if (pp - pat == (int)patlen - 1) {
9252 nv = (NV)va_arg(*args, double);
9253 else if (svix < svmax)
9258 /* Add check for digits != 0 because it seems that some
9259 gconverts are buggy in this case, and we don't yet have
9260 a Configure test for this. */
9261 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9262 /* 0, point, slack */
9263 Gconvert(nv, (int)digits, 0, ebuf);
9265 if (*ebuf) /* May return an empty string for digits==0 */
9268 } else if (!digits) {
9271 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9272 sv_catpvn(sv, p, l);
9278 #endif /* !USE_LONG_DOUBLE */
9280 if (!args && svix < svmax && DO_UTF8(*svargs))
9283 patend = (char*)pat + patlen;
9284 for (p = (char*)pat; p < patend; p = q) {
9287 bool vectorize = FALSE;
9288 bool vectorarg = FALSE;
9289 bool vec_utf8 = FALSE;
9295 bool has_precis = FALSE;
9298 bool is_utf8 = FALSE; /* is this item utf8? */
9299 #ifdef HAS_LDBL_SPRINTF_BUG
9300 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9301 with sfio - Allen <allens@cpan.org> */
9302 bool fix_ldbl_sprintf_bug = FALSE;
9306 U8 utf8buf[UTF8_MAXBYTES+1];
9307 STRLEN esignlen = 0;
9309 const char *eptr = Nullch;
9312 U8 *vecstr = Null(U8*);
9319 /* we need a long double target in case HAS_LONG_DOUBLE but
9322 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9330 const char *dotstr = ".";
9331 STRLEN dotstrlen = 1;
9332 I32 efix = 0; /* explicit format parameter index */
9333 I32 ewix = 0; /* explicit width index */
9334 I32 epix = 0; /* explicit precision index */
9335 I32 evix = 0; /* explicit vector index */
9336 bool asterisk = FALSE;
9338 /* echo everything up to the next format specification */
9339 for (q = p; q < patend && *q != '%'; ++q) ;
9341 if (has_utf8 && !pat_utf8)
9342 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9344 sv_catpvn(sv, p, q - p);
9351 We allow format specification elements in this order:
9352 \d+\$ explicit format parameter index
9354 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9355 0 flag (as above): repeated to allow "v02"
9356 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9357 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9359 [%bcdefginopsux_DFOUX] format (mandatory)
9361 if (EXPECT_NUMBER(q, width)) {
9402 if (EXPECT_NUMBER(q, ewix))
9411 if ((vectorarg = asterisk)) {
9423 EXPECT_NUMBER(q, width);
9428 vecsv = va_arg(*args, SV*);
9430 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9431 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9432 dotstr = SvPVx(vecsv, dotstrlen);
9437 vecsv = va_arg(*args, SV*);
9438 vecstr = (U8*)SvPVx(vecsv,veclen);
9439 vec_utf8 = DO_UTF8(vecsv);
9441 else if (efix ? efix <= svmax : svix < svmax) {
9442 vecsv = svargs[efix ? efix-1 : svix++];
9443 vecstr = (U8*)SvPVx(vecsv,veclen);
9444 vec_utf8 = DO_UTF8(vecsv);
9445 /* if this is a version object, we need to return the
9446 * stringified representation (which the SvPVX_const has
9447 * already done for us), but not vectorize the args
9449 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9451 q++; /* skip past the rest of the %vd format */
9452 eptr = (char *) vecstr;
9453 elen = strlen(eptr);
9466 i = va_arg(*args, int);
9468 i = (ewix ? ewix <= svmax : svix < svmax) ?
9469 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9471 width = (i < 0) ? -i : i;
9481 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9483 /* XXX: todo, support specified precision parameter */
9487 i = va_arg(*args, int);
9489 i = (ewix ? ewix <= svmax : svix < svmax)
9490 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9491 precis = (i < 0) ? 0 : i;
9496 precis = precis * 10 + (*q++ - '0');
9505 case 'I': /* Ix, I32x, and I64x */
9507 if (q[1] == '6' && q[2] == '4') {
9513 if (q[1] == '3' && q[2] == '2') {
9523 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9534 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9535 if (*(q + 1) == 'l') { /* lld, llf */
9560 argsv = (efix ? efix <= svmax : svix < svmax) ?
9561 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9568 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9570 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9572 eptr = (char*)utf8buf;
9573 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9584 if (args && !vectorize) {
9585 eptr = va_arg(*args, char*);
9587 #ifdef MACOS_TRADITIONAL
9588 /* On MacOS, %#s format is used for Pascal strings */
9593 elen = strlen(eptr);
9595 eptr = (char *)nullstr;
9596 elen = sizeof nullstr - 1;
9600 eptr = SvPVx_const(argsv, elen);
9601 if (DO_UTF8(argsv)) {
9602 if (has_precis && precis < elen) {
9604 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9607 if (width) { /* fudge width (can't fudge elen) */
9608 width += elen - sv_len_utf8(argsv);
9616 if (has_precis && elen > precis)
9623 if (left && args) { /* SVf */
9632 argsv = va_arg(*args, SV*);
9633 eptr = SvPVx_const(argsv, elen);
9638 if (alt || vectorize)
9640 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9658 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9667 esignbuf[esignlen++] = plus;
9671 case 'h': iv = (short)va_arg(*args, int); break;
9672 case 'l': iv = va_arg(*args, long); break;
9673 case 'V': iv = va_arg(*args, IV); break;
9674 default: iv = va_arg(*args, int); break;
9676 case 'q': iv = va_arg(*args, Quad_t); break;
9681 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9683 case 'h': iv = (short)tiv; break;
9684 case 'l': iv = (long)tiv; break;
9686 default: iv = tiv; break;
9688 case 'q': iv = (Quad_t)tiv; break;
9692 if ( !vectorize ) /* we already set uv above */
9697 esignbuf[esignlen++] = plus;
9701 esignbuf[esignlen++] = '-';
9744 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9755 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9756 case 'l': uv = va_arg(*args, unsigned long); break;
9757 case 'V': uv = va_arg(*args, UV); break;
9758 default: uv = va_arg(*args, unsigned); break;
9760 case 'q': uv = va_arg(*args, Uquad_t); break;
9765 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9767 case 'h': uv = (unsigned short)tuv; break;
9768 case 'l': uv = (unsigned long)tuv; break;
9770 default: uv = tuv; break;
9772 case 'q': uv = (Uquad_t)tuv; break;
9779 char *ptr = ebuf + sizeof ebuf;
9785 p = (char*)((c == 'X')
9786 ? "0123456789ABCDEF" : "0123456789abcdef");
9792 esignbuf[esignlen++] = '0';
9793 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9801 if (alt && *ptr != '0')
9810 esignbuf[esignlen++] = '0';
9811 esignbuf[esignlen++] = 'b';
9814 default: /* it had better be ten or less */
9818 } while (uv /= base);
9821 elen = (ebuf + sizeof ebuf) - ptr;
9825 zeros = precis - elen;
9826 else if (precis == 0 && elen == 1 && *eptr == '0')
9832 /* FLOATING POINT */
9835 c = 'f'; /* maybe %F isn't supported here */
9841 /* This is evil, but floating point is even more evil */
9843 /* for SV-style calling, we can only get NV
9844 for C-style calling, we assume %f is double;
9845 for simplicity we allow any of %Lf, %llf, %qf for long double
9849 #if defined(USE_LONG_DOUBLE)
9853 /* [perl #20339] - we should accept and ignore %lf rather than die */
9857 #if defined(USE_LONG_DOUBLE)
9858 intsize = args ? 0 : 'q';
9862 #if defined(HAS_LONG_DOUBLE)
9871 /* now we need (long double) if intsize == 'q', else (double) */
9872 nv = (args && !vectorize) ?
9873 #if LONG_DOUBLESIZE > DOUBLESIZE
9875 va_arg(*args, long double) :
9876 va_arg(*args, double)
9878 va_arg(*args, double)
9884 if (c != 'e' && c != 'E') {
9886 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9887 will cast our (long double) to (double) */
9888 (void)Perl_frexp(nv, &i);
9889 if (i == PERL_INT_MIN)
9890 Perl_die(aTHX_ "panic: frexp");
9892 need = BIT_DIGITS(i);
9894 need += has_precis ? precis : 6; /* known default */
9899 #ifdef HAS_LDBL_SPRINTF_BUG
9900 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9901 with sfio - Allen <allens@cpan.org> */
9904 # define MY_DBL_MAX DBL_MAX
9905 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9906 # if DOUBLESIZE >= 8
9907 # define MY_DBL_MAX 1.7976931348623157E+308L
9909 # define MY_DBL_MAX 3.40282347E+38L
9913 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9914 # define MY_DBL_MAX_BUG 1L
9916 # define MY_DBL_MAX_BUG MY_DBL_MAX
9920 # define MY_DBL_MIN DBL_MIN
9921 # else /* XXX guessing! -Allen */
9922 # if DOUBLESIZE >= 8
9923 # define MY_DBL_MIN 2.2250738585072014E-308L
9925 # define MY_DBL_MIN 1.17549435E-38L
9929 if ((intsize == 'q') && (c == 'f') &&
9930 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9932 /* it's going to be short enough that
9933 * long double precision is not needed */
9935 if ((nv <= 0L) && (nv >= -0L))
9936 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9938 /* would use Perl_fp_class as a double-check but not
9939 * functional on IRIX - see perl.h comments */
9941 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9942 /* It's within the range that a double can represent */
9943 #if defined(DBL_MAX) && !defined(DBL_MIN)
9944 if ((nv >= ((long double)1/DBL_MAX)) ||
9945 (nv <= (-(long double)1/DBL_MAX)))
9947 fix_ldbl_sprintf_bug = TRUE;
9950 if (fix_ldbl_sprintf_bug == TRUE) {
9960 # undef MY_DBL_MAX_BUG
9963 #endif /* HAS_LDBL_SPRINTF_BUG */
9965 need += 20; /* fudge factor */
9966 if (PL_efloatsize < need) {
9967 Safefree(PL_efloatbuf);
9968 PL_efloatsize = need + 20; /* more fudge */
9969 New(906, PL_efloatbuf, PL_efloatsize, char);
9970 PL_efloatbuf[0] = '\0';
9973 if ( !(width || left || plus || alt) && fill != '0'
9974 && has_precis && intsize != 'q' ) { /* Shortcuts */
9975 /* See earlier comment about buggy Gconvert when digits,
9977 if ( c == 'g' && precis) {
9978 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9979 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9980 goto float_converted;
9981 } else if ( c == 'f' && !precis) {
9982 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9987 char *ptr = ebuf + sizeof ebuf;
9990 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9991 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9992 if (intsize == 'q') {
9993 /* Copy the one or more characters in a long double
9994 * format before the 'base' ([efgEFG]) character to
9995 * the format string. */
9996 static char const prifldbl[] = PERL_PRIfldbl;
9997 char const *p = prifldbl + sizeof(prifldbl) - 3;
9998 while (p >= prifldbl) { *--ptr = *p--; }
10003 do { *--ptr = '0' + (base % 10); } while (base /= 10);
10008 do { *--ptr = '0' + (base % 10); } while (base /= 10);
10020 /* No taint. Otherwise we are in the strange situation
10021 * where printf() taints but print($float) doesn't.
10023 #if defined(HAS_LONG_DOUBLE)
10024 if (intsize == 'q')
10025 (void)sprintf(PL_efloatbuf, ptr, nv);
10027 (void)sprintf(PL_efloatbuf, ptr, (double)nv);
10029 (void)sprintf(PL_efloatbuf, ptr, nv);
10033 eptr = PL_efloatbuf;
10034 elen = strlen(PL_efloatbuf);
10040 i = SvCUR(sv) - origlen;
10041 if (args && !vectorize) {
10043 case 'h': *(va_arg(*args, short*)) = i; break;
10044 default: *(va_arg(*args, int*)) = i; break;
10045 case 'l': *(va_arg(*args, long*)) = i; break;
10046 case 'V': *(va_arg(*args, IV*)) = i; break;
10048 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
10053 sv_setuv_mg(argsv, (UV)i);
10055 continue; /* not "break" */
10061 if (!args && ckWARN(WARN_PRINTF) &&
10062 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
10063 SV *msg = sv_newmortal();
10064 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
10065 (PL_op->op_type == OP_PRTF) ? "" : "s");
10068 Perl_sv_catpvf(aTHX_ msg,
10069 "\"%%%c\"", c & 0xFF);
10071 Perl_sv_catpvf(aTHX_ msg,
10072 "\"%%\\%03"UVof"\"",
10075 sv_catpv(msg, "end of string");
10076 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10079 /* output mangled stuff ... */
10085 /* ... right here, because formatting flags should not apply */
10086 SvGROW(sv, SvCUR(sv) + elen + 1);
10088 Copy(eptr, p, elen, char);
10091 SvCUR_set(sv, p - SvPVX_const(sv));
10093 continue; /* not "break" */
10096 /* calculate width before utf8_upgrade changes it */
10097 have = esignlen + zeros + elen;
10099 if (is_utf8 != has_utf8) {
10102 sv_utf8_upgrade(sv);
10105 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10106 sv_utf8_upgrade(nsv);
10110 SvGROW(sv, SvCUR(sv) + elen + 1);
10115 need = (have > width ? have : width);
10118 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10120 if (esignlen && fill == '0') {
10121 for (i = 0; i < (int)esignlen; i++)
10122 *p++ = esignbuf[i];
10124 if (gap && !left) {
10125 memset(p, fill, gap);
10128 if (esignlen && fill != '0') {
10129 for (i = 0; i < (int)esignlen; i++)
10130 *p++ = esignbuf[i];
10133 for (i = zeros; i; i--)
10137 Copy(eptr, p, elen, char);
10141 memset(p, ' ', gap);
10146 Copy(dotstr, p, dotstrlen, char);
10150 vectorize = FALSE; /* done iterating over vecstr */
10157 SvCUR_set(sv, p - SvPVX_const(sv));
10165 /* =========================================================================
10167 =head1 Cloning an interpreter
10169 All the macros and functions in this section are for the private use of
10170 the main function, perl_clone().
10172 The foo_dup() functions make an exact copy of an existing foo thinngy.
10173 During the course of a cloning, a hash table is used to map old addresses
10174 to new addresses. The table is created and manipulated with the
10175 ptr_table_* functions.
10179 ============================================================================*/
10182 #if defined(USE_ITHREADS)
10184 #ifndef GpREFCNT_inc
10185 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10189 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10190 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10191 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10192 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10193 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10194 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10195 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10196 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10197 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10198 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10199 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10200 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10201 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10204 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10205 regcomp.c. AMS 20010712 */
10208 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10213 struct reg_substr_datum *s;
10216 return (REGEXP *)NULL;
10218 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10221 len = r->offsets[0];
10222 npar = r->nparens+1;
10224 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10225 Copy(r->program, ret->program, len+1, regnode);
10227 New(0, ret->startp, npar, I32);
10228 Copy(r->startp, ret->startp, npar, I32);
10229 New(0, ret->endp, npar, I32);
10230 Copy(r->startp, ret->startp, npar, I32);
10232 New(0, ret->substrs, 1, struct reg_substr_data);
10233 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10234 s->min_offset = r->substrs->data[i].min_offset;
10235 s->max_offset = r->substrs->data[i].max_offset;
10236 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10237 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10240 ret->regstclass = NULL;
10242 struct reg_data *d;
10243 const int count = r->data->count;
10245 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10246 char, struct reg_data);
10247 New(0, d->what, count, U8);
10250 for (i = 0; i < count; i++) {
10251 d->what[i] = r->data->what[i];
10252 switch (d->what[i]) {
10253 /* legal options are one of: sfpont
10254 see also regcomp.h and pregfree() */
10256 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10259 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10262 /* This is cheating. */
10263 New(0, d->data[i], 1, struct regnode_charclass_class);
10264 StructCopy(r->data->data[i], d->data[i],
10265 struct regnode_charclass_class);
10266 ret->regstclass = (regnode*)d->data[i];
10269 /* Compiled op trees are readonly, and can thus be
10270 shared without duplication. */
10272 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10276 d->data[i] = r->data->data[i];
10279 d->data[i] = r->data->data[i];
10281 ((reg_trie_data*)d->data[i])->refcount++;
10285 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10294 New(0, ret->offsets, 2*len+1, U32);
10295 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10297 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10298 ret->refcnt = r->refcnt;
10299 ret->minlen = r->minlen;
10300 ret->prelen = r->prelen;
10301 ret->nparens = r->nparens;
10302 ret->lastparen = r->lastparen;
10303 ret->lastcloseparen = r->lastcloseparen;
10304 ret->reganch = r->reganch;
10306 ret->sublen = r->sublen;
10308 if (RX_MATCH_COPIED(ret))
10309 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10311 ret->subbeg = Nullch;
10312 #ifdef PERL_COPY_ON_WRITE
10313 ret->saved_copy = Nullsv;
10316 ptr_table_store(PL_ptr_table, r, ret);
10320 /* duplicate a file handle */
10323 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10329 return (PerlIO*)NULL;
10331 /* look for it in the table first */
10332 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10336 /* create anew and remember what it is */
10337 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10338 ptr_table_store(PL_ptr_table, fp, ret);
10342 /* duplicate a directory handle */
10345 Perl_dirp_dup(pTHX_ DIR *dp)
10353 /* duplicate a typeglob */
10356 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10361 /* look for it in the table first */
10362 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10366 /* create anew and remember what it is */
10367 Newz(0, ret, 1, GP);
10368 ptr_table_store(PL_ptr_table, gp, ret);
10371 ret->gp_refcnt = 0; /* must be before any other dups! */
10372 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10373 ret->gp_io = io_dup_inc(gp->gp_io, param);
10374 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10375 ret->gp_av = av_dup_inc(gp->gp_av, param);
10376 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10377 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10378 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10379 ret->gp_cvgen = gp->gp_cvgen;
10380 ret->gp_flags = gp->gp_flags;
10381 ret->gp_line = gp->gp_line;
10382 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10386 /* duplicate a chain of magic */
10389 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10391 MAGIC *mgprev = (MAGIC*)NULL;
10394 return (MAGIC*)NULL;
10395 /* look for it in the table first */
10396 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10400 for (; mg; mg = mg->mg_moremagic) {
10402 Newz(0, nmg, 1, MAGIC);
10404 mgprev->mg_moremagic = nmg;
10407 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10408 nmg->mg_private = mg->mg_private;
10409 nmg->mg_type = mg->mg_type;
10410 nmg->mg_flags = mg->mg_flags;
10411 if (mg->mg_type == PERL_MAGIC_qr) {
10412 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10414 else if(mg->mg_type == PERL_MAGIC_backref) {
10415 const AV * const av = (AV*) mg->mg_obj;
10418 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10420 for (i = AvFILLp(av); i >= 0; i--) {
10421 if (!svp[i]) continue;
10422 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10425 else if (mg->mg_type == PERL_MAGIC_symtab) {
10426 nmg->mg_obj = mg->mg_obj;
10429 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10430 ? sv_dup_inc(mg->mg_obj, param)
10431 : sv_dup(mg->mg_obj, param);
10433 nmg->mg_len = mg->mg_len;
10434 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10435 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10436 if (mg->mg_len > 0) {
10437 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10438 if (mg->mg_type == PERL_MAGIC_overload_table &&
10439 AMT_AMAGIC((AMT*)mg->mg_ptr))
10441 AMT *amtp = (AMT*)mg->mg_ptr;
10442 AMT *namtp = (AMT*)nmg->mg_ptr;
10444 for (i = 1; i < NofAMmeth; i++) {
10445 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10449 else if (mg->mg_len == HEf_SVKEY)
10450 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10452 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10453 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10460 /* create a new pointer-mapping table */
10463 Perl_ptr_table_new(pTHX)
10466 Newz(0, tbl, 1, PTR_TBL_t);
10467 tbl->tbl_max = 511;
10468 tbl->tbl_items = 0;
10469 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10474 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10476 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10484 struct ptr_tbl_ent* pte;
10485 struct ptr_tbl_ent* pteend;
10486 New(0, pte, PERL_ARENA_SIZE/sizeof(struct ptr_tbl_ent), struct ptr_tbl_ent);
10487 pte->next = PL_pte_arenaroot;
10488 PL_pte_arenaroot = pte;
10490 pteend = &pte[PERL_ARENA_SIZE / sizeof(struct ptr_tbl_ent) - 1];
10491 PL_pte_root = ++pte;
10492 while (pte < pteend) {
10493 pte->next = pte + 1;
10499 STATIC struct ptr_tbl_ent*
10502 struct ptr_tbl_ent* pte;
10506 PL_pte_root = pte->next;
10511 S_del_pte(pTHX_ struct ptr_tbl_ent*p)
10513 p->next = PL_pte_root;
10517 /* map an existing pointer using a table */
10520 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10522 PTR_TBL_ENT_t *tblent;
10523 const UV hash = PTR_TABLE_HASH(sv);
10525 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10526 for (; tblent; tblent = tblent->next) {
10527 if (tblent->oldval == sv)
10528 return tblent->newval;
10530 return (void*)NULL;
10533 /* add a new entry to a pointer-mapping table */
10536 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10538 PTR_TBL_ENT_t *tblent, **otblent;
10539 /* XXX this may be pessimal on platforms where pointers aren't good
10540 * hash values e.g. if they grow faster in the most significant
10542 const UV hash = PTR_TABLE_HASH(oldv);
10546 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10547 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10548 if (tblent->oldval == oldv) {
10549 tblent->newval = newv;
10553 tblent = S_new_pte(aTHX);
10554 tblent->oldval = oldv;
10555 tblent->newval = newv;
10556 tblent->next = *otblent;
10559 if (!empty && tbl->tbl_items > tbl->tbl_max)
10560 ptr_table_split(tbl);
10563 /* double the hash bucket size of an existing ptr table */
10566 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10568 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10569 const UV oldsize = tbl->tbl_max + 1;
10570 UV newsize = oldsize * 2;
10573 Renew(ary, newsize, PTR_TBL_ENT_t*);
10574 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10575 tbl->tbl_max = --newsize;
10576 tbl->tbl_ary = ary;
10577 for (i=0; i < oldsize; i++, ary++) {
10578 PTR_TBL_ENT_t **curentp, **entp, *ent;
10581 curentp = ary + oldsize;
10582 for (entp = ary, ent = *ary; ent; ent = *entp) {
10583 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10585 ent->next = *curentp;
10595 /* remove all the entries from a ptr table */
10598 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10600 register PTR_TBL_ENT_t **array;
10601 register PTR_TBL_ENT_t *entry;
10605 if (!tbl || !tbl->tbl_items) {
10609 array = tbl->tbl_ary;
10611 max = tbl->tbl_max;
10615 PTR_TBL_ENT_t *oentry = entry;
10616 entry = entry->next;
10617 S_del_pte(aTHX_ oentry);
10620 if (++riter > max) {
10623 entry = array[riter];
10627 tbl->tbl_items = 0;
10630 /* clear and free a ptr table */
10633 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10638 ptr_table_clear(tbl);
10639 Safefree(tbl->tbl_ary);
10643 /* attempt to make everything in the typeglob readonly */
10646 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10648 GV *gv = (GV*)sstr;
10649 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10651 if (GvIO(gv) || GvFORM(gv)) {
10652 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10654 else if (!GvCV(gv)) {
10655 GvCV(gv) = (CV*)sv;
10658 /* CvPADLISTs cannot be shared */
10659 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10664 if (!GvUNIQUE(gv)) {
10666 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10667 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10673 * write attempts will die with
10674 * "Modification of a read-only value attempted"
10680 SvREADONLY_on(GvSV(gv));
10684 GvAV(gv) = (AV*)sv;
10687 SvREADONLY_on(GvAV(gv));
10691 GvHV(gv) = (HV*)sv;
10694 SvREADONLY_on(GvHV(gv));
10697 return sstr; /* he_dup() will SvREFCNT_inc() */
10700 /* duplicate an SV of any type (including AV, HV etc) */
10703 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10706 SvRV_set(dstr, SvWEAKREF(sstr)
10707 ? sv_dup(SvRV(sstr), param)
10708 : sv_dup_inc(SvRV(sstr), param));
10711 else if (SvPVX_const(sstr)) {
10712 /* Has something there */
10714 /* Normal PV - clone whole allocated space */
10715 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
10716 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10717 /* Not that normal - actually sstr is copy on write.
10718 But we are a true, independant SV, so: */
10719 SvREADONLY_off(dstr);
10724 /* Special case - not normally malloced for some reason */
10725 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10726 /* A "shared" PV - clone it as unshared string */
10727 if(SvPADTMP(sstr)) {
10728 /* However, some of them live in the pad
10729 and they should not have these flags
10732 SvPV_set(dstr, sharepvn(SvPVX_const(sstr), SvCUR(sstr),
10734 SvUV_set(dstr, SvUVX(sstr));
10737 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvCUR(sstr)));
10739 SvREADONLY_off(dstr);
10743 /* Some other special case - random pointer */
10744 SvPV_set(dstr, SvPVX(sstr));
10749 /* Copy the Null */
10750 if (SvTYPE(dstr) == SVt_RV)
10751 SvRV_set(dstr, NULL);
10758 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10763 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10765 /* look for it in the table first */
10766 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10770 if(param->flags & CLONEf_JOIN_IN) {
10771 /** We are joining here so we don't want do clone
10772 something that is bad **/
10773 const char *hvname;
10775 if(SvTYPE(sstr) == SVt_PVHV &&
10776 (hvname = HvNAME_get(sstr))) {
10777 /** don't clone stashes if they already exist **/
10778 HV* old_stash = gv_stashpv(hvname,0);
10779 return (SV*) old_stash;
10783 /* create anew and remember what it is */
10786 #ifdef DEBUG_LEAKING_SCALARS
10787 dstr->sv_debug_optype = sstr->sv_debug_optype;
10788 dstr->sv_debug_line = sstr->sv_debug_line;
10789 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10790 dstr->sv_debug_cloned = 1;
10792 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10794 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10798 ptr_table_store(PL_ptr_table, sstr, dstr);
10801 SvFLAGS(dstr) = SvFLAGS(sstr);
10802 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10803 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10806 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10807 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10808 PL_watch_pvx, SvPVX_const(sstr));
10811 /* don't clone objects whose class has asked us not to */
10812 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10813 SvFLAGS(dstr) &= ~SVTYPEMASK;
10814 SvOBJECT_off(dstr);
10818 switch (SvTYPE(sstr)) {
10820 SvANY(dstr) = NULL;
10823 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10824 SvIV_set(dstr, SvIVX(sstr));
10827 SvANY(dstr) = new_XNV();
10828 SvNV_set(dstr, SvNVX(sstr));
10831 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10832 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10835 SvANY(dstr) = new_XPV();
10836 SvCUR_set(dstr, SvCUR(sstr));
10837 SvLEN_set(dstr, SvLEN(sstr));
10838 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10841 SvANY(dstr) = new_XPVIV();
10842 SvCUR_set(dstr, SvCUR(sstr));
10843 SvLEN_set(dstr, SvLEN(sstr));
10844 SvIV_set(dstr, SvIVX(sstr));
10845 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10848 SvANY(dstr) = new_XPVNV();
10849 SvCUR_set(dstr, SvCUR(sstr));
10850 SvLEN_set(dstr, SvLEN(sstr));
10851 SvIV_set(dstr, SvIVX(sstr));
10852 SvNV_set(dstr, SvNVX(sstr));
10853 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10856 SvANY(dstr) = new_XPVMG();
10857 SvCUR_set(dstr, SvCUR(sstr));
10858 SvLEN_set(dstr, SvLEN(sstr));
10859 SvIV_set(dstr, SvIVX(sstr));
10860 SvNV_set(dstr, SvNVX(sstr));
10861 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10862 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10863 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10866 SvANY(dstr) = new_XPVBM();
10867 SvCUR_set(dstr, SvCUR(sstr));
10868 SvLEN_set(dstr, SvLEN(sstr));
10869 SvIV_set(dstr, SvIVX(sstr));
10870 SvNV_set(dstr, SvNVX(sstr));
10871 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10872 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10873 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10874 BmRARE(dstr) = BmRARE(sstr);
10875 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10876 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10879 SvANY(dstr) = new_XPVLV();
10880 SvCUR_set(dstr, SvCUR(sstr));
10881 SvLEN_set(dstr, SvLEN(sstr));
10882 SvIV_set(dstr, SvIVX(sstr));
10883 SvNV_set(dstr, SvNVX(sstr));
10884 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10885 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10886 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10887 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10888 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10889 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10890 LvTARG(dstr) = dstr;
10891 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10892 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10894 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10895 LvTYPE(dstr) = LvTYPE(sstr);
10898 if (GvUNIQUE((GV*)sstr)) {
10900 if ((share = gv_share(sstr, param))) {
10903 ptr_table_store(PL_ptr_table, sstr, dstr);
10905 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10906 HvNAME_get(GvSTASH(share)), GvNAME(share));
10911 SvANY(dstr) = new_XPVGV();
10912 SvCUR_set(dstr, SvCUR(sstr));
10913 SvLEN_set(dstr, SvLEN(sstr));
10914 SvIV_set(dstr, SvIVX(sstr));
10915 SvNV_set(dstr, SvNVX(sstr));
10916 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10917 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10918 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10919 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10920 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10921 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10922 GvFLAGS(dstr) = GvFLAGS(sstr);
10923 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10924 (void)GpREFCNT_inc(GvGP(dstr));
10927 SvANY(dstr) = new_XPVIO();
10928 SvCUR_set(dstr, SvCUR(sstr));
10929 SvLEN_set(dstr, SvLEN(sstr));
10930 SvIV_set(dstr, SvIVX(sstr));
10931 SvNV_set(dstr, SvNVX(sstr));
10932 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10933 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10934 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10935 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10936 if (IoOFP(sstr) == IoIFP(sstr))
10937 IoOFP(dstr) = IoIFP(dstr);
10939 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10940 /* PL_rsfp_filters entries have fake IoDIRP() */
10941 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10942 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10944 IoDIRP(dstr) = IoDIRP(sstr);
10945 IoLINES(dstr) = IoLINES(sstr);
10946 IoPAGE(dstr) = IoPAGE(sstr);
10947 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10948 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10949 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10950 /* I have no idea why fake dirp (rsfps)
10951 should be treaded differently but otherwise
10952 we end up with leaks -- sky*/
10953 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10954 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10955 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10957 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10958 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10959 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10961 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10962 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10963 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10964 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10965 IoTYPE(dstr) = IoTYPE(sstr);
10966 IoFLAGS(dstr) = IoFLAGS(sstr);
10969 SvANY(dstr) = new_XPVAV();
10970 SvCUR_set(dstr, SvCUR(sstr));
10971 SvLEN_set(dstr, SvLEN(sstr));
10972 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10973 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10974 if (AvARRAY((AV*)sstr)) {
10975 SV **dst_ary, **src_ary;
10976 SSize_t items = AvFILLp((AV*)sstr) + 1;
10978 src_ary = AvARRAY((AV*)sstr);
10979 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10980 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10981 SvPV_set(dstr, (char*)dst_ary);
10982 AvALLOC((AV*)dstr) = dst_ary;
10983 if (AvREAL((AV*)sstr)) {
10984 while (items-- > 0)
10985 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10988 while (items-- > 0)
10989 *dst_ary++ = sv_dup(*src_ary++, param);
10991 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10992 while (items-- > 0) {
10993 *dst_ary++ = &PL_sv_undef;
10997 SvPV_set(dstr, Nullch);
10998 AvALLOC((AV*)dstr) = (SV**)NULL;
11002 SvANY(dstr) = new_XPVHV();
11003 SvCUR_set(dstr, SvCUR(sstr));
11004 SvLEN_set(dstr, SvLEN(sstr));
11005 HvTOTALKEYS(dstr) = HvTOTALKEYS(sstr);
11006 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
11007 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
11011 if (HvARRAY((HV*)sstr)) {
11013 const bool sharekeys = !!HvSHAREKEYS(sstr);
11014 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
11015 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
11018 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
11019 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0), char);
11020 HvARRAY(dstr) = (HE**)darray;
11021 while (i <= sxhv->xhv_max) {
11022 HE *source = HvARRAY(sstr)[i];
11024 = source ? he_dup(source, sharekeys, param) : 0;
11028 struct xpvhv_aux *saux = HvAUX(sstr);
11029 struct xpvhv_aux *daux = HvAUX(dstr);
11030 /* This flag isn't copied. */
11031 /* SvOOK_on(hv) attacks the IV flags. */
11032 SvFLAGS(dstr) |= SVf_OOK;
11034 hvname = saux->xhv_name;
11035 daux->xhv_name = hvname ? hek_dup(hvname, param) : hvname;
11037 daux->xhv_riter = saux->xhv_riter;
11038 daux->xhv_eiter = saux->xhv_eiter
11039 ? he_dup(saux->xhv_eiter, (bool)!!HvSHAREKEYS(sstr),
11044 SvPV_set(dstr, Nullch);
11046 /* Record stashes for possible cloning in Perl_clone(). */
11048 av_push(param->stashes, dstr);
11052 SvANY(dstr) = new_XPVFM();
11053 FmLINES(dstr) = FmLINES(sstr);
11057 SvANY(dstr) = new_XPVCV();
11059 SvCUR_set(dstr, SvCUR(sstr));
11060 SvLEN_set(dstr, SvLEN(sstr));
11061 SvIV_set(dstr, SvIVX(sstr));
11062 SvNV_set(dstr, SvNVX(sstr));
11063 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
11064 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
11065 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
11066 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
11067 CvSTART(dstr) = CvSTART(sstr);
11069 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
11071 CvXSUB(dstr) = CvXSUB(sstr);
11072 CvXSUBANY(dstr) = CvXSUBANY(sstr);
11073 if (CvCONST(sstr)) {
11074 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
11075 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
11076 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
11078 /* don't dup if copying back - CvGV isn't refcounted, so the
11079 * duped GV may never be freed. A bit of a hack! DAPM */
11080 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
11081 Nullgv : gv_dup(CvGV(sstr), param) ;
11082 if (param->flags & CLONEf_COPY_STACKS) {
11083 CvDEPTH(dstr) = CvDEPTH(sstr);
11087 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
11088 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
11090 CvWEAKOUTSIDE(sstr)
11091 ? cv_dup( CvOUTSIDE(sstr), param)
11092 : cv_dup_inc(CvOUTSIDE(sstr), param);
11093 CvFLAGS(dstr) = CvFLAGS(sstr);
11094 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
11097 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
11101 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
11107 /* duplicate a context */
11110 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11112 PERL_CONTEXT *ncxs;
11115 return (PERL_CONTEXT*)NULL;
11117 /* look for it in the table first */
11118 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11122 /* create anew and remember what it is */
11123 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11124 ptr_table_store(PL_ptr_table, cxs, ncxs);
11127 PERL_CONTEXT *cx = &cxs[ix];
11128 PERL_CONTEXT *ncx = &ncxs[ix];
11129 ncx->cx_type = cx->cx_type;
11130 if (CxTYPE(cx) == CXt_SUBST) {
11131 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11134 ncx->blk_oldsp = cx->blk_oldsp;
11135 ncx->blk_oldcop = cx->blk_oldcop;
11136 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11137 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11138 ncx->blk_oldpm = cx->blk_oldpm;
11139 ncx->blk_gimme = cx->blk_gimme;
11140 switch (CxTYPE(cx)) {
11142 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11143 ? cv_dup_inc(cx->blk_sub.cv, param)
11144 : cv_dup(cx->blk_sub.cv,param));
11145 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11146 ? av_dup_inc(cx->blk_sub.argarray, param)
11148 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11149 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11150 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11151 ncx->blk_sub.lval = cx->blk_sub.lval;
11152 ncx->blk_sub.retop = cx->blk_sub.retop;
11155 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11156 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11157 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11158 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11159 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11160 ncx->blk_eval.retop = cx->blk_eval.retop;
11163 ncx->blk_loop.label = cx->blk_loop.label;
11164 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11165 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11166 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11167 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11168 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11169 ? cx->blk_loop.iterdata
11170 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11171 ncx->blk_loop.oldcomppad
11172 = (PAD*)ptr_table_fetch(PL_ptr_table,
11173 cx->blk_loop.oldcomppad);
11174 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11175 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11176 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11177 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11178 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11181 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11182 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11183 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11184 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11185 ncx->blk_sub.retop = cx->blk_sub.retop;
11197 /* duplicate a stack info structure */
11200 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11205 return (PERL_SI*)NULL;
11207 /* look for it in the table first */
11208 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11212 /* create anew and remember what it is */
11213 Newz(56, nsi, 1, PERL_SI);
11214 ptr_table_store(PL_ptr_table, si, nsi);
11216 nsi->si_stack = av_dup_inc(si->si_stack, param);
11217 nsi->si_cxix = si->si_cxix;
11218 nsi->si_cxmax = si->si_cxmax;
11219 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11220 nsi->si_type = si->si_type;
11221 nsi->si_prev = si_dup(si->si_prev, param);
11222 nsi->si_next = si_dup(si->si_next, param);
11223 nsi->si_markoff = si->si_markoff;
11228 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11229 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11230 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11231 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11232 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11233 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11234 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11235 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11236 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11237 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11238 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11239 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11240 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11241 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11244 #define pv_dup_inc(p) SAVEPV(p)
11245 #define pv_dup(p) SAVEPV(p)
11246 #define svp_dup_inc(p,pp) any_dup(p,pp)
11248 /* map any object to the new equivent - either something in the
11249 * ptr table, or something in the interpreter structure
11253 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11258 return (void*)NULL;
11260 /* look for it in the table first */
11261 ret = ptr_table_fetch(PL_ptr_table, v);
11265 /* see if it is part of the interpreter structure */
11266 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11267 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11275 /* duplicate the save stack */
11278 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11280 ANY *ss = proto_perl->Tsavestack;
11281 I32 ix = proto_perl->Tsavestack_ix;
11282 I32 max = proto_perl->Tsavestack_max;
11294 void (*dptr) (void*);
11295 void (*dxptr) (pTHX_ void*);
11297 /* Unions for circumventing strict ANSI C89 casting rules. */
11298 union { void *vptr; void (*dptr)(void*); } u1, u2;
11299 union { void *vptr; void (*dxptr)(pTHX_ void*); } u3, u4;
11301 Newz(54, nss, max, ANY);
11304 I32 i = POPINT(ss,ix);
11305 TOPINT(nss,ix) = i;
11307 case SAVEt_ITEM: /* normal string */
11308 sv = (SV*)POPPTR(ss,ix);
11309 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11310 sv = (SV*)POPPTR(ss,ix);
11311 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11313 case SAVEt_SV: /* scalar reference */
11314 sv = (SV*)POPPTR(ss,ix);
11315 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11316 gv = (GV*)POPPTR(ss,ix);
11317 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11319 case SAVEt_GENERIC_PVREF: /* generic char* */
11320 c = (char*)POPPTR(ss,ix);
11321 TOPPTR(nss,ix) = pv_dup(c);
11322 ptr = POPPTR(ss,ix);
11323 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11325 case SAVEt_SHARED_PVREF: /* char* in shared space */
11326 c = (char*)POPPTR(ss,ix);
11327 TOPPTR(nss,ix) = savesharedpv(c);
11328 ptr = POPPTR(ss,ix);
11329 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11331 case SAVEt_GENERIC_SVREF: /* generic sv */
11332 case SAVEt_SVREF: /* scalar reference */
11333 sv = (SV*)POPPTR(ss,ix);
11334 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11335 ptr = POPPTR(ss,ix);
11336 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11338 case SAVEt_AV: /* array reference */
11339 av = (AV*)POPPTR(ss,ix);
11340 TOPPTR(nss,ix) = av_dup_inc(av, param);
11341 gv = (GV*)POPPTR(ss,ix);
11342 TOPPTR(nss,ix) = gv_dup(gv, param);
11344 case SAVEt_HV: /* hash reference */
11345 hv = (HV*)POPPTR(ss,ix);
11346 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11347 gv = (GV*)POPPTR(ss,ix);
11348 TOPPTR(nss,ix) = gv_dup(gv, param);
11350 case SAVEt_INT: /* int reference */
11351 ptr = POPPTR(ss,ix);
11352 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11353 intval = (int)POPINT(ss,ix);
11354 TOPINT(nss,ix) = intval;
11356 case SAVEt_LONG: /* long reference */
11357 ptr = POPPTR(ss,ix);
11358 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11359 longval = (long)POPLONG(ss,ix);
11360 TOPLONG(nss,ix) = longval;
11362 case SAVEt_I32: /* I32 reference */
11363 case SAVEt_I16: /* I16 reference */
11364 case SAVEt_I8: /* I8 reference */
11365 ptr = POPPTR(ss,ix);
11366 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11368 TOPINT(nss,ix) = i;
11370 case SAVEt_IV: /* IV reference */
11371 ptr = POPPTR(ss,ix);
11372 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11374 TOPIV(nss,ix) = iv;
11376 case SAVEt_SPTR: /* SV* reference */
11377 ptr = POPPTR(ss,ix);
11378 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11379 sv = (SV*)POPPTR(ss,ix);
11380 TOPPTR(nss,ix) = sv_dup(sv, param);
11382 case SAVEt_VPTR: /* random* reference */
11383 ptr = POPPTR(ss,ix);
11384 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11385 ptr = POPPTR(ss,ix);
11386 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11388 case SAVEt_PPTR: /* char* reference */
11389 ptr = POPPTR(ss,ix);
11390 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11391 c = (char*)POPPTR(ss,ix);
11392 TOPPTR(nss,ix) = pv_dup(c);
11394 case SAVEt_HPTR: /* HV* reference */
11395 ptr = POPPTR(ss,ix);
11396 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11397 hv = (HV*)POPPTR(ss,ix);
11398 TOPPTR(nss,ix) = hv_dup(hv, param);
11400 case SAVEt_APTR: /* AV* reference */
11401 ptr = POPPTR(ss,ix);
11402 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11403 av = (AV*)POPPTR(ss,ix);
11404 TOPPTR(nss,ix) = av_dup(av, param);
11407 gv = (GV*)POPPTR(ss,ix);
11408 TOPPTR(nss,ix) = gv_dup(gv, param);
11410 case SAVEt_GP: /* scalar reference */
11411 gp = (GP*)POPPTR(ss,ix);
11412 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11413 (void)GpREFCNT_inc(gp);
11414 gv = (GV*)POPPTR(ss,ix);
11415 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11416 c = (char*)POPPTR(ss,ix);
11417 TOPPTR(nss,ix) = pv_dup(c);
11419 TOPIV(nss,ix) = iv;
11421 TOPIV(nss,ix) = iv;
11424 case SAVEt_MORTALIZESV:
11425 sv = (SV*)POPPTR(ss,ix);
11426 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11429 ptr = POPPTR(ss,ix);
11430 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11431 /* these are assumed to be refcounted properly */
11432 switch (((OP*)ptr)->op_type) {
11434 case OP_LEAVESUBLV:
11438 case OP_LEAVEWRITE:
11439 TOPPTR(nss,ix) = ptr;
11444 TOPPTR(nss,ix) = Nullop;
11449 TOPPTR(nss,ix) = Nullop;
11452 c = (char*)POPPTR(ss,ix);
11453 TOPPTR(nss,ix) = pv_dup_inc(c);
11455 case SAVEt_CLEARSV:
11456 longval = POPLONG(ss,ix);
11457 TOPLONG(nss,ix) = longval;
11460 hv = (HV*)POPPTR(ss,ix);
11461 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11462 c = (char*)POPPTR(ss,ix);
11463 TOPPTR(nss,ix) = pv_dup_inc(c);
11465 TOPINT(nss,ix) = i;
11467 case SAVEt_DESTRUCTOR:
11468 ptr = POPPTR(ss,ix);
11469 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11470 dptr = POPDPTR(ss,ix);
11472 u2.vptr = any_dup(u1.vptr, proto_perl);
11473 TOPDPTR(nss,ix) = u2.dptr;
11475 case SAVEt_DESTRUCTOR_X:
11476 ptr = POPPTR(ss,ix);
11477 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11478 dxptr = POPDXPTR(ss,ix);
11480 u4.vptr = any_dup(u3.vptr, proto_perl);;
11481 TOPDXPTR(nss,ix) = u4.dxptr;
11483 case SAVEt_REGCONTEXT:
11486 TOPINT(nss,ix) = i;
11489 case SAVEt_STACK_POS: /* Position on Perl stack */
11491 TOPINT(nss,ix) = i;
11493 case SAVEt_AELEM: /* array element */
11494 sv = (SV*)POPPTR(ss,ix);
11495 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11497 TOPINT(nss,ix) = i;
11498 av = (AV*)POPPTR(ss,ix);
11499 TOPPTR(nss,ix) = av_dup_inc(av, param);
11501 case SAVEt_HELEM: /* hash element */
11502 sv = (SV*)POPPTR(ss,ix);
11503 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11504 sv = (SV*)POPPTR(ss,ix);
11505 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11506 hv = (HV*)POPPTR(ss,ix);
11507 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11510 ptr = POPPTR(ss,ix);
11511 TOPPTR(nss,ix) = ptr;
11515 TOPINT(nss,ix) = i;
11517 case SAVEt_COMPPAD:
11518 av = (AV*)POPPTR(ss,ix);
11519 TOPPTR(nss,ix) = av_dup(av, param);
11522 longval = (long)POPLONG(ss,ix);
11523 TOPLONG(nss,ix) = longval;
11524 ptr = POPPTR(ss,ix);
11525 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11526 sv = (SV*)POPPTR(ss,ix);
11527 TOPPTR(nss,ix) = sv_dup(sv, param);
11530 ptr = POPPTR(ss,ix);
11531 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11532 longval = (long)POPBOOL(ss,ix);
11533 TOPBOOL(nss,ix) = (bool)longval;
11535 case SAVEt_SET_SVFLAGS:
11537 TOPINT(nss,ix) = i;
11539 TOPINT(nss,ix) = i;
11540 sv = (SV*)POPPTR(ss,ix);
11541 TOPPTR(nss,ix) = sv_dup(sv, param);
11544 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11552 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11553 * flag to the result. This is done for each stash before cloning starts,
11554 * so we know which stashes want their objects cloned */
11557 do_mark_cloneable_stash(pTHX_ SV *sv)
11559 const HEK *hvname = HvNAME_HEK((HV*)sv);
11561 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11562 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11563 if (cloner && GvCV(cloner)) {
11570 XPUSHs(sv_2mortal(newSVhek(hvname)));
11572 call_sv((SV*)GvCV(cloner), G_SCALAR);
11579 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11587 =for apidoc perl_clone
11589 Create and return a new interpreter by cloning the current one.
11591 perl_clone takes these flags as parameters:
11593 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11594 without it we only clone the data and zero the stacks,
11595 with it we copy the stacks and the new perl interpreter is
11596 ready to run at the exact same point as the previous one.
11597 The pseudo-fork code uses COPY_STACKS while the
11598 threads->new doesn't.
11600 CLONEf_KEEP_PTR_TABLE
11601 perl_clone keeps a ptr_table with the pointer of the old
11602 variable as a key and the new variable as a value,
11603 this allows it to check if something has been cloned and not
11604 clone it again but rather just use the value and increase the
11605 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11606 the ptr_table using the function
11607 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11608 reason to keep it around is if you want to dup some of your own
11609 variable who are outside the graph perl scans, example of this
11610 code is in threads.xs create
11613 This is a win32 thing, it is ignored on unix, it tells perls
11614 win32host code (which is c++) to clone itself, this is needed on
11615 win32 if you want to run two threads at the same time,
11616 if you just want to do some stuff in a separate perl interpreter
11617 and then throw it away and return to the original one,
11618 you don't need to do anything.
11623 /* XXX the above needs expanding by someone who actually understands it ! */
11624 EXTERN_C PerlInterpreter *
11625 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11628 perl_clone(PerlInterpreter *proto_perl, UV flags)
11631 #ifdef PERL_IMPLICIT_SYS
11633 /* perlhost.h so we need to call into it
11634 to clone the host, CPerlHost should have a c interface, sky */
11636 if (flags & CLONEf_CLONE_HOST) {
11637 return perl_clone_host(proto_perl,flags);
11639 return perl_clone_using(proto_perl, flags,
11641 proto_perl->IMemShared,
11642 proto_perl->IMemParse,
11644 proto_perl->IStdIO,
11648 proto_perl->IProc);
11652 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11653 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11654 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11655 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11656 struct IPerlDir* ipD, struct IPerlSock* ipS,
11657 struct IPerlProc* ipP)
11659 /* XXX many of the string copies here can be optimized if they're
11660 * constants; they need to be allocated as common memory and just
11661 * their pointers copied. */
11664 CLONE_PARAMS clone_params;
11665 CLONE_PARAMS* param = &clone_params;
11667 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11668 /* for each stash, determine whether its objects should be cloned */
11669 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11670 PERL_SET_THX(my_perl);
11673 Poison(my_perl, 1, PerlInterpreter);
11675 PL_curcop = (COP *)Nullop;
11679 PL_savestack_ix = 0;
11680 PL_savestack_max = -1;
11681 PL_sig_pending = 0;
11682 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11683 # else /* !DEBUGGING */
11684 Zero(my_perl, 1, PerlInterpreter);
11685 # endif /* DEBUGGING */
11687 /* host pointers */
11689 PL_MemShared = ipMS;
11690 PL_MemParse = ipMP;
11697 #else /* !PERL_IMPLICIT_SYS */
11699 CLONE_PARAMS clone_params;
11700 CLONE_PARAMS* param = &clone_params;
11701 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11702 /* for each stash, determine whether its objects should be cloned */
11703 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11704 PERL_SET_THX(my_perl);
11707 Poison(my_perl, 1, PerlInterpreter);
11709 PL_curcop = (COP *)Nullop;
11713 PL_savestack_ix = 0;
11714 PL_savestack_max = -1;
11715 PL_sig_pending = 0;
11716 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11717 # else /* !DEBUGGING */
11718 Zero(my_perl, 1, PerlInterpreter);
11719 # endif /* DEBUGGING */
11720 #endif /* PERL_IMPLICIT_SYS */
11721 param->flags = flags;
11722 param->proto_perl = proto_perl;
11725 PL_xnv_arenaroot = NULL;
11726 PL_xnv_root = NULL;
11727 PL_xpv_arenaroot = NULL;
11728 PL_xpv_root = NULL;
11729 PL_xpviv_arenaroot = NULL;
11730 PL_xpviv_root = NULL;
11731 PL_xpvnv_arenaroot = NULL;
11732 PL_xpvnv_root = NULL;
11733 PL_xpvcv_arenaroot = NULL;
11734 PL_xpvcv_root = NULL;
11735 PL_xpvav_arenaroot = NULL;
11736 PL_xpvav_root = NULL;
11737 PL_xpvhv_arenaroot = NULL;
11738 PL_xpvhv_root = NULL;
11739 PL_xpvmg_arenaroot = NULL;
11740 PL_xpvmg_root = NULL;
11741 PL_xpvgv_arenaroot = NULL;
11742 PL_xpvgv_root = NULL;
11743 PL_xpvlv_arenaroot = NULL;
11744 PL_xpvlv_root = NULL;
11745 PL_xpvbm_arenaroot = NULL;
11746 PL_xpvbm_root = NULL;
11747 PL_he_arenaroot = NULL;
11749 #if defined(USE_ITHREADS)
11750 PL_pte_arenaroot = NULL;
11751 PL_pte_root = NULL;
11753 PL_nice_chunk = NULL;
11754 PL_nice_chunk_size = 0;
11756 PL_sv_objcount = 0;
11757 PL_sv_root = Nullsv;
11758 PL_sv_arenaroot = Nullsv;
11760 PL_debug = proto_perl->Idebug;
11762 PL_hash_seed = proto_perl->Ihash_seed;
11763 PL_rehash_seed = proto_perl->Irehash_seed;
11765 #ifdef USE_REENTRANT_API
11766 /* XXX: things like -Dm will segfault here in perlio, but doing
11767 * PERL_SET_CONTEXT(proto_perl);
11768 * breaks too many other things
11770 Perl_reentrant_init(aTHX);
11773 /* create SV map for pointer relocation */
11774 PL_ptr_table = ptr_table_new();
11775 /* and one for finding shared hash keys quickly */
11776 PL_shared_hek_table = ptr_table_new();
11778 /* initialize these special pointers as early as possible */
11779 SvANY(&PL_sv_undef) = NULL;
11780 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11781 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11782 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11784 SvANY(&PL_sv_no) = new_XPVNV();
11785 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11786 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11787 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11788 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11789 SvCUR_set(&PL_sv_no, 0);
11790 SvLEN_set(&PL_sv_no, 1);
11791 SvIV_set(&PL_sv_no, 0);
11792 SvNV_set(&PL_sv_no, 0);
11793 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11795 SvANY(&PL_sv_yes) = new_XPVNV();
11796 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11797 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11798 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11799 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11800 SvCUR_set(&PL_sv_yes, 1);
11801 SvLEN_set(&PL_sv_yes, 2);
11802 SvIV_set(&PL_sv_yes, 1);
11803 SvNV_set(&PL_sv_yes, 1);
11804 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11806 /* create (a non-shared!) shared string table */
11807 PL_strtab = newHV();
11808 HvSHAREKEYS_off(PL_strtab);
11809 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11810 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11812 PL_compiling = proto_perl->Icompiling;
11814 /* These two PVs will be free'd special way so must set them same way op.c does */
11815 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11816 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11818 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11819 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11821 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11822 if (!specialWARN(PL_compiling.cop_warnings))
11823 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11824 if (!specialCopIO(PL_compiling.cop_io))
11825 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11826 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11828 /* pseudo environmental stuff */
11829 PL_origargc = proto_perl->Iorigargc;
11830 PL_origargv = proto_perl->Iorigargv;
11832 param->stashes = newAV(); /* Setup array of objects to call clone on */
11834 #ifdef PERLIO_LAYERS
11835 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11836 PerlIO_clone(aTHX_ proto_perl, param);
11839 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11840 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11841 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11842 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11843 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11844 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11847 PL_minus_c = proto_perl->Iminus_c;
11848 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11849 PL_localpatches = proto_perl->Ilocalpatches;
11850 PL_splitstr = proto_perl->Isplitstr;
11851 PL_preprocess = proto_perl->Ipreprocess;
11852 PL_minus_n = proto_perl->Iminus_n;
11853 PL_minus_p = proto_perl->Iminus_p;
11854 PL_minus_l = proto_perl->Iminus_l;
11855 PL_minus_a = proto_perl->Iminus_a;
11856 PL_minus_F = proto_perl->Iminus_F;
11857 PL_doswitches = proto_perl->Idoswitches;
11858 PL_dowarn = proto_perl->Idowarn;
11859 PL_doextract = proto_perl->Idoextract;
11860 PL_sawampersand = proto_perl->Isawampersand;
11861 PL_unsafe = proto_perl->Iunsafe;
11862 PL_inplace = SAVEPV(proto_perl->Iinplace);
11863 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11864 PL_perldb = proto_perl->Iperldb;
11865 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11866 PL_exit_flags = proto_perl->Iexit_flags;
11868 /* magical thingies */
11869 /* XXX time(&PL_basetime) when asked for? */
11870 PL_basetime = proto_perl->Ibasetime;
11871 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11873 PL_maxsysfd = proto_perl->Imaxsysfd;
11874 PL_multiline = proto_perl->Imultiline;
11875 PL_statusvalue = proto_perl->Istatusvalue;
11877 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11879 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11881 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11882 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11883 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11885 /* Clone the regex array */
11886 PL_regex_padav = newAV();
11888 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11889 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11891 av_push(PL_regex_padav,
11892 sv_dup_inc(regexen[0],param));
11893 for(i = 1; i <= len; i++) {
11894 if(SvREPADTMP(regexen[i])) {
11895 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11897 av_push(PL_regex_padav,
11899 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11900 SvIVX(regexen[i])), param)))
11905 PL_regex_pad = AvARRAY(PL_regex_padav);
11907 /* shortcuts to various I/O objects */
11908 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11909 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11910 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11911 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11912 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11913 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11915 /* shortcuts to regexp stuff */
11916 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11918 /* shortcuts to misc objects */
11919 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11921 /* shortcuts to debugging objects */
11922 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11923 PL_DBline = gv_dup(proto_perl->IDBline, param);
11924 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11925 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11926 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11927 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11928 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11929 PL_lineary = av_dup(proto_perl->Ilineary, param);
11930 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11932 /* symbol tables */
11933 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11934 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11935 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11936 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11937 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11939 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11940 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11941 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11942 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11943 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11944 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11946 PL_sub_generation = proto_perl->Isub_generation;
11948 /* funky return mechanisms */
11949 PL_forkprocess = proto_perl->Iforkprocess;
11951 /* subprocess state */
11952 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11954 /* internal state */
11955 PL_tainting = proto_perl->Itainting;
11956 PL_taint_warn = proto_perl->Itaint_warn;
11957 PL_maxo = proto_perl->Imaxo;
11958 if (proto_perl->Iop_mask)
11959 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11961 PL_op_mask = Nullch;
11962 /* PL_asserting = proto_perl->Iasserting; */
11964 /* current interpreter roots */
11965 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11966 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11967 PL_main_start = proto_perl->Imain_start;
11968 PL_eval_root = proto_perl->Ieval_root;
11969 PL_eval_start = proto_perl->Ieval_start;
11971 /* runtime control stuff */
11972 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11973 PL_copline = proto_perl->Icopline;
11975 PL_filemode = proto_perl->Ifilemode;
11976 PL_lastfd = proto_perl->Ilastfd;
11977 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11980 PL_gensym = proto_perl->Igensym;
11981 PL_preambled = proto_perl->Ipreambled;
11982 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11983 PL_laststatval = proto_perl->Ilaststatval;
11984 PL_laststype = proto_perl->Ilaststype;
11985 PL_mess_sv = Nullsv;
11987 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11988 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11990 /* interpreter atexit processing */
11991 PL_exitlistlen = proto_perl->Iexitlistlen;
11992 if (PL_exitlistlen) {
11993 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11994 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11997 PL_exitlist = (PerlExitListEntry*)NULL;
11998 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11999 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
12000 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
12002 PL_profiledata = NULL;
12003 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
12004 /* PL_rsfp_filters entries have fake IoDIRP() */
12005 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
12007 PL_compcv = cv_dup(proto_perl->Icompcv, param);
12009 PAD_CLONE_VARS(proto_perl, param);
12011 #ifdef HAVE_INTERP_INTERN
12012 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
12015 /* more statics moved here */
12016 PL_generation = proto_perl->Igeneration;
12017 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
12019 PL_in_clean_objs = proto_perl->Iin_clean_objs;
12020 PL_in_clean_all = proto_perl->Iin_clean_all;
12022 PL_uid = proto_perl->Iuid;
12023 PL_euid = proto_perl->Ieuid;
12024 PL_gid = proto_perl->Igid;
12025 PL_egid = proto_perl->Iegid;
12026 PL_nomemok = proto_perl->Inomemok;
12027 PL_an = proto_perl->Ian;
12028 PL_evalseq = proto_perl->Ievalseq;
12029 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
12030 PL_origalen = proto_perl->Iorigalen;
12031 PL_pidstatus = newHV(); /* XXX flag for cloning? */
12032 PL_osname = SAVEPV(proto_perl->Iosname);
12033 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
12034 PL_sighandlerp = proto_perl->Isighandlerp;
12037 PL_runops = proto_perl->Irunops;
12039 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
12042 PL_cshlen = proto_perl->Icshlen;
12043 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
12046 PL_lex_state = proto_perl->Ilex_state;
12047 PL_lex_defer = proto_perl->Ilex_defer;
12048 PL_lex_expect = proto_perl->Ilex_expect;
12049 PL_lex_formbrack = proto_perl->Ilex_formbrack;
12050 PL_lex_dojoin = proto_perl->Ilex_dojoin;
12051 PL_lex_starts = proto_perl->Ilex_starts;
12052 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
12053 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
12054 PL_lex_op = proto_perl->Ilex_op;
12055 PL_lex_inpat = proto_perl->Ilex_inpat;
12056 PL_lex_inwhat = proto_perl->Ilex_inwhat;
12057 PL_lex_brackets = proto_perl->Ilex_brackets;
12058 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
12059 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
12060 PL_lex_casemods = proto_perl->Ilex_casemods;
12061 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
12062 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
12064 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
12065 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
12066 PL_nexttoke = proto_perl->Inexttoke;
12068 /* XXX This is probably masking the deeper issue of why
12069 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
12070 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
12071 * (A little debugging with a watchpoint on it may help.)
12073 if (SvANY(proto_perl->Ilinestr)) {
12074 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
12075 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
12076 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12077 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
12078 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12079 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
12080 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12081 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
12082 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12085 PL_linestr = NEWSV(65,79);
12086 sv_upgrade(PL_linestr,SVt_PVIV);
12087 sv_setpvn(PL_linestr,"",0);
12088 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
12090 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12091 PL_pending_ident = proto_perl->Ipending_ident;
12092 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
12094 PL_expect = proto_perl->Iexpect;
12096 PL_multi_start = proto_perl->Imulti_start;
12097 PL_multi_end = proto_perl->Imulti_end;
12098 PL_multi_open = proto_perl->Imulti_open;
12099 PL_multi_close = proto_perl->Imulti_close;
12101 PL_error_count = proto_perl->Ierror_count;
12102 PL_subline = proto_perl->Isubline;
12103 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
12105 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
12106 if (SvANY(proto_perl->Ilinestr)) {
12107 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
12108 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12109 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
12110 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12111 PL_last_lop_op = proto_perl->Ilast_lop_op;
12114 PL_last_uni = SvPVX(PL_linestr);
12115 PL_last_lop = SvPVX(PL_linestr);
12116 PL_last_lop_op = 0;
12118 PL_in_my = proto_perl->Iin_my;
12119 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12121 PL_cryptseen = proto_perl->Icryptseen;
12124 PL_hints = proto_perl->Ihints;
12126 PL_amagic_generation = proto_perl->Iamagic_generation;
12128 #ifdef USE_LOCALE_COLLATE
12129 PL_collation_ix = proto_perl->Icollation_ix;
12130 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12131 PL_collation_standard = proto_perl->Icollation_standard;
12132 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12133 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12134 #endif /* USE_LOCALE_COLLATE */
12136 #ifdef USE_LOCALE_NUMERIC
12137 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12138 PL_numeric_standard = proto_perl->Inumeric_standard;
12139 PL_numeric_local = proto_perl->Inumeric_local;
12140 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12141 #endif /* !USE_LOCALE_NUMERIC */
12143 /* utf8 character classes */
12144 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12145 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12146 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12147 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12148 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12149 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12150 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12151 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12152 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12153 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12154 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12155 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12156 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12157 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12158 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12159 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12160 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12161 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12162 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12163 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12165 /* Did the locale setup indicate UTF-8? */
12166 PL_utf8locale = proto_perl->Iutf8locale;
12167 /* Unicode features (see perlrun/-C) */
12168 PL_unicode = proto_perl->Iunicode;
12170 /* Pre-5.8 signals control */
12171 PL_signals = proto_perl->Isignals;
12173 /* times() ticks per second */
12174 PL_clocktick = proto_perl->Iclocktick;
12176 /* Recursion stopper for PerlIO_find_layer */
12177 PL_in_load_module = proto_perl->Iin_load_module;
12179 /* sort() routine */
12180 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12182 /* Not really needed/useful since the reenrant_retint is "volatile",
12183 * but do it for consistency's sake. */
12184 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12186 /* Hooks to shared SVs and locks. */
12187 PL_sharehook = proto_perl->Isharehook;
12188 PL_lockhook = proto_perl->Ilockhook;
12189 PL_unlockhook = proto_perl->Iunlockhook;
12190 PL_threadhook = proto_perl->Ithreadhook;
12192 PL_runops_std = proto_perl->Irunops_std;
12193 PL_runops_dbg = proto_perl->Irunops_dbg;
12195 #ifdef THREADS_HAVE_PIDS
12196 PL_ppid = proto_perl->Ippid;
12200 PL_last_swash_hv = Nullhv; /* reinits on demand */
12201 PL_last_swash_klen = 0;
12202 PL_last_swash_key[0]= '\0';
12203 PL_last_swash_tmps = (U8*)NULL;
12204 PL_last_swash_slen = 0;
12206 PL_glob_index = proto_perl->Iglob_index;
12207 PL_srand_called = proto_perl->Isrand_called;
12208 PL_uudmap['M'] = 0; /* reinits on demand */
12209 PL_bitcount = Nullch; /* reinits on demand */
12211 if (proto_perl->Ipsig_pend) {
12212 Newz(0, PL_psig_pend, SIG_SIZE, int);
12215 PL_psig_pend = (int*)NULL;
12218 if (proto_perl->Ipsig_ptr) {
12219 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12220 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12221 for (i = 1; i < SIG_SIZE; i++) {
12222 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12223 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12227 PL_psig_ptr = (SV**)NULL;
12228 PL_psig_name = (SV**)NULL;
12231 /* thrdvar.h stuff */
12233 if (flags & CLONEf_COPY_STACKS) {
12234 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12235 PL_tmps_ix = proto_perl->Ttmps_ix;
12236 PL_tmps_max = proto_perl->Ttmps_max;
12237 PL_tmps_floor = proto_perl->Ttmps_floor;
12238 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12240 while (i <= PL_tmps_ix) {
12241 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12245 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12246 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12247 Newz(54, PL_markstack, i, I32);
12248 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12249 - proto_perl->Tmarkstack);
12250 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12251 - proto_perl->Tmarkstack);
12252 Copy(proto_perl->Tmarkstack, PL_markstack,
12253 PL_markstack_ptr - PL_markstack + 1, I32);
12255 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12256 * NOTE: unlike the others! */
12257 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12258 PL_scopestack_max = proto_perl->Tscopestack_max;
12259 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12260 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12262 /* NOTE: si_dup() looks at PL_markstack */
12263 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12265 /* PL_curstack = PL_curstackinfo->si_stack; */
12266 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12267 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12269 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12270 PL_stack_base = AvARRAY(PL_curstack);
12271 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12272 - proto_perl->Tstack_base);
12273 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12275 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12276 * NOTE: unlike the others! */
12277 PL_savestack_ix = proto_perl->Tsavestack_ix;
12278 PL_savestack_max = proto_perl->Tsavestack_max;
12279 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12280 PL_savestack = ss_dup(proto_perl, param);
12284 ENTER; /* perl_destruct() wants to LEAVE; */
12287 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12288 PL_top_env = &PL_start_env;
12290 PL_op = proto_perl->Top;
12293 PL_Xpv = (XPV*)NULL;
12294 PL_na = proto_perl->Tna;
12296 PL_statbuf = proto_perl->Tstatbuf;
12297 PL_statcache = proto_perl->Tstatcache;
12298 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12299 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12301 PL_timesbuf = proto_perl->Ttimesbuf;
12304 PL_tainted = proto_perl->Ttainted;
12305 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12306 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12307 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12308 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12309 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12310 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12311 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12312 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12313 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12315 PL_restartop = proto_perl->Trestartop;
12316 PL_in_eval = proto_perl->Tin_eval;
12317 PL_delaymagic = proto_perl->Tdelaymagic;
12318 PL_dirty = proto_perl->Tdirty;
12319 PL_localizing = proto_perl->Tlocalizing;
12321 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12322 PL_hv_fetch_ent_mh = Nullhe;
12323 PL_modcount = proto_perl->Tmodcount;
12324 PL_lastgotoprobe = Nullop;
12325 PL_dumpindent = proto_perl->Tdumpindent;
12327 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12328 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12329 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12330 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12331 PL_sortcxix = proto_perl->Tsortcxix;
12332 PL_efloatbuf = Nullch; /* reinits on demand */
12333 PL_efloatsize = 0; /* reinits on demand */
12337 PL_screamfirst = NULL;
12338 PL_screamnext = NULL;
12339 PL_maxscream = -1; /* reinits on demand */
12340 PL_lastscream = Nullsv;
12342 PL_watchaddr = NULL;
12343 PL_watchok = Nullch;
12345 PL_regdummy = proto_perl->Tregdummy;
12346 PL_regprecomp = Nullch;
12349 PL_colorset = 0; /* reinits PL_colors[] */
12350 /*PL_colors[6] = {0,0,0,0,0,0};*/
12351 PL_reginput = Nullch;
12352 PL_regbol = Nullch;
12353 PL_regeol = Nullch;
12354 PL_regstartp = (I32*)NULL;
12355 PL_regendp = (I32*)NULL;
12356 PL_reglastparen = (U32*)NULL;
12357 PL_reglastcloseparen = (U32*)NULL;
12358 PL_regtill = Nullch;
12359 PL_reg_start_tmp = (char**)NULL;
12360 PL_reg_start_tmpl = 0;
12361 PL_regdata = (struct reg_data*)NULL;
12364 PL_reg_eval_set = 0;
12366 PL_regprogram = (regnode*)NULL;
12368 PL_regcc = (CURCUR*)NULL;
12369 PL_reg_call_cc = (struct re_cc_state*)NULL;
12370 PL_reg_re = (regexp*)NULL;
12371 PL_reg_ganch = Nullch;
12372 PL_reg_sv = Nullsv;
12373 PL_reg_match_utf8 = FALSE;
12374 PL_reg_magic = (MAGIC*)NULL;
12376 PL_reg_oldcurpm = (PMOP*)NULL;
12377 PL_reg_curpm = (PMOP*)NULL;
12378 PL_reg_oldsaved = Nullch;
12379 PL_reg_oldsavedlen = 0;
12380 #ifdef PERL_COPY_ON_WRITE
12383 PL_reg_maxiter = 0;
12384 PL_reg_leftiter = 0;
12385 PL_reg_poscache = Nullch;
12386 PL_reg_poscache_size= 0;
12388 /* RE engine - function pointers */
12389 PL_regcompp = proto_perl->Tregcompp;
12390 PL_regexecp = proto_perl->Tregexecp;
12391 PL_regint_start = proto_perl->Tregint_start;
12392 PL_regint_string = proto_perl->Tregint_string;
12393 PL_regfree = proto_perl->Tregfree;
12395 PL_reginterp_cnt = 0;
12396 PL_reg_starttry = 0;
12398 /* Pluggable optimizer */
12399 PL_peepp = proto_perl->Tpeepp;
12401 PL_stashcache = newHV();
12403 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12404 ptr_table_free(PL_ptr_table);
12405 PL_ptr_table = NULL;
12406 ptr_table_free(PL_shared_hek_table);
12407 PL_shared_hek_table = NULL;
12410 /* Call the ->CLONE method, if it exists, for each of the stashes
12411 identified by sv_dup() above.
12413 while(av_len(param->stashes) != -1) {
12414 HV* stash = (HV*) av_shift(param->stashes);
12415 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12416 if (cloner && GvCV(cloner)) {
12421 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
12423 call_sv((SV*)GvCV(cloner), G_DISCARD);
12429 SvREFCNT_dec(param->stashes);
12431 /* orphaned? eg threads->new inside BEGIN or use */
12432 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12433 (void)SvREFCNT_inc(PL_compcv);
12434 SAVEFREESV(PL_compcv);
12440 #endif /* USE_ITHREADS */
12443 =head1 Unicode Support
12445 =for apidoc sv_recode_to_utf8
12447 The encoding is assumed to be an Encode object, on entry the PV
12448 of the sv is assumed to be octets in that encoding, and the sv
12449 will be converted into Unicode (and UTF-8).
12451 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12452 is not a reference, nothing is done to the sv. If the encoding is not
12453 an C<Encode::XS> Encoding object, bad things will happen.
12454 (See F<lib/encoding.pm> and L<Encode>).
12456 The PV of the sv is returned.
12461 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12464 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12478 Passing sv_yes is wrong - it needs to be or'ed set of constants
12479 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12480 remove converted chars from source.
12482 Both will default the value - let them.
12484 XPUSHs(&PL_sv_yes);
12487 call_method("decode", G_SCALAR);
12491 s = SvPV(uni, len);
12492 if (s != SvPVX_const(sv)) {
12493 SvGROW(sv, len + 1);
12494 Move(s, SvPVX_const(sv), len, char);
12495 SvCUR_set(sv, len);
12496 SvPVX(sv)[len] = 0;
12503 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12507 =for apidoc sv_cat_decode
12509 The encoding is assumed to be an Encode object, the PV of the ssv is
12510 assumed to be octets in that encoding and decoding the input starts
12511 from the position which (PV + *offset) pointed to. The dsv will be
12512 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12513 when the string tstr appears in decoding output or the input ends on
12514 the PV of the ssv. The value which the offset points will be modified
12515 to the last input position on the ssv.
12517 Returns TRUE if the terminator was found, else returns FALSE.
12522 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12523 SV *ssv, int *offset, char *tstr, int tlen)
12527 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12538 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12539 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12541 call_method("cat_decode", G_SCALAR);
12543 ret = SvTRUE(TOPs);
12544 *offset = SvIV(offsv);
12550 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12556 * c-indentation-style: bsd
12557 * c-basic-offset: 4
12558 * indent-tabs-mode: t
12561 * ex: set ts=8 sts=4 sw=4 noet: