3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 2005, by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
9 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
12 * This file contains the code that creates, manipulates and destroys
13 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
14 * structure of an SV, so their creation and destruction is handled
15 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
16 * level functions (eg. substr, split, join) for each of the types are
28 /* Missing proto on LynxOS */
29 char *gconvert(double, int, int, char *);
32 #ifdef PERL_UTF8_CACHE_ASSERT
33 /* The cache element 0 is the Unicode offset;
34 * the cache element 1 is the byte offset of the element 0;
35 * the cache element 2 is the Unicode length of the substring;
36 * the cache element 3 is the byte length of the substring;
37 * The checking of the substring side would be good
38 * but substr() has enough code paths to make my head spin;
39 * if adding more checks watch out for the following tests:
40 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
41 * lib/utf8.t lib/Unicode/Collate/t/index.t
44 #define ASSERT_UTF8_CACHE(cache) \
45 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
47 #define ASSERT_UTF8_CACHE(cache) NOOP
50 #ifdef PERL_OLD_COPY_ON_WRITE
51 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
52 #define SV_COW_NEXT_SV_SET(current,next) SvUV_set(current, PTR2UV(next))
53 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
57 /* ============================================================================
59 =head1 Allocation and deallocation of SVs.
61 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
62 av, hv...) contains type and reference count information, as well as a
63 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
64 specific to each type.
66 Normally, this allocation is done using arenas, which by default are
67 approximately 4K chunks of memory parcelled up into N heads or bodies. The
68 first slot in each arena is reserved, and is used to hold a link to the next
69 arena. In the case of heads, the unused first slot also contains some flags
70 and a note of the number of slots. Snaked through each arena chain is a
71 linked list of free items; when this becomes empty, an extra arena is
72 allocated and divided up into N items which are threaded into the free list.
74 The following global variables are associated with arenas:
76 PL_sv_arenaroot pointer to list of SV arenas
77 PL_sv_root pointer to list of free SV structures
79 PL_foo_arenaroot pointer to list of foo arenas,
80 PL_foo_root pointer to list of free foo bodies
81 ... for foo in xiv, xnv, xrv, xpv etc.
83 Note that some of the larger and more rarely used body types (eg xpvio)
84 are not allocated using arenas, but are instead just malloc()/free()ed as
85 required. Also, if PURIFY is defined, arenas are abandoned altogether,
86 with all items individually malloc()ed. In addition, a few SV heads are
87 not allocated from an arena, but are instead directly created as static
88 or auto variables, eg PL_sv_undef. The size of arenas can be changed from
89 the default by setting PERL_ARENA_SIZE appropriately at compile time.
91 The SV arena serves the secondary purpose of allowing still-live SVs
92 to be located and destroyed during final cleanup.
94 At the lowest level, the macros new_SV() and del_SV() grab and free
95 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
96 to return the SV to the free list with error checking.) new_SV() calls
97 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
98 SVs in the free list have their SvTYPE field set to all ones.
100 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
101 that allocate and return individual body types. Normally these are mapped
102 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
103 instead mapped directly to malloc()/free() if PURIFY is defined. The
104 new/del functions remove from, or add to, the appropriate PL_foo_root
105 list, and call more_xiv() etc to add a new arena if the list is empty.
107 At the time of very final cleanup, sv_free_arenas() is called from
108 perl_destruct() to physically free all the arenas allocated since the
109 start of the interpreter. Note that this also clears PL_he_arenaroot,
110 which is otherwise dealt with in hv.c.
112 Manipulation of any of the PL_*root pointers is protected by enclosing
113 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
114 if threads are enabled.
116 The function visit() scans the SV arenas list, and calls a specified
117 function for each SV it finds which is still live - ie which has an SvTYPE
118 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
119 following functions (specified as [function that calls visit()] / [function
120 called by visit() for each SV]):
122 sv_report_used() / do_report_used()
123 dump all remaining SVs (debugging aid)
125 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
126 Attempt to free all objects pointed to by RVs,
127 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
128 try to do the same for all objects indirectly
129 referenced by typeglobs too. Called once from
130 perl_destruct(), prior to calling sv_clean_all()
133 sv_clean_all() / do_clean_all()
134 SvREFCNT_dec(sv) each remaining SV, possibly
135 triggering an sv_free(). It also sets the
136 SVf_BREAK flag on the SV to indicate that the
137 refcnt has been artificially lowered, and thus
138 stopping sv_free() from giving spurious warnings
139 about SVs which unexpectedly have a refcnt
140 of zero. called repeatedly from perl_destruct()
141 until there are no SVs left.
145 Private API to rest of sv.c
149 new_XIV(), del_XIV(),
150 new_XNV(), del_XNV(),
155 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
160 ============================================================================ */
165 * "A time to plant, and a time to uproot what was planted..."
169 #ifdef DEBUG_LEAKING_SCALARS
171 # define FREE_SV_DEBUG_FILE(sv) PerlMemfree((sv)->sv_debug_file)
173 # define FREE_SV_DEBUG_FILE(sv) PerlMemShared_free((sv)->sv_debug_file)
176 # define FREE_SV_DEBUG_FILE(sv)
179 #define plant_SV(p) \
181 FREE_SV_DEBUG_FILE(p); \
182 SvANY(p) = (void *)PL_sv_root; \
183 SvFLAGS(p) = SVTYPEMASK; \
188 /* sv_mutex must be held while calling uproot_SV() */
189 #define uproot_SV(p) \
192 PL_sv_root = (SV*)SvANY(p); \
197 /* make some more SVs by adding another arena */
199 /* sv_mutex must be held while calling more_sv() */
206 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
207 PL_nice_chunk = Nullch;
208 PL_nice_chunk_size = 0;
211 char *chunk; /* must use New here to match call to */
212 New(704,chunk,PERL_ARENA_SIZE,char); /* Safefree() in sv_free_arenas() */
213 sv_add_arena(chunk, PERL_ARENA_SIZE, 0);
219 /* new_SV(): return a new, empty SV head */
221 #ifdef DEBUG_LEAKING_SCALARS
222 /* provide a real function for a debugger to play with */
232 sv = S_more_sv(aTHX);
237 sv->sv_debug_optype = PL_op ? PL_op->op_type : 0;
238 sv->sv_debug_line = (U16) ((PL_copline == NOLINE) ?
239 (PL_curcop ? CopLINE(PL_curcop) : 0) : PL_copline);
240 sv->sv_debug_inpad = 0;
241 sv->sv_debug_cloned = 0;
243 sv->sv_debug_file = PL_curcop ? savepv(CopFILE(PL_curcop)): NULL;
245 sv->sv_debug_file = PL_curcop ? savesharedpv(CopFILE(PL_curcop)): NULL;
250 # define new_SV(p) (p)=S_new_SV(aTHX)
259 (p) = S_more_sv(aTHX); \
268 /* del_SV(): return an empty SV head to the free list */
283 S_del_sv(pTHX_ SV *p)
288 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
289 const SV * const sv = sva + 1;
290 const SV * const svend = &sva[SvREFCNT(sva)];
291 if (p >= sv && p < svend) {
297 if (ckWARN_d(WARN_INTERNAL))
298 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
299 "Attempt to free non-arena SV: 0x%"UVxf
300 pTHX__FORMAT, PTR2UV(p) pTHX__VALUE);
307 #else /* ! DEBUGGING */
309 #define del_SV(p) plant_SV(p)
311 #endif /* DEBUGGING */
315 =head1 SV Manipulation Functions
317 =for apidoc sv_add_arena
319 Given a chunk of memory, link it to the head of the list of arenas,
320 and split it into a list of free SVs.
326 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
332 /* The first SV in an arena isn't an SV. */
333 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
334 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
335 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
337 PL_sv_arenaroot = sva;
338 PL_sv_root = sva + 1;
340 svend = &sva[SvREFCNT(sva) - 1];
343 SvANY(sv) = (void *)(SV*)(sv + 1);
347 /* Must always set typemask because it's awlays checked in on cleanup
348 when the arenas are walked looking for objects. */
349 SvFLAGS(sv) = SVTYPEMASK;
356 SvFLAGS(sv) = SVTYPEMASK;
359 /* visit(): call the named function for each non-free SV in the arenas
360 * whose flags field matches the flags/mask args. */
363 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
368 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
369 register const SV * const svend = &sva[SvREFCNT(sva)];
371 for (sv = sva + 1; sv < svend; ++sv) {
372 if (SvTYPE(sv) != SVTYPEMASK
373 && (sv->sv_flags & mask) == flags
386 /* called by sv_report_used() for each live SV */
389 do_report_used(pTHX_ SV *sv)
391 if (SvTYPE(sv) != SVTYPEMASK) {
392 PerlIO_printf(Perl_debug_log, "****\n");
399 =for apidoc sv_report_used
401 Dump the contents of all SVs not yet freed. (Debugging aid).
407 Perl_sv_report_used(pTHX)
410 visit(do_report_used, 0, 0);
414 /* called by sv_clean_objs() for each live SV */
417 do_clean_objs(pTHX_ SV *ref)
421 if (SvROK(ref) && SvOBJECT(target = SvRV(ref))) {
422 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(ref)));
423 if (SvWEAKREF(ref)) {
424 sv_del_backref(target, ref);
430 SvREFCNT_dec(target);
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)) {
445 #ifdef PERL_DONT_CREATE_GVSV
448 SvOBJECT(GvSV(sv))) ||
449 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
450 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
451 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
452 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
454 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
455 SvFLAGS(sv) |= SVf_BREAK;
463 =for apidoc sv_clean_objs
465 Attempt to destroy all objects not yet freed
471 Perl_sv_clean_objs(pTHX)
473 PL_in_clean_objs = TRUE;
474 visit(do_clean_objs, SVf_ROK, SVf_ROK);
475 #ifndef DISABLE_DESTRUCTOR_KLUDGE
476 /* some barnacles may yet remain, clinging to typeglobs */
477 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
479 PL_in_clean_objs = FALSE;
482 /* called by sv_clean_all() for each live SV */
485 do_clean_all(pTHX_ SV *sv)
487 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
488 SvFLAGS(sv) |= SVf_BREAK;
489 if (PL_comppad == (AV*)sv) {
491 PL_curpad = Null(SV**);
497 =for apidoc sv_clean_all
499 Decrement the refcnt of each remaining SV, possibly triggering a
500 cleanup. This function may have to be called multiple times to free
501 SVs which are in complex self-referential hierarchies.
507 Perl_sv_clean_all(pTHX)
510 PL_in_clean_all = TRUE;
511 cleaned = visit(do_clean_all, 0,0);
512 PL_in_clean_all = FALSE;
517 S_free_arena(pTHX_ void **root) {
519 void ** const next = *(void **)root;
526 =for apidoc sv_free_arenas
528 Deallocate the memory used by all arenas. Note that all the individual SV
529 heads and bodies within the arenas must already have been freed.
534 #define free_arena(name) \
536 S_free_arena(aTHX_ (void**) PL_ ## name ## _arenaroot); \
537 PL_ ## name ## _arenaroot = 0; \
538 PL_ ## name ## _root = 0; \
542 Perl_sv_free_arenas(pTHX)
547 /* Free arenas here, but be careful about fake ones. (We assume
548 contiguity of the fake ones with the corresponding real ones.) */
550 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
551 svanext = (SV*) SvANY(sva);
552 while (svanext && SvFAKE(svanext))
553 svanext = (SV*) SvANY(svanext);
571 #if defined(USE_ITHREADS)
576 Safefree(PL_nice_chunk);
577 PL_nice_chunk = Nullch;
578 PL_nice_chunk_size = 0;
583 /* ---------------------------------------------------------------------
585 * support functions for report_uninit()
588 /* the maxiumum size of array or hash where we will scan looking
589 * for the undefined element that triggered the warning */
591 #define FUV_MAX_SEARCH_SIZE 1000
593 /* Look for an entry in the hash whose value has the same SV as val;
594 * If so, return a mortal copy of the key. */
597 S_find_hash_subscript(pTHX_ HV *hv, SV* val)
603 if (!hv || SvMAGICAL(hv) || !HvARRAY(hv) ||
604 (HvTOTALKEYS(hv) > FUV_MAX_SEARCH_SIZE))
609 for (i=HvMAX(hv); i>0; i--) {
611 for (entry = array[i]; entry; entry = HeNEXT(entry)) {
612 if (HeVAL(entry) != val)
614 if ( HeVAL(entry) == &PL_sv_undef ||
615 HeVAL(entry) == &PL_sv_placeholder)
619 if (HeKLEN(entry) == HEf_SVKEY)
620 return sv_mortalcopy(HeKEY_sv(entry));
621 return sv_2mortal(newSVpvn(HeKEY(entry), HeKLEN(entry)));
627 /* Look for an entry in the array whose value has the same SV as val;
628 * If so, return the index, otherwise return -1. */
631 S_find_array_subscript(pTHX_ AV *av, SV* val)
635 if (!av || SvMAGICAL(av) || !AvARRAY(av) ||
636 (AvFILLp(av) > FUV_MAX_SEARCH_SIZE))
640 for (i=AvFILLp(av); i>=0; i--) {
641 if (svp[i] == val && svp[i] != &PL_sv_undef)
647 /* S_varname(): return the name of a variable, optionally with a subscript.
648 * If gv is non-zero, use the name of that global, along with gvtype (one
649 * of "$", "@", "%"); otherwise use the name of the lexical at pad offset
650 * targ. Depending on the value of the subscript_type flag, return:
653 #define FUV_SUBSCRIPT_NONE 1 /* "@foo" */
654 #define FUV_SUBSCRIPT_ARRAY 2 /* "$foo[aindex]" */
655 #define FUV_SUBSCRIPT_HASH 3 /* "$foo{keyname}" */
656 #define FUV_SUBSCRIPT_WITHIN 4 /* "within @foo" */
659 S_varname(pTHX_ GV *gv, const char *gvtype, PADOFFSET targ,
660 SV* keyname, I32 aindex, int subscript_type)
663 SV * const name = sv_newmortal();
666 /* simulate gv_fullname4(), but add literal '^' for $^FOO names
667 * XXX get rid of all this if gv_fullnameX() ever supports this
671 HV * const hv = GvSTASH(gv);
672 sv_setpv(name, gvtype);
675 else if (!(p=HvNAME_get(hv)))
677 if (strNE(p, "main")) {
679 sv_catpvn(name,"::", 2);
681 if (GvNAMELEN(gv)>= 1 &&
682 ((unsigned int)*GvNAME(gv)) <= 26)
684 Perl_sv_catpvf(aTHX_ name,"^%c", *GvNAME(gv) + 'A' - 1);
685 sv_catpvn(name,GvNAME(gv)+1,GvNAMELEN(gv)-1);
688 sv_catpvn(name,GvNAME(gv),GvNAMELEN(gv));
692 CV * const cv = find_runcv(&unused);
696 if (!cv || !CvPADLIST(cv))
698 av = (AV*)(*av_fetch(CvPADLIST(cv), 0, FALSE));
699 sv = *av_fetch(av, targ, FALSE);
700 /* SvLEN in a pad name is not to be trusted */
701 sv_setpv(name, SvPV_nolen_const(sv));
704 if (subscript_type == FUV_SUBSCRIPT_HASH) {
705 SV * const sv = NEWSV(0,0);
707 Perl_sv_catpvf(aTHX_ name, "{%s}",
708 pv_display(sv,SvPVX_const(keyname), SvCUR(keyname), 0, 32));
711 else if (subscript_type == FUV_SUBSCRIPT_ARRAY) {
713 Perl_sv_catpvf(aTHX_ name, "[%"IVdf"]", (IV)aindex);
715 else if (subscript_type == FUV_SUBSCRIPT_WITHIN)
716 sv_insert(name, 0, 0, "within ", 7);
723 =for apidoc find_uninit_var
725 Find the name of the undefined variable (if any) that caused the operator o
726 to issue a "Use of uninitialized value" warning.
727 If match is true, only return a name if it's value matches uninit_sv.
728 So roughly speaking, if a unary operator (such as OP_COS) generates a
729 warning, then following the direct child of the op may yield an
730 OP_PADSV or OP_GV that gives the name of the undefined variable. On the
731 other hand, with OP_ADD there are two branches to follow, so we only print
732 the variable name if we get an exact match.
734 The name is returned as a mortal SV.
736 Assumes that PL_op is the op that originally triggered the error, and that
737 PL_comppad/PL_curpad points to the currently executing pad.
743 S_find_uninit_var(pTHX_ OP* obase, SV* uninit_sv, bool match)
751 if (!obase || (match && (!uninit_sv || uninit_sv == &PL_sv_undef ||
752 uninit_sv == &PL_sv_placeholder)))
755 switch (obase->op_type) {
762 const bool pad = (obase->op_type == OP_PADAV || obase->op_type == OP_PADHV);
763 const bool hash = (obase->op_type == OP_PADHV || obase->op_type == OP_RV2HV);
766 int subscript_type = FUV_SUBSCRIPT_WITHIN;
768 if (pad) { /* @lex, %lex */
769 sv = PAD_SVl(obase->op_targ);
773 if (cUNOPx(obase)->op_first->op_type == OP_GV) {
774 /* @global, %global */
775 gv = cGVOPx_gv(cUNOPx(obase)->op_first);
778 sv = hash ? (SV*)GvHV(gv): (SV*)GvAV(gv);
780 else /* @{expr}, %{expr} */
781 return find_uninit_var(cUNOPx(obase)->op_first,
785 /* attempt to find a match within the aggregate */
787 keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
789 subscript_type = FUV_SUBSCRIPT_HASH;
792 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
794 subscript_type = FUV_SUBSCRIPT_ARRAY;
797 if (match && subscript_type == FUV_SUBSCRIPT_WITHIN)
800 return varname(gv, hash ? "%" : "@", obase->op_targ,
801 keysv, index, subscript_type);
805 if (match && PAD_SVl(obase->op_targ) != uninit_sv)
807 return varname(Nullgv, "$", obase->op_targ,
808 Nullsv, 0, FUV_SUBSCRIPT_NONE);
811 gv = cGVOPx_gv(obase);
812 if (!gv || (match && GvSV(gv) != uninit_sv))
814 return varname(gv, "$", 0, Nullsv, 0, FUV_SUBSCRIPT_NONE);
817 if (obase->op_flags & OPf_SPECIAL) { /* lexical array */
820 av = (AV*)PAD_SV(obase->op_targ);
821 if (!av || SvRMAGICAL(av))
823 svp = av_fetch(av, (I32)obase->op_private, FALSE);
824 if (!svp || *svp != uninit_sv)
827 return varname(Nullgv, "$", obase->op_targ,
828 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
831 gv = cGVOPx_gv(obase);
837 if (!av || SvRMAGICAL(av))
839 svp = av_fetch(av, (I32)obase->op_private, FALSE);
840 if (!svp || *svp != uninit_sv)
843 return varname(gv, "$", 0,
844 Nullsv, (I32)obase->op_private, FUV_SUBSCRIPT_ARRAY);
849 o = cUNOPx(obase)->op_first;
850 if (!o || o->op_type != OP_NULL ||
851 ! (o->op_targ == OP_AELEM || o->op_targ == OP_HELEM))
853 return find_uninit_var(cBINOPo->op_last, uninit_sv, match);
858 /* $a[uninit_expr] or $h{uninit_expr} */
859 return find_uninit_var(cBINOPx(obase)->op_last, uninit_sv, match);
862 o = cBINOPx(obase)->op_first;
863 kid = cBINOPx(obase)->op_last;
865 /* get the av or hv, and optionally the gv */
867 if (o->op_type == OP_PADAV || o->op_type == OP_PADHV) {
868 sv = PAD_SV(o->op_targ);
870 else if ((o->op_type == OP_RV2AV || o->op_type == OP_RV2HV)
871 && cUNOPo->op_first->op_type == OP_GV)
873 gv = cGVOPx_gv(cUNOPo->op_first);
876 sv = o->op_type == OP_RV2HV ? (SV*)GvHV(gv) : (SV*)GvAV(gv);
881 if (kid && kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid))) {
882 /* index is constant */
886 if (obase->op_type == OP_HELEM) {
887 HE* he = hv_fetch_ent((HV*)sv, cSVOPx_sv(kid), 0, 0);
888 if (!he || HeVAL(he) != uninit_sv)
892 SV ** const svp = av_fetch((AV*)sv, SvIV(cSVOPx_sv(kid)), FALSE);
893 if (!svp || *svp != uninit_sv)
897 if (obase->op_type == OP_HELEM)
898 return varname(gv, "%", o->op_targ,
899 cSVOPx_sv(kid), 0, FUV_SUBSCRIPT_HASH);
901 return varname(gv, "@", o->op_targ, Nullsv,
902 SvIV(cSVOPx_sv(kid)), FUV_SUBSCRIPT_ARRAY);
906 /* index is an expression;
907 * attempt to find a match within the aggregate */
908 if (obase->op_type == OP_HELEM) {
909 SV * const keysv = S_find_hash_subscript(aTHX_ (HV*)sv, uninit_sv);
911 return varname(gv, "%", o->op_targ,
912 keysv, 0, FUV_SUBSCRIPT_HASH);
915 const I32 index = S_find_array_subscript(aTHX_ (AV*)sv, uninit_sv);
917 return varname(gv, "@", o->op_targ,
918 Nullsv, index, FUV_SUBSCRIPT_ARRAY);
923 (o->op_type == OP_PADAV || o->op_type == OP_RV2AV)
925 o->op_targ, Nullsv, 0, FUV_SUBSCRIPT_WITHIN);
931 /* only examine RHS */
932 return find_uninit_var(cBINOPx(obase)->op_first, uninit_sv, match);
935 o = cUNOPx(obase)->op_first;
936 if (o->op_type == OP_PUSHMARK)
939 if (!o->op_sibling) {
940 /* one-arg version of open is highly magical */
942 if (o->op_type == OP_GV) { /* open FOO; */
944 if (match && GvSV(gv) != uninit_sv)
946 return varname(gv, "$", 0,
947 Nullsv, 0, FUV_SUBSCRIPT_NONE);
949 /* other possibilities not handled are:
950 * open $x; or open my $x; should return '${*$x}'
951 * open expr; should return '$'.expr ideally
957 /* ops where $_ may be an implicit arg */
961 if ( !(obase->op_flags & OPf_STACKED)) {
962 if (uninit_sv == ((obase->op_private & OPpTARGET_MY)
963 ? PAD_SVl(obase->op_targ)
967 sv_setpvn(sv, "$_", 2);
975 /* skip filehandle as it can't produce 'undef' warning */
976 o = cUNOPx(obase)->op_first;
977 if ((obase->op_flags & OPf_STACKED) && o->op_type == OP_PUSHMARK)
978 o = o->op_sibling->op_sibling;
985 match = 1; /* XS or custom code could trigger random warnings */
990 if (SvROK(PL_rs) && uninit_sv == SvRV(PL_rs))
991 return sv_2mortal(newSVpv("${$/}", 0));
996 if (!(obase->op_flags & OPf_KIDS))
998 o = cUNOPx(obase)->op_first;
1004 /* if all except one arg are constant, or have no side-effects,
1005 * or are optimized away, then it's unambiguous */
1007 for (kid=o; kid; kid = kid->op_sibling) {
1009 ( (kid->op_type == OP_CONST && SvOK(cSVOPx_sv(kid)))
1010 || (kid->op_type == OP_NULL && ! (kid->op_flags & OPf_KIDS))
1011 || (kid->op_type == OP_PUSHMARK)
1015 if (o2) { /* more than one found */
1022 return find_uninit_var(o2, uninit_sv, match);
1026 sv = find_uninit_var(o, uninit_sv, 1);
1038 =for apidoc report_uninit
1040 Print appropriate "Use of uninitialized variable" warning
1046 Perl_report_uninit(pTHX_ SV* uninit_sv)
1049 SV* varname = Nullsv;
1051 varname = find_uninit_var(PL_op, uninit_sv,0);
1053 sv_insert(varname, 0, 0, " ", 1);
1055 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1056 varname ? SvPV_nolen_const(varname) : "",
1057 " in ", OP_DESC(PL_op));
1060 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
1065 S_more_bodies (pTHX_ void **arena_root, void **root, size_t size)
1069 const size_t count = PERL_ARENA_SIZE/size;
1070 New(0, start, count*size, char);
1071 *((void **) start) = *arena_root;
1072 *arena_root = (void *)start;
1074 end = start + (count-1) * size;
1076 /* The initial slot is used to link the arenas together, so it isn't to be
1077 linked into the list of ready-to-use bodies. */
1081 *root = (void *)start;
1083 while (start < end) {
1084 char * const next = start + size;
1085 *(void**) start = (void *)next;
1088 *(void **)start = 0;
1093 /* grab a new thing from the free list, allocating more if necessary */
1096 S_new_body(pTHX_ void **arena_root, void **root, size_t size)
1100 xpv = *root ? *root : S_more_bodies(aTHX_ arena_root, root, size);
1101 *root = *(void**)xpv;
1106 /* return a thing to the free list */
1108 #define del_body(thing, root) \
1111 *(void **)thing = *root; \
1112 *root = (void*)thing; \
1116 /* Conventionally we simply malloc() a big block of memory, then divide it
1117 up into lots of the thing that we're allocating.
1119 This macro will expand to call to S_new_body. So for XPVBM (with ithreads),
1122 S_new_body(my_perl, (void**)&(my_perl->Ixpvbm_arenaroot),
1123 (void**)&(my_perl->Ixpvbm_root), sizeof(XPVBM), 0)
1126 #define new_body(TYPE,lctype) \
1127 S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1128 (void**)&PL_ ## lctype ## _root, \
1131 #define del_body_type(p,TYPE,lctype) \
1132 del_body((void*)p, (void**)&PL_ ## lctype ## _root)
1134 /* But for some types, we cheat. The type starts with some members that are
1135 never accessed. So we allocate the substructure, starting at the first used
1136 member, then adjust the pointer back in memory by the size of the bit not
1137 allocated, so it's as if we allocated the full structure.
1138 (But things will all go boom if you write to the part that is "not there",
1139 because you'll be overwriting the last members of the preceding structure
1142 We calculate the correction using the STRUCT_OFFSET macro. For example, if
1143 xpv_allocated is the same structure as XPV then the two OFFSETs sum to zero,
1144 and the pointer is unchanged. If the allocated structure is smaller (no
1145 initial NV actually allocated) then the net effect is to subtract the size
1146 of the NV from the pointer, to return a new pointer as if an initial NV were
1149 This is the same trick as was used for NV and IV bodies. Ironically it
1150 doesn't need to be used for NV bodies any more, because NV is now at the
1151 start of the structure. IV bodies don't need it either, because they are
1152 no longer allocated. */
1154 #define new_body_allocated(TYPE,lctype,member) \
1155 (void*)((char*)S_new_body(aTHX_ (void**)&PL_ ## lctype ## _arenaroot, \
1156 (void**)&PL_ ## lctype ## _root, \
1157 sizeof(lctype ## _allocated)) - \
1158 STRUCT_OFFSET(TYPE, member) \
1159 + STRUCT_OFFSET(lctype ## _allocated, member))
1162 #define del_body_allocated(p,TYPE,lctype,member) \
1163 del_body((void*)((char*)p + STRUCT_OFFSET(TYPE, member) \
1164 - STRUCT_OFFSET(lctype ## _allocated, member)), \
1165 (void**)&PL_ ## lctype ## _root)
1167 #define my_safemalloc(s) (void*)safemalloc(s)
1168 #define my_safefree(p) safefree((char*)p)
1172 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1173 #define del_XNV(p) my_safefree(p)
1175 #define new_XPV() my_safemalloc(sizeof(XPV))
1176 #define del_XPV(p) my_safefree(p)
1178 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1179 #define del_XPVIV(p) my_safefree(p)
1181 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1182 #define del_XPVNV(p) my_safefree(p)
1184 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1185 #define del_XPVCV(p) my_safefree(p)
1187 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1188 #define del_XPVAV(p) my_safefree(p)
1190 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1191 #define del_XPVHV(p) my_safefree(p)
1193 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1194 #define del_XPVMG(p) my_safefree(p)
1196 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1197 #define del_XPVGV(p) my_safefree(p)
1199 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1200 #define del_XPVLV(p) my_safefree(p)
1202 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1203 #define del_XPVBM(p) my_safefree(p)
1207 #define new_XNV() new_body(NV, xnv)
1208 #define del_XNV(p) del_body_type(p, NV, xnv)
1210 #define new_XPV() new_body_allocated(XPV, xpv, xpv_cur)
1211 #define del_XPV(p) del_body_allocated(p, XPV, xpv, xpv_cur)
1213 #define new_XPVIV() new_body_allocated(XPVIV, xpviv, xpv_cur)
1214 #define del_XPVIV(p) del_body_allocated(p, XPVIV, xpviv, xpv_cur)
1216 #define new_XPVNV() new_body(XPVNV, xpvnv)
1217 #define del_XPVNV(p) del_body_type(p, XPVNV, xpvnv)
1219 #define new_XPVCV() new_body(XPVCV, xpvcv)
1220 #define del_XPVCV(p) del_body_type(p, XPVCV, xpvcv)
1222 #define new_XPVAV() new_body_allocated(XPVAV, xpvav, xav_fill)
1223 #define del_XPVAV(p) del_body_allocated(p, XPVAV, xpvav, xav_fill)
1225 #define new_XPVHV() new_body_allocated(XPVHV, xpvhv, xhv_fill)
1226 #define del_XPVHV(p) del_body_allocated(p, XPVHV, xpvhv, xhv_fill)
1228 #define new_XPVMG() new_body(XPVMG, xpvmg)
1229 #define del_XPVMG(p) del_body_type(p, XPVMG, xpvmg)
1231 #define new_XPVGV() new_body(XPVGV, xpvgv)
1232 #define del_XPVGV(p) del_body_type(p, XPVGV, xpvgv)
1234 #define new_XPVLV() new_body(XPVLV, xpvlv)
1235 #define del_XPVLV(p) del_body_type(p, XPVLV, xpvlv)
1237 #define new_XPVBM() new_body(XPVBM, xpvbm)
1238 #define del_XPVBM(p) del_body_type(p, XPVBM, xpvbm)
1242 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1243 #define del_XPVFM(p) my_safefree(p)
1245 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1246 #define del_XPVIO(p) my_safefree(p)
1249 =for apidoc sv_upgrade
1251 Upgrade an SV to a more complex form. Generally adds a new body type to the
1252 SV, then copies across as much information as possible from the old body.
1253 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1259 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1261 void** old_body_arena;
1262 size_t old_body_offset;
1263 size_t old_body_length; /* Well, the length to copy. */
1265 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1266 /* If NV 0.0 is store as all bits 0 then Zero() already creates a correct
1268 bool zero_nv = TRUE;
1271 size_t new_body_length;
1272 size_t new_body_offset;
1273 void** new_body_arena;
1274 void** new_body_arenaroot;
1275 const U32 old_type = SvTYPE(sv);
1277 if (mt != SVt_PV && SvIsCOW(sv)) {
1278 sv_force_normal_flags(sv, 0);
1281 if (SvTYPE(sv) == mt)
1284 if (SvTYPE(sv) > mt)
1285 Perl_croak(aTHX_ "sv_upgrade from type %d down to type %d",
1286 (int)SvTYPE(sv), (int)mt);
1289 old_body = SvANY(sv);
1291 old_body_offset = 0;
1292 old_body_length = 0;
1293 new_body_offset = 0;
1294 new_body_length = ~0;
1296 /* Copying structures onto other structures that have been neatly zeroed
1297 has a subtle gotcha. Consider XPVMG
1299 +------+------+------+------+------+-------+-------+
1300 | NV | CUR | LEN | IV | MAGIC | STASH |
1301 +------+------+------+------+------+-------+-------+
1302 0 4 8 12 16 20 24 28
1304 where NVs are aligned to 8 bytes, so that sizeof that structure is
1305 actually 32 bytes long, with 4 bytes of padding at the end:
1307 +------+------+------+------+------+-------+-------+------+
1308 | NV | CUR | LEN | IV | MAGIC | STASH | ??? |
1309 +------+------+------+------+------+-------+-------+------+
1310 0 4 8 12 16 20 24 28 32
1312 so what happens if you allocate memory for this structure:
1314 +------+------+------+------+------+-------+-------+------+------+...
1315 | NV | CUR | LEN | IV | MAGIC | STASH | GP | NAME |
1316 +------+------+------+------+------+-------+-------+------+------+...
1317 0 4 8 12 16 20 24 28 32 36
1319 zero it, then copy sizeof(XPVMG) bytes on top of it? Not quite what you
1320 expect, because you copy the area marked ??? onto GP. Now, ??? may have
1321 started out as zero once, but it's quite possible that it isn't. So now,
1322 rather than a nicely zeroed GP, you have it pointing somewhere random.
1325 (In fact, GP ends up pointing at a previous GP structure, because the
1326 principle cause of the padding in XPVMG getting garbage is a copy of
1327 sizeof(XPVMG) bytes from a XPVGV structure in sv_unglob)
1329 So we are careful and work out the size of used parts of all the
1332 switch (SvTYPE(sv)) {
1338 else if (mt < SVt_PVIV)
1340 old_body_offset = STRUCT_OFFSET(XPVIV, xiv_iv);
1341 old_body_length = sizeof(IV);
1344 old_body_arena = (void **) &PL_xnv_root;
1345 old_body_length = sizeof(NV);
1346 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1355 old_body_arena = (void **) &PL_xpv_root;
1356 old_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1357 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1358 old_body_length = STRUCT_OFFSET(XPV, xpv_len)
1359 + sizeof (((XPV*)SvANY(sv))->xpv_len)
1363 else if (mt == SVt_NV)
1367 old_body_arena = (void **) &PL_xpviv_root;
1368 old_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1369 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1370 old_body_length = STRUCT_OFFSET(XPVIV, xiv_u)
1371 + sizeof (((XPVIV*)SvANY(sv))->xiv_u)
1375 old_body_arena = (void **) &PL_xpvnv_root;
1376 old_body_length = STRUCT_OFFSET(XPVNV, xiv_u)
1377 + sizeof (((XPVNV*)SvANY(sv))->xiv_u);
1378 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1383 /* Because the XPVMG of PL_mess_sv isn't allocated from the arena,
1384 there's no way that it can be safely upgraded, because perl.c
1385 expects to Safefree(SvANY(PL_mess_sv)) */
1386 assert(sv != PL_mess_sv);
1387 /* This flag bit is used to mean other things in other scalar types.
1388 Given that it only has meaning inside the pad, it shouldn't be set
1389 on anything that can get upgraded. */
1390 assert((SvFLAGS(sv) & SVpad_TYPED) == 0);
1391 old_body_arena = (void **) &PL_xpvmg_root;
1392 old_body_length = STRUCT_OFFSET(XPVMG, xmg_stash)
1393 + sizeof (((XPVMG*)SvANY(sv))->xmg_stash);
1394 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1399 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1402 SvFLAGS(sv) &= ~SVTYPEMASK;
1407 Perl_croak(aTHX_ "Can't upgrade to undef");
1409 assert(old_type == SVt_NULL);
1410 SvANY(sv) = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
1414 assert(old_type == SVt_NULL);
1415 SvANY(sv) = new_XNV();
1419 assert(old_type == SVt_NULL);
1420 SvANY(sv) = &sv->sv_u.svu_rv;
1424 SvANY(sv) = new_XPVHV();
1427 HvTOTALKEYS(sv) = 0;
1432 SvANY(sv) = new_XPVAV();
1439 /* SVt_NULL isn't the only thing upgraded to AV or HV.
1440 The target created by newSVrv also is, and it can have magic.
1441 However, it never has SvPVX set.
1443 if (old_type >= SVt_RV) {
1444 assert(SvPVX_const(sv) == 0);
1447 /* Could put this in the else clause below, as PVMG must have SvPVX
1448 0 already (the assertion above) */
1449 SvPV_set(sv, (char*)0);
1451 if (old_type >= SVt_PVMG) {
1452 SvMAGIC_set(sv, ((XPVMG*)old_body)->xmg_magic);
1453 SvSTASH_set(sv, ((XPVMG*)old_body)->xmg_stash);
1461 new_body = new_XPVIO();
1462 new_body_length = sizeof(XPVIO);
1465 new_body = new_XPVFM();
1466 new_body_length = sizeof(XPVFM);
1470 new_body_length = sizeof(XPVBM);
1471 new_body_arena = (void **) &PL_xpvbm_root;
1472 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
1475 new_body_length = sizeof(XPVGV);
1476 new_body_arena = (void **) &PL_xpvgv_root;
1477 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
1480 new_body_length = sizeof(XPVCV);
1481 new_body_arena = (void **) &PL_xpvcv_root;
1482 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
1485 new_body_length = sizeof(XPVLV);
1486 new_body_arena = (void **) &PL_xpvlv_root;
1487 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
1490 new_body_length = sizeof(XPVMG);
1491 new_body_arena = (void **) &PL_xpvmg_root;
1492 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
1495 new_body_length = sizeof(XPVNV);
1496 new_body_arena = (void **) &PL_xpvnv_root;
1497 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
1500 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
1501 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
1502 new_body_length = sizeof(XPVIV) - new_body_offset;
1503 new_body_arena = (void **) &PL_xpviv_root;
1504 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
1505 /* XXX Is this still needed? Was it ever needed? Surely as there is
1506 no route from NV to PVIV, NOK can never be true */
1510 goto new_body_no_NV;
1512 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
1513 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
1514 new_body_length = sizeof(XPV) - new_body_offset;
1515 new_body_arena = (void **) &PL_xpv_root;
1516 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
1518 /* PV and PVIV don't have an NV slot. */
1519 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1524 assert(new_body_length);
1526 /* This points to the start of the allocated area. */
1527 new_body = S_new_body(aTHX_ new_body_arenaroot, new_body_arena,
1530 /* We always allocated the full length item with PURIFY */
1531 new_body_length += new_body_offset;
1532 new_body_offset = 0;
1533 new_body = my_safemalloc(new_body_length);
1537 Zero(new_body, new_body_length, char);
1538 new_body = ((char *)new_body) - new_body_offset;
1539 SvANY(sv) = new_body;
1541 if (old_body_length) {
1542 Copy((char *)old_body + old_body_offset,
1543 (char *)new_body + old_body_offset,
1544 old_body_length, char);
1547 #ifndef NV_ZERO_IS_ALLBITS_ZERO
1553 IoPAGE_LEN(sv) = 60;
1554 if (old_type < SVt_RV)
1558 Perl_croak(aTHX_ "panic: sv_upgrade to unknown type %lu", mt);
1562 if (old_body_arena) {
1564 my_safefree(old_body);
1566 del_body((void*)((char*)old_body + old_body_offset),
1573 =for apidoc sv_backoff
1575 Remove any string offset. You should normally use the C<SvOOK_off> macro
1582 Perl_sv_backoff(pTHX_ register SV *sv)
1585 assert(SvTYPE(sv) != SVt_PVHV);
1586 assert(SvTYPE(sv) != SVt_PVAV);
1588 const char * const s = SvPVX_const(sv);
1589 SvLEN_set(sv, SvLEN(sv) + SvIVX(sv));
1590 SvPV_set(sv, SvPVX(sv) - SvIVX(sv));
1592 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1594 SvFLAGS(sv) &= ~SVf_OOK;
1601 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1602 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1603 Use the C<SvGROW> wrapper instead.
1609 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1613 #ifdef HAS_64K_LIMIT
1614 if (newlen >= 0x10000) {
1615 PerlIO_printf(Perl_debug_log,
1616 "Allocation too large: %"UVxf"\n", (UV)newlen);
1619 #endif /* HAS_64K_LIMIT */
1622 if (SvTYPE(sv) < SVt_PV) {
1623 sv_upgrade(sv, SVt_PV);
1624 s = SvPVX_mutable(sv);
1626 else if (SvOOK(sv)) { /* pv is offset? */
1628 s = SvPVX_mutable(sv);
1629 if (newlen > SvLEN(sv))
1630 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1631 #ifdef HAS_64K_LIMIT
1632 if (newlen >= 0x10000)
1637 s = SvPVX_mutable(sv);
1639 if (newlen > SvLEN(sv)) { /* need more room? */
1640 newlen = PERL_STRLEN_ROUNDUP(newlen);
1641 if (SvLEN(sv) && s) {
1643 const STRLEN l = malloced_size((void*)SvPVX_const(sv));
1649 s = saferealloc(s, newlen);
1652 s = safemalloc(newlen);
1653 if (SvPVX_const(sv) && SvCUR(sv)) {
1654 Move(SvPVX_const(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1658 SvLEN_set(sv, newlen);
1664 =for apidoc sv_setiv
1666 Copies an integer into the given SV, upgrading first if necessary.
1667 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1673 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1675 SV_CHECK_THINKFIRST_COW_DROP(sv);
1676 switch (SvTYPE(sv)) {
1678 sv_upgrade(sv, SVt_IV);
1681 sv_upgrade(sv, SVt_PVNV);
1685 sv_upgrade(sv, SVt_PVIV);
1694 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1697 (void)SvIOK_only(sv); /* validate number */
1703 =for apidoc sv_setiv_mg
1705 Like C<sv_setiv>, but also handles 'set' magic.
1711 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1718 =for apidoc sv_setuv
1720 Copies an unsigned integer into the given SV, upgrading first if necessary.
1721 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1727 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1729 /* With these two if statements:
1730 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1733 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1735 If you wish to remove them, please benchmark to see what the effect is
1737 if (u <= (UV)IV_MAX) {
1738 sv_setiv(sv, (IV)u);
1747 =for apidoc sv_setuv_mg
1749 Like C<sv_setuv>, but also handles 'set' magic.
1755 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1757 /* With these two if statements:
1758 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1761 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1763 If you wish to remove them, please benchmark to see what the effect is
1765 if (u <= (UV)IV_MAX) {
1766 sv_setiv(sv, (IV)u);
1776 =for apidoc sv_setnv
1778 Copies a double into the given SV, upgrading first if necessary.
1779 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1785 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1787 SV_CHECK_THINKFIRST_COW_DROP(sv);
1788 switch (SvTYPE(sv)) {
1791 sv_upgrade(sv, SVt_NV);
1796 sv_upgrade(sv, SVt_PVNV);
1805 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1809 (void)SvNOK_only(sv); /* validate number */
1814 =for apidoc sv_setnv_mg
1816 Like C<sv_setnv>, but also handles 'set' magic.
1822 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1828 /* Print an "isn't numeric" warning, using a cleaned-up,
1829 * printable version of the offending string
1833 S_not_a_number(pTHX_ SV *sv)
1840 dsv = sv_2mortal(newSVpv("", 0));
1841 pv = sv_uni_display(dsv, sv, 10, 0);
1844 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1845 /* each *s can expand to 4 chars + "...\0",
1846 i.e. need room for 8 chars */
1848 const char *s, *end;
1849 for (s = SvPVX_const(sv), end = s + SvCUR(sv); s < end && d < limit;
1852 if (ch & 128 && !isPRINT_LC(ch)) {
1861 else if (ch == '\r') {
1865 else if (ch == '\f') {
1869 else if (ch == '\\') {
1873 else if (ch == '\0') {
1877 else if (isPRINT_LC(ch))
1894 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1895 "Argument \"%s\" isn't numeric in %s", pv,
1898 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1899 "Argument \"%s\" isn't numeric", pv);
1903 =for apidoc looks_like_number
1905 Test if the content of an SV looks like a number (or is a number).
1906 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1907 non-numeric warning), even if your atof() doesn't grok them.
1913 Perl_looks_like_number(pTHX_ SV *sv)
1915 register const char *sbegin;
1919 sbegin = SvPVX_const(sv);
1922 else if (SvPOKp(sv))
1923 sbegin = SvPV_const(sv, len);
1925 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1926 return grok_number(sbegin, len, NULL);
1929 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1930 until proven guilty, assume that things are not that bad... */
1935 As 64 bit platforms often have an NV that doesn't preserve all bits of
1936 an IV (an assumption perl has been based on to date) it becomes necessary
1937 to remove the assumption that the NV always carries enough precision to
1938 recreate the IV whenever needed, and that the NV is the canonical form.
1939 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1940 precision as a side effect of conversion (which would lead to insanity
1941 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1942 1) to distinguish between IV/UV/NV slots that have cached a valid
1943 conversion where precision was lost and IV/UV/NV slots that have a
1944 valid conversion which has lost no precision
1945 2) to ensure that if a numeric conversion to one form is requested that
1946 would lose precision, the precise conversion (or differently
1947 imprecise conversion) is also performed and cached, to prevent
1948 requests for different numeric formats on the same SV causing
1949 lossy conversion chains. (lossless conversion chains are perfectly
1954 SvIOKp is true if the IV slot contains a valid value
1955 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1956 SvNOKp is true if the NV slot contains a valid value
1957 SvNOK is true only if the NV value is accurate
1960 while converting from PV to NV, check to see if converting that NV to an
1961 IV(or UV) would lose accuracy over a direct conversion from PV to
1962 IV(or UV). If it would, cache both conversions, return NV, but mark
1963 SV as IOK NOKp (ie not NOK).
1965 While converting from PV to IV, check to see if converting that IV to an
1966 NV would lose accuracy over a direct conversion from PV to NV. If it
1967 would, cache both conversions, flag similarly.
1969 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1970 correctly because if IV & NV were set NV *always* overruled.
1971 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1972 changes - now IV and NV together means that the two are interchangeable:
1973 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1975 The benefit of this is that operations such as pp_add know that if
1976 SvIOK is true for both left and right operands, then integer addition
1977 can be used instead of floating point (for cases where the result won't
1978 overflow). Before, floating point was always used, which could lead to
1979 loss of precision compared with integer addition.
1981 * making IV and NV equal status should make maths accurate on 64 bit
1983 * may speed up maths somewhat if pp_add and friends start to use
1984 integers when possible instead of fp. (Hopefully the overhead in
1985 looking for SvIOK and checking for overflow will not outweigh the
1986 fp to integer speedup)
1987 * will slow down integer operations (callers of SvIV) on "inaccurate"
1988 values, as the change from SvIOK to SvIOKp will cause a call into
1989 sv_2iv each time rather than a macro access direct to the IV slot
1990 * should speed up number->string conversion on integers as IV is
1991 favoured when IV and NV are equally accurate
1993 ####################################################################
1994 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1995 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1996 On the other hand, SvUOK is true iff UV.
1997 ####################################################################
1999 Your mileage will vary depending your CPU's relative fp to integer
2003 #ifndef NV_PRESERVES_UV
2004 # define IS_NUMBER_UNDERFLOW_IV 1
2005 # define IS_NUMBER_UNDERFLOW_UV 2
2006 # define IS_NUMBER_IV_AND_UV 2
2007 # define IS_NUMBER_OVERFLOW_IV 4
2008 # define IS_NUMBER_OVERFLOW_UV 5
2010 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2012 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2014 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2016 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));
2017 if (SvNVX(sv) < (NV)IV_MIN) {
2018 (void)SvIOKp_on(sv);
2020 SvIV_set(sv, IV_MIN);
2021 return IS_NUMBER_UNDERFLOW_IV;
2023 if (SvNVX(sv) > (NV)UV_MAX) {
2024 (void)SvIOKp_on(sv);
2027 SvUV_set(sv, UV_MAX);
2028 return IS_NUMBER_OVERFLOW_UV;
2030 (void)SvIOKp_on(sv);
2032 /* Can't use strtol etc to convert this string. (See truth table in
2034 if (SvNVX(sv) <= (UV)IV_MAX) {
2035 SvIV_set(sv, I_V(SvNVX(sv)));
2036 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2037 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2039 /* Integer is imprecise. NOK, IOKp */
2041 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2044 SvUV_set(sv, U_V(SvNVX(sv)));
2045 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2046 if (SvUVX(sv) == UV_MAX) {
2047 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2048 possibly be preserved by NV. Hence, it must be overflow.
2050 return IS_NUMBER_OVERFLOW_UV;
2052 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2054 /* Integer is imprecise. NOK, IOKp */
2056 return IS_NUMBER_OVERFLOW_IV;
2058 #endif /* !NV_PRESERVES_UV*/
2060 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2061 * this function provided for binary compatibility only
2065 Perl_sv_2iv(pTHX_ register SV *sv)
2067 return sv_2iv_flags(sv, SV_GMAGIC);
2071 =for apidoc sv_2iv_flags
2073 Return the integer value of an SV, doing any necessary string
2074 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2075 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2081 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2085 if (SvGMAGICAL(sv)) {
2086 if (flags & SV_GMAGIC)
2091 return I_V(SvNVX(sv));
2093 if (SvPOKp(sv) && SvLEN(sv))
2096 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2097 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2103 if (SvTHINKFIRST(sv)) {
2106 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2107 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2108 return SvIV(tmpstr);
2109 return PTR2IV(SvRV(sv));
2112 sv_force_normal_flags(sv, 0);
2114 if (SvREADONLY(sv) && !SvOK(sv)) {
2115 if (ckWARN(WARN_UNINITIALIZED))
2122 return (IV)(SvUVX(sv));
2129 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2130 * without also getting a cached IV/UV from it at the same time
2131 * (ie PV->NV conversion should detect loss of accuracy and cache
2132 * IV or UV at same time to avoid this. NWC */
2134 if (SvTYPE(sv) == SVt_NV)
2135 sv_upgrade(sv, SVt_PVNV);
2137 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2138 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2139 certainly cast into the IV range at IV_MAX, whereas the correct
2140 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2142 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2143 SvIV_set(sv, I_V(SvNVX(sv)));
2144 if (SvNVX(sv) == (NV) SvIVX(sv)
2145 #ifndef NV_PRESERVES_UV
2146 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2147 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2148 /* Don't flag it as "accurately an integer" if the number
2149 came from a (by definition imprecise) NV operation, and
2150 we're outside the range of NV integer precision */
2153 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2154 DEBUG_c(PerlIO_printf(Perl_debug_log,
2155 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2161 /* IV not precise. No need to convert from PV, as NV
2162 conversion would already have cached IV if it detected
2163 that PV->IV would be better than PV->NV->IV
2164 flags already correct - don't set public IOK. */
2165 DEBUG_c(PerlIO_printf(Perl_debug_log,
2166 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2171 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2172 but the cast (NV)IV_MIN rounds to a the value less (more
2173 negative) than IV_MIN which happens to be equal to SvNVX ??
2174 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2175 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2176 (NV)UVX == NVX are both true, but the values differ. :-(
2177 Hopefully for 2s complement IV_MIN is something like
2178 0x8000000000000000 which will be exact. NWC */
2181 SvUV_set(sv, U_V(SvNVX(sv)));
2183 (SvNVX(sv) == (NV) SvUVX(sv))
2184 #ifndef NV_PRESERVES_UV
2185 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2186 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2187 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2188 /* Don't flag it as "accurately an integer" if the number
2189 came from a (by definition imprecise) NV operation, and
2190 we're outside the range of NV integer precision */
2196 DEBUG_c(PerlIO_printf(Perl_debug_log,
2197 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2201 return (IV)SvUVX(sv);
2204 else if (SvPOKp(sv) && SvLEN(sv)) {
2206 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2207 /* We want to avoid a possible problem when we cache an IV which
2208 may be later translated to an NV, and the resulting NV is not
2209 the same as the direct translation of the initial string
2210 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2211 be careful to ensure that the value with the .456 is around if the
2212 NV value is requested in the future).
2214 This means that if we cache such an IV, we need to cache the
2215 NV as well. Moreover, we trade speed for space, and do not
2216 cache the NV if we are sure it's not needed.
2219 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2220 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2221 == IS_NUMBER_IN_UV) {
2222 /* It's definitely an integer, only upgrade to PVIV */
2223 if (SvTYPE(sv) < SVt_PVIV)
2224 sv_upgrade(sv, SVt_PVIV);
2226 } else if (SvTYPE(sv) < SVt_PVNV)
2227 sv_upgrade(sv, SVt_PVNV);
2229 /* If NV preserves UV then we only use the UV value if we know that
2230 we aren't going to call atof() below. If NVs don't preserve UVs
2231 then the value returned may have more precision than atof() will
2232 return, even though value isn't perfectly accurate. */
2233 if ((numtype & (IS_NUMBER_IN_UV
2234 #ifdef NV_PRESERVES_UV
2237 )) == IS_NUMBER_IN_UV) {
2238 /* This won't turn off the public IOK flag if it was set above */
2239 (void)SvIOKp_on(sv);
2241 if (!(numtype & IS_NUMBER_NEG)) {
2243 if (value <= (UV)IV_MAX) {
2244 SvIV_set(sv, (IV)value);
2246 SvUV_set(sv, value);
2250 /* 2s complement assumption */
2251 if (value <= (UV)IV_MIN) {
2252 SvIV_set(sv, -(IV)value);
2254 /* Too negative for an IV. This is a double upgrade, but
2255 I'm assuming it will be rare. */
2256 if (SvTYPE(sv) < SVt_PVNV)
2257 sv_upgrade(sv, SVt_PVNV);
2261 SvNV_set(sv, -(NV)value);
2262 SvIV_set(sv, IV_MIN);
2266 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2267 will be in the previous block to set the IV slot, and the next
2268 block to set the NV slot. So no else here. */
2270 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2271 != IS_NUMBER_IN_UV) {
2272 /* It wasn't an (integer that doesn't overflow the UV). */
2273 SvNV_set(sv, Atof(SvPVX_const(sv)));
2275 if (! numtype && ckWARN(WARN_NUMERIC))
2278 #if defined(USE_LONG_DOUBLE)
2279 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2280 PTR2UV(sv), SvNVX(sv)));
2282 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2283 PTR2UV(sv), SvNVX(sv)));
2287 #ifdef NV_PRESERVES_UV
2288 (void)SvIOKp_on(sv);
2290 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2291 SvIV_set(sv, I_V(SvNVX(sv)));
2292 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2295 /* Integer is imprecise. NOK, IOKp */
2297 /* UV will not work better than IV */
2299 if (SvNVX(sv) > (NV)UV_MAX) {
2301 /* Integer is inaccurate. NOK, IOKp, is UV */
2302 SvUV_set(sv, UV_MAX);
2305 SvUV_set(sv, U_V(SvNVX(sv)));
2306 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2307 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2311 /* Integer is imprecise. NOK, IOKp, is UV */
2317 #else /* NV_PRESERVES_UV */
2318 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2319 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2320 /* The IV slot will have been set from value returned by
2321 grok_number above. The NV slot has just been set using
2324 assert (SvIOKp(sv));
2326 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2327 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2328 /* Small enough to preserve all bits. */
2329 (void)SvIOKp_on(sv);
2331 SvIV_set(sv, I_V(SvNVX(sv)));
2332 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2334 /* Assumption: first non-preserved integer is < IV_MAX,
2335 this NV is in the preserved range, therefore: */
2336 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2338 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);
2342 0 0 already failed to read UV.
2343 0 1 already failed to read UV.
2344 1 0 you won't get here in this case. IV/UV
2345 slot set, public IOK, Atof() unneeded.
2346 1 1 already read UV.
2347 so there's no point in sv_2iuv_non_preserve() attempting
2348 to use atol, strtol, strtoul etc. */
2349 if (sv_2iuv_non_preserve (sv, numtype)
2350 >= IS_NUMBER_OVERFLOW_IV)
2354 #endif /* NV_PRESERVES_UV */
2357 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2359 if (SvTYPE(sv) < SVt_IV)
2360 /* Typically the caller expects that sv_any is not NULL now. */
2361 sv_upgrade(sv, SVt_IV);
2364 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2365 PTR2UV(sv),SvIVX(sv)));
2366 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2369 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2370 * this function provided for binary compatibility only
2374 Perl_sv_2uv(pTHX_ register SV *sv)
2376 return sv_2uv_flags(sv, SV_GMAGIC);
2380 =for apidoc sv_2uv_flags
2382 Return the unsigned integer value of an SV, doing any necessary string
2383 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2384 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2390 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2394 if (SvGMAGICAL(sv)) {
2395 if (flags & SV_GMAGIC)
2400 return U_V(SvNVX(sv));
2401 if (SvPOKp(sv) && SvLEN(sv))
2404 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2405 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2411 if (SvTHINKFIRST(sv)) {
2414 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2415 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2416 return SvUV(tmpstr);
2417 return PTR2UV(SvRV(sv));
2420 sv_force_normal_flags(sv, 0);
2422 if (SvREADONLY(sv) && !SvOK(sv)) {
2423 if (ckWARN(WARN_UNINITIALIZED))
2433 return (UV)SvIVX(sv);
2437 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2438 * without also getting a cached IV/UV from it at the same time
2439 * (ie PV->NV conversion should detect loss of accuracy and cache
2440 * IV or UV at same time to avoid this. */
2441 /* IV-over-UV optimisation - choose to cache IV if possible */
2443 if (SvTYPE(sv) == SVt_NV)
2444 sv_upgrade(sv, SVt_PVNV);
2446 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2447 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2448 SvIV_set(sv, I_V(SvNVX(sv)));
2449 if (SvNVX(sv) == (NV) SvIVX(sv)
2450 #ifndef NV_PRESERVES_UV
2451 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2452 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2453 /* Don't flag it as "accurately an integer" if the number
2454 came from a (by definition imprecise) NV operation, and
2455 we're outside the range of NV integer precision */
2458 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2459 DEBUG_c(PerlIO_printf(Perl_debug_log,
2460 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2466 /* IV not precise. No need to convert from PV, as NV
2467 conversion would already have cached IV if it detected
2468 that PV->IV would be better than PV->NV->IV
2469 flags already correct - don't set public IOK. */
2470 DEBUG_c(PerlIO_printf(Perl_debug_log,
2471 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2476 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2477 but the cast (NV)IV_MIN rounds to a the value less (more
2478 negative) than IV_MIN which happens to be equal to SvNVX ??
2479 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2480 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2481 (NV)UVX == NVX are both true, but the values differ. :-(
2482 Hopefully for 2s complement IV_MIN is something like
2483 0x8000000000000000 which will be exact. NWC */
2486 SvUV_set(sv, U_V(SvNVX(sv)));
2488 (SvNVX(sv) == (NV) SvUVX(sv))
2489 #ifndef NV_PRESERVES_UV
2490 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2491 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2492 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2493 /* Don't flag it as "accurately an integer" if the number
2494 came from a (by definition imprecise) NV operation, and
2495 we're outside the range of NV integer precision */
2500 DEBUG_c(PerlIO_printf(Perl_debug_log,
2501 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2507 else if (SvPOKp(sv) && SvLEN(sv)) {
2509 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2511 /* We want to avoid a possible problem when we cache a UV which
2512 may be later translated to an NV, and the resulting NV is not
2513 the translation of the initial data.
2515 This means that if we cache such a UV, we need to cache the
2516 NV as well. Moreover, we trade speed for space, and do not
2517 cache the NV if not needed.
2520 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2521 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2522 == IS_NUMBER_IN_UV) {
2523 /* It's definitely an integer, only upgrade to PVIV */
2524 if (SvTYPE(sv) < SVt_PVIV)
2525 sv_upgrade(sv, SVt_PVIV);
2527 } else if (SvTYPE(sv) < SVt_PVNV)
2528 sv_upgrade(sv, SVt_PVNV);
2530 /* If NV preserves UV then we only use the UV value if we know that
2531 we aren't going to call atof() below. If NVs don't preserve UVs
2532 then the value returned may have more precision than atof() will
2533 return, even though it isn't accurate. */
2534 if ((numtype & (IS_NUMBER_IN_UV
2535 #ifdef NV_PRESERVES_UV
2538 )) == IS_NUMBER_IN_UV) {
2539 /* This won't turn off the public IOK flag if it was set above */
2540 (void)SvIOKp_on(sv);
2542 if (!(numtype & IS_NUMBER_NEG)) {
2544 if (value <= (UV)IV_MAX) {
2545 SvIV_set(sv, (IV)value);
2547 /* it didn't overflow, and it was positive. */
2548 SvUV_set(sv, value);
2552 /* 2s complement assumption */
2553 if (value <= (UV)IV_MIN) {
2554 SvIV_set(sv, -(IV)value);
2556 /* Too negative for an IV. This is a double upgrade, but
2557 I'm assuming it will be rare. */
2558 if (SvTYPE(sv) < SVt_PVNV)
2559 sv_upgrade(sv, SVt_PVNV);
2563 SvNV_set(sv, -(NV)value);
2564 SvIV_set(sv, IV_MIN);
2569 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2570 != IS_NUMBER_IN_UV) {
2571 /* It wasn't an integer, or it overflowed the UV. */
2572 SvNV_set(sv, Atof(SvPVX_const(sv)));
2574 if (! numtype && ckWARN(WARN_NUMERIC))
2577 #if defined(USE_LONG_DOUBLE)
2578 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2579 PTR2UV(sv), SvNVX(sv)));
2581 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2582 PTR2UV(sv), SvNVX(sv)));
2585 #ifdef NV_PRESERVES_UV
2586 (void)SvIOKp_on(sv);
2588 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2589 SvIV_set(sv, I_V(SvNVX(sv)));
2590 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2593 /* Integer is imprecise. NOK, IOKp */
2595 /* UV will not work better than IV */
2597 if (SvNVX(sv) > (NV)UV_MAX) {
2599 /* Integer is inaccurate. NOK, IOKp, is UV */
2600 SvUV_set(sv, UV_MAX);
2603 SvUV_set(sv, U_V(SvNVX(sv)));
2604 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2605 NV preservse UV so can do correct comparison. */
2606 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2610 /* Integer is imprecise. NOK, IOKp, is UV */
2615 #else /* NV_PRESERVES_UV */
2616 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2617 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2618 /* The UV slot will have been set from value returned by
2619 grok_number above. The NV slot has just been set using
2622 assert (SvIOKp(sv));
2624 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2625 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2626 /* Small enough to preserve all bits. */
2627 (void)SvIOKp_on(sv);
2629 SvIV_set(sv, I_V(SvNVX(sv)));
2630 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2632 /* Assumption: first non-preserved integer is < IV_MAX,
2633 this NV is in the preserved range, therefore: */
2634 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2636 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);
2639 sv_2iuv_non_preserve (sv, numtype);
2641 #endif /* NV_PRESERVES_UV */
2645 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2646 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2649 if (SvTYPE(sv) < SVt_IV)
2650 /* Typically the caller expects that sv_any is not NULL now. */
2651 sv_upgrade(sv, SVt_IV);
2655 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2656 PTR2UV(sv),SvUVX(sv)));
2657 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2663 Return the num value of an SV, doing any necessary string or integer
2664 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2671 Perl_sv_2nv(pTHX_ register SV *sv)
2675 if (SvGMAGICAL(sv)) {
2679 if (SvPOKp(sv) && SvLEN(sv)) {
2680 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2681 !grok_number(SvPVX_const(sv), SvCUR(sv), NULL))
2683 return Atof(SvPVX_const(sv));
2687 return (NV)SvUVX(sv);
2689 return (NV)SvIVX(sv);
2692 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2693 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2699 if (SvTHINKFIRST(sv)) {
2702 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2703 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2704 return SvNV(tmpstr);
2705 return PTR2NV(SvRV(sv));
2708 sv_force_normal_flags(sv, 0);
2710 if (SvREADONLY(sv) && !SvOK(sv)) {
2711 if (ckWARN(WARN_UNINITIALIZED))
2716 if (SvTYPE(sv) < SVt_NV) {
2717 if (SvTYPE(sv) == SVt_IV)
2718 sv_upgrade(sv, SVt_PVNV);
2720 sv_upgrade(sv, SVt_NV);
2721 #ifdef USE_LONG_DOUBLE
2723 STORE_NUMERIC_LOCAL_SET_STANDARD();
2724 PerlIO_printf(Perl_debug_log,
2725 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2726 PTR2UV(sv), SvNVX(sv));
2727 RESTORE_NUMERIC_LOCAL();
2731 STORE_NUMERIC_LOCAL_SET_STANDARD();
2732 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2733 PTR2UV(sv), SvNVX(sv));
2734 RESTORE_NUMERIC_LOCAL();
2738 else if (SvTYPE(sv) < SVt_PVNV)
2739 sv_upgrade(sv, SVt_PVNV);
2744 SvNV_set(sv, SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv));
2745 #ifdef NV_PRESERVES_UV
2748 /* Only set the public NV OK flag if this NV preserves the IV */
2749 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2750 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2751 : (SvIVX(sv) == I_V(SvNVX(sv))))
2757 else if (SvPOKp(sv) && SvLEN(sv)) {
2759 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2760 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2762 #ifdef NV_PRESERVES_UV
2763 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2764 == IS_NUMBER_IN_UV) {
2765 /* It's definitely an integer */
2766 SvNV_set(sv, (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value);
2768 SvNV_set(sv, Atof(SvPVX_const(sv)));
2771 SvNV_set(sv, Atof(SvPVX_const(sv)));
2772 /* Only set the public NV OK flag if this NV preserves the value in
2773 the PV at least as well as an IV/UV would.
2774 Not sure how to do this 100% reliably. */
2775 /* if that shift count is out of range then Configure's test is
2776 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2778 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2779 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2780 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2781 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2782 /* Can't use strtol etc to convert this string, so don't try.
2783 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2786 /* value has been set. It may not be precise. */
2787 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2788 /* 2s complement assumption for (UV)IV_MIN */
2789 SvNOK_on(sv); /* Integer is too negative. */
2794 if (numtype & IS_NUMBER_NEG) {
2795 SvIV_set(sv, -(IV)value);
2796 } else if (value <= (UV)IV_MAX) {
2797 SvIV_set(sv, (IV)value);
2799 SvUV_set(sv, value);
2803 if (numtype & IS_NUMBER_NOT_INT) {
2804 /* I believe that even if the original PV had decimals,
2805 they are lost beyond the limit of the FP precision.
2806 However, neither is canonical, so both only get p
2807 flags. NWC, 2000/11/25 */
2808 /* Both already have p flags, so do nothing */
2810 const NV nv = SvNVX(sv);
2811 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2812 if (SvIVX(sv) == I_V(nv)) {
2817 /* It had no "." so it must be integer. */
2820 /* between IV_MAX and NV(UV_MAX).
2821 Could be slightly > UV_MAX */
2823 if (numtype & IS_NUMBER_NOT_INT) {
2824 /* UV and NV both imprecise. */
2826 const UV nv_as_uv = U_V(nv);
2828 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2839 #endif /* NV_PRESERVES_UV */
2842 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2844 if (SvTYPE(sv) < SVt_NV)
2845 /* Typically the caller expects that sv_any is not NULL now. */
2846 /* XXX Ilya implies that this is a bug in callers that assume this
2847 and ideally should be fixed. */
2848 sv_upgrade(sv, SVt_NV);
2851 #if defined(USE_LONG_DOUBLE)
2853 STORE_NUMERIC_LOCAL_SET_STANDARD();
2854 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2855 PTR2UV(sv), SvNVX(sv));
2856 RESTORE_NUMERIC_LOCAL();
2860 STORE_NUMERIC_LOCAL_SET_STANDARD();
2861 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2862 PTR2UV(sv), SvNVX(sv));
2863 RESTORE_NUMERIC_LOCAL();
2869 /* asIV(): extract an integer from the string value of an SV.
2870 * Caller must validate PVX */
2873 S_asIV(pTHX_ SV *sv)
2876 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2878 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2879 == IS_NUMBER_IN_UV) {
2880 /* It's definitely an integer */
2881 if (numtype & IS_NUMBER_NEG) {
2882 if (value < (UV)IV_MIN)
2885 if (value < (UV)IV_MAX)
2890 if (ckWARN(WARN_NUMERIC))
2893 return I_V(Atof(SvPVX_const(sv)));
2896 /* asUV(): extract an unsigned integer from the string value of an SV
2897 * Caller must validate PVX */
2900 S_asUV(pTHX_ SV *sv)
2903 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), &value);
2905 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2906 == IS_NUMBER_IN_UV) {
2907 /* It's definitely an integer */
2908 if (!(numtype & IS_NUMBER_NEG))
2912 if (ckWARN(WARN_NUMERIC))
2915 return U_V(Atof(SvPVX_const(sv)));
2919 =for apidoc sv_2pv_nolen
2921 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2922 use the macro wrapper C<SvPV_nolen(sv)> instead.
2927 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2929 return sv_2pv(sv, 0);
2932 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2933 * UV as a string towards the end of buf, and return pointers to start and
2936 * We assume that buf is at least TYPE_CHARS(UV) long.
2940 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2942 char *ptr = buf + TYPE_CHARS(UV);
2956 *--ptr = '0' + (char)(uv % 10);
2964 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2965 * this function provided for binary compatibility only
2969 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2971 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2975 =for apidoc sv_2pv_flags
2977 Returns a pointer to the string value of an SV, and sets *lp to its length.
2978 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2980 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2981 usually end up here too.
2987 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2992 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2993 char *tmpbuf = tbuf;
3000 if (SvGMAGICAL(sv)) {
3001 if (flags & SV_GMAGIC)
3006 if (flags & SV_MUTABLE_RETURN)
3007 return SvPVX_mutable(sv);
3008 if (flags & SV_CONST_RETURN)
3009 return (char *)SvPVX_const(sv);
3014 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3016 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3021 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3026 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3027 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3035 if (SvTHINKFIRST(sv)) {
3038 register const char *typestr;
3039 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3040 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3042 /* char *pv = lp ? SvPV(tmpstr, *lp) : SvPV_nolen(tmpstr); */
3045 if ((SvFLAGS(tmpstr) & (SVf_POK)) == SVf_POK) {
3046 if (flags & SV_CONST_RETURN) {
3047 pv = (char *) SvPVX_const(tmpstr);
3049 pv = (flags & SV_MUTABLE_RETURN)
3050 ? SvPVX_mutable(tmpstr) : SvPVX(tmpstr);
3053 *lp = SvCUR(tmpstr);
3055 pv = sv_2pv_flags(tmpstr, lp, flags);
3066 typestr = "NULLREF";
3070 switch (SvTYPE(sv)) {
3072 if ( ((SvFLAGS(sv) &
3073 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3074 == (SVs_OBJECT|SVs_SMG))
3075 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3076 const regexp *re = (regexp *)mg->mg_obj;
3079 const char *fptr = "msix";
3084 char need_newline = 0;
3085 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3087 while((ch = *fptr++)) {
3089 reflags[left++] = ch;
3092 reflags[right--] = ch;
3097 reflags[left] = '-';
3101 mg->mg_len = re->prelen + 4 + left;
3103 * If /x was used, we have to worry about a regex
3104 * ending with a comment later being embedded
3105 * within another regex. If so, we don't want this
3106 * regex's "commentization" to leak out to the
3107 * right part of the enclosing regex, we must cap
3108 * it with a newline.
3110 * So, if /x was used, we scan backwards from the
3111 * end of the regex. If we find a '#' before we
3112 * find a newline, we need to add a newline
3113 * ourself. If we find a '\n' first (or if we
3114 * don't find '#' or '\n'), we don't need to add
3115 * anything. -jfriedl
3117 if (PMf_EXTENDED & re->reganch)
3119 const char *endptr = re->precomp + re->prelen;
3120 while (endptr >= re->precomp)
3122 const char c = *(endptr--);
3124 break; /* don't need another */
3126 /* we end while in a comment, so we
3128 mg->mg_len++; /* save space for it */
3129 need_newline = 1; /* note to add it */
3135 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3136 Copy("(?", mg->mg_ptr, 2, char);
3137 Copy(reflags, mg->mg_ptr+2, left, char);
3138 Copy(":", mg->mg_ptr+left+2, 1, char);
3139 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3141 mg->mg_ptr[mg->mg_len - 2] = '\n';
3142 mg->mg_ptr[mg->mg_len - 1] = ')';
3143 mg->mg_ptr[mg->mg_len] = 0;
3145 PL_reginterp_cnt += re->program[0].next_off;
3147 if (re->reganch & ROPT_UTF8)
3163 case SVt_PVBM: typestr = SvROK(sv) ? "REF" : "SCALAR"; break;
3164 case SVt_PVLV: typestr = SvROK(sv) ? "REF"
3165 /* tied lvalues should appear to be
3166 * scalars for backwards compatitbility */
3167 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3168 ? "SCALAR" : "LVALUE"; break;
3169 case SVt_PVAV: typestr = "ARRAY"; break;
3170 case SVt_PVHV: typestr = "HASH"; break;
3171 case SVt_PVCV: typestr = "CODE"; break;
3172 case SVt_PVGV: typestr = "GLOB"; break;
3173 case SVt_PVFM: typestr = "FORMAT"; break;
3174 case SVt_PVIO: typestr = "IO"; break;
3175 default: typestr = "UNKNOWN"; break;
3179 const char *name = HvNAME_get(SvSTASH(sv));
3180 Perl_sv_setpvf(aTHX_ tsv, "%s=%s(0x%"UVxf")",
3181 name ? name : "__ANON__" , typestr, PTR2UV(sv));
3184 Perl_sv_setpvf(aTHX_ tsv, "%s(0x%"UVxf")", typestr, PTR2UV(sv));
3188 *lp = strlen(typestr);
3189 return (char *)typestr;
3191 if (SvREADONLY(sv) && !SvOK(sv)) {
3192 if (ckWARN(WARN_UNINITIALIZED))
3199 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3200 /* I'm assuming that if both IV and NV are equally valid then
3201 converting the IV is going to be more efficient */
3202 const U32 isIOK = SvIOK(sv);
3203 const U32 isUIOK = SvIsUV(sv);
3204 char buf[TYPE_CHARS(UV)];
3207 if (SvTYPE(sv) < SVt_PVIV)
3208 sv_upgrade(sv, SVt_PVIV);
3210 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3212 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3213 /* inlined from sv_setpvn */
3214 SvGROW_mutable(sv, (STRLEN)(ebuf - ptr + 1));
3215 Move(ptr,SvPVX_mutable(sv),ebuf - ptr,char);
3216 SvCUR_set(sv, ebuf - ptr);
3226 else if (SvNOKp(sv)) {
3227 if (SvTYPE(sv) < SVt_PVNV)
3228 sv_upgrade(sv, SVt_PVNV);
3229 /* The +20 is pure guesswork. Configure test needed. --jhi */
3230 s = SvGROW_mutable(sv, NV_DIG + 20);
3231 olderrno = errno; /* some Xenix systems wipe out errno here */
3233 if (SvNVX(sv) == 0.0)
3234 (void)strcpy(s,"0");
3238 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3241 #ifdef FIXNEGATIVEZERO
3242 if (*s == '-' && s[1] == '0' && !s[2])
3252 if (ckWARN(WARN_UNINITIALIZED)
3253 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3257 if (SvTYPE(sv) < SVt_PV)
3258 /* Typically the caller expects that sv_any is not NULL now. */
3259 sv_upgrade(sv, SVt_PV);
3263 STRLEN len = s - SvPVX_const(sv);
3269 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3270 PTR2UV(sv),SvPVX_const(sv)));
3271 if (flags & SV_CONST_RETURN)
3272 return (char *)SvPVX_const(sv);
3273 if (flags & SV_MUTABLE_RETURN)
3274 return SvPVX_mutable(sv);
3278 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3279 /* Sneaky stuff here */
3283 tsv = newSVpv(tmpbuf, 0);
3296 t = SvPVX_const(tsv);
3301 len = strlen(tmpbuf);
3303 #ifdef FIXNEGATIVEZERO
3304 if (len == 2 && t[0] == '-' && t[1] == '0') {
3309 SvUPGRADE(sv, SVt_PV);
3312 s = SvGROW_mutable(sv, len + 1);
3315 return memcpy(s, t, len + 1);
3320 =for apidoc sv_copypv
3322 Copies a stringified representation of the source SV into the
3323 destination SV. Automatically performs any necessary mg_get and
3324 coercion of numeric values into strings. Guaranteed to preserve
3325 UTF-8 flag even from overloaded objects. Similar in nature to
3326 sv_2pv[_flags] but operates directly on an SV instead of just the
3327 string. Mostly uses sv_2pv_flags to do its work, except when that
3328 would lose the UTF-8'ness of the PV.
3334 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3337 const char * const s = SvPV_const(ssv,len);
3338 sv_setpvn(dsv,s,len);
3346 =for apidoc sv_2pvbyte_nolen
3348 Return a pointer to the byte-encoded representation of the SV.
3349 May cause the SV to be downgraded from UTF-8 as a side-effect.
3351 Usually accessed via the C<SvPVbyte_nolen> macro.
3357 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3359 return sv_2pvbyte(sv, 0);
3363 =for apidoc sv_2pvbyte
3365 Return a pointer to the byte-encoded representation of the SV, and set *lp
3366 to its length. May cause the SV to be downgraded from UTF-8 as a
3369 Usually accessed via the C<SvPVbyte> macro.
3375 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3377 sv_utf8_downgrade(sv,0);
3378 return lp ? SvPV(sv,*lp) : SvPV_nolen(sv);
3382 =for apidoc sv_2pvutf8_nolen
3384 Return a pointer to the UTF-8-encoded representation of the SV.
3385 May cause the SV to be upgraded to UTF-8 as a side-effect.
3387 Usually accessed via the C<SvPVutf8_nolen> macro.
3393 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3395 return sv_2pvutf8(sv, 0);
3399 =for apidoc sv_2pvutf8
3401 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3402 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3404 Usually accessed via the C<SvPVutf8> macro.
3410 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3412 sv_utf8_upgrade(sv);
3413 return SvPV(sv,*lp);
3417 =for apidoc sv_2bool
3419 This function is only called on magical items, and is only used by
3420 sv_true() or its macro equivalent.
3426 Perl_sv_2bool(pTHX_ register SV *sv)
3435 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3436 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3437 return (bool)SvTRUE(tmpsv);
3438 return SvRV(sv) != 0;
3441 register XPV* const Xpvtmp = (XPV*)SvANY(sv);
3443 (*sv->sv_u.svu_pv > '0' ||
3444 Xpvtmp->xpv_cur > 1 ||
3445 (Xpvtmp->xpv_cur && *sv->sv_u.svu_pv != '0')))
3452 return SvIVX(sv) != 0;
3455 return SvNVX(sv) != 0.0;
3462 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3463 * this function provided for binary compatibility only
3468 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3470 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3474 =for apidoc sv_utf8_upgrade
3476 Converts the PV of an SV to its UTF-8-encoded form.
3477 Forces the SV to string form if it is not already.
3478 Always sets the SvUTF8 flag to avoid future validity checks even
3479 if all the bytes have hibit clear.
3481 This is not as a general purpose byte encoding to Unicode interface:
3482 use the Encode extension for that.
3484 =for apidoc sv_utf8_upgrade_flags
3486 Converts the PV of an SV to its UTF-8-encoded form.
3487 Forces the SV to string form if it is not already.
3488 Always sets the SvUTF8 flag to avoid future validity checks even
3489 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3490 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3491 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3493 This is not as a general purpose byte encoding to Unicode interface:
3494 use the Encode extension for that.
3500 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3502 if (sv == &PL_sv_undef)
3506 if (SvREADONLY(sv) && (SvPOKp(sv) || SvIOKp(sv) || SvNOKp(sv))) {
3507 (void) sv_2pv_flags(sv,&len, flags);
3511 (void) SvPV_force(sv,len);
3520 sv_force_normal_flags(sv, 0);
3523 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3524 sv_recode_to_utf8(sv, PL_encoding);
3525 else { /* Assume Latin-1/EBCDIC */
3526 /* This function could be much more efficient if we
3527 * had a FLAG in SVs to signal if there are any hibit
3528 * chars in the PV. Given that there isn't such a flag
3529 * make the loop as fast as possible. */
3530 const U8 *s = (U8 *) SvPVX_const(sv);
3531 const U8 *e = (U8 *) SvEND(sv);
3537 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3541 STRLEN len = SvCUR(sv) + 1; /* Plus the \0 */
3542 U8 * const recoded = bytes_to_utf8((U8*)s, &len);
3544 SvPV_free(sv); /* No longer using what was there before. */
3546 SvPV_set(sv, (char*)recoded);
3547 SvCUR_set(sv, len - 1);
3548 SvLEN_set(sv, len); /* No longer know the real size. */
3550 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3557 =for apidoc sv_utf8_downgrade
3559 Attempts to convert the PV of an SV from characters to bytes.
3560 If the PV contains a character beyond byte, this conversion will fail;
3561 in this case, either returns false or, if C<fail_ok> is not
3564 This is not as a general purpose Unicode to byte encoding interface:
3565 use the Encode extension for that.
3571 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3573 if (SvPOKp(sv) && SvUTF8(sv)) {
3579 sv_force_normal_flags(sv, 0);
3581 s = (U8 *) SvPV(sv, len);
3582 if (!utf8_to_bytes(s, &len)) {
3587 Perl_croak(aTHX_ "Wide character in %s",
3590 Perl_croak(aTHX_ "Wide character");
3601 =for apidoc sv_utf8_encode
3603 Converts the PV of an SV to UTF-8, but then turns the C<SvUTF8>
3604 flag off so that it looks like octets again.
3610 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3612 (void) sv_utf8_upgrade(sv);
3614 sv_force_normal_flags(sv, 0);
3616 if (SvREADONLY(sv)) {
3617 Perl_croak(aTHX_ PL_no_modify);
3623 =for apidoc sv_utf8_decode
3625 If the PV of the SV is an octet sequence in UTF-8
3626 and contains a multiple-byte character, the C<SvUTF8> flag is turned on
3627 so that it looks like a character. If the PV contains only single-byte
3628 characters, the C<SvUTF8> flag stays being off.
3629 Scans PV for validity and returns false if the PV is invalid UTF-8.
3635 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3641 /* The octets may have got themselves encoded - get them back as
3644 if (!sv_utf8_downgrade(sv, TRUE))
3647 /* it is actually just a matter of turning the utf8 flag on, but
3648 * we want to make sure everything inside is valid utf8 first.
3650 c = (const U8 *) SvPVX_const(sv);
3651 if (!is_utf8_string(c, SvCUR(sv)+1))
3653 e = (const U8 *) SvEND(sv);
3656 if (!UTF8_IS_INVARIANT(ch)) {
3665 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3666 * this function provided for binary compatibility only
3670 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3672 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3676 =for apidoc sv_setsv
3678 Copies the contents of the source SV C<ssv> into the destination SV
3679 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3680 function if the source SV needs to be reused. Does not handle 'set' magic.
3681 Loosely speaking, it performs a copy-by-value, obliterating any previous
3682 content of the destination.
3684 You probably want to use one of the assortment of wrappers, such as
3685 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3686 C<SvSetMagicSV_nosteal>.
3688 =for apidoc sv_setsv_flags
3690 Copies the contents of the source SV C<ssv> into the destination SV
3691 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3692 function if the source SV needs to be reused. Does not handle 'set' magic.
3693 Loosely speaking, it performs a copy-by-value, obliterating any previous
3694 content of the destination.
3695 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3696 C<ssv> if appropriate, else not. If the C<flags> parameter has the
3697 C<NOSTEAL> bit set then the buffers of temps will not be stolen. <sv_setsv>
3698 and C<sv_setsv_nomg> are implemented in terms of this function.
3700 You probably want to use one of the assortment of wrappers, such as
3701 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3702 C<SvSetMagicSV_nosteal>.
3704 This is the primary function for copying scalars, and most other
3705 copy-ish functions and macros use this underneath.
3711 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3713 register U32 sflags;
3719 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3721 sstr = &PL_sv_undef;
3722 stype = SvTYPE(sstr);
3723 dtype = SvTYPE(dstr);
3728 /* need to nuke the magic */
3730 SvRMAGICAL_off(dstr);
3733 /* There's a lot of redundancy below but we're going for speed here */
3738 if (dtype != SVt_PVGV) {
3739 (void)SvOK_off(dstr);
3747 sv_upgrade(dstr, SVt_IV);
3750 sv_upgrade(dstr, SVt_PVNV);
3754 sv_upgrade(dstr, SVt_PVIV);
3757 (void)SvIOK_only(dstr);
3758 SvIV_set(dstr, SvIVX(sstr));
3761 if (SvTAINTED(sstr))
3772 sv_upgrade(dstr, SVt_NV);
3777 sv_upgrade(dstr, SVt_PVNV);
3780 SvNV_set(dstr, SvNVX(sstr));
3781 (void)SvNOK_only(dstr);
3782 if (SvTAINTED(sstr))
3790 sv_upgrade(dstr, SVt_RV);
3791 else if (dtype == SVt_PVGV &&
3792 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3795 if (GvIMPORTED(dstr) != GVf_IMPORTED
3796 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3798 GvIMPORTED_on(dstr);
3807 #ifdef PERL_OLD_COPY_ON_WRITE
3808 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3809 if (dtype < SVt_PVIV)
3810 sv_upgrade(dstr, SVt_PVIV);
3817 sv_upgrade(dstr, SVt_PV);
3820 if (dtype < SVt_PVIV)
3821 sv_upgrade(dstr, SVt_PVIV);
3824 if (dtype < SVt_PVNV)
3825 sv_upgrade(dstr, SVt_PVNV);
3832 const char * const type = sv_reftype(sstr,0);
3834 Perl_croak(aTHX_ "Bizarre copy of %s in %s", type, OP_NAME(PL_op));
3836 Perl_croak(aTHX_ "Bizarre copy of %s", type);
3841 if (dtype <= SVt_PVGV) {
3843 if (dtype != SVt_PVGV) {
3844 const char * const name = GvNAME(sstr);
3845 const STRLEN len = GvNAMELEN(sstr);
3846 /* don't upgrade SVt_PVLV: it can hold a glob */
3847 if (dtype != SVt_PVLV)
3848 sv_upgrade(dstr, SVt_PVGV);
3849 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3850 GvSTASH(dstr) = GvSTASH(sstr);
3852 Perl_sv_add_backref(aTHX_ (SV*)GvSTASH(dstr), dstr);
3853 GvNAME(dstr) = savepvn(name, len);
3854 GvNAMELEN(dstr) = len;
3855 SvFAKE_on(dstr); /* can coerce to non-glob */
3857 /* ahem, death to those who redefine active sort subs */
3858 else if (PL_curstackinfo->si_type == PERLSI_SORT
3859 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3860 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3863 #ifdef GV_UNIQUE_CHECK
3864 if (GvUNIQUE((GV*)dstr)) {
3865 Perl_croak(aTHX_ PL_no_modify);
3869 (void)SvOK_off(dstr);
3870 GvINTRO_off(dstr); /* one-shot flag */
3872 GvGP(dstr) = gp_ref(GvGP(sstr));
3873 if (SvTAINTED(sstr))
3875 if (GvIMPORTED(dstr) != GVf_IMPORTED
3876 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3878 GvIMPORTED_on(dstr);
3886 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3888 if ((int)SvTYPE(sstr) != stype) {
3889 stype = SvTYPE(sstr);
3890 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3894 if (stype == SVt_PVLV)
3895 SvUPGRADE(dstr, SVt_PVNV);
3897 SvUPGRADE(dstr, (U32)stype);
3900 sflags = SvFLAGS(sstr);
3902 if (sflags & SVf_ROK) {
3903 if (dtype >= SVt_PV) {
3904 if (dtype == SVt_PVGV) {
3905 SV *sref = SvREFCNT_inc(SvRV(sstr));
3907 const int intro = GvINTRO(dstr);
3909 #ifdef GV_UNIQUE_CHECK
3910 if (GvUNIQUE((GV*)dstr)) {
3911 Perl_croak(aTHX_ PL_no_modify);
3916 GvINTRO_off(dstr); /* one-shot flag */
3917 GvLINE(dstr) = CopLINE(PL_curcop);
3918 GvEGV(dstr) = (GV*)dstr;
3921 switch (SvTYPE(sref)) {
3924 SAVEGENERICSV(GvAV(dstr));
3926 dref = (SV*)GvAV(dstr);
3927 GvAV(dstr) = (AV*)sref;
3928 if (!GvIMPORTED_AV(dstr)
3929 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3931 GvIMPORTED_AV_on(dstr);
3936 SAVEGENERICSV(GvHV(dstr));
3938 dref = (SV*)GvHV(dstr);
3939 GvHV(dstr) = (HV*)sref;
3940 if (!GvIMPORTED_HV(dstr)
3941 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3943 GvIMPORTED_HV_on(dstr);
3948 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3949 SvREFCNT_dec(GvCV(dstr));
3950 GvCV(dstr) = Nullcv;
3951 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3952 PL_sub_generation++;
3954 SAVEGENERICSV(GvCV(dstr));
3957 dref = (SV*)GvCV(dstr);
3958 if (GvCV(dstr) != (CV*)sref) {
3959 CV* cv = GvCV(dstr);
3961 if (!GvCVGEN((GV*)dstr) &&
3962 (CvROOT(cv) || CvXSUB(cv)))
3964 /* ahem, death to those who redefine
3965 * active sort subs */
3966 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3967 PL_sortcop == CvSTART(cv))
3969 "Can't redefine active sort subroutine %s",
3970 GvENAME((GV*)dstr));
3971 /* Redefining a sub - warning is mandatory if
3972 it was a const and its value changed. */
3973 if (ckWARN(WARN_REDEFINE)
3975 && (!CvCONST((CV*)sref)
3976 || sv_cmp(cv_const_sv(cv),
3977 cv_const_sv((CV*)sref)))))
3979 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3981 ? "Constant subroutine %s::%s redefined"
3982 : "Subroutine %s::%s redefined",
3983 HvNAME_get(GvSTASH((GV*)dstr)),
3984 GvENAME((GV*)dstr));
3988 cv_ckproto(cv, (GV*)dstr,
3990 ? SvPVX_const(sref) : Nullch);
3992 GvCV(dstr) = (CV*)sref;
3993 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3994 GvASSUMECV_on(dstr);
3995 PL_sub_generation++;
3997 if (!GvIMPORTED_CV(dstr)
3998 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4000 GvIMPORTED_CV_on(dstr);
4005 SAVEGENERICSV(GvIOp(dstr));
4007 dref = (SV*)GvIOp(dstr);
4008 GvIOp(dstr) = (IO*)sref;
4012 SAVEGENERICSV(GvFORM(dstr));
4014 dref = (SV*)GvFORM(dstr);
4015 GvFORM(dstr) = (CV*)sref;
4019 SAVEGENERICSV(GvSV(dstr));
4021 dref = (SV*)GvSV(dstr);
4023 if (!GvIMPORTED_SV(dstr)
4024 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
4026 GvIMPORTED_SV_on(dstr);
4032 if (SvTAINTED(sstr))
4036 if (SvPVX_const(dstr)) {
4042 (void)SvOK_off(dstr);
4043 SvRV_set(dstr, SvREFCNT_inc(SvRV(sstr)));
4045 if (sflags & SVp_NOK) {
4047 /* Only set the public OK flag if the source has public OK. */
4048 if (sflags & SVf_NOK)
4049 SvFLAGS(dstr) |= SVf_NOK;
4050 SvNV_set(dstr, SvNVX(sstr));
4052 if (sflags & SVp_IOK) {
4053 (void)SvIOKp_on(dstr);
4054 if (sflags & SVf_IOK)
4055 SvFLAGS(dstr) |= SVf_IOK;
4056 if (sflags & SVf_IVisUV)
4058 SvIV_set(dstr, SvIVX(sstr));
4060 if (SvAMAGIC(sstr)) {
4064 else if (sflags & SVp_POK) {
4068 * Check to see if we can just swipe the string. If so, it's a
4069 * possible small lose on short strings, but a big win on long ones.
4070 * It might even be a win on short strings if SvPVX_const(dstr)
4071 * has to be allocated and SvPVX_const(sstr) has to be freed.
4074 /* Whichever path we take through the next code, we want this true,
4075 and doing it now facilitates the COW check. */
4076 (void)SvPOK_only(dstr);
4079 /* We're not already COW */
4080 ((sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4081 #ifndef PERL_OLD_COPY_ON_WRITE
4082 /* or we are, but dstr isn't a suitable target. */
4083 || (SvFLAGS(dstr) & CAN_COW_MASK) != CAN_COW_FLAGS
4088 (sflags & SVs_TEMP) && /* slated for free anyway? */
4089 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4090 (!(flags & SV_NOSTEAL)) &&
4091 /* and we're allowed to steal temps */
4092 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4093 SvLEN(sstr) && /* and really is a string */
4094 /* and won't be needed again, potentially */
4095 !(PL_op && PL_op->op_type == OP_AASSIGN))
4096 #ifdef PERL_OLD_COPY_ON_WRITE
4097 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4098 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4099 && SvTYPE(sstr) >= SVt_PVIV)
4102 /* Failed the swipe test, and it's not a shared hash key either.
4103 Have to copy the string. */
4104 STRLEN len = SvCUR(sstr);
4105 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4106 Move(SvPVX_const(sstr),SvPVX(dstr),len,char);
4107 SvCUR_set(dstr, len);
4108 *SvEND(dstr) = '\0';
4110 /* If PERL_OLD_COPY_ON_WRITE is not defined, then isSwipe will always
4112 /* Either it's a shared hash key, or it's suitable for
4113 copy-on-write or we can swipe the string. */
4115 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4119 #ifdef PERL_OLD_COPY_ON_WRITE
4121 /* I believe I should acquire a global SV mutex if
4122 it's a COW sv (not a shared hash key) to stop
4123 it going un copy-on-write.
4124 If the source SV has gone un copy on write between up there
4125 and down here, then (assert() that) it is of the correct
4126 form to make it copy on write again */
4127 if ((sflags & (SVf_FAKE | SVf_READONLY))
4128 != (SVf_FAKE | SVf_READONLY)) {
4129 SvREADONLY_on(sstr);
4131 /* Make the source SV into a loop of 1.
4132 (about to become 2) */
4133 SV_COW_NEXT_SV_SET(sstr, sstr);
4137 /* Initial code is common. */
4138 if (SvPVX_const(dstr)) { /* we know that dtype >= SVt_PV */
4143 /* making another shared SV. */
4144 STRLEN cur = SvCUR(sstr);
4145 STRLEN len = SvLEN(sstr);
4146 #ifdef PERL_OLD_COPY_ON_WRITE
4148 assert (SvTYPE(dstr) >= SVt_PVIV);
4149 /* SvIsCOW_normal */
4150 /* splice us in between source and next-after-source. */
4151 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4152 SV_COW_NEXT_SV_SET(sstr, dstr);
4153 SvPV_set(dstr, SvPVX_mutable(sstr));
4157 /* SvIsCOW_shared_hash */
4158 DEBUG_C(PerlIO_printf(Perl_debug_log,
4159 "Copy on write: Sharing hash\n"));
4161 assert (SvTYPE(dstr) >= SVt_PV);
4163 HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)))));
4165 SvLEN_set(dstr, len);
4166 SvCUR_set(dstr, cur);
4167 SvREADONLY_on(dstr);
4169 /* Relesase a global SV mutex. */
4172 { /* Passes the swipe test. */
4173 SvPV_set(dstr, SvPVX_mutable(sstr));
4174 SvLEN_set(dstr, SvLEN(sstr));
4175 SvCUR_set(dstr, SvCUR(sstr));
4178 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4179 SvPV_set(sstr, Nullch);
4185 if (sflags & SVf_UTF8)
4187 if (sflags & SVp_NOK) {
4189 if (sflags & SVf_NOK)
4190 SvFLAGS(dstr) |= SVf_NOK;
4191 SvNV_set(dstr, SvNVX(sstr));
4193 if (sflags & SVp_IOK) {
4194 (void)SvIOKp_on(dstr);
4195 if (sflags & SVf_IOK)
4196 SvFLAGS(dstr) |= SVf_IOK;
4197 if (sflags & SVf_IVisUV)
4199 SvIV_set(dstr, SvIVX(sstr));
4202 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4203 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4204 smg->mg_ptr, smg->mg_len);
4205 SvRMAGICAL_on(dstr);
4208 else if (sflags & SVp_IOK) {
4209 if (sflags & SVf_IOK)
4210 (void)SvIOK_only(dstr);
4212 (void)SvOK_off(dstr);
4213 (void)SvIOKp_on(dstr);
4215 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4216 if (sflags & SVf_IVisUV)
4218 SvIV_set(dstr, SvIVX(sstr));
4219 if (sflags & SVp_NOK) {
4220 if (sflags & SVf_NOK)
4221 (void)SvNOK_on(dstr);
4223 (void)SvNOKp_on(dstr);
4224 SvNV_set(dstr, SvNVX(sstr));
4227 else if (sflags & SVp_NOK) {
4228 if (sflags & SVf_NOK)
4229 (void)SvNOK_only(dstr);
4231 (void)SvOK_off(dstr);
4234 SvNV_set(dstr, SvNVX(sstr));
4237 if (dtype == SVt_PVGV) {
4238 if (ckWARN(WARN_MISC))
4239 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4242 (void)SvOK_off(dstr);
4244 if (SvTAINTED(sstr))
4249 =for apidoc sv_setsv_mg
4251 Like C<sv_setsv>, but also handles 'set' magic.
4257 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4259 sv_setsv(dstr,sstr);
4263 #ifdef PERL_OLD_COPY_ON_WRITE
4265 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4267 STRLEN cur = SvCUR(sstr);
4268 STRLEN len = SvLEN(sstr);
4269 register char *new_pv;
4272 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4280 if (SvTHINKFIRST(dstr))
4281 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4282 else if (SvPVX_const(dstr))
4283 Safefree(SvPVX_const(dstr));
4287 SvUPGRADE(dstr, SVt_PVIV);
4289 assert (SvPOK(sstr));
4290 assert (SvPOKp(sstr));
4291 assert (!SvIOK(sstr));
4292 assert (!SvIOKp(sstr));
4293 assert (!SvNOK(sstr));
4294 assert (!SvNOKp(sstr));
4296 if (SvIsCOW(sstr)) {
4298 if (SvLEN(sstr) == 0) {
4299 /* source is a COW shared hash key. */
4300 DEBUG_C(PerlIO_printf(Perl_debug_log,
4301 "Fast copy on write: Sharing hash\n"));
4302 new_pv = HEK_KEY(share_hek_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr))));
4305 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4307 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4308 SvUPGRADE(sstr, SVt_PVIV);
4309 SvREADONLY_on(sstr);
4311 DEBUG_C(PerlIO_printf(Perl_debug_log,
4312 "Fast copy on write: Converting sstr to COW\n"));
4313 SV_COW_NEXT_SV_SET(dstr, sstr);
4315 SV_COW_NEXT_SV_SET(sstr, dstr);
4316 new_pv = SvPVX_mutable(sstr);
4319 SvPV_set(dstr, new_pv);
4320 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4323 SvLEN_set(dstr, len);
4324 SvCUR_set(dstr, cur);
4333 =for apidoc sv_setpvn
4335 Copies a string into an SV. The C<len> parameter indicates the number of
4336 bytes to be copied. If the C<ptr> argument is NULL the SV will become
4337 undefined. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4343 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4345 register char *dptr;
4347 SV_CHECK_THINKFIRST_COW_DROP(sv);
4353 /* len is STRLEN which is unsigned, need to copy to signed */
4356 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4358 SvUPGRADE(sv, SVt_PV);
4360 dptr = SvGROW(sv, len + 1);
4361 Move(ptr,dptr,len,char);
4364 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4369 =for apidoc sv_setpvn_mg
4371 Like C<sv_setpvn>, but also handles 'set' magic.
4377 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4379 sv_setpvn(sv,ptr,len);
4384 =for apidoc sv_setpv
4386 Copies a string into an SV. The string must be null-terminated. Does not
4387 handle 'set' magic. See C<sv_setpv_mg>.
4393 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4395 register STRLEN len;
4397 SV_CHECK_THINKFIRST_COW_DROP(sv);
4403 SvUPGRADE(sv, SVt_PV);
4405 SvGROW(sv, len + 1);
4406 Move(ptr,SvPVX(sv),len+1,char);
4408 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4413 =for apidoc sv_setpv_mg
4415 Like C<sv_setpv>, but also handles 'set' magic.
4421 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4428 =for apidoc sv_usepvn
4430 Tells an SV to use C<ptr> to find its string value. Normally the string is
4431 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4432 The C<ptr> should point to memory that was allocated by C<malloc>. The
4433 string length, C<len>, must be supplied. This function will realloc the
4434 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4435 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4436 See C<sv_usepvn_mg>.
4442 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4445 SV_CHECK_THINKFIRST_COW_DROP(sv);
4446 SvUPGRADE(sv, SVt_PV);
4451 if (SvPVX_const(sv))
4454 allocate = PERL_STRLEN_ROUNDUP(len + 1);
4455 ptr = saferealloc (ptr, allocate);
4458 SvLEN_set(sv, allocate);
4460 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4465 =for apidoc sv_usepvn_mg
4467 Like C<sv_usepvn>, but also handles 'set' magic.
4473 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4475 sv_usepvn(sv,ptr,len);
4479 #ifdef PERL_OLD_COPY_ON_WRITE
4480 /* Need to do this *after* making the SV normal, as we need the buffer
4481 pointer to remain valid until after we've copied it. If we let go too early,
4482 another thread could invalidate it by unsharing last of the same hash key
4483 (which it can do by means other than releasing copy-on-write Svs)
4484 or by changing the other copy-on-write SVs in the loop. */
4486 S_sv_release_COW(pTHX_ register SV *sv, const char *pvx, STRLEN len, SV *after)
4488 if (len) { /* this SV was SvIsCOW_normal(sv) */
4489 /* we need to find the SV pointing to us. */
4490 SV *current = SV_COW_NEXT_SV(after);
4492 if (current == sv) {
4493 /* The SV we point to points back to us (there were only two of us
4495 Hence other SV is no longer copy on write either. */
4497 SvREADONLY_off(after);
4499 /* We need to follow the pointers around the loop. */
4501 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4504 /* don't loop forever if the structure is bust, and we have
4505 a pointer into a closed loop. */
4506 assert (current != after);
4507 assert (SvPVX_const(current) == pvx);
4509 /* Make the SV before us point to the SV after us. */
4510 SV_COW_NEXT_SV_SET(current, after);
4513 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4518 Perl_sv_release_IVX(pTHX_ register SV *sv)
4521 sv_force_normal_flags(sv, 0);
4527 =for apidoc sv_force_normal_flags
4529 Undo various types of fakery on an SV: if the PV is a shared string, make
4530 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4531 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4532 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4533 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4534 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4535 set to some other value.) In addition, the C<flags> parameter gets passed to
4536 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4537 with flags set to 0.
4543 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4545 #ifdef PERL_OLD_COPY_ON_WRITE
4546 if (SvREADONLY(sv)) {
4547 /* At this point I believe I should acquire a global SV mutex. */
4549 const char *pvx = SvPVX_const(sv);
4550 const STRLEN len = SvLEN(sv);
4551 const STRLEN cur = SvCUR(sv);
4552 SV * const next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4554 PerlIO_printf(Perl_debug_log,
4555 "Copy on write: Force normal %ld\n",
4561 /* This SV doesn't own the buffer, so need to New() a new one: */
4562 SvPV_set(sv, (char*)0);
4564 if (flags & SV_COW_DROP_PV) {
4565 /* OK, so we don't need to copy our buffer. */
4568 SvGROW(sv, cur + 1);
4569 Move(pvx,SvPVX(sv),cur,char);
4573 sv_release_COW(sv, pvx, len, next);
4578 else if (IN_PERL_RUNTIME)
4579 Perl_croak(aTHX_ PL_no_modify);
4580 /* At this point I believe that I can drop the global SV mutex. */
4583 if (SvREADONLY(sv)) {
4585 const char *pvx = SvPVX_const(sv);
4586 const STRLEN len = SvCUR(sv);
4589 SvPV_set(sv, Nullch);
4591 SvGROW(sv, len + 1);
4592 Move(pvx,SvPVX_const(sv),len,char);
4594 unshare_hek(SvSHARED_HEK_FROM_PV(pvx));
4596 else if (IN_PERL_RUNTIME)
4597 Perl_croak(aTHX_ PL_no_modify);
4601 sv_unref_flags(sv, flags);
4602 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4607 =for apidoc sv_force_normal
4609 Undo various types of fakery on an SV: if the PV is a shared string, make
4610 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4611 an xpvmg. See also C<sv_force_normal_flags>.
4617 Perl_sv_force_normal(pTHX_ register SV *sv)
4619 sv_force_normal_flags(sv, 0);
4625 Efficient removal of characters from the beginning of the string buffer.
4626 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4627 the string buffer. The C<ptr> becomes the first character of the adjusted
4628 string. Uses the "OOK hack".
4629 Beware: after this function returns, C<ptr> and SvPVX_const(sv) may no longer
4630 refer to the same chunk of data.
4636 Perl_sv_chop(pTHX_ register SV *sv, register const char *ptr)
4638 register STRLEN delta;
4639 if (!ptr || !SvPOKp(sv))
4641 delta = ptr - SvPVX_const(sv);
4642 SV_CHECK_THINKFIRST(sv);
4643 if (SvTYPE(sv) < SVt_PVIV)
4644 sv_upgrade(sv,SVt_PVIV);
4647 if (!SvLEN(sv)) { /* make copy of shared string */
4648 const char *pvx = SvPVX_const(sv);
4649 const STRLEN len = SvCUR(sv);
4650 SvGROW(sv, len + 1);
4651 Move(pvx,SvPVX_const(sv),len,char);
4655 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4656 and we do that anyway inside the SvNIOK_off
4658 SvFLAGS(sv) |= SVf_OOK;
4661 SvLEN_set(sv, SvLEN(sv) - delta);
4662 SvCUR_set(sv, SvCUR(sv) - delta);
4663 SvPV_set(sv, SvPVX(sv) + delta);
4664 SvIV_set(sv, SvIVX(sv) + delta);
4667 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4668 * this function provided for binary compatibility only
4672 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4674 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4678 =for apidoc sv_catpvn
4680 Concatenates the string onto the end of the string which is in the SV. The
4681 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4682 status set, then the bytes appended should be valid UTF-8.
4683 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4685 =for apidoc sv_catpvn_flags
4687 Concatenates the string onto the end of the string which is in the SV. The
4688 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4689 status set, then the bytes appended should be valid UTF-8.
4690 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4691 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4692 in terms of this function.
4698 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4701 const char *dstr = SvPV_force_flags(dsv, dlen, flags);
4703 SvGROW(dsv, dlen + slen + 1);
4705 sstr = SvPVX_const(dsv);
4706 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4707 SvCUR_set(dsv, SvCUR(dsv) + slen);
4709 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4714 =for apidoc sv_catpvn_mg
4716 Like C<sv_catpvn>, but also handles 'set' magic.
4722 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4724 sv_catpvn(sv,ptr,len);
4728 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4729 * this function provided for binary compatibility only
4733 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4735 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4739 =for apidoc sv_catsv
4741 Concatenates the string from SV C<ssv> onto the end of the string in
4742 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4743 not 'set' magic. See C<sv_catsv_mg>.
4745 =for apidoc sv_catsv_flags
4747 Concatenates the string from SV C<ssv> onto the end of the string in
4748 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4749 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4750 and C<sv_catsv_nomg> are implemented in terms of this function.
4755 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4761 if ((spv = SvPV_const(ssv, slen))) {
4762 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4763 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4764 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4765 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4766 dsv->sv_flags doesn't have that bit set.
4767 Andy Dougherty 12 Oct 2001
4769 const I32 sutf8 = DO_UTF8(ssv);
4772 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4774 dutf8 = DO_UTF8(dsv);
4776 if (dutf8 != sutf8) {
4778 /* Not modifying source SV, so taking a temporary copy. */
4779 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4781 sv_utf8_upgrade(csv);
4782 spv = SvPV_const(csv, slen);
4785 sv_utf8_upgrade_nomg(dsv);
4787 sv_catpvn_nomg(dsv, spv, slen);
4792 =for apidoc sv_catsv_mg
4794 Like C<sv_catsv>, but also handles 'set' magic.
4800 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4807 =for apidoc sv_catpv
4809 Concatenates the string onto the end of the string which is in the SV.
4810 If the SV has the UTF-8 status set, then the bytes appended should be
4811 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4816 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4818 register STRLEN len;
4824 junk = SvPV_force(sv, tlen);
4826 SvGROW(sv, tlen + len + 1);
4828 ptr = SvPVX_const(sv);
4829 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4830 SvCUR_set(sv, SvCUR(sv) + len);
4831 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4836 =for apidoc sv_catpv_mg
4838 Like C<sv_catpv>, but also handles 'set' magic.
4844 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4853 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4854 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4861 Perl_newSV(pTHX_ STRLEN len)
4867 sv_upgrade(sv, SVt_PV);
4868 SvGROW(sv, len + 1);
4873 =for apidoc sv_magicext
4875 Adds magic to an SV, upgrading it if necessary. Applies the
4876 supplied vtable and returns a pointer to the magic added.
4878 Note that C<sv_magicext> will allow things that C<sv_magic> will not.
4879 In particular, you can add magic to SvREADONLY SVs, and add more than
4880 one instance of the same 'how'.
4882 If C<namlen> is greater than zero then a C<savepvn> I<copy> of C<name> is
4883 stored, if C<namlen> is zero then C<name> is stored as-is and - as another
4884 special case - if C<(name && namlen == HEf_SVKEY)> then C<name> is assumed
4885 to contain an C<SV*> and is stored as-is with its REFCNT incremented.
4887 (This is now used as a subroutine by C<sv_magic>.)
4892 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, const MGVTBL *vtable,
4893 const char* name, I32 namlen)
4897 if (SvTYPE(sv) < SVt_PVMG) {
4898 SvUPGRADE(sv, SVt_PVMG);
4900 Newz(702,mg, 1, MAGIC);
4901 mg->mg_moremagic = SvMAGIC(sv);
4902 SvMAGIC_set(sv, mg);
4904 /* Sometimes a magic contains a reference loop, where the sv and
4905 object refer to each other. To prevent a reference loop that
4906 would prevent such objects being freed, we look for such loops
4907 and if we find one we avoid incrementing the object refcount.
4909 Note we cannot do this to avoid self-tie loops as intervening RV must
4910 have its REFCNT incremented to keep it in existence.
4913 if (!obj || obj == sv ||
4914 how == PERL_MAGIC_arylen ||
4915 how == PERL_MAGIC_qr ||
4916 how == PERL_MAGIC_symtab ||
4917 (SvTYPE(obj) == SVt_PVGV &&
4918 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4919 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4920 GvFORM(obj) == (CV*)sv)))
4925 mg->mg_obj = SvREFCNT_inc(obj);
4926 mg->mg_flags |= MGf_REFCOUNTED;
4929 /* Normal self-ties simply pass a null object, and instead of
4930 using mg_obj directly, use the SvTIED_obj macro to produce a
4931 new RV as needed. For glob "self-ties", we are tieing the PVIO
4932 with an RV obj pointing to the glob containing the PVIO. In
4933 this case, to avoid a reference loop, we need to weaken the
4937 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4938 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4944 mg->mg_len = namlen;
4947 mg->mg_ptr = savepvn(name, namlen);
4948 else if (namlen == HEf_SVKEY)
4949 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4951 mg->mg_ptr = (char *) name;
4953 mg->mg_virtual = vtable;
4957 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4962 =for apidoc sv_magic
4964 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4965 then adds a new magic item of type C<how> to the head of the magic list.
4967 See C<sv_magicext> (which C<sv_magic> now calls) for a description of the
4968 handling of the C<name> and C<namlen> arguments.
4970 You need to use C<sv_magicext> to add magic to SvREADONLY SVs and also
4971 to add more than one instance of the same 'how'.
4977 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4979 const MGVTBL *vtable = 0;
4982 #ifdef PERL_OLD_COPY_ON_WRITE
4984 sv_force_normal_flags(sv, 0);
4986 if (SvREADONLY(sv)) {
4988 && how != PERL_MAGIC_regex_global
4989 && how != PERL_MAGIC_bm
4990 && how != PERL_MAGIC_fm
4991 && how != PERL_MAGIC_sv
4992 && how != PERL_MAGIC_backref
4995 Perl_croak(aTHX_ PL_no_modify);
4998 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4999 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
5000 /* sv_magic() refuses to add a magic of the same 'how' as an
5003 if (how == PERL_MAGIC_taint)
5011 vtable = &PL_vtbl_sv;
5013 case PERL_MAGIC_overload:
5014 vtable = &PL_vtbl_amagic;
5016 case PERL_MAGIC_overload_elem:
5017 vtable = &PL_vtbl_amagicelem;
5019 case PERL_MAGIC_overload_table:
5020 vtable = &PL_vtbl_ovrld;
5023 vtable = &PL_vtbl_bm;
5025 case PERL_MAGIC_regdata:
5026 vtable = &PL_vtbl_regdata;
5028 case PERL_MAGIC_regdatum:
5029 vtable = &PL_vtbl_regdatum;
5031 case PERL_MAGIC_env:
5032 vtable = &PL_vtbl_env;
5035 vtable = &PL_vtbl_fm;
5037 case PERL_MAGIC_envelem:
5038 vtable = &PL_vtbl_envelem;
5040 case PERL_MAGIC_regex_global:
5041 vtable = &PL_vtbl_mglob;
5043 case PERL_MAGIC_isa:
5044 vtable = &PL_vtbl_isa;
5046 case PERL_MAGIC_isaelem:
5047 vtable = &PL_vtbl_isaelem;
5049 case PERL_MAGIC_nkeys:
5050 vtable = &PL_vtbl_nkeys;
5052 case PERL_MAGIC_dbfile:
5055 case PERL_MAGIC_dbline:
5056 vtable = &PL_vtbl_dbline;
5058 #ifdef USE_LOCALE_COLLATE
5059 case PERL_MAGIC_collxfrm:
5060 vtable = &PL_vtbl_collxfrm;
5062 #endif /* USE_LOCALE_COLLATE */
5063 case PERL_MAGIC_tied:
5064 vtable = &PL_vtbl_pack;
5066 case PERL_MAGIC_tiedelem:
5067 case PERL_MAGIC_tiedscalar:
5068 vtable = &PL_vtbl_packelem;
5071 vtable = &PL_vtbl_regexp;
5073 case PERL_MAGIC_sig:
5074 vtable = &PL_vtbl_sig;
5076 case PERL_MAGIC_sigelem:
5077 vtable = &PL_vtbl_sigelem;
5079 case PERL_MAGIC_taint:
5080 vtable = &PL_vtbl_taint;
5082 case PERL_MAGIC_uvar:
5083 vtable = &PL_vtbl_uvar;
5085 case PERL_MAGIC_vec:
5086 vtable = &PL_vtbl_vec;
5088 case PERL_MAGIC_arylen_p:
5089 case PERL_MAGIC_rhash:
5090 case PERL_MAGIC_symtab:
5091 case PERL_MAGIC_vstring:
5094 case PERL_MAGIC_utf8:
5095 vtable = &PL_vtbl_utf8;
5097 case PERL_MAGIC_substr:
5098 vtable = &PL_vtbl_substr;
5100 case PERL_MAGIC_defelem:
5101 vtable = &PL_vtbl_defelem;
5103 case PERL_MAGIC_glob:
5104 vtable = &PL_vtbl_glob;
5106 case PERL_MAGIC_arylen:
5107 vtable = &PL_vtbl_arylen;
5109 case PERL_MAGIC_pos:
5110 vtable = &PL_vtbl_pos;
5112 case PERL_MAGIC_backref:
5113 vtable = &PL_vtbl_backref;
5115 case PERL_MAGIC_ext:
5116 /* Reserved for use by extensions not perl internals. */
5117 /* Useful for attaching extension internal data to perl vars. */
5118 /* Note that multiple extensions may clash if magical scalars */
5119 /* etc holding private data from one are passed to another. */
5122 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5125 /* Rest of work is done else where */
5126 mg = sv_magicext(sv,obj,how,(MGVTBL*)vtable,name,namlen);
5129 case PERL_MAGIC_taint:
5132 case PERL_MAGIC_ext:
5133 case PERL_MAGIC_dbfile:
5140 =for apidoc sv_unmagic
5142 Removes all magic of type C<type> from an SV.
5148 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5152 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5155 for (mg = *mgp; mg; mg = *mgp) {
5156 if (mg->mg_type == type) {
5157 const MGVTBL* const vtbl = mg->mg_virtual;
5158 *mgp = mg->mg_moremagic;
5159 if (vtbl && vtbl->svt_free)
5160 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5161 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5163 Safefree(mg->mg_ptr);
5164 else if (mg->mg_len == HEf_SVKEY)
5165 SvREFCNT_dec((SV*)mg->mg_ptr);
5166 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5167 Safefree(mg->mg_ptr);
5169 if (mg->mg_flags & MGf_REFCOUNTED)
5170 SvREFCNT_dec(mg->mg_obj);
5174 mgp = &mg->mg_moremagic;
5178 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5185 =for apidoc sv_rvweaken
5187 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5188 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5189 push a back-reference to this RV onto the array of backreferences
5190 associated with that magic.
5196 Perl_sv_rvweaken(pTHX_ SV *sv)
5199 if (!SvOK(sv)) /* let undefs pass */
5202 Perl_croak(aTHX_ "Can't weaken a nonreference");
5203 else if (SvWEAKREF(sv)) {
5204 if (ckWARN(WARN_MISC))
5205 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5209 Perl_sv_add_backref(aTHX_ tsv, sv);
5215 /* Give tsv backref magic if it hasn't already got it, then push a
5216 * back-reference to sv onto the array associated with the backref magic.
5220 Perl_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5224 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5225 av = (AV*)mg->mg_obj;
5228 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5229 /* av now has a refcnt of 2, which avoids it getting freed
5230 * before us during global cleanup. The extra ref is removed
5231 * by magic_killbackrefs() when tsv is being freed */
5233 if (AvFILLp(av) >= AvMAX(av)) {
5234 av_extend(av, AvFILLp(av)+1);
5236 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5239 /* delete a back-reference to ourselves from the backref magic associated
5240 * with the SV we point to.
5244 S_sv_del_backref(pTHX_ SV *tsv, SV *sv)
5250 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref))) {
5251 if (PL_in_clean_all)
5254 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5255 Perl_croak(aTHX_ "panic: del_backref");
5256 av = (AV *)mg->mg_obj;
5258 /* We shouldn't be in here more than once, but for paranoia reasons lets
5260 for (i = AvFILLp(av); i >= 0; i--) {
5262 const SSize_t fill = AvFILLp(av);
5264 /* We weren't the last entry.
5265 An unordered list has this property that you can take the
5266 last element off the end to fill the hole, and it's still
5267 an unordered list :-)
5272 AvFILLp(av) = fill - 1;
5278 =for apidoc sv_insert
5280 Inserts a string at the specified offset/length within the SV. Similar to
5281 the Perl substr() function.
5287 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, const char *little, STRLEN littlelen)
5291 register char *midend;
5292 register char *bigend;
5298 Perl_croak(aTHX_ "Can't modify non-existent substring");
5299 SvPV_force(bigstr, curlen);
5300 (void)SvPOK_only_UTF8(bigstr);
5301 if (offset + len > curlen) {
5302 SvGROW(bigstr, offset+len+1);
5303 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5304 SvCUR_set(bigstr, offset+len);
5308 i = littlelen - len;
5309 if (i > 0) { /* string might grow */
5310 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5311 mid = big + offset + len;
5312 midend = bigend = big + SvCUR(bigstr);
5315 while (midend > mid) /* shove everything down */
5316 *--bigend = *--midend;
5317 Move(little,big+offset,littlelen,char);
5318 SvCUR_set(bigstr, SvCUR(bigstr) + i);
5323 Move(little,SvPVX(bigstr)+offset,len,char);
5328 big = SvPVX(bigstr);
5331 bigend = big + SvCUR(bigstr);
5333 if (midend > bigend)
5334 Perl_croak(aTHX_ "panic: sv_insert");
5336 if (mid - big > bigend - midend) { /* faster to shorten from end */
5338 Move(little, mid, littlelen,char);
5341 i = bigend - midend;
5343 Move(midend, mid, i,char);
5347 SvCUR_set(bigstr, mid - big);
5349 else if ((i = mid - big)) { /* faster from front */
5350 midend -= littlelen;
5352 sv_chop(bigstr,midend-i);
5357 Move(little, mid, littlelen,char);
5359 else if (littlelen) {
5360 midend -= littlelen;
5361 sv_chop(bigstr,midend);
5362 Move(little,midend,littlelen,char);
5365 sv_chop(bigstr,midend);
5371 =for apidoc sv_replace
5373 Make the first argument a copy of the second, then delete the original.
5374 The target SV physically takes over ownership of the body of the source SV
5375 and inherits its flags; however, the target keeps any magic it owns,
5376 and any magic in the source is discarded.
5377 Note that this is a rather specialist SV copying operation; most of the
5378 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5384 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5386 const U32 refcnt = SvREFCNT(sv);
5387 SV_CHECK_THINKFIRST_COW_DROP(sv);
5388 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5389 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5390 if (SvMAGICAL(sv)) {
5394 sv_upgrade(nsv, SVt_PVMG);
5395 SvMAGIC_set(nsv, SvMAGIC(sv));
5396 SvFLAGS(nsv) |= SvMAGICAL(sv);
5398 SvMAGIC_set(sv, NULL);
5402 assert(!SvREFCNT(sv));
5403 #ifdef DEBUG_LEAKING_SCALARS
5404 sv->sv_flags = nsv->sv_flags;
5405 sv->sv_any = nsv->sv_any;
5406 sv->sv_refcnt = nsv->sv_refcnt;
5407 sv->sv_u = nsv->sv_u;
5409 StructCopy(nsv,sv,SV);
5411 /* Currently could join these into one piece of pointer arithmetic, but
5412 it would be unclear. */
5413 if(SvTYPE(sv) == SVt_IV)
5415 = (XPVIV*)((char*)&(sv->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
5416 else if (SvTYPE(sv) == SVt_RV) {
5417 SvANY(sv) = &sv->sv_u.svu_rv;
5421 #ifdef PERL_OLD_COPY_ON_WRITE
5422 if (SvIsCOW_normal(nsv)) {
5423 /* We need to follow the pointers around the loop to make the
5424 previous SV point to sv, rather than nsv. */
5427 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5430 assert(SvPVX_const(current) == SvPVX_const(nsv));
5432 /* Make the SV before us point to the SV after us. */
5434 PerlIO_printf(Perl_debug_log, "previous is\n");
5436 PerlIO_printf(Perl_debug_log,
5437 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5438 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5440 SV_COW_NEXT_SV_SET(current, sv);
5443 SvREFCNT(sv) = refcnt;
5444 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5450 =for apidoc sv_clear
5452 Clear an SV: call any destructors, free up any memory used by the body,
5453 and free the body itself. The SV's head is I<not> freed, although
5454 its type is set to all 1's so that it won't inadvertently be assumed
5455 to be live during global destruction etc.
5456 This function should only be called when REFCNT is zero. Most of the time
5457 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5464 Perl_sv_clear(pTHX_ register SV *sv)
5469 assert(SvREFCNT(sv) == 0);
5472 if (PL_defstash) { /* Still have a symbol table? */
5476 stash = SvSTASH(sv);
5477 destructor = StashHANDLER(stash,DESTROY);
5479 SV* const tmpref = newRV(sv);
5480 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5482 PUSHSTACKi(PERLSI_DESTROY);
5487 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5493 if(SvREFCNT(tmpref) < 2) {
5494 /* tmpref is not kept alive! */
5496 SvRV_set(tmpref, NULL);
5499 SvREFCNT_dec(tmpref);
5501 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5505 if (PL_in_clean_objs)
5506 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5508 /* DESTROY gave object new lease on life */
5514 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5515 SvOBJECT_off(sv); /* Curse the object. */
5516 if (SvTYPE(sv) != SVt_PVIO)
5517 --PL_sv_objcount; /* XXX Might want something more general */
5520 if (SvTYPE(sv) >= SVt_PVMG) {
5523 if (SvTYPE(sv) == SVt_PVMG && SvFLAGS(sv) & SVpad_TYPED)
5524 SvREFCNT_dec(SvSTASH(sv));
5527 switch (SvTYPE(sv)) {
5530 IoIFP(sv) != PerlIO_stdin() &&
5531 IoIFP(sv) != PerlIO_stdout() &&
5532 IoIFP(sv) != PerlIO_stderr())
5534 io_close((IO*)sv, FALSE);
5536 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5537 PerlDir_close(IoDIRP(sv));
5538 IoDIRP(sv) = (DIR*)NULL;
5539 Safefree(IoTOP_NAME(sv));
5540 Safefree(IoFMT_NAME(sv));
5541 Safefree(IoBOTTOM_NAME(sv));
5556 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5557 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5558 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5559 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5561 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5562 SvREFCNT_dec(LvTARG(sv));
5566 Safefree(GvNAME(sv));
5567 /* cannot decrease stash refcount yet, as we might recursively delete
5568 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5569 of stash until current sv is completely gone.
5570 -- JohnPC, 27 Mar 1998 */
5571 stash = GvSTASH(sv);
5577 /* Don't bother with SvOOK_off(sv); as we're only going to free it. */
5579 SvPV_set(sv, SvPVX_mutable(sv) - SvIVX(sv));
5580 /* Don't even bother with turning off the OOK flag. */
5586 SV *target = SvRV(sv);
5588 sv_del_backref(target, sv);
5590 SvREFCNT_dec(target);
5592 #ifdef PERL_OLD_COPY_ON_WRITE
5593 else if (SvPVX_const(sv)) {
5595 /* I believe I need to grab the global SV mutex here and
5596 then recheck the COW status. */
5598 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5601 sv_release_COW(sv, SvPVX_const(sv), SvLEN(sv),
5602 SV_COW_NEXT_SV(sv));
5603 /* And drop it here. */
5605 } else if (SvLEN(sv)) {
5606 Safefree(SvPVX_const(sv));
5610 else if (SvPVX_const(sv) && SvLEN(sv))
5611 Safefree(SvPVX_mutable(sv));
5612 else if (SvPVX_const(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5613 unshare_hek(SvSHARED_HEK_FROM_PV(SvPVX_const(sv)));
5626 switch (SvTYPE(sv)) {
5640 del_XPVIV(SvANY(sv));
5643 del_XPVNV(SvANY(sv));
5646 del_XPVMG(SvANY(sv));
5649 del_XPVLV(SvANY(sv));
5652 del_XPVAV(SvANY(sv));
5655 del_XPVHV(SvANY(sv));
5658 del_XPVCV(SvANY(sv));
5661 del_XPVGV(SvANY(sv));
5662 /* code duplication for increased performance. */
5663 SvFLAGS(sv) &= SVf_BREAK;
5664 SvFLAGS(sv) |= SVTYPEMASK;
5665 /* decrease refcount of the stash that owns this GV, if any */
5667 sv_del_backref((SV*)stash, sv);
5668 return; /* not break, SvFLAGS reset already happened */
5670 del_XPVBM(SvANY(sv));
5673 del_XPVFM(SvANY(sv));
5676 del_XPVIO(SvANY(sv));
5679 SvFLAGS(sv) &= SVf_BREAK;
5680 SvFLAGS(sv) |= SVTYPEMASK;
5684 =for apidoc sv_newref
5686 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5693 Perl_sv_newref(pTHX_ SV *sv)
5703 Decrement an SV's reference count, and if it drops to zero, call
5704 C<sv_clear> to invoke destructors and free up any memory used by
5705 the body; finally, deallocate the SV's head itself.
5706 Normally called via a wrapper macro C<SvREFCNT_dec>.
5712 Perl_sv_free(pTHX_ SV *sv)
5717 if (SvREFCNT(sv) == 0) {
5718 if (SvFLAGS(sv) & SVf_BREAK)
5719 /* this SV's refcnt has been artificially decremented to
5720 * trigger cleanup */
5722 if (PL_in_clean_all) /* All is fair */
5724 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5725 /* make sure SvREFCNT(sv)==0 happens very seldom */
5726 SvREFCNT(sv) = (~(U32)0)/2;
5729 if (ckWARN_d(WARN_INTERNAL)) {
5730 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5731 "Attempt to free unreferenced scalar: SV 0x%"UVxf
5732 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5733 #ifdef DEBUG_LEAKING_SCALARS_FORK_DUMP
5734 Perl_dump_sv_child(aTHX_ sv);
5739 if (--(SvREFCNT(sv)) > 0)
5741 Perl_sv_free2(aTHX_ sv);
5745 Perl_sv_free2(pTHX_ SV *sv)
5750 if (ckWARN_d(WARN_DEBUGGING))
5751 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5752 "Attempt to free temp prematurely: SV 0x%"UVxf
5753 pTHX__FORMAT, PTR2UV(sv) pTHX__VALUE);
5757 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5758 /* make sure SvREFCNT(sv)==0 happens very seldom */
5759 SvREFCNT(sv) = (~(U32)0)/2;
5770 Returns the length of the string in the SV. Handles magic and type
5771 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5777 Perl_sv_len(pTHX_ register SV *sv)
5785 len = mg_length(sv);
5787 (void)SvPV_const(sv, len);
5792 =for apidoc sv_len_utf8
5794 Returns the number of characters in the string in an SV, counting wide
5795 UTF-8 bytes as a single character. Handles magic and type coercion.
5801 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5802 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5803 * (Note that the mg_len is not the length of the mg_ptr field.)
5808 Perl_sv_len_utf8(pTHX_ register SV *sv)
5814 return mg_length(sv);
5818 const U8 *s = (U8*)SvPV_const(sv, len);
5819 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5821 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5823 #ifdef PERL_UTF8_CACHE_ASSERT
5824 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5828 ulen = Perl_utf8_length(aTHX_ s, s + len);
5829 if (!mg && !SvREADONLY(sv)) {
5830 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5831 mg = mg_find(sv, PERL_MAGIC_utf8);
5841 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5842 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5843 * between UTF-8 and byte offsets. There are two (substr offset and substr
5844 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5845 * and byte offset) cache positions.
5847 * The mg_len field is used by sv_len_utf8(), see its comments.
5848 * Note that the mg_len is not the length of the mg_ptr field.
5852 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i,
5853 I32 offsetp, const U8 *s, const U8 *start)
5857 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5859 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, (MGVTBL*)&PL_vtbl_utf8, 0, 0);
5863 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5865 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5866 (*mgp)->mg_ptr = (char *) *cachep;
5870 (*cachep)[i] = offsetp;
5871 (*cachep)[i+1] = s - start;
5879 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5880 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5881 * between UTF-8 and byte offsets. See also the comments of
5882 * S_utf8_mg_pos_init().
5886 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)
5890 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5892 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5893 if (*mgp && (*mgp)->mg_ptr) {
5894 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5895 ASSERT_UTF8_CACHE(*cachep);
5896 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5898 else { /* We will skip to the right spot. */
5903 /* The assumption is that going backward is half
5904 * the speed of going forward (that's where the
5905 * 2 * backw in the below comes from). (The real
5906 * figure of course depends on the UTF-8 data.) */
5908 if ((*cachep)[i] > (STRLEN)uoff) {
5910 backw = (*cachep)[i] - (STRLEN)uoff;
5912 if (forw < 2 * backw)
5915 p = start + (*cachep)[i+1];
5917 /* Try this only for the substr offset (i == 0),
5918 * not for the substr length (i == 2). */
5919 else if (i == 0) { /* (*cachep)[i] < uoff */
5920 const STRLEN ulen = sv_len_utf8(sv);
5922 if ((STRLEN)uoff < ulen) {
5923 forw = (STRLEN)uoff - (*cachep)[i];
5924 backw = ulen - (STRLEN)uoff;
5926 if (forw < 2 * backw)
5927 p = start + (*cachep)[i+1];
5932 /* If the string is not long enough for uoff,
5933 * we could extend it, but not at this low a level. */
5937 if (forw < 2 * backw) {
5944 while (UTF8_IS_CONTINUATION(*p))
5949 /* Update the cache. */
5950 (*cachep)[i] = (STRLEN)uoff;
5951 (*cachep)[i+1] = p - start;
5953 /* Drop the stale "length" cache */
5962 if (found) { /* Setup the return values. */
5963 *offsetp = (*cachep)[i+1];
5964 *sp = start + *offsetp;
5967 *offsetp = send - start;
5969 else if (*sp < start) {
5975 #ifdef PERL_UTF8_CACHE_ASSERT
5980 while (n-- && s < send)
5984 assert(*offsetp == s - start);
5985 assert((*cachep)[0] == (STRLEN)uoff);
5986 assert((*cachep)[1] == *offsetp);
5988 ASSERT_UTF8_CACHE(*cachep);
5997 =for apidoc sv_pos_u2b
5999 Converts the value pointed to by offsetp from a count of UTF-8 chars from
6000 the start of the string, to a count of the equivalent number of bytes; if
6001 lenp is non-zero, it does the same to lenp, but this time starting from
6002 the offset, rather than from the start of the string. Handles magic and
6009 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
6010 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6011 * byte offsets. See also the comments of S_utf8_mg_pos().
6016 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
6024 start = (U8*)SvPV_const(sv, len);
6028 const U8 *s = start;
6029 I32 uoffset = *offsetp;
6030 const U8 * const send = s + len;
6034 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
6036 if (!found && uoffset > 0) {
6037 while (s < send && uoffset--)
6041 if (utf8_mg_pos_init(sv, &mg, &cache, 0, *offsetp, s, start))
6043 *offsetp = s - start;
6048 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp, &s, start, send)) {
6052 if (!found && *lenp > 0) {
6055 while (s < send && ulen--)
6059 utf8_mg_pos_init(sv, &mg, &cache, 2, *lenp, s, start);
6063 ASSERT_UTF8_CACHE(cache);
6075 =for apidoc sv_pos_b2u
6077 Converts the value pointed to by offsetp from a count of bytes from the
6078 start of the string, to a count of the equivalent number of UTF-8 chars.
6079 Handles magic and type coercion.
6085 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6086 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6087 * byte offsets. See also the comments of S_utf8_mg_pos().
6092 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6100 s = (const U8*)SvPV_const(sv, len);
6101 if ((I32)len < *offsetp)
6102 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6104 const U8* send = s + *offsetp;
6106 STRLEN *cache = NULL;
6110 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6111 mg = mg_find(sv, PERL_MAGIC_utf8);
6112 if (mg && mg->mg_ptr) {
6113 cache = (STRLEN *) mg->mg_ptr;
6114 if (cache[1] == (STRLEN)*offsetp) {
6115 /* An exact match. */
6116 *offsetp = cache[0];
6120 else if (cache[1] < (STRLEN)*offsetp) {
6121 /* We already know part of the way. */
6124 /* Let the below loop do the rest. */
6126 else { /* cache[1] > *offsetp */
6127 /* We already know all of the way, now we may
6128 * be able to walk back. The same assumption
6129 * is made as in S_utf8_mg_pos(), namely that
6130 * walking backward is twice slower than
6131 * walking forward. */
6132 const STRLEN forw = *offsetp;
6133 STRLEN backw = cache[1] - *offsetp;
6135 if (!(forw < 2 * backw)) {
6136 const U8 *p = s + cache[1];
6143 while (UTF8_IS_CONTINUATION(*p)) {
6151 *offsetp = cache[0];
6153 /* Drop the stale "length" cache */
6161 ASSERT_UTF8_CACHE(cache);
6167 /* Call utf8n_to_uvchr() to validate the sequence
6168 * (unless a simple non-UTF character) */
6169 if (!UTF8_IS_INVARIANT(*s))
6170 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6179 if (!SvREADONLY(sv)) {
6181 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6182 mg = mg_find(sv, PERL_MAGIC_utf8);
6187 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6188 mg->mg_ptr = (char *) cache;
6193 cache[1] = *offsetp;
6194 /* Drop the stale "length" cache */
6207 Returns a boolean indicating whether the strings in the two SVs are
6208 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6209 coerce its args to strings if necessary.
6215 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6223 SV* svrecode = Nullsv;
6230 pv1 = SvPV_const(sv1, cur1);
6237 pv2 = SvPV_const(sv2, cur2);
6239 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6240 /* Differing utf8ness.
6241 * Do not UTF8size the comparands as a side-effect. */
6244 svrecode = newSVpvn(pv2, cur2);
6245 sv_recode_to_utf8(svrecode, PL_encoding);
6246 pv2 = SvPV_const(svrecode, cur2);
6249 svrecode = newSVpvn(pv1, cur1);
6250 sv_recode_to_utf8(svrecode, PL_encoding);
6251 pv1 = SvPV_const(svrecode, cur1);
6253 /* Now both are in UTF-8. */
6255 SvREFCNT_dec(svrecode);
6260 bool is_utf8 = TRUE;
6263 /* sv1 is the UTF-8 one,
6264 * if is equal it must be downgrade-able */
6265 char * const pv = (char*)bytes_from_utf8((const U8*)pv1,
6271 /* sv2 is the UTF-8 one,
6272 * if is equal it must be downgrade-able */
6273 char * const pv = (char *)bytes_from_utf8((const U8*)pv2,
6279 /* Downgrade not possible - cannot be eq */
6287 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6290 SvREFCNT_dec(svrecode);
6301 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6302 string in C<sv1> is less than, equal to, or greater than the string in
6303 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6304 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6310 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6313 const char *pv1, *pv2;
6316 SV *svrecode = Nullsv;
6323 pv1 = SvPV_const(sv1, cur1);
6330 pv2 = SvPV_const(sv2, cur2);
6332 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6333 /* Differing utf8ness.
6334 * Do not UTF8size the comparands as a side-effect. */
6337 svrecode = newSVpvn(pv2, cur2);
6338 sv_recode_to_utf8(svrecode, PL_encoding);
6339 pv2 = SvPV_const(svrecode, cur2);
6342 pv2 = tpv = (char*)bytes_to_utf8((const U8*)pv2, &cur2);
6347 svrecode = newSVpvn(pv1, cur1);
6348 sv_recode_to_utf8(svrecode, PL_encoding);
6349 pv1 = SvPV_const(svrecode, cur1);
6352 pv1 = tpv = (char*)bytes_to_utf8((const U8*)pv1, &cur1);
6358 cmp = cur2 ? -1 : 0;
6362 const I32 retval = memcmp((const void*)pv1, (const void*)pv2, cur1 < cur2 ? cur1 : cur2);
6365 cmp = retval < 0 ? -1 : 1;
6366 } else if (cur1 == cur2) {
6369 cmp = cur1 < cur2 ? -1 : 1;
6374 SvREFCNT_dec(svrecode);
6383 =for apidoc sv_cmp_locale
6385 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6386 'use bytes' aware, handles get magic, and will coerce its args to strings
6387 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6393 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6395 #ifdef USE_LOCALE_COLLATE
6401 if (PL_collation_standard)
6405 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6407 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6409 if (!pv1 || !len1) {
6420 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6423 return retval < 0 ? -1 : 1;
6426 * When the result of collation is equality, that doesn't mean
6427 * that there are no differences -- some locales exclude some
6428 * characters from consideration. So to avoid false equalities,
6429 * we use the raw string as a tiebreaker.
6435 #endif /* USE_LOCALE_COLLATE */
6437 return sv_cmp(sv1, sv2);
6441 #ifdef USE_LOCALE_COLLATE
6444 =for apidoc sv_collxfrm
6446 Add Collate Transform magic to an SV if it doesn't already have it.
6448 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6449 scalar data of the variable, but transformed to such a format that a normal
6450 memory comparison can be used to compare the data according to the locale
6457 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6461 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6462 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6468 Safefree(mg->mg_ptr);
6469 s = SvPV_const(sv, len);
6470 if ((xf = mem_collxfrm(s, len, &xlen))) {
6471 if (SvREADONLY(sv)) {
6474 return xf + sizeof(PL_collation_ix);
6477 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6478 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6491 if (mg && mg->mg_ptr) {
6493 return mg->mg_ptr + sizeof(PL_collation_ix);
6501 #endif /* USE_LOCALE_COLLATE */
6506 Get a line from the filehandle and store it into the SV, optionally
6507 appending to the currently-stored string.
6513 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6517 register STDCHAR rslast;
6518 register STDCHAR *bp;
6524 if (SvTHINKFIRST(sv))
6525 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6526 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6528 However, perlbench says it's slower, because the existing swipe code
6529 is faster than copy on write.
6530 Swings and roundabouts. */
6531 SvUPGRADE(sv, SVt_PV);
6536 if (PerlIO_isutf8(fp)) {
6538 sv_utf8_upgrade_nomg(sv);
6539 sv_pos_u2b(sv,&append,0);
6541 } else if (SvUTF8(sv)) {
6542 SV * const tsv = NEWSV(0,0);
6543 sv_gets(tsv, fp, 0);
6544 sv_utf8_upgrade_nomg(tsv);
6545 SvCUR_set(sv,append);
6548 goto return_string_or_null;
6553 if (PerlIO_isutf8(fp))
6556 if (IN_PERL_COMPILETIME) {
6557 /* we always read code in line mode */
6561 else if (RsSNARF(PL_rs)) {
6562 /* If it is a regular disk file use size from stat() as estimate
6563 of amount we are going to read - may result in malloc-ing
6564 more memory than we realy need if layers bellow reduce
6565 size we read (e.g. CRLF or a gzip layer)
6568 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6569 const Off_t offset = PerlIO_tell(fp);
6570 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6571 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6577 else if (RsRECORD(PL_rs)) {
6581 /* Grab the size of the record we're getting */
6582 recsize = SvIV(SvRV(PL_rs));
6583 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6586 /* VMS wants read instead of fread, because fread doesn't respect */
6587 /* RMS record boundaries. This is not necessarily a good thing to be */
6588 /* doing, but we've got no other real choice - except avoid stdio
6589 as implementation - perhaps write a :vms layer ?
6591 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6593 bytesread = PerlIO_read(fp, buffer, recsize);
6597 SvCUR_set(sv, bytesread += append);
6598 buffer[bytesread] = '\0';
6599 goto return_string_or_null;
6601 else if (RsPARA(PL_rs)) {
6607 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6608 if (PerlIO_isutf8(fp)) {
6609 rsptr = SvPVutf8(PL_rs, rslen);
6612 if (SvUTF8(PL_rs)) {
6613 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6614 Perl_croak(aTHX_ "Wide character in $/");
6617 rsptr = SvPV_const(PL_rs, rslen);
6621 rslast = rslen ? rsptr[rslen - 1] : '\0';
6623 if (rspara) { /* have to do this both before and after */
6624 do { /* to make sure file boundaries work right */
6627 i = PerlIO_getc(fp);
6631 PerlIO_ungetc(fp,i);
6637 /* See if we know enough about I/O mechanism to cheat it ! */
6639 /* This used to be #ifdef test - it is made run-time test for ease
6640 of abstracting out stdio interface. One call should be cheap
6641 enough here - and may even be a macro allowing compile
6645 if (PerlIO_fast_gets(fp)) {
6648 * We're going to steal some values from the stdio struct
6649 * and put EVERYTHING in the innermost loop into registers.
6651 register STDCHAR *ptr;
6655 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6656 /* An ungetc()d char is handled separately from the regular
6657 * buffer, so we getc() it back out and stuff it in the buffer.
6659 i = PerlIO_getc(fp);
6660 if (i == EOF) return 0;
6661 *(--((*fp)->_ptr)) = (unsigned char) i;
6665 /* Here is some breathtakingly efficient cheating */
6667 cnt = PerlIO_get_cnt(fp); /* get count into register */
6668 /* make sure we have the room */
6669 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6670 /* Not room for all of it
6671 if we are looking for a separator and room for some
6673 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6674 /* just process what we have room for */
6675 shortbuffered = cnt - SvLEN(sv) + append + 1;
6676 cnt -= shortbuffered;
6680 /* remember that cnt can be negative */
6681 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6686 bp = (STDCHAR*)SvPVX_const(sv) + append; /* move these two too to registers */
6687 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6688 DEBUG_P(PerlIO_printf(Perl_debug_log,
6689 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6690 DEBUG_P(PerlIO_printf(Perl_debug_log,
6691 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6692 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6693 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6698 while (cnt > 0) { /* this | eat */
6700 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6701 goto thats_all_folks; /* screams | sed :-) */
6705 Copy(ptr, bp, cnt, char); /* this | eat */
6706 bp += cnt; /* screams | dust */
6707 ptr += cnt; /* louder | sed :-) */
6712 if (shortbuffered) { /* oh well, must extend */
6713 cnt = shortbuffered;
6715 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6717 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6718 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6722 DEBUG_P(PerlIO_printf(Perl_debug_log,
6723 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6724 PTR2UV(ptr),(long)cnt));
6725 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6727 DEBUG_P(PerlIO_printf(Perl_debug_log,
6728 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6729 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6730 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6732 /* This used to call 'filbuf' in stdio form, but as that behaves like
6733 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6734 another abstraction. */
6735 i = PerlIO_getc(fp); /* get more characters */
6737 DEBUG_P(PerlIO_printf(Perl_debug_log,
6738 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6739 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6740 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6742 cnt = PerlIO_get_cnt(fp);
6743 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6744 DEBUG_P(PerlIO_printf(Perl_debug_log,
6745 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6747 if (i == EOF) /* all done for ever? */
6748 goto thats_really_all_folks;
6750 bpx = bp - (STDCHAR*)SvPVX_const(sv); /* box up before relocation */
6752 SvGROW(sv, bpx + cnt + 2);
6753 bp = (STDCHAR*)SvPVX_const(sv) + bpx; /* unbox after relocation */
6755 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6757 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6758 goto thats_all_folks;
6762 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX_const(sv)) < rslen) ||
6763 memNE((char*)bp - rslen, rsptr, rslen))
6764 goto screamer; /* go back to the fray */
6765 thats_really_all_folks:
6767 cnt += shortbuffered;
6768 DEBUG_P(PerlIO_printf(Perl_debug_log,
6769 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6770 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6771 DEBUG_P(PerlIO_printf(Perl_debug_log,
6772 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6773 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6774 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6776 SvCUR_set(sv, bp - (STDCHAR*)SvPVX_const(sv)); /* set length */
6777 DEBUG_P(PerlIO_printf(Perl_debug_log,
6778 "Screamer: done, len=%ld, string=|%.*s|\n",
6779 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX_const(sv)));
6783 /*The big, slow, and stupid way. */
6784 #ifdef USE_HEAP_INSTEAD_OF_STACK /* Even slower way. */
6786 New(0, buf, 8192, STDCHAR);
6794 const register STDCHAR *bpe = buf + sizeof(buf);
6796 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6797 ; /* keep reading */
6801 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6802 /* Accomodate broken VAXC compiler, which applies U8 cast to
6803 * both args of ?: operator, causing EOF to change into 255
6806 i = (U8)buf[cnt - 1];
6812 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6814 sv_catpvn(sv, (char *) buf, cnt);
6816 sv_setpvn(sv, (char *) buf, cnt);
6818 if (i != EOF && /* joy */
6820 SvCUR(sv) < rslen ||
6821 memNE(SvPVX_const(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6825 * If we're reading from a TTY and we get a short read,
6826 * indicating that the user hit his EOF character, we need
6827 * to notice it now, because if we try to read from the TTY
6828 * again, the EOF condition will disappear.
6830 * The comparison of cnt to sizeof(buf) is an optimization
6831 * that prevents unnecessary calls to feof().
6835 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6839 #ifdef USE_HEAP_INSTEAD_OF_STACK
6844 if (rspara) { /* have to do this both before and after */
6845 while (i != EOF) { /* to make sure file boundaries work right */
6846 i = PerlIO_getc(fp);
6848 PerlIO_ungetc(fp,i);
6854 return_string_or_null:
6855 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6861 Auto-increment of the value in the SV, doing string to numeric conversion
6862 if necessary. Handles 'get' magic.
6868 Perl_sv_inc(pTHX_ register SV *sv)
6877 if (SvTHINKFIRST(sv)) {
6879 sv_force_normal_flags(sv, 0);
6880 if (SvREADONLY(sv)) {
6881 if (IN_PERL_RUNTIME)
6882 Perl_croak(aTHX_ PL_no_modify);
6886 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6888 i = PTR2IV(SvRV(sv));
6893 flags = SvFLAGS(sv);
6894 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6895 /* It's (privately or publicly) a float, but not tested as an
6896 integer, so test it to see. */
6898 flags = SvFLAGS(sv);
6900 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6901 /* It's publicly an integer, or privately an integer-not-float */
6902 #ifdef PERL_PRESERVE_IVUV
6906 if (SvUVX(sv) == UV_MAX)
6907 sv_setnv(sv, UV_MAX_P1);
6909 (void)SvIOK_only_UV(sv);
6910 SvUV_set(sv, SvUVX(sv) + 1);
6912 if (SvIVX(sv) == IV_MAX)
6913 sv_setuv(sv, (UV)IV_MAX + 1);
6915 (void)SvIOK_only(sv);
6916 SvIV_set(sv, SvIVX(sv) + 1);
6921 if (flags & SVp_NOK) {
6922 (void)SvNOK_only(sv);
6923 SvNV_set(sv, SvNVX(sv) + 1.0);
6927 if (!(flags & SVp_POK) || !*SvPVX_const(sv)) {
6928 if ((flags & SVTYPEMASK) < SVt_PVIV)
6929 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV ? SVt_PVIV : SVt_IV));
6930 (void)SvIOK_only(sv);
6935 while (isALPHA(*d)) d++;
6936 while (isDIGIT(*d)) d++;
6938 #ifdef PERL_PRESERVE_IVUV
6939 /* Got to punt this as an integer if needs be, but we don't issue
6940 warnings. Probably ought to make the sv_iv_please() that does
6941 the conversion if possible, and silently. */
6942 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
6943 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6944 /* Need to try really hard to see if it's an integer.
6945 9.22337203685478e+18 is an integer.
6946 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6947 so $a="9.22337203685478e+18"; $a+0; $a++
6948 needs to be the same as $a="9.22337203685478e+18"; $a++
6955 /* sv_2iv *should* have made this an NV */
6956 if (flags & SVp_NOK) {
6957 (void)SvNOK_only(sv);
6958 SvNV_set(sv, SvNVX(sv) + 1.0);
6961 /* I don't think we can get here. Maybe I should assert this
6962 And if we do get here I suspect that sv_setnv will croak. NWC
6964 #if defined(USE_LONG_DOUBLE)
6965 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",
6966 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6968 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6969 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
6972 #endif /* PERL_PRESERVE_IVUV */
6973 sv_setnv(sv,Atof(SvPVX_const(sv)) + 1.0);
6977 while (d >= SvPVX_const(sv)) {
6985 /* MKS: The original code here died if letters weren't consecutive.
6986 * at least it didn't have to worry about non-C locales. The
6987 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6988 * arranged in order (although not consecutively) and that only
6989 * [A-Za-z] are accepted by isALPHA in the C locale.
6991 if (*d != 'z' && *d != 'Z') {
6992 do { ++*d; } while (!isALPHA(*d));
6995 *(d--) -= 'z' - 'a';
7000 *(d--) -= 'z' - 'a' + 1;
7004 /* oh,oh, the number grew */
7005 SvGROW(sv, SvCUR(sv) + 2);
7006 SvCUR_set(sv, SvCUR(sv) + 1);
7007 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX_const(sv); d--)
7018 Auto-decrement of the value in the SV, doing string to numeric conversion
7019 if necessary. Handles 'get' magic.
7025 Perl_sv_dec(pTHX_ register SV *sv)
7033 if (SvTHINKFIRST(sv)) {
7035 sv_force_normal_flags(sv, 0);
7036 if (SvREADONLY(sv)) {
7037 if (IN_PERL_RUNTIME)
7038 Perl_croak(aTHX_ PL_no_modify);
7042 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
7044 i = PTR2IV(SvRV(sv));
7049 /* Unlike sv_inc we don't have to worry about string-never-numbers
7050 and keeping them magic. But we mustn't warn on punting */
7051 flags = SvFLAGS(sv);
7052 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
7053 /* It's publicly an integer, or privately an integer-not-float */
7054 #ifdef PERL_PRESERVE_IVUV
7058 if (SvUVX(sv) == 0) {
7059 (void)SvIOK_only(sv);
7063 (void)SvIOK_only_UV(sv);
7064 SvUV_set(sv, SvUVX(sv) + 1);
7067 if (SvIVX(sv) == IV_MIN)
7068 sv_setnv(sv, (NV)IV_MIN - 1.0);
7070 (void)SvIOK_only(sv);
7071 SvIV_set(sv, SvIVX(sv) - 1);
7076 if (flags & SVp_NOK) {
7077 SvNV_set(sv, SvNVX(sv) - 1.0);
7078 (void)SvNOK_only(sv);
7081 if (!(flags & SVp_POK)) {
7082 if ((flags & SVTYPEMASK) < SVt_PVIV)
7083 sv_upgrade(sv, ((flags & SVTYPEMASK) > SVt_IV) ? SVt_PVIV : SVt_IV);
7085 (void)SvIOK_only(sv);
7088 #ifdef PERL_PRESERVE_IVUV
7090 const int numtype = grok_number(SvPVX_const(sv), SvCUR(sv), NULL);
7091 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7092 /* Need to try really hard to see if it's an integer.
7093 9.22337203685478e+18 is an integer.
7094 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7095 so $a="9.22337203685478e+18"; $a+0; $a--
7096 needs to be the same as $a="9.22337203685478e+18"; $a--
7103 /* sv_2iv *should* have made this an NV */
7104 if (flags & SVp_NOK) {
7105 (void)SvNOK_only(sv);
7106 SvNV_set(sv, SvNVX(sv) - 1.0);
7109 /* I don't think we can get here. Maybe I should assert this
7110 And if we do get here I suspect that sv_setnv will croak. NWC
7112 #if defined(USE_LONG_DOUBLE)
7113 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",
7114 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7116 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7117 SvPVX_const(sv), SvIVX(sv), SvNVX(sv)));
7121 #endif /* PERL_PRESERVE_IVUV */
7122 sv_setnv(sv,Atof(SvPVX_const(sv)) - 1.0); /* punt */
7126 =for apidoc sv_mortalcopy
7128 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7129 The new SV is marked as mortal. It will be destroyed "soon", either by an
7130 explicit call to FREETMPS, or by an implicit call at places such as
7131 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7136 /* Make a string that will exist for the duration of the expression
7137 * evaluation. Actually, it may have to last longer than that, but
7138 * hopefully we won't free it until it has been assigned to a
7139 * permanent location. */
7142 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7147 sv_setsv(sv,oldstr);
7149 PL_tmps_stack[++PL_tmps_ix] = sv;
7155 =for apidoc sv_newmortal
7157 Creates a new null SV which is mortal. The reference count of the SV is
7158 set to 1. It will be destroyed "soon", either by an explicit call to
7159 FREETMPS, or by an implicit call at places such as statement boundaries.
7160 See also C<sv_mortalcopy> and C<sv_2mortal>.
7166 Perl_sv_newmortal(pTHX)
7171 SvFLAGS(sv) = SVs_TEMP;
7173 PL_tmps_stack[++PL_tmps_ix] = sv;
7178 =for apidoc sv_2mortal
7180 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7181 by an explicit call to FREETMPS, or by an implicit call at places such as
7182 statement boundaries. SvTEMP() is turned on which means that the SV's
7183 string buffer can be "stolen" if this SV is copied. See also C<sv_newmortal>
7184 and C<sv_mortalcopy>.
7190 Perl_sv_2mortal(pTHX_ register SV *sv)
7195 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7198 PL_tmps_stack[++PL_tmps_ix] = sv;
7206 Creates a new SV and copies a string into it. The reference count for the
7207 SV is set to 1. If C<len> is zero, Perl will compute the length using
7208 strlen(). For efficiency, consider using C<newSVpvn> instead.
7214 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7219 sv_setpvn(sv,s,len ? len : strlen(s));
7224 =for apidoc newSVpvn
7226 Creates a new SV and copies a string into it. The reference count for the
7227 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7228 string. You are responsible for ensuring that the source string is at least
7229 C<len> bytes long. If the C<s> argument is NULL the new SV will be undefined.
7235 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7240 sv_setpvn(sv,s,len);
7246 =for apidoc newSVhek
7248 Creates a new SV from the hash key structure. It will generate scalars that
7249 point to the shared string table where possible. Returns a new (undefined)
7250 SV if the hek is NULL.
7256 Perl_newSVhek(pTHX_ const HEK *hek)
7265 if (HEK_LEN(hek) == HEf_SVKEY) {
7266 return newSVsv(*(SV**)HEK_KEY(hek));
7268 const int flags = HEK_FLAGS(hek);
7269 if (flags & HVhek_WASUTF8) {
7271 Andreas would like keys he put in as utf8 to come back as utf8
7273 STRLEN utf8_len = HEK_LEN(hek);
7274 U8 *as_utf8 = bytes_to_utf8 ((U8*)HEK_KEY(hek), &utf8_len);
7275 SV *sv = newSVpvn ((char*)as_utf8, utf8_len);
7278 Safefree (as_utf8); /* bytes_to_utf8() allocates a new string */
7280 } else if (flags & HVhek_REHASH) {
7281 /* We don't have a pointer to the hv, so we have to replicate the
7282 flag into every HEK. This hv is using custom a hasing
7283 algorithm. Hence we can't return a shared string scalar, as
7284 that would contain the (wrong) hash value, and might get passed
7285 into an hv routine with a regular hash */
7287 SV *sv = newSVpvn (HEK_KEY(hek), HEK_LEN(hek));
7292 /* This will be overwhelminly the most common case. */
7293 return newSVpvn_share(HEK_KEY(hek),
7294 (HEK_UTF8(hek) ? -HEK_LEN(hek) : HEK_LEN(hek)),
7300 =for apidoc newSVpvn_share
7302 Creates a new SV with its SvPVX_const pointing to a shared string in the string
7303 table. If the string does not already exist in the table, it is created
7304 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7305 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7306 otherwise the hash is computed. The idea here is that as the string table
7307 is used for shared hash keys these strings will have SvPVX_const == HeKEY and
7308 hash lookup will avoid string compare.
7314 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7317 bool is_utf8 = FALSE;
7319 STRLEN tmplen = -len;
7321 /* See the note in hv.c:hv_fetch() --jhi */
7322 src = (char*)bytes_from_utf8((const U8*)src, &tmplen, &is_utf8);
7326 PERL_HASH(hash, src, len);
7328 sv_upgrade(sv, SVt_PV);
7329 SvPV_set(sv, sharepvn(src, is_utf8?-len:len, hash));
7341 #if defined(PERL_IMPLICIT_CONTEXT)
7343 /* pTHX_ magic can't cope with varargs, so this is a no-context
7344 * version of the main function, (which may itself be aliased to us).
7345 * Don't access this version directly.
7349 Perl_newSVpvf_nocontext(const char* pat, ...)
7354 va_start(args, pat);
7355 sv = vnewSVpvf(pat, &args);
7362 =for apidoc newSVpvf
7364 Creates a new SV and initializes it with the string formatted like
7371 Perl_newSVpvf(pTHX_ const char* pat, ...)
7375 va_start(args, pat);
7376 sv = vnewSVpvf(pat, &args);
7381 /* backend for newSVpvf() and newSVpvf_nocontext() */
7384 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7388 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7395 Creates a new SV and copies a floating point value into it.
7396 The reference count for the SV is set to 1.
7402 Perl_newSVnv(pTHX_ NV n)
7414 Creates a new SV and copies an integer into it. The reference count for the
7421 Perl_newSViv(pTHX_ IV i)
7433 Creates a new SV and copies an unsigned integer into it.
7434 The reference count for the SV is set to 1.
7440 Perl_newSVuv(pTHX_ UV u)
7450 =for apidoc newRV_noinc
7452 Creates an RV wrapper for an SV. The reference count for the original
7453 SV is B<not> incremented.
7459 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7464 sv_upgrade(sv, SVt_RV);
7466 SvRV_set(sv, tmpRef);
7471 /* newRV_inc is the official function name to use now.
7472 * newRV_inc is in fact #defined to newRV in sv.h
7476 Perl_newRV(pTHX_ SV *tmpRef)
7478 return newRV_noinc(SvREFCNT_inc(tmpRef));
7484 Creates a new SV which is an exact duplicate of the original SV.
7491 Perl_newSVsv(pTHX_ register SV *old)
7497 if (SvTYPE(old) == SVTYPEMASK) {
7498 if (ckWARN_d(WARN_INTERNAL))
7499 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7503 /* SV_GMAGIC is the default for sv_setv()
7504 SV_NOSTEAL prevents TEMP buffers being, well, stolen, and saves games
7505 with SvTEMP_off and SvTEMP_on round a call to sv_setsv. */
7506 sv_setsv_flags(sv, old, SV_GMAGIC | SV_NOSTEAL);
7511 =for apidoc sv_reset
7513 Underlying implementation for the C<reset> Perl function.
7514 Note that the perl-level function is vaguely deprecated.
7520 Perl_sv_reset(pTHX_ register const char *s, HV *stash)
7523 char todo[PERL_UCHAR_MAX+1];
7528 if (!*s) { /* reset ?? searches */
7529 MAGIC *mg = mg_find((SV *)stash, PERL_MAGIC_symtab);
7531 PMOP *pm = (PMOP *) mg->mg_obj;
7533 pm->op_pmdynflags &= ~PMdf_USED;
7540 /* reset variables */
7542 if (!HvARRAY(stash))
7545 Zero(todo, 256, char);
7548 I32 i = (unsigned char)*s;
7552 max = (unsigned char)*s++;
7553 for ( ; i <= max; i++) {
7556 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7558 for (entry = HvARRAY(stash)[i];
7560 entry = HeNEXT(entry))
7565 if (!todo[(U8)*HeKEY(entry)])
7567 gv = (GV*)HeVAL(entry);
7569 if (SvTHINKFIRST(sv)) {
7570 if (!SvREADONLY(sv) && SvROK(sv))
7575 if (SvTYPE(sv) >= SVt_PV) {
7577 if (SvPVX_const(sv) != Nullch)
7584 if (GvHV(gv) && !HvNAME_get(GvHV(gv))) {
7587 #ifdef USE_ENVIRON_ARRAY
7589 # ifdef USE_ITHREADS
7590 && PL_curinterp == aTHX
7594 environ[0] = Nullch;
7597 #endif /* !PERL_MICRO */
7607 Using various gambits, try to get an IO from an SV: the IO slot if its a
7608 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7609 named after the PV if we're a string.
7615 Perl_sv_2io(pTHX_ SV *sv)
7620 switch (SvTYPE(sv)) {
7628 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7632 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7634 return sv_2io(SvRV(sv));
7635 gv = gv_fetchsv(sv, FALSE, SVt_PVIO);
7641 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7650 Using various gambits, try to get a CV from an SV; in addition, try if
7651 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7657 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7664 return *gvp = Nullgv, Nullcv;
7665 switch (SvTYPE(sv)) {
7684 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7685 tryAMAGICunDEREF(to_cv);
7688 if (SvTYPE(sv) == SVt_PVCV) {
7697 Perl_croak(aTHX_ "Not a subroutine reference");
7702 gv = gv_fetchsv(sv, lref, SVt_PVCV);
7708 if (lref && !GvCVu(gv)) {
7711 tmpsv = NEWSV(704,0);
7712 gv_efullname3(tmpsv, gv, Nullch);
7713 /* XXX this is probably not what they think they're getting.
7714 * It has the same effect as "sub name;", i.e. just a forward
7716 newSUB(start_subparse(FALSE, 0),
7717 newSVOP(OP_CONST, 0, tmpsv),
7722 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7732 Returns true if the SV has a true value by Perl's rules.
7733 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7734 instead use an in-line version.
7740 Perl_sv_true(pTHX_ register SV *sv)
7745 const register XPV* tXpv;
7746 if ((tXpv = (XPV*)SvANY(sv)) &&
7747 (tXpv->xpv_cur > 1 ||
7748 (tXpv->xpv_cur && *sv->sv_u.svu_pv != '0')))
7755 return SvIVX(sv) != 0;
7758 return SvNVX(sv) != 0.0;
7760 return sv_2bool(sv);
7768 A private implementation of the C<SvIVx> macro for compilers which can't
7769 cope with complex macro expressions. Always use the macro instead.
7775 Perl_sv_iv(pTHX_ register SV *sv)
7779 return (IV)SvUVX(sv);
7788 A private implementation of the C<SvUVx> macro for compilers which can't
7789 cope with complex macro expressions. Always use the macro instead.
7795 Perl_sv_uv(pTHX_ register SV *sv)
7800 return (UV)SvIVX(sv);
7808 A private implementation of the C<SvNVx> macro for compilers which can't
7809 cope with complex macro expressions. Always use the macro instead.
7815 Perl_sv_nv(pTHX_ register SV *sv)
7822 /* sv_pv() is now a macro using SvPV_nolen();
7823 * this function provided for binary compatibility only
7827 Perl_sv_pv(pTHX_ SV *sv)
7832 return sv_2pv(sv, 0);
7838 Use the C<SvPV_nolen> macro instead
7842 A private implementation of the C<SvPV> macro for compilers which can't
7843 cope with complex macro expressions. Always use the macro instead.
7849 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7855 return sv_2pv(sv, lp);
7860 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7866 return sv_2pv_flags(sv, lp, 0);
7869 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7870 * this function provided for binary compatibility only
7874 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7876 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7880 =for apidoc sv_pvn_force
7882 Get a sensible string out of the SV somehow.
7883 A private implementation of the C<SvPV_force> macro for compilers which
7884 can't cope with complex macro expressions. Always use the macro instead.
7886 =for apidoc sv_pvn_force_flags
7888 Get a sensible string out of the SV somehow.
7889 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7890 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7891 implemented in terms of this function.
7892 You normally want to use the various wrapper macros instead: see
7893 C<SvPV_force> and C<SvPV_force_nomg>
7899 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7902 if (SvTHINKFIRST(sv) && !SvROK(sv))
7903 sv_force_normal_flags(sv, 0);
7913 if (SvREADONLY(sv) && !(flags & SV_MUTABLE_RETURN)) {
7915 Perl_croak(aTHX_ "Can't coerce readonly %s to string in %s",
7916 sv_reftype(sv,0), OP_NAME(PL_op));
7918 Perl_croak(aTHX_ "Can't coerce readonly %s to string",
7921 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7922 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7926 s = sv_2pv_flags(sv, &len, flags);
7930 if (s != SvPVX_const(sv)) { /* Almost, but not quite, sv_setpvn() */
7933 SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7934 SvGROW(sv, len + 1);
7935 Move(s,SvPVX_const(sv),len,char);
7940 SvPOK_on(sv); /* validate pointer */
7942 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7943 PTR2UV(sv),SvPVX_const(sv)));
7946 return SvPVX_mutable(sv);
7949 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7950 * this function provided for binary compatibility only
7954 Perl_sv_pvbyte(pTHX_ SV *sv)
7956 sv_utf8_downgrade(sv,0);
7961 =for apidoc sv_pvbyte
7963 Use C<SvPVbyte_nolen> instead.
7965 =for apidoc sv_pvbyten
7967 A private implementation of the C<SvPVbyte> macro for compilers
7968 which can't cope with complex macro expressions. Always use the macro
7975 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7977 sv_utf8_downgrade(sv,0);
7978 return sv_pvn(sv,lp);
7982 =for apidoc sv_pvbyten_force
7984 A private implementation of the C<SvPVbytex_force> macro for compilers
7985 which can't cope with complex macro expressions. Always use the macro
7992 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7994 sv_pvn_force(sv,lp);
7995 sv_utf8_downgrade(sv,0);
8000 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
8001 * this function provided for binary compatibility only
8005 Perl_sv_pvutf8(pTHX_ SV *sv)
8007 sv_utf8_upgrade(sv);
8012 =for apidoc sv_pvutf8
8014 Use the C<SvPVutf8_nolen> macro instead
8016 =for apidoc sv_pvutf8n
8018 A private implementation of the C<SvPVutf8> macro for compilers
8019 which can't cope with complex macro expressions. Always use the macro
8026 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
8028 sv_utf8_upgrade(sv);
8029 return sv_pvn(sv,lp);
8033 =for apidoc sv_pvutf8n_force
8035 A private implementation of the C<SvPVutf8_force> macro for compilers
8036 which can't cope with complex macro expressions. Always use the macro
8043 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
8045 sv_pvn_force(sv,lp);
8046 sv_utf8_upgrade(sv);
8052 =for apidoc sv_reftype
8054 Returns a string describing what the SV is a reference to.
8060 Perl_sv_reftype(pTHX_ const SV *sv, int ob)
8062 /* The fact that I don't need to downcast to char * everywhere, only in ?:
8063 inside return suggests a const propagation bug in g++. */
8064 if (ob && SvOBJECT(sv)) {
8065 char * const name = HvNAME_get(SvSTASH(sv));
8066 return name ? name : (char *) "__ANON__";
8069 switch (SvTYPE(sv)) {
8086 case SVt_PVLV: return (char *) (SvROK(sv) ? "REF"
8087 /* tied lvalues should appear to be
8088 * scalars for backwards compatitbility */
8089 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
8090 ? "SCALAR" : "LVALUE");
8091 case SVt_PVAV: return "ARRAY";
8092 case SVt_PVHV: return "HASH";
8093 case SVt_PVCV: return "CODE";
8094 case SVt_PVGV: return "GLOB";
8095 case SVt_PVFM: return "FORMAT";
8096 case SVt_PVIO: return "IO";
8097 default: return "UNKNOWN";
8103 =for apidoc sv_isobject
8105 Returns a boolean indicating whether the SV is an RV pointing to a blessed
8106 object. If the SV is not an RV, or if the object is not blessed, then this
8113 Perl_sv_isobject(pTHX_ SV *sv)
8130 Returns a boolean indicating whether the SV is blessed into the specified
8131 class. This does not check for subtypes; use C<sv_derived_from> to verify
8132 an inheritance relationship.
8138 Perl_sv_isa(pTHX_ SV *sv, const char *name)
8150 hvname = HvNAME_get(SvSTASH(sv));
8154 return strEQ(hvname, name);
8160 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8161 it will be upgraded to one. If C<classname> is non-null then the new SV will
8162 be blessed in the specified package. The new SV is returned and its
8163 reference count is 1.
8169 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8175 SV_CHECK_THINKFIRST_COW_DROP(rv);
8178 if (SvTYPE(rv) >= SVt_PVMG) {
8179 const U32 refcnt = SvREFCNT(rv);
8183 SvREFCNT(rv) = refcnt;
8186 if (SvTYPE(rv) < SVt_RV)
8187 sv_upgrade(rv, SVt_RV);
8188 else if (SvTYPE(rv) > SVt_RV) {
8199 HV* const stash = gv_stashpv(classname, TRUE);
8200 (void)sv_bless(rv, stash);
8206 =for apidoc sv_setref_pv
8208 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8209 argument will be upgraded to an RV. That RV will be modified to point to
8210 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8211 into the SV. The C<classname> argument indicates the package for the
8212 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8213 will have a reference count of 1, and the RV will be returned.
8215 Do not use with other Perl types such as HV, AV, SV, CV, because those
8216 objects will become corrupted by the pointer copy process.
8218 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8224 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8227 sv_setsv(rv, &PL_sv_undef);
8231 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8236 =for apidoc sv_setref_iv
8238 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8239 argument will be upgraded to an RV. That RV will be modified to point to
8240 the new SV. The C<classname> argument indicates the package for the
8241 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8242 will have a reference count of 1, and the RV will be returned.
8248 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8250 sv_setiv(newSVrv(rv,classname), iv);
8255 =for apidoc sv_setref_uv
8257 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8258 argument will be upgraded to an RV. That RV will be modified to point to
8259 the new SV. The C<classname> argument indicates the package for the
8260 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8261 will have a reference count of 1, and the RV will be returned.
8267 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8269 sv_setuv(newSVrv(rv,classname), uv);
8274 =for apidoc sv_setref_nv
8276 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8277 argument will be upgraded to an RV. That RV will be modified to point to
8278 the new SV. The C<classname> argument indicates the package for the
8279 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8280 will have a reference count of 1, and the RV will be returned.
8286 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8288 sv_setnv(newSVrv(rv,classname), nv);
8293 =for apidoc sv_setref_pvn
8295 Copies a string into a new SV, optionally blessing the SV. The length of the
8296 string must be specified with C<n>. The C<rv> argument will be upgraded to
8297 an RV. That RV will be modified to point to the new SV. The C<classname>
8298 argument indicates the package for the blessing. Set C<classname> to
8299 C<Nullch> to avoid the blessing. The new SV will have a reference count
8300 of 1, and the RV will be returned.
8302 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8308 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, const char *pv, STRLEN n)
8310 sv_setpvn(newSVrv(rv,classname), pv, n);
8315 =for apidoc sv_bless
8317 Blesses an SV into a specified package. The SV must be an RV. The package
8318 must be designated by its stash (see C<gv_stashpv()>). The reference count
8319 of the SV is unaffected.
8325 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8329 Perl_croak(aTHX_ "Can't bless non-reference value");
8331 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8332 if (SvREADONLY(tmpRef))
8333 Perl_croak(aTHX_ PL_no_modify);
8334 if (SvOBJECT(tmpRef)) {
8335 if (SvTYPE(tmpRef) != SVt_PVIO)
8337 SvREFCNT_dec(SvSTASH(tmpRef));
8340 SvOBJECT_on(tmpRef);
8341 if (SvTYPE(tmpRef) != SVt_PVIO)
8343 SvUPGRADE(tmpRef, SVt_PVMG);
8344 SvSTASH_set(tmpRef, (HV*)SvREFCNT_inc(stash));
8351 if(SvSMAGICAL(tmpRef))
8352 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8360 /* Downgrades a PVGV to a PVMG.
8364 S_sv_unglob(pTHX_ SV *sv)
8368 assert(SvTYPE(sv) == SVt_PVGV);
8373 sv_del_backref((SV*)GvSTASH(sv), sv);
8374 GvSTASH(sv) = Nullhv;
8376 sv_unmagic(sv, PERL_MAGIC_glob);
8377 Safefree(GvNAME(sv));
8380 /* need to keep SvANY(sv) in the right arena */
8381 xpvmg = new_XPVMG();
8382 StructCopy(SvANY(sv), xpvmg, XPVMG);
8383 del_XPVGV(SvANY(sv));
8386 SvFLAGS(sv) &= ~SVTYPEMASK;
8387 SvFLAGS(sv) |= SVt_PVMG;
8391 =for apidoc sv_unref_flags
8393 Unsets the RV status of the SV, and decrements the reference count of
8394 whatever was being referenced by the RV. This can almost be thought of
8395 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8396 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8397 (otherwise the decrementing is conditional on the reference count being
8398 different from one or the reference being a readonly SV).
8405 Perl_sv_unref_flags(pTHX_ SV *ref, U32 flags)
8407 SV* target = SvRV(ref);
8409 if (SvWEAKREF(ref)) {
8410 sv_del_backref(target, ref);
8412 SvRV_set(ref, NULL);
8415 SvRV_set(ref, NULL);
8417 /* You can't have a || SvREADONLY(target) here, as $a = $$a, where $a was
8418 assigned to as BEGIN {$a = \"Foo"} will fail. */
8419 if (SvREFCNT(target) != 1 || (flags & SV_IMMEDIATE_UNREF))
8420 SvREFCNT_dec(target);
8421 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8422 sv_2mortal(target); /* Schedule for freeing later */
8426 =for apidoc sv_unref
8428 Unsets the RV status of the SV, and decrements the reference count of
8429 whatever was being referenced by the RV. This can almost be thought of
8430 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8431 being zero. See C<SvROK_off>.
8437 Perl_sv_unref(pTHX_ SV *sv)
8439 sv_unref_flags(sv, 0);
8443 =for apidoc sv_taint
8445 Taint an SV. Use C<SvTAINTED_on> instead.
8450 Perl_sv_taint(pTHX_ SV *sv)
8452 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8456 =for apidoc sv_untaint
8458 Untaint an SV. Use C<SvTAINTED_off> instead.
8463 Perl_sv_untaint(pTHX_ SV *sv)
8465 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8466 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8473 =for apidoc sv_tainted
8475 Test an SV for taintedness. Use C<SvTAINTED> instead.
8480 Perl_sv_tainted(pTHX_ SV *sv)
8482 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8483 MAGIC * const mg = mg_find(sv, PERL_MAGIC_taint);
8484 if (mg && (mg->mg_len & 1) )
8491 =for apidoc sv_setpviv
8493 Copies an integer into the given SV, also updating its string value.
8494 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8500 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8502 char buf[TYPE_CHARS(UV)];
8504 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8506 sv_setpvn(sv, ptr, ebuf - ptr);
8510 =for apidoc sv_setpviv_mg
8512 Like C<sv_setpviv>, but also handles 'set' magic.
8518 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8520 char buf[TYPE_CHARS(UV)];
8522 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8524 sv_setpvn(sv, ptr, ebuf - ptr);
8528 #if defined(PERL_IMPLICIT_CONTEXT)
8530 /* pTHX_ magic can't cope with varargs, so this is a no-context
8531 * version of the main function, (which may itself be aliased to us).
8532 * Don't access this version directly.
8536 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8540 va_start(args, pat);
8541 sv_vsetpvf(sv, pat, &args);
8545 /* pTHX_ magic can't cope with varargs, so this is a no-context
8546 * version of the main function, (which may itself be aliased to us).
8547 * Don't access this version directly.
8551 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8555 va_start(args, pat);
8556 sv_vsetpvf_mg(sv, pat, &args);
8562 =for apidoc sv_setpvf
8564 Works like C<sv_catpvf> but copies the text into the SV instead of
8565 appending it. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8571 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8574 va_start(args, pat);
8575 sv_vsetpvf(sv, pat, &args);
8580 =for apidoc sv_vsetpvf
8582 Works like C<sv_vcatpvf> but copies the text into the SV instead of
8583 appending it. Does not handle 'set' magic. See C<sv_vsetpvf_mg>.
8585 Usually used via its frontend C<sv_setpvf>.
8591 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8593 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8597 =for apidoc sv_setpvf_mg
8599 Like C<sv_setpvf>, but also handles 'set' magic.
8605 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8608 va_start(args, pat);
8609 sv_vsetpvf_mg(sv, pat, &args);
8614 =for apidoc sv_vsetpvf_mg
8616 Like C<sv_vsetpvf>, but also handles 'set' magic.
8618 Usually used via its frontend C<sv_setpvf_mg>.
8624 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8626 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8630 #if defined(PERL_IMPLICIT_CONTEXT)
8632 /* pTHX_ magic can't cope with varargs, so this is a no-context
8633 * version of the main function, (which may itself be aliased to us).
8634 * Don't access this version directly.
8638 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8642 va_start(args, pat);
8643 sv_vcatpvf(sv, pat, &args);
8647 /* pTHX_ magic can't cope with varargs, so this is a no-context
8648 * version of the main function, (which may itself be aliased to us).
8649 * Don't access this version directly.
8653 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8657 va_start(args, pat);
8658 sv_vcatpvf_mg(sv, pat, &args);
8664 =for apidoc sv_catpvf
8666 Processes its arguments like C<sprintf> and appends the formatted
8667 output to an SV. If the appended data contains "wide" characters
8668 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8669 and characters >255 formatted with %c), the original SV might get
8670 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic. See
8671 C<sv_catpvf_mg>. If the original SV was UTF-8, the pattern should be
8672 valid UTF-8; if the original SV was bytes, the pattern should be too.
8677 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8680 va_start(args, pat);
8681 sv_vcatpvf(sv, pat, &args);
8686 =for apidoc sv_vcatpvf
8688 Processes its arguments like C<vsprintf> and appends the formatted output
8689 to an SV. Does not handle 'set' magic. See C<sv_vcatpvf_mg>.
8691 Usually used via its frontend C<sv_catpvf>.
8697 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8699 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8703 =for apidoc sv_catpvf_mg
8705 Like C<sv_catpvf>, but also handles 'set' magic.
8711 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8714 va_start(args, pat);
8715 sv_vcatpvf_mg(sv, pat, &args);
8720 =for apidoc sv_vcatpvf_mg
8722 Like C<sv_vcatpvf>, but also handles 'set' magic.
8724 Usually used via its frontend C<sv_catpvf_mg>.
8730 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8732 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8737 =for apidoc sv_vsetpvfn
8739 Works like C<sv_vcatpvfn> but copies the text into the SV instead of
8742 Usually used via one of its frontends C<sv_vsetpvf> and C<sv_vsetpvf_mg>.
8748 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8750 sv_setpvn(sv, "", 0);
8751 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8754 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8757 S_expect_number(pTHX_ char** pattern)
8760 switch (**pattern) {
8761 case '1': case '2': case '3':
8762 case '4': case '5': case '6':
8763 case '7': case '8': case '9':
8764 while (isDIGIT(**pattern))
8765 var = var * 10 + (*(*pattern)++ - '0');
8769 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8772 F0convert(NV nv, char *endbuf, STRLEN *len)
8774 const int neg = nv < 0;
8783 if (uv & 1 && uv == nv)
8784 uv--; /* Round to even */
8786 const unsigned dig = uv % 10;
8799 =for apidoc sv_vcatpvfn
8801 Processes its arguments like C<vsprintf> and appends the formatted output
8802 to an SV. Uses an array of SVs if the C style variable argument list is
8803 missing (NULL). When running with taint checks enabled, indicates via
8804 C<maybe_tainted> if results are untrustworthy (often due to the use of
8807 Usually used via one of its frontends C<sv_vcatpvf> and C<sv_vcatpvf_mg>.
8812 /* XXX maybe_tainted is never assigned to, so the doc above is lying. */
8815 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8822 static const char nullstr[] = "(null)";
8824 bool has_utf8 = DO_UTF8(sv); /* has the result utf8? */
8825 const bool pat_utf8 = has_utf8; /* the pattern is in utf8? */
8827 /* Times 4: a decimal digit takes more than 3 binary digits.
8828 * NV_DIG: mantissa takes than many decimal digits.
8829 * Plus 32: Playing safe. */
8830 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8831 /* large enough for "%#.#f" --chip */
8832 /* what about long double NVs? --jhi */
8834 PERL_UNUSED_ARG(maybe_tainted);
8836 /* no matter what, this is a string now */
8837 (void)SvPV_force(sv, origlen);
8839 /* special-case "", "%s", and "%-p" (SVf) */
8842 if (patlen == 2 && pat[0] == '%' && pat[1] == 's') {
8844 const char * const s = va_arg(*args, char*);
8845 sv_catpv(sv, s ? s : nullstr);
8847 else if (svix < svmax) {
8848 sv_catsv(sv, *svargs);
8849 if (DO_UTF8(*svargs))
8854 if (patlen == 3 && pat[0] == '%' &&
8855 pat[1] == '-' && pat[2] == 'p') {
8857 argsv = va_arg(*args, SV*);
8858 sv_catsv(sv, argsv);
8865 #ifndef USE_LONG_DOUBLE
8866 /* special-case "%.<number>[gf]" */
8867 if ( !args && patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8868 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8869 unsigned digits = 0;
8873 while (*pp >= '0' && *pp <= '9')
8874 digits = 10 * digits + (*pp++ - '0');
8875 if (pp - pat == (int)patlen - 1) {
8883 /* Add check for digits != 0 because it seems that some
8884 gconverts are buggy in this case, and we don't yet have
8885 a Configure test for this. */
8886 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8887 /* 0, point, slack */
8888 Gconvert(nv, (int)digits, 0, ebuf);
8890 if (*ebuf) /* May return an empty string for digits==0 */
8893 } else if (!digits) {
8896 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8897 sv_catpvn(sv, p, l);
8903 #endif /* !USE_LONG_DOUBLE */
8905 if (!args && svix < svmax && DO_UTF8(*svargs))
8908 patend = (char*)pat + patlen;
8909 for (p = (char*)pat; p < patend; p = q) {
8912 bool vectorize = FALSE;
8913 bool vectorarg = FALSE;
8914 bool vec_utf8 = FALSE;
8920 bool has_precis = FALSE;
8923 bool is_utf8 = FALSE; /* is this item utf8? */
8924 #ifdef HAS_LDBL_SPRINTF_BUG
8925 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8926 with sfio - Allen <allens@cpan.org> */
8927 bool fix_ldbl_sprintf_bug = FALSE;
8931 U8 utf8buf[UTF8_MAXBYTES+1];
8932 STRLEN esignlen = 0;
8934 const char *eptr = Nullch;
8937 const U8 *vecstr = Null(U8*);
8944 /* we need a long double target in case HAS_LONG_DOUBLE but
8947 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8955 const char *dotstr = ".";
8956 STRLEN dotstrlen = 1;
8957 I32 efix = 0; /* explicit format parameter index */
8958 I32 ewix = 0; /* explicit width index */
8959 I32 epix = 0; /* explicit precision index */
8960 I32 evix = 0; /* explicit vector index */
8961 bool asterisk = FALSE;
8963 /* echo everything up to the next format specification */
8964 for (q = p; q < patend && *q != '%'; ++q) ;
8966 if (has_utf8 && !pat_utf8)
8967 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8969 sv_catpvn(sv, p, q - p);
8976 We allow format specification elements in this order:
8977 \d+\$ explicit format parameter index
8979 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8980 0 flag (as above): repeated to allow "v02"
8981 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8982 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8984 [%bcdefginopsux_DFOUX] format (mandatory)
8986 if (EXPECT_NUMBER(q, width)) {
9027 if (EXPECT_NUMBER(q, ewix))
9036 if ((vectorarg = asterisk)) {
9048 EXPECT_NUMBER(q, width);
9053 vecsv = va_arg(*args, SV*);
9055 vecsv = (evix ? evix <= svmax : svix < svmax) ?
9056 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
9057 dotstr = SvPV_const(vecsv, dotstrlen);
9062 vecsv = va_arg(*args, SV*);
9063 vecstr = (U8*)SvPV_const(vecsv,veclen);
9064 vec_utf8 = DO_UTF8(vecsv);
9066 else if (efix ? efix <= svmax : svix < svmax) {
9067 vecsv = svargs[efix ? efix-1 : svix++];
9068 vecstr = (U8*)SvPV_const(vecsv,veclen);
9069 vec_utf8 = DO_UTF8(vecsv);
9070 /* if this is a version object, we need to return the
9071 * stringified representation (which the SvPVX_const has
9072 * already done for us), but not vectorize the args
9074 if ( *q == 'd' && sv_derived_from(vecsv,"version") )
9076 q++; /* skip past the rest of the %vd format */
9077 eptr = (const char *) vecstr;
9078 elen = strlen(eptr);
9091 i = va_arg(*args, int);
9093 i = (ewix ? ewix <= svmax : svix < svmax) ?
9094 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9096 width = (i < 0) ? -i : i;
9106 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
9108 /* XXX: todo, support specified precision parameter */
9112 i = va_arg(*args, int);
9114 i = (ewix ? ewix <= svmax : svix < svmax)
9115 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
9116 precis = (i < 0) ? 0 : i;
9121 precis = precis * 10 + (*q++ - '0');
9130 case 'I': /* Ix, I32x, and I64x */
9132 if (q[1] == '6' && q[2] == '4') {
9138 if (q[1] == '3' && q[2] == '2') {
9148 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9159 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
9160 if (*(q + 1) == 'l') { /* lld, llf */
9185 argsv = (efix ? efix <= svmax : svix < svmax) ?
9186 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
9193 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9195 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9197 eptr = (char*)utf8buf;
9198 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9209 if (args && !vectorize) {
9210 eptr = va_arg(*args, char*);
9212 #ifdef MACOS_TRADITIONAL
9213 /* On MacOS, %#s format is used for Pascal strings */
9218 elen = strlen(eptr);
9220 eptr = (char *)nullstr;
9221 elen = sizeof nullstr - 1;
9225 eptr = SvPVx_const(argsv, elen);
9226 if (DO_UTF8(argsv)) {
9227 if (has_precis && precis < elen) {
9229 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9232 if (width) { /* fudge width (can't fudge elen) */
9233 width += elen - sv_len_utf8(argsv);
9241 if (has_precis && elen > precis)
9248 if (left && args) { /* SVf */
9257 argsv = va_arg(*args, SV*);
9258 eptr = SvPVx_const(argsv, elen);
9263 if (alt || vectorize)
9265 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9283 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9292 esignbuf[esignlen++] = plus;
9296 case 'h': iv = (short)va_arg(*args, int); break;
9297 case 'l': iv = va_arg(*args, long); break;
9298 case 'V': iv = va_arg(*args, IV); break;
9299 default: iv = va_arg(*args, int); break;
9301 case 'q': iv = va_arg(*args, Quad_t); break;
9306 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9308 case 'h': iv = (short)tiv; break;
9309 case 'l': iv = (long)tiv; break;
9311 default: iv = tiv; break;
9313 case 'q': iv = (Quad_t)tiv; break;
9317 if ( !vectorize ) /* we already set uv above */
9322 esignbuf[esignlen++] = plus;
9326 esignbuf[esignlen++] = '-';
9369 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9380 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9381 case 'l': uv = va_arg(*args, unsigned long); break;
9382 case 'V': uv = va_arg(*args, UV); break;
9383 default: uv = va_arg(*args, unsigned); break;
9385 case 'q': uv = va_arg(*args, Uquad_t); break;
9390 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9392 case 'h': uv = (unsigned short)tuv; break;
9393 case 'l': uv = (unsigned long)tuv; break;
9395 default: uv = tuv; break;
9397 case 'q': uv = (Uquad_t)tuv; break;
9404 char *ptr = ebuf + sizeof ebuf;
9410 p = (char*)((c == 'X')
9411 ? "0123456789ABCDEF" : "0123456789abcdef");
9417 esignbuf[esignlen++] = '0';
9418 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9426 if (alt && *ptr != '0')
9435 esignbuf[esignlen++] = '0';
9436 esignbuf[esignlen++] = 'b';
9439 default: /* it had better be ten or less */
9443 } while (uv /= base);
9446 elen = (ebuf + sizeof ebuf) - ptr;
9450 zeros = precis - elen;
9451 else if (precis == 0 && elen == 1 && *eptr == '0')
9457 /* FLOATING POINT */
9460 c = 'f'; /* maybe %F isn't supported here */
9466 /* This is evil, but floating point is even more evil */
9468 /* for SV-style calling, we can only get NV
9469 for C-style calling, we assume %f is double;
9470 for simplicity we allow any of %Lf, %llf, %qf for long double
9474 #if defined(USE_LONG_DOUBLE)
9478 /* [perl #20339] - we should accept and ignore %lf rather than die */
9482 #if defined(USE_LONG_DOUBLE)
9483 intsize = args ? 0 : 'q';
9487 #if defined(HAS_LONG_DOUBLE)
9496 /* now we need (long double) if intsize == 'q', else (double) */
9497 nv = (args && !vectorize) ?
9498 #if LONG_DOUBLESIZE > DOUBLESIZE
9500 va_arg(*args, long double) :
9501 va_arg(*args, double)
9503 va_arg(*args, double)
9509 if (c != 'e' && c != 'E') {
9511 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9512 will cast our (long double) to (double) */
9513 (void)Perl_frexp(nv, &i);
9514 if (i == PERL_INT_MIN)
9515 Perl_die(aTHX_ "panic: frexp");
9517 need = BIT_DIGITS(i);
9519 need += has_precis ? precis : 6; /* known default */
9524 #ifdef HAS_LDBL_SPRINTF_BUG
9525 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9526 with sfio - Allen <allens@cpan.org> */
9529 # define MY_DBL_MAX DBL_MAX
9530 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9531 # if DOUBLESIZE >= 8
9532 # define MY_DBL_MAX 1.7976931348623157E+308L
9534 # define MY_DBL_MAX 3.40282347E+38L
9538 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9539 # define MY_DBL_MAX_BUG 1L
9541 # define MY_DBL_MAX_BUG MY_DBL_MAX
9545 # define MY_DBL_MIN DBL_MIN
9546 # else /* XXX guessing! -Allen */
9547 # if DOUBLESIZE >= 8
9548 # define MY_DBL_MIN 2.2250738585072014E-308L
9550 # define MY_DBL_MIN 1.17549435E-38L
9554 if ((intsize == 'q') && (c == 'f') &&
9555 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9557 /* it's going to be short enough that
9558 * long double precision is not needed */
9560 if ((nv <= 0L) && (nv >= -0L))
9561 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9563 /* would use Perl_fp_class as a double-check but not
9564 * functional on IRIX - see perl.h comments */
9566 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9567 /* It's within the range that a double can represent */
9568 #if defined(DBL_MAX) && !defined(DBL_MIN)
9569 if ((nv >= ((long double)1/DBL_MAX)) ||
9570 (nv <= (-(long double)1/DBL_MAX)))
9572 fix_ldbl_sprintf_bug = TRUE;
9575 if (fix_ldbl_sprintf_bug == TRUE) {
9585 # undef MY_DBL_MAX_BUG
9588 #endif /* HAS_LDBL_SPRINTF_BUG */
9590 need += 20; /* fudge factor */
9591 if (PL_efloatsize < need) {
9592 Safefree(PL_efloatbuf);
9593 PL_efloatsize = need + 20; /* more fudge */
9594 New(906, PL_efloatbuf, PL_efloatsize, char);
9595 PL_efloatbuf[0] = '\0';
9598 if ( !(width || left || plus || alt) && fill != '0'
9599 && has_precis && intsize != 'q' ) { /* Shortcuts */
9600 /* See earlier comment about buggy Gconvert when digits,
9602 if ( c == 'g' && precis) {
9603 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9604 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9605 goto float_converted;
9606 } else if ( c == 'f' && !precis) {
9607 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9612 char *ptr = ebuf + sizeof ebuf;
9615 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9616 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9617 if (intsize == 'q') {
9618 /* Copy the one or more characters in a long double
9619 * format before the 'base' ([efgEFG]) character to
9620 * the format string. */
9621 static char const prifldbl[] = PERL_PRIfldbl;
9622 char const *p = prifldbl + sizeof(prifldbl) - 3;
9623 while (p >= prifldbl) { *--ptr = *p--; }
9628 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9633 do { *--ptr = '0' + (base % 10); } while (base /= 10);
9645 /* No taint. Otherwise we are in the strange situation
9646 * where printf() taints but print($float) doesn't.
9648 #if defined(HAS_LONG_DOUBLE)
9650 (void)sprintf(PL_efloatbuf, ptr, nv);
9652 (void)sprintf(PL_efloatbuf, ptr, (double)nv);
9654 (void)sprintf(PL_efloatbuf, ptr, nv);
9658 eptr = PL_efloatbuf;
9659 elen = strlen(PL_efloatbuf);
9665 i = SvCUR(sv) - origlen;
9666 if (args && !vectorize) {
9668 case 'h': *(va_arg(*args, short*)) = i; break;
9669 default: *(va_arg(*args, int*)) = i; break;
9670 case 'l': *(va_arg(*args, long*)) = i; break;
9671 case 'V': *(va_arg(*args, IV*)) = i; break;
9673 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9678 sv_setuv_mg(argsv, (UV)i);
9680 continue; /* not "break" */
9686 if (!args && ckWARN(WARN_PRINTF) &&
9687 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9688 SV *msg = sv_newmortal();
9689 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9690 (PL_op->op_type == OP_PRTF) ? "" : "s");
9693 Perl_sv_catpvf(aTHX_ msg,
9694 "\"%%%c\"", c & 0xFF);
9696 Perl_sv_catpvf(aTHX_ msg,
9697 "\"%%\\%03"UVof"\"",
9700 sv_catpv(msg, "end of string");
9701 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9704 /* output mangled stuff ... */
9710 /* ... right here, because formatting flags should not apply */
9711 SvGROW(sv, SvCUR(sv) + elen + 1);
9713 Copy(eptr, p, elen, char);
9716 SvCUR_set(sv, p - SvPVX_const(sv));
9718 continue; /* not "break" */
9721 /* calculate width before utf8_upgrade changes it */
9722 have = esignlen + zeros + elen;
9724 if (is_utf8 != has_utf8) {
9727 sv_utf8_upgrade(sv);
9730 SV * const nsv = sv_2mortal(newSVpvn(eptr, elen));
9731 sv_utf8_upgrade(nsv);
9732 eptr = SvPVX_const(nsv);
9735 SvGROW(sv, SvCUR(sv) + elen + 1);
9740 need = (have > width ? have : width);
9743 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9745 if (esignlen && fill == '0') {
9747 for (i = 0; i < (int)esignlen; i++)
9751 memset(p, fill, gap);
9754 if (esignlen && fill != '0') {
9756 for (i = 0; i < (int)esignlen; i++)
9761 for (i = zeros; i; i--)
9765 Copy(eptr, p, elen, char);
9769 memset(p, ' ', gap);
9774 Copy(dotstr, p, dotstrlen, char);
9778 vectorize = FALSE; /* done iterating over vecstr */
9785 SvCUR_set(sv, p - SvPVX_const(sv));
9793 /* =========================================================================
9795 =head1 Cloning an interpreter
9797 All the macros and functions in this section are for the private use of
9798 the main function, perl_clone().
9800 The foo_dup() functions make an exact copy of an existing foo thinngy.
9801 During the course of a cloning, a hash table is used to map old addresses
9802 to new addresses. The table is created and manipulated with the
9803 ptr_table_* functions.
9807 ============================================================================*/
9810 #if defined(USE_ITHREADS)
9812 #ifndef GpREFCNT_inc
9813 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9817 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9818 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9819 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9820 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9821 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9822 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9823 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9824 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9825 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9826 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9827 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9828 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9829 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9832 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9833 regcomp.c. AMS 20010712 */
9836 Perl_re_dup(pTHX_ const REGEXP *r, CLONE_PARAMS *param)
9841 struct reg_substr_datum *s;
9844 return (REGEXP *)NULL;
9846 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9849 len = r->offsets[0];
9850 npar = r->nparens+1;
9852 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9853 Copy(r->program, ret->program, len+1, regnode);
9855 New(0, ret->startp, npar, I32);
9856 Copy(r->startp, ret->startp, npar, I32);
9857 New(0, ret->endp, npar, I32);
9858 Copy(r->startp, ret->startp, npar, I32);
9860 New(0, ret->substrs, 1, struct reg_substr_data);
9861 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9862 s->min_offset = r->substrs->data[i].min_offset;
9863 s->max_offset = r->substrs->data[i].max_offset;
9864 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9865 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9868 ret->regstclass = NULL;
9871 const int count = r->data->count;
9874 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9875 char, struct reg_data);
9876 New(0, d->what, count, U8);
9879 for (i = 0; i < count; i++) {
9880 d->what[i] = r->data->what[i];
9881 switch (d->what[i]) {
9882 /* legal options are one of: sfpont
9883 see also regcomp.h and pregfree() */
9885 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9888 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9891 /* This is cheating. */
9892 New(0, d->data[i], 1, struct regnode_charclass_class);
9893 StructCopy(r->data->data[i], d->data[i],
9894 struct regnode_charclass_class);
9895 ret->regstclass = (regnode*)d->data[i];
9898 /* Compiled op trees are readonly, and can thus be
9899 shared without duplication. */
9901 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9905 d->data[i] = r->data->data[i];
9908 d->data[i] = r->data->data[i];
9910 ((reg_trie_data*)d->data[i])->refcount++;
9914 Perl_croak(aTHX_ "panic: re_dup unknown data code '%c'", r->data->what[i]);
9923 New(0, ret->offsets, 2*len+1, U32);
9924 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9926 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9927 ret->refcnt = r->refcnt;
9928 ret->minlen = r->minlen;
9929 ret->prelen = r->prelen;
9930 ret->nparens = r->nparens;
9931 ret->lastparen = r->lastparen;
9932 ret->lastcloseparen = r->lastcloseparen;
9933 ret->reganch = r->reganch;
9935 ret->sublen = r->sublen;
9937 if (RX_MATCH_COPIED(ret))
9938 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9940 ret->subbeg = Nullch;
9941 #ifdef PERL_OLD_COPY_ON_WRITE
9942 ret->saved_copy = Nullsv;
9945 ptr_table_store(PL_ptr_table, r, ret);
9949 /* duplicate a file handle */
9952 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9956 PERL_UNUSED_ARG(type);
9959 return (PerlIO*)NULL;
9961 /* look for it in the table first */
9962 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9966 /* create anew and remember what it is */
9967 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9968 ptr_table_store(PL_ptr_table, fp, ret);
9972 /* duplicate a directory handle */
9975 Perl_dirp_dup(pTHX_ DIR *dp)
9983 /* duplicate a typeglob */
9986 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9991 /* look for it in the table first */
9992 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9996 /* create anew and remember what it is */
9997 Newz(0, ret, 1, GP);
9998 ptr_table_store(PL_ptr_table, gp, ret);
10001 ret->gp_refcnt = 0; /* must be before any other dups! */
10002 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
10003 ret->gp_io = io_dup_inc(gp->gp_io, param);
10004 ret->gp_form = cv_dup_inc(gp->gp_form, param);
10005 ret->gp_av = av_dup_inc(gp->gp_av, param);
10006 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
10007 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
10008 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
10009 ret->gp_cvgen = gp->gp_cvgen;
10010 ret->gp_flags = gp->gp_flags;
10011 ret->gp_line = gp->gp_line;
10012 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
10016 /* duplicate a chain of magic */
10019 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
10021 MAGIC *mgprev = (MAGIC*)NULL;
10024 return (MAGIC*)NULL;
10025 /* look for it in the table first */
10026 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
10030 for (; mg; mg = mg->mg_moremagic) {
10032 Newz(0, nmg, 1, MAGIC);
10034 mgprev->mg_moremagic = nmg;
10037 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
10038 nmg->mg_private = mg->mg_private;
10039 nmg->mg_type = mg->mg_type;
10040 nmg->mg_flags = mg->mg_flags;
10041 if (mg->mg_type == PERL_MAGIC_qr) {
10042 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
10044 else if(mg->mg_type == PERL_MAGIC_backref) {
10045 const AV * const av = (AV*) mg->mg_obj;
10048 (void)SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
10050 for (i = AvFILLp(av); i >= 0; i--) {
10051 if (!svp[i]) continue;
10052 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
10055 else if (mg->mg_type == PERL_MAGIC_symtab) {
10056 nmg->mg_obj = mg->mg_obj;
10059 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
10060 ? sv_dup_inc(mg->mg_obj, param)
10061 : sv_dup(mg->mg_obj, param);
10063 nmg->mg_len = mg->mg_len;
10064 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
10065 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
10066 if (mg->mg_len > 0) {
10067 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
10068 if (mg->mg_type == PERL_MAGIC_overload_table &&
10069 AMT_AMAGIC((AMT*)mg->mg_ptr))
10071 AMT *amtp = (AMT*)mg->mg_ptr;
10072 AMT *namtp = (AMT*)nmg->mg_ptr;
10074 for (i = 1; i < NofAMmeth; i++) {
10075 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
10079 else if (mg->mg_len == HEf_SVKEY)
10080 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
10082 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
10083 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
10090 /* create a new pointer-mapping table */
10093 Perl_ptr_table_new(pTHX)
10096 Newz(0, tbl, 1, PTR_TBL_t);
10097 tbl->tbl_max = 511;
10098 tbl->tbl_items = 0;
10099 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
10104 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 3)
10106 # define PTR_TABLE_HASH(ptr) (PTR2UV(ptr) >> 2)
10109 #define new_pte() new_body(struct ptr_tbl_ent, pte)
10110 #define del_pte(p) del_body_type(p, struct ptr_tbl_ent, pte)
10112 /* map an existing pointer using a table */
10115 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, const void *sv)
10117 PTR_TBL_ENT_t *tblent;
10118 const UV hash = PTR_TABLE_HASH(sv);
10120 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
10121 for (; tblent; tblent = tblent->next) {
10122 if (tblent->oldval == sv)
10123 return tblent->newval;
10125 return (void*)NULL;
10128 /* add a new entry to a pointer-mapping table */
10131 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, const void *oldv, void *newv)
10133 PTR_TBL_ENT_t *tblent, **otblent;
10134 /* XXX this may be pessimal on platforms where pointers aren't good
10135 * hash values e.g. if they grow faster in the most significant
10137 const UV hash = PTR_TABLE_HASH(oldv);
10141 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
10142 for (tblent = *otblent; tblent; empty=0, tblent = tblent->next) {
10143 if (tblent->oldval == oldv) {
10144 tblent->newval = newv;
10148 tblent = new_pte();
10149 tblent->oldval = oldv;
10150 tblent->newval = newv;
10151 tblent->next = *otblent;
10154 if (!empty && tbl->tbl_items > tbl->tbl_max)
10155 ptr_table_split(tbl);
10158 /* double the hash bucket size of an existing ptr table */
10161 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
10163 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
10164 const UV oldsize = tbl->tbl_max + 1;
10165 UV newsize = oldsize * 2;
10168 Renew(ary, newsize, PTR_TBL_ENT_t*);
10169 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
10170 tbl->tbl_max = --newsize;
10171 tbl->tbl_ary = ary;
10172 for (i=0; i < oldsize; i++, ary++) {
10173 PTR_TBL_ENT_t **curentp, **entp, *ent;
10176 curentp = ary + oldsize;
10177 for (entp = ary, ent = *ary; ent; ent = *entp) {
10178 if ((newsize & PTR_TABLE_HASH(ent->oldval)) != i) {
10180 ent->next = *curentp;
10190 /* remove all the entries from a ptr table */
10193 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
10195 register PTR_TBL_ENT_t **array;
10196 register PTR_TBL_ENT_t *entry;
10200 if (!tbl || !tbl->tbl_items) {
10204 array = tbl->tbl_ary;
10206 max = tbl->tbl_max;
10210 PTR_TBL_ENT_t *oentry = entry;
10211 entry = entry->next;
10215 if (++riter > max) {
10218 entry = array[riter];
10222 tbl->tbl_items = 0;
10225 /* clear and free a ptr table */
10228 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10233 ptr_table_clear(tbl);
10234 Safefree(tbl->tbl_ary);
10240 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10243 SvRV_set(dstr, SvWEAKREF(sstr)
10244 ? sv_dup(SvRV(sstr), param)
10245 : sv_dup_inc(SvRV(sstr), param));
10248 else if (SvPVX_const(sstr)) {
10249 /* Has something there */
10251 /* Normal PV - clone whole allocated space */
10252 SvPV_set(dstr, SAVEPVN(SvPVX_const(sstr), SvLEN(sstr)-1));
10253 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10254 /* Not that normal - actually sstr is copy on write.
10255 But we are a true, independant SV, so: */
10256 SvREADONLY_off(dstr);
10261 /* Special case - not normally malloced for some reason */
10262 if ((SvREADONLY(sstr) && SvFAKE(sstr))) {
10263 /* A "shared" PV - clone it as "shared" PV */
10265 HEK_KEY(hek_dup(SvSHARED_HEK_FROM_PV(SvPVX_const(sstr)),
10269 /* Some other special case - random pointer */
10270 SvPV_set(dstr, SvPVX(sstr));
10275 /* Copy the Null */
10276 if (SvTYPE(dstr) == SVt_RV)
10277 SvRV_set(dstr, NULL);
10283 /* duplicate an SV of any type (including AV, HV etc) */
10286 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10291 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10293 /* look for it in the table first */
10294 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10298 if(param->flags & CLONEf_JOIN_IN) {
10299 /** We are joining here so we don't want do clone
10300 something that is bad **/
10301 const char *hvname;
10303 if(SvTYPE(sstr) == SVt_PVHV &&
10304 (hvname = HvNAME_get(sstr))) {
10305 /** don't clone stashes if they already exist **/
10306 HV* old_stash = gv_stashpv(hvname,0);
10307 return (SV*) old_stash;
10311 /* create anew and remember what it is */
10314 #ifdef DEBUG_LEAKING_SCALARS
10315 dstr->sv_debug_optype = sstr->sv_debug_optype;
10316 dstr->sv_debug_line = sstr->sv_debug_line;
10317 dstr->sv_debug_inpad = sstr->sv_debug_inpad;
10318 dstr->sv_debug_cloned = 1;
10320 dstr->sv_debug_file = savepv(sstr->sv_debug_file);
10322 dstr->sv_debug_file = savesharedpv(sstr->sv_debug_file);
10326 ptr_table_store(PL_ptr_table, sstr, dstr);
10329 SvFLAGS(dstr) = SvFLAGS(sstr);
10330 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10331 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10334 if (SvANY(sstr) && PL_watch_pvx && SvPVX_const(sstr) == PL_watch_pvx)
10335 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10336 PL_watch_pvx, SvPVX_const(sstr));
10339 /* don't clone objects whose class has asked us not to */
10340 if (SvOBJECT(sstr) && ! (SvFLAGS(SvSTASH(sstr)) & SVphv_CLONEABLE)) {
10341 SvFLAGS(dstr) &= ~SVTYPEMASK;
10342 SvOBJECT_off(dstr);
10346 switch (SvTYPE(sstr)) {
10348 SvANY(dstr) = NULL;
10351 SvANY(dstr) = (XPVIV*)((char*)&(dstr->sv_u.svu_iv) - STRUCT_OFFSET(XPVIV, xiv_iv));
10352 SvIV_set(dstr, SvIVX(sstr));
10355 SvANY(dstr) = new_XNV();
10356 SvNV_set(dstr, SvNVX(sstr));
10359 SvANY(dstr) = &(dstr->sv_u.svu_rv);
10360 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10364 /* These are all the types that need complex bodies allocating. */
10365 size_t new_body_length;
10366 size_t new_body_offset = 0;
10367 void **new_body_arena;
10368 void **new_body_arenaroot;
10371 switch (SvTYPE(sstr)) {
10373 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]",
10378 new_body = new_XPVIO();
10379 new_body_length = sizeof(XPVIO);
10382 new_body = new_XPVFM();
10383 new_body_length = sizeof(XPVFM);
10387 new_body_arena = (void **) &PL_xpvhv_root;
10388 new_body_arenaroot = (void **) &PL_xpvhv_arenaroot;
10389 new_body_offset = STRUCT_OFFSET(XPVHV, xhv_fill)
10390 - STRUCT_OFFSET(xpvhv_allocated, xhv_fill);
10391 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10392 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10396 new_body_arena = (void **) &PL_xpvav_root;
10397 new_body_arenaroot = (void **) &PL_xpvav_arenaroot;
10398 new_body_offset = STRUCT_OFFSET(XPVAV, xav_fill)
10399 - STRUCT_OFFSET(xpvav_allocated, xav_fill);
10400 new_body_length = STRUCT_OFFSET(XPVHV, xmg_stash)
10401 + sizeof (((XPVHV*)SvANY(sstr))->xmg_stash)
10405 new_body_length = sizeof(XPVBM);
10406 new_body_arena = (void **) &PL_xpvbm_root;
10407 new_body_arenaroot = (void **) &PL_xpvbm_arenaroot;
10410 if (GvUNIQUE((GV*)sstr)) {
10411 /* Do sharing here. */
10413 new_body_length = sizeof(XPVGV);
10414 new_body_arena = (void **) &PL_xpvgv_root;
10415 new_body_arenaroot = (void **) &PL_xpvgv_arenaroot;
10418 new_body_length = sizeof(XPVCV);
10419 new_body_arena = (void **) &PL_xpvcv_root;
10420 new_body_arenaroot = (void **) &PL_xpvcv_arenaroot;
10423 new_body_length = sizeof(XPVLV);
10424 new_body_arena = (void **) &PL_xpvlv_root;
10425 new_body_arenaroot = (void **) &PL_xpvlv_arenaroot;
10428 new_body_length = sizeof(XPVMG);
10429 new_body_arena = (void **) &PL_xpvmg_root;
10430 new_body_arenaroot = (void **) &PL_xpvmg_arenaroot;
10433 new_body_length = sizeof(XPVNV);
10434 new_body_arena = (void **) &PL_xpvnv_root;
10435 new_body_arenaroot = (void **) &PL_xpvnv_arenaroot;
10438 new_body_offset = STRUCT_OFFSET(XPVIV, xpv_cur)
10439 - STRUCT_OFFSET(xpviv_allocated, xpv_cur);
10440 new_body_length = sizeof(XPVIV) - new_body_offset;
10441 new_body_arena = (void **) &PL_xpviv_root;
10442 new_body_arenaroot = (void **) &PL_xpviv_arenaroot;
10445 new_body_offset = STRUCT_OFFSET(XPV, xpv_cur)
10446 - STRUCT_OFFSET(xpv_allocated, xpv_cur);
10447 new_body_length = sizeof(XPV) - new_body_offset;
10448 new_body_arena = (void **) &PL_xpv_root;
10449 new_body_arenaroot = (void **) &PL_xpv_arenaroot;
10451 assert(new_body_length);
10453 new_body = (void*)((char*)S_new_body(aTHX_ new_body_arenaroot,
10456 - new_body_offset);
10458 /* We always allocated the full length item with PURIFY */
10459 new_body_length += new_body_offset;
10460 new_body_offset = 0;
10461 new_body = my_safemalloc(new_body_length);
10465 SvANY(dstr) = new_body;
10467 Copy(((char*)SvANY(sstr)) + new_body_offset,
10468 ((char*)SvANY(dstr)) + new_body_offset,
10469 new_body_length, char);
10471 if (SvTYPE(sstr) != SVt_PVAV && SvTYPE(sstr) != SVt_PVHV)
10472 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10474 /* The Copy above means that all the source (unduplicated) pointers
10475 are now in the destination. We can check the flags and the
10476 pointers in either, but it's possible that there's less cache
10477 missing by always going for the destination.
10478 FIXME - instrument and check that assumption */
10479 if (SvTYPE(sstr) >= SVt_PVMG) {
10481 SvMAGIC_set(dstr, mg_dup(SvMAGIC(dstr), param));
10483 SvSTASH_set(dstr, hv_dup_inc(SvSTASH(dstr), param));
10486 switch (SvTYPE(sstr)) {
10498 /* XXX LvTARGOFF sometimes holds PMOP* when DEBUGGING */
10499 if (LvTYPE(dstr) == 't') /* for tie: unrefcnted fake (SV**) */
10500 LvTARG(dstr) = dstr;
10501 else if (LvTYPE(dstr) == 'T') /* for tie: fake HE */
10502 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(dstr), 0, param);
10504 LvTARG(dstr) = sv_dup_inc(LvTARG(dstr), param);
10507 GvNAME(dstr) = SAVEPVN(GvNAME(dstr), GvNAMELEN(dstr));
10508 GvSTASH(dstr) = hv_dup(GvSTASH(dstr), param);
10509 /* Don't call sv_add_backref here as it's going to be created
10510 as part of the magic cloning of the symbol table. */
10511 GvGP(dstr) = gp_dup(GvGP(dstr), param);
10512 (void)GpREFCNT_inc(GvGP(dstr));
10515 IoIFP(dstr) = fp_dup(IoIFP(dstr), IoTYPE(dstr), param);
10516 if (IoOFP(dstr) == IoIFP(sstr))
10517 IoOFP(dstr) = IoIFP(dstr);
10519 IoOFP(dstr) = fp_dup(IoOFP(dstr), IoTYPE(dstr), param);
10520 /* PL_rsfp_filters entries have fake IoDIRP() */
10521 if (IoDIRP(dstr) && !(IoFLAGS(dstr) & IOf_FAKE_DIRP))
10522 IoDIRP(dstr) = dirp_dup(IoDIRP(dstr));
10523 if(IoFLAGS(dstr) & IOf_FAKE_DIRP) {
10524 /* I have no idea why fake dirp (rsfps)
10525 should be treated differently but otherwise
10526 we end up with leaks -- sky*/
10527 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(dstr), param);
10528 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(dstr), param);
10529 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(dstr), param);
10531 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(dstr), param);
10532 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(dstr), param);
10533 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(dstr), param);
10535 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(dstr));
10536 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(dstr));
10537 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(dstr));
10540 if (AvARRAY((AV*)sstr)) {
10541 SV **dst_ary, **src_ary;
10542 SSize_t items = AvFILLp((AV*)sstr) + 1;
10544 src_ary = AvARRAY((AV*)sstr);
10545 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10546 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10547 SvPV_set(dstr, (char*)dst_ary);
10548 AvALLOC((AV*)dstr) = dst_ary;
10549 if (AvREAL((AV*)sstr)) {
10550 while (items-- > 0)
10551 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10554 while (items-- > 0)
10555 *dst_ary++ = sv_dup(*src_ary++, param);
10557 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10558 while (items-- > 0) {
10559 *dst_ary++ = &PL_sv_undef;
10563 SvPV_set(dstr, Nullch);
10564 AvALLOC((AV*)dstr) = (SV**)NULL;
10571 if (HvARRAY((HV*)sstr)) {
10573 const bool sharekeys = !!HvSHAREKEYS(sstr);
10574 XPVHV * const dxhv = (XPVHV*)SvANY(dstr);
10575 XPVHV * const sxhv = (XPVHV*)SvANY(sstr);
10578 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1)
10579 + (SvOOK(sstr) ? sizeof(struct xpvhv_aux) : 0),
10581 HvARRAY(dstr) = (HE**)darray;
10582 while (i <= sxhv->xhv_max) {
10583 HE *source = HvARRAY(sstr)[i];
10584 HvARRAY(dstr)[i] = source
10585 ? he_dup(source, sharekeys, param) : 0;
10589 struct xpvhv_aux *saux = HvAUX(sstr);
10590 struct xpvhv_aux *daux = HvAUX(dstr);
10591 /* This flag isn't copied. */
10592 /* SvOOK_on(hv) attacks the IV flags. */
10593 SvFLAGS(dstr) |= SVf_OOK;
10595 hvname = saux->xhv_name;
10597 = hvname ? hek_dup(hvname, param) : hvname;
10599 daux->xhv_riter = saux->xhv_riter;
10600 daux->xhv_eiter = saux->xhv_eiter
10601 ? he_dup(saux->xhv_eiter,
10602 (bool)!!HvSHAREKEYS(sstr), param) : 0;
10606 SvPV_set(dstr, Nullch);
10608 /* Record stashes for possible cloning in Perl_clone(). */
10610 av_push(param->stashes, dstr);
10615 /* NOTE: not refcounted */
10616 CvSTASH(dstr) = hv_dup(CvSTASH(dstr), param);
10618 CvROOT(dstr) = OpREFCNT_inc(CvROOT(dstr));
10620 if (CvCONST(dstr)) {
10621 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(dstr)) ?
10622 SvREFCNT_inc(CvXSUBANY(dstr).any_ptr) :
10623 sv_dup_inc((SV *)CvXSUBANY(dstr).any_ptr, param);
10625 /* don't dup if copying back - CvGV isn't refcounted, so the
10626 * duped GV may never be freed. A bit of a hack! DAPM */
10627 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10628 Nullgv : gv_dup(CvGV(dstr), param) ;
10629 if (!(param->flags & CLONEf_COPY_STACKS)) {
10632 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10634 CvWEAKOUTSIDE(sstr)
10635 ? cv_dup( CvOUTSIDE(dstr), param)
10636 : cv_dup_inc(CvOUTSIDE(dstr), param);
10638 CvFILE(dstr) = SAVEPV(CvFILE(dstr));
10644 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10650 /* duplicate a context */
10653 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10655 PERL_CONTEXT *ncxs;
10658 return (PERL_CONTEXT*)NULL;
10660 /* look for it in the table first */
10661 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10665 /* create anew and remember what it is */
10666 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10667 ptr_table_store(PL_ptr_table, cxs, ncxs);
10670 PERL_CONTEXT *cx = &cxs[ix];
10671 PERL_CONTEXT *ncx = &ncxs[ix];
10672 ncx->cx_type = cx->cx_type;
10673 if (CxTYPE(cx) == CXt_SUBST) {
10674 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10677 ncx->blk_oldsp = cx->blk_oldsp;
10678 ncx->blk_oldcop = cx->blk_oldcop;
10679 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10680 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10681 ncx->blk_oldpm = cx->blk_oldpm;
10682 ncx->blk_gimme = cx->blk_gimme;
10683 switch (CxTYPE(cx)) {
10685 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10686 ? cv_dup_inc(cx->blk_sub.cv, param)
10687 : cv_dup(cx->blk_sub.cv,param));
10688 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10689 ? av_dup_inc(cx->blk_sub.argarray, param)
10691 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10692 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10693 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10694 ncx->blk_sub.lval = cx->blk_sub.lval;
10695 ncx->blk_sub.retop = cx->blk_sub.retop;
10698 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10699 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10700 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10701 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10702 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10703 ncx->blk_eval.retop = cx->blk_eval.retop;
10706 ncx->blk_loop.label = cx->blk_loop.label;
10707 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10708 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10709 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10710 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10711 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10712 ? cx->blk_loop.iterdata
10713 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10714 ncx->blk_loop.oldcomppad
10715 = (PAD*)ptr_table_fetch(PL_ptr_table,
10716 cx->blk_loop.oldcomppad);
10717 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10718 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10719 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10720 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10721 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10724 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10725 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10726 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10727 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10728 ncx->blk_sub.retop = cx->blk_sub.retop;
10740 /* duplicate a stack info structure */
10743 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10748 return (PERL_SI*)NULL;
10750 /* look for it in the table first */
10751 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10755 /* create anew and remember what it is */
10756 Newz(56, nsi, 1, PERL_SI);
10757 ptr_table_store(PL_ptr_table, si, nsi);
10759 nsi->si_stack = av_dup_inc(si->si_stack, param);
10760 nsi->si_cxix = si->si_cxix;
10761 nsi->si_cxmax = si->si_cxmax;
10762 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10763 nsi->si_type = si->si_type;
10764 nsi->si_prev = si_dup(si->si_prev, param);
10765 nsi->si_next = si_dup(si->si_next, param);
10766 nsi->si_markoff = si->si_markoff;
10771 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10772 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10773 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10774 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10775 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10776 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10777 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10778 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10779 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10780 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10781 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10782 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10783 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10784 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10787 #define pv_dup_inc(p) SAVEPV(p)
10788 #define pv_dup(p) SAVEPV(p)
10789 #define svp_dup_inc(p,pp) any_dup(p,pp)
10791 /* map any object to the new equivent - either something in the
10792 * ptr table, or something in the interpreter structure
10796 Perl_any_dup(pTHX_ void *v, const PerlInterpreter *proto_perl)
10801 return (void*)NULL;
10803 /* look for it in the table first */
10804 ret = ptr_table_fetch(PL_ptr_table, v);
10808 /* see if it is part of the interpreter structure */
10809 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10810 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10818 /* duplicate the save stack */
10821 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10823 ANY * const ss = proto_perl->Tsavestack;
10824 const I32 max = proto_perl->Tsavestack_max;
10825 I32 ix = proto_perl->Tsavestack_ix;
10837 void (*dptr) (void*);
10838 void (*dxptr) (pTHX_ void*);
10840 Newz(54, nss, max, ANY);
10843 I32 i = POPINT(ss,ix);
10844 TOPINT(nss,ix) = i;
10846 case SAVEt_ITEM: /* normal string */
10847 sv = (SV*)POPPTR(ss,ix);
10848 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10849 sv = (SV*)POPPTR(ss,ix);
10850 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10852 case SAVEt_SV: /* scalar reference */
10853 sv = (SV*)POPPTR(ss,ix);
10854 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10855 gv = (GV*)POPPTR(ss,ix);
10856 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10858 case SAVEt_GENERIC_PVREF: /* generic char* */
10859 c = (char*)POPPTR(ss,ix);
10860 TOPPTR(nss,ix) = pv_dup(c);
10861 ptr = POPPTR(ss,ix);
10862 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10864 case SAVEt_SHARED_PVREF: /* char* in shared space */
10865 c = (char*)POPPTR(ss,ix);
10866 TOPPTR(nss,ix) = savesharedpv(c);
10867 ptr = POPPTR(ss,ix);
10868 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10870 case SAVEt_GENERIC_SVREF: /* generic sv */
10871 case SAVEt_SVREF: /* scalar reference */
10872 sv = (SV*)POPPTR(ss,ix);
10873 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10874 ptr = POPPTR(ss,ix);
10875 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10877 case SAVEt_AV: /* array reference */
10878 av = (AV*)POPPTR(ss,ix);
10879 TOPPTR(nss,ix) = av_dup_inc(av, param);
10880 gv = (GV*)POPPTR(ss,ix);
10881 TOPPTR(nss,ix) = gv_dup(gv, param);
10883 case SAVEt_HV: /* hash reference */
10884 hv = (HV*)POPPTR(ss,ix);
10885 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10886 gv = (GV*)POPPTR(ss,ix);
10887 TOPPTR(nss,ix) = gv_dup(gv, param);
10889 case SAVEt_INT: /* int reference */
10890 ptr = POPPTR(ss,ix);
10891 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10892 intval = (int)POPINT(ss,ix);
10893 TOPINT(nss,ix) = intval;
10895 case SAVEt_LONG: /* long reference */
10896 ptr = POPPTR(ss,ix);
10897 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10898 longval = (long)POPLONG(ss,ix);
10899 TOPLONG(nss,ix) = longval;
10901 case SAVEt_I32: /* I32 reference */
10902 case SAVEt_I16: /* I16 reference */
10903 case SAVEt_I8: /* I8 reference */
10904 ptr = POPPTR(ss,ix);
10905 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10907 TOPINT(nss,ix) = i;
10909 case SAVEt_IV: /* IV reference */
10910 ptr = POPPTR(ss,ix);
10911 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10913 TOPIV(nss,ix) = iv;
10915 case SAVEt_SPTR: /* SV* reference */
10916 ptr = POPPTR(ss,ix);
10917 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10918 sv = (SV*)POPPTR(ss,ix);
10919 TOPPTR(nss,ix) = sv_dup(sv, param);
10921 case SAVEt_VPTR: /* random* reference */
10922 ptr = POPPTR(ss,ix);
10923 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10924 ptr = POPPTR(ss,ix);
10925 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10927 case SAVEt_PPTR: /* char* reference */
10928 ptr = POPPTR(ss,ix);
10929 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10930 c = (char*)POPPTR(ss,ix);
10931 TOPPTR(nss,ix) = pv_dup(c);
10933 case SAVEt_HPTR: /* HV* reference */
10934 ptr = POPPTR(ss,ix);
10935 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10936 hv = (HV*)POPPTR(ss,ix);
10937 TOPPTR(nss,ix) = hv_dup(hv, param);
10939 case SAVEt_APTR: /* AV* reference */
10940 ptr = POPPTR(ss,ix);
10941 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10942 av = (AV*)POPPTR(ss,ix);
10943 TOPPTR(nss,ix) = av_dup(av, param);
10946 gv = (GV*)POPPTR(ss,ix);
10947 TOPPTR(nss,ix) = gv_dup(gv, param);
10949 case SAVEt_GP: /* scalar reference */
10950 gp = (GP*)POPPTR(ss,ix);
10951 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10952 (void)GpREFCNT_inc(gp);
10953 gv = (GV*)POPPTR(ss,ix);
10954 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10955 c = (char*)POPPTR(ss,ix);
10956 TOPPTR(nss,ix) = pv_dup(c);
10958 TOPIV(nss,ix) = iv;
10960 TOPIV(nss,ix) = iv;
10963 case SAVEt_MORTALIZESV:
10964 sv = (SV*)POPPTR(ss,ix);
10965 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10968 ptr = POPPTR(ss,ix);
10969 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10970 /* these are assumed to be refcounted properly */
10972 switch (((OP*)ptr)->op_type) {
10974 case OP_LEAVESUBLV:
10978 case OP_LEAVEWRITE:
10979 TOPPTR(nss,ix) = ptr;
10984 TOPPTR(nss,ix) = Nullop;
10989 TOPPTR(nss,ix) = Nullop;
10992 c = (char*)POPPTR(ss,ix);
10993 TOPPTR(nss,ix) = pv_dup_inc(c);
10995 case SAVEt_CLEARSV:
10996 longval = POPLONG(ss,ix);
10997 TOPLONG(nss,ix) = longval;
11000 hv = (HV*)POPPTR(ss,ix);
11001 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11002 c = (char*)POPPTR(ss,ix);
11003 TOPPTR(nss,ix) = pv_dup_inc(c);
11005 TOPINT(nss,ix) = i;
11007 case SAVEt_DESTRUCTOR:
11008 ptr = POPPTR(ss,ix);
11009 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11010 dptr = POPDPTR(ss,ix);
11011 TOPDPTR(nss,ix) = DPTR2FPTR(void (*)(void*),
11012 any_dup(FPTR2DPTR(void *, dptr),
11015 case SAVEt_DESTRUCTOR_X:
11016 ptr = POPPTR(ss,ix);
11017 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
11018 dxptr = POPDXPTR(ss,ix);
11019 TOPDXPTR(nss,ix) = DPTR2FPTR(void (*)(pTHX_ void*),
11020 any_dup(FPTR2DPTR(void *, dxptr),
11023 case SAVEt_REGCONTEXT:
11026 TOPINT(nss,ix) = i;
11029 case SAVEt_STACK_POS: /* Position on Perl stack */
11031 TOPINT(nss,ix) = i;
11033 case SAVEt_AELEM: /* array element */
11034 sv = (SV*)POPPTR(ss,ix);
11035 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11037 TOPINT(nss,ix) = i;
11038 av = (AV*)POPPTR(ss,ix);
11039 TOPPTR(nss,ix) = av_dup_inc(av, param);
11041 case SAVEt_HELEM: /* hash element */
11042 sv = (SV*)POPPTR(ss,ix);
11043 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11044 sv = (SV*)POPPTR(ss,ix);
11045 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
11046 hv = (HV*)POPPTR(ss,ix);
11047 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
11050 ptr = POPPTR(ss,ix);
11051 TOPPTR(nss,ix) = ptr;
11055 TOPINT(nss,ix) = i;
11057 case SAVEt_COMPPAD:
11058 av = (AV*)POPPTR(ss,ix);
11059 TOPPTR(nss,ix) = av_dup(av, param);
11062 longval = (long)POPLONG(ss,ix);
11063 TOPLONG(nss,ix) = longval;
11064 ptr = POPPTR(ss,ix);
11065 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11066 sv = (SV*)POPPTR(ss,ix);
11067 TOPPTR(nss,ix) = sv_dup(sv, param);
11070 ptr = POPPTR(ss,ix);
11071 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
11072 longval = (long)POPBOOL(ss,ix);
11073 TOPBOOL(nss,ix) = (bool)longval;
11075 case SAVEt_SET_SVFLAGS:
11077 TOPINT(nss,ix) = i;
11079 TOPINT(nss,ix) = i;
11080 sv = (SV*)POPPTR(ss,ix);
11081 TOPPTR(nss,ix) = sv_dup(sv, param);
11084 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
11092 /* if sv is a stash, call $class->CLONE_SKIP(), and set the SVphv_CLONEABLE
11093 * flag to the result. This is done for each stash before cloning starts,
11094 * so we know which stashes want their objects cloned */
11097 do_mark_cloneable_stash(pTHX_ SV *sv)
11099 const HEK * const hvname = HvNAME_HEK((HV*)sv);
11101 GV* const cloner = gv_fetchmethod_autoload((HV*)sv, "CLONE_SKIP", 0);
11102 SvFLAGS(sv) |= SVphv_CLONEABLE; /* clone objects by default */
11103 if (cloner && GvCV(cloner)) {
11110 XPUSHs(sv_2mortal(newSVhek(hvname)));
11112 call_sv((SV*)GvCV(cloner), G_SCALAR);
11119 SvFLAGS(sv) &= ~SVphv_CLONEABLE;
11127 =for apidoc perl_clone
11129 Create and return a new interpreter by cloning the current one.
11131 perl_clone takes these flags as parameters:
11133 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
11134 without it we only clone the data and zero the stacks,
11135 with it we copy the stacks and the new perl interpreter is
11136 ready to run at the exact same point as the previous one.
11137 The pseudo-fork code uses COPY_STACKS while the
11138 threads->new doesn't.
11140 CLONEf_KEEP_PTR_TABLE
11141 perl_clone keeps a ptr_table with the pointer of the old
11142 variable as a key and the new variable as a value,
11143 this allows it to check if something has been cloned and not
11144 clone it again but rather just use the value and increase the
11145 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
11146 the ptr_table using the function
11147 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
11148 reason to keep it around is if you want to dup some of your own
11149 variable who are outside the graph perl scans, example of this
11150 code is in threads.xs create
11153 This is a win32 thing, it is ignored on unix, it tells perls
11154 win32host code (which is c++) to clone itself, this is needed on
11155 win32 if you want to run two threads at the same time,
11156 if you just want to do some stuff in a separate perl interpreter
11157 and then throw it away and return to the original one,
11158 you don't need to do anything.
11163 /* XXX the above needs expanding by someone who actually understands it ! */
11164 EXTERN_C PerlInterpreter *
11165 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
11168 perl_clone(PerlInterpreter *proto_perl, UV flags)
11171 #ifdef PERL_IMPLICIT_SYS
11173 /* perlhost.h so we need to call into it
11174 to clone the host, CPerlHost should have a c interface, sky */
11176 if (flags & CLONEf_CLONE_HOST) {
11177 return perl_clone_host(proto_perl,flags);
11179 return perl_clone_using(proto_perl, flags,
11181 proto_perl->IMemShared,
11182 proto_perl->IMemParse,
11184 proto_perl->IStdIO,
11188 proto_perl->IProc);
11192 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
11193 struct IPerlMem* ipM, struct IPerlMem* ipMS,
11194 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
11195 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
11196 struct IPerlDir* ipD, struct IPerlSock* ipS,
11197 struct IPerlProc* ipP)
11199 /* XXX many of the string copies here can be optimized if they're
11200 * constants; they need to be allocated as common memory and just
11201 * their pointers copied. */
11204 CLONE_PARAMS clone_params;
11205 CLONE_PARAMS* param = &clone_params;
11207 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
11208 /* for each stash, determine whether its objects should be cloned */
11209 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11210 PERL_SET_THX(my_perl);
11213 Poison(my_perl, 1, PerlInterpreter);
11215 PL_curcop = (COP *)Nullop;
11219 PL_savestack_ix = 0;
11220 PL_savestack_max = -1;
11221 PL_sig_pending = 0;
11222 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11223 # else /* !DEBUGGING */
11224 Zero(my_perl, 1, PerlInterpreter);
11225 # endif /* DEBUGGING */
11227 /* host pointers */
11229 PL_MemShared = ipMS;
11230 PL_MemParse = ipMP;
11237 #else /* !PERL_IMPLICIT_SYS */
11239 CLONE_PARAMS clone_params;
11240 CLONE_PARAMS* param = &clone_params;
11241 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11242 /* for each stash, determine whether its objects should be cloned */
11243 S_visit(proto_perl, do_mark_cloneable_stash, SVt_PVHV, SVTYPEMASK);
11244 PERL_SET_THX(my_perl);
11247 Poison(my_perl, 1, PerlInterpreter);
11249 PL_curcop = (COP *)Nullop;
11253 PL_savestack_ix = 0;
11254 PL_savestack_max = -1;
11255 PL_sig_pending = 0;
11256 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11257 # else /* !DEBUGGING */
11258 Zero(my_perl, 1, PerlInterpreter);
11259 # endif /* DEBUGGING */
11260 #endif /* PERL_IMPLICIT_SYS */
11261 param->flags = flags;
11262 param->proto_perl = proto_perl;
11265 PL_xnv_arenaroot = NULL;
11266 PL_xnv_root = NULL;
11267 PL_xpv_arenaroot = NULL;
11268 PL_xpv_root = NULL;
11269 PL_xpviv_arenaroot = NULL;
11270 PL_xpviv_root = NULL;
11271 PL_xpvnv_arenaroot = NULL;
11272 PL_xpvnv_root = NULL;
11273 PL_xpvcv_arenaroot = NULL;
11274 PL_xpvcv_root = NULL;
11275 PL_xpvav_arenaroot = NULL;
11276 PL_xpvav_root = NULL;
11277 PL_xpvhv_arenaroot = NULL;
11278 PL_xpvhv_root = NULL;
11279 PL_xpvmg_arenaroot = NULL;
11280 PL_xpvmg_root = NULL;
11281 PL_xpvgv_arenaroot = NULL;
11282 PL_xpvgv_root = NULL;
11283 PL_xpvlv_arenaroot = NULL;
11284 PL_xpvlv_root = NULL;
11285 PL_xpvbm_arenaroot = NULL;
11286 PL_xpvbm_root = NULL;
11287 PL_he_arenaroot = NULL;
11289 #if defined(USE_ITHREADS)
11290 PL_pte_arenaroot = NULL;
11291 PL_pte_root = NULL;
11293 PL_nice_chunk = NULL;
11294 PL_nice_chunk_size = 0;
11296 PL_sv_objcount = 0;
11297 PL_sv_root = Nullsv;
11298 PL_sv_arenaroot = Nullsv;
11300 PL_debug = proto_perl->Idebug;
11302 PL_hash_seed = proto_perl->Ihash_seed;
11303 PL_rehash_seed = proto_perl->Irehash_seed;
11305 #ifdef USE_REENTRANT_API
11306 /* XXX: things like -Dm will segfault here in perlio, but doing
11307 * PERL_SET_CONTEXT(proto_perl);
11308 * breaks too many other things
11310 Perl_reentrant_init(aTHX);
11313 /* create SV map for pointer relocation */
11314 PL_ptr_table = ptr_table_new();
11316 /* initialize these special pointers as early as possible */
11317 SvANY(&PL_sv_undef) = NULL;
11318 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11319 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11320 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11322 SvANY(&PL_sv_no) = new_XPVNV();
11323 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11324 SvFLAGS(&PL_sv_no) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11325 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11326 SvPV_set(&PL_sv_no, SAVEPVN(PL_No, 0));
11327 SvCUR_set(&PL_sv_no, 0);
11328 SvLEN_set(&PL_sv_no, 1);
11329 SvIV_set(&PL_sv_no, 0);
11330 SvNV_set(&PL_sv_no, 0);
11331 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11333 SvANY(&PL_sv_yes) = new_XPVNV();
11334 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11335 SvFLAGS(&PL_sv_yes) = SVp_IOK|SVf_IOK|SVp_NOK|SVf_NOK
11336 |SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11337 SvPV_set(&PL_sv_yes, SAVEPVN(PL_Yes, 1));
11338 SvCUR_set(&PL_sv_yes, 1);
11339 SvLEN_set(&PL_sv_yes, 2);
11340 SvIV_set(&PL_sv_yes, 1);
11341 SvNV_set(&PL_sv_yes, 1);
11342 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11344 /* create (a non-shared!) shared string table */
11345 PL_strtab = newHV();
11346 HvSHAREKEYS_off(PL_strtab);
11347 hv_ksplit(PL_strtab, HvTOTALKEYS(proto_perl->Istrtab));
11348 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11350 PL_compiling = proto_perl->Icompiling;
11352 /* These two PVs will be free'd special way so must set them same way op.c does */
11353 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11354 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11356 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11357 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11359 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11360 if (!specialWARN(PL_compiling.cop_warnings))
11361 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11362 if (!specialCopIO(PL_compiling.cop_io))
11363 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11364 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11366 /* pseudo environmental stuff */
11367 PL_origargc = proto_perl->Iorigargc;
11368 PL_origargv = proto_perl->Iorigargv;
11370 param->stashes = newAV(); /* Setup array of objects to call clone on */
11372 #ifdef PERLIO_LAYERS
11373 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11374 PerlIO_clone(aTHX_ proto_perl, param);
11377 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11378 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11379 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11380 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11381 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11382 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11385 PL_minus_c = proto_perl->Iminus_c;
11386 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11387 PL_localpatches = proto_perl->Ilocalpatches;
11388 PL_splitstr = proto_perl->Isplitstr;
11389 PL_preprocess = proto_perl->Ipreprocess;
11390 PL_minus_n = proto_perl->Iminus_n;
11391 PL_minus_p = proto_perl->Iminus_p;
11392 PL_minus_l = proto_perl->Iminus_l;
11393 PL_minus_a = proto_perl->Iminus_a;
11394 PL_minus_F = proto_perl->Iminus_F;
11395 PL_doswitches = proto_perl->Idoswitches;
11396 PL_dowarn = proto_perl->Idowarn;
11397 PL_doextract = proto_perl->Idoextract;
11398 PL_sawampersand = proto_perl->Isawampersand;
11399 PL_unsafe = proto_perl->Iunsafe;
11400 PL_inplace = SAVEPV(proto_perl->Iinplace);
11401 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11402 PL_perldb = proto_perl->Iperldb;
11403 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11404 PL_exit_flags = proto_perl->Iexit_flags;
11406 /* magical thingies */
11407 /* XXX time(&PL_basetime) when asked for? */
11408 PL_basetime = proto_perl->Ibasetime;
11409 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11411 PL_maxsysfd = proto_perl->Imaxsysfd;
11412 PL_multiline = proto_perl->Imultiline;
11413 PL_statusvalue = proto_perl->Istatusvalue;
11415 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11417 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11419 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11420 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11421 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11423 /* Clone the regex array */
11424 PL_regex_padav = newAV();
11426 const I32 len = av_len((AV*)proto_perl->Iregex_padav);
11427 SV** const regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11429 av_push(PL_regex_padav,
11430 sv_dup_inc(regexen[0],param));
11431 for(i = 1; i <= len; i++) {
11432 if(SvREPADTMP(regexen[i])) {
11433 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11435 av_push(PL_regex_padav,
11437 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11438 SvIVX(regexen[i])), param)))
11443 PL_regex_pad = AvARRAY(PL_regex_padav);
11445 /* shortcuts to various I/O objects */
11446 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11447 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11448 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11449 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11450 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11451 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11453 /* shortcuts to regexp stuff */
11454 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11456 /* shortcuts to misc objects */
11457 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11459 /* shortcuts to debugging objects */
11460 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11461 PL_DBline = gv_dup(proto_perl->IDBline, param);
11462 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11463 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11464 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11465 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11466 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11467 PL_lineary = av_dup(proto_perl->Ilineary, param);
11468 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11470 /* symbol tables */
11471 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11472 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11473 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11474 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11475 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11477 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11478 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11479 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11480 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11481 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11482 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11484 PL_sub_generation = proto_perl->Isub_generation;
11486 /* funky return mechanisms */
11487 PL_forkprocess = proto_perl->Iforkprocess;
11489 /* subprocess state */
11490 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11492 /* internal state */
11493 PL_tainting = proto_perl->Itainting;
11494 PL_taint_warn = proto_perl->Itaint_warn;
11495 PL_maxo = proto_perl->Imaxo;
11496 if (proto_perl->Iop_mask)
11497 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11499 PL_op_mask = Nullch;
11500 /* PL_asserting = proto_perl->Iasserting; */
11502 /* current interpreter roots */
11503 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11504 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11505 PL_main_start = proto_perl->Imain_start;
11506 PL_eval_root = proto_perl->Ieval_root;
11507 PL_eval_start = proto_perl->Ieval_start;
11509 /* runtime control stuff */
11510 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11511 PL_copline = proto_perl->Icopline;
11513 PL_filemode = proto_perl->Ifilemode;
11514 PL_lastfd = proto_perl->Ilastfd;
11515 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11518 PL_gensym = proto_perl->Igensym;
11519 PL_preambled = proto_perl->Ipreambled;
11520 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11521 PL_laststatval = proto_perl->Ilaststatval;
11522 PL_laststype = proto_perl->Ilaststype;
11523 PL_mess_sv = Nullsv;
11525 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11527 /* interpreter atexit processing */
11528 PL_exitlistlen = proto_perl->Iexitlistlen;
11529 if (PL_exitlistlen) {
11530 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11531 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11534 PL_exitlist = (PerlExitListEntry*)NULL;
11535 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11536 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11537 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11539 PL_profiledata = NULL;
11540 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11541 /* PL_rsfp_filters entries have fake IoDIRP() */
11542 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11544 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11546 PAD_CLONE_VARS(proto_perl, param);
11548 #ifdef HAVE_INTERP_INTERN
11549 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11552 /* more statics moved here */
11553 PL_generation = proto_perl->Igeneration;
11554 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11556 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11557 PL_in_clean_all = proto_perl->Iin_clean_all;
11559 PL_uid = proto_perl->Iuid;
11560 PL_euid = proto_perl->Ieuid;
11561 PL_gid = proto_perl->Igid;
11562 PL_egid = proto_perl->Iegid;
11563 PL_nomemok = proto_perl->Inomemok;
11564 PL_an = proto_perl->Ian;
11565 PL_evalseq = proto_perl->Ievalseq;
11566 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11567 PL_origalen = proto_perl->Iorigalen;
11568 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11569 PL_osname = SAVEPV(proto_perl->Iosname);
11570 PL_sighandlerp = proto_perl->Isighandlerp;
11572 PL_runops = proto_perl->Irunops;
11574 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11577 PL_cshlen = proto_perl->Icshlen;
11578 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11581 PL_lex_state = proto_perl->Ilex_state;
11582 PL_lex_defer = proto_perl->Ilex_defer;
11583 PL_lex_expect = proto_perl->Ilex_expect;
11584 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11585 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11586 PL_lex_starts = proto_perl->Ilex_starts;
11587 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11588 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11589 PL_lex_op = proto_perl->Ilex_op;
11590 PL_lex_inpat = proto_perl->Ilex_inpat;
11591 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11592 PL_lex_brackets = proto_perl->Ilex_brackets;
11593 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11594 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11595 PL_lex_casemods = proto_perl->Ilex_casemods;
11596 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11597 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11599 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11600 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11601 PL_nexttoke = proto_perl->Inexttoke;
11603 /* XXX This is probably masking the deeper issue of why
11604 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11605 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11606 * (A little debugging with a watchpoint on it may help.)
11608 if (SvANY(proto_perl->Ilinestr)) {
11609 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11610 i = proto_perl->Ibufptr - SvPVX_const(proto_perl->Ilinestr);
11611 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11612 i = proto_perl->Ioldbufptr - SvPVX_const(proto_perl->Ilinestr);
11613 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11614 i = proto_perl->Ioldoldbufptr - SvPVX_const(proto_perl->Ilinestr);
11615 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11616 i = proto_perl->Ilinestart - SvPVX_const(proto_perl->Ilinestr);
11617 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11620 PL_linestr = NEWSV(65,79);
11621 sv_upgrade(PL_linestr,SVt_PVIV);
11622 sv_setpvn(PL_linestr,"",0);
11623 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11625 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11626 PL_pending_ident = proto_perl->Ipending_ident;
11627 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11629 PL_expect = proto_perl->Iexpect;
11631 PL_multi_start = proto_perl->Imulti_start;
11632 PL_multi_end = proto_perl->Imulti_end;
11633 PL_multi_open = proto_perl->Imulti_open;
11634 PL_multi_close = proto_perl->Imulti_close;
11636 PL_error_count = proto_perl->Ierror_count;
11637 PL_subline = proto_perl->Isubline;
11638 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11640 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11641 if (SvANY(proto_perl->Ilinestr)) {
11642 i = proto_perl->Ilast_uni - SvPVX_const(proto_perl->Ilinestr);
11643 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11644 i = proto_perl->Ilast_lop - SvPVX_const(proto_perl->Ilinestr);
11645 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11646 PL_last_lop_op = proto_perl->Ilast_lop_op;
11649 PL_last_uni = SvPVX(PL_linestr);
11650 PL_last_lop = SvPVX(PL_linestr);
11651 PL_last_lop_op = 0;
11653 PL_in_my = proto_perl->Iin_my;
11654 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11656 PL_cryptseen = proto_perl->Icryptseen;
11659 PL_hints = proto_perl->Ihints;
11661 PL_amagic_generation = proto_perl->Iamagic_generation;
11663 #ifdef USE_LOCALE_COLLATE
11664 PL_collation_ix = proto_perl->Icollation_ix;
11665 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11666 PL_collation_standard = proto_perl->Icollation_standard;
11667 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11668 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11669 #endif /* USE_LOCALE_COLLATE */
11671 #ifdef USE_LOCALE_NUMERIC
11672 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11673 PL_numeric_standard = proto_perl->Inumeric_standard;
11674 PL_numeric_local = proto_perl->Inumeric_local;
11675 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11676 #endif /* !USE_LOCALE_NUMERIC */
11678 /* utf8 character classes */
11679 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11680 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11681 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11682 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11683 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11684 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11685 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11686 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11687 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11688 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11689 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11690 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11691 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11692 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11693 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11694 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11695 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11696 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11697 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11698 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11700 /* Did the locale setup indicate UTF-8? */
11701 PL_utf8locale = proto_perl->Iutf8locale;
11702 /* Unicode features (see perlrun/-C) */
11703 PL_unicode = proto_perl->Iunicode;
11705 /* Pre-5.8 signals control */
11706 PL_signals = proto_perl->Isignals;
11708 /* times() ticks per second */
11709 PL_clocktick = proto_perl->Iclocktick;
11711 /* Recursion stopper for PerlIO_find_layer */
11712 PL_in_load_module = proto_perl->Iin_load_module;
11714 /* sort() routine */
11715 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11717 /* Not really needed/useful since the reenrant_retint is "volatile",
11718 * but do it for consistency's sake. */
11719 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11721 /* Hooks to shared SVs and locks. */
11722 PL_sharehook = proto_perl->Isharehook;
11723 PL_lockhook = proto_perl->Ilockhook;
11724 PL_unlockhook = proto_perl->Iunlockhook;
11725 PL_threadhook = proto_perl->Ithreadhook;
11727 PL_runops_std = proto_perl->Irunops_std;
11728 PL_runops_dbg = proto_perl->Irunops_dbg;
11730 #ifdef THREADS_HAVE_PIDS
11731 PL_ppid = proto_perl->Ippid;
11735 PL_last_swash_hv = Nullhv; /* reinits on demand */
11736 PL_last_swash_klen = 0;
11737 PL_last_swash_key[0]= '\0';
11738 PL_last_swash_tmps = (U8*)NULL;
11739 PL_last_swash_slen = 0;
11741 PL_glob_index = proto_perl->Iglob_index;
11742 PL_srand_called = proto_perl->Isrand_called;
11743 PL_uudmap['M'] = 0; /* reinits on demand */
11744 PL_bitcount = Nullch; /* reinits on demand */
11746 if (proto_perl->Ipsig_pend) {
11747 Newz(0, PL_psig_pend, SIG_SIZE, int);
11750 PL_psig_pend = (int*)NULL;
11753 if (proto_perl->Ipsig_ptr) {
11754 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11755 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11756 for (i = 1; i < SIG_SIZE; i++) {
11757 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11758 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11762 PL_psig_ptr = (SV**)NULL;
11763 PL_psig_name = (SV**)NULL;
11766 /* thrdvar.h stuff */
11768 if (flags & CLONEf_COPY_STACKS) {
11769 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11770 PL_tmps_ix = proto_perl->Ttmps_ix;
11771 PL_tmps_max = proto_perl->Ttmps_max;
11772 PL_tmps_floor = proto_perl->Ttmps_floor;
11773 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11775 while (i <= PL_tmps_ix) {
11776 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11780 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11781 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11782 Newz(54, PL_markstack, i, I32);
11783 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11784 - proto_perl->Tmarkstack);
11785 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11786 - proto_perl->Tmarkstack);
11787 Copy(proto_perl->Tmarkstack, PL_markstack,
11788 PL_markstack_ptr - PL_markstack + 1, I32);
11790 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11791 * NOTE: unlike the others! */
11792 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11793 PL_scopestack_max = proto_perl->Tscopestack_max;
11794 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11795 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11797 /* NOTE: si_dup() looks at PL_markstack */
11798 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11800 /* PL_curstack = PL_curstackinfo->si_stack; */
11801 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11802 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11804 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11805 PL_stack_base = AvARRAY(PL_curstack);
11806 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11807 - proto_perl->Tstack_base);
11808 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11810 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11811 * NOTE: unlike the others! */
11812 PL_savestack_ix = proto_perl->Tsavestack_ix;
11813 PL_savestack_max = proto_perl->Tsavestack_max;
11814 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11815 PL_savestack = ss_dup(proto_perl, param);
11819 ENTER; /* perl_destruct() wants to LEAVE; */
11822 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11823 PL_top_env = &PL_start_env;
11825 PL_op = proto_perl->Top;
11828 PL_Xpv = (XPV*)NULL;
11829 PL_na = proto_perl->Tna;
11831 PL_statbuf = proto_perl->Tstatbuf;
11832 PL_statcache = proto_perl->Tstatcache;
11833 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11834 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11836 PL_timesbuf = proto_perl->Ttimesbuf;
11839 PL_tainted = proto_perl->Ttainted;
11840 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11841 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11842 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11843 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11844 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11845 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11846 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11847 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11848 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11850 PL_restartop = proto_perl->Trestartop;
11851 PL_in_eval = proto_perl->Tin_eval;
11852 PL_delaymagic = proto_perl->Tdelaymagic;
11853 PL_dirty = proto_perl->Tdirty;
11854 PL_localizing = proto_perl->Tlocalizing;
11856 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11857 PL_hv_fetch_ent_mh = Nullhe;
11858 PL_modcount = proto_perl->Tmodcount;
11859 PL_lastgotoprobe = Nullop;
11860 PL_dumpindent = proto_perl->Tdumpindent;
11862 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11863 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11864 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11865 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11866 PL_sortcxix = proto_perl->Tsortcxix;
11867 PL_efloatbuf = Nullch; /* reinits on demand */
11868 PL_efloatsize = 0; /* reinits on demand */
11872 PL_screamfirst = NULL;
11873 PL_screamnext = NULL;
11874 PL_maxscream = -1; /* reinits on demand */
11875 PL_lastscream = Nullsv;
11877 PL_watchaddr = NULL;
11878 PL_watchok = Nullch;
11880 PL_regdummy = proto_perl->Tregdummy;
11881 PL_regprecomp = Nullch;
11884 PL_colorset = 0; /* reinits PL_colors[] */
11885 /*PL_colors[6] = {0,0,0,0,0,0};*/
11886 PL_reginput = Nullch;
11887 PL_regbol = Nullch;
11888 PL_regeol = Nullch;
11889 PL_regstartp = (I32*)NULL;
11890 PL_regendp = (I32*)NULL;
11891 PL_reglastparen = (U32*)NULL;
11892 PL_reglastcloseparen = (U32*)NULL;
11893 PL_regtill = Nullch;
11894 PL_reg_start_tmp = (char**)NULL;
11895 PL_reg_start_tmpl = 0;
11896 PL_regdata = (struct reg_data*)NULL;
11899 PL_reg_eval_set = 0;
11901 PL_regprogram = (regnode*)NULL;
11903 PL_regcc = (CURCUR*)NULL;
11904 PL_reg_call_cc = (struct re_cc_state*)NULL;
11905 PL_reg_re = (regexp*)NULL;
11906 PL_reg_ganch = Nullch;
11907 PL_reg_sv = Nullsv;
11908 PL_reg_match_utf8 = FALSE;
11909 PL_reg_magic = (MAGIC*)NULL;
11911 PL_reg_oldcurpm = (PMOP*)NULL;
11912 PL_reg_curpm = (PMOP*)NULL;
11913 PL_reg_oldsaved = Nullch;
11914 PL_reg_oldsavedlen = 0;
11915 #ifdef PERL_OLD_COPY_ON_WRITE
11918 PL_reg_maxiter = 0;
11919 PL_reg_leftiter = 0;
11920 PL_reg_poscache = Nullch;
11921 PL_reg_poscache_size= 0;
11923 /* RE engine - function pointers */
11924 PL_regcompp = proto_perl->Tregcompp;
11925 PL_regexecp = proto_perl->Tregexecp;
11926 PL_regint_start = proto_perl->Tregint_start;
11927 PL_regint_string = proto_perl->Tregint_string;
11928 PL_regfree = proto_perl->Tregfree;
11930 PL_reginterp_cnt = 0;
11931 PL_reg_starttry = 0;
11933 /* Pluggable optimizer */
11934 PL_peepp = proto_perl->Tpeepp;
11936 PL_stashcache = newHV();
11938 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11939 ptr_table_free(PL_ptr_table);
11940 PL_ptr_table = NULL;
11943 /* Call the ->CLONE method, if it exists, for each of the stashes
11944 identified by sv_dup() above.
11946 while(av_len(param->stashes) != -1) {
11947 HV* const stash = (HV*) av_shift(param->stashes);
11948 GV* const cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11949 if (cloner && GvCV(cloner)) {
11954 XPUSHs(sv_2mortal(newSVhek(HvNAME_HEK(stash))));
11956 call_sv((SV*)GvCV(cloner), G_DISCARD);
11962 SvREFCNT_dec(param->stashes);
11964 /* orphaned? eg threads->new inside BEGIN or use */
11965 if (PL_compcv && ! SvREFCNT(PL_compcv)) {
11966 (void)SvREFCNT_inc(PL_compcv);
11967 SAVEFREESV(PL_compcv);
11973 #endif /* USE_ITHREADS */
11976 =head1 Unicode Support
11978 =for apidoc sv_recode_to_utf8
11980 The encoding is assumed to be an Encode object, on entry the PV
11981 of the sv is assumed to be octets in that encoding, and the sv
11982 will be converted into Unicode (and UTF-8).
11984 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11985 is not a reference, nothing is done to the sv. If the encoding is not
11986 an C<Encode::XS> Encoding object, bad things will happen.
11987 (See F<lib/encoding.pm> and L<Encode>).
11989 The PV of the sv is returned.
11994 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11997 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
12011 Passing sv_yes is wrong - it needs to be or'ed set of constants
12012 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
12013 remove converted chars from source.
12015 Both will default the value - let them.
12017 XPUSHs(&PL_sv_yes);
12020 call_method("decode", G_SCALAR);
12024 s = SvPV_const(uni, len);
12025 if (s != SvPVX_const(sv)) {
12026 SvGROW(sv, len + 1);
12027 Move(s, SvPVX(sv), len + 1, char);
12028 SvCUR_set(sv, len);
12035 return SvPOKp(sv) ? SvPVX(sv) : NULL;
12039 =for apidoc sv_cat_decode
12041 The encoding is assumed to be an Encode object, the PV of the ssv is
12042 assumed to be octets in that encoding and decoding the input starts
12043 from the position which (PV + *offset) pointed to. The dsv will be
12044 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
12045 when the string tstr appears in decoding output or the input ends on
12046 the PV of the ssv. The value which the offset points will be modified
12047 to the last input position on the ssv.
12049 Returns TRUE if the terminator was found, else returns FALSE.
12054 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
12055 SV *ssv, int *offset, char *tstr, int tlen)
12059 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
12070 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
12071 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
12073 call_method("cat_decode", G_SCALAR);
12075 ret = SvTRUE(TOPs);
12076 *offset = SvIV(offsv);
12082 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");
12088 * c-indentation-style: bsd
12089 * c-basic-offset: 4
12090 * indent-tabs-mode: t
12093 * ex: set ts=8 sts=4 sw=4 noet: