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);
537 Safefree((void *)sva);
540 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
541 arenanext = *(void **)arena;
544 PL_xnv_arenaroot = 0;
547 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
548 arenanext = *(void **)arena;
551 PL_xpv_arenaroot = 0;
554 for (arena = PL_xpviv_arenaroot; arena; arena = arenanext) {
555 arenanext = *(void **)arena;
558 PL_xpviv_arenaroot = 0;
561 for (arena = PL_xpvnv_arenaroot; arena; arena = arenanext) {
562 arenanext = *(void **)arena;
565 PL_xpvnv_arenaroot = 0;
568 for (arena = PL_xpvcv_arenaroot; arena; arena = arenanext) {
569 arenanext = *(void **)arena;
572 PL_xpvcv_arenaroot = 0;
575 for (arena = PL_xpvav_arenaroot; arena; arena = arenanext) {
576 arenanext = *(void **)arena;
579 PL_xpvav_arenaroot = 0;
582 for (arena = PL_xpvhv_arenaroot; arena; arena = arenanext) {
583 arenanext = *(void **)arena;
586 PL_xpvhv_arenaroot = 0;
589 for (arena = PL_xpvmg_arenaroot; arena; arena = arenanext) {
590 arenanext = *(void **)arena;
593 PL_xpvmg_arenaroot = 0;
596 for (arena = PL_xpvgv_arenaroot; arena; arena = arenanext) {
597 arenanext = *(void **)arena;
600 PL_xpvgv_arenaroot = 0;
603 for (arena = PL_xpvlv_arenaroot; arena; arena = arenanext) {
604 arenanext = *(void **)arena;
607 PL_xpvlv_arenaroot = 0;
610 for (arena = PL_xpvbm_arenaroot; arena; arena = arenanext) {
611 arenanext = *(void **)arena;
614 PL_xpvbm_arenaroot = 0;
620 for (he = PL_he_arenaroot; he; he = he_next) {
621 he_next = HeNEXT(he);
628 #if defined(USE_ITHREADS)
630 struct ptr_tbl_ent *pte;
631 struct ptr_tbl_ent *pte_next;
632 for (pte = PL_pte_arenaroot; pte; pte = pte_next) {
633 pte_next = pte->next;
637 PL_pte_arenaroot = 0;
642 Safefree(PL_nice_chunk);
643 PL_nice_chunk = Nullch;
644 PL_nice_chunk_size = 0;
649 /* ---------------------------------------------------------------------
651 * support functions for report_uninit()
654 /* the maxiumum size of array or hash where we will scan looking
655 * for the undefined element that triggered the warning */
657 #define FUV_MAX_SEARCH_SIZE 1000
659 /* Look for an entry in the hash whose value has the same SV as val;
660 * If so, return a mortal copy of the key. */
663 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
669 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
670 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
675 for (i=HvMAX(hv); i>0; i--) {
677 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
678 if (HeVAL(entry) != val)
680 if ( HeVAL(entry) == &PL_sv_undef ||
681 HeVAL(entry) == &PL_sv_placeholder)
685 if (HeKLEN(entry) == HEf_SVKEY)
686 return sv_mortalcopy(HeKEY_sv(entry));
687 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
693 /* Look for an entry in the array whose value has the same SV as val;
694 * If so, return the index, otherwise return -1. */
697 S_find_array_subscript(pTHX_ AV *av, SV* val)
701 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
702 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
706 for (i=AvFILLp(av); i>=0; i--) {
707 if (svp[i] == val && svp[i] != &PL_sv_undef)
713 /* S_varname(): return the name of a variable, optionally with a subscript.
714 * If gv is non-zero, use the name of that global, along with gvtype (one
715 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
716 * targ. Depending on the value of the subscript_type flag, return:
719 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
720 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
721 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
722 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
725 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
726 SV* keyname, I32 aindex, int subscript_type)
731 SV * const name = sv_newmortal();
734 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
735 * XXX get rid of all this if gv_fullnameX() ever supports this
739 HV *hv = GvSTASH(gv);
740 sv_setpv(name, gvtype);
743 else if (!(p=HvNAME_get(hv)))
745 if (strNE(p, "main")) {
747 sv_catpvn(name,"::", 2);
749 if (GvNAMELEN(gv)>= 1 &&
750 ((unsigned int)*GvNAME(gv)) <= 26)
752 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
753 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
756 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
760 CV *cv = find_runcv(&u);
761 if (!cv || !CvPADLIST(cv))
763 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
764 sv = *av_fetch(av, targ, FALSE);
765 /* SvLEN in a pad name is not to be trusted */
766 sv_setpv(name, SvPV_nolen(sv));
769 if (subscript_type == FUV_SUBSCRIPT_HASH) {
772 Perl_sv_catpvf(aTHX_ name, "{%s}",
773 pv_display(sv,SvPVX(keyname), SvCUR(keyname), 0, 32));
776 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
778 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
780 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
781 sv_insert(name, 0, 0, "within ", 7);
788 =for apidoc find_uninit_var
790 Find the name of the undefined variable (if any) that caused the operator o
791 to issue a "Use of uninitialized value" warning.
792 If match is true, only return a name if it's value matches uninit_sv.
793 So roughly speaking, if a unary operator (such as OP_COS) generates a
794 warning, then following the direct child of the op may yield an
795 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
796 other hand, with OP_ADD there are two branches to follow, so we only print
797 the variable name if we get an exact match.
799 The name is returned as a mortal SV.
801 Assumes that PL_op is the op that originally triggered the error, and that
802 PL_comppad/PL_curpad points to the currently executing pad.
808 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
817 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
818 uninit_sv == &PL_sv_placeholder)))
821 switch (obase->op_type) {
828 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
829 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
832 int subscript_type = FUV_SUBSCRIPT_WITHIN;
834 if (pad) { /* @lex, %lex */
835 sv = PAD_SVl(obase->op_targ);
839 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
840 /* @global, %global */
841 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
844 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
846 else /* @{expr}, %{expr} */
847 return find_uninit_var(cUNOPx(obase)->op_first,
851 /* attempt to find a match within the aggregate */
853 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
855 subscript_type = FUV_SUBSCRIPT_HASH;
858 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
860 subscript_type = FUV_SUBSCRIPT_ARRAY;
863 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
866 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
867 keysv, index, subscript_type);
871 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
873 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
874 Nullsv, 0, FUV_SUBSCRIPT_NONE);
877 gv = cGVOPx_gv(obase);
878 if (!gv || (match && GvSV(gv) != uninit_sv))
880 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
883 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
885 av = (AV*)PAD_SV(obase->op_targ);
886 if (!av || SvRMAGICAL(av))
888 svp = av_fetch(av, (I32)obase->op_private, FALSE);
889 if (!svp || *svp != uninit_sv)
892 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
893 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
896 gv = cGVOPx_gv(obase);
901 if (!av || SvRMAGICAL(av))
903 svp = av_fetch(av, (I32)obase->op_private, FALSE);
904 if (!svp || *svp != uninit_sv)
907 return S_varname(aTHX_ gv, "$", 0,
908 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
913 o = cUNOPx(obase)->op_first;
914 if (!o || o->op_type != OP_NULL ||
915 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
917 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
922 /* $a[uninit_expr] or $h{uninit_expr} */
923 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
926 o = cBINOPx(obase)->op_first;
927 kid = cBINOPx(obase)->op_last;
929 /* get the av or hv, and optionally the gv */
931 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
932 sv = PAD_SV(o->op_targ);
934 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
935 && cUNOPo->op_first->op_type == OP_GV)
937 gv = cGVOPx_gv(cUNOPo->op_first);
940 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
945 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
946 /* index is constant */
950 if (obase->op_type == OP_HELEM) {
951 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
952 if (!he || HeVAL(he) != uninit_sv)
956 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
957 if (!svp || *svp != uninit_sv)
961 if (obase->op_type == OP_HELEM)
962 return S_varname(aTHX_ gv, "%", o->op_targ,
963 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
965 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
966 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
970 /* index is an expression;
971 * attempt to find a match within the aggregate */
972 if (obase->op_type == OP_HELEM) {
973 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
975 return S_varname(aTHX_ gv, "%", o->op_targ,
976 keysv, 0, FUV_SUBSCRIPT_HASH);
979 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
981 return S_varname(aTHX_ gv, "@", o->op_targ,
982 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
986 return S_varname(aTHX_ gv,
987 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
989 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
995 /* only examine RHS */
996 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
999 o = cUNOPx(obase)->op_first;
1000 if (o->op_type == OP_PUSHMARK)
1003 if (!o->op_sibling) {
1004 /* one-arg version of open is highly magical */
1006 if (o->op_type == OP_GV) { /* open FOO; */
1008 if (match && GvSV(gv) != uninit_sv)
1010 return S_varname(aTHX_ gv, "$", 0,
1011 Nullsv, 0, FUV_SUBSCRIPT_NONE);
1013 /* other possibilities not handled are:
1014 * open $x; or open my $x; should return '${*$x}'
1015 * open expr; should return '$'.expr ideally
1021 /* ops where $_ may be an implicit arg */
1025 if ( !(obase->op_flags & OPf_STACKED)) {
1026 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1027 ? PAD_SVl(obase->op_targ)
1030 sv = sv_newmortal();
1039 /* skip filehandle as it can't produce 'undef' warning */
1040 o = cUNOPx(obase)->op_first;
1041 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1042 o = o->op_sibling->op_sibling;
1049 match = 1; /* XS or custom code could trigger random warnings */
1054 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1055 return sv_2mortal(newSVpv("${$/}", 0));
1060 if (!(obase->op_flags & OPf_KIDS))
1062 o = cUNOPx(obase)->op_first;
1068 /* if all except one arg are constant, or have no side-effects,
1069 * or are optimized away, then it's unambiguous */
1071 for (kid=o; kid; kid = kid->op_sibling) {
1073 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1074 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1075 || (kid->op_type == OP_PUSHMARK)
1079 if (o2) { /* more than one found */
1086 return find_uninit_var(o2, uninit_sv, match);
1090 sv = find_uninit_var(o, uninit_sv, 1);
1102 =for apidoc report_uninit
1104 Print appropriate "Use of uninitialized variable" warning
1110 Perl_report_uninit(pTHX_ SV* uninit_sv)
1113 SV* varname = Nullsv;
1115 varname = find_uninit_var(PL_op, uninit_sv,0);
1117 sv_insert(varname, 0, 0, " ", 1);
1119 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1120 varname ? SvPV_nolen(varname) : "",
1121 " in ", OP_DESC(PL_op));
1124 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1128 /* allocate another arena's worth of NV bodies */
1136 New(711, ptr, PERL_ARENA_SIZE/sizeof(NV), NV);
1137 *((void **) ptr) = (void *)PL_xnv_arenaroot;
1138 PL_xnv_arenaroot = ptr;
1141 xnvend = &xnv[PERL_ARENA_SIZE / sizeof(NV) - 1];
1142 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1144 while (xnv < xnvend) {
1145 *(NV**)xnv = (NV*)(xnv + 1);
1151 /* allocate another arena's worth of struct xpv */
1157 xpv_allocated* xpvend;
1158 New(713, xpv, PERL_ARENA_SIZE/sizeof(xpv_allocated), xpv_allocated);
1159 *((xpv_allocated**)xpv) = PL_xpv_arenaroot;
1160 PL_xpv_arenaroot = xpv;
1162 xpvend = &xpv[PERL_ARENA_SIZE / sizeof(xpv_allocated) - 1];
1163 PL_xpv_root = ++xpv;
1164 while (xpv < xpvend) {
1165 *((xpv_allocated**)xpv) = xpv + 1;
1168 *((xpv_allocated**)xpv) = 0;
1171 /* allocate another arena's worth of struct xpviv */
1176 xpviv_allocated* xpviv;
1177 xpviv_allocated* xpvivend;
1178 New(713, xpviv, PERL_ARENA_SIZE/sizeof(xpviv_allocated), xpviv_allocated);
1179 *((xpviv_allocated**)xpviv) = PL_xpviv_arenaroot;
1180 PL_xpviv_arenaroot = xpviv;
1182 xpvivend = &xpviv[PERL_ARENA_SIZE / sizeof(xpviv_allocated) - 1];
1183 PL_xpviv_root = ++xpviv;
1184 while (xpviv < xpvivend) {
1185 *((xpviv_allocated**)xpviv) = xpviv + 1;
1188 *((xpviv_allocated**)xpviv) = 0;
1191 /* allocate another arena's worth of struct xpvnv */
1198 New(715, xpvnv, PERL_ARENA_SIZE/sizeof(XPVNV), XPVNV);
1199 *((XPVNV**)xpvnv) = PL_xpvnv_arenaroot;
1200 PL_xpvnv_arenaroot = xpvnv;
1202 xpvnvend = &xpvnv[PERL_ARENA_SIZE / sizeof(XPVNV) - 1];
1203 PL_xpvnv_root = ++xpvnv;
1204 while (xpvnv < xpvnvend) {
1205 *((XPVNV**)xpvnv) = xpvnv + 1;
1208 *((XPVNV**)xpvnv) = 0;
1211 /* allocate another arena's worth of struct xpvcv */
1218 New(716, xpvcv, PERL_ARENA_SIZE/sizeof(XPVCV), XPVCV);
1219 *((XPVCV**)xpvcv) = PL_xpvcv_arenaroot;
1220 PL_xpvcv_arenaroot = xpvcv;
1222 xpvcvend = &xpvcv[PERL_ARENA_SIZE / sizeof(XPVCV) - 1];
1223 PL_xpvcv_root = ++xpvcv;
1224 while (xpvcv < xpvcvend) {
1225 *((XPVCV**)xpvcv) = xpvcv + 1;
1228 *((XPVCV**)xpvcv) = 0;
1231 /* allocate another arena's worth of struct xpvav */
1236 xpvav_allocated* xpvav;
1237 xpvav_allocated* xpvavend;
1238 New(717, xpvav, PERL_ARENA_SIZE/sizeof(xpvav_allocated),
1240 *((xpvav_allocated**)xpvav) = PL_xpvav_arenaroot;
1241 PL_xpvav_arenaroot = xpvav;
1243 xpvavend = &xpvav[PERL_ARENA_SIZE / sizeof(xpvav_allocated) - 1];
1244 PL_xpvav_root = ++xpvav;
1245 while (xpvav < xpvavend) {
1246 *((xpvav_allocated**)xpvav) = xpvav + 1;
1249 *((xpvav_allocated**)xpvav) = 0;
1252 /* allocate another arena's worth of struct xpvhv */
1257 xpvhv_allocated* xpvhv;
1258 xpvhv_allocated* xpvhvend;
1259 New(718, xpvhv, PERL_ARENA_SIZE/sizeof(xpvhv_allocated),
1261 *((xpvhv_allocated**)xpvhv) = PL_xpvhv_arenaroot;
1262 PL_xpvhv_arenaroot = xpvhv;
1264 xpvhvend = &xpvhv[PERL_ARENA_SIZE / sizeof(xpvhv_allocated) - 1];
1265 PL_xpvhv_root = ++xpvhv;
1266 while (xpvhv < xpvhvend) {
1267 *((xpvhv_allocated**)xpvhv) = xpvhv + 1;
1270 *((xpvhv_allocated**)xpvhv) = 0;
1273 /* allocate another arena's worth of struct xpvmg */
1280 New(719, xpvmg, PERL_ARENA_SIZE/sizeof(XPVMG), XPVMG);
1281 *((XPVMG**)xpvmg) = PL_xpvmg_arenaroot;
1282 PL_xpvmg_arenaroot = xpvmg;
1284 xpvmgend = &xpvmg[PERL_ARENA_SIZE / sizeof(XPVMG) - 1];
1285 PL_xpvmg_root = ++xpvmg;
1286 while (xpvmg < xpvmgend) {
1287 *((XPVMG**)xpvmg) = xpvmg + 1;
1290 *((XPVMG**)xpvmg) = 0;
1293 /* allocate another arena's worth of struct xpvgv */
1300 New(720, xpvgv, PERL_ARENA_SIZE/sizeof(XPVGV), XPVGV);
1301 *((XPVGV**)xpvgv) = PL_xpvgv_arenaroot;
1302 PL_xpvgv_arenaroot = xpvgv;
1304 xpvgvend = &xpvgv[PERL_ARENA_SIZE / sizeof(XPVGV) - 1];
1305 PL_xpvgv_root = ++xpvgv;
1306 while (xpvgv < xpvgvend) {
1307 *((XPVGV**)xpvgv) = xpvgv + 1;
1310 *((XPVGV**)xpvgv) = 0;
1313 /* allocate another arena's worth of struct xpvlv */
1320 New(720, xpvlv, PERL_ARENA_SIZE/sizeof(XPVLV), XPVLV);
1321 *((XPVLV**)xpvlv) = PL_xpvlv_arenaroot;
1322 PL_xpvlv_arenaroot = xpvlv;
1324 xpvlvend = &xpvlv[PERL_ARENA_SIZE / sizeof(XPVLV) - 1];
1325 PL_xpvlv_root = ++xpvlv;
1326 while (xpvlv < xpvlvend) {
1327 *((XPVLV**)xpvlv) = xpvlv + 1;
1330 *((XPVLV**)xpvlv) = 0;
1333 /* allocate another arena's worth of struct xpvbm */
1340 New(721, xpvbm, PERL_ARENA_SIZE/sizeof(XPVBM), XPVBM);
1341 *((XPVBM**)xpvbm) = PL_xpvbm_arenaroot;
1342 PL_xpvbm_arenaroot = xpvbm;
1344 xpvbmend = &xpvbm[PERL_ARENA_SIZE / sizeof(XPVBM) - 1];
1345 PL_xpvbm_root = ++xpvbm;
1346 while (xpvbm < xpvbmend) {
1347 *((XPVBM**)xpvbm) = xpvbm + 1;
1350 *((XPVBM**)xpvbm) = 0;
1353 /* grab a new NV body from the free list, allocating more if necessary */
1363 PL_xnv_root = *(NV**)xnv;
1365 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1368 /* return an NV body to the free list */
1371 S_del_xnv(pTHX_ XPVNV *p)
1373 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1375 *(NV**)xnv = PL_xnv_root;
1380 /* grab a new struct xpv from the free list, allocating more if necessary */
1390 PL_xpv_root = *(xpv_allocated**)xpv;
1392 /* If xpv_allocated is the same structure as XPV then the two OFFSETs
1393 sum to zero, and the pointer is unchanged. If the allocated structure
1394 is smaller (no initial IV actually allocated) then the net effect is
1395 to subtract the size of the IV from the pointer, to return a new pointer
1396 as if an initial IV were actually allocated. */
1397 return (XPV*)((char*)xpv - STRUCT_OFFSET(XPV, xpv_cur)
1398 + STRUCT_OFFSET(xpv_allocated, xpv_cur));
1401 /* return a struct xpv to the free list */
1404 S_del_xpv(pTHX_ XPV *p)
1407 = (xpv_allocated*)((char*)(p) + STRUCT_OFFSET(XPV, xpv_cur)
1408 - STRUCT_OFFSET(xpv_allocated, xpv_cur));
1410 *(xpv_allocated**)xpv = PL_xpv_root;
1415 /* grab a new struct xpviv from the free list, allocating more if necessary */
1420 xpviv_allocated* xpviv;
1424 xpviv = PL_xpviv_root;
1425 PL_xpviv_root = *(xpviv_allocated**)xpviv;
1427 /* If xpviv_allocated is the same structure as XPVIV then the two OFFSETs
1428 sum to zero, and the pointer is unchanged. If the allocated structure
1429 is smaller (no initial IV actually allocated) then the net effect is
1430 to subtract the size of the IV from the pointer, to return a new pointer
1431 as if an initial IV were actually allocated. */
1432 return (XPVIV*)((char*)xpviv - STRUCT_OFFSET(XPVIV, xpv_cur)
1433 + STRUCT_OFFSET(xpviv_allocated, xpv_cur));
1436 /* return a struct xpviv to the free list */
1439 S_del_xpviv(pTHX_ XPVIV *p)
1441 xpviv_allocated* xpviv
1442 = (xpviv_allocated*)((char*)(p) + STRUCT_OFFSET(XPVIV, xpv_cur)
1443 - STRUCT_OFFSET(xpviv_allocated, xpv_cur));
1445 *(xpviv_allocated**)xpviv = PL_xpviv_root;
1446 PL_xpviv_root = xpviv;
1450 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1459 xpvnv = PL_xpvnv_root;
1460 PL_xpvnv_root = *(XPVNV**)xpvnv;
1465 /* return a struct xpvnv to the free list */
1468 S_del_xpvnv(pTHX_ XPVNV *p)
1471 *(XPVNV**)p = PL_xpvnv_root;
1476 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1485 xpvcv = PL_xpvcv_root;
1486 PL_xpvcv_root = *(XPVCV**)xpvcv;
1491 /* return a struct xpvcv to the free list */
1494 S_del_xpvcv(pTHX_ XPVCV *p)
1497 *(XPVCV**)p = PL_xpvcv_root;
1502 /* grab a new struct xpvav from the free list, allocating more if necessary */
1507 xpvav_allocated* xpvav;
1511 xpvav = PL_xpvav_root;
1512 PL_xpvav_root = *(xpvav_allocated**)xpvav;
1514 return (XPVAV*)((char*)xpvav - STRUCT_OFFSET(XPVAV, xav_fill)
1515 + STRUCT_OFFSET(xpvav_allocated, xav_fill));
1518 /* return a struct xpvav to the free list */
1521 S_del_xpvav(pTHX_ XPVAV *p)
1523 xpvav_allocated* xpvav
1524 = (xpvav_allocated*)((char*)(p) + STRUCT_OFFSET(XPVAV, xav_fill)
1525 - STRUCT_OFFSET(xpvav_allocated, xav_fill));
1527 *(xpvav_allocated**)xpvav = PL_xpvav_root;
1528 PL_xpvav_root = xpvav;
1532 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1537 xpvhv_allocated* xpvhv;
1541 xpvhv = PL_xpvhv_root;
1542 PL_xpvhv_root = *(xpvhv_allocated**)xpvhv;
1544 return (XPVHV*)((char*)xpvhv - STRUCT_OFFSET(XPVHV, xhv_fill)
1545 + STRUCT_OFFSET(xpvhv_allocated, xhv_fill));
1548 /* return a struct xpvhv to the free list */
1551 S_del_xpvhv(pTHX_ XPVHV *p)
1553 xpvhv_allocated* xpvhv
1554 = (xpvhv_allocated*)((char*)(p) + STRUCT_OFFSET(XPVHV, xhv_fill)
1555 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill));
1557 *(xpvhv_allocated**)xpvhv = PL_xpvhv_root;
1558 PL_xpvhv_root = xpvhv;
1562 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1571 xpvmg = PL_xpvmg_root;
1572 PL_xpvmg_root = *(XPVMG**)xpvmg;
1577 /* return a struct xpvmg to the free list */
1580 S_del_xpvmg(pTHX_ XPVMG *p)
1583 *(XPVMG**)p = PL_xpvmg_root;
1588 /* grab a new struct xpvgv from the free list, allocating more if necessary */
1597 xpvgv = PL_xpvgv_root;
1598 PL_xpvgv_root = *(XPVGV**)xpvgv;
1603 /* return a struct xpvgv to the free list */
1606 S_del_xpvgv(pTHX_ XPVGV *p)
1609 *(XPVGV**)p = PL_xpvgv_root;
1614 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1623 xpvlv = PL_xpvlv_root;
1624 PL_xpvlv_root = *(XPVLV**)xpvlv;
1629 /* return a struct xpvlv to the free list */
1632 S_del_xpvlv(pTHX_ XPVLV *p)
1635 *(XPVLV**)p = PL_xpvlv_root;
1640 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1649 xpvbm = PL_xpvbm_root;
1650 PL_xpvbm_root = *(XPVBM**)xpvbm;
1655 /* return a struct xpvbm to the free list */
1658 S_del_xpvbm(pTHX_ XPVBM *p)
1661 *(XPVBM**)p = PL_xpvbm_root;
1666 #define my_safemalloc(s) (void*)safemalloc(s)
1667 #define my_safefree(p) safefree((char*)p)
1671 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1672 #define del_XNV(p) my_safefree(p)
1674 #define new_XPV() my_safemalloc(sizeof(XPV))
1675 #define del_XPV(p) my_safefree(p)
1677 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1678 #define del_XPVIV(p) my_safefree(p)
1680 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1681 #define del_XPVNV(p) my_safefree(p)
1683 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1684 #define del_XPVCV(p) my_safefree(p)
1686 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1687 #define del_XPVAV(p) my_safefree(p)
1689 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1690 #define del_XPVHV(p) my_safefree(p)
1692 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1693 #define del_XPVMG(p) my_safefree(p)
1695 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1696 #define del_XPVGV(p) my_safefree(p)
1698 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1699 #define del_XPVLV(p) my_safefree(p)
1701 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1702 #define del_XPVBM(p) my_safefree(p)
1706 #define new_XNV() (void*)new_xnv()
1707 #define del_XNV(p) del_xnv((XPVNV*) p)
1709 #define new_XPV() (void*)new_xpv()
1710 #define del_XPV(p) del_xpv((XPV *)p)
1712 #define new_XPVIV() (void*)new_xpviv()
1713 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1715 #define new_XPVNV() (void*)new_xpvnv()
1716 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1718 #define new_XPVCV() (void*)new_xpvcv()
1719 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1721 #define new_XPVAV() (void*)new_xpvav()
1722 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1724 #define new_XPVHV() (void*)new_xpvhv()
1725 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1727 #define new_XPVMG() (void*)new_xpvmg()
1728 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1730 #define new_XPVGV() (void*)new_xpvgv()
1731 #define del_XPVGV(p) del_xpvgv((XPVGV *)p)
1733 #define new_XPVLV() (void*)new_xpvlv()
1734 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1736 #define new_XPVBM() (void*)new_xpvbm()
1737 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1741 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1742 #define del_XPVFM(p) my_safefree(p)
1744 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1745 #define del_XPVIO(p) my_safefree(p)
1748 =for apidoc sv_upgrade
1750 Upgrade an SV to a more complex form. Generally adds a new body type to the
1751 SV, then copies across as much information as possible from the old body.
1752 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1758 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1769 if (mt != SVt_PV && SvIsCOW(sv)) {
1770 sv_force_normal_flags(sv, 0);
1773 if (SvTYPE(sv) == mt)
1784 switch (SvTYPE(sv)) {
1791 else if (mt < SVt_PVIV)
1801 pv = (char*)SvRV(sv);
1810 else if (mt == SVt_NV)
1818 del_XPVIV(SvANY(sv));
1826 del_XPVNV(SvANY(sv));
1829 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1830 there's no way that it can be safely upgraded, because perl.c
1831 expects to Safefree(SvANY(PL_mess_sv)) */
1832 assert(sv != PL_mess_sv);
1833 /* This flag bit is used to mean other things in other scalar types.
1834 Given that it only has meaning inside the pad, it shouldn't be set
1835 on anything that can get upgraded. */
1836 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1842 magic = SvMAGIC(sv);
1843 stash = SvSTASH(sv);
1844 del_XPVMG(SvANY(sv));
1847 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1850 SvFLAGS(sv) &= ~SVTYPEMASK;
1855 Perl_croak(aTHX_ "Can't upgrade to undef");
1857 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1861 SvANY(sv) = new_XNV();
1865 SvANY(sv) = &sv->sv_u.svu_rv;
1866 SvRV_set(sv, (SV*)pv);
1869 SvANY(sv) = new_XPVHV();
1870 ((XPVHV*) SvANY(sv))->xhv_aux = 0;
1873 HvTOTALKEYS(sv) = 0;
1875 /* Fall through... */
1878 SvANY(sv) = new_XPVAV();
1886 /* XXX? Only SVt_NULL is ever upgraded to AV or HV? */
1888 /* FIXME. Should be able to remove all this if()... if the above
1889 assertion is genuinely always true. */
1892 SvFLAGS(sv) &= ~SVf_OOK;
1895 SvPV_set(sv, (char*)0);
1896 SvMAGIC_set(sv, magic);
1897 SvSTASH_set(sv, stash);
1901 SvANY(sv) = new_XPVIO();
1902 Zero(SvANY(sv), 1, XPVIO);
1903 IoPAGE_LEN(sv) = 60;
1904 goto set_magic_common;
1906 SvANY(sv) = new_XPVFM();
1907 Zero(SvANY(sv), 1, XPVFM);
1908 goto set_magic_common;
1910 SvANY(sv) = new_XPVBM();
1914 goto set_magic_common;
1916 SvANY(sv) = new_XPVGV();
1922 goto set_magic_common;
1924 SvANY(sv) = new_XPVCV();
1925 Zero(SvANY(sv), 1, XPVCV);
1926 goto set_magic_common;
1928 SvANY(sv) = new_XPVLV();
1941 SvANY(sv) = new_XPVMG();
1944 SvMAGIC_set(sv, magic);
1945 SvSTASH_set(sv, stash);
1949 SvANY(sv) = new_XPVNV();
1955 SvANY(sv) = new_XPVIV();
1964 SvANY(sv) = new_XPV();
1975 =for apidoc sv_backoff
1977 Remove any string offset. You should normally use the C<SvOOK_off> macro
1984 Perl_sv_backoff(pTHX_ register SV *sv)
1988 char *s = SvPVX(sv);
1989 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1990 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1992 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1994 SvFLAGS(sv) &= ~SVf_OOK;
2001 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2002 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2003 Use the C<SvGROW> wrapper instead.
2009 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2013 #ifdef HAS_64K_LIMIT
2014 if (newlen >= 0x10000) {
2015 PerlIO_printf(Perl_debug_log,
2016 "Allocation too large: %"UVxf"\n", (UV)newlen);
2019 #endif /* HAS_64K_LIMIT */
2022 if (SvTYPE(sv) < SVt_PV) {
2023 sv_upgrade(sv, SVt_PV);
2026 else if (SvOOK(sv)) { /* pv is offset? */
2029 if (newlen > SvLEN(sv))
2030 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2031 #ifdef HAS_64K_LIMIT
2032 if (newlen >= 0x10000)
2039 if (newlen > SvLEN(sv)) { /* need more room? */
2040 if (SvLEN(sv) && s) {
2042 const STRLEN l = malloced_size((void*)SvPVX(sv));
2048 Renew(s,newlen,char);
2051 New(703, s, newlen, char);
2052 if (SvPVX(sv) && SvCUR(sv)) {
2053 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2057 SvLEN_set(sv, newlen);
2063 =for apidoc sv_setiv
2065 Copies an integer into the given SV, upgrading first if necessary.
2066 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2072 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2074 SV_CHECK_THINKFIRST_COW_DROP(sv);
2075 switch (SvTYPE(sv)) {
2077 sv_upgrade(sv, SVt_IV);
2080 sv_upgrade(sv, SVt_PVNV);
2084 sv_upgrade(sv, SVt_PVIV);
2093 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2096 (void)SvIOK_only(sv); /* validate number */
2102 =for apidoc sv_setiv_mg
2104 Like C<sv_setiv>, but also handles 'set' magic.
2110 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2117 =for apidoc sv_setuv
2119 Copies an unsigned integer into the given SV, upgrading first if necessary.
2120 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2126 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2128 /* With these two if statements:
2129 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2132 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2134 If you wish to remove them, please benchmark to see what the effect is
2136 if (u <= (UV)IV_MAX) {
2137 sv_setiv(sv, (IV)u);
2146 =for apidoc sv_setuv_mg
2148 Like C<sv_setuv>, but also handles 'set' magic.
2154 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2156 /* With these two if statements:
2157 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2160 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2162 If you wish to remove them, please benchmark to see what the effect is
2164 if (u <= (UV)IV_MAX) {
2165 sv_setiv(sv, (IV)u);
2175 =for apidoc sv_setnv
2177 Copies a double into the given SV, upgrading first if necessary.
2178 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2184 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2186 SV_CHECK_THINKFIRST_COW_DROP(sv);
2187 switch (SvTYPE(sv)) {
2190 sv_upgrade(sv, SVt_NV);
2195 sv_upgrade(sv, SVt_PVNV);
2204 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2208 (void)SvNOK_only(sv); /* validate number */
2213 =for apidoc sv_setnv_mg
2215 Like C<sv_setnv>, but also handles 'set' magic.
2221 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2227 /* Print an "isn't numeric" warning, using a cleaned-up,
2228 * printable version of the offending string
2232 S_not_a_number(pTHX_ SV *sv)
2239 dsv = sv_2mortal(newSVpv("", 0));
2240 pv = sv_uni_display(dsv, sv, 10, 0);
2243 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2244 /* each *s can expand to 4 chars + "...\0",
2245 i.e. need room for 8 chars */
2248 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2250 if (ch & 128 && !isPRINT_LC(ch)) {
2259 else if (ch == '\r') {
2263 else if (ch == '\f') {
2267 else if (ch == '\\') {
2271 else if (ch == '\0') {
2275 else if (isPRINT_LC(ch))
2292 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2293 "Argument \"%s\" isn't numeric in %s", pv,
2296 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2297 "Argument \"%s\" isn't numeric", pv);
2301 =for apidoc looks_like_number
2303 Test if the content of an SV looks like a number (or is a number).
2304 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2305 non-numeric warning), even if your atof() doesn't grok them.
2311 Perl_looks_like_number(pTHX_ SV *sv)
2313 register const char *sbegin;
2320 else if (SvPOKp(sv))
2321 sbegin = SvPV(sv, len);
2323 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2324 return grok_number(sbegin, len, NULL);
2327 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2328 until proven guilty, assume that things are not that bad... */
2333 As 64 bit platforms often have an NV that doesn't preserve all bits of
2334 an IV (an assumption perl has been based on to date) it becomes necessary
2335 to remove the assumption that the NV always carries enough precision to
2336 recreate the IV whenever needed, and that the NV is the canonical form.
2337 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2338 precision as a side effect of conversion (which would lead to insanity
2339 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2340 1) to distinguish between IV/UV/NV slots that have cached a valid
2341 conversion where precision was lost and IV/UV/NV slots that have a
2342 valid conversion which has lost no precision
2343 2) to ensure that if a numeric conversion to one form is requested that
2344 would lose precision, the precise conversion (or differently
2345 imprecise conversion) is also performed and cached, to prevent
2346 requests for different numeric formats on the same SV causing
2347 lossy conversion chains. (lossless conversion chains are perfectly
2352 SvIOKp is true if the IV slot contains a valid value
2353 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2354 SvNOKp is true if the NV slot contains a valid value
2355 SvNOK is true only if the NV value is accurate
2358 while converting from PV to NV, check to see if converting that NV to an
2359 IV(or UV) would lose accuracy over a direct conversion from PV to
2360 IV(or UV). If it would, cache both conversions, return NV, but mark
2361 SV as IOK NOKp (ie not NOK).
2363 While converting from PV to IV, check to see if converting that IV to an
2364 NV would lose accuracy over a direct conversion from PV to NV. If it
2365 would, cache both conversions, flag similarly.
2367 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2368 correctly because if IV & NV were set NV *always* overruled.
2369 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2370 changes - now IV and NV together means that the two are interchangeable:
2371 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2373 The benefit of this is that operations such as pp_add know that if
2374 SvIOK is true for both left and right operands, then integer addition
2375 can be used instead of floating point (for cases where the result won't
2376 overflow). Before, floating point was always used, which could lead to
2377 loss of precision compared with integer addition.
2379 * making IV and NV equal status should make maths accurate on 64 bit
2381 * may speed up maths somewhat if pp_add and friends start to use
2382 integers when possible instead of fp. (Hopefully the overhead in
2383 looking for SvIOK and checking for overflow will not outweigh the
2384 fp to integer speedup)
2385 * will slow down integer operations (callers of SvIV) on "inaccurate"
2386 values, as the change from SvIOK to SvIOKp will cause a call into
2387 sv_2iv each time rather than a macro access direct to the IV slot
2388 * should speed up number->string conversion on integers as IV is
2389 favoured when IV and NV are equally accurate
2391 ####################################################################
2392 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2393 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2394 On the other hand, SvUOK is true iff UV.
2395 ####################################################################
2397 Your mileage will vary depending your CPU's relative fp to integer
2401 #ifndef NV_PRESERVES_UV
2402 # define IS_NUMBER_UNDERFLOW_IV 1
2403 # define IS_NUMBER_UNDERFLOW_UV 2
2404 # define IS_NUMBER_IV_AND_UV 2
2405 # define IS_NUMBER_OVERFLOW_IV 4
2406 # define IS_NUMBER_OVERFLOW_UV 5
2408 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2410 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2412 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2414 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
2415 if (SvNVX(sv) < (NV)IV_MIN) {
2416 (void)SvIOKp_on(sv);
2418 SvIV_set(sv, IV_MIN);
2419 return IS_NUMBER_UNDERFLOW_IV;
2421 if (SvNVX(sv) > (NV)UV_MAX) {
2422 (void)SvIOKp_on(sv);
2425 SvUV_set(sv, UV_MAX);
2426 return IS_NUMBER_OVERFLOW_UV;
2428 (void)SvIOKp_on(sv);
2430 /* Can't use strtol etc to convert this string. (See truth table in
2432 if (SvNVX(sv) <= (UV)IV_MAX) {
2433 SvIV_set(sv, I_V(SvNVX(sv)));
2434 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2435 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2437 /* Integer is imprecise. NOK, IOKp */
2439 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2442 SvUV_set(sv, U_V(SvNVX(sv)));
2443 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2444 if (SvUVX(sv) == UV_MAX) {
2445 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2446 possibly be preserved by NV. Hence, it must be overflow.
2448 return IS_NUMBER_OVERFLOW_UV;
2450 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2452 /* Integer is imprecise. NOK, IOKp */
2454 return IS_NUMBER_OVERFLOW_IV;
2456 #endif /* !NV_PRESERVES_UV*/
2458 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2459 * this function provided for binary compatibility only
2463 Perl_sv_2iv(pTHX_ register SV *sv)
2465 return sv_2iv_flags(sv, SV_GMAGIC);
2469 =for apidoc sv_2iv_flags
2471 Return the integer value of an SV, doing any necessary string
2472 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2473 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2479 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2483 if (SvGMAGICAL(sv)) {
2484 if (flags & SV_GMAGIC)
2489 return I_V(SvNVX(sv));
2491 if (SvPOKp(sv) && SvLEN(sv))
2494 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2495 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2501 if (SvTHINKFIRST(sv)) {
2504 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2505 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2506 return SvIV(tmpstr);
2507 return PTR2IV(SvRV(sv));
2510 sv_force_normal_flags(sv, 0);
2512 if (SvREADONLY(sv) && !SvOK(sv)) {
2513 if (ckWARN(WARN_UNINITIALIZED))
2520 return (IV)(SvUVX(sv));
2527 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2528 * without also getting a cached IV/UV from it at the same time
2529 * (ie PV->NV conversion should detect loss of accuracy and cache
2530 * IV or UV at same time to avoid this. NWC */
2532 if (SvTYPE(sv) == SVt_NV)
2533 sv_upgrade(sv, SVt_PVNV);
2535 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2536 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2537 certainly cast into the IV range at IV_MAX, whereas the correct
2538 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2540 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2541 SvIV_set(sv, I_V(SvNVX(sv)));
2542 if (SvNVX(sv) == (NV) SvIVX(sv)
2543 #ifndef NV_PRESERVES_UV
2544 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2545 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2546 /* Don't flag it as "accurately an integer" if the number
2547 came from a (by definition imprecise) NV operation, and
2548 we're outside the range of NV integer precision */
2551 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2552 DEBUG_c(PerlIO_printf(Perl_debug_log,
2553 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2559 /* IV not precise. No need to convert from PV, as NV
2560 conversion would already have cached IV if it detected
2561 that PV->IV would be better than PV->NV->IV
2562 flags already correct - don't set public IOK. */
2563 DEBUG_c(PerlIO_printf(Perl_debug_log,
2564 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2569 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2570 but the cast (NV)IV_MIN rounds to a the value less (more
2571 negative) than IV_MIN which happens to be equal to SvNVX ??
2572 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2573 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2574 (NV)UVX == NVX are both true, but the values differ. :-(
2575 Hopefully for 2s complement IV_MIN is something like
2576 0x8000000000000000 which will be exact. NWC */
2579 SvUV_set(sv, U_V(SvNVX(sv)));
2581 (SvNVX(sv) == (NV) SvUVX(sv))
2582 #ifndef NV_PRESERVES_UV
2583 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2584 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2585 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2586 /* Don't flag it as "accurately an integer" if the number
2587 came from a (by definition imprecise) NV operation, and
2588 we're outside the range of NV integer precision */
2594 DEBUG_c(PerlIO_printf(Perl_debug_log,
2595 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2599 return (IV)SvUVX(sv);
2602 else if (SvPOKp(sv) && SvLEN(sv)) {
2604 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2605 /* We want to avoid a possible problem when we cache an IV which
2606 may be later translated to an NV, and the resulting NV is not
2607 the same as the direct translation of the initial string
2608 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2609 be careful to ensure that the value with the .456 is around if the
2610 NV value is requested in the future).
2612 This means that if we cache such an IV, we need to cache the
2613 NV as well. Moreover, we trade speed for space, and do not
2614 cache the NV if we are sure it's not needed.
2617 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2618 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2619 == IS_NUMBER_IN_UV) {
2620 /* It's definitely an integer, only upgrade to PVIV */
2621 if (SvTYPE(sv) < SVt_PVIV)
2622 sv_upgrade(sv, SVt_PVIV);
2624 } else if (SvTYPE(sv) < SVt_PVNV)
2625 sv_upgrade(sv, SVt_PVNV);
2627 /* If NV preserves UV then we only use the UV value if we know that
2628 we aren't going to call atof() below. If NVs don't preserve UVs
2629 then the value returned may have more precision than atof() will
2630 return, even though value isn't perfectly accurate. */
2631 if ((numtype & (IS_NUMBER_IN_UV
2632 #ifdef NV_PRESERVES_UV
2635 )) == IS_NUMBER_IN_UV) {
2636 /* This won't turn off the public IOK flag if it was set above */
2637 (void)SvIOKp_on(sv);
2639 if (!(numtype & IS_NUMBER_NEG)) {
2641 if (value <= (UV)IV_MAX) {
2642 SvIV_set(sv, (IV)value);
2644 SvUV_set(sv, value);
2648 /* 2s complement assumption */
2649 if (value <= (UV)IV_MIN) {
2650 SvIV_set(sv, -(IV)value);
2652 /* Too negative for an IV. This is a double upgrade, but
2653 I'm assuming it will be rare. */
2654 if (SvTYPE(sv) < SVt_PVNV)
2655 sv_upgrade(sv, SVt_PVNV);
2659 SvNV_set(sv, -(NV)value);
2660 SvIV_set(sv, IV_MIN);
2664 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2665 will be in the previous block to set the IV slot, and the next
2666 block to set the NV slot. So no else here. */
2668 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2669 != IS_NUMBER_IN_UV) {
2670 /* It wasn't an (integer that doesn't overflow the UV). */
2671 SvNV_set(sv, Atof(SvPVX(sv)));
2673 if (! numtype && ckWARN(WARN_NUMERIC))
2676 #if defined(USE_LONG_DOUBLE)
2677 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2678 PTR2UV(sv), SvNVX(sv)));
2680 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2681 PTR2UV(sv), SvNVX(sv)));
2685 #ifdef NV_PRESERVES_UV
2686 (void)SvIOKp_on(sv);
2688 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2689 SvIV_set(sv, I_V(SvNVX(sv)));
2690 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2693 /* Integer is imprecise. NOK, IOKp */
2695 /* UV will not work better than IV */
2697 if (SvNVX(sv) > (NV)UV_MAX) {
2699 /* Integer is inaccurate. NOK, IOKp, is UV */
2700 SvUV_set(sv, UV_MAX);
2703 SvUV_set(sv, U_V(SvNVX(sv)));
2704 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2705 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2709 /* Integer is imprecise. NOK, IOKp, is UV */
2715 #else /* NV_PRESERVES_UV */
2716 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2717 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2718 /* The IV slot will have been set from value returned by
2719 grok_number above. The NV slot has just been set using
2722 assert (SvIOKp(sv));
2724 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2725 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2726 /* Small enough to preserve all bits. */
2727 (void)SvIOKp_on(sv);
2729 SvIV_set(sv, I_V(SvNVX(sv)));
2730 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2732 /* Assumption: first non-preserved integer is < IV_MAX,
2733 this NV is in the preserved range, therefore: */
2734 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2736 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs((double)SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2740 0 0 already failed to read UV.
2741 0 1 already failed to read UV.
2742 1 0 you won't get here in this case. IV/UV
2743 slot set, public IOK, Atof() unneeded.
2744 1 1 already read UV.
2745 so there's no point in sv_2iuv_non_preserve() attempting
2746 to use atol, strtol, strtoul etc. */
2747 if (sv_2iuv_non_preserve (sv, numtype)
2748 >= IS_NUMBER_OVERFLOW_IV)
2752 #endif /* NV_PRESERVES_UV */
2755 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2757 if (SvTYPE(sv) < SVt_IV)
2758 /* Typically the caller expects that sv_any is not NULL now. */
2759 sv_upgrade(sv, SVt_IV);
2762 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2763 PTR2UV(sv),SvIVX(sv)));
2764 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2767 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2768 * this function provided for binary compatibility only
2772 Perl_sv_2uv(pTHX_ register SV *sv)
2774 return sv_2uv_flags(sv, SV_GMAGIC);
2778 =for apidoc sv_2uv_flags
2780 Return the unsigned integer value of an SV, doing any necessary string
2781 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2782 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2788 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2792 if (SvGMAGICAL(sv)) {
2793 if (flags & SV_GMAGIC)
2798 return U_V(SvNVX(sv));
2799 if (SvPOKp(sv) && SvLEN(sv))
2802 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2803 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2809 if (SvTHINKFIRST(sv)) {
2812 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2813 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2814 return SvUV(tmpstr);
2815 return PTR2UV(SvRV(sv));
2818 sv_force_normal_flags(sv, 0);
2820 if (SvREADONLY(sv) && !SvOK(sv)) {
2821 if (ckWARN(WARN_UNINITIALIZED))
2831 return (UV)SvIVX(sv);
2835 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2836 * without also getting a cached IV/UV from it at the same time
2837 * (ie PV->NV conversion should detect loss of accuracy and cache
2838 * IV or UV at same time to avoid this. */
2839 /* IV-over-UV optimisation - choose to cache IV if possible */
2841 if (SvTYPE(sv) == SVt_NV)
2842 sv_upgrade(sv, SVt_PVNV);
2844 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2845 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2846 SvIV_set(sv, I_V(SvNVX(sv)));
2847 if (SvNVX(sv) == (NV) SvIVX(sv)
2848 #ifndef NV_PRESERVES_UV
2849 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2850 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2851 /* Don't flag it as "accurately an integer" if the number
2852 came from a (by definition imprecise) NV operation, and
2853 we're outside the range of NV integer precision */
2856 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2857 DEBUG_c(PerlIO_printf(Perl_debug_log,
2858 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2864 /* IV not precise. No need to convert from PV, as NV
2865 conversion would already have cached IV if it detected
2866 that PV->IV would be better than PV->NV->IV
2867 flags already correct - don't set public IOK. */
2868 DEBUG_c(PerlIO_printf(Perl_debug_log,
2869 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2874 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2875 but the cast (NV)IV_MIN rounds to a the value less (more
2876 negative) than IV_MIN which happens to be equal to SvNVX ??
2877 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2878 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2879 (NV)UVX == NVX are both true, but the values differ. :-(
2880 Hopefully for 2s complement IV_MIN is something like
2881 0x8000000000000000 which will be exact. NWC */
2884 SvUV_set(sv, U_V(SvNVX(sv)));
2886 (SvNVX(sv) == (NV) SvUVX(sv))
2887 #ifndef NV_PRESERVES_UV
2888 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2889 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2890 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2891 /* Don't flag it as "accurately an integer" if the number
2892 came from a (by definition imprecise) NV operation, and
2893 we're outside the range of NV integer precision */
2898 DEBUG_c(PerlIO_printf(Perl_debug_log,
2899 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2905 else if (SvPOKp(sv) && SvLEN(sv)) {
2907 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2909 /* We want to avoid a possible problem when we cache a UV which
2910 may be later translated to an NV, and the resulting NV is not
2911 the translation of the initial data.
2913 This means that if we cache such a UV, we need to cache the
2914 NV as well. Moreover, we trade speed for space, and do not
2915 cache the NV if not needed.
2918 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2919 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2920 == IS_NUMBER_IN_UV) {
2921 /* It's definitely an integer, only upgrade to PVIV */
2922 if (SvTYPE(sv) < SVt_PVIV)
2923 sv_upgrade(sv, SVt_PVIV);
2925 } else if (SvTYPE(sv) < SVt_PVNV)
2926 sv_upgrade(sv, SVt_PVNV);
2928 /* If NV preserves UV then we only use the UV value if we know that
2929 we aren't going to call atof() below. If NVs don't preserve UVs
2930 then the value returned may have more precision than atof() will
2931 return, even though it isn't accurate. */
2932 if ((numtype & (IS_NUMBER_IN_UV
2933 #ifdef NV_PRESERVES_UV
2936 )) == IS_NUMBER_IN_UV) {
2937 /* This won't turn off the public IOK flag if it was set above */
2938 (void)SvIOKp_on(sv);
2940 if (!(numtype & IS_NUMBER_NEG)) {
2942 if (value <= (UV)IV_MAX) {
2943 SvIV_set(sv, (IV)value);
2945 /* it didn't overflow, and it was positive. */
2946 SvUV_set(sv, value);
2950 /* 2s complement assumption */
2951 if (value <= (UV)IV_MIN) {
2952 SvIV_set(sv, -(IV)value);
2954 /* Too negative for an IV. This is a double upgrade, but
2955 I'm assuming it will be rare. */
2956 if (SvTYPE(sv) < SVt_PVNV)
2957 sv_upgrade(sv, SVt_PVNV);
2961 SvNV_set(sv, -(NV)value);
2962 SvIV_set(sv, IV_MIN);
2967 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2968 != IS_NUMBER_IN_UV) {
2969 /* It wasn't an integer, or it overflowed the UV. */
2970 SvNV_set(sv, Atof(SvPVX(sv)));
2972 if (! numtype && ckWARN(WARN_NUMERIC))
2975 #if defined(USE_LONG_DOUBLE)
2976 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2977 PTR2UV(sv), SvNVX(sv)));
2979 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2980 PTR2UV(sv), SvNVX(sv)));
2983 #ifdef NV_PRESERVES_UV
2984 (void)SvIOKp_on(sv);
2986 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2987 SvIV_set(sv, I_V(SvNVX(sv)));
2988 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2991 /* Integer is imprecise. NOK, IOKp */
2993 /* UV will not work better than IV */
2995 if (SvNVX(sv) > (NV)UV_MAX) {
2997 /* Integer is inaccurate. NOK, IOKp, is UV */
2998 SvUV_set(sv, UV_MAX);
3001 SvUV_set(sv, U_V(SvNVX(sv)));
3002 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3003 NV preservse UV so can do correct comparison. */
3004 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3008 /* Integer is imprecise. NOK, IOKp, is UV */
3013 #else /* NV_PRESERVES_UV */
3014 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3015 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3016 /* The UV slot will have been set from value returned by
3017 grok_number above. The NV slot has just been set using
3020 assert (SvIOKp(sv));
3022 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3023 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3024 /* Small enough to preserve all bits. */
3025 (void)SvIOKp_on(sv);
3027 SvIV_set(sv, I_V(SvNVX(sv)));
3028 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3030 /* Assumption: first non-preserved integer is < IV_MAX,
3031 this NV is in the preserved range, therefore: */
3032 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3034 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs((double)SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%"NVgf" U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
3037 sv_2iuv_non_preserve (sv, numtype);
3039 #endif /* NV_PRESERVES_UV */
3043 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3044 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3047 if (SvTYPE(sv) < SVt_IV)
3048 /* Typically the caller expects that sv_any is not NULL now. */
3049 sv_upgrade(sv, SVt_IV);
3053 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3054 PTR2UV(sv),SvUVX(sv)));
3055 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3061 Return the num value of an SV, doing any necessary string or integer
3062 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3069 Perl_sv_2nv(pTHX_ register SV *sv)
3073 if (SvGMAGICAL(sv)) {
3077 if (SvPOKp(sv) && SvLEN(sv)) {
3078 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3079 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
3081 return Atof(SvPVX(sv));
3085 return (NV)SvUVX(sv);
3087 return (NV)SvIVX(sv);
3090 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3091 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3097 if (SvTHINKFIRST(sv)) {
3100 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3101 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3102 return SvNV(tmpstr);
3103 return PTR2NV(SvRV(sv));
3106 sv_force_normal_flags(sv, 0);
3108 if (SvREADONLY(sv) && !SvOK(sv)) {
3109 if (ckWARN(WARN_UNINITIALIZED))
3114 if (SvTYPE(sv) < SVt_NV) {
3115 if (SvTYPE(sv) == SVt_IV)
3116 sv_upgrade(sv, SVt_PVNV);
3118 sv_upgrade(sv, SVt_NV);
3119 #ifdef USE_LONG_DOUBLE
3121 STORE_NUMERIC_LOCAL_SET_STANDARD();
3122 PerlIO_printf(Perl_debug_log,
3123 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3124 PTR2UV(sv), SvNVX(sv));
3125 RESTORE_NUMERIC_LOCAL();
3129 STORE_NUMERIC_LOCAL_SET_STANDARD();
3130 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3131 PTR2UV(sv), SvNVX(sv));
3132 RESTORE_NUMERIC_LOCAL();
3136 else if (SvTYPE(sv) < SVt_PVNV)
3137 sv_upgrade(sv, SVt_PVNV);
3142 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3143 #ifdef NV_PRESERVES_UV
3146 /* Only set the public NV OK flag if this NV preserves the IV */
3147 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3148 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3149 : (SvIVX(sv) == I_V(SvNVX(sv))))
3155 else if (SvPOKp(sv) && SvLEN(sv)) {
3157 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3158 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3160 #ifdef NV_PRESERVES_UV
3161 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3162 == IS_NUMBER_IN_UV) {
3163 /* It's definitely an integer */
3164 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3166 SvNV_set(sv, Atof(SvPVX(sv)));
3169 SvNV_set(sv, Atof(SvPVX(sv)));
3170 /* Only set the public NV OK flag if this NV preserves the value in
3171 the PV at least as well as an IV/UV would.
3172 Not sure how to do this 100% reliably. */
3173 /* if that shift count is out of range then Configure's test is
3174 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3176 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3177 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3178 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3179 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3180 /* Can't use strtol etc to convert this string, so don't try.
3181 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3184 /* value has been set. It may not be precise. */
3185 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3186 /* 2s complement assumption for (UV)IV_MIN */
3187 SvNOK_on(sv); /* Integer is too negative. */
3192 if (numtype & IS_NUMBER_NEG) {
3193 SvIV_set(sv, -(IV)value);
3194 } else if (value <= (UV)IV_MAX) {
3195 SvIV_set(sv, (IV)value);
3197 SvUV_set(sv, value);
3201 if (numtype & IS_NUMBER_NOT_INT) {
3202 /* I believe that even if the original PV had decimals,
3203 they are lost beyond the limit of the FP precision.
3204 However, neither is canonical, so both only get p
3205 flags. NWC, 2000/11/25 */
3206 /* Both already have p flags, so do nothing */
3209 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3210 if (SvIVX(sv) == I_V(nv)) {
3215 /* It had no "." so it must be integer. */
3218 /* between IV_MAX and NV(UV_MAX).
3219 Could be slightly > UV_MAX */
3221 if (numtype & IS_NUMBER_NOT_INT) {
3222 /* UV and NV both imprecise. */
3224 UV nv_as_uv = U_V(nv);
3226 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3237 #endif /* NV_PRESERVES_UV */
3240 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3242 if (SvTYPE(sv) < SVt_NV)
3243 /* Typically the caller expects that sv_any is not NULL now. */
3244 /* XXX Ilya implies that this is a bug in callers that assume this
3245 and ideally should be fixed. */
3246 sv_upgrade(sv, SVt_NV);
3249 #if defined(USE_LONG_DOUBLE)
3251 STORE_NUMERIC_LOCAL_SET_STANDARD();
3252 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3253 PTR2UV(sv), SvNVX(sv));
3254 RESTORE_NUMERIC_LOCAL();
3258 STORE_NUMERIC_LOCAL_SET_STANDARD();
3259 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3260 PTR2UV(sv), SvNVX(sv));
3261 RESTORE_NUMERIC_LOCAL();
3267 /* asIV(): extract an integer from the string value of an SV.
3268 * Caller must validate PVX */
3271 S_asIV(pTHX_ SV *sv)
3274 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3276 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3277 == IS_NUMBER_IN_UV) {
3278 /* It's definitely an integer */
3279 if (numtype & IS_NUMBER_NEG) {
3280 if (value < (UV)IV_MIN)
3283 if (value < (UV)IV_MAX)
3288 if (ckWARN(WARN_NUMERIC))
3291 return I_V(Atof(SvPVX(sv)));
3294 /* asUV(): extract an unsigned integer from the string value of an SV
3295 * Caller must validate PVX */
3298 S_asUV(pTHX_ SV *sv)
3301 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
3303 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3304 == IS_NUMBER_IN_UV) {
3305 /* It's definitely an integer */
3306 if (!(numtype & IS_NUMBER_NEG))
3310 if (ckWARN(WARN_NUMERIC))
3313 return U_V(Atof(SvPVX(sv)));
3317 =for apidoc sv_2pv_nolen
3319 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3320 use the macro wrapper C<SvPV_nolen(sv)> instead.
3325 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3328 return sv_2pv(sv, &n_a);
3331 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3332 * UV as a string towards the end of buf, and return pointers to start and
3335 * We assume that buf is at least TYPE_CHARS(UV) long.
3339 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3341 char *ptr = buf + TYPE_CHARS(UV);
3355 *--ptr = '0' + (char)(uv % 10);
3363 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3364 * this function provided for binary compatibility only
3368 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3370 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3374 =for apidoc sv_2pv_flags
3376 Returns a pointer to the string value of an SV, and sets *lp to its length.
3377 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3379 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3380 usually end up here too.
3386 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3391 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3392 char *tmpbuf = tbuf;
3398 if (SvGMAGICAL(sv)) {
3399 if (flags & SV_GMAGIC)
3407 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3409 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3414 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3419 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3420 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3427 if (SvTHINKFIRST(sv)) {
3430 register const char *typestr;
3431 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3432 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3433 char *pv = SvPV(tmpstr, *lp);
3443 typestr = "NULLREF";
3447 switch (SvTYPE(sv)) {
3449 if ( ((SvFLAGS(sv) &
3450 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3451 == (SVs_OBJECT|SVs_SMG))
3452 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3453 const regexp *re = (regexp *)mg->mg_obj;
3456 const char *fptr = "msix";
3461 char need_newline = 0;
3462 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3464 while((ch = *fptr++)) {
3466 reflags[left++] = ch;
3469 reflags[right--] = ch;
3474 reflags[left] = '-';
3478 mg->mg_len = re->prelen + 4 + left;
3480 * If /x was used, we have to worry about a regex
3481 * ending with a comment later being embedded
3482 * within another regex. If so, we don't want this
3483 * regex's "commentization" to leak out to the
3484 * right part of the enclosing regex, we must cap
3485 * it with a newline.
3487 * So, if /x was used, we scan backwards from the
3488 * end of the regex. If we find a '#' before we
3489 * find a newline, we need to add a newline
3490 * ourself. If we find a '\n' first (or if we
3491 * don't find '#' or '\n'), we don't need to add
3492 * anything. -jfriedl
3494 if (PMf_EXTENDED & re->reganch)
3496 const char *endptr = re->precomp + re->prelen;
3497 while (endptr >= re->precomp)
3499 const char c = *(endptr--);
3501 break; /* don't need another */
3503 /* we end while in a comment, so we
3505 mg->mg_len++; /* save space for it */
3506 need_newline = 1; /* note to add it */
3512 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3513 Copy("(?", mg->mg_ptr, 2, char);
3514 Copy(reflags, mg->mg_ptr+2, left, char);
3515 Copy(":", mg->mg_ptr+left+2, 1, char);
3516 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3518 mg->mg_ptr[mg->mg_len - 2] = '\n';
3519 mg->mg_ptr[mg->mg_len - 1] = ')';
3520 mg->mg_ptr[mg->mg_len] = 0;
3522 PL_reginterp_cnt += re->program[0].next_off;
3524 if (re->reganch & ROPT_UTF8)
3539 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3540 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3541 /* tied lvalues should appear to be
3542 * scalars for backwards compatitbility */
3543 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3544 ? "SCALAR" : "LVALUE"; break;
3545 case SVt_PVAV: typestr = "ARRAY"; break;
3546 case SVt_PVHV: typestr = "HASH"; break;
3547 case SVt_PVCV: typestr = "CODE"; break;
3548 case SVt_PVGV: typestr = "GLOB"; break;
3549 case SVt_PVFM: typestr = "FORMAT"; break;
3550 case SVt_PVIO: typestr = "IO"; break;
3551 default: typestr = "UNKNOWN"; break;
3555 const char *name = HvNAME_get(SvSTASH(sv));
3556 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3557 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3560 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3563 *lp = strlen(typestr);
3564 return (char *)typestr;
3566 if (SvREADONLY(sv) && !SvOK(sv)) {
3567 if (ckWARN(WARN_UNINITIALIZED))
3573 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3574 /* I'm assuming that if both IV and NV are equally valid then
3575 converting the IV is going to be more efficient */
3576 const U32 isIOK = SvIOK(sv);
3577 const U32 isUIOK = SvIsUV(sv);
3578 char buf[TYPE_CHARS(UV)];
3581 if (SvTYPE(sv) < SVt_PVIV)
3582 sv_upgrade(sv, SVt_PVIV);
3584 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3586 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3587 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3588 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3589 SvCUR_set(sv, ebuf - ptr);
3599 else if (SvNOKp(sv)) {
3600 if (SvTYPE(sv) < SVt_PVNV)
3601 sv_upgrade(sv, SVt_PVNV);
3602 /* The +20 is pure guesswork. Configure test needed. --jhi */
3603 SvGROW(sv, NV_DIG + 20);
3605 olderrno = errno; /* some Xenix systems wipe out errno here */
3607 if (SvNVX(sv) == 0.0)
3608 (void)strcpy(s,"0");
3612 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3615 #ifdef FIXNEGATIVEZERO
3616 if (*s == '-' && s[1] == '0' && !s[2])
3626 if (ckWARN(WARN_UNINITIALIZED)
3627 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3630 if (SvTYPE(sv) < SVt_PV)
3631 /* Typically the caller expects that sv_any is not NULL now. */
3632 sv_upgrade(sv, SVt_PV);
3635 *lp = s - SvPVX(sv);
3638 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3639 PTR2UV(sv),SvPVX(sv)));
3643 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3644 /* Sneaky stuff here */
3648 tsv = newSVpv(tmpbuf, 0);
3665 len = strlen(tmpbuf);
3667 #ifdef FIXNEGATIVEZERO
3668 if (len == 2 && t[0] == '-' && t[1] == '0') {
3673 (void)SvUPGRADE(sv, SVt_PV);
3675 s = SvGROW(sv, len + 1);
3678 return strcpy(s, t);
3683 =for apidoc sv_copypv
3685 Copies a stringified representation of the source SV into the
3686 destination SV. Automatically performs any necessary mg_get and
3687 coercion of numeric values into strings. Guaranteed to preserve
3688 UTF-8 flag even from overloaded objects. Similar in nature to
3689 sv_2pv[_flags] but operates directly on an SV instead of just the
3690 string. Mostly uses sv_2pv_flags to do its work, except when that
3691 would lose the UTF-8'ness of the PV.
3697 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3702 sv_setpvn(dsv,s,len);
3710 =for apidoc sv_2pvbyte_nolen
3712 Return a pointer to the byte-encoded representation of the SV.
3713 May cause the SV to be downgraded from UTF-8 as a side-effect.
3715 Usually accessed via the C<SvPVbyte_nolen> macro.
3721 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3724 return sv_2pvbyte(sv, &n_a);
3728 =for apidoc sv_2pvbyte
3730 Return a pointer to the byte-encoded representation of the SV, and set *lp
3731 to its length. May cause the SV to be downgraded from UTF-8 as a
3734 Usually accessed via the C<SvPVbyte> macro.
3740 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3742 sv_utf8_downgrade(sv,0);
3743 return SvPV(sv,*lp);
3747 =for apidoc sv_2pvutf8_nolen
3749 Return a pointer to the UTF-8-encoded representation of the SV.
3750 May cause the SV to be upgraded to UTF-8 as a side-effect.
3752 Usually accessed via the C<SvPVutf8_nolen> macro.
3758 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3761 return sv_2pvutf8(sv, &n_a);
3765 =for apidoc sv_2pvutf8
3767 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3768 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3770 Usually accessed via the C<SvPVutf8> macro.
3776 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3778 sv_utf8_upgrade(sv);
3779 return SvPV(sv,*lp);
3783 =for apidoc sv_2bool
3785 This function is only called on magical items, and is only used by
3786 sv_true() or its macro equivalent.
3792 Perl_sv_2bool(pTHX_ register SV *sv)
3801 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3802 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3803 return (bool)SvTRUE(tmpsv);
3804 return SvRV(sv) != 0;
3807 register XPV* Xpvtmp;
3808 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3809 (*sv->sv_u.svu_pv > '0' ||
3810 Xpvtmp->xpv_cur > 1 ||
3811 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3818 return SvIVX(sv) != 0;
3821 return SvNVX(sv) != 0.0;
3828 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3829 * this function provided for binary compatibility only
3834 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3836 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3840 =for apidoc sv_utf8_upgrade
3842 Converts the PV of an SV to its UTF-8-encoded form.
3843 Forces the SV to string form if it is not already.
3844 Always sets the SvUTF8 flag to avoid future validity checks even
3845 if all the bytes have hibit clear.
3847 This is not as a general purpose byte encoding to Unicode interface:
3848 use the Encode extension for that.
3850 =for apidoc sv_utf8_upgrade_flags
3852 Converts the PV of an SV to its UTF-8-encoded form.
3853 Forces the SV to string form if it is not already.
3854 Always sets the SvUTF8 flag to avoid future validity checks even
3855 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3856 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3857 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3859 This is not as a general purpose byte encoding to Unicode interface:
3860 use the Encode extension for that.
3866 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3868 if (sv == &PL_sv_undef)
3872 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3873 (void) sv_2pv_flags(sv,&len, flags);
3877 (void) SvPV_force(sv,len);
3886 sv_force_normal_flags(sv, 0);
3889 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3890 sv_recode_to_utf8(sv, PL_encoding);
3891 else { /* Assume Latin-1/EBCDIC */
3892 /* This function could be much more efficient if we
3893 * had a FLAG in SVs to signal if there are any hibit
3894 * chars in the PV. Given that there isn't such a flag
3895 * make the loop as fast as possible. */
3896 U8 *s = (U8 *) SvPVX(sv);
3897 U8 *e = (U8 *) SvEND(sv);
3903 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3907 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3908 s = bytes_to_utf8((U8*)s, &len);
3910 SvPV_free(sv); /* No longer using what was there before. */
3912 SvPV_set(sv, (char*)s);
3913 SvCUR_set(sv, len - 1);
3914 SvLEN_set(sv, len); /* No longer know the real size. */
3916 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3923 =for apidoc sv_utf8_downgrade
3925 Attempts to convert the PV of an SV from characters to bytes.
3926 If the PV contains a character beyond byte, this conversion will fail;
3927 in this case, either returns false or, if C<fail_ok> is not
3930 This is not as a general purpose Unicode to byte encoding interface:
3931 use the Encode extension for that.
3937 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3939 if (SvPOKp(sv) && SvUTF8(sv)) {
3945 sv_force_normal_flags(sv, 0);
3947 s = (U8 *) SvPV(sv, len);
3948 if (!utf8_to_bytes(s, &len)) {
3953 Perl_croak(aTHX_ "Wide character in %s",
3956 Perl_croak(aTHX_ "Wide character");
3967 =for apidoc sv_utf8_encode
3969 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3970 flag off so that it looks like octets again.
3976 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3978 (void) sv_utf8_upgrade(sv);
3980 sv_force_normal_flags(sv, 0);
3982 if (SvREADONLY(sv)) {
3983 Perl_croak(aTHX_ PL_no_modify);
3989 =for apidoc sv_utf8_decode
3991 If the PV of the SV is an octet sequence in UTF-8
3992 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3993 so that it looks like a character. If the PV contains only single-byte
3994 characters, the C<SvUTF8> flag stays being off.
3995 Scans PV for validity and returns false if the PV is invalid UTF-8.
4001 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4007 /* The octets may have got themselves encoded - get them back as
4010 if (!sv_utf8_downgrade(sv, TRUE))
4013 /* it is actually just a matter of turning the utf8 flag on, but
4014 * we want to make sure everything inside is valid utf8 first.
4016 c = (U8 *) SvPVX(sv);
4017 if (!is_utf8_string(c, SvCUR(sv)+1))
4019 e = (U8 *) SvEND(sv);
4022 if (!UTF8_IS_INVARIANT(ch)) {
4031 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4032 * this function provided for binary compatibility only
4036 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4038 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4042 =for apidoc sv_setsv
4044 Copies the contents of the source SV C<ssv> into the destination SV
4045 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4046 function if the source SV needs to be reused. Does not handle 'set' magic.
4047 Loosely speaking, it performs a copy-by-value, obliterating any previous
4048 content of the destination.
4050 You probably want to use one of the assortment of wrappers, such as
4051 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4052 C<SvSetMagicSV_nosteal>.
4054 =for apidoc sv_setsv_flags
4056 Copies the contents of the source SV C<ssv> into the destination SV
4057 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4058 function if the source SV needs to be reused. Does not handle 'set' magic.
4059 Loosely speaking, it performs a copy-by-value, obliterating any previous
4060 content of the destination.
4061 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4062 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4063 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4064 and C<sv_setsv_nomg> are implemented in terms of this function.
4066 You probably want to use one of the assortment of wrappers, such as
4067 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4068 C<SvSetMagicSV_nosteal>.
4070 This is the primary function for copying scalars, and most other
4071 copy-ish functions and macros use this underneath.
4077 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4079 register U32 sflags;
4085 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4087 sstr = &PL_sv_undef;
4088 stype = SvTYPE(sstr);
4089 dtype = SvTYPE(dstr);
4094 /* need to nuke the magic */
4096 SvRMAGICAL_off(dstr);
4099 /* There's a lot of redundancy below but we're going for speed here */
4104 if (dtype != SVt_PVGV) {
4105 (void)SvOK_off(dstr);
4113 sv_upgrade(dstr, SVt_IV);
4116 sv_upgrade(dstr, SVt_PVNV);
4120 sv_upgrade(dstr, SVt_PVIV);
4123 (void)SvIOK_only(dstr);
4124 SvIV_set(dstr, SvIVX(sstr));
4127 if (SvTAINTED(sstr))
4138 sv_upgrade(dstr, SVt_NV);
4143 sv_upgrade(dstr, SVt_PVNV);
4146 SvNV_set(dstr, SvNVX(sstr));
4147 (void)SvNOK_only(dstr);
4148 if (SvTAINTED(sstr))
4156 sv_upgrade(dstr, SVt_RV);
4157 else if (dtype == SVt_PVGV &&
4158 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4161 if (GvIMPORTED(dstr) != GVf_IMPORTED
4162 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4164 GvIMPORTED_on(dstr);
4173 #ifdef PERL_COPY_ON_WRITE
4174 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4175 if (dtype < SVt_PVIV)
4176 sv_upgrade(dstr, SVt_PVIV);
4183 sv_upgrade(dstr, SVt_PV);
4186 if (dtype < SVt_PVIV)
4187 sv_upgrade(dstr, SVt_PVIV);
4190 if (dtype < SVt_PVNV)
4191 sv_upgrade(dstr, SVt_PVNV);
4198 const char * const type = sv_reftype(sstr,0);
4200 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
4202 Perl_croak(aTHX_ "Bizarre copy of %s", type);
4207 if (dtype <= SVt_PVGV) {
4209 if (dtype != SVt_PVGV) {
4210 const char * const name = GvNAME(sstr);
4211 const STRLEN len = GvNAMELEN(sstr);
4212 /* don't upgrade SVt_PVLV: it can hold a glob */
4213 if (dtype != SVt_PVLV)
4214 sv_upgrade(dstr, SVt_PVGV);
4215 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4216 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4217 GvNAME(dstr) = savepvn(name, len);
4218 GvNAMELEN(dstr) = len;
4219 SvFAKE_on(dstr); /* can coerce to non-glob */
4221 /* ahem, death to those who redefine active sort subs */
4222 else if (PL_curstackinfo->si_type == PERLSI_SORT
4223 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4224 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4227 #ifdef GV_UNIQUE_CHECK
4228 if (GvUNIQUE((GV*)dstr)) {
4229 Perl_croak(aTHX_ PL_no_modify);
4233 (void)SvOK_off(dstr);
4234 GvINTRO_off(dstr); /* one-shot flag */
4236 GvGP(dstr) = gp_ref(GvGP(sstr));
4237 if (SvTAINTED(sstr))
4239 if (GvIMPORTED(dstr) != GVf_IMPORTED
4240 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4242 GvIMPORTED_on(dstr);
4250 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4252 if ((int)SvTYPE(sstr) != stype) {
4253 stype = SvTYPE(sstr);
4254 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4258 if (stype == SVt_PVLV)
4259 (void)SvUPGRADE(dstr, SVt_PVNV);
4261 (void)SvUPGRADE(dstr, (U32)stype);
4264 sflags = SvFLAGS(sstr);
4266 if (sflags & SVf_ROK) {
4267 if (dtype >= SVt_PV) {
4268 if (dtype == SVt_PVGV) {
4269 SV *sref = SvREFCNT_inc(SvRV(sstr));
4271 const int intro = GvINTRO(dstr);
4273 #ifdef GV_UNIQUE_CHECK
4274 if (GvUNIQUE((GV*)dstr)) {
4275 Perl_croak(aTHX_ PL_no_modify);
4280 GvINTRO_off(dstr); /* one-shot flag */
4281 GvLINE(dstr) = CopLINE(PL_curcop);
4282 GvEGV(dstr) = (GV*)dstr;
4285 switch (SvTYPE(sref)) {
4288 SAVEGENERICSV(GvAV(dstr));
4290 dref = (SV*)GvAV(dstr);
4291 GvAV(dstr) = (AV*)sref;
4292 if (!GvIMPORTED_AV(dstr)
4293 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4295 GvIMPORTED_AV_on(dstr);
4300 SAVEGENERICSV(GvHV(dstr));
4302 dref = (SV*)GvHV(dstr);
4303 GvHV(dstr) = (HV*)sref;
4304 if (!GvIMPORTED_HV(dstr)
4305 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4307 GvIMPORTED_HV_on(dstr);
4312 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4313 SvREFCNT_dec(GvCV(dstr));
4314 GvCV(dstr) = Nullcv;
4315 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4316 PL_sub_generation++;
4318 SAVEGENERICSV(GvCV(dstr));
4321 dref = (SV*)GvCV(dstr);
4322 if (GvCV(dstr) != (CV*)sref) {
4323 CV* cv = GvCV(dstr);
4325 if (!GvCVGEN((GV*)dstr) &&
4326 (CvROOT(cv) || CvXSUB(cv)))
4328 /* ahem, death to those who redefine
4329 * active sort subs */
4330 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4331 PL_sortcop == CvSTART(cv))
4333 "Can't redefine active sort subroutine %s",
4334 GvENAME((GV*)dstr));
4335 /* Redefining a sub - warning is mandatory if
4336 it was a const and its value changed. */
4337 if (ckWARN(WARN_REDEFINE)
4339 && (!CvCONST((CV*)sref)
4340 || sv_cmp(cv_const_sv(cv),
4341 cv_const_sv((CV*)sref)))))
4343 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4345 ? "Constant subroutine %s::%s redefined"
4346 : "Subroutine %s::%s redefined",
4347 HvNAME_get(GvSTASH((GV*)dstr)),
4348 GvENAME((GV*)dstr));
4352 cv_ckproto(cv, (GV*)dstr,
4353 SvPOK(sref) ? SvPVX(sref) : Nullch);
4355 GvCV(dstr) = (CV*)sref;
4356 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4357 GvASSUMECV_on(dstr);
4358 PL_sub_generation++;
4360 if (!GvIMPORTED_CV(dstr)
4361 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4363 GvIMPORTED_CV_on(dstr);
4368 SAVEGENERICSV(GvIOp(dstr));
4370 dref = (SV*)GvIOp(dstr);
4371 GvIOp(dstr) = (IO*)sref;
4375 SAVEGENERICSV(GvFORM(dstr));
4377 dref = (SV*)GvFORM(dstr);
4378 GvFORM(dstr) = (CV*)sref;
4382 SAVEGENERICSV(GvSV(dstr));
4384 dref = (SV*)GvSV(dstr);
4386 if (!GvIMPORTED_SV(dstr)
4387 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4389 GvIMPORTED_SV_on(dstr);
4395 if (SvTAINTED(sstr))
4405 (void)SvOK_off(dstr);
4406 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4408 if (sflags & SVp_NOK) {
4410 /* Only set the public OK flag if the source has public OK. */
4411 if (sflags & SVf_NOK)
4412 SvFLAGS(dstr) |= SVf_NOK;
4413 SvNV_set(dstr, SvNVX(sstr));
4415 if (sflags & SVp_IOK) {
4416 (void)SvIOKp_on(dstr);
4417 if (sflags & SVf_IOK)
4418 SvFLAGS(dstr) |= SVf_IOK;
4419 if (sflags & SVf_IVisUV)
4421 SvIV_set(dstr, SvIVX(sstr));
4423 if (SvAMAGIC(sstr)) {
4427 else if (sflags & SVp_POK) {
4431 * Check to see if we can just swipe the string. If so, it's a
4432 * possible small lose on short strings, but a big win on long ones.
4433 * It might even be a win on short strings if SvPVX(dstr)
4434 * has to be allocated and SvPVX(sstr) has to be freed.
4437 /* Whichever path we take through the next code, we want this true,
4438 and doing it now facilitates the COW check. */
4439 (void)SvPOK_only(dstr);
4442 #ifdef PERL_COPY_ON_WRITE
4443 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4447 (sflags & SVs_TEMP) && /* slated for free anyway? */
4448 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4449 (!(flags & SV_NOSTEAL)) &&
4450 /* and we're allowed to steal temps */
4451 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4452 SvLEN(sstr) && /* and really is a string */
4453 /* and won't be needed again, potentially */
4454 !(PL_op && PL_op->op_type == OP_AASSIGN))
4455 #ifdef PERL_COPY_ON_WRITE
4456 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4457 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4458 && SvTYPE(sstr) >= SVt_PVIV)
4461 /* Failed the swipe test, and it's not a shared hash key either.
4462 Have to copy the string. */
4463 STRLEN len = SvCUR(sstr);
4464 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4465 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4466 SvCUR_set(dstr, len);
4467 *SvEND(dstr) = '\0';
4469 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4471 #ifdef PERL_COPY_ON_WRITE
4472 /* Either it's a shared hash key, or it's suitable for
4473 copy-on-write or we can swipe the string. */
4475 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4480 /* I believe I should acquire a global SV mutex if
4481 it's a COW sv (not a shared hash key) to stop
4482 it going un copy-on-write.
4483 If the source SV has gone un copy on write between up there
4484 and down here, then (assert() that) it is of the correct
4485 form to make it copy on write again */
4486 if ((sflags & (SVf_FAKE | SVf_READONLY))
4487 != (SVf_FAKE | SVf_READONLY)) {
4488 SvREADONLY_on(sstr);
4490 /* Make the source SV into a loop of 1.
4491 (about to become 2) */
4492 SV_COW_NEXT_SV_SET(sstr, sstr);
4496 /* Initial code is common. */
4497 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4499 SvFLAGS(dstr) &= ~SVf_OOK;
4500 Safefree(SvPVX(dstr) - SvIVX(dstr));
4502 else if (SvLEN(dstr))
4503 Safefree(SvPVX(dstr));
4506 #ifdef PERL_COPY_ON_WRITE
4508 /* making another shared SV. */
4509 STRLEN cur = SvCUR(sstr);
4510 STRLEN len = SvLEN(sstr);
4511 assert (SvTYPE(dstr) >= SVt_PVIV);
4513 /* SvIsCOW_normal */
4514 /* splice us in between source and next-after-source. */
4515 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4516 SV_COW_NEXT_SV_SET(sstr, dstr);
4517 SvPV_set(dstr, SvPVX(sstr));
4519 /* SvIsCOW_shared_hash */
4520 UV hash = SvUVX(sstr);
4521 DEBUG_C(PerlIO_printf(Perl_debug_log,
4522 "Copy on write: Sharing hash\n"));
4524 sharepvn(SvPVX(sstr),
4525 (sflags & SVf_UTF8?-cur:cur), hash));
4526 SvUV_set(dstr, hash);
4528 SvLEN_set(dstr, len);
4529 SvCUR_set(dstr, cur);
4530 SvREADONLY_on(dstr);
4532 /* Relesase a global SV mutex. */
4536 { /* Passes the swipe test. */
4537 SvPV_set(dstr, SvPVX(sstr));
4538 SvLEN_set(dstr, SvLEN(sstr));
4539 SvCUR_set(dstr, SvCUR(sstr));
4542 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4543 SvPV_set(sstr, Nullch);
4549 if (sflags & SVf_UTF8)
4552 if (sflags & SVp_NOK) {
4554 if (sflags & SVf_NOK)
4555 SvFLAGS(dstr) |= SVf_NOK;
4556 SvNV_set(dstr, SvNVX(sstr));
4558 if (sflags & SVp_IOK) {
4559 (void)SvIOKp_on(dstr);
4560 if (sflags & SVf_IOK)
4561 SvFLAGS(dstr) |= SVf_IOK;
4562 if (sflags & SVf_IVisUV)
4564 SvIV_set(dstr, SvIVX(sstr));
4567 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4568 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4569 smg->mg_ptr, smg->mg_len);
4570 SvRMAGICAL_on(dstr);
4573 else if (sflags & SVp_IOK) {
4574 if (sflags & SVf_IOK)
4575 (void)SvIOK_only(dstr);
4577 (void)SvOK_off(dstr);
4578 (void)SvIOKp_on(dstr);
4580 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4581 if (sflags & SVf_IVisUV)
4583 SvIV_set(dstr, SvIVX(sstr));
4584 if (sflags & SVp_NOK) {
4585 if (sflags & SVf_NOK)
4586 (void)SvNOK_on(dstr);
4588 (void)SvNOKp_on(dstr);
4589 SvNV_set(dstr, SvNVX(sstr));
4592 else if (sflags & SVp_NOK) {
4593 if (sflags & SVf_NOK)
4594 (void)SvNOK_only(dstr);
4596 (void)SvOK_off(dstr);
4599 SvNV_set(dstr, SvNVX(sstr));
4602 if (dtype == SVt_PVGV) {
4603 if (ckWARN(WARN_MISC))
4604 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4607 (void)SvOK_off(dstr);
4609 if (SvTAINTED(sstr))
4614 =for apidoc sv_setsv_mg
4616 Like C<sv_setsv>, but also handles 'set' magic.
4622 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4624 sv_setsv(dstr,sstr);
4628 #ifdef PERL_COPY_ON_WRITE
4630 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4632 STRLEN cur = SvCUR(sstr);
4633 STRLEN len = SvLEN(sstr);
4634 register char *new_pv;
4637 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4645 if (SvTHINKFIRST(dstr))
4646 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4647 else if (SvPVX(dstr))
4648 Safefree(SvPVX(dstr));
4652 (void)SvUPGRADE (dstr, SVt_PVIV);
4654 assert (SvPOK(sstr));
4655 assert (SvPOKp(sstr));
4656 assert (!SvIOK(sstr));
4657 assert (!SvIOKp(sstr));
4658 assert (!SvNOK(sstr));
4659 assert (!SvNOKp(sstr));
4661 if (SvIsCOW(sstr)) {
4663 if (SvLEN(sstr) == 0) {
4664 /* source is a COW shared hash key. */
4665 UV hash = SvUVX(sstr);
4666 DEBUG_C(PerlIO_printf(Perl_debug_log,
4667 "Fast copy on write: Sharing hash\n"));
4668 SvUV_set(dstr, hash);
4669 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4672 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4674 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4675 (void)SvUPGRADE (sstr, SVt_PVIV);
4676 SvREADONLY_on(sstr);
4678 DEBUG_C(PerlIO_printf(Perl_debug_log,
4679 "Fast copy on write: Converting sstr to COW\n"));
4680 SV_COW_NEXT_SV_SET(dstr, sstr);
4682 SV_COW_NEXT_SV_SET(sstr, dstr);
4683 new_pv = SvPVX(sstr);
4686 SvPV_set(dstr, new_pv);
4687 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4690 SvLEN_set(dstr, len);
4691 SvCUR_set(dstr, cur);
4700 =for apidoc sv_setpvn
4702 Copies a string into an SV. The C<len> parameter indicates the number of
4703 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4704 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4710 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4712 register char *dptr;
4714 SV_CHECK_THINKFIRST_COW_DROP(sv);
4720 /* len is STRLEN which is unsigned, need to copy to signed */
4723 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4725 (void)SvUPGRADE(sv, SVt_PV);
4727 SvGROW(sv, len + 1);
4729 Move(ptr,dptr,len,char);
4732 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4737 =for apidoc sv_setpvn_mg
4739 Like C<sv_setpvn>, but also handles 'set' magic.
4745 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4747 sv_setpvn(sv,ptr,len);
4752 =for apidoc sv_setpv
4754 Copies a string into an SV. The string must be null-terminated. Does not
4755 handle 'set' magic. See C<sv_setpv_mg>.
4761 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4763 register STRLEN len;
4765 SV_CHECK_THINKFIRST_COW_DROP(sv);
4771 (void)SvUPGRADE(sv, SVt_PV);
4773 SvGROW(sv, len + 1);
4774 Move(ptr,SvPVX(sv),len+1,char);
4776 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4781 =for apidoc sv_setpv_mg
4783 Like C<sv_setpv>, but also handles 'set' magic.
4789 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4796 =for apidoc sv_usepvn
4798 Tells an SV to use C<ptr> to find its string value. Normally the string is
4799 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4800 The C<ptr> should point to memory that was allocated by C<malloc>. The
4801 string length, C<len>, must be supplied. This function will realloc the
4802 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4803 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4804 See C<sv_usepvn_mg>.
4810 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4812 SV_CHECK_THINKFIRST_COW_DROP(sv);
4813 (void)SvUPGRADE(sv, SVt_PV);
4820 Renew(ptr, len+1, char);
4823 SvLEN_set(sv, len+1);
4825 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4830 =for apidoc sv_usepvn_mg
4832 Like C<sv_usepvn>, but also handles 'set' magic.
4838 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4840 sv_usepvn(sv,ptr,len);
4844 #ifdef PERL_COPY_ON_WRITE
4845 /* Need to do this *after* making the SV normal, as we need the buffer
4846 pointer to remain valid until after we've copied it. If we let go too early,
4847 another thread could invalidate it by unsharing last of the same hash key
4848 (which it can do by means other than releasing copy-on-write Svs)
4849 or by changing the other copy-on-write SVs in the loop. */
4851 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4852 U32 hash, SV *after)
4854 if (len) { /* this SV was SvIsCOW_normal(sv) */
4855 /* we need to find the SV pointing to us. */
4856 SV *current = SV_COW_NEXT_SV(after);
4858 if (current == sv) {
4859 /* The SV we point to points back to us (there were only two of us
4861 Hence other SV is no longer copy on write either. */
4863 SvREADONLY_off(after);
4865 /* We need to follow the pointers around the loop. */
4867 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4870 /* don't loop forever if the structure is bust, and we have
4871 a pointer into a closed loop. */
4872 assert (current != after);
4873 assert (SvPVX(current) == pvx);
4875 /* Make the SV before us point to the SV after us. */
4876 SV_COW_NEXT_SV_SET(current, after);
4879 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4884 Perl_sv_release_IVX(pTHX_ register SV *sv)
4887 sv_force_normal_flags(sv, 0);
4893 =for apidoc sv_force_normal_flags
4895 Undo various types of fakery on an SV: if the PV is a shared string, make
4896 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4897 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4898 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4899 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4900 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4901 set to some other value.) In addition, the C<flags> parameter gets passed to
4902 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4903 with flags set to 0.
4909 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4911 #ifdef PERL_COPY_ON_WRITE
4912 if (SvREADONLY(sv)) {
4913 /* At this point I believe I should acquire a global SV mutex. */
4915 char *pvx = SvPVX(sv);
4916 STRLEN len = SvLEN(sv);
4917 STRLEN cur = SvCUR(sv);
4918 U32 hash = SvUVX(sv);
4919 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4921 PerlIO_printf(Perl_debug_log,
4922 "Copy on write: Force normal %ld\n",
4928 /* This SV doesn't own the buffer, so need to New() a new one: */
4929 SvPV_set(sv, (char*)0);
4931 if (flags & SV_COW_DROP_PV) {
4932 /* OK, so we don't need to copy our buffer. */
4935 SvGROW(sv, cur + 1);
4936 Move(pvx,SvPVX(sv),cur,char);
4940 sv_release_COW(sv, pvx, cur, len, hash, next);
4945 else if (IN_PERL_RUNTIME)
4946 Perl_croak(aTHX_ PL_no_modify);
4947 /* At this point I believe that I can drop the global SV mutex. */
4950 if (SvREADONLY(sv)) {
4952 char *pvx = SvPVX(sv);
4953 int is_utf8 = SvUTF8(sv);
4954 STRLEN len = SvCUR(sv);
4955 U32 hash = SvUVX(sv);
4958 SvPV_set(sv, (char*)0);
4960 SvGROW(sv, len + 1);
4961 Move(pvx,SvPVX(sv),len,char);
4963 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4965 else if (IN_PERL_RUNTIME)
4966 Perl_croak(aTHX_ PL_no_modify);
4970 sv_unref_flags(sv, flags);
4971 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4976 =for apidoc sv_force_normal
4978 Undo various types of fakery on an SV: if the PV is a shared string, make
4979 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4980 an xpvmg. See also C<sv_force_normal_flags>.
4986 Perl_sv_force_normal(pTHX_ register SV *sv)
4988 sv_force_normal_flags(sv, 0);
4994 Efficient removal of characters from the beginning of the string buffer.
4995 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4996 the string buffer. The C<ptr> becomes the first character of the adjusted
4997 string. Uses the "OOK hack".
4998 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4999 refer to the same chunk of data.
5005 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
5007 register STRLEN delta;
5008 if (!ptr || !SvPOKp(sv))
5010 delta = ptr - SvPVX(sv);
5011 SV_CHECK_THINKFIRST(sv);
5012 if (SvTYPE(sv) < SVt_PVIV)
5013 sv_upgrade(sv,SVt_PVIV);
5016 if (!SvLEN(sv)) { /* make copy of shared string */
5017 const char *pvx = SvPVX(sv);
5018 STRLEN len = SvCUR(sv);
5019 SvGROW(sv, len + 1);
5020 Move(pvx,SvPVX(sv),len,char);
5024 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5025 and we do that anyway inside the SvNIOK_off
5027 SvFLAGS(sv) |= SVf_OOK;
5030 SvLEN_set(sv, SvLEN(sv) - delta);
5031 SvCUR_set(sv, SvCUR(sv) - delta);
5032 SvPV_set(sv, SvPVX(sv) + delta);
5033 SvIV_set(sv, SvIVX(sv) + delta);
5036 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5037 * this function provided for binary compatibility only
5041 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5043 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5047 =for apidoc sv_catpvn
5049 Concatenates the string onto the end of the string which is in the SV. The
5050 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5051 status set, then the bytes appended should be valid UTF-8.
5052 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5054 =for apidoc sv_catpvn_flags
5056 Concatenates the string onto the end of the string which is in the SV. The
5057 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5058 status set, then the bytes appended should be valid UTF-8.
5059 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5060 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5061 in terms of this function.
5067 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5070 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
5072 SvGROW(dsv, dlen + slen + 1);
5075 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5076 SvCUR_set(dsv, SvCUR(dsv) + slen);
5078 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5083 =for apidoc sv_catpvn_mg
5085 Like C<sv_catpvn>, but also handles 'set' magic.
5091 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5093 sv_catpvn(sv,ptr,len);
5097 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5098 * this function provided for binary compatibility only
5102 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5104 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5108 =for apidoc sv_catsv
5110 Concatenates the string from SV C<ssv> onto the end of the string in
5111 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5112 not 'set' magic. See C<sv_catsv_mg>.
5114 =for apidoc sv_catsv_flags
5116 Concatenates the string from SV C<ssv> onto the end of the string in
5117 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5118 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5119 and C<sv_catsv_nomg> are implemented in terms of this function.
5124 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5130 if ((spv = SvPV(ssv, slen))) {
5131 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5132 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5133 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5134 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5135 dsv->sv_flags doesn't have that bit set.
5136 Andy Dougherty 12 Oct 2001
5138 I32 sutf8 = DO_UTF8(ssv);
5141 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5143 dutf8 = DO_UTF8(dsv);
5145 if (dutf8 != sutf8) {
5147 /* Not modifying source SV, so taking a temporary copy. */
5148 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5150 sv_utf8_upgrade(csv);
5151 spv = SvPV(csv, slen);
5154 sv_utf8_upgrade_nomg(dsv);
5156 sv_catpvn_nomg(dsv, spv, slen);
5161 =for apidoc sv_catsv_mg
5163 Like C<sv_catsv>, but also handles 'set' magic.
5169 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5176 =for apidoc sv_catpv
5178 Concatenates the string onto the end of the string which is in the SV.
5179 If the SV has the UTF-8 status set, then the bytes appended should be
5180 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5185 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5187 register STRLEN len;
5193 junk = SvPV_force(sv, tlen);
5195 SvGROW(sv, tlen + len + 1);
5198 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5199 SvCUR_set(sv, SvCUR(sv) + len);
5200 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5205 =for apidoc sv_catpv_mg
5207 Like C<sv_catpv>, but also handles 'set' magic.
5213 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5222 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5223 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5230 Perl_newSV(pTHX_ STRLEN len)
5236 sv_upgrade(sv, SVt_PV);
5237 SvGROW(sv, len + 1);
5242 =for apidoc sv_magicext
5244 Adds magic to an SV, upgrading it if necessary. Applies the
5245 supplied vtable and returns a pointer to the magic added.
5247 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5248 In particular, you can add magic to SvREADONLY SVs, and add more than
5249 one instance of the same 'how'.
5251 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5252 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5253 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5254 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5256 (This is now used as a subroutine by C<sv_magic>.)
5261 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5262 const char* name, I32 namlen)
5266 if (SvTYPE(sv) < SVt_PVMG) {
5267 (void)SvUPGRADE(sv, SVt_PVMG);
5269 Newz(702,mg, 1, MAGIC);
5270 mg->mg_moremagic = SvMAGIC(sv);
5271 SvMAGIC_set(sv, mg);
5273 /* Sometimes a magic contains a reference loop, where the sv and
5274 object refer to each other. To prevent a reference loop that
5275 would prevent such objects being freed, we look for such loops
5276 and if we find one we avoid incrementing the object refcount.
5278 Note we cannot do this to avoid self-tie loops as intervening RV must
5279 have its REFCNT incremented to keep it in existence.
5282 if (!obj || obj == sv ||
5283 how == PERL_MAGIC_arylen ||
5284 how == PERL_MAGIC_qr ||
5285 how == PERL_MAGIC_symtab ||
5286 (SvTYPE(obj) == SVt_PVGV &&
5287 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5288 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5289 GvFORM(obj) == (CV*)sv)))
5294 mg->mg_obj = SvREFCNT_inc(obj);
5295 mg->mg_flags |= MGf_REFCOUNTED;
5298 /* Normal self-ties simply pass a null object, and instead of
5299 using mg_obj directly, use the SvTIED_obj macro to produce a
5300 new RV as needed. For glob "self-ties", we are tieing the PVIO
5301 with an RV obj pointing to the glob containing the PVIO. In
5302 this case, to avoid a reference loop, we need to weaken the
5306 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5307 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5313 mg->mg_len = namlen;
5316 mg->mg_ptr = savepvn(name, namlen);
5317 else if (namlen == HEf_SVKEY)
5318 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5320 mg->mg_ptr = (char *) name;
5322 mg->mg_virtual = vtable;
5326 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5331 =for apidoc sv_magic
5333 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5334 then adds a new magic item of type C<how> to the head of the magic list.
5336 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5337 handling of the C<name> and C<namlen> arguments.
5339 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5340 to add more than one instance of the same 'how'.
5346 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5348 const MGVTBL *vtable = 0;
5351 #ifdef PERL_COPY_ON_WRITE
5353 sv_force_normal_flags(sv, 0);
5355 if (SvREADONLY(sv)) {
5357 && how != PERL_MAGIC_regex_global
5358 && how != PERL_MAGIC_bm
5359 && how != PERL_MAGIC_fm
5360 && how != PERL_MAGIC_sv
5361 && how != PERL_MAGIC_backref
5364 Perl_croak(aTHX_ PL_no_modify);
5367 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5368 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5369 /* sv_magic() refuses to add a magic of the same 'how' as an
5372 if (how == PERL_MAGIC_taint)
5380 vtable = &PL_vtbl_sv;
5382 case PERL_MAGIC_overload:
5383 vtable = &PL_vtbl_amagic;
5385 case PERL_MAGIC_overload_elem:
5386 vtable = &PL_vtbl_amagicelem;
5388 case PERL_MAGIC_overload_table:
5389 vtable = &PL_vtbl_ovrld;
5392 vtable = &PL_vtbl_bm;
5394 case PERL_MAGIC_regdata:
5395 vtable = &PL_vtbl_regdata;
5397 case PERL_MAGIC_regdatum:
5398 vtable = &PL_vtbl_regdatum;
5400 case PERL_MAGIC_env:
5401 vtable = &PL_vtbl_env;
5404 vtable = &PL_vtbl_fm;
5406 case PERL_MAGIC_envelem:
5407 vtable = &PL_vtbl_envelem;
5409 case PERL_MAGIC_regex_global:
5410 vtable = &PL_vtbl_mglob;
5412 case PERL_MAGIC_isa:
5413 vtable = &PL_vtbl_isa;
5415 case PERL_MAGIC_isaelem:
5416 vtable = &PL_vtbl_isaelem;
5418 case PERL_MAGIC_nkeys:
5419 vtable = &PL_vtbl_nkeys;
5421 case PERL_MAGIC_dbfile:
5424 case PERL_MAGIC_dbline:
5425 vtable = &PL_vtbl_dbline;
5427 #ifdef USE_LOCALE_COLLATE
5428 case PERL_MAGIC_collxfrm:
5429 vtable = &PL_vtbl_collxfrm;
5431 #endif /* USE_LOCALE_COLLATE */
5432 case PERL_MAGIC_tied:
5433 vtable = &PL_vtbl_pack;
5435 case PERL_MAGIC_tiedelem:
5436 case PERL_MAGIC_tiedscalar:
5437 vtable = &PL_vtbl_packelem;
5440 vtable = &PL_vtbl_regexp;
5442 case PERL_MAGIC_sig:
5443 vtable = &PL_vtbl_sig;
5445 case PERL_MAGIC_sigelem:
5446 vtable = &PL_vtbl_sigelem;
5448 case PERL_MAGIC_taint:
5449 vtable = &PL_vtbl_taint;
5451 case PERL_MAGIC_uvar:
5452 vtable = &PL_vtbl_uvar;
5454 case PERL_MAGIC_vec:
5455 vtable = &PL_vtbl_vec;
5457 case PERL_MAGIC_rhash:
5458 case PERL_MAGIC_symtab:
5459 case PERL_MAGIC_vstring:
5462 case PERL_MAGIC_utf8:
5463 vtable = &PL_vtbl_utf8;
5465 case PERL_MAGIC_substr:
5466 vtable = &PL_vtbl_substr;
5468 case PERL_MAGIC_defelem:
5469 vtable = &PL_vtbl_defelem;
5471 case PERL_MAGIC_glob:
5472 vtable = &PL_vtbl_glob;
5474 case PERL_MAGIC_arylen:
5475 vtable = &PL_vtbl_arylen;
5477 case PERL_MAGIC_pos:
5478 vtable = &PL_vtbl_pos;
5480 case PERL_MAGIC_backref:
5481 vtable = &PL_vtbl_backref;
5483 case PERL_MAGIC_ext:
5484 /* Reserved for use by extensions not perl internals. */
5485 /* Useful for attaching extension internal data to perl vars. */
5486 /* Note that multiple extensions may clash if magical scalars */
5487 /* etc holding private data from one are passed to another. */
5490 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5493 /* Rest of work is done else where */
5494 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5497 case PERL_MAGIC_taint:
5500 case PERL_MAGIC_ext:
5501 case PERL_MAGIC_dbfile:
5508 =for apidoc sv_unmagic
5510 Removes all magic of type C<type> from an SV.
5516 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5520 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5523 for (mg = *mgp; mg; mg = *mgp) {
5524 if (mg->mg_type == type) {
5525 const MGVTBL* const vtbl = mg->mg_virtual;
5526 *mgp = mg->mg_moremagic;
5527 if (vtbl && vtbl->svt_free)
5528 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5529 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5531 Safefree(mg->mg_ptr);
5532 else if (mg->mg_len == HEf_SVKEY)
5533 SvREFCNT_dec((SV*)mg->mg_ptr);
5534 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5535 Safefree(mg->mg_ptr);
5537 if (mg->mg_flags & MGf_REFCOUNTED)
5538 SvREFCNT_dec(mg->mg_obj);
5542 mgp = &mg->mg_moremagic;
5546 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5553 =for apidoc sv_rvweaken
5555 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5556 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5557 push a back-reference to this RV onto the array of backreferences
5558 associated with that magic.
5564 Perl_sv_rvweaken(pTHX_ SV *sv)
5567 if (!SvOK(sv)) /* let undefs pass */
5570 Perl_croak(aTHX_ "Can't weaken a nonreference");
5571 else if (SvWEAKREF(sv)) {
5572 if (ckWARN(WARN_MISC))
5573 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5577 sv_add_backref(tsv, sv);
5583 /* Give tsv backref magic if it hasn't already got it, then push a
5584 * back-reference to sv onto the array associated with the backref magic.
5588 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5592 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5593 av = (AV*)mg->mg_obj;
5596 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5597 /* av now has a refcnt of 2, which avoids it getting freed
5598 * before us during global cleanup. The extra ref is removed
5599 * by magic_killbackrefs() when tsv is being freed */
5601 if (AvFILLp(av) >= AvMAX(av)) {
5603 SV **svp = AvARRAY(av);
5604 for (i = AvFILLp(av); i >= 0; i--)
5606 svp[i] = sv; /* reuse the slot */
5609 av_extend(av, AvFILLp(av)+1);
5611 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5614 /* delete a back-reference to ourselves from the backref magic associated
5615 * with the SV we point to.
5619 S_sv_del_backref(pTHX_ SV *sv)
5626 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5627 Perl_croak(aTHX_ "panic: del_backref");
5628 av = (AV *)mg->mg_obj;
5630 for (i = AvFILLp(av); i >= 0; i--)
5631 if (svp[i] == sv) svp[i] = Nullsv;
5635 =for apidoc sv_insert
5637 Inserts a string at the specified offset/length within the SV. Similar to
5638 the Perl substr() function.
5644 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5648 register char *midend;
5649 register char *bigend;
5655 Perl_croak(aTHX_ "Can't modify non-existent substring");
5656 SvPV_force(bigstr, curlen);
5657 (void)SvPOK_only_UTF8(bigstr);
5658 if (offset + len > curlen) {
5659 SvGROW(bigstr, offset+len+1);
5660 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5661 SvCUR_set(bigstr, offset+len);
5665 i = littlelen - len;
5666 if (i > 0) { /* string might grow */
5667 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5668 mid = big + offset + len;
5669 midend = bigend = big + SvCUR(bigstr);
5672 while (midend > mid) /* shove everything down */
5673 *--bigend = *--midend;
5674 Move(little,big+offset,littlelen,char);
5675 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5680 Move(little,SvPVX(bigstr)+offset,len,char);
5685 big = SvPVX(bigstr);
5688 bigend = big + SvCUR(bigstr);
5690 if (midend > bigend)
5691 Perl_croak(aTHX_ "panic: sv_insert");
5693 if (mid - big > bigend - midend) { /* faster to shorten from end */
5695 Move(little, mid, littlelen,char);
5698 i = bigend - midend;
5700 Move(midend, mid, i,char);
5704 SvCUR_set(bigstr, mid - big);
5707 else if ((i = mid - big)) { /* faster from front */
5708 midend -= littlelen;
5710 sv_chop(bigstr,midend-i);
5715 Move(little, mid, littlelen,char);
5717 else if (littlelen) {
5718 midend -= littlelen;
5719 sv_chop(bigstr,midend);
5720 Move(little,midend,littlelen,char);
5723 sv_chop(bigstr,midend);
5729 =for apidoc sv_replace
5731 Make the first argument a copy of the second, then delete the original.
5732 The target SV physically takes over ownership of the body of the source SV
5733 and inherits its flags; however, the target keeps any magic it owns,
5734 and any magic in the source is discarded.
5735 Note that this is a rather specialist SV copying operation; most of the
5736 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5742 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5744 const U32 refcnt = SvREFCNT(sv);
5745 SV_CHECK_THINKFIRST_COW_DROP(sv);
5746 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5747 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5748 if (SvMAGICAL(sv)) {
5752 sv_upgrade(nsv, SVt_PVMG);
5753 SvMAGIC_set(nsv, SvMAGIC(sv));
5754 SvFLAGS(nsv) |= SvMAGICAL(sv);
5756 SvMAGIC_set(sv, NULL);
5760 assert(!SvREFCNT(sv));
5761 #ifdef DEBUG_LEAKING_SCALARS
5762 sv->sv_flags = nsv->sv_flags;
5763 sv->sv_any = nsv->sv_any;
5764 sv->sv_refcnt = nsv->sv_refcnt;
5766 StructCopy(nsv,sv,SV);
5768 /* Currently could join these into one piece of pointer arithmetic, but
5769 it would be unclear. */
5770 if(SvTYPE(sv) == SVt_IV)
5772 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5773 else if (SvTYPE(sv) == SVt_RV) {
5774 SvANY(sv) = &sv->sv_u.svu_rv;
5778 #ifdef PERL_COPY_ON_WRITE
5779 if (SvIsCOW_normal(nsv)) {
5780 /* We need to follow the pointers around the loop to make the
5781 previous SV point to sv, rather than nsv. */
5784 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5787 assert(SvPVX(current) == SvPVX(nsv));
5789 /* Make the SV before us point to the SV after us. */
5791 PerlIO_printf(Perl_debug_log, "previous is\n");
5793 PerlIO_printf(Perl_debug_log,
5794 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5795 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5797 SV_COW_NEXT_SV_SET(current, sv);
5800 SvREFCNT(sv) = refcnt;
5801 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5807 =for apidoc sv_clear
5809 Clear an SV: call any destructors, free up any memory used by the body,
5810 and free the body itself. The SV's head is I<not> freed, although
5811 its type is set to all 1's so that it won't inadvertently be assumed
5812 to be live during global destruction etc.
5813 This function should only be called when REFCNT is zero. Most of the time
5814 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5821 Perl_sv_clear(pTHX_ register SV *sv)
5826 assert(SvREFCNT(sv) == 0);
5829 if (PL_defstash) { /* Still have a symbol table? */
5836 stash = SvSTASH(sv);
5837 destructor = StashHANDLER(stash,DESTROY);
5839 SV* tmpref = newRV(sv);
5840 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5842 PUSHSTACKi(PERLSI_DESTROY);
5847 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5853 if(SvREFCNT(tmpref) < 2) {
5854 /* tmpref is not kept alive! */
5856 SvRV_set(tmpref, NULL);
5859 SvREFCNT_dec(tmpref);
5861 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5865 if (PL_in_clean_objs)
5866 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5868 /* DESTROY gave object new lease on life */
5874 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5875 SvOBJECT_off(sv); /* Curse the object. */
5876 if (SvTYPE(sv) != SVt_PVIO)
5877 --PL_sv_objcount; /* XXX Might want something more general */
5880 if (SvTYPE(sv) >= SVt_PVMG) {
5883 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5884 SvREFCNT_dec(SvSTASH(sv));
5887 switch (SvTYPE(sv)) {
5890 IoIFP(sv) != PerlIO_stdin() &&
5891 IoIFP(sv) != PerlIO_stdout() &&
5892 IoIFP(sv) != PerlIO_stderr())
5894 io_close((IO*)sv, FALSE);
5896 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5897 PerlDir_close(IoDIRP(sv));
5898 IoDIRP(sv) = (DIR*)NULL;
5899 Safefree(IoTOP_NAME(sv));
5900 Safefree(IoFMT_NAME(sv));
5901 Safefree(IoBOTTOM_NAME(sv));
5916 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5917 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5918 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5919 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5921 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5922 SvREFCNT_dec(LvTARG(sv));
5926 Safefree(GvNAME(sv));
5927 /* cannot decrease stash refcount yet, as we might recursively delete
5928 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5929 of stash until current sv is completely gone.
5930 -- JohnPC, 27 Mar 1998 */
5931 stash = GvSTASH(sv);
5937 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5939 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
5940 /* Don't even bother with turning off the OOK flag. */
5949 SvREFCNT_dec(SvRV(sv));
5951 #ifdef PERL_COPY_ON_WRITE
5952 else if (SvPVX(sv)) {
5954 /* I believe I need to grab the global SV mutex here and
5955 then recheck the COW status. */
5957 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5960 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5961 SvUVX(sv), SV_COW_NEXT_SV(sv));
5962 /* And drop it here. */
5964 } else if (SvLEN(sv)) {
5965 Safefree(SvPVX(sv));
5969 else if (SvPVX(sv) && SvLEN(sv))
5970 Safefree(SvPVX(sv));
5971 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5972 unsharepvn(SvPVX(sv),
5973 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5987 switch (SvTYPE(sv)) {
6001 del_XPVIV(SvANY(sv));
6004 del_XPVNV(SvANY(sv));
6007 del_XPVMG(SvANY(sv));
6010 del_XPVLV(SvANY(sv));
6013 del_XPVAV(SvANY(sv));
6016 del_XPVHV(SvANY(sv));
6019 del_XPVCV(SvANY(sv));
6022 del_XPVGV(SvANY(sv));
6023 /* code duplication for increased performance. */
6024 SvFLAGS(sv) &= SVf_BREAK;
6025 SvFLAGS(sv) |= SVTYPEMASK;
6026 /* decrease refcount of the stash that owns this GV, if any */
6028 SvREFCNT_dec(stash);
6029 return; /* not break, SvFLAGS reset already happened */
6031 del_XPVBM(SvANY(sv));
6034 del_XPVFM(SvANY(sv));
6037 del_XPVIO(SvANY(sv));
6040 SvFLAGS(sv) &= SVf_BREAK;
6041 SvFLAGS(sv) |= SVTYPEMASK;
6045 =for apidoc sv_newref
6047 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6054 Perl_sv_newref(pTHX_ SV *sv)
6064 Decrement an SV's reference count, and if it drops to zero, call
6065 C<sv_clear> to invoke destructors and free up any memory used by
6066 the body; finally, deallocate the SV's head itself.
6067 Normally called via a wrapper macro C<SvREFCNT_dec>.
6073 Perl_sv_free(pTHX_ SV *sv)
6078 if (SvREFCNT(sv) == 0) {
6079 if (SvFLAGS(sv) & SVf_BREAK)
6080 /* this SV's refcnt has been artificially decremented to
6081 * trigger cleanup */
6083 if (PL_in_clean_all) /* All is fair */
6085 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6086 /* make sure SvREFCNT(sv)==0 happens very seldom */
6087 SvREFCNT(sv) = (~(U32)0)/2;
6090 if (ckWARN_d(WARN_INTERNAL))
6091 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6092 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6093 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6096 if (--(SvREFCNT(sv)) > 0)
6098 Perl_sv_free2(aTHX_ sv);
6102 Perl_sv_free2(pTHX_ SV *sv)
6107 if (ckWARN_d(WARN_DEBUGGING))
6108 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6109 "Attempt to free temp prematurely: SV 0x%"UVxf
6110 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6114 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6115 /* make sure SvREFCNT(sv)==0 happens very seldom */
6116 SvREFCNT(sv) = (~(U32)0)/2;
6127 Returns the length of the string in the SV. Handles magic and type
6128 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6134 Perl_sv_len(pTHX_ register SV *sv)
6142 len = mg_length(sv);
6144 (void)SvPV(sv, len);
6149 =for apidoc sv_len_utf8
6151 Returns the number of characters in the string in an SV, counting wide
6152 UTF-8 bytes as a single character. Handles magic and type coercion.
6158 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6159 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6160 * (Note that the mg_len is not the length of the mg_ptr field.)
6165 Perl_sv_len_utf8(pTHX_ register SV *sv)
6171 return mg_length(sv);
6175 const U8 *s = (U8*)SvPV(sv, len);
6176 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6178 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6180 #ifdef PERL_UTF8_CACHE_ASSERT
6181 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6185 ulen = Perl_utf8_length(aTHX_ s, s + len);
6186 if (!mg && !SvREADONLY(sv)) {
6187 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6188 mg = mg_find(sv, PERL_MAGIC_utf8);
6198 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6199 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6200 * between UTF-8 and byte offsets. There are two (substr offset and substr
6201 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6202 * and byte offset) cache positions.
6204 * The mg_len field is used by sv_len_utf8(), see its comments.
6205 * Note that the mg_len is not the length of the mg_ptr field.
6209 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 offsetp, U8 *s, U8 *start)
6213 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6215 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6219 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6221 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6222 (*mgp)->mg_ptr = (char *) *cachep;
6226 (*cachep)[i] = offsetp;
6227 (*cachep)[i+1] = s - start;
6235 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6236 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6237 * between UTF-8 and byte offsets. See also the comments of
6238 * S_utf8_mg_pos_init().
6242 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6246 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6248 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6249 if (*mgp && (*mgp)->mg_ptr) {
6250 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6251 ASSERT_UTF8_CACHE(*cachep);
6252 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6254 else { /* We will skip to the right spot. */
6259 /* The assumption is that going backward is half
6260 * the speed of going forward (that's where the
6261 * 2 * backw in the below comes from). (The real
6262 * figure of course depends on the UTF-8 data.) */
6264 if ((*cachep)[i] > (STRLEN)uoff) {
6266 backw = (*cachep)[i] - (STRLEN)uoff;
6268 if (forw < 2 * backw)
6271 p = start + (*cachep)[i+1];
6273 /* Try this only for the substr offset (i == 0),
6274 * not for the substr length (i == 2). */
6275 else if (i == 0) { /* (*cachep)[i] < uoff */
6276 const STRLEN ulen = sv_len_utf8(sv);
6278 if ((STRLEN)uoff < ulen) {
6279 forw = (STRLEN)uoff - (*cachep)[i];
6280 backw = ulen - (STRLEN)uoff;
6282 if (forw < 2 * backw)
6283 p = start + (*cachep)[i+1];
6288 /* If the string is not long enough for uoff,
6289 * we could extend it, but not at this low a level. */
6293 if (forw < 2 * backw) {
6300 while (UTF8_IS_CONTINUATION(*p))
6305 /* Update the cache. */
6306 (*cachep)[i] = (STRLEN)uoff;
6307 (*cachep)[i+1] = p - start;
6309 /* Drop the stale "length" cache */
6318 if (found) { /* Setup the return values. */
6319 *offsetp = (*cachep)[i+1];
6320 *sp = start + *offsetp;
6323 *offsetp = send - start;
6325 else if (*sp < start) {
6331 #ifdef PERL_UTF8_CACHE_ASSERT
6336 while (n-- && s < send)
6340 assert(*offsetp == s - start);
6341 assert((*cachep)[0] == (STRLEN)uoff);
6342 assert((*cachep)[1] == *offsetp);
6344 ASSERT_UTF8_CACHE(*cachep);
6353 =for apidoc sv_pos_u2b
6355 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6356 the start of the string, to a count of the equivalent number of bytes; if
6357 lenp is non-zero, it does the same to lenp, but this time starting from
6358 the offset, rather than from the start of the string. Handles magic and
6365 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6366 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6367 * byte offsets. See also the comments of S_utf8_mg_pos().
6372 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6383 start = s = (U8*)SvPV(sv, len);
6385 I32 uoffset = *offsetp;
6390 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6392 if (!found && uoffset > 0) {
6393 while (s < send && uoffset--)
6397 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6399 *offsetp = s - start;
6404 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6408 if (!found && *lenp > 0) {
6411 while (s < send && ulen--)
6415 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6419 ASSERT_UTF8_CACHE(cache);
6431 =for apidoc sv_pos_b2u
6433 Converts the value pointed to by offsetp from a count of bytes from the
6434 start of the string, to a count of the equivalent number of UTF-8 chars.
6435 Handles magic and type coercion.
6441 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6442 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6443 * byte offsets. See also the comments of S_utf8_mg_pos().
6448 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6456 s = (U8*)SvPV(sv, len);
6457 if ((I32)len < *offsetp)
6458 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6460 U8* send = s + *offsetp;
6462 STRLEN *cache = NULL;
6466 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6467 mg = mg_find(sv, PERL_MAGIC_utf8);
6468 if (mg && mg->mg_ptr) {
6469 cache = (STRLEN *) mg->mg_ptr;
6470 if (cache[1] == (STRLEN)*offsetp) {
6471 /* An exact match. */
6472 *offsetp = cache[0];
6476 else if (cache[1] < (STRLEN)*offsetp) {
6477 /* We already know part of the way. */
6480 /* Let the below loop do the rest. */
6482 else { /* cache[1] > *offsetp */
6483 /* We already know all of the way, now we may
6484 * be able to walk back. The same assumption
6485 * is made as in S_utf8_mg_pos(), namely that
6486 * walking backward is twice slower than
6487 * walking forward. */
6488 STRLEN forw = *offsetp;
6489 STRLEN backw = cache[1] - *offsetp;
6491 if (!(forw < 2 * backw)) {
6492 U8 *p = s + cache[1];
6499 while (UTF8_IS_CONTINUATION(*p)) {
6507 *offsetp = cache[0];
6509 /* Drop the stale "length" cache */
6517 ASSERT_UTF8_CACHE(cache);
6523 /* Call utf8n_to_uvchr() to validate the sequence
6524 * (unless a simple non-UTF character) */
6525 if (!UTF8_IS_INVARIANT(*s))
6526 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6535 if (!SvREADONLY(sv)) {
6537 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6538 mg = mg_find(sv, PERL_MAGIC_utf8);
6543 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6544 mg->mg_ptr = (char *) cache;
6549 cache[1] = *offsetp;
6550 /* Drop the stale "length" cache */
6563 Returns a boolean indicating whether the strings in the two SVs are
6564 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6565 coerce its args to strings if necessary.
6571 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6579 SV* svrecode = Nullsv;
6586 pv1 = SvPV(sv1, cur1);
6593 pv2 = SvPV(sv2, cur2);
6595 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6596 /* Differing utf8ness.
6597 * Do not UTF8size the comparands as a side-effect. */
6600 svrecode = newSVpvn(pv2, cur2);
6601 sv_recode_to_utf8(svrecode, PL_encoding);
6602 pv2 = SvPV(svrecode, cur2);
6605 svrecode = newSVpvn(pv1, cur1);
6606 sv_recode_to_utf8(svrecode, PL_encoding);
6607 pv1 = SvPV(svrecode, cur1);
6609 /* Now both are in UTF-8. */
6611 SvREFCNT_dec(svrecode);
6616 bool is_utf8 = TRUE;
6619 /* sv1 is the UTF-8 one,
6620 * if is equal it must be downgrade-able */
6621 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6627 /* sv2 is the UTF-8 one,
6628 * if is equal it must be downgrade-able */
6629 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6635 /* Downgrade not possible - cannot be eq */
6643 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6646 SvREFCNT_dec(svrecode);
6657 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6658 string in C<sv1> is less than, equal to, or greater than the string in
6659 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6660 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6666 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6669 const char *pv1, *pv2;
6672 SV *svrecode = Nullsv;
6679 pv1 = SvPV(sv1, cur1);
6686 pv2 = SvPV(sv2, cur2);
6688 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6689 /* Differing utf8ness.
6690 * Do not UTF8size the comparands as a side-effect. */
6693 svrecode = newSVpvn(pv2, cur2);
6694 sv_recode_to_utf8(svrecode, PL_encoding);
6695 pv2 = SvPV(svrecode, cur2);
6698 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6703 svrecode = newSVpvn(pv1, cur1);
6704 sv_recode_to_utf8(svrecode, PL_encoding);
6705 pv1 = SvPV(svrecode, cur1);
6708 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6714 cmp = cur2 ? -1 : 0;
6718 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6721 cmp = retval < 0 ? -1 : 1;
6722 } else if (cur1 == cur2) {
6725 cmp = cur1 < cur2 ? -1 : 1;
6730 SvREFCNT_dec(svrecode);
6739 =for apidoc sv_cmp_locale
6741 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6742 'use bytes' aware, handles get magic, and will coerce its args to strings
6743 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6749 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6751 #ifdef USE_LOCALE_COLLATE
6757 if (PL_collation_standard)
6761 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6763 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6765 if (!pv1 || !len1) {
6776 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6779 return retval < 0 ? -1 : 1;
6782 * When the result of collation is equality, that doesn't mean
6783 * that there are no differences -- some locales exclude some
6784 * characters from consideration. So to avoid false equalities,
6785 * we use the raw string as a tiebreaker.
6791 #endif /* USE_LOCALE_COLLATE */
6793 return sv_cmp(sv1, sv2);
6797 #ifdef USE_LOCALE_COLLATE
6800 =for apidoc sv_collxfrm
6802 Add Collate Transform magic to an SV if it doesn't already have it.
6804 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6805 scalar data of the variable, but transformed to such a format that a normal
6806 memory comparison can be used to compare the data according to the locale
6813 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6817 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6818 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6823 Safefree(mg->mg_ptr);
6825 if ((xf = mem_collxfrm(s, len, &xlen))) {
6826 if (SvREADONLY(sv)) {
6829 return xf + sizeof(PL_collation_ix);
6832 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6833 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6846 if (mg && mg->mg_ptr) {
6848 return mg->mg_ptr + sizeof(PL_collation_ix);
6856 #endif /* USE_LOCALE_COLLATE */
6861 Get a line from the filehandle and store it into the SV, optionally
6862 appending to the currently-stored string.
6868 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6872 register STDCHAR rslast;
6873 register STDCHAR *bp;
6879 if (SvTHINKFIRST(sv))
6880 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6881 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6883 However, perlbench says it's slower, because the existing swipe code
6884 is faster than copy on write.
6885 Swings and roundabouts. */
6886 (void)SvUPGRADE(sv, SVt_PV);
6891 if (PerlIO_isutf8(fp)) {
6893 sv_utf8_upgrade_nomg(sv);
6894 sv_pos_u2b(sv,&append,0);
6896 } else if (SvUTF8(sv)) {
6897 SV *tsv = NEWSV(0,0);
6898 sv_gets(tsv, fp, 0);
6899 sv_utf8_upgrade_nomg(tsv);
6900 SvCUR_set(sv,append);
6903 goto return_string_or_null;
6908 if (PerlIO_isutf8(fp))
6911 if (IN_PERL_COMPILETIME) {
6912 /* we always read code in line mode */
6916 else if (RsSNARF(PL_rs)) {
6917 /* If it is a regular disk file use size from stat() as estimate
6918 of amount we are going to read - may result in malloc-ing
6919 more memory than we realy need if layers bellow reduce
6920 size we read (e.g. CRLF or a gzip layer)
6923 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6924 const Off_t offset = PerlIO_tell(fp);
6925 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6926 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6932 else if (RsRECORD(PL_rs)) {
6936 /* Grab the size of the record we're getting */
6937 recsize = SvIV(SvRV(PL_rs));
6938 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6941 /* VMS wants read instead of fread, because fread doesn't respect */
6942 /* RMS record boundaries. This is not necessarily a good thing to be */
6943 /* doing, but we've got no other real choice - except avoid stdio
6944 as implementation - perhaps write a :vms layer ?
6946 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6948 bytesread = PerlIO_read(fp, buffer, recsize);
6952 SvCUR_set(sv, bytesread += append);
6953 buffer[bytesread] = '\0';
6954 goto return_string_or_null;
6956 else if (RsPARA(PL_rs)) {
6962 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6963 if (PerlIO_isutf8(fp)) {
6964 rsptr = SvPVutf8(PL_rs, rslen);
6967 if (SvUTF8(PL_rs)) {
6968 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6969 Perl_croak(aTHX_ "Wide character in $/");
6972 rsptr = SvPV(PL_rs, rslen);
6976 rslast = rslen ? rsptr[rslen - 1] : '\0';
6978 if (rspara) { /* have to do this both before and after */
6979 do { /* to make sure file boundaries work right */
6982 i = PerlIO_getc(fp);
6986 PerlIO_ungetc(fp,i);
6992 /* See if we know enough about I/O mechanism to cheat it ! */
6994 /* This used to be #ifdef test - it is made run-time test for ease
6995 of abstracting out stdio interface. One call should be cheap
6996 enough here - and may even be a macro allowing compile
7000 if (PerlIO_fast_gets(fp)) {
7003 * We're going to steal some values from the stdio struct
7004 * and put EVERYTHING in the innermost loop into registers.
7006 register STDCHAR *ptr;
7010 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7011 /* An ungetc()d char is handled separately from the regular
7012 * buffer, so we getc() it back out and stuff it in the buffer.
7014 i = PerlIO_getc(fp);
7015 if (i == EOF) return 0;
7016 *(--((*fp)->_ptr)) = (unsigned char) i;
7020 /* Here is some breathtakingly efficient cheating */
7022 cnt = PerlIO_get_cnt(fp); /* get count into register */
7023 /* make sure we have the room */
7024 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7025 /* Not room for all of it
7026 if we are looking for a separator and room for some
7028 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7029 /* just process what we have room for */
7030 shortbuffered = cnt - SvLEN(sv) + append + 1;
7031 cnt -= shortbuffered;
7035 /* remember that cnt can be negative */
7036 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7041 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7042 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7043 DEBUG_P(PerlIO_printf(Perl_debug_log,
7044 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7045 DEBUG_P(PerlIO_printf(Perl_debug_log,
7046 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7047 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7048 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7053 while (cnt > 0) { /* this | eat */
7055 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7056 goto thats_all_folks; /* screams | sed :-) */
7060 Copy(ptr, bp, cnt, char); /* this | eat */
7061 bp += cnt; /* screams | dust */
7062 ptr += cnt; /* louder | sed :-) */
7067 if (shortbuffered) { /* oh well, must extend */
7068 cnt = shortbuffered;
7070 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7072 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7073 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7077 DEBUG_P(PerlIO_printf(Perl_debug_log,
7078 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7079 PTR2UV(ptr),(long)cnt));
7080 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7082 DEBUG_P(PerlIO_printf(Perl_debug_log,
7083 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7084 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7085 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7087 /* This used to call 'filbuf' in stdio form, but as that behaves like
7088 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7089 another abstraction. */
7090 i = PerlIO_getc(fp); /* get more characters */
7092 DEBUG_P(PerlIO_printf(Perl_debug_log,
7093 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7094 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7095 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7097 cnt = PerlIO_get_cnt(fp);
7098 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7099 DEBUG_P(PerlIO_printf(Perl_debug_log,
7100 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7102 if (i == EOF) /* all done for ever? */
7103 goto thats_really_all_folks;
7105 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7107 SvGROW(sv, bpx + cnt + 2);
7108 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7110 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7112 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7113 goto thats_all_folks;
7117 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7118 memNE((char*)bp - rslen, rsptr, rslen))
7119 goto screamer; /* go back to the fray */
7120 thats_really_all_folks:
7122 cnt += shortbuffered;
7123 DEBUG_P(PerlIO_printf(Perl_debug_log,
7124 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7125 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7126 DEBUG_P(PerlIO_printf(Perl_debug_log,
7127 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7128 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7129 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7131 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7132 DEBUG_P(PerlIO_printf(Perl_debug_log,
7133 "Screamer: done, len=%ld, string=|%.*s|\n",
7134 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7138 /*The big, slow, and stupid way. */
7139 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7141 New(0, buf, 8192, STDCHAR);
7149 const register STDCHAR *bpe = buf + sizeof(buf);
7151 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7152 ; /* keep reading */
7156 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7157 /* Accomodate broken VAXC compiler, which applies U8 cast to
7158 * both args of ?: operator, causing EOF to change into 255
7161 i = (U8)buf[cnt - 1];
7167 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7169 sv_catpvn(sv, (char *) buf, cnt);
7171 sv_setpvn(sv, (char *) buf, cnt);
7173 if (i != EOF && /* joy */
7175 SvCUR(sv) < rslen ||
7176 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7180 * If we're reading from a TTY and we get a short read,
7181 * indicating that the user hit his EOF character, we need
7182 * to notice it now, because if we try to read from the TTY
7183 * again, the EOF condition will disappear.
7185 * The comparison of cnt to sizeof(buf) is an optimization
7186 * that prevents unnecessary calls to feof().
7190 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7194 #ifdef USE_HEAP_INSTEAD_OF_STACK
7199 if (rspara) { /* have to do this both before and after */
7200 while (i != EOF) { /* to make sure file boundaries work right */
7201 i = PerlIO_getc(fp);
7203 PerlIO_ungetc(fp,i);
7209 return_string_or_null:
7210 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7216 Auto-increment of the value in the SV, doing string to numeric conversion
7217 if necessary. Handles 'get' magic.
7223 Perl_sv_inc(pTHX_ register SV *sv)
7232 if (SvTHINKFIRST(sv)) {
7234 sv_force_normal_flags(sv, 0);
7235 if (SvREADONLY(sv)) {
7236 if (IN_PERL_RUNTIME)
7237 Perl_croak(aTHX_ PL_no_modify);
7241 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7243 i = PTR2IV(SvRV(sv));
7248 flags = SvFLAGS(sv);
7249 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7250 /* It's (privately or publicly) a float, but not tested as an
7251 integer, so test it to see. */
7253 flags = SvFLAGS(sv);
7255 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7256 /* It's publicly an integer, or privately an integer-not-float */
7257 #ifdef PERL_PRESERVE_IVUV
7261 if (SvUVX(sv) == UV_MAX)
7262 sv_setnv(sv, UV_MAX_P1);
7264 (void)SvIOK_only_UV(sv);
7265 SvUV_set(sv, SvUVX(sv) + 1);
7267 if (SvIVX(sv) == IV_MAX)
7268 sv_setuv(sv, (UV)IV_MAX + 1);
7270 (void)SvIOK_only(sv);
7271 SvIV_set(sv, SvIVX(sv) + 1);
7276 if (flags & SVp_NOK) {
7277 (void)SvNOK_only(sv);
7278 SvNV_set(sv, SvNVX(sv) + 1.0);
7282 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7283 if ((flags & SVTYPEMASK) < SVt_PVIV)
7284 sv_upgrade(sv, SVt_IV);
7285 (void)SvIOK_only(sv);
7290 while (isALPHA(*d)) d++;
7291 while (isDIGIT(*d)) d++;
7293 #ifdef PERL_PRESERVE_IVUV
7294 /* Got to punt this as an integer if needs be, but we don't issue
7295 warnings. Probably ought to make the sv_iv_please() that does
7296 the conversion if possible, and silently. */
7297 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7298 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7299 /* Need to try really hard to see if it's an integer.
7300 9.22337203685478e+18 is an integer.
7301 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7302 so $a="9.22337203685478e+18"; $a+0; $a++
7303 needs to be the same as $a="9.22337203685478e+18"; $a++
7310 /* sv_2iv *should* have made this an NV */
7311 if (flags & SVp_NOK) {
7312 (void)SvNOK_only(sv);
7313 SvNV_set(sv, SvNVX(sv) + 1.0);
7316 /* I don't think we can get here. Maybe I should assert this
7317 And if we do get here I suspect that sv_setnv will croak. NWC
7319 #if defined(USE_LONG_DOUBLE)
7320 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",
7321 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7323 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7324 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7327 #endif /* PERL_PRESERVE_IVUV */
7328 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7332 while (d >= SvPVX(sv)) {
7340 /* MKS: The original code here died if letters weren't consecutive.
7341 * at least it didn't have to worry about non-C locales. The
7342 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7343 * arranged in order (although not consecutively) and that only
7344 * [A-Za-z] are accepted by isALPHA in the C locale.
7346 if (*d != 'z' && *d != 'Z') {
7347 do { ++*d; } while (!isALPHA(*d));
7350 *(d--) -= 'z' - 'a';
7355 *(d--) -= 'z' - 'a' + 1;
7359 /* oh,oh, the number grew */
7360 SvGROW(sv, SvCUR(sv) + 2);
7361 SvCUR_set(sv, SvCUR(sv) + 1);
7362 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7373 Auto-decrement of the value in the SV, doing string to numeric conversion
7374 if necessary. Handles 'get' magic.
7380 Perl_sv_dec(pTHX_ register SV *sv)
7388 if (SvTHINKFIRST(sv)) {
7390 sv_force_normal_flags(sv, 0);
7391 if (SvREADONLY(sv)) {
7392 if (IN_PERL_RUNTIME)
7393 Perl_croak(aTHX_ PL_no_modify);
7397 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7399 i = PTR2IV(SvRV(sv));
7404 /* Unlike sv_inc we don't have to worry about string-never-numbers
7405 and keeping them magic. But we mustn't warn on punting */
7406 flags = SvFLAGS(sv);
7407 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7408 /* It's publicly an integer, or privately an integer-not-float */
7409 #ifdef PERL_PRESERVE_IVUV
7413 if (SvUVX(sv) == 0) {
7414 (void)SvIOK_only(sv);
7418 (void)SvIOK_only_UV(sv);
7419 SvUV_set(sv, SvUVX(sv) + 1);
7422 if (SvIVX(sv) == IV_MIN)
7423 sv_setnv(sv, (NV)IV_MIN - 1.0);
7425 (void)SvIOK_only(sv);
7426 SvIV_set(sv, SvIVX(sv) - 1);
7431 if (flags & SVp_NOK) {
7432 SvNV_set(sv, SvNVX(sv) - 1.0);
7433 (void)SvNOK_only(sv);
7436 if (!(flags & SVp_POK)) {
7437 if ((flags & SVTYPEMASK) < SVt_PVNV)
7438 sv_upgrade(sv, SVt_NV);
7440 (void)SvNOK_only(sv);
7443 #ifdef PERL_PRESERVE_IVUV
7445 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7446 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7447 /* Need to try really hard to see if it's an integer.
7448 9.22337203685478e+18 is an integer.
7449 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7450 so $a="9.22337203685478e+18"; $a+0; $a--
7451 needs to be the same as $a="9.22337203685478e+18"; $a--
7458 /* sv_2iv *should* have made this an NV */
7459 if (flags & SVp_NOK) {
7460 (void)SvNOK_only(sv);
7461 SvNV_set(sv, SvNVX(sv) - 1.0);
7464 /* I don't think we can get here. Maybe I should assert this
7465 And if we do get here I suspect that sv_setnv will croak. NWC
7467 #if defined(USE_LONG_DOUBLE)
7468 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",
7469 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7471 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7472 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7476 #endif /* PERL_PRESERVE_IVUV */
7477 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7481 =for apidoc sv_mortalcopy
7483 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7484 The new SV is marked as mortal. It will be destroyed "soon", either by an
7485 explicit call to FREETMPS, or by an implicit call at places such as
7486 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7491 /* Make a string that will exist for the duration of the expression
7492 * evaluation. Actually, it may have to last longer than that, but
7493 * hopefully we won't free it until it has been assigned to a
7494 * permanent location. */
7497 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7502 sv_setsv(sv,oldstr);
7504 PL_tmps_stack[++PL_tmps_ix] = sv;
7510 =for apidoc sv_newmortal
7512 Creates a new null SV which is mortal. The reference count of the SV is
7513 set to 1. It will be destroyed "soon", either by an explicit call to
7514 FREETMPS, or by an implicit call at places such as statement boundaries.
7515 See also C<sv_mortalcopy> and C<sv_2mortal>.
7521 Perl_sv_newmortal(pTHX)
7526 SvFLAGS(sv) = SVs_TEMP;
7528 PL_tmps_stack[++PL_tmps_ix] = sv;
7533 =for apidoc sv_2mortal
7535 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7536 by an explicit call to FREETMPS, or by an implicit call at places such as
7537 statement boundaries. SvTEMP() is turned on which means that the SV's
7538 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7539 and C<sv_mortalcopy>.
7545 Perl_sv_2mortal(pTHX_ register SV *sv)
7550 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7553 PL_tmps_stack[++PL_tmps_ix] = sv;
7561 Creates a new SV and copies a string into it. The reference count for the
7562 SV is set to 1. If C<len> is zero, Perl will compute the length using
7563 strlen(). For efficiency, consider using C<newSVpvn> instead.
7569 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7576 sv_setpvn(sv,s,len);
7581 =for apidoc newSVpvn
7583 Creates a new SV and copies a string into it. The reference count for the
7584 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7585 string. You are responsible for ensuring that the source string is at least
7586 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7592 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7597 sv_setpvn(sv,s,len);
7602 =for apidoc newSVpvn_share
7604 Creates a new SV with its SvPVX pointing to a shared string in the string
7605 table. If the string does not already exist in the table, it is created
7606 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7607 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7608 otherwise the hash is computed. The idea here is that as the string table
7609 is used for shared hash keys these strings will have SvPVX == HeKEY and
7610 hash lookup will avoid string compare.
7616 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7619 bool is_utf8 = FALSE;
7621 STRLEN tmplen = -len;
7623 /* See the note in hv.c:hv_fetch() --jhi */
7624 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7628 PERL_HASH(hash, src, len);
7630 sv_upgrade(sv, SVt_PVIV);
7631 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7644 #if defined(PERL_IMPLICIT_CONTEXT)
7646 /* pTHX_ magic can't cope with varargs, so this is a no-context
7647 * version of the main function, (which may itself be aliased to us).
7648 * Don't access this version directly.
7652 Perl_newSVpvf_nocontext(const char* pat, ...)
7657 va_start(args, pat);
7658 sv = vnewSVpvf(pat, &args);
7665 =for apidoc newSVpvf
7667 Creates a new SV and initializes it with the string formatted like
7674 Perl_newSVpvf(pTHX_ const char* pat, ...)
7678 va_start(args, pat);
7679 sv = vnewSVpvf(pat, &args);
7684 /* backend for newSVpvf() and newSVpvf_nocontext() */
7687 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7691 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7698 Creates a new SV and copies a floating point value into it.
7699 The reference count for the SV is set to 1.
7705 Perl_newSVnv(pTHX_ NV n)
7717 Creates a new SV and copies an integer into it. The reference count for the
7724 Perl_newSViv(pTHX_ IV i)
7736 Creates a new SV and copies an unsigned integer into it.
7737 The reference count for the SV is set to 1.
7743 Perl_newSVuv(pTHX_ UV u)
7753 =for apidoc newRV_noinc
7755 Creates an RV wrapper for an SV. The reference count for the original
7756 SV is B<not> incremented.
7762 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7767 sv_upgrade(sv, SVt_RV);
7769 SvRV_set(sv, tmpRef);
7774 /* newRV_inc is the official function name to use now.
7775 * newRV_inc is in fact #defined to newRV in sv.h
7779 Perl_newRV(pTHX_ SV *tmpRef)
7781 return newRV_noinc(SvREFCNT_inc(tmpRef));
7787 Creates a new SV which is an exact duplicate of the original SV.
7794 Perl_newSVsv(pTHX_ register SV *old)
7800 if (SvTYPE(old) == SVTYPEMASK) {
7801 if (ckWARN_d(WARN_INTERNAL))
7802 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7806 /* SV_GMAGIC is the default for sv_setv()
7807 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7808 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7809 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7814 =for apidoc sv_reset
7816 Underlying implementation for the C<reset> Perl function.
7817 Note that the perl-level function is vaguely deprecated.
7823 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7831 char todo[PERL_UCHAR_MAX+1];
7836 if (!*s) { /* reset ?? searches */
7837 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7839 PMOP *pm = (PMOP *) mg->mg_obj;
7841 pm->op_pmdynflags &= ~PMdf_USED;
7848 /* reset variables */
7850 if (!HvARRAY(stash))
7853 Zero(todo, 256, char);
7855 i = (unsigned char)*s;
7859 max = (unsigned char)*s++;
7860 for ( ; i <= max; i++) {
7863 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7864 for (entry = HvARRAY(stash)[i];
7866 entry = HeNEXT(entry))
7868 if (!todo[(U8)*HeKEY(entry)])
7870 gv = (GV*)HeVAL(entry);
7872 if (SvTHINKFIRST(sv)) {
7873 if (!SvREADONLY(sv) && SvROK(sv))
7878 if (SvTYPE(sv) >= SVt_PV) {
7880 if (SvPVX(sv) != Nullch)
7887 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7890 #ifdef USE_ENVIRON_ARRAY
7892 # ifdef USE_ITHREADS
7893 && PL_curinterp == aTHX
7897 environ[0] = Nullch;
7900 #endif /* !PERL_MICRO */
7910 Using various gambits, try to get an IO from an SV: the IO slot if its a
7911 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7912 named after the PV if we're a string.
7918 Perl_sv_2io(pTHX_ SV *sv)
7923 switch (SvTYPE(sv)) {
7931 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7935 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7937 return sv_2io(SvRV(sv));
7938 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7944 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7953 Using various gambits, try to get a CV from an SV; in addition, try if
7954 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7960 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7967 return *gvp = Nullgv, Nullcv;
7968 switch (SvTYPE(sv)) {
7987 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7988 tryAMAGICunDEREF(to_cv);
7991 if (SvTYPE(sv) == SVt_PVCV) {
8000 Perl_croak(aTHX_ "Not a subroutine reference");
8005 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8011 if (lref && !GvCVu(gv)) {
8014 tmpsv = NEWSV(704,0);
8015 gv_efullname3(tmpsv, gv, Nullch);
8016 /* XXX this is probably not what they think they're getting.
8017 * It has the same effect as "sub name;", i.e. just a forward
8019 newSUB(start_subparse(FALSE, 0),
8020 newSVOP(OP_CONST, 0, tmpsv),
8025 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8035 Returns true if the SV has a true value by Perl's rules.
8036 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8037 instead use an in-line version.
8043 Perl_sv_true(pTHX_ register SV *sv)
8048 const register XPV* tXpv;
8049 if ((tXpv = (XPV*)SvANY(sv)) &&
8050 (tXpv->xpv_cur > 1 ||
8051 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
8058 return SvIVX(sv) != 0;
8061 return SvNVX(sv) != 0.0;
8063 return sv_2bool(sv);
8071 A private implementation of the C<SvIVx> macro for compilers which can't
8072 cope with complex macro expressions. Always use the macro instead.
8078 Perl_sv_iv(pTHX_ register SV *sv)
8082 return (IV)SvUVX(sv);
8091 A private implementation of the C<SvUVx> macro for compilers which can't
8092 cope with complex macro expressions. Always use the macro instead.
8098 Perl_sv_uv(pTHX_ register SV *sv)
8103 return (UV)SvIVX(sv);
8111 A private implementation of the C<SvNVx> macro for compilers which can't
8112 cope with complex macro expressions. Always use the macro instead.
8118 Perl_sv_nv(pTHX_ register SV *sv)
8125 /* sv_pv() is now a macro using SvPV_nolen();
8126 * this function provided for binary compatibility only
8130 Perl_sv_pv(pTHX_ SV *sv)
8137 return sv_2pv(sv, &n_a);
8143 Use the C<SvPV_nolen> macro instead
8147 A private implementation of the C<SvPV> macro for compilers which can't
8148 cope with complex macro expressions. Always use the macro instead.
8154 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8160 return sv_2pv(sv, lp);
8165 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8171 return sv_2pv_flags(sv, lp, 0);
8174 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8175 * this function provided for binary compatibility only
8179 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8181 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8185 =for apidoc sv_pvn_force
8187 Get a sensible string out of the SV somehow.
8188 A private implementation of the C<SvPV_force> macro for compilers which
8189 can't cope with complex macro expressions. Always use the macro instead.
8191 =for apidoc sv_pvn_force_flags
8193 Get a sensible string out of the SV somehow.
8194 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8195 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8196 implemented in terms of this function.
8197 You normally want to use the various wrapper macros instead: see
8198 C<SvPV_force> and C<SvPV_force_nomg>
8204 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8207 if (SvTHINKFIRST(sv) && !SvROK(sv))
8208 sv_force_normal_flags(sv, 0);
8215 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8216 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8220 s = sv_2pv_flags(sv, lp, flags);
8221 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8222 const STRLEN len = *lp;
8226 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8227 SvGROW(sv, len + 1);
8228 Move(s,SvPVX(sv),len,char);
8233 SvPOK_on(sv); /* validate pointer */
8235 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8236 PTR2UV(sv),SvPVX(sv)));
8242 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8243 * this function provided for binary compatibility only
8247 Perl_sv_pvbyte(pTHX_ SV *sv)
8249 sv_utf8_downgrade(sv,0);
8254 =for apidoc sv_pvbyte
8256 Use C<SvPVbyte_nolen> instead.
8258 =for apidoc sv_pvbyten
8260 A private implementation of the C<SvPVbyte> macro for compilers
8261 which can't cope with complex macro expressions. Always use the macro
8268 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8270 sv_utf8_downgrade(sv,0);
8271 return sv_pvn(sv,lp);
8275 =for apidoc sv_pvbyten_force
8277 A private implementation of the C<SvPVbytex_force> macro for compilers
8278 which can't cope with complex macro expressions. Always use the macro
8285 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8287 sv_pvn_force(sv,lp);
8288 sv_utf8_downgrade(sv,0);
8293 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8294 * this function provided for binary compatibility only
8298 Perl_sv_pvutf8(pTHX_ SV *sv)
8300 sv_utf8_upgrade(sv);
8305 =for apidoc sv_pvutf8
8307 Use the C<SvPVutf8_nolen> macro instead
8309 =for apidoc sv_pvutf8n
8311 A private implementation of the C<SvPVutf8> macro for compilers
8312 which can't cope with complex macro expressions. Always use the macro
8319 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8321 sv_utf8_upgrade(sv);
8322 return sv_pvn(sv,lp);
8326 =for apidoc sv_pvutf8n_force
8328 A private implementation of the C<SvPVutf8_force> macro for compilers
8329 which can't cope with complex macro expressions. Always use the macro
8336 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8338 sv_pvn_force(sv,lp);
8339 sv_utf8_upgrade(sv);
8345 =for apidoc sv_reftype
8347 Returns a string describing what the SV is a reference to.
8353 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8355 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8356 inside return suggests a const propagation bug in g++. */
8357 if (ob && SvOBJECT(sv)) {
8358 char *name = HvNAME_get(SvSTASH(sv));
8359 return name ? name : (char *) "__ANON__";
8362 switch (SvTYPE(sv)) {
8379 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8380 /* tied lvalues should appear to be
8381 * scalars for backwards compatitbility */
8382 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8383 ? "SCALAR" : "LVALUE");
8384 case SVt_PVAV: return "ARRAY";
8385 case SVt_PVHV: return "HASH";
8386 case SVt_PVCV: return "CODE";
8387 case SVt_PVGV: return "GLOB";
8388 case SVt_PVFM: return "FORMAT";
8389 case SVt_PVIO: return "IO";
8390 default: return "UNKNOWN";
8396 =for apidoc sv_isobject
8398 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8399 object. If the SV is not an RV, or if the object is not blessed, then this
8406 Perl_sv_isobject(pTHX_ SV *sv)
8423 Returns a boolean indicating whether the SV is blessed into the specified
8424 class. This does not check for subtypes; use C<sv_derived_from> to verify
8425 an inheritance relationship.
8431 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8443 hvname = HvNAME_get(SvSTASH(sv));
8447 return strEQ(hvname, name);
8453 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8454 it will be upgraded to one. If C<classname> is non-null then the new SV will
8455 be blessed in the specified package. The new SV is returned and its
8456 reference count is 1.
8462 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8468 SV_CHECK_THINKFIRST_COW_DROP(rv);
8471 if (SvTYPE(rv) >= SVt_PVMG) {
8472 const U32 refcnt = SvREFCNT(rv);
8476 SvREFCNT(rv) = refcnt;
8479 if (SvTYPE(rv) < SVt_RV)
8480 sv_upgrade(rv, SVt_RV);
8481 else if (SvTYPE(rv) > SVt_RV) {
8492 HV* stash = gv_stashpv(classname, TRUE);
8493 (void)sv_bless(rv, stash);
8499 =for apidoc sv_setref_pv
8501 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8502 argument will be upgraded to an RV. That RV will be modified to point to
8503 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8504 into the SV. The C<classname> argument indicates the package for the
8505 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8506 will have a reference count of 1, and the RV will be returned.
8508 Do not use with other Perl types such as HV, AV, SV, CV, because those
8509 objects will become corrupted by the pointer copy process.
8511 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8517 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8520 sv_setsv(rv, &PL_sv_undef);
8524 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8529 =for apidoc sv_setref_iv
8531 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8532 argument will be upgraded to an RV. That RV will be modified to point to
8533 the new SV. The C<classname> argument indicates the package for the
8534 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8535 will have a reference count of 1, and the RV will be returned.
8541 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8543 sv_setiv(newSVrv(rv,classname), iv);
8548 =for apidoc sv_setref_uv
8550 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8551 argument will be upgraded to an RV. That RV will be modified to point to
8552 the new SV. The C<classname> argument indicates the package for the
8553 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8554 will have a reference count of 1, and the RV will be returned.
8560 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8562 sv_setuv(newSVrv(rv,classname), uv);
8567 =for apidoc sv_setref_nv
8569 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8570 argument will be upgraded to an RV. That RV will be modified to point to
8571 the new SV. The C<classname> argument indicates the package for the
8572 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8573 will have a reference count of 1, and the RV will be returned.
8579 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8581 sv_setnv(newSVrv(rv,classname), nv);
8586 =for apidoc sv_setref_pvn
8588 Copies a string into a new SV, optionally blessing the SV. The length of the
8589 string must be specified with C<n>. The C<rv> argument will be upgraded to
8590 an RV. That RV will be modified to point to the new SV. The C<classname>
8591 argument indicates the package for the blessing. Set C<classname> to
8592 C<Nullch> to avoid the blessing. The new SV will have a reference count
8593 of 1, and the RV will be returned.
8595 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8601 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8603 sv_setpvn(newSVrv(rv,classname), pv, n);
8608 =for apidoc sv_bless
8610 Blesses an SV into a specified package. The SV must be an RV. The package
8611 must be designated by its stash (see C<gv_stashpv()>). The reference count
8612 of the SV is unaffected.
8618 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8622 Perl_croak(aTHX_ "Can't bless non-reference value");
8624 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8625 if (SvREADONLY(tmpRef))
8626 Perl_croak(aTHX_ PL_no_modify);
8627 if (SvOBJECT(tmpRef)) {
8628 if (SvTYPE(tmpRef) != SVt_PVIO)
8630 SvREFCNT_dec(SvSTASH(tmpRef));
8633 SvOBJECT_on(tmpRef);
8634 if (SvTYPE(tmpRef) != SVt_PVIO)
8636 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8637 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8644 if(SvSMAGICAL(tmpRef))
8645 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8653 /* Downgrades a PVGV to a PVMG.
8657 S_sv_unglob(pTHX_ SV *sv)
8661 assert(SvTYPE(sv) == SVt_PVGV);
8666 SvREFCNT_dec(GvSTASH(sv));
8667 GvSTASH(sv) = Nullhv;
8669 sv_unmagic(sv, PERL_MAGIC_glob);
8670 Safefree(GvNAME(sv));
8673 /* need to keep SvANY(sv) in the right arena */
8674 xpvmg = new_XPVMG();
8675 StructCopy(SvANY(sv), xpvmg, XPVMG);
8676 del_XPVGV(SvANY(sv));
8679 SvFLAGS(sv) &= ~SVTYPEMASK;
8680 SvFLAGS(sv) |= SVt_PVMG;
8684 =for apidoc sv_unref_flags
8686 Unsets the RV status of the SV, and decrements the reference count of
8687 whatever was being referenced by the RV. This can almost be thought of
8688 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8689 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8690 (otherwise the decrementing is conditional on the reference count being
8691 different from one or the reference being a readonly SV).
8698 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8702 if (SvWEAKREF(sv)) {
8710 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8711 assigned to as BEGIN {$a = \"Foo"} will fail. */
8712 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8714 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8715 sv_2mortal(rv); /* Schedule for freeing later */
8719 =for apidoc sv_unref
8721 Unsets the RV status of the SV, and decrements the reference count of
8722 whatever was being referenced by the RV. This can almost be thought of
8723 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8724 being zero. See C<SvROK_off>.
8730 Perl_sv_unref(pTHX_ SV *sv)
8732 sv_unref_flags(sv, 0);
8736 =for apidoc sv_taint
8738 Taint an SV. Use C<SvTAINTED_on> instead.
8743 Perl_sv_taint(pTHX_ SV *sv)
8745 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8749 =for apidoc sv_untaint
8751 Untaint an SV. Use C<SvTAINTED_off> instead.
8756 Perl_sv_untaint(pTHX_ SV *sv)
8758 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8759 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8766 =for apidoc sv_tainted
8768 Test an SV for taintedness. Use C<SvTAINTED> instead.
8773 Perl_sv_tainted(pTHX_ SV *sv)
8775 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8776 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8777 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8784 =for apidoc sv_setpviv
8786 Copies an integer into the given SV, also updating its string value.
8787 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8793 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8795 char buf[TYPE_CHARS(UV)];
8797 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8799 sv_setpvn(sv, ptr, ebuf - ptr);
8803 =for apidoc sv_setpviv_mg
8805 Like C<sv_setpviv>, but also handles 'set' magic.
8811 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8813 char buf[TYPE_CHARS(UV)];
8815 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8817 sv_setpvn(sv, ptr, ebuf - ptr);
8821 #if defined(PERL_IMPLICIT_CONTEXT)
8823 /* pTHX_ magic can't cope with varargs, so this is a no-context
8824 * version of the main function, (which may itself be aliased to us).
8825 * Don't access this version directly.
8829 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8833 va_start(args, pat);
8834 sv_vsetpvf(sv, pat, &args);
8838 /* pTHX_ magic can't cope with varargs, so this is a no-context
8839 * version of the main function, (which may itself be aliased to us).
8840 * Don't access this version directly.
8844 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8848 va_start(args, pat);
8849 sv_vsetpvf_mg(sv, pat, &args);
8855 =for apidoc sv_setpvf
8857 Works like C<sv_catpvf> but copies the text into the SV instead of
8858 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8864 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8867 va_start(args, pat);
8868 sv_vsetpvf(sv, pat, &args);
8873 =for apidoc sv_vsetpvf
8875 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8876 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8878 Usually used via its frontend C<sv_setpvf>.
8884 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8886 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8890 =for apidoc sv_setpvf_mg
8892 Like C<sv_setpvf>, but also handles 'set' magic.
8898 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8901 va_start(args, pat);
8902 sv_vsetpvf_mg(sv, pat, &args);
8907 =for apidoc sv_vsetpvf_mg
8909 Like C<sv_vsetpvf>, but also handles 'set' magic.
8911 Usually used via its frontend C<sv_setpvf_mg>.
8917 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8919 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8923 #if defined(PERL_IMPLICIT_CONTEXT)
8925 /* pTHX_ magic can't cope with varargs, so this is a no-context
8926 * version of the main function, (which may itself be aliased to us).
8927 * Don't access this version directly.
8931 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8935 va_start(args, pat);
8936 sv_vcatpvf(sv, pat, &args);
8940 /* pTHX_ magic can't cope with varargs, so this is a no-context
8941 * version of the main function, (which may itself be aliased to us).
8942 * Don't access this version directly.
8946 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8950 va_start(args, pat);
8951 sv_vcatpvf_mg(sv, pat, &args);
8957 =for apidoc sv_catpvf
8959 Processes its arguments like C<sprintf> and appends the formatted
8960 output to an SV. If the appended data contains "wide" characters
8961 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8962 and characters >255 formatted with %c), the original SV might get
8963 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8964 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8965 valid UTF-8; if the original SV was bytes, the pattern should be too.
8970 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8973 va_start(args, pat);
8974 sv_vcatpvf(sv, pat, &args);
8979 =for apidoc sv_vcatpvf
8981 Processes its arguments like C<vsprintf> and appends the formatted output
8982 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8984 Usually used via its frontend C<sv_catpvf>.
8990 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8992 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8996 =for apidoc sv_catpvf_mg
8998 Like C<sv_catpvf>, but also handles 'set' magic.
9004 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9007 va_start(args, pat);
9008 sv_vcatpvf_mg(sv, pat, &args);
9013 =for apidoc sv_vcatpvf_mg
9015 Like C<sv_vcatpvf>, but also handles 'set' magic.
9017 Usually used via its frontend C<sv_catpvf_mg>.
9023 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9025 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9030 =for apidoc sv_vsetpvfn
9032 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9035 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9041 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9043 sv_setpvn(sv, "", 0);
9044 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9047 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9050 S_expect_number(pTHX_ char** pattern)
9053 switch (**pattern) {
9054 case '1': case '2': case '3':
9055 case '4': case '5': case '6':
9056 case '7': case '8': case '9':
9057 while (isDIGIT(**pattern))
9058 var = var * 10 + (*(*pattern)++ - '0');
9062 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9065 F0convert(NV nv, char *endbuf, STRLEN *len)
9067 const int neg = nv < 0;
9076 if (uv & 1 && uv == nv)
9077 uv--; /* Round to even */
9079 const unsigned dig = uv % 10;
9092 =for apidoc sv_vcatpvfn
9094 Processes its arguments like C<vsprintf> and appends the formatted output
9095 to an SV. Uses an array of SVs if the C style variable argument list is
9096 missing (NULL). When running with taint checks enabled, indicates via
9097 C<maybe_tainted> if results are untrustworthy (often due to the use of
9100 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9105 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9108 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9115 static const char nullstr[] = "(null)";
9117 bool has_utf8; /* has the result utf8? */
9118 bool pat_utf8; /* the pattern is in utf8? */
9120 /* Times 4: a decimal digit takes more than 3 binary digits.
9121 * NV_DIG: mantissa takes than many decimal digits.
9122 * Plus 32: Playing safe. */
9123 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9124 /* large enough for "%#.#f" --chip */
9125 /* what about long double NVs? --jhi */
9127 has_utf8 = pat_utf8 = DO_UTF8(sv);
9129 /* no matter what, this is a string now */
9130 (void)SvPV_force(sv, origlen);
9132 /* special-case "", "%s", and "%-p" (SVf) */
9135 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
9137 const char *s = va_arg(*args, char*);
9138 sv_catpv(sv, s ? s : nullstr);
9140 else if (svix < svmax) {
9141 sv_catsv(sv, *svargs);
9142 if (DO_UTF8(*svargs))
9147 if (patlen == 3 && pat[0] == '%' &&
9148 pat[1] == '-' && pat[2] == 'p') {
9150 argsv = va_arg(*args, SV*);
9151 sv_catsv(sv, argsv);
9158 #ifndef USE_LONG_DOUBLE
9159 /* special-case "%.<number>[gf]" */
9160 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9161 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9162 unsigned digits = 0;
9166 while (*pp >= '0' && *pp <= '9')
9167 digits = 10 * digits + (*pp++ - '0');
9168 if (pp - pat == (int)patlen - 1) {
9172 nv = (NV)va_arg(*args, double);
9173 else if (svix < svmax)
9178 /* Add check for digits != 0 because it seems that some
9179 gconverts are buggy in this case, and we don't yet have
9180 a Configure test for this. */
9181 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9182 /* 0, point, slack */
9183 Gconvert(nv, (int)digits, 0, ebuf);
9185 if (*ebuf) /* May return an empty string for digits==0 */
9188 } else if (!digits) {
9191 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9192 sv_catpvn(sv, p, l);
9198 #endif /* !USE_LONG_DOUBLE */
9200 if (!args && svix < svmax && DO_UTF8(*svargs))
9203 patend = (char*)pat + patlen;
9204 for (p = (char*)pat; p < patend; p = q) {
9207 bool vectorize = FALSE;
9208 bool vectorarg = FALSE;
9209 bool vec_utf8 = FALSE;
9215 bool has_precis = FALSE;
9218 bool is_utf8 = FALSE; /* is this item utf8? */
9219 #ifdef HAS_LDBL_SPRINTF_BUG
9220 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9221 with sfio - Allen <allens@cpan.org> */
9222 bool fix_ldbl_sprintf_bug = FALSE;
9226 U8 utf8buf[UTF8_MAXBYTES+1];
9227 STRLEN esignlen = 0;
9229 char *eptr = Nullch;
9232 U8 *vecstr = Null(U8*);
9239 /* we need a long double target in case HAS_LONG_DOUBLE but
9242 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9250 const char *dotstr = ".";
9251 STRLEN dotstrlen = 1;
9252 I32 efix = 0; /* explicit format parameter index */
9253 I32 ewix = 0; /* explicit width index */
9254 I32 epix = 0; /* explicit precision index */
9255 I32 evix = 0; /* explicit vector index */
9256 bool asterisk = FALSE;
9258 /* echo everything up to the next format specification */
9259 for (q = p; q < patend && *q != '%'; ++q) ;
9261 if (has_utf8 && !pat_utf8)
9262 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9264 sv_catpvn(sv, p, q - p);
9271 We allow format specification elements in this order:
9272 \d+\$ explicit format parameter index
9274 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9275 0 flag (as above): repeated to allow "v02"
9276 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9277 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9279 [%bcdefginopsux_DFOUX] format (mandatory)
9281 if (EXPECT_NUMBER(q, width)) {
9322 if (EXPECT_NUMBER(q, ewix))
9331 if ((vectorarg = asterisk)) {
9343 EXPECT_NUMBER(q, width);
9348 vecsv = va_arg(*args, SV*);
9350 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9351 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9352 dotstr = SvPVx(vecsv, dotstrlen);
9357 vecsv = va_arg(*args, SV*);
9358 vecstr = (U8*)SvPVx(vecsv,veclen);
9359 vec_utf8 = DO_UTF8(vecsv);
9361 else if (efix ? efix <= svmax : svix < svmax) {
9362 vecsv = svargs[efix ? efix-1 : svix++];
9363 vecstr = (U8*)SvPVx(vecsv,veclen);
9364 vec_utf8 = DO_UTF8(vecsv);
9365 /* if this is a version object, we need to return the
9366 * stringified representation (which the SvPVX has
9367 * already done for us), but not vectorize the args
9369 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9371 q++; /* skip past the rest of the %vd format */
9372 eptr = (char *) vecstr;
9373 elen = strlen(eptr);
9386 i = va_arg(*args, int);
9388 i = (ewix ? ewix <= svmax : svix < svmax) ?
9389 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9391 width = (i < 0) ? -i : i;
9401 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9403 /* XXX: todo, support specified precision parameter */
9407 i = va_arg(*args, int);
9409 i = (ewix ? ewix <= svmax : svix < svmax)
9410 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9411 precis = (i < 0) ? 0 : i;
9416 precis = precis * 10 + (*q++ - '0');
9425 case 'I': /* Ix, I32x, and I64x */
9427 if (q[1] == '6' && q[2] == '4') {
9433 if (q[1] == '3' && q[2] == '2') {
9443 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9454 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9455 if (*(q + 1) == 'l') { /* lld, llf */
9480 argsv = (efix ? efix <= svmax : svix < svmax) ?
9481 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9488 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9490 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9492 eptr = (char*)utf8buf;
9493 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9504 if (args && !vectorize) {
9505 eptr = va_arg(*args, char*);
9507 #ifdef MACOS_TRADITIONAL
9508 /* On MacOS, %#s format is used for Pascal strings */
9513 elen = strlen(eptr);
9515 eptr = (char *)nullstr;
9516 elen = sizeof nullstr - 1;
9520 eptr = SvPVx(argsv, elen);
9521 if (DO_UTF8(argsv)) {
9522 if (has_precis && precis < elen) {
9524 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9527 if (width) { /* fudge width (can't fudge elen) */
9528 width += elen - sv_len_utf8(argsv);
9536 if (has_precis && elen > precis)
9543 if (left && args) { /* SVf */
9552 argsv = va_arg(*args, SV*);
9553 eptr = SvPVx(argsv, elen);
9558 if (alt || vectorize)
9560 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9578 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9587 esignbuf[esignlen++] = plus;
9591 case 'h': iv = (short)va_arg(*args, int); break;
9592 case 'l': iv = va_arg(*args, long); break;
9593 case 'V': iv = va_arg(*args, IV); break;
9594 default: iv = va_arg(*args, int); break;
9596 case 'q': iv = va_arg(*args, Quad_t); break;
9601 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9603 case 'h': iv = (short)tiv; break;
9604 case 'l': iv = (long)tiv; break;
9606 default: iv = tiv; break;
9608 case 'q': iv = (Quad_t)tiv; break;
9612 if ( !vectorize ) /* we already set uv above */
9617 esignbuf[esignlen++] = plus;
9621 esignbuf[esignlen++] = '-';
9664 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9675 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9676 case 'l': uv = va_arg(*args, unsigned long); break;
9677 case 'V': uv = va_arg(*args, UV); break;
9678 default: uv = va_arg(*args, unsigned); break;
9680 case 'q': uv = va_arg(*args, Uquad_t); break;
9685 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9687 case 'h': uv = (unsigned short)tuv; break;
9688 case 'l': uv = (unsigned long)tuv; break;
9690 default: uv = tuv; break;
9692 case 'q': uv = (Uquad_t)tuv; break;
9698 eptr = ebuf + sizeof ebuf;
9704 p = (char*)((c == 'X')
9705 ? "0123456789ABCDEF" : "0123456789abcdef");
9711 esignbuf[esignlen++] = '0';
9712 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9718 *--eptr = '0' + dig;
9720 if (alt && *eptr != '0')
9726 *--eptr = '0' + dig;
9729 esignbuf[esignlen++] = '0';
9730 esignbuf[esignlen++] = 'b';
9733 default: /* it had better be ten or less */
9736 *--eptr = '0' + dig;
9737 } while (uv /= base);
9740 elen = (ebuf + sizeof ebuf) - eptr;
9743 zeros = precis - elen;
9744 else if (precis == 0 && elen == 1 && *eptr == '0')
9749 /* FLOATING POINT */
9752 c = 'f'; /* maybe %F isn't supported here */
9758 /* This is evil, but floating point is even more evil */
9760 /* for SV-style calling, we can only get NV
9761 for C-style calling, we assume %f is double;
9762 for simplicity we allow any of %Lf, %llf, %qf for long double
9766 #if defined(USE_LONG_DOUBLE)
9770 /* [perl #20339] - we should accept and ignore %lf rather than die */
9774 #if defined(USE_LONG_DOUBLE)
9775 intsize = args ? 0 : 'q';
9779 #if defined(HAS_LONG_DOUBLE)
9788 /* now we need (long double) if intsize == 'q', else (double) */
9789 nv = (args && !vectorize) ?
9790 #if LONG_DOUBLESIZE > DOUBLESIZE
9792 va_arg(*args, long double) :
9793 va_arg(*args, double)
9795 va_arg(*args, double)
9801 if (c != 'e' && c != 'E') {
9803 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9804 will cast our (long double) to (double) */
9805 (void)Perl_frexp(nv, &i);
9806 if (i == PERL_INT_MIN)
9807 Perl_die(aTHX_ "panic: frexp");
9809 need = BIT_DIGITS(i);
9811 need += has_precis ? precis : 6; /* known default */
9816 #ifdef HAS_LDBL_SPRINTF_BUG
9817 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9818 with sfio - Allen <allens@cpan.org> */
9821 # define MY_DBL_MAX DBL_MAX
9822 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9823 # if DOUBLESIZE >= 8
9824 # define MY_DBL_MAX 1.7976931348623157E+308L
9826 # define MY_DBL_MAX 3.40282347E+38L
9830 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9831 # define MY_DBL_MAX_BUG 1L
9833 # define MY_DBL_MAX_BUG MY_DBL_MAX
9837 # define MY_DBL_MIN DBL_MIN
9838 # else /* XXX guessing! -Allen */
9839 # if DOUBLESIZE >= 8
9840 # define MY_DBL_MIN 2.2250738585072014E-308L
9842 # define MY_DBL_MIN 1.17549435E-38L
9846 if ((intsize == 'q') && (c == 'f') &&
9847 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9849 /* it's going to be short enough that
9850 * long double precision is not needed */
9852 if ((nv <= 0L) && (nv >= -0L))
9853 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9855 /* would use Perl_fp_class as a double-check but not
9856 * functional on IRIX - see perl.h comments */
9858 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9859 /* It's within the range that a double can represent */
9860 #if defined(DBL_MAX) && !defined(DBL_MIN)
9861 if ((nv >= ((long double)1/DBL_MAX)) ||
9862 (nv <= (-(long double)1/DBL_MAX)))
9864 fix_ldbl_sprintf_bug = TRUE;
9867 if (fix_ldbl_sprintf_bug == TRUE) {
9877 # undef MY_DBL_MAX_BUG
9880 #endif /* HAS_LDBL_SPRINTF_BUG */
9882 need += 20; /* fudge factor */
9883 if (PL_efloatsize < need) {
9884 Safefree(PL_efloatbuf);
9885 PL_efloatsize = need + 20; /* more fudge */
9886 New(906, PL_efloatbuf, PL_efloatsize, char);
9887 PL_efloatbuf[0] = '\0';
9890 if ( !(width || left || plus || alt) && fill != '0'
9891 && has_precis && intsize != 'q' ) { /* Shortcuts */
9892 /* See earlier comment about buggy Gconvert when digits,
9894 if ( c == 'g' && precis) {
9895 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9896 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9897 goto float_converted;
9898 } else if ( c == 'f' && !precis) {
9899 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9903 eptr = ebuf + sizeof ebuf;
9906 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9907 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9908 if (intsize == 'q') {
9909 /* Copy the one or more characters in a long double
9910 * format before the 'base' ([efgEFG]) character to
9911 * the format string. */
9912 static char const prifldbl[] = PERL_PRIfldbl;
9913 char const *p = prifldbl + sizeof(prifldbl) - 3;
9914 while (p >= prifldbl) { *--eptr = *p--; }
9919 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9924 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9936 /* No taint. Otherwise we are in the strange situation
9937 * where printf() taints but print($float) doesn't.
9939 #if defined(HAS_LONG_DOUBLE)
9941 (void)sprintf(PL_efloatbuf, eptr, nv);
9943 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9945 (void)sprintf(PL_efloatbuf, eptr, nv);
9948 eptr = PL_efloatbuf;
9949 elen = strlen(PL_efloatbuf);
9955 i = SvCUR(sv) - origlen;
9956 if (args && !vectorize) {
9958 case 'h': *(va_arg(*args, short*)) = i; break;
9959 default: *(va_arg(*args, int*)) = i; break;
9960 case 'l': *(va_arg(*args, long*)) = i; break;
9961 case 'V': *(va_arg(*args, IV*)) = i; break;
9963 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9968 sv_setuv_mg(argsv, (UV)i);
9970 continue; /* not "break" */
9976 if (!args && ckWARN(WARN_PRINTF) &&
9977 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9978 SV *msg = sv_newmortal();
9979 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9980 (PL_op->op_type == OP_PRTF) ? "" : "s");
9983 Perl_sv_catpvf(aTHX_ msg,
9984 "\"%%%c\"", c & 0xFF);
9986 Perl_sv_catpvf(aTHX_ msg,
9987 "\"%%\\%03"UVof"\"",
9990 sv_catpv(msg, "end of string");
9991 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9994 /* output mangled stuff ... */
10000 /* ... right here, because formatting flags should not apply */
10001 SvGROW(sv, SvCUR(sv) + elen + 1);
10003 Copy(eptr, p, elen, char);
10006 SvCUR_set(sv, p - SvPVX(sv));
10008 continue; /* not "break" */
10011 /* calculate width before utf8_upgrade changes it */
10012 have = esignlen + zeros + elen;
10014 if (is_utf8 != has_utf8) {
10017 sv_utf8_upgrade(sv);
10020 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10021 sv_utf8_upgrade(nsv);
10025 SvGROW(sv, SvCUR(sv) + elen + 1);
10030 need = (have > width ? have : width);
10033 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10035 if (esignlen && fill == '0') {
10036 for (i = 0; i < (int)esignlen; i++)
10037 *p++ = esignbuf[i];
10039 if (gap && !left) {
10040 memset(p, fill, gap);
10043 if (esignlen && fill != '0') {
10044 for (i = 0; i < (int)esignlen; i++)
10045 *p++ = esignbuf[i];
10048 for (i = zeros; i; i--)
10052 Copy(eptr, p, elen, char);
10056 memset(p, ' ', gap);
10061 Copy(dotstr, p, dotstrlen, char);
10065 vectorize = FALSE; /* done iterating over vecstr */
10072 SvCUR_set(sv, p - SvPVX(sv));
10080 /* =========================================================================
10082 =head1 Cloning an interpreter
10084 All the macros and functions in this section are for the private use of
10085 the main function, perl_clone().
10087 The foo_dup() functions make an exact copy of an existing foo thinngy.
10088 During the course of a cloning, a hash table is used to map old addresses
10089 to new addresses. The table is created and manipulated with the
10090 ptr_table_* functions.
10094 ============================================================================*/
10097 #if defined(USE_ITHREADS)
10099 #ifndef GpREFCNT_inc
10100 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10104 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10105 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10106 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10107 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10108 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10109 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10110 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10111 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10112 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10113 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10114 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10115 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10116 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10119 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10120 regcomp.c. AMS 20010712 */
10123 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10128 struct reg_substr_datum *s;
10131 return (REGEXP *)NULL;
10133 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10136 len = r->offsets[0];
10137 npar = r->nparens+1;
10139 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10140 Copy(r->program, ret->program, len+1, regnode);
10142 New(0, ret->startp, npar, I32);
10143 Copy(r->startp, ret->startp, npar, I32);
10144 New(0, ret->endp, npar, I32);
10145 Copy(r->startp, ret->startp, npar, I32);
10147 New(0, ret->substrs, 1, struct reg_substr_data);
10148 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10149 s->min_offset = r->substrs->data[i].min_offset;
10150 s->max_offset = r->substrs->data[i].max_offset;
10151 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10152 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10155 ret->regstclass = NULL;
10157 struct reg_data *d;
10158 const int count = r->data->count;
10160 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10161 char, struct reg_data);
10162 New(0, d->what, count, U8);
10165 for (i = 0; i < count; i++) {
10166 d->what[i] = r->data->what[i];
10167 switch (d->what[i]) {
10168 /* legal options are one of: sfpont
10169 see also regcomp.h and pregfree() */
10171 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10174 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10177 /* This is cheating. */
10178 New(0, d->data[i], 1, struct regnode_charclass_class);
10179 StructCopy(r->data->data[i], d->data[i],
10180 struct regnode_charclass_class);
10181 ret->regstclass = (regnode*)d->data[i];
10184 /* Compiled op trees are readonly, and can thus be
10185 shared without duplication. */
10187 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10191 d->data[i] = r->data->data[i];
10194 d->data[i] = r->data->data[i];
10196 ((reg_trie_data*)d->data[i])->refcount++;
10200 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10209 New(0, ret->offsets, 2*len+1, U32);
10210 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10212 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10213 ret->refcnt = r->refcnt;
10214 ret->minlen = r->minlen;
10215 ret->prelen = r->prelen;
10216 ret->nparens = r->nparens;
10217 ret->lastparen = r->lastparen;
10218 ret->lastcloseparen = r->lastcloseparen;
10219 ret->reganch = r->reganch;
10221 ret->sublen = r->sublen;
10223 if (RX_MATCH_COPIED(ret))
10224 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10226 ret->subbeg = Nullch;
10227 #ifdef PERL_COPY_ON_WRITE
10228 ret->saved_copy = Nullsv;
10231 ptr_table_store(PL_ptr_table, r, ret);
10235 /* duplicate a file handle */
10238 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10244 return (PerlIO*)NULL;
10246 /* look for it in the table first */
10247 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10251 /* create anew and remember what it is */
10252 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10253 ptr_table_store(PL_ptr_table, fp, ret);
10257 /* duplicate a directory handle */
10260 Perl_dirp_dup(pTHX_ DIR *dp)
10268 /* duplicate a typeglob */
10271 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10276 /* look for it in the table first */
10277 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10281 /* create anew and remember what it is */
10282 Newz(0, ret, 1, GP);
10283 ptr_table_store(PL_ptr_table, gp, ret);
10286 ret->gp_refcnt = 0; /* must be before any other dups! */
10287 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10288 ret->gp_io = io_dup_inc(gp->gp_io, param);
10289 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10290 ret->gp_av = av_dup_inc(gp->gp_av, param);
10291 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10292 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10293 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10294 ret->gp_cvgen = gp->gp_cvgen;
10295 ret->gp_flags = gp->gp_flags;
10296 ret->gp_line = gp->gp_line;
10297 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10301 /* duplicate a chain of magic */
10304 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10306 MAGIC *mgprev = (MAGIC*)NULL;
10309 return (MAGIC*)NULL;
10310 /* look for it in the table first */
10311 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10315 for (; mg; mg = mg->mg_moremagic) {
10317 Newz(0, nmg, 1, MAGIC);
10319 mgprev->mg_moremagic = nmg;
10322 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10323 nmg->mg_private = mg->mg_private;
10324 nmg->mg_type = mg->mg_type;
10325 nmg->mg_flags = mg->mg_flags;
10326 if (mg->mg_type == PERL_MAGIC_qr) {
10327 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10329 else if(mg->mg_type == PERL_MAGIC_backref) {
10330 const AV * const av = (AV*) mg->mg_obj;
10333 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10335 for (i = AvFILLp(av); i >= 0; i--) {
10336 if (!svp[i]) continue;
10337 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10340 else if (mg->mg_type == PERL_MAGIC_symtab) {
10341 nmg->mg_obj = mg->mg_obj;
10344 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10345 ? sv_dup_inc(mg->mg_obj, param)
10346 : sv_dup(mg->mg_obj, param);
10348 nmg->mg_len = mg->mg_len;
10349 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10350 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10351 if (mg->mg_len > 0) {
10352 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10353 if (mg->mg_type == PERL_MAGIC_overload_table &&
10354 AMT_AMAGIC((AMT*)mg->mg_ptr))
10356 AMT *amtp = (AMT*)mg->mg_ptr;
10357 AMT *namtp = (AMT*)nmg->mg_ptr;
10359 for (i = 1; i < NofAMmeth; i++) {
10360 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10364 else if (mg->mg_len == HEf_SVKEY)
10365 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10367 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10368 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10375 /* create a new pointer-mapping table */
10378 Perl_ptr_table_new(pTHX)
10381 Newz(0, tbl, 1, PTR_TBL_t);
10382 tbl->tbl_max = 511;
10383 tbl->tbl_items = 0;
10384 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10389 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10391 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10399 struct ptr_tbl_ent* pte;
10400 struct ptr_tbl_ent* pteend;
10401 New(0, pte, PERL_ARENA_SIZE/sizeof(struct ptr_tbl_ent), struct ptr_tbl_ent);
10402 pte->next = PL_pte_arenaroot;
10403 PL_pte_arenaroot = pte;
10405 pteend = &pte[PERL_ARENA_SIZE / sizeof(struct ptr_tbl_ent) - 1];
10406 PL_pte_root = ++pte;
10407 while (pte < pteend) {
10408 pte->next = pte + 1;
10414 STATIC struct ptr_tbl_ent*
10417 struct ptr_tbl_ent* pte;
10421 PL_pte_root = pte->next;
10426 S_del_pte(pTHX_ struct ptr_tbl_ent*p)
10428 p->next = PL_pte_root;
10432 /* map an existing pointer using a table */
10435 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10437 PTR_TBL_ENT_t *tblent;
10438 const UV hash = PTR_TABLE_HASH(sv);
10440 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10441 for (; tblent; tblent = tblent->next) {
10442 if (tblent->oldval == sv)
10443 return tblent->newval;
10445 return (void*)NULL;
10448 /* add a new entry to a pointer-mapping table */
10451 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10453 PTR_TBL_ENT_t *tblent, **otblent;
10454 /* XXX this may be pessimal on platforms where pointers aren't good
10455 * hash values e.g. if they grow faster in the most significant
10457 const UV hash = PTR_TABLE_HASH(oldv);
10461 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10462 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10463 if (tblent->oldval == oldv) {
10464 tblent->newval = newv;
10468 tblent = S_new_pte(aTHX);
10469 tblent->oldval = oldv;
10470 tblent->newval = newv;
10471 tblent->next = *otblent;
10474 if (!empty && tbl->tbl_items > tbl->tbl_max)
10475 ptr_table_split(tbl);
10478 /* double the hash bucket size of an existing ptr table */
10481 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10483 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10484 const UV oldsize = tbl->tbl_max + 1;
10485 UV newsize = oldsize * 2;
10488 Renew(ary, newsize, PTR_TBL_ENT_t*);
10489 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10490 tbl->tbl_max = --newsize;
10491 tbl->tbl_ary = ary;
10492 for (i=0; i < oldsize; i++, ary++) {
10493 PTR_TBL_ENT_t **curentp, **entp, *ent;
10496 curentp = ary + oldsize;
10497 for (entp = ary, ent = *ary; ent; ent = *entp) {
10498 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10500 ent->next = *curentp;
10510 /* remove all the entries from a ptr table */
10513 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10515 register PTR_TBL_ENT_t **array;
10516 register PTR_TBL_ENT_t *entry;
10520 if (!tbl || !tbl->tbl_items) {
10524 array = tbl->tbl_ary;
10526 max = tbl->tbl_max;
10530 PTR_TBL_ENT_t *oentry = entry;
10531 entry = entry->next;
10532 S_del_pte(aTHX_ oentry);
10535 if (++riter > max) {
10538 entry = array[riter];
10542 tbl->tbl_items = 0;
10545 /* clear and free a ptr table */
10548 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10553 ptr_table_clear(tbl);
10554 Safefree(tbl->tbl_ary);
10558 /* attempt to make everything in the typeglob readonly */
10561 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10563 GV *gv = (GV*)sstr;
10564 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10566 if (GvIO(gv) || GvFORM(gv)) {
10567 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10569 else if (!GvCV(gv)) {
10570 GvCV(gv) = (CV*)sv;
10573 /* CvPADLISTs cannot be shared */
10574 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10579 if (!GvUNIQUE(gv)) {
10581 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10582 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10588 * write attempts will die with
10589 * "Modification of a read-only value attempted"
10595 SvREADONLY_on(GvSV(gv));
10599 GvAV(gv) = (AV*)sv;
10602 SvREADONLY_on(GvAV(gv));
10606 GvHV(gv) = (HV*)sv;
10609 SvREADONLY_on(GvHV(gv));
10612 return sstr; /* he_dup() will SvREFCNT_inc() */
10615 /* duplicate an SV of any type (including AV, HV etc) */
10618 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10621 SvRV_set(dstr, SvWEAKREF(sstr)
10622 ? sv_dup(SvRV(sstr), param)
10623 : sv_dup_inc(SvRV(sstr), param));
10626 else if (SvPVX(sstr)) {
10627 /* Has something there */
10629 /* Normal PV - clone whole allocated space */
10630 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10631 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10632 /* Not that normal - actually sstr is copy on write.
10633 But we are a true, independant SV, so: */
10634 SvREADONLY_off(dstr);
10639 /* Special case - not normally malloced for some reason */
10640 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10641 /* A "shared" PV - clone it as unshared string */
10642 if(SvPADTMP(sstr)) {
10643 /* However, some of them live in the pad
10644 and they should not have these flags
10647 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10649 SvUV_set(dstr, SvUVX(sstr));
10652 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10654 SvREADONLY_off(dstr);
10658 /* Some other special case - random pointer */
10659 SvPV_set(dstr, SvPVX(sstr));
10664 /* Copy the Null */
10665 if (SvTYPE(dstr) == SVt_RV)
10666 SvRV_set(dstr, NULL);
10673 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10678 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10680 /* look for it in the table first */
10681 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10685 if(param->flags & CLONEf_JOIN_IN) {
10686 /** We are joining here so we don't want do clone
10687 something that is bad **/
10688 const char *hvname;
10690 if(SvTYPE(sstr) == SVt_PVHV &&
10691 (hvname = HvNAME_get(sstr))) {
10692 /** don't clone stashes if they already exist **/
10693 HV* old_stash = gv_stashpv(hvname,0);
10694 return (SV*) old_stash;
10698 /* create anew and remember what it is */
10701 #ifdef DEBUG_LEAKING_SCALARS
10702 dstr->sv_debug_optype = sstr->sv_debug_optype;
10703 dstr->sv_debug_line = sstr->sv_debug_line;
10704 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10705 dstr->sv_debug_cloned = 1;
10707 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10709 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10713 ptr_table_store(PL_ptr_table, sstr, dstr);
10716 SvFLAGS(dstr) = SvFLAGS(sstr);
10717 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10718 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10721 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10722 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10723 PL_watch_pvx, SvPVX(sstr));
10726 /* don't clone objects whose class has asked us not to */
10727 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10728 SvFLAGS(dstr) &= ~SVTYPEMASK;
10729 SvOBJECT_off(dstr);
10733 switch (SvTYPE(sstr)) {
10735 SvANY(dstr) = NULL;
10738 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10739 SvIV_set(dstr, SvIVX(sstr));
10742 SvANY(dstr) = new_XNV();
10743 SvNV_set(dstr, SvNVX(sstr));
10746 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10747 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10750 SvANY(dstr) = new_XPV();
10751 SvCUR_set(dstr, SvCUR(sstr));
10752 SvLEN_set(dstr, SvLEN(sstr));
10753 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10756 SvANY(dstr) = new_XPVIV();
10757 SvCUR_set(dstr, SvCUR(sstr));
10758 SvLEN_set(dstr, SvLEN(sstr));
10759 SvIV_set(dstr, SvIVX(sstr));
10760 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10763 SvANY(dstr) = new_XPVNV();
10764 SvCUR_set(dstr, SvCUR(sstr));
10765 SvLEN_set(dstr, SvLEN(sstr));
10766 SvIV_set(dstr, SvIVX(sstr));
10767 SvNV_set(dstr, SvNVX(sstr));
10768 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10771 SvANY(dstr) = new_XPVMG();
10772 SvCUR_set(dstr, SvCUR(sstr));
10773 SvLEN_set(dstr, SvLEN(sstr));
10774 SvIV_set(dstr, SvIVX(sstr));
10775 SvNV_set(dstr, SvNVX(sstr));
10776 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10777 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10778 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10781 SvANY(dstr) = new_XPVBM();
10782 SvCUR_set(dstr, SvCUR(sstr));
10783 SvLEN_set(dstr, SvLEN(sstr));
10784 SvIV_set(dstr, SvIVX(sstr));
10785 SvNV_set(dstr, SvNVX(sstr));
10786 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10787 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10788 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10789 BmRARE(dstr) = BmRARE(sstr);
10790 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10791 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10794 SvANY(dstr) = new_XPVLV();
10795 SvCUR_set(dstr, SvCUR(sstr));
10796 SvLEN_set(dstr, SvLEN(sstr));
10797 SvIV_set(dstr, SvIVX(sstr));
10798 SvNV_set(dstr, SvNVX(sstr));
10799 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10800 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10801 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10802 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10803 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10804 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10805 LvTARG(dstr) = dstr;
10806 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10807 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10809 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10810 LvTYPE(dstr) = LvTYPE(sstr);
10813 if (GvUNIQUE((GV*)sstr)) {
10815 if ((share = gv_share(sstr, param))) {
10818 ptr_table_store(PL_ptr_table, sstr, dstr);
10820 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10821 HvNAME_get(GvSTASH(share)), GvNAME(share));
10826 SvANY(dstr) = new_XPVGV();
10827 SvCUR_set(dstr, SvCUR(sstr));
10828 SvLEN_set(dstr, SvLEN(sstr));
10829 SvIV_set(dstr, SvIVX(sstr));
10830 SvNV_set(dstr, SvNVX(sstr));
10831 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10832 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10833 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10834 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10835 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10836 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10837 GvFLAGS(dstr) = GvFLAGS(sstr);
10838 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10839 (void)GpREFCNT_inc(GvGP(dstr));
10842 SvANY(dstr) = new_XPVIO();
10843 SvCUR_set(dstr, SvCUR(sstr));
10844 SvLEN_set(dstr, SvLEN(sstr));
10845 SvIV_set(dstr, SvIVX(sstr));
10846 SvNV_set(dstr, SvNVX(sstr));
10847 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10848 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10849 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10850 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10851 if (IoOFP(sstr) == IoIFP(sstr))
10852 IoOFP(dstr) = IoIFP(dstr);
10854 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10855 /* PL_rsfp_filters entries have fake IoDIRP() */
10856 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10857 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10859 IoDIRP(dstr) = IoDIRP(sstr);
10860 IoLINES(dstr) = IoLINES(sstr);
10861 IoPAGE(dstr) = IoPAGE(sstr);
10862 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10863 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10864 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10865 /* I have no idea why fake dirp (rsfps)
10866 should be treaded differently but otherwise
10867 we end up with leaks -- sky*/
10868 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10869 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10870 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10872 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10873 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10874 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10876 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10877 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10878 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10879 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10880 IoTYPE(dstr) = IoTYPE(sstr);
10881 IoFLAGS(dstr) = IoFLAGS(sstr);
10884 SvANY(dstr) = new_XPVAV();
10885 SvCUR_set(dstr, SvCUR(sstr));
10886 SvLEN_set(dstr, SvLEN(sstr));
10887 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10888 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10889 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10890 if (AvARRAY((AV*)sstr)) {
10891 SV **dst_ary, **src_ary;
10892 SSize_t items = AvFILLp((AV*)sstr) + 1;
10894 src_ary = AvARRAY((AV*)sstr);
10895 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10896 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10897 SvPV_set(dstr, (char*)dst_ary);
10898 AvALLOC((AV*)dstr) = dst_ary;
10899 if (AvREAL((AV*)sstr)) {
10900 while (items-- > 0)
10901 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10904 while (items-- > 0)
10905 *dst_ary++ = sv_dup(*src_ary++, param);
10907 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10908 while (items-- > 0) {
10909 *dst_ary++ = &PL_sv_undef;
10913 SvPV_set(dstr, Nullch);
10914 AvALLOC((AV*)dstr) = (SV**)NULL;
10918 SvANY(dstr) = new_XPVHV();
10919 SvCUR_set(dstr, SvCUR(sstr));
10920 SvLEN_set(dstr, SvLEN(sstr));
10921 HvTOTALKEYS(dstr) = HvTOTALKEYS(sstr);
10922 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10923 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10925 struct xpvhv_aux *aux = ((XPVHV *)SvANY(sstr))->xhv_aux;
10929 I32 riter = aux->xhv_riter;
10931 hvname = aux->xhv_name;
10932 if (hvname || riter != -1) {
10933 struct xpvhv_aux *d_aux;
10935 New(0, d_aux, 1, struct xpvhv_aux);
10937 d_aux->xhv_riter = riter;
10938 d_aux->xhv_eiter = 0;
10939 d_aux->xhv_name = hvname ? hek_dup(hvname, param) : hvname;
10941 ((XPVHV *)SvANY(dstr))->xhv_aux = d_aux;
10943 ((XPVHV *)SvANY(dstr))->xhv_aux = 0;
10947 ((XPVHV *)SvANY(dstr))->xhv_aux = 0;
10949 if (HvARRAY((HV*)sstr)) {
10951 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10952 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10954 /* FIXME - surely this doesn't need to be zeroed? */
10956 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10957 HvARRAY(dstr) = (HE**)darray;
10958 while (i <= sxhv->xhv_max) {
10960 = he_dup(HvARRAY(sstr)[i],
10961 (bool)!!HvSHAREKEYS(sstr), param);
10964 HvEITER_set(dstr, he_dup(HvEITER_get(sstr),
10965 (bool)!!HvSHAREKEYS(sstr), param));
10968 SvPV_set(dstr, Nullch);
10969 HvEITER_set((HV*)dstr, (HE*)NULL);
10971 /* Record stashes for possible cloning in Perl_clone(). */
10973 av_push(param->stashes, dstr);
10977 SvANY(dstr) = new_XPVFM();
10978 FmLINES(dstr) = FmLINES(sstr);
10982 SvANY(dstr) = new_XPVCV();
10984 SvCUR_set(dstr, SvCUR(sstr));
10985 SvLEN_set(dstr, SvLEN(sstr));
10986 SvIV_set(dstr, SvIVX(sstr));
10987 SvNV_set(dstr, SvNVX(sstr));
10988 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10989 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10990 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10991 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10992 CvSTART(dstr) = CvSTART(sstr);
10994 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10996 CvXSUB(dstr) = CvXSUB(sstr);
10997 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10998 if (CvCONST(sstr)) {
10999 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
11000 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
11001 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
11003 /* don't dup if copying back - CvGV isn't refcounted, so the
11004 * duped GV may never be freed. A bit of a hack! DAPM */
11005 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
11006 Nullgv : gv_dup(CvGV(sstr), param) ;
11007 if (param->flags & CLONEf_COPY_STACKS) {
11008 CvDEPTH(dstr) = CvDEPTH(sstr);
11012 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
11013 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
11015 CvWEAKOUTSIDE(sstr)
11016 ? cv_dup( CvOUTSIDE(sstr), param)
11017 : cv_dup_inc(CvOUTSIDE(sstr), param);
11018 CvFLAGS(dstr) = CvFLAGS(sstr);
11019 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
11022 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
11026 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
11032 /* duplicate a context */
11035 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11037 PERL_CONTEXT *ncxs;
11040 return (PERL_CONTEXT*)NULL;
11042 /* look for it in the table first */
11043 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11047 /* create anew and remember what it is */
11048 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11049 ptr_table_store(PL_ptr_table, cxs, ncxs);
11052 PERL_CONTEXT *cx = &cxs[ix];
11053 PERL_CONTEXT *ncx = &ncxs[ix];
11054 ncx->cx_type = cx->cx_type;
11055 if (CxTYPE(cx) == CXt_SUBST) {
11056 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11059 ncx->blk_oldsp = cx->blk_oldsp;
11060 ncx->blk_oldcop = cx->blk_oldcop;
11061 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11062 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11063 ncx->blk_oldpm = cx->blk_oldpm;
11064 ncx->blk_gimme = cx->blk_gimme;
11065 switch (CxTYPE(cx)) {
11067 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11068 ? cv_dup_inc(cx->blk_sub.cv, param)
11069 : cv_dup(cx->blk_sub.cv,param));
11070 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11071 ? av_dup_inc(cx->blk_sub.argarray, param)
11073 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11074 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11075 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11076 ncx->blk_sub.lval = cx->blk_sub.lval;
11077 ncx->blk_sub.retop = cx->blk_sub.retop;
11080 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11081 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11082 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11083 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11084 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11085 ncx->blk_eval.retop = cx->blk_eval.retop;
11088 ncx->blk_loop.label = cx->blk_loop.label;
11089 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11090 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11091 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11092 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11093 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11094 ? cx->blk_loop.iterdata
11095 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11096 ncx->blk_loop.oldcomppad
11097 = (PAD*)ptr_table_fetch(PL_ptr_table,
11098 cx->blk_loop.oldcomppad);
11099 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11100 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11101 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11102 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11103 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11106 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11107 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11108 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11109 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11110 ncx->blk_sub.retop = cx->blk_sub.retop;
11122 /* duplicate a stack info structure */
11125 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11130 return (PERL_SI*)NULL;
11132 /* look for it in the table first */
11133 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11137 /* create anew and remember what it is */
11138 Newz(56, nsi, 1, PERL_SI);
11139 ptr_table_store(PL_ptr_table, si, nsi);
11141 nsi->si_stack = av_dup_inc(si->si_stack, param);
11142 nsi->si_cxix = si->si_cxix;
11143 nsi->si_cxmax = si->si_cxmax;
11144 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11145 nsi->si_type = si->si_type;
11146 nsi->si_prev = si_dup(si->si_prev, param);
11147 nsi->si_next = si_dup(si->si_next, param);
11148 nsi->si_markoff = si->si_markoff;
11153 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11154 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11155 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11156 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11157 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11158 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11159 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11160 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11161 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11162 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11163 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11164 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11165 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11166 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11169 #define pv_dup_inc(p) SAVEPV(p)
11170 #define pv_dup(p) SAVEPV(p)
11171 #define svp_dup_inc(p,pp) any_dup(p,pp)
11173 /* map any object to the new equivent - either something in the
11174 * ptr table, or something in the interpreter structure
11178 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11183 return (void*)NULL;
11185 /* look for it in the table first */
11186 ret = ptr_table_fetch(PL_ptr_table, v);
11190 /* see if it is part of the interpreter structure */
11191 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11192 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11200 /* duplicate the save stack */
11203 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11205 ANY *ss = proto_perl->Tsavestack;
11206 I32 ix = proto_perl->Tsavestack_ix;
11207 I32 max = proto_perl->Tsavestack_max;
11220 void (*dptr) (void*);
11221 void (*dxptr) (pTHX_ void*);
11224 Newz(54, nss, max, ANY);
11228 TOPINT(nss,ix) = i;
11230 case SAVEt_ITEM: /* normal string */
11231 sv = (SV*)POPPTR(ss,ix);
11232 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11233 sv = (SV*)POPPTR(ss,ix);
11234 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11236 case SAVEt_SV: /* scalar reference */
11237 sv = (SV*)POPPTR(ss,ix);
11238 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11239 gv = (GV*)POPPTR(ss,ix);
11240 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11242 case SAVEt_GENERIC_PVREF: /* generic char* */
11243 c = (char*)POPPTR(ss,ix);
11244 TOPPTR(nss,ix) = pv_dup(c);
11245 ptr = POPPTR(ss,ix);
11246 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11248 case SAVEt_SHARED_PVREF: /* char* in shared space */
11249 c = (char*)POPPTR(ss,ix);
11250 TOPPTR(nss,ix) = savesharedpv(c);
11251 ptr = POPPTR(ss,ix);
11252 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11254 case SAVEt_GENERIC_SVREF: /* generic sv */
11255 case SAVEt_SVREF: /* scalar reference */
11256 sv = (SV*)POPPTR(ss,ix);
11257 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11258 ptr = POPPTR(ss,ix);
11259 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11261 case SAVEt_AV: /* array reference */
11262 av = (AV*)POPPTR(ss,ix);
11263 TOPPTR(nss,ix) = av_dup_inc(av, param);
11264 gv = (GV*)POPPTR(ss,ix);
11265 TOPPTR(nss,ix) = gv_dup(gv, param);
11267 case SAVEt_HV: /* hash reference */
11268 hv = (HV*)POPPTR(ss,ix);
11269 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11270 gv = (GV*)POPPTR(ss,ix);
11271 TOPPTR(nss,ix) = gv_dup(gv, param);
11273 case SAVEt_INT: /* int reference */
11274 ptr = POPPTR(ss,ix);
11275 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11276 intval = (int)POPINT(ss,ix);
11277 TOPINT(nss,ix) = intval;
11279 case SAVEt_LONG: /* long reference */
11280 ptr = POPPTR(ss,ix);
11281 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11282 longval = (long)POPLONG(ss,ix);
11283 TOPLONG(nss,ix) = longval;
11285 case SAVEt_I32: /* I32 reference */
11286 case SAVEt_I16: /* I16 reference */
11287 case SAVEt_I8: /* I8 reference */
11288 ptr = POPPTR(ss,ix);
11289 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11291 TOPINT(nss,ix) = i;
11293 case SAVEt_IV: /* IV reference */
11294 ptr = POPPTR(ss,ix);
11295 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11297 TOPIV(nss,ix) = iv;
11299 case SAVEt_SPTR: /* SV* reference */
11300 ptr = POPPTR(ss,ix);
11301 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11302 sv = (SV*)POPPTR(ss,ix);
11303 TOPPTR(nss,ix) = sv_dup(sv, param);
11305 case SAVEt_VPTR: /* random* reference */
11306 ptr = POPPTR(ss,ix);
11307 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11308 ptr = POPPTR(ss,ix);
11309 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11311 case SAVEt_PPTR: /* char* reference */
11312 ptr = POPPTR(ss,ix);
11313 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11314 c = (char*)POPPTR(ss,ix);
11315 TOPPTR(nss,ix) = pv_dup(c);
11317 case SAVEt_HPTR: /* HV* reference */
11318 ptr = POPPTR(ss,ix);
11319 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11320 hv = (HV*)POPPTR(ss,ix);
11321 TOPPTR(nss,ix) = hv_dup(hv, param);
11323 case SAVEt_APTR: /* AV* reference */
11324 ptr = POPPTR(ss,ix);
11325 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11326 av = (AV*)POPPTR(ss,ix);
11327 TOPPTR(nss,ix) = av_dup(av, param);
11330 gv = (GV*)POPPTR(ss,ix);
11331 TOPPTR(nss,ix) = gv_dup(gv, param);
11333 case SAVEt_GP: /* scalar reference */
11334 gp = (GP*)POPPTR(ss,ix);
11335 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11336 (void)GpREFCNT_inc(gp);
11337 gv = (GV*)POPPTR(ss,ix);
11338 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11339 c = (char*)POPPTR(ss,ix);
11340 TOPPTR(nss,ix) = pv_dup(c);
11342 TOPIV(nss,ix) = iv;
11344 TOPIV(nss,ix) = iv;
11347 case SAVEt_MORTALIZESV:
11348 sv = (SV*)POPPTR(ss,ix);
11349 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11352 ptr = POPPTR(ss,ix);
11353 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11354 /* these are assumed to be refcounted properly */
11355 switch (((OP*)ptr)->op_type) {
11357 case OP_LEAVESUBLV:
11361 case OP_LEAVEWRITE:
11362 TOPPTR(nss,ix) = ptr;
11367 TOPPTR(nss,ix) = Nullop;
11372 TOPPTR(nss,ix) = Nullop;
11375 c = (char*)POPPTR(ss,ix);
11376 TOPPTR(nss,ix) = pv_dup_inc(c);
11378 case SAVEt_CLEARSV:
11379 longval = POPLONG(ss,ix);
11380 TOPLONG(nss,ix) = longval;
11383 hv = (HV*)POPPTR(ss,ix);
11384 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11385 c = (char*)POPPTR(ss,ix);
11386 TOPPTR(nss,ix) = pv_dup_inc(c);
11388 TOPINT(nss,ix) = i;
11390 case SAVEt_DESTRUCTOR:
11391 ptr = POPPTR(ss,ix);
11392 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11393 dptr = POPDPTR(ss,ix);
11394 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11396 case SAVEt_DESTRUCTOR_X:
11397 ptr = POPPTR(ss,ix);
11398 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11399 dxptr = POPDXPTR(ss,ix);
11400 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11402 case SAVEt_REGCONTEXT:
11405 TOPINT(nss,ix) = i;
11408 case SAVEt_STACK_POS: /* Position on Perl stack */
11410 TOPINT(nss,ix) = i;
11412 case SAVEt_AELEM: /* array element */
11413 sv = (SV*)POPPTR(ss,ix);
11414 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11416 TOPINT(nss,ix) = i;
11417 av = (AV*)POPPTR(ss,ix);
11418 TOPPTR(nss,ix) = av_dup_inc(av, param);
11420 case SAVEt_HELEM: /* hash element */
11421 sv = (SV*)POPPTR(ss,ix);
11422 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11423 sv = (SV*)POPPTR(ss,ix);
11424 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11425 hv = (HV*)POPPTR(ss,ix);
11426 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11429 ptr = POPPTR(ss,ix);
11430 TOPPTR(nss,ix) = ptr;
11434 TOPINT(nss,ix) = i;
11436 case SAVEt_COMPPAD:
11437 av = (AV*)POPPTR(ss,ix);
11438 TOPPTR(nss,ix) = av_dup(av, param);
11441 longval = (long)POPLONG(ss,ix);
11442 TOPLONG(nss,ix) = longval;
11443 ptr = POPPTR(ss,ix);
11444 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11445 sv = (SV*)POPPTR(ss,ix);
11446 TOPPTR(nss,ix) = sv_dup(sv, param);
11449 ptr = POPPTR(ss,ix);
11450 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11451 longval = (long)POPBOOL(ss,ix);
11452 TOPBOOL(nss,ix) = (bool)longval;
11454 case SAVEt_SET_SVFLAGS:
11456 TOPINT(nss,ix) = i;
11458 TOPINT(nss,ix) = i;
11459 sv = (SV*)POPPTR(ss,ix);
11460 TOPPTR(nss,ix) = sv_dup(sv, param);
11463 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11471 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11472 * flag to the result. This is done for each stash before cloning starts,
11473 * so we know which stashes want their objects cloned */
11476 do_mark_cloneable_stash(pTHX_ SV *sv)
11478 const char *hvname = HvNAME_get((HV*)sv);
11480 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11481 STRLEN len = HvNAMELEN_get((HV*)sv);
11482 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11483 if (cloner && GvCV(cloner)) {
11490 XPUSHs(sv_2mortal(newSVpvn(hvname, len)));
11492 call_sv((SV*)GvCV(cloner), G_SCALAR);
11499 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11507 =for apidoc perl_clone
11509 Create and return a new interpreter by cloning the current one.
11511 perl_clone takes these flags as parameters:
11513 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11514 without it we only clone the data and zero the stacks,
11515 with it we copy the stacks and the new perl interpreter is
11516 ready to run at the exact same point as the previous one.
11517 The pseudo-fork code uses COPY_STACKS while the
11518 threads->new doesn't.
11520 CLONEf_KEEP_PTR_TABLE
11521 perl_clone keeps a ptr_table with the pointer of the old
11522 variable as a key and the new variable as a value,
11523 this allows it to check if something has been cloned and not
11524 clone it again but rather just use the value and increase the
11525 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11526 the ptr_table using the function
11527 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11528 reason to keep it around is if you want to dup some of your own
11529 variable who are outside the graph perl scans, example of this
11530 code is in threads.xs create
11533 This is a win32 thing, it is ignored on unix, it tells perls
11534 win32host code (which is c++) to clone itself, this is needed on
11535 win32 if you want to run two threads at the same time,
11536 if you just want to do some stuff in a separate perl interpreter
11537 and then throw it away and return to the original one,
11538 you don't need to do anything.
11543 /* XXX the above needs expanding by someone who actually understands it ! */
11544 EXTERN_C PerlInterpreter *
11545 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11548 perl_clone(PerlInterpreter *proto_perl, UV flags)
11551 #ifdef PERL_IMPLICIT_SYS
11553 /* perlhost.h so we need to call into it
11554 to clone the host, CPerlHost should have a c interface, sky */
11556 if (flags & CLONEf_CLONE_HOST) {
11557 return perl_clone_host(proto_perl,flags);
11559 return perl_clone_using(proto_perl, flags,
11561 proto_perl->IMemShared,
11562 proto_perl->IMemParse,
11564 proto_perl->IStdIO,
11568 proto_perl->IProc);
11572 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11573 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11574 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11575 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11576 struct IPerlDir* ipD, struct IPerlSock* ipS,
11577 struct IPerlProc* ipP)
11579 /* XXX many of the string copies here can be optimized if they're
11580 * constants; they need to be allocated as common memory and just
11581 * their pointers copied. */
11584 CLONE_PARAMS clone_params;
11585 CLONE_PARAMS* param = &clone_params;
11587 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11588 /* for each stash, determine whether its objects should be cloned */
11589 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11590 PERL_SET_THX(my_perl);
11593 Poison(my_perl, 1, PerlInterpreter);
11595 PL_curcop = (COP *)Nullop;
11599 PL_savestack_ix = 0;
11600 PL_savestack_max = -1;
11601 PL_sig_pending = 0;
11602 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11603 # else /* !DEBUGGING */
11604 Zero(my_perl, 1, PerlInterpreter);
11605 # endif /* DEBUGGING */
11607 /* host pointers */
11609 PL_MemShared = ipMS;
11610 PL_MemParse = ipMP;
11617 #else /* !PERL_IMPLICIT_SYS */
11619 CLONE_PARAMS clone_params;
11620 CLONE_PARAMS* param = &clone_params;
11621 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11622 /* for each stash, determine whether its objects should be cloned */
11623 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11624 PERL_SET_THX(my_perl);
11627 Poison(my_perl, 1, PerlInterpreter);
11629 PL_curcop = (COP *)Nullop;
11633 PL_savestack_ix = 0;
11634 PL_savestack_max = -1;
11635 PL_sig_pending = 0;
11636 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11637 # else /* !DEBUGGING */
11638 Zero(my_perl, 1, PerlInterpreter);
11639 # endif /* DEBUGGING */
11640 #endif /* PERL_IMPLICIT_SYS */
11641 param->flags = flags;
11642 param->proto_perl = proto_perl;
11645 PL_xnv_arenaroot = NULL;
11646 PL_xnv_root = NULL;
11647 PL_xpv_arenaroot = NULL;
11648 PL_xpv_root = NULL;
11649 PL_xpviv_arenaroot = NULL;
11650 PL_xpviv_root = NULL;
11651 PL_xpvnv_arenaroot = NULL;
11652 PL_xpvnv_root = NULL;
11653 PL_xpvcv_arenaroot = NULL;
11654 PL_xpvcv_root = NULL;
11655 PL_xpvav_arenaroot = NULL;
11656 PL_xpvav_root = NULL;
11657 PL_xpvhv_arenaroot = NULL;
11658 PL_xpvhv_root = NULL;
11659 PL_xpvmg_arenaroot = NULL;
11660 PL_xpvmg_root = NULL;
11661 PL_xpvgv_arenaroot = NULL;
11662 PL_xpvgv_root = NULL;
11663 PL_xpvlv_arenaroot = NULL;
11664 PL_xpvlv_root = NULL;
11665 PL_xpvbm_arenaroot = NULL;
11666 PL_xpvbm_root = NULL;
11667 PL_he_arenaroot = NULL;
11669 #if defined(USE_ITHREADS)
11670 PL_pte_arenaroot = NULL;
11671 PL_pte_root = NULL;
11673 PL_nice_chunk = NULL;
11674 PL_nice_chunk_size = 0;
11676 PL_sv_objcount = 0;
11677 PL_sv_root = Nullsv;
11678 PL_sv_arenaroot = Nullsv;
11680 PL_debug = proto_perl->Idebug;
11682 PL_hash_seed = proto_perl->Ihash_seed;
11683 PL_rehash_seed = proto_perl->Irehash_seed;
11685 #ifdef USE_REENTRANT_API
11686 /* XXX: things like -Dm will segfault here in perlio, but doing
11687 * PERL_SET_CONTEXT(proto_perl);
11688 * breaks too many other things
11690 Perl_reentrant_init(aTHX);
11693 /* create SV map for pointer relocation */
11694 PL_ptr_table = ptr_table_new();
11695 /* and one for finding shared hash keys quickly */
11696 PL_shared_hek_table = ptr_table_new();
11698 /* initialize these special pointers as early as possible */
11699 SvANY(&PL_sv_undef) = NULL;
11700 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11701 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11702 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11704 SvANY(&PL_sv_no) = new_XPVNV();
11705 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11706 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11707 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11708 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11709 SvCUR_set(&PL_sv_no, 0);
11710 SvLEN_set(&PL_sv_no, 1);
11711 SvIV_set(&PL_sv_no, 0);
11712 SvNV_set(&PL_sv_no, 0);
11713 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11715 SvANY(&PL_sv_yes) = new_XPVNV();
11716 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11717 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11718 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11719 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11720 SvCUR_set(&PL_sv_yes, 1);
11721 SvLEN_set(&PL_sv_yes, 2);
11722 SvIV_set(&PL_sv_yes, 1);
11723 SvNV_set(&PL_sv_yes, 1);
11724 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11726 /* create (a non-shared!) shared string table */
11727 PL_strtab = newHV();
11728 HvSHAREKEYS_off(PL_strtab);
11729 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11730 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11732 PL_compiling = proto_perl->Icompiling;
11734 /* These two PVs will be free'd special way so must set them same way op.c does */
11735 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11736 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11738 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11739 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11741 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11742 if (!specialWARN(PL_compiling.cop_warnings))
11743 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11744 if (!specialCopIO(PL_compiling.cop_io))
11745 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11746 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11748 /* pseudo environmental stuff */
11749 PL_origargc = proto_perl->Iorigargc;
11750 PL_origargv = proto_perl->Iorigargv;
11752 param->stashes = newAV(); /* Setup array of objects to call clone on */
11754 #ifdef PERLIO_LAYERS
11755 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11756 PerlIO_clone(aTHX_ proto_perl, param);
11759 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11760 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11761 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11762 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11763 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11764 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11767 PL_minus_c = proto_perl->Iminus_c;
11768 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11769 PL_localpatches = proto_perl->Ilocalpatches;
11770 PL_splitstr = proto_perl->Isplitstr;
11771 PL_preprocess = proto_perl->Ipreprocess;
11772 PL_minus_n = proto_perl->Iminus_n;
11773 PL_minus_p = proto_perl->Iminus_p;
11774 PL_minus_l = proto_perl->Iminus_l;
11775 PL_minus_a = proto_perl->Iminus_a;
11776 PL_minus_F = proto_perl->Iminus_F;
11777 PL_doswitches = proto_perl->Idoswitches;
11778 PL_dowarn = proto_perl->Idowarn;
11779 PL_doextract = proto_perl->Idoextract;
11780 PL_sawampersand = proto_perl->Isawampersand;
11781 PL_unsafe = proto_perl->Iunsafe;
11782 PL_inplace = SAVEPV(proto_perl->Iinplace);
11783 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11784 PL_perldb = proto_perl->Iperldb;
11785 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11786 PL_exit_flags = proto_perl->Iexit_flags;
11788 /* magical thingies */
11789 /* XXX time(&PL_basetime) when asked for? */
11790 PL_basetime = proto_perl->Ibasetime;
11791 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11793 PL_maxsysfd = proto_perl->Imaxsysfd;
11794 PL_multiline = proto_perl->Imultiline;
11795 PL_statusvalue = proto_perl->Istatusvalue;
11797 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11799 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11801 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11802 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11803 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11805 /* Clone the regex array */
11806 PL_regex_padav = newAV();
11808 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11809 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11810 av_push(PL_regex_padav,
11811 sv_dup_inc(regexen[0],param));
11812 for(i = 1; i <= len; i++) {
11813 if(SvREPADTMP(regexen[i])) {
11814 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11816 av_push(PL_regex_padav,
11818 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11819 SvIVX(regexen[i])), param)))
11824 PL_regex_pad = AvARRAY(PL_regex_padav);
11826 /* shortcuts to various I/O objects */
11827 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11828 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11829 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11830 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11831 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11832 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11834 /* shortcuts to regexp stuff */
11835 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11837 /* shortcuts to misc objects */
11838 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11840 /* shortcuts to debugging objects */
11841 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11842 PL_DBline = gv_dup(proto_perl->IDBline, param);
11843 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11844 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11845 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11846 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11847 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11848 PL_lineary = av_dup(proto_perl->Ilineary, param);
11849 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11851 /* symbol tables */
11852 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11853 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11854 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11855 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11856 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11858 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11859 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11860 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11861 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11862 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11863 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11865 PL_sub_generation = proto_perl->Isub_generation;
11867 /* funky return mechanisms */
11868 PL_forkprocess = proto_perl->Iforkprocess;
11870 /* subprocess state */
11871 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11873 /* internal state */
11874 PL_tainting = proto_perl->Itainting;
11875 PL_taint_warn = proto_perl->Itaint_warn;
11876 PL_maxo = proto_perl->Imaxo;
11877 if (proto_perl->Iop_mask)
11878 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11880 PL_op_mask = Nullch;
11881 /* PL_asserting = proto_perl->Iasserting; */
11883 /* current interpreter roots */
11884 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11885 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11886 PL_main_start = proto_perl->Imain_start;
11887 PL_eval_root = proto_perl->Ieval_root;
11888 PL_eval_start = proto_perl->Ieval_start;
11890 /* runtime control stuff */
11891 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11892 PL_copline = proto_perl->Icopline;
11894 PL_filemode = proto_perl->Ifilemode;
11895 PL_lastfd = proto_perl->Ilastfd;
11896 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11899 PL_gensym = proto_perl->Igensym;
11900 PL_preambled = proto_perl->Ipreambled;
11901 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11902 PL_laststatval = proto_perl->Ilaststatval;
11903 PL_laststype = proto_perl->Ilaststype;
11904 PL_mess_sv = Nullsv;
11906 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11907 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11909 /* interpreter atexit processing */
11910 PL_exitlistlen = proto_perl->Iexitlistlen;
11911 if (PL_exitlistlen) {
11912 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11913 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11916 PL_exitlist = (PerlExitListEntry*)NULL;
11917 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11918 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11919 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11921 PL_profiledata = NULL;
11922 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11923 /* PL_rsfp_filters entries have fake IoDIRP() */
11924 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11926 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11928 PAD_CLONE_VARS(proto_perl, param);
11930 #ifdef HAVE_INTERP_INTERN
11931 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11934 /* more statics moved here */
11935 PL_generation = proto_perl->Igeneration;
11936 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11938 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11939 PL_in_clean_all = proto_perl->Iin_clean_all;
11941 PL_uid = proto_perl->Iuid;
11942 PL_euid = proto_perl->Ieuid;
11943 PL_gid = proto_perl->Igid;
11944 PL_egid = proto_perl->Iegid;
11945 PL_nomemok = proto_perl->Inomemok;
11946 PL_an = proto_perl->Ian;
11947 PL_evalseq = proto_perl->Ievalseq;
11948 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11949 PL_origalen = proto_perl->Iorigalen;
11950 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11951 PL_osname = SAVEPV(proto_perl->Iosname);
11952 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11953 PL_sighandlerp = proto_perl->Isighandlerp;
11956 PL_runops = proto_perl->Irunops;
11958 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11961 PL_cshlen = proto_perl->Icshlen;
11962 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11965 PL_lex_state = proto_perl->Ilex_state;
11966 PL_lex_defer = proto_perl->Ilex_defer;
11967 PL_lex_expect = proto_perl->Ilex_expect;
11968 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11969 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11970 PL_lex_starts = proto_perl->Ilex_starts;
11971 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11972 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11973 PL_lex_op = proto_perl->Ilex_op;
11974 PL_lex_inpat = proto_perl->Ilex_inpat;
11975 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11976 PL_lex_brackets = proto_perl->Ilex_brackets;
11977 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11978 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11979 PL_lex_casemods = proto_perl->Ilex_casemods;
11980 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11981 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11983 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11984 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11985 PL_nexttoke = proto_perl->Inexttoke;
11987 /* XXX This is probably masking the deeper issue of why
11988 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11989 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11990 * (A little debugging with a watchpoint on it may help.)
11992 if (SvANY(proto_perl->Ilinestr)) {
11993 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11994 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11995 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11996 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11997 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11998 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11999 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12000 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
12001 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12004 PL_linestr = NEWSV(65,79);
12005 sv_upgrade(PL_linestr,SVt_PVIV);
12006 sv_setpvn(PL_linestr,"",0);
12007 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
12009 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12010 PL_pending_ident = proto_perl->Ipending_ident;
12011 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
12013 PL_expect = proto_perl->Iexpect;
12015 PL_multi_start = proto_perl->Imulti_start;
12016 PL_multi_end = proto_perl->Imulti_end;
12017 PL_multi_open = proto_perl->Imulti_open;
12018 PL_multi_close = proto_perl->Imulti_close;
12020 PL_error_count = proto_perl->Ierror_count;
12021 PL_subline = proto_perl->Isubline;
12022 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
12024 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
12025 if (SvANY(proto_perl->Ilinestr)) {
12026 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
12027 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12028 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
12029 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12030 PL_last_lop_op = proto_perl->Ilast_lop_op;
12033 PL_last_uni = SvPVX(PL_linestr);
12034 PL_last_lop = SvPVX(PL_linestr);
12035 PL_last_lop_op = 0;
12037 PL_in_my = proto_perl->Iin_my;
12038 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12040 PL_cryptseen = proto_perl->Icryptseen;
12043 PL_hints = proto_perl->Ihints;
12045 PL_amagic_generation = proto_perl->Iamagic_generation;
12047 #ifdef USE_LOCALE_COLLATE
12048 PL_collation_ix = proto_perl->Icollation_ix;
12049 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12050 PL_collation_standard = proto_perl->Icollation_standard;
12051 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12052 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12053 #endif /* USE_LOCALE_COLLATE */
12055 #ifdef USE_LOCALE_NUMERIC
12056 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12057 PL_numeric_standard = proto_perl->Inumeric_standard;
12058 PL_numeric_local = proto_perl->Inumeric_local;
12059 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12060 #endif /* !USE_LOCALE_NUMERIC */
12062 /* utf8 character classes */
12063 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12064 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12065 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12066 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12067 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12068 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12069 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12070 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12071 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12072 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12073 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12074 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12075 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12076 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12077 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12078 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12079 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12080 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12081 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12082 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12084 /* Did the locale setup indicate UTF-8? */
12085 PL_utf8locale = proto_perl->Iutf8locale;
12086 /* Unicode features (see perlrun/-C) */
12087 PL_unicode = proto_perl->Iunicode;
12089 /* Pre-5.8 signals control */
12090 PL_signals = proto_perl->Isignals;
12092 /* times() ticks per second */
12093 PL_clocktick = proto_perl->Iclocktick;
12095 /* Recursion stopper for PerlIO_find_layer */
12096 PL_in_load_module = proto_perl->Iin_load_module;
12098 /* sort() routine */
12099 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12101 /* Not really needed/useful since the reenrant_retint is "volatile",
12102 * but do it for consistency's sake. */
12103 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12105 /* Hooks to shared SVs and locks. */
12106 PL_sharehook = proto_perl->Isharehook;
12107 PL_lockhook = proto_perl->Ilockhook;
12108 PL_unlockhook = proto_perl->Iunlockhook;
12109 PL_threadhook = proto_perl->Ithreadhook;
12111 PL_runops_std = proto_perl->Irunops_std;
12112 PL_runops_dbg = proto_perl->Irunops_dbg;
12114 #ifdef THREADS_HAVE_PIDS
12115 PL_ppid = proto_perl->Ippid;
12119 PL_last_swash_hv = Nullhv; /* reinits on demand */
12120 PL_last_swash_klen = 0;
12121 PL_last_swash_key[0]= '\0';
12122 PL_last_swash_tmps = (U8*)NULL;
12123 PL_last_swash_slen = 0;
12125 PL_glob_index = proto_perl->Iglob_index;
12126 PL_srand_called = proto_perl->Isrand_called;
12127 PL_uudmap['M'] = 0; /* reinits on demand */
12128 PL_bitcount = Nullch; /* reinits on demand */
12130 if (proto_perl->Ipsig_pend) {
12131 Newz(0, PL_psig_pend, SIG_SIZE, int);
12134 PL_psig_pend = (int*)NULL;
12137 if (proto_perl->Ipsig_ptr) {
12138 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12139 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12140 for (i = 1; i < SIG_SIZE; i++) {
12141 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12142 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12146 PL_psig_ptr = (SV**)NULL;
12147 PL_psig_name = (SV**)NULL;
12150 /* thrdvar.h stuff */
12152 if (flags & CLONEf_COPY_STACKS) {
12153 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12154 PL_tmps_ix = proto_perl->Ttmps_ix;
12155 PL_tmps_max = proto_perl->Ttmps_max;
12156 PL_tmps_floor = proto_perl->Ttmps_floor;
12157 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12159 while (i <= PL_tmps_ix) {
12160 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12164 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12165 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12166 Newz(54, PL_markstack, i, I32);
12167 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12168 - proto_perl->Tmarkstack);
12169 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12170 - proto_perl->Tmarkstack);
12171 Copy(proto_perl->Tmarkstack, PL_markstack,
12172 PL_markstack_ptr - PL_markstack + 1, I32);
12174 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12175 * NOTE: unlike the others! */
12176 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12177 PL_scopestack_max = proto_perl->Tscopestack_max;
12178 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12179 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12181 /* NOTE: si_dup() looks at PL_markstack */
12182 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12184 /* PL_curstack = PL_curstackinfo->si_stack; */
12185 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12186 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12188 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12189 PL_stack_base = AvARRAY(PL_curstack);
12190 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12191 - proto_perl->Tstack_base);
12192 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12194 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12195 * NOTE: unlike the others! */
12196 PL_savestack_ix = proto_perl->Tsavestack_ix;
12197 PL_savestack_max = proto_perl->Tsavestack_max;
12198 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12199 PL_savestack = ss_dup(proto_perl, param);
12203 ENTER; /* perl_destruct() wants to LEAVE; */
12206 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12207 PL_top_env = &PL_start_env;
12209 PL_op = proto_perl->Top;
12212 PL_Xpv = (XPV*)NULL;
12213 PL_na = proto_perl->Tna;
12215 PL_statbuf = proto_perl->Tstatbuf;
12216 PL_statcache = proto_perl->Tstatcache;
12217 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12218 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12220 PL_timesbuf = proto_perl->Ttimesbuf;
12223 PL_tainted = proto_perl->Ttainted;
12224 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12225 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12226 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12227 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12228 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12229 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12230 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12231 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12232 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12234 PL_restartop = proto_perl->Trestartop;
12235 PL_in_eval = proto_perl->Tin_eval;
12236 PL_delaymagic = proto_perl->Tdelaymagic;
12237 PL_dirty = proto_perl->Tdirty;
12238 PL_localizing = proto_perl->Tlocalizing;
12240 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12241 PL_hv_fetch_ent_mh = Nullhe;
12242 PL_modcount = proto_perl->Tmodcount;
12243 PL_lastgotoprobe = Nullop;
12244 PL_dumpindent = proto_perl->Tdumpindent;
12246 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12247 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12248 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12249 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12250 PL_sortcxix = proto_perl->Tsortcxix;
12251 PL_efloatbuf = Nullch; /* reinits on demand */
12252 PL_efloatsize = 0; /* reinits on demand */
12256 PL_screamfirst = NULL;
12257 PL_screamnext = NULL;
12258 PL_maxscream = -1; /* reinits on demand */
12259 PL_lastscream = Nullsv;
12261 PL_watchaddr = NULL;
12262 PL_watchok = Nullch;
12264 PL_regdummy = proto_perl->Tregdummy;
12265 PL_regprecomp = Nullch;
12268 PL_colorset = 0; /* reinits PL_colors[] */
12269 /*PL_colors[6] = {0,0,0,0,0,0};*/
12270 PL_reginput = Nullch;
12271 PL_regbol = Nullch;
12272 PL_regeol = Nullch;
12273 PL_regstartp = (I32*)NULL;
12274 PL_regendp = (I32*)NULL;
12275 PL_reglastparen = (U32*)NULL;
12276 PL_reglastcloseparen = (U32*)NULL;
12277 PL_regtill = Nullch;
12278 PL_reg_start_tmp = (char**)NULL;
12279 PL_reg_start_tmpl = 0;
12280 PL_regdata = (struct reg_data*)NULL;
12283 PL_reg_eval_set = 0;
12285 PL_regprogram = (regnode*)NULL;
12287 PL_regcc = (CURCUR*)NULL;
12288 PL_reg_call_cc = (struct re_cc_state*)NULL;
12289 PL_reg_re = (regexp*)NULL;
12290 PL_reg_ganch = Nullch;
12291 PL_reg_sv = Nullsv;
12292 PL_reg_match_utf8 = FALSE;
12293 PL_reg_magic = (MAGIC*)NULL;
12295 PL_reg_oldcurpm = (PMOP*)NULL;
12296 PL_reg_curpm = (PMOP*)NULL;
12297 PL_reg_oldsaved = Nullch;
12298 PL_reg_oldsavedlen = 0;
12299 #ifdef PERL_COPY_ON_WRITE
12302 PL_reg_maxiter = 0;
12303 PL_reg_leftiter = 0;
12304 PL_reg_poscache = Nullch;
12305 PL_reg_poscache_size= 0;
12307 /* RE engine - function pointers */
12308 PL_regcompp = proto_perl->Tregcompp;
12309 PL_regexecp = proto_perl->Tregexecp;
12310 PL_regint_start = proto_perl->Tregint_start;
12311 PL_regint_string = proto_perl->Tregint_string;
12312 PL_regfree = proto_perl->Tregfree;
12314 PL_reginterp_cnt = 0;
12315 PL_reg_starttry = 0;
12317 /* Pluggable optimizer */
12318 PL_peepp = proto_perl->Tpeepp;
12320 PL_stashcache = newHV();
12322 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12323 ptr_table_free(PL_ptr_table);
12324 PL_ptr_table = NULL;
12325 ptr_table_free(PL_shared_hek_table);
12326 PL_shared_hek_table = NULL;
12329 /* Call the ->CLONE method, if it exists, for each of the stashes
12330 identified by sv_dup() above.
12332 while(av_len(param->stashes) != -1) {
12333 HV* stash = (HV*) av_shift(param->stashes);
12334 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12335 if (cloner && GvCV(cloner)) {
12340 XPUSHs(sv_2mortal(newSVpvn(HvNAME_get(stash), HvNAMELEN_get(stash))));
12342 call_sv((SV*)GvCV(cloner), G_DISCARD);
12348 SvREFCNT_dec(param->stashes);
12350 /* orphaned? eg threads->new inside BEGIN or use */
12351 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12352 (void)SvREFCNT_inc(PL_compcv);
12353 SAVEFREESV(PL_compcv);
12359 #endif /* USE_ITHREADS */
12362 =head1 Unicode Support
12364 =for apidoc sv_recode_to_utf8
12366 The encoding is assumed to be an Encode object, on entry the PV
12367 of the sv is assumed to be octets in that encoding, and the sv
12368 will be converted into Unicode (and UTF-8).
12370 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12371 is not a reference, nothing is done to the sv. If the encoding is not
12372 an C<Encode::XS> Encoding object, bad things will happen.
12373 (See F<lib/encoding.pm> and L<Encode>).
12375 The PV of the sv is returned.
12380 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12383 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12397 Passing sv_yes is wrong - it needs to be or'ed set of constants
12398 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12399 remove converted chars from source.
12401 Both will default the value - let them.
12403 XPUSHs(&PL_sv_yes);
12406 call_method("decode", G_SCALAR);
12410 s = SvPV(uni, len);
12411 if (s != SvPVX(sv)) {
12412 SvGROW(sv, len + 1);
12413 Move(s, SvPVX(sv), len, char);
12414 SvCUR_set(sv, len);
12415 SvPVX(sv)[len] = 0;
12422 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12426 =for apidoc sv_cat_decode
12428 The encoding is assumed to be an Encode object, the PV of the ssv is
12429 assumed to be octets in that encoding and decoding the input starts
12430 from the position which (PV + *offset) pointed to. The dsv will be
12431 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12432 when the string tstr appears in decoding output or the input ends on
12433 the PV of the ssv. The value which the offset points will be modified
12434 to the last input position on the ssv.
12436 Returns TRUE if the terminator was found, else returns FALSE.
12441 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12442 SV *ssv, int *offset, char *tstr, int tlen)
12446 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12457 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12458 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12460 call_method("cat_decode", G_SCALAR);
12462 ret = SvTRUE(TOPs);
12463 *offset = SvIV(offsv);
12469 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12475 * c-indentation-style: bsd
12476 * c-basic-offset: 4
12477 * indent-tabs-mode: t
12480 * ex: set ts=8 sts=4 sw=4 noet: