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)) {
290 SV *svend = &sva[SvREFCNT(sva)];
291 if (p >= sv && p < svend) {
297 if (ckWARN_d(WARN_INTERNAL))
298 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
299 "Attempt to free non-arena SV: 0x%"UVxf
300 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
307 #else /* ! DEBUGGING */
309 #define del_SV(p) plant_SV(p)
311 #endif /* DEBUGGING */
315 =head1 SV Manipulation Functions
317 =for apidoc sv_add_arena
319 Given a chunk of memory, link it to the head of the list of arenas,
320 and split it into a list of free SVs.
326 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
332 /* The first SV in an arena isn't an SV. */
333 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
334 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
335 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
337 PL_sv_arenaroot = sva;
338 PL_sv_root = sva + 1;
340 svend = &sva[SvREFCNT(sva) - 1];
343 SvANY(sv) = (void *)(SV*)(sv + 1);
347 /* Must always set typemask because it's awlays checked in on cleanup
348 when the arenas are walked looking for objects. */
349 SvFLAGS(sv) = SVTYPEMASK;
356 SvFLAGS(sv) = SVTYPEMASK;
359 /* visit(): call the named function for each non-free SV in the arenas
360 * whose flags field matches the flags/mask args. */
363 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
368 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
369 register SV * const svend = &sva[SvREFCNT(sva)];
371 for (sv = sva + 1; sv < svend; ++sv) {
372 if (SvTYPE(sv) != SVTYPEMASK
373 && (sv->sv_flags & mask) == flags
386 /* called by sv_report_used() for each live SV */
389 do_report_used(pTHX_ SV *sv)
391 if (SvTYPE(sv) != SVTYPEMASK) {
392 PerlIO_printf(Perl_debug_log, "****\n");
399 =for apidoc sv_report_used
401 Dump the contents of all SVs not yet freed. (Debugging aid).
407 Perl_sv_report_used(pTHX)
410 visit(do_report_used, 0, 0);
414 /* called by sv_clean_objs() for each live SV */
417 do_clean_objs(pTHX_ SV *sv)
421 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
422 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
434 /* XXX Might want to check arrays, etc. */
437 /* called by sv_clean_objs() for each live SV */
439 #ifndef DISABLE_DESTRUCTOR_KLUDGE
441 do_clean_named_objs(pTHX_ SV *sv)
443 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
444 if ( SvOBJECT(GvSV(sv)) ||
445 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
446 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
447 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
448 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
450 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
451 SvFLAGS(sv) |= SVf_BREAK;
459 =for apidoc sv_clean_objs
461 Attempt to destroy all objects not yet freed
467 Perl_sv_clean_objs(pTHX)
469 PL_in_clean_objs = TRUE;
470 visit(do_clean_objs, SVf_ROK, SVf_ROK);
471 #ifndef DISABLE_DESTRUCTOR_KLUDGE
472 /* some barnacles may yet remain, clinging to typeglobs */
473 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
475 PL_in_clean_objs = FALSE;
478 /* called by sv_clean_all() for each live SV */
481 do_clean_all(pTHX_ SV *sv)
483 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
484 SvFLAGS(sv) |= SVf_BREAK;
485 if (PL_comppad == (AV*)sv) {
487 PL_curpad = Null(SV**);
493 =for apidoc sv_clean_all
495 Decrement the refcnt of each remaining SV, possibly triggering a
496 cleanup. This function may have to be called multiple times to free
497 SVs which are in complex self-referential hierarchies.
503 Perl_sv_clean_all(pTHX)
506 PL_in_clean_all = TRUE;
507 cleaned = visit(do_clean_all, 0,0);
508 PL_in_clean_all = FALSE;
513 =for apidoc sv_free_arenas
515 Deallocate the memory used by all arenas. Note that all the individual SV
516 heads and bodies within the arenas must already have been freed.
522 Perl_sv_free_arenas(pTHX)
526 void *arena, *arenanext;
528 void **arenaroots[] = {
529 (void**) &PL_xnv_arenaroot,
530 (void**) &PL_xpv_arenaroot,
531 (void**) &PL_xpviv_arenaroot,
532 (void**) &PL_xpvnv_arenaroot,
533 (void**) &PL_xpvcv_arenaroot,
534 (void**) &PL_xpvav_arenaroot,
535 (void**) &PL_xpvhv_arenaroot,
536 (void**) &PL_xpvmg_arenaroot,
537 (void**) &PL_xpvgv_arenaroot,
538 (void**) &PL_xpvlv_arenaroot,
539 (void**) &PL_xpvbm_arenaroot,
540 (void**) &PL_he_arenaroot,
541 #if defined(USE_ITHREADS)
542 (void**) &PL_pte_arenaroot,
547 (void**) &PL_xnv_root,
548 (void**) &PL_xpv_root,
549 (void**) &PL_xpviv_root,
550 (void**) &PL_xpvnv_root,
551 (void**) &PL_xpvcv_root,
552 (void**) &PL_xpvav_root,
553 (void**) &PL_xpvhv_root,
554 (void**) &PL_xpvmg_root,
555 (void**) &PL_xpvgv_root,
556 (void**) &PL_xpvlv_root,
557 (void**) &PL_xpvbm_root,
558 (void**) &PL_he_root,
559 #if defined(USE_ITHREADS)
560 (void**) &PL_pte_root,
565 /* Free arenas here, but be careful about fake ones. (We assume
566 contiguity of the fake ones with the corresponding real ones.) */
568 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
569 svanext = (SV*) SvANY(sva);
570 while (svanext && SvFAKE(svanext))
571 svanext = (SV*) SvANY(svanext);
577 assert(sizeof(arenaroots) == sizeof(roots));
579 for (i=0; arenaroots[i]; i++) {
581 arena = *arenaroots[i];
582 for (; arena; arena = arenanext) {
583 arenanext = *(void **)arena;
591 Safefree(PL_nice_chunk);
592 PL_nice_chunk = Nullch;
593 PL_nice_chunk_size = 0;
598 /* ---------------------------------------------------------------------
600 * support functions for report_uninit()
603 /* the maxiumum size of array or hash where we will scan looking
604 * for the undefined element that triggered the warning */
606 #define FUV_MAX_SEARCH_SIZE 1000
608 /* Look for an entry in the hash whose value has the same SV as val;
609 * If so, return a mortal copy of the key. */
612 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
618 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
619 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
624 for (i=HvMAX(hv); i>0; i--) {
626 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
627 if (HeVAL(entry) != val)
629 if ( HeVAL(entry) == &PL_sv_undef ||
630 HeVAL(entry) == &PL_sv_placeholder)
634 if (HeKLEN(entry) == HEf_SVKEY)
635 return sv_mortalcopy(HeKEY_sv(entry));
636 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
642 /* Look for an entry in the array whose value has the same SV as val;
643 * If so, return the index, otherwise return -1. */
646 S_find_array_subscript(pTHX_ AV *av, SV* val)
650 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
651 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
655 for (i=AvFILLp(av); i>=0; i--) {
656 if (svp[i] == val && svp[i] != &PL_sv_undef)
662 /* S_varname(): return the name of a variable, optionally with a subscript.
663 * If gv is non-zero, use the name of that global, along with gvtype (one
664 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
665 * targ. Depending on the value of the subscript_type flag, return:
668 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
669 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
670 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
671 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
674 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
675 SV* keyname, I32 aindex, int subscript_type)
680 SV * const name = sv_newmortal();
683 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
684 * XXX get rid of all this if gv_fullnameX() ever supports this
688 HV *hv = GvSTASH(gv);
689 sv_setpv(name, gvtype);
692 else if (!(p=HvNAME_get(hv)))
694 if (strNE(p, "main")) {
696 sv_catpvn(name,"::", 2);
698 if (GvNAMELEN(gv)>= 1 &&
699 ((unsigned int)*GvNAME(gv)) <= 26)
701 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
702 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
705 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
709 CV *cv = find_runcv(&u);
710 if (!cv || !CvPADLIST(cv))
712 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
713 sv = *av_fetch(av, targ, FALSE);
714 /* SvLEN in a pad name is not to be trusted */
715 sv_setpv(name, SvPV_nolen_const(sv));
718 if (subscript_type == FUV_SUBSCRIPT_HASH) {
721 Perl_sv_catpvf(aTHX_ name, "{%s}",
722 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
725 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
727 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
729 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
730 sv_insert(name, 0, 0, "within ", 7);
737 =for apidoc find_uninit_var
739 Find the name of the undefined variable (if any) that caused the operator o
740 to issue a "Use of uninitialized value" warning.
741 If match is true, only return a name if it's value matches uninit_sv.
742 So roughly speaking, if a unary operator (such as OP_COS) generates a
743 warning, then following the direct child of the op may yield an
744 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
745 other hand, with OP_ADD there are two branches to follow, so we only print
746 the variable name if we get an exact match.
748 The name is returned as a mortal SV.
750 Assumes that PL_op is the op that originally triggered the error, and that
751 PL_comppad/PL_curpad points to the currently executing pad.
757 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
766 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
767 uninit_sv == &PL_sv_placeholder)))
770 switch (obase->op_type) {
777 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
778 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
781 int subscript_type = FUV_SUBSCRIPT_WITHIN;
783 if (pad) { /* @lex, %lex */
784 sv = PAD_SVl(obase->op_targ);
788 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
789 /* @global, %global */
790 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
793 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
795 else /* @{expr}, %{expr} */
796 return find_uninit_var(cUNOPx(obase)->op_first,
800 /* attempt to find a match within the aggregate */
802 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
804 subscript_type = FUV_SUBSCRIPT_HASH;
807 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
809 subscript_type = FUV_SUBSCRIPT_ARRAY;
812 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
815 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
816 keysv, index, subscript_type);
820 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
822 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
823 Nullsv, 0, FUV_SUBSCRIPT_NONE);
826 gv = cGVOPx_gv(obase);
827 if (!gv || (match && GvSV(gv) != uninit_sv))
829 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
832 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
834 av = (AV*)PAD_SV(obase->op_targ);
835 if (!av || SvRMAGICAL(av))
837 svp = av_fetch(av, (I32)obase->op_private, FALSE);
838 if (!svp || *svp != uninit_sv)
841 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
842 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
845 gv = cGVOPx_gv(obase);
850 if (!av || SvRMAGICAL(av))
852 svp = av_fetch(av, (I32)obase->op_private, FALSE);
853 if (!svp || *svp != uninit_sv)
856 return S_varname(aTHX_ gv, "$", 0,
857 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
862 o = cUNOPx(obase)->op_first;
863 if (!o || o->op_type != OP_NULL ||
864 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
866 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
871 /* $a[uninit_expr] or $h{uninit_expr} */
872 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
875 o = cBINOPx(obase)->op_first;
876 kid = cBINOPx(obase)->op_last;
878 /* get the av or hv, and optionally the gv */
880 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
881 sv = PAD_SV(o->op_targ);
883 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
884 && cUNOPo->op_first->op_type == OP_GV)
886 gv = cGVOPx_gv(cUNOPo->op_first);
889 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
894 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
895 /* index is constant */
899 if (obase->op_type == OP_HELEM) {
900 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
901 if (!he || HeVAL(he) != uninit_sv)
905 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
906 if (!svp || *svp != uninit_sv)
910 if (obase->op_type == OP_HELEM)
911 return S_varname(aTHX_ gv, "%", o->op_targ,
912 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
914 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
915 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
919 /* index is an expression;
920 * attempt to find a match within the aggregate */
921 if (obase->op_type == OP_HELEM) {
922 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
924 return S_varname(aTHX_ gv, "%", o->op_targ,
925 keysv, 0, FUV_SUBSCRIPT_HASH);
928 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
930 return S_varname(aTHX_ gv, "@", o->op_targ,
931 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
935 return S_varname(aTHX_ gv,
936 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
938 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
944 /* only examine RHS */
945 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
948 o = cUNOPx(obase)->op_first;
949 if (o->op_type == OP_PUSHMARK)
952 if (!o->op_sibling) {
953 /* one-arg version of open is highly magical */
955 if (o->op_type == OP_GV) { /* open FOO; */
957 if (match && GvSV(gv) != uninit_sv)
959 return S_varname(aTHX_ gv, "$", 0,
960 Nullsv, 0, FUV_SUBSCRIPT_NONE);
962 /* other possibilities not handled are:
963 * open $x; or open my $x; should return '${*$x}'
964 * open expr; should return '$'.expr ideally
970 /* ops where $_ may be an implicit arg */
974 if ( !(obase->op_flags & OPf_STACKED)) {
975 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
976 ? PAD_SVl(obase->op_targ)
980 sv_setpvn(sv, "$_", 2);
988 /* skip filehandle as it can't produce 'undef' warning */
989 o = cUNOPx(obase)->op_first;
990 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
991 o = o->op_sibling->op_sibling;
998 match = 1; /* XS or custom code could trigger random warnings */
1003 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1004 return sv_2mortal(newSVpv("${$/}", 0));
1009 if (!(obase->op_flags & OPf_KIDS))
1011 o = cUNOPx(obase)->op_first;
1017 /* if all except one arg are constant, or have no side-effects,
1018 * or are optimized away, then it's unambiguous */
1020 for (kid=o; kid; kid = kid->op_sibling) {
1022 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1023 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1024 || (kid->op_type == OP_PUSHMARK)
1028 if (o2) { /* more than one found */
1035 return find_uninit_var(o2, uninit_sv, match);
1039 sv = find_uninit_var(o, uninit_sv, 1);
1051 =for apidoc report_uninit
1053 Print appropriate "Use of uninitialized variable" warning
1059 Perl_report_uninit(pTHX_ SV* uninit_sv)
1062 SV* varname = Nullsv;
1064 varname = find_uninit_var(PL_op, uninit_sv,0);
1066 sv_insert(varname, 0, 0, " ", 1);
1068 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1069 varname ? SvPV_nolen_const(varname) : "",
1070 " in ", OP_DESC(PL_op));
1073 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1078 S_more_bodies (pTHX_ void **arena_root, void **root, size_t size)
1082 size_t count = PERL_ARENA_SIZE/size;
1083 New(0, start, count*size, char);
1084 *((void **) start) = *arena_root;
1085 *arena_root = (void *)start;
1087 end = start + (count-1) * size;
1089 /* The initial slot is used to link the arenas together, so it isn't to be
1090 linked into the list of ready-to-use bodies. */
1094 *root = (void *)start;
1096 while (start < end) {
1097 char *next = start + size;
1098 *(void**) start = (void *)next;
1101 *(void **)start = 0;
1106 /* grab a new thing from the free list, allocating more if necessary */
1109 S_new_body(pTHX_ void **arena_root, void **root, size_t size, size_t offset)
1113 xpv = *root ? *root : S_more_bodies(aTHX_ arena_root, root, size);
1114 *root = *(void**)xpv;
1116 return (void*)((char*)xpv - offset);
1119 /* return a thing to the free list */
1122 S_del_body(pTHX_ void *thing, void **root, size_t offset)
1124 void **real_thing = (void**)((char *)thing + offset);
1126 *real_thing = *root;
1127 *root = (void*)real_thing;
1131 /* Conventionally we simply malloc() a big block of memory, then divide it
1132 up into lots of the thing that we're allocating.
1134 This macro will expand to call to S_new_body. So for XPVBM (with ithreads),
1137 S_new_body(my_perl, (void**)&(my_perl->Ixpvbm_arenaroot),
1138 (void**)&(my_perl->Ixpvbm_root), sizeof(XPVBM), 0)
1141 #define new_body(TYPE,lctype) \
1142 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1143 (void**)&PL_ ## lctype ## _root, \
1147 /* But for some types, we cheat. The type starts with some members that are
1148 never accessed. So we allocate the substructure, starting at the first used
1149 member, then adjust the pointer back in memory by the size of the bit not
1150 allocated, so it's as if we allocated the full structure.
1151 (But things will all go boom if you write to the part that is "not there",
1152 because you'll be overwriting the last members of the preceding structure
1155 We calculate the correction using the STRUCT_OFFSET macro. For example, if
1156 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
1157 and the pointer is unchanged. If the allocated structure is smaller (no
1158 initial NV actually allocated) then the net effect is to subtract the size
1159 of the NV from the pointer, to return a new pointer as if an initial NV were
1162 This is the same trick as was used for NV and IV bodies. Ironically it
1163 doesn't need to be used for NV bodies any more, because NV is now at the
1164 start of the structure. IV bodies don't need it either, because they are
1165 no longer allocated. */
1167 #define new_body_allocated(TYPE,lctype,member) \
1168 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1169 (void**)&PL_ ## lctype ## _root, \
1170 sizeof(lctype ## _allocated), \
1171 STRUCT_OFFSET(TYPE, member) \
1172 - STRUCT_OFFSET(lctype ## _allocated, member))
1175 #define del_body(p,TYPE,lctype) \
1176 S_del_body(aTHX_ (void*)p, (void**)&PL_ ## lctype ## _root, 0)
1178 #define del_body_allocated(p,TYPE,lctype,member) \
1179 S_del_body(aTHX_ (void*)p, (void**)&PL_ ## lctype ## _root, \
1180 STRUCT_OFFSET(TYPE, member) \
1181 - STRUCT_OFFSET(lctype ## _allocated, member))
1183 #define my_safemalloc(s) (void*)safemalloc(s)
1184 #define my_safefree(p) safefree((char*)p)
1188 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1189 #define del_XNV(p) my_safefree(p)
1191 #define new_XPV() my_safemalloc(sizeof(XPV))
1192 #define del_XPV(p) my_safefree(p)
1194 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1195 #define del_XPVIV(p) my_safefree(p)
1197 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1198 #define del_XPVNV(p) my_safefree(p)
1200 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1201 #define del_XPVCV(p) my_safefree(p)
1203 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1204 #define del_XPVAV(p) my_safefree(p)
1206 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1207 #define del_XPVHV(p) my_safefree(p)
1209 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1210 #define del_XPVMG(p) my_safefree(p)
1212 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1213 #define del_XPVGV(p) my_safefree(p)
1215 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1216 #define del_XPVLV(p) my_safefree(p)
1218 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1219 #define del_XPVBM(p) my_safefree(p)
1223 #define new_XNV() new_body(NV, xnv)
1224 #define del_XNV(p) del_body(p, NV, xnv)
1226 #define new_XPV() new_body_allocated(XPV, xpv, xpv_cur)
1227 #define del_XPV(p) del_body_allocated(p, XPV, xpv, xpv_cur)
1229 #define new_XPVIV() new_body_allocated(XPVIV, xpviv, xpv_cur)
1230 #define del_XPVIV(p) del_body_allocated(p, XPVIV, xpviv, xpv_cur)
1232 #define new_XPVNV() new_body(XPVNV, xpvnv)
1233 #define del_XPVNV(p) del_body(p, XPVNV, xpvnv)
1235 #define new_XPVCV() new_body(XPVCV, xpvcv)
1236 #define del_XPVCV(p) del_body(p, XPVCV, xpvcv)
1238 #define new_XPVAV() new_body_allocated(XPVAV, xpvav, xav_fill)
1239 #define del_XPVAV(p) del_body_allocated(p, XPVAV, xpvav, xav_fill)
1241 #define new_XPVHV() new_body_allocated(XPVHV, xpvhv, xhv_fill)
1242 #define del_XPVHV(p) del_body_allocated(p, XPVHV, xpvhv, xhv_fill)
1244 #define new_XPVMG() new_body(XPVMG, xpvmg)
1245 #define del_XPVMG(p) del_body(p, XPVMG, xpvmg)
1247 #define new_XPVGV() new_body(XPVGV, xpvgv)
1248 #define del_XPVGV(p) del_body(p, XPVGV, xpvgv)
1250 #define new_XPVLV() new_body(XPVLV, xpvlv)
1251 #define del_XPVLV(p) del_body(p, XPVLV, xpvlv)
1253 #define new_XPVBM() new_body(XPVBM, xpvbm)
1254 #define del_XPVBM(p) del_body(p, XPVBM, xpvbm)
1258 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1259 #define del_XPVFM(p) my_safefree(p)
1261 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1262 #define del_XPVIO(p) my_safefree(p)
1265 =for apidoc sv_upgrade
1267 Upgrade an SV to a more complex form. Generally adds a new body type to the
1268 SV, then copies across as much information as possible from the old body.
1269 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1275 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1277 void** old_body_arena;
1278 size_t old_body_offset;
1279 size_t old_body_length; /* Well, the length to copy. */
1281 bool zero_nv = TRUE;
1283 size_t new_body_length;
1284 size_t new_body_offset;
1285 void** new_body_arena;
1286 void** new_body_arenaroot;
1287 U32 old_type = SvTYPE(sv);
1289 if (mt != SVt_PV && SvIsCOW(sv)) {
1290 sv_force_normal_flags(sv, 0);
1293 if (SvTYPE(sv) == mt)
1296 if (SvTYPE(sv) > mt)
1297 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1298 (int)SvTYPE(sv), (int)mt);
1301 old_body = SvANY(sv);
1303 old_body_offset = 0;
1304 old_body_length = 0;
1305 new_body_offset = 0;
1306 new_body_length = ~0;
1308 /* Copying structures onto other structures that have been neatly zeroed
1309 has a subtle gotcha. Consider XPVMG
1311 +------+------+------+------+------+-------+-------+
1312 | NV | CUR | LEN | IV | MAGIC | STASH |
1313 +------+------+------+------+------+-------+-------+
1314 0 4 8 12 16 20 24 28
1316 where NVs are aligned to 8 bytes, so that sizeof that structure is
1317 actually 32 bytes long, with 4 bytes of padding at the end:
1319 +------+------+------+------+------+-------+-------+------+
1320 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1321 +------+------+------+------+------+-------+-------+------+
1322 0 4 8 12 16 20 24 28 32
1324 so what happens if you allocate memory for this structure:
1326 +------+------+------+------+------+-------+-------+------+------+...
1327 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1328 +------+------+------+------+------+-------+-------+------+------+...
1329 0 4 8 12 16 20 24 28 32 36
1331 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1332 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1333 started out as zero once, but it's quite possible that it isn't. So now,
1334 rather than a nicely zeroed GP, you have it pointing somewhere random.
1337 (In fact, GP ends up pointing at a previous GP structure, because the
1338 principle cause of the padding in XPVMG getting garbage is a copy of
1339 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1341 So we are careful and work out the size of used parts of all the
1344 switch (SvTYPE(sv)) {
1350 else if (mt < SVt_PVIV)
1352 old_body_offset = STRUCT_OFFSET(XPVIV, xiv_iv);
1353 old_body_length = sizeof(IV);
1356 old_body_arena = (void **) &PL_xnv_root;
1357 old_body_length = sizeof(NV);
1366 old_body_arena = (void **) &PL_xpv_root;
1367 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1368 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1369 old_body_length = STRUCT_OFFSET(XPV, xpv_len)
1370 + sizeof (((XPV*)SvANY(sv))->xpv_len)
1374 else if (mt == SVt_NV)
1378 old_body_arena = (void **) &PL_xpviv_root;
1379 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1380 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1381 old_body_length = STRUCT_OFFSET(XPVIV, xiv_u)
1382 + sizeof (((XPVIV*)SvANY(sv))->xiv_u)
1386 old_body_arena = (void **) &PL_xpvnv_root;
1387 old_body_length = STRUCT_OFFSET(XPVNV, xiv_u)
1388 + sizeof (((XPVNV*)SvANY(sv))->xiv_u);
1392 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1393 there's no way that it can be safely upgraded, because perl.c
1394 expects to Safefree(SvANY(PL_mess_sv)) */
1395 assert(sv != PL_mess_sv);
1396 /* This flag bit is used to mean other things in other scalar types.
1397 Given that it only has meaning inside the pad, it shouldn't be set
1398 on anything that can get upgraded. */
1399 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1400 old_body_arena = (void **) &PL_xpvmg_root;
1401 old_body_length = STRUCT_OFFSET(XPVMG, xmg_stash)
1402 + sizeof (((XPVMG*)SvANY(sv))->xmg_stash);
1406 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1409 SvFLAGS(sv) &= ~SVTYPEMASK;
1414 Perl_croak(aTHX_ "Can't upgrade to undef");
1416 assert(old_type == SVt_NULL);
1417 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1421 assert(old_type == SVt_NULL);
1422 SvANY(sv) = new_XNV();
1426 assert(old_type == SVt_NULL);
1427 SvANY(sv) = &sv->sv_u.svu_rv;
1431 SvANY(sv) = new_XPVHV();
1434 HvTOTALKEYS(sv) = 0;
1439 SvANY(sv) = new_XPVAV();
1446 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1447 The target created by newSVrv also is, and it can have magic.
1448 However, it never has SvPVX set.
1450 if (old_type >= SVt_RV) {
1451 assert(SvPVX_const(sv) == 0);
1454 /* Could put this in the else clause below, as PVMG must have SvPVX
1455 0 already (the assertion above) */
1456 SvPV_set(sv, (char*)0);
1458 if (old_type >= SVt_PVMG) {
1459 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1460 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1468 new_body = new_XPVIO();
1469 new_body_length = sizeof(XPVIO);
1472 new_body = new_XPVFM();
1473 new_body_length = sizeof(XPVFM);
1477 new_body_length = sizeof(XPVBM);
1478 new_body_arena = (void **) &PL_xpvbm_root;
1479 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
1482 new_body_length = sizeof(XPVGV);
1483 new_body_arena = (void **) &PL_xpvgv_root;
1484 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
1487 new_body_length = sizeof(XPVCV);
1488 new_body_arena = (void **) &PL_xpvcv_root;
1489 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
1492 new_body_length = sizeof(XPVLV);
1493 new_body_arena = (void **) &PL_xpvlv_root;
1494 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
1497 new_body_length = sizeof(XPVMG);
1498 new_body_arena = (void **) &PL_xpvmg_root;
1499 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
1502 new_body_length = sizeof(XPVNV);
1503 new_body_arena = (void **) &PL_xpvnv_root;
1504 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
1507 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1508 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1509 new_body_length = sizeof(XPVIV) - new_body_offset;
1510 new_body_arena = (void **) &PL_xpviv_root;
1511 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
1512 /* XXX Is this still needed? Was it ever needed? Surely as there is
1513 no route from NV to PVIV, NOK can never be true */
1517 goto new_body_no_NV;
1519 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1520 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1521 new_body_length = sizeof(XPV) - new_body_offset;
1522 new_body_arena = (void **) &PL_xpv_root;
1523 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
1525 /* PV and PVIV don't have an NV slot. */
1530 assert(new_body_length);
1532 new_body = S_new_body(aTHX_ new_body_arenaroot, new_body_arena,
1533 new_body_length, new_body_offset);
1535 /* We always allocated the full length item with PURIFY */
1536 new_body_length += new_body_offset;
1537 new_body_offset = 0;
1538 new_body = my_safemalloc(new_body_length);
1542 Zero(((char *)new_body) + new_body_offset, new_body_length, char);
1543 SvANY(sv) = new_body;
1545 if (old_body_length) {
1546 Copy((char *)old_body + old_body_offset,
1547 (char *)new_body + old_body_offset,
1548 old_body_length, char);
1551 /* FIXME - add a Configure test to determine if NV 0.0 is actually
1552 all bits zero. If it is, we can skip this initialisation. */
1557 IoPAGE_LEN(sv) = 60;
1558 if (old_type < SVt_RV)
1563 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", mt);
1567 if (old_body_arena) {
1569 my_safefree(old_body);
1571 S_del_body(aTHX_ old_body, old_body_arena, old_body_offset);
1577 =for apidoc sv_backoff
1579 Remove any string offset. You should normally use the C<SvOOK_off> macro
1586 Perl_sv_backoff(pTHX_ register SV *sv)
1589 assert(SvTYPE(sv) != SVt_PVHV);
1590 assert(SvTYPE(sv) != SVt_PVAV);
1592 const char *s = SvPVX_const(sv);
1593 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1594 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1596 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1598 SvFLAGS(sv) &= ~SVf_OOK;
1605 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1606 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1607 Use the C<SvGROW> wrapper instead.
1613 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1617 #ifdef HAS_64K_LIMIT
1618 if (newlen >= 0x10000) {
1619 PerlIO_printf(Perl_debug_log,
1620 "Allocation too large: %"UVxf"\n", (UV)newlen);
1623 #endif /* HAS_64K_LIMIT */
1626 if (SvTYPE(sv) < SVt_PV) {
1627 sv_upgrade(sv, SVt_PV);
1628 s = SvPVX_mutable(sv);
1630 else if (SvOOK(sv)) { /* pv is offset? */
1632 s = SvPVX_mutable(sv);
1633 if (newlen > SvLEN(sv))
1634 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1635 #ifdef HAS_64K_LIMIT
1636 if (newlen >= 0x10000)
1641 s = SvPVX_mutable(sv);
1643 if (newlen > SvLEN(sv)) { /* need more room? */
1644 newlen = PERL_STRLEN_ROUNDUP(newlen);
1645 if (SvLEN(sv) && s) {
1647 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1653 s = saferealloc(s, newlen);
1656 s = safemalloc(newlen);
1657 if (SvPVX_const(sv) && SvCUR(sv)) {
1658 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1662 SvLEN_set(sv, newlen);
1668 =for apidoc sv_setiv
1670 Copies an integer into the given SV, upgrading first if necessary.
1671 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1677 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1679 SV_CHECK_THINKFIRST_COW_DROP(sv);
1680 switch (SvTYPE(sv)) {
1682 sv_upgrade(sv, SVt_IV);
1685 sv_upgrade(sv, SVt_PVNV);
1689 sv_upgrade(sv, SVt_PVIV);
1698 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1701 (void)SvIOK_only(sv); /* validate number */
1707 =for apidoc sv_setiv_mg
1709 Like C<sv_setiv>, but also handles 'set' magic.
1715 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1722 =for apidoc sv_setuv
1724 Copies an unsigned integer into the given SV, upgrading first if necessary.
1725 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1731 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1733 /* With these two if statements:
1734 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1737 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1739 If you wish to remove them, please benchmark to see what the effect is
1741 if (u <= (UV)IV_MAX) {
1742 sv_setiv(sv, (IV)u);
1751 =for apidoc sv_setuv_mg
1753 Like C<sv_setuv>, but also handles 'set' magic.
1759 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1761 /* With these two if statements:
1762 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1765 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1767 If you wish to remove them, please benchmark to see what the effect is
1769 if (u <= (UV)IV_MAX) {
1770 sv_setiv(sv, (IV)u);
1780 =for apidoc sv_setnv
1782 Copies a double into the given SV, upgrading first if necessary.
1783 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1789 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1791 SV_CHECK_THINKFIRST_COW_DROP(sv);
1792 switch (SvTYPE(sv)) {
1795 sv_upgrade(sv, SVt_NV);
1800 sv_upgrade(sv, SVt_PVNV);
1809 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1813 (void)SvNOK_only(sv); /* validate number */
1818 =for apidoc sv_setnv_mg
1820 Like C<sv_setnv>, but also handles 'set' magic.
1826 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1832 /* Print an "isn't numeric" warning, using a cleaned-up,
1833 * printable version of the offending string
1837 S_not_a_number(pTHX_ SV *sv)
1844 dsv = sv_2mortal(newSVpv("", 0));
1845 pv = sv_uni_display(dsv, sv, 10, 0);
1848 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1849 /* each *s can expand to 4 chars + "...\0",
1850 i.e. need room for 8 chars */
1852 const char *s, *end;
1853 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1856 if (ch & 128 && !isPRINT_LC(ch)) {
1865 else if (ch == '\r') {
1869 else if (ch == '\f') {
1873 else if (ch == '\\') {
1877 else if (ch == '\0') {
1881 else if (isPRINT_LC(ch))
1898 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1899 "Argument \"%s\" isn't numeric in %s", pv,
1902 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1903 "Argument \"%s\" isn't numeric", pv);
1907 =for apidoc looks_like_number
1909 Test if the content of an SV looks like a number (or is a number).
1910 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1911 non-numeric warning), even if your atof() doesn't grok them.
1917 Perl_looks_like_number(pTHX_ SV *sv)
1919 register const char *sbegin;
1923 sbegin = SvPVX_const(sv);
1926 else if (SvPOKp(sv))
1927 sbegin = SvPV_const(sv, len);
1929 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1930 return grok_number(sbegin, len, NULL);
1933 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1934 until proven guilty, assume that things are not that bad... */
1939 As 64 bit platforms often have an NV that doesn't preserve all bits of
1940 an IV (an assumption perl has been based on to date) it becomes necessary
1941 to remove the assumption that the NV always carries enough precision to
1942 recreate the IV whenever needed, and that the NV is the canonical form.
1943 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1944 precision as a side effect of conversion (which would lead to insanity
1945 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1946 1) to distinguish between IV/UV/NV slots that have cached a valid
1947 conversion where precision was lost and IV/UV/NV slots that have a
1948 valid conversion which has lost no precision
1949 2) to ensure that if a numeric conversion to one form is requested that
1950 would lose precision, the precise conversion (or differently
1951 imprecise conversion) is also performed and cached, to prevent
1952 requests for different numeric formats on the same SV causing
1953 lossy conversion chains. (lossless conversion chains are perfectly
1958 SvIOKp is true if the IV slot contains a valid value
1959 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1960 SvNOKp is true if the NV slot contains a valid value
1961 SvNOK is true only if the NV value is accurate
1964 while converting from PV to NV, check to see if converting that NV to an
1965 IV(or UV) would lose accuracy over a direct conversion from PV to
1966 IV(or UV). If it would, cache both conversions, return NV, but mark
1967 SV as IOK NOKp (ie not NOK).
1969 While converting from PV to IV, check to see if converting that IV to an
1970 NV would lose accuracy over a direct conversion from PV to NV. If it
1971 would, cache both conversions, flag similarly.
1973 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1974 correctly because if IV & NV were set NV *always* overruled.
1975 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1976 changes - now IV and NV together means that the two are interchangeable:
1977 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1979 The benefit of this is that operations such as pp_add know that if
1980 SvIOK is true for both left and right operands, then integer addition
1981 can be used instead of floating point (for cases where the result won't
1982 overflow). Before, floating point was always used, which could lead to
1983 loss of precision compared with integer addition.
1985 * making IV and NV equal status should make maths accurate on 64 bit
1987 * may speed up maths somewhat if pp_add and friends start to use
1988 integers when possible instead of fp. (Hopefully the overhead in
1989 looking for SvIOK and checking for overflow will not outweigh the
1990 fp to integer speedup)
1991 * will slow down integer operations (callers of SvIV) on "inaccurate"
1992 values, as the change from SvIOK to SvIOKp will cause a call into
1993 sv_2iv each time rather than a macro access direct to the IV slot
1994 * should speed up number->string conversion on integers as IV is
1995 favoured when IV and NV are equally accurate
1997 ####################################################################
1998 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1999 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2000 On the other hand, SvUOK is true iff UV.
2001 ####################################################################
2003 Your mileage will vary depending your CPU's relative fp to integer
2007 #ifndef NV_PRESERVES_UV
2008 # define IS_NUMBER_UNDERFLOW_IV 1
2009 # define IS_NUMBER_UNDERFLOW_UV 2
2010 # define IS_NUMBER_IV_AND_UV 2
2011 # define IS_NUMBER_OVERFLOW_IV 4
2012 # define IS_NUMBER_OVERFLOW_UV 5
2014 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2016 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2018 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2020 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));
2021 if (SvNVX(sv) < (NV)IV_MIN) {
2022 (void)SvIOKp_on(sv);
2024 SvIV_set(sv, IV_MIN);
2025 return IS_NUMBER_UNDERFLOW_IV;
2027 if (SvNVX(sv) > (NV)UV_MAX) {
2028 (void)SvIOKp_on(sv);
2031 SvUV_set(sv, UV_MAX);
2032 return IS_NUMBER_OVERFLOW_UV;
2034 (void)SvIOKp_on(sv);
2036 /* Can't use strtol etc to convert this string. (See truth table in
2038 if (SvNVX(sv) <= (UV)IV_MAX) {
2039 SvIV_set(sv, I_V(SvNVX(sv)));
2040 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2041 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2043 /* Integer is imprecise. NOK, IOKp */
2045 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2048 SvUV_set(sv, U_V(SvNVX(sv)));
2049 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2050 if (SvUVX(sv) == UV_MAX) {
2051 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2052 possibly be preserved by NV. Hence, it must be overflow.
2054 return IS_NUMBER_OVERFLOW_UV;
2056 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2058 /* Integer is imprecise. NOK, IOKp */
2060 return IS_NUMBER_OVERFLOW_IV;
2062 #endif /* !NV_PRESERVES_UV*/
2064 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2065 * this function provided for binary compatibility only
2069 Perl_sv_2iv(pTHX_ register SV *sv)
2071 return sv_2iv_flags(sv, SV_GMAGIC);
2075 =for apidoc sv_2iv_flags
2077 Return the integer value of an SV, doing any necessary string
2078 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2079 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2085 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2089 if (SvGMAGICAL(sv)) {
2090 if (flags & SV_GMAGIC)
2095 return I_V(SvNVX(sv));
2097 if (SvPOKp(sv) && SvLEN(sv))
2100 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2101 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2107 if (SvTHINKFIRST(sv)) {
2110 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2111 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2112 return SvIV(tmpstr);
2113 return PTR2IV(SvRV(sv));
2116 sv_force_normal_flags(sv, 0);
2118 if (SvREADONLY(sv) && !SvOK(sv)) {
2119 if (ckWARN(WARN_UNINITIALIZED))
2126 return (IV)(SvUVX(sv));
2133 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2134 * without also getting a cached IV/UV from it at the same time
2135 * (ie PV->NV conversion should detect loss of accuracy and cache
2136 * IV or UV at same time to avoid this. NWC */
2138 if (SvTYPE(sv) == SVt_NV)
2139 sv_upgrade(sv, SVt_PVNV);
2141 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2142 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2143 certainly cast into the IV range at IV_MAX, whereas the correct
2144 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2146 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2147 SvIV_set(sv, I_V(SvNVX(sv)));
2148 if (SvNVX(sv) == (NV) SvIVX(sv)
2149 #ifndef NV_PRESERVES_UV
2150 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2151 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2152 /* Don't flag it as "accurately an integer" if the number
2153 came from a (by definition imprecise) NV operation, and
2154 we're outside the range of NV integer precision */
2157 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2158 DEBUG_c(PerlIO_printf(Perl_debug_log,
2159 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2165 /* IV not precise. No need to convert from PV, as NV
2166 conversion would already have cached IV if it detected
2167 that PV->IV would be better than PV->NV->IV
2168 flags already correct - don't set public IOK. */
2169 DEBUG_c(PerlIO_printf(Perl_debug_log,
2170 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2175 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2176 but the cast (NV)IV_MIN rounds to a the value less (more
2177 negative) than IV_MIN which happens to be equal to SvNVX ??
2178 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2179 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2180 (NV)UVX == NVX are both true, but the values differ. :-(
2181 Hopefully for 2s complement IV_MIN is something like
2182 0x8000000000000000 which will be exact. NWC */
2185 SvUV_set(sv, U_V(SvNVX(sv)));
2187 (SvNVX(sv) == (NV) SvUVX(sv))
2188 #ifndef NV_PRESERVES_UV
2189 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2190 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2191 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2192 /* Don't flag it as "accurately an integer" if the number
2193 came from a (by definition imprecise) NV operation, and
2194 we're outside the range of NV integer precision */
2200 DEBUG_c(PerlIO_printf(Perl_debug_log,
2201 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2205 return (IV)SvUVX(sv);
2208 else if (SvPOKp(sv) && SvLEN(sv)) {
2210 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2211 /* We want to avoid a possible problem when we cache an IV which
2212 may be later translated to an NV, and the resulting NV is not
2213 the same as the direct translation of the initial string
2214 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2215 be careful to ensure that the value with the .456 is around if the
2216 NV value is requested in the future).
2218 This means that if we cache such an IV, we need to cache the
2219 NV as well. Moreover, we trade speed for space, and do not
2220 cache the NV if we are sure it's not needed.
2223 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2224 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2225 == IS_NUMBER_IN_UV) {
2226 /* It's definitely an integer, only upgrade to PVIV */
2227 if (SvTYPE(sv) < SVt_PVIV)
2228 sv_upgrade(sv, SVt_PVIV);
2230 } else if (SvTYPE(sv) < SVt_PVNV)
2231 sv_upgrade(sv, SVt_PVNV);
2233 /* If NV preserves UV then we only use the UV value if we know that
2234 we aren't going to call atof() below. If NVs don't preserve UVs
2235 then the value returned may have more precision than atof() will
2236 return, even though value isn't perfectly accurate. */
2237 if ((numtype & (IS_NUMBER_IN_UV
2238 #ifdef NV_PRESERVES_UV
2241 )) == IS_NUMBER_IN_UV) {
2242 /* This won't turn off the public IOK flag if it was set above */
2243 (void)SvIOKp_on(sv);
2245 if (!(numtype & IS_NUMBER_NEG)) {
2247 if (value <= (UV)IV_MAX) {
2248 SvIV_set(sv, (IV)value);
2250 SvUV_set(sv, value);
2254 /* 2s complement assumption */
2255 if (value <= (UV)IV_MIN) {
2256 SvIV_set(sv, -(IV)value);
2258 /* Too negative for an IV. This is a double upgrade, but
2259 I'm assuming it will be rare. */
2260 if (SvTYPE(sv) < SVt_PVNV)
2261 sv_upgrade(sv, SVt_PVNV);
2265 SvNV_set(sv, -(NV)value);
2266 SvIV_set(sv, IV_MIN);
2270 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2271 will be in the previous block to set the IV slot, and the next
2272 block to set the NV slot. So no else here. */
2274 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2275 != IS_NUMBER_IN_UV) {
2276 /* It wasn't an (integer that doesn't overflow the UV). */
2277 SvNV_set(sv, Atof(SvPVX_const(sv)));
2279 if (! numtype && ckWARN(WARN_NUMERIC))
2282 #if defined(USE_LONG_DOUBLE)
2283 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2284 PTR2UV(sv), SvNVX(sv)));
2286 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2287 PTR2UV(sv), SvNVX(sv)));
2291 #ifdef NV_PRESERVES_UV
2292 (void)SvIOKp_on(sv);
2294 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2295 SvIV_set(sv, I_V(SvNVX(sv)));
2296 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2299 /* Integer is imprecise. NOK, IOKp */
2301 /* UV will not work better than IV */
2303 if (SvNVX(sv) > (NV)UV_MAX) {
2305 /* Integer is inaccurate. NOK, IOKp, is UV */
2306 SvUV_set(sv, UV_MAX);
2309 SvUV_set(sv, U_V(SvNVX(sv)));
2310 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2311 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2315 /* Integer is imprecise. NOK, IOKp, is UV */
2321 #else /* NV_PRESERVES_UV */
2322 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2323 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2324 /* The IV slot will have been set from value returned by
2325 grok_number above. The NV slot has just been set using
2328 assert (SvIOKp(sv));
2330 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2331 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2332 /* Small enough to preserve all bits. */
2333 (void)SvIOKp_on(sv);
2335 SvIV_set(sv, I_V(SvNVX(sv)));
2336 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2338 /* Assumption: first non-preserved integer is < IV_MAX,
2339 this NV is in the preserved range, therefore: */
2340 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2342 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);
2346 0 0 already failed to read UV.
2347 0 1 already failed to read UV.
2348 1 0 you won't get here in this case. IV/UV
2349 slot set, public IOK, Atof() unneeded.
2350 1 1 already read UV.
2351 so there's no point in sv_2iuv_non_preserve() attempting
2352 to use atol, strtol, strtoul etc. */
2353 if (sv_2iuv_non_preserve (sv, numtype)
2354 >= IS_NUMBER_OVERFLOW_IV)
2358 #endif /* NV_PRESERVES_UV */
2361 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2363 if (SvTYPE(sv) < SVt_IV)
2364 /* Typically the caller expects that sv_any is not NULL now. */
2365 sv_upgrade(sv, SVt_IV);
2368 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2369 PTR2UV(sv),SvIVX(sv)));
2370 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2373 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2374 * this function provided for binary compatibility only
2378 Perl_sv_2uv(pTHX_ register SV *sv)
2380 return sv_2uv_flags(sv, SV_GMAGIC);
2384 =for apidoc sv_2uv_flags
2386 Return the unsigned integer value of an SV, doing any necessary string
2387 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2388 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2394 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2398 if (SvGMAGICAL(sv)) {
2399 if (flags & SV_GMAGIC)
2404 return U_V(SvNVX(sv));
2405 if (SvPOKp(sv) && SvLEN(sv))
2408 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2409 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2415 if (SvTHINKFIRST(sv)) {
2418 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2419 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2420 return SvUV(tmpstr);
2421 return PTR2UV(SvRV(sv));
2424 sv_force_normal_flags(sv, 0);
2426 if (SvREADONLY(sv) && !SvOK(sv)) {
2427 if (ckWARN(WARN_UNINITIALIZED))
2437 return (UV)SvIVX(sv);
2441 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2442 * without also getting a cached IV/UV from it at the same time
2443 * (ie PV->NV conversion should detect loss of accuracy and cache
2444 * IV or UV at same time to avoid this. */
2445 /* IV-over-UV optimisation - choose to cache IV if possible */
2447 if (SvTYPE(sv) == SVt_NV)
2448 sv_upgrade(sv, SVt_PVNV);
2450 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2451 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2452 SvIV_set(sv, I_V(SvNVX(sv)));
2453 if (SvNVX(sv) == (NV) SvIVX(sv)
2454 #ifndef NV_PRESERVES_UV
2455 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2456 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2457 /* Don't flag it as "accurately an integer" if the number
2458 came from a (by definition imprecise) NV operation, and
2459 we're outside the range of NV integer precision */
2462 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2463 DEBUG_c(PerlIO_printf(Perl_debug_log,
2464 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2470 /* IV not precise. No need to convert from PV, as NV
2471 conversion would already have cached IV if it detected
2472 that PV->IV would be better than PV->NV->IV
2473 flags already correct - don't set public IOK. */
2474 DEBUG_c(PerlIO_printf(Perl_debug_log,
2475 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2480 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2481 but the cast (NV)IV_MIN rounds to a the value less (more
2482 negative) than IV_MIN which happens to be equal to SvNVX ??
2483 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2484 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2485 (NV)UVX == NVX are both true, but the values differ. :-(
2486 Hopefully for 2s complement IV_MIN is something like
2487 0x8000000000000000 which will be exact. NWC */
2490 SvUV_set(sv, U_V(SvNVX(sv)));
2492 (SvNVX(sv) == (NV) SvUVX(sv))
2493 #ifndef NV_PRESERVES_UV
2494 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2495 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2496 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2497 /* Don't flag it as "accurately an integer" if the number
2498 came from a (by definition imprecise) NV operation, and
2499 we're outside the range of NV integer precision */
2504 DEBUG_c(PerlIO_printf(Perl_debug_log,
2505 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2511 else if (SvPOKp(sv) && SvLEN(sv)) {
2513 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2515 /* We want to avoid a possible problem when we cache a UV which
2516 may be later translated to an NV, and the resulting NV is not
2517 the translation of the initial data.
2519 This means that if we cache such a UV, we need to cache the
2520 NV as well. Moreover, we trade speed for space, and do not
2521 cache the NV if not needed.
2524 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2525 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2526 == IS_NUMBER_IN_UV) {
2527 /* It's definitely an integer, only upgrade to PVIV */
2528 if (SvTYPE(sv) < SVt_PVIV)
2529 sv_upgrade(sv, SVt_PVIV);
2531 } else if (SvTYPE(sv) < SVt_PVNV)
2532 sv_upgrade(sv, SVt_PVNV);
2534 /* If NV preserves UV then we only use the UV value if we know that
2535 we aren't going to call atof() below. If NVs don't preserve UVs
2536 then the value returned may have more precision than atof() will
2537 return, even though it isn't accurate. */
2538 if ((numtype & (IS_NUMBER_IN_UV
2539 #ifdef NV_PRESERVES_UV
2542 )) == IS_NUMBER_IN_UV) {
2543 /* This won't turn off the public IOK flag if it was set above */
2544 (void)SvIOKp_on(sv);
2546 if (!(numtype & IS_NUMBER_NEG)) {
2548 if (value <= (UV)IV_MAX) {
2549 SvIV_set(sv, (IV)value);
2551 /* it didn't overflow, and it was positive. */
2552 SvUV_set(sv, value);
2556 /* 2s complement assumption */
2557 if (value <= (UV)IV_MIN) {
2558 SvIV_set(sv, -(IV)value);
2560 /* Too negative for an IV. This is a double upgrade, but
2561 I'm assuming it will be rare. */
2562 if (SvTYPE(sv) < SVt_PVNV)
2563 sv_upgrade(sv, SVt_PVNV);
2567 SvNV_set(sv, -(NV)value);
2568 SvIV_set(sv, IV_MIN);
2573 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2574 != IS_NUMBER_IN_UV) {
2575 /* It wasn't an integer, or it overflowed the UV. */
2576 SvNV_set(sv, Atof(SvPVX_const(sv)));
2578 if (! numtype && ckWARN(WARN_NUMERIC))
2581 #if defined(USE_LONG_DOUBLE)
2582 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2583 PTR2UV(sv), SvNVX(sv)));
2585 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2586 PTR2UV(sv), SvNVX(sv)));
2589 #ifdef NV_PRESERVES_UV
2590 (void)SvIOKp_on(sv);
2592 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2593 SvIV_set(sv, I_V(SvNVX(sv)));
2594 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2597 /* Integer is imprecise. NOK, IOKp */
2599 /* UV will not work better than IV */
2601 if (SvNVX(sv) > (NV)UV_MAX) {
2603 /* Integer is inaccurate. NOK, IOKp, is UV */
2604 SvUV_set(sv, UV_MAX);
2607 SvUV_set(sv, U_V(SvNVX(sv)));
2608 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2609 NV preservse UV so can do correct comparison. */
2610 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2614 /* Integer is imprecise. NOK, IOKp, is UV */
2619 #else /* NV_PRESERVES_UV */
2620 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2621 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2622 /* The UV slot will have been set from value returned by
2623 grok_number above. The NV slot has just been set using
2626 assert (SvIOKp(sv));
2628 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2629 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2630 /* Small enough to preserve all bits. */
2631 (void)SvIOKp_on(sv);
2633 SvIV_set(sv, I_V(SvNVX(sv)));
2634 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2636 /* Assumption: first non-preserved integer is < IV_MAX,
2637 this NV is in the preserved range, therefore: */
2638 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2640 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);
2643 sv_2iuv_non_preserve (sv, numtype);
2645 #endif /* NV_PRESERVES_UV */
2649 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2650 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2653 if (SvTYPE(sv) < SVt_IV)
2654 /* Typically the caller expects that sv_any is not NULL now. */
2655 sv_upgrade(sv, SVt_IV);
2659 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2660 PTR2UV(sv),SvUVX(sv)));
2661 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2667 Return the num value of an SV, doing any necessary string or integer
2668 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2675 Perl_sv_2nv(pTHX_ register SV *sv)
2679 if (SvGMAGICAL(sv)) {
2683 if (SvPOKp(sv) && SvLEN(sv)) {
2684 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2685 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2687 return Atof(SvPVX_const(sv));
2691 return (NV)SvUVX(sv);
2693 return (NV)SvIVX(sv);
2696 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2697 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2703 if (SvTHINKFIRST(sv)) {
2706 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2707 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2708 return SvNV(tmpstr);
2709 return PTR2NV(SvRV(sv));
2712 sv_force_normal_flags(sv, 0);
2714 if (SvREADONLY(sv) && !SvOK(sv)) {
2715 if (ckWARN(WARN_UNINITIALIZED))
2720 if (SvTYPE(sv) < SVt_NV) {
2721 if (SvTYPE(sv) == SVt_IV)
2722 sv_upgrade(sv, SVt_PVNV);
2724 sv_upgrade(sv, SVt_NV);
2725 #ifdef USE_LONG_DOUBLE
2727 STORE_NUMERIC_LOCAL_SET_STANDARD();
2728 PerlIO_printf(Perl_debug_log,
2729 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2730 PTR2UV(sv), SvNVX(sv));
2731 RESTORE_NUMERIC_LOCAL();
2735 STORE_NUMERIC_LOCAL_SET_STANDARD();
2736 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2737 PTR2UV(sv), SvNVX(sv));
2738 RESTORE_NUMERIC_LOCAL();
2742 else if (SvTYPE(sv) < SVt_PVNV)
2743 sv_upgrade(sv, SVt_PVNV);
2748 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2749 #ifdef NV_PRESERVES_UV
2752 /* Only set the public NV OK flag if this NV preserves the IV */
2753 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2754 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2755 : (SvIVX(sv) == I_V(SvNVX(sv))))
2761 else if (SvPOKp(sv) && SvLEN(sv)) {
2763 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2764 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2766 #ifdef NV_PRESERVES_UV
2767 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2768 == IS_NUMBER_IN_UV) {
2769 /* It's definitely an integer */
2770 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2772 SvNV_set(sv, Atof(SvPVX_const(sv)));
2775 SvNV_set(sv, Atof(SvPVX_const(sv)));
2776 /* Only set the public NV OK flag if this NV preserves the value in
2777 the PV at least as well as an IV/UV would.
2778 Not sure how to do this 100% reliably. */
2779 /* if that shift count is out of range then Configure's test is
2780 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2782 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2783 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2784 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2785 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2786 /* Can't use strtol etc to convert this string, so don't try.
2787 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2790 /* value has been set. It may not be precise. */
2791 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2792 /* 2s complement assumption for (UV)IV_MIN */
2793 SvNOK_on(sv); /* Integer is too negative. */
2798 if (numtype & IS_NUMBER_NEG) {
2799 SvIV_set(sv, -(IV)value);
2800 } else if (value <= (UV)IV_MAX) {
2801 SvIV_set(sv, (IV)value);
2803 SvUV_set(sv, value);
2807 if (numtype & IS_NUMBER_NOT_INT) {
2808 /* I believe that even if the original PV had decimals,
2809 they are lost beyond the limit of the FP precision.
2810 However, neither is canonical, so both only get p
2811 flags. NWC, 2000/11/25 */
2812 /* Both already have p flags, so do nothing */
2814 const NV nv = SvNVX(sv);
2815 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2816 if (SvIVX(sv) == I_V(nv)) {
2821 /* It had no "." so it must be integer. */
2824 /* between IV_MAX and NV(UV_MAX).
2825 Could be slightly > UV_MAX */
2827 if (numtype & IS_NUMBER_NOT_INT) {
2828 /* UV and NV both imprecise. */
2830 const UV nv_as_uv = U_V(nv);
2832 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2843 #endif /* NV_PRESERVES_UV */
2846 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2848 if (SvTYPE(sv) < SVt_NV)
2849 /* Typically the caller expects that sv_any is not NULL now. */
2850 /* XXX Ilya implies that this is a bug in callers that assume this
2851 and ideally should be fixed. */
2852 sv_upgrade(sv, SVt_NV);
2855 #if defined(USE_LONG_DOUBLE)
2857 STORE_NUMERIC_LOCAL_SET_STANDARD();
2858 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2859 PTR2UV(sv), SvNVX(sv));
2860 RESTORE_NUMERIC_LOCAL();
2864 STORE_NUMERIC_LOCAL_SET_STANDARD();
2865 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2866 PTR2UV(sv), SvNVX(sv));
2867 RESTORE_NUMERIC_LOCAL();
2873 /* asIV(): extract an integer from the string value of an SV.
2874 * Caller must validate PVX */
2877 S_asIV(pTHX_ SV *sv)
2880 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2882 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2883 == IS_NUMBER_IN_UV) {
2884 /* It's definitely an integer */
2885 if (numtype & IS_NUMBER_NEG) {
2886 if (value < (UV)IV_MIN)
2889 if (value < (UV)IV_MAX)
2894 if (ckWARN(WARN_NUMERIC))
2897 return I_V(Atof(SvPVX_const(sv)));
2900 /* asUV(): extract an unsigned integer from the string value of an SV
2901 * Caller must validate PVX */
2904 S_asUV(pTHX_ SV *sv)
2907 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2909 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2910 == IS_NUMBER_IN_UV) {
2911 /* It's definitely an integer */
2912 if (!(numtype & IS_NUMBER_NEG))
2916 if (ckWARN(WARN_NUMERIC))
2919 return U_V(Atof(SvPVX_const(sv)));
2923 =for apidoc sv_2pv_nolen
2925 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2926 use the macro wrapper C<SvPV_nolen(sv)> instead.
2931 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2933 return sv_2pv(sv, 0);
2936 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2937 * UV as a string towards the end of buf, and return pointers to start and
2940 * We assume that buf is at least TYPE_CHARS(UV) long.
2944 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2946 char *ptr = buf + TYPE_CHARS(UV);
2960 *--ptr = '0' + (char)(uv % 10);
2968 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2969 * this function provided for binary compatibility only
2973 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2975 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2979 =for apidoc sv_2pv_flags
2981 Returns a pointer to the string value of an SV, and sets *lp to its length.
2982 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2984 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2985 usually end up here too.
2991 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2996 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2997 char *tmpbuf = tbuf;
3004 if (SvGMAGICAL(sv)) {
3005 if (flags & SV_GMAGIC)
3010 if (flags & SV_MUTABLE_RETURN)
3011 return SvPVX_mutable(sv);
3012 if (flags & SV_CONST_RETURN)
3013 return (char *)SvPVX_const(sv);
3018 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3020 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3025 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3030 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3031 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3039 if (SvTHINKFIRST(sv)) {
3042 register const char *typestr;
3043 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3044 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3046 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3049 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3050 if (flags & SV_CONST_RETURN) {
3051 pv = (char *) SvPVX_const(tmpstr);
3053 pv = (flags & SV_MUTABLE_RETURN)
3054 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3057 *lp = SvCUR(tmpstr);
3059 pv = sv_2pv_flags(tmpstr, lp, flags);
3070 typestr = "NULLREF";
3074 switch (SvTYPE(sv)) {
3076 if ( ((SvFLAGS(sv) &
3077 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3078 == (SVs_OBJECT|SVs_SMG))
3079 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3080 const regexp *re = (regexp *)mg->mg_obj;
3083 const char *fptr = "msix";
3088 char need_newline = 0;
3089 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3091 while((ch = *fptr++)) {
3093 reflags[left++] = ch;
3096 reflags[right--] = ch;
3101 reflags[left] = '-';
3105 mg->mg_len = re->prelen + 4 + left;
3107 * If /x was used, we have to worry about a regex
3108 * ending with a comment later being embedded
3109 * within another regex. If so, we don't want this
3110 * regex's "commentization" to leak out to the
3111 * right part of the enclosing regex, we must cap
3112 * it with a newline.
3114 * So, if /x was used, we scan backwards from the
3115 * end of the regex. If we find a '#' before we
3116 * find a newline, we need to add a newline
3117 * ourself. If we find a '\n' first (or if we
3118 * don't find '#' or '\n'), we don't need to add
3119 * anything. -jfriedl
3121 if (PMf_EXTENDED & re->reganch)
3123 const char *endptr = re->precomp + re->prelen;
3124 while (endptr >= re->precomp)
3126 const char c = *(endptr--);
3128 break; /* don't need another */
3130 /* we end while in a comment, so we
3132 mg->mg_len++; /* save space for it */
3133 need_newline = 1; /* note to add it */
3139 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3140 Copy("(?", mg->mg_ptr, 2, char);
3141 Copy(reflags, mg->mg_ptr+2, left, char);
3142 Copy(":", mg->mg_ptr+left+2, 1, char);
3143 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3145 mg->mg_ptr[mg->mg_len - 2] = '\n';
3146 mg->mg_ptr[mg->mg_len - 1] = ')';
3147 mg->mg_ptr[mg->mg_len] = 0;
3149 PL_reginterp_cnt += re->program[0].next_off;
3151 if (re->reganch & ROPT_UTF8)
3167 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3168 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3169 /* tied lvalues should appear to be
3170 * scalars for backwards compatitbility */
3171 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3172 ? "SCALAR" : "LVALUE"; break;
3173 case SVt_PVAV: typestr = "ARRAY"; break;
3174 case SVt_PVHV: typestr = "HASH"; break;
3175 case SVt_PVCV: typestr = "CODE"; break;
3176 case SVt_PVGV: typestr = "GLOB"; break;
3177 case SVt_PVFM: typestr = "FORMAT"; break;
3178 case SVt_PVIO: typestr = "IO"; break;
3179 default: typestr = "UNKNOWN"; break;
3183 const char *name = HvNAME_get(SvSTASH(sv));
3184 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3185 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3188 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3192 *lp = strlen(typestr);
3193 return (char *)typestr;
3195 if (SvREADONLY(sv) && !SvOK(sv)) {
3196 if (ckWARN(WARN_UNINITIALIZED))
3203 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3204 /* I'm assuming that if both IV and NV are equally valid then
3205 converting the IV is going to be more efficient */
3206 const U32 isIOK = SvIOK(sv);
3207 const U32 isUIOK = SvIsUV(sv);
3208 char buf[TYPE_CHARS(UV)];
3211 if (SvTYPE(sv) < SVt_PVIV)
3212 sv_upgrade(sv, SVt_PVIV);
3214 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3216 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3217 /* inlined from sv_setpvn */
3218 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3219 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3220 SvCUR_set(sv, ebuf - ptr);
3230 else if (SvNOKp(sv)) {
3231 if (SvTYPE(sv) < SVt_PVNV)
3232 sv_upgrade(sv, SVt_PVNV);
3233 /* The +20 is pure guesswork. Configure test needed. --jhi */
3234 s = SvGROW_mutable(sv, NV_DIG + 20);
3235 olderrno = errno; /* some Xenix systems wipe out errno here */
3237 if (SvNVX(sv) == 0.0)
3238 (void)strcpy(s,"0");
3242 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3245 #ifdef FIXNEGATIVEZERO
3246 if (*s == '-' && s[1] == '0' && !s[2])
3256 if (ckWARN(WARN_UNINITIALIZED)
3257 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3261 if (SvTYPE(sv) < SVt_PV)
3262 /* Typically the caller expects that sv_any is not NULL now. */
3263 sv_upgrade(sv, SVt_PV);
3267 STRLEN len = s - SvPVX_const(sv);
3273 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3274 PTR2UV(sv),SvPVX_const(sv)));
3275 if (flags & SV_CONST_RETURN)
3276 return (char *)SvPVX_const(sv);
3277 if (flags & SV_MUTABLE_RETURN)
3278 return SvPVX_mutable(sv);
3282 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3283 /* Sneaky stuff here */
3287 tsv = newSVpv(tmpbuf, 0);
3300 t = SvPVX_const(tsv);
3305 len = strlen(tmpbuf);
3307 #ifdef FIXNEGATIVEZERO
3308 if (len == 2 && t[0] == '-' && t[1] == '0') {
3313 SvUPGRADE(sv, SVt_PV);
3316 s = SvGROW_mutable(sv, len + 1);
3319 return strcpy(s, t);
3324 =for apidoc sv_copypv
3326 Copies a stringified representation of the source SV into the
3327 destination SV. Automatically performs any necessary mg_get and
3328 coercion of numeric values into strings. Guaranteed to preserve
3329 UTF-8 flag even from overloaded objects. Similar in nature to
3330 sv_2pv[_flags] but operates directly on an SV instead of just the
3331 string. Mostly uses sv_2pv_flags to do its work, except when that
3332 would lose the UTF-8'ness of the PV.
3338 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3342 s = SvPV_const(ssv,len);
3343 sv_setpvn(dsv,s,len);
3351 =for apidoc sv_2pvbyte_nolen
3353 Return a pointer to the byte-encoded representation of the SV.
3354 May cause the SV to be downgraded from UTF-8 as a side-effect.
3356 Usually accessed via the C<SvPVbyte_nolen> macro.
3362 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3364 return sv_2pvbyte(sv, 0);
3368 =for apidoc sv_2pvbyte
3370 Return a pointer to the byte-encoded representation of the SV, and set *lp
3371 to its length. May cause the SV to be downgraded from UTF-8 as a
3374 Usually accessed via the C<SvPVbyte> macro.
3380 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3382 sv_utf8_downgrade(sv,0);
3383 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3387 =for apidoc sv_2pvutf8_nolen
3389 Return a pointer to the UTF-8-encoded representation of the SV.
3390 May cause the SV to be upgraded to UTF-8 as a side-effect.
3392 Usually accessed via the C<SvPVutf8_nolen> macro.
3398 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3400 return sv_2pvutf8(sv, 0);
3404 =for apidoc sv_2pvutf8
3406 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3407 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3409 Usually accessed via the C<SvPVutf8> macro.
3415 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3417 sv_utf8_upgrade(sv);
3418 return SvPV(sv,*lp);
3422 =for apidoc sv_2bool
3424 This function is only called on magical items, and is only used by
3425 sv_true() or its macro equivalent.
3431 Perl_sv_2bool(pTHX_ register SV *sv)
3440 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3441 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3442 return (bool)SvTRUE(tmpsv);
3443 return SvRV(sv) != 0;
3446 register XPV* Xpvtmp;
3447 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3448 (*sv->sv_u.svu_pv > '0' ||
3449 Xpvtmp->xpv_cur > 1 ||
3450 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3457 return SvIVX(sv) != 0;
3460 return SvNVX(sv) != 0.0;
3467 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3468 * this function provided for binary compatibility only
3473 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3475 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3479 =for apidoc sv_utf8_upgrade
3481 Converts the PV of an SV to its UTF-8-encoded form.
3482 Forces the SV to string form if it is not already.
3483 Always sets the SvUTF8 flag to avoid future validity checks even
3484 if all the bytes have hibit clear.
3486 This is not as a general purpose byte encoding to Unicode interface:
3487 use the Encode extension for that.
3489 =for apidoc sv_utf8_upgrade_flags
3491 Converts the PV of an SV to its UTF-8-encoded form.
3492 Forces the SV to string form if it is not already.
3493 Always sets the SvUTF8 flag to avoid future validity checks even
3494 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3495 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3496 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3498 This is not as a general purpose byte encoding to Unicode interface:
3499 use the Encode extension for that.
3505 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3507 if (sv == &PL_sv_undef)
3511 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3512 (void) sv_2pv_flags(sv,&len, flags);
3516 (void) SvPV_force(sv,len);
3525 sv_force_normal_flags(sv, 0);
3528 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3529 sv_recode_to_utf8(sv, PL_encoding);
3530 else { /* Assume Latin-1/EBCDIC */
3531 /* This function could be much more efficient if we
3532 * had a FLAG in SVs to signal if there are any hibit
3533 * chars in the PV. Given that there isn't such a flag
3534 * make the loop as fast as possible. */
3535 const U8 *s = (U8 *) SvPVX_const(sv);
3536 const U8 *e = (U8 *) SvEND(sv);
3542 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3546 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3547 U8 *recoded = bytes_to_utf8((U8*)s, &len);
3549 SvPV_free(sv); /* No longer using what was there before. */
3551 SvPV_set(sv, (char*)recoded);
3552 SvCUR_set(sv, len - 1);
3553 SvLEN_set(sv, len); /* No longer know the real size. */
3555 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3562 =for apidoc sv_utf8_downgrade
3564 Attempts to convert the PV of an SV from characters to bytes.
3565 If the PV contains a character beyond byte, this conversion will fail;
3566 in this case, either returns false or, if C<fail_ok> is not
3569 This is not as a general purpose Unicode to byte encoding interface:
3570 use the Encode extension for that.
3576 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3578 if (SvPOKp(sv) && SvUTF8(sv)) {
3584 sv_force_normal_flags(sv, 0);
3586 s = (U8 *) SvPV(sv, len);
3587 if (!utf8_to_bytes(s, &len)) {
3592 Perl_croak(aTHX_ "Wide character in %s",
3595 Perl_croak(aTHX_ "Wide character");
3606 =for apidoc sv_utf8_encode
3608 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3609 flag off so that it looks like octets again.
3615 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3617 (void) sv_utf8_upgrade(sv);
3619 sv_force_normal_flags(sv, 0);
3621 if (SvREADONLY(sv)) {
3622 Perl_croak(aTHX_ PL_no_modify);
3628 =for apidoc sv_utf8_decode
3630 If the PV of the SV is an octet sequence in UTF-8
3631 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3632 so that it looks like a character. If the PV contains only single-byte
3633 characters, the C<SvUTF8> flag stays being off.
3634 Scans PV for validity and returns false if the PV is invalid UTF-8.
3640 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3646 /* The octets may have got themselves encoded - get them back as
3649 if (!sv_utf8_downgrade(sv, TRUE))
3652 /* it is actually just a matter of turning the utf8 flag on, but
3653 * we want to make sure everything inside is valid utf8 first.
3655 c = (const U8 *) SvPVX_const(sv);
3656 if (!is_utf8_string(c, SvCUR(sv)+1))
3658 e = (const U8 *) SvEND(sv);
3661 if (!UTF8_IS_INVARIANT(ch)) {
3670 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3671 * this function provided for binary compatibility only
3675 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3677 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3681 =for apidoc sv_setsv
3683 Copies the contents of the source SV C<ssv> into the destination SV
3684 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3685 function if the source SV needs to be reused. Does not handle 'set' magic.
3686 Loosely speaking, it performs a copy-by-value, obliterating any previous
3687 content of the destination.
3689 You probably want to use one of the assortment of wrappers, such as
3690 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3691 C<SvSetMagicSV_nosteal>.
3693 =for apidoc sv_setsv_flags
3695 Copies the contents of the source SV C<ssv> into the destination SV
3696 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3697 function if the source SV needs to be reused. Does not handle 'set' magic.
3698 Loosely speaking, it performs a copy-by-value, obliterating any previous
3699 content of the destination.
3700 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3701 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3702 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3703 and C<sv_setsv_nomg> are implemented in terms of this function.
3705 You probably want to use one of the assortment of wrappers, such as
3706 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3707 C<SvSetMagicSV_nosteal>.
3709 This is the primary function for copying scalars, and most other
3710 copy-ish functions and macros use this underneath.
3716 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3718 register U32 sflags;
3724 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3726 sstr = &PL_sv_undef;
3727 stype = SvTYPE(sstr);
3728 dtype = SvTYPE(dstr);
3733 /* need to nuke the magic */
3735 SvRMAGICAL_off(dstr);
3738 /* There's a lot of redundancy below but we're going for speed here */
3743 if (dtype != SVt_PVGV) {
3744 (void)SvOK_off(dstr);
3752 sv_upgrade(dstr, SVt_IV);
3755 sv_upgrade(dstr, SVt_PVNV);
3759 sv_upgrade(dstr, SVt_PVIV);
3762 (void)SvIOK_only(dstr);
3763 SvIV_set(dstr, SvIVX(sstr));
3766 if (SvTAINTED(sstr))
3777 sv_upgrade(dstr, SVt_NV);
3782 sv_upgrade(dstr, SVt_PVNV);
3785 SvNV_set(dstr, SvNVX(sstr));
3786 (void)SvNOK_only(dstr);
3787 if (SvTAINTED(sstr))
3795 sv_upgrade(dstr, SVt_RV);
3796 else if (dtype == SVt_PVGV &&
3797 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3800 if (GvIMPORTED(dstr) != GVf_IMPORTED
3801 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3803 GvIMPORTED_on(dstr);
3812 #ifdef PERL_OLD_COPY_ON_WRITE
3813 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3814 if (dtype < SVt_PVIV)
3815 sv_upgrade(dstr, SVt_PVIV);
3822 sv_upgrade(dstr, SVt_PV);
3825 if (dtype < SVt_PVIV)
3826 sv_upgrade(dstr, SVt_PVIV);
3829 if (dtype < SVt_PVNV)
3830 sv_upgrade(dstr, SVt_PVNV);
3837 const char * const type = sv_reftype(sstr,0);
3839 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3841 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3846 if (dtype <= SVt_PVGV) {
3848 if (dtype != SVt_PVGV) {
3849 const char * const name = GvNAME(sstr);
3850 const STRLEN len = GvNAMELEN(sstr);
3851 /* don't upgrade SVt_PVLV: it can hold a glob */
3852 if (dtype != SVt_PVLV)
3853 sv_upgrade(dstr, SVt_PVGV);
3854 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3855 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3856 GvNAME(dstr) = savepvn(name, len);
3857 GvNAMELEN(dstr) = len;
3858 SvFAKE_on(dstr); /* can coerce to non-glob */
3860 /* ahem, death to those who redefine active sort subs */
3861 else if (PL_curstackinfo->si_type == PERLSI_SORT
3862 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3863 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3866 #ifdef GV_UNIQUE_CHECK
3867 if (GvUNIQUE((GV*)dstr)) {
3868 Perl_croak(aTHX_ PL_no_modify);
3872 (void)SvOK_off(dstr);
3873 GvINTRO_off(dstr); /* one-shot flag */
3875 GvGP(dstr) = gp_ref(GvGP(sstr));
3876 if (SvTAINTED(sstr))
3878 if (GvIMPORTED(dstr) != GVf_IMPORTED
3879 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3881 GvIMPORTED_on(dstr);
3889 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3891 if ((int)SvTYPE(sstr) != stype) {
3892 stype = SvTYPE(sstr);
3893 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3897 if (stype == SVt_PVLV)
3898 SvUPGRADE(dstr, SVt_PVNV);
3900 SvUPGRADE(dstr, (U32)stype);
3903 sflags = SvFLAGS(sstr);
3905 if (sflags & SVf_ROK) {
3906 if (dtype >= SVt_PV) {
3907 if (dtype == SVt_PVGV) {
3908 SV *sref = SvREFCNT_inc(SvRV(sstr));
3910 const int intro = GvINTRO(dstr);
3912 #ifdef GV_UNIQUE_CHECK
3913 if (GvUNIQUE((GV*)dstr)) {
3914 Perl_croak(aTHX_ PL_no_modify);
3919 GvINTRO_off(dstr); /* one-shot flag */
3920 GvLINE(dstr) = CopLINE(PL_curcop);
3921 GvEGV(dstr) = (GV*)dstr;
3924 switch (SvTYPE(sref)) {
3927 SAVEGENERICSV(GvAV(dstr));
3929 dref = (SV*)GvAV(dstr);
3930 GvAV(dstr) = (AV*)sref;
3931 if (!GvIMPORTED_AV(dstr)
3932 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3934 GvIMPORTED_AV_on(dstr);
3939 SAVEGENERICSV(GvHV(dstr));
3941 dref = (SV*)GvHV(dstr);
3942 GvHV(dstr) = (HV*)sref;
3943 if (!GvIMPORTED_HV(dstr)
3944 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3946 GvIMPORTED_HV_on(dstr);
3951 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3952 SvREFCNT_dec(GvCV(dstr));
3953 GvCV(dstr) = Nullcv;
3954 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3955 PL_sub_generation++;
3957 SAVEGENERICSV(GvCV(dstr));
3960 dref = (SV*)GvCV(dstr);
3961 if (GvCV(dstr) != (CV*)sref) {
3962 CV* cv = GvCV(dstr);
3964 if (!GvCVGEN((GV*)dstr) &&
3965 (CvROOT(cv) || CvXSUB(cv)))
3967 /* ahem, death to those who redefine
3968 * active sort subs */
3969 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3970 PL_sortcop == CvSTART(cv))
3972 "Can't redefine active sort subroutine %s",
3973 GvENAME((GV*)dstr));
3974 /* Redefining a sub - warning is mandatory if
3975 it was a const and its value changed. */
3976 if (ckWARN(WARN_REDEFINE)
3978 && (!CvCONST((CV*)sref)
3979 || sv_cmp(cv_const_sv(cv),
3980 cv_const_sv((CV*)sref)))))
3982 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3984 ? "Constant subroutine %s::%s redefined"
3985 : "Subroutine %s::%s redefined",
3986 HvNAME_get(GvSTASH((GV*)dstr)),
3987 GvENAME((GV*)dstr));
3991 cv_ckproto(cv, (GV*)dstr,
3993 ? SvPVX_const(sref) : Nullch);
3995 GvCV(dstr) = (CV*)sref;
3996 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3997 GvASSUMECV_on(dstr);
3998 PL_sub_generation++;
4000 if (!GvIMPORTED_CV(dstr)
4001 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4003 GvIMPORTED_CV_on(dstr);
4008 SAVEGENERICSV(GvIOp(dstr));
4010 dref = (SV*)GvIOp(dstr);
4011 GvIOp(dstr) = (IO*)sref;
4015 SAVEGENERICSV(GvFORM(dstr));
4017 dref = (SV*)GvFORM(dstr);
4018 GvFORM(dstr) = (CV*)sref;
4022 SAVEGENERICSV(GvSV(dstr));
4024 dref = (SV*)GvSV(dstr);
4026 if (!GvIMPORTED_SV(dstr)
4027 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4029 GvIMPORTED_SV_on(dstr);
4035 if (SvTAINTED(sstr))
4039 if (SvPVX_const(dstr)) {
4045 (void)SvOK_off(dstr);
4046 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4048 if (sflags & SVp_NOK) {
4050 /* Only set the public OK flag if the source has public OK. */
4051 if (sflags & SVf_NOK)
4052 SvFLAGS(dstr) |= SVf_NOK;
4053 SvNV_set(dstr, SvNVX(sstr));
4055 if (sflags & SVp_IOK) {
4056 (void)SvIOKp_on(dstr);
4057 if (sflags & SVf_IOK)
4058 SvFLAGS(dstr) |= SVf_IOK;
4059 if (sflags & SVf_IVisUV)
4061 SvIV_set(dstr, SvIVX(sstr));
4063 if (SvAMAGIC(sstr)) {
4067 else if (sflags & SVp_POK) {
4071 * Check to see if we can just swipe the string. If so, it's a
4072 * possible small lose on short strings, but a big win on long ones.
4073 * It might even be a win on short strings if SvPVX_const(dstr)
4074 * has to be allocated and SvPVX_const(sstr) has to be freed.
4077 /* Whichever path we take through the next code, we want this true,
4078 and doing it now facilitates the COW check. */
4079 (void)SvPOK_only(dstr);
4082 /* We're not already COW */
4083 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4084 #ifndef PERL_OLD_COPY_ON_WRITE
4085 /* or we are, but dstr isn't a suitable target. */
4086 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4091 (sflags & SVs_TEMP) && /* slated for free anyway? */
4092 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4093 (!(flags & SV_NOSTEAL)) &&
4094 /* and we're allowed to steal temps */
4095 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4096 SvLEN(sstr) && /* and really is a string */
4097 /* and won't be needed again, potentially */
4098 !(PL_op && PL_op->op_type == OP_AASSIGN))
4099 #ifdef PERL_OLD_COPY_ON_WRITE
4100 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4101 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4102 && SvTYPE(sstr) >= SVt_PVIV)
4105 /* Failed the swipe test, and it's not a shared hash key either.
4106 Have to copy the string. */
4107 STRLEN len = SvCUR(sstr);
4108 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4109 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4110 SvCUR_set(dstr, len);
4111 *SvEND(dstr) = '\0';
4113 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4115 /* Either it's a shared hash key, or it's suitable for
4116 copy-on-write or we can swipe the string. */
4118 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4122 #ifdef PERL_OLD_COPY_ON_WRITE
4124 /* I believe I should acquire a global SV mutex if
4125 it's a COW sv (not a shared hash key) to stop
4126 it going un copy-on-write.
4127 If the source SV has gone un copy on write between up there
4128 and down here, then (assert() that) it is of the correct
4129 form to make it copy on write again */
4130 if ((sflags & (SVf_FAKE | SVf_READONLY))
4131 != (SVf_FAKE | SVf_READONLY)) {
4132 SvREADONLY_on(sstr);
4134 /* Make the source SV into a loop of 1.
4135 (about to become 2) */
4136 SV_COW_NEXT_SV_SET(sstr, sstr);
4140 /* Initial code is common. */
4141 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4143 SvFLAGS(dstr) &= ~SVf_OOK;
4144 Safefree(SvPVX_const(dstr) - SvIVX(dstr));
4146 else if (SvLEN(dstr))
4147 Safefree(SvPVX_const(dstr));
4151 /* making another shared SV. */
4152 STRLEN cur = SvCUR(sstr);
4153 STRLEN len = SvLEN(sstr);
4154 #ifdef PERL_OLD_COPY_ON_WRITE
4156 assert (SvTYPE(dstr) >= SVt_PVIV);
4157 /* SvIsCOW_normal */
4158 /* splice us in between source and next-after-source. */
4159 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4160 SV_COW_NEXT_SV_SET(sstr, dstr);
4161 SvPV_set(dstr, SvPVX_mutable(sstr));
4165 /* SvIsCOW_shared_hash */
4166 DEBUG_C(PerlIO_printf(Perl_debug_log,
4167 "Copy on write: Sharing hash\n"));
4169 assert (SvTYPE(dstr) >= SVt_PV);
4171 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4173 SvLEN_set(dstr, len);
4174 SvCUR_set(dstr, cur);
4175 SvREADONLY_on(dstr);
4177 /* Relesase a global SV mutex. */
4180 { /* Passes the swipe test. */
4181 SvPV_set(dstr, SvPVX_mutable(sstr));
4182 SvLEN_set(dstr, SvLEN(sstr));
4183 SvCUR_set(dstr, SvCUR(sstr));
4186 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4187 SvPV_set(sstr, Nullch);
4193 if (sflags & SVf_UTF8)
4195 if (sflags & SVp_NOK) {
4197 if (sflags & SVf_NOK)
4198 SvFLAGS(dstr) |= SVf_NOK;
4199 SvNV_set(dstr, SvNVX(sstr));
4201 if (sflags & SVp_IOK) {
4202 (void)SvIOKp_on(dstr);
4203 if (sflags & SVf_IOK)
4204 SvFLAGS(dstr) |= SVf_IOK;
4205 if (sflags & SVf_IVisUV)
4207 SvIV_set(dstr, SvIVX(sstr));
4210 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4211 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4212 smg->mg_ptr, smg->mg_len);
4213 SvRMAGICAL_on(dstr);
4216 else if (sflags & SVp_IOK) {
4217 if (sflags & SVf_IOK)
4218 (void)SvIOK_only(dstr);
4220 (void)SvOK_off(dstr);
4221 (void)SvIOKp_on(dstr);
4223 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4224 if (sflags & SVf_IVisUV)
4226 SvIV_set(dstr, SvIVX(sstr));
4227 if (sflags & SVp_NOK) {
4228 if (sflags & SVf_NOK)
4229 (void)SvNOK_on(dstr);
4231 (void)SvNOKp_on(dstr);
4232 SvNV_set(dstr, SvNVX(sstr));
4235 else if (sflags & SVp_NOK) {
4236 if (sflags & SVf_NOK)
4237 (void)SvNOK_only(dstr);
4239 (void)SvOK_off(dstr);
4242 SvNV_set(dstr, SvNVX(sstr));
4245 if (dtype == SVt_PVGV) {
4246 if (ckWARN(WARN_MISC))
4247 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4250 (void)SvOK_off(dstr);
4252 if (SvTAINTED(sstr))
4257 =for apidoc sv_setsv_mg
4259 Like C<sv_setsv>, but also handles 'set' magic.
4265 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4267 sv_setsv(dstr,sstr);
4271 #ifdef PERL_OLD_COPY_ON_WRITE
4273 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4275 STRLEN cur = SvCUR(sstr);
4276 STRLEN len = SvLEN(sstr);
4277 register char *new_pv;
4280 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4288 if (SvTHINKFIRST(dstr))
4289 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4290 else if (SvPVX_const(dstr))
4291 Safefree(SvPVX_const(dstr));
4295 SvUPGRADE(dstr, SVt_PVIV);
4297 assert (SvPOK(sstr));
4298 assert (SvPOKp(sstr));
4299 assert (!SvIOK(sstr));
4300 assert (!SvIOKp(sstr));
4301 assert (!SvNOK(sstr));
4302 assert (!SvNOKp(sstr));
4304 if (SvIsCOW(sstr)) {
4306 if (SvLEN(sstr) == 0) {
4307 /* source is a COW shared hash key. */
4308 DEBUG_C(PerlIO_printf(Perl_debug_log,
4309 "Fast copy on write: Sharing hash\n"));
4310 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4313 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4315 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4316 SvUPGRADE(sstr, SVt_PVIV);
4317 SvREADONLY_on(sstr);
4319 DEBUG_C(PerlIO_printf(Perl_debug_log,
4320 "Fast copy on write: Converting sstr to COW\n"));
4321 SV_COW_NEXT_SV_SET(dstr, sstr);
4323 SV_COW_NEXT_SV_SET(sstr, dstr);
4324 new_pv = SvPVX_mutable(sstr);
4327 SvPV_set(dstr, new_pv);
4328 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4331 SvLEN_set(dstr, len);
4332 SvCUR_set(dstr, cur);
4341 =for apidoc sv_setpvn
4343 Copies a string into an SV. The C<len> parameter indicates the number of
4344 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4345 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4351 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4353 register char *dptr;
4355 SV_CHECK_THINKFIRST_COW_DROP(sv);
4361 /* len is STRLEN which is unsigned, need to copy to signed */
4364 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4366 SvUPGRADE(sv, SVt_PV);
4368 dptr = SvGROW(sv, len + 1);
4369 Move(ptr,dptr,len,char);
4372 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4377 =for apidoc sv_setpvn_mg
4379 Like C<sv_setpvn>, but also handles 'set' magic.
4385 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4387 sv_setpvn(sv,ptr,len);
4392 =for apidoc sv_setpv
4394 Copies a string into an SV. The string must be null-terminated. Does not
4395 handle 'set' magic. See C<sv_setpv_mg>.
4401 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4403 register STRLEN len;
4405 SV_CHECK_THINKFIRST_COW_DROP(sv);
4411 SvUPGRADE(sv, SVt_PV);
4413 SvGROW(sv, len + 1);
4414 Move(ptr,SvPVX(sv),len+1,char);
4416 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4421 =for apidoc sv_setpv_mg
4423 Like C<sv_setpv>, but also handles 'set' magic.
4429 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4436 =for apidoc sv_usepvn
4438 Tells an SV to use C<ptr> to find its string value. Normally the string is
4439 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4440 The C<ptr> should point to memory that was allocated by C<malloc>. The
4441 string length, C<len>, must be supplied. This function will realloc the
4442 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4443 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4444 See C<sv_usepvn_mg>.
4450 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4453 SV_CHECK_THINKFIRST_COW_DROP(sv);
4454 SvUPGRADE(sv, SVt_PV);
4459 if (SvPVX_const(sv))
4462 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4463 ptr = saferealloc (ptr, allocate);
4466 SvLEN_set(sv, allocate);
4468 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4473 =for apidoc sv_usepvn_mg
4475 Like C<sv_usepvn>, but also handles 'set' magic.
4481 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4483 sv_usepvn(sv,ptr,len);
4487 #ifdef PERL_OLD_COPY_ON_WRITE
4488 /* Need to do this *after* making the SV normal, as we need the buffer
4489 pointer to remain valid until after we've copied it. If we let go too early,
4490 another thread could invalidate it by unsharing last of the same hash key
4491 (which it can do by means other than releasing copy-on-write Svs)
4492 or by changing the other copy-on-write SVs in the loop. */
4494 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4496 if (len) { /* this SV was SvIsCOW_normal(sv) */
4497 /* we need to find the SV pointing to us. */
4498 SV *current = SV_COW_NEXT_SV(after);
4500 if (current == sv) {
4501 /* The SV we point to points back to us (there were only two of us
4503 Hence other SV is no longer copy on write either. */
4505 SvREADONLY_off(after);
4507 /* We need to follow the pointers around the loop. */
4509 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4512 /* don't loop forever if the structure is bust, and we have
4513 a pointer into a closed loop. */
4514 assert (current != after);
4515 assert (SvPVX_const(current) == pvx);
4517 /* Make the SV before us point to the SV after us. */
4518 SV_COW_NEXT_SV_SET(current, after);
4521 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4526 Perl_sv_release_IVX(pTHX_ register SV *sv)
4529 sv_force_normal_flags(sv, 0);
4535 =for apidoc sv_force_normal_flags
4537 Undo various types of fakery on an SV: if the PV is a shared string, make
4538 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4539 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4540 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4541 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4542 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4543 set to some other value.) In addition, the C<flags> parameter gets passed to
4544 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4545 with flags set to 0.
4551 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4553 #ifdef PERL_OLD_COPY_ON_WRITE
4554 if (SvREADONLY(sv)) {
4555 /* At this point I believe I should acquire a global SV mutex. */
4557 const char *pvx = SvPVX_const(sv);
4558 const STRLEN len = SvLEN(sv);
4559 const STRLEN cur = SvCUR(sv);
4560 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4562 PerlIO_printf(Perl_debug_log,
4563 "Copy on write: Force normal %ld\n",
4569 /* This SV doesn't own the buffer, so need to New() a new one: */
4570 SvPV_set(sv, (char*)0);
4572 if (flags & SV_COW_DROP_PV) {
4573 /* OK, so we don't need to copy our buffer. */
4576 SvGROW(sv, cur + 1);
4577 Move(pvx,SvPVX(sv),cur,char);
4581 sv_release_COW(sv, pvx, len, next);
4586 else if (IN_PERL_RUNTIME)
4587 Perl_croak(aTHX_ PL_no_modify);
4588 /* At this point I believe that I can drop the global SV mutex. */
4591 if (SvREADONLY(sv)) {
4593 const char *pvx = SvPVX_const(sv);
4594 const STRLEN len = SvCUR(sv);
4597 SvPV_set(sv, Nullch);
4599 SvGROW(sv, len + 1);
4600 Move(pvx,SvPVX_const(sv),len,char);
4602 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4604 else if (IN_PERL_RUNTIME)
4605 Perl_croak(aTHX_ PL_no_modify);
4609 sv_unref_flags(sv, flags);
4610 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4615 =for apidoc sv_force_normal
4617 Undo various types of fakery on an SV: if the PV is a shared string, make
4618 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4619 an xpvmg. See also C<sv_force_normal_flags>.
4625 Perl_sv_force_normal(pTHX_ register SV *sv)
4627 sv_force_normal_flags(sv, 0);
4633 Efficient removal of characters from the beginning of the string buffer.
4634 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4635 the string buffer. The C<ptr> becomes the first character of the adjusted
4636 string. Uses the "OOK hack".
4637 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4638 refer to the same chunk of data.
4644 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4646 register STRLEN delta;
4647 if (!ptr || !SvPOKp(sv))
4649 delta = ptr - SvPVX_const(sv);
4650 SV_CHECK_THINKFIRST(sv);
4651 if (SvTYPE(sv) < SVt_PVIV)
4652 sv_upgrade(sv,SVt_PVIV);
4655 if (!SvLEN(sv)) { /* make copy of shared string */
4656 const char *pvx = SvPVX_const(sv);
4657 const STRLEN len = SvCUR(sv);
4658 SvGROW(sv, len + 1);
4659 Move(pvx,SvPVX_const(sv),len,char);
4663 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4664 and we do that anyway inside the SvNIOK_off
4666 SvFLAGS(sv) |= SVf_OOK;
4669 SvLEN_set(sv, SvLEN(sv) - delta);
4670 SvCUR_set(sv, SvCUR(sv) - delta);
4671 SvPV_set(sv, SvPVX(sv) + delta);
4672 SvIV_set(sv, SvIVX(sv) + delta);
4675 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4676 * this function provided for binary compatibility only
4680 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4682 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4686 =for apidoc sv_catpvn
4688 Concatenates the string onto the end of the string which is in the SV. The
4689 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4690 status set, then the bytes appended should be valid UTF-8.
4691 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4693 =for apidoc sv_catpvn_flags
4695 Concatenates the string onto the end of the string which is in the SV. The
4696 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4697 status set, then the bytes appended should be valid UTF-8.
4698 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4699 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4700 in terms of this function.
4706 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4709 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4711 SvGROW(dsv, dlen + slen + 1);
4713 sstr = SvPVX_const(dsv);
4714 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4715 SvCUR_set(dsv, SvCUR(dsv) + slen);
4717 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4722 =for apidoc sv_catpvn_mg
4724 Like C<sv_catpvn>, but also handles 'set' magic.
4730 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4732 sv_catpvn(sv,ptr,len);
4736 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4737 * this function provided for binary compatibility only
4741 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4743 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4747 =for apidoc sv_catsv
4749 Concatenates the string from SV C<ssv> onto the end of the string in
4750 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4751 not 'set' magic. See C<sv_catsv_mg>.
4753 =for apidoc sv_catsv_flags
4755 Concatenates the string from SV C<ssv> onto the end of the string in
4756 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4757 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4758 and C<sv_catsv_nomg> are implemented in terms of this function.
4763 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4769 if ((spv = SvPV_const(ssv, slen))) {
4770 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4771 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4772 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4773 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4774 dsv->sv_flags doesn't have that bit set.
4775 Andy Dougherty 12 Oct 2001
4777 const I32 sutf8 = DO_UTF8(ssv);
4780 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4782 dutf8 = DO_UTF8(dsv);
4784 if (dutf8 != sutf8) {
4786 /* Not modifying source SV, so taking a temporary copy. */
4787 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4789 sv_utf8_upgrade(csv);
4790 spv = SvPV_const(csv, slen);
4793 sv_utf8_upgrade_nomg(dsv);
4795 sv_catpvn_nomg(dsv, spv, slen);
4800 =for apidoc sv_catsv_mg
4802 Like C<sv_catsv>, but also handles 'set' magic.
4808 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4815 =for apidoc sv_catpv
4817 Concatenates the string onto the end of the string which is in the SV.
4818 If the SV has the UTF-8 status set, then the bytes appended should be
4819 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4824 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4826 register STRLEN len;
4832 junk = SvPV_force(sv, tlen);
4834 SvGROW(sv, tlen + len + 1);
4836 ptr = SvPVX_const(sv);
4837 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4838 SvCUR_set(sv, SvCUR(sv) + len);
4839 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4844 =for apidoc sv_catpv_mg
4846 Like C<sv_catpv>, but also handles 'set' magic.
4852 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4861 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4862 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4869 Perl_newSV(pTHX_ STRLEN len)
4875 sv_upgrade(sv, SVt_PV);
4876 SvGROW(sv, len + 1);
4881 =for apidoc sv_magicext
4883 Adds magic to an SV, upgrading it if necessary. Applies the
4884 supplied vtable and returns a pointer to the magic added.
4886 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4887 In particular, you can add magic to SvREADONLY SVs, and add more than
4888 one instance of the same 'how'.
4890 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4891 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4892 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4893 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4895 (This is now used as a subroutine by C<sv_magic>.)
4900 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4901 const char* name, I32 namlen)
4905 if (SvTYPE(sv) < SVt_PVMG) {
4906 SvUPGRADE(sv, SVt_PVMG);
4908 Newz(702,mg, 1, MAGIC);
4909 mg->mg_moremagic = SvMAGIC(sv);
4910 SvMAGIC_set(sv, mg);
4912 /* Sometimes a magic contains a reference loop, where the sv and
4913 object refer to each other. To prevent a reference loop that
4914 would prevent such objects being freed, we look for such loops
4915 and if we find one we avoid incrementing the object refcount.
4917 Note we cannot do this to avoid self-tie loops as intervening RV must
4918 have its REFCNT incremented to keep it in existence.
4921 if (!obj || obj == sv ||
4922 how == PERL_MAGIC_arylen ||
4923 how == PERL_MAGIC_qr ||
4924 how == PERL_MAGIC_symtab ||
4925 (SvTYPE(obj) == SVt_PVGV &&
4926 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4927 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4928 GvFORM(obj) == (CV*)sv)))
4933 mg->mg_obj = SvREFCNT_inc(obj);
4934 mg->mg_flags |= MGf_REFCOUNTED;
4937 /* Normal self-ties simply pass a null object, and instead of
4938 using mg_obj directly, use the SvTIED_obj macro to produce a
4939 new RV as needed. For glob "self-ties", we are tieing the PVIO
4940 with an RV obj pointing to the glob containing the PVIO. In
4941 this case, to avoid a reference loop, we need to weaken the
4945 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4946 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4952 mg->mg_len = namlen;
4955 mg->mg_ptr = savepvn(name, namlen);
4956 else if (namlen == HEf_SVKEY)
4957 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4959 mg->mg_ptr = (char *) name;
4961 mg->mg_virtual = vtable;
4965 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4970 =for apidoc sv_magic
4972 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4973 then adds a new magic item of type C<how> to the head of the magic list.
4975 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4976 handling of the C<name> and C<namlen> arguments.
4978 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4979 to add more than one instance of the same 'how'.
4985 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4987 const MGVTBL *vtable = 0;
4990 #ifdef PERL_OLD_COPY_ON_WRITE
4992 sv_force_normal_flags(sv, 0);
4994 if (SvREADONLY(sv)) {
4996 && how != PERL_MAGIC_regex_global
4997 && how != PERL_MAGIC_bm
4998 && how != PERL_MAGIC_fm
4999 && how != PERL_MAGIC_sv
5000 && how != PERL_MAGIC_backref
5003 Perl_croak(aTHX_ PL_no_modify);
5006 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5007 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5008 /* sv_magic() refuses to add a magic of the same 'how' as an
5011 if (how == PERL_MAGIC_taint)
5019 vtable = &PL_vtbl_sv;
5021 case PERL_MAGIC_overload:
5022 vtable = &PL_vtbl_amagic;
5024 case PERL_MAGIC_overload_elem:
5025 vtable = &PL_vtbl_amagicelem;
5027 case PERL_MAGIC_overload_table:
5028 vtable = &PL_vtbl_ovrld;
5031 vtable = &PL_vtbl_bm;
5033 case PERL_MAGIC_regdata:
5034 vtable = &PL_vtbl_regdata;
5036 case PERL_MAGIC_regdatum:
5037 vtable = &PL_vtbl_regdatum;
5039 case PERL_MAGIC_env:
5040 vtable = &PL_vtbl_env;
5043 vtable = &PL_vtbl_fm;
5045 case PERL_MAGIC_envelem:
5046 vtable = &PL_vtbl_envelem;
5048 case PERL_MAGIC_regex_global:
5049 vtable = &PL_vtbl_mglob;
5051 case PERL_MAGIC_isa:
5052 vtable = &PL_vtbl_isa;
5054 case PERL_MAGIC_isaelem:
5055 vtable = &PL_vtbl_isaelem;
5057 case PERL_MAGIC_nkeys:
5058 vtable = &PL_vtbl_nkeys;
5060 case PERL_MAGIC_dbfile:
5063 case PERL_MAGIC_dbline:
5064 vtable = &PL_vtbl_dbline;
5066 #ifdef USE_LOCALE_COLLATE
5067 case PERL_MAGIC_collxfrm:
5068 vtable = &PL_vtbl_collxfrm;
5070 #endif /* USE_LOCALE_COLLATE */
5071 case PERL_MAGIC_tied:
5072 vtable = &PL_vtbl_pack;
5074 case PERL_MAGIC_tiedelem:
5075 case PERL_MAGIC_tiedscalar:
5076 vtable = &PL_vtbl_packelem;
5079 vtable = &PL_vtbl_regexp;
5081 case PERL_MAGIC_sig:
5082 vtable = &PL_vtbl_sig;
5084 case PERL_MAGIC_sigelem:
5085 vtable = &PL_vtbl_sigelem;
5087 case PERL_MAGIC_taint:
5088 vtable = &PL_vtbl_taint;
5090 case PERL_MAGIC_uvar:
5091 vtable = &PL_vtbl_uvar;
5093 case PERL_MAGIC_vec:
5094 vtable = &PL_vtbl_vec;
5096 case PERL_MAGIC_arylen_p:
5097 case PERL_MAGIC_rhash:
5098 case PERL_MAGIC_symtab:
5099 case PERL_MAGIC_vstring:
5102 case PERL_MAGIC_utf8:
5103 vtable = &PL_vtbl_utf8;
5105 case PERL_MAGIC_substr:
5106 vtable = &PL_vtbl_substr;
5108 case PERL_MAGIC_defelem:
5109 vtable = &PL_vtbl_defelem;
5111 case PERL_MAGIC_glob:
5112 vtable = &PL_vtbl_glob;
5114 case PERL_MAGIC_arylen:
5115 vtable = &PL_vtbl_arylen;
5117 case PERL_MAGIC_pos:
5118 vtable = &PL_vtbl_pos;
5120 case PERL_MAGIC_backref:
5121 vtable = &PL_vtbl_backref;
5123 case PERL_MAGIC_ext:
5124 /* Reserved for use by extensions not perl internals. */
5125 /* Useful for attaching extension internal data to perl vars. */
5126 /* Note that multiple extensions may clash if magical scalars */
5127 /* etc holding private data from one are passed to another. */
5130 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5133 /* Rest of work is done else where */
5134 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5137 case PERL_MAGIC_taint:
5140 case PERL_MAGIC_ext:
5141 case PERL_MAGIC_dbfile:
5148 =for apidoc sv_unmagic
5150 Removes all magic of type C<type> from an SV.
5156 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5160 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5163 for (mg = *mgp; mg; mg = *mgp) {
5164 if (mg->mg_type == type) {
5165 const MGVTBL* const vtbl = mg->mg_virtual;
5166 *mgp = mg->mg_moremagic;
5167 if (vtbl && vtbl->svt_free)
5168 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5169 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5171 Safefree(mg->mg_ptr);
5172 else if (mg->mg_len == HEf_SVKEY)
5173 SvREFCNT_dec((SV*)mg->mg_ptr);
5174 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5175 Safefree(mg->mg_ptr);
5177 if (mg->mg_flags & MGf_REFCOUNTED)
5178 SvREFCNT_dec(mg->mg_obj);
5182 mgp = &mg->mg_moremagic;
5186 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5193 =for apidoc sv_rvweaken
5195 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5196 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5197 push a back-reference to this RV onto the array of backreferences
5198 associated with that magic.
5204 Perl_sv_rvweaken(pTHX_ SV *sv)
5207 if (!SvOK(sv)) /* let undefs pass */
5210 Perl_croak(aTHX_ "Can't weaken a nonreference");
5211 else if (SvWEAKREF(sv)) {
5212 if (ckWARN(WARN_MISC))
5213 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5217 sv_add_backref(tsv, sv);
5223 /* Give tsv backref magic if it hasn't already got it, then push a
5224 * back-reference to sv onto the array associated with the backref magic.
5228 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5232 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5233 av = (AV*)mg->mg_obj;
5236 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5237 /* av now has a refcnt of 2, which avoids it getting freed
5238 * before us during global cleanup. The extra ref is removed
5239 * by magic_killbackrefs() when tsv is being freed */
5241 if (AvFILLp(av) >= AvMAX(av)) {
5243 SV **svp = AvARRAY(av);
5244 for (i = AvFILLp(av); i >= 0; i--)
5246 svp[i] = sv; /* reuse the slot */
5249 av_extend(av, AvFILLp(av)+1);
5251 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5254 /* delete a back-reference to ourselves from the backref magic associated
5255 * with the SV we point to.
5259 S_sv_del_backref(pTHX_ SV *sv)
5266 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5267 Perl_croak(aTHX_ "panic: del_backref");
5268 av = (AV *)mg->mg_obj;
5270 for (i = AvFILLp(av); i >= 0; i--)
5271 if (svp[i] == sv) svp[i] = Nullsv;
5275 =for apidoc sv_insert
5277 Inserts a string at the specified offset/length within the SV. Similar to
5278 the Perl substr() function.
5284 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5288 register char *midend;
5289 register char *bigend;
5295 Perl_croak(aTHX_ "Can't modify non-existent substring");
5296 SvPV_force(bigstr, curlen);
5297 (void)SvPOK_only_UTF8(bigstr);
5298 if (offset + len > curlen) {
5299 SvGROW(bigstr, offset+len+1);
5300 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5301 SvCUR_set(bigstr, offset+len);
5305 i = littlelen - len;
5306 if (i > 0) { /* string might grow */
5307 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5308 mid = big + offset + len;
5309 midend = bigend = big + SvCUR(bigstr);
5312 while (midend > mid) /* shove everything down */
5313 *--bigend = *--midend;
5314 Move(little,big+offset,littlelen,char);
5315 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5320 Move(little,SvPVX(bigstr)+offset,len,char);
5325 big = SvPVX(bigstr);
5328 bigend = big + SvCUR(bigstr);
5330 if (midend > bigend)
5331 Perl_croak(aTHX_ "panic: sv_insert");
5333 if (mid - big > bigend - midend) { /* faster to shorten from end */
5335 Move(little, mid, littlelen,char);
5338 i = bigend - midend;
5340 Move(midend, mid, i,char);
5344 SvCUR_set(bigstr, mid - big);
5346 else if ((i = mid - big)) { /* faster from front */
5347 midend -= littlelen;
5349 sv_chop(bigstr,midend-i);
5354 Move(little, mid, littlelen,char);
5356 else if (littlelen) {
5357 midend -= littlelen;
5358 sv_chop(bigstr,midend);
5359 Move(little,midend,littlelen,char);
5362 sv_chop(bigstr,midend);
5368 =for apidoc sv_replace
5370 Make the first argument a copy of the second, then delete the original.
5371 The target SV physically takes over ownership of the body of the source SV
5372 and inherits its flags; however, the target keeps any magic it owns,
5373 and any magic in the source is discarded.
5374 Note that this is a rather specialist SV copying operation; most of the
5375 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5381 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5383 const U32 refcnt = SvREFCNT(sv);
5384 SV_CHECK_THINKFIRST_COW_DROP(sv);
5385 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5386 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5387 if (SvMAGICAL(sv)) {
5391 sv_upgrade(nsv, SVt_PVMG);
5392 SvMAGIC_set(nsv, SvMAGIC(sv));
5393 SvFLAGS(nsv) |= SvMAGICAL(sv);
5395 SvMAGIC_set(sv, NULL);
5399 assert(!SvREFCNT(sv));
5400 #ifdef DEBUG_LEAKING_SCALARS
5401 sv->sv_flags = nsv->sv_flags;
5402 sv->sv_any = nsv->sv_any;
5403 sv->sv_refcnt = nsv->sv_refcnt;
5404 sv->sv_u = nsv->sv_u;
5406 StructCopy(nsv,sv,SV);
5408 /* Currently could join these into one piece of pointer arithmetic, but
5409 it would be unclear. */
5410 if(SvTYPE(sv) == SVt_IV)
5412 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5413 else if (SvTYPE(sv) == SVt_RV) {
5414 SvANY(sv) = &sv->sv_u.svu_rv;
5418 #ifdef PERL_OLD_COPY_ON_WRITE
5419 if (SvIsCOW_normal(nsv)) {
5420 /* We need to follow the pointers around the loop to make the
5421 previous SV point to sv, rather than nsv. */
5424 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5427 assert(SvPVX_const(current) == SvPVX_const(nsv));
5429 /* Make the SV before us point to the SV after us. */
5431 PerlIO_printf(Perl_debug_log, "previous is\n");
5433 PerlIO_printf(Perl_debug_log,
5434 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5435 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5437 SV_COW_NEXT_SV_SET(current, sv);
5440 SvREFCNT(sv) = refcnt;
5441 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5447 =for apidoc sv_clear
5449 Clear an SV: call any destructors, free up any memory used by the body,
5450 and free the body itself. The SV's head is I<not> freed, although
5451 its type is set to all 1's so that it won't inadvertently be assumed
5452 to be live during global destruction etc.
5453 This function should only be called when REFCNT is zero. Most of the time
5454 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5461 Perl_sv_clear(pTHX_ register SV *sv)
5466 assert(SvREFCNT(sv) == 0);
5469 if (PL_defstash) { /* Still have a symbol table? */
5473 stash = SvSTASH(sv);
5474 destructor = StashHANDLER(stash,DESTROY);
5476 SV* tmpref = newRV(sv);
5477 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5479 PUSHSTACKi(PERLSI_DESTROY);
5484 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5490 if(SvREFCNT(tmpref) < 2) {
5491 /* tmpref is not kept alive! */
5493 SvRV_set(tmpref, NULL);
5496 SvREFCNT_dec(tmpref);
5498 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5502 if (PL_in_clean_objs)
5503 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5505 /* DESTROY gave object new lease on life */
5511 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5512 SvOBJECT_off(sv); /* Curse the object. */
5513 if (SvTYPE(sv) != SVt_PVIO)
5514 --PL_sv_objcount; /* XXX Might want something more general */
5517 if (SvTYPE(sv) >= SVt_PVMG) {
5520 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5521 SvREFCNT_dec(SvSTASH(sv));
5524 switch (SvTYPE(sv)) {
5527 IoIFP(sv) != PerlIO_stdin() &&
5528 IoIFP(sv) != PerlIO_stdout() &&
5529 IoIFP(sv) != PerlIO_stderr())
5531 io_close((IO*)sv, FALSE);
5533 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5534 PerlDir_close(IoDIRP(sv));
5535 IoDIRP(sv) = (DIR*)NULL;
5536 Safefree(IoTOP_NAME(sv));
5537 Safefree(IoFMT_NAME(sv));
5538 Safefree(IoBOTTOM_NAME(sv));
5553 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5554 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5555 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5556 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5558 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5559 SvREFCNT_dec(LvTARG(sv));
5563 Safefree(GvNAME(sv));
5564 /* cannot decrease stash refcount yet, as we might recursively delete
5565 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5566 of stash until current sv is completely gone.
5567 -- JohnPC, 27 Mar 1998 */
5568 stash = GvSTASH(sv);
5574 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5576 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5577 /* Don't even bother with turning off the OOK flag. */
5586 SvREFCNT_dec(SvRV(sv));
5588 #ifdef PERL_OLD_COPY_ON_WRITE
5589 else if (SvPVX_const(sv)) {
5591 /* I believe I need to grab the global SV mutex here and
5592 then recheck the COW status. */
5594 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5597 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5598 SV_COW_NEXT_SV(sv));
5599 /* And drop it here. */
5601 } else if (SvLEN(sv)) {
5602 Safefree(SvPVX_const(sv));
5606 else if (SvPVX_const(sv) && SvLEN(sv))
5607 Safefree(SvPVX_const(sv));
5608 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5609 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5622 switch (SvTYPE(sv)) {
5636 del_XPVIV(SvANY(sv));
5639 del_XPVNV(SvANY(sv));
5642 del_XPVMG(SvANY(sv));
5645 del_XPVLV(SvANY(sv));
5648 del_XPVAV(SvANY(sv));
5651 del_XPVHV(SvANY(sv));
5654 del_XPVCV(SvANY(sv));
5657 del_XPVGV(SvANY(sv));
5658 /* code duplication for increased performance. */
5659 SvFLAGS(sv) &= SVf_BREAK;
5660 SvFLAGS(sv) |= SVTYPEMASK;
5661 /* decrease refcount of the stash that owns this GV, if any */
5663 SvREFCNT_dec(stash);
5664 return; /* not break, SvFLAGS reset already happened */
5666 del_XPVBM(SvANY(sv));
5669 del_XPVFM(SvANY(sv));
5672 del_XPVIO(SvANY(sv));
5675 SvFLAGS(sv) &= SVf_BREAK;
5676 SvFLAGS(sv) |= SVTYPEMASK;
5680 =for apidoc sv_newref
5682 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5689 Perl_sv_newref(pTHX_ SV *sv)
5699 Decrement an SV's reference count, and if it drops to zero, call
5700 C<sv_clear> to invoke destructors and free up any memory used by
5701 the body; finally, deallocate the SV's head itself.
5702 Normally called via a wrapper macro C<SvREFCNT_dec>.
5708 Perl_sv_free(pTHX_ SV *sv)
5713 if (SvREFCNT(sv) == 0) {
5714 if (SvFLAGS(sv) & SVf_BREAK)
5715 /* this SV's refcnt has been artificially decremented to
5716 * trigger cleanup */
5718 if (PL_in_clean_all) /* All is fair */
5720 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5721 /* make sure SvREFCNT(sv)==0 happens very seldom */
5722 SvREFCNT(sv) = (~(U32)0)/2;
5725 if (ckWARN_d(WARN_INTERNAL))
5726 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5727 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5728 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5731 if (--(SvREFCNT(sv)) > 0)
5733 Perl_sv_free2(aTHX_ sv);
5737 Perl_sv_free2(pTHX_ SV *sv)
5742 if (ckWARN_d(WARN_DEBUGGING))
5743 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5744 "Attempt to free temp prematurely: SV 0x%"UVxf
5745 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5749 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5750 /* make sure SvREFCNT(sv)==0 happens very seldom */
5751 SvREFCNT(sv) = (~(U32)0)/2;
5762 Returns the length of the string in the SV. Handles magic and type
5763 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5769 Perl_sv_len(pTHX_ register SV *sv)
5777 len = mg_length(sv);
5779 (void)SvPV_const(sv, len);
5784 =for apidoc sv_len_utf8
5786 Returns the number of characters in the string in an SV, counting wide
5787 UTF-8 bytes as a single character. Handles magic and type coercion.
5793 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5794 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5795 * (Note that the mg_len is not the length of the mg_ptr field.)
5800 Perl_sv_len_utf8(pTHX_ register SV *sv)
5806 return mg_length(sv);
5810 const U8 *s = (U8*)SvPV_const(sv, len);
5811 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5813 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5815 #ifdef PERL_UTF8_CACHE_ASSERT
5816 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5820 ulen = Perl_utf8_length(aTHX_ s, s + len);
5821 if (!mg && !SvREADONLY(sv)) {
5822 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5823 mg = mg_find(sv, PERL_MAGIC_utf8);
5833 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5834 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5835 * between UTF-8 and byte offsets. There are two (substr offset and substr
5836 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5837 * and byte offset) cache positions.
5839 * The mg_len field is used by sv_len_utf8(), see its comments.
5840 * Note that the mg_len is not the length of the mg_ptr field.
5844 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5845 I32 offsetp, const U8 *s, const U8 *start)
5849 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5851 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5855 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5857 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5858 (*mgp)->mg_ptr = (char *) *cachep;
5862 (*cachep)[i] = offsetp;
5863 (*cachep)[i+1] = s - start;
5871 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5872 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5873 * between UTF-8 and byte offsets. See also the comments of
5874 * S_utf8_mg_pos_init().
5878 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)
5882 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5884 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5885 if (*mgp && (*mgp)->mg_ptr) {
5886 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5887 ASSERT_UTF8_CACHE(*cachep);
5888 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5890 else { /* We will skip to the right spot. */
5895 /* The assumption is that going backward is half
5896 * the speed of going forward (that's where the
5897 * 2 * backw in the below comes from). (The real
5898 * figure of course depends on the UTF-8 data.) */
5900 if ((*cachep)[i] > (STRLEN)uoff) {
5902 backw = (*cachep)[i] - (STRLEN)uoff;
5904 if (forw < 2 * backw)
5907 p = start + (*cachep)[i+1];
5909 /* Try this only for the substr offset (i == 0),
5910 * not for the substr length (i == 2). */
5911 else if (i == 0) { /* (*cachep)[i] < uoff */
5912 const STRLEN ulen = sv_len_utf8(sv);
5914 if ((STRLEN)uoff < ulen) {
5915 forw = (STRLEN)uoff - (*cachep)[i];
5916 backw = ulen - (STRLEN)uoff;
5918 if (forw < 2 * backw)
5919 p = start + (*cachep)[i+1];
5924 /* If the string is not long enough for uoff,
5925 * we could extend it, but not at this low a level. */
5929 if (forw < 2 * backw) {
5936 while (UTF8_IS_CONTINUATION(*p))
5941 /* Update the cache. */
5942 (*cachep)[i] = (STRLEN)uoff;
5943 (*cachep)[i+1] = p - start;
5945 /* Drop the stale "length" cache */
5954 if (found) { /* Setup the return values. */
5955 *offsetp = (*cachep)[i+1];
5956 *sp = start + *offsetp;
5959 *offsetp = send - start;
5961 else if (*sp < start) {
5967 #ifdef PERL_UTF8_CACHE_ASSERT
5972 while (n-- && s < send)
5976 assert(*offsetp == s - start);
5977 assert((*cachep)[0] == (STRLEN)uoff);
5978 assert((*cachep)[1] == *offsetp);
5980 ASSERT_UTF8_CACHE(*cachep);
5989 =for apidoc sv_pos_u2b
5991 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5992 the start of the string, to a count of the equivalent number of bytes; if
5993 lenp is non-zero, it does the same to lenp, but this time starting from
5994 the offset, rather than from the start of the string. Handles magic and
6001 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6002 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6003 * byte offsets. See also the comments of S_utf8_mg_pos().
6008 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6016 start = (U8*)SvPV_const(sv, len);
6020 const U8 *s = start;
6021 I32 uoffset = *offsetp;
6022 const U8 *send = s + len;
6026 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6028 if (!found && uoffset > 0) {
6029 while (s < send && uoffset--)
6033 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6035 *offsetp = s - start;
6040 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6044 if (!found && *lenp > 0) {
6047 while (s < send && ulen--)
6051 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6055 ASSERT_UTF8_CACHE(cache);
6067 =for apidoc sv_pos_b2u
6069 Converts the value pointed to by offsetp from a count of bytes from the
6070 start of the string, to a count of the equivalent number of UTF-8 chars.
6071 Handles magic and type coercion.
6077 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6078 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6079 * byte offsets. See also the comments of S_utf8_mg_pos().
6084 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6092 s = (const U8*)SvPV_const(sv, len);
6093 if ((I32)len < *offsetp)
6094 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6096 const U8* send = s + *offsetp;
6098 STRLEN *cache = NULL;
6102 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6103 mg = mg_find(sv, PERL_MAGIC_utf8);
6104 if (mg && mg->mg_ptr) {
6105 cache = (STRLEN *) mg->mg_ptr;
6106 if (cache[1] == (STRLEN)*offsetp) {
6107 /* An exact match. */
6108 *offsetp = cache[0];
6112 else if (cache[1] < (STRLEN)*offsetp) {
6113 /* We already know part of the way. */
6116 /* Let the below loop do the rest. */
6118 else { /* cache[1] > *offsetp */
6119 /* We already know all of the way, now we may
6120 * be able to walk back. The same assumption
6121 * is made as in S_utf8_mg_pos(), namely that
6122 * walking backward is twice slower than
6123 * walking forward. */
6124 STRLEN forw = *offsetp;
6125 STRLEN backw = cache[1] - *offsetp;
6127 if (!(forw < 2 * backw)) {
6128 const U8 *p = s + cache[1];
6135 while (UTF8_IS_CONTINUATION(*p)) {
6143 *offsetp = cache[0];
6145 /* Drop the stale "length" cache */
6153 ASSERT_UTF8_CACHE(cache);
6159 /* Call utf8n_to_uvchr() to validate the sequence
6160 * (unless a simple non-UTF character) */
6161 if (!UTF8_IS_INVARIANT(*s))
6162 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6171 if (!SvREADONLY(sv)) {
6173 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6174 mg = mg_find(sv, PERL_MAGIC_utf8);
6179 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6180 mg->mg_ptr = (char *) cache;
6185 cache[1] = *offsetp;
6186 /* Drop the stale "length" cache */
6199 Returns a boolean indicating whether the strings in the two SVs are
6200 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6201 coerce its args to strings if necessary.
6207 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6215 SV* svrecode = Nullsv;
6222 pv1 = SvPV_const(sv1, cur1);
6229 pv2 = SvPV_const(sv2, cur2);
6231 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6232 /* Differing utf8ness.
6233 * Do not UTF8size the comparands as a side-effect. */
6236 svrecode = newSVpvn(pv2, cur2);
6237 sv_recode_to_utf8(svrecode, PL_encoding);
6238 pv2 = SvPV_const(svrecode, cur2);
6241 svrecode = newSVpvn(pv1, cur1);
6242 sv_recode_to_utf8(svrecode, PL_encoding);
6243 pv1 = SvPV_const(svrecode, cur1);
6245 /* Now both are in UTF-8. */
6247 SvREFCNT_dec(svrecode);
6252 bool is_utf8 = TRUE;
6255 /* sv1 is the UTF-8 one,
6256 * if is equal it must be downgrade-able */
6257 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6263 /* sv2 is the UTF-8 one,
6264 * if is equal it must be downgrade-able */
6265 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6271 /* Downgrade not possible - cannot be eq */
6279 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6282 SvREFCNT_dec(svrecode);
6293 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6294 string in C<sv1> is less than, equal to, or greater than the string in
6295 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6296 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6302 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6305 const char *pv1, *pv2;
6308 SV *svrecode = Nullsv;
6315 pv1 = SvPV_const(sv1, cur1);
6322 pv2 = SvPV_const(sv2, cur2);
6324 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6325 /* Differing utf8ness.
6326 * Do not UTF8size the comparands as a side-effect. */
6329 svrecode = newSVpvn(pv2, cur2);
6330 sv_recode_to_utf8(svrecode, PL_encoding);
6331 pv2 = SvPV_const(svrecode, cur2);
6334 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6339 svrecode = newSVpvn(pv1, cur1);
6340 sv_recode_to_utf8(svrecode, PL_encoding);
6341 pv1 = SvPV_const(svrecode, cur1);
6344 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6350 cmp = cur2 ? -1 : 0;
6354 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6357 cmp = retval < 0 ? -1 : 1;
6358 } else if (cur1 == cur2) {
6361 cmp = cur1 < cur2 ? -1 : 1;
6366 SvREFCNT_dec(svrecode);
6375 =for apidoc sv_cmp_locale
6377 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6378 'use bytes' aware, handles get magic, and will coerce its args to strings
6379 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6385 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6387 #ifdef USE_LOCALE_COLLATE
6393 if (PL_collation_standard)
6397 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6399 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6401 if (!pv1 || !len1) {
6412 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6415 return retval < 0 ? -1 : 1;
6418 * When the result of collation is equality, that doesn't mean
6419 * that there are no differences -- some locales exclude some
6420 * characters from consideration. So to avoid false equalities,
6421 * we use the raw string as a tiebreaker.
6427 #endif /* USE_LOCALE_COLLATE */
6429 return sv_cmp(sv1, sv2);
6433 #ifdef USE_LOCALE_COLLATE
6436 =for apidoc sv_collxfrm
6438 Add Collate Transform magic to an SV if it doesn't already have it.
6440 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6441 scalar data of the variable, but transformed to such a format that a normal
6442 memory comparison can be used to compare the data according to the locale
6449 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6453 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6454 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6460 Safefree(mg->mg_ptr);
6461 s = SvPV_const(sv, len);
6462 if ((xf = mem_collxfrm(s, len, &xlen))) {
6463 if (SvREADONLY(sv)) {
6466 return xf + sizeof(PL_collation_ix);
6469 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6470 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6483 if (mg && mg->mg_ptr) {
6485 return mg->mg_ptr + sizeof(PL_collation_ix);
6493 #endif /* USE_LOCALE_COLLATE */
6498 Get a line from the filehandle and store it into the SV, optionally
6499 appending to the currently-stored string.
6505 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6509 register STDCHAR rslast;
6510 register STDCHAR *bp;
6516 if (SvTHINKFIRST(sv))
6517 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6518 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6520 However, perlbench says it's slower, because the existing swipe code
6521 is faster than copy on write.
6522 Swings and roundabouts. */
6523 SvUPGRADE(sv, SVt_PV);
6528 if (PerlIO_isutf8(fp)) {
6530 sv_utf8_upgrade_nomg(sv);
6531 sv_pos_u2b(sv,&append,0);
6533 } else if (SvUTF8(sv)) {
6534 SV *tsv = NEWSV(0,0);
6535 sv_gets(tsv, fp, 0);
6536 sv_utf8_upgrade_nomg(tsv);
6537 SvCUR_set(sv,append);
6540 goto return_string_or_null;
6545 if (PerlIO_isutf8(fp))
6548 if (IN_PERL_COMPILETIME) {
6549 /* we always read code in line mode */
6553 else if (RsSNARF(PL_rs)) {
6554 /* If it is a regular disk file use size from stat() as estimate
6555 of amount we are going to read - may result in malloc-ing
6556 more memory than we realy need if layers bellow reduce
6557 size we read (e.g. CRLF or a gzip layer)
6560 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6561 const Off_t offset = PerlIO_tell(fp);
6562 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6563 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6569 else if (RsRECORD(PL_rs)) {
6573 /* Grab the size of the record we're getting */
6574 recsize = SvIV(SvRV(PL_rs));
6575 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6578 /* VMS wants read instead of fread, because fread doesn't respect */
6579 /* RMS record boundaries. This is not necessarily a good thing to be */
6580 /* doing, but we've got no other real choice - except avoid stdio
6581 as implementation - perhaps write a :vms layer ?
6583 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6585 bytesread = PerlIO_read(fp, buffer, recsize);
6589 SvCUR_set(sv, bytesread += append);
6590 buffer[bytesread] = '\0';
6591 goto return_string_or_null;
6593 else if (RsPARA(PL_rs)) {
6599 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6600 if (PerlIO_isutf8(fp)) {
6601 rsptr = SvPVutf8(PL_rs, rslen);
6604 if (SvUTF8(PL_rs)) {
6605 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6606 Perl_croak(aTHX_ "Wide character in $/");
6609 rsptr = SvPV_const(PL_rs, rslen);
6613 rslast = rslen ? rsptr[rslen - 1] : '\0';
6615 if (rspara) { /* have to do this both before and after */
6616 do { /* to make sure file boundaries work right */
6619 i = PerlIO_getc(fp);
6623 PerlIO_ungetc(fp,i);
6629 /* See if we know enough about I/O mechanism to cheat it ! */
6631 /* This used to be #ifdef test - it is made run-time test for ease
6632 of abstracting out stdio interface. One call should be cheap
6633 enough here - and may even be a macro allowing compile
6637 if (PerlIO_fast_gets(fp)) {
6640 * We're going to steal some values from the stdio struct
6641 * and put EVERYTHING in the innermost loop into registers.
6643 register STDCHAR *ptr;
6647 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6648 /* An ungetc()d char is handled separately from the regular
6649 * buffer, so we getc() it back out and stuff it in the buffer.
6651 i = PerlIO_getc(fp);
6652 if (i == EOF) return 0;
6653 *(--((*fp)->_ptr)) = (unsigned char) i;
6657 /* Here is some breathtakingly efficient cheating */
6659 cnt = PerlIO_get_cnt(fp); /* get count into register */
6660 /* make sure we have the room */
6661 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6662 /* Not room for all of it
6663 if we are looking for a separator and room for some
6665 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6666 /* just process what we have room for */
6667 shortbuffered = cnt - SvLEN(sv) + append + 1;
6668 cnt -= shortbuffered;
6672 /* remember that cnt can be negative */
6673 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6678 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6679 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6680 DEBUG_P(PerlIO_printf(Perl_debug_log,
6681 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6682 DEBUG_P(PerlIO_printf(Perl_debug_log,
6683 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6684 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6685 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6690 while (cnt > 0) { /* this | eat */
6692 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6693 goto thats_all_folks; /* screams | sed :-) */
6697 Copy(ptr, bp, cnt, char); /* this | eat */
6698 bp += cnt; /* screams | dust */
6699 ptr += cnt; /* louder | sed :-) */
6704 if (shortbuffered) { /* oh well, must extend */
6705 cnt = shortbuffered;
6707 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6709 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6710 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6714 DEBUG_P(PerlIO_printf(Perl_debug_log,
6715 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6716 PTR2UV(ptr),(long)cnt));
6717 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6719 DEBUG_P(PerlIO_printf(Perl_debug_log,
6720 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6721 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6722 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6724 /* This used to call 'filbuf' in stdio form, but as that behaves like
6725 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6726 another abstraction. */
6727 i = PerlIO_getc(fp); /* get more characters */
6729 DEBUG_P(PerlIO_printf(Perl_debug_log,
6730 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6731 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6732 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6734 cnt = PerlIO_get_cnt(fp);
6735 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6736 DEBUG_P(PerlIO_printf(Perl_debug_log,
6737 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6739 if (i == EOF) /* all done for ever? */
6740 goto thats_really_all_folks;
6742 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6744 SvGROW(sv, bpx + cnt + 2);
6745 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6747 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6749 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6750 goto thats_all_folks;
6754 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6755 memNE((char*)bp - rslen, rsptr, rslen))
6756 goto screamer; /* go back to the fray */
6757 thats_really_all_folks:
6759 cnt += shortbuffered;
6760 DEBUG_P(PerlIO_printf(Perl_debug_log,
6761 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6762 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6763 DEBUG_P(PerlIO_printf(Perl_debug_log,
6764 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6765 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6766 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6768 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6769 DEBUG_P(PerlIO_printf(Perl_debug_log,
6770 "Screamer: done, len=%ld, string=|%.*s|\n",
6771 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6775 /*The big, slow, and stupid way. */
6776 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6778 New(0, buf, 8192, STDCHAR);
6786 const register STDCHAR *bpe = buf + sizeof(buf);
6788 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6789 ; /* keep reading */
6793 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6794 /* Accomodate broken VAXC compiler, which applies U8 cast to
6795 * both args of ?: operator, causing EOF to change into 255
6798 i = (U8)buf[cnt - 1];
6804 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6806 sv_catpvn(sv, (char *) buf, cnt);
6808 sv_setpvn(sv, (char *) buf, cnt);
6810 if (i != EOF && /* joy */
6812 SvCUR(sv) < rslen ||
6813 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6817 * If we're reading from a TTY and we get a short read,
6818 * indicating that the user hit his EOF character, we need
6819 * to notice it now, because if we try to read from the TTY
6820 * again, the EOF condition will disappear.
6822 * The comparison of cnt to sizeof(buf) is an optimization
6823 * that prevents unnecessary calls to feof().
6827 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6831 #ifdef USE_HEAP_INSTEAD_OF_STACK
6836 if (rspara) { /* have to do this both before and after */
6837 while (i != EOF) { /* to make sure file boundaries work right */
6838 i = PerlIO_getc(fp);
6840 PerlIO_ungetc(fp,i);
6846 return_string_or_null:
6847 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6853 Auto-increment of the value in the SV, doing string to numeric conversion
6854 if necessary. Handles 'get' magic.
6860 Perl_sv_inc(pTHX_ register SV *sv)
6869 if (SvTHINKFIRST(sv)) {
6871 sv_force_normal_flags(sv, 0);
6872 if (SvREADONLY(sv)) {
6873 if (IN_PERL_RUNTIME)
6874 Perl_croak(aTHX_ PL_no_modify);
6878 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6880 i = PTR2IV(SvRV(sv));
6885 flags = SvFLAGS(sv);
6886 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6887 /* It's (privately or publicly) a float, but not tested as an
6888 integer, so test it to see. */
6890 flags = SvFLAGS(sv);
6892 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6893 /* It's publicly an integer, or privately an integer-not-float */
6894 #ifdef PERL_PRESERVE_IVUV
6898 if (SvUVX(sv) == UV_MAX)
6899 sv_setnv(sv, UV_MAX_P1);
6901 (void)SvIOK_only_UV(sv);
6902 SvUV_set(sv, SvUVX(sv) + 1);
6904 if (SvIVX(sv) == IV_MAX)
6905 sv_setuv(sv, (UV)IV_MAX + 1);
6907 (void)SvIOK_only(sv);
6908 SvIV_set(sv, SvIVX(sv) + 1);
6913 if (flags & SVp_NOK) {
6914 (void)SvNOK_only(sv);
6915 SvNV_set(sv, SvNVX(sv) + 1.0);
6919 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6920 if ((flags & SVTYPEMASK) < SVt_PVIV)
6921 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6922 (void)SvIOK_only(sv);
6927 while (isALPHA(*d)) d++;
6928 while (isDIGIT(*d)) d++;
6930 #ifdef PERL_PRESERVE_IVUV
6931 /* Got to punt this as an integer if needs be, but we don't issue
6932 warnings. Probably ought to make the sv_iv_please() that does
6933 the conversion if possible, and silently. */
6934 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6935 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6936 /* Need to try really hard to see if it's an integer.
6937 9.22337203685478e+18 is an integer.
6938 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6939 so $a="9.22337203685478e+18"; $a+0; $a++
6940 needs to be the same as $a="9.22337203685478e+18"; $a++
6947 /* sv_2iv *should* have made this an NV */
6948 if (flags & SVp_NOK) {
6949 (void)SvNOK_only(sv);
6950 SvNV_set(sv, SvNVX(sv) + 1.0);
6953 /* I don't think we can get here. Maybe I should assert this
6954 And if we do get here I suspect that sv_setnv will croak. NWC
6956 #if defined(USE_LONG_DOUBLE)
6957 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",
6958 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6960 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6961 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6964 #endif /* PERL_PRESERVE_IVUV */
6965 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6969 while (d >= SvPVX_const(sv)) {
6977 /* MKS: The original code here died if letters weren't consecutive.
6978 * at least it didn't have to worry about non-C locales. The
6979 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6980 * arranged in order (although not consecutively) and that only
6981 * [A-Za-z] are accepted by isALPHA in the C locale.
6983 if (*d != 'z' && *d != 'Z') {
6984 do { ++*d; } while (!isALPHA(*d));
6987 *(d--) -= 'z' - 'a';
6992 *(d--) -= 'z' - 'a' + 1;
6996 /* oh,oh, the number grew */
6997 SvGROW(sv, SvCUR(sv) + 2);
6998 SvCUR_set(sv, SvCUR(sv) + 1);
6999 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
7010 Auto-decrement of the value in the SV, doing string to numeric conversion
7011 if necessary. Handles 'get' magic.
7017 Perl_sv_dec(pTHX_ register SV *sv)
7025 if (SvTHINKFIRST(sv)) {
7027 sv_force_normal_flags(sv, 0);
7028 if (SvREADONLY(sv)) {
7029 if (IN_PERL_RUNTIME)
7030 Perl_croak(aTHX_ PL_no_modify);
7034 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7036 i = PTR2IV(SvRV(sv));
7041 /* Unlike sv_inc we don't have to worry about string-never-numbers
7042 and keeping them magic. But we mustn't warn on punting */
7043 flags = SvFLAGS(sv);
7044 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7045 /* It's publicly an integer, or privately an integer-not-float */
7046 #ifdef PERL_PRESERVE_IVUV
7050 if (SvUVX(sv) == 0) {
7051 (void)SvIOK_only(sv);
7055 (void)SvIOK_only_UV(sv);
7056 SvUV_set(sv, SvUVX(sv) + 1);
7059 if (SvIVX(sv) == IV_MIN)
7060 sv_setnv(sv, (NV)IV_MIN - 1.0);
7062 (void)SvIOK_only(sv);
7063 SvIV_set(sv, SvIVX(sv) - 1);
7068 if (flags & SVp_NOK) {
7069 SvNV_set(sv, SvNVX(sv) - 1.0);
7070 (void)SvNOK_only(sv);
7073 if (!(flags & SVp_POK)) {
7074 if ((flags & SVTYPEMASK) < SVt_PVNV)
7075 sv_upgrade(sv, SVt_NV);
7077 (void)SvNOK_only(sv);
7080 #ifdef PERL_PRESERVE_IVUV
7082 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7083 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7084 /* Need to try really hard to see if it's an integer.
7085 9.22337203685478e+18 is an integer.
7086 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7087 so $a="9.22337203685478e+18"; $a+0; $a--
7088 needs to be the same as $a="9.22337203685478e+18"; $a--
7095 /* sv_2iv *should* have made this an NV */
7096 if (flags & SVp_NOK) {
7097 (void)SvNOK_only(sv);
7098 SvNV_set(sv, SvNVX(sv) - 1.0);
7101 /* I don't think we can get here. Maybe I should assert this
7102 And if we do get here I suspect that sv_setnv will croak. NWC
7104 #if defined(USE_LONG_DOUBLE)
7105 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",
7106 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7108 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7109 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7113 #endif /* PERL_PRESERVE_IVUV */
7114 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7118 =for apidoc sv_mortalcopy
7120 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7121 The new SV is marked as mortal. It will be destroyed "soon", either by an
7122 explicit call to FREETMPS, or by an implicit call at places such as
7123 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7128 /* Make a string that will exist for the duration of the expression
7129 * evaluation. Actually, it may have to last longer than that, but
7130 * hopefully we won't free it until it has been assigned to a
7131 * permanent location. */
7134 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7139 sv_setsv(sv,oldstr);
7141 PL_tmps_stack[++PL_tmps_ix] = sv;
7147 =for apidoc sv_newmortal
7149 Creates a new null SV which is mortal. The reference count of the SV is
7150 set to 1. It will be destroyed "soon", either by an explicit call to
7151 FREETMPS, or by an implicit call at places such as statement boundaries.
7152 See also C<sv_mortalcopy> and C<sv_2mortal>.
7158 Perl_sv_newmortal(pTHX)
7163 SvFLAGS(sv) = SVs_TEMP;
7165 PL_tmps_stack[++PL_tmps_ix] = sv;
7170 =for apidoc sv_2mortal
7172 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7173 by an explicit call to FREETMPS, or by an implicit call at places such as
7174 statement boundaries. SvTEMP() is turned on which means that the SV's
7175 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7176 and C<sv_mortalcopy>.
7182 Perl_sv_2mortal(pTHX_ register SV *sv)
7187 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7190 PL_tmps_stack[++PL_tmps_ix] = sv;
7198 Creates a new SV and copies a string into it. The reference count for the
7199 SV is set to 1. If C<len> is zero, Perl will compute the length using
7200 strlen(). For efficiency, consider using C<newSVpvn> instead.
7206 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7211 sv_setpvn(sv,s,len ? len : strlen(s));
7216 =for apidoc newSVpvn
7218 Creates a new SV and copies a string into it. The reference count for the
7219 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7220 string. You are responsible for ensuring that the source string is at least
7221 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7227 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7232 sv_setpvn(sv,s,len);
7238 =for apidoc newSVhek
7240 Creates a new SV from the hash key structure. It will generate scalars that
7241 point to the shared string table where possible. Returns a new (undefined)
7242 SV if the hek is NULL.
7248 Perl_newSVhek(pTHX_ const HEK *hek)
7257 if (HEK_LEN(hek) == HEf_SVKEY) {
7258 return newSVsv(*(SV**)HEK_KEY(hek));
7260 const int flags = HEK_FLAGS(hek);
7261 if (flags & HVhek_WASUTF8) {
7263 Andreas would like keys he put in as utf8 to come back as utf8
7265 STRLEN utf8_len = HEK_LEN(hek);
7266 U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7267 SV *sv = newSVpvn ((char*)as_utf8, utf8_len);
7270 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7272 } else if (flags & HVhek_REHASH) {
7273 /* We don't have a pointer to the hv, so we have to replicate the
7274 flag into every HEK. This hv is using custom a hasing
7275 algorithm. Hence we can't return a shared string scalar, as
7276 that would contain the (wrong) hash value, and might get passed
7277 into an hv routine with a regular hash */
7279 SV *sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7284 /* This will be overwhelminly the most common case. */
7285 return newSVpvn_share(HEK_KEY(hek),
7286 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7292 =for apidoc newSVpvn_share
7294 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7295 table. If the string does not already exist in the table, it is created
7296 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7297 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7298 otherwise the hash is computed. The idea here is that as the string table
7299 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7300 hash lookup will avoid string compare.
7306 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7309 bool is_utf8 = FALSE;
7311 STRLEN tmplen = -len;
7313 /* See the note in hv.c:hv_fetch() --jhi */
7314 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7318 PERL_HASH(hash, src, len);
7320 sv_upgrade(sv, SVt_PV);
7321 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7333 #if defined(PERL_IMPLICIT_CONTEXT)
7335 /* pTHX_ magic can't cope with varargs, so this is a no-context
7336 * version of the main function, (which may itself be aliased to us).
7337 * Don't access this version directly.
7341 Perl_newSVpvf_nocontext(const char* pat, ...)
7346 va_start(args, pat);
7347 sv = vnewSVpvf(pat, &args);
7354 =for apidoc newSVpvf
7356 Creates a new SV and initializes it with the string formatted like
7363 Perl_newSVpvf(pTHX_ const char* pat, ...)
7367 va_start(args, pat);
7368 sv = vnewSVpvf(pat, &args);
7373 /* backend for newSVpvf() and newSVpvf_nocontext() */
7376 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7380 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7387 Creates a new SV and copies a floating point value into it.
7388 The reference count for the SV is set to 1.
7394 Perl_newSVnv(pTHX_ NV n)
7406 Creates a new SV and copies an integer into it. The reference count for the
7413 Perl_newSViv(pTHX_ IV i)
7425 Creates a new SV and copies an unsigned integer into it.
7426 The reference count for the SV is set to 1.
7432 Perl_newSVuv(pTHX_ UV u)
7442 =for apidoc newRV_noinc
7444 Creates an RV wrapper for an SV. The reference count for the original
7445 SV is B<not> incremented.
7451 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7456 sv_upgrade(sv, SVt_RV);
7458 SvRV_set(sv, tmpRef);
7463 /* newRV_inc is the official function name to use now.
7464 * newRV_inc is in fact #defined to newRV in sv.h
7468 Perl_newRV(pTHX_ SV *tmpRef)
7470 return newRV_noinc(SvREFCNT_inc(tmpRef));
7476 Creates a new SV which is an exact duplicate of the original SV.
7483 Perl_newSVsv(pTHX_ register SV *old)
7489 if (SvTYPE(old) == SVTYPEMASK) {
7490 if (ckWARN_d(WARN_INTERNAL))
7491 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7495 /* SV_GMAGIC is the default for sv_setv()
7496 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7497 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7498 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7503 =for apidoc sv_reset
7505 Underlying implementation for the C<reset> Perl function.
7506 Note that the perl-level function is vaguely deprecated.
7512 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7515 char todo[PERL_UCHAR_MAX+1];
7520 if (!*s) { /* reset ?? searches */
7521 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7523 PMOP *pm = (PMOP *) mg->mg_obj;
7525 pm->op_pmdynflags &= ~PMdf_USED;
7532 /* reset variables */
7534 if (!HvARRAY(stash))
7537 Zero(todo, 256, char);
7540 I32 i = (unsigned char)*s;
7544 max = (unsigned char)*s++;
7545 for ( ; i <= max; i++) {
7548 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7550 for (entry = HvARRAY(stash)[i];
7552 entry = HeNEXT(entry))
7557 if (!todo[(U8)*HeKEY(entry)])
7559 gv = (GV*)HeVAL(entry);
7561 if (SvTHINKFIRST(sv)) {
7562 if (!SvREADONLY(sv) && SvROK(sv))
7567 if (SvTYPE(sv) >= SVt_PV) {
7569 if (SvPVX_const(sv) != Nullch)
7576 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7579 #ifdef USE_ENVIRON_ARRAY
7581 # ifdef USE_ITHREADS
7582 && PL_curinterp == aTHX
7586 environ[0] = Nullch;
7589 #endif /* !PERL_MICRO */
7599 Using various gambits, try to get an IO from an SV: the IO slot if its a
7600 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7601 named after the PV if we're a string.
7607 Perl_sv_2io(pTHX_ SV *sv)
7612 switch (SvTYPE(sv)) {
7620 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7624 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7626 return sv_2io(SvRV(sv));
7627 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7633 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7642 Using various gambits, try to get a CV from an SV; in addition, try if
7643 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7649 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7656 return *gvp = Nullgv, Nullcv;
7657 switch (SvTYPE(sv)) {
7676 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7677 tryAMAGICunDEREF(to_cv);
7680 if (SvTYPE(sv) == SVt_PVCV) {
7689 Perl_croak(aTHX_ "Not a subroutine reference");
7694 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7700 if (lref && !GvCVu(gv)) {
7703 tmpsv = NEWSV(704,0);
7704 gv_efullname3(tmpsv, gv, Nullch);
7705 /* XXX this is probably not what they think they're getting.
7706 * It has the same effect as "sub name;", i.e. just a forward
7708 newSUB(start_subparse(FALSE, 0),
7709 newSVOP(OP_CONST, 0, tmpsv),
7714 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7724 Returns true if the SV has a true value by Perl's rules.
7725 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7726 instead use an in-line version.
7732 Perl_sv_true(pTHX_ register SV *sv)
7737 const register XPV* tXpv;
7738 if ((tXpv = (XPV*)SvANY(sv)) &&
7739 (tXpv->xpv_cur > 1 ||
7740 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7747 return SvIVX(sv) != 0;
7750 return SvNVX(sv) != 0.0;
7752 return sv_2bool(sv);
7760 A private implementation of the C<SvIVx> macro for compilers which can't
7761 cope with complex macro expressions. Always use the macro instead.
7767 Perl_sv_iv(pTHX_ register SV *sv)
7771 return (IV)SvUVX(sv);
7780 A private implementation of the C<SvUVx> macro for compilers which can't
7781 cope with complex macro expressions. Always use the macro instead.
7787 Perl_sv_uv(pTHX_ register SV *sv)
7792 return (UV)SvIVX(sv);
7800 A private implementation of the C<SvNVx> macro for compilers which can't
7801 cope with complex macro expressions. Always use the macro instead.
7807 Perl_sv_nv(pTHX_ register SV *sv)
7814 /* sv_pv() is now a macro using SvPV_nolen();
7815 * this function provided for binary compatibility only
7819 Perl_sv_pv(pTHX_ SV *sv)
7824 return sv_2pv(sv, 0);
7830 Use the C<SvPV_nolen> macro instead
7834 A private implementation of the C<SvPV> macro for compilers which can't
7835 cope with complex macro expressions. Always use the macro instead.
7841 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7847 return sv_2pv(sv, lp);
7852 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7858 return sv_2pv_flags(sv, lp, 0);
7861 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7862 * this function provided for binary compatibility only
7866 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7868 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7872 =for apidoc sv_pvn_force
7874 Get a sensible string out of the SV somehow.
7875 A private implementation of the C<SvPV_force> macro for compilers which
7876 can't cope with complex macro expressions. Always use the macro instead.
7878 =for apidoc sv_pvn_force_flags
7880 Get a sensible string out of the SV somehow.
7881 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7882 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7883 implemented in terms of this function.
7884 You normally want to use the various wrapper macros instead: see
7885 C<SvPV_force> and C<SvPV_force_nomg>
7891 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7894 if (SvTHINKFIRST(sv) && !SvROK(sv))
7895 sv_force_normal_flags(sv, 0);
7905 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7907 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7908 sv_reftype(sv,0), OP_NAME(PL_op));
7910 Perl_croak(aTHX_ "Can't coerce readonly %s to string",
7913 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7914 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7918 s = sv_2pv_flags(sv, &len, flags);
7922 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7925 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7926 SvGROW(sv, len + 1);
7927 Move(s,SvPVX_const(sv),len,char);
7932 SvPOK_on(sv); /* validate pointer */
7934 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7935 PTR2UV(sv),SvPVX_const(sv)));
7938 return SvPVX_mutable(sv);
7941 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7942 * this function provided for binary compatibility only
7946 Perl_sv_pvbyte(pTHX_ SV *sv)
7948 sv_utf8_downgrade(sv,0);
7953 =for apidoc sv_pvbyte
7955 Use C<SvPVbyte_nolen> instead.
7957 =for apidoc sv_pvbyten
7959 A private implementation of the C<SvPVbyte> macro for compilers
7960 which can't cope with complex macro expressions. Always use the macro
7967 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7969 sv_utf8_downgrade(sv,0);
7970 return sv_pvn(sv,lp);
7974 =for apidoc sv_pvbyten_force
7976 A private implementation of the C<SvPVbytex_force> macro for compilers
7977 which can't cope with complex macro expressions. Always use the macro
7984 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7986 sv_pvn_force(sv,lp);
7987 sv_utf8_downgrade(sv,0);
7992 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7993 * this function provided for binary compatibility only
7997 Perl_sv_pvutf8(pTHX_ SV *sv)
7999 sv_utf8_upgrade(sv);
8004 =for apidoc sv_pvutf8
8006 Use the C<SvPVutf8_nolen> macro instead
8008 =for apidoc sv_pvutf8n
8010 A private implementation of the C<SvPVutf8> macro for compilers
8011 which can't cope with complex macro expressions. Always use the macro
8018 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8020 sv_utf8_upgrade(sv);
8021 return sv_pvn(sv,lp);
8025 =for apidoc sv_pvutf8n_force
8027 A private implementation of the C<SvPVutf8_force> macro for compilers
8028 which can't cope with complex macro expressions. Always use the macro
8035 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8037 sv_pvn_force(sv,lp);
8038 sv_utf8_upgrade(sv);
8044 =for apidoc sv_reftype
8046 Returns a string describing what the SV is a reference to.
8052 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8054 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8055 inside return suggests a const propagation bug in g++. */
8056 if (ob && SvOBJECT(sv)) {
8057 char *name = HvNAME_get(SvSTASH(sv));
8058 return name ? name : (char *) "__ANON__";
8061 switch (SvTYPE(sv)) {
8078 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8079 /* tied lvalues should appear to be
8080 * scalars for backwards compatitbility */
8081 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8082 ? "SCALAR" : "LVALUE");
8083 case SVt_PVAV: return "ARRAY";
8084 case SVt_PVHV: return "HASH";
8085 case SVt_PVCV: return "CODE";
8086 case SVt_PVGV: return "GLOB";
8087 case SVt_PVFM: return "FORMAT";
8088 case SVt_PVIO: return "IO";
8089 default: return "UNKNOWN";
8095 =for apidoc sv_isobject
8097 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8098 object. If the SV is not an RV, or if the object is not blessed, then this
8105 Perl_sv_isobject(pTHX_ SV *sv)
8122 Returns a boolean indicating whether the SV is blessed into the specified
8123 class. This does not check for subtypes; use C<sv_derived_from> to verify
8124 an inheritance relationship.
8130 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8142 hvname = HvNAME_get(SvSTASH(sv));
8146 return strEQ(hvname, name);
8152 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8153 it will be upgraded to one. If C<classname> is non-null then the new SV will
8154 be blessed in the specified package. The new SV is returned and its
8155 reference count is 1.
8161 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8167 SV_CHECK_THINKFIRST_COW_DROP(rv);
8170 if (SvTYPE(rv) >= SVt_PVMG) {
8171 const U32 refcnt = SvREFCNT(rv);
8175 SvREFCNT(rv) = refcnt;
8178 if (SvTYPE(rv) < SVt_RV)
8179 sv_upgrade(rv, SVt_RV);
8180 else if (SvTYPE(rv) > SVt_RV) {
8191 HV* stash = gv_stashpv(classname, TRUE);
8192 (void)sv_bless(rv, stash);
8198 =for apidoc sv_setref_pv
8200 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8201 argument will be upgraded to an RV. That RV will be modified to point to
8202 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8203 into the SV. The C<classname> argument indicates the package for the
8204 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8205 will have a reference count of 1, and the RV will be returned.
8207 Do not use with other Perl types such as HV, AV, SV, CV, because those
8208 objects will become corrupted by the pointer copy process.
8210 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8216 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8219 sv_setsv(rv, &PL_sv_undef);
8223 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8228 =for apidoc sv_setref_iv
8230 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8231 argument will be upgraded to an RV. That RV will be modified to point to
8232 the new SV. The C<classname> argument indicates the package for the
8233 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8234 will have a reference count of 1, and the RV will be returned.
8240 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8242 sv_setiv(newSVrv(rv,classname), iv);
8247 =for apidoc sv_setref_uv
8249 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8250 argument will be upgraded to an RV. That RV will be modified to point to
8251 the new SV. The C<classname> argument indicates the package for the
8252 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8253 will have a reference count of 1, and the RV will be returned.
8259 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8261 sv_setuv(newSVrv(rv,classname), uv);
8266 =for apidoc sv_setref_nv
8268 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8269 argument will be upgraded to an RV. That RV will be modified to point to
8270 the new SV. The C<classname> argument indicates the package for the
8271 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8272 will have a reference count of 1, and the RV will be returned.
8278 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8280 sv_setnv(newSVrv(rv,classname), nv);
8285 =for apidoc sv_setref_pvn
8287 Copies a string into a new SV, optionally blessing the SV. The length of the
8288 string must be specified with C<n>. The C<rv> argument will be upgraded to
8289 an RV. That RV will be modified to point to the new SV. The C<classname>
8290 argument indicates the package for the blessing. Set C<classname> to
8291 C<Nullch> to avoid the blessing. The new SV will have a reference count
8292 of 1, and the RV will be returned.
8294 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8300 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8302 sv_setpvn(newSVrv(rv,classname), pv, n);
8307 =for apidoc sv_bless
8309 Blesses an SV into a specified package. The SV must be an RV. The package
8310 must be designated by its stash (see C<gv_stashpv()>). The reference count
8311 of the SV is unaffected.
8317 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8321 Perl_croak(aTHX_ "Can't bless non-reference value");
8323 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8324 if (SvREADONLY(tmpRef))
8325 Perl_croak(aTHX_ PL_no_modify);
8326 if (SvOBJECT(tmpRef)) {
8327 if (SvTYPE(tmpRef) != SVt_PVIO)
8329 SvREFCNT_dec(SvSTASH(tmpRef));
8332 SvOBJECT_on(tmpRef);
8333 if (SvTYPE(tmpRef) != SVt_PVIO)
8335 SvUPGRADE(tmpRef, SVt_PVMG);
8336 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8343 if(SvSMAGICAL(tmpRef))
8344 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8352 /* Downgrades a PVGV to a PVMG.
8356 S_sv_unglob(pTHX_ SV *sv)
8360 assert(SvTYPE(sv) == SVt_PVGV);
8365 SvREFCNT_dec(GvSTASH(sv));
8366 GvSTASH(sv) = Nullhv;
8368 sv_unmagic(sv, PERL_MAGIC_glob);
8369 Safefree(GvNAME(sv));
8372 /* need to keep SvANY(sv) in the right arena */
8373 xpvmg = new_XPVMG();
8374 StructCopy(SvANY(sv), xpvmg, XPVMG);
8375 del_XPVGV(SvANY(sv));
8378 SvFLAGS(sv) &= ~SVTYPEMASK;
8379 SvFLAGS(sv) |= SVt_PVMG;
8383 =for apidoc sv_unref_flags
8385 Unsets the RV status of the SV, and decrements the reference count of
8386 whatever was being referenced by the RV. This can almost be thought of
8387 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8388 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8389 (otherwise the decrementing is conditional on the reference count being
8390 different from one or the reference being a readonly SV).
8397 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8401 if (SvWEAKREF(sv)) {
8409 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8410 assigned to as BEGIN {$a = \"Foo"} will fail. */
8411 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8413 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8414 sv_2mortal(rv); /* Schedule for freeing later */
8418 =for apidoc sv_unref
8420 Unsets the RV status of the SV, and decrements the reference count of
8421 whatever was being referenced by the RV. This can almost be thought of
8422 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8423 being zero. See C<SvROK_off>.
8429 Perl_sv_unref(pTHX_ SV *sv)
8431 sv_unref_flags(sv, 0);
8435 =for apidoc sv_taint
8437 Taint an SV. Use C<SvTAINTED_on> instead.
8442 Perl_sv_taint(pTHX_ SV *sv)
8444 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8448 =for apidoc sv_untaint
8450 Untaint an SV. Use C<SvTAINTED_off> instead.
8455 Perl_sv_untaint(pTHX_ SV *sv)
8457 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8458 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8465 =for apidoc sv_tainted
8467 Test an SV for taintedness. Use C<SvTAINTED> instead.
8472 Perl_sv_tainted(pTHX_ SV *sv)
8474 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8475 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8476 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8483 =for apidoc sv_setpviv
8485 Copies an integer into the given SV, also updating its string value.
8486 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8492 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8494 char buf[TYPE_CHARS(UV)];
8496 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8498 sv_setpvn(sv, ptr, ebuf - ptr);
8502 =for apidoc sv_setpviv_mg
8504 Like C<sv_setpviv>, but also handles 'set' magic.
8510 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8512 char buf[TYPE_CHARS(UV)];
8514 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8516 sv_setpvn(sv, ptr, ebuf - ptr);
8520 #if defined(PERL_IMPLICIT_CONTEXT)
8522 /* pTHX_ magic can't cope with varargs, so this is a no-context
8523 * version of the main function, (which may itself be aliased to us).
8524 * Don't access this version directly.
8528 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8532 va_start(args, pat);
8533 sv_vsetpvf(sv, pat, &args);
8537 /* pTHX_ magic can't cope with varargs, so this is a no-context
8538 * version of the main function, (which may itself be aliased to us).
8539 * Don't access this version directly.
8543 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8547 va_start(args, pat);
8548 sv_vsetpvf_mg(sv, pat, &args);
8554 =for apidoc sv_setpvf
8556 Works like C<sv_catpvf> but copies the text into the SV instead of
8557 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8563 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8566 va_start(args, pat);
8567 sv_vsetpvf(sv, pat, &args);
8572 =for apidoc sv_vsetpvf
8574 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8575 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8577 Usually used via its frontend C<sv_setpvf>.
8583 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8585 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8589 =for apidoc sv_setpvf_mg
8591 Like C<sv_setpvf>, but also handles 'set' magic.
8597 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8600 va_start(args, pat);
8601 sv_vsetpvf_mg(sv, pat, &args);
8606 =for apidoc sv_vsetpvf_mg
8608 Like C<sv_vsetpvf>, but also handles 'set' magic.
8610 Usually used via its frontend C<sv_setpvf_mg>.
8616 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8618 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8622 #if defined(PERL_IMPLICIT_CONTEXT)
8624 /* pTHX_ magic can't cope with varargs, so this is a no-context
8625 * version of the main function, (which may itself be aliased to us).
8626 * Don't access this version directly.
8630 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8634 va_start(args, pat);
8635 sv_vcatpvf(sv, pat, &args);
8639 /* pTHX_ magic can't cope with varargs, so this is a no-context
8640 * version of the main function, (which may itself be aliased to us).
8641 * Don't access this version directly.
8645 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8649 va_start(args, pat);
8650 sv_vcatpvf_mg(sv, pat, &args);
8656 =for apidoc sv_catpvf
8658 Processes its arguments like C<sprintf> and appends the formatted
8659 output to an SV. If the appended data contains "wide" characters
8660 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8661 and characters >255 formatted with %c), the original SV might get
8662 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8663 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8664 valid UTF-8; if the original SV was bytes, the pattern should be too.
8669 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8672 va_start(args, pat);
8673 sv_vcatpvf(sv, pat, &args);
8678 =for apidoc sv_vcatpvf
8680 Processes its arguments like C<vsprintf> and appends the formatted output
8681 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8683 Usually used via its frontend C<sv_catpvf>.
8689 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8691 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8695 =for apidoc sv_catpvf_mg
8697 Like C<sv_catpvf>, but also handles 'set' magic.
8703 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8706 va_start(args, pat);
8707 sv_vcatpvf_mg(sv, pat, &args);
8712 =for apidoc sv_vcatpvf_mg
8714 Like C<sv_vcatpvf>, but also handles 'set' magic.
8716 Usually used via its frontend C<sv_catpvf_mg>.
8722 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8724 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8729 =for apidoc sv_vsetpvfn
8731 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8734 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8740 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8742 sv_setpvn(sv, "", 0);
8743 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8746 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8749 S_expect_number(pTHX_ char** pattern)
8752 switch (**pattern) {
8753 case '1': case '2': case '3':
8754 case '4': case '5': case '6':
8755 case '7': case '8': case '9':
8756 while (isDIGIT(**pattern))
8757 var = var * 10 + (*(*pattern)++ - '0');
8761 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8764 F0convert(NV nv, char *endbuf, STRLEN *len)
8766 const int neg = nv < 0;
8775 if (uv & 1 && uv == nv)
8776 uv--; /* Round to even */
8778 const unsigned dig = uv % 10;
8791 =for apidoc sv_vcatpvfn
8793 Processes its arguments like C<vsprintf> and appends the formatted output
8794 to an SV. Uses an array of SVs if the C style variable argument list is
8795 missing (NULL). When running with taint checks enabled, indicates via
8796 C<maybe_tainted> if results are untrustworthy (often due to the use of
8799 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8804 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8807 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8814 static const char nullstr[] = "(null)";
8816 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8817 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8819 /* Times 4: a decimal digit takes more than 3 binary digits.
8820 * NV_DIG: mantissa takes than many decimal digits.
8821 * Plus 32: Playing safe. */
8822 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8823 /* large enough for "%#.#f" --chip */
8824 /* what about long double NVs? --jhi */
8826 /* no matter what, this is a string now */
8827 (void)SvPV_force(sv, origlen);
8829 /* special-case "", "%s", and "%-p" (SVf) */
8832 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8834 const char *s = va_arg(*args, char*);
8835 sv_catpv(sv, s ? s : nullstr);
8837 else if (svix < svmax) {
8838 sv_catsv(sv, *svargs);
8839 if (DO_UTF8(*svargs))
8844 if (patlen == 3 && pat[0] == '%' &&
8845 pat[1] == '-' && pat[2] == 'p') {
8847 argsv = va_arg(*args, SV*);
8848 sv_catsv(sv, argsv);
8855 #ifndef USE_LONG_DOUBLE
8856 /* special-case "%.<number>[gf]" */
8857 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8858 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8859 unsigned digits = 0;
8863 while (*pp >= '0' && *pp <= '9')
8864 digits = 10 * digits + (*pp++ - '0');
8865 if (pp - pat == (int)patlen - 1) {
8869 nv = (NV)va_arg(*args, double);
8870 else if (svix < svmax)
8875 /* Add check for digits != 0 because it seems that some
8876 gconverts are buggy in this case, and we don't yet have
8877 a Configure test for this. */
8878 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8879 /* 0, point, slack */
8880 Gconvert(nv, (int)digits, 0, ebuf);
8882 if (*ebuf) /* May return an empty string for digits==0 */
8885 } else if (!digits) {
8888 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8889 sv_catpvn(sv, p, l);
8895 #endif /* !USE_LONG_DOUBLE */
8897 if (!args && svix < svmax && DO_UTF8(*svargs))
8900 patend = (char*)pat + patlen;
8901 for (p = (char*)pat; p < patend; p = q) {
8904 bool vectorize = FALSE;
8905 bool vectorarg = FALSE;
8906 bool vec_utf8 = FALSE;
8912 bool has_precis = FALSE;
8915 bool is_utf8 = FALSE; /* is this item utf8? */
8916 #ifdef HAS_LDBL_SPRINTF_BUG
8917 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8918 with sfio - Allen <allens@cpan.org> */
8919 bool fix_ldbl_sprintf_bug = FALSE;
8923 U8 utf8buf[UTF8_MAXBYTES+1];
8924 STRLEN esignlen = 0;
8926 const char *eptr = Nullch;
8929 const U8 *vecstr = Null(U8*);
8936 /* we need a long double target in case HAS_LONG_DOUBLE but
8939 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8947 const char *dotstr = ".";
8948 STRLEN dotstrlen = 1;
8949 I32 efix = 0; /* explicit format parameter index */
8950 I32 ewix = 0; /* explicit width index */
8951 I32 epix = 0; /* explicit precision index */
8952 I32 evix = 0; /* explicit vector index */
8953 bool asterisk = FALSE;
8955 /* echo everything up to the next format specification */
8956 for (q = p; q < patend && *q != '%'; ++q) ;
8958 if (has_utf8 && !pat_utf8)
8959 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8961 sv_catpvn(sv, p, q - p);
8968 We allow format specification elements in this order:
8969 \d+\$ explicit format parameter index
8971 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8972 0 flag (as above): repeated to allow "v02"
8973 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8974 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8976 [%bcdefginopsux_DFOUX] format (mandatory)
8978 if (EXPECT_NUMBER(q, width)) {
9019 if (EXPECT_NUMBER(q, ewix))
9028 if ((vectorarg = asterisk)) {
9040 EXPECT_NUMBER(q, width);
9045 vecsv = va_arg(*args, SV*);
9047 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9048 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9049 dotstr = SvPV_const(vecsv, dotstrlen);
9054 vecsv = va_arg(*args, SV*);
9055 vecstr = (U8*)SvPV_const(vecsv,veclen);
9056 vec_utf8 = DO_UTF8(vecsv);
9058 else if (efix ? efix <= svmax : svix < svmax) {
9059 vecsv = svargs[efix ? efix-1 : svix++];
9060 vecstr = (U8*)SvPV_const(vecsv,veclen);
9061 vec_utf8 = DO_UTF8(vecsv);
9062 /* if this is a version object, we need to return the
9063 * stringified representation (which the SvPVX_const has
9064 * already done for us), but not vectorize the args
9066 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9068 q++; /* skip past the rest of the %vd format */
9069 eptr = (const char *) vecstr;
9070 elen = strlen(eptr);
9083 i = va_arg(*args, int);
9085 i = (ewix ? ewix <= svmax : svix < svmax) ?
9086 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9088 width = (i < 0) ? -i : i;
9098 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9100 /* XXX: todo, support specified precision parameter */
9104 i = va_arg(*args, int);
9106 i = (ewix ? ewix <= svmax : svix < svmax)
9107 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9108 precis = (i < 0) ? 0 : i;
9113 precis = precis * 10 + (*q++ - '0');
9122 case 'I': /* Ix, I32x, and I64x */
9124 if (q[1] == '6' && q[2] == '4') {
9130 if (q[1] == '3' && q[2] == '2') {
9140 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9151 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9152 if (*(q + 1) == 'l') { /* lld, llf */
9177 argsv = (efix ? efix <= svmax : svix < svmax) ?
9178 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9185 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9187 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9189 eptr = (char*)utf8buf;
9190 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9201 if (args && !vectorize) {
9202 eptr = va_arg(*args, char*);
9204 #ifdef MACOS_TRADITIONAL
9205 /* On MacOS, %#s format is used for Pascal strings */
9210 elen = strlen(eptr);
9212 eptr = (char *)nullstr;
9213 elen = sizeof nullstr - 1;
9217 eptr = SvPVx_const(argsv, elen);
9218 if (DO_UTF8(argsv)) {
9219 if (has_precis && precis < elen) {
9221 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9224 if (width) { /* fudge width (can't fudge elen) */
9225 width += elen - sv_len_utf8(argsv);
9233 if (has_precis && elen > precis)
9240 if (left && args) { /* SVf */
9249 argsv = va_arg(*args, SV*);
9250 eptr = SvPVx_const(argsv, elen);
9255 if (alt || vectorize)
9257 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9275 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9284 esignbuf[esignlen++] = plus;
9288 case 'h': iv = (short)va_arg(*args, int); break;
9289 case 'l': iv = va_arg(*args, long); break;
9290 case 'V': iv = va_arg(*args, IV); break;
9291 default: iv = va_arg(*args, int); break;
9293 case 'q': iv = va_arg(*args, Quad_t); break;
9298 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9300 case 'h': iv = (short)tiv; break;
9301 case 'l': iv = (long)tiv; break;
9303 default: iv = tiv; break;
9305 case 'q': iv = (Quad_t)tiv; break;
9309 if ( !vectorize ) /* we already set uv above */
9314 esignbuf[esignlen++] = plus;
9318 esignbuf[esignlen++] = '-';
9361 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9372 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9373 case 'l': uv = va_arg(*args, unsigned long); break;
9374 case 'V': uv = va_arg(*args, UV); break;
9375 default: uv = va_arg(*args, unsigned); break;
9377 case 'q': uv = va_arg(*args, Uquad_t); break;
9382 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9384 case 'h': uv = (unsigned short)tuv; break;
9385 case 'l': uv = (unsigned long)tuv; break;
9387 default: uv = tuv; break;
9389 case 'q': uv = (Uquad_t)tuv; break;
9396 char *ptr = ebuf + sizeof ebuf;
9402 p = (char*)((c == 'X')
9403 ? "0123456789ABCDEF" : "0123456789abcdef");
9409 esignbuf[esignlen++] = '0';
9410 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9418 if (alt && *ptr != '0')
9427 esignbuf[esignlen++] = '0';
9428 esignbuf[esignlen++] = 'b';
9431 default: /* it had better be ten or less */
9435 } while (uv /= base);
9438 elen = (ebuf + sizeof ebuf) - ptr;
9442 zeros = precis - elen;
9443 else if (precis == 0 && elen == 1 && *eptr == '0')
9449 /* FLOATING POINT */
9452 c = 'f'; /* maybe %F isn't supported here */
9458 /* This is evil, but floating point is even more evil */
9460 /* for SV-style calling, we can only get NV
9461 for C-style calling, we assume %f is double;
9462 for simplicity we allow any of %Lf, %llf, %qf for long double
9466 #if defined(USE_LONG_DOUBLE)
9470 /* [perl #20339] - we should accept and ignore %lf rather than die */
9474 #if defined(USE_LONG_DOUBLE)
9475 intsize = args ? 0 : 'q';
9479 #if defined(HAS_LONG_DOUBLE)
9488 /* now we need (long double) if intsize == 'q', else (double) */
9489 nv = (args && !vectorize) ?
9490 #if LONG_DOUBLESIZE > DOUBLESIZE
9492 va_arg(*args, long double) :
9493 va_arg(*args, double)
9495 va_arg(*args, double)
9501 if (c != 'e' && c != 'E') {
9503 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9504 will cast our (long double) to (double) */
9505 (void)Perl_frexp(nv, &i);
9506 if (i == PERL_INT_MIN)
9507 Perl_die(aTHX_ "panic: frexp");
9509 need = BIT_DIGITS(i);
9511 need += has_precis ? precis : 6; /* known default */
9516 #ifdef HAS_LDBL_SPRINTF_BUG
9517 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9518 with sfio - Allen <allens@cpan.org> */
9521 # define MY_DBL_MAX DBL_MAX
9522 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9523 # if DOUBLESIZE >= 8
9524 # define MY_DBL_MAX 1.7976931348623157E+308L
9526 # define MY_DBL_MAX 3.40282347E+38L
9530 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9531 # define MY_DBL_MAX_BUG 1L
9533 # define MY_DBL_MAX_BUG MY_DBL_MAX
9537 # define MY_DBL_MIN DBL_MIN
9538 # else /* XXX guessing! -Allen */
9539 # if DOUBLESIZE >= 8
9540 # define MY_DBL_MIN 2.2250738585072014E-308L
9542 # define MY_DBL_MIN 1.17549435E-38L
9546 if ((intsize == 'q') && (c == 'f') &&
9547 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9549 /* it's going to be short enough that
9550 * long double precision is not needed */
9552 if ((nv <= 0L) && (nv >= -0L))
9553 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9555 /* would use Perl_fp_class as a double-check but not
9556 * functional on IRIX - see perl.h comments */
9558 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9559 /* It's within the range that a double can represent */
9560 #if defined(DBL_MAX) && !defined(DBL_MIN)
9561 if ((nv >= ((long double)1/DBL_MAX)) ||
9562 (nv <= (-(long double)1/DBL_MAX)))
9564 fix_ldbl_sprintf_bug = TRUE;
9567 if (fix_ldbl_sprintf_bug == TRUE) {
9577 # undef MY_DBL_MAX_BUG
9580 #endif /* HAS_LDBL_SPRINTF_BUG */
9582 need += 20; /* fudge factor */
9583 if (PL_efloatsize < need) {
9584 Safefree(PL_efloatbuf);
9585 PL_efloatsize = need + 20; /* more fudge */
9586 New(906, PL_efloatbuf, PL_efloatsize, char);
9587 PL_efloatbuf[0] = '\0';
9590 if ( !(width || left || plus || alt) && fill != '0'
9591 && has_precis && intsize != 'q' ) { /* Shortcuts */
9592 /* See earlier comment about buggy Gconvert when digits,
9594 if ( c == 'g' && precis) {
9595 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9596 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9597 goto float_converted;
9598 } else if ( c == 'f' && !precis) {
9599 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9604 char *ptr = ebuf + sizeof ebuf;
9607 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9608 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9609 if (intsize == 'q') {
9610 /* Copy the one or more characters in a long double
9611 * format before the 'base' ([efgEFG]) character to
9612 * the format string. */
9613 static char const prifldbl[] = PERL_PRIfldbl;
9614 char const *p = prifldbl + sizeof(prifldbl) - 3;
9615 while (p >= prifldbl) { *--ptr = *p--; }
9620 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9625 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9637 /* No taint. Otherwise we are in the strange situation
9638 * where printf() taints but print($float) doesn't.
9640 #if defined(HAS_LONG_DOUBLE)
9642 (void)sprintf(PL_efloatbuf, ptr, nv);
9644 (void)sprintf(PL_efloatbuf, ptr, (double)nv);
9646 (void)sprintf(PL_efloatbuf, ptr, nv);
9650 eptr = PL_efloatbuf;
9651 elen = strlen(PL_efloatbuf);
9657 i = SvCUR(sv) - origlen;
9658 if (args && !vectorize) {
9660 case 'h': *(va_arg(*args, short*)) = i; break;
9661 default: *(va_arg(*args, int*)) = i; break;
9662 case 'l': *(va_arg(*args, long*)) = i; break;
9663 case 'V': *(va_arg(*args, IV*)) = i; break;
9665 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9670 sv_setuv_mg(argsv, (UV)i);
9672 continue; /* not "break" */
9678 if (!args && ckWARN(WARN_PRINTF) &&
9679 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9680 SV *msg = sv_newmortal();
9681 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9682 (PL_op->op_type == OP_PRTF) ? "" : "s");
9685 Perl_sv_catpvf(aTHX_ msg,
9686 "\"%%%c\"", c & 0xFF);
9688 Perl_sv_catpvf(aTHX_ msg,
9689 "\"%%\\%03"UVof"\"",
9692 sv_catpv(msg, "end of string");
9693 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9696 /* output mangled stuff ... */
9702 /* ... right here, because formatting flags should not apply */
9703 SvGROW(sv, SvCUR(sv) + elen + 1);
9705 Copy(eptr, p, elen, char);
9708 SvCUR_set(sv, p - SvPVX_const(sv));
9710 continue; /* not "break" */
9713 /* calculate width before utf8_upgrade changes it */
9714 have = esignlen + zeros + elen;
9716 if (is_utf8 != has_utf8) {
9719 sv_utf8_upgrade(sv);
9722 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9723 sv_utf8_upgrade(nsv);
9724 eptr = SvPVX_const(nsv);
9727 SvGROW(sv, SvCUR(sv) + elen + 1);
9732 need = (have > width ? have : width);
9735 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9737 if (esignlen && fill == '0') {
9738 for (i = 0; i < (int)esignlen; i++)
9742 memset(p, fill, gap);
9745 if (esignlen && fill != '0') {
9746 for (i = 0; i < (int)esignlen; i++)
9750 for (i = zeros; i; i--)
9754 Copy(eptr, p, elen, char);
9758 memset(p, ' ', gap);
9763 Copy(dotstr, p, dotstrlen, char);
9767 vectorize = FALSE; /* done iterating over vecstr */
9774 SvCUR_set(sv, p - SvPVX_const(sv));
9782 /* =========================================================================
9784 =head1 Cloning an interpreter
9786 All the macros and functions in this section are for the private use of
9787 the main function, perl_clone().
9789 The foo_dup() functions make an exact copy of an existing foo thinngy.
9790 During the course of a cloning, a hash table is used to map old addresses
9791 to new addresses. The table is created and manipulated with the
9792 ptr_table_* functions.
9796 ============================================================================*/
9799 #if defined(USE_ITHREADS)
9801 #ifndef GpREFCNT_inc
9802 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9806 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9807 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9808 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9809 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9810 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9811 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9812 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9813 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9814 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9815 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9816 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9817 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9818 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9821 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9822 regcomp.c. AMS 20010712 */
9825 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9830 struct reg_substr_datum *s;
9833 return (REGEXP *)NULL;
9835 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9838 len = r->offsets[0];
9839 npar = r->nparens+1;
9841 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9842 Copy(r->program, ret->program, len+1, regnode);
9844 New(0, ret->startp, npar, I32);
9845 Copy(r->startp, ret->startp, npar, I32);
9846 New(0, ret->endp, npar, I32);
9847 Copy(r->startp, ret->startp, npar, I32);
9849 New(0, ret->substrs, 1, struct reg_substr_data);
9850 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9851 s->min_offset = r->substrs->data[i].min_offset;
9852 s->max_offset = r->substrs->data[i].max_offset;
9853 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9854 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9857 ret->regstclass = NULL;
9860 const int count = r->data->count;
9862 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9863 char, struct reg_data);
9864 New(0, d->what, count, U8);
9867 for (i = 0; i < count; i++) {
9868 d->what[i] = r->data->what[i];
9869 switch (d->what[i]) {
9870 /* legal options are one of: sfpont
9871 see also regcomp.h and pregfree() */
9873 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9876 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9879 /* This is cheating. */
9880 New(0, d->data[i], 1, struct regnode_charclass_class);
9881 StructCopy(r->data->data[i], d->data[i],
9882 struct regnode_charclass_class);
9883 ret->regstclass = (regnode*)d->data[i];
9886 /* Compiled op trees are readonly, and can thus be
9887 shared without duplication. */
9889 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9893 d->data[i] = r->data->data[i];
9896 d->data[i] = r->data->data[i];
9898 ((reg_trie_data*)d->data[i])->refcount++;
9902 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9911 New(0, ret->offsets, 2*len+1, U32);
9912 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9914 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9915 ret->refcnt = r->refcnt;
9916 ret->minlen = r->minlen;
9917 ret->prelen = r->prelen;
9918 ret->nparens = r->nparens;
9919 ret->lastparen = r->lastparen;
9920 ret->lastcloseparen = r->lastcloseparen;
9921 ret->reganch = r->reganch;
9923 ret->sublen = r->sublen;
9925 if (RX_MATCH_COPIED(ret))
9926 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9928 ret->subbeg = Nullch;
9929 #ifdef PERL_OLD_COPY_ON_WRITE
9930 ret->saved_copy = Nullsv;
9933 ptr_table_store(PL_ptr_table, r, ret);
9937 /* duplicate a file handle */
9940 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9946 return (PerlIO*)NULL;
9948 /* look for it in the table first */
9949 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9953 /* create anew and remember what it is */
9954 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9955 ptr_table_store(PL_ptr_table, fp, ret);
9959 /* duplicate a directory handle */
9962 Perl_dirp_dup(pTHX_ DIR *dp)
9970 /* duplicate a typeglob */
9973 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9978 /* look for it in the table first */
9979 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9983 /* create anew and remember what it is */
9984 Newz(0, ret, 1, GP);
9985 ptr_table_store(PL_ptr_table, gp, ret);
9988 ret->gp_refcnt = 0; /* must be before any other dups! */
9989 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9990 ret->gp_io = io_dup_inc(gp->gp_io, param);
9991 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9992 ret->gp_av = av_dup_inc(gp->gp_av, param);
9993 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9994 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9995 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9996 ret->gp_cvgen = gp->gp_cvgen;
9997 ret->gp_flags = gp->gp_flags;
9998 ret->gp_line = gp->gp_line;
9999 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10003 /* duplicate a chain of magic */
10006 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10008 MAGIC *mgprev = (MAGIC*)NULL;
10011 return (MAGIC*)NULL;
10012 /* look for it in the table first */
10013 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10017 for (; mg; mg = mg->mg_moremagic) {
10019 Newz(0, nmg, 1, MAGIC);
10021 mgprev->mg_moremagic = nmg;
10024 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10025 nmg->mg_private = mg->mg_private;
10026 nmg->mg_type = mg->mg_type;
10027 nmg->mg_flags = mg->mg_flags;
10028 if (mg->mg_type == PERL_MAGIC_qr) {
10029 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10031 else if(mg->mg_type == PERL_MAGIC_backref) {
10032 const AV * const av = (AV*) mg->mg_obj;
10035 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10037 for (i = AvFILLp(av); i >= 0; i--) {
10038 if (!svp[i]) continue;
10039 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10042 else if (mg->mg_type == PERL_MAGIC_symtab) {
10043 nmg->mg_obj = mg->mg_obj;
10046 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10047 ? sv_dup_inc(mg->mg_obj, param)
10048 : sv_dup(mg->mg_obj, param);
10050 nmg->mg_len = mg->mg_len;
10051 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10052 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10053 if (mg->mg_len > 0) {
10054 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10055 if (mg->mg_type == PERL_MAGIC_overload_table &&
10056 AMT_AMAGIC((AMT*)mg->mg_ptr))
10058 AMT *amtp = (AMT*)mg->mg_ptr;
10059 AMT *namtp = (AMT*)nmg->mg_ptr;
10061 for (i = 1; i < NofAMmeth; i++) {
10062 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10066 else if (mg->mg_len == HEf_SVKEY)
10067 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10069 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10070 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10077 /* create a new pointer-mapping table */
10080 Perl_ptr_table_new(pTHX)
10083 Newz(0, tbl, 1, PTR_TBL_t);
10084 tbl->tbl_max = 511;
10085 tbl->tbl_items = 0;
10086 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10091 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10093 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10096 #define new_pte() new_body(struct ptr_tbl_ent, pte)
10097 #define del_pte(p) del_body(p, struct ptr_tbl_ent, pte)
10099 /* map an existing pointer using a table */
10102 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10104 PTR_TBL_ENT_t *tblent;
10105 const UV hash = PTR_TABLE_HASH(sv);
10107 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10108 for (; tblent; tblent = tblent->next) {
10109 if (tblent->oldval == sv)
10110 return tblent->newval;
10112 return (void*)NULL;
10115 /* add a new entry to a pointer-mapping table */
10118 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10120 PTR_TBL_ENT_t *tblent, **otblent;
10121 /* XXX this may be pessimal on platforms where pointers aren't good
10122 * hash values e.g. if they grow faster in the most significant
10124 const UV hash = PTR_TABLE_HASH(oldv);
10128 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10129 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10130 if (tblent->oldval == oldv) {
10131 tblent->newval = newv;
10135 tblent = new_pte();
10136 tblent->oldval = oldv;
10137 tblent->newval = newv;
10138 tblent->next = *otblent;
10141 if (!empty && tbl->tbl_items > tbl->tbl_max)
10142 ptr_table_split(tbl);
10145 /* double the hash bucket size of an existing ptr table */
10148 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10150 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10151 const UV oldsize = tbl->tbl_max + 1;
10152 UV newsize = oldsize * 2;
10155 Renew(ary, newsize, PTR_TBL_ENT_t*);
10156 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10157 tbl->tbl_max = --newsize;
10158 tbl->tbl_ary = ary;
10159 for (i=0; i < oldsize; i++, ary++) {
10160 PTR_TBL_ENT_t **curentp, **entp, *ent;
10163 curentp = ary + oldsize;
10164 for (entp = ary, ent = *ary; ent; ent = *entp) {
10165 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10167 ent->next = *curentp;
10177 /* remove all the entries from a ptr table */
10180 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10182 register PTR_TBL_ENT_t **array;
10183 register PTR_TBL_ENT_t *entry;
10187 if (!tbl || !tbl->tbl_items) {
10191 array = tbl->tbl_ary;
10193 max = tbl->tbl_max;
10197 PTR_TBL_ENT_t *oentry = entry;
10198 entry = entry->next;
10202 if (++riter > max) {
10205 entry = array[riter];
10209 tbl->tbl_items = 0;
10212 /* clear and free a ptr table */
10215 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10220 ptr_table_clear(tbl);
10221 Safefree(tbl->tbl_ary);
10225 /* attempt to make everything in the typeglob readonly */
10228 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10230 GV *gv = (GV*)sstr;
10231 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10233 if (GvIO(gv) || GvFORM(gv)) {
10234 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10236 else if (!GvCV(gv)) {
10237 GvCV(gv) = (CV*)sv;
10240 /* CvPADLISTs cannot be shared */
10241 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10246 if (!GvUNIQUE(gv)) {
10248 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10249 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10255 * write attempts will die with
10256 * "Modification of a read-only value attempted"
10262 SvREADONLY_on(GvSV(gv));
10266 GvAV(gv) = (AV*)sv;
10269 SvREADONLY_on(GvAV(gv));
10273 GvHV(gv) = (HV*)sv;
10276 SvREADONLY_on(GvHV(gv));
10279 return sstr; /* he_dup() will SvREFCNT_inc() */
10283 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10286 SvRV_set(dstr, SvWEAKREF(sstr)
10287 ? sv_dup(SvRV(sstr), param)
10288 : sv_dup_inc(SvRV(sstr), param));
10291 else if (SvPVX_const(sstr)) {
10292 /* Has something there */
10294 /* Normal PV - clone whole allocated space */
10295 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
10296 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10297 /* Not that normal - actually sstr is copy on write.
10298 But we are a true, independant SV, so: */
10299 SvREADONLY_off(dstr);
10304 /* Special case - not normally malloced for some reason */
10305 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
10306 /* A "shared" PV - clone it as "shared" PV */
10308 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
10312 /* Some other special case - random pointer */
10313 SvPV_set(dstr, SvPVX(sstr));
10318 /* Copy the Null */
10319 if (SvTYPE(dstr) == SVt_RV)
10320 SvRV_set(dstr, NULL);
10326 /* duplicate an SV of any type (including AV, HV etc) */
10329 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10334 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10336 /* look for it in the table first */
10337 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10341 if(param->flags & CLONEf_JOIN_IN) {
10342 /** We are joining here so we don't want do clone
10343 something that is bad **/
10344 const char *hvname;
10346 if(SvTYPE(sstr) == SVt_PVHV &&
10347 (hvname = HvNAME_get(sstr))) {
10348 /** don't clone stashes if they already exist **/
10349 HV* old_stash = gv_stashpv(hvname,0);
10350 return (SV*) old_stash;
10354 /* create anew and remember what it is */
10357 #ifdef DEBUG_LEAKING_SCALARS
10358 dstr->sv_debug_optype = sstr->sv_debug_optype;
10359 dstr->sv_debug_line = sstr->sv_debug_line;
10360 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10361 dstr->sv_debug_cloned = 1;
10363 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10365 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10369 ptr_table_store(PL_ptr_table, sstr, dstr);
10372 SvFLAGS(dstr) = SvFLAGS(sstr);
10373 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10374 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10377 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10378 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10379 PL_watch_pvx, SvPVX_const(sstr));
10382 /* don't clone objects whose class has asked us not to */
10383 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10384 SvFLAGS(dstr) &= ~SVTYPEMASK;
10385 SvOBJECT_off(dstr);
10389 switch (SvTYPE(sstr)) {
10391 SvANY(dstr) = NULL;
10394 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10395 SvIV_set(dstr, SvIVX(sstr));
10398 SvANY(dstr) = new_XNV();
10399 SvNV_set(dstr, SvNVX(sstr));
10402 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10403 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10407 /* These are all the types that need complex bodies allocating. */
10408 size_t new_body_length;
10409 size_t new_body_offset = 0;
10410 void **new_body_arena;
10411 void **new_body_arenaroot;
10414 switch (SvTYPE(sstr)) {
10416 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
10421 new_body = new_XPVIO();
10422 new_body_length = sizeof(XPVIO);
10425 new_body = new_XPVFM();
10426 new_body_length = sizeof(XPVFM);
10430 new_body_arena = (void **) &PL_xpvhv_root;
10431 new_body_arenaroot = (void **) &PL_xpvhv_arenaroot;
10432 new_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill)
10433 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill);
10434 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10435 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10439 new_body_arena = (void **) &PL_xpvav_root;
10440 new_body_arenaroot = (void **) &PL_xpvav_arenaroot;
10441 new_body_offset = STRUCT_OFFSET(XPVAV, xav_fill)
10442 - STRUCT_OFFSET(xpvav_allocated, xav_fill);
10443 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10444 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10448 new_body_length = sizeof(XPVBM);
10449 new_body_arena = (void **) &PL_xpvbm_root;
10450 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
10453 if (GvUNIQUE((GV*)sstr)) {
10455 if ((share = gv_share(sstr, param))) {
10458 ptr_table_store(PL_ptr_table, sstr, dstr);
10460 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10461 HvNAME_get(GvSTASH(share)), GvNAME(share));
10466 new_body_length = sizeof(XPVGV);
10467 new_body_arena = (void **) &PL_xpvgv_root;
10468 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
10471 new_body_length = sizeof(XPVCV);
10472 new_body_arena = (void **) &PL_xpvcv_root;
10473 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
10476 new_body_length = sizeof(XPVLV);
10477 new_body_arena = (void **) &PL_xpvlv_root;
10478 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
10481 new_body_length = sizeof(XPVMG);
10482 new_body_arena = (void **) &PL_xpvmg_root;
10483 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
10486 new_body_length = sizeof(XPVNV);
10487 new_body_arena = (void **) &PL_xpvnv_root;
10488 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
10491 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
10492 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
10493 new_body_length = sizeof(XPVIV) - new_body_offset;
10494 new_body_arena = (void **) &PL_xpviv_root;
10495 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
10498 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
10499 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
10500 new_body_length = sizeof(XPV) - new_body_offset;
10501 new_body_arena = (void **) &PL_xpv_root;
10502 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
10504 assert(new_body_length);
10506 new_body = S_new_body(aTHX_ new_body_arenaroot, new_body_arena,
10507 new_body_length, new_body_offset);
10509 /* We always allocated the full length item with PURIFY */
10510 new_body_length += new_body_offset;
10511 new_body_offset = 0;
10512 new_body = my_safemalloc(new_body_length);
10516 SvANY(dstr) = new_body;
10518 Copy(((char*)SvANY(sstr)) + new_body_offset,
10519 ((char*)SvANY(dstr)) + new_body_offset,
10520 new_body_length, char);
10522 if (SvTYPE(sstr) != SVt_PVAV && SvTYPE(sstr) != SVt_PVHV)
10523 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10525 /* The Copy above means that all the source (unduplicated) pointers
10526 are now in the destination. We can check the flags and the
10527 pointers in either, but it's possible that there's less cache
10528 missing by always going for the destination.
10529 FIXME - instrument and check that assumption */
10530 if (SvTYPE(sstr) >= SVt_PVMG) {
10532 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
10534 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
10537 switch (SvTYPE(sstr)) {
10549 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
10550 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
10551 LvTARG(dstr) = dstr;
10552 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
10553 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
10555 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
10558 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
10559 GvSTASH(dstr) = hv_dup_inc(GvSTASH(dstr), param);
10560 GvGP(dstr) = gp_dup(GvGP(dstr), param);
10561 (void)GpREFCNT_inc(GvGP(dstr));
10564 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
10565 if (IoOFP(dstr) == IoIFP(sstr))
10566 IoOFP(dstr) = IoIFP(dstr);
10568 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
10569 /* PL_rsfp_filters entries have fake IoDIRP() */
10570 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
10571 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
10572 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
10573 /* I have no idea why fake dirp (rsfps)
10574 should be treated differently but otherwise
10575 we end up with leaks -- sky*/
10576 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
10577 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
10578 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
10580 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
10581 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
10582 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
10584 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
10585 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
10586 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
10589 if (AvARRAY((AV*)sstr)) {
10590 SV **dst_ary, **src_ary;
10591 SSize_t items = AvFILLp((AV*)sstr) + 1;
10593 src_ary = AvARRAY((AV*)sstr);
10594 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10595 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10596 SvPV_set(dstr, (char*)dst_ary);
10597 AvALLOC((AV*)dstr) = dst_ary;
10598 if (AvREAL((AV*)sstr)) {
10599 while (items-- > 0)
10600 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10603 while (items-- > 0)
10604 *dst_ary++ = sv_dup(*src_ary++, param);
10606 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10607 while (items-- > 0) {
10608 *dst_ary++ = &PL_sv_undef;
10612 SvPV_set(dstr, Nullch);
10613 AvALLOC((AV*)dstr) = (SV**)NULL;
10620 if (HvARRAY((HV*)sstr)) {
10622 const bool sharekeys = !!HvSHAREKEYS(sstr);
10623 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10624 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10627 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10628 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
10630 HvARRAY(dstr) = (HE**)darray;
10631 while (i <= sxhv->xhv_max) {
10632 HE *source = HvARRAY(sstr)[i];
10633 HvARRAY(dstr)[i] = source
10634 ? he_dup(source, sharekeys, param) : 0;
10638 struct xpvhv_aux *saux = HvAUX(sstr);
10639 struct xpvhv_aux *daux = HvAUX(dstr);
10640 /* This flag isn't copied. */
10641 /* SvOOK_on(hv) attacks the IV flags. */
10642 SvFLAGS(dstr) |= SVf_OOK;
10644 hvname = saux->xhv_name;
10645 daux->xhv_name = hvname ? hek_dup(hvname, param) : hvname;
10647 daux->xhv_riter = saux->xhv_riter;
10648 daux->xhv_eiter = saux->xhv_eiter
10649 ? he_dup(saux->xhv_eiter, (bool)!!HvSHAREKEYS(sstr),
10654 SvPV_set(dstr, Nullch);
10656 /* Record stashes for possible cloning in Perl_clone(). */
10658 av_push(param->stashes, dstr);
10663 /* NOTE: not refcounted */
10664 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
10666 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
10668 if (CvCONST(dstr)) {
10669 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
10670 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
10671 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
10673 /* don't dup if copying back - CvGV isn't refcounted, so the
10674 * duped GV may never be freed. A bit of a hack! DAPM */
10675 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10676 Nullgv : gv_dup(CvGV(dstr), param) ;
10677 if (!(param->flags & CLONEf_COPY_STACKS)) {
10680 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10682 CvWEAKOUTSIDE(sstr)
10683 ? cv_dup( CvOUTSIDE(dstr), param)
10684 : cv_dup_inc(CvOUTSIDE(dstr), param);
10686 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
10693 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10699 /* duplicate a context */
10702 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10704 PERL_CONTEXT *ncxs;
10707 return (PERL_CONTEXT*)NULL;
10709 /* look for it in the table first */
10710 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10714 /* create anew and remember what it is */
10715 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10716 ptr_table_store(PL_ptr_table, cxs, ncxs);
10719 PERL_CONTEXT *cx = &cxs[ix];
10720 PERL_CONTEXT *ncx = &ncxs[ix];
10721 ncx->cx_type = cx->cx_type;
10722 if (CxTYPE(cx) == CXt_SUBST) {
10723 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10726 ncx->blk_oldsp = cx->blk_oldsp;
10727 ncx->blk_oldcop = cx->blk_oldcop;
10728 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10729 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10730 ncx->blk_oldpm = cx->blk_oldpm;
10731 ncx->blk_gimme = cx->blk_gimme;
10732 switch (CxTYPE(cx)) {
10734 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10735 ? cv_dup_inc(cx->blk_sub.cv, param)
10736 : cv_dup(cx->blk_sub.cv,param));
10737 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10738 ? av_dup_inc(cx->blk_sub.argarray, param)
10740 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10741 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10742 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10743 ncx->blk_sub.lval = cx->blk_sub.lval;
10744 ncx->blk_sub.retop = cx->blk_sub.retop;
10747 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10748 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10749 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10750 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10751 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10752 ncx->blk_eval.retop = cx->blk_eval.retop;
10755 ncx->blk_loop.label = cx->blk_loop.label;
10756 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10757 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10758 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10759 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10760 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10761 ? cx->blk_loop.iterdata
10762 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10763 ncx->blk_loop.oldcomppad
10764 = (PAD*)ptr_table_fetch(PL_ptr_table,
10765 cx->blk_loop.oldcomppad);
10766 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10767 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10768 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10769 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10770 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10773 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10774 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10775 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10776 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10777 ncx->blk_sub.retop = cx->blk_sub.retop;
10789 /* duplicate a stack info structure */
10792 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10797 return (PERL_SI*)NULL;
10799 /* look for it in the table first */
10800 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10804 /* create anew and remember what it is */
10805 Newz(56, nsi, 1, PERL_SI);
10806 ptr_table_store(PL_ptr_table, si, nsi);
10808 nsi->si_stack = av_dup_inc(si->si_stack, param);
10809 nsi->si_cxix = si->si_cxix;
10810 nsi->si_cxmax = si->si_cxmax;
10811 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10812 nsi->si_type = si->si_type;
10813 nsi->si_prev = si_dup(si->si_prev, param);
10814 nsi->si_next = si_dup(si->si_next, param);
10815 nsi->si_markoff = si->si_markoff;
10820 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10821 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10822 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10823 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10824 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10825 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10826 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10827 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10828 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10829 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10830 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10831 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10832 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10833 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10836 #define pv_dup_inc(p) SAVEPV(p)
10837 #define pv_dup(p) SAVEPV(p)
10838 #define svp_dup_inc(p,pp) any_dup(p,pp)
10840 /* map any object to the new equivent - either something in the
10841 * ptr table, or something in the interpreter structure
10845 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10850 return (void*)NULL;
10852 /* look for it in the table first */
10853 ret = ptr_table_fetch(PL_ptr_table, v);
10857 /* see if it is part of the interpreter structure */
10858 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10859 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10867 /* duplicate the save stack */
10870 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10872 ANY *ss = proto_perl->Tsavestack;
10873 I32 ix = proto_perl->Tsavestack_ix;
10874 I32 max = proto_perl->Tsavestack_max;
10886 void (*dptr) (void*);
10887 void (*dxptr) (pTHX_ void*);
10890 Newz(54, nss, max, ANY);
10893 I32 i = POPINT(ss,ix);
10894 TOPINT(nss,ix) = i;
10896 case SAVEt_ITEM: /* normal string */
10897 sv = (SV*)POPPTR(ss,ix);
10898 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10899 sv = (SV*)POPPTR(ss,ix);
10900 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10902 case SAVEt_SV: /* scalar reference */
10903 sv = (SV*)POPPTR(ss,ix);
10904 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10905 gv = (GV*)POPPTR(ss,ix);
10906 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10908 case SAVEt_GENERIC_PVREF: /* generic char* */
10909 c = (char*)POPPTR(ss,ix);
10910 TOPPTR(nss,ix) = pv_dup(c);
10911 ptr = POPPTR(ss,ix);
10912 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10914 case SAVEt_SHARED_PVREF: /* char* in shared space */
10915 c = (char*)POPPTR(ss,ix);
10916 TOPPTR(nss,ix) = savesharedpv(c);
10917 ptr = POPPTR(ss,ix);
10918 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10920 case SAVEt_GENERIC_SVREF: /* generic sv */
10921 case SAVEt_SVREF: /* scalar reference */
10922 sv = (SV*)POPPTR(ss,ix);
10923 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10924 ptr = POPPTR(ss,ix);
10925 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10927 case SAVEt_AV: /* array reference */
10928 av = (AV*)POPPTR(ss,ix);
10929 TOPPTR(nss,ix) = av_dup_inc(av, param);
10930 gv = (GV*)POPPTR(ss,ix);
10931 TOPPTR(nss,ix) = gv_dup(gv, param);
10933 case SAVEt_HV: /* hash reference */
10934 hv = (HV*)POPPTR(ss,ix);
10935 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10936 gv = (GV*)POPPTR(ss,ix);
10937 TOPPTR(nss,ix) = gv_dup(gv, param);
10939 case SAVEt_INT: /* int reference */
10940 ptr = POPPTR(ss,ix);
10941 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10942 intval = (int)POPINT(ss,ix);
10943 TOPINT(nss,ix) = intval;
10945 case SAVEt_LONG: /* long reference */
10946 ptr = POPPTR(ss,ix);
10947 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10948 longval = (long)POPLONG(ss,ix);
10949 TOPLONG(nss,ix) = longval;
10951 case SAVEt_I32: /* I32 reference */
10952 case SAVEt_I16: /* I16 reference */
10953 case SAVEt_I8: /* I8 reference */
10954 ptr = POPPTR(ss,ix);
10955 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10957 TOPINT(nss,ix) = i;
10959 case SAVEt_IV: /* IV reference */
10960 ptr = POPPTR(ss,ix);
10961 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10963 TOPIV(nss,ix) = iv;
10965 case SAVEt_SPTR: /* SV* reference */
10966 ptr = POPPTR(ss,ix);
10967 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10968 sv = (SV*)POPPTR(ss,ix);
10969 TOPPTR(nss,ix) = sv_dup(sv, param);
10971 case SAVEt_VPTR: /* random* reference */
10972 ptr = POPPTR(ss,ix);
10973 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10974 ptr = POPPTR(ss,ix);
10975 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10977 case SAVEt_PPTR: /* char* reference */
10978 ptr = POPPTR(ss,ix);
10979 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10980 c = (char*)POPPTR(ss,ix);
10981 TOPPTR(nss,ix) = pv_dup(c);
10983 case SAVEt_HPTR: /* HV* reference */
10984 ptr = POPPTR(ss,ix);
10985 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10986 hv = (HV*)POPPTR(ss,ix);
10987 TOPPTR(nss,ix) = hv_dup(hv, param);
10989 case SAVEt_APTR: /* AV* reference */
10990 ptr = POPPTR(ss,ix);
10991 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10992 av = (AV*)POPPTR(ss,ix);
10993 TOPPTR(nss,ix) = av_dup(av, param);
10996 gv = (GV*)POPPTR(ss,ix);
10997 TOPPTR(nss,ix) = gv_dup(gv, param);
10999 case SAVEt_GP: /* scalar reference */
11000 gp = (GP*)POPPTR(ss,ix);
11001 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11002 (void)GpREFCNT_inc(gp);
11003 gv = (GV*)POPPTR(ss,ix);
11004 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11005 c = (char*)POPPTR(ss,ix);
11006 TOPPTR(nss,ix) = pv_dup(c);
11008 TOPIV(nss,ix) = iv;
11010 TOPIV(nss,ix) = iv;
11013 case SAVEt_MORTALIZESV:
11014 sv = (SV*)POPPTR(ss,ix);
11015 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11018 ptr = POPPTR(ss,ix);
11019 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11020 /* these are assumed to be refcounted properly */
11021 switch (((OP*)ptr)->op_type) {
11023 case OP_LEAVESUBLV:
11027 case OP_LEAVEWRITE:
11028 TOPPTR(nss,ix) = ptr;
11033 TOPPTR(nss,ix) = Nullop;
11038 TOPPTR(nss,ix) = Nullop;
11041 c = (char*)POPPTR(ss,ix);
11042 TOPPTR(nss,ix) = pv_dup_inc(c);
11044 case SAVEt_CLEARSV:
11045 longval = POPLONG(ss,ix);
11046 TOPLONG(nss,ix) = longval;
11049 hv = (HV*)POPPTR(ss,ix);
11050 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11051 c = (char*)POPPTR(ss,ix);
11052 TOPPTR(nss,ix) = pv_dup_inc(c);
11054 TOPINT(nss,ix) = i;
11056 case SAVEt_DESTRUCTOR:
11057 ptr = POPPTR(ss,ix);
11058 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11059 dptr = POPDPTR(ss,ix);
11060 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
11061 any_dup(FPTR2DPTR(void *, dptr),
11064 case SAVEt_DESTRUCTOR_X:
11065 ptr = POPPTR(ss,ix);
11066 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11067 dxptr = POPDXPTR(ss,ix);
11068 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
11069 any_dup(FPTR2DPTR(void *, dxptr),
11072 case SAVEt_REGCONTEXT:
11075 TOPINT(nss,ix) = i;
11078 case SAVEt_STACK_POS: /* Position on Perl stack */
11080 TOPINT(nss,ix) = i;
11082 case SAVEt_AELEM: /* array element */
11083 sv = (SV*)POPPTR(ss,ix);
11084 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11086 TOPINT(nss,ix) = i;
11087 av = (AV*)POPPTR(ss,ix);
11088 TOPPTR(nss,ix) = av_dup_inc(av, param);
11090 case SAVEt_HELEM: /* hash element */
11091 sv = (SV*)POPPTR(ss,ix);
11092 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11093 sv = (SV*)POPPTR(ss,ix);
11094 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11095 hv = (HV*)POPPTR(ss,ix);
11096 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11099 ptr = POPPTR(ss,ix);
11100 TOPPTR(nss,ix) = ptr;
11104 TOPINT(nss,ix) = i;
11106 case SAVEt_COMPPAD:
11107 av = (AV*)POPPTR(ss,ix);
11108 TOPPTR(nss,ix) = av_dup(av, param);
11111 longval = (long)POPLONG(ss,ix);
11112 TOPLONG(nss,ix) = longval;
11113 ptr = POPPTR(ss,ix);
11114 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11115 sv = (SV*)POPPTR(ss,ix);
11116 TOPPTR(nss,ix) = sv_dup(sv, param);
11119 ptr = POPPTR(ss,ix);
11120 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11121 longval = (long)POPBOOL(ss,ix);
11122 TOPBOOL(nss,ix) = (bool)longval;
11124 case SAVEt_SET_SVFLAGS:
11126 TOPINT(nss,ix) = i;
11128 TOPINT(nss,ix) = i;
11129 sv = (SV*)POPPTR(ss,ix);
11130 TOPPTR(nss,ix) = sv_dup(sv, param);
11133 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11141 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11142 * flag to the result. This is done for each stash before cloning starts,
11143 * so we know which stashes want their objects cloned */
11146 do_mark_cloneable_stash(pTHX_ SV *sv)
11148 const HEK *hvname = HvNAME_HEK((HV*)sv);
11150 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11151 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11152 if (cloner && GvCV(cloner)) {
11159 XPUSHs(sv_2mortal(newSVhek(hvname)));
11161 call_sv((SV*)GvCV(cloner), G_SCALAR);
11168 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11176 =for apidoc perl_clone
11178 Create and return a new interpreter by cloning the current one.
11180 perl_clone takes these flags as parameters:
11182 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11183 without it we only clone the data and zero the stacks,
11184 with it we copy the stacks and the new perl interpreter is
11185 ready to run at the exact same point as the previous one.
11186 The pseudo-fork code uses COPY_STACKS while the
11187 threads->new doesn't.
11189 CLONEf_KEEP_PTR_TABLE
11190 perl_clone keeps a ptr_table with the pointer of the old
11191 variable as a key and the new variable as a value,
11192 this allows it to check if something has been cloned and not
11193 clone it again but rather just use the value and increase the
11194 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11195 the ptr_table using the function
11196 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11197 reason to keep it around is if you want to dup some of your own
11198 variable who are outside the graph perl scans, example of this
11199 code is in threads.xs create
11202 This is a win32 thing, it is ignored on unix, it tells perls
11203 win32host code (which is c++) to clone itself, this is needed on
11204 win32 if you want to run two threads at the same time,
11205 if you just want to do some stuff in a separate perl interpreter
11206 and then throw it away and return to the original one,
11207 you don't need to do anything.
11212 /* XXX the above needs expanding by someone who actually understands it ! */
11213 EXTERN_C PerlInterpreter *
11214 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11217 perl_clone(PerlInterpreter *proto_perl, UV flags)
11220 #ifdef PERL_IMPLICIT_SYS
11222 /* perlhost.h so we need to call into it
11223 to clone the host, CPerlHost should have a c interface, sky */
11225 if (flags & CLONEf_CLONE_HOST) {
11226 return perl_clone_host(proto_perl,flags);
11228 return perl_clone_using(proto_perl, flags,
11230 proto_perl->IMemShared,
11231 proto_perl->IMemParse,
11233 proto_perl->IStdIO,
11237 proto_perl->IProc);
11241 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11242 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11243 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11244 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11245 struct IPerlDir* ipD, struct IPerlSock* ipS,
11246 struct IPerlProc* ipP)
11248 /* XXX many of the string copies here can be optimized if they're
11249 * constants; they need to be allocated as common memory and just
11250 * their pointers copied. */
11253 CLONE_PARAMS clone_params;
11254 CLONE_PARAMS* param = &clone_params;
11256 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11257 /* for each stash, determine whether its objects should be cloned */
11258 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11259 PERL_SET_THX(my_perl);
11262 Poison(my_perl, 1, PerlInterpreter);
11264 PL_curcop = (COP *)Nullop;
11268 PL_savestack_ix = 0;
11269 PL_savestack_max = -1;
11270 PL_sig_pending = 0;
11271 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11272 # else /* !DEBUGGING */
11273 Zero(my_perl, 1, PerlInterpreter);
11274 # endif /* DEBUGGING */
11276 /* host pointers */
11278 PL_MemShared = ipMS;
11279 PL_MemParse = ipMP;
11286 #else /* !PERL_IMPLICIT_SYS */
11288 CLONE_PARAMS clone_params;
11289 CLONE_PARAMS* param = &clone_params;
11290 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11291 /* for each stash, determine whether its objects should be cloned */
11292 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11293 PERL_SET_THX(my_perl);
11296 Poison(my_perl, 1, PerlInterpreter);
11298 PL_curcop = (COP *)Nullop;
11302 PL_savestack_ix = 0;
11303 PL_savestack_max = -1;
11304 PL_sig_pending = 0;
11305 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11306 # else /* !DEBUGGING */
11307 Zero(my_perl, 1, PerlInterpreter);
11308 # endif /* DEBUGGING */
11309 #endif /* PERL_IMPLICIT_SYS */
11310 param->flags = flags;
11311 param->proto_perl = proto_perl;
11314 PL_xnv_arenaroot = NULL;
11315 PL_xnv_root = NULL;
11316 PL_xpv_arenaroot = NULL;
11317 PL_xpv_root = NULL;
11318 PL_xpviv_arenaroot = NULL;
11319 PL_xpviv_root = NULL;
11320 PL_xpvnv_arenaroot = NULL;
11321 PL_xpvnv_root = NULL;
11322 PL_xpvcv_arenaroot = NULL;
11323 PL_xpvcv_root = NULL;
11324 PL_xpvav_arenaroot = NULL;
11325 PL_xpvav_root = NULL;
11326 PL_xpvhv_arenaroot = NULL;
11327 PL_xpvhv_root = NULL;
11328 PL_xpvmg_arenaroot = NULL;
11329 PL_xpvmg_root = NULL;
11330 PL_xpvgv_arenaroot = NULL;
11331 PL_xpvgv_root = NULL;
11332 PL_xpvlv_arenaroot = NULL;
11333 PL_xpvlv_root = NULL;
11334 PL_xpvbm_arenaroot = NULL;
11335 PL_xpvbm_root = NULL;
11336 PL_he_arenaroot = NULL;
11338 #if defined(USE_ITHREADS)
11339 PL_pte_arenaroot = NULL;
11340 PL_pte_root = NULL;
11342 PL_nice_chunk = NULL;
11343 PL_nice_chunk_size = 0;
11345 PL_sv_objcount = 0;
11346 PL_sv_root = Nullsv;
11347 PL_sv_arenaroot = Nullsv;
11349 PL_debug = proto_perl->Idebug;
11351 PL_hash_seed = proto_perl->Ihash_seed;
11352 PL_rehash_seed = proto_perl->Irehash_seed;
11354 #ifdef USE_REENTRANT_API
11355 /* XXX: things like -Dm will segfault here in perlio, but doing
11356 * PERL_SET_CONTEXT(proto_perl);
11357 * breaks too many other things
11359 Perl_reentrant_init(aTHX);
11362 /* create SV map for pointer relocation */
11363 PL_ptr_table = ptr_table_new();
11365 /* initialize these special pointers as early as possible */
11366 SvANY(&PL_sv_undef) = NULL;
11367 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11368 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11369 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11371 SvANY(&PL_sv_no) = new_XPVNV();
11372 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11373 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11374 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11375 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11376 SvCUR_set(&PL_sv_no, 0);
11377 SvLEN_set(&PL_sv_no, 1);
11378 SvIV_set(&PL_sv_no, 0);
11379 SvNV_set(&PL_sv_no, 0);
11380 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11382 SvANY(&PL_sv_yes) = new_XPVNV();
11383 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11384 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11385 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11386 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11387 SvCUR_set(&PL_sv_yes, 1);
11388 SvLEN_set(&PL_sv_yes, 2);
11389 SvIV_set(&PL_sv_yes, 1);
11390 SvNV_set(&PL_sv_yes, 1);
11391 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11393 /* create (a non-shared!) shared string table */
11394 PL_strtab = newHV();
11395 HvSHAREKEYS_off(PL_strtab);
11396 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11397 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11399 PL_compiling = proto_perl->Icompiling;
11401 /* These two PVs will be free'd special way so must set them same way op.c does */
11402 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11403 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11405 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11406 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11408 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11409 if (!specialWARN(PL_compiling.cop_warnings))
11410 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11411 if (!specialCopIO(PL_compiling.cop_io))
11412 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11413 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11415 /* pseudo environmental stuff */
11416 PL_origargc = proto_perl->Iorigargc;
11417 PL_origargv = proto_perl->Iorigargv;
11419 param->stashes = newAV(); /* Setup array of objects to call clone on */
11421 #ifdef PERLIO_LAYERS
11422 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11423 PerlIO_clone(aTHX_ proto_perl, param);
11426 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11427 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11428 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11429 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11430 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11431 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11434 PL_minus_c = proto_perl->Iminus_c;
11435 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11436 PL_localpatches = proto_perl->Ilocalpatches;
11437 PL_splitstr = proto_perl->Isplitstr;
11438 PL_preprocess = proto_perl->Ipreprocess;
11439 PL_minus_n = proto_perl->Iminus_n;
11440 PL_minus_p = proto_perl->Iminus_p;
11441 PL_minus_l = proto_perl->Iminus_l;
11442 PL_minus_a = proto_perl->Iminus_a;
11443 PL_minus_F = proto_perl->Iminus_F;
11444 PL_doswitches = proto_perl->Idoswitches;
11445 PL_dowarn = proto_perl->Idowarn;
11446 PL_doextract = proto_perl->Idoextract;
11447 PL_sawampersand = proto_perl->Isawampersand;
11448 PL_unsafe = proto_perl->Iunsafe;
11449 PL_inplace = SAVEPV(proto_perl->Iinplace);
11450 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11451 PL_perldb = proto_perl->Iperldb;
11452 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11453 PL_exit_flags = proto_perl->Iexit_flags;
11455 /* magical thingies */
11456 /* XXX time(&PL_basetime) when asked for? */
11457 PL_basetime = proto_perl->Ibasetime;
11458 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11460 PL_maxsysfd = proto_perl->Imaxsysfd;
11461 PL_multiline = proto_perl->Imultiline;
11462 PL_statusvalue = proto_perl->Istatusvalue;
11464 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11466 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11468 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11469 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11470 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11472 /* Clone the regex array */
11473 PL_regex_padav = newAV();
11475 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11476 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11478 av_push(PL_regex_padav,
11479 sv_dup_inc(regexen[0],param));
11480 for(i = 1; i <= len; i++) {
11481 if(SvREPADTMP(regexen[i])) {
11482 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11484 av_push(PL_regex_padav,
11486 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11487 SvIVX(regexen[i])), param)))
11492 PL_regex_pad = AvARRAY(PL_regex_padav);
11494 /* shortcuts to various I/O objects */
11495 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11496 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11497 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11498 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11499 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11500 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11502 /* shortcuts to regexp stuff */
11503 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11505 /* shortcuts to misc objects */
11506 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11508 /* shortcuts to debugging objects */
11509 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11510 PL_DBline = gv_dup(proto_perl->IDBline, param);
11511 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11512 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11513 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11514 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11515 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11516 PL_lineary = av_dup(proto_perl->Ilineary, param);
11517 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11519 /* symbol tables */
11520 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11521 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11522 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11523 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11524 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11526 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11527 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11528 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11529 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11530 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11531 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11533 PL_sub_generation = proto_perl->Isub_generation;
11535 /* funky return mechanisms */
11536 PL_forkprocess = proto_perl->Iforkprocess;
11538 /* subprocess state */
11539 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11541 /* internal state */
11542 PL_tainting = proto_perl->Itainting;
11543 PL_taint_warn = proto_perl->Itaint_warn;
11544 PL_maxo = proto_perl->Imaxo;
11545 if (proto_perl->Iop_mask)
11546 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11548 PL_op_mask = Nullch;
11549 /* PL_asserting = proto_perl->Iasserting; */
11551 /* current interpreter roots */
11552 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11553 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11554 PL_main_start = proto_perl->Imain_start;
11555 PL_eval_root = proto_perl->Ieval_root;
11556 PL_eval_start = proto_perl->Ieval_start;
11558 /* runtime control stuff */
11559 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11560 PL_copline = proto_perl->Icopline;
11562 PL_filemode = proto_perl->Ifilemode;
11563 PL_lastfd = proto_perl->Ilastfd;
11564 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11567 PL_gensym = proto_perl->Igensym;
11568 PL_preambled = proto_perl->Ipreambled;
11569 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11570 PL_laststatval = proto_perl->Ilaststatval;
11571 PL_laststype = proto_perl->Ilaststype;
11572 PL_mess_sv = Nullsv;
11574 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11575 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11577 /* interpreter atexit processing */
11578 PL_exitlistlen = proto_perl->Iexitlistlen;
11579 if (PL_exitlistlen) {
11580 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11581 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11584 PL_exitlist = (PerlExitListEntry*)NULL;
11585 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11586 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11587 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11589 PL_profiledata = NULL;
11590 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11591 /* PL_rsfp_filters entries have fake IoDIRP() */
11592 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11594 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11596 PAD_CLONE_VARS(proto_perl, param);
11598 #ifdef HAVE_INTERP_INTERN
11599 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11602 /* more statics moved here */
11603 PL_generation = proto_perl->Igeneration;
11604 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11606 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11607 PL_in_clean_all = proto_perl->Iin_clean_all;
11609 PL_uid = proto_perl->Iuid;
11610 PL_euid = proto_perl->Ieuid;
11611 PL_gid = proto_perl->Igid;
11612 PL_egid = proto_perl->Iegid;
11613 PL_nomemok = proto_perl->Inomemok;
11614 PL_an = proto_perl->Ian;
11615 PL_evalseq = proto_perl->Ievalseq;
11616 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11617 PL_origalen = proto_perl->Iorigalen;
11618 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11619 PL_osname = SAVEPV(proto_perl->Iosname);
11620 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11621 PL_sighandlerp = proto_perl->Isighandlerp;
11624 PL_runops = proto_perl->Irunops;
11626 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11629 PL_cshlen = proto_perl->Icshlen;
11630 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11633 PL_lex_state = proto_perl->Ilex_state;
11634 PL_lex_defer = proto_perl->Ilex_defer;
11635 PL_lex_expect = proto_perl->Ilex_expect;
11636 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11637 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11638 PL_lex_starts = proto_perl->Ilex_starts;
11639 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11640 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11641 PL_lex_op = proto_perl->Ilex_op;
11642 PL_lex_inpat = proto_perl->Ilex_inpat;
11643 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11644 PL_lex_brackets = proto_perl->Ilex_brackets;
11645 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11646 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11647 PL_lex_casemods = proto_perl->Ilex_casemods;
11648 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11649 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11651 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11652 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11653 PL_nexttoke = proto_perl->Inexttoke;
11655 /* XXX This is probably masking the deeper issue of why
11656 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11657 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11658 * (A little debugging with a watchpoint on it may help.)
11660 if (SvANY(proto_perl->Ilinestr)) {
11661 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11662 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11663 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11664 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11665 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11666 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11667 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11668 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11669 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11672 PL_linestr = NEWSV(65,79);
11673 sv_upgrade(PL_linestr,SVt_PVIV);
11674 sv_setpvn(PL_linestr,"",0);
11675 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11677 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11678 PL_pending_ident = proto_perl->Ipending_ident;
11679 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11681 PL_expect = proto_perl->Iexpect;
11683 PL_multi_start = proto_perl->Imulti_start;
11684 PL_multi_end = proto_perl->Imulti_end;
11685 PL_multi_open = proto_perl->Imulti_open;
11686 PL_multi_close = proto_perl->Imulti_close;
11688 PL_error_count = proto_perl->Ierror_count;
11689 PL_subline = proto_perl->Isubline;
11690 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11692 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11693 if (SvANY(proto_perl->Ilinestr)) {
11694 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11695 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11696 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11697 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11698 PL_last_lop_op = proto_perl->Ilast_lop_op;
11701 PL_last_uni = SvPVX(PL_linestr);
11702 PL_last_lop = SvPVX(PL_linestr);
11703 PL_last_lop_op = 0;
11705 PL_in_my = proto_perl->Iin_my;
11706 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11708 PL_cryptseen = proto_perl->Icryptseen;
11711 PL_hints = proto_perl->Ihints;
11713 PL_amagic_generation = proto_perl->Iamagic_generation;
11715 #ifdef USE_LOCALE_COLLATE
11716 PL_collation_ix = proto_perl->Icollation_ix;
11717 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11718 PL_collation_standard = proto_perl->Icollation_standard;
11719 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11720 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11721 #endif /* USE_LOCALE_COLLATE */
11723 #ifdef USE_LOCALE_NUMERIC
11724 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11725 PL_numeric_standard = proto_perl->Inumeric_standard;
11726 PL_numeric_local = proto_perl->Inumeric_local;
11727 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11728 #endif /* !USE_LOCALE_NUMERIC */
11730 /* utf8 character classes */
11731 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11732 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11733 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11734 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11735 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11736 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11737 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11738 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11739 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11740 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11741 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11742 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11743 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11744 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11745 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11746 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11747 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11748 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11749 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11750 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11752 /* Did the locale setup indicate UTF-8? */
11753 PL_utf8locale = proto_perl->Iutf8locale;
11754 /* Unicode features (see perlrun/-C) */
11755 PL_unicode = proto_perl->Iunicode;
11757 /* Pre-5.8 signals control */
11758 PL_signals = proto_perl->Isignals;
11760 /* times() ticks per second */
11761 PL_clocktick = proto_perl->Iclocktick;
11763 /* Recursion stopper for PerlIO_find_layer */
11764 PL_in_load_module = proto_perl->Iin_load_module;
11766 /* sort() routine */
11767 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11769 /* Not really needed/useful since the reenrant_retint is "volatile",
11770 * but do it for consistency's sake. */
11771 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11773 /* Hooks to shared SVs and locks. */
11774 PL_sharehook = proto_perl->Isharehook;
11775 PL_lockhook = proto_perl->Ilockhook;
11776 PL_unlockhook = proto_perl->Iunlockhook;
11777 PL_threadhook = proto_perl->Ithreadhook;
11779 PL_runops_std = proto_perl->Irunops_std;
11780 PL_runops_dbg = proto_perl->Irunops_dbg;
11782 #ifdef THREADS_HAVE_PIDS
11783 PL_ppid = proto_perl->Ippid;
11787 PL_last_swash_hv = Nullhv; /* reinits on demand */
11788 PL_last_swash_klen = 0;
11789 PL_last_swash_key[0]= '\0';
11790 PL_last_swash_tmps = (U8*)NULL;
11791 PL_last_swash_slen = 0;
11793 PL_glob_index = proto_perl->Iglob_index;
11794 PL_srand_called = proto_perl->Isrand_called;
11795 PL_uudmap['M'] = 0; /* reinits on demand */
11796 PL_bitcount = Nullch; /* reinits on demand */
11798 if (proto_perl->Ipsig_pend) {
11799 Newz(0, PL_psig_pend, SIG_SIZE, int);
11802 PL_psig_pend = (int*)NULL;
11805 if (proto_perl->Ipsig_ptr) {
11806 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11807 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11808 for (i = 1; i < SIG_SIZE; i++) {
11809 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11810 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11814 PL_psig_ptr = (SV**)NULL;
11815 PL_psig_name = (SV**)NULL;
11818 /* thrdvar.h stuff */
11820 if (flags & CLONEf_COPY_STACKS) {
11821 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11822 PL_tmps_ix = proto_perl->Ttmps_ix;
11823 PL_tmps_max = proto_perl->Ttmps_max;
11824 PL_tmps_floor = proto_perl->Ttmps_floor;
11825 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11827 while (i <= PL_tmps_ix) {
11828 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11832 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11833 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11834 Newz(54, PL_markstack, i, I32);
11835 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11836 - proto_perl->Tmarkstack);
11837 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11838 - proto_perl->Tmarkstack);
11839 Copy(proto_perl->Tmarkstack, PL_markstack,
11840 PL_markstack_ptr - PL_markstack + 1, I32);
11842 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11843 * NOTE: unlike the others! */
11844 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11845 PL_scopestack_max = proto_perl->Tscopestack_max;
11846 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11847 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11849 /* NOTE: si_dup() looks at PL_markstack */
11850 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11852 /* PL_curstack = PL_curstackinfo->si_stack; */
11853 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11854 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11856 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11857 PL_stack_base = AvARRAY(PL_curstack);
11858 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11859 - proto_perl->Tstack_base);
11860 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11862 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11863 * NOTE: unlike the others! */
11864 PL_savestack_ix = proto_perl->Tsavestack_ix;
11865 PL_savestack_max = proto_perl->Tsavestack_max;
11866 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11867 PL_savestack = ss_dup(proto_perl, param);
11871 ENTER; /* perl_destruct() wants to LEAVE; */
11874 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11875 PL_top_env = &PL_start_env;
11877 PL_op = proto_perl->Top;
11880 PL_Xpv = (XPV*)NULL;
11881 PL_na = proto_perl->Tna;
11883 PL_statbuf = proto_perl->Tstatbuf;
11884 PL_statcache = proto_perl->Tstatcache;
11885 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11886 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11888 PL_timesbuf = proto_perl->Ttimesbuf;
11891 PL_tainted = proto_perl->Ttainted;
11892 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11893 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11894 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11895 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11896 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11897 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11898 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11899 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11900 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11902 PL_restartop = proto_perl->Trestartop;
11903 PL_in_eval = proto_perl->Tin_eval;
11904 PL_delaymagic = proto_perl->Tdelaymagic;
11905 PL_dirty = proto_perl->Tdirty;
11906 PL_localizing = proto_perl->Tlocalizing;
11908 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11909 PL_hv_fetch_ent_mh = Nullhe;
11910 PL_modcount = proto_perl->Tmodcount;
11911 PL_lastgotoprobe = Nullop;
11912 PL_dumpindent = proto_perl->Tdumpindent;
11914 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11915 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11916 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11917 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11918 PL_sortcxix = proto_perl->Tsortcxix;
11919 PL_efloatbuf = Nullch; /* reinits on demand */
11920 PL_efloatsize = 0; /* reinits on demand */
11924 PL_screamfirst = NULL;
11925 PL_screamnext = NULL;
11926 PL_maxscream = -1; /* reinits on demand */
11927 PL_lastscream = Nullsv;
11929 PL_watchaddr = NULL;
11930 PL_watchok = Nullch;
11932 PL_regdummy = proto_perl->Tregdummy;
11933 PL_regprecomp = Nullch;
11936 PL_colorset = 0; /* reinits PL_colors[] */
11937 /*PL_colors[6] = {0,0,0,0,0,0};*/
11938 PL_reginput = Nullch;
11939 PL_regbol = Nullch;
11940 PL_regeol = Nullch;
11941 PL_regstartp = (I32*)NULL;
11942 PL_regendp = (I32*)NULL;
11943 PL_reglastparen = (U32*)NULL;
11944 PL_reglastcloseparen = (U32*)NULL;
11945 PL_regtill = Nullch;
11946 PL_reg_start_tmp = (char**)NULL;
11947 PL_reg_start_tmpl = 0;
11948 PL_regdata = (struct reg_data*)NULL;
11951 PL_reg_eval_set = 0;
11953 PL_regprogram = (regnode*)NULL;
11955 PL_regcc = (CURCUR*)NULL;
11956 PL_reg_call_cc = (struct re_cc_state*)NULL;
11957 PL_reg_re = (regexp*)NULL;
11958 PL_reg_ganch = Nullch;
11959 PL_reg_sv = Nullsv;
11960 PL_reg_match_utf8 = FALSE;
11961 PL_reg_magic = (MAGIC*)NULL;
11963 PL_reg_oldcurpm = (PMOP*)NULL;
11964 PL_reg_curpm = (PMOP*)NULL;
11965 PL_reg_oldsaved = Nullch;
11966 PL_reg_oldsavedlen = 0;
11967 #ifdef PERL_OLD_COPY_ON_WRITE
11970 PL_reg_maxiter = 0;
11971 PL_reg_leftiter = 0;
11972 PL_reg_poscache = Nullch;
11973 PL_reg_poscache_size= 0;
11975 /* RE engine - function pointers */
11976 PL_regcompp = proto_perl->Tregcompp;
11977 PL_regexecp = proto_perl->Tregexecp;
11978 PL_regint_start = proto_perl->Tregint_start;
11979 PL_regint_string = proto_perl->Tregint_string;
11980 PL_regfree = proto_perl->Tregfree;
11982 PL_reginterp_cnt = 0;
11983 PL_reg_starttry = 0;
11985 /* Pluggable optimizer */
11986 PL_peepp = proto_perl->Tpeepp;
11988 PL_stashcache = newHV();
11990 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11991 ptr_table_free(PL_ptr_table);
11992 PL_ptr_table = NULL;
11995 /* Call the ->CLONE method, if it exists, for each of the stashes
11996 identified by sv_dup() above.
11998 while(av_len(param->stashes) != -1) {
11999 HV* stash = (HV*) av_shift(param->stashes);
12000 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12001 if (cloner && GvCV(cloner)) {
12006 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
12008 call_sv((SV*)GvCV(cloner), G_DISCARD);
12014 SvREFCNT_dec(param->stashes);
12016 /* orphaned? eg threads->new inside BEGIN or use */
12017 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12018 (void)SvREFCNT_inc(PL_compcv);
12019 SAVEFREESV(PL_compcv);
12025 #endif /* USE_ITHREADS */
12028 =head1 Unicode Support
12030 =for apidoc sv_recode_to_utf8
12032 The encoding is assumed to be an Encode object, on entry the PV
12033 of the sv is assumed to be octets in that encoding, and the sv
12034 will be converted into Unicode (and UTF-8).
12036 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12037 is not a reference, nothing is done to the sv. If the encoding is not
12038 an C<Encode::XS> Encoding object, bad things will happen.
12039 (See F<lib/encoding.pm> and L<Encode>).
12041 The PV of the sv is returned.
12046 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12049 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12063 Passing sv_yes is wrong - it needs to be or'ed set of constants
12064 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12065 remove converted chars from source.
12067 Both will default the value - let them.
12069 XPUSHs(&PL_sv_yes);
12072 call_method("decode", G_SCALAR);
12076 s = SvPV_const(uni, len);
12077 if (s != SvPVX_const(sv)) {
12078 SvGROW(sv, len + 1);
12079 Move(s, SvPVX(sv), len + 1, char);
12080 SvCUR_set(sv, len);
12087 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12091 =for apidoc sv_cat_decode
12093 The encoding is assumed to be an Encode object, the PV of the ssv is
12094 assumed to be octets in that encoding and decoding the input starts
12095 from the position which (PV + *offset) pointed to. The dsv will be
12096 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12097 when the string tstr appears in decoding output or the input ends on
12098 the PV of the ssv. The value which the offset points will be modified
12099 to the last input position on the ssv.
12101 Returns TRUE if the terminator was found, else returns FALSE.
12106 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12107 SV *ssv, int *offset, char *tstr, int tlen)
12111 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12122 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12123 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12125 call_method("cat_decode", G_SCALAR);
12127 ret = SvTRUE(TOPs);
12128 *offset = SvIV(offsv);
12134 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12140 * c-indentation-style: bsd
12141 * c-basic-offset: 4
12142 * indent-tabs-mode: t
12145 * ex: set ts=8 sts=4 sw=4 noet: