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_OLD_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)) {
289 const SV * const sv = sva + 1;
290 const SV * const 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 const 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 S_free_arena(pTHX_ void **root) {
515 void ** const next = *(void **)root;
522 =for apidoc sv_free_arenas
524 Deallocate the memory used by all arenas. Note that all the individual SV
525 heads and bodies within the arenas must already have been freed.
530 #define free_arena(name) \
532 S_free_arena(aTHX_ (void**) PL_ ## name ## _arenaroot); \
533 PL_ ## name ## _arenaroot = 0; \
534 PL_ ## name ## _root = 0; \
538 Perl_sv_free_arenas(pTHX)
543 /* Free arenas here, but be careful about fake ones. (We assume
544 contiguity of the fake ones with the corresponding real ones.) */
546 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
547 svanext = (SV*) SvANY(sva);
548 while (svanext && SvFAKE(svanext))
549 svanext = (SV*) SvANY(svanext);
567 #if defined(USE_ITHREADS)
572 Safefree(PL_nice_chunk);
573 PL_nice_chunk = Nullch;
574 PL_nice_chunk_size = 0;
579 /* ---------------------------------------------------------------------
581 * support functions for report_uninit()
584 /* the maxiumum size of array or hash where we will scan looking
585 * for the undefined element that triggered the warning */
587 #define FUV_MAX_SEARCH_SIZE 1000
589 /* Look for an entry in the hash whose value has the same SV as val;
590 * If so, return a mortal copy of the key. */
593 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
599 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
600 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
605 for (i=HvMAX(hv); i>0; i--) {
607 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
608 if (HeVAL(entry) != val)
610 if ( HeVAL(entry) == &PL_sv_undef ||
611 HeVAL(entry) == &PL_sv_placeholder)
615 if (HeKLEN(entry) == HEf_SVKEY)
616 return sv_mortalcopy(HeKEY_sv(entry));
617 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
623 /* Look for an entry in the array whose value has the same SV as val;
624 * If so, return the index, otherwise return -1. */
627 S_find_array_subscript(pTHX_ AV *av, SV* val)
631 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
632 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
636 for (i=AvFILLp(av); i>=0; i--) {
637 if (svp[i] == val && svp[i] != &PL_sv_undef)
643 /* S_varname(): return the name of a variable, optionally with a subscript.
644 * If gv is non-zero, use the name of that global, along with gvtype (one
645 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
646 * targ. Depending on the value of the subscript_type flag, return:
649 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
650 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
651 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
652 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
655 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
656 SV* keyname, I32 aindex, int subscript_type)
659 SV * const name = sv_newmortal();
662 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
663 * XXX get rid of all this if gv_fullnameX() ever supports this
667 HV * const hv = GvSTASH(gv);
668 sv_setpv(name, gvtype);
671 else if (!(p=HvNAME_get(hv)))
673 if (strNE(p, "main")) {
675 sv_catpvn(name,"::", 2);
677 if (GvNAMELEN(gv)>= 1 &&
678 ((unsigned int)*GvNAME(gv)) <= 26)
680 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
681 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
684 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
688 CV * const cv = find_runcv(&unused);
692 if (!cv || !CvPADLIST(cv))
694 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
695 sv = *av_fetch(av, targ, FALSE);
696 /* SvLEN in a pad name is not to be trusted */
697 sv_setpv(name, SvPV_nolen_const(sv));
700 if (subscript_type == FUV_SUBSCRIPT_HASH) {
701 SV * const sv = NEWSV(0,0);
703 Perl_sv_catpvf(aTHX_ name, "{%s}",
704 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
707 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
709 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
711 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
712 sv_insert(name, 0, 0, "within ", 7);
719 =for apidoc find_uninit_var
721 Find the name of the undefined variable (if any) that caused the operator o
722 to issue a "Use of uninitialized value" warning.
723 If match is true, only return a name if it's value matches uninit_sv.
724 So roughly speaking, if a unary operator (such as OP_COS) generates a
725 warning, then following the direct child of the op may yield an
726 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
727 other hand, with OP_ADD there are two branches to follow, so we only print
728 the variable name if we get an exact match.
730 The name is returned as a mortal SV.
732 Assumes that PL_op is the op that originally triggered the error, and that
733 PL_comppad/PL_curpad points to the currently executing pad.
739 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
747 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
748 uninit_sv == &PL_sv_placeholder)))
751 switch (obase->op_type) {
758 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
759 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
762 int subscript_type = FUV_SUBSCRIPT_WITHIN;
764 if (pad) { /* @lex, %lex */
765 sv = PAD_SVl(obase->op_targ);
769 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
770 /* @global, %global */
771 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
774 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
776 else /* @{expr}, %{expr} */
777 return find_uninit_var(cUNOPx(obase)->op_first,
781 /* attempt to find a match within the aggregate */
783 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
785 subscript_type = FUV_SUBSCRIPT_HASH;
788 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
790 subscript_type = FUV_SUBSCRIPT_ARRAY;
793 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
796 return varname(gv, hash ? "%" : "@", obase->op_targ,
797 keysv, index, subscript_type);
801 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
803 return varname(Nullgv, "$", obase->op_targ,
804 Nullsv, 0, FUV_SUBSCRIPT_NONE);
807 gv = cGVOPx_gv(obase);
808 if (!gv || (match && GvSV(gv) != uninit_sv))
810 return varname(gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
813 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
816 av = (AV*)PAD_SV(obase->op_targ);
817 if (!av || SvRMAGICAL(av))
819 svp = av_fetch(av, (I32)obase->op_private, FALSE);
820 if (!svp || *svp != uninit_sv)
823 return varname(Nullgv, "$", obase->op_targ,
824 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
827 gv = cGVOPx_gv(obase);
833 if (!av || SvRMAGICAL(av))
835 svp = av_fetch(av, (I32)obase->op_private, FALSE);
836 if (!svp || *svp != uninit_sv)
839 return varname(gv, "$", 0,
840 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
845 o = cUNOPx(obase)->op_first;
846 if (!o || o->op_type != OP_NULL ||
847 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
849 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
854 /* $a[uninit_expr] or $h{uninit_expr} */
855 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
858 o = cBINOPx(obase)->op_first;
859 kid = cBINOPx(obase)->op_last;
861 /* get the av or hv, and optionally the gv */
863 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
864 sv = PAD_SV(o->op_targ);
866 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
867 && cUNOPo->op_first->op_type == OP_GV)
869 gv = cGVOPx_gv(cUNOPo->op_first);
872 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
877 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
878 /* index is constant */
882 if (obase->op_type == OP_HELEM) {
883 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
884 if (!he || HeVAL(he) != uninit_sv)
888 SV ** const svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
889 if (!svp || *svp != uninit_sv)
893 if (obase->op_type == OP_HELEM)
894 return varname(gv, "%", o->op_targ,
895 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
897 return varname(gv, "@", o->op_targ, Nullsv,
898 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
902 /* index is an expression;
903 * attempt to find a match within the aggregate */
904 if (obase->op_type == OP_HELEM) {
905 SV * const keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
907 return varname(gv, "%", o->op_targ,
908 keysv, 0, FUV_SUBSCRIPT_HASH);
911 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
913 return varname(gv, "@", o->op_targ,
914 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
919 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
921 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
927 /* only examine RHS */
928 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
931 o = cUNOPx(obase)->op_first;
932 if (o->op_type == OP_PUSHMARK)
935 if (!o->op_sibling) {
936 /* one-arg version of open is highly magical */
938 if (o->op_type == OP_GV) { /* open FOO; */
940 if (match && GvSV(gv) != uninit_sv)
942 return varname(gv, "$", 0,
943 Nullsv, 0, FUV_SUBSCRIPT_NONE);
945 /* other possibilities not handled are:
946 * open $x; or open my $x; should return '${*$x}'
947 * open expr; should return '$'.expr ideally
953 /* ops where $_ may be an implicit arg */
957 if ( !(obase->op_flags & OPf_STACKED)) {
958 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
959 ? PAD_SVl(obase->op_targ)
963 sv_setpvn(sv, "$_", 2);
971 /* skip filehandle as it can't produce 'undef' warning */
972 o = cUNOPx(obase)->op_first;
973 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
974 o = o->op_sibling->op_sibling;
981 match = 1; /* XS or custom code could trigger random warnings */
986 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
987 return sv_2mortal(newSVpv("${$/}", 0));
992 if (!(obase->op_flags & OPf_KIDS))
994 o = cUNOPx(obase)->op_first;
1000 /* if all except one arg are constant, or have no side-effects,
1001 * or are optimized away, then it's unambiguous */
1003 for (kid=o; kid; kid = kid->op_sibling) {
1005 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1006 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1007 || (kid->op_type == OP_PUSHMARK)
1011 if (o2) { /* more than one found */
1018 return find_uninit_var(o2, uninit_sv, match);
1022 sv = find_uninit_var(o, uninit_sv, 1);
1034 =for apidoc report_uninit
1036 Print appropriate "Use of uninitialized variable" warning
1042 Perl_report_uninit(pTHX_ SV* uninit_sv)
1045 SV* varname = Nullsv;
1047 varname = find_uninit_var(PL_op, uninit_sv,0);
1049 sv_insert(varname, 0, 0, " ", 1);
1051 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1052 varname ? SvPV_nolen_const(varname) : "",
1053 " in ", OP_DESC(PL_op));
1056 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1061 S_more_bodies (pTHX_ void **arena_root, void **root, size_t size)
1065 const size_t count = PERL_ARENA_SIZE/size;
1066 New(0, start, count*size, char);
1067 *((void **) start) = *arena_root;
1068 *arena_root = (void *)start;
1070 end = start + (count-1) * size;
1072 /* The initial slot is used to link the arenas together, so it isn't to be
1073 linked into the list of ready-to-use bodies. */
1077 *root = (void *)start;
1079 while (start < end) {
1080 char * const next = start + size;
1081 *(void**) start = (void *)next;
1084 *(void **)start = 0;
1089 /* grab a new thing from the free list, allocating more if necessary */
1092 S_new_body(pTHX_ void **arena_root, void **root, size_t size)
1096 xpv = *root ? *root : S_more_bodies(aTHX_ arena_root, root, size);
1097 *root = *(void**)xpv;
1102 /* return a thing to the free list */
1104 #define del_body(thing, root) \
1107 *(void **)thing = *root; \
1108 *root = (void*)thing; \
1112 /* Conventionally we simply malloc() a big block of memory, then divide it
1113 up into lots of the thing that we're allocating.
1115 This macro will expand to call to S_new_body. So for XPVBM (with ithreads),
1118 S_new_body(my_perl, (void**)&(my_perl->Ixpvbm_arenaroot),
1119 (void**)&(my_perl->Ixpvbm_root), sizeof(XPVBM), 0)
1122 #define new_body(TYPE,lctype) \
1123 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1124 (void**)&PL_ ## lctype ## _root, \
1127 #define del_body_type(p,TYPE,lctype) \
1128 del_body((void*)p, (void**)&PL_ ## lctype ## _root)
1130 /* But for some types, we cheat. The type starts with some members that are
1131 never accessed. So we allocate the substructure, starting at the first used
1132 member, then adjust the pointer back in memory by the size of the bit not
1133 allocated, so it's as if we allocated the full structure.
1134 (But things will all go boom if you write to the part that is "not there",
1135 because you'll be overwriting the last members of the preceding structure
1138 We calculate the correction using the STRUCT_OFFSET macro. For example, if
1139 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
1140 and the pointer is unchanged. If the allocated structure is smaller (no
1141 initial NV actually allocated) then the net effect is to subtract the size
1142 of the NV from the pointer, to return a new pointer as if an initial NV were
1145 This is the same trick as was used for NV and IV bodies. Ironically it
1146 doesn't need to be used for NV bodies any more, because NV is now at the
1147 start of the structure. IV bodies don't need it either, because they are
1148 no longer allocated. */
1150 #define new_body_allocated(TYPE,lctype,member) \
1151 (void*)((char*)S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1152 (void**)&PL_ ## lctype ## _root, \
1153 sizeof(lctype ## _allocated)) - \
1154 STRUCT_OFFSET(TYPE, member) \
1155 + STRUCT_OFFSET(lctype ## _allocated, member))
1158 #define del_body_allocated(p,TYPE,lctype,member) \
1159 del_body((void*)((char*)p + STRUCT_OFFSET(TYPE, member) \
1160 - STRUCT_OFFSET(lctype ## _allocated, member)), \
1161 (void**)&PL_ ## lctype ## _root)
1163 #define my_safemalloc(s) (void*)safemalloc(s)
1164 #define my_safefree(p) safefree((char*)p)
1168 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1169 #define del_XNV(p) my_safefree(p)
1171 #define new_XPV() my_safemalloc(sizeof(XPV))
1172 #define del_XPV(p) my_safefree(p)
1174 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1175 #define del_XPVIV(p) my_safefree(p)
1177 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1178 #define del_XPVNV(p) my_safefree(p)
1180 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1181 #define del_XPVCV(p) my_safefree(p)
1183 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1184 #define del_XPVAV(p) my_safefree(p)
1186 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1187 #define del_XPVHV(p) my_safefree(p)
1189 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1190 #define del_XPVMG(p) my_safefree(p)
1192 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1193 #define del_XPVGV(p) my_safefree(p)
1195 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1196 #define del_XPVLV(p) my_safefree(p)
1198 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1199 #define del_XPVBM(p) my_safefree(p)
1203 #define new_XNV() new_body(NV, xnv)
1204 #define del_XNV(p) del_body_type(p, NV, xnv)
1206 #define new_XPV() new_body_allocated(XPV, xpv, xpv_cur)
1207 #define del_XPV(p) del_body_allocated(p, XPV, xpv, xpv_cur)
1209 #define new_XPVIV() new_body_allocated(XPVIV, xpviv, xpv_cur)
1210 #define del_XPVIV(p) del_body_allocated(p, XPVIV, xpviv, xpv_cur)
1212 #define new_XPVNV() new_body(XPVNV, xpvnv)
1213 #define del_XPVNV(p) del_body_type(p, XPVNV, xpvnv)
1215 #define new_XPVCV() new_body(XPVCV, xpvcv)
1216 #define del_XPVCV(p) del_body_type(p, XPVCV, xpvcv)
1218 #define new_XPVAV() new_body_allocated(XPVAV, xpvav, xav_fill)
1219 #define del_XPVAV(p) del_body_allocated(p, XPVAV, xpvav, xav_fill)
1221 #define new_XPVHV() new_body_allocated(XPVHV, xpvhv, xhv_fill)
1222 #define del_XPVHV(p) del_body_allocated(p, XPVHV, xpvhv, xhv_fill)
1224 #define new_XPVMG() new_body(XPVMG, xpvmg)
1225 #define del_XPVMG(p) del_body_type(p, XPVMG, xpvmg)
1227 #define new_XPVGV() new_body(XPVGV, xpvgv)
1228 #define del_XPVGV(p) del_body_type(p, XPVGV, xpvgv)
1230 #define new_XPVLV() new_body(XPVLV, xpvlv)
1231 #define del_XPVLV(p) del_body_type(p, XPVLV, xpvlv)
1233 #define new_XPVBM() new_body(XPVBM, xpvbm)
1234 #define del_XPVBM(p) del_body_type(p, XPVBM, xpvbm)
1238 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1239 #define del_XPVFM(p) my_safefree(p)
1241 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1242 #define del_XPVIO(p) my_safefree(p)
1245 =for apidoc sv_upgrade
1247 Upgrade an SV to a more complex form. Generally adds a new body type to the
1248 SV, then copies across as much information as possible from the old body.
1249 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1255 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1257 void** old_body_arena;
1258 size_t old_body_offset;
1259 size_t old_body_length; /* Well, the length to copy. */
1261 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1262 /* If NV 0.0 is store as all bits 0 then Zero() already creates a correct
1264 bool zero_nv = TRUE;
1267 size_t new_body_length;
1268 size_t new_body_offset;
1269 void** new_body_arena;
1270 void** new_body_arenaroot;
1271 const U32 old_type = SvTYPE(sv);
1273 if (mt != SVt_PV && SvIsCOW(sv)) {
1274 sv_force_normal_flags(sv, 0);
1277 if (SvTYPE(sv) == mt)
1280 if (SvTYPE(sv) > mt)
1281 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1282 (int)SvTYPE(sv), (int)mt);
1285 old_body = SvANY(sv);
1287 old_body_offset = 0;
1288 old_body_length = 0;
1289 new_body_offset = 0;
1290 new_body_length = ~0;
1292 /* Copying structures onto other structures that have been neatly zeroed
1293 has a subtle gotcha. Consider XPVMG
1295 +------+------+------+------+------+-------+-------+
1296 | NV | CUR | LEN | IV | MAGIC | STASH |
1297 +------+------+------+------+------+-------+-------+
1298 0 4 8 12 16 20 24 28
1300 where NVs are aligned to 8 bytes, so that sizeof that structure is
1301 actually 32 bytes long, with 4 bytes of padding at the end:
1303 +------+------+------+------+------+-------+-------+------+
1304 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1305 +------+------+------+------+------+-------+-------+------+
1306 0 4 8 12 16 20 24 28 32
1308 so what happens if you allocate memory for this structure:
1310 +------+------+------+------+------+-------+-------+------+------+...
1311 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1312 +------+------+------+------+------+-------+-------+------+------+...
1313 0 4 8 12 16 20 24 28 32 36
1315 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1316 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1317 started out as zero once, but it's quite possible that it isn't. So now,
1318 rather than a nicely zeroed GP, you have it pointing somewhere random.
1321 (In fact, GP ends up pointing at a previous GP structure, because the
1322 principle cause of the padding in XPVMG getting garbage is a copy of
1323 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1325 So we are careful and work out the size of used parts of all the
1328 switch (SvTYPE(sv)) {
1334 else if (mt < SVt_PVIV)
1336 old_body_offset = STRUCT_OFFSET(XPVIV, xiv_iv);
1337 old_body_length = sizeof(IV);
1340 old_body_arena = (void **) &PL_xnv_root;
1341 old_body_length = sizeof(NV);
1342 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1351 old_body_arena = (void **) &PL_xpv_root;
1352 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1353 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1354 old_body_length = STRUCT_OFFSET(XPV, xpv_len)
1355 + sizeof (((XPV*)SvANY(sv))->xpv_len)
1359 else if (mt == SVt_NV)
1363 old_body_arena = (void **) &PL_xpviv_root;
1364 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1365 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1366 old_body_length = STRUCT_OFFSET(XPVIV, xiv_u)
1367 + sizeof (((XPVIV*)SvANY(sv))->xiv_u)
1371 old_body_arena = (void **) &PL_xpvnv_root;
1372 old_body_length = STRUCT_OFFSET(XPVNV, xiv_u)
1373 + sizeof (((XPVNV*)SvANY(sv))->xiv_u);
1374 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1379 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1380 there's no way that it can be safely upgraded, because perl.c
1381 expects to Safefree(SvANY(PL_mess_sv)) */
1382 assert(sv != PL_mess_sv);
1383 /* This flag bit is used to mean other things in other scalar types.
1384 Given that it only has meaning inside the pad, it shouldn't be set
1385 on anything that can get upgraded. */
1386 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1387 old_body_arena = (void **) &PL_xpvmg_root;
1388 old_body_length = STRUCT_OFFSET(XPVMG, xmg_stash)
1389 + sizeof (((XPVMG*)SvANY(sv))->xmg_stash);
1390 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1395 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1398 SvFLAGS(sv) &= ~SVTYPEMASK;
1403 Perl_croak(aTHX_ "Can't upgrade to undef");
1405 assert(old_type == SVt_NULL);
1406 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1410 assert(old_type == SVt_NULL);
1411 SvANY(sv) = new_XNV();
1415 assert(old_type == SVt_NULL);
1416 SvANY(sv) = &sv->sv_u.svu_rv;
1420 SvANY(sv) = new_XPVHV();
1423 HvTOTALKEYS(sv) = 0;
1428 SvANY(sv) = new_XPVAV();
1435 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1436 The target created by newSVrv also is, and it can have magic.
1437 However, it never has SvPVX set.
1439 if (old_type >= SVt_RV) {
1440 assert(SvPVX_const(sv) == 0);
1443 /* Could put this in the else clause below, as PVMG must have SvPVX
1444 0 already (the assertion above) */
1445 SvPV_set(sv, (char*)0);
1447 if (old_type >= SVt_PVMG) {
1448 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1449 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1457 new_body = new_XPVIO();
1458 new_body_length = sizeof(XPVIO);
1461 new_body = new_XPVFM();
1462 new_body_length = sizeof(XPVFM);
1466 new_body_length = sizeof(XPVBM);
1467 new_body_arena = (void **) &PL_xpvbm_root;
1468 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
1471 new_body_length = sizeof(XPVGV);
1472 new_body_arena = (void **) &PL_xpvgv_root;
1473 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
1476 new_body_length = sizeof(XPVCV);
1477 new_body_arena = (void **) &PL_xpvcv_root;
1478 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
1481 new_body_length = sizeof(XPVLV);
1482 new_body_arena = (void **) &PL_xpvlv_root;
1483 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
1486 new_body_length = sizeof(XPVMG);
1487 new_body_arena = (void **) &PL_xpvmg_root;
1488 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
1491 new_body_length = sizeof(XPVNV);
1492 new_body_arena = (void **) &PL_xpvnv_root;
1493 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
1496 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1497 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1498 new_body_length = sizeof(XPVIV) - new_body_offset;
1499 new_body_arena = (void **) &PL_xpviv_root;
1500 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
1501 /* XXX Is this still needed? Was it ever needed? Surely as there is
1502 no route from NV to PVIV, NOK can never be true */
1506 goto new_body_no_NV;
1508 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1509 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1510 new_body_length = sizeof(XPV) - new_body_offset;
1511 new_body_arena = (void **) &PL_xpv_root;
1512 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
1514 /* PV and PVIV don't have an NV slot. */
1515 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1520 assert(new_body_length);
1522 /* This points to the start of the allocated area. */
1523 new_body = S_new_body(aTHX_ new_body_arenaroot, new_body_arena,
1526 /* We always allocated the full length item with PURIFY */
1527 new_body_length += new_body_offset;
1528 new_body_offset = 0;
1529 new_body = my_safemalloc(new_body_length);
1533 Zero(new_body, new_body_length, char);
1534 new_body = ((char *)new_body) - new_body_offset;
1535 SvANY(sv) = new_body;
1537 if (old_body_length) {
1538 Copy((char *)old_body + old_body_offset,
1539 (char *)new_body + old_body_offset,
1540 old_body_length, char);
1543 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1549 IoPAGE_LEN(sv) = 60;
1550 if (old_type < SVt_RV)
1554 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", mt);
1558 if (old_body_arena) {
1560 my_safefree(old_body);
1562 del_body((void*)((char*)old_body + old_body_offset),
1569 =for apidoc sv_backoff
1571 Remove any string offset. You should normally use the C<SvOOK_off> macro
1578 Perl_sv_backoff(pTHX_ register SV *sv)
1581 assert(SvTYPE(sv) != SVt_PVHV);
1582 assert(SvTYPE(sv) != SVt_PVAV);
1584 const char * const s = SvPVX_const(sv);
1585 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1586 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1588 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1590 SvFLAGS(sv) &= ~SVf_OOK;
1597 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1598 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1599 Use the C<SvGROW> wrapper instead.
1605 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1609 #ifdef HAS_64K_LIMIT
1610 if (newlen >= 0x10000) {
1611 PerlIO_printf(Perl_debug_log,
1612 "Allocation too large: %"UVxf"\n", (UV)newlen);
1615 #endif /* HAS_64K_LIMIT */
1618 if (SvTYPE(sv) < SVt_PV) {
1619 sv_upgrade(sv, SVt_PV);
1620 s = SvPVX_mutable(sv);
1622 else if (SvOOK(sv)) { /* pv is offset? */
1624 s = SvPVX_mutable(sv);
1625 if (newlen > SvLEN(sv))
1626 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1627 #ifdef HAS_64K_LIMIT
1628 if (newlen >= 0x10000)
1633 s = SvPVX_mutable(sv);
1635 if (newlen > SvLEN(sv)) { /* need more room? */
1636 newlen = PERL_STRLEN_ROUNDUP(newlen);
1637 if (SvLEN(sv) && s) {
1639 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1645 s = saferealloc(s, newlen);
1648 s = safemalloc(newlen);
1649 if (SvPVX_const(sv) && SvCUR(sv)) {
1650 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1654 SvLEN_set(sv, newlen);
1660 =for apidoc sv_setiv
1662 Copies an integer into the given SV, upgrading first if necessary.
1663 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1669 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1671 SV_CHECK_THINKFIRST_COW_DROP(sv);
1672 switch (SvTYPE(sv)) {
1674 sv_upgrade(sv, SVt_IV);
1677 sv_upgrade(sv, SVt_PVNV);
1681 sv_upgrade(sv, SVt_PVIV);
1690 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1693 (void)SvIOK_only(sv); /* validate number */
1699 =for apidoc sv_setiv_mg
1701 Like C<sv_setiv>, but also handles 'set' magic.
1707 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1714 =for apidoc sv_setuv
1716 Copies an unsigned integer into the given SV, upgrading first if necessary.
1717 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1723 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1725 /* With these two if statements:
1726 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1729 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1731 If you wish to remove them, please benchmark to see what the effect is
1733 if (u <= (UV)IV_MAX) {
1734 sv_setiv(sv, (IV)u);
1743 =for apidoc sv_setuv_mg
1745 Like C<sv_setuv>, but also handles 'set' magic.
1751 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1753 /* With these two if statements:
1754 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1757 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1759 If you wish to remove them, please benchmark to see what the effect is
1761 if (u <= (UV)IV_MAX) {
1762 sv_setiv(sv, (IV)u);
1772 =for apidoc sv_setnv
1774 Copies a double into the given SV, upgrading first if necessary.
1775 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1781 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1783 SV_CHECK_THINKFIRST_COW_DROP(sv);
1784 switch (SvTYPE(sv)) {
1787 sv_upgrade(sv, SVt_NV);
1792 sv_upgrade(sv, SVt_PVNV);
1801 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1805 (void)SvNOK_only(sv); /* validate number */
1810 =for apidoc sv_setnv_mg
1812 Like C<sv_setnv>, but also handles 'set' magic.
1818 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1824 /* Print an "isn't numeric" warning, using a cleaned-up,
1825 * printable version of the offending string
1829 S_not_a_number(pTHX_ SV *sv)
1836 dsv = sv_2mortal(newSVpv("", 0));
1837 pv = sv_uni_display(dsv, sv, 10, 0);
1840 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1841 /* each *s can expand to 4 chars + "...\0",
1842 i.e. need room for 8 chars */
1844 const char *s, *end;
1845 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1848 if (ch & 128 && !isPRINT_LC(ch)) {
1857 else if (ch == '\r') {
1861 else if (ch == '\f') {
1865 else if (ch == '\\') {
1869 else if (ch == '\0') {
1873 else if (isPRINT_LC(ch))
1890 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1891 "Argument \"%s\" isn't numeric in %s", pv,
1894 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1895 "Argument \"%s\" isn't numeric", pv);
1899 =for apidoc looks_like_number
1901 Test if the content of an SV looks like a number (or is a number).
1902 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1903 non-numeric warning), even if your atof() doesn't grok them.
1909 Perl_looks_like_number(pTHX_ SV *sv)
1911 register const char *sbegin;
1915 sbegin = SvPVX_const(sv);
1918 else if (SvPOKp(sv))
1919 sbegin = SvPV_const(sv, len);
1921 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1922 return grok_number(sbegin, len, NULL);
1925 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1926 until proven guilty, assume that things are not that bad... */
1931 As 64 bit platforms often have an NV that doesn't preserve all bits of
1932 an IV (an assumption perl has been based on to date) it becomes necessary
1933 to remove the assumption that the NV always carries enough precision to
1934 recreate the IV whenever needed, and that the NV is the canonical form.
1935 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1936 precision as a side effect of conversion (which would lead to insanity
1937 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1938 1) to distinguish between IV/UV/NV slots that have cached a valid
1939 conversion where precision was lost and IV/UV/NV slots that have a
1940 valid conversion which has lost no precision
1941 2) to ensure that if a numeric conversion to one form is requested that
1942 would lose precision, the precise conversion (or differently
1943 imprecise conversion) is also performed and cached, to prevent
1944 requests for different numeric formats on the same SV causing
1945 lossy conversion chains. (lossless conversion chains are perfectly
1950 SvIOKp is true if the IV slot contains a valid value
1951 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1952 SvNOKp is true if the NV slot contains a valid value
1953 SvNOK is true only if the NV value is accurate
1956 while converting from PV to NV, check to see if converting that NV to an
1957 IV(or UV) would lose accuracy over a direct conversion from PV to
1958 IV(or UV). If it would, cache both conversions, return NV, but mark
1959 SV as IOK NOKp (ie not NOK).
1961 While converting from PV to IV, check to see if converting that IV to an
1962 NV would lose accuracy over a direct conversion from PV to NV. If it
1963 would, cache both conversions, flag similarly.
1965 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1966 correctly because if IV & NV were set NV *always* overruled.
1967 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1968 changes - now IV and NV together means that the two are interchangeable:
1969 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1971 The benefit of this is that operations such as pp_add know that if
1972 SvIOK is true for both left and right operands, then integer addition
1973 can be used instead of floating point (for cases where the result won't
1974 overflow). Before, floating point was always used, which could lead to
1975 loss of precision compared with integer addition.
1977 * making IV and NV equal status should make maths accurate on 64 bit
1979 * may speed up maths somewhat if pp_add and friends start to use
1980 integers when possible instead of fp. (Hopefully the overhead in
1981 looking for SvIOK and checking for overflow will not outweigh the
1982 fp to integer speedup)
1983 * will slow down integer operations (callers of SvIV) on "inaccurate"
1984 values, as the change from SvIOK to SvIOKp will cause a call into
1985 sv_2iv each time rather than a macro access direct to the IV slot
1986 * should speed up number->string conversion on integers as IV is
1987 favoured when IV and NV are equally accurate
1989 ####################################################################
1990 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1991 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1992 On the other hand, SvUOK is true iff UV.
1993 ####################################################################
1995 Your mileage will vary depending your CPU's relative fp to integer
1999 #ifndef NV_PRESERVES_UV
2000 # define IS_NUMBER_UNDERFLOW_IV 1
2001 # define IS_NUMBER_UNDERFLOW_UV 2
2002 # define IS_NUMBER_IV_AND_UV 2
2003 # define IS_NUMBER_OVERFLOW_IV 4
2004 # define IS_NUMBER_OVERFLOW_UV 5
2006 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2008 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2010 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2012 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX_const(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
2013 if (SvNVX(sv) < (NV)IV_MIN) {
2014 (void)SvIOKp_on(sv);
2016 SvIV_set(sv, IV_MIN);
2017 return IS_NUMBER_UNDERFLOW_IV;
2019 if (SvNVX(sv) > (NV)UV_MAX) {
2020 (void)SvIOKp_on(sv);
2023 SvUV_set(sv, UV_MAX);
2024 return IS_NUMBER_OVERFLOW_UV;
2026 (void)SvIOKp_on(sv);
2028 /* Can't use strtol etc to convert this string. (See truth table in
2030 if (SvNVX(sv) <= (UV)IV_MAX) {
2031 SvIV_set(sv, I_V(SvNVX(sv)));
2032 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2033 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2035 /* Integer is imprecise. NOK, IOKp */
2037 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2040 SvUV_set(sv, U_V(SvNVX(sv)));
2041 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2042 if (SvUVX(sv) == UV_MAX) {
2043 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2044 possibly be preserved by NV. Hence, it must be overflow.
2046 return IS_NUMBER_OVERFLOW_UV;
2048 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2050 /* Integer is imprecise. NOK, IOKp */
2052 return IS_NUMBER_OVERFLOW_IV;
2054 #endif /* !NV_PRESERVES_UV*/
2056 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2057 * this function provided for binary compatibility only
2061 Perl_sv_2iv(pTHX_ register SV *sv)
2063 return sv_2iv_flags(sv, SV_GMAGIC);
2067 =for apidoc sv_2iv_flags
2069 Return the integer value of an SV, doing any necessary string
2070 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2071 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2077 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2081 if (SvGMAGICAL(sv)) {
2082 if (flags & SV_GMAGIC)
2087 return I_V(SvNVX(sv));
2089 if (SvPOKp(sv) && SvLEN(sv))
2092 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2093 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2099 if (SvTHINKFIRST(sv)) {
2102 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2103 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2104 return SvIV(tmpstr);
2105 return PTR2IV(SvRV(sv));
2108 sv_force_normal_flags(sv, 0);
2110 if (SvREADONLY(sv) && !SvOK(sv)) {
2111 if (ckWARN(WARN_UNINITIALIZED))
2118 return (IV)(SvUVX(sv));
2125 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2126 * without also getting a cached IV/UV from it at the same time
2127 * (ie PV->NV conversion should detect loss of accuracy and cache
2128 * IV or UV at same time to avoid this. NWC */
2130 if (SvTYPE(sv) == SVt_NV)
2131 sv_upgrade(sv, SVt_PVNV);
2133 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2134 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2135 certainly cast into the IV range at IV_MAX, whereas the correct
2136 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2138 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2139 SvIV_set(sv, I_V(SvNVX(sv)));
2140 if (SvNVX(sv) == (NV) SvIVX(sv)
2141 #ifndef NV_PRESERVES_UV
2142 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2143 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2144 /* Don't flag it as "accurately an integer" if the number
2145 came from a (by definition imprecise) NV operation, and
2146 we're outside the range of NV integer precision */
2149 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2150 DEBUG_c(PerlIO_printf(Perl_debug_log,
2151 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2157 /* IV not precise. No need to convert from PV, as NV
2158 conversion would already have cached IV if it detected
2159 that PV->IV would be better than PV->NV->IV
2160 flags already correct - don't set public IOK. */
2161 DEBUG_c(PerlIO_printf(Perl_debug_log,
2162 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2167 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2168 but the cast (NV)IV_MIN rounds to a the value less (more
2169 negative) than IV_MIN which happens to be equal to SvNVX ??
2170 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2171 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2172 (NV)UVX == NVX are both true, but the values differ. :-(
2173 Hopefully for 2s complement IV_MIN is something like
2174 0x8000000000000000 which will be exact. NWC */
2177 SvUV_set(sv, U_V(SvNVX(sv)));
2179 (SvNVX(sv) == (NV) SvUVX(sv))
2180 #ifndef NV_PRESERVES_UV
2181 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2182 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2183 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2184 /* Don't flag it as "accurately an integer" if the number
2185 came from a (by definition imprecise) NV operation, and
2186 we're outside the range of NV integer precision */
2192 DEBUG_c(PerlIO_printf(Perl_debug_log,
2193 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2197 return (IV)SvUVX(sv);
2200 else if (SvPOKp(sv) && SvLEN(sv)) {
2202 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2203 /* We want to avoid a possible problem when we cache an IV which
2204 may be later translated to an NV, and the resulting NV is not
2205 the same as the direct translation of the initial string
2206 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2207 be careful to ensure that the value with the .456 is around if the
2208 NV value is requested in the future).
2210 This means that if we cache such an IV, we need to cache the
2211 NV as well. Moreover, we trade speed for space, and do not
2212 cache the NV if we are sure it's not needed.
2215 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2216 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2217 == IS_NUMBER_IN_UV) {
2218 /* It's definitely an integer, only upgrade to PVIV */
2219 if (SvTYPE(sv) < SVt_PVIV)
2220 sv_upgrade(sv, SVt_PVIV);
2222 } else if (SvTYPE(sv) < SVt_PVNV)
2223 sv_upgrade(sv, SVt_PVNV);
2225 /* If NV preserves UV then we only use the UV value if we know that
2226 we aren't going to call atof() below. If NVs don't preserve UVs
2227 then the value returned may have more precision than atof() will
2228 return, even though value isn't perfectly accurate. */
2229 if ((numtype & (IS_NUMBER_IN_UV
2230 #ifdef NV_PRESERVES_UV
2233 )) == IS_NUMBER_IN_UV) {
2234 /* This won't turn off the public IOK flag if it was set above */
2235 (void)SvIOKp_on(sv);
2237 if (!(numtype & IS_NUMBER_NEG)) {
2239 if (value <= (UV)IV_MAX) {
2240 SvIV_set(sv, (IV)value);
2242 SvUV_set(sv, value);
2246 /* 2s complement assumption */
2247 if (value <= (UV)IV_MIN) {
2248 SvIV_set(sv, -(IV)value);
2250 /* Too negative for an IV. This is a double upgrade, but
2251 I'm assuming it will be rare. */
2252 if (SvTYPE(sv) < SVt_PVNV)
2253 sv_upgrade(sv, SVt_PVNV);
2257 SvNV_set(sv, -(NV)value);
2258 SvIV_set(sv, IV_MIN);
2262 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2263 will be in the previous block to set the IV slot, and the next
2264 block to set the NV slot. So no else here. */
2266 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2267 != IS_NUMBER_IN_UV) {
2268 /* It wasn't an (integer that doesn't overflow the UV). */
2269 SvNV_set(sv, Atof(SvPVX_const(sv)));
2271 if (! numtype && ckWARN(WARN_NUMERIC))
2274 #if defined(USE_LONG_DOUBLE)
2275 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2276 PTR2UV(sv), SvNVX(sv)));
2278 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2279 PTR2UV(sv), SvNVX(sv)));
2283 #ifdef NV_PRESERVES_UV
2284 (void)SvIOKp_on(sv);
2286 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2287 SvIV_set(sv, I_V(SvNVX(sv)));
2288 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2291 /* Integer is imprecise. NOK, IOKp */
2293 /* UV will not work better than IV */
2295 if (SvNVX(sv) > (NV)UV_MAX) {
2297 /* Integer is inaccurate. NOK, IOKp, is UV */
2298 SvUV_set(sv, UV_MAX);
2301 SvUV_set(sv, U_V(SvNVX(sv)));
2302 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2303 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2307 /* Integer is imprecise. NOK, IOKp, is UV */
2313 #else /* NV_PRESERVES_UV */
2314 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2315 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2316 /* The IV slot will have been set from value returned by
2317 grok_number above. The NV slot has just been set using
2320 assert (SvIOKp(sv));
2322 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2323 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2324 /* Small enough to preserve all bits. */
2325 (void)SvIOKp_on(sv);
2327 SvIV_set(sv, I_V(SvNVX(sv)));
2328 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2330 /* Assumption: first non-preserved integer is < IV_MAX,
2331 this NV is in the preserved range, therefore: */
2332 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2334 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);
2338 0 0 already failed to read UV.
2339 0 1 already failed to read UV.
2340 1 0 you won't get here in this case. IV/UV
2341 slot set, public IOK, Atof() unneeded.
2342 1 1 already read UV.
2343 so there's no point in sv_2iuv_non_preserve() attempting
2344 to use atol, strtol, strtoul etc. */
2345 if (sv_2iuv_non_preserve (sv, numtype)
2346 >= IS_NUMBER_OVERFLOW_IV)
2350 #endif /* NV_PRESERVES_UV */
2353 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2355 if (SvTYPE(sv) < SVt_IV)
2356 /* Typically the caller expects that sv_any is not NULL now. */
2357 sv_upgrade(sv, SVt_IV);
2360 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2361 PTR2UV(sv),SvIVX(sv)));
2362 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2365 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2366 * this function provided for binary compatibility only
2370 Perl_sv_2uv(pTHX_ register SV *sv)
2372 return sv_2uv_flags(sv, SV_GMAGIC);
2376 =for apidoc sv_2uv_flags
2378 Return the unsigned integer value of an SV, doing any necessary string
2379 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2380 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2386 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2390 if (SvGMAGICAL(sv)) {
2391 if (flags & SV_GMAGIC)
2396 return U_V(SvNVX(sv));
2397 if (SvPOKp(sv) && SvLEN(sv))
2400 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2401 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2407 if (SvTHINKFIRST(sv)) {
2410 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2411 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2412 return SvUV(tmpstr);
2413 return PTR2UV(SvRV(sv));
2416 sv_force_normal_flags(sv, 0);
2418 if (SvREADONLY(sv) && !SvOK(sv)) {
2419 if (ckWARN(WARN_UNINITIALIZED))
2429 return (UV)SvIVX(sv);
2433 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2434 * without also getting a cached IV/UV from it at the same time
2435 * (ie PV->NV conversion should detect loss of accuracy and cache
2436 * IV or UV at same time to avoid this. */
2437 /* IV-over-UV optimisation - choose to cache IV if possible */
2439 if (SvTYPE(sv) == SVt_NV)
2440 sv_upgrade(sv, SVt_PVNV);
2442 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2443 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2444 SvIV_set(sv, I_V(SvNVX(sv)));
2445 if (SvNVX(sv) == (NV) SvIVX(sv)
2446 #ifndef NV_PRESERVES_UV
2447 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2448 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2449 /* Don't flag it as "accurately an integer" if the number
2450 came from a (by definition imprecise) NV operation, and
2451 we're outside the range of NV integer precision */
2454 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2455 DEBUG_c(PerlIO_printf(Perl_debug_log,
2456 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2462 /* IV not precise. No need to convert from PV, as NV
2463 conversion would already have cached IV if it detected
2464 that PV->IV would be better than PV->NV->IV
2465 flags already correct - don't set public IOK. */
2466 DEBUG_c(PerlIO_printf(Perl_debug_log,
2467 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2472 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2473 but the cast (NV)IV_MIN rounds to a the value less (more
2474 negative) than IV_MIN which happens to be equal to SvNVX ??
2475 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2476 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2477 (NV)UVX == NVX are both true, but the values differ. :-(
2478 Hopefully for 2s complement IV_MIN is something like
2479 0x8000000000000000 which will be exact. NWC */
2482 SvUV_set(sv, U_V(SvNVX(sv)));
2484 (SvNVX(sv) == (NV) SvUVX(sv))
2485 #ifndef NV_PRESERVES_UV
2486 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2487 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2488 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2489 /* Don't flag it as "accurately an integer" if the number
2490 came from a (by definition imprecise) NV operation, and
2491 we're outside the range of NV integer precision */
2496 DEBUG_c(PerlIO_printf(Perl_debug_log,
2497 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2503 else if (SvPOKp(sv) && SvLEN(sv)) {
2505 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2507 /* We want to avoid a possible problem when we cache a UV which
2508 may be later translated to an NV, and the resulting NV is not
2509 the translation of the initial data.
2511 This means that if we cache such a UV, we need to cache the
2512 NV as well. Moreover, we trade speed for space, and do not
2513 cache the NV if not needed.
2516 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2517 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2518 == IS_NUMBER_IN_UV) {
2519 /* It's definitely an integer, only upgrade to PVIV */
2520 if (SvTYPE(sv) < SVt_PVIV)
2521 sv_upgrade(sv, SVt_PVIV);
2523 } else if (SvTYPE(sv) < SVt_PVNV)
2524 sv_upgrade(sv, SVt_PVNV);
2526 /* If NV preserves UV then we only use the UV value if we know that
2527 we aren't going to call atof() below. If NVs don't preserve UVs
2528 then the value returned may have more precision than atof() will
2529 return, even though it isn't accurate. */
2530 if ((numtype & (IS_NUMBER_IN_UV
2531 #ifdef NV_PRESERVES_UV
2534 )) == IS_NUMBER_IN_UV) {
2535 /* This won't turn off the public IOK flag if it was set above */
2536 (void)SvIOKp_on(sv);
2538 if (!(numtype & IS_NUMBER_NEG)) {
2540 if (value <= (UV)IV_MAX) {
2541 SvIV_set(sv, (IV)value);
2543 /* it didn't overflow, and it was positive. */
2544 SvUV_set(sv, value);
2548 /* 2s complement assumption */
2549 if (value <= (UV)IV_MIN) {
2550 SvIV_set(sv, -(IV)value);
2552 /* Too negative for an IV. This is a double upgrade, but
2553 I'm assuming it will be rare. */
2554 if (SvTYPE(sv) < SVt_PVNV)
2555 sv_upgrade(sv, SVt_PVNV);
2559 SvNV_set(sv, -(NV)value);
2560 SvIV_set(sv, IV_MIN);
2565 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2566 != IS_NUMBER_IN_UV) {
2567 /* It wasn't an integer, or it overflowed the UV. */
2568 SvNV_set(sv, Atof(SvPVX_const(sv)));
2570 if (! numtype && ckWARN(WARN_NUMERIC))
2573 #if defined(USE_LONG_DOUBLE)
2574 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2575 PTR2UV(sv), SvNVX(sv)));
2577 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2578 PTR2UV(sv), SvNVX(sv)));
2581 #ifdef NV_PRESERVES_UV
2582 (void)SvIOKp_on(sv);
2584 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2585 SvIV_set(sv, I_V(SvNVX(sv)));
2586 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2589 /* Integer is imprecise. NOK, IOKp */
2591 /* UV will not work better than IV */
2593 if (SvNVX(sv) > (NV)UV_MAX) {
2595 /* Integer is inaccurate. NOK, IOKp, is UV */
2596 SvUV_set(sv, UV_MAX);
2599 SvUV_set(sv, U_V(SvNVX(sv)));
2600 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2601 NV preservse UV so can do correct comparison. */
2602 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2606 /* Integer is imprecise. NOK, IOKp, is UV */
2611 #else /* NV_PRESERVES_UV */
2612 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2613 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2614 /* The UV slot will have been set from value returned by
2615 grok_number above. The NV slot has just been set using
2618 assert (SvIOKp(sv));
2620 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2621 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2622 /* Small enough to preserve all bits. */
2623 (void)SvIOKp_on(sv);
2625 SvIV_set(sv, I_V(SvNVX(sv)));
2626 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2628 /* Assumption: first non-preserved integer is < IV_MAX,
2629 this NV is in the preserved range, therefore: */
2630 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2632 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);
2635 sv_2iuv_non_preserve (sv, numtype);
2637 #endif /* NV_PRESERVES_UV */
2641 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2642 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2645 if (SvTYPE(sv) < SVt_IV)
2646 /* Typically the caller expects that sv_any is not NULL now. */
2647 sv_upgrade(sv, SVt_IV);
2651 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2652 PTR2UV(sv),SvUVX(sv)));
2653 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2659 Return the num value of an SV, doing any necessary string or integer
2660 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2667 Perl_sv_2nv(pTHX_ register SV *sv)
2671 if (SvGMAGICAL(sv)) {
2675 if (SvPOKp(sv) && SvLEN(sv)) {
2676 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2677 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2679 return Atof(SvPVX_const(sv));
2683 return (NV)SvUVX(sv);
2685 return (NV)SvIVX(sv);
2688 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2689 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2695 if (SvTHINKFIRST(sv)) {
2698 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2699 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2700 return SvNV(tmpstr);
2701 return PTR2NV(SvRV(sv));
2704 sv_force_normal_flags(sv, 0);
2706 if (SvREADONLY(sv) && !SvOK(sv)) {
2707 if (ckWARN(WARN_UNINITIALIZED))
2712 if (SvTYPE(sv) < SVt_NV) {
2713 if (SvTYPE(sv) == SVt_IV)
2714 sv_upgrade(sv, SVt_PVNV);
2716 sv_upgrade(sv, SVt_NV);
2717 #ifdef USE_LONG_DOUBLE
2719 STORE_NUMERIC_LOCAL_SET_STANDARD();
2720 PerlIO_printf(Perl_debug_log,
2721 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2722 PTR2UV(sv), SvNVX(sv));
2723 RESTORE_NUMERIC_LOCAL();
2727 STORE_NUMERIC_LOCAL_SET_STANDARD();
2728 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2729 PTR2UV(sv), SvNVX(sv));
2730 RESTORE_NUMERIC_LOCAL();
2734 else if (SvTYPE(sv) < SVt_PVNV)
2735 sv_upgrade(sv, SVt_PVNV);
2740 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2741 #ifdef NV_PRESERVES_UV
2744 /* Only set the public NV OK flag if this NV preserves the IV */
2745 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2746 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2747 : (SvIVX(sv) == I_V(SvNVX(sv))))
2753 else if (SvPOKp(sv) && SvLEN(sv)) {
2755 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2756 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2758 #ifdef NV_PRESERVES_UV
2759 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2760 == IS_NUMBER_IN_UV) {
2761 /* It's definitely an integer */
2762 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2764 SvNV_set(sv, Atof(SvPVX_const(sv)));
2767 SvNV_set(sv, Atof(SvPVX_const(sv)));
2768 /* Only set the public NV OK flag if this NV preserves the value in
2769 the PV at least as well as an IV/UV would.
2770 Not sure how to do this 100% reliably. */
2771 /* if that shift count is out of range then Configure's test is
2772 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2774 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2775 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2776 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2777 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2778 /* Can't use strtol etc to convert this string, so don't try.
2779 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2782 /* value has been set. It may not be precise. */
2783 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2784 /* 2s complement assumption for (UV)IV_MIN */
2785 SvNOK_on(sv); /* Integer is too negative. */
2790 if (numtype & IS_NUMBER_NEG) {
2791 SvIV_set(sv, -(IV)value);
2792 } else if (value <= (UV)IV_MAX) {
2793 SvIV_set(sv, (IV)value);
2795 SvUV_set(sv, value);
2799 if (numtype & IS_NUMBER_NOT_INT) {
2800 /* I believe that even if the original PV had decimals,
2801 they are lost beyond the limit of the FP precision.
2802 However, neither is canonical, so both only get p
2803 flags. NWC, 2000/11/25 */
2804 /* Both already have p flags, so do nothing */
2806 const NV nv = SvNVX(sv);
2807 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2808 if (SvIVX(sv) == I_V(nv)) {
2813 /* It had no "." so it must be integer. */
2816 /* between IV_MAX and NV(UV_MAX).
2817 Could be slightly > UV_MAX */
2819 if (numtype & IS_NUMBER_NOT_INT) {
2820 /* UV and NV both imprecise. */
2822 const UV nv_as_uv = U_V(nv);
2824 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2835 #endif /* NV_PRESERVES_UV */
2838 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2840 if (SvTYPE(sv) < SVt_NV)
2841 /* Typically the caller expects that sv_any is not NULL now. */
2842 /* XXX Ilya implies that this is a bug in callers that assume this
2843 and ideally should be fixed. */
2844 sv_upgrade(sv, SVt_NV);
2847 #if defined(USE_LONG_DOUBLE)
2849 STORE_NUMERIC_LOCAL_SET_STANDARD();
2850 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2851 PTR2UV(sv), SvNVX(sv));
2852 RESTORE_NUMERIC_LOCAL();
2856 STORE_NUMERIC_LOCAL_SET_STANDARD();
2857 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2858 PTR2UV(sv), SvNVX(sv));
2859 RESTORE_NUMERIC_LOCAL();
2865 /* asIV(): extract an integer from the string value of an SV.
2866 * Caller must validate PVX */
2869 S_asIV(pTHX_ SV *sv)
2872 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2874 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2875 == IS_NUMBER_IN_UV) {
2876 /* It's definitely an integer */
2877 if (numtype & IS_NUMBER_NEG) {
2878 if (value < (UV)IV_MIN)
2881 if (value < (UV)IV_MAX)
2886 if (ckWARN(WARN_NUMERIC))
2889 return I_V(Atof(SvPVX_const(sv)));
2892 /* asUV(): extract an unsigned integer from the string value of an SV
2893 * Caller must validate PVX */
2896 S_asUV(pTHX_ SV *sv)
2899 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2901 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2902 == IS_NUMBER_IN_UV) {
2903 /* It's definitely an integer */
2904 if (!(numtype & IS_NUMBER_NEG))
2908 if (ckWARN(WARN_NUMERIC))
2911 return U_V(Atof(SvPVX_const(sv)));
2915 =for apidoc sv_2pv_nolen
2917 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2918 use the macro wrapper C<SvPV_nolen(sv)> instead.
2923 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2925 return sv_2pv(sv, 0);
2928 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2929 * UV as a string towards the end of buf, and return pointers to start and
2932 * We assume that buf is at least TYPE_CHARS(UV) long.
2936 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2938 char *ptr = buf + TYPE_CHARS(UV);
2952 *--ptr = '0' + (char)(uv % 10);
2960 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2961 * this function provided for binary compatibility only
2965 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2967 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2971 =for apidoc sv_2pv_flags
2973 Returns a pointer to the string value of an SV, and sets *lp to its length.
2974 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2976 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2977 usually end up here too.
2983 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2988 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2989 char *tmpbuf = tbuf;
2996 if (SvGMAGICAL(sv)) {
2997 if (flags & SV_GMAGIC)
3002 if (flags & SV_MUTABLE_RETURN)
3003 return SvPVX_mutable(sv);
3004 if (flags & SV_CONST_RETURN)
3005 return (char *)SvPVX_const(sv);
3010 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3012 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3017 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3022 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3023 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3031 if (SvTHINKFIRST(sv)) {
3034 register const char *typestr;
3035 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3036 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3038 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3041 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3042 if (flags & SV_CONST_RETURN) {
3043 pv = (char *) SvPVX_const(tmpstr);
3045 pv = (flags & SV_MUTABLE_RETURN)
3046 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3049 *lp = SvCUR(tmpstr);
3051 pv = sv_2pv_flags(tmpstr, lp, flags);
3062 typestr = "NULLREF";
3066 switch (SvTYPE(sv)) {
3068 if ( ((SvFLAGS(sv) &
3069 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3070 == (SVs_OBJECT|SVs_SMG))
3071 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3072 const regexp *re = (regexp *)mg->mg_obj;
3075 const char *fptr = "msix";
3080 char need_newline = 0;
3081 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3083 while((ch = *fptr++)) {
3085 reflags[left++] = ch;
3088 reflags[right--] = ch;
3093 reflags[left] = '-';
3097 mg->mg_len = re->prelen + 4 + left;
3099 * If /x was used, we have to worry about a regex
3100 * ending with a comment later being embedded
3101 * within another regex. If so, we don't want this
3102 * regex's "commentization" to leak out to the
3103 * right part of the enclosing regex, we must cap
3104 * it with a newline.
3106 * So, if /x was used, we scan backwards from the
3107 * end of the regex. If we find a '#' before we
3108 * find a newline, we need to add a newline
3109 * ourself. If we find a '\n' first (or if we
3110 * don't find '#' or '\n'), we don't need to add
3111 * anything. -jfriedl
3113 if (PMf_EXTENDED & re->reganch)
3115 const char *endptr = re->precomp + re->prelen;
3116 while (endptr >= re->precomp)
3118 const char c = *(endptr--);
3120 break; /* don't need another */
3122 /* we end while in a comment, so we
3124 mg->mg_len++; /* save space for it */
3125 need_newline = 1; /* note to add it */
3131 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3132 Copy("(?", mg->mg_ptr, 2, char);
3133 Copy(reflags, mg->mg_ptr+2, left, char);
3134 Copy(":", mg->mg_ptr+left+2, 1, char);
3135 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3137 mg->mg_ptr[mg->mg_len - 2] = '\n';
3138 mg->mg_ptr[mg->mg_len - 1] = ')';
3139 mg->mg_ptr[mg->mg_len] = 0;
3141 PL_reginterp_cnt += re->program[0].next_off;
3143 if (re->reganch & ROPT_UTF8)
3159 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3160 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3161 /* tied lvalues should appear to be
3162 * scalars for backwards compatitbility */
3163 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3164 ? "SCALAR" : "LVALUE"; break;
3165 case SVt_PVAV: typestr = "ARRAY"; break;
3166 case SVt_PVHV: typestr = "HASH"; break;
3167 case SVt_PVCV: typestr = "CODE"; break;
3168 case SVt_PVGV: typestr = "GLOB"; break;
3169 case SVt_PVFM: typestr = "FORMAT"; break;
3170 case SVt_PVIO: typestr = "IO"; break;
3171 default: typestr = "UNKNOWN"; break;
3175 const char *name = HvNAME_get(SvSTASH(sv));
3176 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3177 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3180 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3184 *lp = strlen(typestr);
3185 return (char *)typestr;
3187 if (SvREADONLY(sv) && !SvOK(sv)) {
3188 if (ckWARN(WARN_UNINITIALIZED))
3195 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3196 /* I'm assuming that if both IV and NV are equally valid then
3197 converting the IV is going to be more efficient */
3198 const U32 isIOK = SvIOK(sv);
3199 const U32 isUIOK = SvIsUV(sv);
3200 char buf[TYPE_CHARS(UV)];
3203 if (SvTYPE(sv) < SVt_PVIV)
3204 sv_upgrade(sv, SVt_PVIV);
3206 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3208 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3209 /* inlined from sv_setpvn */
3210 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3211 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3212 SvCUR_set(sv, ebuf - ptr);
3222 else if (SvNOKp(sv)) {
3223 if (SvTYPE(sv) < SVt_PVNV)
3224 sv_upgrade(sv, SVt_PVNV);
3225 /* The +20 is pure guesswork. Configure test needed. --jhi */
3226 s = SvGROW_mutable(sv, NV_DIG + 20);
3227 olderrno = errno; /* some Xenix systems wipe out errno here */
3229 if (SvNVX(sv) == 0.0)
3230 (void)strcpy(s,"0");
3234 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3237 #ifdef FIXNEGATIVEZERO
3238 if (*s == '-' && s[1] == '0' && !s[2])
3248 if (ckWARN(WARN_UNINITIALIZED)
3249 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3253 if (SvTYPE(sv) < SVt_PV)
3254 /* Typically the caller expects that sv_any is not NULL now. */
3255 sv_upgrade(sv, SVt_PV);
3259 STRLEN len = s - SvPVX_const(sv);
3265 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3266 PTR2UV(sv),SvPVX_const(sv)));
3267 if (flags & SV_CONST_RETURN)
3268 return (char *)SvPVX_const(sv);
3269 if (flags & SV_MUTABLE_RETURN)
3270 return SvPVX_mutable(sv);
3274 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3275 /* Sneaky stuff here */
3279 tsv = newSVpv(tmpbuf, 0);
3292 t = SvPVX_const(tsv);
3297 len = strlen(tmpbuf);
3299 #ifdef FIXNEGATIVEZERO
3300 if (len == 2 && t[0] == '-' && t[1] == '0') {
3305 SvUPGRADE(sv, SVt_PV);
3308 s = SvGROW_mutable(sv, len + 1);
3311 return strcpy(s, t);
3316 =for apidoc sv_copypv
3318 Copies a stringified representation of the source SV into the
3319 destination SV. Automatically performs any necessary mg_get and
3320 coercion of numeric values into strings. Guaranteed to preserve
3321 UTF-8 flag even from overloaded objects. Similar in nature to
3322 sv_2pv[_flags] but operates directly on an SV instead of just the
3323 string. Mostly uses sv_2pv_flags to do its work, except when that
3324 would lose the UTF-8'ness of the PV.
3330 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3333 const char * const s = SvPV_const(ssv,len);
3334 sv_setpvn(dsv,s,len);
3342 =for apidoc sv_2pvbyte_nolen
3344 Return a pointer to the byte-encoded representation of the SV.
3345 May cause the SV to be downgraded from UTF-8 as a side-effect.
3347 Usually accessed via the C<SvPVbyte_nolen> macro.
3353 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3355 return sv_2pvbyte(sv, 0);
3359 =for apidoc sv_2pvbyte
3361 Return a pointer to the byte-encoded representation of the SV, and set *lp
3362 to its length. May cause the SV to be downgraded from UTF-8 as a
3365 Usually accessed via the C<SvPVbyte> macro.
3371 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3373 sv_utf8_downgrade(sv,0);
3374 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3378 =for apidoc sv_2pvutf8_nolen
3380 Return a pointer to the UTF-8-encoded representation of the SV.
3381 May cause the SV to be upgraded to UTF-8 as a side-effect.
3383 Usually accessed via the C<SvPVutf8_nolen> macro.
3389 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3391 return sv_2pvutf8(sv, 0);
3395 =for apidoc sv_2pvutf8
3397 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3398 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3400 Usually accessed via the C<SvPVutf8> macro.
3406 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3408 sv_utf8_upgrade(sv);
3409 return SvPV(sv,*lp);
3413 =for apidoc sv_2bool
3415 This function is only called on magical items, and is only used by
3416 sv_true() or its macro equivalent.
3422 Perl_sv_2bool(pTHX_ register SV *sv)
3431 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3432 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3433 return (bool)SvTRUE(tmpsv);
3434 return SvRV(sv) != 0;
3437 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
3439 (*sv->sv_u.svu_pv > '0' ||
3440 Xpvtmp->xpv_cur > 1 ||
3441 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3448 return SvIVX(sv) != 0;
3451 return SvNVX(sv) != 0.0;
3458 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3459 * this function provided for binary compatibility only
3464 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3466 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3470 =for apidoc sv_utf8_upgrade
3472 Converts the PV of an SV to its UTF-8-encoded form.
3473 Forces the SV to string form if it is not already.
3474 Always sets the SvUTF8 flag to avoid future validity checks even
3475 if all the bytes have hibit clear.
3477 This is not as a general purpose byte encoding to Unicode interface:
3478 use the Encode extension for that.
3480 =for apidoc sv_utf8_upgrade_flags
3482 Converts the PV of an SV to its UTF-8-encoded form.
3483 Forces the SV to string form if it is not already.
3484 Always sets the SvUTF8 flag to avoid future validity checks even
3485 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3486 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3487 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3489 This is not as a general purpose byte encoding to Unicode interface:
3490 use the Encode extension for that.
3496 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3498 if (sv == &PL_sv_undef)
3502 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3503 (void) sv_2pv_flags(sv,&len, flags);
3507 (void) SvPV_force(sv,len);
3516 sv_force_normal_flags(sv, 0);
3519 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3520 sv_recode_to_utf8(sv, PL_encoding);
3521 else { /* Assume Latin-1/EBCDIC */
3522 /* This function could be much more efficient if we
3523 * had a FLAG in SVs to signal if there are any hibit
3524 * chars in the PV. Given that there isn't such a flag
3525 * make the loop as fast as possible. */
3526 const U8 *s = (U8 *) SvPVX_const(sv);
3527 const U8 *e = (U8 *) SvEND(sv);
3533 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3537 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3538 U8 * const recoded = bytes_to_utf8((U8*)s, &len);
3540 SvPV_free(sv); /* No longer using what was there before. */
3542 SvPV_set(sv, (char*)recoded);
3543 SvCUR_set(sv, len - 1);
3544 SvLEN_set(sv, len); /* No longer know the real size. */
3546 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3553 =for apidoc sv_utf8_downgrade
3555 Attempts to convert the PV of an SV from characters to bytes.
3556 If the PV contains a character beyond byte, this conversion will fail;
3557 in this case, either returns false or, if C<fail_ok> is not
3560 This is not as a general purpose Unicode to byte encoding interface:
3561 use the Encode extension for that.
3567 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3569 if (SvPOKp(sv) && SvUTF8(sv)) {
3575 sv_force_normal_flags(sv, 0);
3577 s = (U8 *) SvPV(sv, len);
3578 if (!utf8_to_bytes(s, &len)) {
3583 Perl_croak(aTHX_ "Wide character in %s",
3586 Perl_croak(aTHX_ "Wide character");
3597 =for apidoc sv_utf8_encode
3599 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3600 flag off so that it looks like octets again.
3606 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3608 (void) sv_utf8_upgrade(sv);
3610 sv_force_normal_flags(sv, 0);
3612 if (SvREADONLY(sv)) {
3613 Perl_croak(aTHX_ PL_no_modify);
3619 =for apidoc sv_utf8_decode
3621 If the PV of the SV is an octet sequence in UTF-8
3622 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3623 so that it looks like a character. If the PV contains only single-byte
3624 characters, the C<SvUTF8> flag stays being off.
3625 Scans PV for validity and returns false if the PV is invalid UTF-8.
3631 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3637 /* The octets may have got themselves encoded - get them back as
3640 if (!sv_utf8_downgrade(sv, TRUE))
3643 /* it is actually just a matter of turning the utf8 flag on, but
3644 * we want to make sure everything inside is valid utf8 first.
3646 c = (const U8 *) SvPVX_const(sv);
3647 if (!is_utf8_string(c, SvCUR(sv)+1))
3649 e = (const U8 *) SvEND(sv);
3652 if (!UTF8_IS_INVARIANT(ch)) {
3661 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3662 * this function provided for binary compatibility only
3666 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3668 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3672 =for apidoc sv_setsv
3674 Copies the contents of the source SV C<ssv> into the destination SV
3675 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3676 function if the source SV needs to be reused. Does not handle 'set' magic.
3677 Loosely speaking, it performs a copy-by-value, obliterating any previous
3678 content of the destination.
3680 You probably want to use one of the assortment of wrappers, such as
3681 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3682 C<SvSetMagicSV_nosteal>.
3684 =for apidoc sv_setsv_flags
3686 Copies the contents of the source SV C<ssv> into the destination SV
3687 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3688 function if the source SV needs to be reused. Does not handle 'set' magic.
3689 Loosely speaking, it performs a copy-by-value, obliterating any previous
3690 content of the destination.
3691 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3692 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3693 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3694 and C<sv_setsv_nomg> are implemented in terms of this function.
3696 You probably want to use one of the assortment of wrappers, such as
3697 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3698 C<SvSetMagicSV_nosteal>.
3700 This is the primary function for copying scalars, and most other
3701 copy-ish functions and macros use this underneath.
3707 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3709 register U32 sflags;
3715 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3717 sstr = &PL_sv_undef;
3718 stype = SvTYPE(sstr);
3719 dtype = SvTYPE(dstr);
3724 /* need to nuke the magic */
3726 SvRMAGICAL_off(dstr);
3729 /* There's a lot of redundancy below but we're going for speed here */
3734 if (dtype != SVt_PVGV) {
3735 (void)SvOK_off(dstr);
3743 sv_upgrade(dstr, SVt_IV);
3746 sv_upgrade(dstr, SVt_PVNV);
3750 sv_upgrade(dstr, SVt_PVIV);
3753 (void)SvIOK_only(dstr);
3754 SvIV_set(dstr, SvIVX(sstr));
3757 if (SvTAINTED(sstr))
3768 sv_upgrade(dstr, SVt_NV);
3773 sv_upgrade(dstr, SVt_PVNV);
3776 SvNV_set(dstr, SvNVX(sstr));
3777 (void)SvNOK_only(dstr);
3778 if (SvTAINTED(sstr))
3786 sv_upgrade(dstr, SVt_RV);
3787 else if (dtype == SVt_PVGV &&
3788 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3791 if (GvIMPORTED(dstr) != GVf_IMPORTED
3792 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3794 GvIMPORTED_on(dstr);
3803 #ifdef PERL_OLD_COPY_ON_WRITE
3804 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3805 if (dtype < SVt_PVIV)
3806 sv_upgrade(dstr, SVt_PVIV);
3813 sv_upgrade(dstr, SVt_PV);
3816 if (dtype < SVt_PVIV)
3817 sv_upgrade(dstr, SVt_PVIV);
3820 if (dtype < SVt_PVNV)
3821 sv_upgrade(dstr, SVt_PVNV);
3828 const char * const type = sv_reftype(sstr,0);
3830 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3832 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3837 if (dtype <= SVt_PVGV) {
3839 if (dtype != SVt_PVGV) {
3840 const char * const name = GvNAME(sstr);
3841 const STRLEN len = GvNAMELEN(sstr);
3842 /* don't upgrade SVt_PVLV: it can hold a glob */
3843 if (dtype != SVt_PVLV)
3844 sv_upgrade(dstr, SVt_PVGV);
3845 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3846 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3847 GvNAME(dstr) = savepvn(name, len);
3848 GvNAMELEN(dstr) = len;
3849 SvFAKE_on(dstr); /* can coerce to non-glob */
3851 /* ahem, death to those who redefine active sort subs */
3852 else if (PL_curstackinfo->si_type == PERLSI_SORT
3853 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3854 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3857 #ifdef GV_UNIQUE_CHECK
3858 if (GvUNIQUE((GV*)dstr)) {
3859 Perl_croak(aTHX_ PL_no_modify);
3863 (void)SvOK_off(dstr);
3864 GvINTRO_off(dstr); /* one-shot flag */
3866 GvGP(dstr) = gp_ref(GvGP(sstr));
3867 if (SvTAINTED(sstr))
3869 if (GvIMPORTED(dstr) != GVf_IMPORTED
3870 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3872 GvIMPORTED_on(dstr);
3880 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3882 if ((int)SvTYPE(sstr) != stype) {
3883 stype = SvTYPE(sstr);
3884 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3888 if (stype == SVt_PVLV)
3889 SvUPGRADE(dstr, SVt_PVNV);
3891 SvUPGRADE(dstr, (U32)stype);
3894 sflags = SvFLAGS(sstr);
3896 if (sflags & SVf_ROK) {
3897 if (dtype >= SVt_PV) {
3898 if (dtype == SVt_PVGV) {
3899 SV *sref = SvREFCNT_inc(SvRV(sstr));
3901 const int intro = GvINTRO(dstr);
3903 #ifdef GV_UNIQUE_CHECK
3904 if (GvUNIQUE((GV*)dstr)) {
3905 Perl_croak(aTHX_ PL_no_modify);
3910 GvINTRO_off(dstr); /* one-shot flag */
3911 GvLINE(dstr) = CopLINE(PL_curcop);
3912 GvEGV(dstr) = (GV*)dstr;
3915 switch (SvTYPE(sref)) {
3918 SAVEGENERICSV(GvAV(dstr));
3920 dref = (SV*)GvAV(dstr);
3921 GvAV(dstr) = (AV*)sref;
3922 if (!GvIMPORTED_AV(dstr)
3923 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3925 GvIMPORTED_AV_on(dstr);
3930 SAVEGENERICSV(GvHV(dstr));
3932 dref = (SV*)GvHV(dstr);
3933 GvHV(dstr) = (HV*)sref;
3934 if (!GvIMPORTED_HV(dstr)
3935 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3937 GvIMPORTED_HV_on(dstr);
3942 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3943 SvREFCNT_dec(GvCV(dstr));
3944 GvCV(dstr) = Nullcv;
3945 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3946 PL_sub_generation++;
3948 SAVEGENERICSV(GvCV(dstr));
3951 dref = (SV*)GvCV(dstr);
3952 if (GvCV(dstr) != (CV*)sref) {
3953 CV* cv = GvCV(dstr);
3955 if (!GvCVGEN((GV*)dstr) &&
3956 (CvROOT(cv) || CvXSUB(cv)))
3958 /* ahem, death to those who redefine
3959 * active sort subs */
3960 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3961 PL_sortcop == CvSTART(cv))
3963 "Can't redefine active sort subroutine %s",
3964 GvENAME((GV*)dstr));
3965 /* Redefining a sub - warning is mandatory if
3966 it was a const and its value changed. */
3967 if (ckWARN(WARN_REDEFINE)
3969 && (!CvCONST((CV*)sref)
3970 || sv_cmp(cv_const_sv(cv),
3971 cv_const_sv((CV*)sref)))))
3973 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3975 ? "Constant subroutine %s::%s redefined"
3976 : "Subroutine %s::%s redefined",
3977 HvNAME_get(GvSTASH((GV*)dstr)),
3978 GvENAME((GV*)dstr));
3982 cv_ckproto(cv, (GV*)dstr,
3984 ? SvPVX_const(sref) : Nullch);
3986 GvCV(dstr) = (CV*)sref;
3987 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3988 GvASSUMECV_on(dstr);
3989 PL_sub_generation++;
3991 if (!GvIMPORTED_CV(dstr)
3992 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3994 GvIMPORTED_CV_on(dstr);
3999 SAVEGENERICSV(GvIOp(dstr));
4001 dref = (SV*)GvIOp(dstr);
4002 GvIOp(dstr) = (IO*)sref;
4006 SAVEGENERICSV(GvFORM(dstr));
4008 dref = (SV*)GvFORM(dstr);
4009 GvFORM(dstr) = (CV*)sref;
4013 SAVEGENERICSV(GvSV(dstr));
4015 dref = (SV*)GvSV(dstr);
4017 if (!GvIMPORTED_SV(dstr)
4018 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4020 GvIMPORTED_SV_on(dstr);
4026 if (SvTAINTED(sstr))
4030 if (SvPVX_const(dstr)) {
4036 (void)SvOK_off(dstr);
4037 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4039 if (sflags & SVp_NOK) {
4041 /* Only set the public OK flag if the source has public OK. */
4042 if (sflags & SVf_NOK)
4043 SvFLAGS(dstr) |= SVf_NOK;
4044 SvNV_set(dstr, SvNVX(sstr));
4046 if (sflags & SVp_IOK) {
4047 (void)SvIOKp_on(dstr);
4048 if (sflags & SVf_IOK)
4049 SvFLAGS(dstr) |= SVf_IOK;
4050 if (sflags & SVf_IVisUV)
4052 SvIV_set(dstr, SvIVX(sstr));
4054 if (SvAMAGIC(sstr)) {
4058 else if (sflags & SVp_POK) {
4062 * Check to see if we can just swipe the string. If so, it's a
4063 * possible small lose on short strings, but a big win on long ones.
4064 * It might even be a win on short strings if SvPVX_const(dstr)
4065 * has to be allocated and SvPVX_const(sstr) has to be freed.
4068 /* Whichever path we take through the next code, we want this true,
4069 and doing it now facilitates the COW check. */
4070 (void)SvPOK_only(dstr);
4073 /* We're not already COW */
4074 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4075 #ifndef PERL_OLD_COPY_ON_WRITE
4076 /* or we are, but dstr isn't a suitable target. */
4077 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4082 (sflags & SVs_TEMP) && /* slated for free anyway? */
4083 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4084 (!(flags & SV_NOSTEAL)) &&
4085 /* and we're allowed to steal temps */
4086 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4087 SvLEN(sstr) && /* and really is a string */
4088 /* and won't be needed again, potentially */
4089 !(PL_op && PL_op->op_type == OP_AASSIGN))
4090 #ifdef PERL_OLD_COPY_ON_WRITE
4091 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4092 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4093 && SvTYPE(sstr) >= SVt_PVIV)
4096 /* Failed the swipe test, and it's not a shared hash key either.
4097 Have to copy the string. */
4098 STRLEN len = SvCUR(sstr);
4099 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4100 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4101 SvCUR_set(dstr, len);
4102 *SvEND(dstr) = '\0';
4104 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4106 /* Either it's a shared hash key, or it's suitable for
4107 copy-on-write or we can swipe the string. */
4109 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4113 #ifdef PERL_OLD_COPY_ON_WRITE
4115 /* I believe I should acquire a global SV mutex if
4116 it's a COW sv (not a shared hash key) to stop
4117 it going un copy-on-write.
4118 If the source SV has gone un copy on write between up there
4119 and down here, then (assert() that) it is of the correct
4120 form to make it copy on write again */
4121 if ((sflags & (SVf_FAKE | SVf_READONLY))
4122 != (SVf_FAKE | SVf_READONLY)) {
4123 SvREADONLY_on(sstr);
4125 /* Make the source SV into a loop of 1.
4126 (about to become 2) */
4127 SV_COW_NEXT_SV_SET(sstr, sstr);
4131 /* Initial code is common. */
4132 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4137 /* making another shared SV. */
4138 STRLEN cur = SvCUR(sstr);
4139 STRLEN len = SvLEN(sstr);
4140 #ifdef PERL_OLD_COPY_ON_WRITE
4142 assert (SvTYPE(dstr) >= SVt_PVIV);
4143 /* SvIsCOW_normal */
4144 /* splice us in between source and next-after-source. */
4145 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4146 SV_COW_NEXT_SV_SET(sstr, dstr);
4147 SvPV_set(dstr, SvPVX_mutable(sstr));
4151 /* SvIsCOW_shared_hash */
4152 DEBUG_C(PerlIO_printf(Perl_debug_log,
4153 "Copy on write: Sharing hash\n"));
4155 assert (SvTYPE(dstr) >= SVt_PV);
4157 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4159 SvLEN_set(dstr, len);
4160 SvCUR_set(dstr, cur);
4161 SvREADONLY_on(dstr);
4163 /* Relesase a global SV mutex. */
4166 { /* Passes the swipe test. */
4167 SvPV_set(dstr, SvPVX_mutable(sstr));
4168 SvLEN_set(dstr, SvLEN(sstr));
4169 SvCUR_set(dstr, SvCUR(sstr));
4172 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4173 SvPV_set(sstr, Nullch);
4179 if (sflags & SVf_UTF8)
4181 if (sflags & SVp_NOK) {
4183 if (sflags & SVf_NOK)
4184 SvFLAGS(dstr) |= SVf_NOK;
4185 SvNV_set(dstr, SvNVX(sstr));
4187 if (sflags & SVp_IOK) {
4188 (void)SvIOKp_on(dstr);
4189 if (sflags & SVf_IOK)
4190 SvFLAGS(dstr) |= SVf_IOK;
4191 if (sflags & SVf_IVisUV)
4193 SvIV_set(dstr, SvIVX(sstr));
4196 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4197 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4198 smg->mg_ptr, smg->mg_len);
4199 SvRMAGICAL_on(dstr);
4202 else if (sflags & SVp_IOK) {
4203 if (sflags & SVf_IOK)
4204 (void)SvIOK_only(dstr);
4206 (void)SvOK_off(dstr);
4207 (void)SvIOKp_on(dstr);
4209 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4210 if (sflags & SVf_IVisUV)
4212 SvIV_set(dstr, SvIVX(sstr));
4213 if (sflags & SVp_NOK) {
4214 if (sflags & SVf_NOK)
4215 (void)SvNOK_on(dstr);
4217 (void)SvNOKp_on(dstr);
4218 SvNV_set(dstr, SvNVX(sstr));
4221 else if (sflags & SVp_NOK) {
4222 if (sflags & SVf_NOK)
4223 (void)SvNOK_only(dstr);
4225 (void)SvOK_off(dstr);
4228 SvNV_set(dstr, SvNVX(sstr));
4231 if (dtype == SVt_PVGV) {
4232 if (ckWARN(WARN_MISC))
4233 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4236 (void)SvOK_off(dstr);
4238 if (SvTAINTED(sstr))
4243 =for apidoc sv_setsv_mg
4245 Like C<sv_setsv>, but also handles 'set' magic.
4251 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4253 sv_setsv(dstr,sstr);
4257 #ifdef PERL_OLD_COPY_ON_WRITE
4259 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4261 STRLEN cur = SvCUR(sstr);
4262 STRLEN len = SvLEN(sstr);
4263 register char *new_pv;
4266 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4274 if (SvTHINKFIRST(dstr))
4275 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4276 else if (SvPVX_const(dstr))
4277 Safefree(SvPVX_const(dstr));
4281 SvUPGRADE(dstr, SVt_PVIV);
4283 assert (SvPOK(sstr));
4284 assert (SvPOKp(sstr));
4285 assert (!SvIOK(sstr));
4286 assert (!SvIOKp(sstr));
4287 assert (!SvNOK(sstr));
4288 assert (!SvNOKp(sstr));
4290 if (SvIsCOW(sstr)) {
4292 if (SvLEN(sstr) == 0) {
4293 /* source is a COW shared hash key. */
4294 DEBUG_C(PerlIO_printf(Perl_debug_log,
4295 "Fast copy on write: Sharing hash\n"));
4296 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4299 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4301 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4302 SvUPGRADE(sstr, SVt_PVIV);
4303 SvREADONLY_on(sstr);
4305 DEBUG_C(PerlIO_printf(Perl_debug_log,
4306 "Fast copy on write: Converting sstr to COW\n"));
4307 SV_COW_NEXT_SV_SET(dstr, sstr);
4309 SV_COW_NEXT_SV_SET(sstr, dstr);
4310 new_pv = SvPVX_mutable(sstr);
4313 SvPV_set(dstr, new_pv);
4314 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4317 SvLEN_set(dstr, len);
4318 SvCUR_set(dstr, cur);
4327 =for apidoc sv_setpvn
4329 Copies a string into an SV. The C<len> parameter indicates the number of
4330 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4331 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4337 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4339 register char *dptr;
4341 SV_CHECK_THINKFIRST_COW_DROP(sv);
4347 /* len is STRLEN which is unsigned, need to copy to signed */
4350 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4352 SvUPGRADE(sv, SVt_PV);
4354 dptr = SvGROW(sv, len + 1);
4355 Move(ptr,dptr,len,char);
4358 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4363 =for apidoc sv_setpvn_mg
4365 Like C<sv_setpvn>, but also handles 'set' magic.
4371 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4373 sv_setpvn(sv,ptr,len);
4378 =for apidoc sv_setpv
4380 Copies a string into an SV. The string must be null-terminated. Does not
4381 handle 'set' magic. See C<sv_setpv_mg>.
4387 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4389 register STRLEN len;
4391 SV_CHECK_THINKFIRST_COW_DROP(sv);
4397 SvUPGRADE(sv, SVt_PV);
4399 SvGROW(sv, len + 1);
4400 Move(ptr,SvPVX(sv),len+1,char);
4402 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4407 =for apidoc sv_setpv_mg
4409 Like C<sv_setpv>, but also handles 'set' magic.
4415 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4422 =for apidoc sv_usepvn
4424 Tells an SV to use C<ptr> to find its string value. Normally the string is
4425 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4426 The C<ptr> should point to memory that was allocated by C<malloc>. The
4427 string length, C<len>, must be supplied. This function will realloc the
4428 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4429 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4430 See C<sv_usepvn_mg>.
4436 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4439 SV_CHECK_THINKFIRST_COW_DROP(sv);
4440 SvUPGRADE(sv, SVt_PV);
4445 if (SvPVX_const(sv))
4448 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4449 ptr = saferealloc (ptr, allocate);
4452 SvLEN_set(sv, allocate);
4454 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4459 =for apidoc sv_usepvn_mg
4461 Like C<sv_usepvn>, but also handles 'set' magic.
4467 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4469 sv_usepvn(sv,ptr,len);
4473 #ifdef PERL_OLD_COPY_ON_WRITE
4474 /* Need to do this *after* making the SV normal, as we need the buffer
4475 pointer to remain valid until after we've copied it. If we let go too early,
4476 another thread could invalidate it by unsharing last of the same hash key
4477 (which it can do by means other than releasing copy-on-write Svs)
4478 or by changing the other copy-on-write SVs in the loop. */
4480 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4482 if (len) { /* this SV was SvIsCOW_normal(sv) */
4483 /* we need to find the SV pointing to us. */
4484 SV *current = SV_COW_NEXT_SV(after);
4486 if (current == sv) {
4487 /* The SV we point to points back to us (there were only two of us
4489 Hence other SV is no longer copy on write either. */
4491 SvREADONLY_off(after);
4493 /* We need to follow the pointers around the loop. */
4495 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4498 /* don't loop forever if the structure is bust, and we have
4499 a pointer into a closed loop. */
4500 assert (current != after);
4501 assert (SvPVX_const(current) == pvx);
4503 /* Make the SV before us point to the SV after us. */
4504 SV_COW_NEXT_SV_SET(current, after);
4507 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4512 Perl_sv_release_IVX(pTHX_ register SV *sv)
4515 sv_force_normal_flags(sv, 0);
4521 =for apidoc sv_force_normal_flags
4523 Undo various types of fakery on an SV: if the PV is a shared string, make
4524 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4525 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4526 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4527 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4528 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4529 set to some other value.) In addition, the C<flags> parameter gets passed to
4530 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4531 with flags set to 0.
4537 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4539 #ifdef PERL_OLD_COPY_ON_WRITE
4540 if (SvREADONLY(sv)) {
4541 /* At this point I believe I should acquire a global SV mutex. */
4543 const char *pvx = SvPVX_const(sv);
4544 const STRLEN len = SvLEN(sv);
4545 const STRLEN cur = SvCUR(sv);
4546 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4548 PerlIO_printf(Perl_debug_log,
4549 "Copy on write: Force normal %ld\n",
4555 /* This SV doesn't own the buffer, so need to New() a new one: */
4556 SvPV_set(sv, (char*)0);
4558 if (flags & SV_COW_DROP_PV) {
4559 /* OK, so we don't need to copy our buffer. */
4562 SvGROW(sv, cur + 1);
4563 Move(pvx,SvPVX(sv),cur,char);
4567 sv_release_COW(sv, pvx, len, next);
4572 else if (IN_PERL_RUNTIME)
4573 Perl_croak(aTHX_ PL_no_modify);
4574 /* At this point I believe that I can drop the global SV mutex. */
4577 if (SvREADONLY(sv)) {
4579 const char *pvx = SvPVX_const(sv);
4580 const STRLEN len = SvCUR(sv);
4583 SvPV_set(sv, Nullch);
4585 SvGROW(sv, len + 1);
4586 Move(pvx,SvPVX_const(sv),len,char);
4588 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4590 else if (IN_PERL_RUNTIME)
4591 Perl_croak(aTHX_ PL_no_modify);
4595 sv_unref_flags(sv, flags);
4596 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4601 =for apidoc sv_force_normal
4603 Undo various types of fakery on an SV: if the PV is a shared string, make
4604 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4605 an xpvmg. See also C<sv_force_normal_flags>.
4611 Perl_sv_force_normal(pTHX_ register SV *sv)
4613 sv_force_normal_flags(sv, 0);
4619 Efficient removal of characters from the beginning of the string buffer.
4620 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4621 the string buffer. The C<ptr> becomes the first character of the adjusted
4622 string. Uses the "OOK hack".
4623 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4624 refer to the same chunk of data.
4630 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4632 register STRLEN delta;
4633 if (!ptr || !SvPOKp(sv))
4635 delta = ptr - SvPVX_const(sv);
4636 SV_CHECK_THINKFIRST(sv);
4637 if (SvTYPE(sv) < SVt_PVIV)
4638 sv_upgrade(sv,SVt_PVIV);
4641 if (!SvLEN(sv)) { /* make copy of shared string */
4642 const char *pvx = SvPVX_const(sv);
4643 const STRLEN len = SvCUR(sv);
4644 SvGROW(sv, len + 1);
4645 Move(pvx,SvPVX_const(sv),len,char);
4649 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4650 and we do that anyway inside the SvNIOK_off
4652 SvFLAGS(sv) |= SVf_OOK;
4655 SvLEN_set(sv, SvLEN(sv) - delta);
4656 SvCUR_set(sv, SvCUR(sv) - delta);
4657 SvPV_set(sv, SvPVX(sv) + delta);
4658 SvIV_set(sv, SvIVX(sv) + delta);
4661 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4662 * this function provided for binary compatibility only
4666 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4668 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4672 =for apidoc sv_catpvn
4674 Concatenates the string onto the end of the string which is in the SV. The
4675 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4676 status set, then the bytes appended should be valid UTF-8.
4677 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4679 =for apidoc sv_catpvn_flags
4681 Concatenates the string onto the end of the string which is in the SV. The
4682 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4683 status set, then the bytes appended should be valid UTF-8.
4684 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4685 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4686 in terms of this function.
4692 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4695 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4697 SvGROW(dsv, dlen + slen + 1);
4699 sstr = SvPVX_const(dsv);
4700 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4701 SvCUR_set(dsv, SvCUR(dsv) + slen);
4703 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4708 =for apidoc sv_catpvn_mg
4710 Like C<sv_catpvn>, but also handles 'set' magic.
4716 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4718 sv_catpvn(sv,ptr,len);
4722 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4723 * this function provided for binary compatibility only
4727 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4729 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4733 =for apidoc sv_catsv
4735 Concatenates the string from SV C<ssv> onto the end of the string in
4736 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4737 not 'set' magic. See C<sv_catsv_mg>.
4739 =for apidoc sv_catsv_flags
4741 Concatenates the string from SV C<ssv> onto the end of the string in
4742 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4743 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4744 and C<sv_catsv_nomg> are implemented in terms of this function.
4749 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4755 if ((spv = SvPV_const(ssv, slen))) {
4756 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4757 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4758 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4759 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4760 dsv->sv_flags doesn't have that bit set.
4761 Andy Dougherty 12 Oct 2001
4763 const I32 sutf8 = DO_UTF8(ssv);
4766 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4768 dutf8 = DO_UTF8(dsv);
4770 if (dutf8 != sutf8) {
4772 /* Not modifying source SV, so taking a temporary copy. */
4773 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4775 sv_utf8_upgrade(csv);
4776 spv = SvPV_const(csv, slen);
4779 sv_utf8_upgrade_nomg(dsv);
4781 sv_catpvn_nomg(dsv, spv, slen);
4786 =for apidoc sv_catsv_mg
4788 Like C<sv_catsv>, but also handles 'set' magic.
4794 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4801 =for apidoc sv_catpv
4803 Concatenates the string onto the end of the string which is in the SV.
4804 If the SV has the UTF-8 status set, then the bytes appended should be
4805 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4810 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4812 register STRLEN len;
4818 junk = SvPV_force(sv, tlen);
4820 SvGROW(sv, tlen + len + 1);
4822 ptr = SvPVX_const(sv);
4823 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4824 SvCUR_set(sv, SvCUR(sv) + len);
4825 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4830 =for apidoc sv_catpv_mg
4832 Like C<sv_catpv>, but also handles 'set' magic.
4838 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4847 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4848 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4855 Perl_newSV(pTHX_ STRLEN len)
4861 sv_upgrade(sv, SVt_PV);
4862 SvGROW(sv, len + 1);
4867 =for apidoc sv_magicext
4869 Adds magic to an SV, upgrading it if necessary. Applies the
4870 supplied vtable and returns a pointer to the magic added.
4872 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4873 In particular, you can add magic to SvREADONLY SVs, and add more than
4874 one instance of the same 'how'.
4876 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4877 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4878 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4879 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4881 (This is now used as a subroutine by C<sv_magic>.)
4886 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4887 const char* name, I32 namlen)
4891 if (SvTYPE(sv) < SVt_PVMG) {
4892 SvUPGRADE(sv, SVt_PVMG);
4894 Newz(702,mg, 1, MAGIC);
4895 mg->mg_moremagic = SvMAGIC(sv);
4896 SvMAGIC_set(sv, mg);
4898 /* Sometimes a magic contains a reference loop, where the sv and
4899 object refer to each other. To prevent a reference loop that
4900 would prevent such objects being freed, we look for such loops
4901 and if we find one we avoid incrementing the object refcount.
4903 Note we cannot do this to avoid self-tie loops as intervening RV must
4904 have its REFCNT incremented to keep it in existence.
4907 if (!obj || obj == sv ||
4908 how == PERL_MAGIC_arylen ||
4909 how == PERL_MAGIC_qr ||
4910 how == PERL_MAGIC_symtab ||
4911 (SvTYPE(obj) == SVt_PVGV &&
4912 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4913 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4914 GvFORM(obj) == (CV*)sv)))
4919 mg->mg_obj = SvREFCNT_inc(obj);
4920 mg->mg_flags |= MGf_REFCOUNTED;
4923 /* Normal self-ties simply pass a null object, and instead of
4924 using mg_obj directly, use the SvTIED_obj macro to produce a
4925 new RV as needed. For glob "self-ties", we are tieing the PVIO
4926 with an RV obj pointing to the glob containing the PVIO. In
4927 this case, to avoid a reference loop, we need to weaken the
4931 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4932 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4938 mg->mg_len = namlen;
4941 mg->mg_ptr = savepvn(name, namlen);
4942 else if (namlen == HEf_SVKEY)
4943 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4945 mg->mg_ptr = (char *) name;
4947 mg->mg_virtual = vtable;
4951 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4956 =for apidoc sv_magic
4958 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4959 then adds a new magic item of type C<how> to the head of the magic list.
4961 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4962 handling of the C<name> and C<namlen> arguments.
4964 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4965 to add more than one instance of the same 'how'.
4971 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4973 const MGVTBL *vtable = 0;
4976 #ifdef PERL_OLD_COPY_ON_WRITE
4978 sv_force_normal_flags(sv, 0);
4980 if (SvREADONLY(sv)) {
4982 && how != PERL_MAGIC_regex_global
4983 && how != PERL_MAGIC_bm
4984 && how != PERL_MAGIC_fm
4985 && how != PERL_MAGIC_sv
4986 && how != PERL_MAGIC_backref
4989 Perl_croak(aTHX_ PL_no_modify);
4992 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4993 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4994 /* sv_magic() refuses to add a magic of the same 'how' as an
4997 if (how == PERL_MAGIC_taint)
5005 vtable = &PL_vtbl_sv;
5007 case PERL_MAGIC_overload:
5008 vtable = &PL_vtbl_amagic;
5010 case PERL_MAGIC_overload_elem:
5011 vtable = &PL_vtbl_amagicelem;
5013 case PERL_MAGIC_overload_table:
5014 vtable = &PL_vtbl_ovrld;
5017 vtable = &PL_vtbl_bm;
5019 case PERL_MAGIC_regdata:
5020 vtable = &PL_vtbl_regdata;
5022 case PERL_MAGIC_regdatum:
5023 vtable = &PL_vtbl_regdatum;
5025 case PERL_MAGIC_env:
5026 vtable = &PL_vtbl_env;
5029 vtable = &PL_vtbl_fm;
5031 case PERL_MAGIC_envelem:
5032 vtable = &PL_vtbl_envelem;
5034 case PERL_MAGIC_regex_global:
5035 vtable = &PL_vtbl_mglob;
5037 case PERL_MAGIC_isa:
5038 vtable = &PL_vtbl_isa;
5040 case PERL_MAGIC_isaelem:
5041 vtable = &PL_vtbl_isaelem;
5043 case PERL_MAGIC_nkeys:
5044 vtable = &PL_vtbl_nkeys;
5046 case PERL_MAGIC_dbfile:
5049 case PERL_MAGIC_dbline:
5050 vtable = &PL_vtbl_dbline;
5052 #ifdef USE_LOCALE_COLLATE
5053 case PERL_MAGIC_collxfrm:
5054 vtable = &PL_vtbl_collxfrm;
5056 #endif /* USE_LOCALE_COLLATE */
5057 case PERL_MAGIC_tied:
5058 vtable = &PL_vtbl_pack;
5060 case PERL_MAGIC_tiedelem:
5061 case PERL_MAGIC_tiedscalar:
5062 vtable = &PL_vtbl_packelem;
5065 vtable = &PL_vtbl_regexp;
5067 case PERL_MAGIC_sig:
5068 vtable = &PL_vtbl_sig;
5070 case PERL_MAGIC_sigelem:
5071 vtable = &PL_vtbl_sigelem;
5073 case PERL_MAGIC_taint:
5074 vtable = &PL_vtbl_taint;
5076 case PERL_MAGIC_uvar:
5077 vtable = &PL_vtbl_uvar;
5079 case PERL_MAGIC_vec:
5080 vtable = &PL_vtbl_vec;
5082 case PERL_MAGIC_arylen_p:
5083 case PERL_MAGIC_rhash:
5084 case PERL_MAGIC_symtab:
5085 case PERL_MAGIC_vstring:
5088 case PERL_MAGIC_utf8:
5089 vtable = &PL_vtbl_utf8;
5091 case PERL_MAGIC_substr:
5092 vtable = &PL_vtbl_substr;
5094 case PERL_MAGIC_defelem:
5095 vtable = &PL_vtbl_defelem;
5097 case PERL_MAGIC_glob:
5098 vtable = &PL_vtbl_glob;
5100 case PERL_MAGIC_arylen:
5101 vtable = &PL_vtbl_arylen;
5103 case PERL_MAGIC_pos:
5104 vtable = &PL_vtbl_pos;
5106 case PERL_MAGIC_backref:
5107 vtable = &PL_vtbl_backref;
5109 case PERL_MAGIC_ext:
5110 /* Reserved for use by extensions not perl internals. */
5111 /* Useful for attaching extension internal data to perl vars. */
5112 /* Note that multiple extensions may clash if magical scalars */
5113 /* etc holding private data from one are passed to another. */
5116 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5119 /* Rest of work is done else where */
5120 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5123 case PERL_MAGIC_taint:
5126 case PERL_MAGIC_ext:
5127 case PERL_MAGIC_dbfile:
5134 =for apidoc sv_unmagic
5136 Removes all magic of type C<type> from an SV.
5142 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5146 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5149 for (mg = *mgp; mg; mg = *mgp) {
5150 if (mg->mg_type == type) {
5151 const MGVTBL* const vtbl = mg->mg_virtual;
5152 *mgp = mg->mg_moremagic;
5153 if (vtbl && vtbl->svt_free)
5154 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5155 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5157 Safefree(mg->mg_ptr);
5158 else if (mg->mg_len == HEf_SVKEY)
5159 SvREFCNT_dec((SV*)mg->mg_ptr);
5160 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5161 Safefree(mg->mg_ptr);
5163 if (mg->mg_flags & MGf_REFCOUNTED)
5164 SvREFCNT_dec(mg->mg_obj);
5168 mgp = &mg->mg_moremagic;
5172 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5179 =for apidoc sv_rvweaken
5181 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5182 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5183 push a back-reference to this RV onto the array of backreferences
5184 associated with that magic.
5190 Perl_sv_rvweaken(pTHX_ SV *sv)
5193 if (!SvOK(sv)) /* let undefs pass */
5196 Perl_croak(aTHX_ "Can't weaken a nonreference");
5197 else if (SvWEAKREF(sv)) {
5198 if (ckWARN(WARN_MISC))
5199 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5203 sv_add_backref(tsv, sv);
5209 /* Give tsv backref magic if it hasn't already got it, then push a
5210 * back-reference to sv onto the array associated with the backref magic.
5214 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5218 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5219 av = (AV*)mg->mg_obj;
5222 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5223 /* av now has a refcnt of 2, which avoids it getting freed
5224 * before us during global cleanup. The extra ref is removed
5225 * by magic_killbackrefs() when tsv is being freed */
5227 if (AvFILLp(av) >= AvMAX(av)) {
5228 av_extend(av, AvFILLp(av)+1);
5230 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5233 /* delete a back-reference to ourselves from the backref magic associated
5234 * with the SV we point to.
5238 S_sv_del_backref(pTHX_ SV *sv)
5243 SV * const tsv = SvRV(sv);
5245 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5246 Perl_croak(aTHX_ "panic: del_backref");
5247 av = (AV *)mg->mg_obj;
5249 /* We shouldn't be in here more than once, but for paranoia reasons lets
5251 for (i = AvFILLp(av); i >= 0; i--) {
5253 const SSize_t fill = AvFILLp(av);
5255 /* We weren't the last entry.
5256 An unordered list has this property that you can take the
5257 last element off the end to fill the hole, and it's still
5258 an unordered list :-)
5263 AvFILLp(av) = fill - 1;
5269 =for apidoc sv_insert
5271 Inserts a string at the specified offset/length within the SV. Similar to
5272 the Perl substr() function.
5278 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5282 register char *midend;
5283 register char *bigend;
5289 Perl_croak(aTHX_ "Can't modify non-existent substring");
5290 SvPV_force(bigstr, curlen);
5291 (void)SvPOK_only_UTF8(bigstr);
5292 if (offset + len > curlen) {
5293 SvGROW(bigstr, offset+len+1);
5294 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5295 SvCUR_set(bigstr, offset+len);
5299 i = littlelen - len;
5300 if (i > 0) { /* string might grow */
5301 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5302 mid = big + offset + len;
5303 midend = bigend = big + SvCUR(bigstr);
5306 while (midend > mid) /* shove everything down */
5307 *--bigend = *--midend;
5308 Move(little,big+offset,littlelen,char);
5309 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5314 Move(little,SvPVX(bigstr)+offset,len,char);
5319 big = SvPVX(bigstr);
5322 bigend = big + SvCUR(bigstr);
5324 if (midend > bigend)
5325 Perl_croak(aTHX_ "panic: sv_insert");
5327 if (mid - big > bigend - midend) { /* faster to shorten from end */
5329 Move(little, mid, littlelen,char);
5332 i = bigend - midend;
5334 Move(midend, mid, i,char);
5338 SvCUR_set(bigstr, mid - big);
5340 else if ((i = mid - big)) { /* faster from front */
5341 midend -= littlelen;
5343 sv_chop(bigstr,midend-i);
5348 Move(little, mid, littlelen,char);
5350 else if (littlelen) {
5351 midend -= littlelen;
5352 sv_chop(bigstr,midend);
5353 Move(little,midend,littlelen,char);
5356 sv_chop(bigstr,midend);
5362 =for apidoc sv_replace
5364 Make the first argument a copy of the second, then delete the original.
5365 The target SV physically takes over ownership of the body of the source SV
5366 and inherits its flags; however, the target keeps any magic it owns,
5367 and any magic in the source is discarded.
5368 Note that this is a rather specialist SV copying operation; most of the
5369 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5375 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5377 const U32 refcnt = SvREFCNT(sv);
5378 SV_CHECK_THINKFIRST_COW_DROP(sv);
5379 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5380 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5381 if (SvMAGICAL(sv)) {
5385 sv_upgrade(nsv, SVt_PVMG);
5386 SvMAGIC_set(nsv, SvMAGIC(sv));
5387 SvFLAGS(nsv) |= SvMAGICAL(sv);
5389 SvMAGIC_set(sv, NULL);
5393 assert(!SvREFCNT(sv));
5394 #ifdef DEBUG_LEAKING_SCALARS
5395 sv->sv_flags = nsv->sv_flags;
5396 sv->sv_any = nsv->sv_any;
5397 sv->sv_refcnt = nsv->sv_refcnt;
5398 sv->sv_u = nsv->sv_u;
5400 StructCopy(nsv,sv,SV);
5402 /* Currently could join these into one piece of pointer arithmetic, but
5403 it would be unclear. */
5404 if(SvTYPE(sv) == SVt_IV)
5406 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5407 else if (SvTYPE(sv) == SVt_RV) {
5408 SvANY(sv) = &sv->sv_u.svu_rv;
5412 #ifdef PERL_OLD_COPY_ON_WRITE
5413 if (SvIsCOW_normal(nsv)) {
5414 /* We need to follow the pointers around the loop to make the
5415 previous SV point to sv, rather than nsv. */
5418 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5421 assert(SvPVX_const(current) == SvPVX_const(nsv));
5423 /* Make the SV before us point to the SV after us. */
5425 PerlIO_printf(Perl_debug_log, "previous is\n");
5427 PerlIO_printf(Perl_debug_log,
5428 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5429 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5431 SV_COW_NEXT_SV_SET(current, sv);
5434 SvREFCNT(sv) = refcnt;
5435 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5441 =for apidoc sv_clear
5443 Clear an SV: call any destructors, free up any memory used by the body,
5444 and free the body itself. The SV's head is I<not> freed, although
5445 its type is set to all 1's so that it won't inadvertently be assumed
5446 to be live during global destruction etc.
5447 This function should only be called when REFCNT is zero. Most of the time
5448 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5455 Perl_sv_clear(pTHX_ register SV *sv)
5460 assert(SvREFCNT(sv) == 0);
5463 if (PL_defstash) { /* Still have a symbol table? */
5467 stash = SvSTASH(sv);
5468 destructor = StashHANDLER(stash,DESTROY);
5470 SV* const tmpref = newRV(sv);
5471 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5473 PUSHSTACKi(PERLSI_DESTROY);
5478 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5484 if(SvREFCNT(tmpref) < 2) {
5485 /* tmpref is not kept alive! */
5487 SvRV_set(tmpref, NULL);
5490 SvREFCNT_dec(tmpref);
5492 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5496 if (PL_in_clean_objs)
5497 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5499 /* DESTROY gave object new lease on life */
5505 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5506 SvOBJECT_off(sv); /* Curse the object. */
5507 if (SvTYPE(sv) != SVt_PVIO)
5508 --PL_sv_objcount; /* XXX Might want something more general */
5511 if (SvTYPE(sv) >= SVt_PVMG) {
5514 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5515 SvREFCNT_dec(SvSTASH(sv));
5518 switch (SvTYPE(sv)) {
5521 IoIFP(sv) != PerlIO_stdin() &&
5522 IoIFP(sv) != PerlIO_stdout() &&
5523 IoIFP(sv) != PerlIO_stderr())
5525 io_close((IO*)sv, FALSE);
5527 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5528 PerlDir_close(IoDIRP(sv));
5529 IoDIRP(sv) = (DIR*)NULL;
5530 Safefree(IoTOP_NAME(sv));
5531 Safefree(IoFMT_NAME(sv));
5532 Safefree(IoBOTTOM_NAME(sv));
5547 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5548 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5549 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5550 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5552 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5553 SvREFCNT_dec(LvTARG(sv));
5557 Safefree(GvNAME(sv));
5558 /* cannot decrease stash refcount yet, as we might recursively delete
5559 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5560 of stash until current sv is completely gone.
5561 -- JohnPC, 27 Mar 1998 */
5562 stash = GvSTASH(sv);
5568 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5570 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5571 /* Don't even bother with turning off the OOK flag. */
5580 SvREFCNT_dec(SvRV(sv));
5582 #ifdef PERL_OLD_COPY_ON_WRITE
5583 else if (SvPVX_const(sv)) {
5585 /* I believe I need to grab the global SV mutex here and
5586 then recheck the COW status. */
5588 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5591 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5592 SV_COW_NEXT_SV(sv));
5593 /* And drop it here. */
5595 } else if (SvLEN(sv)) {
5596 Safefree(SvPVX_const(sv));
5600 else if (SvPVX_const(sv) && SvLEN(sv))
5601 Safefree(SvPVX_mutable(sv));
5602 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5603 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5616 switch (SvTYPE(sv)) {
5630 del_XPVIV(SvANY(sv));
5633 del_XPVNV(SvANY(sv));
5636 del_XPVMG(SvANY(sv));
5639 del_XPVLV(SvANY(sv));
5642 del_XPVAV(SvANY(sv));
5645 del_XPVHV(SvANY(sv));
5648 del_XPVCV(SvANY(sv));
5651 del_XPVGV(SvANY(sv));
5652 /* code duplication for increased performance. */
5653 SvFLAGS(sv) &= SVf_BREAK;
5654 SvFLAGS(sv) |= SVTYPEMASK;
5655 /* decrease refcount of the stash that owns this GV, if any */
5657 SvREFCNT_dec(stash);
5658 return; /* not break, SvFLAGS reset already happened */
5660 del_XPVBM(SvANY(sv));
5663 del_XPVFM(SvANY(sv));
5666 del_XPVIO(SvANY(sv));
5669 SvFLAGS(sv) &= SVf_BREAK;
5670 SvFLAGS(sv) |= SVTYPEMASK;
5674 =for apidoc sv_newref
5676 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5683 Perl_sv_newref(pTHX_ SV *sv)
5693 Decrement an SV's reference count, and if it drops to zero, call
5694 C<sv_clear> to invoke destructors and free up any memory used by
5695 the body; finally, deallocate the SV's head itself.
5696 Normally called via a wrapper macro C<SvREFCNT_dec>.
5702 Perl_sv_free(pTHX_ SV *sv)
5707 if (SvREFCNT(sv) == 0) {
5708 if (SvFLAGS(sv) & SVf_BREAK)
5709 /* this SV's refcnt has been artificially decremented to
5710 * trigger cleanup */
5712 if (PL_in_clean_all) /* All is fair */
5714 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5715 /* make sure SvREFCNT(sv)==0 happens very seldom */
5716 SvREFCNT(sv) = (~(U32)0)/2;
5719 if (ckWARN_d(WARN_INTERNAL))
5720 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5721 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5722 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5725 if (--(SvREFCNT(sv)) > 0)
5727 Perl_sv_free2(aTHX_ sv);
5731 Perl_sv_free2(pTHX_ SV *sv)
5736 if (ckWARN_d(WARN_DEBUGGING))
5737 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5738 "Attempt to free temp prematurely: SV 0x%"UVxf
5739 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5743 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5744 /* make sure SvREFCNT(sv)==0 happens very seldom */
5745 SvREFCNT(sv) = (~(U32)0)/2;
5756 Returns the length of the string in the SV. Handles magic and type
5757 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5763 Perl_sv_len(pTHX_ register SV *sv)
5771 len = mg_length(sv);
5773 (void)SvPV_const(sv, len);
5778 =for apidoc sv_len_utf8
5780 Returns the number of characters in the string in an SV, counting wide
5781 UTF-8 bytes as a single character. Handles magic and type coercion.
5787 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5788 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5789 * (Note that the mg_len is not the length of the mg_ptr field.)
5794 Perl_sv_len_utf8(pTHX_ register SV *sv)
5800 return mg_length(sv);
5804 const U8 *s = (U8*)SvPV_const(sv, len);
5805 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5807 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5809 #ifdef PERL_UTF8_CACHE_ASSERT
5810 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5814 ulen = Perl_utf8_length(aTHX_ s, s + len);
5815 if (!mg && !SvREADONLY(sv)) {
5816 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5817 mg = mg_find(sv, PERL_MAGIC_utf8);
5827 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5828 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5829 * between UTF-8 and byte offsets. There are two (substr offset and substr
5830 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5831 * and byte offset) cache positions.
5833 * The mg_len field is used by sv_len_utf8(), see its comments.
5834 * Note that the mg_len is not the length of the mg_ptr field.
5838 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5839 I32 offsetp, const U8 *s, const U8 *start)
5843 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5845 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5849 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5851 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5852 (*mgp)->mg_ptr = (char *) *cachep;
5856 (*cachep)[i] = offsetp;
5857 (*cachep)[i+1] = s - start;
5865 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5866 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5867 * between UTF-8 and byte offsets. See also the comments of
5868 * S_utf8_mg_pos_init().
5872 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, const U8 **sp, const U8 *start, const U8 *send)
5876 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5878 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5879 if (*mgp && (*mgp)->mg_ptr) {
5880 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5881 ASSERT_UTF8_CACHE(*cachep);
5882 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5884 else { /* We will skip to the right spot. */
5889 /* The assumption is that going backward is half
5890 * the speed of going forward (that's where the
5891 * 2 * backw in the below comes from). (The real
5892 * figure of course depends on the UTF-8 data.) */
5894 if ((*cachep)[i] > (STRLEN)uoff) {
5896 backw = (*cachep)[i] - (STRLEN)uoff;
5898 if (forw < 2 * backw)
5901 p = start + (*cachep)[i+1];
5903 /* Try this only for the substr offset (i == 0),
5904 * not for the substr length (i == 2). */
5905 else if (i == 0) { /* (*cachep)[i] < uoff */
5906 const STRLEN ulen = sv_len_utf8(sv);
5908 if ((STRLEN)uoff < ulen) {
5909 forw = (STRLEN)uoff - (*cachep)[i];
5910 backw = ulen - (STRLEN)uoff;
5912 if (forw < 2 * backw)
5913 p = start + (*cachep)[i+1];
5918 /* If the string is not long enough for uoff,
5919 * we could extend it, but not at this low a level. */
5923 if (forw < 2 * backw) {
5930 while (UTF8_IS_CONTINUATION(*p))
5935 /* Update the cache. */
5936 (*cachep)[i] = (STRLEN)uoff;
5937 (*cachep)[i+1] = p - start;
5939 /* Drop the stale "length" cache */
5948 if (found) { /* Setup the return values. */
5949 *offsetp = (*cachep)[i+1];
5950 *sp = start + *offsetp;
5953 *offsetp = send - start;
5955 else if (*sp < start) {
5961 #ifdef PERL_UTF8_CACHE_ASSERT
5966 while (n-- && s < send)
5970 assert(*offsetp == s - start);
5971 assert((*cachep)[0] == (STRLEN)uoff);
5972 assert((*cachep)[1] == *offsetp);
5974 ASSERT_UTF8_CACHE(*cachep);
5983 =for apidoc sv_pos_u2b
5985 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5986 the start of the string, to a count of the equivalent number of bytes; if
5987 lenp is non-zero, it does the same to lenp, but this time starting from
5988 the offset, rather than from the start of the string. Handles magic and
5995 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5996 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5997 * byte offsets. See also the comments of S_utf8_mg_pos().
6002 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6010 start = (U8*)SvPV_const(sv, len);
6014 const U8 *s = start;
6015 I32 uoffset = *offsetp;
6016 const U8 *send = s + len;
6020 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6022 if (!found && uoffset > 0) {
6023 while (s < send && uoffset--)
6027 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6029 *offsetp = s - start;
6034 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6038 if (!found && *lenp > 0) {
6041 while (s < send && ulen--)
6045 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6049 ASSERT_UTF8_CACHE(cache);
6061 =for apidoc sv_pos_b2u
6063 Converts the value pointed to by offsetp from a count of bytes from the
6064 start of the string, to a count of the equivalent number of UTF-8 chars.
6065 Handles magic and type coercion.
6071 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6072 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6073 * byte offsets. See also the comments of S_utf8_mg_pos().
6078 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6086 s = (const U8*)SvPV_const(sv, len);
6087 if ((I32)len < *offsetp)
6088 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6090 const U8* send = s + *offsetp;
6092 STRLEN *cache = NULL;
6096 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6097 mg = mg_find(sv, PERL_MAGIC_utf8);
6098 if (mg && mg->mg_ptr) {
6099 cache = (STRLEN *) mg->mg_ptr;
6100 if (cache[1] == (STRLEN)*offsetp) {
6101 /* An exact match. */
6102 *offsetp = cache[0];
6106 else if (cache[1] < (STRLEN)*offsetp) {
6107 /* We already know part of the way. */
6110 /* Let the below loop do the rest. */
6112 else { /* cache[1] > *offsetp */
6113 /* We already know all of the way, now we may
6114 * be able to walk back. The same assumption
6115 * is made as in S_utf8_mg_pos(), namely that
6116 * walking backward is twice slower than
6117 * walking forward. */
6118 STRLEN forw = *offsetp;
6119 STRLEN backw = cache[1] - *offsetp;
6121 if (!(forw < 2 * backw)) {
6122 const U8 *p = s + cache[1];
6129 while (UTF8_IS_CONTINUATION(*p)) {
6137 *offsetp = cache[0];
6139 /* Drop the stale "length" cache */
6147 ASSERT_UTF8_CACHE(cache);
6153 /* Call utf8n_to_uvchr() to validate the sequence
6154 * (unless a simple non-UTF character) */
6155 if (!UTF8_IS_INVARIANT(*s))
6156 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6165 if (!SvREADONLY(sv)) {
6167 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6168 mg = mg_find(sv, PERL_MAGIC_utf8);
6173 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6174 mg->mg_ptr = (char *) cache;
6179 cache[1] = *offsetp;
6180 /* Drop the stale "length" cache */
6193 Returns a boolean indicating whether the strings in the two SVs are
6194 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6195 coerce its args to strings if necessary.
6201 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6209 SV* svrecode = Nullsv;
6216 pv1 = SvPV_const(sv1, cur1);
6223 pv2 = SvPV_const(sv2, cur2);
6225 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6226 /* Differing utf8ness.
6227 * Do not UTF8size the comparands as a side-effect. */
6230 svrecode = newSVpvn(pv2, cur2);
6231 sv_recode_to_utf8(svrecode, PL_encoding);
6232 pv2 = SvPV_const(svrecode, cur2);
6235 svrecode = newSVpvn(pv1, cur1);
6236 sv_recode_to_utf8(svrecode, PL_encoding);
6237 pv1 = SvPV_const(svrecode, cur1);
6239 /* Now both are in UTF-8. */
6241 SvREFCNT_dec(svrecode);
6246 bool is_utf8 = TRUE;
6249 /* sv1 is the UTF-8 one,
6250 * if is equal it must be downgrade-able */
6251 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6257 /* sv2 is the UTF-8 one,
6258 * if is equal it must be downgrade-able */
6259 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6265 /* Downgrade not possible - cannot be eq */
6273 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6276 SvREFCNT_dec(svrecode);
6287 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6288 string in C<sv1> is less than, equal to, or greater than the string in
6289 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6290 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6296 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6299 const char *pv1, *pv2;
6302 SV *svrecode = Nullsv;
6309 pv1 = SvPV_const(sv1, cur1);
6316 pv2 = SvPV_const(sv2, cur2);
6318 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6319 /* Differing utf8ness.
6320 * Do not UTF8size the comparands as a side-effect. */
6323 svrecode = newSVpvn(pv2, cur2);
6324 sv_recode_to_utf8(svrecode, PL_encoding);
6325 pv2 = SvPV_const(svrecode, cur2);
6328 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6333 svrecode = newSVpvn(pv1, cur1);
6334 sv_recode_to_utf8(svrecode, PL_encoding);
6335 pv1 = SvPV_const(svrecode, cur1);
6338 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6344 cmp = cur2 ? -1 : 0;
6348 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6351 cmp = retval < 0 ? -1 : 1;
6352 } else if (cur1 == cur2) {
6355 cmp = cur1 < cur2 ? -1 : 1;
6360 SvREFCNT_dec(svrecode);
6369 =for apidoc sv_cmp_locale
6371 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6372 'use bytes' aware, handles get magic, and will coerce its args to strings
6373 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6379 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6381 #ifdef USE_LOCALE_COLLATE
6387 if (PL_collation_standard)
6391 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6393 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6395 if (!pv1 || !len1) {
6406 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6409 return retval < 0 ? -1 : 1;
6412 * When the result of collation is equality, that doesn't mean
6413 * that there are no differences -- some locales exclude some
6414 * characters from consideration. So to avoid false equalities,
6415 * we use the raw string as a tiebreaker.
6421 #endif /* USE_LOCALE_COLLATE */
6423 return sv_cmp(sv1, sv2);
6427 #ifdef USE_LOCALE_COLLATE
6430 =for apidoc sv_collxfrm
6432 Add Collate Transform magic to an SV if it doesn't already have it.
6434 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6435 scalar data of the variable, but transformed to such a format that a normal
6436 memory comparison can be used to compare the data according to the locale
6443 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6447 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6448 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6454 Safefree(mg->mg_ptr);
6455 s = SvPV_const(sv, len);
6456 if ((xf = mem_collxfrm(s, len, &xlen))) {
6457 if (SvREADONLY(sv)) {
6460 return xf + sizeof(PL_collation_ix);
6463 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6464 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6477 if (mg && mg->mg_ptr) {
6479 return mg->mg_ptr + sizeof(PL_collation_ix);
6487 #endif /* USE_LOCALE_COLLATE */
6492 Get a line from the filehandle and store it into the SV, optionally
6493 appending to the currently-stored string.
6499 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6503 register STDCHAR rslast;
6504 register STDCHAR *bp;
6510 if (SvTHINKFIRST(sv))
6511 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6512 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6514 However, perlbench says it's slower, because the existing swipe code
6515 is faster than copy on write.
6516 Swings and roundabouts. */
6517 SvUPGRADE(sv, SVt_PV);
6522 if (PerlIO_isutf8(fp)) {
6524 sv_utf8_upgrade_nomg(sv);
6525 sv_pos_u2b(sv,&append,0);
6527 } else if (SvUTF8(sv)) {
6528 SV * const tsv = NEWSV(0,0);
6529 sv_gets(tsv, fp, 0);
6530 sv_utf8_upgrade_nomg(tsv);
6531 SvCUR_set(sv,append);
6534 goto return_string_or_null;
6539 if (PerlIO_isutf8(fp))
6542 if (IN_PERL_COMPILETIME) {
6543 /* we always read code in line mode */
6547 else if (RsSNARF(PL_rs)) {
6548 /* If it is a regular disk file use size from stat() as estimate
6549 of amount we are going to read - may result in malloc-ing
6550 more memory than we realy need if layers bellow reduce
6551 size we read (e.g. CRLF or a gzip layer)
6554 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6555 const Off_t offset = PerlIO_tell(fp);
6556 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6557 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6563 else if (RsRECORD(PL_rs)) {
6567 /* Grab the size of the record we're getting */
6568 recsize = SvIV(SvRV(PL_rs));
6569 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6572 /* VMS wants read instead of fread, because fread doesn't respect */
6573 /* RMS record boundaries. This is not necessarily a good thing to be */
6574 /* doing, but we've got no other real choice - except avoid stdio
6575 as implementation - perhaps write a :vms layer ?
6577 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6579 bytesread = PerlIO_read(fp, buffer, recsize);
6583 SvCUR_set(sv, bytesread += append);
6584 buffer[bytesread] = '\0';
6585 goto return_string_or_null;
6587 else if (RsPARA(PL_rs)) {
6593 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6594 if (PerlIO_isutf8(fp)) {
6595 rsptr = SvPVutf8(PL_rs, rslen);
6598 if (SvUTF8(PL_rs)) {
6599 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6600 Perl_croak(aTHX_ "Wide character in $/");
6603 rsptr = SvPV_const(PL_rs, rslen);
6607 rslast = rslen ? rsptr[rslen - 1] : '\0';
6609 if (rspara) { /* have to do this both before and after */
6610 do { /* to make sure file boundaries work right */
6613 i = PerlIO_getc(fp);
6617 PerlIO_ungetc(fp,i);
6623 /* See if we know enough about I/O mechanism to cheat it ! */
6625 /* This used to be #ifdef test - it is made run-time test for ease
6626 of abstracting out stdio interface. One call should be cheap
6627 enough here - and may even be a macro allowing compile
6631 if (PerlIO_fast_gets(fp)) {
6634 * We're going to steal some values from the stdio struct
6635 * and put EVERYTHING in the innermost loop into registers.
6637 register STDCHAR *ptr;
6641 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6642 /* An ungetc()d char is handled separately from the regular
6643 * buffer, so we getc() it back out and stuff it in the buffer.
6645 i = PerlIO_getc(fp);
6646 if (i == EOF) return 0;
6647 *(--((*fp)->_ptr)) = (unsigned char) i;
6651 /* Here is some breathtakingly efficient cheating */
6653 cnt = PerlIO_get_cnt(fp); /* get count into register */
6654 /* make sure we have the room */
6655 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6656 /* Not room for all of it
6657 if we are looking for a separator and room for some
6659 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6660 /* just process what we have room for */
6661 shortbuffered = cnt - SvLEN(sv) + append + 1;
6662 cnt -= shortbuffered;
6666 /* remember that cnt can be negative */
6667 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6672 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6673 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6674 DEBUG_P(PerlIO_printf(Perl_debug_log,
6675 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6676 DEBUG_P(PerlIO_printf(Perl_debug_log,
6677 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6678 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6679 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6684 while (cnt > 0) { /* this | eat */
6686 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6687 goto thats_all_folks; /* screams | sed :-) */
6691 Copy(ptr, bp, cnt, char); /* this | eat */
6692 bp += cnt; /* screams | dust */
6693 ptr += cnt; /* louder | sed :-) */
6698 if (shortbuffered) { /* oh well, must extend */
6699 cnt = shortbuffered;
6701 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6703 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6704 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6708 DEBUG_P(PerlIO_printf(Perl_debug_log,
6709 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6710 PTR2UV(ptr),(long)cnt));
6711 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6713 DEBUG_P(PerlIO_printf(Perl_debug_log,
6714 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6715 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6716 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6718 /* This used to call 'filbuf' in stdio form, but as that behaves like
6719 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6720 another abstraction. */
6721 i = PerlIO_getc(fp); /* get more characters */
6723 DEBUG_P(PerlIO_printf(Perl_debug_log,
6724 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6725 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6726 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6728 cnt = PerlIO_get_cnt(fp);
6729 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6730 DEBUG_P(PerlIO_printf(Perl_debug_log,
6731 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6733 if (i == EOF) /* all done for ever? */
6734 goto thats_really_all_folks;
6736 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6738 SvGROW(sv, bpx + cnt + 2);
6739 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6741 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6743 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6744 goto thats_all_folks;
6748 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6749 memNE((char*)bp - rslen, rsptr, rslen))
6750 goto screamer; /* go back to the fray */
6751 thats_really_all_folks:
6753 cnt += shortbuffered;
6754 DEBUG_P(PerlIO_printf(Perl_debug_log,
6755 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6756 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6757 DEBUG_P(PerlIO_printf(Perl_debug_log,
6758 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6759 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6760 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6762 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6763 DEBUG_P(PerlIO_printf(Perl_debug_log,
6764 "Screamer: done, len=%ld, string=|%.*s|\n",
6765 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6769 /*The big, slow, and stupid way. */
6770 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6772 New(0, buf, 8192, STDCHAR);
6780 const register STDCHAR *bpe = buf + sizeof(buf);
6782 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6783 ; /* keep reading */
6787 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6788 /* Accomodate broken VAXC compiler, which applies U8 cast to
6789 * both args of ?: operator, causing EOF to change into 255
6792 i = (U8)buf[cnt - 1];
6798 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6800 sv_catpvn(sv, (char *) buf, cnt);
6802 sv_setpvn(sv, (char *) buf, cnt);
6804 if (i != EOF && /* joy */
6806 SvCUR(sv) < rslen ||
6807 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6811 * If we're reading from a TTY and we get a short read,
6812 * indicating that the user hit his EOF character, we need
6813 * to notice it now, because if we try to read from the TTY
6814 * again, the EOF condition will disappear.
6816 * The comparison of cnt to sizeof(buf) is an optimization
6817 * that prevents unnecessary calls to feof().
6821 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6825 #ifdef USE_HEAP_INSTEAD_OF_STACK
6830 if (rspara) { /* have to do this both before and after */
6831 while (i != EOF) { /* to make sure file boundaries work right */
6832 i = PerlIO_getc(fp);
6834 PerlIO_ungetc(fp,i);
6840 return_string_or_null:
6841 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6847 Auto-increment of the value in the SV, doing string to numeric conversion
6848 if necessary. Handles 'get' magic.
6854 Perl_sv_inc(pTHX_ register SV *sv)
6863 if (SvTHINKFIRST(sv)) {
6865 sv_force_normal_flags(sv, 0);
6866 if (SvREADONLY(sv)) {
6867 if (IN_PERL_RUNTIME)
6868 Perl_croak(aTHX_ PL_no_modify);
6872 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6874 i = PTR2IV(SvRV(sv));
6879 flags = SvFLAGS(sv);
6880 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6881 /* It's (privately or publicly) a float, but not tested as an
6882 integer, so test it to see. */
6884 flags = SvFLAGS(sv);
6886 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6887 /* It's publicly an integer, or privately an integer-not-float */
6888 #ifdef PERL_PRESERVE_IVUV
6892 if (SvUVX(sv) == UV_MAX)
6893 sv_setnv(sv, UV_MAX_P1);
6895 (void)SvIOK_only_UV(sv);
6896 SvUV_set(sv, SvUVX(sv) + 1);
6898 if (SvIVX(sv) == IV_MAX)
6899 sv_setuv(sv, (UV)IV_MAX + 1);
6901 (void)SvIOK_only(sv);
6902 SvIV_set(sv, SvIVX(sv) + 1);
6907 if (flags & SVp_NOK) {
6908 (void)SvNOK_only(sv);
6909 SvNV_set(sv, SvNVX(sv) + 1.0);
6913 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6914 if ((flags & SVTYPEMASK) < SVt_PVIV)
6915 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6916 (void)SvIOK_only(sv);
6921 while (isALPHA(*d)) d++;
6922 while (isDIGIT(*d)) d++;
6924 #ifdef PERL_PRESERVE_IVUV
6925 /* Got to punt this as an integer if needs be, but we don't issue
6926 warnings. Probably ought to make the sv_iv_please() that does
6927 the conversion if possible, and silently. */
6928 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6929 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6930 /* Need to try really hard to see if it's an integer.
6931 9.22337203685478e+18 is an integer.
6932 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6933 so $a="9.22337203685478e+18"; $a+0; $a++
6934 needs to be the same as $a="9.22337203685478e+18"; $a++
6941 /* sv_2iv *should* have made this an NV */
6942 if (flags & SVp_NOK) {
6943 (void)SvNOK_only(sv);
6944 SvNV_set(sv, SvNVX(sv) + 1.0);
6947 /* I don't think we can get here. Maybe I should assert this
6948 And if we do get here I suspect that sv_setnv will croak. NWC
6950 #if defined(USE_LONG_DOUBLE)
6951 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",
6952 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6954 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6955 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6958 #endif /* PERL_PRESERVE_IVUV */
6959 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6963 while (d >= SvPVX_const(sv)) {
6971 /* MKS: The original code here died if letters weren't consecutive.
6972 * at least it didn't have to worry about non-C locales. The
6973 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6974 * arranged in order (although not consecutively) and that only
6975 * [A-Za-z] are accepted by isALPHA in the C locale.
6977 if (*d != 'z' && *d != 'Z') {
6978 do { ++*d; } while (!isALPHA(*d));
6981 *(d--) -= 'z' - 'a';
6986 *(d--) -= 'z' - 'a' + 1;
6990 /* oh,oh, the number grew */
6991 SvGROW(sv, SvCUR(sv) + 2);
6992 SvCUR_set(sv, SvCUR(sv) + 1);
6993 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
7004 Auto-decrement of the value in the SV, doing string to numeric conversion
7005 if necessary. Handles 'get' magic.
7011 Perl_sv_dec(pTHX_ register SV *sv)
7019 if (SvTHINKFIRST(sv)) {
7021 sv_force_normal_flags(sv, 0);
7022 if (SvREADONLY(sv)) {
7023 if (IN_PERL_RUNTIME)
7024 Perl_croak(aTHX_ PL_no_modify);
7028 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7030 i = PTR2IV(SvRV(sv));
7035 /* Unlike sv_inc we don't have to worry about string-never-numbers
7036 and keeping them magic. But we mustn't warn on punting */
7037 flags = SvFLAGS(sv);
7038 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7039 /* It's publicly an integer, or privately an integer-not-float */
7040 #ifdef PERL_PRESERVE_IVUV
7044 if (SvUVX(sv) == 0) {
7045 (void)SvIOK_only(sv);
7049 (void)SvIOK_only_UV(sv);
7050 SvUV_set(sv, SvUVX(sv) + 1);
7053 if (SvIVX(sv) == IV_MIN)
7054 sv_setnv(sv, (NV)IV_MIN - 1.0);
7056 (void)SvIOK_only(sv);
7057 SvIV_set(sv, SvIVX(sv) - 1);
7062 if (flags & SVp_NOK) {
7063 SvNV_set(sv, SvNVX(sv) - 1.0);
7064 (void)SvNOK_only(sv);
7067 if (!(flags & SVp_POK)) {
7068 if ((flags & SVTYPEMASK) < SVt_PVNV)
7069 sv_upgrade(sv, SVt_NV);
7071 (void)SvNOK_only(sv);
7074 #ifdef PERL_PRESERVE_IVUV
7076 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7077 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7078 /* Need to try really hard to see if it's an integer.
7079 9.22337203685478e+18 is an integer.
7080 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7081 so $a="9.22337203685478e+18"; $a+0; $a--
7082 needs to be the same as $a="9.22337203685478e+18"; $a--
7089 /* sv_2iv *should* have made this an NV */
7090 if (flags & SVp_NOK) {
7091 (void)SvNOK_only(sv);
7092 SvNV_set(sv, SvNVX(sv) - 1.0);
7095 /* I don't think we can get here. Maybe I should assert this
7096 And if we do get here I suspect that sv_setnv will croak. NWC
7098 #if defined(USE_LONG_DOUBLE)
7099 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",
7100 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7102 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7103 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7107 #endif /* PERL_PRESERVE_IVUV */
7108 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7112 =for apidoc sv_mortalcopy
7114 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7115 The new SV is marked as mortal. It will be destroyed "soon", either by an
7116 explicit call to FREETMPS, or by an implicit call at places such as
7117 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7122 /* Make a string that will exist for the duration of the expression
7123 * evaluation. Actually, it may have to last longer than that, but
7124 * hopefully we won't free it until it has been assigned to a
7125 * permanent location. */
7128 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7133 sv_setsv(sv,oldstr);
7135 PL_tmps_stack[++PL_tmps_ix] = sv;
7141 =for apidoc sv_newmortal
7143 Creates a new null SV which is mortal. The reference count of the SV is
7144 set to 1. It will be destroyed "soon", either by an explicit call to
7145 FREETMPS, or by an implicit call at places such as statement boundaries.
7146 See also C<sv_mortalcopy> and C<sv_2mortal>.
7152 Perl_sv_newmortal(pTHX)
7157 SvFLAGS(sv) = SVs_TEMP;
7159 PL_tmps_stack[++PL_tmps_ix] = sv;
7164 =for apidoc sv_2mortal
7166 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7167 by an explicit call to FREETMPS, or by an implicit call at places such as
7168 statement boundaries. SvTEMP() is turned on which means that the SV's
7169 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7170 and C<sv_mortalcopy>.
7176 Perl_sv_2mortal(pTHX_ register SV *sv)
7181 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7184 PL_tmps_stack[++PL_tmps_ix] = sv;
7192 Creates a new SV and copies a string into it. The reference count for the
7193 SV is set to 1. If C<len> is zero, Perl will compute the length using
7194 strlen(). For efficiency, consider using C<newSVpvn> instead.
7200 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7205 sv_setpvn(sv,s,len ? len : strlen(s));
7210 =for apidoc newSVpvn
7212 Creates a new SV and copies a string into it. The reference count for the
7213 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7214 string. You are responsible for ensuring that the source string is at least
7215 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7221 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7226 sv_setpvn(sv,s,len);
7232 =for apidoc newSVhek
7234 Creates a new SV from the hash key structure. It will generate scalars that
7235 point to the shared string table where possible. Returns a new (undefined)
7236 SV if the hek is NULL.
7242 Perl_newSVhek(pTHX_ const HEK *hek)
7251 if (HEK_LEN(hek) == HEf_SVKEY) {
7252 return newSVsv(*(SV**)HEK_KEY(hek));
7254 const int flags = HEK_FLAGS(hek);
7255 if (flags & HVhek_WASUTF8) {
7257 Andreas would like keys he put in as utf8 to come back as utf8
7259 STRLEN utf8_len = HEK_LEN(hek);
7260 U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7261 SV *sv = newSVpvn ((char*)as_utf8, utf8_len);
7264 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7266 } else if (flags & HVhek_REHASH) {
7267 /* We don't have a pointer to the hv, so we have to replicate the
7268 flag into every HEK. This hv is using custom a hasing
7269 algorithm. Hence we can't return a shared string scalar, as
7270 that would contain the (wrong) hash value, and might get passed
7271 into an hv routine with a regular hash */
7273 SV *sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7278 /* This will be overwhelminly the most common case. */
7279 return newSVpvn_share(HEK_KEY(hek),
7280 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7286 =for apidoc newSVpvn_share
7288 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7289 table. If the string does not already exist in the table, it is created
7290 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7291 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7292 otherwise the hash is computed. The idea here is that as the string table
7293 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7294 hash lookup will avoid string compare.
7300 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7303 bool is_utf8 = FALSE;
7305 STRLEN tmplen = -len;
7307 /* See the note in hv.c:hv_fetch() --jhi */
7308 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7312 PERL_HASH(hash, src, len);
7314 sv_upgrade(sv, SVt_PV);
7315 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7327 #if defined(PERL_IMPLICIT_CONTEXT)
7329 /* pTHX_ magic can't cope with varargs, so this is a no-context
7330 * version of the main function, (which may itself be aliased to us).
7331 * Don't access this version directly.
7335 Perl_newSVpvf_nocontext(const char* pat, ...)
7340 va_start(args, pat);
7341 sv = vnewSVpvf(pat, &args);
7348 =for apidoc newSVpvf
7350 Creates a new SV and initializes it with the string formatted like
7357 Perl_newSVpvf(pTHX_ const char* pat, ...)
7361 va_start(args, pat);
7362 sv = vnewSVpvf(pat, &args);
7367 /* backend for newSVpvf() and newSVpvf_nocontext() */
7370 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7374 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7381 Creates a new SV and copies a floating point value into it.
7382 The reference count for the SV is set to 1.
7388 Perl_newSVnv(pTHX_ NV n)
7400 Creates a new SV and copies an integer into it. The reference count for the
7407 Perl_newSViv(pTHX_ IV i)
7419 Creates a new SV and copies an unsigned integer into it.
7420 The reference count for the SV is set to 1.
7426 Perl_newSVuv(pTHX_ UV u)
7436 =for apidoc newRV_noinc
7438 Creates an RV wrapper for an SV. The reference count for the original
7439 SV is B<not> incremented.
7445 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7450 sv_upgrade(sv, SVt_RV);
7452 SvRV_set(sv, tmpRef);
7457 /* newRV_inc is the official function name to use now.
7458 * newRV_inc is in fact #defined to newRV in sv.h
7462 Perl_newRV(pTHX_ SV *tmpRef)
7464 return newRV_noinc(SvREFCNT_inc(tmpRef));
7470 Creates a new SV which is an exact duplicate of the original SV.
7477 Perl_newSVsv(pTHX_ register SV *old)
7483 if (SvTYPE(old) == SVTYPEMASK) {
7484 if (ckWARN_d(WARN_INTERNAL))
7485 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7489 /* SV_GMAGIC is the default for sv_setv()
7490 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7491 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7492 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7497 =for apidoc sv_reset
7499 Underlying implementation for the C<reset> Perl function.
7500 Note that the perl-level function is vaguely deprecated.
7506 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7509 char todo[PERL_UCHAR_MAX+1];
7514 if (!*s) { /* reset ?? searches */
7515 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7517 PMOP *pm = (PMOP *) mg->mg_obj;
7519 pm->op_pmdynflags &= ~PMdf_USED;
7526 /* reset variables */
7528 if (!HvARRAY(stash))
7531 Zero(todo, 256, char);
7534 I32 i = (unsigned char)*s;
7538 max = (unsigned char)*s++;
7539 for ( ; i <= max; i++) {
7542 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7544 for (entry = HvARRAY(stash)[i];
7546 entry = HeNEXT(entry))
7551 if (!todo[(U8)*HeKEY(entry)])
7553 gv = (GV*)HeVAL(entry);
7555 if (SvTHINKFIRST(sv)) {
7556 if (!SvREADONLY(sv) && SvROK(sv))
7561 if (SvTYPE(sv) >= SVt_PV) {
7563 if (SvPVX_const(sv) != Nullch)
7570 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7573 #ifdef USE_ENVIRON_ARRAY
7575 # ifdef USE_ITHREADS
7576 && PL_curinterp == aTHX
7580 environ[0] = Nullch;
7583 #endif /* !PERL_MICRO */
7593 Using various gambits, try to get an IO from an SV: the IO slot if its a
7594 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7595 named after the PV if we're a string.
7601 Perl_sv_2io(pTHX_ SV *sv)
7606 switch (SvTYPE(sv)) {
7614 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7618 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7620 return sv_2io(SvRV(sv));
7621 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7627 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7636 Using various gambits, try to get a CV from an SV; in addition, try if
7637 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7643 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7650 return *gvp = Nullgv, Nullcv;
7651 switch (SvTYPE(sv)) {
7670 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7671 tryAMAGICunDEREF(to_cv);
7674 if (SvTYPE(sv) == SVt_PVCV) {
7683 Perl_croak(aTHX_ "Not a subroutine reference");
7688 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7694 if (lref && !GvCVu(gv)) {
7697 tmpsv = NEWSV(704,0);
7698 gv_efullname3(tmpsv, gv, Nullch);
7699 /* XXX this is probably not what they think they're getting.
7700 * It has the same effect as "sub name;", i.e. just a forward
7702 newSUB(start_subparse(FALSE, 0),
7703 newSVOP(OP_CONST, 0, tmpsv),
7708 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7718 Returns true if the SV has a true value by Perl's rules.
7719 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7720 instead use an in-line version.
7726 Perl_sv_true(pTHX_ register SV *sv)
7731 const register XPV* tXpv;
7732 if ((tXpv = (XPV*)SvANY(sv)) &&
7733 (tXpv->xpv_cur > 1 ||
7734 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7741 return SvIVX(sv) != 0;
7744 return SvNVX(sv) != 0.0;
7746 return sv_2bool(sv);
7754 A private implementation of the C<SvIVx> macro for compilers which can't
7755 cope with complex macro expressions. Always use the macro instead.
7761 Perl_sv_iv(pTHX_ register SV *sv)
7765 return (IV)SvUVX(sv);
7774 A private implementation of the C<SvUVx> macro for compilers which can't
7775 cope with complex macro expressions. Always use the macro instead.
7781 Perl_sv_uv(pTHX_ register SV *sv)
7786 return (UV)SvIVX(sv);
7794 A private implementation of the C<SvNVx> macro for compilers which can't
7795 cope with complex macro expressions. Always use the macro instead.
7801 Perl_sv_nv(pTHX_ register SV *sv)
7808 /* sv_pv() is now a macro using SvPV_nolen();
7809 * this function provided for binary compatibility only
7813 Perl_sv_pv(pTHX_ SV *sv)
7818 return sv_2pv(sv, 0);
7824 Use the C<SvPV_nolen> macro instead
7828 A private implementation of the C<SvPV> macro for compilers which can't
7829 cope with complex macro expressions. Always use the macro instead.
7835 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7841 return sv_2pv(sv, lp);
7846 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7852 return sv_2pv_flags(sv, lp, 0);
7855 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7856 * this function provided for binary compatibility only
7860 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7862 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7866 =for apidoc sv_pvn_force
7868 Get a sensible string out of the SV somehow.
7869 A private implementation of the C<SvPV_force> macro for compilers which
7870 can't cope with complex macro expressions. Always use the macro instead.
7872 =for apidoc sv_pvn_force_flags
7874 Get a sensible string out of the SV somehow.
7875 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7876 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7877 implemented in terms of this function.
7878 You normally want to use the various wrapper macros instead: see
7879 C<SvPV_force> and C<SvPV_force_nomg>
7885 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7888 if (SvTHINKFIRST(sv) && !SvROK(sv))
7889 sv_force_normal_flags(sv, 0);
7899 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7901 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7902 sv_reftype(sv,0), OP_NAME(PL_op));
7904 Perl_croak(aTHX_ "Can't coerce readonly %s to string",
7907 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7908 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7912 s = sv_2pv_flags(sv, &len, flags);
7916 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7919 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7920 SvGROW(sv, len + 1);
7921 Move(s,SvPVX_const(sv),len,char);
7926 SvPOK_on(sv); /* validate pointer */
7928 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7929 PTR2UV(sv),SvPVX_const(sv)));
7932 return SvPVX_mutable(sv);
7935 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7936 * this function provided for binary compatibility only
7940 Perl_sv_pvbyte(pTHX_ SV *sv)
7942 sv_utf8_downgrade(sv,0);
7947 =for apidoc sv_pvbyte
7949 Use C<SvPVbyte_nolen> instead.
7951 =for apidoc sv_pvbyten
7953 A private implementation of the C<SvPVbyte> macro for compilers
7954 which can't cope with complex macro expressions. Always use the macro
7961 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7963 sv_utf8_downgrade(sv,0);
7964 return sv_pvn(sv,lp);
7968 =for apidoc sv_pvbyten_force
7970 A private implementation of the C<SvPVbytex_force> macro for compilers
7971 which can't cope with complex macro expressions. Always use the macro
7978 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7980 sv_pvn_force(sv,lp);
7981 sv_utf8_downgrade(sv,0);
7986 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7987 * this function provided for binary compatibility only
7991 Perl_sv_pvutf8(pTHX_ SV *sv)
7993 sv_utf8_upgrade(sv);
7998 =for apidoc sv_pvutf8
8000 Use the C<SvPVutf8_nolen> macro instead
8002 =for apidoc sv_pvutf8n
8004 A private implementation of the C<SvPVutf8> macro for compilers
8005 which can't cope with complex macro expressions. Always use the macro
8012 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8014 sv_utf8_upgrade(sv);
8015 return sv_pvn(sv,lp);
8019 =for apidoc sv_pvutf8n_force
8021 A private implementation of the C<SvPVutf8_force> macro for compilers
8022 which can't cope with complex macro expressions. Always use the macro
8029 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8031 sv_pvn_force(sv,lp);
8032 sv_utf8_upgrade(sv);
8038 =for apidoc sv_reftype
8040 Returns a string describing what the SV is a reference to.
8046 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8048 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8049 inside return suggests a const propagation bug in g++. */
8050 if (ob && SvOBJECT(sv)) {
8051 char * const name = HvNAME_get(SvSTASH(sv));
8052 return name ? name : (char *) "__ANON__";
8055 switch (SvTYPE(sv)) {
8072 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8073 /* tied lvalues should appear to be
8074 * scalars for backwards compatitbility */
8075 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8076 ? "SCALAR" : "LVALUE");
8077 case SVt_PVAV: return "ARRAY";
8078 case SVt_PVHV: return "HASH";
8079 case SVt_PVCV: return "CODE";
8080 case SVt_PVGV: return "GLOB";
8081 case SVt_PVFM: return "FORMAT";
8082 case SVt_PVIO: return "IO";
8083 default: return "UNKNOWN";
8089 =for apidoc sv_isobject
8091 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8092 object. If the SV is not an RV, or if the object is not blessed, then this
8099 Perl_sv_isobject(pTHX_ SV *sv)
8116 Returns a boolean indicating whether the SV is blessed into the specified
8117 class. This does not check for subtypes; use C<sv_derived_from> to verify
8118 an inheritance relationship.
8124 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8136 hvname = HvNAME_get(SvSTASH(sv));
8140 return strEQ(hvname, name);
8146 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8147 it will be upgraded to one. If C<classname> is non-null then the new SV will
8148 be blessed in the specified package. The new SV is returned and its
8149 reference count is 1.
8155 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8161 SV_CHECK_THINKFIRST_COW_DROP(rv);
8164 if (SvTYPE(rv) >= SVt_PVMG) {
8165 const U32 refcnt = SvREFCNT(rv);
8169 SvREFCNT(rv) = refcnt;
8172 if (SvTYPE(rv) < SVt_RV)
8173 sv_upgrade(rv, SVt_RV);
8174 else if (SvTYPE(rv) > SVt_RV) {
8185 HV* const stash = gv_stashpv(classname, TRUE);
8186 (void)sv_bless(rv, stash);
8192 =for apidoc sv_setref_pv
8194 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8195 argument will be upgraded to an RV. That RV will be modified to point to
8196 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8197 into the SV. The C<classname> argument indicates the package for the
8198 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8199 will have a reference count of 1, and the RV will be returned.
8201 Do not use with other Perl types such as HV, AV, SV, CV, because those
8202 objects will become corrupted by the pointer copy process.
8204 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8210 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8213 sv_setsv(rv, &PL_sv_undef);
8217 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8222 =for apidoc sv_setref_iv
8224 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8225 argument will be upgraded to an RV. That RV will be modified to point to
8226 the new SV. The C<classname> argument indicates the package for the
8227 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8228 will have a reference count of 1, and the RV will be returned.
8234 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8236 sv_setiv(newSVrv(rv,classname), iv);
8241 =for apidoc sv_setref_uv
8243 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8244 argument will be upgraded to an RV. That RV will be modified to point to
8245 the new SV. The C<classname> argument indicates the package for the
8246 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8247 will have a reference count of 1, and the RV will be returned.
8253 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8255 sv_setuv(newSVrv(rv,classname), uv);
8260 =for apidoc sv_setref_nv
8262 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8263 argument will be upgraded to an RV. That RV will be modified to point to
8264 the new SV. The C<classname> argument indicates the package for the
8265 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8266 will have a reference count of 1, and the RV will be returned.
8272 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8274 sv_setnv(newSVrv(rv,classname), nv);
8279 =for apidoc sv_setref_pvn
8281 Copies a string into a new SV, optionally blessing the SV. The length of the
8282 string must be specified with C<n>. The C<rv> argument will be upgraded to
8283 an RV. That RV will be modified to point to the new SV. The C<classname>
8284 argument indicates the package for the blessing. Set C<classname> to
8285 C<Nullch> to avoid the blessing. The new SV will have a reference count
8286 of 1, and the RV will be returned.
8288 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8294 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
8296 sv_setpvn(newSVrv(rv,classname), pv, n);
8301 =for apidoc sv_bless
8303 Blesses an SV into a specified package. The SV must be an RV. The package
8304 must be designated by its stash (see C<gv_stashpv()>). The reference count
8305 of the SV is unaffected.
8311 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8315 Perl_croak(aTHX_ "Can't bless non-reference value");
8317 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8318 if (SvREADONLY(tmpRef))
8319 Perl_croak(aTHX_ PL_no_modify);
8320 if (SvOBJECT(tmpRef)) {
8321 if (SvTYPE(tmpRef) != SVt_PVIO)
8323 SvREFCNT_dec(SvSTASH(tmpRef));
8326 SvOBJECT_on(tmpRef);
8327 if (SvTYPE(tmpRef) != SVt_PVIO)
8329 SvUPGRADE(tmpRef, SVt_PVMG);
8330 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8337 if(SvSMAGICAL(tmpRef))
8338 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8346 /* Downgrades a PVGV to a PVMG.
8350 S_sv_unglob(pTHX_ SV *sv)
8354 assert(SvTYPE(sv) == SVt_PVGV);
8359 SvREFCNT_dec(GvSTASH(sv));
8360 GvSTASH(sv) = Nullhv;
8362 sv_unmagic(sv, PERL_MAGIC_glob);
8363 Safefree(GvNAME(sv));
8366 /* need to keep SvANY(sv) in the right arena */
8367 xpvmg = new_XPVMG();
8368 StructCopy(SvANY(sv), xpvmg, XPVMG);
8369 del_XPVGV(SvANY(sv));
8372 SvFLAGS(sv) &= ~SVTYPEMASK;
8373 SvFLAGS(sv) |= SVt_PVMG;
8377 =for apidoc sv_unref_flags
8379 Unsets the RV status of the SV, and decrements the reference count of
8380 whatever was being referenced by the RV. This can almost be thought of
8381 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8382 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8383 (otherwise the decrementing is conditional on the reference count being
8384 different from one or the reference being a readonly SV).
8391 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8395 if (SvWEAKREF(sv)) {
8403 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8404 assigned to as BEGIN {$a = \"Foo"} will fail. */
8405 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8407 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8408 sv_2mortal(rv); /* Schedule for freeing later */
8412 =for apidoc sv_unref
8414 Unsets the RV status of the SV, and decrements the reference count of
8415 whatever was being referenced by the RV. This can almost be thought of
8416 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8417 being zero. See C<SvROK_off>.
8423 Perl_sv_unref(pTHX_ SV *sv)
8425 sv_unref_flags(sv, 0);
8429 =for apidoc sv_taint
8431 Taint an SV. Use C<SvTAINTED_on> instead.
8436 Perl_sv_taint(pTHX_ SV *sv)
8438 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8442 =for apidoc sv_untaint
8444 Untaint an SV. Use C<SvTAINTED_off> instead.
8449 Perl_sv_untaint(pTHX_ SV *sv)
8451 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8452 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8459 =for apidoc sv_tainted
8461 Test an SV for taintedness. Use C<SvTAINTED> instead.
8466 Perl_sv_tainted(pTHX_ SV *sv)
8468 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8469 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8470 if (mg && (mg->mg_len & 1) )
8477 =for apidoc sv_setpviv
8479 Copies an integer into the given SV, also updating its string value.
8480 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8486 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8488 char buf[TYPE_CHARS(UV)];
8490 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8492 sv_setpvn(sv, ptr, ebuf - ptr);
8496 =for apidoc sv_setpviv_mg
8498 Like C<sv_setpviv>, but also handles 'set' magic.
8504 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8506 char buf[TYPE_CHARS(UV)];
8508 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8510 sv_setpvn(sv, ptr, ebuf - ptr);
8514 #if defined(PERL_IMPLICIT_CONTEXT)
8516 /* pTHX_ magic can't cope with varargs, so this is a no-context
8517 * version of the main function, (which may itself be aliased to us).
8518 * Don't access this version directly.
8522 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8526 va_start(args, pat);
8527 sv_vsetpvf(sv, pat, &args);
8531 /* pTHX_ magic can't cope with varargs, so this is a no-context
8532 * version of the main function, (which may itself be aliased to us).
8533 * Don't access this version directly.
8537 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8541 va_start(args, pat);
8542 sv_vsetpvf_mg(sv, pat, &args);
8548 =for apidoc sv_setpvf
8550 Works like C<sv_catpvf> but copies the text into the SV instead of
8551 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8557 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8560 va_start(args, pat);
8561 sv_vsetpvf(sv, pat, &args);
8566 =for apidoc sv_vsetpvf
8568 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8569 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8571 Usually used via its frontend C<sv_setpvf>.
8577 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8579 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8583 =for apidoc sv_setpvf_mg
8585 Like C<sv_setpvf>, but also handles 'set' magic.
8591 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8594 va_start(args, pat);
8595 sv_vsetpvf_mg(sv, pat, &args);
8600 =for apidoc sv_vsetpvf_mg
8602 Like C<sv_vsetpvf>, but also handles 'set' magic.
8604 Usually used via its frontend C<sv_setpvf_mg>.
8610 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8612 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8616 #if defined(PERL_IMPLICIT_CONTEXT)
8618 /* pTHX_ magic can't cope with varargs, so this is a no-context
8619 * version of the main function, (which may itself be aliased to us).
8620 * Don't access this version directly.
8624 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8628 va_start(args, pat);
8629 sv_vcatpvf(sv, pat, &args);
8633 /* pTHX_ magic can't cope with varargs, so this is a no-context
8634 * version of the main function, (which may itself be aliased to us).
8635 * Don't access this version directly.
8639 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8643 va_start(args, pat);
8644 sv_vcatpvf_mg(sv, pat, &args);
8650 =for apidoc sv_catpvf
8652 Processes its arguments like C<sprintf> and appends the formatted
8653 output to an SV. If the appended data contains "wide" characters
8654 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8655 and characters >255 formatted with %c), the original SV might get
8656 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8657 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8658 valid UTF-8; if the original SV was bytes, the pattern should be too.
8663 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8666 va_start(args, pat);
8667 sv_vcatpvf(sv, pat, &args);
8672 =for apidoc sv_vcatpvf
8674 Processes its arguments like C<vsprintf> and appends the formatted output
8675 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8677 Usually used via its frontend C<sv_catpvf>.
8683 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8685 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8689 =for apidoc sv_catpvf_mg
8691 Like C<sv_catpvf>, but also handles 'set' magic.
8697 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8700 va_start(args, pat);
8701 sv_vcatpvf_mg(sv, pat, &args);
8706 =for apidoc sv_vcatpvf_mg
8708 Like C<sv_vcatpvf>, but also handles 'set' magic.
8710 Usually used via its frontend C<sv_catpvf_mg>.
8716 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8718 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8723 =for apidoc sv_vsetpvfn
8725 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8728 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8734 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8736 sv_setpvn(sv, "", 0);
8737 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8740 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8743 S_expect_number(pTHX_ char** pattern)
8746 switch (**pattern) {
8747 case '1': case '2': case '3':
8748 case '4': case '5': case '6':
8749 case '7': case '8': case '9':
8750 while (isDIGIT(**pattern))
8751 var = var * 10 + (*(*pattern)++ - '0');
8755 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8758 F0convert(NV nv, char *endbuf, STRLEN *len)
8760 const int neg = nv < 0;
8769 if (uv & 1 && uv == nv)
8770 uv--; /* Round to even */
8772 const unsigned dig = uv % 10;
8785 =for apidoc sv_vcatpvfn
8787 Processes its arguments like C<vsprintf> and appends the formatted output
8788 to an SV. Uses an array of SVs if the C style variable argument list is
8789 missing (NULL). When running with taint checks enabled, indicates via
8790 C<maybe_tainted> if results are untrustworthy (often due to the use of
8793 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8798 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8801 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8808 static const char nullstr[] = "(null)";
8810 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8811 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8813 /* Times 4: a decimal digit takes more than 3 binary digits.
8814 * NV_DIG: mantissa takes than many decimal digits.
8815 * Plus 32: Playing safe. */
8816 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8817 /* large enough for "%#.#f" --chip */
8818 /* what about long double NVs? --jhi */
8820 PERL_UNUSED_ARG(maybe_tainted);
8822 /* no matter what, this is a string now */
8823 (void)SvPV_force(sv, origlen);
8825 /* special-case "", "%s", and "%-p" (SVf) */
8828 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8830 const char * const s = va_arg(*args, char*);
8831 sv_catpv(sv, s ? s : nullstr);
8833 else if (svix < svmax) {
8834 sv_catsv(sv, *svargs);
8835 if (DO_UTF8(*svargs))
8840 if (patlen == 3 && pat[0] == '%' &&
8841 pat[1] == '-' && pat[2] == 'p') {
8843 argsv = va_arg(*args, SV*);
8844 sv_catsv(sv, argsv);
8851 #ifndef USE_LONG_DOUBLE
8852 /* special-case "%.<number>[gf]" */
8853 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8854 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8855 unsigned digits = 0;
8859 while (*pp >= '0' && *pp <= '9')
8860 digits = 10 * digits + (*pp++ - '0');
8861 if (pp - pat == (int)patlen - 1) {
8869 /* Add check for digits != 0 because it seems that some
8870 gconverts are buggy in this case, and we don't yet have
8871 a Configure test for this. */
8872 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8873 /* 0, point, slack */
8874 Gconvert(nv, (int)digits, 0, ebuf);
8876 if (*ebuf) /* May return an empty string for digits==0 */
8879 } else if (!digits) {
8882 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8883 sv_catpvn(sv, p, l);
8889 #endif /* !USE_LONG_DOUBLE */
8891 if (!args && svix < svmax && DO_UTF8(*svargs))
8894 patend = (char*)pat + patlen;
8895 for (p = (char*)pat; p < patend; p = q) {
8898 bool vectorize = FALSE;
8899 bool vectorarg = FALSE;
8900 bool vec_utf8 = FALSE;
8906 bool has_precis = FALSE;
8909 bool is_utf8 = FALSE; /* is this item utf8? */
8910 #ifdef HAS_LDBL_SPRINTF_BUG
8911 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8912 with sfio - Allen <allens@cpan.org> */
8913 bool fix_ldbl_sprintf_bug = FALSE;
8917 U8 utf8buf[UTF8_MAXBYTES+1];
8918 STRLEN esignlen = 0;
8920 const char *eptr = Nullch;
8923 const U8 *vecstr = Null(U8*);
8930 /* we need a long double target in case HAS_LONG_DOUBLE but
8933 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8941 const char *dotstr = ".";
8942 STRLEN dotstrlen = 1;
8943 I32 efix = 0; /* explicit format parameter index */
8944 I32 ewix = 0; /* explicit width index */
8945 I32 epix = 0; /* explicit precision index */
8946 I32 evix = 0; /* explicit vector index */
8947 bool asterisk = FALSE;
8949 /* echo everything up to the next format specification */
8950 for (q = p; q < patend && *q != '%'; ++q) ;
8952 if (has_utf8 && !pat_utf8)
8953 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8955 sv_catpvn(sv, p, q - p);
8962 We allow format specification elements in this order:
8963 \d+\$ explicit format parameter index
8965 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8966 0 flag (as above): repeated to allow "v02"
8967 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8968 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8970 [%bcdefginopsux_DFOUX] format (mandatory)
8972 if (EXPECT_NUMBER(q, width)) {
9013 if (EXPECT_NUMBER(q, ewix))
9022 if ((vectorarg = asterisk)) {
9034 EXPECT_NUMBER(q, width);
9039 vecsv = va_arg(*args, SV*);
9041 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9042 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9043 dotstr = SvPV_const(vecsv, dotstrlen);
9048 vecsv = va_arg(*args, SV*);
9049 vecstr = (U8*)SvPV_const(vecsv,veclen);
9050 vec_utf8 = DO_UTF8(vecsv);
9052 else if (efix ? efix <= svmax : svix < svmax) {
9053 vecsv = svargs[efix ? efix-1 : svix++];
9054 vecstr = (U8*)SvPV_const(vecsv,veclen);
9055 vec_utf8 = DO_UTF8(vecsv);
9056 /* if this is a version object, we need to return the
9057 * stringified representation (which the SvPVX_const has
9058 * already done for us), but not vectorize the args
9060 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9062 q++; /* skip past the rest of the %vd format */
9063 eptr = (const char *) vecstr;
9064 elen = strlen(eptr);
9077 i = va_arg(*args, int);
9079 i = (ewix ? ewix <= svmax : svix < svmax) ?
9080 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9082 width = (i < 0) ? -i : i;
9092 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9094 /* XXX: todo, support specified precision parameter */
9098 i = va_arg(*args, int);
9100 i = (ewix ? ewix <= svmax : svix < svmax)
9101 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9102 precis = (i < 0) ? 0 : i;
9107 precis = precis * 10 + (*q++ - '0');
9116 case 'I': /* Ix, I32x, and I64x */
9118 if (q[1] == '6' && q[2] == '4') {
9124 if (q[1] == '3' && q[2] == '2') {
9134 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9145 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9146 if (*(q + 1) == 'l') { /* lld, llf */
9171 argsv = (efix ? efix <= svmax : svix < svmax) ?
9172 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9179 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9181 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9183 eptr = (char*)utf8buf;
9184 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9195 if (args && !vectorize) {
9196 eptr = va_arg(*args, char*);
9198 #ifdef MACOS_TRADITIONAL
9199 /* On MacOS, %#s format is used for Pascal strings */
9204 elen = strlen(eptr);
9206 eptr = (char *)nullstr;
9207 elen = sizeof nullstr - 1;
9211 eptr = SvPVx_const(argsv, elen);
9212 if (DO_UTF8(argsv)) {
9213 if (has_precis && precis < elen) {
9215 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9218 if (width) { /* fudge width (can't fudge elen) */
9219 width += elen - sv_len_utf8(argsv);
9227 if (has_precis && elen > precis)
9234 if (left && args) { /* SVf */
9243 argsv = va_arg(*args, SV*);
9244 eptr = SvPVx_const(argsv, elen);
9249 if (alt || vectorize)
9251 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9269 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9278 esignbuf[esignlen++] = plus;
9282 case 'h': iv = (short)va_arg(*args, int); break;
9283 case 'l': iv = va_arg(*args, long); break;
9284 case 'V': iv = va_arg(*args, IV); break;
9285 default: iv = va_arg(*args, int); break;
9287 case 'q': iv = va_arg(*args, Quad_t); break;
9292 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9294 case 'h': iv = (short)tiv; break;
9295 case 'l': iv = (long)tiv; break;
9297 default: iv = tiv; break;
9299 case 'q': iv = (Quad_t)tiv; break;
9303 if ( !vectorize ) /* we already set uv above */
9308 esignbuf[esignlen++] = plus;
9312 esignbuf[esignlen++] = '-';
9355 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9366 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9367 case 'l': uv = va_arg(*args, unsigned long); break;
9368 case 'V': uv = va_arg(*args, UV); break;
9369 default: uv = va_arg(*args, unsigned); break;
9371 case 'q': uv = va_arg(*args, Uquad_t); break;
9376 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9378 case 'h': uv = (unsigned short)tuv; break;
9379 case 'l': uv = (unsigned long)tuv; break;
9381 default: uv = tuv; break;
9383 case 'q': uv = (Uquad_t)tuv; break;
9390 char *ptr = ebuf + sizeof ebuf;
9396 p = (char*)((c == 'X')
9397 ? "0123456789ABCDEF" : "0123456789abcdef");
9403 esignbuf[esignlen++] = '0';
9404 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9412 if (alt && *ptr != '0')
9421 esignbuf[esignlen++] = '0';
9422 esignbuf[esignlen++] = 'b';
9425 default: /* it had better be ten or less */
9429 } while (uv /= base);
9432 elen = (ebuf + sizeof ebuf) - ptr;
9436 zeros = precis - elen;
9437 else if (precis == 0 && elen == 1 && *eptr == '0')
9443 /* FLOATING POINT */
9446 c = 'f'; /* maybe %F isn't supported here */
9452 /* This is evil, but floating point is even more evil */
9454 /* for SV-style calling, we can only get NV
9455 for C-style calling, we assume %f is double;
9456 for simplicity we allow any of %Lf, %llf, %qf for long double
9460 #if defined(USE_LONG_DOUBLE)
9464 /* [perl #20339] - we should accept and ignore %lf rather than die */
9468 #if defined(USE_LONG_DOUBLE)
9469 intsize = args ? 0 : 'q';
9473 #if defined(HAS_LONG_DOUBLE)
9482 /* now we need (long double) if intsize == 'q', else (double) */
9483 nv = (args && !vectorize) ?
9484 #if LONG_DOUBLESIZE > DOUBLESIZE
9486 va_arg(*args, long double) :
9487 va_arg(*args, double)
9489 va_arg(*args, double)
9495 if (c != 'e' && c != 'E') {
9497 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9498 will cast our (long double) to (double) */
9499 (void)Perl_frexp(nv, &i);
9500 if (i == PERL_INT_MIN)
9501 Perl_die(aTHX_ "panic: frexp");
9503 need = BIT_DIGITS(i);
9505 need += has_precis ? precis : 6; /* known default */
9510 #ifdef HAS_LDBL_SPRINTF_BUG
9511 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9512 with sfio - Allen <allens@cpan.org> */
9515 # define MY_DBL_MAX DBL_MAX
9516 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9517 # if DOUBLESIZE >= 8
9518 # define MY_DBL_MAX 1.7976931348623157E+308L
9520 # define MY_DBL_MAX 3.40282347E+38L
9524 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9525 # define MY_DBL_MAX_BUG 1L
9527 # define MY_DBL_MAX_BUG MY_DBL_MAX
9531 # define MY_DBL_MIN DBL_MIN
9532 # else /* XXX guessing! -Allen */
9533 # if DOUBLESIZE >= 8
9534 # define MY_DBL_MIN 2.2250738585072014E-308L
9536 # define MY_DBL_MIN 1.17549435E-38L
9540 if ((intsize == 'q') && (c == 'f') &&
9541 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9543 /* it's going to be short enough that
9544 * long double precision is not needed */
9546 if ((nv <= 0L) && (nv >= -0L))
9547 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9549 /* would use Perl_fp_class as a double-check but not
9550 * functional on IRIX - see perl.h comments */
9552 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9553 /* It's within the range that a double can represent */
9554 #if defined(DBL_MAX) && !defined(DBL_MIN)
9555 if ((nv >= ((long double)1/DBL_MAX)) ||
9556 (nv <= (-(long double)1/DBL_MAX)))
9558 fix_ldbl_sprintf_bug = TRUE;
9561 if (fix_ldbl_sprintf_bug == TRUE) {
9571 # undef MY_DBL_MAX_BUG
9574 #endif /* HAS_LDBL_SPRINTF_BUG */
9576 need += 20; /* fudge factor */
9577 if (PL_efloatsize < need) {
9578 Safefree(PL_efloatbuf);
9579 PL_efloatsize = need + 20; /* more fudge */
9580 New(906, PL_efloatbuf, PL_efloatsize, char);
9581 PL_efloatbuf[0] = '\0';
9584 if ( !(width || left || plus || alt) && fill != '0'
9585 && has_precis && intsize != 'q' ) { /* Shortcuts */
9586 /* See earlier comment about buggy Gconvert when digits,
9588 if ( c == 'g' && precis) {
9589 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9590 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9591 goto float_converted;
9592 } else if ( c == 'f' && !precis) {
9593 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9598 char *ptr = ebuf + sizeof ebuf;
9601 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9602 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9603 if (intsize == 'q') {
9604 /* Copy the one or more characters in a long double
9605 * format before the 'base' ([efgEFG]) character to
9606 * the format string. */
9607 static char const prifldbl[] = PERL_PRIfldbl;
9608 char const *p = prifldbl + sizeof(prifldbl) - 3;
9609 while (p >= prifldbl) { *--ptr = *p--; }
9614 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9619 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9631 /* No taint. Otherwise we are in the strange situation
9632 * where printf() taints but print($float) doesn't.
9634 #if defined(HAS_LONG_DOUBLE)
9636 (void)sprintf(PL_efloatbuf, ptr, nv);
9638 (void)sprintf(PL_efloatbuf, ptr, (double)nv);
9640 (void)sprintf(PL_efloatbuf, ptr, nv);
9644 eptr = PL_efloatbuf;
9645 elen = strlen(PL_efloatbuf);
9651 i = SvCUR(sv) - origlen;
9652 if (args && !vectorize) {
9654 case 'h': *(va_arg(*args, short*)) = i; break;
9655 default: *(va_arg(*args, int*)) = i; break;
9656 case 'l': *(va_arg(*args, long*)) = i; break;
9657 case 'V': *(va_arg(*args, IV*)) = i; break;
9659 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9664 sv_setuv_mg(argsv, (UV)i);
9666 continue; /* not "break" */
9672 if (!args && ckWARN(WARN_PRINTF) &&
9673 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9674 SV *msg = sv_newmortal();
9675 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9676 (PL_op->op_type == OP_PRTF) ? "" : "s");
9679 Perl_sv_catpvf(aTHX_ msg,
9680 "\"%%%c\"", c & 0xFF);
9682 Perl_sv_catpvf(aTHX_ msg,
9683 "\"%%\\%03"UVof"\"",
9686 sv_catpv(msg, "end of string");
9687 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9690 /* output mangled stuff ... */
9696 /* ... right here, because formatting flags should not apply */
9697 SvGROW(sv, SvCUR(sv) + elen + 1);
9699 Copy(eptr, p, elen, char);
9702 SvCUR_set(sv, p - SvPVX_const(sv));
9704 continue; /* not "break" */
9707 /* calculate width before utf8_upgrade changes it */
9708 have = esignlen + zeros + elen;
9710 if (is_utf8 != has_utf8) {
9713 sv_utf8_upgrade(sv);
9716 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
9717 sv_utf8_upgrade(nsv);
9718 eptr = SvPVX_const(nsv);
9721 SvGROW(sv, SvCUR(sv) + elen + 1);
9726 need = (have > width ? have : width);
9729 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9731 if (esignlen && fill == '0') {
9733 for (i = 0; i < (int)esignlen; i++)
9737 memset(p, fill, gap);
9740 if (esignlen && fill != '0') {
9742 for (i = 0; i < (int)esignlen; i++)
9747 for (i = zeros; i; i--)
9751 Copy(eptr, p, elen, char);
9755 memset(p, ' ', gap);
9760 Copy(dotstr, p, dotstrlen, char);
9764 vectorize = FALSE; /* done iterating over vecstr */
9771 SvCUR_set(sv, p - SvPVX_const(sv));
9779 /* =========================================================================
9781 =head1 Cloning an interpreter
9783 All the macros and functions in this section are for the private use of
9784 the main function, perl_clone().
9786 The foo_dup() functions make an exact copy of an existing foo thinngy.
9787 During the course of a cloning, a hash table is used to map old addresses
9788 to new addresses. The table is created and manipulated with the
9789 ptr_table_* functions.
9793 ============================================================================*/
9796 #if defined(USE_ITHREADS)
9798 #ifndef GpREFCNT_inc
9799 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9803 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9804 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9805 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9806 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9807 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9808 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9809 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9810 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9811 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9812 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9813 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9814 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9815 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9818 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9819 regcomp.c. AMS 20010712 */
9822 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
9827 struct reg_substr_datum *s;
9830 return (REGEXP *)NULL;
9832 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9835 len = r->offsets[0];
9836 npar = r->nparens+1;
9838 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9839 Copy(r->program, ret->program, len+1, regnode);
9841 New(0, ret->startp, npar, I32);
9842 Copy(r->startp, ret->startp, npar, I32);
9843 New(0, ret->endp, npar, I32);
9844 Copy(r->startp, ret->startp, npar, I32);
9846 New(0, ret->substrs, 1, struct reg_substr_data);
9847 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9848 s->min_offset = r->substrs->data[i].min_offset;
9849 s->max_offset = r->substrs->data[i].max_offset;
9850 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9851 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9854 ret->regstclass = NULL;
9857 const int count = r->data->count;
9860 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9861 char, struct reg_data);
9862 New(0, d->what, count, U8);
9865 for (i = 0; i < count; i++) {
9866 d->what[i] = r->data->what[i];
9867 switch (d->what[i]) {
9868 /* legal options are one of: sfpont
9869 see also regcomp.h and pregfree() */
9871 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9874 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9877 /* This is cheating. */
9878 New(0, d->data[i], 1, struct regnode_charclass_class);
9879 StructCopy(r->data->data[i], d->data[i],
9880 struct regnode_charclass_class);
9881 ret->regstclass = (regnode*)d->data[i];
9884 /* Compiled op trees are readonly, and can thus be
9885 shared without duplication. */
9887 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9891 d->data[i] = r->data->data[i];
9894 d->data[i] = r->data->data[i];
9896 ((reg_trie_data*)d->data[i])->refcount++;
9900 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9909 New(0, ret->offsets, 2*len+1, U32);
9910 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9912 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9913 ret->refcnt = r->refcnt;
9914 ret->minlen = r->minlen;
9915 ret->prelen = r->prelen;
9916 ret->nparens = r->nparens;
9917 ret->lastparen = r->lastparen;
9918 ret->lastcloseparen = r->lastcloseparen;
9919 ret->reganch = r->reganch;
9921 ret->sublen = r->sublen;
9923 if (RX_MATCH_COPIED(ret))
9924 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9926 ret->subbeg = Nullch;
9927 #ifdef PERL_OLD_COPY_ON_WRITE
9928 ret->saved_copy = Nullsv;
9931 ptr_table_store(PL_ptr_table, r, ret);
9935 /* duplicate a file handle */
9938 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9942 PERL_UNUSED_ARG(type);
9945 return (PerlIO*)NULL;
9947 /* look for it in the table first */
9948 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9952 /* create anew and remember what it is */
9953 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9954 ptr_table_store(PL_ptr_table, fp, ret);
9958 /* duplicate a directory handle */
9961 Perl_dirp_dup(pTHX_ DIR *dp)
9969 /* duplicate a typeglob */
9972 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9977 /* look for it in the table first */
9978 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9982 /* create anew and remember what it is */
9983 Newz(0, ret, 1, GP);
9984 ptr_table_store(PL_ptr_table, gp, ret);
9987 ret->gp_refcnt = 0; /* must be before any other dups! */
9988 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9989 ret->gp_io = io_dup_inc(gp->gp_io, param);
9990 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9991 ret->gp_av = av_dup_inc(gp->gp_av, param);
9992 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9993 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9994 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9995 ret->gp_cvgen = gp->gp_cvgen;
9996 ret->gp_flags = gp->gp_flags;
9997 ret->gp_line = gp->gp_line;
9998 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10002 /* duplicate a chain of magic */
10005 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10007 MAGIC *mgprev = (MAGIC*)NULL;
10010 return (MAGIC*)NULL;
10011 /* look for it in the table first */
10012 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10016 for (; mg; mg = mg->mg_moremagic) {
10018 Newz(0, nmg, 1, MAGIC);
10020 mgprev->mg_moremagic = nmg;
10023 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10024 nmg->mg_private = mg->mg_private;
10025 nmg->mg_type = mg->mg_type;
10026 nmg->mg_flags = mg->mg_flags;
10027 if (mg->mg_type == PERL_MAGIC_qr) {
10028 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10030 else if(mg->mg_type == PERL_MAGIC_backref) {
10031 const AV * const av = (AV*) mg->mg_obj;
10034 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10036 for (i = AvFILLp(av); i >= 0; i--) {
10037 if (!svp[i]) continue;
10038 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10041 else if (mg->mg_type == PERL_MAGIC_symtab) {
10042 nmg->mg_obj = mg->mg_obj;
10045 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10046 ? sv_dup_inc(mg->mg_obj, param)
10047 : sv_dup(mg->mg_obj, param);
10049 nmg->mg_len = mg->mg_len;
10050 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10051 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10052 if (mg->mg_len > 0) {
10053 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10054 if (mg->mg_type == PERL_MAGIC_overload_table &&
10055 AMT_AMAGIC((AMT*)mg->mg_ptr))
10057 AMT *amtp = (AMT*)mg->mg_ptr;
10058 AMT *namtp = (AMT*)nmg->mg_ptr;
10060 for (i = 1; i < NofAMmeth; i++) {
10061 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10065 else if (mg->mg_len == HEf_SVKEY)
10066 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10068 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10069 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10076 /* create a new pointer-mapping table */
10079 Perl_ptr_table_new(pTHX)
10082 Newz(0, tbl, 1, PTR_TBL_t);
10083 tbl->tbl_max = 511;
10084 tbl->tbl_items = 0;
10085 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10090 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10092 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10095 #define new_pte() new_body(struct ptr_tbl_ent, pte)
10096 #define del_pte(p) del_body_type(p, struct ptr_tbl_ent, pte)
10098 /* map an existing pointer using a table */
10101 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
10103 PTR_TBL_ENT_t *tblent;
10104 const UV hash = PTR_TABLE_HASH(sv);
10106 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10107 for (; tblent; tblent = tblent->next) {
10108 if (tblent->oldval == sv)
10109 return tblent->newval;
10111 return (void*)NULL;
10114 /* add a new entry to a pointer-mapping table */
10117 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldv, void *newv)
10119 PTR_TBL_ENT_t *tblent, **otblent;
10120 /* XXX this may be pessimal on platforms where pointers aren't good
10121 * hash values e.g. if they grow faster in the most significant
10123 const UV hash = PTR_TABLE_HASH(oldv);
10127 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10128 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10129 if (tblent->oldval == oldv) {
10130 tblent->newval = newv;
10134 tblent = new_pte();
10135 tblent->oldval = oldv;
10136 tblent->newval = newv;
10137 tblent->next = *otblent;
10140 if (!empty && tbl->tbl_items > tbl->tbl_max)
10141 ptr_table_split(tbl);
10144 /* double the hash bucket size of an existing ptr table */
10147 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10149 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10150 const UV oldsize = tbl->tbl_max + 1;
10151 UV newsize = oldsize * 2;
10154 Renew(ary, newsize, PTR_TBL_ENT_t*);
10155 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10156 tbl->tbl_max = --newsize;
10157 tbl->tbl_ary = ary;
10158 for (i=0; i < oldsize; i++, ary++) {
10159 PTR_TBL_ENT_t **curentp, **entp, *ent;
10162 curentp = ary + oldsize;
10163 for (entp = ary, ent = *ary; ent; ent = *entp) {
10164 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10166 ent->next = *curentp;
10176 /* remove all the entries from a ptr table */
10179 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10181 register PTR_TBL_ENT_t **array;
10182 register PTR_TBL_ENT_t *entry;
10186 if (!tbl || !tbl->tbl_items) {
10190 array = tbl->tbl_ary;
10192 max = tbl->tbl_max;
10196 PTR_TBL_ENT_t *oentry = entry;
10197 entry = entry->next;
10201 if (++riter > max) {
10204 entry = array[riter];
10208 tbl->tbl_items = 0;
10211 /* clear and free a ptr table */
10214 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10219 ptr_table_clear(tbl);
10220 Safefree(tbl->tbl_ary);
10224 /* attempt to make everything in the typeglob readonly */
10227 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10229 GV *gv = (GV*)sstr;
10230 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10232 if (GvIO(gv) || GvFORM(gv)) {
10233 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10235 else if (!GvCV(gv)) {
10236 GvCV(gv) = (CV*)sv;
10239 /* CvPADLISTs cannot be shared */
10240 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10245 if (!GvUNIQUE(gv)) {
10247 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10248 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10254 * write attempts will die with
10255 * "Modification of a read-only value attempted"
10261 SvREADONLY_on(GvSV(gv));
10265 GvAV(gv) = (AV*)sv;
10268 SvREADONLY_on(GvAV(gv));
10272 GvHV(gv) = (HV*)sv;
10275 SvREADONLY_on(GvHV(gv));
10278 return sstr; /* he_dup() will SvREFCNT_inc() */
10282 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10285 SvRV_set(dstr, SvWEAKREF(sstr)
10286 ? sv_dup(SvRV(sstr), param)
10287 : sv_dup_inc(SvRV(sstr), param));
10290 else if (SvPVX_const(sstr)) {
10291 /* Has something there */
10293 /* Normal PV - clone whole allocated space */
10294 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
10295 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10296 /* Not that normal - actually sstr is copy on write.
10297 But we are a true, independant SV, so: */
10298 SvREADONLY_off(dstr);
10303 /* Special case - not normally malloced for some reason */
10304 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
10305 /* A "shared" PV - clone it as "shared" PV */
10307 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
10311 /* Some other special case - random pointer */
10312 SvPV_set(dstr, SvPVX(sstr));
10317 /* Copy the Null */
10318 if (SvTYPE(dstr) == SVt_RV)
10319 SvRV_set(dstr, NULL);
10325 /* duplicate an SV of any type (including AV, HV etc) */
10328 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10333 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10335 /* look for it in the table first */
10336 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10340 if(param->flags & CLONEf_JOIN_IN) {
10341 /** We are joining here so we don't want do clone
10342 something that is bad **/
10343 const char *hvname;
10345 if(SvTYPE(sstr) == SVt_PVHV &&
10346 (hvname = HvNAME_get(sstr))) {
10347 /** don't clone stashes if they already exist **/
10348 HV* old_stash = gv_stashpv(hvname,0);
10349 return (SV*) old_stash;
10353 /* create anew and remember what it is */
10356 #ifdef DEBUG_LEAKING_SCALARS
10357 dstr->sv_debug_optype = sstr->sv_debug_optype;
10358 dstr->sv_debug_line = sstr->sv_debug_line;
10359 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10360 dstr->sv_debug_cloned = 1;
10362 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10364 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10368 ptr_table_store(PL_ptr_table, sstr, dstr);
10371 SvFLAGS(dstr) = SvFLAGS(sstr);
10372 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10373 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10376 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10377 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10378 PL_watch_pvx, SvPVX_const(sstr));
10381 /* don't clone objects whose class has asked us not to */
10382 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10383 SvFLAGS(dstr) &= ~SVTYPEMASK;
10384 SvOBJECT_off(dstr);
10388 switch (SvTYPE(sstr)) {
10390 SvANY(dstr) = NULL;
10393 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10394 SvIV_set(dstr, SvIVX(sstr));
10397 SvANY(dstr) = new_XNV();
10398 SvNV_set(dstr, SvNVX(sstr));
10401 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10402 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10406 /* These are all the types that need complex bodies allocating. */
10407 size_t new_body_length;
10408 size_t new_body_offset = 0;
10409 void **new_body_arena;
10410 void **new_body_arenaroot;
10413 switch (SvTYPE(sstr)) {
10415 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
10420 new_body = new_XPVIO();
10421 new_body_length = sizeof(XPVIO);
10424 new_body = new_XPVFM();
10425 new_body_length = sizeof(XPVFM);
10429 new_body_arena = (void **) &PL_xpvhv_root;
10430 new_body_arenaroot = (void **) &PL_xpvhv_arenaroot;
10431 new_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill)
10432 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill);
10433 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10434 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10438 new_body_arena = (void **) &PL_xpvav_root;
10439 new_body_arenaroot = (void **) &PL_xpvav_arenaroot;
10440 new_body_offset = STRUCT_OFFSET(XPVAV, xav_fill)
10441 - STRUCT_OFFSET(xpvav_allocated, xav_fill);
10442 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10443 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10447 new_body_length = sizeof(XPVBM);
10448 new_body_arena = (void **) &PL_xpvbm_root;
10449 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
10452 if (GvUNIQUE((GV*)sstr)) {
10454 if ((share = gv_share(sstr, param))) {
10457 ptr_table_store(PL_ptr_table, sstr, dstr);
10459 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10460 HvNAME_get(GvSTASH(share)), GvNAME(share));
10465 new_body_length = sizeof(XPVGV);
10466 new_body_arena = (void **) &PL_xpvgv_root;
10467 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
10470 new_body_length = sizeof(XPVCV);
10471 new_body_arena = (void **) &PL_xpvcv_root;
10472 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
10475 new_body_length = sizeof(XPVLV);
10476 new_body_arena = (void **) &PL_xpvlv_root;
10477 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
10480 new_body_length = sizeof(XPVMG);
10481 new_body_arena = (void **) &PL_xpvmg_root;
10482 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
10485 new_body_length = sizeof(XPVNV);
10486 new_body_arena = (void **) &PL_xpvnv_root;
10487 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
10490 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
10491 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
10492 new_body_length = sizeof(XPVIV) - new_body_offset;
10493 new_body_arena = (void **) &PL_xpviv_root;
10494 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
10497 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
10498 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
10499 new_body_length = sizeof(XPV) - new_body_offset;
10500 new_body_arena = (void **) &PL_xpv_root;
10501 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
10503 assert(new_body_length);
10505 new_body = (void*)((char*)S_new_body(aTHX_ new_body_arenaroot,
10508 - new_body_offset);
10510 /* We always allocated the full length item with PURIFY */
10511 new_body_length += new_body_offset;
10512 new_body_offset = 0;
10513 new_body = my_safemalloc(new_body_length);
10517 SvANY(dstr) = new_body;
10519 Copy(((char*)SvANY(sstr)) + new_body_offset,
10520 ((char*)SvANY(dstr)) + new_body_offset,
10521 new_body_length, char);
10523 if (SvTYPE(sstr) != SVt_PVAV && SvTYPE(sstr) != SVt_PVHV)
10524 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10526 /* The Copy above means that all the source (unduplicated) pointers
10527 are now in the destination. We can check the flags and the
10528 pointers in either, but it's possible that there's less cache
10529 missing by always going for the destination.
10530 FIXME - instrument and check that assumption */
10531 if (SvTYPE(sstr) >= SVt_PVMG) {
10533 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
10535 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
10538 switch (SvTYPE(sstr)) {
10550 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
10551 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
10552 LvTARG(dstr) = dstr;
10553 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
10554 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
10556 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
10559 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
10560 GvSTASH(dstr) = hv_dup_inc(GvSTASH(dstr), param);
10561 GvGP(dstr) = gp_dup(GvGP(dstr), param);
10562 (void)GpREFCNT_inc(GvGP(dstr));
10565 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
10566 if (IoOFP(dstr) == IoIFP(sstr))
10567 IoOFP(dstr) = IoIFP(dstr);
10569 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
10570 /* PL_rsfp_filters entries have fake IoDIRP() */
10571 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
10572 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
10573 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
10574 /* I have no idea why fake dirp (rsfps)
10575 should be treated differently but otherwise
10576 we end up with leaks -- sky*/
10577 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
10578 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
10579 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
10581 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
10582 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
10583 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
10585 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
10586 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
10587 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
10590 if (AvARRAY((AV*)sstr)) {
10591 SV **dst_ary, **src_ary;
10592 SSize_t items = AvFILLp((AV*)sstr) + 1;
10594 src_ary = AvARRAY((AV*)sstr);
10595 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10596 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10597 SvPV_set(dstr, (char*)dst_ary);
10598 AvALLOC((AV*)dstr) = dst_ary;
10599 if (AvREAL((AV*)sstr)) {
10600 while (items-- > 0)
10601 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10604 while (items-- > 0)
10605 *dst_ary++ = sv_dup(*src_ary++, param);
10607 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10608 while (items-- > 0) {
10609 *dst_ary++ = &PL_sv_undef;
10613 SvPV_set(dstr, Nullch);
10614 AvALLOC((AV*)dstr) = (SV**)NULL;
10621 if (HvARRAY((HV*)sstr)) {
10623 const bool sharekeys = !!HvSHAREKEYS(sstr);
10624 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10625 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10628 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10629 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
10631 HvARRAY(dstr) = (HE**)darray;
10632 while (i <= sxhv->xhv_max) {
10633 HE *source = HvARRAY(sstr)[i];
10634 HvARRAY(dstr)[i] = source
10635 ? he_dup(source, sharekeys, param) : 0;
10639 struct xpvhv_aux *saux = HvAUX(sstr);
10640 struct xpvhv_aux *daux = HvAUX(dstr);
10641 /* This flag isn't copied. */
10642 /* SvOOK_on(hv) attacks the IV flags. */
10643 SvFLAGS(dstr) |= SVf_OOK;
10645 hvname = saux->xhv_name;
10647 = hvname ? hek_dup(hvname, param) : hvname;
10649 daux->xhv_riter = saux->xhv_riter;
10650 daux->xhv_eiter = saux->xhv_eiter
10651 ? he_dup(saux->xhv_eiter,
10652 (bool)!!HvSHAREKEYS(sstr), param) : 0;
10656 SvPV_set(dstr, Nullch);
10658 /* Record stashes for possible cloning in Perl_clone(). */
10660 av_push(param->stashes, dstr);
10665 /* NOTE: not refcounted */
10666 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
10668 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
10670 if (CvCONST(dstr)) {
10671 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
10672 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
10673 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
10675 /* don't dup if copying back - CvGV isn't refcounted, so the
10676 * duped GV may never be freed. A bit of a hack! DAPM */
10677 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10678 Nullgv : gv_dup(CvGV(dstr), param) ;
10679 if (!(param->flags & CLONEf_COPY_STACKS)) {
10682 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10684 CvWEAKOUTSIDE(sstr)
10685 ? cv_dup( CvOUTSIDE(dstr), param)
10686 : cv_dup_inc(CvOUTSIDE(dstr), param);
10688 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
10695 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10701 /* duplicate a context */
10704 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10706 PERL_CONTEXT *ncxs;
10709 return (PERL_CONTEXT*)NULL;
10711 /* look for it in the table first */
10712 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10716 /* create anew and remember what it is */
10717 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10718 ptr_table_store(PL_ptr_table, cxs, ncxs);
10721 PERL_CONTEXT *cx = &cxs[ix];
10722 PERL_CONTEXT *ncx = &ncxs[ix];
10723 ncx->cx_type = cx->cx_type;
10724 if (CxTYPE(cx) == CXt_SUBST) {
10725 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10728 ncx->blk_oldsp = cx->blk_oldsp;
10729 ncx->blk_oldcop = cx->blk_oldcop;
10730 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10731 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10732 ncx->blk_oldpm = cx->blk_oldpm;
10733 ncx->blk_gimme = cx->blk_gimme;
10734 switch (CxTYPE(cx)) {
10736 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10737 ? cv_dup_inc(cx->blk_sub.cv, param)
10738 : cv_dup(cx->blk_sub.cv,param));
10739 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10740 ? av_dup_inc(cx->blk_sub.argarray, param)
10742 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10743 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10744 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10745 ncx->blk_sub.lval = cx->blk_sub.lval;
10746 ncx->blk_sub.retop = cx->blk_sub.retop;
10749 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10750 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10751 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10752 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10753 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10754 ncx->blk_eval.retop = cx->blk_eval.retop;
10757 ncx->blk_loop.label = cx->blk_loop.label;
10758 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10759 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10760 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10761 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10762 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10763 ? cx->blk_loop.iterdata
10764 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10765 ncx->blk_loop.oldcomppad
10766 = (PAD*)ptr_table_fetch(PL_ptr_table,
10767 cx->blk_loop.oldcomppad);
10768 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10769 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10770 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10771 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10772 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10775 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10776 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10777 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10778 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10779 ncx->blk_sub.retop = cx->blk_sub.retop;
10791 /* duplicate a stack info structure */
10794 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10799 return (PERL_SI*)NULL;
10801 /* look for it in the table first */
10802 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10806 /* create anew and remember what it is */
10807 Newz(56, nsi, 1, PERL_SI);
10808 ptr_table_store(PL_ptr_table, si, nsi);
10810 nsi->si_stack = av_dup_inc(si->si_stack, param);
10811 nsi->si_cxix = si->si_cxix;
10812 nsi->si_cxmax = si->si_cxmax;
10813 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10814 nsi->si_type = si->si_type;
10815 nsi->si_prev = si_dup(si->si_prev, param);
10816 nsi->si_next = si_dup(si->si_next, param);
10817 nsi->si_markoff = si->si_markoff;
10822 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10823 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10824 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10825 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10826 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10827 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10828 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10829 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10830 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10831 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10832 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10833 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10834 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10835 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10838 #define pv_dup_inc(p) SAVEPV(p)
10839 #define pv_dup(p) SAVEPV(p)
10840 #define svp_dup_inc(p,pp) any_dup(p,pp)
10842 /* map any object to the new equivent - either something in the
10843 * ptr table, or something in the interpreter structure
10847 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
10852 return (void*)NULL;
10854 /* look for it in the table first */
10855 ret = ptr_table_fetch(PL_ptr_table, v);
10859 /* see if it is part of the interpreter structure */
10860 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10861 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10869 /* duplicate the save stack */
10872 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10874 ANY * const ss = proto_perl->Tsavestack;
10875 const I32 max = proto_perl->Tsavestack_max;
10876 I32 ix = proto_perl->Tsavestack_ix;
10888 void (*dptr) (void*);
10889 void (*dxptr) (pTHX_ void*);
10891 Newz(54, nss, max, ANY);
10894 I32 i = POPINT(ss,ix);
10895 TOPINT(nss,ix) = i;
10897 case SAVEt_ITEM: /* normal string */
10898 sv = (SV*)POPPTR(ss,ix);
10899 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10900 sv = (SV*)POPPTR(ss,ix);
10901 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10903 case SAVEt_SV: /* scalar reference */
10904 sv = (SV*)POPPTR(ss,ix);
10905 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10906 gv = (GV*)POPPTR(ss,ix);
10907 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10909 case SAVEt_GENERIC_PVREF: /* generic char* */
10910 c = (char*)POPPTR(ss,ix);
10911 TOPPTR(nss,ix) = pv_dup(c);
10912 ptr = POPPTR(ss,ix);
10913 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10915 case SAVEt_SHARED_PVREF: /* char* in shared space */
10916 c = (char*)POPPTR(ss,ix);
10917 TOPPTR(nss,ix) = savesharedpv(c);
10918 ptr = POPPTR(ss,ix);
10919 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10921 case SAVEt_GENERIC_SVREF: /* generic sv */
10922 case SAVEt_SVREF: /* scalar reference */
10923 sv = (SV*)POPPTR(ss,ix);
10924 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10925 ptr = POPPTR(ss,ix);
10926 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10928 case SAVEt_AV: /* array reference */
10929 av = (AV*)POPPTR(ss,ix);
10930 TOPPTR(nss,ix) = av_dup_inc(av, param);
10931 gv = (GV*)POPPTR(ss,ix);
10932 TOPPTR(nss,ix) = gv_dup(gv, param);
10934 case SAVEt_HV: /* hash reference */
10935 hv = (HV*)POPPTR(ss,ix);
10936 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10937 gv = (GV*)POPPTR(ss,ix);
10938 TOPPTR(nss,ix) = gv_dup(gv, param);
10940 case SAVEt_INT: /* int reference */
10941 ptr = POPPTR(ss,ix);
10942 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10943 intval = (int)POPINT(ss,ix);
10944 TOPINT(nss,ix) = intval;
10946 case SAVEt_LONG: /* long reference */
10947 ptr = POPPTR(ss,ix);
10948 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10949 longval = (long)POPLONG(ss,ix);
10950 TOPLONG(nss,ix) = longval;
10952 case SAVEt_I32: /* I32 reference */
10953 case SAVEt_I16: /* I16 reference */
10954 case SAVEt_I8: /* I8 reference */
10955 ptr = POPPTR(ss,ix);
10956 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10958 TOPINT(nss,ix) = i;
10960 case SAVEt_IV: /* IV reference */
10961 ptr = POPPTR(ss,ix);
10962 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10964 TOPIV(nss,ix) = iv;
10966 case SAVEt_SPTR: /* SV* reference */
10967 ptr = POPPTR(ss,ix);
10968 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10969 sv = (SV*)POPPTR(ss,ix);
10970 TOPPTR(nss,ix) = sv_dup(sv, param);
10972 case SAVEt_VPTR: /* random* reference */
10973 ptr = POPPTR(ss,ix);
10974 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10975 ptr = POPPTR(ss,ix);
10976 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10978 case SAVEt_PPTR: /* char* reference */
10979 ptr = POPPTR(ss,ix);
10980 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10981 c = (char*)POPPTR(ss,ix);
10982 TOPPTR(nss,ix) = pv_dup(c);
10984 case SAVEt_HPTR: /* HV* reference */
10985 ptr = POPPTR(ss,ix);
10986 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10987 hv = (HV*)POPPTR(ss,ix);
10988 TOPPTR(nss,ix) = hv_dup(hv, param);
10990 case SAVEt_APTR: /* AV* reference */
10991 ptr = POPPTR(ss,ix);
10992 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10993 av = (AV*)POPPTR(ss,ix);
10994 TOPPTR(nss,ix) = av_dup(av, param);
10997 gv = (GV*)POPPTR(ss,ix);
10998 TOPPTR(nss,ix) = gv_dup(gv, param);
11000 case SAVEt_GP: /* scalar reference */
11001 gp = (GP*)POPPTR(ss,ix);
11002 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11003 (void)GpREFCNT_inc(gp);
11004 gv = (GV*)POPPTR(ss,ix);
11005 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11006 c = (char*)POPPTR(ss,ix);
11007 TOPPTR(nss,ix) = pv_dup(c);
11009 TOPIV(nss,ix) = iv;
11011 TOPIV(nss,ix) = iv;
11014 case SAVEt_MORTALIZESV:
11015 sv = (SV*)POPPTR(ss,ix);
11016 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11019 ptr = POPPTR(ss,ix);
11020 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11021 /* these are assumed to be refcounted properly */
11023 switch (((OP*)ptr)->op_type) {
11025 case OP_LEAVESUBLV:
11029 case OP_LEAVEWRITE:
11030 TOPPTR(nss,ix) = ptr;
11035 TOPPTR(nss,ix) = Nullop;
11040 TOPPTR(nss,ix) = Nullop;
11043 c = (char*)POPPTR(ss,ix);
11044 TOPPTR(nss,ix) = pv_dup_inc(c);
11046 case SAVEt_CLEARSV:
11047 longval = POPLONG(ss,ix);
11048 TOPLONG(nss,ix) = longval;
11051 hv = (HV*)POPPTR(ss,ix);
11052 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11053 c = (char*)POPPTR(ss,ix);
11054 TOPPTR(nss,ix) = pv_dup_inc(c);
11056 TOPINT(nss,ix) = i;
11058 case SAVEt_DESTRUCTOR:
11059 ptr = POPPTR(ss,ix);
11060 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11061 dptr = POPDPTR(ss,ix);
11062 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
11063 any_dup(FPTR2DPTR(void *, dptr),
11066 case SAVEt_DESTRUCTOR_X:
11067 ptr = POPPTR(ss,ix);
11068 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11069 dxptr = POPDXPTR(ss,ix);
11070 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
11071 any_dup(FPTR2DPTR(void *, dxptr),
11074 case SAVEt_REGCONTEXT:
11077 TOPINT(nss,ix) = i;
11080 case SAVEt_STACK_POS: /* Position on Perl stack */
11082 TOPINT(nss,ix) = i;
11084 case SAVEt_AELEM: /* array element */
11085 sv = (SV*)POPPTR(ss,ix);
11086 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11088 TOPINT(nss,ix) = i;
11089 av = (AV*)POPPTR(ss,ix);
11090 TOPPTR(nss,ix) = av_dup_inc(av, param);
11092 case SAVEt_HELEM: /* hash element */
11093 sv = (SV*)POPPTR(ss,ix);
11094 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11095 sv = (SV*)POPPTR(ss,ix);
11096 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11097 hv = (HV*)POPPTR(ss,ix);
11098 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11101 ptr = POPPTR(ss,ix);
11102 TOPPTR(nss,ix) = ptr;
11106 TOPINT(nss,ix) = i;
11108 case SAVEt_COMPPAD:
11109 av = (AV*)POPPTR(ss,ix);
11110 TOPPTR(nss,ix) = av_dup(av, param);
11113 longval = (long)POPLONG(ss,ix);
11114 TOPLONG(nss,ix) = longval;
11115 ptr = POPPTR(ss,ix);
11116 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11117 sv = (SV*)POPPTR(ss,ix);
11118 TOPPTR(nss,ix) = sv_dup(sv, param);
11121 ptr = POPPTR(ss,ix);
11122 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11123 longval = (long)POPBOOL(ss,ix);
11124 TOPBOOL(nss,ix) = (bool)longval;
11126 case SAVEt_SET_SVFLAGS:
11128 TOPINT(nss,ix) = i;
11130 TOPINT(nss,ix) = i;
11131 sv = (SV*)POPPTR(ss,ix);
11132 TOPPTR(nss,ix) = sv_dup(sv, param);
11135 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11143 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11144 * flag to the result. This is done for each stash before cloning starts,
11145 * so we know which stashes want their objects cloned */
11148 do_mark_cloneable_stash(pTHX_ SV *sv)
11150 const HEK * const hvname = HvNAME_HEK((HV*)sv);
11152 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11153 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11154 if (cloner && GvCV(cloner)) {
11161 XPUSHs(sv_2mortal(newSVhek(hvname)));
11163 call_sv((SV*)GvCV(cloner), G_SCALAR);
11170 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11178 =for apidoc perl_clone
11180 Create and return a new interpreter by cloning the current one.
11182 perl_clone takes these flags as parameters:
11184 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11185 without it we only clone the data and zero the stacks,
11186 with it we copy the stacks and the new perl interpreter is
11187 ready to run at the exact same point as the previous one.
11188 The pseudo-fork code uses COPY_STACKS while the
11189 threads->new doesn't.
11191 CLONEf_KEEP_PTR_TABLE
11192 perl_clone keeps a ptr_table with the pointer of the old
11193 variable as a key and the new variable as a value,
11194 this allows it to check if something has been cloned and not
11195 clone it again but rather just use the value and increase the
11196 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11197 the ptr_table using the function
11198 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11199 reason to keep it around is if you want to dup some of your own
11200 variable who are outside the graph perl scans, example of this
11201 code is in threads.xs create
11204 This is a win32 thing, it is ignored on unix, it tells perls
11205 win32host code (which is c++) to clone itself, this is needed on
11206 win32 if you want to run two threads at the same time,
11207 if you just want to do some stuff in a separate perl interpreter
11208 and then throw it away and return to the original one,
11209 you don't need to do anything.
11214 /* XXX the above needs expanding by someone who actually understands it ! */
11215 EXTERN_C PerlInterpreter *
11216 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11219 perl_clone(PerlInterpreter *proto_perl, UV flags)
11222 #ifdef PERL_IMPLICIT_SYS
11224 /* perlhost.h so we need to call into it
11225 to clone the host, CPerlHost should have a c interface, sky */
11227 if (flags & CLONEf_CLONE_HOST) {
11228 return perl_clone_host(proto_perl,flags);
11230 return perl_clone_using(proto_perl, flags,
11232 proto_perl->IMemShared,
11233 proto_perl->IMemParse,
11235 proto_perl->IStdIO,
11239 proto_perl->IProc);
11243 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11244 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11245 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11246 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11247 struct IPerlDir* ipD, struct IPerlSock* ipS,
11248 struct IPerlProc* ipP)
11250 /* XXX many of the string copies here can be optimized if they're
11251 * constants; they need to be allocated as common memory and just
11252 * their pointers copied. */
11255 CLONE_PARAMS clone_params;
11256 CLONE_PARAMS* param = &clone_params;
11258 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11259 /* for each stash, determine whether its objects should be cloned */
11260 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11261 PERL_SET_THX(my_perl);
11264 Poison(my_perl, 1, PerlInterpreter);
11266 PL_curcop = (COP *)Nullop;
11270 PL_savestack_ix = 0;
11271 PL_savestack_max = -1;
11272 PL_sig_pending = 0;
11273 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11274 # else /* !DEBUGGING */
11275 Zero(my_perl, 1, PerlInterpreter);
11276 # endif /* DEBUGGING */
11278 /* host pointers */
11280 PL_MemShared = ipMS;
11281 PL_MemParse = ipMP;
11288 #else /* !PERL_IMPLICIT_SYS */
11290 CLONE_PARAMS clone_params;
11291 CLONE_PARAMS* param = &clone_params;
11292 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11293 /* for each stash, determine whether its objects should be cloned */
11294 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11295 PERL_SET_THX(my_perl);
11298 Poison(my_perl, 1, PerlInterpreter);
11300 PL_curcop = (COP *)Nullop;
11304 PL_savestack_ix = 0;
11305 PL_savestack_max = -1;
11306 PL_sig_pending = 0;
11307 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11308 # else /* !DEBUGGING */
11309 Zero(my_perl, 1, PerlInterpreter);
11310 # endif /* DEBUGGING */
11311 #endif /* PERL_IMPLICIT_SYS */
11312 param->flags = flags;
11313 param->proto_perl = proto_perl;
11316 PL_xnv_arenaroot = NULL;
11317 PL_xnv_root = NULL;
11318 PL_xpv_arenaroot = NULL;
11319 PL_xpv_root = NULL;
11320 PL_xpviv_arenaroot = NULL;
11321 PL_xpviv_root = NULL;
11322 PL_xpvnv_arenaroot = NULL;
11323 PL_xpvnv_root = NULL;
11324 PL_xpvcv_arenaroot = NULL;
11325 PL_xpvcv_root = NULL;
11326 PL_xpvav_arenaroot = NULL;
11327 PL_xpvav_root = NULL;
11328 PL_xpvhv_arenaroot = NULL;
11329 PL_xpvhv_root = NULL;
11330 PL_xpvmg_arenaroot = NULL;
11331 PL_xpvmg_root = NULL;
11332 PL_xpvgv_arenaroot = NULL;
11333 PL_xpvgv_root = NULL;
11334 PL_xpvlv_arenaroot = NULL;
11335 PL_xpvlv_root = NULL;
11336 PL_xpvbm_arenaroot = NULL;
11337 PL_xpvbm_root = NULL;
11338 PL_he_arenaroot = NULL;
11340 #if defined(USE_ITHREADS)
11341 PL_pte_arenaroot = NULL;
11342 PL_pte_root = NULL;
11344 PL_nice_chunk = NULL;
11345 PL_nice_chunk_size = 0;
11347 PL_sv_objcount = 0;
11348 PL_sv_root = Nullsv;
11349 PL_sv_arenaroot = Nullsv;
11351 PL_debug = proto_perl->Idebug;
11353 PL_hash_seed = proto_perl->Ihash_seed;
11354 PL_rehash_seed = proto_perl->Irehash_seed;
11356 #ifdef USE_REENTRANT_API
11357 /* XXX: things like -Dm will segfault here in perlio, but doing
11358 * PERL_SET_CONTEXT(proto_perl);
11359 * breaks too many other things
11361 Perl_reentrant_init(aTHX);
11364 /* create SV map for pointer relocation */
11365 PL_ptr_table = ptr_table_new();
11367 /* initialize these special pointers as early as possible */
11368 SvANY(&PL_sv_undef) = NULL;
11369 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11370 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11371 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11373 SvANY(&PL_sv_no) = new_XPVNV();
11374 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11375 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11376 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11377 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11378 SvCUR_set(&PL_sv_no, 0);
11379 SvLEN_set(&PL_sv_no, 1);
11380 SvIV_set(&PL_sv_no, 0);
11381 SvNV_set(&PL_sv_no, 0);
11382 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11384 SvANY(&PL_sv_yes) = new_XPVNV();
11385 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11386 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11387 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11388 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11389 SvCUR_set(&PL_sv_yes, 1);
11390 SvLEN_set(&PL_sv_yes, 2);
11391 SvIV_set(&PL_sv_yes, 1);
11392 SvNV_set(&PL_sv_yes, 1);
11393 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11395 /* create (a non-shared!) shared string table */
11396 PL_strtab = newHV();
11397 HvSHAREKEYS_off(PL_strtab);
11398 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11399 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11401 PL_compiling = proto_perl->Icompiling;
11403 /* These two PVs will be free'd special way so must set them same way op.c does */
11404 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11405 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11407 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11408 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11410 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11411 if (!specialWARN(PL_compiling.cop_warnings))
11412 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11413 if (!specialCopIO(PL_compiling.cop_io))
11414 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11415 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11417 /* pseudo environmental stuff */
11418 PL_origargc = proto_perl->Iorigargc;
11419 PL_origargv = proto_perl->Iorigargv;
11421 param->stashes = newAV(); /* Setup array of objects to call clone on */
11423 #ifdef PERLIO_LAYERS
11424 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11425 PerlIO_clone(aTHX_ proto_perl, param);
11428 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11429 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11430 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11431 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11432 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11433 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11436 PL_minus_c = proto_perl->Iminus_c;
11437 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11438 PL_localpatches = proto_perl->Ilocalpatches;
11439 PL_splitstr = proto_perl->Isplitstr;
11440 PL_preprocess = proto_perl->Ipreprocess;
11441 PL_minus_n = proto_perl->Iminus_n;
11442 PL_minus_p = proto_perl->Iminus_p;
11443 PL_minus_l = proto_perl->Iminus_l;
11444 PL_minus_a = proto_perl->Iminus_a;
11445 PL_minus_F = proto_perl->Iminus_F;
11446 PL_doswitches = proto_perl->Idoswitches;
11447 PL_dowarn = proto_perl->Idowarn;
11448 PL_doextract = proto_perl->Idoextract;
11449 PL_sawampersand = proto_perl->Isawampersand;
11450 PL_unsafe = proto_perl->Iunsafe;
11451 PL_inplace = SAVEPV(proto_perl->Iinplace);
11452 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11453 PL_perldb = proto_perl->Iperldb;
11454 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11455 PL_exit_flags = proto_perl->Iexit_flags;
11457 /* magical thingies */
11458 /* XXX time(&PL_basetime) when asked for? */
11459 PL_basetime = proto_perl->Ibasetime;
11460 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11462 PL_maxsysfd = proto_perl->Imaxsysfd;
11463 PL_multiline = proto_perl->Imultiline;
11464 PL_statusvalue = proto_perl->Istatusvalue;
11466 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11468 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11470 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11471 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11472 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11474 /* Clone the regex array */
11475 PL_regex_padav = newAV();
11477 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11478 SV** const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11480 av_push(PL_regex_padav,
11481 sv_dup_inc(regexen[0],param));
11482 for(i = 1; i <= len; i++) {
11483 if(SvREPADTMP(regexen[i])) {
11484 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11486 av_push(PL_regex_padav,
11488 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11489 SvIVX(regexen[i])), param)))
11494 PL_regex_pad = AvARRAY(PL_regex_padav);
11496 /* shortcuts to various I/O objects */
11497 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11498 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11499 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11500 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11501 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11502 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11504 /* shortcuts to regexp stuff */
11505 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11507 /* shortcuts to misc objects */
11508 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11510 /* shortcuts to debugging objects */
11511 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11512 PL_DBline = gv_dup(proto_perl->IDBline, param);
11513 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11514 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11515 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11516 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11517 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11518 PL_lineary = av_dup(proto_perl->Ilineary, param);
11519 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11521 /* symbol tables */
11522 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11523 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11524 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11525 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11526 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11528 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11529 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11530 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11531 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11532 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11533 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11535 PL_sub_generation = proto_perl->Isub_generation;
11537 /* funky return mechanisms */
11538 PL_forkprocess = proto_perl->Iforkprocess;
11540 /* subprocess state */
11541 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11543 /* internal state */
11544 PL_tainting = proto_perl->Itainting;
11545 PL_taint_warn = proto_perl->Itaint_warn;
11546 PL_maxo = proto_perl->Imaxo;
11547 if (proto_perl->Iop_mask)
11548 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11550 PL_op_mask = Nullch;
11551 /* PL_asserting = proto_perl->Iasserting; */
11553 /* current interpreter roots */
11554 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11555 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11556 PL_main_start = proto_perl->Imain_start;
11557 PL_eval_root = proto_perl->Ieval_root;
11558 PL_eval_start = proto_perl->Ieval_start;
11560 /* runtime control stuff */
11561 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11562 PL_copline = proto_perl->Icopline;
11564 PL_filemode = proto_perl->Ifilemode;
11565 PL_lastfd = proto_perl->Ilastfd;
11566 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11569 PL_gensym = proto_perl->Igensym;
11570 PL_preambled = proto_perl->Ipreambled;
11571 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11572 PL_laststatval = proto_perl->Ilaststatval;
11573 PL_laststype = proto_perl->Ilaststype;
11574 PL_mess_sv = Nullsv;
11576 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11578 /* interpreter atexit processing */
11579 PL_exitlistlen = proto_perl->Iexitlistlen;
11580 if (PL_exitlistlen) {
11581 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11582 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11585 PL_exitlist = (PerlExitListEntry*)NULL;
11586 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11587 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11588 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11590 PL_profiledata = NULL;
11591 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11592 /* PL_rsfp_filters entries have fake IoDIRP() */
11593 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11595 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11597 PAD_CLONE_VARS(proto_perl, param);
11599 #ifdef HAVE_INTERP_INTERN
11600 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11603 /* more statics moved here */
11604 PL_generation = proto_perl->Igeneration;
11605 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11607 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11608 PL_in_clean_all = proto_perl->Iin_clean_all;
11610 PL_uid = proto_perl->Iuid;
11611 PL_euid = proto_perl->Ieuid;
11612 PL_gid = proto_perl->Igid;
11613 PL_egid = proto_perl->Iegid;
11614 PL_nomemok = proto_perl->Inomemok;
11615 PL_an = proto_perl->Ian;
11616 PL_evalseq = proto_perl->Ievalseq;
11617 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11618 PL_origalen = proto_perl->Iorigalen;
11619 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11620 PL_osname = SAVEPV(proto_perl->Iosname);
11621 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11622 PL_sighandlerp = proto_perl->Isighandlerp;
11625 PL_runops = proto_perl->Irunops;
11627 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11630 PL_cshlen = proto_perl->Icshlen;
11631 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11634 PL_lex_state = proto_perl->Ilex_state;
11635 PL_lex_defer = proto_perl->Ilex_defer;
11636 PL_lex_expect = proto_perl->Ilex_expect;
11637 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11638 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11639 PL_lex_starts = proto_perl->Ilex_starts;
11640 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11641 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11642 PL_lex_op = proto_perl->Ilex_op;
11643 PL_lex_inpat = proto_perl->Ilex_inpat;
11644 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11645 PL_lex_brackets = proto_perl->Ilex_brackets;
11646 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11647 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11648 PL_lex_casemods = proto_perl->Ilex_casemods;
11649 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11650 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11652 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11653 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11654 PL_nexttoke = proto_perl->Inexttoke;
11656 /* XXX This is probably masking the deeper issue of why
11657 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11658 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11659 * (A little debugging with a watchpoint on it may help.)
11661 if (SvANY(proto_perl->Ilinestr)) {
11662 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11663 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11664 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11665 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11666 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11667 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11668 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11669 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11670 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11673 PL_linestr = NEWSV(65,79);
11674 sv_upgrade(PL_linestr,SVt_PVIV);
11675 sv_setpvn(PL_linestr,"",0);
11676 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11678 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11679 PL_pending_ident = proto_perl->Ipending_ident;
11680 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11682 PL_expect = proto_perl->Iexpect;
11684 PL_multi_start = proto_perl->Imulti_start;
11685 PL_multi_end = proto_perl->Imulti_end;
11686 PL_multi_open = proto_perl->Imulti_open;
11687 PL_multi_close = proto_perl->Imulti_close;
11689 PL_error_count = proto_perl->Ierror_count;
11690 PL_subline = proto_perl->Isubline;
11691 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11693 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11694 if (SvANY(proto_perl->Ilinestr)) {
11695 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11696 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11697 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11698 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11699 PL_last_lop_op = proto_perl->Ilast_lop_op;
11702 PL_last_uni = SvPVX(PL_linestr);
11703 PL_last_lop = SvPVX(PL_linestr);
11704 PL_last_lop_op = 0;
11706 PL_in_my = proto_perl->Iin_my;
11707 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11709 PL_cryptseen = proto_perl->Icryptseen;
11712 PL_hints = proto_perl->Ihints;
11714 PL_amagic_generation = proto_perl->Iamagic_generation;
11716 #ifdef USE_LOCALE_COLLATE
11717 PL_collation_ix = proto_perl->Icollation_ix;
11718 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11719 PL_collation_standard = proto_perl->Icollation_standard;
11720 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11721 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11722 #endif /* USE_LOCALE_COLLATE */
11724 #ifdef USE_LOCALE_NUMERIC
11725 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11726 PL_numeric_standard = proto_perl->Inumeric_standard;
11727 PL_numeric_local = proto_perl->Inumeric_local;
11728 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11729 #endif /* !USE_LOCALE_NUMERIC */
11731 /* utf8 character classes */
11732 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11733 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11734 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11735 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11736 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11737 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11738 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11739 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11740 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11741 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11742 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11743 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11744 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11745 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11746 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11747 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11748 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11749 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11750 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11751 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11753 /* Did the locale setup indicate UTF-8? */
11754 PL_utf8locale = proto_perl->Iutf8locale;
11755 /* Unicode features (see perlrun/-C) */
11756 PL_unicode = proto_perl->Iunicode;
11758 /* Pre-5.8 signals control */
11759 PL_signals = proto_perl->Isignals;
11761 /* times() ticks per second */
11762 PL_clocktick = proto_perl->Iclocktick;
11764 /* Recursion stopper for PerlIO_find_layer */
11765 PL_in_load_module = proto_perl->Iin_load_module;
11767 /* sort() routine */
11768 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11770 /* Not really needed/useful since the reenrant_retint is "volatile",
11771 * but do it for consistency's sake. */
11772 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11774 /* Hooks to shared SVs and locks. */
11775 PL_sharehook = proto_perl->Isharehook;
11776 PL_lockhook = proto_perl->Ilockhook;
11777 PL_unlockhook = proto_perl->Iunlockhook;
11778 PL_threadhook = proto_perl->Ithreadhook;
11780 PL_runops_std = proto_perl->Irunops_std;
11781 PL_runops_dbg = proto_perl->Irunops_dbg;
11783 #ifdef THREADS_HAVE_PIDS
11784 PL_ppid = proto_perl->Ippid;
11788 PL_last_swash_hv = Nullhv; /* reinits on demand */
11789 PL_last_swash_klen = 0;
11790 PL_last_swash_key[0]= '\0';
11791 PL_last_swash_tmps = (U8*)NULL;
11792 PL_last_swash_slen = 0;
11794 PL_glob_index = proto_perl->Iglob_index;
11795 PL_srand_called = proto_perl->Isrand_called;
11796 PL_uudmap['M'] = 0; /* reinits on demand */
11797 PL_bitcount = Nullch; /* reinits on demand */
11799 if (proto_perl->Ipsig_pend) {
11800 Newz(0, PL_psig_pend, SIG_SIZE, int);
11803 PL_psig_pend = (int*)NULL;
11806 if (proto_perl->Ipsig_ptr) {
11807 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11808 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11809 for (i = 1; i < SIG_SIZE; i++) {
11810 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11811 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11815 PL_psig_ptr = (SV**)NULL;
11816 PL_psig_name = (SV**)NULL;
11819 /* thrdvar.h stuff */
11821 if (flags & CLONEf_COPY_STACKS) {
11822 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11823 PL_tmps_ix = proto_perl->Ttmps_ix;
11824 PL_tmps_max = proto_perl->Ttmps_max;
11825 PL_tmps_floor = proto_perl->Ttmps_floor;
11826 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11828 while (i <= PL_tmps_ix) {
11829 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11833 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11834 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11835 Newz(54, PL_markstack, i, I32);
11836 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11837 - proto_perl->Tmarkstack);
11838 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11839 - proto_perl->Tmarkstack);
11840 Copy(proto_perl->Tmarkstack, PL_markstack,
11841 PL_markstack_ptr - PL_markstack + 1, I32);
11843 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11844 * NOTE: unlike the others! */
11845 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11846 PL_scopestack_max = proto_perl->Tscopestack_max;
11847 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11848 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11850 /* NOTE: si_dup() looks at PL_markstack */
11851 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11853 /* PL_curstack = PL_curstackinfo->si_stack; */
11854 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11855 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11857 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11858 PL_stack_base = AvARRAY(PL_curstack);
11859 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11860 - proto_perl->Tstack_base);
11861 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11863 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11864 * NOTE: unlike the others! */
11865 PL_savestack_ix = proto_perl->Tsavestack_ix;
11866 PL_savestack_max = proto_perl->Tsavestack_max;
11867 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11868 PL_savestack = ss_dup(proto_perl, param);
11872 ENTER; /* perl_destruct() wants to LEAVE; */
11875 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11876 PL_top_env = &PL_start_env;
11878 PL_op = proto_perl->Top;
11881 PL_Xpv = (XPV*)NULL;
11882 PL_na = proto_perl->Tna;
11884 PL_statbuf = proto_perl->Tstatbuf;
11885 PL_statcache = proto_perl->Tstatcache;
11886 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11887 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11889 PL_timesbuf = proto_perl->Ttimesbuf;
11892 PL_tainted = proto_perl->Ttainted;
11893 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11894 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11895 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11896 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11897 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11898 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11899 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11900 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11901 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11903 PL_restartop = proto_perl->Trestartop;
11904 PL_in_eval = proto_perl->Tin_eval;
11905 PL_delaymagic = proto_perl->Tdelaymagic;
11906 PL_dirty = proto_perl->Tdirty;
11907 PL_localizing = proto_perl->Tlocalizing;
11909 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11910 PL_hv_fetch_ent_mh = Nullhe;
11911 PL_modcount = proto_perl->Tmodcount;
11912 PL_lastgotoprobe = Nullop;
11913 PL_dumpindent = proto_perl->Tdumpindent;
11915 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11916 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11917 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11918 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11919 PL_sortcxix = proto_perl->Tsortcxix;
11920 PL_efloatbuf = Nullch; /* reinits on demand */
11921 PL_efloatsize = 0; /* reinits on demand */
11925 PL_screamfirst = NULL;
11926 PL_screamnext = NULL;
11927 PL_maxscream = -1; /* reinits on demand */
11928 PL_lastscream = Nullsv;
11930 PL_watchaddr = NULL;
11931 PL_watchok = Nullch;
11933 PL_regdummy = proto_perl->Tregdummy;
11934 PL_regprecomp = Nullch;
11937 PL_colorset = 0; /* reinits PL_colors[] */
11938 /*PL_colors[6] = {0,0,0,0,0,0};*/
11939 PL_reginput = Nullch;
11940 PL_regbol = Nullch;
11941 PL_regeol = Nullch;
11942 PL_regstartp = (I32*)NULL;
11943 PL_regendp = (I32*)NULL;
11944 PL_reglastparen = (U32*)NULL;
11945 PL_reglastcloseparen = (U32*)NULL;
11946 PL_regtill = Nullch;
11947 PL_reg_start_tmp = (char**)NULL;
11948 PL_reg_start_tmpl = 0;
11949 PL_regdata = (struct reg_data*)NULL;
11952 PL_reg_eval_set = 0;
11954 PL_regprogram = (regnode*)NULL;
11956 PL_regcc = (CURCUR*)NULL;
11957 PL_reg_call_cc = (struct re_cc_state*)NULL;
11958 PL_reg_re = (regexp*)NULL;
11959 PL_reg_ganch = Nullch;
11960 PL_reg_sv = Nullsv;
11961 PL_reg_match_utf8 = FALSE;
11962 PL_reg_magic = (MAGIC*)NULL;
11964 PL_reg_oldcurpm = (PMOP*)NULL;
11965 PL_reg_curpm = (PMOP*)NULL;
11966 PL_reg_oldsaved = Nullch;
11967 PL_reg_oldsavedlen = 0;
11968 #ifdef PERL_OLD_COPY_ON_WRITE
11971 PL_reg_maxiter = 0;
11972 PL_reg_leftiter = 0;
11973 PL_reg_poscache = Nullch;
11974 PL_reg_poscache_size= 0;
11976 /* RE engine - function pointers */
11977 PL_regcompp = proto_perl->Tregcompp;
11978 PL_regexecp = proto_perl->Tregexecp;
11979 PL_regint_start = proto_perl->Tregint_start;
11980 PL_regint_string = proto_perl->Tregint_string;
11981 PL_regfree = proto_perl->Tregfree;
11983 PL_reginterp_cnt = 0;
11984 PL_reg_starttry = 0;
11986 /* Pluggable optimizer */
11987 PL_peepp = proto_perl->Tpeepp;
11989 PL_stashcache = newHV();
11991 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11992 ptr_table_free(PL_ptr_table);
11993 PL_ptr_table = NULL;
11996 /* Call the ->CLONE method, if it exists, for each of the stashes
11997 identified by sv_dup() above.
11999 while(av_len(param->stashes) != -1) {
12000 HV* const stash = (HV*) av_shift(param->stashes);
12001 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12002 if (cloner && GvCV(cloner)) {
12007 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
12009 call_sv((SV*)GvCV(cloner), G_DISCARD);
12015 SvREFCNT_dec(param->stashes);
12017 /* orphaned? eg threads->new inside BEGIN or use */
12018 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12019 (void)SvREFCNT_inc(PL_compcv);
12020 SAVEFREESV(PL_compcv);
12026 #endif /* USE_ITHREADS */
12029 =head1 Unicode Support
12031 =for apidoc sv_recode_to_utf8
12033 The encoding is assumed to be an Encode object, on entry the PV
12034 of the sv is assumed to be octets in that encoding, and the sv
12035 will be converted into Unicode (and UTF-8).
12037 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12038 is not a reference, nothing is done to the sv. If the encoding is not
12039 an C<Encode::XS> Encoding object, bad things will happen.
12040 (See F<lib/encoding.pm> and L<Encode>).
12042 The PV of the sv is returned.
12047 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12050 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12064 Passing sv_yes is wrong - it needs to be or'ed set of constants
12065 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12066 remove converted chars from source.
12068 Both will default the value - let them.
12070 XPUSHs(&PL_sv_yes);
12073 call_method("decode", G_SCALAR);
12077 s = SvPV_const(uni, len);
12078 if (s != SvPVX_const(sv)) {
12079 SvGROW(sv, len + 1);
12080 Move(s, SvPVX(sv), len + 1, char);
12081 SvCUR_set(sv, len);
12088 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12092 =for apidoc sv_cat_decode
12094 The encoding is assumed to be an Encode object, the PV of the ssv is
12095 assumed to be octets in that encoding and decoding the input starts
12096 from the position which (PV + *offset) pointed to. The dsv will be
12097 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12098 when the string tstr appears in decoding output or the input ends on
12099 the PV of the ssv. The value which the offset points will be modified
12100 to the last input position on the ssv.
12102 Returns TRUE if the terminator was found, else returns FALSE.
12107 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12108 SV *ssv, int *offset, char *tstr, int tlen)
12112 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12123 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12124 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12126 call_method("cat_decode", G_SCALAR);
12128 ret = SvTRUE(TOPs);
12129 *offset = SvIV(offsv);
12135 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12141 * c-indentation-style: bsd
12142 * c-basic-offset: 4
12143 * indent-tabs-mode: t
12146 * ex: set ts=8 sts=4 sw=4 noet: