3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
9 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
12 * This file contains the code that creates, manipulates and destroys
13 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
14 * structure of an SV, so their creation and destruction is handled
15 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
16 * level functions (eg. substr, split, join) for each of the types are
28 /* Missing proto on LynxOS */
29 char *gconvert(double, int, int, char *);
32 #ifdef PERL_UTF8_CACHE_ASSERT
33 /* The cache element 0 is the Unicode offset;
34 * the cache element 1 is the byte offset of the element 0;
35 * the cache element 2 is the Unicode length of the substring;
36 * the cache element 3 is the byte length of the substring;
37 * The checking of the substring side would be good
38 * but substr() has enough code paths to make my head spin;
39 * if adding more checks watch out for the following tests:
40 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
41 * lib/utf8.t lib/Unicode/Collate/t/index.t
44 #define ASSERT_UTF8_CACHE(cache) \
45 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
47 #define ASSERT_UTF8_CACHE(cache) NOOP
50 #ifdef PERL_OLD_COPY_ON_WRITE
51 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
52 #define SV_COW_NEXT_SV_SET(current,next) SvUV_set(current, PTR2UV(next))
53 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
57 /* ============================================================================
59 =head1 Allocation and deallocation of SVs.
61 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
62 av, hv...) contains type and reference count information, as well as a
63 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
64 specific to each type.
66 Normally, this allocation is done using arenas, which by default are
67 approximately 4K chunks of memory parcelled up into N heads or bodies. The
68 first slot in each arena is reserved, and is used to hold a link to the next
69 arena. In the case of heads, the unused first slot also contains some flags
70 and a note of the number of slots. Snaked through each arena chain is a
71 linked list of free items; when this becomes empty, an extra arena is
72 allocated and divided up into N items which are threaded into the free list.
74 The following global variables are associated with arenas:
76 PL_sv_arenaroot pointer to list of SV arenas
77 PL_sv_root pointer to list of free SV structures
79 PL_foo_arenaroot pointer to list of foo arenas,
80 PL_foo_root pointer to list of free foo bodies
81 ... for foo in xiv, xnv, xrv, xpv etc.
83 Note that some of the larger and more rarely used body types (eg xpvio)
84 are not allocated using arenas, but are instead just malloc()/free()ed as
85 required. Also, if PURIFY is defined, arenas are abandoned altogether,
86 with all items individually malloc()ed. In addition, a few SV heads are
87 not allocated from an arena, but are instead directly created as static
88 or auto variables, eg PL_sv_undef. The size of arenas can be changed from
89 the default by setting PERL_ARENA_SIZE appropriately at compile time.
91 The SV arena serves the secondary purpose of allowing still-live SVs
92 to be located and destroyed during final cleanup.
94 At the lowest level, the macros new_SV() and del_SV() grab and free
95 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
96 to return the SV to the free list with error checking.) new_SV() calls
97 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
98 SVs in the free list have their SvTYPE field set to all ones.
100 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
101 that allocate and return individual body types. Normally these are mapped
102 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
103 instead mapped directly to malloc()/free() if PURIFY is defined. The
104 new/del functions remove from, or add to, the appropriate PL_foo_root
105 list, and call more_xiv() etc to add a new arena if the list is empty.
107 At the time of very final cleanup, sv_free_arenas() is called from
108 perl_destruct() to physically free all the arenas allocated since the
109 start of the interpreter. Note that this also clears PL_he_arenaroot,
110 which is otherwise dealt with in hv.c.
112 Manipulation of any of the PL_*root pointers is protected by enclosing
113 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
114 if threads are enabled.
116 The function visit() scans the SV arenas list, and calls a specified
117 function for each SV it finds which is still live - ie which has an SvTYPE
118 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
119 following functions (specified as [function that calls visit()] / [function
120 called by visit() for each SV]):
122 sv_report_used() / do_report_used()
123 dump all remaining SVs (debugging aid)
125 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
126 Attempt to free all objects pointed to by RVs,
127 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
128 try to do the same for all objects indirectly
129 referenced by typeglobs too. Called once from
130 perl_destruct(), prior to calling sv_clean_all()
133 sv_clean_all() / do_clean_all()
134 SvREFCNT_dec(sv) each remaining SV, possibly
135 triggering an sv_free(). It also sets the
136 SVf_BREAK flag on the SV to indicate that the
137 refcnt has been artificially lowered, and thus
138 stopping sv_free() from giving spurious warnings
139 about SVs which unexpectedly have a refcnt
140 of zero. called repeatedly from perl_destruct()
141 until there are no SVs left.
145 Private API to rest of sv.c
149 new_XIV(), del_XIV(),
150 new_XNV(), del_XNV(),
155 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
160 ============================================================================ */
165 * "A time to plant, and a time to uproot what was planted..."
169 #ifdef DEBUG_LEAKING_SCALARS
171 # define FREE_SV_DEBUG_FILE(sv) PerlMemfree((sv)->sv_debug_file)
173 # define FREE_SV_DEBUG_FILE(sv) PerlMemShared_free((sv)->sv_debug_file)
176 # define FREE_SV_DEBUG_FILE(sv)
179 #define plant_SV(p) \
181 FREE_SV_DEBUG_FILE(p); \
182 SvANY(p) = (void *)PL_sv_root; \
183 SvFLAGS(p) = SVTYPEMASK; \
188 /* sv_mutex must be held while calling uproot_SV() */
189 #define uproot_SV(p) \
192 PL_sv_root = (SV*)SvANY(p); \
197 /* make some more SVs by adding another arena */
199 /* sv_mutex must be held while calling more_sv() */
206 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
207 PL_nice_chunk = Nullch;
208 PL_nice_chunk_size = 0;
211 char *chunk; /* must use New here to match call to */
212 New(704,chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
213 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
219 /* new_SV(): return a new, empty SV head */
221 #ifdef DEBUG_LEAKING_SCALARS
222 /* provide a real function for a debugger to play with */
232 sv = S_more_sv(aTHX);
237 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
238 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
239 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
240 sv->sv_debug_inpad = 0;
241 sv->sv_debug_cloned = 0;
243 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
245 sv->sv_debug_file = PL_curcop ? savesharedpv(CopFILE(PL_curcop)): NULL;
250 # define new_SV(p) (p)=S_new_SV(aTHX)
259 (p) = S_more_sv(aTHX); \
268 /* del_SV(): return an empty SV head to the free list */
283 S_del_sv(pTHX_ SV *p)
288 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
290 SV *svend = &sva[SvREFCNT(sva)];
291 if (p >= sv && p < svend) {
297 if (ckWARN_d(WARN_INTERNAL))
298 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
299 "Attempt to free non-arena SV: 0x%"UVxf
300 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
307 #else /* ! DEBUGGING */
309 #define del_SV(p) plant_SV(p)
311 #endif /* DEBUGGING */
315 =head1 SV Manipulation Functions
317 =for apidoc sv_add_arena
319 Given a chunk of memory, link it to the head of the list of arenas,
320 and split it into a list of free SVs.
326 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
332 /* The first SV in an arena isn't an SV. */
333 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
334 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
335 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
337 PL_sv_arenaroot = sva;
338 PL_sv_root = sva + 1;
340 svend = &sva[SvREFCNT(sva) - 1];
343 SvANY(sv) = (void *)(SV*)(sv + 1);
347 /* Must always set typemask because it's awlays checked in on cleanup
348 when the arenas are walked looking for objects. */
349 SvFLAGS(sv) = SVTYPEMASK;
356 SvFLAGS(sv) = SVTYPEMASK;
359 /* visit(): call the named function for each non-free SV in the arenas
360 * whose flags field matches the flags/mask args. */
363 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
368 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
369 register SV * const svend = &sva[SvREFCNT(sva)];
371 for (sv = sva + 1; sv < svend; ++sv) {
372 if (SvTYPE(sv) != SVTYPEMASK
373 && (sv->sv_flags & mask) == flags
386 /* called by sv_report_used() for each live SV */
389 do_report_used(pTHX_ SV *sv)
391 if (SvTYPE(sv) != SVTYPEMASK) {
392 PerlIO_printf(Perl_debug_log, "****\n");
399 =for apidoc sv_report_used
401 Dump the contents of all SVs not yet freed. (Debugging aid).
407 Perl_sv_report_used(pTHX)
410 visit(do_report_used, 0, 0);
414 /* called by sv_clean_objs() for each live SV */
417 do_clean_objs(pTHX_ SV *sv)
421 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
422 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
434 /* XXX Might want to check arrays, etc. */
437 /* called by sv_clean_objs() for each live SV */
439 #ifndef DISABLE_DESTRUCTOR_KLUDGE
441 do_clean_named_objs(pTHX_ SV *sv)
443 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
444 if ( SvOBJECT(GvSV(sv)) ||
445 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
446 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
447 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
448 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
450 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
451 SvFLAGS(sv) |= SVf_BREAK;
459 =for apidoc sv_clean_objs
461 Attempt to destroy all objects not yet freed
467 Perl_sv_clean_objs(pTHX)
469 PL_in_clean_objs = TRUE;
470 visit(do_clean_objs, SVf_ROK, SVf_ROK);
471 #ifndef DISABLE_DESTRUCTOR_KLUDGE
472 /* some barnacles may yet remain, clinging to typeglobs */
473 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
475 PL_in_clean_objs = FALSE;
478 /* called by sv_clean_all() for each live SV */
481 do_clean_all(pTHX_ SV *sv)
483 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
484 SvFLAGS(sv) |= SVf_BREAK;
485 if (PL_comppad == (AV*)sv) {
487 PL_curpad = Null(SV**);
493 =for apidoc sv_clean_all
495 Decrement the refcnt of each remaining SV, possibly triggering a
496 cleanup. This function may have to be called multiple times to free
497 SVs which are in complex self-referential hierarchies.
503 Perl_sv_clean_all(pTHX)
506 PL_in_clean_all = TRUE;
507 cleaned = visit(do_clean_all, 0,0);
508 PL_in_clean_all = FALSE;
513 =for apidoc sv_free_arenas
515 Deallocate the memory used by all arenas. Note that all the individual SV
516 heads and bodies within the arenas must already have been freed.
522 Perl_sv_free_arenas(pTHX)
526 void *arena, *arenanext;
528 void **arenaroots[] = {
529 (void**) &PL_xnv_arenaroot,
530 (void**) &PL_xpv_arenaroot,
531 (void**) &PL_xpviv_arenaroot,
532 (void**) &PL_xpvnv_arenaroot,
533 (void**) &PL_xpvcv_arenaroot,
534 (void**) &PL_xpvav_arenaroot,
535 (void**) &PL_xpvhv_arenaroot,
536 (void**) &PL_xpvmg_arenaroot,
537 (void**) &PL_xpvgv_arenaroot,
538 (void**) &PL_xpvlv_arenaroot,
539 (void**) &PL_xpvbm_arenaroot,
543 (void**) &PL_xnv_root,
544 (void**) &PL_xpv_root,
545 (void**) &PL_xpviv_root,
546 (void**) &PL_xpvnv_root,
547 (void**) &PL_xpvcv_root,
548 (void**) &PL_xpvav_root,
549 (void**) &PL_xpvhv_root,
550 (void**) &PL_xpvmg_root,
551 (void**) &PL_xpvgv_root,
552 (void**) &PL_xpvlv_root,
553 (void**) &PL_xpvbm_root,
557 /* Free arenas here, but be careful about fake ones. (We assume
558 contiguity of the fake ones with the corresponding real ones.) */
560 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
561 svanext = (SV*) SvANY(sva);
562 while (svanext && SvFAKE(svanext))
563 svanext = (SV*) SvANY(svanext);
569 assert(sizeof(arenaroots) == sizeof(roots));
571 for (i=0; arenaroots[i]; i++) {
573 arena = *arenaroots[i];
574 for (; arena; arena = arenanext) {
575 arenanext = *(void **)arena;
585 for (he = PL_he_arenaroot; he; he = he_next) {
586 he_next = HeNEXT(he);
593 #if defined(USE_ITHREADS)
595 struct ptr_tbl_ent *pte;
596 struct ptr_tbl_ent *pte_next;
597 for (pte = PL_pte_arenaroot; pte; pte = pte_next) {
598 pte_next = pte->next;
602 PL_pte_arenaroot = 0;
607 Safefree(PL_nice_chunk);
608 PL_nice_chunk = Nullch;
609 PL_nice_chunk_size = 0;
614 /* ---------------------------------------------------------------------
616 * support functions for report_uninit()
619 /* the maxiumum size of array or hash where we will scan looking
620 * for the undefined element that triggered the warning */
622 #define FUV_MAX_SEARCH_SIZE 1000
624 /* Look for an entry in the hash whose value has the same SV as val;
625 * If so, return a mortal copy of the key. */
628 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
634 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
635 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
640 for (i=HvMAX(hv); i>0; i--) {
642 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
643 if (HeVAL(entry) != val)
645 if ( HeVAL(entry) == &PL_sv_undef ||
646 HeVAL(entry) == &PL_sv_placeholder)
650 if (HeKLEN(entry) == HEf_SVKEY)
651 return sv_mortalcopy(HeKEY_sv(entry));
652 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
658 /* Look for an entry in the array whose value has the same SV as val;
659 * If so, return the index, otherwise return -1. */
662 S_find_array_subscript(pTHX_ AV *av, SV* val)
666 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
667 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
671 for (i=AvFILLp(av); i>=0; i--) {
672 if (svp[i] == val && svp[i] != &PL_sv_undef)
678 /* S_varname(): return the name of a variable, optionally with a subscript.
679 * If gv is non-zero, use the name of that global, along with gvtype (one
680 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
681 * targ. Depending on the value of the subscript_type flag, return:
684 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
685 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
686 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
687 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
690 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
691 SV* keyname, I32 aindex, int subscript_type)
696 SV * const name = sv_newmortal();
699 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
700 * XXX get rid of all this if gv_fullnameX() ever supports this
704 HV *hv = GvSTASH(gv);
705 sv_setpv(name, gvtype);
708 else if (!(p=HvNAME_get(hv)))
710 if (strNE(p, "main")) {
712 sv_catpvn(name,"::", 2);
714 if (GvNAMELEN(gv)>= 1 &&
715 ((unsigned int)*GvNAME(gv)) <= 26)
717 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
718 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
721 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
725 CV *cv = find_runcv(&u);
726 if (!cv || !CvPADLIST(cv))
728 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
729 sv = *av_fetch(av, targ, FALSE);
730 /* SvLEN in a pad name is not to be trusted */
731 sv_setpv(name, SvPV_nolen_const(sv));
734 if (subscript_type == FUV_SUBSCRIPT_HASH) {
737 Perl_sv_catpvf(aTHX_ name, "{%s}",
738 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
741 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
743 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
745 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
746 sv_insert(name, 0, 0, "within ", 7);
753 =for apidoc find_uninit_var
755 Find the name of the undefined variable (if any) that caused the operator o
756 to issue a "Use of uninitialized value" warning.
757 If match is true, only return a name if it's value matches uninit_sv.
758 So roughly speaking, if a unary operator (such as OP_COS) generates a
759 warning, then following the direct child of the op may yield an
760 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
761 other hand, with OP_ADD there are two branches to follow, so we only print
762 the variable name if we get an exact match.
764 The name is returned as a mortal SV.
766 Assumes that PL_op is the op that originally triggered the error, and that
767 PL_comppad/PL_curpad points to the currently executing pad.
773 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
782 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
783 uninit_sv == &PL_sv_placeholder)))
786 switch (obase->op_type) {
793 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
794 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
797 int subscript_type = FUV_SUBSCRIPT_WITHIN;
799 if (pad) { /* @lex, %lex */
800 sv = PAD_SVl(obase->op_targ);
804 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
805 /* @global, %global */
806 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
809 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
811 else /* @{expr}, %{expr} */
812 return find_uninit_var(cUNOPx(obase)->op_first,
816 /* attempt to find a match within the aggregate */
818 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
820 subscript_type = FUV_SUBSCRIPT_HASH;
823 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
825 subscript_type = FUV_SUBSCRIPT_ARRAY;
828 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
831 return S_varname(aTHX_ gv, hash ? "%" : "@", obase->op_targ,
832 keysv, index, subscript_type);
836 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
838 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
839 Nullsv, 0, FUV_SUBSCRIPT_NONE);
842 gv = cGVOPx_gv(obase);
843 if (!gv || (match && GvSV(gv) != uninit_sv))
845 return S_varname(aTHX_ gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
848 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
850 av = (AV*)PAD_SV(obase->op_targ);
851 if (!av || SvRMAGICAL(av))
853 svp = av_fetch(av, (I32)obase->op_private, FALSE);
854 if (!svp || *svp != uninit_sv)
857 return S_varname(aTHX_ Nullgv, "$", obase->op_targ,
858 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
861 gv = cGVOPx_gv(obase);
866 if (!av || SvRMAGICAL(av))
868 svp = av_fetch(av, (I32)obase->op_private, FALSE);
869 if (!svp || *svp != uninit_sv)
872 return S_varname(aTHX_ gv, "$", 0,
873 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
878 o = cUNOPx(obase)->op_first;
879 if (!o || o->op_type != OP_NULL ||
880 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
882 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
887 /* $a[uninit_expr] or $h{uninit_expr} */
888 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
891 o = cBINOPx(obase)->op_first;
892 kid = cBINOPx(obase)->op_last;
894 /* get the av or hv, and optionally the gv */
896 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
897 sv = PAD_SV(o->op_targ);
899 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
900 && cUNOPo->op_first->op_type == OP_GV)
902 gv = cGVOPx_gv(cUNOPo->op_first);
905 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
910 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
911 /* index is constant */
915 if (obase->op_type == OP_HELEM) {
916 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
917 if (!he || HeVAL(he) != uninit_sv)
921 svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
922 if (!svp || *svp != uninit_sv)
926 if (obase->op_type == OP_HELEM)
927 return S_varname(aTHX_ gv, "%", o->op_targ,
928 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
930 return S_varname(aTHX_ gv, "@", o->op_targ, Nullsv,
931 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
935 /* index is an expression;
936 * attempt to find a match within the aggregate */
937 if (obase->op_type == OP_HELEM) {
938 SV *keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
940 return S_varname(aTHX_ gv, "%", o->op_targ,
941 keysv, 0, FUV_SUBSCRIPT_HASH);
944 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
946 return S_varname(aTHX_ gv, "@", o->op_targ,
947 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
951 return S_varname(aTHX_ gv,
952 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
954 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
960 /* only examine RHS */
961 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
964 o = cUNOPx(obase)->op_first;
965 if (o->op_type == OP_PUSHMARK)
968 if (!o->op_sibling) {
969 /* one-arg version of open is highly magical */
971 if (o->op_type == OP_GV) { /* open FOO; */
973 if (match && GvSV(gv) != uninit_sv)
975 return S_varname(aTHX_ gv, "$", 0,
976 Nullsv, 0, FUV_SUBSCRIPT_NONE);
978 /* other possibilities not handled are:
979 * open $x; or open my $x; should return '${*$x}'
980 * open expr; should return '$'.expr ideally
986 /* ops where $_ may be an implicit arg */
990 if ( !(obase->op_flags & OPf_STACKED)) {
991 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
992 ? PAD_SVl(obase->op_targ)
996 sv_setpvn(sv, "$_", 2);
1004 /* skip filehandle as it can't produce 'undef' warning */
1005 o = cUNOPx(obase)->op_first;
1006 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
1007 o = o->op_sibling->op_sibling;
1014 match = 1; /* XS or custom code could trigger random warnings */
1019 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
1020 return sv_2mortal(newSVpv("${$/}", 0));
1025 if (!(obase->op_flags & OPf_KIDS))
1027 o = cUNOPx(obase)->op_first;
1033 /* if all except one arg are constant, or have no side-effects,
1034 * or are optimized away, then it's unambiguous */
1036 for (kid=o; kid; kid = kid->op_sibling) {
1038 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1039 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1040 || (kid->op_type == OP_PUSHMARK)
1044 if (o2) { /* more than one found */
1051 return find_uninit_var(o2, uninit_sv, match);
1055 sv = find_uninit_var(o, uninit_sv, 1);
1067 =for apidoc report_uninit
1069 Print appropriate "Use of uninitialized variable" warning
1075 Perl_report_uninit(pTHX_ SV* uninit_sv)
1078 SV* varname = Nullsv;
1080 varname = find_uninit_var(PL_op, uninit_sv,0);
1082 sv_insert(varname, 0, 0, " ", 1);
1084 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1085 varname ? SvPV_nolen_const(varname) : "",
1086 " in ", OP_DESC(PL_op));
1089 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1094 S_more_bodies (pTHX_ void **arena_root, void **root, size_t size)
1098 size_t count = PERL_ARENA_SIZE/size;
1099 New(0, start, count*size, char);
1100 *((void **) start) = *arena_root;
1101 *arena_root = (void *)start;
1103 end = start + (count-1) * size;
1105 /* The initial slot is used to link the arenas together, so it isn't to be
1106 linked into the list of ready-to-use bodies. */
1110 *root = (void *)start;
1112 while (start < end) {
1113 char *next = start + size;
1114 *(void**) start = (void *)next;
1117 *(void **)start = 0;
1122 /* grab a new thing from the free list, allocating more if necessary */
1125 S_new_body(pTHX_ void **arena_root, void **root, size_t size, size_t offset)
1129 xpv = *root ? *root : S_more_bodies(aTHX_ arena_root, root, size);
1130 *root = *(void**)xpv;
1132 return (void*)((char*)xpv - offset);
1135 /* return a thing to the free list */
1138 S_del_body(pTHX_ void *thing, void **root, size_t offset)
1140 void **real_thing = (void**)((char *)thing + offset);
1142 *real_thing = *root;
1143 *root = (void*)real_thing;
1147 /* Conventionally we simply malloc() a big block of memory, then divide it
1148 up into lots of the thing that we're allocating.
1150 This macro will expand to call to S_new_body. So for XPVBM (with ithreads),
1153 S_new_body(my_perl, (void**)&(my_perl->Ixpvbm_arenaroot),
1154 (void**)&(my_perl->Ixpvbm_root), sizeof(XPVBM), 0)
1157 #define new_body(TYPE,lctype) \
1158 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1159 (void**)&PL_ ## lctype ## _root, \
1163 /* But for some types, we cheat. The type starts with some members that are
1164 never accessed. So we allocate the substructure, starting at the first used
1165 member, then adjust the pointer back in memory by the size of the bit not
1166 allocated, so it's as if we allocated the full structure.
1167 (But things will all go boom if you write to the part that is "not there",
1168 because you'll be overwriting the last members of the preceding structure
1171 We calculate the correction using the STRUCT_OFFSET macro. For example, if
1172 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
1173 and the pointer is unchanged. If the allocated structure is smaller (no
1174 initial NV actually allocated) then the net effect is to subtract the size
1175 of the NV from the pointer, to return a new pointer as if an initial NV were
1178 This is the same trick as was used for NV and IV bodies. Ironically it
1179 doesn't need to be used for NV bodies any more, because NV is now at the
1180 start of the structure. IV bodies don't need it either, because they are
1181 no longer allocated. */
1183 #define new_body_allocated(TYPE,lctype,member) \
1184 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1185 (void**)&PL_ ## lctype ## _root, \
1186 sizeof(lctype ## _allocated), \
1187 STRUCT_OFFSET(TYPE, member) \
1188 - STRUCT_OFFSET(lctype ## _allocated, member))
1191 #define del_body(p,TYPE,lctype) \
1192 S_del_body(aTHX_ (void*)p, (void**)&PL_ ## lctype ## _root, 0)
1194 #define del_body_allocated(p,TYPE,lctype,member) \
1195 S_del_body(aTHX_ (void*)p, (void**)&PL_ ## lctype ## _root, \
1196 STRUCT_OFFSET(TYPE, member) \
1197 - STRUCT_OFFSET(lctype ## _allocated, member))
1199 #define my_safemalloc(s) (void*)safemalloc(s)
1200 #define my_safefree(p) safefree((char*)p)
1204 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1205 #define del_XNV(p) my_safefree(p)
1207 #define new_XPV() my_safemalloc(sizeof(XPV))
1208 #define del_XPV(p) my_safefree(p)
1210 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1211 #define del_XPVIV(p) my_safefree(p)
1213 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1214 #define del_XPVNV(p) my_safefree(p)
1216 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1217 #define del_XPVCV(p) my_safefree(p)
1219 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1220 #define del_XPVAV(p) my_safefree(p)
1222 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1223 #define del_XPVHV(p) my_safefree(p)
1225 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1226 #define del_XPVMG(p) my_safefree(p)
1228 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1229 #define del_XPVGV(p) my_safefree(p)
1231 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1232 #define del_XPVLV(p) my_safefree(p)
1234 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1235 #define del_XPVBM(p) my_safefree(p)
1239 #define new_XNV() new_body(NV, xnv)
1240 #define del_XNV(p) del_body(p, NV, xnv)
1242 #define new_XPV() new_body_allocated(XPV, xpv, xpv_cur)
1243 #define del_XPV(p) del_body_allocated(p, XPV, xpv, xpv_cur)
1245 #define new_XPVIV() new_body_allocated(XPVIV, xpviv, xpv_cur)
1246 #define del_XPVIV(p) del_body_allocated(p, XPVIV, xpviv, xpv_cur)
1248 #define new_XPVNV() new_body(XPVNV, xpvnv)
1249 #define del_XPVNV(p) del_body(p, XPVNV, xpvnv)
1251 #define new_XPVCV() new_body(XPVCV, xpvcv)
1252 #define del_XPVCV(p) del_body(p, XPVCV, xpvcv)
1254 #define new_XPVAV() new_body_allocated(XPVAV, xpvav, xav_fill)
1255 #define del_XPVAV(p) del_body_allocated(p, XPVAV, xpvav, xav_fill)
1257 #define new_XPVHV() new_body_allocated(XPVHV, xpvhv, xhv_fill)
1258 #define del_XPVHV(p) del_body_allocated(p, XPVHV, xpvhv, xhv_fill)
1260 #define new_XPVMG() new_body(XPVMG, xpvmg)
1261 #define del_XPVMG(p) del_body(p, XPVMG, xpvmg)
1263 #define new_XPVGV() new_body(XPVGV, xpvgv)
1264 #define del_XPVGV(p) del_body(p, XPVGV, xpvgv)
1266 #define new_XPVLV() new_body(XPVLV, xpvlv)
1267 #define del_XPVLV(p) del_body(p, XPVLV, xpvlv)
1269 #define new_XPVBM() new_body(XPVBM, xpvbm)
1270 #define del_XPVBM(p) del_body(p, XPVBM, xpvbm)
1274 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1275 #define del_XPVFM(p) my_safefree(p)
1277 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1278 #define del_XPVIO(p) my_safefree(p)
1281 =for apidoc sv_upgrade
1283 Upgrade an SV to a more complex form. Generally adds a new body type to the
1284 SV, then copies across as much information as possible from the old body.
1285 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1291 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1293 void** old_body_arena;
1294 size_t old_body_offset;
1295 size_t old_body_length; /* Well, the length to copy. */
1297 bool zero_nv = TRUE;
1299 size_t new_body_length;
1300 size_t new_body_offset;
1301 void** new_body_arena;
1302 void** new_body_arenaroot;
1303 U32 old_type = SvTYPE(sv);
1305 if (mt != SVt_PV && SvIsCOW(sv)) {
1306 sv_force_normal_flags(sv, 0);
1309 if (SvTYPE(sv) == mt)
1312 if (SvTYPE(sv) > mt)
1313 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1314 (int)SvTYPE(sv), (int)mt);
1317 old_body = SvANY(sv);
1319 old_body_offset = 0;
1320 old_body_length = 0;
1321 new_body_offset = 0;
1322 new_body_length = ~0;
1324 /* Copying structures onto other structures that have been neatly zeroed
1325 has a subtle gotcha. Consider XPVMG
1327 +------+------+------+------+------+-------+-------+
1328 | NV | CUR | LEN | IV | MAGIC | STASH |
1329 +------+------+------+------+------+-------+-------+
1330 0 4 8 12 16 20 24 28
1332 where NVs are aligned to 8 bytes, so that sizeof that structure is
1333 actually 32 bytes long, with 4 bytes of padding at the end:
1335 +------+------+------+------+------+-------+-------+------+
1336 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1337 +------+------+------+------+------+-------+-------+------+
1338 0 4 8 12 16 20 24 28 32
1340 so what happens if you allocate memory for this structure:
1342 +------+------+------+------+------+-------+-------+------+------+...
1343 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1344 +------+------+------+------+------+-------+-------+------+------+...
1345 0 4 8 12 16 20 24 28 32 36
1347 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1348 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1349 started out as zero once, but it's quite possible that it isn't. So now,
1350 rather than a nicely zeroed GP, you have it pointing somewhere random.
1353 (In fact, GP ends up pointing at a previous GP structure, because the
1354 principle cause of the padding in XPVMG getting garbage is a copy of
1355 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1357 So we are careful and work out the size of used parts of all the
1360 switch (SvTYPE(sv)) {
1366 else if (mt < SVt_PVIV)
1368 old_body_offset = STRUCT_OFFSET(XPVIV, xiv_iv);
1369 old_body_length = sizeof(IV);
1372 old_body_arena = (void **) &PL_xnv_root;
1373 old_body_length = sizeof(NV);
1382 old_body_arena = (void **) &PL_xpv_root;
1383 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1384 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1385 old_body_length = STRUCT_OFFSET(XPV, xpv_len)
1386 + sizeof (((XPV*)SvANY(sv))->xpv_len)
1390 else if (mt == SVt_NV)
1394 old_body_arena = (void **) &PL_xpviv_root;
1395 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1396 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1397 old_body_length = STRUCT_OFFSET(XPVIV, xiv_u)
1398 + sizeof (((XPVIV*)SvANY(sv))->xiv_u)
1402 old_body_arena = (void **) &PL_xpvnv_root;
1403 old_body_length = STRUCT_OFFSET(XPVNV, xiv_u)
1404 + sizeof (((XPVNV*)SvANY(sv))->xiv_u);
1408 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1409 there's no way that it can be safely upgraded, because perl.c
1410 expects to Safefree(SvANY(PL_mess_sv)) */
1411 assert(sv != PL_mess_sv);
1412 /* This flag bit is used to mean other things in other scalar types.
1413 Given that it only has meaning inside the pad, it shouldn't be set
1414 on anything that can get upgraded. */
1415 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1416 old_body_arena = (void **) &PL_xpvmg_root;
1417 old_body_length = STRUCT_OFFSET(XPVMG, xmg_stash)
1418 + sizeof (((XPVMG*)SvANY(sv))->xmg_stash);
1422 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1425 SvFLAGS(sv) &= ~SVTYPEMASK;
1430 Perl_croak(aTHX_ "Can't upgrade to undef");
1432 assert(old_type == SVt_NULL);
1433 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1437 assert(old_type == SVt_NULL);
1438 SvANY(sv) = new_XNV();
1442 assert(old_type == SVt_NULL);
1443 SvANY(sv) = &sv->sv_u.svu_rv;
1447 SvANY(sv) = new_XPVHV();
1450 HvTOTALKEYS(sv) = 0;
1455 SvANY(sv) = new_XPVAV();
1462 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1463 The target created by newSVrv also is, and it can have magic.
1464 However, it never has SvPVX set.
1466 if (old_type >= SVt_RV) {
1467 assert(SvPVX_const(sv) == 0);
1470 /* Could put this in the else clause below, as PVMG must have SvPVX
1471 0 already (the assertion above) */
1472 SvPV_set(sv, (char*)0);
1474 if (old_type >= SVt_PVMG) {
1475 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1476 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1484 new_body = new_XPVIO();
1485 new_body_length = sizeof(XPVIO);
1488 new_body = new_XPVFM();
1489 new_body_length = sizeof(XPVFM);
1493 new_body_length = sizeof(XPVBM);
1494 new_body_arena = (void **) &PL_xpvbm_root;
1495 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
1498 new_body_length = sizeof(XPVGV);
1499 new_body_arena = (void **) &PL_xpvgv_root;
1500 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
1503 new_body_length = sizeof(XPVCV);
1504 new_body_arena = (void **) &PL_xpvcv_root;
1505 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
1508 new_body_length = sizeof(XPVLV);
1509 new_body_arena = (void **) &PL_xpvlv_root;
1510 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
1513 new_body_length = sizeof(XPVMG);
1514 new_body_arena = (void **) &PL_xpvmg_root;
1515 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
1518 new_body_length = sizeof(XPVNV);
1519 new_body_arena = (void **) &PL_xpvnv_root;
1520 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
1523 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1524 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1525 new_body_length = sizeof(XPVIV) - new_body_offset;
1526 new_body_arena = (void **) &PL_xpviv_root;
1527 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
1528 /* XXX Is this still needed? Was it ever needed? Surely as there is
1529 no route from NV to PVIV, NOK can never be true */
1533 goto new_body_no_NV;
1535 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1536 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1537 new_body_length = sizeof(XPV) - new_body_offset;
1538 new_body_arena = (void **) &PL_xpv_root;
1539 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
1541 /* PV and PVIV don't have an NV slot. */
1546 assert(new_body_length);
1548 new_body = S_new_body(aTHX_ new_body_arenaroot, new_body_arena,
1549 new_body_length, new_body_offset);
1551 /* We always allocated the full length item with PURIFY */
1552 new_body_length += new_body_offset;
1553 new_body_offset = 0;
1554 new_body = my_safemalloc(new_body_length);
1558 Zero(((char *)new_body) + new_body_offset, new_body_length, char);
1559 SvANY(sv) = new_body;
1561 if (old_body_length) {
1562 Copy((char *)old_body + old_body_offset,
1563 (char *)new_body + old_body_offset,
1564 old_body_length, char);
1567 /* FIXME - add a Configure test to determine if NV 0.0 is actually
1568 all bits zero. If it is, we can skip this initialisation. */
1573 IoPAGE_LEN(sv) = 60;
1574 if (old_type < SVt_RV)
1579 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", mt);
1583 if (old_body_arena) {
1585 my_safefree(old_body);
1587 S_del_body(aTHX_ old_body, old_body_arena, old_body_offset);
1593 =for apidoc sv_backoff
1595 Remove any string offset. You should normally use the C<SvOOK_off> macro
1602 Perl_sv_backoff(pTHX_ register SV *sv)
1605 assert(SvTYPE(sv) != SVt_PVHV);
1606 assert(SvTYPE(sv) != SVt_PVAV);
1608 const char *s = SvPVX_const(sv);
1609 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1610 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1612 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1614 SvFLAGS(sv) &= ~SVf_OOK;
1621 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1622 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1623 Use the C<SvGROW> wrapper instead.
1629 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1633 #ifdef HAS_64K_LIMIT
1634 if (newlen >= 0x10000) {
1635 PerlIO_printf(Perl_debug_log,
1636 "Allocation too large: %"UVxf"\n", (UV)newlen);
1639 #endif /* HAS_64K_LIMIT */
1642 if (SvTYPE(sv) < SVt_PV) {
1643 sv_upgrade(sv, SVt_PV);
1644 s = SvPVX_mutable(sv);
1646 else if (SvOOK(sv)) { /* pv is offset? */
1648 s = SvPVX_mutable(sv);
1649 if (newlen > SvLEN(sv))
1650 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1651 #ifdef HAS_64K_LIMIT
1652 if (newlen >= 0x10000)
1657 s = SvPVX_mutable(sv);
1659 if (newlen > SvLEN(sv)) { /* need more room? */
1660 newlen = PERL_STRLEN_ROUNDUP(newlen);
1661 if (SvLEN(sv) && s) {
1663 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1669 s = saferealloc(s, newlen);
1672 s = safemalloc(newlen);
1673 if (SvPVX_const(sv) && SvCUR(sv)) {
1674 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1678 SvLEN_set(sv, newlen);
1684 =for apidoc sv_setiv
1686 Copies an integer into the given SV, upgrading first if necessary.
1687 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1693 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1695 SV_CHECK_THINKFIRST_COW_DROP(sv);
1696 switch (SvTYPE(sv)) {
1698 sv_upgrade(sv, SVt_IV);
1701 sv_upgrade(sv, SVt_PVNV);
1705 sv_upgrade(sv, SVt_PVIV);
1714 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1717 (void)SvIOK_only(sv); /* validate number */
1723 =for apidoc sv_setiv_mg
1725 Like C<sv_setiv>, but also handles 'set' magic.
1731 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1738 =for apidoc sv_setuv
1740 Copies an unsigned integer into the given SV, upgrading first if necessary.
1741 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1747 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1749 /* With these two if statements:
1750 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1753 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1755 If you wish to remove them, please benchmark to see what the effect is
1757 if (u <= (UV)IV_MAX) {
1758 sv_setiv(sv, (IV)u);
1767 =for apidoc sv_setuv_mg
1769 Like C<sv_setuv>, but also handles 'set' magic.
1775 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1777 /* With these two if statements:
1778 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1781 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1783 If you wish to remove them, please benchmark to see what the effect is
1785 if (u <= (UV)IV_MAX) {
1786 sv_setiv(sv, (IV)u);
1796 =for apidoc sv_setnv
1798 Copies a double into the given SV, upgrading first if necessary.
1799 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1805 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1807 SV_CHECK_THINKFIRST_COW_DROP(sv);
1808 switch (SvTYPE(sv)) {
1811 sv_upgrade(sv, SVt_NV);
1816 sv_upgrade(sv, SVt_PVNV);
1825 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1829 (void)SvNOK_only(sv); /* validate number */
1834 =for apidoc sv_setnv_mg
1836 Like C<sv_setnv>, but also handles 'set' magic.
1842 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1848 /* Print an "isn't numeric" warning, using a cleaned-up,
1849 * printable version of the offending string
1853 S_not_a_number(pTHX_ SV *sv)
1860 dsv = sv_2mortal(newSVpv("", 0));
1861 pv = sv_uni_display(dsv, sv, 10, 0);
1864 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1865 /* each *s can expand to 4 chars + "...\0",
1866 i.e. need room for 8 chars */
1868 const char *s, *end;
1869 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1872 if (ch & 128 && !isPRINT_LC(ch)) {
1881 else if (ch == '\r') {
1885 else if (ch == '\f') {
1889 else if (ch == '\\') {
1893 else if (ch == '\0') {
1897 else if (isPRINT_LC(ch))
1914 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1915 "Argument \"%s\" isn't numeric in %s", pv,
1918 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1919 "Argument \"%s\" isn't numeric", pv);
1923 =for apidoc looks_like_number
1925 Test if the content of an SV looks like a number (or is a number).
1926 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1927 non-numeric warning), even if your atof() doesn't grok them.
1933 Perl_looks_like_number(pTHX_ SV *sv)
1935 register const char *sbegin;
1939 sbegin = SvPVX_const(sv);
1942 else if (SvPOKp(sv))
1943 sbegin = SvPV_const(sv, len);
1945 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1946 return grok_number(sbegin, len, NULL);
1949 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1950 until proven guilty, assume that things are not that bad... */
1955 As 64 bit platforms often have an NV that doesn't preserve all bits of
1956 an IV (an assumption perl has been based on to date) it becomes necessary
1957 to remove the assumption that the NV always carries enough precision to
1958 recreate the IV whenever needed, and that the NV is the canonical form.
1959 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1960 precision as a side effect of conversion (which would lead to insanity
1961 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1962 1) to distinguish between IV/UV/NV slots that have cached a valid
1963 conversion where precision was lost and IV/UV/NV slots that have a
1964 valid conversion which has lost no precision
1965 2) to ensure that if a numeric conversion to one form is requested that
1966 would lose precision, the precise conversion (or differently
1967 imprecise conversion) is also performed and cached, to prevent
1968 requests for different numeric formats on the same SV causing
1969 lossy conversion chains. (lossless conversion chains are perfectly
1974 SvIOKp is true if the IV slot contains a valid value
1975 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1976 SvNOKp is true if the NV slot contains a valid value
1977 SvNOK is true only if the NV value is accurate
1980 while converting from PV to NV, check to see if converting that NV to an
1981 IV(or UV) would lose accuracy over a direct conversion from PV to
1982 IV(or UV). If it would, cache both conversions, return NV, but mark
1983 SV as IOK NOKp (ie not NOK).
1985 While converting from PV to IV, check to see if converting that IV to an
1986 NV would lose accuracy over a direct conversion from PV to NV. If it
1987 would, cache both conversions, flag similarly.
1989 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1990 correctly because if IV & NV were set NV *always* overruled.
1991 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1992 changes - now IV and NV together means that the two are interchangeable:
1993 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1995 The benefit of this is that operations such as pp_add know that if
1996 SvIOK is true for both left and right operands, then integer addition
1997 can be used instead of floating point (for cases where the result won't
1998 overflow). Before, floating point was always used, which could lead to
1999 loss of precision compared with integer addition.
2001 * making IV and NV equal status should make maths accurate on 64 bit
2003 * may speed up maths somewhat if pp_add and friends start to use
2004 integers when possible instead of fp. (Hopefully the overhead in
2005 looking for SvIOK and checking for overflow will not outweigh the
2006 fp to integer speedup)
2007 * will slow down integer operations (callers of SvIV) on "inaccurate"
2008 values, as the change from SvIOK to SvIOKp will cause a call into
2009 sv_2iv each time rather than a macro access direct to the IV slot
2010 * should speed up number->string conversion on integers as IV is
2011 favoured when IV and NV are equally accurate
2013 ####################################################################
2014 You had better be using SvIOK_notUV if you want an IV for arithmetic:
2015 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
2016 On the other hand, SvUOK is true iff UV.
2017 ####################################################################
2019 Your mileage will vary depending your CPU's relative fp to integer
2023 #ifndef NV_PRESERVES_UV
2024 # define IS_NUMBER_UNDERFLOW_IV 1
2025 # define IS_NUMBER_UNDERFLOW_UV 2
2026 # define IS_NUMBER_IV_AND_UV 2
2027 # define IS_NUMBER_OVERFLOW_IV 4
2028 # define IS_NUMBER_OVERFLOW_UV 5
2030 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2032 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2034 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2036 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX_const(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
2037 if (SvNVX(sv) < (NV)IV_MIN) {
2038 (void)SvIOKp_on(sv);
2040 SvIV_set(sv, IV_MIN);
2041 return IS_NUMBER_UNDERFLOW_IV;
2043 if (SvNVX(sv) > (NV)UV_MAX) {
2044 (void)SvIOKp_on(sv);
2047 SvUV_set(sv, UV_MAX);
2048 return IS_NUMBER_OVERFLOW_UV;
2050 (void)SvIOKp_on(sv);
2052 /* Can't use strtol etc to convert this string. (See truth table in
2054 if (SvNVX(sv) <= (UV)IV_MAX) {
2055 SvIV_set(sv, I_V(SvNVX(sv)));
2056 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2057 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2059 /* Integer is imprecise. NOK, IOKp */
2061 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2064 SvUV_set(sv, U_V(SvNVX(sv)));
2065 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2066 if (SvUVX(sv) == UV_MAX) {
2067 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2068 possibly be preserved by NV. Hence, it must be overflow.
2070 return IS_NUMBER_OVERFLOW_UV;
2072 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2074 /* Integer is imprecise. NOK, IOKp */
2076 return IS_NUMBER_OVERFLOW_IV;
2078 #endif /* !NV_PRESERVES_UV*/
2080 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2081 * this function provided for binary compatibility only
2085 Perl_sv_2iv(pTHX_ register SV *sv)
2087 return sv_2iv_flags(sv, SV_GMAGIC);
2091 =for apidoc sv_2iv_flags
2093 Return the integer value of an SV, doing any necessary string
2094 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2095 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2101 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2105 if (SvGMAGICAL(sv)) {
2106 if (flags & SV_GMAGIC)
2111 return I_V(SvNVX(sv));
2113 if (SvPOKp(sv) && SvLEN(sv))
2116 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2117 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2123 if (SvTHINKFIRST(sv)) {
2126 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2127 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2128 return SvIV(tmpstr);
2129 return PTR2IV(SvRV(sv));
2132 sv_force_normal_flags(sv, 0);
2134 if (SvREADONLY(sv) && !SvOK(sv)) {
2135 if (ckWARN(WARN_UNINITIALIZED))
2142 return (IV)(SvUVX(sv));
2149 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2150 * without also getting a cached IV/UV from it at the same time
2151 * (ie PV->NV conversion should detect loss of accuracy and cache
2152 * IV or UV at same time to avoid this. NWC */
2154 if (SvTYPE(sv) == SVt_NV)
2155 sv_upgrade(sv, SVt_PVNV);
2157 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2158 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2159 certainly cast into the IV range at IV_MAX, whereas the correct
2160 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2162 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2163 SvIV_set(sv, I_V(SvNVX(sv)));
2164 if (SvNVX(sv) == (NV) SvIVX(sv)
2165 #ifndef NV_PRESERVES_UV
2166 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2167 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2168 /* Don't flag it as "accurately an integer" if the number
2169 came from a (by definition imprecise) NV operation, and
2170 we're outside the range of NV integer precision */
2173 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2174 DEBUG_c(PerlIO_printf(Perl_debug_log,
2175 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2181 /* IV not precise. No need to convert from PV, as NV
2182 conversion would already have cached IV if it detected
2183 that PV->IV would be better than PV->NV->IV
2184 flags already correct - don't set public IOK. */
2185 DEBUG_c(PerlIO_printf(Perl_debug_log,
2186 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2191 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2192 but the cast (NV)IV_MIN rounds to a the value less (more
2193 negative) than IV_MIN which happens to be equal to SvNVX ??
2194 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2195 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2196 (NV)UVX == NVX are both true, but the values differ. :-(
2197 Hopefully for 2s complement IV_MIN is something like
2198 0x8000000000000000 which will be exact. NWC */
2201 SvUV_set(sv, U_V(SvNVX(sv)));
2203 (SvNVX(sv) == (NV) SvUVX(sv))
2204 #ifndef NV_PRESERVES_UV
2205 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2206 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2207 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2208 /* Don't flag it as "accurately an integer" if the number
2209 came from a (by definition imprecise) NV operation, and
2210 we're outside the range of NV integer precision */
2216 DEBUG_c(PerlIO_printf(Perl_debug_log,
2217 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2221 return (IV)SvUVX(sv);
2224 else if (SvPOKp(sv) && SvLEN(sv)) {
2226 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2227 /* We want to avoid a possible problem when we cache an IV which
2228 may be later translated to an NV, and the resulting NV is not
2229 the same as the direct translation of the initial string
2230 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2231 be careful to ensure that the value with the .456 is around if the
2232 NV value is requested in the future).
2234 This means that if we cache such an IV, we need to cache the
2235 NV as well. Moreover, we trade speed for space, and do not
2236 cache the NV if we are sure it's not needed.
2239 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2240 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2241 == IS_NUMBER_IN_UV) {
2242 /* It's definitely an integer, only upgrade to PVIV */
2243 if (SvTYPE(sv) < SVt_PVIV)
2244 sv_upgrade(sv, SVt_PVIV);
2246 } else if (SvTYPE(sv) < SVt_PVNV)
2247 sv_upgrade(sv, SVt_PVNV);
2249 /* If NV preserves UV then we only use the UV value if we know that
2250 we aren't going to call atof() below. If NVs don't preserve UVs
2251 then the value returned may have more precision than atof() will
2252 return, even though value isn't perfectly accurate. */
2253 if ((numtype & (IS_NUMBER_IN_UV
2254 #ifdef NV_PRESERVES_UV
2257 )) == IS_NUMBER_IN_UV) {
2258 /* This won't turn off the public IOK flag if it was set above */
2259 (void)SvIOKp_on(sv);
2261 if (!(numtype & IS_NUMBER_NEG)) {
2263 if (value <= (UV)IV_MAX) {
2264 SvIV_set(sv, (IV)value);
2266 SvUV_set(sv, value);
2270 /* 2s complement assumption */
2271 if (value <= (UV)IV_MIN) {
2272 SvIV_set(sv, -(IV)value);
2274 /* Too negative for an IV. This is a double upgrade, but
2275 I'm assuming it will be rare. */
2276 if (SvTYPE(sv) < SVt_PVNV)
2277 sv_upgrade(sv, SVt_PVNV);
2281 SvNV_set(sv, -(NV)value);
2282 SvIV_set(sv, IV_MIN);
2286 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2287 will be in the previous block to set the IV slot, and the next
2288 block to set the NV slot. So no else here. */
2290 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2291 != IS_NUMBER_IN_UV) {
2292 /* It wasn't an (integer that doesn't overflow the UV). */
2293 SvNV_set(sv, Atof(SvPVX_const(sv)));
2295 if (! numtype && ckWARN(WARN_NUMERIC))
2298 #if defined(USE_LONG_DOUBLE)
2299 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2300 PTR2UV(sv), SvNVX(sv)));
2302 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2303 PTR2UV(sv), SvNVX(sv)));
2307 #ifdef NV_PRESERVES_UV
2308 (void)SvIOKp_on(sv);
2310 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2311 SvIV_set(sv, I_V(SvNVX(sv)));
2312 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2315 /* Integer is imprecise. NOK, IOKp */
2317 /* UV will not work better than IV */
2319 if (SvNVX(sv) > (NV)UV_MAX) {
2321 /* Integer is inaccurate. NOK, IOKp, is UV */
2322 SvUV_set(sv, UV_MAX);
2325 SvUV_set(sv, U_V(SvNVX(sv)));
2326 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2327 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2331 /* Integer is imprecise. NOK, IOKp, is UV */
2337 #else /* NV_PRESERVES_UV */
2338 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2339 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2340 /* The IV slot will have been set from value returned by
2341 grok_number above. The NV slot has just been set using
2344 assert (SvIOKp(sv));
2346 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2347 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2348 /* Small enough to preserve all bits. */
2349 (void)SvIOKp_on(sv);
2351 SvIV_set(sv, I_V(SvNVX(sv)));
2352 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2354 /* Assumption: first non-preserved integer is < IV_MAX,
2355 this NV is in the preserved range, therefore: */
2356 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2358 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);
2362 0 0 already failed to read UV.
2363 0 1 already failed to read UV.
2364 1 0 you won't get here in this case. IV/UV
2365 slot set, public IOK, Atof() unneeded.
2366 1 1 already read UV.
2367 so there's no point in sv_2iuv_non_preserve() attempting
2368 to use atol, strtol, strtoul etc. */
2369 if (sv_2iuv_non_preserve (sv, numtype)
2370 >= IS_NUMBER_OVERFLOW_IV)
2374 #endif /* NV_PRESERVES_UV */
2377 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2379 if (SvTYPE(sv) < SVt_IV)
2380 /* Typically the caller expects that sv_any is not NULL now. */
2381 sv_upgrade(sv, SVt_IV);
2384 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2385 PTR2UV(sv),SvIVX(sv)));
2386 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2389 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2390 * this function provided for binary compatibility only
2394 Perl_sv_2uv(pTHX_ register SV *sv)
2396 return sv_2uv_flags(sv, SV_GMAGIC);
2400 =for apidoc sv_2uv_flags
2402 Return the unsigned integer value of an SV, doing any necessary string
2403 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2404 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2410 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2414 if (SvGMAGICAL(sv)) {
2415 if (flags & SV_GMAGIC)
2420 return U_V(SvNVX(sv));
2421 if (SvPOKp(sv) && SvLEN(sv))
2424 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2425 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2431 if (SvTHINKFIRST(sv)) {
2434 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2435 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2436 return SvUV(tmpstr);
2437 return PTR2UV(SvRV(sv));
2440 sv_force_normal_flags(sv, 0);
2442 if (SvREADONLY(sv) && !SvOK(sv)) {
2443 if (ckWARN(WARN_UNINITIALIZED))
2453 return (UV)SvIVX(sv);
2457 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2458 * without also getting a cached IV/UV from it at the same time
2459 * (ie PV->NV conversion should detect loss of accuracy and cache
2460 * IV or UV at same time to avoid this. */
2461 /* IV-over-UV optimisation - choose to cache IV if possible */
2463 if (SvTYPE(sv) == SVt_NV)
2464 sv_upgrade(sv, SVt_PVNV);
2466 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2467 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2468 SvIV_set(sv, I_V(SvNVX(sv)));
2469 if (SvNVX(sv) == (NV) SvIVX(sv)
2470 #ifndef NV_PRESERVES_UV
2471 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2472 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2473 /* Don't flag it as "accurately an integer" if the number
2474 came from a (by definition imprecise) NV operation, and
2475 we're outside the range of NV integer precision */
2478 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2479 DEBUG_c(PerlIO_printf(Perl_debug_log,
2480 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2486 /* IV not precise. No need to convert from PV, as NV
2487 conversion would already have cached IV if it detected
2488 that PV->IV would be better than PV->NV->IV
2489 flags already correct - don't set public IOK. */
2490 DEBUG_c(PerlIO_printf(Perl_debug_log,
2491 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2496 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2497 but the cast (NV)IV_MIN rounds to a the value less (more
2498 negative) than IV_MIN which happens to be equal to SvNVX ??
2499 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2500 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2501 (NV)UVX == NVX are both true, but the values differ. :-(
2502 Hopefully for 2s complement IV_MIN is something like
2503 0x8000000000000000 which will be exact. NWC */
2506 SvUV_set(sv, U_V(SvNVX(sv)));
2508 (SvNVX(sv) == (NV) SvUVX(sv))
2509 #ifndef NV_PRESERVES_UV
2510 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2511 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2512 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2513 /* Don't flag it as "accurately an integer" if the number
2514 came from a (by definition imprecise) NV operation, and
2515 we're outside the range of NV integer precision */
2520 DEBUG_c(PerlIO_printf(Perl_debug_log,
2521 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2527 else if (SvPOKp(sv) && SvLEN(sv)) {
2529 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2531 /* We want to avoid a possible problem when we cache a UV which
2532 may be later translated to an NV, and the resulting NV is not
2533 the translation of the initial data.
2535 This means that if we cache such a UV, we need to cache the
2536 NV as well. Moreover, we trade speed for space, and do not
2537 cache the NV if not needed.
2540 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2541 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2542 == IS_NUMBER_IN_UV) {
2543 /* It's definitely an integer, only upgrade to PVIV */
2544 if (SvTYPE(sv) < SVt_PVIV)
2545 sv_upgrade(sv, SVt_PVIV);
2547 } else if (SvTYPE(sv) < SVt_PVNV)
2548 sv_upgrade(sv, SVt_PVNV);
2550 /* If NV preserves UV then we only use the UV value if we know that
2551 we aren't going to call atof() below. If NVs don't preserve UVs
2552 then the value returned may have more precision than atof() will
2553 return, even though it isn't accurate. */
2554 if ((numtype & (IS_NUMBER_IN_UV
2555 #ifdef NV_PRESERVES_UV
2558 )) == IS_NUMBER_IN_UV) {
2559 /* This won't turn off the public IOK flag if it was set above */
2560 (void)SvIOKp_on(sv);
2562 if (!(numtype & IS_NUMBER_NEG)) {
2564 if (value <= (UV)IV_MAX) {
2565 SvIV_set(sv, (IV)value);
2567 /* it didn't overflow, and it was positive. */
2568 SvUV_set(sv, value);
2572 /* 2s complement assumption */
2573 if (value <= (UV)IV_MIN) {
2574 SvIV_set(sv, -(IV)value);
2576 /* Too negative for an IV. This is a double upgrade, but
2577 I'm assuming it will be rare. */
2578 if (SvTYPE(sv) < SVt_PVNV)
2579 sv_upgrade(sv, SVt_PVNV);
2583 SvNV_set(sv, -(NV)value);
2584 SvIV_set(sv, IV_MIN);
2589 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2590 != IS_NUMBER_IN_UV) {
2591 /* It wasn't an integer, or it overflowed the UV. */
2592 SvNV_set(sv, Atof(SvPVX_const(sv)));
2594 if (! numtype && ckWARN(WARN_NUMERIC))
2597 #if defined(USE_LONG_DOUBLE)
2598 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2599 PTR2UV(sv), SvNVX(sv)));
2601 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2602 PTR2UV(sv), SvNVX(sv)));
2605 #ifdef NV_PRESERVES_UV
2606 (void)SvIOKp_on(sv);
2608 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2609 SvIV_set(sv, I_V(SvNVX(sv)));
2610 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2613 /* Integer is imprecise. NOK, IOKp */
2615 /* UV will not work better than IV */
2617 if (SvNVX(sv) > (NV)UV_MAX) {
2619 /* Integer is inaccurate. NOK, IOKp, is UV */
2620 SvUV_set(sv, UV_MAX);
2623 SvUV_set(sv, U_V(SvNVX(sv)));
2624 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2625 NV preservse UV so can do correct comparison. */
2626 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2630 /* Integer is imprecise. NOK, IOKp, is UV */
2635 #else /* NV_PRESERVES_UV */
2636 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2637 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2638 /* The UV slot will have been set from value returned by
2639 grok_number above. The NV slot has just been set using
2642 assert (SvIOKp(sv));
2644 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2645 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2646 /* Small enough to preserve all bits. */
2647 (void)SvIOKp_on(sv);
2649 SvIV_set(sv, I_V(SvNVX(sv)));
2650 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2652 /* Assumption: first non-preserved integer is < IV_MAX,
2653 this NV is in the preserved range, therefore: */
2654 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2656 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);
2659 sv_2iuv_non_preserve (sv, numtype);
2661 #endif /* NV_PRESERVES_UV */
2665 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2666 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2669 if (SvTYPE(sv) < SVt_IV)
2670 /* Typically the caller expects that sv_any is not NULL now. */
2671 sv_upgrade(sv, SVt_IV);
2675 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2676 PTR2UV(sv),SvUVX(sv)));
2677 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2683 Return the num value of an SV, doing any necessary string or integer
2684 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2691 Perl_sv_2nv(pTHX_ register SV *sv)
2695 if (SvGMAGICAL(sv)) {
2699 if (SvPOKp(sv) && SvLEN(sv)) {
2700 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2701 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2703 return Atof(SvPVX_const(sv));
2707 return (NV)SvUVX(sv);
2709 return (NV)SvIVX(sv);
2712 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2713 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2719 if (SvTHINKFIRST(sv)) {
2722 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2723 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2724 return SvNV(tmpstr);
2725 return PTR2NV(SvRV(sv));
2728 sv_force_normal_flags(sv, 0);
2730 if (SvREADONLY(sv) && !SvOK(sv)) {
2731 if (ckWARN(WARN_UNINITIALIZED))
2736 if (SvTYPE(sv) < SVt_NV) {
2737 if (SvTYPE(sv) == SVt_IV)
2738 sv_upgrade(sv, SVt_PVNV);
2740 sv_upgrade(sv, SVt_NV);
2741 #ifdef USE_LONG_DOUBLE
2743 STORE_NUMERIC_LOCAL_SET_STANDARD();
2744 PerlIO_printf(Perl_debug_log,
2745 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2746 PTR2UV(sv), SvNVX(sv));
2747 RESTORE_NUMERIC_LOCAL();
2751 STORE_NUMERIC_LOCAL_SET_STANDARD();
2752 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2753 PTR2UV(sv), SvNVX(sv));
2754 RESTORE_NUMERIC_LOCAL();
2758 else if (SvTYPE(sv) < SVt_PVNV)
2759 sv_upgrade(sv, SVt_PVNV);
2764 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2765 #ifdef NV_PRESERVES_UV
2768 /* Only set the public NV OK flag if this NV preserves the IV */
2769 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2770 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2771 : (SvIVX(sv) == I_V(SvNVX(sv))))
2777 else if (SvPOKp(sv) && SvLEN(sv)) {
2779 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2780 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2782 #ifdef NV_PRESERVES_UV
2783 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2784 == IS_NUMBER_IN_UV) {
2785 /* It's definitely an integer */
2786 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2788 SvNV_set(sv, Atof(SvPVX_const(sv)));
2791 SvNV_set(sv, Atof(SvPVX_const(sv)));
2792 /* Only set the public NV OK flag if this NV preserves the value in
2793 the PV at least as well as an IV/UV would.
2794 Not sure how to do this 100% reliably. */
2795 /* if that shift count is out of range then Configure's test is
2796 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2798 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2799 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2800 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2801 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2802 /* Can't use strtol etc to convert this string, so don't try.
2803 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2806 /* value has been set. It may not be precise. */
2807 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2808 /* 2s complement assumption for (UV)IV_MIN */
2809 SvNOK_on(sv); /* Integer is too negative. */
2814 if (numtype & IS_NUMBER_NEG) {
2815 SvIV_set(sv, -(IV)value);
2816 } else if (value <= (UV)IV_MAX) {
2817 SvIV_set(sv, (IV)value);
2819 SvUV_set(sv, value);
2823 if (numtype & IS_NUMBER_NOT_INT) {
2824 /* I believe that even if the original PV had decimals,
2825 they are lost beyond the limit of the FP precision.
2826 However, neither is canonical, so both only get p
2827 flags. NWC, 2000/11/25 */
2828 /* Both already have p flags, so do nothing */
2830 const NV nv = SvNVX(sv);
2831 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2832 if (SvIVX(sv) == I_V(nv)) {
2837 /* It had no "." so it must be integer. */
2840 /* between IV_MAX and NV(UV_MAX).
2841 Could be slightly > UV_MAX */
2843 if (numtype & IS_NUMBER_NOT_INT) {
2844 /* UV and NV both imprecise. */
2846 const UV nv_as_uv = U_V(nv);
2848 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2859 #endif /* NV_PRESERVES_UV */
2862 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2864 if (SvTYPE(sv) < SVt_NV)
2865 /* Typically the caller expects that sv_any is not NULL now. */
2866 /* XXX Ilya implies that this is a bug in callers that assume this
2867 and ideally should be fixed. */
2868 sv_upgrade(sv, SVt_NV);
2871 #if defined(USE_LONG_DOUBLE)
2873 STORE_NUMERIC_LOCAL_SET_STANDARD();
2874 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2875 PTR2UV(sv), SvNVX(sv));
2876 RESTORE_NUMERIC_LOCAL();
2880 STORE_NUMERIC_LOCAL_SET_STANDARD();
2881 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2882 PTR2UV(sv), SvNVX(sv));
2883 RESTORE_NUMERIC_LOCAL();
2889 /* asIV(): extract an integer from the string value of an SV.
2890 * Caller must validate PVX */
2893 S_asIV(pTHX_ SV *sv)
2896 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2898 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2899 == IS_NUMBER_IN_UV) {
2900 /* It's definitely an integer */
2901 if (numtype & IS_NUMBER_NEG) {
2902 if (value < (UV)IV_MIN)
2905 if (value < (UV)IV_MAX)
2910 if (ckWARN(WARN_NUMERIC))
2913 return I_V(Atof(SvPVX_const(sv)));
2916 /* asUV(): extract an unsigned integer from the string value of an SV
2917 * Caller must validate PVX */
2920 S_asUV(pTHX_ SV *sv)
2923 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2925 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2926 == IS_NUMBER_IN_UV) {
2927 /* It's definitely an integer */
2928 if (!(numtype & IS_NUMBER_NEG))
2932 if (ckWARN(WARN_NUMERIC))
2935 return U_V(Atof(SvPVX_const(sv)));
2939 =for apidoc sv_2pv_nolen
2941 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2942 use the macro wrapper C<SvPV_nolen(sv)> instead.
2947 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2949 return sv_2pv(sv, 0);
2952 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2953 * UV as a string towards the end of buf, and return pointers to start and
2956 * We assume that buf is at least TYPE_CHARS(UV) long.
2960 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2962 char *ptr = buf + TYPE_CHARS(UV);
2976 *--ptr = '0' + (char)(uv % 10);
2984 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2985 * this function provided for binary compatibility only
2989 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2991 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2995 =for apidoc sv_2pv_flags
2997 Returns a pointer to the string value of an SV, and sets *lp to its length.
2998 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
3000 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
3001 usually end up here too.
3007 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
3012 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
3013 char *tmpbuf = tbuf;
3020 if (SvGMAGICAL(sv)) {
3021 if (flags & SV_GMAGIC)
3026 if (flags & SV_MUTABLE_RETURN)
3027 return SvPVX_mutable(sv);
3028 if (flags & SV_CONST_RETURN)
3029 return (char *)SvPVX_const(sv);
3034 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3036 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3041 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3046 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3047 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3055 if (SvTHINKFIRST(sv)) {
3058 register const char *typestr;
3059 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3060 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3062 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3065 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3066 if (flags & SV_CONST_RETURN) {
3067 pv = (char *) SvPVX_const(tmpstr);
3069 pv = (flags & SV_MUTABLE_RETURN)
3070 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3073 *lp = SvCUR(tmpstr);
3075 pv = sv_2pv_flags(tmpstr, lp, flags);
3086 typestr = "NULLREF";
3090 switch (SvTYPE(sv)) {
3092 if ( ((SvFLAGS(sv) &
3093 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3094 == (SVs_OBJECT|SVs_SMG))
3095 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3096 const regexp *re = (regexp *)mg->mg_obj;
3099 const char *fptr = "msix";
3104 char need_newline = 0;
3105 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3107 while((ch = *fptr++)) {
3109 reflags[left++] = ch;
3112 reflags[right--] = ch;
3117 reflags[left] = '-';
3121 mg->mg_len = re->prelen + 4 + left;
3123 * If /x was used, we have to worry about a regex
3124 * ending with a comment later being embedded
3125 * within another regex. If so, we don't want this
3126 * regex's "commentization" to leak out to the
3127 * right part of the enclosing regex, we must cap
3128 * it with a newline.
3130 * So, if /x was used, we scan backwards from the
3131 * end of the regex. If we find a '#' before we
3132 * find a newline, we need to add a newline
3133 * ourself. If we find a '\n' first (or if we
3134 * don't find '#' or '\n'), we don't need to add
3135 * anything. -jfriedl
3137 if (PMf_EXTENDED & re->reganch)
3139 const char *endptr = re->precomp + re->prelen;
3140 while (endptr >= re->precomp)
3142 const char c = *(endptr--);
3144 break; /* don't need another */
3146 /* we end while in a comment, so we
3148 mg->mg_len++; /* save space for it */
3149 need_newline = 1; /* note to add it */
3155 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3156 Copy("(?", mg->mg_ptr, 2, char);
3157 Copy(reflags, mg->mg_ptr+2, left, char);
3158 Copy(":", mg->mg_ptr+left+2, 1, char);
3159 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3161 mg->mg_ptr[mg->mg_len - 2] = '\n';
3162 mg->mg_ptr[mg->mg_len - 1] = ')';
3163 mg->mg_ptr[mg->mg_len] = 0;
3165 PL_reginterp_cnt += re->program[0].next_off;
3167 if (re->reganch & ROPT_UTF8)
3183 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3184 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3185 /* tied lvalues should appear to be
3186 * scalars for backwards compatitbility */
3187 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3188 ? "SCALAR" : "LVALUE"; break;
3189 case SVt_PVAV: typestr = "ARRAY"; break;
3190 case SVt_PVHV: typestr = "HASH"; break;
3191 case SVt_PVCV: typestr = "CODE"; break;
3192 case SVt_PVGV: typestr = "GLOB"; break;
3193 case SVt_PVFM: typestr = "FORMAT"; break;
3194 case SVt_PVIO: typestr = "IO"; break;
3195 default: typestr = "UNKNOWN"; break;
3199 const char *name = HvNAME_get(SvSTASH(sv));
3200 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3201 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3204 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3208 *lp = strlen(typestr);
3209 return (char *)typestr;
3211 if (SvREADONLY(sv) && !SvOK(sv)) {
3212 if (ckWARN(WARN_UNINITIALIZED))
3219 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3220 /* I'm assuming that if both IV and NV are equally valid then
3221 converting the IV is going to be more efficient */
3222 const U32 isIOK = SvIOK(sv);
3223 const U32 isUIOK = SvIsUV(sv);
3224 char buf[TYPE_CHARS(UV)];
3227 if (SvTYPE(sv) < SVt_PVIV)
3228 sv_upgrade(sv, SVt_PVIV);
3230 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3232 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3233 /* inlined from sv_setpvn */
3234 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3235 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3236 SvCUR_set(sv, ebuf - ptr);
3246 else if (SvNOKp(sv)) {
3247 if (SvTYPE(sv) < SVt_PVNV)
3248 sv_upgrade(sv, SVt_PVNV);
3249 /* The +20 is pure guesswork. Configure test needed. --jhi */
3250 s = SvGROW_mutable(sv, NV_DIG + 20);
3251 olderrno = errno; /* some Xenix systems wipe out errno here */
3253 if (SvNVX(sv) == 0.0)
3254 (void)strcpy(s,"0");
3258 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3261 #ifdef FIXNEGATIVEZERO
3262 if (*s == '-' && s[1] == '0' && !s[2])
3272 if (ckWARN(WARN_UNINITIALIZED)
3273 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3277 if (SvTYPE(sv) < SVt_PV)
3278 /* Typically the caller expects that sv_any is not NULL now. */
3279 sv_upgrade(sv, SVt_PV);
3283 STRLEN len = s - SvPVX_const(sv);
3289 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3290 PTR2UV(sv),SvPVX_const(sv)));
3291 if (flags & SV_CONST_RETURN)
3292 return (char *)SvPVX_const(sv);
3293 if (flags & SV_MUTABLE_RETURN)
3294 return SvPVX_mutable(sv);
3298 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3299 /* Sneaky stuff here */
3303 tsv = newSVpv(tmpbuf, 0);
3316 t = SvPVX_const(tsv);
3321 len = strlen(tmpbuf);
3323 #ifdef FIXNEGATIVEZERO
3324 if (len == 2 && t[0] == '-' && t[1] == '0') {
3329 SvUPGRADE(sv, SVt_PV);
3332 s = SvGROW_mutable(sv, len + 1);
3335 return strcpy(s, t);
3340 =for apidoc sv_copypv
3342 Copies a stringified representation of the source SV into the
3343 destination SV. Automatically performs any necessary mg_get and
3344 coercion of numeric values into strings. Guaranteed to preserve
3345 UTF-8 flag even from overloaded objects. Similar in nature to
3346 sv_2pv[_flags] but operates directly on an SV instead of just the
3347 string. Mostly uses sv_2pv_flags to do its work, except when that
3348 would lose the UTF-8'ness of the PV.
3354 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3358 s = SvPV_const(ssv,len);
3359 sv_setpvn(dsv,s,len);
3367 =for apidoc sv_2pvbyte_nolen
3369 Return a pointer to the byte-encoded representation of the SV.
3370 May cause the SV to be downgraded from UTF-8 as a side-effect.
3372 Usually accessed via the C<SvPVbyte_nolen> macro.
3378 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3380 return sv_2pvbyte(sv, 0);
3384 =for apidoc sv_2pvbyte
3386 Return a pointer to the byte-encoded representation of the SV, and set *lp
3387 to its length. May cause the SV to be downgraded from UTF-8 as a
3390 Usually accessed via the C<SvPVbyte> macro.
3396 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3398 sv_utf8_downgrade(sv,0);
3399 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3403 =for apidoc sv_2pvutf8_nolen
3405 Return a pointer to the UTF-8-encoded representation of the SV.
3406 May cause the SV to be upgraded to UTF-8 as a side-effect.
3408 Usually accessed via the C<SvPVutf8_nolen> macro.
3414 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3416 return sv_2pvutf8(sv, 0);
3420 =for apidoc sv_2pvutf8
3422 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3423 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3425 Usually accessed via the C<SvPVutf8> macro.
3431 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3433 sv_utf8_upgrade(sv);
3434 return SvPV(sv,*lp);
3438 =for apidoc sv_2bool
3440 This function is only called on magical items, and is only used by
3441 sv_true() or its macro equivalent.
3447 Perl_sv_2bool(pTHX_ register SV *sv)
3456 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3457 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3458 return (bool)SvTRUE(tmpsv);
3459 return SvRV(sv) != 0;
3462 register XPV* Xpvtmp;
3463 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3464 (*sv->sv_u.svu_pv > '0' ||
3465 Xpvtmp->xpv_cur > 1 ||
3466 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3473 return SvIVX(sv) != 0;
3476 return SvNVX(sv) != 0.0;
3483 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3484 * this function provided for binary compatibility only
3489 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3491 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3495 =for apidoc sv_utf8_upgrade
3497 Converts the PV of an SV to its UTF-8-encoded form.
3498 Forces the SV to string form if it is not already.
3499 Always sets the SvUTF8 flag to avoid future validity checks even
3500 if all the bytes have hibit clear.
3502 This is not as a general purpose byte encoding to Unicode interface:
3503 use the Encode extension for that.
3505 =for apidoc sv_utf8_upgrade_flags
3507 Converts the PV of an SV to its UTF-8-encoded form.
3508 Forces the SV to string form if it is not already.
3509 Always sets the SvUTF8 flag to avoid future validity checks even
3510 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3511 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3512 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3514 This is not as a general purpose byte encoding to Unicode interface:
3515 use the Encode extension for that.
3521 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3523 if (sv == &PL_sv_undef)
3527 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3528 (void) sv_2pv_flags(sv,&len, flags);
3532 (void) SvPV_force(sv,len);
3541 sv_force_normal_flags(sv, 0);
3544 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3545 sv_recode_to_utf8(sv, PL_encoding);
3546 else { /* Assume Latin-1/EBCDIC */
3547 /* This function could be much more efficient if we
3548 * had a FLAG in SVs to signal if there are any hibit
3549 * chars in the PV. Given that there isn't such a flag
3550 * make the loop as fast as possible. */
3551 const U8 *s = (U8 *) SvPVX_const(sv);
3552 const U8 *e = (U8 *) SvEND(sv);
3558 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3562 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3563 U8 *recoded = bytes_to_utf8((U8*)s, &len);
3565 SvPV_free(sv); /* No longer using what was there before. */
3567 SvPV_set(sv, (char*)recoded);
3568 SvCUR_set(sv, len - 1);
3569 SvLEN_set(sv, len); /* No longer know the real size. */
3571 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3578 =for apidoc sv_utf8_downgrade
3580 Attempts to convert the PV of an SV from characters to bytes.
3581 If the PV contains a character beyond byte, this conversion will fail;
3582 in this case, either returns false or, if C<fail_ok> is not
3585 This is not as a general purpose Unicode to byte encoding interface:
3586 use the Encode extension for that.
3592 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3594 if (SvPOKp(sv) && SvUTF8(sv)) {
3600 sv_force_normal_flags(sv, 0);
3602 s = (U8 *) SvPV(sv, len);
3603 if (!utf8_to_bytes(s, &len)) {
3608 Perl_croak(aTHX_ "Wide character in %s",
3611 Perl_croak(aTHX_ "Wide character");
3622 =for apidoc sv_utf8_encode
3624 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3625 flag off so that it looks like octets again.
3631 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3633 (void) sv_utf8_upgrade(sv);
3635 sv_force_normal_flags(sv, 0);
3637 if (SvREADONLY(sv)) {
3638 Perl_croak(aTHX_ PL_no_modify);
3644 =for apidoc sv_utf8_decode
3646 If the PV of the SV is an octet sequence in UTF-8
3647 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3648 so that it looks like a character. If the PV contains only single-byte
3649 characters, the C<SvUTF8> flag stays being off.
3650 Scans PV for validity and returns false if the PV is invalid UTF-8.
3656 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3662 /* The octets may have got themselves encoded - get them back as
3665 if (!sv_utf8_downgrade(sv, TRUE))
3668 /* it is actually just a matter of turning the utf8 flag on, but
3669 * we want to make sure everything inside is valid utf8 first.
3671 c = (const U8 *) SvPVX_const(sv);
3672 if (!is_utf8_string(c, SvCUR(sv)+1))
3674 e = (const U8 *) SvEND(sv);
3677 if (!UTF8_IS_INVARIANT(ch)) {
3686 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3687 * this function provided for binary compatibility only
3691 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3693 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3697 =for apidoc sv_setsv
3699 Copies the contents of the source SV C<ssv> into the destination SV
3700 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3701 function if the source SV needs to be reused. Does not handle 'set' magic.
3702 Loosely speaking, it performs a copy-by-value, obliterating any previous
3703 content of the destination.
3705 You probably want to use one of the assortment of wrappers, such as
3706 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3707 C<SvSetMagicSV_nosteal>.
3709 =for apidoc sv_setsv_flags
3711 Copies the contents of the source SV C<ssv> into the destination SV
3712 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3713 function if the source SV needs to be reused. Does not handle 'set' magic.
3714 Loosely speaking, it performs a copy-by-value, obliterating any previous
3715 content of the destination.
3716 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3717 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3718 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3719 and C<sv_setsv_nomg> are implemented in terms of this function.
3721 You probably want to use one of the assortment of wrappers, such as
3722 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3723 C<SvSetMagicSV_nosteal>.
3725 This is the primary function for copying scalars, and most other
3726 copy-ish functions and macros use this underneath.
3732 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3734 register U32 sflags;
3740 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3742 sstr = &PL_sv_undef;
3743 stype = SvTYPE(sstr);
3744 dtype = SvTYPE(dstr);
3749 /* need to nuke the magic */
3751 SvRMAGICAL_off(dstr);
3754 /* There's a lot of redundancy below but we're going for speed here */
3759 if (dtype != SVt_PVGV) {
3760 (void)SvOK_off(dstr);
3768 sv_upgrade(dstr, SVt_IV);
3771 sv_upgrade(dstr, SVt_PVNV);
3775 sv_upgrade(dstr, SVt_PVIV);
3778 (void)SvIOK_only(dstr);
3779 SvIV_set(dstr, SvIVX(sstr));
3782 if (SvTAINTED(sstr))
3793 sv_upgrade(dstr, SVt_NV);
3798 sv_upgrade(dstr, SVt_PVNV);
3801 SvNV_set(dstr, SvNVX(sstr));
3802 (void)SvNOK_only(dstr);
3803 if (SvTAINTED(sstr))
3811 sv_upgrade(dstr, SVt_RV);
3812 else if (dtype == SVt_PVGV &&
3813 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3816 if (GvIMPORTED(dstr) != GVf_IMPORTED
3817 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3819 GvIMPORTED_on(dstr);
3828 #ifdef PERL_OLD_COPY_ON_WRITE
3829 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3830 if (dtype < SVt_PVIV)
3831 sv_upgrade(dstr, SVt_PVIV);
3838 sv_upgrade(dstr, SVt_PV);
3841 if (dtype < SVt_PVIV)
3842 sv_upgrade(dstr, SVt_PVIV);
3845 if (dtype < SVt_PVNV)
3846 sv_upgrade(dstr, SVt_PVNV);
3853 const char * const type = sv_reftype(sstr,0);
3855 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3857 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3862 if (dtype <= SVt_PVGV) {
3864 if (dtype != SVt_PVGV) {
3865 const char * const name = GvNAME(sstr);
3866 const STRLEN len = GvNAMELEN(sstr);
3867 /* don't upgrade SVt_PVLV: it can hold a glob */
3868 if (dtype != SVt_PVLV)
3869 sv_upgrade(dstr, SVt_PVGV);
3870 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3871 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3872 GvNAME(dstr) = savepvn(name, len);
3873 GvNAMELEN(dstr) = len;
3874 SvFAKE_on(dstr); /* can coerce to non-glob */
3876 /* ahem, death to those who redefine active sort subs */
3877 else if (PL_curstackinfo->si_type == PERLSI_SORT
3878 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3879 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3882 #ifdef GV_UNIQUE_CHECK
3883 if (GvUNIQUE((GV*)dstr)) {
3884 Perl_croak(aTHX_ PL_no_modify);
3888 (void)SvOK_off(dstr);
3889 GvINTRO_off(dstr); /* one-shot flag */
3891 GvGP(dstr) = gp_ref(GvGP(sstr));
3892 if (SvTAINTED(sstr))
3894 if (GvIMPORTED(dstr) != GVf_IMPORTED
3895 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3897 GvIMPORTED_on(dstr);
3905 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3907 if ((int)SvTYPE(sstr) != stype) {
3908 stype = SvTYPE(sstr);
3909 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3913 if (stype == SVt_PVLV)
3914 SvUPGRADE(dstr, SVt_PVNV);
3916 SvUPGRADE(dstr, (U32)stype);
3919 sflags = SvFLAGS(sstr);
3921 if (sflags & SVf_ROK) {
3922 if (dtype >= SVt_PV) {
3923 if (dtype == SVt_PVGV) {
3924 SV *sref = SvREFCNT_inc(SvRV(sstr));
3926 const int intro = GvINTRO(dstr);
3928 #ifdef GV_UNIQUE_CHECK
3929 if (GvUNIQUE((GV*)dstr)) {
3930 Perl_croak(aTHX_ PL_no_modify);
3935 GvINTRO_off(dstr); /* one-shot flag */
3936 GvLINE(dstr) = CopLINE(PL_curcop);
3937 GvEGV(dstr) = (GV*)dstr;
3940 switch (SvTYPE(sref)) {
3943 SAVEGENERICSV(GvAV(dstr));
3945 dref = (SV*)GvAV(dstr);
3946 GvAV(dstr) = (AV*)sref;
3947 if (!GvIMPORTED_AV(dstr)
3948 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3950 GvIMPORTED_AV_on(dstr);
3955 SAVEGENERICSV(GvHV(dstr));
3957 dref = (SV*)GvHV(dstr);
3958 GvHV(dstr) = (HV*)sref;
3959 if (!GvIMPORTED_HV(dstr)
3960 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3962 GvIMPORTED_HV_on(dstr);
3967 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3968 SvREFCNT_dec(GvCV(dstr));
3969 GvCV(dstr) = Nullcv;
3970 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3971 PL_sub_generation++;
3973 SAVEGENERICSV(GvCV(dstr));
3976 dref = (SV*)GvCV(dstr);
3977 if (GvCV(dstr) != (CV*)sref) {
3978 CV* cv = GvCV(dstr);
3980 if (!GvCVGEN((GV*)dstr) &&
3981 (CvROOT(cv) || CvXSUB(cv)))
3983 /* ahem, death to those who redefine
3984 * active sort subs */
3985 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3986 PL_sortcop == CvSTART(cv))
3988 "Can't redefine active sort subroutine %s",
3989 GvENAME((GV*)dstr));
3990 /* Redefining a sub - warning is mandatory if
3991 it was a const and its value changed. */
3992 if (ckWARN(WARN_REDEFINE)
3994 && (!CvCONST((CV*)sref)
3995 || sv_cmp(cv_const_sv(cv),
3996 cv_const_sv((CV*)sref)))))
3998 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
4000 ? "Constant subroutine %s::%s redefined"
4001 : "Subroutine %s::%s redefined",
4002 HvNAME_get(GvSTASH((GV*)dstr)),
4003 GvENAME((GV*)dstr));
4007 cv_ckproto(cv, (GV*)dstr,
4009 ? SvPVX_const(sref) : Nullch);
4011 GvCV(dstr) = (CV*)sref;
4012 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
4013 GvASSUMECV_on(dstr);
4014 PL_sub_generation++;
4016 if (!GvIMPORTED_CV(dstr)
4017 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4019 GvIMPORTED_CV_on(dstr);
4024 SAVEGENERICSV(GvIOp(dstr));
4026 dref = (SV*)GvIOp(dstr);
4027 GvIOp(dstr) = (IO*)sref;
4031 SAVEGENERICSV(GvFORM(dstr));
4033 dref = (SV*)GvFORM(dstr);
4034 GvFORM(dstr) = (CV*)sref;
4038 SAVEGENERICSV(GvSV(dstr));
4040 dref = (SV*)GvSV(dstr);
4042 if (!GvIMPORTED_SV(dstr)
4043 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4045 GvIMPORTED_SV_on(dstr);
4051 if (SvTAINTED(sstr))
4055 if (SvPVX_const(dstr)) {
4061 (void)SvOK_off(dstr);
4062 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4064 if (sflags & SVp_NOK) {
4066 /* Only set the public OK flag if the source has public OK. */
4067 if (sflags & SVf_NOK)
4068 SvFLAGS(dstr) |= SVf_NOK;
4069 SvNV_set(dstr, SvNVX(sstr));
4071 if (sflags & SVp_IOK) {
4072 (void)SvIOKp_on(dstr);
4073 if (sflags & SVf_IOK)
4074 SvFLAGS(dstr) |= SVf_IOK;
4075 if (sflags & SVf_IVisUV)
4077 SvIV_set(dstr, SvIVX(sstr));
4079 if (SvAMAGIC(sstr)) {
4083 else if (sflags & SVp_POK) {
4087 * Check to see if we can just swipe the string. If so, it's a
4088 * possible small lose on short strings, but a big win on long ones.
4089 * It might even be a win on short strings if SvPVX_const(dstr)
4090 * has to be allocated and SvPVX_const(sstr) has to be freed.
4093 /* Whichever path we take through the next code, we want this true,
4094 and doing it now facilitates the COW check. */
4095 (void)SvPOK_only(dstr);
4098 /* We're not already COW */
4099 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4100 #ifndef PERL_OLD_COPY_ON_WRITE
4101 /* or we are, but dstr isn't a suitable target. */
4102 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4107 (sflags & SVs_TEMP) && /* slated for free anyway? */
4108 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4109 (!(flags & SV_NOSTEAL)) &&
4110 /* and we're allowed to steal temps */
4111 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4112 SvLEN(sstr) && /* and really is a string */
4113 /* and won't be needed again, potentially */
4114 !(PL_op && PL_op->op_type == OP_AASSIGN))
4115 #ifdef PERL_OLD_COPY_ON_WRITE
4116 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4117 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4118 && SvTYPE(sstr) >= SVt_PVIV)
4121 /* Failed the swipe test, and it's not a shared hash key either.
4122 Have to copy the string. */
4123 STRLEN len = SvCUR(sstr);
4124 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4125 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4126 SvCUR_set(dstr, len);
4127 *SvEND(dstr) = '\0';
4129 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4131 /* Either it's a shared hash key, or it's suitable for
4132 copy-on-write or we can swipe the string. */
4134 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4138 #ifdef PERL_OLD_COPY_ON_WRITE
4140 /* I believe I should acquire a global SV mutex if
4141 it's a COW sv (not a shared hash key) to stop
4142 it going un copy-on-write.
4143 If the source SV has gone un copy on write between up there
4144 and down here, then (assert() that) it is of the correct
4145 form to make it copy on write again */
4146 if ((sflags & (SVf_FAKE | SVf_READONLY))
4147 != (SVf_FAKE | SVf_READONLY)) {
4148 SvREADONLY_on(sstr);
4150 /* Make the source SV into a loop of 1.
4151 (about to become 2) */
4152 SV_COW_NEXT_SV_SET(sstr, sstr);
4156 /* Initial code is common. */
4157 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4159 SvFLAGS(dstr) &= ~SVf_OOK;
4160 Safefree(SvPVX_const(dstr) - SvIVX(dstr));
4162 else if (SvLEN(dstr))
4163 Safefree(SvPVX_const(dstr));
4167 /* making another shared SV. */
4168 STRLEN cur = SvCUR(sstr);
4169 STRLEN len = SvLEN(sstr);
4170 #ifdef PERL_OLD_COPY_ON_WRITE
4172 assert (SvTYPE(dstr) >= SVt_PVIV);
4173 /* SvIsCOW_normal */
4174 /* splice us in between source and next-after-source. */
4175 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4176 SV_COW_NEXT_SV_SET(sstr, dstr);
4177 SvPV_set(dstr, SvPVX_mutable(sstr));
4181 /* SvIsCOW_shared_hash */
4182 DEBUG_C(PerlIO_printf(Perl_debug_log,
4183 "Copy on write: Sharing hash\n"));
4185 assert (SvTYPE(dstr) >= SVt_PV);
4187 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4189 SvLEN_set(dstr, len);
4190 SvCUR_set(dstr, cur);
4191 SvREADONLY_on(dstr);
4193 /* Relesase a global SV mutex. */
4196 { /* Passes the swipe test. */
4197 SvPV_set(dstr, SvPVX_mutable(sstr));
4198 SvLEN_set(dstr, SvLEN(sstr));
4199 SvCUR_set(dstr, SvCUR(sstr));
4202 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4203 SvPV_set(sstr, Nullch);
4209 if (sflags & SVf_UTF8)
4211 if (sflags & SVp_NOK) {
4213 if (sflags & SVf_NOK)
4214 SvFLAGS(dstr) |= SVf_NOK;
4215 SvNV_set(dstr, SvNVX(sstr));
4217 if (sflags & SVp_IOK) {
4218 (void)SvIOKp_on(dstr);
4219 if (sflags & SVf_IOK)
4220 SvFLAGS(dstr) |= SVf_IOK;
4221 if (sflags & SVf_IVisUV)
4223 SvIV_set(dstr, SvIVX(sstr));
4226 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4227 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4228 smg->mg_ptr, smg->mg_len);
4229 SvRMAGICAL_on(dstr);
4232 else if (sflags & SVp_IOK) {
4233 if (sflags & SVf_IOK)
4234 (void)SvIOK_only(dstr);
4236 (void)SvOK_off(dstr);
4237 (void)SvIOKp_on(dstr);
4239 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4240 if (sflags & SVf_IVisUV)
4242 SvIV_set(dstr, SvIVX(sstr));
4243 if (sflags & SVp_NOK) {
4244 if (sflags & SVf_NOK)
4245 (void)SvNOK_on(dstr);
4247 (void)SvNOKp_on(dstr);
4248 SvNV_set(dstr, SvNVX(sstr));
4251 else if (sflags & SVp_NOK) {
4252 if (sflags & SVf_NOK)
4253 (void)SvNOK_only(dstr);
4255 (void)SvOK_off(dstr);
4258 SvNV_set(dstr, SvNVX(sstr));
4261 if (dtype == SVt_PVGV) {
4262 if (ckWARN(WARN_MISC))
4263 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4266 (void)SvOK_off(dstr);
4268 if (SvTAINTED(sstr))
4273 =for apidoc sv_setsv_mg
4275 Like C<sv_setsv>, but also handles 'set' magic.
4281 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4283 sv_setsv(dstr,sstr);
4287 #ifdef PERL_OLD_COPY_ON_WRITE
4289 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4291 STRLEN cur = SvCUR(sstr);
4292 STRLEN len = SvLEN(sstr);
4293 register char *new_pv;
4296 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4304 if (SvTHINKFIRST(dstr))
4305 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4306 else if (SvPVX_const(dstr))
4307 Safefree(SvPVX_const(dstr));
4311 SvUPGRADE(dstr, SVt_PVIV);
4313 assert (SvPOK(sstr));
4314 assert (SvPOKp(sstr));
4315 assert (!SvIOK(sstr));
4316 assert (!SvIOKp(sstr));
4317 assert (!SvNOK(sstr));
4318 assert (!SvNOKp(sstr));
4320 if (SvIsCOW(sstr)) {
4322 if (SvLEN(sstr) == 0) {
4323 /* source is a COW shared hash key. */
4324 DEBUG_C(PerlIO_printf(Perl_debug_log,
4325 "Fast copy on write: Sharing hash\n"));
4326 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4329 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4331 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4332 SvUPGRADE(sstr, SVt_PVIV);
4333 SvREADONLY_on(sstr);
4335 DEBUG_C(PerlIO_printf(Perl_debug_log,
4336 "Fast copy on write: Converting sstr to COW\n"));
4337 SV_COW_NEXT_SV_SET(dstr, sstr);
4339 SV_COW_NEXT_SV_SET(sstr, dstr);
4340 new_pv = SvPVX_mutable(sstr);
4343 SvPV_set(dstr, new_pv);
4344 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4347 SvLEN_set(dstr, len);
4348 SvCUR_set(dstr, cur);
4357 =for apidoc sv_setpvn
4359 Copies a string into an SV. The C<len> parameter indicates the number of
4360 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4361 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4367 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4369 register char *dptr;
4371 SV_CHECK_THINKFIRST_COW_DROP(sv);
4377 /* len is STRLEN which is unsigned, need to copy to signed */
4380 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4382 SvUPGRADE(sv, SVt_PV);
4384 dptr = SvGROW(sv, len + 1);
4385 Move(ptr,dptr,len,char);
4388 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4393 =for apidoc sv_setpvn_mg
4395 Like C<sv_setpvn>, but also handles 'set' magic.
4401 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4403 sv_setpvn(sv,ptr,len);
4408 =for apidoc sv_setpv
4410 Copies a string into an SV. The string must be null-terminated. Does not
4411 handle 'set' magic. See C<sv_setpv_mg>.
4417 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4419 register STRLEN len;
4421 SV_CHECK_THINKFIRST_COW_DROP(sv);
4427 SvUPGRADE(sv, SVt_PV);
4429 SvGROW(sv, len + 1);
4430 Move(ptr,SvPVX(sv),len+1,char);
4432 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4437 =for apidoc sv_setpv_mg
4439 Like C<sv_setpv>, but also handles 'set' magic.
4445 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4452 =for apidoc sv_usepvn
4454 Tells an SV to use C<ptr> to find its string value. Normally the string is
4455 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4456 The C<ptr> should point to memory that was allocated by C<malloc>. The
4457 string length, C<len>, must be supplied. This function will realloc the
4458 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4459 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4460 See C<sv_usepvn_mg>.
4466 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4469 SV_CHECK_THINKFIRST_COW_DROP(sv);
4470 SvUPGRADE(sv, SVt_PV);
4475 if (SvPVX_const(sv))
4478 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4479 ptr = saferealloc (ptr, allocate);
4482 SvLEN_set(sv, allocate);
4484 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4489 =for apidoc sv_usepvn_mg
4491 Like C<sv_usepvn>, but also handles 'set' magic.
4497 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4499 sv_usepvn(sv,ptr,len);
4503 #ifdef PERL_OLD_COPY_ON_WRITE
4504 /* Need to do this *after* making the SV normal, as we need the buffer
4505 pointer to remain valid until after we've copied it. If we let go too early,
4506 another thread could invalidate it by unsharing last of the same hash key
4507 (which it can do by means other than releasing copy-on-write Svs)
4508 or by changing the other copy-on-write SVs in the loop. */
4510 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4512 if (len) { /* this SV was SvIsCOW_normal(sv) */
4513 /* we need to find the SV pointing to us. */
4514 SV *current = SV_COW_NEXT_SV(after);
4516 if (current == sv) {
4517 /* The SV we point to points back to us (there were only two of us
4519 Hence other SV is no longer copy on write either. */
4521 SvREADONLY_off(after);
4523 /* We need to follow the pointers around the loop. */
4525 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4528 /* don't loop forever if the structure is bust, and we have
4529 a pointer into a closed loop. */
4530 assert (current != after);
4531 assert (SvPVX_const(current) == pvx);
4533 /* Make the SV before us point to the SV after us. */
4534 SV_COW_NEXT_SV_SET(current, after);
4537 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4542 Perl_sv_release_IVX(pTHX_ register SV *sv)
4545 sv_force_normal_flags(sv, 0);
4551 =for apidoc sv_force_normal_flags
4553 Undo various types of fakery on an SV: if the PV is a shared string, make
4554 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4555 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4556 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4557 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4558 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4559 set to some other value.) In addition, the C<flags> parameter gets passed to
4560 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4561 with flags set to 0.
4567 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4569 #ifdef PERL_OLD_COPY_ON_WRITE
4570 if (SvREADONLY(sv)) {
4571 /* At this point I believe I should acquire a global SV mutex. */
4573 const char *pvx = SvPVX_const(sv);
4574 const STRLEN len = SvLEN(sv);
4575 const STRLEN cur = SvCUR(sv);
4576 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4578 PerlIO_printf(Perl_debug_log,
4579 "Copy on write: Force normal %ld\n",
4585 /* This SV doesn't own the buffer, so need to New() a new one: */
4586 SvPV_set(sv, (char*)0);
4588 if (flags & SV_COW_DROP_PV) {
4589 /* OK, so we don't need to copy our buffer. */
4592 SvGROW(sv, cur + 1);
4593 Move(pvx,SvPVX(sv),cur,char);
4597 sv_release_COW(sv, pvx, len, next);
4602 else if (IN_PERL_RUNTIME)
4603 Perl_croak(aTHX_ PL_no_modify);
4604 /* At this point I believe that I can drop the global SV mutex. */
4607 if (SvREADONLY(sv)) {
4609 const char *pvx = SvPVX_const(sv);
4610 const STRLEN len = SvCUR(sv);
4613 SvPV_set(sv, Nullch);
4615 SvGROW(sv, len + 1);
4616 Move(pvx,SvPVX_const(sv),len,char);
4618 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4620 else if (IN_PERL_RUNTIME)
4621 Perl_croak(aTHX_ PL_no_modify);
4625 sv_unref_flags(sv, flags);
4626 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4631 =for apidoc sv_force_normal
4633 Undo various types of fakery on an SV: if the PV is a shared string, make
4634 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4635 an xpvmg. See also C<sv_force_normal_flags>.
4641 Perl_sv_force_normal(pTHX_ register SV *sv)
4643 sv_force_normal_flags(sv, 0);
4649 Efficient removal of characters from the beginning of the string buffer.
4650 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4651 the string buffer. The C<ptr> becomes the first character of the adjusted
4652 string. Uses the "OOK hack".
4653 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4654 refer to the same chunk of data.
4660 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4662 register STRLEN delta;
4663 if (!ptr || !SvPOKp(sv))
4665 delta = ptr - SvPVX_const(sv);
4666 SV_CHECK_THINKFIRST(sv);
4667 if (SvTYPE(sv) < SVt_PVIV)
4668 sv_upgrade(sv,SVt_PVIV);
4671 if (!SvLEN(sv)) { /* make copy of shared string */
4672 const char *pvx = SvPVX_const(sv);
4673 const STRLEN len = SvCUR(sv);
4674 SvGROW(sv, len + 1);
4675 Move(pvx,SvPVX_const(sv),len,char);
4679 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4680 and we do that anyway inside the SvNIOK_off
4682 SvFLAGS(sv) |= SVf_OOK;
4685 SvLEN_set(sv, SvLEN(sv) - delta);
4686 SvCUR_set(sv, SvCUR(sv) - delta);
4687 SvPV_set(sv, SvPVX(sv) + delta);
4688 SvIV_set(sv, SvIVX(sv) + delta);
4691 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4692 * this function provided for binary compatibility only
4696 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4698 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4702 =for apidoc sv_catpvn
4704 Concatenates the string onto the end of the string which is in the SV. The
4705 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4706 status set, then the bytes appended should be valid UTF-8.
4707 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4709 =for apidoc sv_catpvn_flags
4711 Concatenates the string onto the end of the string which is in the SV. The
4712 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4713 status set, then the bytes appended should be valid UTF-8.
4714 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4715 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4716 in terms of this function.
4722 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4725 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4727 SvGROW(dsv, dlen + slen + 1);
4729 sstr = SvPVX_const(dsv);
4730 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4731 SvCUR_set(dsv, SvCUR(dsv) + slen);
4733 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4738 =for apidoc sv_catpvn_mg
4740 Like C<sv_catpvn>, but also handles 'set' magic.
4746 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4748 sv_catpvn(sv,ptr,len);
4752 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4753 * this function provided for binary compatibility only
4757 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4759 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4763 =for apidoc sv_catsv
4765 Concatenates the string from SV C<ssv> onto the end of the string in
4766 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4767 not 'set' magic. See C<sv_catsv_mg>.
4769 =for apidoc sv_catsv_flags
4771 Concatenates the string from SV C<ssv> onto the end of the string in
4772 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4773 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4774 and C<sv_catsv_nomg> are implemented in terms of this function.
4779 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4785 if ((spv = SvPV_const(ssv, slen))) {
4786 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4787 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4788 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4789 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4790 dsv->sv_flags doesn't have that bit set.
4791 Andy Dougherty 12 Oct 2001
4793 const I32 sutf8 = DO_UTF8(ssv);
4796 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4798 dutf8 = DO_UTF8(dsv);
4800 if (dutf8 != sutf8) {
4802 /* Not modifying source SV, so taking a temporary copy. */
4803 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4805 sv_utf8_upgrade(csv);
4806 spv = SvPV_const(csv, slen);
4809 sv_utf8_upgrade_nomg(dsv);
4811 sv_catpvn_nomg(dsv, spv, slen);
4816 =for apidoc sv_catsv_mg
4818 Like C<sv_catsv>, but also handles 'set' magic.
4824 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4831 =for apidoc sv_catpv
4833 Concatenates the string onto the end of the string which is in the SV.
4834 If the SV has the UTF-8 status set, then the bytes appended should be
4835 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4840 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4842 register STRLEN len;
4848 junk = SvPV_force(sv, tlen);
4850 SvGROW(sv, tlen + len + 1);
4852 ptr = SvPVX_const(sv);
4853 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4854 SvCUR_set(sv, SvCUR(sv) + len);
4855 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4860 =for apidoc sv_catpv_mg
4862 Like C<sv_catpv>, but also handles 'set' magic.
4868 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4877 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4878 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4885 Perl_newSV(pTHX_ STRLEN len)
4891 sv_upgrade(sv, SVt_PV);
4892 SvGROW(sv, len + 1);
4897 =for apidoc sv_magicext
4899 Adds magic to an SV, upgrading it if necessary. Applies the
4900 supplied vtable and returns a pointer to the magic added.
4902 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4903 In particular, you can add magic to SvREADONLY SVs, and add more than
4904 one instance of the same 'how'.
4906 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4907 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4908 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4909 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4911 (This is now used as a subroutine by C<sv_magic>.)
4916 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4917 const char* name, I32 namlen)
4921 if (SvTYPE(sv) < SVt_PVMG) {
4922 SvUPGRADE(sv, SVt_PVMG);
4924 Newz(702,mg, 1, MAGIC);
4925 mg->mg_moremagic = SvMAGIC(sv);
4926 SvMAGIC_set(sv, mg);
4928 /* Sometimes a magic contains a reference loop, where the sv and
4929 object refer to each other. To prevent a reference loop that
4930 would prevent such objects being freed, we look for such loops
4931 and if we find one we avoid incrementing the object refcount.
4933 Note we cannot do this to avoid self-tie loops as intervening RV must
4934 have its REFCNT incremented to keep it in existence.
4937 if (!obj || obj == sv ||
4938 how == PERL_MAGIC_arylen ||
4939 how == PERL_MAGIC_qr ||
4940 how == PERL_MAGIC_symtab ||
4941 (SvTYPE(obj) == SVt_PVGV &&
4942 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4943 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4944 GvFORM(obj) == (CV*)sv)))
4949 mg->mg_obj = SvREFCNT_inc(obj);
4950 mg->mg_flags |= MGf_REFCOUNTED;
4953 /* Normal self-ties simply pass a null object, and instead of
4954 using mg_obj directly, use the SvTIED_obj macro to produce a
4955 new RV as needed. For glob "self-ties", we are tieing the PVIO
4956 with an RV obj pointing to the glob containing the PVIO. In
4957 this case, to avoid a reference loop, we need to weaken the
4961 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4962 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4968 mg->mg_len = namlen;
4971 mg->mg_ptr = savepvn(name, namlen);
4972 else if (namlen == HEf_SVKEY)
4973 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4975 mg->mg_ptr = (char *) name;
4977 mg->mg_virtual = vtable;
4981 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4986 =for apidoc sv_magic
4988 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4989 then adds a new magic item of type C<how> to the head of the magic list.
4991 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4992 handling of the C<name> and C<namlen> arguments.
4994 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4995 to add more than one instance of the same 'how'.
5001 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
5003 const MGVTBL *vtable = 0;
5006 #ifdef PERL_OLD_COPY_ON_WRITE
5008 sv_force_normal_flags(sv, 0);
5010 if (SvREADONLY(sv)) {
5012 && how != PERL_MAGIC_regex_global
5013 && how != PERL_MAGIC_bm
5014 && how != PERL_MAGIC_fm
5015 && how != PERL_MAGIC_sv
5016 && how != PERL_MAGIC_backref
5019 Perl_croak(aTHX_ PL_no_modify);
5022 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
5023 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5024 /* sv_magic() refuses to add a magic of the same 'how' as an
5027 if (how == PERL_MAGIC_taint)
5035 vtable = &PL_vtbl_sv;
5037 case PERL_MAGIC_overload:
5038 vtable = &PL_vtbl_amagic;
5040 case PERL_MAGIC_overload_elem:
5041 vtable = &PL_vtbl_amagicelem;
5043 case PERL_MAGIC_overload_table:
5044 vtable = &PL_vtbl_ovrld;
5047 vtable = &PL_vtbl_bm;
5049 case PERL_MAGIC_regdata:
5050 vtable = &PL_vtbl_regdata;
5052 case PERL_MAGIC_regdatum:
5053 vtable = &PL_vtbl_regdatum;
5055 case PERL_MAGIC_env:
5056 vtable = &PL_vtbl_env;
5059 vtable = &PL_vtbl_fm;
5061 case PERL_MAGIC_envelem:
5062 vtable = &PL_vtbl_envelem;
5064 case PERL_MAGIC_regex_global:
5065 vtable = &PL_vtbl_mglob;
5067 case PERL_MAGIC_isa:
5068 vtable = &PL_vtbl_isa;
5070 case PERL_MAGIC_isaelem:
5071 vtable = &PL_vtbl_isaelem;
5073 case PERL_MAGIC_nkeys:
5074 vtable = &PL_vtbl_nkeys;
5076 case PERL_MAGIC_dbfile:
5079 case PERL_MAGIC_dbline:
5080 vtable = &PL_vtbl_dbline;
5082 #ifdef USE_LOCALE_COLLATE
5083 case PERL_MAGIC_collxfrm:
5084 vtable = &PL_vtbl_collxfrm;
5086 #endif /* USE_LOCALE_COLLATE */
5087 case PERL_MAGIC_tied:
5088 vtable = &PL_vtbl_pack;
5090 case PERL_MAGIC_tiedelem:
5091 case PERL_MAGIC_tiedscalar:
5092 vtable = &PL_vtbl_packelem;
5095 vtable = &PL_vtbl_regexp;
5097 case PERL_MAGIC_sig:
5098 vtable = &PL_vtbl_sig;
5100 case PERL_MAGIC_sigelem:
5101 vtable = &PL_vtbl_sigelem;
5103 case PERL_MAGIC_taint:
5104 vtable = &PL_vtbl_taint;
5106 case PERL_MAGIC_uvar:
5107 vtable = &PL_vtbl_uvar;
5109 case PERL_MAGIC_vec:
5110 vtable = &PL_vtbl_vec;
5112 case PERL_MAGIC_arylen_p:
5113 case PERL_MAGIC_rhash:
5114 case PERL_MAGIC_symtab:
5115 case PERL_MAGIC_vstring:
5118 case PERL_MAGIC_utf8:
5119 vtable = &PL_vtbl_utf8;
5121 case PERL_MAGIC_substr:
5122 vtable = &PL_vtbl_substr;
5124 case PERL_MAGIC_defelem:
5125 vtable = &PL_vtbl_defelem;
5127 case PERL_MAGIC_glob:
5128 vtable = &PL_vtbl_glob;
5130 case PERL_MAGIC_arylen:
5131 vtable = &PL_vtbl_arylen;
5133 case PERL_MAGIC_pos:
5134 vtable = &PL_vtbl_pos;
5136 case PERL_MAGIC_backref:
5137 vtable = &PL_vtbl_backref;
5139 case PERL_MAGIC_ext:
5140 /* Reserved for use by extensions not perl internals. */
5141 /* Useful for attaching extension internal data to perl vars. */
5142 /* Note that multiple extensions may clash if magical scalars */
5143 /* etc holding private data from one are passed to another. */
5146 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5149 /* Rest of work is done else where */
5150 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5153 case PERL_MAGIC_taint:
5156 case PERL_MAGIC_ext:
5157 case PERL_MAGIC_dbfile:
5164 =for apidoc sv_unmagic
5166 Removes all magic of type C<type> from an SV.
5172 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5176 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5179 for (mg = *mgp; mg; mg = *mgp) {
5180 if (mg->mg_type == type) {
5181 const MGVTBL* const vtbl = mg->mg_virtual;
5182 *mgp = mg->mg_moremagic;
5183 if (vtbl && vtbl->svt_free)
5184 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5185 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5187 Safefree(mg->mg_ptr);
5188 else if (mg->mg_len == HEf_SVKEY)
5189 SvREFCNT_dec((SV*)mg->mg_ptr);
5190 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5191 Safefree(mg->mg_ptr);
5193 if (mg->mg_flags & MGf_REFCOUNTED)
5194 SvREFCNT_dec(mg->mg_obj);
5198 mgp = &mg->mg_moremagic;
5202 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5209 =for apidoc sv_rvweaken
5211 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5212 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5213 push a back-reference to this RV onto the array of backreferences
5214 associated with that magic.
5220 Perl_sv_rvweaken(pTHX_ SV *sv)
5223 if (!SvOK(sv)) /* let undefs pass */
5226 Perl_croak(aTHX_ "Can't weaken a nonreference");
5227 else if (SvWEAKREF(sv)) {
5228 if (ckWARN(WARN_MISC))
5229 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5233 sv_add_backref(tsv, sv);
5239 /* Give tsv backref magic if it hasn't already got it, then push a
5240 * back-reference to sv onto the array associated with the backref magic.
5244 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5248 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5249 av = (AV*)mg->mg_obj;
5252 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5253 /* av now has a refcnt of 2, which avoids it getting freed
5254 * before us during global cleanup. The extra ref is removed
5255 * by magic_killbackrefs() when tsv is being freed */
5257 if (AvFILLp(av) >= AvMAX(av)) {
5259 SV **svp = AvARRAY(av);
5260 for (i = AvFILLp(av); i >= 0; i--)
5262 svp[i] = sv; /* reuse the slot */
5265 av_extend(av, AvFILLp(av)+1);
5267 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5270 /* delete a back-reference to ourselves from the backref magic associated
5271 * with the SV we point to.
5275 S_sv_del_backref(pTHX_ SV *sv)
5282 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5283 Perl_croak(aTHX_ "panic: del_backref");
5284 av = (AV *)mg->mg_obj;
5286 for (i = AvFILLp(av); i >= 0; i--)
5287 if (svp[i] == sv) svp[i] = Nullsv;
5291 =for apidoc sv_insert
5293 Inserts a string at the specified offset/length within the SV. Similar to
5294 the Perl substr() function.
5300 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5304 register char *midend;
5305 register char *bigend;
5311 Perl_croak(aTHX_ "Can't modify non-existent substring");
5312 SvPV_force(bigstr, curlen);
5313 (void)SvPOK_only_UTF8(bigstr);
5314 if (offset + len > curlen) {
5315 SvGROW(bigstr, offset+len+1);
5316 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5317 SvCUR_set(bigstr, offset+len);
5321 i = littlelen - len;
5322 if (i > 0) { /* string might grow */
5323 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5324 mid = big + offset + len;
5325 midend = bigend = big + SvCUR(bigstr);
5328 while (midend > mid) /* shove everything down */
5329 *--bigend = *--midend;
5330 Move(little,big+offset,littlelen,char);
5331 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5336 Move(little,SvPVX(bigstr)+offset,len,char);
5341 big = SvPVX(bigstr);
5344 bigend = big + SvCUR(bigstr);
5346 if (midend > bigend)
5347 Perl_croak(aTHX_ "panic: sv_insert");
5349 if (mid - big > bigend - midend) { /* faster to shorten from end */
5351 Move(little, mid, littlelen,char);
5354 i = bigend - midend;
5356 Move(midend, mid, i,char);
5360 SvCUR_set(bigstr, mid - big);
5362 else if ((i = mid - big)) { /* faster from front */
5363 midend -= littlelen;
5365 sv_chop(bigstr,midend-i);
5370 Move(little, mid, littlelen,char);
5372 else if (littlelen) {
5373 midend -= littlelen;
5374 sv_chop(bigstr,midend);
5375 Move(little,midend,littlelen,char);
5378 sv_chop(bigstr,midend);
5384 =for apidoc sv_replace
5386 Make the first argument a copy of the second, then delete the original.
5387 The target SV physically takes over ownership of the body of the source SV
5388 and inherits its flags; however, the target keeps any magic it owns,
5389 and any magic in the source is discarded.
5390 Note that this is a rather specialist SV copying operation; most of the
5391 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5397 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5399 const U32 refcnt = SvREFCNT(sv);
5400 SV_CHECK_THINKFIRST_COW_DROP(sv);
5401 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5402 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5403 if (SvMAGICAL(sv)) {
5407 sv_upgrade(nsv, SVt_PVMG);
5408 SvMAGIC_set(nsv, SvMAGIC(sv));
5409 SvFLAGS(nsv) |= SvMAGICAL(sv);
5411 SvMAGIC_set(sv, NULL);
5415 assert(!SvREFCNT(sv));
5416 #ifdef DEBUG_LEAKING_SCALARS
5417 sv->sv_flags = nsv->sv_flags;
5418 sv->sv_any = nsv->sv_any;
5419 sv->sv_refcnt = nsv->sv_refcnt;
5420 sv->sv_u = nsv->sv_u;
5422 StructCopy(nsv,sv,SV);
5424 /* Currently could join these into one piece of pointer arithmetic, but
5425 it would be unclear. */
5426 if(SvTYPE(sv) == SVt_IV)
5428 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5429 else if (SvTYPE(sv) == SVt_RV) {
5430 SvANY(sv) = &sv->sv_u.svu_rv;
5434 #ifdef PERL_OLD_COPY_ON_WRITE
5435 if (SvIsCOW_normal(nsv)) {
5436 /* We need to follow the pointers around the loop to make the
5437 previous SV point to sv, rather than nsv. */
5440 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5443 assert(SvPVX_const(current) == SvPVX_const(nsv));
5445 /* Make the SV before us point to the SV after us. */
5447 PerlIO_printf(Perl_debug_log, "previous is\n");
5449 PerlIO_printf(Perl_debug_log,
5450 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5451 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5453 SV_COW_NEXT_SV_SET(current, sv);
5456 SvREFCNT(sv) = refcnt;
5457 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5463 =for apidoc sv_clear
5465 Clear an SV: call any destructors, free up any memory used by the body,
5466 and free the body itself. The SV's head is I<not> freed, although
5467 its type is set to all 1's so that it won't inadvertently be assumed
5468 to be live during global destruction etc.
5469 This function should only be called when REFCNT is zero. Most of the time
5470 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5477 Perl_sv_clear(pTHX_ register SV *sv)
5482 assert(SvREFCNT(sv) == 0);
5485 if (PL_defstash) { /* Still have a symbol table? */
5489 stash = SvSTASH(sv);
5490 destructor = StashHANDLER(stash,DESTROY);
5492 SV* tmpref = newRV(sv);
5493 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5495 PUSHSTACKi(PERLSI_DESTROY);
5500 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5506 if(SvREFCNT(tmpref) < 2) {
5507 /* tmpref is not kept alive! */
5509 SvRV_set(tmpref, NULL);
5512 SvREFCNT_dec(tmpref);
5514 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5518 if (PL_in_clean_objs)
5519 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5521 /* DESTROY gave object new lease on life */
5527 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5528 SvOBJECT_off(sv); /* Curse the object. */
5529 if (SvTYPE(sv) != SVt_PVIO)
5530 --PL_sv_objcount; /* XXX Might want something more general */
5533 if (SvTYPE(sv) >= SVt_PVMG) {
5536 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5537 SvREFCNT_dec(SvSTASH(sv));
5540 switch (SvTYPE(sv)) {
5543 IoIFP(sv) != PerlIO_stdin() &&
5544 IoIFP(sv) != PerlIO_stdout() &&
5545 IoIFP(sv) != PerlIO_stderr())
5547 io_close((IO*)sv, FALSE);
5549 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5550 PerlDir_close(IoDIRP(sv));
5551 IoDIRP(sv) = (DIR*)NULL;
5552 Safefree(IoTOP_NAME(sv));
5553 Safefree(IoFMT_NAME(sv));
5554 Safefree(IoBOTTOM_NAME(sv));
5569 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5570 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5571 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5572 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5574 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5575 SvREFCNT_dec(LvTARG(sv));
5579 Safefree(GvNAME(sv));
5580 /* cannot decrease stash refcount yet, as we might recursively delete
5581 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5582 of stash until current sv is completely gone.
5583 -- JohnPC, 27 Mar 1998 */
5584 stash = GvSTASH(sv);
5590 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5592 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5593 /* Don't even bother with turning off the OOK flag. */
5602 SvREFCNT_dec(SvRV(sv));
5604 #ifdef PERL_OLD_COPY_ON_WRITE
5605 else if (SvPVX_const(sv)) {
5607 /* I believe I need to grab the global SV mutex here and
5608 then recheck the COW status. */
5610 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5613 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5614 SV_COW_NEXT_SV(sv));
5615 /* And drop it here. */
5617 } else if (SvLEN(sv)) {
5618 Safefree(SvPVX_const(sv));
5622 else if (SvPVX_const(sv) && SvLEN(sv))
5623 Safefree(SvPVX_const(sv));
5624 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5625 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5638 switch (SvTYPE(sv)) {
5652 del_XPVIV(SvANY(sv));
5655 del_XPVNV(SvANY(sv));
5658 del_XPVMG(SvANY(sv));
5661 del_XPVLV(SvANY(sv));
5664 del_XPVAV(SvANY(sv));
5667 del_XPVHV(SvANY(sv));
5670 del_XPVCV(SvANY(sv));
5673 del_XPVGV(SvANY(sv));
5674 /* code duplication for increased performance. */
5675 SvFLAGS(sv) &= SVf_BREAK;
5676 SvFLAGS(sv) |= SVTYPEMASK;
5677 /* decrease refcount of the stash that owns this GV, if any */
5679 SvREFCNT_dec(stash);
5680 return; /* not break, SvFLAGS reset already happened */
5682 del_XPVBM(SvANY(sv));
5685 del_XPVFM(SvANY(sv));
5688 del_XPVIO(SvANY(sv));
5691 SvFLAGS(sv) &= SVf_BREAK;
5692 SvFLAGS(sv) |= SVTYPEMASK;
5696 =for apidoc sv_newref
5698 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5705 Perl_sv_newref(pTHX_ SV *sv)
5715 Decrement an SV's reference count, and if it drops to zero, call
5716 C<sv_clear> to invoke destructors and free up any memory used by
5717 the body; finally, deallocate the SV's head itself.
5718 Normally called via a wrapper macro C<SvREFCNT_dec>.
5724 Perl_sv_free(pTHX_ SV *sv)
5729 if (SvREFCNT(sv) == 0) {
5730 if (SvFLAGS(sv) & SVf_BREAK)
5731 /* this SV's refcnt has been artificially decremented to
5732 * trigger cleanup */
5734 if (PL_in_clean_all) /* All is fair */
5736 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5737 /* make sure SvREFCNT(sv)==0 happens very seldom */
5738 SvREFCNT(sv) = (~(U32)0)/2;
5741 if (ckWARN_d(WARN_INTERNAL))
5742 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5743 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5744 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5747 if (--(SvREFCNT(sv)) > 0)
5749 Perl_sv_free2(aTHX_ sv);
5753 Perl_sv_free2(pTHX_ SV *sv)
5758 if (ckWARN_d(WARN_DEBUGGING))
5759 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5760 "Attempt to free temp prematurely: SV 0x%"UVxf
5761 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5765 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5766 /* make sure SvREFCNT(sv)==0 happens very seldom */
5767 SvREFCNT(sv) = (~(U32)0)/2;
5778 Returns the length of the string in the SV. Handles magic and type
5779 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5785 Perl_sv_len(pTHX_ register SV *sv)
5793 len = mg_length(sv);
5795 (void)SvPV_const(sv, len);
5800 =for apidoc sv_len_utf8
5802 Returns the number of characters in the string in an SV, counting wide
5803 UTF-8 bytes as a single character. Handles magic and type coercion.
5809 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5810 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5811 * (Note that the mg_len is not the length of the mg_ptr field.)
5816 Perl_sv_len_utf8(pTHX_ register SV *sv)
5822 return mg_length(sv);
5826 const U8 *s = (U8*)SvPV_const(sv, len);
5827 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5829 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5831 #ifdef PERL_UTF8_CACHE_ASSERT
5832 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5836 ulen = Perl_utf8_length(aTHX_ s, s + len);
5837 if (!mg && !SvREADONLY(sv)) {
5838 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5839 mg = mg_find(sv, PERL_MAGIC_utf8);
5849 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5850 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5851 * between UTF-8 and byte offsets. There are two (substr offset and substr
5852 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5853 * and byte offset) cache positions.
5855 * The mg_len field is used by sv_len_utf8(), see its comments.
5856 * Note that the mg_len is not the length of the mg_ptr field.
5860 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5861 I32 offsetp, const U8 *s, const U8 *start)
5865 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5867 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5871 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5873 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5874 (*mgp)->mg_ptr = (char *) *cachep;
5878 (*cachep)[i] = offsetp;
5879 (*cachep)[i+1] = s - start;
5887 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5888 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5889 * between UTF-8 and byte offsets. See also the comments of
5890 * S_utf8_mg_pos_init().
5894 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, const U8 **sp, const U8 *start, const U8 *send)
5898 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5900 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5901 if (*mgp && (*mgp)->mg_ptr) {
5902 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5903 ASSERT_UTF8_CACHE(*cachep);
5904 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5906 else { /* We will skip to the right spot. */
5911 /* The assumption is that going backward is half
5912 * the speed of going forward (that's where the
5913 * 2 * backw in the below comes from). (The real
5914 * figure of course depends on the UTF-8 data.) */
5916 if ((*cachep)[i] > (STRLEN)uoff) {
5918 backw = (*cachep)[i] - (STRLEN)uoff;
5920 if (forw < 2 * backw)
5923 p = start + (*cachep)[i+1];
5925 /* Try this only for the substr offset (i == 0),
5926 * not for the substr length (i == 2). */
5927 else if (i == 0) { /* (*cachep)[i] < uoff */
5928 const STRLEN ulen = sv_len_utf8(sv);
5930 if ((STRLEN)uoff < ulen) {
5931 forw = (STRLEN)uoff - (*cachep)[i];
5932 backw = ulen - (STRLEN)uoff;
5934 if (forw < 2 * backw)
5935 p = start + (*cachep)[i+1];
5940 /* If the string is not long enough for uoff,
5941 * we could extend it, but not at this low a level. */
5945 if (forw < 2 * backw) {
5952 while (UTF8_IS_CONTINUATION(*p))
5957 /* Update the cache. */
5958 (*cachep)[i] = (STRLEN)uoff;
5959 (*cachep)[i+1] = p - start;
5961 /* Drop the stale "length" cache */
5970 if (found) { /* Setup the return values. */
5971 *offsetp = (*cachep)[i+1];
5972 *sp = start + *offsetp;
5975 *offsetp = send - start;
5977 else if (*sp < start) {
5983 #ifdef PERL_UTF8_CACHE_ASSERT
5988 while (n-- && s < send)
5992 assert(*offsetp == s - start);
5993 assert((*cachep)[0] == (STRLEN)uoff);
5994 assert((*cachep)[1] == *offsetp);
5996 ASSERT_UTF8_CACHE(*cachep);
6005 =for apidoc sv_pos_u2b
6007 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6008 the start of the string, to a count of the equivalent number of bytes; if
6009 lenp is non-zero, it does the same to lenp, but this time starting from
6010 the offset, rather than from the start of the string. Handles magic and
6017 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6018 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6019 * byte offsets. See also the comments of S_utf8_mg_pos().
6024 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6032 start = (U8*)SvPV_const(sv, len);
6036 const U8 *s = start;
6037 I32 uoffset = *offsetp;
6038 const U8 *send = s + len;
6042 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6044 if (!found && uoffset > 0) {
6045 while (s < send && uoffset--)
6049 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6051 *offsetp = s - start;
6056 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6060 if (!found && *lenp > 0) {
6063 while (s < send && ulen--)
6067 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6071 ASSERT_UTF8_CACHE(cache);
6083 =for apidoc sv_pos_b2u
6085 Converts the value pointed to by offsetp from a count of bytes from the
6086 start of the string, to a count of the equivalent number of UTF-8 chars.
6087 Handles magic and type coercion.
6093 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6094 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6095 * byte offsets. See also the comments of S_utf8_mg_pos().
6100 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6108 s = (const U8*)SvPV_const(sv, len);
6109 if ((I32)len < *offsetp)
6110 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6112 const U8* send = s + *offsetp;
6114 STRLEN *cache = NULL;
6118 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6119 mg = mg_find(sv, PERL_MAGIC_utf8);
6120 if (mg && mg->mg_ptr) {
6121 cache = (STRLEN *) mg->mg_ptr;
6122 if (cache[1] == (STRLEN)*offsetp) {
6123 /* An exact match. */
6124 *offsetp = cache[0];
6128 else if (cache[1] < (STRLEN)*offsetp) {
6129 /* We already know part of the way. */
6132 /* Let the below loop do the rest. */
6134 else { /* cache[1] > *offsetp */
6135 /* We already know all of the way, now we may
6136 * be able to walk back. The same assumption
6137 * is made as in S_utf8_mg_pos(), namely that
6138 * walking backward is twice slower than
6139 * walking forward. */
6140 STRLEN forw = *offsetp;
6141 STRLEN backw = cache[1] - *offsetp;
6143 if (!(forw < 2 * backw)) {
6144 const U8 *p = s + cache[1];
6151 while (UTF8_IS_CONTINUATION(*p)) {
6159 *offsetp = cache[0];
6161 /* Drop the stale "length" cache */
6169 ASSERT_UTF8_CACHE(cache);
6175 /* Call utf8n_to_uvchr() to validate the sequence
6176 * (unless a simple non-UTF character) */
6177 if (!UTF8_IS_INVARIANT(*s))
6178 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6187 if (!SvREADONLY(sv)) {
6189 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6190 mg = mg_find(sv, PERL_MAGIC_utf8);
6195 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6196 mg->mg_ptr = (char *) cache;
6201 cache[1] = *offsetp;
6202 /* Drop the stale "length" cache */
6215 Returns a boolean indicating whether the strings in the two SVs are
6216 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6217 coerce its args to strings if necessary.
6223 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6231 SV* svrecode = Nullsv;
6238 pv1 = SvPV_const(sv1, cur1);
6245 pv2 = SvPV_const(sv2, cur2);
6247 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6248 /* Differing utf8ness.
6249 * Do not UTF8size the comparands as a side-effect. */
6252 svrecode = newSVpvn(pv2, cur2);
6253 sv_recode_to_utf8(svrecode, PL_encoding);
6254 pv2 = SvPV_const(svrecode, cur2);
6257 svrecode = newSVpvn(pv1, cur1);
6258 sv_recode_to_utf8(svrecode, PL_encoding);
6259 pv1 = SvPV_const(svrecode, cur1);
6261 /* Now both are in UTF-8. */
6263 SvREFCNT_dec(svrecode);
6268 bool is_utf8 = TRUE;
6271 /* sv1 is the UTF-8 one,
6272 * if is equal it must be downgrade-able */
6273 char *pv = (char*)bytes_from_utf8((const U8*)pv1,
6279 /* sv2 is the UTF-8 one,
6280 * if is equal it must be downgrade-able */
6281 char *pv = (char *)bytes_from_utf8((const U8*)pv2,
6287 /* Downgrade not possible - cannot be eq */
6295 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6298 SvREFCNT_dec(svrecode);
6309 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6310 string in C<sv1> is less than, equal to, or greater than the string in
6311 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6312 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6318 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6321 const char *pv1, *pv2;
6324 SV *svrecode = Nullsv;
6331 pv1 = SvPV_const(sv1, cur1);
6338 pv2 = SvPV_const(sv2, cur2);
6340 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6341 /* Differing utf8ness.
6342 * Do not UTF8size the comparands as a side-effect. */
6345 svrecode = newSVpvn(pv2, cur2);
6346 sv_recode_to_utf8(svrecode, PL_encoding);
6347 pv2 = SvPV_const(svrecode, cur2);
6350 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6355 svrecode = newSVpvn(pv1, cur1);
6356 sv_recode_to_utf8(svrecode, PL_encoding);
6357 pv1 = SvPV_const(svrecode, cur1);
6360 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6366 cmp = cur2 ? -1 : 0;
6370 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6373 cmp = retval < 0 ? -1 : 1;
6374 } else if (cur1 == cur2) {
6377 cmp = cur1 < cur2 ? -1 : 1;
6382 SvREFCNT_dec(svrecode);
6391 =for apidoc sv_cmp_locale
6393 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6394 'use bytes' aware, handles get magic, and will coerce its args to strings
6395 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6401 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6403 #ifdef USE_LOCALE_COLLATE
6409 if (PL_collation_standard)
6413 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6415 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6417 if (!pv1 || !len1) {
6428 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6431 return retval < 0 ? -1 : 1;
6434 * When the result of collation is equality, that doesn't mean
6435 * that there are no differences -- some locales exclude some
6436 * characters from consideration. So to avoid false equalities,
6437 * we use the raw string as a tiebreaker.
6443 #endif /* USE_LOCALE_COLLATE */
6445 return sv_cmp(sv1, sv2);
6449 #ifdef USE_LOCALE_COLLATE
6452 =for apidoc sv_collxfrm
6454 Add Collate Transform magic to an SV if it doesn't already have it.
6456 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6457 scalar data of the variable, but transformed to such a format that a normal
6458 memory comparison can be used to compare the data according to the locale
6465 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6469 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6470 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6476 Safefree(mg->mg_ptr);
6477 s = SvPV_const(sv, len);
6478 if ((xf = mem_collxfrm(s, len, &xlen))) {
6479 if (SvREADONLY(sv)) {
6482 return xf + sizeof(PL_collation_ix);
6485 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6486 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6499 if (mg && mg->mg_ptr) {
6501 return mg->mg_ptr + sizeof(PL_collation_ix);
6509 #endif /* USE_LOCALE_COLLATE */
6514 Get a line from the filehandle and store it into the SV, optionally
6515 appending to the currently-stored string.
6521 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6525 register STDCHAR rslast;
6526 register STDCHAR *bp;
6532 if (SvTHINKFIRST(sv))
6533 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6534 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6536 However, perlbench says it's slower, because the existing swipe code
6537 is faster than copy on write.
6538 Swings and roundabouts. */
6539 SvUPGRADE(sv, SVt_PV);
6544 if (PerlIO_isutf8(fp)) {
6546 sv_utf8_upgrade_nomg(sv);
6547 sv_pos_u2b(sv,&append,0);
6549 } else if (SvUTF8(sv)) {
6550 SV *tsv = NEWSV(0,0);
6551 sv_gets(tsv, fp, 0);
6552 sv_utf8_upgrade_nomg(tsv);
6553 SvCUR_set(sv,append);
6556 goto return_string_or_null;
6561 if (PerlIO_isutf8(fp))
6564 if (IN_PERL_COMPILETIME) {
6565 /* we always read code in line mode */
6569 else if (RsSNARF(PL_rs)) {
6570 /* If it is a regular disk file use size from stat() as estimate
6571 of amount we are going to read - may result in malloc-ing
6572 more memory than we realy need if layers bellow reduce
6573 size we read (e.g. CRLF or a gzip layer)
6576 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6577 const Off_t offset = PerlIO_tell(fp);
6578 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6579 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6585 else if (RsRECORD(PL_rs)) {
6589 /* Grab the size of the record we're getting */
6590 recsize = SvIV(SvRV(PL_rs));
6591 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6594 /* VMS wants read instead of fread, because fread doesn't respect */
6595 /* RMS record boundaries. This is not necessarily a good thing to be */
6596 /* doing, but we've got no other real choice - except avoid stdio
6597 as implementation - perhaps write a :vms layer ?
6599 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6601 bytesread = PerlIO_read(fp, buffer, recsize);
6605 SvCUR_set(sv, bytesread += append);
6606 buffer[bytesread] = '\0';
6607 goto return_string_or_null;
6609 else if (RsPARA(PL_rs)) {
6615 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6616 if (PerlIO_isutf8(fp)) {
6617 rsptr = SvPVutf8(PL_rs, rslen);
6620 if (SvUTF8(PL_rs)) {
6621 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6622 Perl_croak(aTHX_ "Wide character in $/");
6625 rsptr = SvPV_const(PL_rs, rslen);
6629 rslast = rslen ? rsptr[rslen - 1] : '\0';
6631 if (rspara) { /* have to do this both before and after */
6632 do { /* to make sure file boundaries work right */
6635 i = PerlIO_getc(fp);
6639 PerlIO_ungetc(fp,i);
6645 /* See if we know enough about I/O mechanism to cheat it ! */
6647 /* This used to be #ifdef test - it is made run-time test for ease
6648 of abstracting out stdio interface. One call should be cheap
6649 enough here - and may even be a macro allowing compile
6653 if (PerlIO_fast_gets(fp)) {
6656 * We're going to steal some values from the stdio struct
6657 * and put EVERYTHING in the innermost loop into registers.
6659 register STDCHAR *ptr;
6663 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6664 /* An ungetc()d char is handled separately from the regular
6665 * buffer, so we getc() it back out and stuff it in the buffer.
6667 i = PerlIO_getc(fp);
6668 if (i == EOF) return 0;
6669 *(--((*fp)->_ptr)) = (unsigned char) i;
6673 /* Here is some breathtakingly efficient cheating */
6675 cnt = PerlIO_get_cnt(fp); /* get count into register */
6676 /* make sure we have the room */
6677 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6678 /* Not room for all of it
6679 if we are looking for a separator and room for some
6681 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6682 /* just process what we have room for */
6683 shortbuffered = cnt - SvLEN(sv) + append + 1;
6684 cnt -= shortbuffered;
6688 /* remember that cnt can be negative */
6689 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6694 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6695 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6696 DEBUG_P(PerlIO_printf(Perl_debug_log,
6697 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6698 DEBUG_P(PerlIO_printf(Perl_debug_log,
6699 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6700 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6701 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6706 while (cnt > 0) { /* this | eat */
6708 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6709 goto thats_all_folks; /* screams | sed :-) */
6713 Copy(ptr, bp, cnt, char); /* this | eat */
6714 bp += cnt; /* screams | dust */
6715 ptr += cnt; /* louder | sed :-) */
6720 if (shortbuffered) { /* oh well, must extend */
6721 cnt = shortbuffered;
6723 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6725 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6726 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6730 DEBUG_P(PerlIO_printf(Perl_debug_log,
6731 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6732 PTR2UV(ptr),(long)cnt));
6733 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6735 DEBUG_P(PerlIO_printf(Perl_debug_log,
6736 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6737 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6738 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6740 /* This used to call 'filbuf' in stdio form, but as that behaves like
6741 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6742 another abstraction. */
6743 i = PerlIO_getc(fp); /* get more characters */
6745 DEBUG_P(PerlIO_printf(Perl_debug_log,
6746 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6747 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6748 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6750 cnt = PerlIO_get_cnt(fp);
6751 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6752 DEBUG_P(PerlIO_printf(Perl_debug_log,
6753 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6755 if (i == EOF) /* all done for ever? */
6756 goto thats_really_all_folks;
6758 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6760 SvGROW(sv, bpx + cnt + 2);
6761 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6763 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6765 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6766 goto thats_all_folks;
6770 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6771 memNE((char*)bp - rslen, rsptr, rslen))
6772 goto screamer; /* go back to the fray */
6773 thats_really_all_folks:
6775 cnt += shortbuffered;
6776 DEBUG_P(PerlIO_printf(Perl_debug_log,
6777 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6778 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6779 DEBUG_P(PerlIO_printf(Perl_debug_log,
6780 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6781 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6782 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6784 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6785 DEBUG_P(PerlIO_printf(Perl_debug_log,
6786 "Screamer: done, len=%ld, string=|%.*s|\n",
6787 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6791 /*The big, slow, and stupid way. */
6792 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6794 New(0, buf, 8192, STDCHAR);
6802 const register STDCHAR *bpe = buf + sizeof(buf);
6804 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6805 ; /* keep reading */
6809 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6810 /* Accomodate broken VAXC compiler, which applies U8 cast to
6811 * both args of ?: operator, causing EOF to change into 255
6814 i = (U8)buf[cnt - 1];
6820 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6822 sv_catpvn(sv, (char *) buf, cnt);
6824 sv_setpvn(sv, (char *) buf, cnt);
6826 if (i != EOF && /* joy */
6828 SvCUR(sv) < rslen ||
6829 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6833 * If we're reading from a TTY and we get a short read,
6834 * indicating that the user hit his EOF character, we need
6835 * to notice it now, because if we try to read from the TTY
6836 * again, the EOF condition will disappear.
6838 * The comparison of cnt to sizeof(buf) is an optimization
6839 * that prevents unnecessary calls to feof().
6843 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6847 #ifdef USE_HEAP_INSTEAD_OF_STACK
6852 if (rspara) { /* have to do this both before and after */
6853 while (i != EOF) { /* to make sure file boundaries work right */
6854 i = PerlIO_getc(fp);
6856 PerlIO_ungetc(fp,i);
6862 return_string_or_null:
6863 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6869 Auto-increment of the value in the SV, doing string to numeric conversion
6870 if necessary. Handles 'get' magic.
6876 Perl_sv_inc(pTHX_ register SV *sv)
6885 if (SvTHINKFIRST(sv)) {
6887 sv_force_normal_flags(sv, 0);
6888 if (SvREADONLY(sv)) {
6889 if (IN_PERL_RUNTIME)
6890 Perl_croak(aTHX_ PL_no_modify);
6894 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6896 i = PTR2IV(SvRV(sv));
6901 flags = SvFLAGS(sv);
6902 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6903 /* It's (privately or publicly) a float, but not tested as an
6904 integer, so test it to see. */
6906 flags = SvFLAGS(sv);
6908 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6909 /* It's publicly an integer, or privately an integer-not-float */
6910 #ifdef PERL_PRESERVE_IVUV
6914 if (SvUVX(sv) == UV_MAX)
6915 sv_setnv(sv, UV_MAX_P1);
6917 (void)SvIOK_only_UV(sv);
6918 SvUV_set(sv, SvUVX(sv) + 1);
6920 if (SvIVX(sv) == IV_MAX)
6921 sv_setuv(sv, (UV)IV_MAX + 1);
6923 (void)SvIOK_only(sv);
6924 SvIV_set(sv, SvIVX(sv) + 1);
6929 if (flags & SVp_NOK) {
6930 (void)SvNOK_only(sv);
6931 SvNV_set(sv, SvNVX(sv) + 1.0);
6935 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6936 if ((flags & SVTYPEMASK) < SVt_PVIV)
6937 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6938 (void)SvIOK_only(sv);
6943 while (isALPHA(*d)) d++;
6944 while (isDIGIT(*d)) d++;
6946 #ifdef PERL_PRESERVE_IVUV
6947 /* Got to punt this as an integer if needs be, but we don't issue
6948 warnings. Probably ought to make the sv_iv_please() that does
6949 the conversion if possible, and silently. */
6950 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6951 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6952 /* Need to try really hard to see if it's an integer.
6953 9.22337203685478e+18 is an integer.
6954 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6955 so $a="9.22337203685478e+18"; $a+0; $a++
6956 needs to be the same as $a="9.22337203685478e+18"; $a++
6963 /* sv_2iv *should* have made this an NV */
6964 if (flags & SVp_NOK) {
6965 (void)SvNOK_only(sv);
6966 SvNV_set(sv, SvNVX(sv) + 1.0);
6969 /* I don't think we can get here. Maybe I should assert this
6970 And if we do get here I suspect that sv_setnv will croak. NWC
6972 #if defined(USE_LONG_DOUBLE)
6973 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",
6974 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6976 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6977 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6980 #endif /* PERL_PRESERVE_IVUV */
6981 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6985 while (d >= SvPVX_const(sv)) {
6993 /* MKS: The original code here died if letters weren't consecutive.
6994 * at least it didn't have to worry about non-C locales. The
6995 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6996 * arranged in order (although not consecutively) and that only
6997 * [A-Za-z] are accepted by isALPHA in the C locale.
6999 if (*d != 'z' && *d != 'Z') {
7000 do { ++*d; } while (!isALPHA(*d));
7003 *(d--) -= 'z' - 'a';
7008 *(d--) -= 'z' - 'a' + 1;
7012 /* oh,oh, the number grew */
7013 SvGROW(sv, SvCUR(sv) + 2);
7014 SvCUR_set(sv, SvCUR(sv) + 1);
7015 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
7026 Auto-decrement of the value in the SV, doing string to numeric conversion
7027 if necessary. Handles 'get' magic.
7033 Perl_sv_dec(pTHX_ register SV *sv)
7041 if (SvTHINKFIRST(sv)) {
7043 sv_force_normal_flags(sv, 0);
7044 if (SvREADONLY(sv)) {
7045 if (IN_PERL_RUNTIME)
7046 Perl_croak(aTHX_ PL_no_modify);
7050 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7052 i = PTR2IV(SvRV(sv));
7057 /* Unlike sv_inc we don't have to worry about string-never-numbers
7058 and keeping them magic. But we mustn't warn on punting */
7059 flags = SvFLAGS(sv);
7060 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7061 /* It's publicly an integer, or privately an integer-not-float */
7062 #ifdef PERL_PRESERVE_IVUV
7066 if (SvUVX(sv) == 0) {
7067 (void)SvIOK_only(sv);
7071 (void)SvIOK_only_UV(sv);
7072 SvUV_set(sv, SvUVX(sv) + 1);
7075 if (SvIVX(sv) == IV_MIN)
7076 sv_setnv(sv, (NV)IV_MIN - 1.0);
7078 (void)SvIOK_only(sv);
7079 SvIV_set(sv, SvIVX(sv) - 1);
7084 if (flags & SVp_NOK) {
7085 SvNV_set(sv, SvNVX(sv) - 1.0);
7086 (void)SvNOK_only(sv);
7089 if (!(flags & SVp_POK)) {
7090 if ((flags & SVTYPEMASK) < SVt_PVNV)
7091 sv_upgrade(sv, SVt_NV);
7093 (void)SvNOK_only(sv);
7096 #ifdef PERL_PRESERVE_IVUV
7098 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7099 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7100 /* Need to try really hard to see if it's an integer.
7101 9.22337203685478e+18 is an integer.
7102 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7103 so $a="9.22337203685478e+18"; $a+0; $a--
7104 needs to be the same as $a="9.22337203685478e+18"; $a--
7111 /* sv_2iv *should* have made this an NV */
7112 if (flags & SVp_NOK) {
7113 (void)SvNOK_only(sv);
7114 SvNV_set(sv, SvNVX(sv) - 1.0);
7117 /* I don't think we can get here. Maybe I should assert this
7118 And if we do get here I suspect that sv_setnv will croak. NWC
7120 #if defined(USE_LONG_DOUBLE)
7121 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",
7122 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7124 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7125 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7129 #endif /* PERL_PRESERVE_IVUV */
7130 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7134 =for apidoc sv_mortalcopy
7136 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7137 The new SV is marked as mortal. It will be destroyed "soon", either by an
7138 explicit call to FREETMPS, or by an implicit call at places such as
7139 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7144 /* Make a string that will exist for the duration of the expression
7145 * evaluation. Actually, it may have to last longer than that, but
7146 * hopefully we won't free it until it has been assigned to a
7147 * permanent location. */
7150 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7155 sv_setsv(sv,oldstr);
7157 PL_tmps_stack[++PL_tmps_ix] = sv;
7163 =for apidoc sv_newmortal
7165 Creates a new null SV which is mortal. The reference count of the SV is
7166 set to 1. It will be destroyed "soon", either by an explicit call to
7167 FREETMPS, or by an implicit call at places such as statement boundaries.
7168 See also C<sv_mortalcopy> and C<sv_2mortal>.
7174 Perl_sv_newmortal(pTHX)
7179 SvFLAGS(sv) = SVs_TEMP;
7181 PL_tmps_stack[++PL_tmps_ix] = sv;
7186 =for apidoc sv_2mortal
7188 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7189 by an explicit call to FREETMPS, or by an implicit call at places such as
7190 statement boundaries. SvTEMP() is turned on which means that the SV's
7191 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7192 and C<sv_mortalcopy>.
7198 Perl_sv_2mortal(pTHX_ register SV *sv)
7203 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7206 PL_tmps_stack[++PL_tmps_ix] = sv;
7214 Creates a new SV and copies a string into it. The reference count for the
7215 SV is set to 1. If C<len> is zero, Perl will compute the length using
7216 strlen(). For efficiency, consider using C<newSVpvn> instead.
7222 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7227 sv_setpvn(sv,s,len ? len : strlen(s));
7232 =for apidoc newSVpvn
7234 Creates a new SV and copies a string into it. The reference count for the
7235 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7236 string. You are responsible for ensuring that the source string is at least
7237 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7243 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7248 sv_setpvn(sv,s,len);
7254 =for apidoc newSVhek
7256 Creates a new SV from the hash key structure. It will generate scalars that
7257 point to the shared string table where possible. Returns a new (undefined)
7258 SV if the hek is NULL.
7264 Perl_newSVhek(pTHX_ const HEK *hek)
7273 if (HEK_LEN(hek) == HEf_SVKEY) {
7274 return newSVsv(*(SV**)HEK_KEY(hek));
7276 const int flags = HEK_FLAGS(hek);
7277 if (flags & HVhek_WASUTF8) {
7279 Andreas would like keys he put in as utf8 to come back as utf8
7281 STRLEN utf8_len = HEK_LEN(hek);
7282 U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7283 SV *sv = newSVpvn ((char*)as_utf8, utf8_len);
7286 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7288 } else if (flags & HVhek_REHASH) {
7289 /* We don't have a pointer to the hv, so we have to replicate the
7290 flag into every HEK. This hv is using custom a hasing
7291 algorithm. Hence we can't return a shared string scalar, as
7292 that would contain the (wrong) hash value, and might get passed
7293 into an hv routine with a regular hash */
7295 SV *sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7300 /* This will be overwhelminly the most common case. */
7301 return newSVpvn_share(HEK_KEY(hek),
7302 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7308 =for apidoc newSVpvn_share
7310 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7311 table. If the string does not already exist in the table, it is created
7312 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7313 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7314 otherwise the hash is computed. The idea here is that as the string table
7315 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7316 hash lookup will avoid string compare.
7322 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7325 bool is_utf8 = FALSE;
7327 STRLEN tmplen = -len;
7329 /* See the note in hv.c:hv_fetch() --jhi */
7330 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7334 PERL_HASH(hash, src, len);
7336 sv_upgrade(sv, SVt_PV);
7337 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7349 #if defined(PERL_IMPLICIT_CONTEXT)
7351 /* pTHX_ magic can't cope with varargs, so this is a no-context
7352 * version of the main function, (which may itself be aliased to us).
7353 * Don't access this version directly.
7357 Perl_newSVpvf_nocontext(const char* pat, ...)
7362 va_start(args, pat);
7363 sv = vnewSVpvf(pat, &args);
7370 =for apidoc newSVpvf
7372 Creates a new SV and initializes it with the string formatted like
7379 Perl_newSVpvf(pTHX_ const char* pat, ...)
7383 va_start(args, pat);
7384 sv = vnewSVpvf(pat, &args);
7389 /* backend for newSVpvf() and newSVpvf_nocontext() */
7392 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7396 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7403 Creates a new SV and copies a floating point value into it.
7404 The reference count for the SV is set to 1.
7410 Perl_newSVnv(pTHX_ NV n)
7422 Creates a new SV and copies an integer into it. The reference count for the
7429 Perl_newSViv(pTHX_ IV i)
7441 Creates a new SV and copies an unsigned integer into it.
7442 The reference count for the SV is set to 1.
7448 Perl_newSVuv(pTHX_ UV u)
7458 =for apidoc newRV_noinc
7460 Creates an RV wrapper for an SV. The reference count for the original
7461 SV is B<not> incremented.
7467 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7472 sv_upgrade(sv, SVt_RV);
7474 SvRV_set(sv, tmpRef);
7479 /* newRV_inc is the official function name to use now.
7480 * newRV_inc is in fact #defined to newRV in sv.h
7484 Perl_newRV(pTHX_ SV *tmpRef)
7486 return newRV_noinc(SvREFCNT_inc(tmpRef));
7492 Creates a new SV which is an exact duplicate of the original SV.
7499 Perl_newSVsv(pTHX_ register SV *old)
7505 if (SvTYPE(old) == SVTYPEMASK) {
7506 if (ckWARN_d(WARN_INTERNAL))
7507 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7511 /* SV_GMAGIC is the default for sv_setv()
7512 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7513 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7514 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7519 =for apidoc sv_reset
7521 Underlying implementation for the C<reset> Perl function.
7522 Note that the perl-level function is vaguely deprecated.
7528 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7531 char todo[PERL_UCHAR_MAX+1];
7536 if (!*s) { /* reset ?? searches */
7537 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7539 PMOP *pm = (PMOP *) mg->mg_obj;
7541 pm->op_pmdynflags &= ~PMdf_USED;
7548 /* reset variables */
7550 if (!HvARRAY(stash))
7553 Zero(todo, 256, char);
7556 I32 i = (unsigned char)*s;
7560 max = (unsigned char)*s++;
7561 for ( ; i <= max; i++) {
7564 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7566 for (entry = HvARRAY(stash)[i];
7568 entry = HeNEXT(entry))
7573 if (!todo[(U8)*HeKEY(entry)])
7575 gv = (GV*)HeVAL(entry);
7577 if (SvTHINKFIRST(sv)) {
7578 if (!SvREADONLY(sv) && SvROK(sv))
7583 if (SvTYPE(sv) >= SVt_PV) {
7585 if (SvPVX_const(sv) != Nullch)
7592 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7595 #ifdef USE_ENVIRON_ARRAY
7597 # ifdef USE_ITHREADS
7598 && PL_curinterp == aTHX
7602 environ[0] = Nullch;
7605 #endif /* !PERL_MICRO */
7615 Using various gambits, try to get an IO from an SV: the IO slot if its a
7616 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7617 named after the PV if we're a string.
7623 Perl_sv_2io(pTHX_ SV *sv)
7628 switch (SvTYPE(sv)) {
7636 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7640 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7642 return sv_2io(SvRV(sv));
7643 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7649 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7658 Using various gambits, try to get a CV from an SV; in addition, try if
7659 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7665 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7672 return *gvp = Nullgv, Nullcv;
7673 switch (SvTYPE(sv)) {
7692 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7693 tryAMAGICunDEREF(to_cv);
7696 if (SvTYPE(sv) == SVt_PVCV) {
7705 Perl_croak(aTHX_ "Not a subroutine reference");
7710 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7716 if (lref && !GvCVu(gv)) {
7719 tmpsv = NEWSV(704,0);
7720 gv_efullname3(tmpsv, gv, Nullch);
7721 /* XXX this is probably not what they think they're getting.
7722 * It has the same effect as "sub name;", i.e. just a forward
7724 newSUB(start_subparse(FALSE, 0),
7725 newSVOP(OP_CONST, 0, tmpsv),
7730 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7740 Returns true if the SV has a true value by Perl's rules.
7741 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7742 instead use an in-line version.
7748 Perl_sv_true(pTHX_ register SV *sv)
7753 const register XPV* tXpv;
7754 if ((tXpv = (XPV*)SvANY(sv)) &&
7755 (tXpv->xpv_cur > 1 ||
7756 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7763 return SvIVX(sv) != 0;
7766 return SvNVX(sv) != 0.0;
7768 return sv_2bool(sv);
7776 A private implementation of the C<SvIVx> macro for compilers which can't
7777 cope with complex macro expressions. Always use the macro instead.
7783 Perl_sv_iv(pTHX_ register SV *sv)
7787 return (IV)SvUVX(sv);
7796 A private implementation of the C<SvUVx> macro for compilers which can't
7797 cope with complex macro expressions. Always use the macro instead.
7803 Perl_sv_uv(pTHX_ register SV *sv)
7808 return (UV)SvIVX(sv);
7816 A private implementation of the C<SvNVx> macro for compilers which can't
7817 cope with complex macro expressions. Always use the macro instead.
7823 Perl_sv_nv(pTHX_ register SV *sv)
7830 /* sv_pv() is now a macro using SvPV_nolen();
7831 * this function provided for binary compatibility only
7835 Perl_sv_pv(pTHX_ SV *sv)
7840 return sv_2pv(sv, 0);
7846 Use the C<SvPV_nolen> macro instead
7850 A private implementation of the C<SvPV> macro for compilers which can't
7851 cope with complex macro expressions. Always use the macro instead.
7857 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7863 return sv_2pv(sv, lp);
7868 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7874 return sv_2pv_flags(sv, lp, 0);
7877 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7878 * this function provided for binary compatibility only
7882 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7884 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7888 =for apidoc sv_pvn_force
7890 Get a sensible string out of the SV somehow.
7891 A private implementation of the C<SvPV_force> macro for compilers which
7892 can't cope with complex macro expressions. Always use the macro instead.
7894 =for apidoc sv_pvn_force_flags
7896 Get a sensible string out of the SV somehow.
7897 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7898 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7899 implemented in terms of this function.
7900 You normally want to use the various wrapper macros instead: see
7901 C<SvPV_force> and C<SvPV_force_nomg>
7907 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7910 if (SvTHINKFIRST(sv) && !SvROK(sv))
7911 sv_force_normal_flags(sv, 0);
7921 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7923 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7924 sv_reftype(sv,0), OP_NAME(PL_op));
7926 Perl_croak(aTHX_ "Can't coerce readonly %s to string",
7929 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7930 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7934 s = sv_2pv_flags(sv, &len, flags);
7938 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7941 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7942 SvGROW(sv, len + 1);
7943 Move(s,SvPVX_const(sv),len,char);
7948 SvPOK_on(sv); /* validate pointer */
7950 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7951 PTR2UV(sv),SvPVX_const(sv)));
7954 return SvPVX_mutable(sv);
7957 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7958 * this function provided for binary compatibility only
7962 Perl_sv_pvbyte(pTHX_ SV *sv)
7964 sv_utf8_downgrade(sv,0);
7969 =for apidoc sv_pvbyte
7971 Use C<SvPVbyte_nolen> instead.
7973 =for apidoc sv_pvbyten
7975 A private implementation of the C<SvPVbyte> macro for compilers
7976 which can't cope with complex macro expressions. Always use the macro
7983 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7985 sv_utf8_downgrade(sv,0);
7986 return sv_pvn(sv,lp);
7990 =for apidoc sv_pvbyten_force
7992 A private implementation of the C<SvPVbytex_force> macro for compilers
7993 which can't cope with complex macro expressions. Always use the macro
8000 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
8002 sv_pvn_force(sv,lp);
8003 sv_utf8_downgrade(sv,0);
8008 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8009 * this function provided for binary compatibility only
8013 Perl_sv_pvutf8(pTHX_ SV *sv)
8015 sv_utf8_upgrade(sv);
8020 =for apidoc sv_pvutf8
8022 Use the C<SvPVutf8_nolen> macro instead
8024 =for apidoc sv_pvutf8n
8026 A private implementation of the C<SvPVutf8> macro for compilers
8027 which can't cope with complex macro expressions. Always use the macro
8034 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8036 sv_utf8_upgrade(sv);
8037 return sv_pvn(sv,lp);
8041 =for apidoc sv_pvutf8n_force
8043 A private implementation of the C<SvPVutf8_force> macro for compilers
8044 which can't cope with complex macro expressions. Always use the macro
8051 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8053 sv_pvn_force(sv,lp);
8054 sv_utf8_upgrade(sv);
8060 =for apidoc sv_reftype
8062 Returns a string describing what the SV is a reference to.
8068 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8070 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8071 inside return suggests a const propagation bug in g++. */
8072 if (ob && SvOBJECT(sv)) {
8073 char *name = HvNAME_get(SvSTASH(sv));
8074 return name ? name : (char *) "__ANON__";
8077 switch (SvTYPE(sv)) {
8094 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8095 /* tied lvalues should appear to be
8096 * scalars for backwards compatitbility */
8097 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8098 ? "SCALAR" : "LVALUE");
8099 case SVt_PVAV: return "ARRAY";
8100 case SVt_PVHV: return "HASH";
8101 case SVt_PVCV: return "CODE";
8102 case SVt_PVGV: return "GLOB";
8103 case SVt_PVFM: return "FORMAT";
8104 case SVt_PVIO: return "IO";
8105 default: return "UNKNOWN";
8111 =for apidoc sv_isobject
8113 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8114 object. If the SV is not an RV, or if the object is not blessed, then this
8121 Perl_sv_isobject(pTHX_ SV *sv)
8138 Returns a boolean indicating whether the SV is blessed into the specified
8139 class. This does not check for subtypes; use C<sv_derived_from> to verify
8140 an inheritance relationship.
8146 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8158 hvname = HvNAME_get(SvSTASH(sv));
8162 return strEQ(hvname, name);
8168 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8169 it will be upgraded to one. If C<classname> is non-null then the new SV will
8170 be blessed in the specified package. The new SV is returned and its
8171 reference count is 1.
8177 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8183 SV_CHECK_THINKFIRST_COW_DROP(rv);
8186 if (SvTYPE(rv) >= SVt_PVMG) {
8187 const U32 refcnt = SvREFCNT(rv);
8191 SvREFCNT(rv) = refcnt;
8194 if (SvTYPE(rv) < SVt_RV)
8195 sv_upgrade(rv, SVt_RV);
8196 else if (SvTYPE(rv) > SVt_RV) {
8207 HV* stash = gv_stashpv(classname, TRUE);
8208 (void)sv_bless(rv, stash);
8214 =for apidoc sv_setref_pv
8216 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8217 argument will be upgraded to an RV. That RV will be modified to point to
8218 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8219 into the SV. The C<classname> argument indicates the package for the
8220 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8221 will have a reference count of 1, and the RV will be returned.
8223 Do not use with other Perl types such as HV, AV, SV, CV, because those
8224 objects will become corrupted by the pointer copy process.
8226 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8232 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8235 sv_setsv(rv, &PL_sv_undef);
8239 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8244 =for apidoc sv_setref_iv
8246 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8247 argument will be upgraded to an RV. That RV will be modified to point to
8248 the new SV. The C<classname> argument indicates the package for the
8249 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8250 will have a reference count of 1, and the RV will be returned.
8256 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8258 sv_setiv(newSVrv(rv,classname), iv);
8263 =for apidoc sv_setref_uv
8265 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8266 argument will be upgraded to an RV. That RV will be modified to point to
8267 the new SV. The C<classname> argument indicates the package for the
8268 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8269 will have a reference count of 1, and the RV will be returned.
8275 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8277 sv_setuv(newSVrv(rv,classname), uv);
8282 =for apidoc sv_setref_nv
8284 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8285 argument will be upgraded to an RV. That RV will be modified to point to
8286 the new SV. The C<classname> argument indicates the package for the
8287 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8288 will have a reference count of 1, and the RV will be returned.
8294 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8296 sv_setnv(newSVrv(rv,classname), nv);
8301 =for apidoc sv_setref_pvn
8303 Copies a string into a new SV, optionally blessing the SV. The length of the
8304 string must be specified with C<n>. The C<rv> argument will be upgraded to
8305 an RV. That RV will be modified to point to the new SV. The C<classname>
8306 argument indicates the package for the blessing. Set C<classname> to
8307 C<Nullch> to avoid the blessing. The new SV will have a reference count
8308 of 1, and the RV will be returned.
8310 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8316 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8318 sv_setpvn(newSVrv(rv,classname), pv, n);
8323 =for apidoc sv_bless
8325 Blesses an SV into a specified package. The SV must be an RV. The package
8326 must be designated by its stash (see C<gv_stashpv()>). The reference count
8327 of the SV is unaffected.
8333 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8337 Perl_croak(aTHX_ "Can't bless non-reference value");
8339 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8340 if (SvREADONLY(tmpRef))
8341 Perl_croak(aTHX_ PL_no_modify);
8342 if (SvOBJECT(tmpRef)) {
8343 if (SvTYPE(tmpRef) != SVt_PVIO)
8345 SvREFCNT_dec(SvSTASH(tmpRef));
8348 SvOBJECT_on(tmpRef);
8349 if (SvTYPE(tmpRef) != SVt_PVIO)
8351 SvUPGRADE(tmpRef, SVt_PVMG);
8352 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8359 if(SvSMAGICAL(tmpRef))
8360 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8368 /* Downgrades a PVGV to a PVMG.
8372 S_sv_unglob(pTHX_ SV *sv)
8376 assert(SvTYPE(sv) == SVt_PVGV);
8381 SvREFCNT_dec(GvSTASH(sv));
8382 GvSTASH(sv) = Nullhv;
8384 sv_unmagic(sv, PERL_MAGIC_glob);
8385 Safefree(GvNAME(sv));
8388 /* need to keep SvANY(sv) in the right arena */
8389 xpvmg = new_XPVMG();
8390 StructCopy(SvANY(sv), xpvmg, XPVMG);
8391 del_XPVGV(SvANY(sv));
8394 SvFLAGS(sv) &= ~SVTYPEMASK;
8395 SvFLAGS(sv) |= SVt_PVMG;
8399 =for apidoc sv_unref_flags
8401 Unsets the RV status of the SV, and decrements the reference count of
8402 whatever was being referenced by the RV. This can almost be thought of
8403 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8404 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8405 (otherwise the decrementing is conditional on the reference count being
8406 different from one or the reference being a readonly SV).
8413 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8417 if (SvWEAKREF(sv)) {
8425 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8426 assigned to as BEGIN {$a = \"Foo"} will fail. */
8427 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8429 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8430 sv_2mortal(rv); /* Schedule for freeing later */
8434 =for apidoc sv_unref
8436 Unsets the RV status of the SV, and decrements the reference count of
8437 whatever was being referenced by the RV. This can almost be thought of
8438 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8439 being zero. See C<SvROK_off>.
8445 Perl_sv_unref(pTHX_ SV *sv)
8447 sv_unref_flags(sv, 0);
8451 =for apidoc sv_taint
8453 Taint an SV. Use C<SvTAINTED_on> instead.
8458 Perl_sv_taint(pTHX_ SV *sv)
8460 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8464 =for apidoc sv_untaint
8466 Untaint an SV. Use C<SvTAINTED_off> instead.
8471 Perl_sv_untaint(pTHX_ SV *sv)
8473 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8474 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8481 =for apidoc sv_tainted
8483 Test an SV for taintedness. Use C<SvTAINTED> instead.
8488 Perl_sv_tainted(pTHX_ SV *sv)
8490 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8491 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8492 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8499 =for apidoc sv_setpviv
8501 Copies an integer into the given SV, also updating its string value.
8502 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8508 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8510 char buf[TYPE_CHARS(UV)];
8512 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8514 sv_setpvn(sv, ptr, ebuf - ptr);
8518 =for apidoc sv_setpviv_mg
8520 Like C<sv_setpviv>, but also handles 'set' magic.
8526 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8528 char buf[TYPE_CHARS(UV)];
8530 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8532 sv_setpvn(sv, ptr, ebuf - ptr);
8536 #if defined(PERL_IMPLICIT_CONTEXT)
8538 /* pTHX_ magic can't cope with varargs, so this is a no-context
8539 * version of the main function, (which may itself be aliased to us).
8540 * Don't access this version directly.
8544 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8548 va_start(args, pat);
8549 sv_vsetpvf(sv, pat, &args);
8553 /* pTHX_ magic can't cope with varargs, so this is a no-context
8554 * version of the main function, (which may itself be aliased to us).
8555 * Don't access this version directly.
8559 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8563 va_start(args, pat);
8564 sv_vsetpvf_mg(sv, pat, &args);
8570 =for apidoc sv_setpvf
8572 Works like C<sv_catpvf> but copies the text into the SV instead of
8573 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8579 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8582 va_start(args, pat);
8583 sv_vsetpvf(sv, pat, &args);
8588 =for apidoc sv_vsetpvf
8590 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8591 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8593 Usually used via its frontend C<sv_setpvf>.
8599 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8601 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8605 =for apidoc sv_setpvf_mg
8607 Like C<sv_setpvf>, but also handles 'set' magic.
8613 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8616 va_start(args, pat);
8617 sv_vsetpvf_mg(sv, pat, &args);
8622 =for apidoc sv_vsetpvf_mg
8624 Like C<sv_vsetpvf>, but also handles 'set' magic.
8626 Usually used via its frontend C<sv_setpvf_mg>.
8632 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8634 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8638 #if defined(PERL_IMPLICIT_CONTEXT)
8640 /* pTHX_ magic can't cope with varargs, so this is a no-context
8641 * version of the main function, (which may itself be aliased to us).
8642 * Don't access this version directly.
8646 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8650 va_start(args, pat);
8651 sv_vcatpvf(sv, pat, &args);
8655 /* pTHX_ magic can't cope with varargs, so this is a no-context
8656 * version of the main function, (which may itself be aliased to us).
8657 * Don't access this version directly.
8661 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8665 va_start(args, pat);
8666 sv_vcatpvf_mg(sv, pat, &args);
8672 =for apidoc sv_catpvf
8674 Processes its arguments like C<sprintf> and appends the formatted
8675 output to an SV. If the appended data contains "wide" characters
8676 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8677 and characters >255 formatted with %c), the original SV might get
8678 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8679 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8680 valid UTF-8; if the original SV was bytes, the pattern should be too.
8685 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8688 va_start(args, pat);
8689 sv_vcatpvf(sv, pat, &args);
8694 =for apidoc sv_vcatpvf
8696 Processes its arguments like C<vsprintf> and appends the formatted output
8697 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8699 Usually used via its frontend C<sv_catpvf>.
8705 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8707 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8711 =for apidoc sv_catpvf_mg
8713 Like C<sv_catpvf>, but also handles 'set' magic.
8719 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8722 va_start(args, pat);
8723 sv_vcatpvf_mg(sv, pat, &args);
8728 =for apidoc sv_vcatpvf_mg
8730 Like C<sv_vcatpvf>, but also handles 'set' magic.
8732 Usually used via its frontend C<sv_catpvf_mg>.
8738 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8740 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8745 =for apidoc sv_vsetpvfn
8747 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8750 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8756 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8758 sv_setpvn(sv, "", 0);
8759 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8762 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8765 S_expect_number(pTHX_ char** pattern)
8768 switch (**pattern) {
8769 case '1': case '2': case '3':
8770 case '4': case '5': case '6':
8771 case '7': case '8': case '9':
8772 while (isDIGIT(**pattern))
8773 var = var * 10 + (*(*pattern)++ - '0');
8777 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8780 F0convert(NV nv, char *endbuf, STRLEN *len)
8782 const int neg = nv < 0;
8791 if (uv & 1 && uv == nv)
8792 uv--; /* Round to even */
8794 const unsigned dig = uv % 10;
8807 =for apidoc sv_vcatpvfn
8809 Processes its arguments like C<vsprintf> and appends the formatted output
8810 to an SV. Uses an array of SVs if the C style variable argument list is
8811 missing (NULL). When running with taint checks enabled, indicates via
8812 C<maybe_tainted> if results are untrustworthy (often due to the use of
8815 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8820 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8823 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8830 static const char nullstr[] = "(null)";
8832 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8833 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8835 /* Times 4: a decimal digit takes more than 3 binary digits.
8836 * NV_DIG: mantissa takes than many decimal digits.
8837 * Plus 32: Playing safe. */
8838 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8839 /* large enough for "%#.#f" --chip */
8840 /* what about long double NVs? --jhi */
8842 /* no matter what, this is a string now */
8843 (void)SvPV_force(sv, origlen);
8845 /* special-case "", "%s", and "%-p" (SVf) */
8848 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8850 const char *s = va_arg(*args, char*);
8851 sv_catpv(sv, s ? s : nullstr);
8853 else if (svix < svmax) {
8854 sv_catsv(sv, *svargs);
8855 if (DO_UTF8(*svargs))
8860 if (patlen == 3 && pat[0] == '%' &&
8861 pat[1] == '-' && pat[2] == 'p') {
8863 argsv = va_arg(*args, SV*);
8864 sv_catsv(sv, argsv);
8871 #ifndef USE_LONG_DOUBLE
8872 /* special-case "%.<number>[gf]" */
8873 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8874 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8875 unsigned digits = 0;
8879 while (*pp >= '0' && *pp <= '9')
8880 digits = 10 * digits + (*pp++ - '0');
8881 if (pp - pat == (int)patlen - 1) {
8885 nv = (NV)va_arg(*args, double);
8886 else if (svix < svmax)
8891 /* Add check for digits != 0 because it seems that some
8892 gconverts are buggy in this case, and we don't yet have
8893 a Configure test for this. */
8894 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8895 /* 0, point, slack */
8896 Gconvert(nv, (int)digits, 0, ebuf);
8898 if (*ebuf) /* May return an empty string for digits==0 */
8901 } else if (!digits) {
8904 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8905 sv_catpvn(sv, p, l);
8911 #endif /* !USE_LONG_DOUBLE */
8913 if (!args && svix < svmax && DO_UTF8(*svargs))
8916 patend = (char*)pat + patlen;
8917 for (p = (char*)pat; p < patend; p = q) {
8920 bool vectorize = FALSE;
8921 bool vectorarg = FALSE;
8922 bool vec_utf8 = FALSE;
8928 bool has_precis = FALSE;
8931 bool is_utf8 = FALSE; /* is this item utf8? */
8932 #ifdef HAS_LDBL_SPRINTF_BUG
8933 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8934 with sfio - Allen <allens@cpan.org> */
8935 bool fix_ldbl_sprintf_bug = FALSE;
8939 U8 utf8buf[UTF8_MAXBYTES+1];
8940 STRLEN esignlen = 0;
8942 const char *eptr = Nullch;
8945 const U8 *vecstr = Null(U8*);
8952 /* we need a long double target in case HAS_LONG_DOUBLE but
8955 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8963 const char *dotstr = ".";
8964 STRLEN dotstrlen = 1;
8965 I32 efix = 0; /* explicit format parameter index */
8966 I32 ewix = 0; /* explicit width index */
8967 I32 epix = 0; /* explicit precision index */
8968 I32 evix = 0; /* explicit vector index */
8969 bool asterisk = FALSE;
8971 /* echo everything up to the next format specification */
8972 for (q = p; q < patend && *q != '%'; ++q) ;
8974 if (has_utf8 && !pat_utf8)
8975 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8977 sv_catpvn(sv, p, q - p);
8984 We allow format specification elements in this order:
8985 \d+\$ explicit format parameter index
8987 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8988 0 flag (as above): repeated to allow "v02"
8989 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8990 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8992 [%bcdefginopsux_DFOUX] format (mandatory)
8994 if (EXPECT_NUMBER(q, width)) {
9035 if (EXPECT_NUMBER(q, ewix))
9044 if ((vectorarg = asterisk)) {
9056 EXPECT_NUMBER(q, width);
9061 vecsv = va_arg(*args, SV*);
9063 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9064 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9065 dotstr = SvPV_const(vecsv, dotstrlen);
9070 vecsv = va_arg(*args, SV*);
9071 vecstr = (U8*)SvPV_const(vecsv,veclen);
9072 vec_utf8 = DO_UTF8(vecsv);
9074 else if (efix ? efix <= svmax : svix < svmax) {
9075 vecsv = svargs[efix ? efix-1 : svix++];
9076 vecstr = (U8*)SvPV_const(vecsv,veclen);
9077 vec_utf8 = DO_UTF8(vecsv);
9078 /* if this is a version object, we need to return the
9079 * stringified representation (which the SvPVX_const has
9080 * already done for us), but not vectorize the args
9082 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9084 q++; /* skip past the rest of the %vd format */
9085 eptr = (const char *) vecstr;
9086 elen = strlen(eptr);
9099 i = va_arg(*args, int);
9101 i = (ewix ? ewix <= svmax : svix < svmax) ?
9102 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9104 width = (i < 0) ? -i : i;
9114 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9116 /* XXX: todo, support specified precision parameter */
9120 i = va_arg(*args, int);
9122 i = (ewix ? ewix <= svmax : svix < svmax)
9123 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9124 precis = (i < 0) ? 0 : i;
9129 precis = precis * 10 + (*q++ - '0');
9138 case 'I': /* Ix, I32x, and I64x */
9140 if (q[1] == '6' && q[2] == '4') {
9146 if (q[1] == '3' && q[2] == '2') {
9156 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9167 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9168 if (*(q + 1) == 'l') { /* lld, llf */
9193 argsv = (efix ? efix <= svmax : svix < svmax) ?
9194 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9201 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9203 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9205 eptr = (char*)utf8buf;
9206 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9217 if (args && !vectorize) {
9218 eptr = va_arg(*args, char*);
9220 #ifdef MACOS_TRADITIONAL
9221 /* On MacOS, %#s format is used for Pascal strings */
9226 elen = strlen(eptr);
9228 eptr = (char *)nullstr;
9229 elen = sizeof nullstr - 1;
9233 eptr = SvPVx_const(argsv, elen);
9234 if (DO_UTF8(argsv)) {
9235 if (has_precis && precis < elen) {
9237 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9240 if (width) { /* fudge width (can't fudge elen) */
9241 width += elen - sv_len_utf8(argsv);
9249 if (has_precis && elen > precis)
9256 if (left && args) { /* SVf */
9265 argsv = va_arg(*args, SV*);
9266 eptr = SvPVx_const(argsv, elen);
9271 if (alt || vectorize)
9273 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9291 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9300 esignbuf[esignlen++] = plus;
9304 case 'h': iv = (short)va_arg(*args, int); break;
9305 case 'l': iv = va_arg(*args, long); break;
9306 case 'V': iv = va_arg(*args, IV); break;
9307 default: iv = va_arg(*args, int); break;
9309 case 'q': iv = va_arg(*args, Quad_t); break;
9314 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9316 case 'h': iv = (short)tiv; break;
9317 case 'l': iv = (long)tiv; break;
9319 default: iv = tiv; break;
9321 case 'q': iv = (Quad_t)tiv; break;
9325 if ( !vectorize ) /* we already set uv above */
9330 esignbuf[esignlen++] = plus;
9334 esignbuf[esignlen++] = '-';
9377 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9388 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9389 case 'l': uv = va_arg(*args, unsigned long); break;
9390 case 'V': uv = va_arg(*args, UV); break;
9391 default: uv = va_arg(*args, unsigned); break;
9393 case 'q': uv = va_arg(*args, Uquad_t); break;
9398 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9400 case 'h': uv = (unsigned short)tuv; break;
9401 case 'l': uv = (unsigned long)tuv; break;
9403 default: uv = tuv; break;
9405 case 'q': uv = (Uquad_t)tuv; break;
9412 char *ptr = ebuf + sizeof ebuf;
9418 p = (char*)((c == 'X')
9419 ? "0123456789ABCDEF" : "0123456789abcdef");
9425 esignbuf[esignlen++] = '0';
9426 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9434 if (alt && *ptr != '0')
9443 esignbuf[esignlen++] = '0';
9444 esignbuf[esignlen++] = 'b';
9447 default: /* it had better be ten or less */
9451 } while (uv /= base);
9454 elen = (ebuf + sizeof ebuf) - ptr;
9458 zeros = precis - elen;
9459 else if (precis == 0 && elen == 1 && *eptr == '0')
9465 /* FLOATING POINT */
9468 c = 'f'; /* maybe %F isn't supported here */
9474 /* This is evil, but floating point is even more evil */
9476 /* for SV-style calling, we can only get NV
9477 for C-style calling, we assume %f is double;
9478 for simplicity we allow any of %Lf, %llf, %qf for long double
9482 #if defined(USE_LONG_DOUBLE)
9486 /* [perl #20339] - we should accept and ignore %lf rather than die */
9490 #if defined(USE_LONG_DOUBLE)
9491 intsize = args ? 0 : 'q';
9495 #if defined(HAS_LONG_DOUBLE)
9504 /* now we need (long double) if intsize == 'q', else (double) */
9505 nv = (args && !vectorize) ?
9506 #if LONG_DOUBLESIZE > DOUBLESIZE
9508 va_arg(*args, long double) :
9509 va_arg(*args, double)
9511 va_arg(*args, double)
9517 if (c != 'e' && c != 'E') {
9519 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9520 will cast our (long double) to (double) */
9521 (void)Perl_frexp(nv, &i);
9522 if (i == PERL_INT_MIN)
9523 Perl_die(aTHX_ "panic: frexp");
9525 need = BIT_DIGITS(i);
9527 need += has_precis ? precis : 6; /* known default */
9532 #ifdef HAS_LDBL_SPRINTF_BUG
9533 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9534 with sfio - Allen <allens@cpan.org> */
9537 # define MY_DBL_MAX DBL_MAX
9538 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9539 # if DOUBLESIZE >= 8
9540 # define MY_DBL_MAX 1.7976931348623157E+308L
9542 # define MY_DBL_MAX 3.40282347E+38L
9546 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9547 # define MY_DBL_MAX_BUG 1L
9549 # define MY_DBL_MAX_BUG MY_DBL_MAX
9553 # define MY_DBL_MIN DBL_MIN
9554 # else /* XXX guessing! -Allen */
9555 # if DOUBLESIZE >= 8
9556 # define MY_DBL_MIN 2.2250738585072014E-308L
9558 # define MY_DBL_MIN 1.17549435E-38L
9562 if ((intsize == 'q') && (c == 'f') &&
9563 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9565 /* it's going to be short enough that
9566 * long double precision is not needed */
9568 if ((nv <= 0L) && (nv >= -0L))
9569 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9571 /* would use Perl_fp_class as a double-check but not
9572 * functional on IRIX - see perl.h comments */
9574 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9575 /* It's within the range that a double can represent */
9576 #if defined(DBL_MAX) && !defined(DBL_MIN)
9577 if ((nv >= ((long double)1/DBL_MAX)) ||
9578 (nv <= (-(long double)1/DBL_MAX)))
9580 fix_ldbl_sprintf_bug = TRUE;
9583 if (fix_ldbl_sprintf_bug == TRUE) {
9593 # undef MY_DBL_MAX_BUG
9596 #endif /* HAS_LDBL_SPRINTF_BUG */
9598 need += 20; /* fudge factor */
9599 if (PL_efloatsize < need) {
9600 Safefree(PL_efloatbuf);
9601 PL_efloatsize = need + 20; /* more fudge */
9602 New(906, PL_efloatbuf, PL_efloatsize, char);
9603 PL_efloatbuf[0] = '\0';
9606 if ( !(width || left || plus || alt) && fill != '0'
9607 && has_precis && intsize != 'q' ) { /* Shortcuts */
9608 /* See earlier comment about buggy Gconvert when digits,
9610 if ( c == 'g' && precis) {
9611 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9612 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9613 goto float_converted;
9614 } else if ( c == 'f' && !precis) {
9615 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9620 char *ptr = ebuf + sizeof ebuf;
9623 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9624 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9625 if (intsize == 'q') {
9626 /* Copy the one or more characters in a long double
9627 * format before the 'base' ([efgEFG]) character to
9628 * the format string. */
9629 static char const prifldbl[] = PERL_PRIfldbl;
9630 char const *p = prifldbl + sizeof(prifldbl) - 3;
9631 while (p >= prifldbl) { *--ptr = *p--; }
9636 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9641 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9653 /* No taint. Otherwise we are in the strange situation
9654 * where printf() taints but print($float) doesn't.
9656 #if defined(HAS_LONG_DOUBLE)
9658 (void)sprintf(PL_efloatbuf, ptr, nv);
9660 (void)sprintf(PL_efloatbuf, ptr, (double)nv);
9662 (void)sprintf(PL_efloatbuf, ptr, nv);
9666 eptr = PL_efloatbuf;
9667 elen = strlen(PL_efloatbuf);
9673 i = SvCUR(sv) - origlen;
9674 if (args && !vectorize) {
9676 case 'h': *(va_arg(*args, short*)) = i; break;
9677 default: *(va_arg(*args, int*)) = i; break;
9678 case 'l': *(va_arg(*args, long*)) = i; break;
9679 case 'V': *(va_arg(*args, IV*)) = i; break;
9681 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9686 sv_setuv_mg(argsv, (UV)i);
9688 continue; /* not "break" */
9694 if (!args && ckWARN(WARN_PRINTF) &&
9695 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9696 SV *msg = sv_newmortal();
9697 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9698 (PL_op->op_type == OP_PRTF) ? "" : "s");
9701 Perl_sv_catpvf(aTHX_ msg,
9702 "\"%%%c\"", c & 0xFF);
9704 Perl_sv_catpvf(aTHX_ msg,
9705 "\"%%\\%03"UVof"\"",
9708 sv_catpv(msg, "end of string");
9709 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9712 /* output mangled stuff ... */
9718 /* ... right here, because formatting flags should not apply */
9719 SvGROW(sv, SvCUR(sv) + elen + 1);
9721 Copy(eptr, p, elen, char);
9724 SvCUR_set(sv, p - SvPVX_const(sv));
9726 continue; /* not "break" */
9729 /* calculate width before utf8_upgrade changes it */
9730 have = esignlen + zeros + elen;
9732 if (is_utf8 != has_utf8) {
9735 sv_utf8_upgrade(sv);
9738 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9739 sv_utf8_upgrade(nsv);
9740 eptr = SvPVX_const(nsv);
9743 SvGROW(sv, SvCUR(sv) + elen + 1);
9748 need = (have > width ? have : width);
9751 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9753 if (esignlen && fill == '0') {
9754 for (i = 0; i < (int)esignlen; i++)
9758 memset(p, fill, gap);
9761 if (esignlen && fill != '0') {
9762 for (i = 0; i < (int)esignlen; i++)
9766 for (i = zeros; i; i--)
9770 Copy(eptr, p, elen, char);
9774 memset(p, ' ', gap);
9779 Copy(dotstr, p, dotstrlen, char);
9783 vectorize = FALSE; /* done iterating over vecstr */
9790 SvCUR_set(sv, p - SvPVX_const(sv));
9798 /* =========================================================================
9800 =head1 Cloning an interpreter
9802 All the macros and functions in this section are for the private use of
9803 the main function, perl_clone().
9805 The foo_dup() functions make an exact copy of an existing foo thinngy.
9806 During the course of a cloning, a hash table is used to map old addresses
9807 to new addresses. The table is created and manipulated with the
9808 ptr_table_* functions.
9812 ============================================================================*/
9815 #if defined(USE_ITHREADS)
9817 #ifndef GpREFCNT_inc
9818 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9822 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9823 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9824 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9825 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9826 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9827 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9828 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9829 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9830 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9831 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9832 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9833 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9834 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9837 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9838 regcomp.c. AMS 20010712 */
9841 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9846 struct reg_substr_datum *s;
9849 return (REGEXP *)NULL;
9851 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9854 len = r->offsets[0];
9855 npar = r->nparens+1;
9857 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9858 Copy(r->program, ret->program, len+1, regnode);
9860 New(0, ret->startp, npar, I32);
9861 Copy(r->startp, ret->startp, npar, I32);
9862 New(0, ret->endp, npar, I32);
9863 Copy(r->startp, ret->startp, npar, I32);
9865 New(0, ret->substrs, 1, struct reg_substr_data);
9866 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9867 s->min_offset = r->substrs->data[i].min_offset;
9868 s->max_offset = r->substrs->data[i].max_offset;
9869 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9870 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9873 ret->regstclass = NULL;
9876 const int count = r->data->count;
9878 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9879 char, struct reg_data);
9880 New(0, d->what, count, U8);
9883 for (i = 0; i < count; i++) {
9884 d->what[i] = r->data->what[i];
9885 switch (d->what[i]) {
9886 /* legal options are one of: sfpont
9887 see also regcomp.h and pregfree() */
9889 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9892 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9895 /* This is cheating. */
9896 New(0, d->data[i], 1, struct regnode_charclass_class);
9897 StructCopy(r->data->data[i], d->data[i],
9898 struct regnode_charclass_class);
9899 ret->regstclass = (regnode*)d->data[i];
9902 /* Compiled op trees are readonly, and can thus be
9903 shared without duplication. */
9905 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9909 d->data[i] = r->data->data[i];
9912 d->data[i] = r->data->data[i];
9914 ((reg_trie_data*)d->data[i])->refcount++;
9918 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9927 New(0, ret->offsets, 2*len+1, U32);
9928 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9930 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9931 ret->refcnt = r->refcnt;
9932 ret->minlen = r->minlen;
9933 ret->prelen = r->prelen;
9934 ret->nparens = r->nparens;
9935 ret->lastparen = r->lastparen;
9936 ret->lastcloseparen = r->lastcloseparen;
9937 ret->reganch = r->reganch;
9939 ret->sublen = r->sublen;
9941 if (RX_MATCH_COPIED(ret))
9942 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9944 ret->subbeg = Nullch;
9945 #ifdef PERL_OLD_COPY_ON_WRITE
9946 ret->saved_copy = Nullsv;
9949 ptr_table_store(PL_ptr_table, r, ret);
9953 /* duplicate a file handle */
9956 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9962 return (PerlIO*)NULL;
9964 /* look for it in the table first */
9965 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9969 /* create anew and remember what it is */
9970 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9971 ptr_table_store(PL_ptr_table, fp, ret);
9975 /* duplicate a directory handle */
9978 Perl_dirp_dup(pTHX_ DIR *dp)
9986 /* duplicate a typeglob */
9989 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9994 /* look for it in the table first */
9995 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9999 /* create anew and remember what it is */
10000 Newz(0, ret, 1, GP);
10001 ptr_table_store(PL_ptr_table, gp, ret);
10004 ret->gp_refcnt = 0; /* must be before any other dups! */
10005 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10006 ret->gp_io = io_dup_inc(gp->gp_io, param);
10007 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10008 ret->gp_av = av_dup_inc(gp->gp_av, param);
10009 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10010 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10011 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10012 ret->gp_cvgen = gp->gp_cvgen;
10013 ret->gp_flags = gp->gp_flags;
10014 ret->gp_line = gp->gp_line;
10015 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10019 /* duplicate a chain of magic */
10022 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10024 MAGIC *mgprev = (MAGIC*)NULL;
10027 return (MAGIC*)NULL;
10028 /* look for it in the table first */
10029 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10033 for (; mg; mg = mg->mg_moremagic) {
10035 Newz(0, nmg, 1, MAGIC);
10037 mgprev->mg_moremagic = nmg;
10040 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10041 nmg->mg_private = mg->mg_private;
10042 nmg->mg_type = mg->mg_type;
10043 nmg->mg_flags = mg->mg_flags;
10044 if (mg->mg_type == PERL_MAGIC_qr) {
10045 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10047 else if(mg->mg_type == PERL_MAGIC_backref) {
10048 const AV * const av = (AV*) mg->mg_obj;
10051 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10053 for (i = AvFILLp(av); i >= 0; i--) {
10054 if (!svp[i]) continue;
10055 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10058 else if (mg->mg_type == PERL_MAGIC_symtab) {
10059 nmg->mg_obj = mg->mg_obj;
10062 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10063 ? sv_dup_inc(mg->mg_obj, param)
10064 : sv_dup(mg->mg_obj, param);
10066 nmg->mg_len = mg->mg_len;
10067 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10068 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10069 if (mg->mg_len > 0) {
10070 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10071 if (mg->mg_type == PERL_MAGIC_overload_table &&
10072 AMT_AMAGIC((AMT*)mg->mg_ptr))
10074 AMT *amtp = (AMT*)mg->mg_ptr;
10075 AMT *namtp = (AMT*)nmg->mg_ptr;
10077 for (i = 1; i < NofAMmeth; i++) {
10078 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10082 else if (mg->mg_len == HEf_SVKEY)
10083 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10085 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10086 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10093 /* create a new pointer-mapping table */
10096 Perl_ptr_table_new(pTHX)
10099 Newz(0, tbl, 1, PTR_TBL_t);
10100 tbl->tbl_max = 511;
10101 tbl->tbl_items = 0;
10102 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10107 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10109 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10112 #define new_pte() new_body(struct ptr_tbl_ent, pte)
10113 #define del_pte(p) del_body(p, struct ptr_tbl_ent, pte)
10115 /* map an existing pointer using a table */
10118 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
10120 PTR_TBL_ENT_t *tblent;
10121 const UV hash = PTR_TABLE_HASH(sv);
10123 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10124 for (; tblent; tblent = tblent->next) {
10125 if (tblent->oldval == sv)
10126 return tblent->newval;
10128 return (void*)NULL;
10131 /* add a new entry to a pointer-mapping table */
10134 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
10136 PTR_TBL_ENT_t *tblent, **otblent;
10137 /* XXX this may be pessimal on platforms where pointers aren't good
10138 * hash values e.g. if they grow faster in the most significant
10140 const UV hash = PTR_TABLE_HASH(oldv);
10144 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10145 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10146 if (tblent->oldval == oldv) {
10147 tblent->newval = newv;
10151 tblent = new_pte();
10152 tblent->oldval = oldv;
10153 tblent->newval = newv;
10154 tblent->next = *otblent;
10157 if (!empty && tbl->tbl_items > tbl->tbl_max)
10158 ptr_table_split(tbl);
10161 /* double the hash bucket size of an existing ptr table */
10164 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10166 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10167 const UV oldsize = tbl->tbl_max + 1;
10168 UV newsize = oldsize * 2;
10171 Renew(ary, newsize, PTR_TBL_ENT_t*);
10172 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10173 tbl->tbl_max = --newsize;
10174 tbl->tbl_ary = ary;
10175 for (i=0; i < oldsize; i++, ary++) {
10176 PTR_TBL_ENT_t **curentp, **entp, *ent;
10179 curentp = ary + oldsize;
10180 for (entp = ary, ent = *ary; ent; ent = *entp) {
10181 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10183 ent->next = *curentp;
10193 /* remove all the entries from a ptr table */
10196 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10198 register PTR_TBL_ENT_t **array;
10199 register PTR_TBL_ENT_t *entry;
10203 if (!tbl || !tbl->tbl_items) {
10207 array = tbl->tbl_ary;
10209 max = tbl->tbl_max;
10213 PTR_TBL_ENT_t *oentry = entry;
10214 entry = entry->next;
10218 if (++riter > max) {
10221 entry = array[riter];
10225 tbl->tbl_items = 0;
10228 /* clear and free a ptr table */
10231 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10236 ptr_table_clear(tbl);
10237 Safefree(tbl->tbl_ary);
10241 /* attempt to make everything in the typeglob readonly */
10244 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10246 GV *gv = (GV*)sstr;
10247 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10249 if (GvIO(gv) || GvFORM(gv)) {
10250 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10252 else if (!GvCV(gv)) {
10253 GvCV(gv) = (CV*)sv;
10256 /* CvPADLISTs cannot be shared */
10257 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10262 if (!GvUNIQUE(gv)) {
10264 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10265 HvNAME_get(GvSTASH(gv)), GvNAME(gv));
10271 * write attempts will die with
10272 * "Modification of a read-only value attempted"
10278 SvREADONLY_on(GvSV(gv));
10282 GvAV(gv) = (AV*)sv;
10285 SvREADONLY_on(GvAV(gv));
10289 GvHV(gv) = (HV*)sv;
10292 SvREADONLY_on(GvHV(gv));
10295 return sstr; /* he_dup() will SvREFCNT_inc() */
10298 /* duplicate an SV of any type (including AV, HV etc) */
10301 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10304 SvRV_set(dstr, SvWEAKREF(sstr)
10305 ? sv_dup(SvRV(sstr), param)
10306 : sv_dup_inc(SvRV(sstr), param));
10309 else if (SvPVX_const(sstr)) {
10310 /* Has something there */
10312 /* Normal PV - clone whole allocated space */
10313 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
10314 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10315 /* Not that normal - actually sstr is copy on write.
10316 But we are a true, independant SV, so: */
10317 SvREADONLY_off(dstr);
10322 /* Special case - not normally malloced for some reason */
10323 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
10324 /* A "shared" PV - clone it as "shared" PV */
10326 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
10330 /* Some other special case - random pointer */
10331 SvPV_set(dstr, SvPVX(sstr));
10336 /* Copy the Null */
10337 if (SvTYPE(dstr) == SVt_RV)
10338 SvRV_set(dstr, NULL);
10345 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10350 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10352 /* look for it in the table first */
10353 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10357 if(param->flags & CLONEf_JOIN_IN) {
10358 /** We are joining here so we don't want do clone
10359 something that is bad **/
10360 const char *hvname;
10362 if(SvTYPE(sstr) == SVt_PVHV &&
10363 (hvname = HvNAME_get(sstr))) {
10364 /** don't clone stashes if they already exist **/
10365 HV* old_stash = gv_stashpv(hvname,0);
10366 return (SV*) old_stash;
10370 /* create anew and remember what it is */
10373 #ifdef DEBUG_LEAKING_SCALARS
10374 dstr->sv_debug_optype = sstr->sv_debug_optype;
10375 dstr->sv_debug_line = sstr->sv_debug_line;
10376 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10377 dstr->sv_debug_cloned = 1;
10379 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10381 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10385 ptr_table_store(PL_ptr_table, sstr, dstr);
10388 SvFLAGS(dstr) = SvFLAGS(sstr);
10389 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10390 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10393 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10394 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10395 PL_watch_pvx, SvPVX_const(sstr));
10398 /* don't clone objects whose class has asked us not to */
10399 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10400 SvFLAGS(dstr) &= ~SVTYPEMASK;
10401 SvOBJECT_off(dstr);
10405 switch (SvTYPE(sstr)) {
10407 SvANY(dstr) = NULL;
10410 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10411 SvIV_set(dstr, SvIVX(sstr));
10414 SvANY(dstr) = new_XNV();
10415 SvNV_set(dstr, SvNVX(sstr));
10418 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10419 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10422 SvANY(dstr) = new_XPV();
10423 SvCUR_set(dstr, SvCUR(sstr));
10424 SvLEN_set(dstr, SvLEN(sstr));
10425 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10428 SvANY(dstr) = new_XPVIV();
10429 SvCUR_set(dstr, SvCUR(sstr));
10430 SvLEN_set(dstr, SvLEN(sstr));
10431 SvIV_set(dstr, SvIVX(sstr));
10432 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10435 SvANY(dstr) = new_XPVNV();
10436 SvCUR_set(dstr, SvCUR(sstr));
10437 SvLEN_set(dstr, SvLEN(sstr));
10438 SvIV_set(dstr, SvIVX(sstr));
10439 SvNV_set(dstr, SvNVX(sstr));
10440 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10443 SvANY(dstr) = new_XPVMG();
10444 SvCUR_set(dstr, SvCUR(sstr));
10445 SvLEN_set(dstr, SvLEN(sstr));
10446 SvIV_set(dstr, SvIVX(sstr));
10447 SvNV_set(dstr, SvNVX(sstr));
10448 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10449 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10450 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10453 SvANY(dstr) = new_XPVBM();
10454 SvCUR_set(dstr, SvCUR(sstr));
10455 SvLEN_set(dstr, SvLEN(sstr));
10456 SvIV_set(dstr, SvIVX(sstr));
10457 SvNV_set(dstr, SvNVX(sstr));
10458 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10459 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10460 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10461 BmRARE(dstr) = BmRARE(sstr);
10462 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10463 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10466 SvANY(dstr) = new_XPVLV();
10467 SvCUR_set(dstr, SvCUR(sstr));
10468 SvLEN_set(dstr, SvLEN(sstr));
10469 SvIV_set(dstr, SvIVX(sstr));
10470 SvNV_set(dstr, SvNVX(sstr));
10471 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10472 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10473 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10474 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10475 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10476 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10477 LvTARG(dstr) = dstr;
10478 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10479 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10481 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10482 LvTYPE(dstr) = LvTYPE(sstr);
10485 if (GvUNIQUE((GV*)sstr)) {
10487 if ((share = gv_share(sstr, param))) {
10490 ptr_table_store(PL_ptr_table, sstr, dstr);
10492 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10493 HvNAME_get(GvSTASH(share)), GvNAME(share));
10498 SvANY(dstr) = new_XPVGV();
10499 SvCUR_set(dstr, SvCUR(sstr));
10500 SvLEN_set(dstr, SvLEN(sstr));
10501 SvIV_set(dstr, SvIVX(sstr));
10502 SvNV_set(dstr, SvNVX(sstr));
10503 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10504 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10505 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10506 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10507 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10508 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10509 GvFLAGS(dstr) = GvFLAGS(sstr);
10510 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10511 (void)GpREFCNT_inc(GvGP(dstr));
10514 SvANY(dstr) = new_XPVIO();
10515 SvCUR_set(dstr, SvCUR(sstr));
10516 SvLEN_set(dstr, SvLEN(sstr));
10517 SvIV_set(dstr, SvIVX(sstr));
10518 SvNV_set(dstr, SvNVX(sstr));
10519 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10520 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10521 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10522 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10523 if (IoOFP(sstr) == IoIFP(sstr))
10524 IoOFP(dstr) = IoIFP(dstr);
10526 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10527 /* PL_rsfp_filters entries have fake IoDIRP() */
10528 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10529 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10531 IoDIRP(dstr) = IoDIRP(sstr);
10532 IoLINES(dstr) = IoLINES(sstr);
10533 IoPAGE(dstr) = IoPAGE(sstr);
10534 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10535 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10536 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10537 /* I have no idea why fake dirp (rsfps)
10538 should be treaded differently but otherwise
10539 we end up with leaks -- sky*/
10540 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10541 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10542 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10544 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10545 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10546 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10548 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10549 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10550 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10551 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10552 IoTYPE(dstr) = IoTYPE(sstr);
10553 IoFLAGS(dstr) = IoFLAGS(sstr);
10556 SvANY(dstr) = new_XPVAV();
10557 SvCUR_set(dstr, SvCUR(sstr));
10558 SvLEN_set(dstr, SvLEN(sstr));
10559 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10560 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10561 if (AvARRAY((AV*)sstr)) {
10562 SV **dst_ary, **src_ary;
10563 SSize_t items = AvFILLp((AV*)sstr) + 1;
10565 src_ary = AvARRAY((AV*)sstr);
10566 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10567 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10568 SvPV_set(dstr, (char*)dst_ary);
10569 AvALLOC((AV*)dstr) = dst_ary;
10570 if (AvREAL((AV*)sstr)) {
10571 while (items-- > 0)
10572 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10575 while (items-- > 0)
10576 *dst_ary++ = sv_dup(*src_ary++, param);
10578 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10579 while (items-- > 0) {
10580 *dst_ary++ = &PL_sv_undef;
10584 SvPV_set(dstr, Nullch);
10585 AvALLOC((AV*)dstr) = (SV**)NULL;
10589 SvANY(dstr) = new_XPVHV();
10590 SvCUR_set(dstr, SvCUR(sstr));
10591 SvLEN_set(dstr, SvLEN(sstr));
10592 HvTOTALKEYS(dstr) = HvTOTALKEYS(sstr);
10593 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10594 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10598 if (HvARRAY((HV*)sstr)) {
10600 const bool sharekeys = !!HvSHAREKEYS(sstr);
10601 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10602 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10605 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10606 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0), char);
10607 HvARRAY(dstr) = (HE**)darray;
10608 while (i <= sxhv->xhv_max) {
10609 HE *source = HvARRAY(sstr)[i];
10611 = source ? he_dup(source, sharekeys, param) : 0;
10615 struct xpvhv_aux *saux = HvAUX(sstr);
10616 struct xpvhv_aux *daux = HvAUX(dstr);
10617 /* This flag isn't copied. */
10618 /* SvOOK_on(hv) attacks the IV flags. */
10619 SvFLAGS(dstr) |= SVf_OOK;
10621 hvname = saux->xhv_name;
10622 daux->xhv_name = hvname ? hek_dup(hvname, param) : hvname;
10624 daux->xhv_riter = saux->xhv_riter;
10625 daux->xhv_eiter = saux->xhv_eiter
10626 ? he_dup(saux->xhv_eiter, (bool)!!HvSHAREKEYS(sstr),
10631 SvPV_set(dstr, Nullch);
10633 /* Record stashes for possible cloning in Perl_clone(). */
10635 av_push(param->stashes, dstr);
10639 SvANY(dstr) = new_XPVFM();
10640 FmLINES(dstr) = FmLINES(sstr);
10644 SvANY(dstr) = new_XPVCV();
10646 SvCUR_set(dstr, SvCUR(sstr));
10647 SvLEN_set(dstr, SvLEN(sstr));
10648 SvIV_set(dstr, SvIVX(sstr));
10649 SvNV_set(dstr, SvNVX(sstr));
10650 SvMAGIC_set(dstr, mg_dup(SvMAGIC(sstr), param));
10651 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(sstr), param));
10652 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10653 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10654 CvSTART(dstr) = CvSTART(sstr);
10656 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10658 CvXSUB(dstr) = CvXSUB(sstr);
10659 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10660 if (CvCONST(sstr)) {
10661 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10662 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10663 sv_dup_inc((SV *)CvXSUBANY(sstr).any_ptr, param);
10665 /* don't dup if copying back - CvGV isn't refcounted, so the
10666 * duped GV may never be freed. A bit of a hack! DAPM */
10667 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10668 Nullgv : gv_dup(CvGV(sstr), param) ;
10669 if (param->flags & CLONEf_COPY_STACKS) {
10670 CvDEPTH(dstr) = CvDEPTH(sstr);
10674 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10675 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10677 CvWEAKOUTSIDE(sstr)
10678 ? cv_dup( CvOUTSIDE(sstr), param)
10679 : cv_dup_inc(CvOUTSIDE(sstr), param);
10680 CvFLAGS(dstr) = CvFLAGS(sstr);
10681 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10684 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10688 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10694 /* duplicate a context */
10697 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10699 PERL_CONTEXT *ncxs;
10702 return (PERL_CONTEXT*)NULL;
10704 /* look for it in the table first */
10705 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10709 /* create anew and remember what it is */
10710 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10711 ptr_table_store(PL_ptr_table, cxs, ncxs);
10714 PERL_CONTEXT *cx = &cxs[ix];
10715 PERL_CONTEXT *ncx = &ncxs[ix];
10716 ncx->cx_type = cx->cx_type;
10717 if (CxTYPE(cx) == CXt_SUBST) {
10718 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10721 ncx->blk_oldsp = cx->blk_oldsp;
10722 ncx->blk_oldcop = cx->blk_oldcop;
10723 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10724 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10725 ncx->blk_oldpm = cx->blk_oldpm;
10726 ncx->blk_gimme = cx->blk_gimme;
10727 switch (CxTYPE(cx)) {
10729 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10730 ? cv_dup_inc(cx->blk_sub.cv, param)
10731 : cv_dup(cx->blk_sub.cv,param));
10732 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10733 ? av_dup_inc(cx->blk_sub.argarray, param)
10735 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10736 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10737 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10738 ncx->blk_sub.lval = cx->blk_sub.lval;
10739 ncx->blk_sub.retop = cx->blk_sub.retop;
10742 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10743 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10744 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10745 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10746 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10747 ncx->blk_eval.retop = cx->blk_eval.retop;
10750 ncx->blk_loop.label = cx->blk_loop.label;
10751 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10752 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10753 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10754 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10755 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10756 ? cx->blk_loop.iterdata
10757 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10758 ncx->blk_loop.oldcomppad
10759 = (PAD*)ptr_table_fetch(PL_ptr_table,
10760 cx->blk_loop.oldcomppad);
10761 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10762 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10763 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10764 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10765 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10768 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10769 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10770 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10771 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10772 ncx->blk_sub.retop = cx->blk_sub.retop;
10784 /* duplicate a stack info structure */
10787 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10792 return (PERL_SI*)NULL;
10794 /* look for it in the table first */
10795 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10799 /* create anew and remember what it is */
10800 Newz(56, nsi, 1, PERL_SI);
10801 ptr_table_store(PL_ptr_table, si, nsi);
10803 nsi->si_stack = av_dup_inc(si->si_stack, param);
10804 nsi->si_cxix = si->si_cxix;
10805 nsi->si_cxmax = si->si_cxmax;
10806 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10807 nsi->si_type = si->si_type;
10808 nsi->si_prev = si_dup(si->si_prev, param);
10809 nsi->si_next = si_dup(si->si_next, param);
10810 nsi->si_markoff = si->si_markoff;
10815 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10816 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10817 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10818 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10819 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10820 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10821 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10822 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10823 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10824 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10825 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10826 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10827 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10828 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10831 #define pv_dup_inc(p) SAVEPV(p)
10832 #define pv_dup(p) SAVEPV(p)
10833 #define svp_dup_inc(p,pp) any_dup(p,pp)
10835 /* map any object to the new equivent - either something in the
10836 * ptr table, or something in the interpreter structure
10840 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10845 return (void*)NULL;
10847 /* look for it in the table first */
10848 ret = ptr_table_fetch(PL_ptr_table, v);
10852 /* see if it is part of the interpreter structure */
10853 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10854 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10862 /* duplicate the save stack */
10865 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10867 ANY *ss = proto_perl->Tsavestack;
10868 I32 ix = proto_perl->Tsavestack_ix;
10869 I32 max = proto_perl->Tsavestack_max;
10881 void (*dptr) (void*);
10882 void (*dxptr) (pTHX_ void*);
10885 Newz(54, nss, max, ANY);
10888 I32 i = POPINT(ss,ix);
10889 TOPINT(nss,ix) = i;
10891 case SAVEt_ITEM: /* normal string */
10892 sv = (SV*)POPPTR(ss,ix);
10893 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10894 sv = (SV*)POPPTR(ss,ix);
10895 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10897 case SAVEt_SV: /* scalar reference */
10898 sv = (SV*)POPPTR(ss,ix);
10899 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10900 gv = (GV*)POPPTR(ss,ix);
10901 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10903 case SAVEt_GENERIC_PVREF: /* generic char* */
10904 c = (char*)POPPTR(ss,ix);
10905 TOPPTR(nss,ix) = pv_dup(c);
10906 ptr = POPPTR(ss,ix);
10907 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10909 case SAVEt_SHARED_PVREF: /* char* in shared space */
10910 c = (char*)POPPTR(ss,ix);
10911 TOPPTR(nss,ix) = savesharedpv(c);
10912 ptr = POPPTR(ss,ix);
10913 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10915 case SAVEt_GENERIC_SVREF: /* generic sv */
10916 case SAVEt_SVREF: /* scalar reference */
10917 sv = (SV*)POPPTR(ss,ix);
10918 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10919 ptr = POPPTR(ss,ix);
10920 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10922 case SAVEt_AV: /* array reference */
10923 av = (AV*)POPPTR(ss,ix);
10924 TOPPTR(nss,ix) = av_dup_inc(av, param);
10925 gv = (GV*)POPPTR(ss,ix);
10926 TOPPTR(nss,ix) = gv_dup(gv, param);
10928 case SAVEt_HV: /* hash reference */
10929 hv = (HV*)POPPTR(ss,ix);
10930 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10931 gv = (GV*)POPPTR(ss,ix);
10932 TOPPTR(nss,ix) = gv_dup(gv, param);
10934 case SAVEt_INT: /* int reference */
10935 ptr = POPPTR(ss,ix);
10936 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10937 intval = (int)POPINT(ss,ix);
10938 TOPINT(nss,ix) = intval;
10940 case SAVEt_LONG: /* long reference */
10941 ptr = POPPTR(ss,ix);
10942 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10943 longval = (long)POPLONG(ss,ix);
10944 TOPLONG(nss,ix) = longval;
10946 case SAVEt_I32: /* I32 reference */
10947 case SAVEt_I16: /* I16 reference */
10948 case SAVEt_I8: /* I8 reference */
10949 ptr = POPPTR(ss,ix);
10950 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10952 TOPINT(nss,ix) = i;
10954 case SAVEt_IV: /* IV reference */
10955 ptr = POPPTR(ss,ix);
10956 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10958 TOPIV(nss,ix) = iv;
10960 case SAVEt_SPTR: /* SV* reference */
10961 ptr = POPPTR(ss,ix);
10962 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10963 sv = (SV*)POPPTR(ss,ix);
10964 TOPPTR(nss,ix) = sv_dup(sv, param);
10966 case SAVEt_VPTR: /* random* reference */
10967 ptr = POPPTR(ss,ix);
10968 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10969 ptr = POPPTR(ss,ix);
10970 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10972 case SAVEt_PPTR: /* char* reference */
10973 ptr = POPPTR(ss,ix);
10974 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10975 c = (char*)POPPTR(ss,ix);
10976 TOPPTR(nss,ix) = pv_dup(c);
10978 case SAVEt_HPTR: /* HV* reference */
10979 ptr = POPPTR(ss,ix);
10980 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10981 hv = (HV*)POPPTR(ss,ix);
10982 TOPPTR(nss,ix) = hv_dup(hv, param);
10984 case SAVEt_APTR: /* AV* reference */
10985 ptr = POPPTR(ss,ix);
10986 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10987 av = (AV*)POPPTR(ss,ix);
10988 TOPPTR(nss,ix) = av_dup(av, param);
10991 gv = (GV*)POPPTR(ss,ix);
10992 TOPPTR(nss,ix) = gv_dup(gv, param);
10994 case SAVEt_GP: /* scalar reference */
10995 gp = (GP*)POPPTR(ss,ix);
10996 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10997 (void)GpREFCNT_inc(gp);
10998 gv = (GV*)POPPTR(ss,ix);
10999 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
11000 c = (char*)POPPTR(ss,ix);
11001 TOPPTR(nss,ix) = pv_dup(c);
11003 TOPIV(nss,ix) = iv;
11005 TOPIV(nss,ix) = iv;
11008 case SAVEt_MORTALIZESV:
11009 sv = (SV*)POPPTR(ss,ix);
11010 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11013 ptr = POPPTR(ss,ix);
11014 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
11015 /* these are assumed to be refcounted properly */
11016 switch (((OP*)ptr)->op_type) {
11018 case OP_LEAVESUBLV:
11022 case OP_LEAVEWRITE:
11023 TOPPTR(nss,ix) = ptr;
11028 TOPPTR(nss,ix) = Nullop;
11033 TOPPTR(nss,ix) = Nullop;
11036 c = (char*)POPPTR(ss,ix);
11037 TOPPTR(nss,ix) = pv_dup_inc(c);
11039 case SAVEt_CLEARSV:
11040 longval = POPLONG(ss,ix);
11041 TOPLONG(nss,ix) = longval;
11044 hv = (HV*)POPPTR(ss,ix);
11045 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11046 c = (char*)POPPTR(ss,ix);
11047 TOPPTR(nss,ix) = pv_dup_inc(c);
11049 TOPINT(nss,ix) = i;
11051 case SAVEt_DESTRUCTOR:
11052 ptr = POPPTR(ss,ix);
11053 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11054 dptr = POPDPTR(ss,ix);
11055 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
11056 any_dup(FPTR2DPTR(void *, dptr),
11059 case SAVEt_DESTRUCTOR_X:
11060 ptr = POPPTR(ss,ix);
11061 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11062 dxptr = POPDXPTR(ss,ix);
11063 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
11064 any_dup(FPTR2DPTR(void *, dxptr),
11067 case SAVEt_REGCONTEXT:
11070 TOPINT(nss,ix) = i;
11073 case SAVEt_STACK_POS: /* Position on Perl stack */
11075 TOPINT(nss,ix) = i;
11077 case SAVEt_AELEM: /* array element */
11078 sv = (SV*)POPPTR(ss,ix);
11079 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11081 TOPINT(nss,ix) = i;
11082 av = (AV*)POPPTR(ss,ix);
11083 TOPPTR(nss,ix) = av_dup_inc(av, param);
11085 case SAVEt_HELEM: /* hash element */
11086 sv = (SV*)POPPTR(ss,ix);
11087 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11088 sv = (SV*)POPPTR(ss,ix);
11089 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11090 hv = (HV*)POPPTR(ss,ix);
11091 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11094 ptr = POPPTR(ss,ix);
11095 TOPPTR(nss,ix) = ptr;
11099 TOPINT(nss,ix) = i;
11101 case SAVEt_COMPPAD:
11102 av = (AV*)POPPTR(ss,ix);
11103 TOPPTR(nss,ix) = av_dup(av, param);
11106 longval = (long)POPLONG(ss,ix);
11107 TOPLONG(nss,ix) = longval;
11108 ptr = POPPTR(ss,ix);
11109 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11110 sv = (SV*)POPPTR(ss,ix);
11111 TOPPTR(nss,ix) = sv_dup(sv, param);
11114 ptr = POPPTR(ss,ix);
11115 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11116 longval = (long)POPBOOL(ss,ix);
11117 TOPBOOL(nss,ix) = (bool)longval;
11119 case SAVEt_SET_SVFLAGS:
11121 TOPINT(nss,ix) = i;
11123 TOPINT(nss,ix) = i;
11124 sv = (SV*)POPPTR(ss,ix);
11125 TOPPTR(nss,ix) = sv_dup(sv, param);
11128 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11136 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11137 * flag to the result. This is done for each stash before cloning starts,
11138 * so we know which stashes want their objects cloned */
11141 do_mark_cloneable_stash(pTHX_ SV *sv)
11143 const HEK *hvname = HvNAME_HEK((HV*)sv);
11145 GV* cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11146 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11147 if (cloner && GvCV(cloner)) {
11154 XPUSHs(sv_2mortal(newSVhek(hvname)));
11156 call_sv((SV*)GvCV(cloner), G_SCALAR);
11163 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11171 =for apidoc perl_clone
11173 Create and return a new interpreter by cloning the current one.
11175 perl_clone takes these flags as parameters:
11177 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11178 without it we only clone the data and zero the stacks,
11179 with it we copy the stacks and the new perl interpreter is
11180 ready to run at the exact same point as the previous one.
11181 The pseudo-fork code uses COPY_STACKS while the
11182 threads->new doesn't.
11184 CLONEf_KEEP_PTR_TABLE
11185 perl_clone keeps a ptr_table with the pointer of the old
11186 variable as a key and the new variable as a value,
11187 this allows it to check if something has been cloned and not
11188 clone it again but rather just use the value and increase the
11189 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11190 the ptr_table using the function
11191 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11192 reason to keep it around is if you want to dup some of your own
11193 variable who are outside the graph perl scans, example of this
11194 code is in threads.xs create
11197 This is a win32 thing, it is ignored on unix, it tells perls
11198 win32host code (which is c++) to clone itself, this is needed on
11199 win32 if you want to run two threads at the same time,
11200 if you just want to do some stuff in a separate perl interpreter
11201 and then throw it away and return to the original one,
11202 you don't need to do anything.
11207 /* XXX the above needs expanding by someone who actually understands it ! */
11208 EXTERN_C PerlInterpreter *
11209 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11212 perl_clone(PerlInterpreter *proto_perl, UV flags)
11215 #ifdef PERL_IMPLICIT_SYS
11217 /* perlhost.h so we need to call into it
11218 to clone the host, CPerlHost should have a c interface, sky */
11220 if (flags & CLONEf_CLONE_HOST) {
11221 return perl_clone_host(proto_perl,flags);
11223 return perl_clone_using(proto_perl, flags,
11225 proto_perl->IMemShared,
11226 proto_perl->IMemParse,
11228 proto_perl->IStdIO,
11232 proto_perl->IProc);
11236 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11237 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11238 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11239 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11240 struct IPerlDir* ipD, struct IPerlSock* ipS,
11241 struct IPerlProc* ipP)
11243 /* XXX many of the string copies here can be optimized if they're
11244 * constants; they need to be allocated as common memory and just
11245 * their pointers copied. */
11248 CLONE_PARAMS clone_params;
11249 CLONE_PARAMS* param = &clone_params;
11251 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11252 /* for each stash, determine whether its objects should be cloned */
11253 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11254 PERL_SET_THX(my_perl);
11257 Poison(my_perl, 1, PerlInterpreter);
11259 PL_curcop = (COP *)Nullop;
11263 PL_savestack_ix = 0;
11264 PL_savestack_max = -1;
11265 PL_sig_pending = 0;
11266 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11267 # else /* !DEBUGGING */
11268 Zero(my_perl, 1, PerlInterpreter);
11269 # endif /* DEBUGGING */
11271 /* host pointers */
11273 PL_MemShared = ipMS;
11274 PL_MemParse = ipMP;
11281 #else /* !PERL_IMPLICIT_SYS */
11283 CLONE_PARAMS clone_params;
11284 CLONE_PARAMS* param = &clone_params;
11285 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11286 /* for each stash, determine whether its objects should be cloned */
11287 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11288 PERL_SET_THX(my_perl);
11291 Poison(my_perl, 1, PerlInterpreter);
11293 PL_curcop = (COP *)Nullop;
11297 PL_savestack_ix = 0;
11298 PL_savestack_max = -1;
11299 PL_sig_pending = 0;
11300 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11301 # else /* !DEBUGGING */
11302 Zero(my_perl, 1, PerlInterpreter);
11303 # endif /* DEBUGGING */
11304 #endif /* PERL_IMPLICIT_SYS */
11305 param->flags = flags;
11306 param->proto_perl = proto_perl;
11309 PL_xnv_arenaroot = NULL;
11310 PL_xnv_root = NULL;
11311 PL_xpv_arenaroot = NULL;
11312 PL_xpv_root = NULL;
11313 PL_xpviv_arenaroot = NULL;
11314 PL_xpviv_root = NULL;
11315 PL_xpvnv_arenaroot = NULL;
11316 PL_xpvnv_root = NULL;
11317 PL_xpvcv_arenaroot = NULL;
11318 PL_xpvcv_root = NULL;
11319 PL_xpvav_arenaroot = NULL;
11320 PL_xpvav_root = NULL;
11321 PL_xpvhv_arenaroot = NULL;
11322 PL_xpvhv_root = NULL;
11323 PL_xpvmg_arenaroot = NULL;
11324 PL_xpvmg_root = NULL;
11325 PL_xpvgv_arenaroot = NULL;
11326 PL_xpvgv_root = NULL;
11327 PL_xpvlv_arenaroot = NULL;
11328 PL_xpvlv_root = NULL;
11329 PL_xpvbm_arenaroot = NULL;
11330 PL_xpvbm_root = NULL;
11331 PL_he_arenaroot = NULL;
11333 #if defined(USE_ITHREADS)
11334 PL_pte_arenaroot = NULL;
11335 PL_pte_root = NULL;
11337 PL_nice_chunk = NULL;
11338 PL_nice_chunk_size = 0;
11340 PL_sv_objcount = 0;
11341 PL_sv_root = Nullsv;
11342 PL_sv_arenaroot = Nullsv;
11344 PL_debug = proto_perl->Idebug;
11346 PL_hash_seed = proto_perl->Ihash_seed;
11347 PL_rehash_seed = proto_perl->Irehash_seed;
11349 #ifdef USE_REENTRANT_API
11350 /* XXX: things like -Dm will segfault here in perlio, but doing
11351 * PERL_SET_CONTEXT(proto_perl);
11352 * breaks too many other things
11354 Perl_reentrant_init(aTHX);
11357 /* create SV map for pointer relocation */
11358 PL_ptr_table = ptr_table_new();
11360 /* initialize these special pointers as early as possible */
11361 SvANY(&PL_sv_undef) = NULL;
11362 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11363 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11364 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11366 SvANY(&PL_sv_no) = new_XPVNV();
11367 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11368 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11369 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11370 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11371 SvCUR_set(&PL_sv_no, 0);
11372 SvLEN_set(&PL_sv_no, 1);
11373 SvIV_set(&PL_sv_no, 0);
11374 SvNV_set(&PL_sv_no, 0);
11375 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11377 SvANY(&PL_sv_yes) = new_XPVNV();
11378 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11379 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11380 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11381 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11382 SvCUR_set(&PL_sv_yes, 1);
11383 SvLEN_set(&PL_sv_yes, 2);
11384 SvIV_set(&PL_sv_yes, 1);
11385 SvNV_set(&PL_sv_yes, 1);
11386 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11388 /* create (a non-shared!) shared string table */
11389 PL_strtab = newHV();
11390 HvSHAREKEYS_off(PL_strtab);
11391 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11392 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11394 PL_compiling = proto_perl->Icompiling;
11396 /* These two PVs will be free'd special way so must set them same way op.c does */
11397 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11398 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11400 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11401 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11403 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11404 if (!specialWARN(PL_compiling.cop_warnings))
11405 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11406 if (!specialCopIO(PL_compiling.cop_io))
11407 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11408 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11410 /* pseudo environmental stuff */
11411 PL_origargc = proto_perl->Iorigargc;
11412 PL_origargv = proto_perl->Iorigargv;
11414 param->stashes = newAV(); /* Setup array of objects to call clone on */
11416 #ifdef PERLIO_LAYERS
11417 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11418 PerlIO_clone(aTHX_ proto_perl, param);
11421 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11422 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11423 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11424 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11425 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11426 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11429 PL_minus_c = proto_perl->Iminus_c;
11430 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11431 PL_localpatches = proto_perl->Ilocalpatches;
11432 PL_splitstr = proto_perl->Isplitstr;
11433 PL_preprocess = proto_perl->Ipreprocess;
11434 PL_minus_n = proto_perl->Iminus_n;
11435 PL_minus_p = proto_perl->Iminus_p;
11436 PL_minus_l = proto_perl->Iminus_l;
11437 PL_minus_a = proto_perl->Iminus_a;
11438 PL_minus_F = proto_perl->Iminus_F;
11439 PL_doswitches = proto_perl->Idoswitches;
11440 PL_dowarn = proto_perl->Idowarn;
11441 PL_doextract = proto_perl->Idoextract;
11442 PL_sawampersand = proto_perl->Isawampersand;
11443 PL_unsafe = proto_perl->Iunsafe;
11444 PL_inplace = SAVEPV(proto_perl->Iinplace);
11445 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11446 PL_perldb = proto_perl->Iperldb;
11447 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11448 PL_exit_flags = proto_perl->Iexit_flags;
11450 /* magical thingies */
11451 /* XXX time(&PL_basetime) when asked for? */
11452 PL_basetime = proto_perl->Ibasetime;
11453 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11455 PL_maxsysfd = proto_perl->Imaxsysfd;
11456 PL_multiline = proto_perl->Imultiline;
11457 PL_statusvalue = proto_perl->Istatusvalue;
11459 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11461 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11463 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11464 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11465 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11467 /* Clone the regex array */
11468 PL_regex_padav = newAV();
11470 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11471 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11473 av_push(PL_regex_padav,
11474 sv_dup_inc(regexen[0],param));
11475 for(i = 1; i <= len; i++) {
11476 if(SvREPADTMP(regexen[i])) {
11477 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11479 av_push(PL_regex_padav,
11481 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11482 SvIVX(regexen[i])), param)))
11487 PL_regex_pad = AvARRAY(PL_regex_padav);
11489 /* shortcuts to various I/O objects */
11490 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11491 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11492 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11493 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11494 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11495 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11497 /* shortcuts to regexp stuff */
11498 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11500 /* shortcuts to misc objects */
11501 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11503 /* shortcuts to debugging objects */
11504 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11505 PL_DBline = gv_dup(proto_perl->IDBline, param);
11506 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11507 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11508 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11509 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11510 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11511 PL_lineary = av_dup(proto_perl->Ilineary, param);
11512 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11514 /* symbol tables */
11515 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11516 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11517 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11518 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11519 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11521 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11522 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11523 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11524 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11525 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11526 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11528 PL_sub_generation = proto_perl->Isub_generation;
11530 /* funky return mechanisms */
11531 PL_forkprocess = proto_perl->Iforkprocess;
11533 /* subprocess state */
11534 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11536 /* internal state */
11537 PL_tainting = proto_perl->Itainting;
11538 PL_taint_warn = proto_perl->Itaint_warn;
11539 PL_maxo = proto_perl->Imaxo;
11540 if (proto_perl->Iop_mask)
11541 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11543 PL_op_mask = Nullch;
11544 /* PL_asserting = proto_perl->Iasserting; */
11546 /* current interpreter roots */
11547 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11548 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11549 PL_main_start = proto_perl->Imain_start;
11550 PL_eval_root = proto_perl->Ieval_root;
11551 PL_eval_start = proto_perl->Ieval_start;
11553 /* runtime control stuff */
11554 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11555 PL_copline = proto_perl->Icopline;
11557 PL_filemode = proto_perl->Ifilemode;
11558 PL_lastfd = proto_perl->Ilastfd;
11559 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11562 PL_gensym = proto_perl->Igensym;
11563 PL_preambled = proto_perl->Ipreambled;
11564 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11565 PL_laststatval = proto_perl->Ilaststatval;
11566 PL_laststype = proto_perl->Ilaststype;
11567 PL_mess_sv = Nullsv;
11569 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11570 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11572 /* interpreter atexit processing */
11573 PL_exitlistlen = proto_perl->Iexitlistlen;
11574 if (PL_exitlistlen) {
11575 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11576 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11579 PL_exitlist = (PerlExitListEntry*)NULL;
11580 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11581 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11582 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11584 PL_profiledata = NULL;
11585 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11586 /* PL_rsfp_filters entries have fake IoDIRP() */
11587 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11589 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11591 PAD_CLONE_VARS(proto_perl, param);
11593 #ifdef HAVE_INTERP_INTERN
11594 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11597 /* more statics moved here */
11598 PL_generation = proto_perl->Igeneration;
11599 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11601 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11602 PL_in_clean_all = proto_perl->Iin_clean_all;
11604 PL_uid = proto_perl->Iuid;
11605 PL_euid = proto_perl->Ieuid;
11606 PL_gid = proto_perl->Igid;
11607 PL_egid = proto_perl->Iegid;
11608 PL_nomemok = proto_perl->Inomemok;
11609 PL_an = proto_perl->Ian;
11610 PL_evalseq = proto_perl->Ievalseq;
11611 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11612 PL_origalen = proto_perl->Iorigalen;
11613 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11614 PL_osname = SAVEPV(proto_perl->Iosname);
11615 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11616 PL_sighandlerp = proto_perl->Isighandlerp;
11619 PL_runops = proto_perl->Irunops;
11621 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11624 PL_cshlen = proto_perl->Icshlen;
11625 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11628 PL_lex_state = proto_perl->Ilex_state;
11629 PL_lex_defer = proto_perl->Ilex_defer;
11630 PL_lex_expect = proto_perl->Ilex_expect;
11631 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11632 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11633 PL_lex_starts = proto_perl->Ilex_starts;
11634 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11635 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11636 PL_lex_op = proto_perl->Ilex_op;
11637 PL_lex_inpat = proto_perl->Ilex_inpat;
11638 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11639 PL_lex_brackets = proto_perl->Ilex_brackets;
11640 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11641 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11642 PL_lex_casemods = proto_perl->Ilex_casemods;
11643 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11644 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11646 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11647 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11648 PL_nexttoke = proto_perl->Inexttoke;
11650 /* XXX This is probably masking the deeper issue of why
11651 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11652 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11653 * (A little debugging with a watchpoint on it may help.)
11655 if (SvANY(proto_perl->Ilinestr)) {
11656 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11657 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11658 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11659 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11660 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11661 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11662 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11663 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11664 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11667 PL_linestr = NEWSV(65,79);
11668 sv_upgrade(PL_linestr,SVt_PVIV);
11669 sv_setpvn(PL_linestr,"",0);
11670 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11672 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11673 PL_pending_ident = proto_perl->Ipending_ident;
11674 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11676 PL_expect = proto_perl->Iexpect;
11678 PL_multi_start = proto_perl->Imulti_start;
11679 PL_multi_end = proto_perl->Imulti_end;
11680 PL_multi_open = proto_perl->Imulti_open;
11681 PL_multi_close = proto_perl->Imulti_close;
11683 PL_error_count = proto_perl->Ierror_count;
11684 PL_subline = proto_perl->Isubline;
11685 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11687 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11688 if (SvANY(proto_perl->Ilinestr)) {
11689 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11690 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11691 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11692 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11693 PL_last_lop_op = proto_perl->Ilast_lop_op;
11696 PL_last_uni = SvPVX(PL_linestr);
11697 PL_last_lop = SvPVX(PL_linestr);
11698 PL_last_lop_op = 0;
11700 PL_in_my = proto_perl->Iin_my;
11701 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11703 PL_cryptseen = proto_perl->Icryptseen;
11706 PL_hints = proto_perl->Ihints;
11708 PL_amagic_generation = proto_perl->Iamagic_generation;
11710 #ifdef USE_LOCALE_COLLATE
11711 PL_collation_ix = proto_perl->Icollation_ix;
11712 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11713 PL_collation_standard = proto_perl->Icollation_standard;
11714 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11715 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11716 #endif /* USE_LOCALE_COLLATE */
11718 #ifdef USE_LOCALE_NUMERIC
11719 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11720 PL_numeric_standard = proto_perl->Inumeric_standard;
11721 PL_numeric_local = proto_perl->Inumeric_local;
11722 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11723 #endif /* !USE_LOCALE_NUMERIC */
11725 /* utf8 character classes */
11726 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11727 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11728 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11729 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11730 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11731 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11732 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11733 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11734 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11735 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11736 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11737 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11738 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11739 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11740 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11741 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11742 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11743 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11744 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11745 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11747 /* Did the locale setup indicate UTF-8? */
11748 PL_utf8locale = proto_perl->Iutf8locale;
11749 /* Unicode features (see perlrun/-C) */
11750 PL_unicode = proto_perl->Iunicode;
11752 /* Pre-5.8 signals control */
11753 PL_signals = proto_perl->Isignals;
11755 /* times() ticks per second */
11756 PL_clocktick = proto_perl->Iclocktick;
11758 /* Recursion stopper for PerlIO_find_layer */
11759 PL_in_load_module = proto_perl->Iin_load_module;
11761 /* sort() routine */
11762 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11764 /* Not really needed/useful since the reenrant_retint is "volatile",
11765 * but do it for consistency's sake. */
11766 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11768 /* Hooks to shared SVs and locks. */
11769 PL_sharehook = proto_perl->Isharehook;
11770 PL_lockhook = proto_perl->Ilockhook;
11771 PL_unlockhook = proto_perl->Iunlockhook;
11772 PL_threadhook = proto_perl->Ithreadhook;
11774 PL_runops_std = proto_perl->Irunops_std;
11775 PL_runops_dbg = proto_perl->Irunops_dbg;
11777 #ifdef THREADS_HAVE_PIDS
11778 PL_ppid = proto_perl->Ippid;
11782 PL_last_swash_hv = Nullhv; /* reinits on demand */
11783 PL_last_swash_klen = 0;
11784 PL_last_swash_key[0]= '\0';
11785 PL_last_swash_tmps = (U8*)NULL;
11786 PL_last_swash_slen = 0;
11788 PL_glob_index = proto_perl->Iglob_index;
11789 PL_srand_called = proto_perl->Isrand_called;
11790 PL_uudmap['M'] = 0; /* reinits on demand */
11791 PL_bitcount = Nullch; /* reinits on demand */
11793 if (proto_perl->Ipsig_pend) {
11794 Newz(0, PL_psig_pend, SIG_SIZE, int);
11797 PL_psig_pend = (int*)NULL;
11800 if (proto_perl->Ipsig_ptr) {
11801 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11802 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11803 for (i = 1; i < SIG_SIZE; i++) {
11804 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11805 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11809 PL_psig_ptr = (SV**)NULL;
11810 PL_psig_name = (SV**)NULL;
11813 /* thrdvar.h stuff */
11815 if (flags & CLONEf_COPY_STACKS) {
11816 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11817 PL_tmps_ix = proto_perl->Ttmps_ix;
11818 PL_tmps_max = proto_perl->Ttmps_max;
11819 PL_tmps_floor = proto_perl->Ttmps_floor;
11820 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11822 while (i <= PL_tmps_ix) {
11823 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11827 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11828 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11829 Newz(54, PL_markstack, i, I32);
11830 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11831 - proto_perl->Tmarkstack);
11832 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11833 - proto_perl->Tmarkstack);
11834 Copy(proto_perl->Tmarkstack, PL_markstack,
11835 PL_markstack_ptr - PL_markstack + 1, I32);
11837 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11838 * NOTE: unlike the others! */
11839 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11840 PL_scopestack_max = proto_perl->Tscopestack_max;
11841 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11842 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11844 /* NOTE: si_dup() looks at PL_markstack */
11845 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11847 /* PL_curstack = PL_curstackinfo->si_stack; */
11848 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11849 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11851 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11852 PL_stack_base = AvARRAY(PL_curstack);
11853 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11854 - proto_perl->Tstack_base);
11855 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11857 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11858 * NOTE: unlike the others! */
11859 PL_savestack_ix = proto_perl->Tsavestack_ix;
11860 PL_savestack_max = proto_perl->Tsavestack_max;
11861 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11862 PL_savestack = ss_dup(proto_perl, param);
11866 ENTER; /* perl_destruct() wants to LEAVE; */
11869 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11870 PL_top_env = &PL_start_env;
11872 PL_op = proto_perl->Top;
11875 PL_Xpv = (XPV*)NULL;
11876 PL_na = proto_perl->Tna;
11878 PL_statbuf = proto_perl->Tstatbuf;
11879 PL_statcache = proto_perl->Tstatcache;
11880 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11881 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11883 PL_timesbuf = proto_perl->Ttimesbuf;
11886 PL_tainted = proto_perl->Ttainted;
11887 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11888 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11889 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11890 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11891 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11892 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11893 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11894 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11895 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11897 PL_restartop = proto_perl->Trestartop;
11898 PL_in_eval = proto_perl->Tin_eval;
11899 PL_delaymagic = proto_perl->Tdelaymagic;
11900 PL_dirty = proto_perl->Tdirty;
11901 PL_localizing = proto_perl->Tlocalizing;
11903 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11904 PL_hv_fetch_ent_mh = Nullhe;
11905 PL_modcount = proto_perl->Tmodcount;
11906 PL_lastgotoprobe = Nullop;
11907 PL_dumpindent = proto_perl->Tdumpindent;
11909 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11910 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11911 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11912 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11913 PL_sortcxix = proto_perl->Tsortcxix;
11914 PL_efloatbuf = Nullch; /* reinits on demand */
11915 PL_efloatsize = 0; /* reinits on demand */
11919 PL_screamfirst = NULL;
11920 PL_screamnext = NULL;
11921 PL_maxscream = -1; /* reinits on demand */
11922 PL_lastscream = Nullsv;
11924 PL_watchaddr = NULL;
11925 PL_watchok = Nullch;
11927 PL_regdummy = proto_perl->Tregdummy;
11928 PL_regprecomp = Nullch;
11931 PL_colorset = 0; /* reinits PL_colors[] */
11932 /*PL_colors[6] = {0,0,0,0,0,0};*/
11933 PL_reginput = Nullch;
11934 PL_regbol = Nullch;
11935 PL_regeol = Nullch;
11936 PL_regstartp = (I32*)NULL;
11937 PL_regendp = (I32*)NULL;
11938 PL_reglastparen = (U32*)NULL;
11939 PL_reglastcloseparen = (U32*)NULL;
11940 PL_regtill = Nullch;
11941 PL_reg_start_tmp = (char**)NULL;
11942 PL_reg_start_tmpl = 0;
11943 PL_regdata = (struct reg_data*)NULL;
11946 PL_reg_eval_set = 0;
11948 PL_regprogram = (regnode*)NULL;
11950 PL_regcc = (CURCUR*)NULL;
11951 PL_reg_call_cc = (struct re_cc_state*)NULL;
11952 PL_reg_re = (regexp*)NULL;
11953 PL_reg_ganch = Nullch;
11954 PL_reg_sv = Nullsv;
11955 PL_reg_match_utf8 = FALSE;
11956 PL_reg_magic = (MAGIC*)NULL;
11958 PL_reg_oldcurpm = (PMOP*)NULL;
11959 PL_reg_curpm = (PMOP*)NULL;
11960 PL_reg_oldsaved = Nullch;
11961 PL_reg_oldsavedlen = 0;
11962 #ifdef PERL_OLD_COPY_ON_WRITE
11965 PL_reg_maxiter = 0;
11966 PL_reg_leftiter = 0;
11967 PL_reg_poscache = Nullch;
11968 PL_reg_poscache_size= 0;
11970 /* RE engine - function pointers */
11971 PL_regcompp = proto_perl->Tregcompp;
11972 PL_regexecp = proto_perl->Tregexecp;
11973 PL_regint_start = proto_perl->Tregint_start;
11974 PL_regint_string = proto_perl->Tregint_string;
11975 PL_regfree = proto_perl->Tregfree;
11977 PL_reginterp_cnt = 0;
11978 PL_reg_starttry = 0;
11980 /* Pluggable optimizer */
11981 PL_peepp = proto_perl->Tpeepp;
11983 PL_stashcache = newHV();
11985 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11986 ptr_table_free(PL_ptr_table);
11987 PL_ptr_table = NULL;
11990 /* Call the ->CLONE method, if it exists, for each of the stashes
11991 identified by sv_dup() above.
11993 while(av_len(param->stashes) != -1) {
11994 HV* stash = (HV*) av_shift(param->stashes);
11995 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11996 if (cloner && GvCV(cloner)) {
12001 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
12003 call_sv((SV*)GvCV(cloner), G_DISCARD);
12009 SvREFCNT_dec(param->stashes);
12011 /* orphaned? eg threads->new inside BEGIN or use */
12012 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
12013 (void)SvREFCNT_inc(PL_compcv);
12014 SAVEFREESV(PL_compcv);
12020 #endif /* USE_ITHREADS */
12023 =head1 Unicode Support
12025 =for apidoc sv_recode_to_utf8
12027 The encoding is assumed to be an Encode object, on entry the PV
12028 of the sv is assumed to be octets in that encoding, and the sv
12029 will be converted into Unicode (and UTF-8).
12031 If the sv already is UTF-8 (or if it is not POK), or if the encoding
12032 is not a reference, nothing is done to the sv. If the encoding is not
12033 an C<Encode::XS> Encoding object, bad things will happen.
12034 (See F<lib/encoding.pm> and L<Encode>).
12036 The PV of the sv is returned.
12041 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
12044 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12058 Passing sv_yes is wrong - it needs to be or'ed set of constants
12059 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12060 remove converted chars from source.
12062 Both will default the value - let them.
12064 XPUSHs(&PL_sv_yes);
12067 call_method("decode", G_SCALAR);
12071 s = SvPV_const(uni, len);
12072 if (s != SvPVX_const(sv)) {
12073 SvGROW(sv, len + 1);
12074 Move(s, SvPVX(sv), len + 1, char);
12075 SvCUR_set(sv, len);
12082 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12086 =for apidoc sv_cat_decode
12088 The encoding is assumed to be an Encode object, the PV of the ssv is
12089 assumed to be octets in that encoding and decoding the input starts
12090 from the position which (PV + *offset) pointed to. The dsv will be
12091 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12092 when the string tstr appears in decoding output or the input ends on
12093 the PV of the ssv. The value which the offset points will be modified
12094 to the last input position on the ssv.
12096 Returns TRUE if the terminator was found, else returns FALSE.
12101 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12102 SV *ssv, int *offset, char *tstr, int tlen)
12106 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12117 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12118 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12120 call_method("cat_decode", G_SCALAR);
12122 ret = SvTRUE(TOPs);
12123 *offset = SvIV(offsv);
12129 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12135 * c-indentation-style: bsd
12136 * c-basic-offset: 4
12137 * indent-tabs-mode: t
12140 * ex: set ts=8 sts=4 sw=4 noet: