3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
9 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
12 * This file contains the code that creates, manipulates and destroys
13 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
14 * structure of an SV, so their creation and destruction is handled
15 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
16 * level functions (eg. substr, split, join) for each of the types are
28 /* Missing proto on LynxOS */
29 char *gconvert(double, int, int, char *);
32 #ifdef PERL_UTF8_CACHE_ASSERT
33 /* The cache element 0 is the Unicode offset;
34 * the cache element 1 is the byte offset of the element 0;
35 * the cache element 2 is the Unicode length of the substring;
36 * the cache element 3 is the byte length of the substring;
37 * The checking of the substring side would be good
38 * but substr() has enough code paths to make my head spin;
39 * if adding more checks watch out for the following tests:
40 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
41 * lib/utf8.t lib/Unicode/Collate/t/index.t
44 #define ASSERT_UTF8_CACHE(cache) \
45 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
47 #define ASSERT_UTF8_CACHE(cache) NOOP
50 #ifdef PERL_COPY_ON_WRITE
51 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
52 #define SV_COW_NEXT_SV_SET(current,next) SvUV_set(current, PTR2UV(next))
53 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
57 /* ============================================================================
59 =head1 Allocation and deallocation of SVs.
61 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
62 av, hv...) contains type and reference count information, as well as a
63 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
64 specific to each type.
66 Normally, this allocation is done using arenas, which by default are
67 approximately 4K chunks of memory parcelled up into N heads or bodies. The
68 first slot in each arena is reserved, and is used to hold a link to the next
69 arena. In the case of heads, the unused first slot also contains some flags
70 and a note of the number of slots. Snaked through each arena chain is a
71 linked list of free items; when this becomes empty, an extra arena is
72 allocated and divided up into N items which are threaded into the free list.
74 The following global variables are associated with arenas:
76 PL_sv_arenaroot pointer to list of SV arenas
77 PL_sv_root pointer to list of free SV structures
79 PL_foo_arenaroot pointer to list of foo arenas,
80 PL_foo_root pointer to list of free foo bodies
81 ... for foo in xiv, xnv, xrv, xpv etc.
83 Note that some of the larger and more rarely used body types (eg xpvio)
84 are not allocated using arenas, but are instead just malloc()/free()ed as
85 required. Also, if PURIFY is defined, arenas are abandoned altogether,
86 with all items individually malloc()ed. In addition, a few SV heads are
87 not allocated from an arena, but are instead directly created as static
88 or auto variables, eg PL_sv_undef. The size of arenas can be changed from
89 the default by setting PERL_ARENA_SIZE appropriately at compile time.
91 The SV arena serves the secondary purpose of allowing still-live SVs
92 to be located and destroyed during final cleanup.
94 At the lowest level, the macros new_SV() and del_SV() grab and free
95 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
96 to return the SV to the free list with error checking.) new_SV() calls
97 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
98 SVs in the free list have their SvTYPE field set to all ones.
100 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
101 that allocate and return individual body types. Normally these are mapped
102 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
103 instead mapped directly to malloc()/free() if PURIFY is defined. The
104 new/del functions remove from, or add to, the appropriate PL_foo_root
105 list, and call more_xiv() etc to add a new arena if the list is empty.
107 At the time of very final cleanup, sv_free_arenas() is called from
108 perl_destruct() to physically free all the arenas allocated since the
109 start of the interpreter. Note that this also clears PL_he_arenaroot,
110 which is otherwise dealt with in hv.c.
112 Manipulation of any of the PL_*root pointers is protected by enclosing
113 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
114 if threads are enabled.
116 The function visit() scans the SV arenas list, and calls a specified
117 function for each SV it finds which is still live - ie which has an SvTYPE
118 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
119 following functions (specified as [function that calls visit()] / [function
120 called by visit() for each SV]):
122 sv_report_used() / do_report_used()
123 dump all remaining SVs (debugging aid)
125 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
126 Attempt to free all objects pointed to by RVs,
127 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
128 try to do the same for all objects indirectly
129 referenced by typeglobs too. Called once from
130 perl_destruct(), prior to calling sv_clean_all()
133 sv_clean_all() / do_clean_all()
134 SvREFCNT_dec(sv) each remaining SV, possibly
135 triggering an sv_free(). It also sets the
136 SVf_BREAK flag on the SV to indicate that the
137 refcnt has been artificially lowered, and thus
138 stopping sv_free() from giving spurious warnings
139 about SVs which unexpectedly have a refcnt
140 of zero. called repeatedly from perl_destruct()
141 until there are no SVs left.
145 Private API to rest of sv.c
149 new_XIV(), del_XIV(),
150 new_XNV(), del_XNV(),
155 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
160 ============================================================================ */
165 * "A time to plant, and a time to uproot what was planted..."
168 #ifdef DEBUG_LEAKING_SCALARS
170 # define FREE_SV_DEBUG_FILE(sv) PerlMemfree((sv)->sv_debug_file)
172 # define FREE_SV_DEBUG_FILE(sv) PerlMemShared_free((sv)->sv_debug_file)
175 # define FREE_SV_DEBUG_FILE(sv)
178 #define plant_SV(p) \
180 FREE_SV_DEBUG_FILE(p); \
181 SvANY(p) = (void *)PL_sv_root; \
182 SvFLAGS(p) = SVTYPEMASK; \
187 /* sv_mutex must be held while calling uproot_SV() */
188 #define uproot_SV(p) \
191 PL_sv_root = (SV*)SvANY(p); \
196 /* new_SV(): return a new, empty SV head */
198 #ifdef DEBUG_LEAKING_SCALARS
199 /* provide a real function for a debugger to play with */
214 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
215 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
216 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
217 sv->sv_debug_inpad = 0;
218 sv->sv_debug_cloned = 0;
220 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
222 sv->sv_debug_file = PL_curcop ? savesharedpv(CopFILE(PL_curcop)): NULL;
227 # define new_SV(p) (p)=S_new_SV(aTHX)
245 /* del_SV(): return an empty SV head to the free list */
260 S_del_sv(pTHX_ SV *p)
267 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
269 svend = &sva[SvREFCNT(sva)];
270 if (p >= sv && p < svend) {
276 if (ckWARN_d(WARN_INTERNAL))
277 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
278 "Attempt to free non-arena SV: 0x%"UVxf
279 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
286 #else /* ! DEBUGGING */
288 #define del_SV(p) plant_SV(p)
290 #endif /* DEBUGGING */
294 =head1 SV Manipulation Functions
296 =for apidoc sv_add_arena
298 Given a chunk of memory, link it to the head of the list of arenas,
299 and split it into a list of free SVs.
305 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
311 /* The first SV in an arena isn't an SV. */
312 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
313 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
314 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
316 PL_sv_arenaroot = sva;
317 PL_sv_root = sva + 1;
319 svend = &sva[SvREFCNT(sva) - 1];
322 SvANY(sv) = (void *)(SV*)(sv + 1);
326 /* Must always set typemask because it's awlays checked in on cleanup
327 when the arenas are walked looking for objects. */
328 SvFLAGS(sv) = SVTYPEMASK;
335 SvFLAGS(sv) = SVTYPEMASK;
338 /* make some more SVs by adding another arena */
340 /* sv_mutex must be held while calling more_sv() */
347 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
348 PL_nice_chunk = Nullch;
349 PL_nice_chunk_size = 0;
352 char *chunk; /* must use New here to match call to */
353 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
354 sv_add_arena(chunk, 1008, 0);
360 /* visit(): call the named function for each non-free SV in the arenas
361 * whose flags field matches the flags/mask args. */
364 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
371 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
372 svend = &sva[SvREFCNT(sva)];
373 for (sv = sva + 1; sv < svend; ++sv) {
374 if (SvTYPE(sv) != SVTYPEMASK
375 && (sv->sv_flags & mask) == flags
388 /* called by sv_report_used() for each live SV */
391 do_report_used(pTHX_ SV *sv)
393 if (SvTYPE(sv) != SVTYPEMASK) {
394 PerlIO_printf(Perl_debug_log, "****\n");
401 =for apidoc sv_report_used
403 Dump the contents of all SVs not yet freed. (Debugging aid).
409 Perl_sv_report_used(pTHX)
412 visit(do_report_used, 0, 0);
416 /* called by sv_clean_objs() for each live SV */
419 do_clean_objs(pTHX_ SV *sv)
423 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
424 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
436 /* XXX Might want to check arrays, etc. */
439 /* called by sv_clean_objs() for each live SV */
441 #ifndef DISABLE_DESTRUCTOR_KLUDGE
443 do_clean_named_objs(pTHX_ SV *sv)
445 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
446 if ( SvOBJECT(GvSV(sv)) ||
447 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
448 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
449 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
450 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
452 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
453 SvFLAGS(sv) |= SVf_BREAK;
461 =for apidoc sv_clean_objs
463 Attempt to destroy all objects not yet freed
469 Perl_sv_clean_objs(pTHX)
471 PL_in_clean_objs = TRUE;
472 visit(do_clean_objs, SVf_ROK, SVf_ROK);
473 #ifndef DISABLE_DESTRUCTOR_KLUDGE
474 /* some barnacles may yet remain, clinging to typeglobs */
475 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
477 PL_in_clean_objs = FALSE;
480 /* called by sv_clean_all() for each live SV */
483 do_clean_all(pTHX_ SV *sv)
485 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
486 SvFLAGS(sv) |= SVf_BREAK;
487 if (PL_comppad == (AV*)sv) {
489 PL_curpad = Null(SV**);
495 =for apidoc sv_clean_all
497 Decrement the refcnt of each remaining SV, possibly triggering a
498 cleanup. This function may have to be called multiple times to free
499 SVs which are in complex self-referential hierarchies.
505 Perl_sv_clean_all(pTHX)
508 PL_in_clean_all = TRUE;
509 cleaned = visit(do_clean_all, 0,0);
510 PL_in_clean_all = FALSE;
515 =for apidoc sv_free_arenas
517 Deallocate the memory used by all arenas. Note that all the individual SV
518 heads and bodies within the arenas must already have been freed.
524 Perl_sv_free_arenas(pTHX)
528 XPV *arena, *arenanext;
530 /* Free arenas here, but be careful about fake ones. (We assume
531 contiguity of the fake ones with the corresponding real ones.) */
533 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
534 svanext = (SV*) SvANY(sva);
535 while (svanext && SvFAKE(svanext))
536 svanext = (SV*) SvANY(svanext);
539 Safefree((void *)sva);
542 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
543 arenanext = (XPV*)arena->xpv_pv;
546 PL_xiv_arenaroot = 0;
549 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
550 arenanext = (XPV*)arena->xpv_pv;
553 PL_xnv_arenaroot = 0;
556 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
557 arenanext = (XPV*)arena->xpv_pv;
560 PL_xrv_arenaroot = 0;
563 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
564 arenanext = (XPV*)arena->xpv_pv;
567 PL_xpv_arenaroot = 0;
570 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
571 arenanext = (XPV*)arena->xpv_pv;
574 PL_xpviv_arenaroot = 0;
577 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
578 arenanext = (XPV*)arena->xpv_pv;
581 PL_xpvnv_arenaroot = 0;
584 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
585 arenanext = (XPV*)arena->xpv_pv;
588 PL_xpvcv_arenaroot = 0;
591 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
592 arenanext = (XPV*)arena->xpv_pv;
595 PL_xpvav_arenaroot = 0;
598 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
599 arenanext = (XPV*)arena->xpv_pv;
602 PL_xpvhv_arenaroot = 0;
605 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
606 arenanext = (XPV*)arena->xpv_pv;
609 PL_xpvmg_arenaroot = 0;
612 for (arena = (XPV*)PL_xpvgv_arenaroot; arena; arena = arenanext) {
613 arenanext = (XPV*)arena->xpv_pv;
616 PL_xpvgv_arenaroot = 0;
619 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
620 arenanext = (XPV*)arena->xpv_pv;
623 PL_xpvlv_arenaroot = 0;
626 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
627 arenanext = (XPV*)arena->xpv_pv;
630 PL_xpvbm_arenaroot = 0;
636 for (he = PL_he_arenaroot; he; he = he_next) {
637 he_next = HeNEXT(he);
644 #if defined(USE_ITHREADS)
646 struct ptr_tbl_ent *pte;
647 struct ptr_tbl_ent *pte_next;
648 for (pte = PL_pte_arenaroot; pte; pte = pte_next) {
649 pte_next = pte->next;
653 PL_pte_arenaroot = 0;
658 Safefree(PL_nice_chunk);
659 PL_nice_chunk = Nullch;
660 PL_nice_chunk_size = 0;
665 /* ---------------------------------------------------------------------
667 * support functions for report_uninit()
670 /* the maxiumum size of array or hash where we will scan looking
671 * for the undefined element that triggered the warning */
673 #define FUV_MAX_SEARCH_SIZE 1000
675 /* Look for an entry in the hash whose value has the same SV as val;
676 * If so, return a mortal copy of the key. */
679 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
685 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
686 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
691 for (i=HvMAX(hv); i>0; i--) {
693 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
694 if (HeVAL(entry) != val)
696 if ( HeVAL(entry) == &PL_sv_undef ||
697 HeVAL(entry) == &PL_sv_placeholder)
701 if (HeKLEN(entry) == HEf_SVKEY)
702 return sv_mortalcopy(HeKEY_sv(entry));
703 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
709 /* Look for an entry in the array whose value has the same SV as val;
710 * If so, return the index, otherwise return -1. */
713 S_find_array_subscript(pTHX_ AV *av, SV* val)
717 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
718 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
722 for (i=AvFILLp(av); i>=0; i--) {
723 if (svp[i] == val && svp[i] != &PL_sv_undef)
729 /* S_varname(): return the name of a variable, optionally with a subscript.
730 * If gv is non-zero, use the name of that global, along with gvtype (one
731 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
732 * targ. Depending on the value of the subscript_type flag, return:
735 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
736 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
737 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
738 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
741 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
742 SV* keyname, I32 aindex, int subscript_type)
748 name = sv_newmortal();
751 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
752 * XXX get rid of all this if gv_fullnameX() ever supports this
756 HV *hv = GvSTASH(gv);
757 sv_setpv(name, gvtype);
760 else if (!(p=HvNAME(hv)))
762 if (strNE(p, "main")) {
764 sv_catpvn(name,"::", 2);
766 if (GvNAMELEN(gv)>= 1 &&
767 ((unsigned int)*GvNAME(gv)) <= 26)
769 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
770 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
773 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
777 CV *cv = find_runcv(&u);
778 if (!cv || !CvPADLIST(cv))
780 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
781 sv = *av_fetch(av, targ, FALSE);
782 /* SvLEN in a pad name is not to be trusted */
783 sv_setpv(name, SvPV_nolen(sv));
786 if (subscript_type == FUV_SUBSCRIPT_HASH) {
789 Perl_sv_catpvf(aTHX_ name, "{%s}",
790 pv_display(sv,SvPVX(keyname), SvCUR(keyname), 0, 32));
793 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
795 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
797 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
798 sv_insert(name, 0, 0, "within ", 7);
805 =for apidoc find_uninit_var
807 Find the name of the undefined variable (if any) that caused the operator o
808 to issue a "Use of uninitialized value" warning.
809 If match is true, only return a name if it's value matches uninit_sv.
810 So roughly speaking, if a unary operator (such as OP_COS) generates a
811 warning, then following the direct child of the op may yield an
812 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
813 other hand, with OP_ADD there are two branches to follow, so we only print
814 the variable name if we get an exact match.
816 The name is returned as a mortal SV.
818 Assumes that PL_op is the op that originally triggered the error, and that
819 PL_comppad/PL_curpad points to the currently executing pad.
825 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
834 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
835 uninit_sv == &PL_sv_placeholder)))
838 switch (obase->op_type) {
845 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
846 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
849 int subscript_type = FUV_SUBSCRIPT_WITHIN;
851 if (pad) { /* @lex, %lex */
852 sv = PAD_SVl(obase->op_targ);
856 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
857 /* @global, %global */
858 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
861 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
863 else /* @{expr}, %{expr} */
864 return find_uninit_var(cUNOPx(obase)->op_first,
868 /* attempt to find a match within the aggregate */
870 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
872 subscript_type = FUV_SUBSCRIPT_HASH;
875 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
877 subscript_type = FUV_SUBSCRIPT_ARRAY;
880 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
883 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
884 keysv, index, subscript_type);
888 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
890 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
891 Nullsv, 0, FUV_SUBSCRIPT_NONE);
894 gv = cGVOPx_gv(obase);
895 if (!gv || (match && GvSV(gv) != uninit_sv))
897 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
900 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
902 av = (AV*)PAD_SV(obase->op_targ);
903 if (!av || SvRMAGICAL(av))
905 svp = av_fetch(av, (I32)obase->op_private, FALSE);
906 if (!svp || *svp != uninit_sv)
909 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
910 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
913 gv = cGVOPx_gv(obase);
918 if (!av || SvRMAGICAL(av))
920 svp = av_fetch(av, (I32)obase->op_private, FALSE);
921 if (!svp || *svp != uninit_sv)
924 return S_varname(aTHX_ gv, "$", 0,
925 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
930 o = cUNOPx(obase)->op_first;
931 if (!o || o->op_type != OP_NULL ||
932 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
934 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
939 /* $a[uninit_expr] or $h{uninit_expr} */
940 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
943 o = cBINOPx(obase)->op_first;
944 kid = cBINOPx(obase)->op_last;
946 /* get the av or hv, and optionally the gv */
948 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
949 sv = PAD_SV(o->op_targ);
951 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
952 && cUNOPo->op_first->op_type == OP_GV)
954 gv = cGVOPx_gv(cUNOPo->op_first);
957 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
962 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
963 /* index is constant */
967 if (obase->op_type == OP_HELEM) {
968 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
969 if (!he || HeVAL(he) != uninit_sv)
973 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
974 if (!svp || *svp != uninit_sv)
978 if (obase->op_type == OP_HELEM)
979 return S_varname(aTHX_ gv, "%", o->op_targ,
980 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
982 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
983 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
987 /* index is an expression;
988 * attempt to find a match within the aggregate */
989 if (obase->op_type == OP_HELEM) {
990 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
992 return S_varname(aTHX_ gv, "%", o->op_targ,
993 keysv, 0, FUV_SUBSCRIPT_HASH);
996 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
998 return S_varname(aTHX_ gv, "@", o->op_targ,
999 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
1003 return S_varname(aTHX_ gv,
1004 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
1006 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
1012 /* only examine RHS */
1013 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
1016 o = cUNOPx(obase)->op_first;
1017 if (o->op_type == OP_PUSHMARK)
1020 if (!o->op_sibling) {
1021 /* one-arg version of open is highly magical */
1023 if (o->op_type == OP_GV) { /* open FOO; */
1025 if (match && GvSV(gv) != uninit_sv)
1027 return S_varname(aTHX_ gv, "$", 0,
1028 Nullsv, 0, FUV_SUBSCRIPT_NONE);
1030 /* other possibilities not handled are:
1031 * open $x; or open my $x; should return '${*$x}'
1032 * open expr; should return '$'.expr ideally
1038 /* ops where $_ may be an implicit arg */
1042 if ( !(obase->op_flags & OPf_STACKED)) {
1043 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
1044 ? PAD_SVl(obase->op_targ)
1047 sv = sv_newmortal();
1056 /* skip filehandle as it can't produce 'undef' warning */
1057 o = cUNOPx(obase)->op_first;
1058 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1059 o = o->op_sibling->op_sibling;
1066 match = 1; /* XS or custom code could trigger random warnings */
1071 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1072 return sv_2mortal(newSVpv("${$/}", 0));
1077 if (!(obase->op_flags & OPf_KIDS))
1079 o = cUNOPx(obase)->op_first;
1085 /* if all except one arg are constant, or have no side-effects,
1086 * or are optimized away, then it's unambiguous */
1088 for (kid=o; kid; kid = kid->op_sibling) {
1090 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1091 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1092 || (kid->op_type == OP_PUSHMARK)
1096 if (o2) { /* more than one found */
1103 return find_uninit_var(o2, uninit_sv, match);
1107 sv = find_uninit_var(o, uninit_sv, 1);
1119 =for apidoc report_uninit
1121 Print appropriate "Use of uninitialized variable" warning
1127 Perl_report_uninit(pTHX_ SV* uninit_sv)
1130 SV* varname = Nullsv;
1132 varname = find_uninit_var(PL_op, uninit_sv,0);
1134 sv_insert(varname, 0, 0, " ", 1);
1136 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1137 varname ? SvPV_nolen(varname) : "",
1138 " in ", OP_DESC(PL_op));
1141 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1145 /* grab a new IV body from the free list, allocating more if necessary */
1156 * See comment in more_xiv() -- RAM.
1158 PL_xiv_root = *(IV**)xiv;
1160 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
1163 /* return an IV body to the free list */
1166 S_del_xiv(pTHX_ XPVIV *p)
1168 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
1170 *(IV**)xiv = PL_xiv_root;
1175 /* allocate another arena's worth of IV bodies */
1181 register IV* xivend;
1183 New(705, ptr, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1184 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
1185 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
1188 xivend = &xiv[PERL_ARENA_SIZE / sizeof(IV) - 1];
1189 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
1191 while (xiv < xivend) {
1192 *(IV**)xiv = (IV *)(xiv + 1);
1198 /* grab a new NV body from the free list, allocating more if necessary */
1208 PL_xnv_root = *(NV**)xnv;
1210 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
1213 /* return an NV body to the free list */
1216 S_del_xnv(pTHX_ XPVNV *p)
1218 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
1220 *(NV**)xnv = PL_xnv_root;
1225 /* allocate another arena's worth of NV bodies */
1231 register NV* xnvend;
1233 New(711, ptr, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1234 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
1235 PL_xnv_arenaroot = ptr;
1238 xnvend = &xnv[PERL_ARENA_SIZE / sizeof(NV) - 1];
1239 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
1241 while (xnv < xnvend) {
1242 *(NV**)xnv = (NV*)(xnv + 1);
1248 /* grab a new struct xrv from the free list, allocating more if necessary */
1258 PL_xrv_root = (XRV*)xrv->xrv_rv;
1263 /* return a struct xrv to the free list */
1266 S_del_xrv(pTHX_ XRV *p)
1269 p->xrv_rv = (SV*)PL_xrv_root;
1274 /* allocate another arena's worth of struct xrv */
1280 register XRV* xrvend;
1282 New(712, ptr, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1283 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
1284 PL_xrv_arenaroot = ptr;
1287 xrvend = &xrv[PERL_ARENA_SIZE / sizeof(XRV) - 1];
1288 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
1290 while (xrv < xrvend) {
1291 xrv->xrv_rv = (SV*)(xrv + 1);
1297 /* grab a new struct xpv from the free list, allocating more if necessary */
1307 PL_xpv_root = (XPV*)xpv->xpv_pv;
1312 /* return a struct xpv to the free list */
1315 S_del_xpv(pTHX_ XPV *p)
1318 p->xpv_pv = (char*)PL_xpv_root;
1323 /* allocate another arena's worth of struct xpv */
1329 register XPV* xpvend;
1330 New(713, xpv, PERL_ARENA_SIZE/sizeof(XPV), XPV);
1331 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
1332 PL_xpv_arenaroot = xpv;
1334 xpvend = &xpv[PERL_ARENA_SIZE / sizeof(XPV) - 1];
1335 PL_xpv_root = ++xpv;
1336 while (xpv < xpvend) {
1337 xpv->xpv_pv = (char*)(xpv + 1);
1343 /* grab a new struct xpviv from the free list, allocating more if necessary */
1352 xpviv = PL_xpviv_root;
1353 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
1358 /* return a struct xpviv to the free list */
1361 S_del_xpviv(pTHX_ XPVIV *p)
1364 p->xpv_pv = (char*)PL_xpviv_root;
1369 /* allocate another arena's worth of struct xpviv */
1374 register XPVIV* xpviv;
1375 register XPVIV* xpvivend;
1376 New(714, xpviv, PERL_ARENA_SIZE/sizeof(XPVIV), XPVIV);
1377 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
1378 PL_xpviv_arenaroot = xpviv;
1380 xpvivend = &xpviv[PERL_ARENA_SIZE / sizeof(XPVIV) - 1];
1381 PL_xpviv_root = ++xpviv;
1382 while (xpviv < xpvivend) {
1383 xpviv->xpv_pv = (char*)(xpviv + 1);
1389 /* grab a new struct xpvnv from the free list, allocating more if necessary */
1398 xpvnv = PL_xpvnv_root;
1399 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
1404 /* return a struct xpvnv to the free list */
1407 S_del_xpvnv(pTHX_ XPVNV *p)
1410 p->xpv_pv = (char*)PL_xpvnv_root;
1415 /* allocate another arena's worth of struct xpvnv */
1420 register XPVNV* xpvnv;
1421 register XPVNV* xpvnvend;
1422 New(715, xpvnv, PERL_ARENA_SIZE/sizeof(XPVNV), XPVNV);
1423 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
1424 PL_xpvnv_arenaroot = xpvnv;
1426 xpvnvend = &xpvnv[PERL_ARENA_SIZE / sizeof(XPVNV) - 1];
1427 PL_xpvnv_root = ++xpvnv;
1428 while (xpvnv < xpvnvend) {
1429 xpvnv->xpv_pv = (char*)(xpvnv + 1);
1435 /* grab a new struct xpvcv from the free list, allocating more if necessary */
1444 xpvcv = PL_xpvcv_root;
1445 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
1450 /* return a struct xpvcv to the free list */
1453 S_del_xpvcv(pTHX_ XPVCV *p)
1456 p->xpv_pv = (char*)PL_xpvcv_root;
1461 /* allocate another arena's worth of struct xpvcv */
1466 register XPVCV* xpvcv;
1467 register XPVCV* xpvcvend;
1468 New(716, xpvcv, PERL_ARENA_SIZE/sizeof(XPVCV), XPVCV);
1469 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
1470 PL_xpvcv_arenaroot = xpvcv;
1472 xpvcvend = &xpvcv[PERL_ARENA_SIZE / sizeof(XPVCV) - 1];
1473 PL_xpvcv_root = ++xpvcv;
1474 while (xpvcv < xpvcvend) {
1475 xpvcv->xpv_pv = (char*)(xpvcv + 1);
1481 /* grab a new struct xpvav from the free list, allocating more if necessary */
1490 xpvav = PL_xpvav_root;
1491 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
1496 /* return a struct xpvav to the free list */
1499 S_del_xpvav(pTHX_ XPVAV *p)
1502 p->xav_array = (char*)PL_xpvav_root;
1507 /* allocate another arena's worth of struct xpvav */
1512 register XPVAV* xpvav;
1513 register XPVAV* xpvavend;
1514 New(717, xpvav, PERL_ARENA_SIZE/sizeof(XPVAV), XPVAV);
1515 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
1516 PL_xpvav_arenaroot = xpvav;
1518 xpvavend = &xpvav[PERL_ARENA_SIZE / sizeof(XPVAV) - 1];
1519 PL_xpvav_root = ++xpvav;
1520 while (xpvav < xpvavend) {
1521 xpvav->xav_array = (char*)(xpvav + 1);
1524 xpvav->xav_array = 0;
1527 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1536 xpvhv = PL_xpvhv_root;
1537 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
1542 /* return a struct xpvhv to the free list */
1545 S_del_xpvhv(pTHX_ XPVHV *p)
1548 p->xhv_array = (char*)PL_xpvhv_root;
1553 /* allocate another arena's worth of struct xpvhv */
1558 register XPVHV* xpvhv;
1559 register XPVHV* xpvhvend;
1560 New(718, xpvhv, PERL_ARENA_SIZE/sizeof(XPVHV), XPVHV);
1561 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1562 PL_xpvhv_arenaroot = xpvhv;
1564 xpvhvend = &xpvhv[PERL_ARENA_SIZE / sizeof(XPVHV) - 1];
1565 PL_xpvhv_root = ++xpvhv;
1566 while (xpvhv < xpvhvend) {
1567 xpvhv->xhv_array = (char*)(xpvhv + 1);
1570 xpvhv->xhv_array = 0;
1573 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1582 xpvmg = PL_xpvmg_root;
1583 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1588 /* return a struct xpvmg to the free list */
1591 S_del_xpvmg(pTHX_ XPVMG *p)
1594 p->xpv_pv = (char*)PL_xpvmg_root;
1599 /* allocate another arena's worth of struct xpvmg */
1604 register XPVMG* xpvmg;
1605 register XPVMG* xpvmgend;
1606 New(719, xpvmg, PERL_ARENA_SIZE/sizeof(XPVMG), XPVMG);
1607 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1608 PL_xpvmg_arenaroot = xpvmg;
1610 xpvmgend = &xpvmg[PERL_ARENA_SIZE / sizeof(XPVMG) - 1];
1611 PL_xpvmg_root = ++xpvmg;
1612 while (xpvmg < xpvmgend) {
1613 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1619 /* allocate another arena's worth of struct xpvgv */
1626 New(720, xpvgv, PERL_ARENA_SIZE/sizeof(XPVGV), XPVGV);
1627 xpvgv->xpv_pv = (char*)PL_xpvgv_arenaroot;
1628 PL_xpvgv_arenaroot = xpvgv;
1630 xpvgvend = &xpvgv[PERL_ARENA_SIZE / sizeof(XPVGV) - 1];
1631 PL_xpvgv_root = ++xpvgv;
1632 while (xpvgv < xpvgvend) {
1633 xpvgv->xpv_pv = (char*)(xpvgv + 1);
1639 /* grab a new struct xpvgv from the free list, allocating more if necessary */
1648 xpvgv = PL_xpvgv_root;
1649 PL_xpvgv_root = (XPVGV*)xpvgv->xpv_pv;
1654 /* return a struct xpvgv to the free list */
1657 S_del_xpvgv(pTHX_ XPVGV *p)
1660 p->xpv_pv = (char*)PL_xpvgv_root;
1665 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1674 xpvlv = PL_xpvlv_root;
1675 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1680 /* return a struct xpvlv to the free list */
1683 S_del_xpvlv(pTHX_ XPVLV *p)
1686 p->xpv_pv = (char*)PL_xpvlv_root;
1691 /* allocate another arena's worth of struct xpvlv */
1696 register XPVLV* xpvlv;
1697 register XPVLV* xpvlvend;
1698 New(720, xpvlv, PERL_ARENA_SIZE/sizeof(XPVLV), XPVLV);
1699 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1700 PL_xpvlv_arenaroot = xpvlv;
1702 xpvlvend = &xpvlv[PERL_ARENA_SIZE / sizeof(XPVLV) - 1];
1703 PL_xpvlv_root = ++xpvlv;
1704 while (xpvlv < xpvlvend) {
1705 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1711 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1720 xpvbm = PL_xpvbm_root;
1721 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1726 /* return a struct xpvbm to the free list */
1729 S_del_xpvbm(pTHX_ XPVBM *p)
1732 p->xpv_pv = (char*)PL_xpvbm_root;
1737 /* allocate another arena's worth of struct xpvbm */
1742 register XPVBM* xpvbm;
1743 register XPVBM* xpvbmend;
1744 New(721, xpvbm, PERL_ARENA_SIZE/sizeof(XPVBM), XPVBM);
1745 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1746 PL_xpvbm_arenaroot = xpvbm;
1748 xpvbmend = &xpvbm[PERL_ARENA_SIZE / sizeof(XPVBM) - 1];
1749 PL_xpvbm_root = ++xpvbm;
1750 while (xpvbm < xpvbmend) {
1751 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1757 #define my_safemalloc(s) (void*)safemalloc(s)
1758 #define my_safefree(p) safefree((char*)p)
1762 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1763 #define del_XIV(p) my_safefree(p)
1765 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1766 #define del_XNV(p) my_safefree(p)
1768 #define new_XRV() my_safemalloc(sizeof(XRV))
1769 #define del_XRV(p) my_safefree(p)
1771 #define new_XPV() my_safemalloc(sizeof(XPV))
1772 #define del_XPV(p) my_safefree(p)
1774 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1775 #define del_XPVIV(p) my_safefree(p)
1777 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1778 #define del_XPVNV(p) my_safefree(p)
1780 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1781 #define del_XPVCV(p) my_safefree(p)
1783 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1784 #define del_XPVAV(p) my_safefree(p)
1786 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1787 #define del_XPVHV(p) my_safefree(p)
1789 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1790 #define del_XPVMG(p) my_safefree(p)
1792 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1793 #define del_XPVGV(p) my_safefree(p)
1795 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1796 #define del_XPVLV(p) my_safefree(p)
1798 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1799 #define del_XPVBM(p) my_safefree(p)
1803 #define new_XIV() (void*)new_xiv()
1804 #define del_XIV(p) del_xiv((XPVIV*) p)
1806 #define new_XNV() (void*)new_xnv()
1807 #define del_XNV(p) del_xnv((XPVNV*) p)
1809 #define new_XRV() (void*)new_xrv()
1810 #define del_XRV(p) del_xrv((XRV*) p)
1812 #define new_XPV() (void*)new_xpv()
1813 #define del_XPV(p) del_xpv((XPV *)p)
1815 #define new_XPVIV() (void*)new_xpviv()
1816 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1818 #define new_XPVNV() (void*)new_xpvnv()
1819 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1821 #define new_XPVCV() (void*)new_xpvcv()
1822 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1824 #define new_XPVAV() (void*)new_xpvav()
1825 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1827 #define new_XPVHV() (void*)new_xpvhv()
1828 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1830 #define new_XPVMG() (void*)new_xpvmg()
1831 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1833 #define new_XPVGV() (void*)new_xpvgv()
1834 #define del_XPVGV(p) del_xpvgv((XPVGV *)p)
1836 #define new_XPVLV() (void*)new_xpvlv()
1837 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1839 #define new_XPVBM() (void*)new_xpvbm()
1840 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1844 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1845 #define del_XPVFM(p) my_safefree(p)
1847 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1848 #define del_XPVIO(p) my_safefree(p)
1851 =for apidoc sv_upgrade
1853 Upgrade an SV to a more complex form. Generally adds a new body type to the
1854 SV, then copies across as much information as possible from the old body.
1855 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1861 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1872 if (mt != SVt_PV && SvIsCOW(sv)) {
1873 sv_force_normal_flags(sv, 0);
1876 if (SvTYPE(sv) == mt)
1887 switch (SvTYPE(sv)) {
1895 else if (mt < SVt_PVIV)
1905 pv = (char*)SvRV(sv);
1915 else if (mt == SVt_NV)
1923 del_XPVIV(SvANY(sv));
1931 del_XPVNV(SvANY(sv));
1934 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1935 there's no way that it can be safely upgraded, because perl.c
1936 expects to Safefree(SvANY(PL_mess_sv)) */
1937 assert(sv != PL_mess_sv);
1943 magic = SvMAGIC(sv);
1944 stash = SvSTASH(sv);
1945 del_XPVMG(SvANY(sv));
1948 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1951 SvFLAGS(sv) &= ~SVTYPEMASK;
1956 Perl_croak(aTHX_ "Can't upgrade to undef");
1958 SvANY(sv) = new_XIV();
1962 SvANY(sv) = new_XNV();
1966 SvANY(sv) = new_XRV();
1967 SvRV_set(sv, (SV*)pv);
1970 SvANY(sv) = new_XPVHV();
1977 HvTOTALKEYS(sv) = 0;
1978 HvPLACEHOLDERS(sv) = 0;
1980 /* Fall through... */
1983 SvANY(sv) = new_XPVAV();
1988 AvFLAGS(sv) = AVf_REAL;
1993 /* XXX? Only SVt_NULL is ever upgraded to AV or HV? */
1995 /* FIXME. Should be able to remove all this if()... if the above
1996 assertion is genuinely always true. */
1999 SvFLAGS(sv) &= ~SVf_OOK;
2002 SvPV_set(sv, (char*)0);
2003 SvMAGIC_set(sv, magic);
2004 SvSTASH_set(sv, stash);
2008 SvANY(sv) = new_XPVIO();
2009 Zero(SvANY(sv), 1, XPVIO);
2010 IoPAGE_LEN(sv) = 60;
2011 goto set_magic_common;
2013 SvANY(sv) = new_XPVFM();
2014 Zero(SvANY(sv), 1, XPVFM);
2015 goto set_magic_common;
2017 SvANY(sv) = new_XPVBM();
2021 goto set_magic_common;
2023 SvANY(sv) = new_XPVGV();
2029 goto set_magic_common;
2031 SvANY(sv) = new_XPVCV();
2032 Zero(SvANY(sv), 1, XPVCV);
2033 goto set_magic_common;
2035 SvANY(sv) = new_XPVLV();
2048 SvANY(sv) = new_XPVMG();
2051 SvMAGIC_set(sv, magic);
2052 SvSTASH_set(sv, stash);
2056 SvANY(sv) = new_XPVNV();
2062 SvANY(sv) = new_XPVIV();
2071 SvANY(sv) = new_XPV();
2082 =for apidoc sv_backoff
2084 Remove any string offset. You should normally use the C<SvOOK_off> macro
2091 Perl_sv_backoff(pTHX_ register SV *sv)
2095 char *s = SvPVX(sv);
2096 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
2097 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
2099 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
2101 SvFLAGS(sv) &= ~SVf_OOK;
2108 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
2109 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
2110 Use the C<SvGROW> wrapper instead.
2116 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
2120 #ifdef HAS_64K_LIMIT
2121 if (newlen >= 0x10000) {
2122 PerlIO_printf(Perl_debug_log,
2123 "Allocation too large: %"UVxf"\n", (UV)newlen);
2126 #endif /* HAS_64K_LIMIT */
2129 if (SvTYPE(sv) < SVt_PV) {
2130 sv_upgrade(sv, SVt_PV);
2133 else if (SvOOK(sv)) { /* pv is offset? */
2136 if (newlen > SvLEN(sv))
2137 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
2138 #ifdef HAS_64K_LIMIT
2139 if (newlen >= 0x10000)
2146 if (newlen > SvLEN(sv)) { /* need more room? */
2147 if (SvLEN(sv) && s) {
2149 STRLEN l = malloced_size((void*)SvPVX(sv));
2155 Renew(s,newlen,char);
2158 New(703, s, newlen, char);
2159 if (SvPVX(sv) && SvCUR(sv)) {
2160 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
2164 SvLEN_set(sv, newlen);
2170 =for apidoc sv_setiv
2172 Copies an integer into the given SV, upgrading first if necessary.
2173 Does not handle 'set' magic. See also C<sv_setiv_mg>.
2179 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
2181 SV_CHECK_THINKFIRST_COW_DROP(sv);
2182 switch (SvTYPE(sv)) {
2184 sv_upgrade(sv, SVt_IV);
2187 sv_upgrade(sv, SVt_PVNV);
2191 sv_upgrade(sv, SVt_PVIV);
2200 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
2203 (void)SvIOK_only(sv); /* validate number */
2209 =for apidoc sv_setiv_mg
2211 Like C<sv_setiv>, but also handles 'set' magic.
2217 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
2224 =for apidoc sv_setuv
2226 Copies an unsigned integer into the given SV, upgrading first if necessary.
2227 Does not handle 'set' magic. See also C<sv_setuv_mg>.
2233 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
2235 /* With these two if statements:
2236 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2239 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2241 If you wish to remove them, please benchmark to see what the effect is
2243 if (u <= (UV)IV_MAX) {
2244 sv_setiv(sv, (IV)u);
2253 =for apidoc sv_setuv_mg
2255 Like C<sv_setuv>, but also handles 'set' magic.
2261 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
2263 /* With these two if statements:
2264 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
2267 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
2269 If you wish to remove them, please benchmark to see what the effect is
2271 if (u <= (UV)IV_MAX) {
2272 sv_setiv(sv, (IV)u);
2282 =for apidoc sv_setnv
2284 Copies a double into the given SV, upgrading first if necessary.
2285 Does not handle 'set' magic. See also C<sv_setnv_mg>.
2291 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
2293 SV_CHECK_THINKFIRST_COW_DROP(sv);
2294 switch (SvTYPE(sv)) {
2297 sv_upgrade(sv, SVt_NV);
2302 sv_upgrade(sv, SVt_PVNV);
2311 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
2315 (void)SvNOK_only(sv); /* validate number */
2320 =for apidoc sv_setnv_mg
2322 Like C<sv_setnv>, but also handles 'set' magic.
2328 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
2334 /* Print an "isn't numeric" warning, using a cleaned-up,
2335 * printable version of the offending string
2339 S_not_a_number(pTHX_ SV *sv)
2346 dsv = sv_2mortal(newSVpv("", 0));
2347 pv = sv_uni_display(dsv, sv, 10, 0);
2350 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
2351 /* each *s can expand to 4 chars + "...\0",
2352 i.e. need room for 8 chars */
2355 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
2357 if (ch & 128 && !isPRINT_LC(ch)) {
2366 else if (ch == '\r') {
2370 else if (ch == '\f') {
2374 else if (ch == '\\') {
2378 else if (ch == '\0') {
2382 else if (isPRINT_LC(ch))
2399 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2400 "Argument \"%s\" isn't numeric in %s", pv,
2403 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
2404 "Argument \"%s\" isn't numeric", pv);
2408 =for apidoc looks_like_number
2410 Test if the content of an SV looks like a number (or is a number).
2411 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
2412 non-numeric warning), even if your atof() doesn't grok them.
2418 Perl_looks_like_number(pTHX_ SV *sv)
2420 register char *sbegin;
2427 else if (SvPOKp(sv))
2428 sbegin = SvPV(sv, len);
2430 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
2431 return grok_number(sbegin, len, NULL);
2434 /* Actually, ISO C leaves conversion of UV to IV undefined, but
2435 until proven guilty, assume that things are not that bad... */
2440 As 64 bit platforms often have an NV that doesn't preserve all bits of
2441 an IV (an assumption perl has been based on to date) it becomes necessary
2442 to remove the assumption that the NV always carries enough precision to
2443 recreate the IV whenever needed, and that the NV is the canonical form.
2444 Instead, IV/UV and NV need to be given equal rights. So as to not lose
2445 precision as a side effect of conversion (which would lead to insanity
2446 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
2447 1) to distinguish between IV/UV/NV slots that have cached a valid
2448 conversion where precision was lost and IV/UV/NV slots that have a
2449 valid conversion which has lost no precision
2450 2) to ensure that if a numeric conversion to one form is requested that
2451 would lose precision, the precise conversion (or differently
2452 imprecise conversion) is also performed and cached, to prevent
2453 requests for different numeric formats on the same SV causing
2454 lossy conversion chains. (lossless conversion chains are perfectly
2459 SvIOKp is true if the IV slot contains a valid value
2460 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
2461 SvNOKp is true if the NV slot contains a valid value
2462 SvNOK is true only if the NV value is accurate
2465 while converting from PV to NV, check to see if converting that NV to an
2466 IV(or UV) would lose accuracy over a direct conversion from PV to
2467 IV(or UV). If it would, cache both conversions, return NV, but mark
2468 SV as IOK NOKp (ie not NOK).
2470 While converting from PV to IV, check to see if converting that IV to an
2471 NV would lose accuracy over a direct conversion from PV to NV. If it
2472 would, cache both conversions, flag similarly.
2474 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
2475 correctly because if IV & NV were set NV *always* overruled.
2476 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
2477 changes - now IV and NV together means that the two are interchangeable:
2478 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
2480 The benefit of this is that operations such as pp_add know that if
2481 SvIOK is true for both left and right operands, then integer addition
2482 can be used instead of floating point (for cases where the result won't
2483 overflow). Before, floating point was always used, which could lead to
2484 loss of precision compared with integer addition.
2486 * making IV and NV equal status should make maths accurate on 64 bit
2488 * may speed up maths somewhat if pp_add and friends start to use
2489 integers when possible instead of fp. (Hopefully the overhead in
2490 looking for SvIOK and checking for overflow will not outweigh the
2491 fp to integer speedup)
2492 * will slow down integer operations (callers of SvIV) on "inaccurate"
2493 values, as the change from SvIOK to SvIOKp will cause a call into
2494 sv_2iv each time rather than a macro access direct to the IV slot
2495 * should speed up number->string conversion on integers as IV is
2496 favoured when IV and NV are equally accurate
2498 ####################################################################
2499 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2500 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2501 On the other hand, SvUOK is true iff UV.
2502 ####################################################################
2504 Your mileage will vary depending your CPU's relative fp to integer
2508 #ifndef NV_PRESERVES_UV
2509 # define IS_NUMBER_UNDERFLOW_IV 1
2510 # define IS_NUMBER_UNDERFLOW_UV 2
2511 # define IS_NUMBER_IV_AND_UV 2
2512 # define IS_NUMBER_OVERFLOW_IV 4
2513 # define IS_NUMBER_OVERFLOW_UV 5
2515 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2517 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2519 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2521 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
2522 if (SvNVX(sv) < (NV)IV_MIN) {
2523 (void)SvIOKp_on(sv);
2525 SvIV_set(sv, IV_MIN);
2526 return IS_NUMBER_UNDERFLOW_IV;
2528 if (SvNVX(sv) > (NV)UV_MAX) {
2529 (void)SvIOKp_on(sv);
2532 SvUV_set(sv, UV_MAX);
2533 return IS_NUMBER_OVERFLOW_UV;
2535 (void)SvIOKp_on(sv);
2537 /* Can't use strtol etc to convert this string. (See truth table in
2539 if (SvNVX(sv) <= (UV)IV_MAX) {
2540 SvIV_set(sv, I_V(SvNVX(sv)));
2541 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2542 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2544 /* Integer is imprecise. NOK, IOKp */
2546 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2549 SvUV_set(sv, U_V(SvNVX(sv)));
2550 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2551 if (SvUVX(sv) == UV_MAX) {
2552 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2553 possibly be preserved by NV. Hence, it must be overflow.
2555 return IS_NUMBER_OVERFLOW_UV;
2557 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2559 /* Integer is imprecise. NOK, IOKp */
2561 return IS_NUMBER_OVERFLOW_IV;
2563 #endif /* !NV_PRESERVES_UV*/
2565 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2566 * this function provided for binary compatibility only
2570 Perl_sv_2iv(pTHX_ register SV *sv)
2572 return sv_2iv_flags(sv, SV_GMAGIC);
2576 =for apidoc sv_2iv_flags
2578 Return the integer value of an SV, doing any necessary string
2579 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2580 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2586 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2590 if (SvGMAGICAL(sv)) {
2591 if (flags & SV_GMAGIC)
2596 return I_V(SvNVX(sv));
2598 if (SvPOKp(sv) && SvLEN(sv))
2601 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2602 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2608 if (SvTHINKFIRST(sv)) {
2611 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2612 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2613 return SvIV(tmpstr);
2614 return PTR2IV(SvRV(sv));
2617 sv_force_normal_flags(sv, 0);
2619 if (SvREADONLY(sv) && !SvOK(sv)) {
2620 if (ckWARN(WARN_UNINITIALIZED))
2627 return (IV)(SvUVX(sv));
2634 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2635 * without also getting a cached IV/UV from it at the same time
2636 * (ie PV->NV conversion should detect loss of accuracy and cache
2637 * IV or UV at same time to avoid this. NWC */
2639 if (SvTYPE(sv) == SVt_NV)
2640 sv_upgrade(sv, SVt_PVNV);
2642 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2643 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2644 certainly cast into the IV range at IV_MAX, whereas the correct
2645 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2647 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2648 SvIV_set(sv, I_V(SvNVX(sv)));
2649 if (SvNVX(sv) == (NV) SvIVX(sv)
2650 #ifndef NV_PRESERVES_UV
2651 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2652 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2653 /* Don't flag it as "accurately an integer" if the number
2654 came from a (by definition imprecise) NV operation, and
2655 we're outside the range of NV integer precision */
2658 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2659 DEBUG_c(PerlIO_printf(Perl_debug_log,
2660 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2666 /* IV not precise. No need to convert from PV, as NV
2667 conversion would already have cached IV if it detected
2668 that PV->IV would be better than PV->NV->IV
2669 flags already correct - don't set public IOK. */
2670 DEBUG_c(PerlIO_printf(Perl_debug_log,
2671 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2676 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2677 but the cast (NV)IV_MIN rounds to a the value less (more
2678 negative) than IV_MIN which happens to be equal to SvNVX ??
2679 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2680 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2681 (NV)UVX == NVX are both true, but the values differ. :-(
2682 Hopefully for 2s complement IV_MIN is something like
2683 0x8000000000000000 which will be exact. NWC */
2686 SvUV_set(sv, U_V(SvNVX(sv)));
2688 (SvNVX(sv) == (NV) SvUVX(sv))
2689 #ifndef NV_PRESERVES_UV
2690 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2691 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2692 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2693 /* Don't flag it as "accurately an integer" if the number
2694 came from a (by definition imprecise) NV operation, and
2695 we're outside the range of NV integer precision */
2701 DEBUG_c(PerlIO_printf(Perl_debug_log,
2702 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2706 return (IV)SvUVX(sv);
2709 else if (SvPOKp(sv) && SvLEN(sv)) {
2711 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2712 /* We want to avoid a possible problem when we cache an IV which
2713 may be later translated to an NV, and the resulting NV is not
2714 the same as the direct translation of the initial string
2715 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2716 be careful to ensure that the value with the .456 is around if the
2717 NV value is requested in the future).
2719 This means that if we cache such an IV, we need to cache the
2720 NV as well. Moreover, we trade speed for space, and do not
2721 cache the NV if we are sure it's not needed.
2724 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2725 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2726 == IS_NUMBER_IN_UV) {
2727 /* It's definitely an integer, only upgrade to PVIV */
2728 if (SvTYPE(sv) < SVt_PVIV)
2729 sv_upgrade(sv, SVt_PVIV);
2731 } else if (SvTYPE(sv) < SVt_PVNV)
2732 sv_upgrade(sv, SVt_PVNV);
2734 /* If NV preserves UV then we only use the UV value if we know that
2735 we aren't going to call atof() below. If NVs don't preserve UVs
2736 then the value returned may have more precision than atof() will
2737 return, even though value isn't perfectly accurate. */
2738 if ((numtype & (IS_NUMBER_IN_UV
2739 #ifdef NV_PRESERVES_UV
2742 )) == IS_NUMBER_IN_UV) {
2743 /* This won't turn off the public IOK flag if it was set above */
2744 (void)SvIOKp_on(sv);
2746 if (!(numtype & IS_NUMBER_NEG)) {
2748 if (value <= (UV)IV_MAX) {
2749 SvIV_set(sv, (IV)value);
2751 SvUV_set(sv, value);
2755 /* 2s complement assumption */
2756 if (value <= (UV)IV_MIN) {
2757 SvIV_set(sv, -(IV)value);
2759 /* Too negative for an IV. This is a double upgrade, but
2760 I'm assuming it will be rare. */
2761 if (SvTYPE(sv) < SVt_PVNV)
2762 sv_upgrade(sv, SVt_PVNV);
2766 SvNV_set(sv, -(NV)value);
2767 SvIV_set(sv, IV_MIN);
2771 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2772 will be in the previous block to set the IV slot, and the next
2773 block to set the NV slot. So no else here. */
2775 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2776 != IS_NUMBER_IN_UV) {
2777 /* It wasn't an (integer that doesn't overflow the UV). */
2778 SvNV_set(sv, Atof(SvPVX(sv)));
2780 if (! numtype && ckWARN(WARN_NUMERIC))
2783 #if defined(USE_LONG_DOUBLE)
2784 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2785 PTR2UV(sv), SvNVX(sv)));
2787 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2788 PTR2UV(sv), SvNVX(sv)));
2792 #ifdef NV_PRESERVES_UV
2793 (void)SvIOKp_on(sv);
2795 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2796 SvIV_set(sv, I_V(SvNVX(sv)));
2797 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2800 /* Integer is imprecise. NOK, IOKp */
2802 /* UV will not work better than IV */
2804 if (SvNVX(sv) > (NV)UV_MAX) {
2806 /* Integer is inaccurate. NOK, IOKp, is UV */
2807 SvUV_set(sv, UV_MAX);
2810 SvUV_set(sv, U_V(SvNVX(sv)));
2811 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2812 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2816 /* Integer is imprecise. NOK, IOKp, is UV */
2822 #else /* NV_PRESERVES_UV */
2823 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2824 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2825 /* The IV slot will have been set from value returned by
2826 grok_number above. The NV slot has just been set using
2829 assert (SvIOKp(sv));
2831 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2832 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2833 /* Small enough to preserve all bits. */
2834 (void)SvIOKp_on(sv);
2836 SvIV_set(sv, I_V(SvNVX(sv)));
2837 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2839 /* Assumption: first non-preserved integer is < IV_MAX,
2840 this NV is in the preserved range, therefore: */
2841 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2843 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);
2847 0 0 already failed to read UV.
2848 0 1 already failed to read UV.
2849 1 0 you won't get here in this case. IV/UV
2850 slot set, public IOK, Atof() unneeded.
2851 1 1 already read UV.
2852 so there's no point in sv_2iuv_non_preserve() attempting
2853 to use atol, strtol, strtoul etc. */
2854 if (sv_2iuv_non_preserve (sv, numtype)
2855 >= IS_NUMBER_OVERFLOW_IV)
2859 #endif /* NV_PRESERVES_UV */
2862 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2864 if (SvTYPE(sv) < SVt_IV)
2865 /* Typically the caller expects that sv_any is not NULL now. */
2866 sv_upgrade(sv, SVt_IV);
2869 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2870 PTR2UV(sv),SvIVX(sv)));
2871 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2874 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2875 * this function provided for binary compatibility only
2879 Perl_sv_2uv(pTHX_ register SV *sv)
2881 return sv_2uv_flags(sv, SV_GMAGIC);
2885 =for apidoc sv_2uv_flags
2887 Return the unsigned integer value of an SV, doing any necessary string
2888 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2889 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2895 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2899 if (SvGMAGICAL(sv)) {
2900 if (flags & SV_GMAGIC)
2905 return U_V(SvNVX(sv));
2906 if (SvPOKp(sv) && SvLEN(sv))
2909 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2910 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2916 if (SvTHINKFIRST(sv)) {
2919 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2920 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2921 return SvUV(tmpstr);
2922 return PTR2UV(SvRV(sv));
2925 sv_force_normal_flags(sv, 0);
2927 if (SvREADONLY(sv) && !SvOK(sv)) {
2928 if (ckWARN(WARN_UNINITIALIZED))
2938 return (UV)SvIVX(sv);
2942 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2943 * without also getting a cached IV/UV from it at the same time
2944 * (ie PV->NV conversion should detect loss of accuracy and cache
2945 * IV or UV at same time to avoid this. */
2946 /* IV-over-UV optimisation - choose to cache IV if possible */
2948 if (SvTYPE(sv) == SVt_NV)
2949 sv_upgrade(sv, SVt_PVNV);
2951 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2952 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2953 SvIV_set(sv, I_V(SvNVX(sv)));
2954 if (SvNVX(sv) == (NV) SvIVX(sv)
2955 #ifndef NV_PRESERVES_UV
2956 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2957 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2958 /* Don't flag it as "accurately an integer" if the number
2959 came from a (by definition imprecise) NV operation, and
2960 we're outside the range of NV integer precision */
2963 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2964 DEBUG_c(PerlIO_printf(Perl_debug_log,
2965 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2971 /* IV not precise. No need to convert from PV, as NV
2972 conversion would already have cached IV if it detected
2973 that PV->IV would be better than PV->NV->IV
2974 flags already correct - don't set public IOK. */
2975 DEBUG_c(PerlIO_printf(Perl_debug_log,
2976 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2981 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2982 but the cast (NV)IV_MIN rounds to a the value less (more
2983 negative) than IV_MIN which happens to be equal to SvNVX ??
2984 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2985 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2986 (NV)UVX == NVX are both true, but the values differ. :-(
2987 Hopefully for 2s complement IV_MIN is something like
2988 0x8000000000000000 which will be exact. NWC */
2991 SvUV_set(sv, U_V(SvNVX(sv)));
2993 (SvNVX(sv) == (NV) SvUVX(sv))
2994 #ifndef NV_PRESERVES_UV
2995 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2996 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2997 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2998 /* Don't flag it as "accurately an integer" if the number
2999 came from a (by definition imprecise) NV operation, and
3000 we're outside the range of NV integer precision */
3005 DEBUG_c(PerlIO_printf(Perl_debug_log,
3006 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
3012 else if (SvPOKp(sv) && SvLEN(sv)) {
3014 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3016 /* We want to avoid a possible problem when we cache a UV which
3017 may be later translated to an NV, and the resulting NV is not
3018 the translation of the initial data.
3020 This means that if we cache such a UV, we need to cache the
3021 NV as well. Moreover, we trade speed for space, and do not
3022 cache the NV if not needed.
3025 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
3026 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3027 == IS_NUMBER_IN_UV) {
3028 /* It's definitely an integer, only upgrade to PVIV */
3029 if (SvTYPE(sv) < SVt_PVIV)
3030 sv_upgrade(sv, SVt_PVIV);
3032 } else if (SvTYPE(sv) < SVt_PVNV)
3033 sv_upgrade(sv, SVt_PVNV);
3035 /* If NV preserves UV then we only use the UV value if we know that
3036 we aren't going to call atof() below. If NVs don't preserve UVs
3037 then the value returned may have more precision than atof() will
3038 return, even though it isn't accurate. */
3039 if ((numtype & (IS_NUMBER_IN_UV
3040 #ifdef NV_PRESERVES_UV
3043 )) == IS_NUMBER_IN_UV) {
3044 /* This won't turn off the public IOK flag if it was set above */
3045 (void)SvIOKp_on(sv);
3047 if (!(numtype & IS_NUMBER_NEG)) {
3049 if (value <= (UV)IV_MAX) {
3050 SvIV_set(sv, (IV)value);
3052 /* it didn't overflow, and it was positive. */
3053 SvUV_set(sv, value);
3057 /* 2s complement assumption */
3058 if (value <= (UV)IV_MIN) {
3059 SvIV_set(sv, -(IV)value);
3061 /* Too negative for an IV. This is a double upgrade, but
3062 I'm assuming it will be rare. */
3063 if (SvTYPE(sv) < SVt_PVNV)
3064 sv_upgrade(sv, SVt_PVNV);
3068 SvNV_set(sv, -(NV)value);
3069 SvIV_set(sv, IV_MIN);
3074 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3075 != IS_NUMBER_IN_UV) {
3076 /* It wasn't an integer, or it overflowed the UV. */
3077 SvNV_set(sv, Atof(SvPVX(sv)));
3079 if (! numtype && ckWARN(WARN_NUMERIC))
3082 #if defined(USE_LONG_DOUBLE)
3083 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
3084 PTR2UV(sv), SvNVX(sv)));
3086 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
3087 PTR2UV(sv), SvNVX(sv)));
3090 #ifdef NV_PRESERVES_UV
3091 (void)SvIOKp_on(sv);
3093 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3094 SvIV_set(sv, I_V(SvNVX(sv)));
3095 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
3098 /* Integer is imprecise. NOK, IOKp */
3100 /* UV will not work better than IV */
3102 if (SvNVX(sv) > (NV)UV_MAX) {
3104 /* Integer is inaccurate. NOK, IOKp, is UV */
3105 SvUV_set(sv, UV_MAX);
3108 SvUV_set(sv, U_V(SvNVX(sv)));
3109 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
3110 NV preservse UV so can do correct comparison. */
3111 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
3115 /* Integer is imprecise. NOK, IOKp, is UV */
3120 #else /* NV_PRESERVES_UV */
3121 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3122 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
3123 /* The UV slot will have been set from value returned by
3124 grok_number above. The NV slot has just been set using
3127 assert (SvIOKp(sv));
3129 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3130 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3131 /* Small enough to preserve all bits. */
3132 (void)SvIOKp_on(sv);
3134 SvIV_set(sv, I_V(SvNVX(sv)));
3135 if ((NV)(SvIVX(sv)) == SvNVX(sv))
3137 /* Assumption: first non-preserved integer is < IV_MAX,
3138 this NV is in the preserved range, therefore: */
3139 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
3141 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);
3144 sv_2iuv_non_preserve (sv, numtype);
3146 #endif /* NV_PRESERVES_UV */
3150 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3151 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3154 if (SvTYPE(sv) < SVt_IV)
3155 /* Typically the caller expects that sv_any is not NULL now. */
3156 sv_upgrade(sv, SVt_IV);
3160 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
3161 PTR2UV(sv),SvUVX(sv)));
3162 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
3168 Return the num value of an SV, doing any necessary string or integer
3169 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
3176 Perl_sv_2nv(pTHX_ register SV *sv)
3180 if (SvGMAGICAL(sv)) {
3184 if (SvPOKp(sv) && SvLEN(sv)) {
3185 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
3186 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
3188 return Atof(SvPVX(sv));
3192 return (NV)SvUVX(sv);
3194 return (NV)SvIVX(sv);
3197 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3198 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3204 if (SvTHINKFIRST(sv)) {
3207 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
3208 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
3209 return SvNV(tmpstr);
3210 return PTR2NV(SvRV(sv));
3213 sv_force_normal_flags(sv, 0);
3215 if (SvREADONLY(sv) && !SvOK(sv)) {
3216 if (ckWARN(WARN_UNINITIALIZED))
3221 if (SvTYPE(sv) < SVt_NV) {
3222 if (SvTYPE(sv) == SVt_IV)
3223 sv_upgrade(sv, SVt_PVNV);
3225 sv_upgrade(sv, SVt_NV);
3226 #ifdef USE_LONG_DOUBLE
3228 STORE_NUMERIC_LOCAL_SET_STANDARD();
3229 PerlIO_printf(Perl_debug_log,
3230 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
3231 PTR2UV(sv), SvNVX(sv));
3232 RESTORE_NUMERIC_LOCAL();
3236 STORE_NUMERIC_LOCAL_SET_STANDARD();
3237 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
3238 PTR2UV(sv), SvNVX(sv));
3239 RESTORE_NUMERIC_LOCAL();
3243 else if (SvTYPE(sv) < SVt_PVNV)
3244 sv_upgrade(sv, SVt_PVNV);
3249 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
3250 #ifdef NV_PRESERVES_UV
3253 /* Only set the public NV OK flag if this NV preserves the IV */
3254 /* Check it's not 0xFFFFFFFFFFFFFFFF */
3255 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
3256 : (SvIVX(sv) == I_V(SvNVX(sv))))
3262 else if (SvPOKp(sv) && SvLEN(sv)) {
3264 const int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3265 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
3267 #ifdef NV_PRESERVES_UV
3268 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3269 == IS_NUMBER_IN_UV) {
3270 /* It's definitely an integer */
3271 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
3273 SvNV_set(sv, Atof(SvPVX(sv)));
3276 SvNV_set(sv, Atof(SvPVX(sv)));
3277 /* Only set the public NV OK flag if this NV preserves the value in
3278 the PV at least as well as an IV/UV would.
3279 Not sure how to do this 100% reliably. */
3280 /* if that shift count is out of range then Configure's test is
3281 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
3283 if (((UV)1 << NV_PRESERVES_UV_BITS) >
3284 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
3285 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
3286 } else if (!(numtype & IS_NUMBER_IN_UV)) {
3287 /* Can't use strtol etc to convert this string, so don't try.
3288 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
3291 /* value has been set. It may not be precise. */
3292 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
3293 /* 2s complement assumption for (UV)IV_MIN */
3294 SvNOK_on(sv); /* Integer is too negative. */
3299 if (numtype & IS_NUMBER_NEG) {
3300 SvIV_set(sv, -(IV)value);
3301 } else if (value <= (UV)IV_MAX) {
3302 SvIV_set(sv, (IV)value);
3304 SvUV_set(sv, value);
3308 if (numtype & IS_NUMBER_NOT_INT) {
3309 /* I believe that even if the original PV had decimals,
3310 they are lost beyond the limit of the FP precision.
3311 However, neither is canonical, so both only get p
3312 flags. NWC, 2000/11/25 */
3313 /* Both already have p flags, so do nothing */
3316 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
3317 if (SvIVX(sv) == I_V(nv)) {
3322 /* It had no "." so it must be integer. */
3325 /* between IV_MAX and NV(UV_MAX).
3326 Could be slightly > UV_MAX */
3328 if (numtype & IS_NUMBER_NOT_INT) {
3329 /* UV and NV both imprecise. */
3331 UV nv_as_uv = U_V(nv);
3333 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
3344 #endif /* NV_PRESERVES_UV */
3347 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3349 if (SvTYPE(sv) < SVt_NV)
3350 /* Typically the caller expects that sv_any is not NULL now. */
3351 /* XXX Ilya implies that this is a bug in callers that assume this
3352 and ideally should be fixed. */
3353 sv_upgrade(sv, SVt_NV);
3356 #if defined(USE_LONG_DOUBLE)
3358 STORE_NUMERIC_LOCAL_SET_STANDARD();
3359 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
3360 PTR2UV(sv), SvNVX(sv));
3361 RESTORE_NUMERIC_LOCAL();
3365 STORE_NUMERIC_LOCAL_SET_STANDARD();
3366 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
3367 PTR2UV(sv), SvNVX(sv));
3368 RESTORE_NUMERIC_LOCAL();
3374 /* asIV(): extract an integer from the string value of an SV.
3375 * Caller must validate PVX */
3378 S_asIV(pTHX_ SV *sv)
3381 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3383 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3384 == IS_NUMBER_IN_UV) {
3385 /* It's definitely an integer */
3386 if (numtype & IS_NUMBER_NEG) {
3387 if (value < (UV)IV_MIN)
3390 if (value < (UV)IV_MAX)
3395 if (ckWARN(WARN_NUMERIC))
3398 return I_V(Atof(SvPVX(sv)));
3401 /* asUV(): extract an unsigned integer from the string value of an SV
3402 * Caller must validate PVX */
3405 S_asUV(pTHX_ SV *sv)
3408 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
3410 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
3411 == IS_NUMBER_IN_UV) {
3412 /* It's definitely an integer */
3413 if (!(numtype & IS_NUMBER_NEG))
3417 if (ckWARN(WARN_NUMERIC))
3420 return U_V(Atof(SvPVX(sv)));
3424 =for apidoc sv_2pv_nolen
3426 Like C<sv_2pv()>, but doesn't return the length too. You should usually
3427 use the macro wrapper C<SvPV_nolen(sv)> instead.
3432 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
3435 return sv_2pv(sv, &n_a);
3438 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
3439 * UV as a string towards the end of buf, and return pointers to start and
3442 * We assume that buf is at least TYPE_CHARS(UV) long.
3446 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
3448 char *ptr = buf + TYPE_CHARS(UV);
3462 *--ptr = '0' + (char)(uv % 10);
3470 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
3471 * this function provided for binary compatibility only
3475 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
3477 return sv_2pv_flags(sv, lp, SV_GMAGIC);
3481 =for apidoc sv_2pv_flags
3483 Returns a pointer to the string value of an SV, and sets *lp to its length.
3484 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3486 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3487 usually end up here too.
3493 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3498 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3499 char *tmpbuf = tbuf;
3505 if (SvGMAGICAL(sv)) {
3506 if (flags & SV_GMAGIC)
3514 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3516 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3521 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3526 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3527 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3534 if (SvTHINKFIRST(sv)) {
3537 register const char *typestr;
3538 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3539 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3540 char *pv = SvPV(tmpstr, *lp);
3550 typestr = "NULLREF";
3554 switch (SvTYPE(sv)) {
3556 if ( ((SvFLAGS(sv) &
3557 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3558 == (SVs_OBJECT|SVs_SMG))
3559 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3560 const regexp *re = (regexp *)mg->mg_obj;
3563 const char *fptr = "msix";
3568 char need_newline = 0;
3569 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3571 while((ch = *fptr++)) {
3573 reflags[left++] = ch;
3576 reflags[right--] = ch;
3581 reflags[left] = '-';
3585 mg->mg_len = re->prelen + 4 + left;
3587 * If /x was used, we have to worry about a regex
3588 * ending with a comment later being embedded
3589 * within another regex. If so, we don't want this
3590 * regex's "commentization" to leak out to the
3591 * right part of the enclosing regex, we must cap
3592 * it with a newline.
3594 * So, if /x was used, we scan backwards from the
3595 * end of the regex. If we find a '#' before we
3596 * find a newline, we need to add a newline
3597 * ourself. If we find a '\n' first (or if we
3598 * don't find '#' or '\n'), we don't need to add
3599 * anything. -jfriedl
3601 if (PMf_EXTENDED & re->reganch)
3603 const char *endptr = re->precomp + re->prelen;
3604 while (endptr >= re->precomp)
3606 const char c = *(endptr--);
3608 break; /* don't need another */
3610 /* we end while in a comment, so we
3612 mg->mg_len++; /* save space for it */
3613 need_newline = 1; /* note to add it */
3619 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3620 Copy("(?", mg->mg_ptr, 2, char);
3621 Copy(reflags, mg->mg_ptr+2, left, char);
3622 Copy(":", mg->mg_ptr+left+2, 1, char);
3623 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3625 mg->mg_ptr[mg->mg_len - 2] = '\n';
3626 mg->mg_ptr[mg->mg_len - 1] = ')';
3627 mg->mg_ptr[mg->mg_len] = 0;
3629 PL_reginterp_cnt += re->program[0].next_off;
3631 if (re->reganch & ROPT_UTF8)
3646 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3647 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3648 /* tied lvalues should appear to be
3649 * scalars for backwards compatitbility */
3650 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3651 ? "SCALAR" : "LVALUE"; break;
3652 case SVt_PVAV: typestr = "ARRAY"; break;
3653 case SVt_PVHV: typestr = "HASH"; break;
3654 case SVt_PVCV: typestr = "CODE"; break;
3655 case SVt_PVGV: typestr = "GLOB"; break;
3656 case SVt_PVFM: typestr = "FORMAT"; break;
3657 case SVt_PVIO: typestr = "IO"; break;
3658 default: typestr = "UNKNOWN"; break;
3662 const char *name = HvNAME(SvSTASH(sv));
3663 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3664 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3667 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3670 *lp = strlen(typestr);
3671 return (char *)typestr;
3673 if (SvREADONLY(sv) && !SvOK(sv)) {
3674 if (ckWARN(WARN_UNINITIALIZED))
3680 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3681 /* I'm assuming that if both IV and NV are equally valid then
3682 converting the IV is going to be more efficient */
3683 const U32 isIOK = SvIOK(sv);
3684 const U32 isUIOK = SvIsUV(sv);
3685 char buf[TYPE_CHARS(UV)];
3688 if (SvTYPE(sv) < SVt_PVIV)
3689 sv_upgrade(sv, SVt_PVIV);
3691 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3693 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3694 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3695 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3696 SvCUR_set(sv, ebuf - ptr);
3706 else if (SvNOKp(sv)) {
3707 if (SvTYPE(sv) < SVt_PVNV)
3708 sv_upgrade(sv, SVt_PVNV);
3709 /* The +20 is pure guesswork. Configure test needed. --jhi */
3710 SvGROW(sv, NV_DIG + 20);
3712 olderrno = errno; /* some Xenix systems wipe out errno here */
3714 if (SvNVX(sv) == 0.0)
3715 (void)strcpy(s,"0");
3719 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3722 #ifdef FIXNEGATIVEZERO
3723 if (*s == '-' && s[1] == '0' && !s[2])
3733 if (ckWARN(WARN_UNINITIALIZED)
3734 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3737 if (SvTYPE(sv) < SVt_PV)
3738 /* Typically the caller expects that sv_any is not NULL now. */
3739 sv_upgrade(sv, SVt_PV);
3742 *lp = s - SvPVX(sv);
3745 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3746 PTR2UV(sv),SvPVX(sv)));
3750 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3751 /* Sneaky stuff here */
3755 tsv = newSVpv(tmpbuf, 0);
3772 len = strlen(tmpbuf);
3774 #ifdef FIXNEGATIVEZERO
3775 if (len == 2 && t[0] == '-' && t[1] == '0') {
3780 (void)SvUPGRADE(sv, SVt_PV);
3782 s = SvGROW(sv, len + 1);
3785 return strcpy(s, t);
3790 =for apidoc sv_copypv
3792 Copies a stringified representation of the source SV into the
3793 destination SV. Automatically performs any necessary mg_get and
3794 coercion of numeric values into strings. Guaranteed to preserve
3795 UTF-8 flag even from overloaded objects. Similar in nature to
3796 sv_2pv[_flags] but operates directly on an SV instead of just the
3797 string. Mostly uses sv_2pv_flags to do its work, except when that
3798 would lose the UTF-8'ness of the PV.
3804 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3809 sv_setpvn(dsv,s,len);
3817 =for apidoc sv_2pvbyte_nolen
3819 Return a pointer to the byte-encoded representation of the SV.
3820 May cause the SV to be downgraded from UTF-8 as a side-effect.
3822 Usually accessed via the C<SvPVbyte_nolen> macro.
3828 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3831 return sv_2pvbyte(sv, &n_a);
3835 =for apidoc sv_2pvbyte
3837 Return a pointer to the byte-encoded representation of the SV, and set *lp
3838 to its length. May cause the SV to be downgraded from UTF-8 as a
3841 Usually accessed via the C<SvPVbyte> macro.
3847 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3849 sv_utf8_downgrade(sv,0);
3850 return SvPV(sv,*lp);
3854 =for apidoc sv_2pvutf8_nolen
3856 Return a pointer to the UTF-8-encoded representation of the SV.
3857 May cause the SV to be upgraded to UTF-8 as a side-effect.
3859 Usually accessed via the C<SvPVutf8_nolen> macro.
3865 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3868 return sv_2pvutf8(sv, &n_a);
3872 =for apidoc sv_2pvutf8
3874 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3875 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3877 Usually accessed via the C<SvPVutf8> macro.
3883 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3885 sv_utf8_upgrade(sv);
3886 return SvPV(sv,*lp);
3890 =for apidoc sv_2bool
3892 This function is only called on magical items, and is only used by
3893 sv_true() or its macro equivalent.
3899 Perl_sv_2bool(pTHX_ register SV *sv)
3908 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3909 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3910 return (bool)SvTRUE(tmpsv);
3911 return SvRV(sv) != 0;
3914 register XPV* Xpvtmp;
3915 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3916 (*Xpvtmp->xpv_pv > '0' ||
3917 Xpvtmp->xpv_cur > 1 ||
3918 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3925 return SvIVX(sv) != 0;
3928 return SvNVX(sv) != 0.0;
3935 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3936 * this function provided for binary compatibility only
3941 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3943 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3947 =for apidoc sv_utf8_upgrade
3949 Converts the PV of an SV to its UTF-8-encoded form.
3950 Forces the SV to string form if it is not already.
3951 Always sets the SvUTF8 flag to avoid future validity checks even
3952 if all the bytes have hibit clear.
3954 This is not as a general purpose byte encoding to Unicode interface:
3955 use the Encode extension for that.
3957 =for apidoc sv_utf8_upgrade_flags
3959 Converts the PV of an SV to its UTF-8-encoded form.
3960 Forces the SV to string form if it is not already.
3961 Always sets the SvUTF8 flag to avoid future validity checks even
3962 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3963 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3964 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3966 This is not as a general purpose byte encoding to Unicode interface:
3967 use the Encode extension for that.
3973 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3975 if (sv == &PL_sv_undef)
3979 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3980 (void) sv_2pv_flags(sv,&len, flags);
3984 (void) SvPV_force(sv,len);
3993 sv_force_normal_flags(sv, 0);
3996 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3997 sv_recode_to_utf8(sv, PL_encoding);
3998 else { /* Assume Latin-1/EBCDIC */
3999 /* This function could be much more efficient if we
4000 * had a FLAG in SVs to signal if there are any hibit
4001 * chars in the PV. Given that there isn't such a flag
4002 * make the loop as fast as possible. */
4003 U8 *s = (U8 *) SvPVX(sv);
4004 U8 *e = (U8 *) SvEND(sv);
4010 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
4014 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
4015 s = bytes_to_utf8((U8*)s, &len);
4017 SvPV_free(sv); /* No longer using what was there before. */
4019 SvPV_set(sv, (char*)s);
4020 SvCUR_set(sv, len - 1);
4021 SvLEN_set(sv, len); /* No longer know the real size. */
4023 /* Mark as UTF-8 even if no hibit - saves scanning loop */
4030 =for apidoc sv_utf8_downgrade
4032 Attempts to convert the PV of an SV from characters to bytes.
4033 If the PV contains a character beyond byte, this conversion will fail;
4034 in this case, either returns false or, if C<fail_ok> is not
4037 This is not as a general purpose Unicode to byte encoding interface:
4038 use the Encode extension for that.
4044 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
4046 if (SvPOKp(sv) && SvUTF8(sv)) {
4052 sv_force_normal_flags(sv, 0);
4054 s = (U8 *) SvPV(sv, len);
4055 if (!utf8_to_bytes(s, &len)) {
4060 Perl_croak(aTHX_ "Wide character in %s",
4063 Perl_croak(aTHX_ "Wide character");
4074 =for apidoc sv_utf8_encode
4076 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
4077 flag off so that it looks like octets again.
4083 Perl_sv_utf8_encode(pTHX_ register SV *sv)
4085 (void) sv_utf8_upgrade(sv);
4087 sv_force_normal_flags(sv, 0);
4089 if (SvREADONLY(sv)) {
4090 Perl_croak(aTHX_ PL_no_modify);
4096 =for apidoc sv_utf8_decode
4098 If the PV of the SV is an octet sequence in UTF-8
4099 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
4100 so that it looks like a character. If the PV contains only single-byte
4101 characters, the C<SvUTF8> flag stays being off.
4102 Scans PV for validity and returns false if the PV is invalid UTF-8.
4108 Perl_sv_utf8_decode(pTHX_ register SV *sv)
4114 /* The octets may have got themselves encoded - get them back as
4117 if (!sv_utf8_downgrade(sv, TRUE))
4120 /* it is actually just a matter of turning the utf8 flag on, but
4121 * we want to make sure everything inside is valid utf8 first.
4123 c = (U8 *) SvPVX(sv);
4124 if (!is_utf8_string(c, SvCUR(sv)+1))
4126 e = (U8 *) SvEND(sv);
4129 if (!UTF8_IS_INVARIANT(ch)) {
4138 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
4139 * this function provided for binary compatibility only
4143 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
4145 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
4149 =for apidoc sv_setsv
4151 Copies the contents of the source SV C<ssv> into the destination SV
4152 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4153 function if the source SV needs to be reused. Does not handle 'set' magic.
4154 Loosely speaking, it performs a copy-by-value, obliterating any previous
4155 content of the destination.
4157 You probably want to use one of the assortment of wrappers, such as
4158 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4159 C<SvSetMagicSV_nosteal>.
4161 =for apidoc sv_setsv_flags
4163 Copies the contents of the source SV C<ssv> into the destination SV
4164 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
4165 function if the source SV needs to be reused. Does not handle 'set' magic.
4166 Loosely speaking, it performs a copy-by-value, obliterating any previous
4167 content of the destination.
4168 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
4169 C<ssv> if appropriate, else not. If the C<flags> parameter has the
4170 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
4171 and C<sv_setsv_nomg> are implemented in terms of this function.
4173 You probably want to use one of the assortment of wrappers, such as
4174 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
4175 C<SvSetMagicSV_nosteal>.
4177 This is the primary function for copying scalars, and most other
4178 copy-ish functions and macros use this underneath.
4184 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
4186 register U32 sflags;
4192 SV_CHECK_THINKFIRST_COW_DROP(dstr);
4194 sstr = &PL_sv_undef;
4195 stype = SvTYPE(sstr);
4196 dtype = SvTYPE(dstr);
4201 /* need to nuke the magic */
4203 SvRMAGICAL_off(dstr);
4206 /* There's a lot of redundancy below but we're going for speed here */
4211 if (dtype != SVt_PVGV) {
4212 (void)SvOK_off(dstr);
4220 sv_upgrade(dstr, SVt_IV);
4223 sv_upgrade(dstr, SVt_PVNV);
4227 sv_upgrade(dstr, SVt_PVIV);
4230 (void)SvIOK_only(dstr);
4231 SvIV_set(dstr, SvIVX(sstr));
4234 if (SvTAINTED(sstr))
4245 sv_upgrade(dstr, SVt_NV);
4250 sv_upgrade(dstr, SVt_PVNV);
4253 SvNV_set(dstr, SvNVX(sstr));
4254 (void)SvNOK_only(dstr);
4255 if (SvTAINTED(sstr))
4263 sv_upgrade(dstr, SVt_RV);
4264 else if (dtype == SVt_PVGV &&
4265 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
4268 if (GvIMPORTED(dstr) != GVf_IMPORTED
4269 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4271 GvIMPORTED_on(dstr);
4280 #ifdef PERL_COPY_ON_WRITE
4281 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
4282 if (dtype < SVt_PVIV)
4283 sv_upgrade(dstr, SVt_PVIV);
4290 sv_upgrade(dstr, SVt_PV);
4293 if (dtype < SVt_PVIV)
4294 sv_upgrade(dstr, SVt_PVIV);
4297 if (dtype < SVt_PVNV)
4298 sv_upgrade(dstr, SVt_PVNV);
4305 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
4308 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
4312 if (dtype <= SVt_PVGV) {
4314 if (dtype != SVt_PVGV) {
4315 char *name = GvNAME(sstr);
4316 STRLEN len = GvNAMELEN(sstr);
4317 /* don't upgrade SVt_PVLV: it can hold a glob */
4318 if (dtype != SVt_PVLV)
4319 sv_upgrade(dstr, SVt_PVGV);
4320 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
4321 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
4322 GvNAME(dstr) = savepvn(name, len);
4323 GvNAMELEN(dstr) = len;
4324 SvFAKE_on(dstr); /* can coerce to non-glob */
4326 /* ahem, death to those who redefine active sort subs */
4327 else if (PL_curstackinfo->si_type == PERLSI_SORT
4328 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
4329 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
4332 #ifdef GV_UNIQUE_CHECK
4333 if (GvUNIQUE((GV*)dstr)) {
4334 Perl_croak(aTHX_ PL_no_modify);
4338 (void)SvOK_off(dstr);
4339 GvINTRO_off(dstr); /* one-shot flag */
4341 GvGP(dstr) = gp_ref(GvGP(sstr));
4342 if (SvTAINTED(sstr))
4344 if (GvIMPORTED(dstr) != GVf_IMPORTED
4345 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4347 GvIMPORTED_on(dstr);
4355 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
4357 if ((int)SvTYPE(sstr) != stype) {
4358 stype = SvTYPE(sstr);
4359 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
4363 if (stype == SVt_PVLV)
4364 (void)SvUPGRADE(dstr, SVt_PVNV);
4366 (void)SvUPGRADE(dstr, (U32)stype);
4369 sflags = SvFLAGS(sstr);
4371 if (sflags & SVf_ROK) {
4372 if (dtype >= SVt_PV) {
4373 if (dtype == SVt_PVGV) {
4374 SV *sref = SvREFCNT_inc(SvRV(sstr));
4376 int intro = GvINTRO(dstr);
4378 #ifdef GV_UNIQUE_CHECK
4379 if (GvUNIQUE((GV*)dstr)) {
4380 Perl_croak(aTHX_ PL_no_modify);
4385 GvINTRO_off(dstr); /* one-shot flag */
4386 GvLINE(dstr) = CopLINE(PL_curcop);
4387 GvEGV(dstr) = (GV*)dstr;
4390 switch (SvTYPE(sref)) {
4393 SAVEGENERICSV(GvAV(dstr));
4395 dref = (SV*)GvAV(dstr);
4396 GvAV(dstr) = (AV*)sref;
4397 if (!GvIMPORTED_AV(dstr)
4398 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4400 GvIMPORTED_AV_on(dstr);
4405 SAVEGENERICSV(GvHV(dstr));
4407 dref = (SV*)GvHV(dstr);
4408 GvHV(dstr) = (HV*)sref;
4409 if (!GvIMPORTED_HV(dstr)
4410 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4412 GvIMPORTED_HV_on(dstr);
4417 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
4418 SvREFCNT_dec(GvCV(dstr));
4419 GvCV(dstr) = Nullcv;
4420 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4421 PL_sub_generation++;
4423 SAVEGENERICSV(GvCV(dstr));
4426 dref = (SV*)GvCV(dstr);
4427 if (GvCV(dstr) != (CV*)sref) {
4428 CV* cv = GvCV(dstr);
4430 if (!GvCVGEN((GV*)dstr) &&
4431 (CvROOT(cv) || CvXSUB(cv)))
4433 /* ahem, death to those who redefine
4434 * active sort subs */
4435 if (PL_curstackinfo->si_type == PERLSI_SORT &&
4436 PL_sortcop == CvSTART(cv))
4438 "Can't redefine active sort subroutine %s",
4439 GvENAME((GV*)dstr));
4440 /* Redefining a sub - warning is mandatory if
4441 it was a const and its value changed. */
4442 if (ckWARN(WARN_REDEFINE)
4444 && (!CvCONST((CV*)sref)
4445 || sv_cmp(cv_const_sv(cv),
4446 cv_const_sv((CV*)sref)))))
4448 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4450 ? "Constant subroutine %s::%s redefined"
4451 : "Subroutine %s::%s redefined",
4452 HvNAME(GvSTASH((GV*)dstr)),
4453 GvENAME((GV*)dstr));
4457 cv_ckproto(cv, (GV*)dstr,
4458 SvPOK(sref) ? SvPVX(sref) : Nullch);
4460 GvCV(dstr) = (CV*)sref;
4461 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4462 GvASSUMECV_on(dstr);
4463 PL_sub_generation++;
4465 if (!GvIMPORTED_CV(dstr)
4466 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4468 GvIMPORTED_CV_on(dstr);
4473 SAVEGENERICSV(GvIOp(dstr));
4475 dref = (SV*)GvIOp(dstr);
4476 GvIOp(dstr) = (IO*)sref;
4480 SAVEGENERICSV(GvFORM(dstr));
4482 dref = (SV*)GvFORM(dstr);
4483 GvFORM(dstr) = (CV*)sref;
4487 SAVEGENERICSV(GvSV(dstr));
4489 dref = (SV*)GvSV(dstr);
4491 if (!GvIMPORTED_SV(dstr)
4492 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4494 GvIMPORTED_SV_on(dstr);
4500 if (SvTAINTED(sstr))
4510 (void)SvOK_off(dstr);
4511 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4513 if (sflags & SVp_NOK) {
4515 /* Only set the public OK flag if the source has public OK. */
4516 if (sflags & SVf_NOK)
4517 SvFLAGS(dstr) |= SVf_NOK;
4518 SvNV_set(dstr, SvNVX(sstr));
4520 if (sflags & SVp_IOK) {
4521 (void)SvIOKp_on(dstr);
4522 if (sflags & SVf_IOK)
4523 SvFLAGS(dstr) |= SVf_IOK;
4524 if (sflags & SVf_IVisUV)
4526 SvIV_set(dstr, SvIVX(sstr));
4528 if (SvAMAGIC(sstr)) {
4532 else if (sflags & SVp_POK) {
4536 * Check to see if we can just swipe the string. If so, it's a
4537 * possible small lose on short strings, but a big win on long ones.
4538 * It might even be a win on short strings if SvPVX(dstr)
4539 * has to be allocated and SvPVX(sstr) has to be freed.
4542 /* Whichever path we take through the next code, we want this true,
4543 and doing it now facilitates the COW check. */
4544 (void)SvPOK_only(dstr);
4547 #ifdef PERL_COPY_ON_WRITE
4548 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4552 (sflags & SVs_TEMP) && /* slated for free anyway? */
4553 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4554 (!(flags & SV_NOSTEAL)) &&
4555 /* and we're allowed to steal temps */
4556 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4557 SvLEN(sstr) && /* and really is a string */
4558 /* and won't be needed again, potentially */
4559 !(PL_op && PL_op->op_type == OP_AASSIGN))
4560 #ifdef PERL_COPY_ON_WRITE
4561 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4562 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4563 && SvTYPE(sstr) >= SVt_PVIV)
4566 /* Failed the swipe test, and it's not a shared hash key either.
4567 Have to copy the string. */
4568 STRLEN len = SvCUR(sstr);
4569 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4570 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4571 SvCUR_set(dstr, len);
4572 *SvEND(dstr) = '\0';
4574 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4576 #ifdef PERL_COPY_ON_WRITE
4577 /* Either it's a shared hash key, or it's suitable for
4578 copy-on-write or we can swipe the string. */
4580 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4585 /* I believe I should acquire a global SV mutex if
4586 it's a COW sv (not a shared hash key) to stop
4587 it going un copy-on-write.
4588 If the source SV has gone un copy on write between up there
4589 and down here, then (assert() that) it is of the correct
4590 form to make it copy on write again */
4591 if ((sflags & (SVf_FAKE | SVf_READONLY))
4592 != (SVf_FAKE | SVf_READONLY)) {
4593 SvREADONLY_on(sstr);
4595 /* Make the source SV into a loop of 1.
4596 (about to become 2) */
4597 SV_COW_NEXT_SV_SET(sstr, sstr);
4601 /* Initial code is common. */
4602 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4604 SvFLAGS(dstr) &= ~SVf_OOK;
4605 Safefree(SvPVX(dstr) - SvIVX(dstr));
4607 else if (SvLEN(dstr))
4608 Safefree(SvPVX(dstr));
4611 #ifdef PERL_COPY_ON_WRITE
4613 /* making another shared SV. */
4614 STRLEN cur = SvCUR(sstr);
4615 STRLEN len = SvLEN(sstr);
4616 assert (SvTYPE(dstr) >= SVt_PVIV);
4618 /* SvIsCOW_normal */
4619 /* splice us in between source and next-after-source. */
4620 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4621 SV_COW_NEXT_SV_SET(sstr, dstr);
4622 SvPV_set(dstr, SvPVX(sstr));
4624 /* SvIsCOW_shared_hash */
4625 UV hash = SvUVX(sstr);
4626 DEBUG_C(PerlIO_printf(Perl_debug_log,
4627 "Copy on write: Sharing hash\n"));
4629 sharepvn(SvPVX(sstr),
4630 (sflags & SVf_UTF8?-cur:cur), hash));
4631 SvUV_set(dstr, hash);
4633 SvLEN_set(dstr, len);
4634 SvCUR_set(dstr, cur);
4635 SvREADONLY_on(dstr);
4637 /* Relesase a global SV mutex. */
4641 { /* Passes the swipe test. */
4642 SvPV_set(dstr, SvPVX(sstr));
4643 SvLEN_set(dstr, SvLEN(sstr));
4644 SvCUR_set(dstr, SvCUR(sstr));
4647 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4648 SvPV_set(sstr, Nullch);
4654 if (sflags & SVf_UTF8)
4657 if (sflags & SVp_NOK) {
4659 if (sflags & SVf_NOK)
4660 SvFLAGS(dstr) |= SVf_NOK;
4661 SvNV_set(dstr, SvNVX(sstr));
4663 if (sflags & SVp_IOK) {
4664 (void)SvIOKp_on(dstr);
4665 if (sflags & SVf_IOK)
4666 SvFLAGS(dstr) |= SVf_IOK;
4667 if (sflags & SVf_IVisUV)
4669 SvIV_set(dstr, SvIVX(sstr));
4672 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4673 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4674 smg->mg_ptr, smg->mg_len);
4675 SvRMAGICAL_on(dstr);
4678 else if (sflags & SVp_IOK) {
4679 if (sflags & SVf_IOK)
4680 (void)SvIOK_only(dstr);
4682 (void)SvOK_off(dstr);
4683 (void)SvIOKp_on(dstr);
4685 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4686 if (sflags & SVf_IVisUV)
4688 SvIV_set(dstr, SvIVX(sstr));
4689 if (sflags & SVp_NOK) {
4690 if (sflags & SVf_NOK)
4691 (void)SvNOK_on(dstr);
4693 (void)SvNOKp_on(dstr);
4694 SvNV_set(dstr, SvNVX(sstr));
4697 else if (sflags & SVp_NOK) {
4698 if (sflags & SVf_NOK)
4699 (void)SvNOK_only(dstr);
4701 (void)SvOK_off(dstr);
4704 SvNV_set(dstr, SvNVX(sstr));
4707 if (dtype == SVt_PVGV) {
4708 if (ckWARN(WARN_MISC))
4709 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4712 (void)SvOK_off(dstr);
4714 if (SvTAINTED(sstr))
4719 =for apidoc sv_setsv_mg
4721 Like C<sv_setsv>, but also handles 'set' magic.
4727 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4729 sv_setsv(dstr,sstr);
4733 #ifdef PERL_COPY_ON_WRITE
4735 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4737 STRLEN cur = SvCUR(sstr);
4738 STRLEN len = SvLEN(sstr);
4739 register char *new_pv;
4742 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4750 if (SvTHINKFIRST(dstr))
4751 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4752 else if (SvPVX(dstr))
4753 Safefree(SvPVX(dstr));
4757 (void)SvUPGRADE (dstr, SVt_PVIV);
4759 assert (SvPOK(sstr));
4760 assert (SvPOKp(sstr));
4761 assert (!SvIOK(sstr));
4762 assert (!SvIOKp(sstr));
4763 assert (!SvNOK(sstr));
4764 assert (!SvNOKp(sstr));
4766 if (SvIsCOW(sstr)) {
4768 if (SvLEN(sstr) == 0) {
4769 /* source is a COW shared hash key. */
4770 UV hash = SvUVX(sstr);
4771 DEBUG_C(PerlIO_printf(Perl_debug_log,
4772 "Fast copy on write: Sharing hash\n"));
4773 SvUV_set(dstr, hash);
4774 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4777 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4779 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4780 (void)SvUPGRADE (sstr, SVt_PVIV);
4781 SvREADONLY_on(sstr);
4783 DEBUG_C(PerlIO_printf(Perl_debug_log,
4784 "Fast copy on write: Converting sstr to COW\n"));
4785 SV_COW_NEXT_SV_SET(dstr, sstr);
4787 SV_COW_NEXT_SV_SET(sstr, dstr);
4788 new_pv = SvPVX(sstr);
4791 SvPV_set(dstr, new_pv);
4792 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4795 SvLEN_set(dstr, len);
4796 SvCUR_set(dstr, cur);
4805 =for apidoc sv_setpvn
4807 Copies a string into an SV. The C<len> parameter indicates the number of
4808 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4809 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4815 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4817 register char *dptr;
4819 SV_CHECK_THINKFIRST_COW_DROP(sv);
4825 /* len is STRLEN which is unsigned, need to copy to signed */
4828 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4830 (void)SvUPGRADE(sv, SVt_PV);
4832 SvGROW(sv, len + 1);
4834 Move(ptr,dptr,len,char);
4837 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4842 =for apidoc sv_setpvn_mg
4844 Like C<sv_setpvn>, but also handles 'set' magic.
4850 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4852 sv_setpvn(sv,ptr,len);
4857 =for apidoc sv_setpv
4859 Copies a string into an SV. The string must be null-terminated. Does not
4860 handle 'set' magic. See C<sv_setpv_mg>.
4866 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4868 register STRLEN len;
4870 SV_CHECK_THINKFIRST_COW_DROP(sv);
4876 (void)SvUPGRADE(sv, SVt_PV);
4878 SvGROW(sv, len + 1);
4879 Move(ptr,SvPVX(sv),len+1,char);
4881 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4886 =for apidoc sv_setpv_mg
4888 Like C<sv_setpv>, but also handles 'set' magic.
4894 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4901 =for apidoc sv_usepvn
4903 Tells an SV to use C<ptr> to find its string value. Normally the string is
4904 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4905 The C<ptr> should point to memory that was allocated by C<malloc>. The
4906 string length, C<len>, must be supplied. This function will realloc the
4907 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4908 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4909 See C<sv_usepvn_mg>.
4915 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4917 SV_CHECK_THINKFIRST_COW_DROP(sv);
4918 (void)SvUPGRADE(sv, SVt_PV);
4925 Renew(ptr, len+1, char);
4928 SvLEN_set(sv, len+1);
4930 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4935 =for apidoc sv_usepvn_mg
4937 Like C<sv_usepvn>, but also handles 'set' magic.
4943 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4945 sv_usepvn(sv,ptr,len);
4949 #ifdef PERL_COPY_ON_WRITE
4950 /* Need to do this *after* making the SV normal, as we need the buffer
4951 pointer to remain valid until after we've copied it. If we let go too early,
4952 another thread could invalidate it by unsharing last of the same hash key
4953 (which it can do by means other than releasing copy-on-write Svs)
4954 or by changing the other copy-on-write SVs in the loop. */
4956 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4957 U32 hash, SV *after)
4959 if (len) { /* this SV was SvIsCOW_normal(sv) */
4960 /* we need to find the SV pointing to us. */
4961 SV *current = SV_COW_NEXT_SV(after);
4963 if (current == sv) {
4964 /* The SV we point to points back to us (there were only two of us
4966 Hence other SV is no longer copy on write either. */
4968 SvREADONLY_off(after);
4970 /* We need to follow the pointers around the loop. */
4972 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4975 /* don't loop forever if the structure is bust, and we have
4976 a pointer into a closed loop. */
4977 assert (current != after);
4978 assert (SvPVX(current) == pvx);
4980 /* Make the SV before us point to the SV after us. */
4981 SV_COW_NEXT_SV_SET(current, after);
4984 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4989 Perl_sv_release_IVX(pTHX_ register SV *sv)
4992 sv_force_normal_flags(sv, 0);
4998 =for apidoc sv_force_normal_flags
5000 Undo various types of fakery on an SV: if the PV is a shared string, make
5001 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
5002 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
5003 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
5004 then a copy-on-write scalar drops its PV buffer (if any) and becomes
5005 SvPOK_off rather than making a copy. (Used where this scalar is about to be
5006 set to some other value.) In addition, the C<flags> parameter gets passed to
5007 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
5008 with flags set to 0.
5014 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
5016 #ifdef PERL_COPY_ON_WRITE
5017 if (SvREADONLY(sv)) {
5018 /* At this point I believe I should acquire a global SV mutex. */
5020 char *pvx = SvPVX(sv);
5021 STRLEN len = SvLEN(sv);
5022 STRLEN cur = SvCUR(sv);
5023 U32 hash = SvUVX(sv);
5024 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
5026 PerlIO_printf(Perl_debug_log,
5027 "Copy on write: Force normal %ld\n",
5033 /* This SV doesn't own the buffer, so need to New() a new one: */
5034 SvPV_set(sv, (char*)0);
5036 if (flags & SV_COW_DROP_PV) {
5037 /* OK, so we don't need to copy our buffer. */
5040 SvGROW(sv, cur + 1);
5041 Move(pvx,SvPVX(sv),cur,char);
5045 sv_release_COW(sv, pvx, cur, len, hash, next);
5050 else if (IN_PERL_RUNTIME)
5051 Perl_croak(aTHX_ PL_no_modify);
5052 /* At this point I believe that I can drop the global SV mutex. */
5055 if (SvREADONLY(sv)) {
5057 char *pvx = SvPVX(sv);
5058 int is_utf8 = SvUTF8(sv);
5059 STRLEN len = SvCUR(sv);
5060 U32 hash = SvUVX(sv);
5063 SvPV_set(sv, (char*)0);
5065 SvGROW(sv, len + 1);
5066 Move(pvx,SvPVX(sv),len,char);
5068 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
5070 else if (IN_PERL_RUNTIME)
5071 Perl_croak(aTHX_ PL_no_modify);
5075 sv_unref_flags(sv, flags);
5076 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
5081 =for apidoc sv_force_normal
5083 Undo various types of fakery on an SV: if the PV is a shared string, make
5084 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
5085 an xpvmg. See also C<sv_force_normal_flags>.
5091 Perl_sv_force_normal(pTHX_ register SV *sv)
5093 sv_force_normal_flags(sv, 0);
5099 Efficient removal of characters from the beginning of the string buffer.
5100 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
5101 the string buffer. The C<ptr> becomes the first character of the adjusted
5102 string. Uses the "OOK hack".
5103 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
5104 refer to the same chunk of data.
5110 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
5112 register STRLEN delta;
5113 if (!ptr || !SvPOKp(sv))
5115 delta = ptr - SvPVX(sv);
5116 SV_CHECK_THINKFIRST(sv);
5117 if (SvTYPE(sv) < SVt_PVIV)
5118 sv_upgrade(sv,SVt_PVIV);
5121 if (!SvLEN(sv)) { /* make copy of shared string */
5122 const char *pvx = SvPVX(sv);
5123 STRLEN len = SvCUR(sv);
5124 SvGROW(sv, len + 1);
5125 Move(pvx,SvPVX(sv),len,char);
5129 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
5130 and we do that anyway inside the SvNIOK_off
5132 SvFLAGS(sv) |= SVf_OOK;
5135 SvLEN_set(sv, SvLEN(sv) - delta);
5136 SvCUR_set(sv, SvCUR(sv) - delta);
5137 SvPV_set(sv, SvPVX(sv) + delta);
5138 SvIV_set(sv, SvIVX(sv) + delta);
5141 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
5142 * this function provided for binary compatibility only
5146 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
5148 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
5152 =for apidoc sv_catpvn
5154 Concatenates the string onto the end of the string which is in the SV. The
5155 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5156 status set, then the bytes appended should be valid UTF-8.
5157 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
5159 =for apidoc sv_catpvn_flags
5161 Concatenates the string onto the end of the string which is in the SV. The
5162 C<len> indicates number of bytes to copy. If the SV has the UTF-8
5163 status set, then the bytes appended should be valid UTF-8.
5164 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
5165 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
5166 in terms of this function.
5172 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
5175 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
5177 SvGROW(dsv, dlen + slen + 1);
5180 Move(sstr, SvPVX(dsv) + dlen, slen, char);
5181 SvCUR_set(dsv, SvCUR(dsv) + slen);
5183 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
5188 =for apidoc sv_catpvn_mg
5190 Like C<sv_catpvn>, but also handles 'set' magic.
5196 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
5198 sv_catpvn(sv,ptr,len);
5202 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
5203 * this function provided for binary compatibility only
5207 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
5209 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
5213 =for apidoc sv_catsv
5215 Concatenates the string from SV C<ssv> onto the end of the string in
5216 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
5217 not 'set' magic. See C<sv_catsv_mg>.
5219 =for apidoc sv_catsv_flags
5221 Concatenates the string from SV C<ssv> onto the end of the string in
5222 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
5223 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
5224 and C<sv_catsv_nomg> are implemented in terms of this function.
5229 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
5235 if ((spv = SvPV(ssv, slen))) {
5236 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
5237 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
5238 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
5239 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
5240 dsv->sv_flags doesn't have that bit set.
5241 Andy Dougherty 12 Oct 2001
5243 I32 sutf8 = DO_UTF8(ssv);
5246 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
5248 dutf8 = DO_UTF8(dsv);
5250 if (dutf8 != sutf8) {
5252 /* Not modifying source SV, so taking a temporary copy. */
5253 SV* csv = sv_2mortal(newSVpvn(spv, slen));
5255 sv_utf8_upgrade(csv);
5256 spv = SvPV(csv, slen);
5259 sv_utf8_upgrade_nomg(dsv);
5261 sv_catpvn_nomg(dsv, spv, slen);
5266 =for apidoc sv_catsv_mg
5268 Like C<sv_catsv>, but also handles 'set' magic.
5274 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
5281 =for apidoc sv_catpv
5283 Concatenates the string onto the end of the string which is in the SV.
5284 If the SV has the UTF-8 status set, then the bytes appended should be
5285 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
5290 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
5292 register STRLEN len;
5298 junk = SvPV_force(sv, tlen);
5300 SvGROW(sv, tlen + len + 1);
5303 Move(ptr,SvPVX(sv)+tlen,len+1,char);
5304 SvCUR_set(sv, SvCUR(sv) + len);
5305 (void)SvPOK_only_UTF8(sv); /* validate pointer */
5310 =for apidoc sv_catpv_mg
5312 Like C<sv_catpv>, but also handles 'set' magic.
5318 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
5327 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
5328 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
5335 Perl_newSV(pTHX_ STRLEN len)
5341 sv_upgrade(sv, SVt_PV);
5342 SvGROW(sv, len + 1);
5347 =for apidoc sv_magicext
5349 Adds magic to an SV, upgrading it if necessary. Applies the
5350 supplied vtable and returns a pointer to the magic added.
5352 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
5353 In particular, you can add magic to SvREADONLY SVs, and add more than
5354 one instance of the same 'how'.
5356 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
5357 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
5358 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
5359 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
5361 (This is now used as a subroutine by C<sv_magic>.)
5366 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
5367 const char* name, I32 namlen)
5371 if (SvTYPE(sv) < SVt_PVMG) {
5372 (void)SvUPGRADE(sv, SVt_PVMG);
5374 Newz(702,mg, 1, MAGIC);
5375 mg->mg_moremagic = SvMAGIC(sv);
5376 SvMAGIC_set(sv, mg);
5378 /* Sometimes a magic contains a reference loop, where the sv and
5379 object refer to each other. To prevent a reference loop that
5380 would prevent such objects being freed, we look for such loops
5381 and if we find one we avoid incrementing the object refcount.
5383 Note we cannot do this to avoid self-tie loops as intervening RV must
5384 have its REFCNT incremented to keep it in existence.
5387 if (!obj || obj == sv ||
5388 how == PERL_MAGIC_arylen ||
5389 how == PERL_MAGIC_qr ||
5390 (SvTYPE(obj) == SVt_PVGV &&
5391 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
5392 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
5393 GvFORM(obj) == (CV*)sv)))
5398 mg->mg_obj = SvREFCNT_inc(obj);
5399 mg->mg_flags |= MGf_REFCOUNTED;
5402 /* Normal self-ties simply pass a null object, and instead of
5403 using mg_obj directly, use the SvTIED_obj macro to produce a
5404 new RV as needed. For glob "self-ties", we are tieing the PVIO
5405 with an RV obj pointing to the glob containing the PVIO. In
5406 this case, to avoid a reference loop, we need to weaken the
5410 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
5411 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
5417 mg->mg_len = namlen;
5420 mg->mg_ptr = savepvn(name, namlen);
5421 else if (namlen == HEf_SVKEY)
5422 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
5424 mg->mg_ptr = (char *) name;
5426 mg->mg_virtual = vtable;
5430 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
5435 =for apidoc sv_magic
5437 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
5438 then adds a new magic item of type C<how> to the head of the magic list.
5440 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
5441 handling of the C<name> and C<namlen> arguments.
5443 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
5444 to add more than one instance of the same 'how'.
5450 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5452 const MGVTBL *vtable = 0;
5455 #ifdef PERL_COPY_ON_WRITE
5457 sv_force_normal_flags(sv, 0);
5459 if (SvREADONLY(sv)) {
5461 && how != PERL_MAGIC_regex_global
5462 && how != PERL_MAGIC_bm
5463 && how != PERL_MAGIC_fm
5464 && how != PERL_MAGIC_sv
5465 && how != PERL_MAGIC_backref
5468 Perl_croak(aTHX_ PL_no_modify);
5471 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5472 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5473 /* sv_magic() refuses to add a magic of the same 'how' as an
5476 if (how == PERL_MAGIC_taint)
5484 vtable = &PL_vtbl_sv;
5486 case PERL_MAGIC_overload:
5487 vtable = &PL_vtbl_amagic;
5489 case PERL_MAGIC_overload_elem:
5490 vtable = &PL_vtbl_amagicelem;
5492 case PERL_MAGIC_overload_table:
5493 vtable = &PL_vtbl_ovrld;
5496 vtable = &PL_vtbl_bm;
5498 case PERL_MAGIC_regdata:
5499 vtable = &PL_vtbl_regdata;
5501 case PERL_MAGIC_regdatum:
5502 vtable = &PL_vtbl_regdatum;
5504 case PERL_MAGIC_env:
5505 vtable = &PL_vtbl_env;
5508 vtable = &PL_vtbl_fm;
5510 case PERL_MAGIC_envelem:
5511 vtable = &PL_vtbl_envelem;
5513 case PERL_MAGIC_regex_global:
5514 vtable = &PL_vtbl_mglob;
5516 case PERL_MAGIC_isa:
5517 vtable = &PL_vtbl_isa;
5519 case PERL_MAGIC_isaelem:
5520 vtable = &PL_vtbl_isaelem;
5522 case PERL_MAGIC_nkeys:
5523 vtable = &PL_vtbl_nkeys;
5525 case PERL_MAGIC_dbfile:
5528 case PERL_MAGIC_dbline:
5529 vtable = &PL_vtbl_dbline;
5531 #ifdef USE_LOCALE_COLLATE
5532 case PERL_MAGIC_collxfrm:
5533 vtable = &PL_vtbl_collxfrm;
5535 #endif /* USE_LOCALE_COLLATE */
5536 case PERL_MAGIC_tied:
5537 vtable = &PL_vtbl_pack;
5539 case PERL_MAGIC_tiedelem:
5540 case PERL_MAGIC_tiedscalar:
5541 vtable = &PL_vtbl_packelem;
5544 vtable = &PL_vtbl_regexp;
5546 case PERL_MAGIC_sig:
5547 vtable = &PL_vtbl_sig;
5549 case PERL_MAGIC_sigelem:
5550 vtable = &PL_vtbl_sigelem;
5552 case PERL_MAGIC_taint:
5553 vtable = &PL_vtbl_taint;
5555 case PERL_MAGIC_uvar:
5556 vtable = &PL_vtbl_uvar;
5558 case PERL_MAGIC_vec:
5559 vtable = &PL_vtbl_vec;
5561 case PERL_MAGIC_vstring:
5564 case PERL_MAGIC_utf8:
5565 vtable = &PL_vtbl_utf8;
5567 case PERL_MAGIC_substr:
5568 vtable = &PL_vtbl_substr;
5570 case PERL_MAGIC_defelem:
5571 vtable = &PL_vtbl_defelem;
5573 case PERL_MAGIC_glob:
5574 vtable = &PL_vtbl_glob;
5576 case PERL_MAGIC_arylen:
5577 vtable = &PL_vtbl_arylen;
5579 case PERL_MAGIC_pos:
5580 vtable = &PL_vtbl_pos;
5582 case PERL_MAGIC_backref:
5583 vtable = &PL_vtbl_backref;
5585 case PERL_MAGIC_ext:
5586 /* Reserved for use by extensions not perl internals. */
5587 /* Useful for attaching extension internal data to perl vars. */
5588 /* Note that multiple extensions may clash if magical scalars */
5589 /* etc holding private data from one are passed to another. */
5592 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5595 /* Rest of work is done else where */
5596 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5599 case PERL_MAGIC_taint:
5602 case PERL_MAGIC_ext:
5603 case PERL_MAGIC_dbfile:
5610 =for apidoc sv_unmagic
5612 Removes all magic of type C<type> from an SV.
5618 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5622 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5625 for (mg = *mgp; mg; mg = *mgp) {
5626 if (mg->mg_type == type) {
5627 const MGVTBL* const vtbl = mg->mg_virtual;
5628 *mgp = mg->mg_moremagic;
5629 if (vtbl && vtbl->svt_free)
5630 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5631 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5633 Safefree(mg->mg_ptr);
5634 else if (mg->mg_len == HEf_SVKEY)
5635 SvREFCNT_dec((SV*)mg->mg_ptr);
5636 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5637 Safefree(mg->mg_ptr);
5639 if (mg->mg_flags & MGf_REFCOUNTED)
5640 SvREFCNT_dec(mg->mg_obj);
5644 mgp = &mg->mg_moremagic;
5648 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5655 =for apidoc sv_rvweaken
5657 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5658 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5659 push a back-reference to this RV onto the array of backreferences
5660 associated with that magic.
5666 Perl_sv_rvweaken(pTHX_ SV *sv)
5669 if (!SvOK(sv)) /* let undefs pass */
5672 Perl_croak(aTHX_ "Can't weaken a nonreference");
5673 else if (SvWEAKREF(sv)) {
5674 if (ckWARN(WARN_MISC))
5675 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5679 sv_add_backref(tsv, sv);
5685 /* Give tsv backref magic if it hasn't already got it, then push a
5686 * back-reference to sv onto the array associated with the backref magic.
5690 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5694 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5695 av = (AV*)mg->mg_obj;
5698 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5699 /* av now has a refcnt of 2, which avoids it getting freed
5700 * before us during global cleanup. The extra ref is removed
5701 * by magic_killbackrefs() when tsv is being freed */
5703 if (AvFILLp(av) >= AvMAX(av)) {
5705 SV **svp = AvARRAY(av);
5706 for (i = AvFILLp(av); i >= 0; i--)
5708 svp[i] = sv; /* reuse the slot */
5711 av_extend(av, AvFILLp(av)+1);
5713 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5716 /* delete a back-reference to ourselves from the backref magic associated
5717 * with the SV we point to.
5721 S_sv_del_backref(pTHX_ SV *sv)
5728 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5729 Perl_croak(aTHX_ "panic: del_backref");
5730 av = (AV *)mg->mg_obj;
5732 for (i = AvFILLp(av); i >= 0; i--)
5733 if (svp[i] == sv) svp[i] = Nullsv;
5737 =for apidoc sv_insert
5739 Inserts a string at the specified offset/length within the SV. Similar to
5740 the Perl substr() function.
5746 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5750 register char *midend;
5751 register char *bigend;
5757 Perl_croak(aTHX_ "Can't modify non-existent substring");
5758 SvPV_force(bigstr, curlen);
5759 (void)SvPOK_only_UTF8(bigstr);
5760 if (offset + len > curlen) {
5761 SvGROW(bigstr, offset+len+1);
5762 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5763 SvCUR_set(bigstr, offset+len);
5767 i = littlelen - len;
5768 if (i > 0) { /* string might grow */
5769 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5770 mid = big + offset + len;
5771 midend = bigend = big + SvCUR(bigstr);
5774 while (midend > mid) /* shove everything down */
5775 *--bigend = *--midend;
5776 Move(little,big+offset,littlelen,char);
5777 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5782 Move(little,SvPVX(bigstr)+offset,len,char);
5787 big = SvPVX(bigstr);
5790 bigend = big + SvCUR(bigstr);
5792 if (midend > bigend)
5793 Perl_croak(aTHX_ "panic: sv_insert");
5795 if (mid - big > bigend - midend) { /* faster to shorten from end */
5797 Move(little, mid, littlelen,char);
5800 i = bigend - midend;
5802 Move(midend, mid, i,char);
5806 SvCUR_set(bigstr, mid - big);
5809 else if ((i = mid - big)) { /* faster from front */
5810 midend -= littlelen;
5812 sv_chop(bigstr,midend-i);
5817 Move(little, mid, littlelen,char);
5819 else if (littlelen) {
5820 midend -= littlelen;
5821 sv_chop(bigstr,midend);
5822 Move(little,midend,littlelen,char);
5825 sv_chop(bigstr,midend);
5831 =for apidoc sv_replace
5833 Make the first argument a copy of the second, then delete the original.
5834 The target SV physically takes over ownership of the body of the source SV
5835 and inherits its flags; however, the target keeps any magic it owns,
5836 and any magic in the source is discarded.
5837 Note that this is a rather specialist SV copying operation; most of the
5838 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5844 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5846 U32 refcnt = SvREFCNT(sv);
5847 SV_CHECK_THINKFIRST_COW_DROP(sv);
5848 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5849 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5850 if (SvMAGICAL(sv)) {
5854 sv_upgrade(nsv, SVt_PVMG);
5855 SvMAGIC_set(nsv, SvMAGIC(sv));
5856 SvFLAGS(nsv) |= SvMAGICAL(sv);
5858 SvMAGIC_set(sv, NULL);
5862 assert(!SvREFCNT(sv));
5863 #ifdef DEBUG_LEAKING_SCALARS
5864 sv->sv_flags = nsv->sv_flags;
5865 sv->sv_any = nsv->sv_any;
5866 sv->sv_refcnt = nsv->sv_refcnt;
5868 StructCopy(nsv,sv,SV);
5871 #ifdef PERL_COPY_ON_WRITE
5872 if (SvIsCOW_normal(nsv)) {
5873 /* We need to follow the pointers around the loop to make the
5874 previous SV point to sv, rather than nsv. */
5877 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5880 assert(SvPVX(current) == SvPVX(nsv));
5882 /* Make the SV before us point to the SV after us. */
5884 PerlIO_printf(Perl_debug_log, "previous is\n");
5886 PerlIO_printf(Perl_debug_log,
5887 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5888 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5890 SV_COW_NEXT_SV_SET(current, sv);
5893 SvREFCNT(sv) = refcnt;
5894 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5900 =for apidoc sv_clear
5902 Clear an SV: call any destructors, free up any memory used by the body,
5903 and free the body itself. The SV's head is I<not> freed, although
5904 its type is set to all 1's so that it won't inadvertently be assumed
5905 to be live during global destruction etc.
5906 This function should only be called when REFCNT is zero. Most of the time
5907 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5914 Perl_sv_clear(pTHX_ register SV *sv)
5919 assert(SvREFCNT(sv) == 0);
5922 if (PL_defstash) { /* Still have a symbol table? */
5929 stash = SvSTASH(sv);
5930 destructor = StashHANDLER(stash,DESTROY);
5932 SV* tmpref = newRV(sv);
5933 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5935 PUSHSTACKi(PERLSI_DESTROY);
5940 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5946 if(SvREFCNT(tmpref) < 2) {
5947 /* tmpref is not kept alive! */
5949 SvRV_set(tmpref, NULL);
5952 SvREFCNT_dec(tmpref);
5954 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5958 if (PL_in_clean_objs)
5959 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5961 /* DESTROY gave object new lease on life */
5967 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5968 SvOBJECT_off(sv); /* Curse the object. */
5969 if (SvTYPE(sv) != SVt_PVIO)
5970 --PL_sv_objcount; /* XXX Might want something more general */
5973 if (SvTYPE(sv) >= SVt_PVMG) {
5976 if (SvFLAGS(sv) & SVpad_TYPED)
5977 SvREFCNT_dec(SvSTASH(sv));
5980 switch (SvTYPE(sv)) {
5983 IoIFP(sv) != PerlIO_stdin() &&
5984 IoIFP(sv) != PerlIO_stdout() &&
5985 IoIFP(sv) != PerlIO_stderr())
5987 io_close((IO*)sv, FALSE);
5989 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5990 PerlDir_close(IoDIRP(sv));
5991 IoDIRP(sv) = (DIR*)NULL;
5992 Safefree(IoTOP_NAME(sv));
5993 Safefree(IoFMT_NAME(sv));
5994 Safefree(IoBOTTOM_NAME(sv));
6009 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
6010 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
6011 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
6012 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
6014 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
6015 SvREFCNT_dec(LvTARG(sv));
6019 Safefree(GvNAME(sv));
6020 /* cannot decrease stash refcount yet, as we might recursively delete
6021 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
6022 of stash until current sv is completely gone.
6023 -- JohnPC, 27 Mar 1998 */
6024 stash = GvSTASH(sv);
6030 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
6032 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
6033 /* Don't even bother with turning off the OOK flag. */
6042 SvREFCNT_dec(SvRV(sv));
6044 #ifdef PERL_COPY_ON_WRITE
6045 else if (SvPVX(sv)) {
6047 /* I believe I need to grab the global SV mutex here and
6048 then recheck the COW status. */
6050 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
6053 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
6054 SvUVX(sv), SV_COW_NEXT_SV(sv));
6055 /* And drop it here. */
6057 } else if (SvLEN(sv)) {
6058 Safefree(SvPVX(sv));
6062 else if (SvPVX(sv) && SvLEN(sv))
6063 Safefree(SvPVX(sv));
6064 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
6065 unsharepvn(SvPVX(sv),
6066 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
6080 switch (SvTYPE(sv)) {
6096 del_XPVIV(SvANY(sv));
6099 del_XPVNV(SvANY(sv));
6102 del_XPVMG(SvANY(sv));
6105 del_XPVLV(SvANY(sv));
6108 del_XPVAV(SvANY(sv));
6111 del_XPVHV(SvANY(sv));
6114 del_XPVCV(SvANY(sv));
6117 del_XPVGV(SvANY(sv));
6118 /* code duplication for increased performance. */
6119 SvFLAGS(sv) &= SVf_BREAK;
6120 SvFLAGS(sv) |= SVTYPEMASK;
6121 /* decrease refcount of the stash that owns this GV, if any */
6123 SvREFCNT_dec(stash);
6124 return; /* not break, SvFLAGS reset already happened */
6126 del_XPVBM(SvANY(sv));
6129 del_XPVFM(SvANY(sv));
6132 del_XPVIO(SvANY(sv));
6135 SvFLAGS(sv) &= SVf_BREAK;
6136 SvFLAGS(sv) |= SVTYPEMASK;
6140 =for apidoc sv_newref
6142 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
6149 Perl_sv_newref(pTHX_ SV *sv)
6159 Decrement an SV's reference count, and if it drops to zero, call
6160 C<sv_clear> to invoke destructors and free up any memory used by
6161 the body; finally, deallocate the SV's head itself.
6162 Normally called via a wrapper macro C<SvREFCNT_dec>.
6168 Perl_sv_free(pTHX_ SV *sv)
6173 if (SvREFCNT(sv) == 0) {
6174 if (SvFLAGS(sv) & SVf_BREAK)
6175 /* this SV's refcnt has been artificially decremented to
6176 * trigger cleanup */
6178 if (PL_in_clean_all) /* All is fair */
6180 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6181 /* make sure SvREFCNT(sv)==0 happens very seldom */
6182 SvREFCNT(sv) = (~(U32)0)/2;
6185 if (ckWARN_d(WARN_INTERNAL))
6186 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
6187 "Attempt to free unreferenced scalar: SV 0x%"UVxf
6188 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6191 if (--(SvREFCNT(sv)) > 0)
6193 Perl_sv_free2(aTHX_ sv);
6197 Perl_sv_free2(pTHX_ SV *sv)
6202 if (ckWARN_d(WARN_DEBUGGING))
6203 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
6204 "Attempt to free temp prematurely: SV 0x%"UVxf
6205 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
6209 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
6210 /* make sure SvREFCNT(sv)==0 happens very seldom */
6211 SvREFCNT(sv) = (~(U32)0)/2;
6222 Returns the length of the string in the SV. Handles magic and type
6223 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
6229 Perl_sv_len(pTHX_ register SV *sv)
6237 len = mg_length(sv);
6239 (void)SvPV(sv, len);
6244 =for apidoc sv_len_utf8
6246 Returns the number of characters in the string in an SV, counting wide
6247 UTF-8 bytes as a single character. Handles magic and type coercion.
6253 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
6254 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
6255 * (Note that the mg_len is not the length of the mg_ptr field.)
6260 Perl_sv_len_utf8(pTHX_ register SV *sv)
6266 return mg_length(sv);
6270 U8 *s = (U8*)SvPV(sv, len);
6271 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
6273 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
6275 #ifdef PERL_UTF8_CACHE_ASSERT
6276 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
6280 ulen = Perl_utf8_length(aTHX_ s, s + len);
6281 if (!mg && !SvREADONLY(sv)) {
6282 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6283 mg = mg_find(sv, PERL_MAGIC_utf8);
6293 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
6294 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6295 * between UTF-8 and byte offsets. There are two (substr offset and substr
6296 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
6297 * and byte offset) cache positions.
6299 * The mg_len field is used by sv_len_utf8(), see its comments.
6300 * Note that the mg_len is not the length of the mg_ptr field.
6304 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
6308 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6310 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
6314 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6316 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6317 (*mgp)->mg_ptr = (char *) *cachep;
6321 (*cachep)[i] = *offsetp;
6322 (*cachep)[i+1] = s - start;
6330 * S_utf8_mg_pos() is used to query and update mg_ptr field of
6331 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
6332 * between UTF-8 and byte offsets. See also the comments of
6333 * S_utf8_mg_pos_init().
6337 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
6341 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6343 *mgp = mg_find(sv, PERL_MAGIC_utf8);
6344 if (*mgp && (*mgp)->mg_ptr) {
6345 *cachep = (STRLEN *) (*mgp)->mg_ptr;
6346 ASSERT_UTF8_CACHE(*cachep);
6347 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
6349 else { /* We will skip to the right spot. */
6354 /* The assumption is that going backward is half
6355 * the speed of going forward (that's where the
6356 * 2 * backw in the below comes from). (The real
6357 * figure of course depends on the UTF-8 data.) */
6359 if ((*cachep)[i] > (STRLEN)uoff) {
6361 backw = (*cachep)[i] - (STRLEN)uoff;
6363 if (forw < 2 * backw)
6366 p = start + (*cachep)[i+1];
6368 /* Try this only for the substr offset (i == 0),
6369 * not for the substr length (i == 2). */
6370 else if (i == 0) { /* (*cachep)[i] < uoff */
6371 STRLEN ulen = sv_len_utf8(sv);
6373 if ((STRLEN)uoff < ulen) {
6374 forw = (STRLEN)uoff - (*cachep)[i];
6375 backw = ulen - (STRLEN)uoff;
6377 if (forw < 2 * backw)
6378 p = start + (*cachep)[i+1];
6383 /* If the string is not long enough for uoff,
6384 * we could extend it, but not at this low a level. */
6388 if (forw < 2 * backw) {
6395 while (UTF8_IS_CONTINUATION(*p))
6400 /* Update the cache. */
6401 (*cachep)[i] = (STRLEN)uoff;
6402 (*cachep)[i+1] = p - start;
6404 /* Drop the stale "length" cache */
6413 if (found) { /* Setup the return values. */
6414 *offsetp = (*cachep)[i+1];
6415 *sp = start + *offsetp;
6418 *offsetp = send - start;
6420 else if (*sp < start) {
6426 #ifdef PERL_UTF8_CACHE_ASSERT
6431 while (n-- && s < send)
6435 assert(*offsetp == s - start);
6436 assert((*cachep)[0] == (STRLEN)uoff);
6437 assert((*cachep)[1] == *offsetp);
6439 ASSERT_UTF8_CACHE(*cachep);
6448 =for apidoc sv_pos_u2b
6450 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6451 the start of the string, to a count of the equivalent number of bytes; if
6452 lenp is non-zero, it does the same to lenp, but this time starting from
6453 the offset, rather than from the start of the string. Handles magic and
6460 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6461 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6462 * byte offsets. See also the comments of S_utf8_mg_pos().
6467 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6478 start = s = (U8*)SvPV(sv, len);
6480 I32 uoffset = *offsetp;
6485 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6487 if (!found && uoffset > 0) {
6488 while (s < send && uoffset--)
6492 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
6494 *offsetp = s - start;
6499 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6503 if (!found && *lenp > 0) {
6506 while (s < send && ulen--)
6510 utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start);
6514 ASSERT_UTF8_CACHE(cache);
6526 =for apidoc sv_pos_b2u
6528 Converts the value pointed to by offsetp from a count of bytes from the
6529 start of the string, to a count of the equivalent number of UTF-8 chars.
6530 Handles magic and type coercion.
6536 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6537 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6538 * byte offsets. See also the comments of S_utf8_mg_pos().
6543 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6551 s = (U8*)SvPV(sv, len);
6552 if ((I32)len < *offsetp)
6553 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6555 U8* send = s + *offsetp;
6557 STRLEN *cache = NULL;
6561 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6562 mg = mg_find(sv, PERL_MAGIC_utf8);
6563 if (mg && mg->mg_ptr) {
6564 cache = (STRLEN *) mg->mg_ptr;
6565 if (cache[1] == (STRLEN)*offsetp) {
6566 /* An exact match. */
6567 *offsetp = cache[0];
6571 else if (cache[1] < (STRLEN)*offsetp) {
6572 /* We already know part of the way. */
6575 /* Let the below loop do the rest. */
6577 else { /* cache[1] > *offsetp */
6578 /* We already know all of the way, now we may
6579 * be able to walk back. The same assumption
6580 * is made as in S_utf8_mg_pos(), namely that
6581 * walking backward is twice slower than
6582 * walking forward. */
6583 STRLEN forw = *offsetp;
6584 STRLEN backw = cache[1] - *offsetp;
6586 if (!(forw < 2 * backw)) {
6587 U8 *p = s + cache[1];
6594 while (UTF8_IS_CONTINUATION(*p)) {
6602 *offsetp = cache[0];
6604 /* Drop the stale "length" cache */
6612 ASSERT_UTF8_CACHE(cache);
6618 /* Call utf8n_to_uvchr() to validate the sequence
6619 * (unless a simple non-UTF character) */
6620 if (!UTF8_IS_INVARIANT(*s))
6621 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6630 if (!SvREADONLY(sv)) {
6632 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6633 mg = mg_find(sv, PERL_MAGIC_utf8);
6638 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6639 mg->mg_ptr = (char *) cache;
6644 cache[1] = *offsetp;
6645 /* Drop the stale "length" cache */
6658 Returns a boolean indicating whether the strings in the two SVs are
6659 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6660 coerce its args to strings if necessary.
6666 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6674 SV* svrecode = Nullsv;
6681 pv1 = SvPV(sv1, cur1);
6688 pv2 = SvPV(sv2, cur2);
6690 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6691 /* Differing utf8ness.
6692 * Do not UTF8size the comparands as a side-effect. */
6695 svrecode = newSVpvn(pv2, cur2);
6696 sv_recode_to_utf8(svrecode, PL_encoding);
6697 pv2 = SvPV(svrecode, cur2);
6700 svrecode = newSVpvn(pv1, cur1);
6701 sv_recode_to_utf8(svrecode, PL_encoding);
6702 pv1 = SvPV(svrecode, cur1);
6704 /* Now both are in UTF-8. */
6706 SvREFCNT_dec(svrecode);
6711 bool is_utf8 = TRUE;
6714 /* sv1 is the UTF-8 one,
6715 * if is equal it must be downgrade-able */
6716 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6722 /* sv2 is the UTF-8 one,
6723 * if is equal it must be downgrade-able */
6724 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6730 /* Downgrade not possible - cannot be eq */
6738 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6741 SvREFCNT_dec(svrecode);
6752 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6753 string in C<sv1> is less than, equal to, or greater than the string in
6754 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6755 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6761 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6764 const char *pv1, *pv2;
6767 SV *svrecode = Nullsv;
6774 pv1 = SvPV(sv1, cur1);
6781 pv2 = SvPV(sv2, cur2);
6783 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6784 /* Differing utf8ness.
6785 * Do not UTF8size the comparands as a side-effect. */
6788 svrecode = newSVpvn(pv2, cur2);
6789 sv_recode_to_utf8(svrecode, PL_encoding);
6790 pv2 = SvPV(svrecode, cur2);
6793 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6798 svrecode = newSVpvn(pv1, cur1);
6799 sv_recode_to_utf8(svrecode, PL_encoding);
6800 pv1 = SvPV(svrecode, cur1);
6803 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6809 cmp = cur2 ? -1 : 0;
6813 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6816 cmp = retval < 0 ? -1 : 1;
6817 } else if (cur1 == cur2) {
6820 cmp = cur1 < cur2 ? -1 : 1;
6825 SvREFCNT_dec(svrecode);
6834 =for apidoc sv_cmp_locale
6836 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6837 'use bytes' aware, handles get magic, and will coerce its args to strings
6838 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6844 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6846 #ifdef USE_LOCALE_COLLATE
6852 if (PL_collation_standard)
6856 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6858 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6860 if (!pv1 || !len1) {
6871 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6874 return retval < 0 ? -1 : 1;
6877 * When the result of collation is equality, that doesn't mean
6878 * that there are no differences -- some locales exclude some
6879 * characters from consideration. So to avoid false equalities,
6880 * we use the raw string as a tiebreaker.
6886 #endif /* USE_LOCALE_COLLATE */
6888 return sv_cmp(sv1, sv2);
6892 #ifdef USE_LOCALE_COLLATE
6895 =for apidoc sv_collxfrm
6897 Add Collate Transform magic to an SV if it doesn't already have it.
6899 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6900 scalar data of the variable, but transformed to such a format that a normal
6901 memory comparison can be used to compare the data according to the locale
6908 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6912 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6913 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6918 Safefree(mg->mg_ptr);
6920 if ((xf = mem_collxfrm(s, len, &xlen))) {
6921 if (SvREADONLY(sv)) {
6924 return xf + sizeof(PL_collation_ix);
6927 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6928 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6941 if (mg && mg->mg_ptr) {
6943 return mg->mg_ptr + sizeof(PL_collation_ix);
6951 #endif /* USE_LOCALE_COLLATE */
6956 Get a line from the filehandle and store it into the SV, optionally
6957 appending to the currently-stored string.
6963 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6967 register STDCHAR rslast;
6968 register STDCHAR *bp;
6974 if (SvTHINKFIRST(sv))
6975 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6976 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6978 However, perlbench says it's slower, because the existing swipe code
6979 is faster than copy on write.
6980 Swings and roundabouts. */
6981 (void)SvUPGRADE(sv, SVt_PV);
6986 if (PerlIO_isutf8(fp)) {
6988 sv_utf8_upgrade_nomg(sv);
6989 sv_pos_u2b(sv,&append,0);
6991 } else if (SvUTF8(sv)) {
6992 SV *tsv = NEWSV(0,0);
6993 sv_gets(tsv, fp, 0);
6994 sv_utf8_upgrade_nomg(tsv);
6995 SvCUR_set(sv,append);
6998 goto return_string_or_null;
7003 if (PerlIO_isutf8(fp))
7006 if (IN_PERL_COMPILETIME) {
7007 /* we always read code in line mode */
7011 else if (RsSNARF(PL_rs)) {
7012 /* If it is a regular disk file use size from stat() as estimate
7013 of amount we are going to read - may result in malloc-ing
7014 more memory than we realy need if layers bellow reduce
7015 size we read (e.g. CRLF or a gzip layer)
7018 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
7019 const Off_t offset = PerlIO_tell(fp);
7020 if (offset != (Off_t) -1 && st.st_size + append > offset) {
7021 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
7027 else if (RsRECORD(PL_rs)) {
7031 /* Grab the size of the record we're getting */
7032 recsize = SvIV(SvRV(PL_rs));
7033 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
7036 /* VMS wants read instead of fread, because fread doesn't respect */
7037 /* RMS record boundaries. This is not necessarily a good thing to be */
7038 /* doing, but we've got no other real choice - except avoid stdio
7039 as implementation - perhaps write a :vms layer ?
7041 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
7043 bytesread = PerlIO_read(fp, buffer, recsize);
7047 SvCUR_set(sv, bytesread += append);
7048 buffer[bytesread] = '\0';
7049 goto return_string_or_null;
7051 else if (RsPARA(PL_rs)) {
7057 /* Get $/ i.e. PL_rs into same encoding as stream wants */
7058 if (PerlIO_isutf8(fp)) {
7059 rsptr = SvPVutf8(PL_rs, rslen);
7062 if (SvUTF8(PL_rs)) {
7063 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
7064 Perl_croak(aTHX_ "Wide character in $/");
7067 rsptr = SvPV(PL_rs, rslen);
7071 rslast = rslen ? rsptr[rslen - 1] : '\0';
7073 if (rspara) { /* have to do this both before and after */
7074 do { /* to make sure file boundaries work right */
7077 i = PerlIO_getc(fp);
7081 PerlIO_ungetc(fp,i);
7087 /* See if we know enough about I/O mechanism to cheat it ! */
7089 /* This used to be #ifdef test - it is made run-time test for ease
7090 of abstracting out stdio interface. One call should be cheap
7091 enough here - and may even be a macro allowing compile
7095 if (PerlIO_fast_gets(fp)) {
7098 * We're going to steal some values from the stdio struct
7099 * and put EVERYTHING in the innermost loop into registers.
7101 register STDCHAR *ptr;
7105 #if defined(VMS) && defined(PERLIO_IS_STDIO)
7106 /* An ungetc()d char is handled separately from the regular
7107 * buffer, so we getc() it back out and stuff it in the buffer.
7109 i = PerlIO_getc(fp);
7110 if (i == EOF) return 0;
7111 *(--((*fp)->_ptr)) = (unsigned char) i;
7115 /* Here is some breathtakingly efficient cheating */
7117 cnt = PerlIO_get_cnt(fp); /* get count into register */
7118 /* make sure we have the room */
7119 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
7120 /* Not room for all of it
7121 if we are looking for a separator and room for some
7123 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
7124 /* just process what we have room for */
7125 shortbuffered = cnt - SvLEN(sv) + append + 1;
7126 cnt -= shortbuffered;
7130 /* remember that cnt can be negative */
7131 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
7136 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
7137 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
7138 DEBUG_P(PerlIO_printf(Perl_debug_log,
7139 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7140 DEBUG_P(PerlIO_printf(Perl_debug_log,
7141 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7142 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7143 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
7148 while (cnt > 0) { /* this | eat */
7150 if ((*bp++ = *ptr++) == rslast) /* really | dust */
7151 goto thats_all_folks; /* screams | sed :-) */
7155 Copy(ptr, bp, cnt, char); /* this | eat */
7156 bp += cnt; /* screams | dust */
7157 ptr += cnt; /* louder | sed :-) */
7162 if (shortbuffered) { /* oh well, must extend */
7163 cnt = shortbuffered;
7165 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7167 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
7168 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7172 DEBUG_P(PerlIO_printf(Perl_debug_log,
7173 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
7174 PTR2UV(ptr),(long)cnt));
7175 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
7177 DEBUG_P(PerlIO_printf(Perl_debug_log,
7178 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7179 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7180 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7182 /* This used to call 'filbuf' in stdio form, but as that behaves like
7183 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
7184 another abstraction. */
7185 i = PerlIO_getc(fp); /* get more characters */
7187 DEBUG_P(PerlIO_printf(Perl_debug_log,
7188 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7189 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7190 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7192 cnt = PerlIO_get_cnt(fp);
7193 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
7194 DEBUG_P(PerlIO_printf(Perl_debug_log,
7195 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7197 if (i == EOF) /* all done for ever? */
7198 goto thats_really_all_folks;
7200 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
7202 SvGROW(sv, bpx + cnt + 2);
7203 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
7205 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
7207 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
7208 goto thats_all_folks;
7212 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
7213 memNE((char*)bp - rslen, rsptr, rslen))
7214 goto screamer; /* go back to the fray */
7215 thats_really_all_folks:
7217 cnt += shortbuffered;
7218 DEBUG_P(PerlIO_printf(Perl_debug_log,
7219 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
7220 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
7221 DEBUG_P(PerlIO_printf(Perl_debug_log,
7222 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
7223 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
7224 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
7226 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
7227 DEBUG_P(PerlIO_printf(Perl_debug_log,
7228 "Screamer: done, len=%ld, string=|%.*s|\n",
7229 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
7233 /*The big, slow, and stupid way. */
7234 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
7236 New(0, buf, 8192, STDCHAR);
7244 const register STDCHAR *bpe = buf + sizeof(buf);
7246 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
7247 ; /* keep reading */
7251 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
7252 /* Accomodate broken VAXC compiler, which applies U8 cast to
7253 * both args of ?: operator, causing EOF to change into 255
7256 i = (U8)buf[cnt - 1];
7262 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
7264 sv_catpvn(sv, (char *) buf, cnt);
7266 sv_setpvn(sv, (char *) buf, cnt);
7268 if (i != EOF && /* joy */
7270 SvCUR(sv) < rslen ||
7271 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
7275 * If we're reading from a TTY and we get a short read,
7276 * indicating that the user hit his EOF character, we need
7277 * to notice it now, because if we try to read from the TTY
7278 * again, the EOF condition will disappear.
7280 * The comparison of cnt to sizeof(buf) is an optimization
7281 * that prevents unnecessary calls to feof().
7285 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
7289 #ifdef USE_HEAP_INSTEAD_OF_STACK
7294 if (rspara) { /* have to do this both before and after */
7295 while (i != EOF) { /* to make sure file boundaries work right */
7296 i = PerlIO_getc(fp);
7298 PerlIO_ungetc(fp,i);
7304 return_string_or_null:
7305 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
7311 Auto-increment of the value in the SV, doing string to numeric conversion
7312 if necessary. Handles 'get' magic.
7318 Perl_sv_inc(pTHX_ register SV *sv)
7327 if (SvTHINKFIRST(sv)) {
7329 sv_force_normal_flags(sv, 0);
7330 if (SvREADONLY(sv)) {
7331 if (IN_PERL_RUNTIME)
7332 Perl_croak(aTHX_ PL_no_modify);
7336 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
7338 i = PTR2IV(SvRV(sv));
7343 flags = SvFLAGS(sv);
7344 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
7345 /* It's (privately or publicly) a float, but not tested as an
7346 integer, so test it to see. */
7348 flags = SvFLAGS(sv);
7350 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7351 /* It's publicly an integer, or privately an integer-not-float */
7352 #ifdef PERL_PRESERVE_IVUV
7356 if (SvUVX(sv) == UV_MAX)
7357 sv_setnv(sv, UV_MAX_P1);
7359 (void)SvIOK_only_UV(sv);
7360 SvUV_set(sv, SvUVX(sv) + 1);
7362 if (SvIVX(sv) == IV_MAX)
7363 sv_setuv(sv, (UV)IV_MAX + 1);
7365 (void)SvIOK_only(sv);
7366 SvIV_set(sv, SvIVX(sv) + 1);
7371 if (flags & SVp_NOK) {
7372 (void)SvNOK_only(sv);
7373 SvNV_set(sv, SvNVX(sv) + 1.0);
7377 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
7378 if ((flags & SVTYPEMASK) < SVt_PVIV)
7379 sv_upgrade(sv, SVt_IV);
7380 (void)SvIOK_only(sv);
7385 while (isALPHA(*d)) d++;
7386 while (isDIGIT(*d)) d++;
7388 #ifdef PERL_PRESERVE_IVUV
7389 /* Got to punt this as an integer if needs be, but we don't issue
7390 warnings. Probably ought to make the sv_iv_please() that does
7391 the conversion if possible, and silently. */
7392 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7393 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7394 /* Need to try really hard to see if it's an integer.
7395 9.22337203685478e+18 is an integer.
7396 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7397 so $a="9.22337203685478e+18"; $a+0; $a++
7398 needs to be the same as $a="9.22337203685478e+18"; $a++
7405 /* sv_2iv *should* have made this an NV */
7406 if (flags & SVp_NOK) {
7407 (void)SvNOK_only(sv);
7408 SvNV_set(sv, SvNVX(sv) + 1.0);
7411 /* I don't think we can get here. Maybe I should assert this
7412 And if we do get here I suspect that sv_setnv will croak. NWC
7414 #if defined(USE_LONG_DOUBLE)
7415 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",
7416 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7418 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7419 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7422 #endif /* PERL_PRESERVE_IVUV */
7423 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
7427 while (d >= SvPVX(sv)) {
7435 /* MKS: The original code here died if letters weren't consecutive.
7436 * at least it didn't have to worry about non-C locales. The
7437 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
7438 * arranged in order (although not consecutively) and that only
7439 * [A-Za-z] are accepted by isALPHA in the C locale.
7441 if (*d != 'z' && *d != 'Z') {
7442 do { ++*d; } while (!isALPHA(*d));
7445 *(d--) -= 'z' - 'a';
7450 *(d--) -= 'z' - 'a' + 1;
7454 /* oh,oh, the number grew */
7455 SvGROW(sv, SvCUR(sv) + 2);
7456 SvCUR_set(sv, SvCUR(sv) + 1);
7457 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
7468 Auto-decrement of the value in the SV, doing string to numeric conversion
7469 if necessary. Handles 'get' magic.
7475 Perl_sv_dec(pTHX_ register SV *sv)
7483 if (SvTHINKFIRST(sv)) {
7485 sv_force_normal_flags(sv, 0);
7486 if (SvREADONLY(sv)) {
7487 if (IN_PERL_RUNTIME)
7488 Perl_croak(aTHX_ PL_no_modify);
7492 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7494 i = PTR2IV(SvRV(sv));
7499 /* Unlike sv_inc we don't have to worry about string-never-numbers
7500 and keeping them magic. But we mustn't warn on punting */
7501 flags = SvFLAGS(sv);
7502 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7503 /* It's publicly an integer, or privately an integer-not-float */
7504 #ifdef PERL_PRESERVE_IVUV
7508 if (SvUVX(sv) == 0) {
7509 (void)SvIOK_only(sv);
7513 (void)SvIOK_only_UV(sv);
7514 SvUV_set(sv, SvUVX(sv) + 1);
7517 if (SvIVX(sv) == IV_MIN)
7518 sv_setnv(sv, (NV)IV_MIN - 1.0);
7520 (void)SvIOK_only(sv);
7521 SvIV_set(sv, SvIVX(sv) - 1);
7526 if (flags & SVp_NOK) {
7527 SvNV_set(sv, SvNVX(sv) - 1.0);
7528 (void)SvNOK_only(sv);
7531 if (!(flags & SVp_POK)) {
7532 if ((flags & SVTYPEMASK) < SVt_PVNV)
7533 sv_upgrade(sv, SVt_NV);
7535 (void)SvNOK_only(sv);
7538 #ifdef PERL_PRESERVE_IVUV
7540 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7541 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7542 /* Need to try really hard to see if it's an integer.
7543 9.22337203685478e+18 is an integer.
7544 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7545 so $a="9.22337203685478e+18"; $a+0; $a--
7546 needs to be the same as $a="9.22337203685478e+18"; $a--
7553 /* sv_2iv *should* have made this an NV */
7554 if (flags & SVp_NOK) {
7555 (void)SvNOK_only(sv);
7556 SvNV_set(sv, SvNVX(sv) - 1.0);
7559 /* I don't think we can get here. Maybe I should assert this
7560 And if we do get here I suspect that sv_setnv will croak. NWC
7562 #if defined(USE_LONG_DOUBLE)
7563 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",
7564 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7566 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7567 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7571 #endif /* PERL_PRESERVE_IVUV */
7572 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7576 =for apidoc sv_mortalcopy
7578 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7579 The new SV is marked as mortal. It will be destroyed "soon", either by an
7580 explicit call to FREETMPS, or by an implicit call at places such as
7581 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7586 /* Make a string that will exist for the duration of the expression
7587 * evaluation. Actually, it may have to last longer than that, but
7588 * hopefully we won't free it until it has been assigned to a
7589 * permanent location. */
7592 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7597 sv_setsv(sv,oldstr);
7599 PL_tmps_stack[++PL_tmps_ix] = sv;
7605 =for apidoc sv_newmortal
7607 Creates a new null SV which is mortal. The reference count of the SV is
7608 set to 1. It will be destroyed "soon", either by an explicit call to
7609 FREETMPS, or by an implicit call at places such as statement boundaries.
7610 See also C<sv_mortalcopy> and C<sv_2mortal>.
7616 Perl_sv_newmortal(pTHX)
7621 SvFLAGS(sv) = SVs_TEMP;
7623 PL_tmps_stack[++PL_tmps_ix] = sv;
7628 =for apidoc sv_2mortal
7630 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7631 by an explicit call to FREETMPS, or by an implicit call at places such as
7632 statement boundaries. SvTEMP() is turned on which means that the SV's
7633 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7634 and C<sv_mortalcopy>.
7640 Perl_sv_2mortal(pTHX_ register SV *sv)
7645 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7648 PL_tmps_stack[++PL_tmps_ix] = sv;
7656 Creates a new SV and copies a string into it. The reference count for the
7657 SV is set to 1. If C<len> is zero, Perl will compute the length using
7658 strlen(). For efficiency, consider using C<newSVpvn> instead.
7664 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7671 sv_setpvn(sv,s,len);
7676 =for apidoc newSVpvn
7678 Creates a new SV and copies a string into it. The reference count for the
7679 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7680 string. You are responsible for ensuring that the source string is at least
7681 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7687 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7692 sv_setpvn(sv,s,len);
7697 =for apidoc newSVpvn_share
7699 Creates a new SV with its SvPVX pointing to a shared string in the string
7700 table. If the string does not already exist in the table, it is created
7701 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7702 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7703 otherwise the hash is computed. The idea here is that as the string table
7704 is used for shared hash keys these strings will have SvPVX == HeKEY and
7705 hash lookup will avoid string compare.
7711 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7714 bool is_utf8 = FALSE;
7716 STRLEN tmplen = -len;
7718 /* See the note in hv.c:hv_fetch() --jhi */
7719 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7723 PERL_HASH(hash, src, len);
7725 sv_upgrade(sv, SVt_PVIV);
7726 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7739 #if defined(PERL_IMPLICIT_CONTEXT)
7741 /* pTHX_ magic can't cope with varargs, so this is a no-context
7742 * version of the main function, (which may itself be aliased to us).
7743 * Don't access this version directly.
7747 Perl_newSVpvf_nocontext(const char* pat, ...)
7752 va_start(args, pat);
7753 sv = vnewSVpvf(pat, &args);
7760 =for apidoc newSVpvf
7762 Creates a new SV and initializes it with the string formatted like
7769 Perl_newSVpvf(pTHX_ const char* pat, ...)
7773 va_start(args, pat);
7774 sv = vnewSVpvf(pat, &args);
7779 /* backend for newSVpvf() and newSVpvf_nocontext() */
7782 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7786 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7793 Creates a new SV and copies a floating point value into it.
7794 The reference count for the SV is set to 1.
7800 Perl_newSVnv(pTHX_ NV n)
7812 Creates a new SV and copies an integer into it. The reference count for the
7819 Perl_newSViv(pTHX_ IV i)
7831 Creates a new SV and copies an unsigned integer into it.
7832 The reference count for the SV is set to 1.
7838 Perl_newSVuv(pTHX_ UV u)
7848 =for apidoc newRV_noinc
7850 Creates an RV wrapper for an SV. The reference count for the original
7851 SV is B<not> incremented.
7857 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7862 sv_upgrade(sv, SVt_RV);
7864 SvRV_set(sv, tmpRef);
7869 /* newRV_inc is the official function name to use now.
7870 * newRV_inc is in fact #defined to newRV in sv.h
7874 Perl_newRV(pTHX_ SV *tmpRef)
7876 return newRV_noinc(SvREFCNT_inc(tmpRef));
7882 Creates a new SV which is an exact duplicate of the original SV.
7889 Perl_newSVsv(pTHX_ register SV *old)
7895 if (SvTYPE(old) == SVTYPEMASK) {
7896 if (ckWARN_d(WARN_INTERNAL))
7897 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7901 /* SV_GMAGIC is the default for sv_setv()
7902 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7903 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7904 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7909 =for apidoc sv_reset
7911 Underlying implementation for the C<reset> Perl function.
7912 Note that the perl-level function is vaguely deprecated.
7918 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7927 char todo[PERL_UCHAR_MAX+1];
7932 if (!*s) { /* reset ?? searches */
7933 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7934 pm->op_pmdynflags &= ~PMdf_USED;
7939 /* reset variables */
7941 if (!HvARRAY(stash))
7944 Zero(todo, 256, char);
7946 i = (unsigned char)*s;
7950 max = (unsigned char)*s++;
7951 for ( ; i <= max; i++) {
7954 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7955 for (entry = HvARRAY(stash)[i];
7957 entry = HeNEXT(entry))
7959 if (!todo[(U8)*HeKEY(entry)])
7961 gv = (GV*)HeVAL(entry);
7963 if (SvTHINKFIRST(sv)) {
7964 if (!SvREADONLY(sv) && SvROK(sv))
7969 if (SvTYPE(sv) >= SVt_PV) {
7971 if (SvPVX(sv) != Nullch)
7978 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7981 #ifdef USE_ENVIRON_ARRAY
7983 # ifdef USE_ITHREADS
7984 && PL_curinterp == aTHX
7988 environ[0] = Nullch;
7991 #endif /* !PERL_MICRO */
8001 Using various gambits, try to get an IO from an SV: the IO slot if its a
8002 GV; or the recursive result if we're an RV; or the IO slot of the symbol
8003 named after the PV if we're a string.
8009 Perl_sv_2io(pTHX_ SV *sv)
8014 switch (SvTYPE(sv)) {
8022 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
8026 Perl_croak(aTHX_ PL_no_usym, "filehandle");
8028 return sv_2io(SvRV(sv));
8029 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
8035 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
8044 Using various gambits, try to get a CV from an SV; in addition, try if
8045 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
8051 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
8058 return *gvp = Nullgv, Nullcv;
8059 switch (SvTYPE(sv)) {
8078 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
8079 tryAMAGICunDEREF(to_cv);
8082 if (SvTYPE(sv) == SVt_PVCV) {
8091 Perl_croak(aTHX_ "Not a subroutine reference");
8096 gv = gv_fetchsv(sv, lref, SVt_PVCV);
8102 if (lref && !GvCVu(gv)) {
8105 tmpsv = NEWSV(704,0);
8106 gv_efullname3(tmpsv, gv, Nullch);
8107 /* XXX this is probably not what they think they're getting.
8108 * It has the same effect as "sub name;", i.e. just a forward
8110 newSUB(start_subparse(FALSE, 0),
8111 newSVOP(OP_CONST, 0, tmpsv),
8116 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
8126 Returns true if the SV has a true value by Perl's rules.
8127 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
8128 instead use an in-line version.
8134 Perl_sv_true(pTHX_ register SV *sv)
8139 const register XPV* tXpv;
8140 if ((tXpv = (XPV*)SvANY(sv)) &&
8141 (tXpv->xpv_cur > 1 ||
8142 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
8149 return SvIVX(sv) != 0;
8152 return SvNVX(sv) != 0.0;
8154 return sv_2bool(sv);
8162 A private implementation of the C<SvIVx> macro for compilers which can't
8163 cope with complex macro expressions. Always use the macro instead.
8169 Perl_sv_iv(pTHX_ register SV *sv)
8173 return (IV)SvUVX(sv);
8182 A private implementation of the C<SvUVx> macro for compilers which can't
8183 cope with complex macro expressions. Always use the macro instead.
8189 Perl_sv_uv(pTHX_ register SV *sv)
8194 return (UV)SvIVX(sv);
8202 A private implementation of the C<SvNVx> macro for compilers which can't
8203 cope with complex macro expressions. Always use the macro instead.
8209 Perl_sv_nv(pTHX_ register SV *sv)
8216 /* sv_pv() is now a macro using SvPV_nolen();
8217 * this function provided for binary compatibility only
8221 Perl_sv_pv(pTHX_ SV *sv)
8228 return sv_2pv(sv, &n_a);
8234 Use the C<SvPV_nolen> macro instead
8238 A private implementation of the C<SvPV> macro for compilers which can't
8239 cope with complex macro expressions. Always use the macro instead.
8245 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
8251 return sv_2pv(sv, lp);
8256 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
8262 return sv_2pv_flags(sv, lp, 0);
8265 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
8266 * this function provided for binary compatibility only
8270 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
8272 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
8276 =for apidoc sv_pvn_force
8278 Get a sensible string out of the SV somehow.
8279 A private implementation of the C<SvPV_force> macro for compilers which
8280 can't cope with complex macro expressions. Always use the macro instead.
8282 =for apidoc sv_pvn_force_flags
8284 Get a sensible string out of the SV somehow.
8285 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
8286 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
8287 implemented in terms of this function.
8288 You normally want to use the various wrapper macros instead: see
8289 C<SvPV_force> and C<SvPV_force_nomg>
8295 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
8299 if (SvTHINKFIRST(sv) && !SvROK(sv))
8300 sv_force_normal_flags(sv, 0);
8306 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
8307 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
8311 s = sv_2pv_flags(sv, lp, flags);
8312 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
8317 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
8318 SvGROW(sv, len + 1);
8319 Move(s,SvPVX(sv),len,char);
8324 SvPOK_on(sv); /* validate pointer */
8326 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
8327 PTR2UV(sv),SvPVX(sv)));
8333 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
8334 * this function provided for binary compatibility only
8338 Perl_sv_pvbyte(pTHX_ SV *sv)
8340 sv_utf8_downgrade(sv,0);
8345 =for apidoc sv_pvbyte
8347 Use C<SvPVbyte_nolen> instead.
8349 =for apidoc sv_pvbyten
8351 A private implementation of the C<SvPVbyte> macro for compilers
8352 which can't cope with complex macro expressions. Always use the macro
8359 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
8361 sv_utf8_downgrade(sv,0);
8362 return sv_pvn(sv,lp);
8366 =for apidoc sv_pvbyten_force
8368 A private implementation of the C<SvPVbytex_force> macro for compilers
8369 which can't cope with complex macro expressions. Always use the macro
8376 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8378 sv_pvn_force(sv,lp);
8379 sv_utf8_downgrade(sv,0);
8384 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8385 * this function provided for binary compatibility only
8389 Perl_sv_pvutf8(pTHX_ SV *sv)
8391 sv_utf8_upgrade(sv);
8396 =for apidoc sv_pvutf8
8398 Use the C<SvPVutf8_nolen> macro instead
8400 =for apidoc sv_pvutf8n
8402 A private implementation of the C<SvPVutf8> macro for compilers
8403 which can't cope with complex macro expressions. Always use the macro
8410 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8412 sv_utf8_upgrade(sv);
8413 return sv_pvn(sv,lp);
8417 =for apidoc sv_pvutf8n_force
8419 A private implementation of the C<SvPVutf8_force> macro for compilers
8420 which can't cope with complex macro expressions. Always use the macro
8427 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8429 sv_pvn_force(sv,lp);
8430 sv_utf8_upgrade(sv);
8436 =for apidoc sv_reftype
8438 Returns a string describing what the SV is a reference to.
8444 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8446 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8447 inside return suggests a const propagation bug in g++. */
8448 if (ob && SvOBJECT(sv)) {
8449 char *name = HvNAME(SvSTASH(sv));
8450 return name ? name : (char *) "__ANON__";
8453 switch (SvTYPE(sv)) {
8470 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8471 /* tied lvalues should appear to be
8472 * scalars for backwards compatitbility */
8473 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8474 ? "SCALAR" : "LVALUE");
8475 case SVt_PVAV: return "ARRAY";
8476 case SVt_PVHV: return "HASH";
8477 case SVt_PVCV: return "CODE";
8478 case SVt_PVGV: return "GLOB";
8479 case SVt_PVFM: return "FORMAT";
8480 case SVt_PVIO: return "IO";
8481 default: return "UNKNOWN";
8487 =for apidoc sv_isobject
8489 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8490 object. If the SV is not an RV, or if the object is not blessed, then this
8497 Perl_sv_isobject(pTHX_ SV *sv)
8514 Returns a boolean indicating whether the SV is blessed into the specified
8515 class. This does not check for subtypes; use C<sv_derived_from> to verify
8516 an inheritance relationship.
8522 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8533 if (!HvNAME(SvSTASH(sv)))
8536 return strEQ(HvNAME(SvSTASH(sv)), name);
8542 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8543 it will be upgraded to one. If C<classname> is non-null then the new SV will
8544 be blessed in the specified package. The new SV is returned and its
8545 reference count is 1.
8551 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8557 SV_CHECK_THINKFIRST_COW_DROP(rv);
8560 if (SvTYPE(rv) >= SVt_PVMG) {
8561 U32 refcnt = SvREFCNT(rv);
8565 SvREFCNT(rv) = refcnt;
8568 if (SvTYPE(rv) < SVt_RV)
8569 sv_upgrade(rv, SVt_RV);
8570 else if (SvTYPE(rv) > SVt_RV) {
8581 HV* stash = gv_stashpv(classname, TRUE);
8582 (void)sv_bless(rv, stash);
8588 =for apidoc sv_setref_pv
8590 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8591 argument will be upgraded to an RV. That RV will be modified to point to
8592 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8593 into the SV. The C<classname> argument indicates the package for the
8594 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8595 will have a reference count of 1, and the RV will be returned.
8597 Do not use with other Perl types such as HV, AV, SV, CV, because those
8598 objects will become corrupted by the pointer copy process.
8600 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8606 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8609 sv_setsv(rv, &PL_sv_undef);
8613 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8618 =for apidoc sv_setref_iv
8620 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8621 argument will be upgraded to an RV. That RV will be modified to point to
8622 the new SV. The C<classname> argument indicates the package for the
8623 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8624 will have a reference count of 1, and the RV will be returned.
8630 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8632 sv_setiv(newSVrv(rv,classname), iv);
8637 =for apidoc sv_setref_uv
8639 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8640 argument will be upgraded to an RV. That RV will be modified to point to
8641 the new SV. The C<classname> argument indicates the package for the
8642 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8643 will have a reference count of 1, and the RV will be returned.
8649 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8651 sv_setuv(newSVrv(rv,classname), uv);
8656 =for apidoc sv_setref_nv
8658 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8659 argument will be upgraded to an RV. That RV will be modified to point to
8660 the new SV. The C<classname> argument indicates the package for the
8661 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8662 will have a reference count of 1, and the RV will be returned.
8668 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8670 sv_setnv(newSVrv(rv,classname), nv);
8675 =for apidoc sv_setref_pvn
8677 Copies a string into a new SV, optionally blessing the SV. The length of the
8678 string must be specified with C<n>. The C<rv> argument will be upgraded to
8679 an RV. That RV will be modified to point to the new SV. The C<classname>
8680 argument indicates the package for the blessing. Set C<classname> to
8681 C<Nullch> to avoid the blessing. The new SV will have a reference count
8682 of 1, and the RV will be returned.
8684 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8690 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8692 sv_setpvn(newSVrv(rv,classname), pv, n);
8697 =for apidoc sv_bless
8699 Blesses an SV into a specified package. The SV must be an RV. The package
8700 must be designated by its stash (see C<gv_stashpv()>). The reference count
8701 of the SV is unaffected.
8707 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8711 Perl_croak(aTHX_ "Can't bless non-reference value");
8713 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8714 if (SvREADONLY(tmpRef))
8715 Perl_croak(aTHX_ PL_no_modify);
8716 if (SvOBJECT(tmpRef)) {
8717 if (SvTYPE(tmpRef) != SVt_PVIO)
8719 SvREFCNT_dec(SvSTASH(tmpRef));
8722 SvOBJECT_on(tmpRef);
8723 if (SvTYPE(tmpRef) != SVt_PVIO)
8725 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8726 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8733 if(SvSMAGICAL(tmpRef))
8734 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8742 /* Downgrades a PVGV to a PVMG.
8746 S_sv_unglob(pTHX_ SV *sv)
8750 assert(SvTYPE(sv) == SVt_PVGV);
8755 SvREFCNT_dec(GvSTASH(sv));
8756 GvSTASH(sv) = Nullhv;
8758 sv_unmagic(sv, PERL_MAGIC_glob);
8759 Safefree(GvNAME(sv));
8762 /* need to keep SvANY(sv) in the right arena */
8763 xpvmg = new_XPVMG();
8764 StructCopy(SvANY(sv), xpvmg, XPVMG);
8765 del_XPVGV(SvANY(sv));
8768 SvFLAGS(sv) &= ~SVTYPEMASK;
8769 SvFLAGS(sv) |= SVt_PVMG;
8773 =for apidoc sv_unref_flags
8775 Unsets the RV status of the SV, and decrements the reference count of
8776 whatever was being referenced by the RV. This can almost be thought of
8777 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8778 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8779 (otherwise the decrementing is conditional on the reference count being
8780 different from one or the reference being a readonly SV).
8787 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8791 if (SvWEAKREF(sv)) {
8799 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8800 assigned to as BEGIN {$a = \"Foo"} will fail. */
8801 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8803 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8804 sv_2mortal(rv); /* Schedule for freeing later */
8808 =for apidoc sv_unref
8810 Unsets the RV status of the SV, and decrements the reference count of
8811 whatever was being referenced by the RV. This can almost be thought of
8812 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8813 being zero. See C<SvROK_off>.
8819 Perl_sv_unref(pTHX_ SV *sv)
8821 sv_unref_flags(sv, 0);
8825 =for apidoc sv_taint
8827 Taint an SV. Use C<SvTAINTED_on> instead.
8832 Perl_sv_taint(pTHX_ SV *sv)
8834 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8838 =for apidoc sv_untaint
8840 Untaint an SV. Use C<SvTAINTED_off> instead.
8845 Perl_sv_untaint(pTHX_ SV *sv)
8847 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8848 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8855 =for apidoc sv_tainted
8857 Test an SV for taintedness. Use C<SvTAINTED> instead.
8862 Perl_sv_tainted(pTHX_ SV *sv)
8864 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8865 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8866 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8873 =for apidoc sv_setpviv
8875 Copies an integer into the given SV, also updating its string value.
8876 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8882 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8884 char buf[TYPE_CHARS(UV)];
8886 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8888 sv_setpvn(sv, ptr, ebuf - ptr);
8892 =for apidoc sv_setpviv_mg
8894 Like C<sv_setpviv>, but also handles 'set' magic.
8900 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8902 char buf[TYPE_CHARS(UV)];
8904 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8906 sv_setpvn(sv, ptr, ebuf - ptr);
8910 #if defined(PERL_IMPLICIT_CONTEXT)
8912 /* pTHX_ magic can't cope with varargs, so this is a no-context
8913 * version of the main function, (which may itself be aliased to us).
8914 * Don't access this version directly.
8918 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8922 va_start(args, pat);
8923 sv_vsetpvf(sv, pat, &args);
8927 /* pTHX_ magic can't cope with varargs, so this is a no-context
8928 * version of the main function, (which may itself be aliased to us).
8929 * Don't access this version directly.
8933 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8937 va_start(args, pat);
8938 sv_vsetpvf_mg(sv, pat, &args);
8944 =for apidoc sv_setpvf
8946 Works like C<sv_catpvf> but copies the text into the SV instead of
8947 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8953 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8956 va_start(args, pat);
8957 sv_vsetpvf(sv, pat, &args);
8962 =for apidoc sv_vsetpvf
8964 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8965 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8967 Usually used via its frontend C<sv_setpvf>.
8973 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8975 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8979 =for apidoc sv_setpvf_mg
8981 Like C<sv_setpvf>, but also handles 'set' magic.
8987 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8990 va_start(args, pat);
8991 sv_vsetpvf_mg(sv, pat, &args);
8996 =for apidoc sv_vsetpvf_mg
8998 Like C<sv_vsetpvf>, but also handles 'set' magic.
9000 Usually used via its frontend C<sv_setpvf_mg>.
9006 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9008 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9012 #if defined(PERL_IMPLICIT_CONTEXT)
9014 /* pTHX_ magic can't cope with varargs, so this is a no-context
9015 * version of the main function, (which may itself be aliased to us).
9016 * Don't access this version directly.
9020 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
9024 va_start(args, pat);
9025 sv_vcatpvf(sv, pat, &args);
9029 /* pTHX_ magic can't cope with varargs, so this is a no-context
9030 * version of the main function, (which may itself be aliased to us).
9031 * Don't access this version directly.
9035 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
9039 va_start(args, pat);
9040 sv_vcatpvf_mg(sv, pat, &args);
9046 =for apidoc sv_catpvf
9048 Processes its arguments like C<sprintf> and appends the formatted
9049 output to an SV. If the appended data contains "wide" characters
9050 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
9051 and characters >255 formatted with %c), the original SV might get
9052 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
9053 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
9054 valid UTF-8; if the original SV was bytes, the pattern should be too.
9059 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
9062 va_start(args, pat);
9063 sv_vcatpvf(sv, pat, &args);
9068 =for apidoc sv_vcatpvf
9070 Processes its arguments like C<vsprintf> and appends the formatted output
9071 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
9073 Usually used via its frontend C<sv_catpvf>.
9079 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
9081 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9085 =for apidoc sv_catpvf_mg
9087 Like C<sv_catpvf>, but also handles 'set' magic.
9093 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
9096 va_start(args, pat);
9097 sv_vcatpvf_mg(sv, pat, &args);
9102 =for apidoc sv_vcatpvf_mg
9104 Like C<sv_vcatpvf>, but also handles 'set' magic.
9106 Usually used via its frontend C<sv_catpvf_mg>.
9112 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
9114 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
9119 =for apidoc sv_vsetpvfn
9121 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
9124 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
9130 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9132 sv_setpvn(sv, "", 0);
9133 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
9136 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
9139 S_expect_number(pTHX_ char** pattern)
9142 switch (**pattern) {
9143 case '1': case '2': case '3':
9144 case '4': case '5': case '6':
9145 case '7': case '8': case '9':
9146 while (isDIGIT(**pattern))
9147 var = var * 10 + (*(*pattern)++ - '0');
9151 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
9154 F0convert(NV nv, char *endbuf, STRLEN *len)
9165 if (uv & 1 && uv == nv)
9166 uv--; /* Round to even */
9168 unsigned dig = uv % 10;
9181 =for apidoc sv_vcatpvfn
9183 Processes its arguments like C<vsprintf> and appends the formatted output
9184 to an SV. Uses an array of SVs if the C style variable argument list is
9185 missing (NULL). When running with taint checks enabled, indicates via
9186 C<maybe_tainted> if results are untrustworthy (often due to the use of
9189 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
9194 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
9197 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
9204 static const char nullstr[] = "(null)";
9206 bool has_utf8; /* has the result utf8? */
9207 bool pat_utf8; /* the pattern is in utf8? */
9209 /* Times 4: a decimal digit takes more than 3 binary digits.
9210 * NV_DIG: mantissa takes than many decimal digits.
9211 * Plus 32: Playing safe. */
9212 char ebuf[IV_DIG * 4 + NV_DIG + 32];
9213 /* large enough for "%#.#f" --chip */
9214 /* what about long double NVs? --jhi */
9216 has_utf8 = pat_utf8 = DO_UTF8(sv);
9218 /* no matter what, this is a string now */
9219 (void)SvPV_force(sv, origlen);
9221 /* special-case "", "%s", and "%_" */
9224 if (patlen == 2 && pat[0] == '%') {
9228 const char *s = va_arg(*args, char*);
9229 sv_catpv(sv, s ? s : nullstr);
9231 else if (svix < svmax) {
9232 sv_catsv(sv, *svargs);
9233 if (DO_UTF8(*svargs))
9239 argsv = va_arg(*args, SV*);
9240 sv_catsv(sv, argsv);
9245 /* See comment on '_' below */
9250 #ifndef USE_LONG_DOUBLE
9251 /* special-case "%.<number>[gf]" */
9252 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
9253 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
9254 unsigned digits = 0;
9258 while (*pp >= '0' && *pp <= '9')
9259 digits = 10 * digits + (*pp++ - '0');
9260 if (pp - pat == (int)patlen - 1) {
9264 nv = (NV)va_arg(*args, double);
9265 else if (svix < svmax)
9270 /* Add check for digits != 0 because it seems that some
9271 gconverts are buggy in this case, and we don't yet have
9272 a Configure test for this. */
9273 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
9274 /* 0, point, slack */
9275 Gconvert(nv, (int)digits, 0, ebuf);
9277 if (*ebuf) /* May return an empty string for digits==0 */
9280 } else if (!digits) {
9283 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
9284 sv_catpvn(sv, p, l);
9290 #endif /* !USE_LONG_DOUBLE */
9292 if (!args && svix < svmax && DO_UTF8(*svargs))
9295 patend = (char*)pat + patlen;
9296 for (p = (char*)pat; p < patend; p = q) {
9299 bool vectorize = FALSE;
9300 bool vectorarg = FALSE;
9301 bool vec_utf8 = FALSE;
9307 bool has_precis = FALSE;
9310 bool is_utf8 = FALSE; /* is this item utf8? */
9311 #ifdef HAS_LDBL_SPRINTF_BUG
9312 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9313 with sfio - Allen <allens@cpan.org> */
9314 bool fix_ldbl_sprintf_bug = FALSE;
9318 U8 utf8buf[UTF8_MAXBYTES+1];
9319 STRLEN esignlen = 0;
9321 char *eptr = Nullch;
9324 U8 *vecstr = Null(U8*);
9331 /* we need a long double target in case HAS_LONG_DOUBLE but
9334 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
9342 const char *dotstr = ".";
9343 STRLEN dotstrlen = 1;
9344 I32 efix = 0; /* explicit format parameter index */
9345 I32 ewix = 0; /* explicit width index */
9346 I32 epix = 0; /* explicit precision index */
9347 I32 evix = 0; /* explicit vector index */
9348 bool asterisk = FALSE;
9350 /* echo everything up to the next format specification */
9351 for (q = p; q < patend && *q != '%'; ++q) ;
9353 if (has_utf8 && !pat_utf8)
9354 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
9356 sv_catpvn(sv, p, q - p);
9363 We allow format specification elements in this order:
9364 \d+\$ explicit format parameter index
9366 v|\*(\d+\$)?v vector with optional (optionally specified) arg
9367 0 flag (as above): repeated to allow "v02"
9368 \d+|\*(\d+\$)? width using optional (optionally specified) arg
9369 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
9371 [%bcdefginopsux_DFOUX] format (mandatory)
9373 if (EXPECT_NUMBER(q, width)) {
9414 if (EXPECT_NUMBER(q, ewix))
9423 if ((vectorarg = asterisk)) {
9435 EXPECT_NUMBER(q, width);
9440 vecsv = va_arg(*args, SV*);
9442 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9443 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9444 dotstr = SvPVx(vecsv, dotstrlen);
9449 vecsv = va_arg(*args, SV*);
9450 vecstr = (U8*)SvPVx(vecsv,veclen);
9451 vec_utf8 = DO_UTF8(vecsv);
9453 else if (efix ? efix <= svmax : svix < svmax) {
9454 vecsv = svargs[efix ? efix-1 : svix++];
9455 vecstr = (U8*)SvPVx(vecsv,veclen);
9456 vec_utf8 = DO_UTF8(vecsv);
9457 /* if this is a version object, we need to return the
9458 * stringified representation (which the SvPVX has
9459 * already done for us), but not vectorize the args
9461 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9463 q++; /* skip past the rest of the %vd format */
9464 eptr = (char *) vecstr;
9465 elen = strlen(eptr);
9478 i = va_arg(*args, int);
9480 i = (ewix ? ewix <= svmax : svix < svmax) ?
9481 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9483 width = (i < 0) ? -i : i;
9493 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9495 /* XXX: todo, support specified precision parameter */
9499 i = va_arg(*args, int);
9501 i = (ewix ? ewix <= svmax : svix < svmax)
9502 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9503 precis = (i < 0) ? 0 : i;
9508 precis = precis * 10 + (*q++ - '0');
9517 case 'I': /* Ix, I32x, and I64x */
9519 if (q[1] == '6' && q[2] == '4') {
9525 if (q[1] == '3' && q[2] == '2') {
9535 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9546 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9547 if (*(q + 1) == 'l') { /* lld, llf */
9572 argsv = (efix ? efix <= svmax : svix < svmax) ?
9573 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9580 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9582 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9584 eptr = (char*)utf8buf;
9585 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9596 if (args && !vectorize) {
9597 eptr = va_arg(*args, char*);
9599 #ifdef MACOS_TRADITIONAL
9600 /* On MacOS, %#s format is used for Pascal strings */
9605 elen = strlen(eptr);
9607 eptr = (char *)nullstr;
9608 elen = sizeof nullstr - 1;
9612 eptr = SvPVx(argsv, elen);
9613 if (DO_UTF8(argsv)) {
9614 if (has_precis && precis < elen) {
9616 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9619 if (width) { /* fudge width (can't fudge elen) */
9620 width += elen - sv_len_utf8(argsv);
9632 * The "%_" hack might have to be changed someday,
9633 * if ISO or ANSI decide to use '_' for something.
9634 * So we keep it hidden from users' code.
9636 if (!args || vectorize)
9638 argsv = va_arg(*args, SV*);
9639 eptr = SvPVx(argsv, elen);
9645 if (has_precis && elen > precis)
9656 goto format_sv; /* %-p -> %_ */
9660 goto format_sv; /* %-Np -> %.N_ */
9663 if (alt || vectorize)
9665 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9683 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9692 esignbuf[esignlen++] = plus;
9696 case 'h': iv = (short)va_arg(*args, int); break;
9697 case 'l': iv = va_arg(*args, long); break;
9698 case 'V': iv = va_arg(*args, IV); break;
9699 default: iv = va_arg(*args, int); break;
9701 case 'q': iv = va_arg(*args, Quad_t); break;
9706 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9708 case 'h': iv = (short)tiv; break;
9709 case 'l': iv = (long)tiv; break;
9711 default: iv = tiv; break;
9713 case 'q': iv = (Quad_t)tiv; break;
9717 if ( !vectorize ) /* we already set uv above */
9722 esignbuf[esignlen++] = plus;
9726 esignbuf[esignlen++] = '-';
9769 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9780 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9781 case 'l': uv = va_arg(*args, unsigned long); break;
9782 case 'V': uv = va_arg(*args, UV); break;
9783 default: uv = va_arg(*args, unsigned); break;
9785 case 'q': uv = va_arg(*args, Uquad_t); break;
9790 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9792 case 'h': uv = (unsigned short)tuv; break;
9793 case 'l': uv = (unsigned long)tuv; break;
9795 default: uv = tuv; break;
9797 case 'q': uv = (Uquad_t)tuv; break;
9803 eptr = ebuf + sizeof ebuf;
9809 p = (char*)((c == 'X')
9810 ? "0123456789ABCDEF" : "0123456789abcdef");
9816 esignbuf[esignlen++] = '0';
9817 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9823 *--eptr = '0' + dig;
9825 if (alt && *eptr != '0')
9831 *--eptr = '0' + dig;
9834 esignbuf[esignlen++] = '0';
9835 esignbuf[esignlen++] = 'b';
9838 default: /* it had better be ten or less */
9841 *--eptr = '0' + dig;
9842 } while (uv /= base);
9845 elen = (ebuf + sizeof ebuf) - eptr;
9848 zeros = precis - elen;
9849 else if (precis == 0 && elen == 1 && *eptr == '0')
9854 /* FLOATING POINT */
9857 c = 'f'; /* maybe %F isn't supported here */
9863 /* This is evil, but floating point is even more evil */
9865 /* for SV-style calling, we can only get NV
9866 for C-style calling, we assume %f is double;
9867 for simplicity we allow any of %Lf, %llf, %qf for long double
9871 #if defined(USE_LONG_DOUBLE)
9875 /* [perl #20339] - we should accept and ignore %lf rather than die */
9879 #if defined(USE_LONG_DOUBLE)
9880 intsize = args ? 0 : 'q';
9884 #if defined(HAS_LONG_DOUBLE)
9893 /* now we need (long double) if intsize == 'q', else (double) */
9894 nv = (args && !vectorize) ?
9895 #if LONG_DOUBLESIZE > DOUBLESIZE
9897 va_arg(*args, long double) :
9898 va_arg(*args, double)
9900 va_arg(*args, double)
9906 if (c != 'e' && c != 'E') {
9908 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9909 will cast our (long double) to (double) */
9910 (void)Perl_frexp(nv, &i);
9911 if (i == PERL_INT_MIN)
9912 Perl_die(aTHX_ "panic: frexp");
9914 need = BIT_DIGITS(i);
9916 need += has_precis ? precis : 6; /* known default */
9921 #ifdef HAS_LDBL_SPRINTF_BUG
9922 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9923 with sfio - Allen <allens@cpan.org> */
9926 # define MY_DBL_MAX DBL_MAX
9927 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9928 # if DOUBLESIZE >= 8
9929 # define MY_DBL_MAX 1.7976931348623157E+308L
9931 # define MY_DBL_MAX 3.40282347E+38L
9935 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9936 # define MY_DBL_MAX_BUG 1L
9938 # define MY_DBL_MAX_BUG MY_DBL_MAX
9942 # define MY_DBL_MIN DBL_MIN
9943 # else /* XXX guessing! -Allen */
9944 # if DOUBLESIZE >= 8
9945 # define MY_DBL_MIN 2.2250738585072014E-308L
9947 # define MY_DBL_MIN 1.17549435E-38L
9951 if ((intsize == 'q') && (c == 'f') &&
9952 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9954 /* it's going to be short enough that
9955 * long double precision is not needed */
9957 if ((nv <= 0L) && (nv >= -0L))
9958 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9960 /* would use Perl_fp_class as a double-check but not
9961 * functional on IRIX - see perl.h comments */
9963 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9964 /* It's within the range that a double can represent */
9965 #if defined(DBL_MAX) && !defined(DBL_MIN)
9966 if ((nv >= ((long double)1/DBL_MAX)) ||
9967 (nv <= (-(long double)1/DBL_MAX)))
9969 fix_ldbl_sprintf_bug = TRUE;
9972 if (fix_ldbl_sprintf_bug == TRUE) {
9982 # undef MY_DBL_MAX_BUG
9985 #endif /* HAS_LDBL_SPRINTF_BUG */
9987 need += 20; /* fudge factor */
9988 if (PL_efloatsize < need) {
9989 Safefree(PL_efloatbuf);
9990 PL_efloatsize = need + 20; /* more fudge */
9991 New(906, PL_efloatbuf, PL_efloatsize, char);
9992 PL_efloatbuf[0] = '\0';
9995 if ( !(width || left || plus || alt) && fill != '0'
9996 && has_precis && intsize != 'q' ) { /* Shortcuts */
9997 /* See earlier comment about buggy Gconvert when digits,
9999 if ( c == 'g' && precis) {
10000 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
10001 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
10002 goto float_converted;
10003 } else if ( c == 'f' && !precis) {
10004 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
10008 eptr = ebuf + sizeof ebuf;
10011 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
10012 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
10013 if (intsize == 'q') {
10014 /* Copy the one or more characters in a long double
10015 * format before the 'base' ([efgEFG]) character to
10016 * the format string. */
10017 static char const prifldbl[] = PERL_PRIfldbl;
10018 char const *p = prifldbl + sizeof(prifldbl) - 3;
10019 while (p >= prifldbl) { *--eptr = *p--; }
10024 do { *--eptr = '0' + (base % 10); } while (base /= 10);
10029 do { *--eptr = '0' + (base % 10); } while (base /= 10);
10041 /* No taint. Otherwise we are in the strange situation
10042 * where printf() taints but print($float) doesn't.
10044 #if defined(HAS_LONG_DOUBLE)
10045 if (intsize == 'q')
10046 (void)sprintf(PL_efloatbuf, eptr, nv);
10048 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
10050 (void)sprintf(PL_efloatbuf, eptr, nv);
10053 eptr = PL_efloatbuf;
10054 elen = strlen(PL_efloatbuf);
10060 i = SvCUR(sv) - origlen;
10061 if (args && !vectorize) {
10063 case 'h': *(va_arg(*args, short*)) = i; break;
10064 default: *(va_arg(*args, int*)) = i; break;
10065 case 'l': *(va_arg(*args, long*)) = i; break;
10066 case 'V': *(va_arg(*args, IV*)) = i; break;
10068 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
10073 sv_setuv_mg(argsv, (UV)i);
10075 continue; /* not "break" */
10081 if (!args && ckWARN(WARN_PRINTF) &&
10082 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
10083 SV *msg = sv_newmortal();
10084 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
10085 (PL_op->op_type == OP_PRTF) ? "" : "s");
10088 Perl_sv_catpvf(aTHX_ msg,
10089 "\"%%%c\"", c & 0xFF);
10091 Perl_sv_catpvf(aTHX_ msg,
10092 "\"%%\\%03"UVof"\"",
10095 sv_catpv(msg, "end of string");
10096 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
10099 /* output mangled stuff ... */
10105 /* ... right here, because formatting flags should not apply */
10106 SvGROW(sv, SvCUR(sv) + elen + 1);
10108 Copy(eptr, p, elen, char);
10111 SvCUR_set(sv, p - SvPVX(sv));
10113 continue; /* not "break" */
10116 /* calculate width before utf8_upgrade changes it */
10117 have = esignlen + zeros + elen;
10119 if (is_utf8 != has_utf8) {
10122 sv_utf8_upgrade(sv);
10125 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
10126 sv_utf8_upgrade(nsv);
10130 SvGROW(sv, SvCUR(sv) + elen + 1);
10135 need = (have > width ? have : width);
10138 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
10140 if (esignlen && fill == '0') {
10141 for (i = 0; i < (int)esignlen; i++)
10142 *p++ = esignbuf[i];
10144 if (gap && !left) {
10145 memset(p, fill, gap);
10148 if (esignlen && fill != '0') {
10149 for (i = 0; i < (int)esignlen; i++)
10150 *p++ = esignbuf[i];
10153 for (i = zeros; i; i--)
10157 Copy(eptr, p, elen, char);
10161 memset(p, ' ', gap);
10166 Copy(dotstr, p, dotstrlen, char);
10170 vectorize = FALSE; /* done iterating over vecstr */
10177 SvCUR_set(sv, p - SvPVX(sv));
10185 /* =========================================================================
10187 =head1 Cloning an interpreter
10189 All the macros and functions in this section are for the private use of
10190 the main function, perl_clone().
10192 The foo_dup() functions make an exact copy of an existing foo thinngy.
10193 During the course of a cloning, a hash table is used to map old addresses
10194 to new addresses. The table is created and manipulated with the
10195 ptr_table_* functions.
10199 ============================================================================*/
10202 #if defined(USE_ITHREADS)
10204 #ifndef GpREFCNT_inc
10205 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
10209 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
10210 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
10211 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10212 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
10213 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10214 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
10215 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10216 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
10217 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
10218 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
10219 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
10220 #define SAVEPV(p) (p ? savepv(p) : Nullch)
10221 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
10224 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
10225 regcomp.c. AMS 20010712 */
10228 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
10233 struct reg_substr_datum *s;
10236 return (REGEXP *)NULL;
10238 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
10241 len = r->offsets[0];
10242 npar = r->nparens+1;
10244 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
10245 Copy(r->program, ret->program, len+1, regnode);
10247 New(0, ret->startp, npar, I32);
10248 Copy(r->startp, ret->startp, npar, I32);
10249 New(0, ret->endp, npar, I32);
10250 Copy(r->startp, ret->startp, npar, I32);
10252 New(0, ret->substrs, 1, struct reg_substr_data);
10253 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
10254 s->min_offset = r->substrs->data[i].min_offset;
10255 s->max_offset = r->substrs->data[i].max_offset;
10256 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
10257 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
10260 ret->regstclass = NULL;
10262 struct reg_data *d;
10263 const int count = r->data->count;
10265 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
10266 char, struct reg_data);
10267 New(0, d->what, count, U8);
10270 for (i = 0; i < count; i++) {
10271 d->what[i] = r->data->what[i];
10272 switch (d->what[i]) {
10273 /* legal options are one of: sfpont
10274 see also regcomp.h and pregfree() */
10276 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
10279 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
10282 /* This is cheating. */
10283 New(0, d->data[i], 1, struct regnode_charclass_class);
10284 StructCopy(r->data->data[i], d->data[i],
10285 struct regnode_charclass_class);
10286 ret->regstclass = (regnode*)d->data[i];
10289 /* Compiled op trees are readonly, and can thus be
10290 shared without duplication. */
10292 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
10296 d->data[i] = r->data->data[i];
10299 d->data[i] = r->data->data[i];
10301 ((reg_trie_data*)d->data[i])->refcount++;
10305 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
10314 New(0, ret->offsets, 2*len+1, U32);
10315 Copy(r->offsets, ret->offsets, 2*len+1, U32);
10317 ret->precomp = SAVEPVN(r->precomp, r->prelen);
10318 ret->refcnt = r->refcnt;
10319 ret->minlen = r->minlen;
10320 ret->prelen = r->prelen;
10321 ret->nparens = r->nparens;
10322 ret->lastparen = r->lastparen;
10323 ret->lastcloseparen = r->lastcloseparen;
10324 ret->reganch = r->reganch;
10326 ret->sublen = r->sublen;
10328 if (RX_MATCH_COPIED(ret))
10329 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
10331 ret->subbeg = Nullch;
10332 #ifdef PERL_COPY_ON_WRITE
10333 ret->saved_copy = Nullsv;
10336 ptr_table_store(PL_ptr_table, r, ret);
10340 /* duplicate a file handle */
10343 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
10349 return (PerlIO*)NULL;
10351 /* look for it in the table first */
10352 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
10356 /* create anew and remember what it is */
10357 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
10358 ptr_table_store(PL_ptr_table, fp, ret);
10362 /* duplicate a directory handle */
10365 Perl_dirp_dup(pTHX_ DIR *dp)
10373 /* duplicate a typeglob */
10376 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
10381 /* look for it in the table first */
10382 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
10386 /* create anew and remember what it is */
10387 Newz(0, ret, 1, GP);
10388 ptr_table_store(PL_ptr_table, gp, ret);
10391 ret->gp_refcnt = 0; /* must be before any other dups! */
10392 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10393 ret->gp_io = io_dup_inc(gp->gp_io, param);
10394 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10395 ret->gp_av = av_dup_inc(gp->gp_av, param);
10396 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10397 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10398 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10399 ret->gp_cvgen = gp->gp_cvgen;
10400 ret->gp_flags = gp->gp_flags;
10401 ret->gp_line = gp->gp_line;
10402 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10406 /* duplicate a chain of magic */
10409 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10411 MAGIC *mgprev = (MAGIC*)NULL;
10414 return (MAGIC*)NULL;
10415 /* look for it in the table first */
10416 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10420 for (; mg; mg = mg->mg_moremagic) {
10422 Newz(0, nmg, 1, MAGIC);
10424 mgprev->mg_moremagic = nmg;
10427 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10428 nmg->mg_private = mg->mg_private;
10429 nmg->mg_type = mg->mg_type;
10430 nmg->mg_flags = mg->mg_flags;
10431 if (mg->mg_type == PERL_MAGIC_qr) {
10432 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10434 else if(mg->mg_type == PERL_MAGIC_backref) {
10435 const AV * const av = (AV*) mg->mg_obj;
10438 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10440 for (i = AvFILLp(av); i >= 0; i--) {
10441 if (!svp[i]) continue;
10442 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10446 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10447 ? sv_dup_inc(mg->mg_obj, param)
10448 : sv_dup(mg->mg_obj, param);
10450 nmg->mg_len = mg->mg_len;
10451 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10452 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10453 if (mg->mg_len > 0) {
10454 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10455 if (mg->mg_type == PERL_MAGIC_overload_table &&
10456 AMT_AMAGIC((AMT*)mg->mg_ptr))
10458 AMT *amtp = (AMT*)mg->mg_ptr;
10459 AMT *namtp = (AMT*)nmg->mg_ptr;
10461 for (i = 1; i < NofAMmeth; i++) {
10462 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10466 else if (mg->mg_len == HEf_SVKEY)
10467 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10469 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10470 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10477 /* create a new pointer-mapping table */
10480 Perl_ptr_table_new(pTHX)
10483 Newz(0, tbl, 1, PTR_TBL_t);
10484 tbl->tbl_max = 511;
10485 tbl->tbl_items = 0;
10486 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10491 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10493 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10501 register struct ptr_tbl_ent* pte;
10502 register struct ptr_tbl_ent* pteend;
10503 New(0, pte, PERL_ARENA_SIZE/sizeof(struct ptr_tbl_ent), struct ptr_tbl_ent);
10504 pte->next = PL_pte_arenaroot;
10505 PL_pte_arenaroot = pte;
10507 pteend = &pte[PERL_ARENA_SIZE / sizeof(struct ptr_tbl_ent) - 1];
10508 PL_pte_root = ++pte;
10509 while (pte < pteend) {
10510 pte->next = pte + 1;
10516 STATIC struct ptr_tbl_ent*
10519 struct ptr_tbl_ent* pte;
10523 PL_pte_root = pte->next;
10528 S_del_pte(pTHX_ struct ptr_tbl_ent*p)
10530 p->next = PL_pte_root;
10534 /* map an existing pointer using a table */
10537 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10539 PTR_TBL_ENT_t *tblent;
10540 const UV hash = PTR_TABLE_HASH(sv);
10542 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10543 for (; tblent; tblent = tblent->next) {
10544 if (tblent->oldval == sv)
10545 return tblent->newval;
10547 return (void*)NULL;
10550 /* add a new entry to a pointer-mapping table */
10553 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10555 PTR_TBL_ENT_t *tblent, **otblent;
10556 /* XXX this may be pessimal on platforms where pointers aren't good
10557 * hash values e.g. if they grow faster in the most significant
10559 const UV hash = PTR_TABLE_HASH(oldv);
10563 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10564 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10565 if (tblent->oldval == oldv) {
10566 tblent->newval = newv;
10570 tblent = S_new_pte(aTHX);
10571 tblent->oldval = oldv;
10572 tblent->newval = newv;
10573 tblent->next = *otblent;
10576 if (!empty && tbl->tbl_items > tbl->tbl_max)
10577 ptr_table_split(tbl);
10580 /* double the hash bucket size of an existing ptr table */
10583 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10585 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10586 const UV oldsize = tbl->tbl_max + 1;
10587 UV newsize = oldsize * 2;
10590 Renew(ary, newsize, PTR_TBL_ENT_t*);
10591 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10592 tbl->tbl_max = --newsize;
10593 tbl->tbl_ary = ary;
10594 for (i=0; i < oldsize; i++, ary++) {
10595 PTR_TBL_ENT_t **curentp, **entp, *ent;
10598 curentp = ary + oldsize;
10599 for (entp = ary, ent = *ary; ent; ent = *entp) {
10600 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10602 ent->next = *curentp;
10612 /* remove all the entries from a ptr table */
10615 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10617 register PTR_TBL_ENT_t **array;
10618 register PTR_TBL_ENT_t *entry;
10622 if (!tbl || !tbl->tbl_items) {
10626 array = tbl->tbl_ary;
10628 max = tbl->tbl_max;
10632 PTR_TBL_ENT_t *oentry = entry;
10633 entry = entry->next;
10634 S_del_pte(aTHX_ oentry);
10637 if (++riter > max) {
10640 entry = array[riter];
10644 tbl->tbl_items = 0;
10647 /* clear and free a ptr table */
10650 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10655 ptr_table_clear(tbl);
10656 Safefree(tbl->tbl_ary);
10660 /* attempt to make everything in the typeglob readonly */
10663 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10665 GV *gv = (GV*)sstr;
10666 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10668 if (GvIO(gv) || GvFORM(gv)) {
10669 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10671 else if (!GvCV(gv)) {
10672 GvCV(gv) = (CV*)sv;
10675 /* CvPADLISTs cannot be shared */
10676 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10681 if (!GvUNIQUE(gv)) {
10683 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10684 HvNAME(GvSTASH(gv)), GvNAME(gv));
10690 * write attempts will die with
10691 * "Modification of a read-only value attempted"
10697 SvREADONLY_on(GvSV(gv));
10701 GvAV(gv) = (AV*)sv;
10704 SvREADONLY_on(GvAV(gv));
10708 GvHV(gv) = (HV*)sv;
10711 SvREADONLY_on(GvHV(gv));
10714 return sstr; /* he_dup() will SvREFCNT_inc() */
10717 /* duplicate an SV of any type (including AV, HV etc) */
10720 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10723 SvRV_set(dstr, SvWEAKREF(sstr)
10724 ? sv_dup(SvRV(sstr), param)
10725 : sv_dup_inc(SvRV(sstr), param));
10728 else if (SvPVX(sstr)) {
10729 /* Has something there */
10731 /* Normal PV - clone whole allocated space */
10732 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1));
10733 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10734 /* Not that normal - actually sstr is copy on write.
10735 But we are a true, independant SV, so: */
10736 SvREADONLY_off(dstr);
10741 /* Special case - not normally malloced for some reason */
10742 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10743 /* A "shared" PV - clone it as unshared string */
10744 if(SvPADTMP(sstr)) {
10745 /* However, some of them live in the pad
10746 and they should not have these flags
10749 SvPV_set(dstr, sharepvn(SvPVX(sstr), SvCUR(sstr),
10751 SvUV_set(dstr, SvUVX(sstr));
10754 SvPV_set(dstr, SAVEPVN(SvPVX(sstr), SvCUR(sstr)));
10756 SvREADONLY_off(dstr);
10760 /* Some other special case - random pointer */
10761 SvPV_set(dstr, SvPVX(sstr));
10766 /* Copy the Null */
10767 if (SvTYPE(dstr) == SVt_RV)
10768 SvRV_set(dstr, NULL);
10775 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10780 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10782 /* look for it in the table first */
10783 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10787 if(param->flags & CLONEf_JOIN_IN) {
10788 /** We are joining here so we don't want do clone
10789 something that is bad **/
10791 if(SvTYPE(sstr) == SVt_PVHV &&
10793 /** don't clone stashes if they already exist **/
10794 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10795 return (SV*) old_stash;
10799 /* create anew and remember what it is */
10802 #ifdef DEBUG_LEAKING_SCALARS
10803 dstr->sv_debug_optype = sstr->sv_debug_optype;
10804 dstr->sv_debug_line = sstr->sv_debug_line;
10805 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10806 dstr->sv_debug_cloned = 1;
10808 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10810 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10814 ptr_table_store(PL_ptr_table, sstr, dstr);
10817 SvFLAGS(dstr) = SvFLAGS(sstr);
10818 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10819 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10822 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10823 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10824 PL_watch_pvx, SvPVX(sstr));
10827 /* don't clone objects whose class has asked us not to */
10828 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10829 SvFLAGS(dstr) &= ~SVTYPEMASK;
10830 SvOBJECT_off(dstr);
10834 switch (SvTYPE(sstr)) {
10836 SvANY(dstr) = NULL;
10839 SvANY(dstr) = new_XIV();
10840 SvIV_set(dstr, SvIVX(sstr));
10843 SvANY(dstr) = new_XNV();
10844 SvNV_set(dstr, SvNVX(sstr));
10847 SvANY(dstr) = new_XRV();
10848 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10851 SvANY(dstr) = new_XPV();
10852 SvCUR_set(dstr, SvCUR(sstr));
10853 SvLEN_set(dstr, SvLEN(sstr));
10854 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10857 SvANY(dstr) = new_XPVIV();
10858 SvCUR_set(dstr, SvCUR(sstr));
10859 SvLEN_set(dstr, SvLEN(sstr));
10860 SvIV_set(dstr, SvIVX(sstr));
10861 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10864 SvANY(dstr) = new_XPVNV();
10865 SvCUR_set(dstr, SvCUR(sstr));
10866 SvLEN_set(dstr, SvLEN(sstr));
10867 SvIV_set(dstr, SvIVX(sstr));
10868 SvNV_set(dstr, SvNVX(sstr));
10869 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10872 SvANY(dstr) = new_XPVMG();
10873 SvCUR_set(dstr, SvCUR(sstr));
10874 SvLEN_set(dstr, SvLEN(sstr));
10875 SvIV_set(dstr, SvIVX(sstr));
10876 SvNV_set(dstr, SvNVX(sstr));
10877 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10878 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10879 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10882 SvANY(dstr) = new_XPVBM();
10883 SvCUR_set(dstr, SvCUR(sstr));
10884 SvLEN_set(dstr, SvLEN(sstr));
10885 SvIV_set(dstr, SvIVX(sstr));
10886 SvNV_set(dstr, SvNVX(sstr));
10887 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10888 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10889 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10890 BmRARE(dstr) = BmRARE(sstr);
10891 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10892 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10895 SvANY(dstr) = new_XPVLV();
10896 SvCUR_set(dstr, SvCUR(sstr));
10897 SvLEN_set(dstr, SvLEN(sstr));
10898 SvIV_set(dstr, SvIVX(sstr));
10899 SvNV_set(dstr, SvNVX(sstr));
10900 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10901 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10902 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10903 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10904 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10905 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10906 LvTARG(dstr) = dstr;
10907 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10908 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10910 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10911 LvTYPE(dstr) = LvTYPE(sstr);
10914 if (GvUNIQUE((GV*)sstr)) {
10916 if ((share = gv_share(sstr, param))) {
10919 ptr_table_store(PL_ptr_table, sstr, dstr);
10921 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10922 HvNAME(GvSTASH(share)), GvNAME(share));
10927 SvANY(dstr) = new_XPVGV();
10928 SvCUR_set(dstr, SvCUR(sstr));
10929 SvLEN_set(dstr, SvLEN(sstr));
10930 SvIV_set(dstr, SvIVX(sstr));
10931 SvNV_set(dstr, SvNVX(sstr));
10932 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10933 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10934 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10935 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10936 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10937 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10938 GvFLAGS(dstr) = GvFLAGS(sstr);
10939 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10940 (void)GpREFCNT_inc(GvGP(dstr));
10943 SvANY(dstr) = new_XPVIO();
10944 SvCUR_set(dstr, SvCUR(sstr));
10945 SvLEN_set(dstr, SvLEN(sstr));
10946 SvIV_set(dstr, SvIVX(sstr));
10947 SvNV_set(dstr, SvNVX(sstr));
10948 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10949 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10950 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10951 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10952 if (IoOFP(sstr) == IoIFP(sstr))
10953 IoOFP(dstr) = IoIFP(dstr);
10955 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10956 /* PL_rsfp_filters entries have fake IoDIRP() */
10957 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10958 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10960 IoDIRP(dstr) = IoDIRP(sstr);
10961 IoLINES(dstr) = IoLINES(sstr);
10962 IoPAGE(dstr) = IoPAGE(sstr);
10963 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10964 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10965 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10966 /* I have no idea why fake dirp (rsfps)
10967 should be treaded differently but otherwise
10968 we end up with leaks -- sky*/
10969 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10970 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10971 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10973 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10974 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10975 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10977 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10978 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10979 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10980 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10981 IoTYPE(dstr) = IoTYPE(sstr);
10982 IoFLAGS(dstr) = IoFLAGS(sstr);
10985 SvANY(dstr) = new_XPVAV();
10986 SvCUR_set(dstr, SvCUR(sstr));
10987 SvLEN_set(dstr, SvLEN(sstr));
10988 SvIV_set(dstr, SvIVX(sstr));
10989 SvNV_set(dstr, SvNVX(sstr));
10990 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10991 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10992 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10993 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10994 if (AvARRAY((AV*)sstr)) {
10995 SV **dst_ary, **src_ary;
10996 SSize_t items = AvFILLp((AV*)sstr) + 1;
10998 src_ary = AvARRAY((AV*)sstr);
10999 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
11000 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
11001 SvPV_set(dstr, (char*)dst_ary);
11002 AvALLOC((AV*)dstr) = dst_ary;
11003 if (AvREAL((AV*)sstr)) {
11004 while (items-- > 0)
11005 *dst_ary++ = sv_dup_inc(*src_ary++, param);
11008 while (items-- > 0)
11009 *dst_ary++ = sv_dup(*src_ary++, param);
11011 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
11012 while (items-- > 0) {
11013 *dst_ary++ = &PL_sv_undef;
11017 SvPV_set(dstr, Nullch);
11018 AvALLOC((AV*)dstr) = (SV**)NULL;
11022 SvANY(dstr) = new_XPVHV();
11023 SvCUR_set(dstr, SvCUR(sstr));
11024 SvLEN_set(dstr, SvLEN(sstr));
11025 SvIV_set(dstr, SvIVX(sstr));
11026 SvNV_set(dstr, SvNVX(sstr));
11027 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
11028 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
11029 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
11030 if (HvARRAY((HV*)sstr)) {
11032 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
11033 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
11034 Newz(0, dxhv->xhv_array,
11035 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
11036 while (i <= sxhv->xhv_max) {
11037 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
11038 (bool)!!HvSHAREKEYS(sstr),
11042 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
11043 (bool)!!HvSHAREKEYS(sstr), param);
11046 SvPV_set(dstr, Nullch);
11047 HvEITER((HV*)dstr) = (HE*)NULL;
11049 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
11050 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
11051 /* Record stashes for possible cloning in Perl_clone(). */
11052 if(HvNAME((HV*)dstr))
11053 av_push(param->stashes, dstr);
11056 SvANY(dstr) = new_XPVFM();
11057 FmLINES(dstr) = FmLINES(sstr);
11061 SvANY(dstr) = new_XPVCV();
11063 SvCUR_set(dstr, SvCUR(sstr));
11064 SvLEN_set(dstr, SvLEN(sstr));
11065 SvIV_set(dstr, SvIVX(sstr));
11066 SvNV_set(dstr, SvNVX(sstr));
11067 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
11068 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
11069 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
11070 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
11071 CvSTART(dstr) = CvSTART(sstr);
11073 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
11075 CvXSUB(dstr) = CvXSUB(sstr);
11076 CvXSUBANY(dstr) = CvXSUBANY(sstr);
11077 if (CvCONST(sstr)) {
11078 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
11079 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
11080 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
11082 /* don't dup if copying back - CvGV isn't refcounted, so the
11083 * duped GV may never be freed. A bit of a hack! DAPM */
11084 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
11085 Nullgv : gv_dup(CvGV(sstr), param) ;
11086 if (param->flags & CLONEf_COPY_STACKS) {
11087 CvDEPTH(dstr) = CvDEPTH(sstr);
11091 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
11092 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
11094 CvWEAKOUTSIDE(sstr)
11095 ? cv_dup( CvOUTSIDE(sstr), param)
11096 : cv_dup_inc(CvOUTSIDE(sstr), param);
11097 CvFLAGS(dstr) = CvFLAGS(sstr);
11098 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
11101 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
11105 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
11111 /* duplicate a context */
11114 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
11116 PERL_CONTEXT *ncxs;
11119 return (PERL_CONTEXT*)NULL;
11121 /* look for it in the table first */
11122 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
11126 /* create anew and remember what it is */
11127 Newz(56, ncxs, max + 1, PERL_CONTEXT);
11128 ptr_table_store(PL_ptr_table, cxs, ncxs);
11131 PERL_CONTEXT *cx = &cxs[ix];
11132 PERL_CONTEXT *ncx = &ncxs[ix];
11133 ncx->cx_type = cx->cx_type;
11134 if (CxTYPE(cx) == CXt_SUBST) {
11135 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
11138 ncx->blk_oldsp = cx->blk_oldsp;
11139 ncx->blk_oldcop = cx->blk_oldcop;
11140 ncx->blk_oldmarksp = cx->blk_oldmarksp;
11141 ncx->blk_oldscopesp = cx->blk_oldscopesp;
11142 ncx->blk_oldpm = cx->blk_oldpm;
11143 ncx->blk_gimme = cx->blk_gimme;
11144 switch (CxTYPE(cx)) {
11146 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
11147 ? cv_dup_inc(cx->blk_sub.cv, param)
11148 : cv_dup(cx->blk_sub.cv,param));
11149 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
11150 ? av_dup_inc(cx->blk_sub.argarray, param)
11152 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
11153 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
11154 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11155 ncx->blk_sub.lval = cx->blk_sub.lval;
11156 ncx->blk_sub.retop = cx->blk_sub.retop;
11159 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
11160 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
11161 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
11162 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
11163 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
11164 ncx->blk_eval.retop = cx->blk_eval.retop;
11167 ncx->blk_loop.label = cx->blk_loop.label;
11168 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
11169 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
11170 ncx->blk_loop.next_op = cx->blk_loop.next_op;
11171 ncx->blk_loop.last_op = cx->blk_loop.last_op;
11172 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
11173 ? cx->blk_loop.iterdata
11174 : gv_dup((GV*)cx->blk_loop.iterdata, param));
11175 ncx->blk_loop.oldcomppad
11176 = (PAD*)ptr_table_fetch(PL_ptr_table,
11177 cx->blk_loop.oldcomppad);
11178 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
11179 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
11180 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
11181 ncx->blk_loop.iterix = cx->blk_loop.iterix;
11182 ncx->blk_loop.itermax = cx->blk_loop.itermax;
11185 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
11186 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
11187 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
11188 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
11189 ncx->blk_sub.retop = cx->blk_sub.retop;
11201 /* duplicate a stack info structure */
11204 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
11209 return (PERL_SI*)NULL;
11211 /* look for it in the table first */
11212 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
11216 /* create anew and remember what it is */
11217 Newz(56, nsi, 1, PERL_SI);
11218 ptr_table_store(PL_ptr_table, si, nsi);
11220 nsi->si_stack = av_dup_inc(si->si_stack, param);
11221 nsi->si_cxix = si->si_cxix;
11222 nsi->si_cxmax = si->si_cxmax;
11223 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
11224 nsi->si_type = si->si_type;
11225 nsi->si_prev = si_dup(si->si_prev, param);
11226 nsi->si_next = si_dup(si->si_next, param);
11227 nsi->si_markoff = si->si_markoff;
11232 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
11233 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
11234 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
11235 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
11236 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
11237 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
11238 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
11239 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
11240 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
11241 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
11242 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
11243 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
11244 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
11245 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
11248 #define pv_dup_inc(p) SAVEPV(p)
11249 #define pv_dup(p) SAVEPV(p)
11250 #define svp_dup_inc(p,pp) any_dup(p,pp)
11252 /* map any object to the new equivent - either something in the
11253 * ptr table, or something in the interpreter structure
11257 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
11262 return (void*)NULL;
11264 /* look for it in the table first */
11265 ret = ptr_table_fetch(PL_ptr_table, v);
11269 /* see if it is part of the interpreter structure */
11270 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
11271 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
11279 /* duplicate the save stack */
11282 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
11284 ANY *ss = proto_perl->Tsavestack;
11285 I32 ix = proto_perl->Tsavestack_ix;
11286 I32 max = proto_perl->Tsavestack_max;
11299 void (*dptr) (void*);
11300 void (*dxptr) (pTHX_ void*);
11303 Newz(54, nss, max, ANY);
11307 TOPINT(nss,ix) = i;
11309 case SAVEt_ITEM: /* normal string */
11310 sv = (SV*)POPPTR(ss,ix);
11311 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11312 sv = (SV*)POPPTR(ss,ix);
11313 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11315 case SAVEt_SV: /* scalar reference */
11316 sv = (SV*)POPPTR(ss,ix);
11317 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11318 gv = (GV*)POPPTR(ss,ix);
11319 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11321 case SAVEt_GENERIC_PVREF: /* generic char* */
11322 c = (char*)POPPTR(ss,ix);
11323 TOPPTR(nss,ix) = pv_dup(c);
11324 ptr = POPPTR(ss,ix);
11325 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11327 case SAVEt_SHARED_PVREF: /* char* in shared space */
11328 c = (char*)POPPTR(ss,ix);
11329 TOPPTR(nss,ix) = savesharedpv(c);
11330 ptr = POPPTR(ss,ix);
11331 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11333 case SAVEt_GENERIC_SVREF: /* generic sv */
11334 case SAVEt_SVREF: /* scalar reference */
11335 sv = (SV*)POPPTR(ss,ix);
11336 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11337 ptr = POPPTR(ss,ix);
11338 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
11340 case SAVEt_AV: /* array reference */
11341 av = (AV*)POPPTR(ss,ix);
11342 TOPPTR(nss,ix) = av_dup_inc(av, param);
11343 gv = (GV*)POPPTR(ss,ix);
11344 TOPPTR(nss,ix) = gv_dup(gv, param);
11346 case SAVEt_HV: /* hash reference */
11347 hv = (HV*)POPPTR(ss,ix);
11348 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11349 gv = (GV*)POPPTR(ss,ix);
11350 TOPPTR(nss,ix) = gv_dup(gv, param);
11352 case SAVEt_INT: /* int reference */
11353 ptr = POPPTR(ss,ix);
11354 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11355 intval = (int)POPINT(ss,ix);
11356 TOPINT(nss,ix) = intval;
11358 case SAVEt_LONG: /* long reference */
11359 ptr = POPPTR(ss,ix);
11360 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11361 longval = (long)POPLONG(ss,ix);
11362 TOPLONG(nss,ix) = longval;
11364 case SAVEt_I32: /* I32 reference */
11365 case SAVEt_I16: /* I16 reference */
11366 case SAVEt_I8: /* I8 reference */
11367 ptr = POPPTR(ss,ix);
11368 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11370 TOPINT(nss,ix) = i;
11372 case SAVEt_IV: /* IV reference */
11373 ptr = POPPTR(ss,ix);
11374 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11376 TOPIV(nss,ix) = iv;
11378 case SAVEt_SPTR: /* SV* reference */
11379 ptr = POPPTR(ss,ix);
11380 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11381 sv = (SV*)POPPTR(ss,ix);
11382 TOPPTR(nss,ix) = sv_dup(sv, param);
11384 case SAVEt_VPTR: /* random* reference */
11385 ptr = POPPTR(ss,ix);
11386 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11387 ptr = POPPTR(ss,ix);
11388 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11390 case SAVEt_PPTR: /* char* reference */
11391 ptr = POPPTR(ss,ix);
11392 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11393 c = (char*)POPPTR(ss,ix);
11394 TOPPTR(nss,ix) = pv_dup(c);
11396 case SAVEt_HPTR: /* HV* reference */
11397 ptr = POPPTR(ss,ix);
11398 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11399 hv = (HV*)POPPTR(ss,ix);
11400 TOPPTR(nss,ix) = hv_dup(hv, param);
11402 case SAVEt_APTR: /* AV* reference */
11403 ptr = POPPTR(ss,ix);
11404 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11405 av = (AV*)POPPTR(ss,ix);
11406 TOPPTR(nss,ix) = av_dup(av, param);
11409 gv = (GV*)POPPTR(ss,ix);
11410 TOPPTR(nss,ix) = gv_dup(gv, param);
11412 case SAVEt_GP: /* scalar reference */
11413 gp = (GP*)POPPTR(ss,ix);
11414 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
11415 (void)GpREFCNT_inc(gp);
11416 gv = (GV*)POPPTR(ss,ix);
11417 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11418 c = (char*)POPPTR(ss,ix);
11419 TOPPTR(nss,ix) = pv_dup(c);
11421 TOPIV(nss,ix) = iv;
11423 TOPIV(nss,ix) = iv;
11426 case SAVEt_MORTALIZESV:
11427 sv = (SV*)POPPTR(ss,ix);
11428 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11431 ptr = POPPTR(ss,ix);
11432 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11433 /* these are assumed to be refcounted properly */
11434 switch (((OP*)ptr)->op_type) {
11436 case OP_LEAVESUBLV:
11440 case OP_LEAVEWRITE:
11441 TOPPTR(nss,ix) = ptr;
11446 TOPPTR(nss,ix) = Nullop;
11451 TOPPTR(nss,ix) = Nullop;
11454 c = (char*)POPPTR(ss,ix);
11455 TOPPTR(nss,ix) = pv_dup_inc(c);
11457 case SAVEt_CLEARSV:
11458 longval = POPLONG(ss,ix);
11459 TOPLONG(nss,ix) = longval;
11462 hv = (HV*)POPPTR(ss,ix);
11463 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11464 c = (char*)POPPTR(ss,ix);
11465 TOPPTR(nss,ix) = pv_dup_inc(c);
11467 TOPINT(nss,ix) = i;
11469 case SAVEt_DESTRUCTOR:
11470 ptr = POPPTR(ss,ix);
11471 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11472 dptr = POPDPTR(ss,ix);
11473 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
11475 case SAVEt_DESTRUCTOR_X:
11476 ptr = POPPTR(ss,ix);
11477 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11478 dxptr = POPDXPTR(ss,ix);
11479 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
11481 case SAVEt_REGCONTEXT:
11484 TOPINT(nss,ix) = i;
11487 case SAVEt_STACK_POS: /* Position on Perl stack */
11489 TOPINT(nss,ix) = i;
11491 case SAVEt_AELEM: /* array element */
11492 sv = (SV*)POPPTR(ss,ix);
11493 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11495 TOPINT(nss,ix) = i;
11496 av = (AV*)POPPTR(ss,ix);
11497 TOPPTR(nss,ix) = av_dup_inc(av, param);
11499 case SAVEt_HELEM: /* hash element */
11500 sv = (SV*)POPPTR(ss,ix);
11501 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11502 sv = (SV*)POPPTR(ss,ix);
11503 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11504 hv = (HV*)POPPTR(ss,ix);
11505 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11508 ptr = POPPTR(ss,ix);
11509 TOPPTR(nss,ix) = ptr;
11513 TOPINT(nss,ix) = i;
11515 case SAVEt_COMPPAD:
11516 av = (AV*)POPPTR(ss,ix);
11517 TOPPTR(nss,ix) = av_dup(av, param);
11520 longval = (long)POPLONG(ss,ix);
11521 TOPLONG(nss,ix) = longval;
11522 ptr = POPPTR(ss,ix);
11523 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11524 sv = (SV*)POPPTR(ss,ix);
11525 TOPPTR(nss,ix) = sv_dup(sv, param);
11528 ptr = POPPTR(ss,ix);
11529 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11530 longval = (long)POPBOOL(ss,ix);
11531 TOPBOOL(nss,ix) = (bool)longval;
11533 case SAVEt_SET_SVFLAGS:
11535 TOPINT(nss,ix) = i;
11537 TOPINT(nss,ix) = i;
11538 sv = (SV*)POPPTR(ss,ix);
11539 TOPPTR(nss,ix) = sv_dup(sv, param);
11542 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11550 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11551 * flag to the result. This is done for each stash before cloning starts,
11552 * so we know which stashes want their objects cloned */
11555 do_mark_cloneable_stash(pTHX_ SV *sv)
11557 if (HvNAME((HV*)sv)) {
11558 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11559 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11560 if (cloner && GvCV(cloner)) {
11567 XPUSHs(sv_2mortal(newSVpv(HvNAME((HV*)sv), 0)));
11569 call_sv((SV*)GvCV(cloner), G_SCALAR);
11576 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11584 =for apidoc perl_clone
11586 Create and return a new interpreter by cloning the current one.
11588 perl_clone takes these flags as parameters:
11590 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11591 without it we only clone the data and zero the stacks,
11592 with it we copy the stacks and the new perl interpreter is
11593 ready to run at the exact same point as the previous one.
11594 The pseudo-fork code uses COPY_STACKS while the
11595 threads->new doesn't.
11597 CLONEf_KEEP_PTR_TABLE
11598 perl_clone keeps a ptr_table with the pointer of the old
11599 variable as a key and the new variable as a value,
11600 this allows it to check if something has been cloned and not
11601 clone it again but rather just use the value and increase the
11602 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11603 the ptr_table using the function
11604 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11605 reason to keep it around is if you want to dup some of your own
11606 variable who are outside the graph perl scans, example of this
11607 code is in threads.xs create
11610 This is a win32 thing, it is ignored on unix, it tells perls
11611 win32host code (which is c++) to clone itself, this is needed on
11612 win32 if you want to run two threads at the same time,
11613 if you just want to do some stuff in a separate perl interpreter
11614 and then throw it away and return to the original one,
11615 you don't need to do anything.
11620 /* XXX the above needs expanding by someone who actually understands it ! */
11621 EXTERN_C PerlInterpreter *
11622 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11625 perl_clone(PerlInterpreter *proto_perl, UV flags)
11628 #ifdef PERL_IMPLICIT_SYS
11630 /* perlhost.h so we need to call into it
11631 to clone the host, CPerlHost should have a c interface, sky */
11633 if (flags & CLONEf_CLONE_HOST) {
11634 return perl_clone_host(proto_perl,flags);
11636 return perl_clone_using(proto_perl, flags,
11638 proto_perl->IMemShared,
11639 proto_perl->IMemParse,
11641 proto_perl->IStdIO,
11645 proto_perl->IProc);
11649 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11650 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11651 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11652 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11653 struct IPerlDir* ipD, struct IPerlSock* ipS,
11654 struct IPerlProc* ipP)
11656 /* XXX many of the string copies here can be optimized if they're
11657 * constants; they need to be allocated as common memory and just
11658 * their pointers copied. */
11661 CLONE_PARAMS clone_params;
11662 CLONE_PARAMS* param = &clone_params;
11664 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11665 /* for each stash, determine whether its objects should be cloned */
11666 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11667 PERL_SET_THX(my_perl);
11670 Poison(my_perl, 1, PerlInterpreter);
11672 PL_curcop = (COP *)Nullop;
11676 PL_savestack_ix = 0;
11677 PL_savestack_max = -1;
11678 PL_sig_pending = 0;
11679 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11680 # else /* !DEBUGGING */
11681 Zero(my_perl, 1, PerlInterpreter);
11682 # endif /* DEBUGGING */
11684 /* host pointers */
11686 PL_MemShared = ipMS;
11687 PL_MemParse = ipMP;
11694 #else /* !PERL_IMPLICIT_SYS */
11696 CLONE_PARAMS clone_params;
11697 CLONE_PARAMS* param = &clone_params;
11698 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11699 /* for each stash, determine whether its objects should be cloned */
11700 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11701 PERL_SET_THX(my_perl);
11704 Poison(my_perl, 1, PerlInterpreter);
11706 PL_curcop = (COP *)Nullop;
11710 PL_savestack_ix = 0;
11711 PL_savestack_max = -1;
11712 PL_sig_pending = 0;
11713 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11714 # else /* !DEBUGGING */
11715 Zero(my_perl, 1, PerlInterpreter);
11716 # endif /* DEBUGGING */
11717 #endif /* PERL_IMPLICIT_SYS */
11718 param->flags = flags;
11719 param->proto_perl = proto_perl;
11722 PL_xiv_arenaroot = NULL;
11723 PL_xiv_root = NULL;
11724 PL_xnv_arenaroot = NULL;
11725 PL_xnv_root = NULL;
11726 PL_xrv_arenaroot = NULL;
11727 PL_xrv_root = NULL;
11728 PL_xpv_arenaroot = NULL;
11729 PL_xpv_root = NULL;
11730 PL_xpviv_arenaroot = NULL;
11731 PL_xpviv_root = NULL;
11732 PL_xpvnv_arenaroot = NULL;
11733 PL_xpvnv_root = NULL;
11734 PL_xpvcv_arenaroot = NULL;
11735 PL_xpvcv_root = NULL;
11736 PL_xpvav_arenaroot = NULL;
11737 PL_xpvav_root = NULL;
11738 PL_xpvhv_arenaroot = NULL;
11739 PL_xpvhv_root = NULL;
11740 PL_xpvmg_arenaroot = NULL;
11741 PL_xpvmg_root = NULL;
11742 PL_xpvlv_arenaroot = NULL;
11743 PL_xpvlv_root = NULL;
11744 PL_xpvbm_arenaroot = NULL;
11745 PL_xpvbm_root = NULL;
11746 PL_he_arenaroot = NULL;
11748 #if defined(USE_ITHREADS)
11749 PL_pte_arenaroot = NULL;
11750 PL_pte_root = NULL;
11752 PL_nice_chunk = NULL;
11753 PL_nice_chunk_size = 0;
11755 PL_sv_objcount = 0;
11756 PL_sv_root = Nullsv;
11757 PL_sv_arenaroot = Nullsv;
11759 PL_debug = proto_perl->Idebug;
11761 #ifdef USE_REENTRANT_API
11762 /* XXX: things like -Dm will segfault here in perlio, but doing
11763 * PERL_SET_CONTEXT(proto_perl);
11764 * breaks too many other things
11766 Perl_reentrant_init(aTHX);
11769 /* create SV map for pointer relocation */
11770 PL_ptr_table = ptr_table_new();
11772 /* initialize these special pointers as early as possible */
11773 SvANY(&PL_sv_undef) = NULL;
11774 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11775 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11776 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11778 SvANY(&PL_sv_no) = new_XPVNV();
11779 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11780 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11781 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11782 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11783 SvCUR_set(&PL_sv_no, 0);
11784 SvLEN_set(&PL_sv_no, 1);
11785 SvIV_set(&PL_sv_no, 0);
11786 SvNV_set(&PL_sv_no, 0);
11787 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11789 SvANY(&PL_sv_yes) = new_XPVNV();
11790 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11791 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11792 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11793 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11794 SvCUR_set(&PL_sv_yes, 1);
11795 SvLEN_set(&PL_sv_yes, 2);
11796 SvIV_set(&PL_sv_yes, 1);
11797 SvNV_set(&PL_sv_yes, 1);
11798 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11800 /* create (a non-shared!) shared string table */
11801 PL_strtab = newHV();
11802 HvSHAREKEYS_off(PL_strtab);
11803 hv_ksplit(PL_strtab, 512);
11804 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11806 PL_compiling = proto_perl->Icompiling;
11808 /* These two PVs will be free'd special way so must set them same way op.c does */
11809 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11810 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11812 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11813 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11815 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11816 if (!specialWARN(PL_compiling.cop_warnings))
11817 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11818 if (!specialCopIO(PL_compiling.cop_io))
11819 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11820 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11822 /* pseudo environmental stuff */
11823 PL_origargc = proto_perl->Iorigargc;
11824 PL_origargv = proto_perl->Iorigargv;
11826 param->stashes = newAV(); /* Setup array of objects to call clone on */
11828 #ifdef PERLIO_LAYERS
11829 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11830 PerlIO_clone(aTHX_ proto_perl, param);
11833 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11834 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11835 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11836 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11837 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11838 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11841 PL_minus_c = proto_perl->Iminus_c;
11842 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11843 PL_localpatches = proto_perl->Ilocalpatches;
11844 PL_splitstr = proto_perl->Isplitstr;
11845 PL_preprocess = proto_perl->Ipreprocess;
11846 PL_minus_n = proto_perl->Iminus_n;
11847 PL_minus_p = proto_perl->Iminus_p;
11848 PL_minus_l = proto_perl->Iminus_l;
11849 PL_minus_a = proto_perl->Iminus_a;
11850 PL_minus_F = proto_perl->Iminus_F;
11851 PL_doswitches = proto_perl->Idoswitches;
11852 PL_dowarn = proto_perl->Idowarn;
11853 PL_doextract = proto_perl->Idoextract;
11854 PL_sawampersand = proto_perl->Isawampersand;
11855 PL_unsafe = proto_perl->Iunsafe;
11856 PL_inplace = SAVEPV(proto_perl->Iinplace);
11857 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11858 PL_perldb = proto_perl->Iperldb;
11859 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11860 PL_exit_flags = proto_perl->Iexit_flags;
11862 /* magical thingies */
11863 /* XXX time(&PL_basetime) when asked for? */
11864 PL_basetime = proto_perl->Ibasetime;
11865 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11867 PL_maxsysfd = proto_perl->Imaxsysfd;
11868 PL_multiline = proto_perl->Imultiline;
11869 PL_statusvalue = proto_perl->Istatusvalue;
11871 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11873 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11875 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11876 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11877 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11879 /* Clone the regex array */
11880 PL_regex_padav = newAV();
11882 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11883 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11884 av_push(PL_regex_padav,
11885 sv_dup_inc(regexen[0],param));
11886 for(i = 1; i <= len; i++) {
11887 if(SvREPADTMP(regexen[i])) {
11888 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11890 av_push(PL_regex_padav,
11892 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11893 SvIVX(regexen[i])), param)))
11898 PL_regex_pad = AvARRAY(PL_regex_padav);
11900 /* shortcuts to various I/O objects */
11901 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11902 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11903 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11904 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11905 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11906 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11908 /* shortcuts to regexp stuff */
11909 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11911 /* shortcuts to misc objects */
11912 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11914 /* shortcuts to debugging objects */
11915 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11916 PL_DBline = gv_dup(proto_perl->IDBline, param);
11917 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11918 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11919 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11920 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11921 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11922 PL_lineary = av_dup(proto_perl->Ilineary, param);
11923 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11925 /* symbol tables */
11926 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11927 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11928 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11929 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11930 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11932 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11933 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11934 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11935 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11936 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11937 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11939 PL_sub_generation = proto_perl->Isub_generation;
11941 /* funky return mechanisms */
11942 PL_forkprocess = proto_perl->Iforkprocess;
11944 /* subprocess state */
11945 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11947 /* internal state */
11948 PL_tainting = proto_perl->Itainting;
11949 PL_taint_warn = proto_perl->Itaint_warn;
11950 PL_maxo = proto_perl->Imaxo;
11951 if (proto_perl->Iop_mask)
11952 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11954 PL_op_mask = Nullch;
11955 /* PL_asserting = proto_perl->Iasserting; */
11957 /* current interpreter roots */
11958 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11959 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11960 PL_main_start = proto_perl->Imain_start;
11961 PL_eval_root = proto_perl->Ieval_root;
11962 PL_eval_start = proto_perl->Ieval_start;
11964 /* runtime control stuff */
11965 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11966 PL_copline = proto_perl->Icopline;
11968 PL_filemode = proto_perl->Ifilemode;
11969 PL_lastfd = proto_perl->Ilastfd;
11970 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11973 PL_gensym = proto_perl->Igensym;
11974 PL_preambled = proto_perl->Ipreambled;
11975 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11976 PL_laststatval = proto_perl->Ilaststatval;
11977 PL_laststype = proto_perl->Ilaststype;
11978 PL_mess_sv = Nullsv;
11980 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11981 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11983 /* interpreter atexit processing */
11984 PL_exitlistlen = proto_perl->Iexitlistlen;
11985 if (PL_exitlistlen) {
11986 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11987 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11990 PL_exitlist = (PerlExitListEntry*)NULL;
11991 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11992 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11993 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11995 PL_profiledata = NULL;
11996 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11997 /* PL_rsfp_filters entries have fake IoDIRP() */
11998 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
12000 PL_compcv = cv_dup(proto_perl->Icompcv, param);
12002 PAD_CLONE_VARS(proto_perl, param);
12004 #ifdef HAVE_INTERP_INTERN
12005 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
12008 /* more statics moved here */
12009 PL_generation = proto_perl->Igeneration;
12010 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
12012 PL_in_clean_objs = proto_perl->Iin_clean_objs;
12013 PL_in_clean_all = proto_perl->Iin_clean_all;
12015 PL_uid = proto_perl->Iuid;
12016 PL_euid = proto_perl->Ieuid;
12017 PL_gid = proto_perl->Igid;
12018 PL_egid = proto_perl->Iegid;
12019 PL_nomemok = proto_perl->Inomemok;
12020 PL_an = proto_perl->Ian;
12021 PL_evalseq = proto_perl->Ievalseq;
12022 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
12023 PL_origalen = proto_perl->Iorigalen;
12024 PL_pidstatus = newHV(); /* XXX flag for cloning? */
12025 PL_osname = SAVEPV(proto_perl->Iosname);
12026 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
12027 PL_sighandlerp = proto_perl->Isighandlerp;
12030 PL_runops = proto_perl->Irunops;
12032 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
12035 PL_cshlen = proto_perl->Icshlen;
12036 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
12039 PL_lex_state = proto_perl->Ilex_state;
12040 PL_lex_defer = proto_perl->Ilex_defer;
12041 PL_lex_expect = proto_perl->Ilex_expect;
12042 PL_lex_formbrack = proto_perl->Ilex_formbrack;
12043 PL_lex_dojoin = proto_perl->Ilex_dojoin;
12044 PL_lex_starts = proto_perl->Ilex_starts;
12045 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
12046 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
12047 PL_lex_op = proto_perl->Ilex_op;
12048 PL_lex_inpat = proto_perl->Ilex_inpat;
12049 PL_lex_inwhat = proto_perl->Ilex_inwhat;
12050 PL_lex_brackets = proto_perl->Ilex_brackets;
12051 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
12052 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
12053 PL_lex_casemods = proto_perl->Ilex_casemods;
12054 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
12055 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
12057 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
12058 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
12059 PL_nexttoke = proto_perl->Inexttoke;
12061 /* XXX This is probably masking the deeper issue of why
12062 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
12063 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
12064 * (A little debugging with a watchpoint on it may help.)
12066 if (SvANY(proto_perl->Ilinestr)) {
12067 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
12068 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
12069 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12070 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
12071 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12072 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
12073 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12074 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
12075 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12078 PL_linestr = NEWSV(65,79);
12079 sv_upgrade(PL_linestr,SVt_PVIV);
12080 sv_setpvn(PL_linestr,"",0);
12081 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
12083 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
12084 PL_pending_ident = proto_perl->Ipending_ident;
12085 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
12087 PL_expect = proto_perl->Iexpect;
12089 PL_multi_start = proto_perl->Imulti_start;
12090 PL_multi_end = proto_perl->Imulti_end;
12091 PL_multi_open = proto_perl->Imulti_open;
12092 PL_multi_close = proto_perl->Imulti_close;
12094 PL_error_count = proto_perl->Ierror_count;
12095 PL_subline = proto_perl->Isubline;
12096 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
12098 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
12099 if (SvANY(proto_perl->Ilinestr)) {
12100 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
12101 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12102 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
12103 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
12104 PL_last_lop_op = proto_perl->Ilast_lop_op;
12107 PL_last_uni = SvPVX(PL_linestr);
12108 PL_last_lop = SvPVX(PL_linestr);
12109 PL_last_lop_op = 0;
12111 PL_in_my = proto_perl->Iin_my;
12112 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
12114 PL_cryptseen = proto_perl->Icryptseen;
12117 PL_hints = proto_perl->Ihints;
12119 PL_amagic_generation = proto_perl->Iamagic_generation;
12121 #ifdef USE_LOCALE_COLLATE
12122 PL_collation_ix = proto_perl->Icollation_ix;
12123 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
12124 PL_collation_standard = proto_perl->Icollation_standard;
12125 PL_collxfrm_base = proto_perl->Icollxfrm_base;
12126 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
12127 #endif /* USE_LOCALE_COLLATE */
12129 #ifdef USE_LOCALE_NUMERIC
12130 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
12131 PL_numeric_standard = proto_perl->Inumeric_standard;
12132 PL_numeric_local = proto_perl->Inumeric_local;
12133 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
12134 #endif /* !USE_LOCALE_NUMERIC */
12136 /* utf8 character classes */
12137 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
12138 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
12139 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
12140 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
12141 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
12142 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
12143 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
12144 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
12145 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
12146 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
12147 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
12148 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
12149 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
12150 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
12151 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
12152 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
12153 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
12154 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
12155 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
12156 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
12158 /* Did the locale setup indicate UTF-8? */
12159 PL_utf8locale = proto_perl->Iutf8locale;
12160 /* Unicode features (see perlrun/-C) */
12161 PL_unicode = proto_perl->Iunicode;
12163 /* Pre-5.8 signals control */
12164 PL_signals = proto_perl->Isignals;
12166 /* times() ticks per second */
12167 PL_clocktick = proto_perl->Iclocktick;
12169 /* Recursion stopper for PerlIO_find_layer */
12170 PL_in_load_module = proto_perl->Iin_load_module;
12172 /* sort() routine */
12173 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
12175 /* Not really needed/useful since the reenrant_retint is "volatile",
12176 * but do it for consistency's sake. */
12177 PL_reentrant_retint = proto_perl->Ireentrant_retint;
12179 /* Hooks to shared SVs and locks. */
12180 PL_sharehook = proto_perl->Isharehook;
12181 PL_lockhook = proto_perl->Ilockhook;
12182 PL_unlockhook = proto_perl->Iunlockhook;
12183 PL_threadhook = proto_perl->Ithreadhook;
12185 PL_runops_std = proto_perl->Irunops_std;
12186 PL_runops_dbg = proto_perl->Irunops_dbg;
12188 #ifdef THREADS_HAVE_PIDS
12189 PL_ppid = proto_perl->Ippid;
12193 PL_last_swash_hv = Nullhv; /* reinits on demand */
12194 PL_last_swash_klen = 0;
12195 PL_last_swash_key[0]= '\0';
12196 PL_last_swash_tmps = (U8*)NULL;
12197 PL_last_swash_slen = 0;
12199 PL_glob_index = proto_perl->Iglob_index;
12200 PL_srand_called = proto_perl->Isrand_called;
12201 PL_hash_seed = proto_perl->Ihash_seed;
12202 PL_rehash_seed = proto_perl->Irehash_seed;
12203 PL_uudmap['M'] = 0; /* reinits on demand */
12204 PL_bitcount = Nullch; /* reinits on demand */
12206 if (proto_perl->Ipsig_pend) {
12207 Newz(0, PL_psig_pend, SIG_SIZE, int);
12210 PL_psig_pend = (int*)NULL;
12213 if (proto_perl->Ipsig_ptr) {
12214 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
12215 Newz(0, PL_psig_name, SIG_SIZE, SV*);
12216 for (i = 1; i < SIG_SIZE; i++) {
12217 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
12218 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
12222 PL_psig_ptr = (SV**)NULL;
12223 PL_psig_name = (SV**)NULL;
12226 /* thrdvar.h stuff */
12228 if (flags & CLONEf_COPY_STACKS) {
12229 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
12230 PL_tmps_ix = proto_perl->Ttmps_ix;
12231 PL_tmps_max = proto_perl->Ttmps_max;
12232 PL_tmps_floor = proto_perl->Ttmps_floor;
12233 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
12235 while (i <= PL_tmps_ix) {
12236 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
12240 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
12241 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
12242 Newz(54, PL_markstack, i, I32);
12243 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
12244 - proto_perl->Tmarkstack);
12245 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
12246 - proto_perl->Tmarkstack);
12247 Copy(proto_perl->Tmarkstack, PL_markstack,
12248 PL_markstack_ptr - PL_markstack + 1, I32);
12250 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
12251 * NOTE: unlike the others! */
12252 PL_scopestack_ix = proto_perl->Tscopestack_ix;
12253 PL_scopestack_max = proto_perl->Tscopestack_max;
12254 Newz(54, PL_scopestack, PL_scopestack_max, I32);
12255 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
12257 /* NOTE: si_dup() looks at PL_markstack */
12258 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
12260 /* PL_curstack = PL_curstackinfo->si_stack; */
12261 PL_curstack = av_dup(proto_perl->Tcurstack, param);
12262 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
12264 /* next PUSHs() etc. set *(PL_stack_sp+1) */
12265 PL_stack_base = AvARRAY(PL_curstack);
12266 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
12267 - proto_perl->Tstack_base);
12268 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
12270 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
12271 * NOTE: unlike the others! */
12272 PL_savestack_ix = proto_perl->Tsavestack_ix;
12273 PL_savestack_max = proto_perl->Tsavestack_max;
12274 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
12275 PL_savestack = ss_dup(proto_perl, param);
12279 ENTER; /* perl_destruct() wants to LEAVE; */
12282 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
12283 PL_top_env = &PL_start_env;
12285 PL_op = proto_perl->Top;
12288 PL_Xpv = (XPV*)NULL;
12289 PL_na = proto_perl->Tna;
12291 PL_statbuf = proto_perl->Tstatbuf;
12292 PL_statcache = proto_perl->Tstatcache;
12293 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
12294 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
12296 PL_timesbuf = proto_perl->Ttimesbuf;
12299 PL_tainted = proto_perl->Ttainted;
12300 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
12301 PL_rs = sv_dup_inc(proto_perl->Trs, param);
12302 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
12303 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
12304 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
12305 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
12306 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
12307 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
12308 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
12310 PL_restartop = proto_perl->Trestartop;
12311 PL_in_eval = proto_perl->Tin_eval;
12312 PL_delaymagic = proto_perl->Tdelaymagic;
12313 PL_dirty = proto_perl->Tdirty;
12314 PL_localizing = proto_perl->Tlocalizing;
12316 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
12317 PL_hv_fetch_ent_mh = Nullhe;
12318 PL_modcount = proto_perl->Tmodcount;
12319 PL_lastgotoprobe = Nullop;
12320 PL_dumpindent = proto_perl->Tdumpindent;
12322 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
12323 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
12324 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
12325 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
12326 PL_sortcxix = proto_perl->Tsortcxix;
12327 PL_efloatbuf = Nullch; /* reinits on demand */
12328 PL_efloatsize = 0; /* reinits on demand */
12332 PL_screamfirst = NULL;
12333 PL_screamnext = NULL;
12334 PL_maxscream = -1; /* reinits on demand */
12335 PL_lastscream = Nullsv;
12337 PL_watchaddr = NULL;
12338 PL_watchok = Nullch;
12340 PL_regdummy = proto_perl->Tregdummy;
12341 PL_regprecomp = Nullch;
12344 PL_colorset = 0; /* reinits PL_colors[] */
12345 /*PL_colors[6] = {0,0,0,0,0,0};*/
12346 PL_reginput = Nullch;
12347 PL_regbol = Nullch;
12348 PL_regeol = Nullch;
12349 PL_regstartp = (I32*)NULL;
12350 PL_regendp = (I32*)NULL;
12351 PL_reglastparen = (U32*)NULL;
12352 PL_reglastcloseparen = (U32*)NULL;
12353 PL_regtill = Nullch;
12354 PL_reg_start_tmp = (char**)NULL;
12355 PL_reg_start_tmpl = 0;
12356 PL_regdata = (struct reg_data*)NULL;
12359 PL_reg_eval_set = 0;
12361 PL_regprogram = (regnode*)NULL;
12363 PL_regcc = (CURCUR*)NULL;
12364 PL_reg_call_cc = (struct re_cc_state*)NULL;
12365 PL_reg_re = (regexp*)NULL;
12366 PL_reg_ganch = Nullch;
12367 PL_reg_sv = Nullsv;
12368 PL_reg_match_utf8 = FALSE;
12369 PL_reg_magic = (MAGIC*)NULL;
12371 PL_reg_oldcurpm = (PMOP*)NULL;
12372 PL_reg_curpm = (PMOP*)NULL;
12373 PL_reg_oldsaved = Nullch;
12374 PL_reg_oldsavedlen = 0;
12375 #ifdef PERL_COPY_ON_WRITE
12378 PL_reg_maxiter = 0;
12379 PL_reg_leftiter = 0;
12380 PL_reg_poscache = Nullch;
12381 PL_reg_poscache_size= 0;
12383 /* RE engine - function pointers */
12384 PL_regcompp = proto_perl->Tregcompp;
12385 PL_regexecp = proto_perl->Tregexecp;
12386 PL_regint_start = proto_perl->Tregint_start;
12387 PL_regint_string = proto_perl->Tregint_string;
12388 PL_regfree = proto_perl->Tregfree;
12390 PL_reginterp_cnt = 0;
12391 PL_reg_starttry = 0;
12393 /* Pluggable optimizer */
12394 PL_peepp = proto_perl->Tpeepp;
12396 PL_stashcache = newHV();
12398 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
12399 ptr_table_free(PL_ptr_table);
12400 PL_ptr_table = NULL;
12403 /* Call the ->CLONE method, if it exists, for each of the stashes
12404 identified by sv_dup() above.
12406 while(av_len(param->stashes) != -1) {
12407 HV* stash = (HV*) av_shift(param->stashes);
12408 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
12409 if (cloner && GvCV(cloner)) {
12414 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
12416 call_sv((SV*)GvCV(cloner), G_DISCARD);
12422 SvREFCNT_dec(param->stashes);
12427 #endif /* USE_ITHREADS */
12430 =head1 Unicode Support
12432 =for apidoc sv_recode_to_utf8
12434 The encoding is assumed to be an Encode object, on entry the PV
12435 of the sv is assumed to be octets in that encoding, and the sv
12436 will be converted into Unicode (and UTF-8).
12438 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12439 is not a reference, nothing is done to the sv. If the encoding is not
12440 an C<Encode::XS> Encoding object, bad things will happen.
12441 (See F<lib/encoding.pm> and L<Encode>).
12443 The PV of the sv is returned.
12448 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12451 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12465 Passing sv_yes is wrong - it needs to be or'ed set of constants
12466 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12467 remove converted chars from source.
12469 Both will default the value - let them.
12471 XPUSHs(&PL_sv_yes);
12474 call_method("decode", G_SCALAR);
12478 s = SvPV(uni, len);
12479 if (s != SvPVX(sv)) {
12480 SvGROW(sv, len + 1);
12481 Move(s, SvPVX(sv), len, char);
12482 SvCUR_set(sv, len);
12483 SvPVX(sv)[len] = 0;
12490 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12494 =for apidoc sv_cat_decode
12496 The encoding is assumed to be an Encode object, the PV of the ssv is
12497 assumed to be octets in that encoding and decoding the input starts
12498 from the position which (PV + *offset) pointed to. The dsv will be
12499 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12500 when the string tstr appears in decoding output or the input ends on
12501 the PV of the ssv. The value which the offset points will be modified
12502 to the last input position on the ssv.
12504 Returns TRUE if the terminator was found, else returns FALSE.
12509 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12510 SV *ssv, int *offset, char *tstr, int tlen)
12514 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12525 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12526 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12528 call_method("cat_decode", G_SCALAR);
12530 ret = SvTRUE(TOPs);
12531 *offset = SvIV(offsv);
12537 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12543 * c-indentation-style: bsd
12544 * c-basic-offset: 4
12545 * indent-tabs-mode: t
12548 * ex: set ts=8 sts=4 sw=4 noet: