3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 2004, 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
27 #ifdef PERL_UTF8_CACHE_ASSERT
28 /* The cache element 0 is the Unicode offset;
29 * the cache element 1 is the byte offset of the element 0;
30 * the cache element 2 is the Unicode length of the substring;
31 * the cache element 3 is the byte length of the substring;
32 * The checking of the substring side would be good
33 * but substr() has enough code paths to make my head spin;
34 * if adding more checks watch out for the following tests:
35 * t/op/index.t t/op/length.t t/op/pat.t t/op/substr.t
36 * lib/utf8.t lib/Unicode/Collate/t/index.t
39 #define ASSERT_UTF8_CACHE(cache) \
40 STMT_START { if (cache) { assert((cache)[0] <= (cache)[1]); } } STMT_END
42 #define ASSERT_UTF8_CACHE(cache) NOOP
45 #ifdef PERL_COPY_ON_WRITE
46 #define SV_COW_NEXT_SV(sv) INT2PTR(SV *,SvUVX(sv))
47 #define SV_COW_NEXT_SV_SET(current,next) SvUVX(current) = PTR2UV(next)
48 /* This is a pessimistic view. Scalar must be purely a read-write PV to copy-
52 /* ============================================================================
54 =head1 Allocation and deallocation of SVs.
56 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
57 av, hv...) contains type and reference count information, as well as a
58 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
59 specific to each type.
61 Normally, this allocation is done using arenas, which are approximately
62 1K chunks of memory parcelled up into N heads or bodies. The first slot
63 in each arena is reserved, and is used to hold a link to the next arena.
64 In the case of heads, the unused first slot also contains some flags and
65 a note of the number of slots. Snaked through each arena chain is a
66 linked list of free items; when this becomes empty, an extra arena is
67 allocated and divided up into N items which are threaded into the free
70 The following global variables are associated with arenas:
72 PL_sv_arenaroot pointer to list of SV arenas
73 PL_sv_root pointer to list of free SV structures
75 PL_foo_arenaroot pointer to list of foo arenas,
76 PL_foo_root pointer to list of free foo bodies
77 ... for foo in xiv, xnv, xrv, xpv etc.
79 Note that some of the larger and more rarely used body types (eg xpvio)
80 are not allocated using arenas, but are instead just malloc()/free()ed as
81 required. Also, if PURIFY is defined, arenas are abandoned altogether,
82 with all items individually malloc()ed. In addition, a few SV heads are
83 not allocated from an arena, but are instead directly created as static
84 or auto variables, eg PL_sv_undef.
86 The SV arena serves the secondary purpose of allowing still-live SVs
87 to be located and destroyed during final cleanup.
89 At the lowest level, the macros new_SV() and del_SV() grab and free
90 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
91 to return the SV to the free list with error checking.) new_SV() calls
92 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
93 SVs in the free list have their SvTYPE field set to all ones.
95 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
96 that allocate and return individual body types. Normally these are mapped
97 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
98 instead mapped directly to malloc()/free() if PURIFY is defined. The
99 new/del functions remove from, or add to, the appropriate PL_foo_root
100 list, and call more_xiv() etc to add a new arena if the list is empty.
102 At the time of very final cleanup, sv_free_arenas() is called from
103 perl_destruct() to physically free all the arenas allocated since the
104 start of the interpreter. Note that this also clears PL_he_arenaroot,
105 which is otherwise dealt with in hv.c.
107 Manipulation of any of the PL_*root pointers is protected by enclosing
108 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
109 if threads are enabled.
111 The function visit() scans the SV arenas list, and calls a specified
112 function for each SV it finds which is still live - ie which has an SvTYPE
113 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
114 following functions (specified as [function that calls visit()] / [function
115 called by visit() for each SV]):
117 sv_report_used() / do_report_used()
118 dump all remaining SVs (debugging aid)
120 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
121 Attempt to free all objects pointed to by RVs,
122 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
123 try to do the same for all objects indirectly
124 referenced by typeglobs too. Called once from
125 perl_destruct(), prior to calling sv_clean_all()
128 sv_clean_all() / do_clean_all()
129 SvREFCNT_dec(sv) each remaining SV, possibly
130 triggering an sv_free(). It also sets the
131 SVf_BREAK flag on the SV to indicate that the
132 refcnt has been artificially lowered, and thus
133 stopping sv_free() from giving spurious warnings
134 about SVs which unexpectedly have a refcnt
135 of zero. called repeatedly from perl_destruct()
136 until there are no SVs left.
140 Private API to rest of sv.c
144 new_XIV(), del_XIV(),
145 new_XNV(), del_XNV(),
150 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
155 ============================================================================ */
160 * "A time to plant, and a time to uproot what was planted..."
163 #define plant_SV(p) \
165 SvANY(p) = (void *)PL_sv_root; \
166 SvFLAGS(p) = SVTYPEMASK; \
171 /* sv_mutex must be held while calling uproot_SV() */
172 #define uproot_SV(p) \
175 PL_sv_root = (SV*)SvANY(p); \
180 /* new_SV(): return a new, empty SV head */
182 #ifdef DEBUG_LEAKING_SCALARS
183 /* provide a real function for a debugger to play with */
200 # define new_SV(p) (p)=S_new_SV(aTHX)
218 /* del_SV(): return an empty SV head to the free list */
233 S_del_sv(pTHX_ SV *p)
240 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
242 svend = &sva[SvREFCNT(sva)];
243 if (p >= sv && p < svend)
247 if (ckWARN_d(WARN_INTERNAL))
248 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
249 "Attempt to free non-arena SV: 0x%"UVxf,
257 #else /* ! DEBUGGING */
259 #define del_SV(p) plant_SV(p)
261 #endif /* DEBUGGING */
265 =head1 SV Manipulation Functions
267 =for apidoc sv_add_arena
269 Given a chunk of memory, link it to the head of the list of arenas,
270 and split it into a list of free SVs.
276 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
281 Zero(ptr, size, char);
283 /* The first SV in an arena isn't an SV. */
284 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
285 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
286 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
288 PL_sv_arenaroot = sva;
289 PL_sv_root = sva + 1;
291 svend = &sva[SvREFCNT(sva) - 1];
294 SvANY(sv) = (void *)(SV*)(sv + 1);
295 SvFLAGS(sv) = SVTYPEMASK;
299 SvFLAGS(sv) = SVTYPEMASK;
302 /* make some more SVs by adding another arena */
304 /* sv_mutex must be held while calling more_sv() */
311 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
312 PL_nice_chunk = Nullch;
313 PL_nice_chunk_size = 0;
316 char *chunk; /* must use New here to match call to */
317 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
318 sv_add_arena(chunk, 1008, 0);
324 /* visit(): call the named function for each non-free SV in the arenas
325 * whose flags field matches the flags/mask args. */
328 S_visit(pTHX_ SVFUNC_t f, U32 flags, U32 mask)
335 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
336 svend = &sva[SvREFCNT(sva)];
337 for (sv = sva + 1; sv < svend; ++sv) {
338 if (SvTYPE(sv) != SVTYPEMASK
339 && (sv->sv_flags & mask) == flags
352 /* called by sv_report_used() for each live SV */
355 do_report_used(pTHX_ SV *sv)
357 if (SvTYPE(sv) != SVTYPEMASK) {
358 PerlIO_printf(Perl_debug_log, "****\n");
365 =for apidoc sv_report_used
367 Dump the contents of all SVs not yet freed. (Debugging aid).
373 Perl_sv_report_used(pTHX)
376 visit(do_report_used, 0, 0);
380 /* called by sv_clean_objs() for each live SV */
383 do_clean_objs(pTHX_ SV *sv)
387 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
388 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
400 /* XXX Might want to check arrays, etc. */
403 /* called by sv_clean_objs() for each live SV */
405 #ifndef DISABLE_DESTRUCTOR_KLUDGE
407 do_clean_named_objs(pTHX_ SV *sv)
409 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
410 if ( SvOBJECT(GvSV(sv)) ||
411 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
412 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
413 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
414 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
416 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
417 SvFLAGS(sv) |= SVf_BREAK;
425 =for apidoc sv_clean_objs
427 Attempt to destroy all objects not yet freed
433 Perl_sv_clean_objs(pTHX)
435 PL_in_clean_objs = TRUE;
436 visit(do_clean_objs, SVf_ROK, SVf_ROK);
437 #ifndef DISABLE_DESTRUCTOR_KLUDGE
438 /* some barnacles may yet remain, clinging to typeglobs */
439 visit(do_clean_named_objs, SVt_PVGV, SVTYPEMASK);
441 PL_in_clean_objs = FALSE;
444 /* called by sv_clean_all() for each live SV */
447 do_clean_all(pTHX_ SV *sv)
449 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
450 SvFLAGS(sv) |= SVf_BREAK;
455 =for apidoc sv_clean_all
457 Decrement the refcnt of each remaining SV, possibly triggering a
458 cleanup. This function may have to be called multiple times to free
459 SVs which are in complex self-referential hierarchies.
465 Perl_sv_clean_all(pTHX)
468 PL_in_clean_all = TRUE;
469 cleaned = visit(do_clean_all, 0,0);
470 PL_in_clean_all = FALSE;
475 =for apidoc sv_free_arenas
477 Deallocate the memory used by all arenas. Note that all the individual SV
478 heads and bodies within the arenas must already have been freed.
484 Perl_sv_free_arenas(pTHX)
488 XPV *arena, *arenanext;
490 /* Free arenas here, but be careful about fake ones. (We assume
491 contiguity of the fake ones with the corresponding real ones.) */
493 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
494 svanext = (SV*) SvANY(sva);
495 while (svanext && SvFAKE(svanext))
496 svanext = (SV*) SvANY(svanext);
499 Safefree((void *)sva);
502 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
503 arenanext = (XPV*)arena->xpv_pv;
506 PL_xiv_arenaroot = 0;
509 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
510 arenanext = (XPV*)arena->xpv_pv;
513 PL_xnv_arenaroot = 0;
516 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
517 arenanext = (XPV*)arena->xpv_pv;
520 PL_xrv_arenaroot = 0;
523 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
524 arenanext = (XPV*)arena->xpv_pv;
527 PL_xpv_arenaroot = 0;
530 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
531 arenanext = (XPV*)arena->xpv_pv;
534 PL_xpviv_arenaroot = 0;
537 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
538 arenanext = (XPV*)arena->xpv_pv;
541 PL_xpvnv_arenaroot = 0;
544 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
545 arenanext = (XPV*)arena->xpv_pv;
548 PL_xpvcv_arenaroot = 0;
551 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
552 arenanext = (XPV*)arena->xpv_pv;
555 PL_xpvav_arenaroot = 0;
558 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
559 arenanext = (XPV*)arena->xpv_pv;
562 PL_xpvhv_arenaroot = 0;
565 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
566 arenanext = (XPV*)arena->xpv_pv;
569 PL_xpvmg_arenaroot = 0;
572 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
573 arenanext = (XPV*)arena->xpv_pv;
576 PL_xpvlv_arenaroot = 0;
579 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
580 arenanext = (XPV*)arena->xpv_pv;
583 PL_xpvbm_arenaroot = 0;
586 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
587 arenanext = (XPV*)arena->xpv_pv;
594 Safefree(PL_nice_chunk);
595 PL_nice_chunk = Nullch;
596 PL_nice_chunk_size = 0;
602 =for apidoc report_uninit
604 Print appropriate "Use of uninitialized variable" warning
610 Perl_report_uninit(pTHX)
613 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
614 " in ", OP_DESC(PL_op));
616 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
619 /* grab a new IV body from the free list, allocating more if necessary */
630 * See comment in more_xiv() -- RAM.
632 PL_xiv_root = *(IV**)xiv;
634 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
637 /* return an IV body to the free list */
640 S_del_xiv(pTHX_ XPVIV *p)
642 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
644 *(IV**)xiv = PL_xiv_root;
649 /* allocate another arena's worth of IV bodies */
657 New(705, ptr, 1008/sizeof(XPV), XPV);
658 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
659 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
662 xivend = &xiv[1008 / sizeof(IV) - 1];
663 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
665 while (xiv < xivend) {
666 *(IV**)xiv = (IV *)(xiv + 1);
672 /* grab a new NV body from the free list, allocating more if necessary */
682 PL_xnv_root = *(NV**)xnv;
684 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
687 /* return an NV body to the free list */
690 S_del_xnv(pTHX_ XPVNV *p)
692 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
694 *(NV**)xnv = PL_xnv_root;
699 /* allocate another arena's worth of NV bodies */
707 New(711, ptr, 1008/sizeof(XPV), XPV);
708 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
709 PL_xnv_arenaroot = ptr;
712 xnvend = &xnv[1008 / sizeof(NV) - 1];
713 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
715 while (xnv < xnvend) {
716 *(NV**)xnv = (NV*)(xnv + 1);
722 /* grab a new struct xrv from the free list, allocating more if necessary */
732 PL_xrv_root = (XRV*)xrv->xrv_rv;
737 /* return a struct xrv to the free list */
740 S_del_xrv(pTHX_ XRV *p)
743 p->xrv_rv = (SV*)PL_xrv_root;
748 /* allocate another arena's worth of struct xrv */
754 register XRV* xrvend;
756 New(712, ptr, 1008/sizeof(XPV), XPV);
757 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
758 PL_xrv_arenaroot = ptr;
761 xrvend = &xrv[1008 / sizeof(XRV) - 1];
762 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
764 while (xrv < xrvend) {
765 xrv->xrv_rv = (SV*)(xrv + 1);
771 /* grab a new struct xpv from the free list, allocating more if necessary */
781 PL_xpv_root = (XPV*)xpv->xpv_pv;
786 /* return a struct xpv to the free list */
789 S_del_xpv(pTHX_ XPV *p)
792 p->xpv_pv = (char*)PL_xpv_root;
797 /* allocate another arena's worth of struct xpv */
803 register XPV* xpvend;
804 New(713, xpv, 1008/sizeof(XPV), XPV);
805 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
806 PL_xpv_arenaroot = xpv;
808 xpvend = &xpv[1008 / sizeof(XPV) - 1];
810 while (xpv < xpvend) {
811 xpv->xpv_pv = (char*)(xpv + 1);
817 /* grab a new struct xpviv from the free list, allocating more if necessary */
826 xpviv = PL_xpviv_root;
827 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
832 /* return a struct xpviv to the free list */
835 S_del_xpviv(pTHX_ XPVIV *p)
838 p->xpv_pv = (char*)PL_xpviv_root;
843 /* allocate another arena's worth of struct xpviv */
848 register XPVIV* xpviv;
849 register XPVIV* xpvivend;
850 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
851 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
852 PL_xpviv_arenaroot = xpviv;
854 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
855 PL_xpviv_root = ++xpviv;
856 while (xpviv < xpvivend) {
857 xpviv->xpv_pv = (char*)(xpviv + 1);
863 /* grab a new struct xpvnv from the free list, allocating more if necessary */
872 xpvnv = PL_xpvnv_root;
873 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
878 /* return a struct xpvnv to the free list */
881 S_del_xpvnv(pTHX_ XPVNV *p)
884 p->xpv_pv = (char*)PL_xpvnv_root;
889 /* allocate another arena's worth of struct xpvnv */
894 register XPVNV* xpvnv;
895 register XPVNV* xpvnvend;
896 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
897 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
898 PL_xpvnv_arenaroot = xpvnv;
900 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
901 PL_xpvnv_root = ++xpvnv;
902 while (xpvnv < xpvnvend) {
903 xpvnv->xpv_pv = (char*)(xpvnv + 1);
909 /* grab a new struct xpvcv from the free list, allocating more if necessary */
918 xpvcv = PL_xpvcv_root;
919 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
924 /* return a struct xpvcv to the free list */
927 S_del_xpvcv(pTHX_ XPVCV *p)
930 p->xpv_pv = (char*)PL_xpvcv_root;
935 /* allocate another arena's worth of struct xpvcv */
940 register XPVCV* xpvcv;
941 register XPVCV* xpvcvend;
942 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
943 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
944 PL_xpvcv_arenaroot = xpvcv;
946 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
947 PL_xpvcv_root = ++xpvcv;
948 while (xpvcv < xpvcvend) {
949 xpvcv->xpv_pv = (char*)(xpvcv + 1);
955 /* grab a new struct xpvav from the free list, allocating more if necessary */
964 xpvav = PL_xpvav_root;
965 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
970 /* return a struct xpvav to the free list */
973 S_del_xpvav(pTHX_ XPVAV *p)
976 p->xav_array = (char*)PL_xpvav_root;
981 /* allocate another arena's worth of struct xpvav */
986 register XPVAV* xpvav;
987 register XPVAV* xpvavend;
988 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
989 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
990 PL_xpvav_arenaroot = xpvav;
992 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
993 PL_xpvav_root = ++xpvav;
994 while (xpvav < xpvavend) {
995 xpvav->xav_array = (char*)(xpvav + 1);
998 xpvav->xav_array = 0;
1001 /* grab a new struct xpvhv from the free list, allocating more if necessary */
1010 xpvhv = PL_xpvhv_root;
1011 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
1016 /* return a struct xpvhv to the free list */
1019 S_del_xpvhv(pTHX_ XPVHV *p)
1022 p->xhv_array = (char*)PL_xpvhv_root;
1027 /* allocate another arena's worth of struct xpvhv */
1032 register XPVHV* xpvhv;
1033 register XPVHV* xpvhvend;
1034 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
1035 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
1036 PL_xpvhv_arenaroot = xpvhv;
1038 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
1039 PL_xpvhv_root = ++xpvhv;
1040 while (xpvhv < xpvhvend) {
1041 xpvhv->xhv_array = (char*)(xpvhv + 1);
1044 xpvhv->xhv_array = 0;
1047 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1056 xpvmg = PL_xpvmg_root;
1057 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1062 /* return a struct xpvmg to the free list */
1065 S_del_xpvmg(pTHX_ XPVMG *p)
1068 p->xpv_pv = (char*)PL_xpvmg_root;
1073 /* allocate another arena's worth of struct xpvmg */
1078 register XPVMG* xpvmg;
1079 register XPVMG* xpvmgend;
1080 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1081 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1082 PL_xpvmg_arenaroot = xpvmg;
1084 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1085 PL_xpvmg_root = ++xpvmg;
1086 while (xpvmg < xpvmgend) {
1087 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1093 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1102 xpvlv = PL_xpvlv_root;
1103 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1108 /* return a struct xpvlv to the free list */
1111 S_del_xpvlv(pTHX_ XPVLV *p)
1114 p->xpv_pv = (char*)PL_xpvlv_root;
1119 /* allocate another arena's worth of struct xpvlv */
1124 register XPVLV* xpvlv;
1125 register XPVLV* xpvlvend;
1126 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1127 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1128 PL_xpvlv_arenaroot = xpvlv;
1130 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1131 PL_xpvlv_root = ++xpvlv;
1132 while (xpvlv < xpvlvend) {
1133 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1139 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1148 xpvbm = PL_xpvbm_root;
1149 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1154 /* return a struct xpvbm to the free list */
1157 S_del_xpvbm(pTHX_ XPVBM *p)
1160 p->xpv_pv = (char*)PL_xpvbm_root;
1165 /* allocate another arena's worth of struct xpvbm */
1170 register XPVBM* xpvbm;
1171 register XPVBM* xpvbmend;
1172 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1173 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1174 PL_xpvbm_arenaroot = xpvbm;
1176 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1177 PL_xpvbm_root = ++xpvbm;
1178 while (xpvbm < xpvbmend) {
1179 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1185 #define my_safemalloc(s) (void*)safemalloc(s)
1186 #define my_safefree(p) safefree((char*)p)
1190 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1191 #define del_XIV(p) my_safefree(p)
1193 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1194 #define del_XNV(p) my_safefree(p)
1196 #define new_XRV() my_safemalloc(sizeof(XRV))
1197 #define del_XRV(p) my_safefree(p)
1199 #define new_XPV() my_safemalloc(sizeof(XPV))
1200 #define del_XPV(p) my_safefree(p)
1202 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1203 #define del_XPVIV(p) my_safefree(p)
1205 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1206 #define del_XPVNV(p) my_safefree(p)
1208 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1209 #define del_XPVCV(p) my_safefree(p)
1211 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1212 #define del_XPVAV(p) my_safefree(p)
1214 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1215 #define del_XPVHV(p) my_safefree(p)
1217 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1218 #define del_XPVMG(p) my_safefree(p)
1220 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1221 #define del_XPVLV(p) my_safefree(p)
1223 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1224 #define del_XPVBM(p) my_safefree(p)
1228 #define new_XIV() (void*)new_xiv()
1229 #define del_XIV(p) del_xiv((XPVIV*) p)
1231 #define new_XNV() (void*)new_xnv()
1232 #define del_XNV(p) del_xnv((XPVNV*) p)
1234 #define new_XRV() (void*)new_xrv()
1235 #define del_XRV(p) del_xrv((XRV*) p)
1237 #define new_XPV() (void*)new_xpv()
1238 #define del_XPV(p) del_xpv((XPV *)p)
1240 #define new_XPVIV() (void*)new_xpviv()
1241 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1243 #define new_XPVNV() (void*)new_xpvnv()
1244 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1246 #define new_XPVCV() (void*)new_xpvcv()
1247 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1249 #define new_XPVAV() (void*)new_xpvav()
1250 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1252 #define new_XPVHV() (void*)new_xpvhv()
1253 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1255 #define new_XPVMG() (void*)new_xpvmg()
1256 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1258 #define new_XPVLV() (void*)new_xpvlv()
1259 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1261 #define new_XPVBM() (void*)new_xpvbm()
1262 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1266 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1267 #define del_XPVGV(p) my_safefree(p)
1269 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1270 #define del_XPVFM(p) my_safefree(p)
1272 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1273 #define del_XPVIO(p) my_safefree(p)
1276 =for apidoc sv_upgrade
1278 Upgrade an SV to a more complex form. Generally adds a new body type to the
1279 SV, then copies across as much information as possible from the old body.
1280 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1286 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1293 MAGIC* magic = NULL;
1296 if (mt != SVt_PV && SvIsCOW(sv)) {
1297 sv_force_normal_flags(sv, 0);
1300 if (SvTYPE(sv) == mt)
1304 (void)SvOOK_off(sv);
1306 switch (SvTYPE(sv)) {
1327 else if (mt < SVt_PVIV)
1344 pv = (char*)SvRV(sv);
1364 else if (mt == SVt_NV)
1375 del_XPVIV(SvANY(sv));
1385 del_XPVNV(SvANY(sv));
1393 magic = SvMAGIC(sv);
1394 stash = SvSTASH(sv);
1395 del_XPVMG(SvANY(sv));
1398 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1403 Perl_croak(aTHX_ "Can't upgrade to undef");
1405 SvANY(sv) = new_XIV();
1409 SvANY(sv) = new_XNV();
1413 SvANY(sv) = new_XRV();
1417 SvANY(sv) = new_XPV();
1423 SvANY(sv) = new_XPVIV();
1433 SvANY(sv) = new_XPVNV();
1441 SvANY(sv) = new_XPVMG();
1447 SvMAGIC(sv) = magic;
1448 SvSTASH(sv) = stash;
1451 SvANY(sv) = new_XPVLV();
1457 SvMAGIC(sv) = magic;
1458 SvSTASH(sv) = stash;
1470 SvANY(sv) = new_XPVAV();
1478 SvMAGIC(sv) = magic;
1479 SvSTASH(sv) = stash;
1485 SvANY(sv) = new_XPVHV();
1491 HvTOTALKEYS(sv) = 0;
1492 HvPLACEHOLDERS(sv) = 0;
1493 SvMAGIC(sv) = magic;
1494 SvSTASH(sv) = stash;
1501 SvANY(sv) = new_XPVCV();
1502 Zero(SvANY(sv), 1, XPVCV);
1508 SvMAGIC(sv) = magic;
1509 SvSTASH(sv) = stash;
1512 SvANY(sv) = new_XPVGV();
1518 SvMAGIC(sv) = magic;
1519 SvSTASH(sv) = stash;
1527 SvANY(sv) = new_XPVBM();
1533 SvMAGIC(sv) = magic;
1534 SvSTASH(sv) = stash;
1540 SvANY(sv) = new_XPVFM();
1541 Zero(SvANY(sv), 1, XPVFM);
1547 SvMAGIC(sv) = magic;
1548 SvSTASH(sv) = stash;
1551 SvANY(sv) = new_XPVIO();
1552 Zero(SvANY(sv), 1, XPVIO);
1558 SvMAGIC(sv) = magic;
1559 SvSTASH(sv) = stash;
1560 IoPAGE_LEN(sv) = 60;
1563 SvFLAGS(sv) &= ~SVTYPEMASK;
1569 =for apidoc sv_backoff
1571 Remove any string offset. You should normally use the C<SvOOK_off> macro
1578 Perl_sv_backoff(pTHX_ register SV *sv)
1582 char *s = SvPVX(sv);
1583 SvLEN(sv) += SvIVX(sv);
1584 SvPVX(sv) -= SvIVX(sv);
1586 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1588 SvFLAGS(sv) &= ~SVf_OOK;
1595 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1596 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1597 Use the C<SvGROW> wrapper instead.
1603 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1607 #ifdef HAS_64K_LIMIT
1608 if (newlen >= 0x10000) {
1609 PerlIO_printf(Perl_debug_log,
1610 "Allocation too large: %"UVxf"\n", (UV)newlen);
1613 #endif /* HAS_64K_LIMIT */
1616 if (SvTYPE(sv) < SVt_PV) {
1617 sv_upgrade(sv, SVt_PV);
1620 else if (SvOOK(sv)) { /* pv is offset? */
1623 if (newlen > SvLEN(sv))
1624 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1625 #ifdef HAS_64K_LIMIT
1626 if (newlen >= 0x10000)
1633 if (newlen > SvLEN(sv)) { /* need more room? */
1634 if (SvLEN(sv) && s) {
1636 STRLEN l = malloced_size((void*)SvPVX(sv));
1642 Renew(s,newlen,char);
1645 New(703, s, newlen, char);
1646 if (SvPVX(sv) && SvCUR(sv)) {
1647 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1651 SvLEN_set(sv, newlen);
1657 =for apidoc sv_setiv
1659 Copies an integer into the given SV, upgrading first if necessary.
1660 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1666 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1668 SV_CHECK_THINKFIRST_COW_DROP(sv);
1669 switch (SvTYPE(sv)) {
1671 sv_upgrade(sv, SVt_IV);
1674 sv_upgrade(sv, SVt_PVNV);
1678 sv_upgrade(sv, SVt_PVIV);
1687 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1690 (void)SvIOK_only(sv); /* validate number */
1696 =for apidoc sv_setiv_mg
1698 Like C<sv_setiv>, but also handles 'set' magic.
1704 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1711 =for apidoc sv_setuv
1713 Copies an unsigned integer into the given SV, upgrading first if necessary.
1714 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1720 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1722 /* With these two if statements:
1723 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1726 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1728 If you wish to remove them, please benchmark to see what the effect is
1730 if (u <= (UV)IV_MAX) {
1731 sv_setiv(sv, (IV)u);
1740 =for apidoc sv_setuv_mg
1742 Like C<sv_setuv>, but also handles 'set' magic.
1748 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1750 /* With these two if statements:
1751 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1754 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1756 If you wish to remove them, please benchmark to see what the effect is
1758 if (u <= (UV)IV_MAX) {
1759 sv_setiv(sv, (IV)u);
1769 =for apidoc sv_setnv
1771 Copies a double into the given SV, upgrading first if necessary.
1772 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1778 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1780 SV_CHECK_THINKFIRST_COW_DROP(sv);
1781 switch (SvTYPE(sv)) {
1784 sv_upgrade(sv, SVt_NV);
1789 sv_upgrade(sv, SVt_PVNV);
1798 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1802 (void)SvNOK_only(sv); /* validate number */
1807 =for apidoc sv_setnv_mg
1809 Like C<sv_setnv>, but also handles 'set' magic.
1815 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1821 /* Print an "isn't numeric" warning, using a cleaned-up,
1822 * printable version of the offending string
1826 S_not_a_number(pTHX_ SV *sv)
1833 dsv = sv_2mortal(newSVpv("", 0));
1834 pv = sv_uni_display(dsv, sv, 10, 0);
1837 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1838 /* each *s can expand to 4 chars + "...\0",
1839 i.e. need room for 8 chars */
1842 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1844 if (ch & 128 && !isPRINT_LC(ch)) {
1853 else if (ch == '\r') {
1857 else if (ch == '\f') {
1861 else if (ch == '\\') {
1865 else if (ch == '\0') {
1869 else if (isPRINT_LC(ch))
1886 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1887 "Argument \"%s\" isn't numeric in %s", pv,
1890 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1891 "Argument \"%s\" isn't numeric", pv);
1895 =for apidoc looks_like_number
1897 Test if the content of an SV looks like a number (or is a number).
1898 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1899 non-numeric warning), even if your atof() doesn't grok them.
1905 Perl_looks_like_number(pTHX_ SV *sv)
1907 register char *sbegin;
1914 else if (SvPOKp(sv))
1915 sbegin = SvPV(sv, len);
1917 return SvFLAGS(sv) & (SVf_NOK|SVp_NOK|SVf_IOK|SVp_IOK);
1918 return grok_number(sbegin, len, NULL);
1921 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1922 until proven guilty, assume that things are not that bad... */
1927 As 64 bit platforms often have an NV that doesn't preserve all bits of
1928 an IV (an assumption perl has been based on to date) it becomes necessary
1929 to remove the assumption that the NV always carries enough precision to
1930 recreate the IV whenever needed, and that the NV is the canonical form.
1931 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1932 precision as a side effect of conversion (which would lead to insanity
1933 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1934 1) to distinguish between IV/UV/NV slots that have cached a valid
1935 conversion where precision was lost and IV/UV/NV slots that have a
1936 valid conversion which has lost no precision
1937 2) to ensure that if a numeric conversion to one form is requested that
1938 would lose precision, the precise conversion (or differently
1939 imprecise conversion) is also performed and cached, to prevent
1940 requests for different numeric formats on the same SV causing
1941 lossy conversion chains. (lossless conversion chains are perfectly
1946 SvIOKp is true if the IV slot contains a valid value
1947 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1948 SvNOKp is true if the NV slot contains a valid value
1949 SvNOK is true only if the NV value is accurate
1952 while converting from PV to NV, check to see if converting that NV to an
1953 IV(or UV) would lose accuracy over a direct conversion from PV to
1954 IV(or UV). If it would, cache both conversions, return NV, but mark
1955 SV as IOK NOKp (ie not NOK).
1957 While converting from PV to IV, check to see if converting that IV to an
1958 NV would lose accuracy over a direct conversion from PV to NV. If it
1959 would, cache both conversions, flag similarly.
1961 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1962 correctly because if IV & NV were set NV *always* overruled.
1963 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1964 changes - now IV and NV together means that the two are interchangeable:
1965 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1967 The benefit of this is that operations such as pp_add know that if
1968 SvIOK is true for both left and right operands, then integer addition
1969 can be used instead of floating point (for cases where the result won't
1970 overflow). Before, floating point was always used, which could lead to
1971 loss of precision compared with integer addition.
1973 * making IV and NV equal status should make maths accurate on 64 bit
1975 * may speed up maths somewhat if pp_add and friends start to use
1976 integers when possible instead of fp. (Hopefully the overhead in
1977 looking for SvIOK and checking for overflow will not outweigh the
1978 fp to integer speedup)
1979 * will slow down integer operations (callers of SvIV) on "inaccurate"
1980 values, as the change from SvIOK to SvIOKp will cause a call into
1981 sv_2iv each time rather than a macro access direct to the IV slot
1982 * should speed up number->string conversion on integers as IV is
1983 favoured when IV and NV are equally accurate
1985 ####################################################################
1986 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1987 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1988 On the other hand, SvUOK is true iff UV.
1989 ####################################################################
1991 Your mileage will vary depending your CPU's relative fp to integer
1995 #ifndef NV_PRESERVES_UV
1996 # define IS_NUMBER_UNDERFLOW_IV 1
1997 # define IS_NUMBER_UNDERFLOW_UV 2
1998 # define IS_NUMBER_IV_AND_UV 2
1999 # define IS_NUMBER_OVERFLOW_IV 4
2000 # define IS_NUMBER_OVERFLOW_UV 5
2002 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
2004 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
2006 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
2008 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%"NVgf" inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
2009 if (SvNVX(sv) < (NV)IV_MIN) {
2010 (void)SvIOKp_on(sv);
2013 return IS_NUMBER_UNDERFLOW_IV;
2015 if (SvNVX(sv) > (NV)UV_MAX) {
2016 (void)SvIOKp_on(sv);
2020 return IS_NUMBER_OVERFLOW_UV;
2022 (void)SvIOKp_on(sv);
2024 /* Can't use strtol etc to convert this string. (See truth table in
2026 if (SvNVX(sv) <= (UV)IV_MAX) {
2027 SvIVX(sv) = I_V(SvNVX(sv));
2028 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2029 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
2031 /* Integer is imprecise. NOK, IOKp */
2033 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
2036 SvUVX(sv) = U_V(SvNVX(sv));
2037 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2038 if (SvUVX(sv) == UV_MAX) {
2039 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2040 possibly be preserved by NV. Hence, it must be overflow.
2042 return IS_NUMBER_OVERFLOW_UV;
2044 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2046 /* Integer is imprecise. NOK, IOKp */
2048 return IS_NUMBER_OVERFLOW_IV;
2050 #endif /* !NV_PRESERVES_UV*/
2052 /* sv_2iv() is now a macro using Perl_sv_2iv_flags();
2053 * this function provided for binary compatibility only
2057 Perl_sv_2iv(pTHX_ register SV *sv)
2059 return sv_2iv_flags(sv, SV_GMAGIC);
2063 =for apidoc sv_2iv_flags
2065 Return the integer value of an SV, doing any necessary string
2066 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2067 Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2073 Perl_sv_2iv_flags(pTHX_ register SV *sv, I32 flags)
2077 if (SvGMAGICAL(sv)) {
2078 if (flags & SV_GMAGIC)
2083 return I_V(SvNVX(sv));
2085 if (SvPOKp(sv) && SvLEN(sv))
2088 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2089 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2095 if (SvTHINKFIRST(sv)) {
2098 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2099 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2100 return SvIV(tmpstr);
2101 return PTR2IV(SvRV(sv));
2104 sv_force_normal_flags(sv, 0);
2106 if (SvREADONLY(sv) && !SvOK(sv)) {
2107 if (ckWARN(WARN_UNINITIALIZED))
2114 return (IV)(SvUVX(sv));
2121 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2122 * without also getting a cached IV/UV from it at the same time
2123 * (ie PV->NV conversion should detect loss of accuracy and cache
2124 * IV or UV at same time to avoid this. NWC */
2126 if (SvTYPE(sv) == SVt_NV)
2127 sv_upgrade(sv, SVt_PVNV);
2129 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2130 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2131 certainly cast into the IV range at IV_MAX, whereas the correct
2132 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2134 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2135 SvIVX(sv) = I_V(SvNVX(sv));
2136 if (SvNVX(sv) == (NV) SvIVX(sv)
2137 #ifndef NV_PRESERVES_UV
2138 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2139 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2140 /* Don't flag it as "accurately an integer" if the number
2141 came from a (by definition imprecise) NV operation, and
2142 we're outside the range of NV integer precision */
2145 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2146 DEBUG_c(PerlIO_printf(Perl_debug_log,
2147 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2153 /* IV not precise. No need to convert from PV, as NV
2154 conversion would already have cached IV if it detected
2155 that PV->IV would be better than PV->NV->IV
2156 flags already correct - don't set public IOK. */
2157 DEBUG_c(PerlIO_printf(Perl_debug_log,
2158 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2163 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2164 but the cast (NV)IV_MIN rounds to a the value less (more
2165 negative) than IV_MIN which happens to be equal to SvNVX ??
2166 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2167 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2168 (NV)UVX == NVX are both true, but the values differ. :-(
2169 Hopefully for 2s complement IV_MIN is something like
2170 0x8000000000000000 which will be exact. NWC */
2173 SvUVX(sv) = U_V(SvNVX(sv));
2175 (SvNVX(sv) == (NV) SvUVX(sv))
2176 #ifndef NV_PRESERVES_UV
2177 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2178 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2179 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2180 /* Don't flag it as "accurately an integer" if the number
2181 came from a (by definition imprecise) NV operation, and
2182 we're outside the range of NV integer precision */
2188 DEBUG_c(PerlIO_printf(Perl_debug_log,
2189 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2193 return (IV)SvUVX(sv);
2196 else if (SvPOKp(sv) && SvLEN(sv)) {
2198 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2199 /* We want to avoid a possible problem when we cache an IV which
2200 may be later translated to an NV, and the resulting NV is not
2201 the same as the direct translation of the initial string
2202 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2203 be careful to ensure that the value with the .456 is around if the
2204 NV value is requested in the future).
2206 This means that if we cache such an IV, we need to cache the
2207 NV as well. Moreover, we trade speed for space, and do not
2208 cache the NV if we are sure it's not needed.
2211 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2212 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2213 == IS_NUMBER_IN_UV) {
2214 /* It's definitely an integer, only upgrade to PVIV */
2215 if (SvTYPE(sv) < SVt_PVIV)
2216 sv_upgrade(sv, SVt_PVIV);
2218 } else if (SvTYPE(sv) < SVt_PVNV)
2219 sv_upgrade(sv, SVt_PVNV);
2221 /* If NV preserves UV then we only use the UV value if we know that
2222 we aren't going to call atof() below. If NVs don't preserve UVs
2223 then the value returned may have more precision than atof() will
2224 return, even though value isn't perfectly accurate. */
2225 if ((numtype & (IS_NUMBER_IN_UV
2226 #ifdef NV_PRESERVES_UV
2229 )) == IS_NUMBER_IN_UV) {
2230 /* This won't turn off the public IOK flag if it was set above */
2231 (void)SvIOKp_on(sv);
2233 if (!(numtype & IS_NUMBER_NEG)) {
2235 if (value <= (UV)IV_MAX) {
2236 SvIVX(sv) = (IV)value;
2242 /* 2s complement assumption */
2243 if (value <= (UV)IV_MIN) {
2244 SvIVX(sv) = -(IV)value;
2246 /* Too negative for an IV. This is a double upgrade, but
2247 I'm assuming it will be rare. */
2248 if (SvTYPE(sv) < SVt_PVNV)
2249 sv_upgrade(sv, SVt_PVNV);
2253 SvNVX(sv) = -(NV)value;
2258 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2259 will be in the previous block to set the IV slot, and the next
2260 block to set the NV slot. So no else here. */
2262 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2263 != IS_NUMBER_IN_UV) {
2264 /* It wasn't an (integer that doesn't overflow the UV). */
2265 SvNVX(sv) = Atof(SvPVX(sv));
2267 if (! numtype && ckWARN(WARN_NUMERIC))
2270 #if defined(USE_LONG_DOUBLE)
2271 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2272 PTR2UV(sv), SvNVX(sv)));
2274 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2275 PTR2UV(sv), SvNVX(sv)));
2279 #ifdef NV_PRESERVES_UV
2280 (void)SvIOKp_on(sv);
2282 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2283 SvIVX(sv) = I_V(SvNVX(sv));
2284 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2287 /* Integer is imprecise. NOK, IOKp */
2289 /* UV will not work better than IV */
2291 if (SvNVX(sv) > (NV)UV_MAX) {
2293 /* Integer is inaccurate. NOK, IOKp, is UV */
2297 SvUVX(sv) = U_V(SvNVX(sv));
2298 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2299 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2303 /* Integer is imprecise. NOK, IOKp, is UV */
2309 #else /* NV_PRESERVES_UV */
2310 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2311 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2312 /* The IV slot will have been set from value returned by
2313 grok_number above. The NV slot has just been set using
2316 assert (SvIOKp(sv));
2318 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2319 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2320 /* Small enough to preserve all bits. */
2321 (void)SvIOKp_on(sv);
2323 SvIVX(sv) = I_V(SvNVX(sv));
2324 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2326 /* Assumption: first non-preserved integer is < IV_MAX,
2327 this NV is in the preserved range, therefore: */
2328 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2330 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);
2334 0 0 already failed to read UV.
2335 0 1 already failed to read UV.
2336 1 0 you won't get here in this case. IV/UV
2337 slot set, public IOK, Atof() unneeded.
2338 1 1 already read UV.
2339 so there's no point in sv_2iuv_non_preserve() attempting
2340 to use atol, strtol, strtoul etc. */
2341 if (sv_2iuv_non_preserve (sv, numtype)
2342 >= IS_NUMBER_OVERFLOW_IV)
2346 #endif /* NV_PRESERVES_UV */
2349 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2351 if (SvTYPE(sv) < SVt_IV)
2352 /* Typically the caller expects that sv_any is not NULL now. */
2353 sv_upgrade(sv, SVt_IV);
2356 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2357 PTR2UV(sv),SvIVX(sv)));
2358 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2361 /* sv_2uv() is now a macro using Perl_sv_2uv_flags();
2362 * this function provided for binary compatibility only
2366 Perl_sv_2uv(pTHX_ register SV *sv)
2368 return sv_2uv_flags(sv, SV_GMAGIC);
2372 =for apidoc sv_2uv_flags
2374 Return the unsigned integer value of an SV, doing any necessary string
2375 conversion. If flags includes SV_GMAGIC, does an mg_get() first.
2376 Normally used via the C<SvUV(sv)> and C<SvUVx(sv)> macros.
2382 Perl_sv_2uv_flags(pTHX_ register SV *sv, I32 flags)
2386 if (SvGMAGICAL(sv)) {
2387 if (flags & SV_GMAGIC)
2392 return U_V(SvNVX(sv));
2393 if (SvPOKp(sv) && SvLEN(sv))
2396 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2397 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2403 if (SvTHINKFIRST(sv)) {
2406 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2407 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2408 return SvUV(tmpstr);
2409 return PTR2UV(SvRV(sv));
2412 sv_force_normal_flags(sv, 0);
2414 if (SvREADONLY(sv) && !SvOK(sv)) {
2415 if (ckWARN(WARN_UNINITIALIZED))
2425 return (UV)SvIVX(sv);
2429 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2430 * without also getting a cached IV/UV from it at the same time
2431 * (ie PV->NV conversion should detect loss of accuracy and cache
2432 * IV or UV at same time to avoid this. */
2433 /* IV-over-UV optimisation - choose to cache IV if possible */
2435 if (SvTYPE(sv) == SVt_NV)
2436 sv_upgrade(sv, SVt_PVNV);
2438 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2439 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2440 SvIVX(sv) = I_V(SvNVX(sv));
2441 if (SvNVX(sv) == (NV) SvIVX(sv)
2442 #ifndef NV_PRESERVES_UV
2443 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2444 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2445 /* Don't flag it as "accurately an integer" if the number
2446 came from a (by definition imprecise) NV operation, and
2447 we're outside the range of NV integer precision */
2450 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2451 DEBUG_c(PerlIO_printf(Perl_debug_log,
2452 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2458 /* IV not precise. No need to convert from PV, as NV
2459 conversion would already have cached IV if it detected
2460 that PV->IV would be better than PV->NV->IV
2461 flags already correct - don't set public IOK. */
2462 DEBUG_c(PerlIO_printf(Perl_debug_log,
2463 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2468 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2469 but the cast (NV)IV_MIN rounds to a the value less (more
2470 negative) than IV_MIN which happens to be equal to SvNVX ??
2471 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2472 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2473 (NV)UVX == NVX are both true, but the values differ. :-(
2474 Hopefully for 2s complement IV_MIN is something like
2475 0x8000000000000000 which will be exact. NWC */
2478 SvUVX(sv) = U_V(SvNVX(sv));
2480 (SvNVX(sv) == (NV) SvUVX(sv))
2481 #ifndef NV_PRESERVES_UV
2482 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2483 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2484 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2485 /* Don't flag it as "accurately an integer" if the number
2486 came from a (by definition imprecise) NV operation, and
2487 we're outside the range of NV integer precision */
2492 DEBUG_c(PerlIO_printf(Perl_debug_log,
2493 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2499 else if (SvPOKp(sv) && SvLEN(sv)) {
2501 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2503 /* We want to avoid a possible problem when we cache a UV which
2504 may be later translated to an NV, and the resulting NV is not
2505 the translation of the initial data.
2507 This means that if we cache such a UV, we need to cache the
2508 NV as well. Moreover, we trade speed for space, and do not
2509 cache the NV if not needed.
2512 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2513 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2514 == IS_NUMBER_IN_UV) {
2515 /* It's definitely an integer, only upgrade to PVIV */
2516 if (SvTYPE(sv) < SVt_PVIV)
2517 sv_upgrade(sv, SVt_PVIV);
2519 } else if (SvTYPE(sv) < SVt_PVNV)
2520 sv_upgrade(sv, SVt_PVNV);
2522 /* If NV preserves UV then we only use the UV value if we know that
2523 we aren't going to call atof() below. If NVs don't preserve UVs
2524 then the value returned may have more precision than atof() will
2525 return, even though it isn't accurate. */
2526 if ((numtype & (IS_NUMBER_IN_UV
2527 #ifdef NV_PRESERVES_UV
2530 )) == IS_NUMBER_IN_UV) {
2531 /* This won't turn off the public IOK flag if it was set above */
2532 (void)SvIOKp_on(sv);
2534 if (!(numtype & IS_NUMBER_NEG)) {
2536 if (value <= (UV)IV_MAX) {
2537 SvIVX(sv) = (IV)value;
2539 /* it didn't overflow, and it was positive. */
2544 /* 2s complement assumption */
2545 if (value <= (UV)IV_MIN) {
2546 SvIVX(sv) = -(IV)value;
2548 /* Too negative for an IV. This is a double upgrade, but
2549 I'm assuming it will be rare. */
2550 if (SvTYPE(sv) < SVt_PVNV)
2551 sv_upgrade(sv, SVt_PVNV);
2555 SvNVX(sv) = -(NV)value;
2561 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2562 != IS_NUMBER_IN_UV) {
2563 /* It wasn't an integer, or it overflowed the UV. */
2564 SvNVX(sv) = Atof(SvPVX(sv));
2566 if (! numtype && ckWARN(WARN_NUMERIC))
2569 #if defined(USE_LONG_DOUBLE)
2570 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2571 PTR2UV(sv), SvNVX(sv)));
2573 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2574 PTR2UV(sv), SvNVX(sv)));
2577 #ifdef NV_PRESERVES_UV
2578 (void)SvIOKp_on(sv);
2580 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2581 SvIVX(sv) = I_V(SvNVX(sv));
2582 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2585 /* Integer is imprecise. NOK, IOKp */
2587 /* UV will not work better than IV */
2589 if (SvNVX(sv) > (NV)UV_MAX) {
2591 /* Integer is inaccurate. NOK, IOKp, is UV */
2595 SvUVX(sv) = U_V(SvNVX(sv));
2596 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2597 NV preservse UV so can do correct comparison. */
2598 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2602 /* Integer is imprecise. NOK, IOKp, is UV */
2607 #else /* NV_PRESERVES_UV */
2608 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2609 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2610 /* The UV slot will have been set from value returned by
2611 grok_number above. The NV slot has just been set using
2614 assert (SvIOKp(sv));
2616 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2617 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2618 /* Small enough to preserve all bits. */
2619 (void)SvIOKp_on(sv);
2621 SvIVX(sv) = I_V(SvNVX(sv));
2622 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2624 /* Assumption: first non-preserved integer is < IV_MAX,
2625 this NV is in the preserved range, therefore: */
2626 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2628 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);
2631 sv_2iuv_non_preserve (sv, numtype);
2633 #endif /* NV_PRESERVES_UV */
2637 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2638 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2641 if (SvTYPE(sv) < SVt_IV)
2642 /* Typically the caller expects that sv_any is not NULL now. */
2643 sv_upgrade(sv, SVt_IV);
2647 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2648 PTR2UV(sv),SvUVX(sv)));
2649 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2655 Return the num value of an SV, doing any necessary string or integer
2656 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2663 Perl_sv_2nv(pTHX_ register SV *sv)
2667 if (SvGMAGICAL(sv)) {
2671 if (SvPOKp(sv) && SvLEN(sv)) {
2672 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2673 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2675 return Atof(SvPVX(sv));
2679 return (NV)SvUVX(sv);
2681 return (NV)SvIVX(sv);
2684 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2685 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2691 if (SvTHINKFIRST(sv)) {
2694 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2695 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2696 return SvNV(tmpstr);
2697 return PTR2NV(SvRV(sv));
2700 sv_force_normal_flags(sv, 0);
2702 if (SvREADONLY(sv) && !SvOK(sv)) {
2703 if (ckWARN(WARN_UNINITIALIZED))
2708 if (SvTYPE(sv) < SVt_NV) {
2709 if (SvTYPE(sv) == SVt_IV)
2710 sv_upgrade(sv, SVt_PVNV);
2712 sv_upgrade(sv, SVt_NV);
2713 #ifdef USE_LONG_DOUBLE
2715 STORE_NUMERIC_LOCAL_SET_STANDARD();
2716 PerlIO_printf(Perl_debug_log,
2717 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2718 PTR2UV(sv), SvNVX(sv));
2719 RESTORE_NUMERIC_LOCAL();
2723 STORE_NUMERIC_LOCAL_SET_STANDARD();
2724 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2725 PTR2UV(sv), SvNVX(sv));
2726 RESTORE_NUMERIC_LOCAL();
2730 else if (SvTYPE(sv) < SVt_PVNV)
2731 sv_upgrade(sv, SVt_PVNV);
2736 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2737 #ifdef NV_PRESERVES_UV
2740 /* Only set the public NV OK flag if this NV preserves the IV */
2741 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2742 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2743 : (SvIVX(sv) == I_V(SvNVX(sv))))
2749 else if (SvPOKp(sv) && SvLEN(sv)) {
2751 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2752 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2754 #ifdef NV_PRESERVES_UV
2755 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2756 == IS_NUMBER_IN_UV) {
2757 /* It's definitely an integer */
2758 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2760 SvNVX(sv) = Atof(SvPVX(sv));
2763 SvNVX(sv) = Atof(SvPVX(sv));
2764 /* Only set the public NV OK flag if this NV preserves the value in
2765 the PV at least as well as an IV/UV would.
2766 Not sure how to do this 100% reliably. */
2767 /* if that shift count is out of range then Configure's test is
2768 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2770 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2771 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2772 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2773 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2774 /* Can't use strtol etc to convert this string, so don't try.
2775 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2778 /* value has been set. It may not be precise. */
2779 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2780 /* 2s complement assumption for (UV)IV_MIN */
2781 SvNOK_on(sv); /* Integer is too negative. */
2786 if (numtype & IS_NUMBER_NEG) {
2787 SvIVX(sv) = -(IV)value;
2788 } else if (value <= (UV)IV_MAX) {
2789 SvIVX(sv) = (IV)value;
2795 if (numtype & IS_NUMBER_NOT_INT) {
2796 /* I believe that even if the original PV had decimals,
2797 they are lost beyond the limit of the FP precision.
2798 However, neither is canonical, so both only get p
2799 flags. NWC, 2000/11/25 */
2800 /* Both already have p flags, so do nothing */
2803 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2804 if (SvIVX(sv) == I_V(nv)) {
2809 /* It had no "." so it must be integer. */
2812 /* between IV_MAX and NV(UV_MAX).
2813 Could be slightly > UV_MAX */
2815 if (numtype & IS_NUMBER_NOT_INT) {
2816 /* UV and NV both imprecise. */
2818 UV nv_as_uv = U_V(nv);
2820 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2831 #endif /* NV_PRESERVES_UV */
2834 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2836 if (SvTYPE(sv) < SVt_NV)
2837 /* Typically the caller expects that sv_any is not NULL now. */
2838 /* XXX Ilya implies that this is a bug in callers that assume this
2839 and ideally should be fixed. */
2840 sv_upgrade(sv, SVt_NV);
2843 #if defined(USE_LONG_DOUBLE)
2845 STORE_NUMERIC_LOCAL_SET_STANDARD();
2846 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2847 PTR2UV(sv), SvNVX(sv));
2848 RESTORE_NUMERIC_LOCAL();
2852 STORE_NUMERIC_LOCAL_SET_STANDARD();
2853 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2854 PTR2UV(sv), SvNVX(sv));
2855 RESTORE_NUMERIC_LOCAL();
2861 /* asIV(): extract an integer from the string value of an SV.
2862 * Caller must validate PVX */
2865 S_asIV(pTHX_ SV *sv)
2868 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2870 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2871 == IS_NUMBER_IN_UV) {
2872 /* It's definitely an integer */
2873 if (numtype & IS_NUMBER_NEG) {
2874 if (value < (UV)IV_MIN)
2877 if (value < (UV)IV_MAX)
2882 if (ckWARN(WARN_NUMERIC))
2885 return I_V(Atof(SvPVX(sv)));
2888 /* asUV(): extract an unsigned integer from the string value of an SV
2889 * Caller must validate PVX */
2892 S_asUV(pTHX_ SV *sv)
2895 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2897 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2898 == IS_NUMBER_IN_UV) {
2899 /* It's definitely an integer */
2900 if (!(numtype & IS_NUMBER_NEG))
2904 if (ckWARN(WARN_NUMERIC))
2907 return U_V(Atof(SvPVX(sv)));
2911 =for apidoc sv_2pv_nolen
2913 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2914 use the macro wrapper C<SvPV_nolen(sv)> instead.
2919 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2922 return sv_2pv(sv, &n_a);
2925 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2926 * UV as a string towards the end of buf, and return pointers to start and
2929 * We assume that buf is at least TYPE_CHARS(UV) long.
2933 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2935 char *ptr = buf + TYPE_CHARS(UV);
2949 *--ptr = '0' + (char)(uv % 10);
2957 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2958 * this function provided for binary compatibility only
2962 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2964 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2968 =for apidoc sv_2pv_flags
2970 Returns a pointer to the string value of an SV, and sets *lp to its length.
2971 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2973 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2974 usually end up here too.
2980 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2985 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2986 char *tmpbuf = tbuf;
2992 if (SvGMAGICAL(sv)) {
2993 if (flags & SV_GMAGIC)
3001 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
3003 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
3008 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
3013 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
3014 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
3021 if (SvTHINKFIRST(sv)) {
3024 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
3025 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
3026 char *pv = SvPV(tmpstr, *lp);
3040 switch (SvTYPE(sv)) {
3042 if ( ((SvFLAGS(sv) &
3043 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
3044 == (SVs_OBJECT|SVs_SMG))
3045 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
3046 regexp *re = (regexp *)mg->mg_obj;
3049 char *fptr = "msix";
3054 char need_newline = 0;
3055 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
3057 while((ch = *fptr++)) {
3059 reflags[left++] = ch;
3062 reflags[right--] = ch;
3067 reflags[left] = '-';
3071 mg->mg_len = re->prelen + 4 + left;
3073 * If /x was used, we have to worry about a regex
3074 * ending with a comment later being embedded
3075 * within another regex. If so, we don't want this
3076 * regex's "commentization" to leak out to the
3077 * right part of the enclosing regex, we must cap
3078 * it with a newline.
3080 * So, if /x was used, we scan backwards from the
3081 * end of the regex. If we find a '#' before we
3082 * find a newline, we need to add a newline
3083 * ourself. If we find a '\n' first (or if we
3084 * don't find '#' or '\n'), we don't need to add
3085 * anything. -jfriedl
3087 if (PMf_EXTENDED & re->reganch)
3089 char *endptr = re->precomp + re->prelen;
3090 while (endptr >= re->precomp)
3092 char c = *(endptr--);
3094 break; /* don't need another */
3096 /* we end while in a comment, so we
3098 mg->mg_len++; /* save space for it */
3099 need_newline = 1; /* note to add it */
3105 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3106 Copy("(?", mg->mg_ptr, 2, char);
3107 Copy(reflags, mg->mg_ptr+2, left, char);
3108 Copy(":", mg->mg_ptr+left+2, 1, char);
3109 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3111 mg->mg_ptr[mg->mg_len - 2] = '\n';
3112 mg->mg_ptr[mg->mg_len - 1] = ')';
3113 mg->mg_ptr[mg->mg_len] = 0;
3115 PL_reginterp_cnt += re->program[0].next_off;
3117 if (re->reganch & ROPT_UTF8)
3132 case SVt_PVBM: if (SvROK(sv))
3135 s = "SCALAR"; break;
3136 case SVt_PVLV: s = SvROK(sv) ? "REF"
3137 /* tied lvalues should appear to be
3138 * scalars for backwards compatitbility */
3139 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
3140 ? "SCALAR" : "LVALUE"; break;
3141 case SVt_PVAV: s = "ARRAY"; break;
3142 case SVt_PVHV: s = "HASH"; break;
3143 case SVt_PVCV: s = "CODE"; break;
3144 case SVt_PVGV: s = "GLOB"; break;
3145 case SVt_PVFM: s = "FORMAT"; break;
3146 case SVt_PVIO: s = "IO"; break;
3147 default: s = "UNKNOWN"; break;
3151 if (HvNAME(SvSTASH(sv)))
3152 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
3154 Perl_sv_setpvf(aTHX_ tsv, "__ANON__=%s", s);
3157 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3163 if (SvREADONLY(sv) && !SvOK(sv)) {
3164 if (ckWARN(WARN_UNINITIALIZED))
3170 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3171 /* I'm assuming that if both IV and NV are equally valid then
3172 converting the IV is going to be more efficient */
3173 U32 isIOK = SvIOK(sv);
3174 U32 isUIOK = SvIsUV(sv);
3175 char buf[TYPE_CHARS(UV)];
3178 if (SvTYPE(sv) < SVt_PVIV)
3179 sv_upgrade(sv, SVt_PVIV);
3181 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3183 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3184 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3185 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3186 SvCUR_set(sv, ebuf - ptr);
3196 else if (SvNOKp(sv)) {
3197 if (SvTYPE(sv) < SVt_PVNV)
3198 sv_upgrade(sv, SVt_PVNV);
3199 /* The +20 is pure guesswork. Configure test needed. --jhi */
3200 SvGROW(sv, NV_DIG + 20);
3202 olderrno = errno; /* some Xenix systems wipe out errno here */
3204 if (SvNVX(sv) == 0.0)
3205 (void)strcpy(s,"0");
3209 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3212 #ifdef FIXNEGATIVEZERO
3213 if (*s == '-' && s[1] == '0' && !s[2])
3223 if (ckWARN(WARN_UNINITIALIZED)
3224 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3227 if (SvTYPE(sv) < SVt_PV)
3228 /* Typically the caller expects that sv_any is not NULL now. */
3229 sv_upgrade(sv, SVt_PV);
3232 *lp = s - SvPVX(sv);
3235 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3236 PTR2UV(sv),SvPVX(sv)));
3240 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3241 /* Sneaky stuff here */
3245 tsv = newSVpv(tmpbuf, 0);
3261 len = strlen(tmpbuf);
3263 #ifdef FIXNEGATIVEZERO
3264 if (len == 2 && t[0] == '-' && t[1] == '0') {
3269 (void)SvUPGRADE(sv, SVt_PV);
3271 s = SvGROW(sv, len + 1);
3280 =for apidoc sv_copypv
3282 Copies a stringified representation of the source SV into the
3283 destination SV. Automatically performs any necessary mg_get and
3284 coercion of numeric values into strings. Guaranteed to preserve
3285 UTF-8 flag even from overloaded objects. Similar in nature to
3286 sv_2pv[_flags] but operates directly on an SV instead of just the
3287 string. Mostly uses sv_2pv_flags to do its work, except when that
3288 would lose the UTF-8'ness of the PV.
3294 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3299 sv_setpvn(dsv,s,len);
3307 =for apidoc sv_2pvbyte_nolen
3309 Return a pointer to the byte-encoded representation of the SV.
3310 May cause the SV to be downgraded from UTF-8 as a side-effect.
3312 Usually accessed via the C<SvPVbyte_nolen> macro.
3318 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3321 return sv_2pvbyte(sv, &n_a);
3325 =for apidoc sv_2pvbyte
3327 Return a pointer to the byte-encoded representation of the SV, and set *lp
3328 to its length. May cause the SV to be downgraded from UTF-8 as a
3331 Usually accessed via the C<SvPVbyte> macro.
3337 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3339 sv_utf8_downgrade(sv,0);
3340 return SvPV(sv,*lp);
3344 =for apidoc sv_2pvutf8_nolen
3346 Return a pointer to the UTF-8-encoded representation of the SV.
3347 May cause the SV to be upgraded to UTF-8 as a side-effect.
3349 Usually accessed via the C<SvPVutf8_nolen> macro.
3355 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3358 return sv_2pvutf8(sv, &n_a);
3362 =for apidoc sv_2pvutf8
3364 Return a pointer to the UTF-8-encoded representation of the SV, and set *lp
3365 to its length. May cause the SV to be upgraded to UTF-8 as a side-effect.
3367 Usually accessed via the C<SvPVutf8> macro.
3373 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3375 sv_utf8_upgrade(sv);
3376 return SvPV(sv,*lp);
3380 =for apidoc sv_2bool
3382 This function is only called on magical items, and is only used by
3383 sv_true() or its macro equivalent.
3389 Perl_sv_2bool(pTHX_ register SV *sv)
3398 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3399 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3400 return (bool)SvTRUE(tmpsv);
3401 return SvRV(sv) != 0;
3404 register XPV* Xpvtmp;
3405 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3406 (*Xpvtmp->xpv_pv > '0' ||
3407 Xpvtmp->xpv_cur > 1 ||
3408 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3415 return SvIVX(sv) != 0;
3418 return SvNVX(sv) != 0.0;
3425 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3426 * this function provided for binary compatibility only
3431 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3433 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3437 =for apidoc sv_utf8_upgrade
3439 Convert the PV of an SV to its UTF-8-encoded form.
3440 Forces the SV to string form if it is not already.
3441 Always sets the SvUTF8 flag to avoid future validity checks even
3442 if all the bytes have hibit clear.
3444 This is not as a general purpose byte encoding to Unicode interface:
3445 use the Encode extension for that.
3447 =for apidoc sv_utf8_upgrade_flags
3449 Convert the PV of an SV to its UTF-8-encoded form.
3450 Forces the SV to string form if it is not already.
3451 Always sets the SvUTF8 flag to avoid future validity checks even
3452 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3453 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3454 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3456 This is not as a general purpose byte encoding to Unicode interface:
3457 use the Encode extension for that.
3463 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3473 (void) sv_2pv_flags(sv,&len, flags);
3482 sv_force_normal_flags(sv, 0);
3485 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3486 sv_recode_to_utf8(sv, PL_encoding);
3487 else { /* Assume Latin-1/EBCDIC */
3488 /* This function could be much more efficient if we
3489 * had a FLAG in SVs to signal if there are any hibit
3490 * chars in the PV. Given that there isn't such a flag
3491 * make the loop as fast as possible. */
3492 s = (U8 *) SvPVX(sv);
3493 e = (U8 *) SvEND(sv);
3497 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3502 (void)SvOOK_off(sv);
3504 len = SvCUR(sv) + 1; /* Plus the \0 */
3505 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3506 SvCUR(sv) = len - 1;
3508 Safefree(s); /* No longer using what was there before. */
3509 SvLEN(sv) = len; /* No longer know the real size. */
3511 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3518 =for apidoc sv_utf8_downgrade
3520 Attempt to convert the PV of an SV from UTF-8-encoded to byte encoding.
3521 This may not be possible if the PV contains non-byte encoding characters;
3522 if this is the case, either returns false or, if C<fail_ok> is not
3525 This is not as a general purpose Unicode to byte encoding interface:
3526 use the Encode extension for that.
3532 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3534 if (SvPOK(sv) && SvUTF8(sv)) {
3540 sv_force_normal_flags(sv, 0);
3542 s = (U8 *) SvPV(sv, len);
3543 if (!utf8_to_bytes(s, &len)) {
3548 Perl_croak(aTHX_ "Wide character in %s",
3551 Perl_croak(aTHX_ "Wide character");
3562 =for apidoc sv_utf8_encode
3564 Convert the PV of an SV to UTF-8-encoded, but then turn off the C<SvUTF8>
3565 flag so that it looks like octets again. Used as a building block
3566 for encode_utf8 in Encode.xs
3572 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3574 (void) sv_utf8_upgrade(sv);
3576 sv_force_normal_flags(sv, 0);
3578 if (SvREADONLY(sv)) {
3579 Perl_croak(aTHX_ PL_no_modify);
3585 =for apidoc sv_utf8_decode
3587 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3588 turn off SvUTF8 if needed so that we see characters. Used as a building block
3589 for decode_utf8 in Encode.xs
3595 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3601 /* The octets may have got themselves encoded - get them back as
3604 if (!sv_utf8_downgrade(sv, TRUE))
3607 /* it is actually just a matter of turning the utf8 flag on, but
3608 * we want to make sure everything inside is valid utf8 first.
3610 c = (U8 *) SvPVX(sv);
3611 if (!is_utf8_string(c, SvCUR(sv)+1))
3613 e = (U8 *) SvEND(sv);
3616 if (!UTF8_IS_INVARIANT(ch)) {
3625 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3626 * this function provided for binary compatibility only
3630 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3632 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3636 =for apidoc sv_setsv
3638 Copies the contents of the source SV C<ssv> into the destination SV
3639 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3640 function if the source SV needs to be reused. Does not handle 'set' magic.
3641 Loosely speaking, it performs a copy-by-value, obliterating any previous
3642 content of the destination.
3644 You probably want to use one of the assortment of wrappers, such as
3645 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3646 C<SvSetMagicSV_nosteal>.
3648 =for apidoc sv_setsv_flags
3650 Copies the contents of the source SV C<ssv> into the destination SV
3651 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3652 function if the source SV needs to be reused. Does not handle 'set' magic.
3653 Loosely speaking, it performs a copy-by-value, obliterating any previous
3654 content of the destination.
3655 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3656 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3657 implemented in terms of this function.
3659 You probably want to use one of the assortment of wrappers, such as
3660 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3661 C<SvSetMagicSV_nosteal>.
3663 This is the primary function for copying scalars, and most other
3664 copy-ish functions and macros use this underneath.
3670 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3672 register U32 sflags;
3678 SV_CHECK_THINKFIRST_COW_DROP(dstr);
3680 sstr = &PL_sv_undef;
3681 stype = SvTYPE(sstr);
3682 dtype = SvTYPE(dstr);
3687 /* need to nuke the magic */
3689 SvRMAGICAL_off(dstr);
3692 /* There's a lot of redundancy below but we're going for speed here */
3697 if (dtype != SVt_PVGV) {
3698 (void)SvOK_off(dstr);
3706 sv_upgrade(dstr, SVt_IV);
3709 sv_upgrade(dstr, SVt_PVNV);
3713 sv_upgrade(dstr, SVt_PVIV);
3716 (void)SvIOK_only(dstr);
3717 SvIVX(dstr) = SvIVX(sstr);
3720 if (SvTAINTED(sstr))
3731 sv_upgrade(dstr, SVt_NV);
3736 sv_upgrade(dstr, SVt_PVNV);
3739 SvNVX(dstr) = SvNVX(sstr);
3740 (void)SvNOK_only(dstr);
3741 if (SvTAINTED(sstr))
3749 sv_upgrade(dstr, SVt_RV);
3750 else if (dtype == SVt_PVGV &&
3751 SvROK(sstr) && SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3754 if (GvIMPORTED(dstr) != GVf_IMPORTED
3755 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3757 GvIMPORTED_on(dstr);
3766 #ifdef PERL_COPY_ON_WRITE
3767 if ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS) {
3768 if (dtype < SVt_PVIV)
3769 sv_upgrade(dstr, SVt_PVIV);
3776 sv_upgrade(dstr, SVt_PV);
3779 if (dtype < SVt_PVIV)
3780 sv_upgrade(dstr, SVt_PVIV);
3783 if (dtype < SVt_PVNV)
3784 sv_upgrade(dstr, SVt_PVNV);
3791 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3794 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3798 if (dtype <= SVt_PVGV) {
3800 if (dtype != SVt_PVGV) {
3801 char *name = GvNAME(sstr);
3802 STRLEN len = GvNAMELEN(sstr);
3803 /* don't upgrade SVt_PVLV: it can hold a glob */
3804 if (dtype != SVt_PVLV)
3805 sv_upgrade(dstr, SVt_PVGV);
3806 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3807 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3808 GvNAME(dstr) = savepvn(name, len);
3809 GvNAMELEN(dstr) = len;
3810 SvFAKE_on(dstr); /* can coerce to non-glob */
3812 /* ahem, death to those who redefine active sort subs */
3813 else if (PL_curstackinfo->si_type == PERLSI_SORT
3814 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3815 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3818 #ifdef GV_UNIQUE_CHECK
3819 if (GvUNIQUE((GV*)dstr)) {
3820 Perl_croak(aTHX_ PL_no_modify);
3824 (void)SvOK_off(dstr);
3825 GvINTRO_off(dstr); /* one-shot flag */
3827 GvGP(dstr) = gp_ref(GvGP(sstr));
3828 if (SvTAINTED(sstr))
3830 if (GvIMPORTED(dstr) != GVf_IMPORTED
3831 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3833 GvIMPORTED_on(dstr);
3841 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3843 if ((int)SvTYPE(sstr) != stype) {
3844 stype = SvTYPE(sstr);
3845 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3849 if (stype == SVt_PVLV)
3850 (void)SvUPGRADE(dstr, SVt_PVNV);
3852 (void)SvUPGRADE(dstr, (U32)stype);
3855 sflags = SvFLAGS(sstr);
3857 if (sflags & SVf_ROK) {
3858 if (dtype >= SVt_PV) {
3859 if (dtype == SVt_PVGV) {
3860 SV *sref = SvREFCNT_inc(SvRV(sstr));
3862 int intro = GvINTRO(dstr);
3864 #ifdef GV_UNIQUE_CHECK
3865 if (GvUNIQUE((GV*)dstr)) {
3866 Perl_croak(aTHX_ PL_no_modify);
3871 GvINTRO_off(dstr); /* one-shot flag */
3872 GvLINE(dstr) = CopLINE(PL_curcop);
3873 GvEGV(dstr) = (GV*)dstr;
3876 switch (SvTYPE(sref)) {
3879 SAVEGENERICSV(GvAV(dstr));
3881 dref = (SV*)GvAV(dstr);
3882 GvAV(dstr) = (AV*)sref;
3883 if (!GvIMPORTED_AV(dstr)
3884 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3886 GvIMPORTED_AV_on(dstr);
3891 SAVEGENERICSV(GvHV(dstr));
3893 dref = (SV*)GvHV(dstr);
3894 GvHV(dstr) = (HV*)sref;
3895 if (!GvIMPORTED_HV(dstr)
3896 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3898 GvIMPORTED_HV_on(dstr);
3903 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3904 SvREFCNT_dec(GvCV(dstr));
3905 GvCV(dstr) = Nullcv;
3906 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3907 PL_sub_generation++;
3909 SAVEGENERICSV(GvCV(dstr));
3912 dref = (SV*)GvCV(dstr);
3913 if (GvCV(dstr) != (CV*)sref) {
3914 CV* cv = GvCV(dstr);
3916 if (!GvCVGEN((GV*)dstr) &&
3917 (CvROOT(cv) || CvXSUB(cv)))
3919 /* ahem, death to those who redefine
3920 * active sort subs */
3921 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3922 PL_sortcop == CvSTART(cv))
3924 "Can't redefine active sort subroutine %s",
3925 GvENAME((GV*)dstr));
3926 /* Redefining a sub - warning is mandatory if
3927 it was a const and its value changed. */
3928 if (ckWARN(WARN_REDEFINE)
3930 && (!CvCONST((CV*)sref)
3931 || sv_cmp(cv_const_sv(cv),
3932 cv_const_sv((CV*)sref)))))
3934 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3936 ? "Constant subroutine %s::%s redefined"
3937 : "Subroutine %s::%s redefined",
3938 HvNAME(GvSTASH((GV*)dstr)),
3939 GvENAME((GV*)dstr));
3943 cv_ckproto(cv, (GV*)dstr,
3944 SvPOK(sref) ? SvPVX(sref) : Nullch);
3946 GvCV(dstr) = (CV*)sref;
3947 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3948 GvASSUMECV_on(dstr);
3949 PL_sub_generation++;
3951 if (!GvIMPORTED_CV(dstr)
3952 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3954 GvIMPORTED_CV_on(dstr);
3959 SAVEGENERICSV(GvIOp(dstr));
3961 dref = (SV*)GvIOp(dstr);
3962 GvIOp(dstr) = (IO*)sref;
3966 SAVEGENERICSV(GvFORM(dstr));
3968 dref = (SV*)GvFORM(dstr);
3969 GvFORM(dstr) = (CV*)sref;
3973 SAVEGENERICSV(GvSV(dstr));
3975 dref = (SV*)GvSV(dstr);
3977 if (!GvIMPORTED_SV(dstr)
3978 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3980 GvIMPORTED_SV_on(dstr);
3986 if (SvTAINTED(sstr))
3991 (void)SvOOK_off(dstr); /* backoff */
3993 Safefree(SvPVX(dstr));
3994 SvLEN(dstr)=SvCUR(dstr)=0;
3997 (void)SvOK_off(dstr);
3998 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
4000 if (sflags & SVp_NOK) {
4002 /* Only set the public OK flag if the source has public OK. */
4003 if (sflags & SVf_NOK)
4004 SvFLAGS(dstr) |= SVf_NOK;
4005 SvNVX(dstr) = SvNVX(sstr);
4007 if (sflags & SVp_IOK) {
4008 (void)SvIOKp_on(dstr);
4009 if (sflags & SVf_IOK)
4010 SvFLAGS(dstr) |= SVf_IOK;
4011 if (sflags & SVf_IVisUV)
4013 SvIVX(dstr) = SvIVX(sstr);
4015 if (SvAMAGIC(sstr)) {
4019 else if (sflags & SVp_POK) {
4023 * Check to see if we can just swipe the string. If so, it's a
4024 * possible small lose on short strings, but a big win on long ones.
4025 * It might even be a win on short strings if SvPVX(dstr)
4026 * has to be allocated and SvPVX(sstr) has to be freed.
4029 /* Whichever path we take through the next code, we want this true,
4030 and doing it now facilitates the COW check. */
4031 (void)SvPOK_only(dstr);
4034 #ifdef PERL_COPY_ON_WRITE
4035 (sflags & (SVf_FAKE | SVf_READONLY)) != (SVf_FAKE | SVf_READONLY)
4039 (sflags & SVs_TEMP) && /* slated for free anyway? */
4040 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
4041 SvREFCNT(sstr) == 1 && /* and no other references to it? */
4042 SvLEN(sstr) && /* and really is a string */
4043 /* and won't be needed again, potentially */
4044 !(PL_op && PL_op->op_type == OP_AASSIGN))
4045 #ifdef PERL_COPY_ON_WRITE
4046 && !((sflags & CAN_COW_MASK) == CAN_COW_FLAGS
4047 && (SvFLAGS(dstr) & CAN_COW_MASK) == CAN_COW_FLAGS
4048 && SvTYPE(sstr) >= SVt_PVIV)
4051 /* Failed the swipe test, and it's not a shared hash key either.
4052 Have to copy the string. */
4053 STRLEN len = SvCUR(sstr);
4054 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
4055 Move(SvPVX(sstr),SvPVX(dstr),len,char);
4056 SvCUR_set(dstr, len);
4057 *SvEND(dstr) = '\0';
4059 /* If PERL_COPY_ON_WRITE is not defined, then isSwipe will always
4061 #ifdef PERL_COPY_ON_WRITE
4062 /* Either it's a shared hash key, or it's suitable for
4063 copy-on-write or we can swipe the string. */
4065 PerlIO_printf(Perl_debug_log, "Copy on write: sstr --> dstr\n");
4070 /* I believe I should acquire a global SV mutex if
4071 it's a COW sv (not a shared hash key) to stop
4072 it going un copy-on-write.
4073 If the source SV has gone un copy on write between up there
4074 and down here, then (assert() that) it is of the correct
4075 form to make it copy on write again */
4076 if ((sflags & (SVf_FAKE | SVf_READONLY))
4077 != (SVf_FAKE | SVf_READONLY)) {
4078 SvREADONLY_on(sstr);
4080 /* Make the source SV into a loop of 1.
4081 (about to become 2) */
4082 SV_COW_NEXT_SV_SET(sstr, sstr);
4086 /* Initial code is common. */
4087 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
4089 SvFLAGS(dstr) &= ~SVf_OOK;
4090 Safefree(SvPVX(dstr) - SvIVX(dstr));
4092 else if (SvLEN(dstr))
4093 Safefree(SvPVX(dstr));
4096 #ifdef PERL_COPY_ON_WRITE
4098 /* making another shared SV. */
4099 STRLEN cur = SvCUR(sstr);
4100 STRLEN len = SvLEN(sstr);
4101 assert (SvTYPE(dstr) >= SVt_PVIV);
4103 /* SvIsCOW_normal */
4104 /* splice us in between source and next-after-source. */
4105 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4106 SV_COW_NEXT_SV_SET(sstr, dstr);
4107 SvPV_set(dstr, SvPVX(sstr));
4109 /* SvIsCOW_shared_hash */
4110 UV hash = SvUVX(sstr);
4111 DEBUG_C(PerlIO_printf(Perl_debug_log,
4112 "Copy on write: Sharing hash\n"));
4114 sharepvn(SvPVX(sstr),
4115 (sflags & SVf_UTF8?-cur:cur), hash));
4120 SvREADONLY_on(dstr);
4122 /* Relesase a global SV mutex. */
4126 { /* Passes the swipe test. */
4127 SvPV_set(dstr, SvPVX(sstr));
4128 SvLEN_set(dstr, SvLEN(sstr));
4129 SvCUR_set(dstr, SvCUR(sstr));
4132 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
4133 SvPV_set(sstr, Nullch);
4139 if (sflags & SVf_UTF8)
4142 if (sflags & SVp_NOK) {
4144 if (sflags & SVf_NOK)
4145 SvFLAGS(dstr) |= SVf_NOK;
4146 SvNVX(dstr) = SvNVX(sstr);
4148 if (sflags & SVp_IOK) {
4149 (void)SvIOKp_on(dstr);
4150 if (sflags & SVf_IOK)
4151 SvFLAGS(dstr) |= SVf_IOK;
4152 if (sflags & SVf_IVisUV)
4154 SvIVX(dstr) = SvIVX(sstr);
4157 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4158 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4159 smg->mg_ptr, smg->mg_len);
4160 SvRMAGICAL_on(dstr);
4163 else if (sflags & SVp_IOK) {
4164 if (sflags & SVf_IOK)
4165 (void)SvIOK_only(dstr);
4167 (void)SvOK_off(dstr);
4168 (void)SvIOKp_on(dstr);
4170 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4171 if (sflags & SVf_IVisUV)
4173 SvIVX(dstr) = SvIVX(sstr);
4174 if (sflags & SVp_NOK) {
4175 if (sflags & SVf_NOK)
4176 (void)SvNOK_on(dstr);
4178 (void)SvNOKp_on(dstr);
4179 SvNVX(dstr) = SvNVX(sstr);
4182 else if (sflags & SVp_NOK) {
4183 if (sflags & SVf_NOK)
4184 (void)SvNOK_only(dstr);
4186 (void)SvOK_off(dstr);
4189 SvNVX(dstr) = SvNVX(sstr);
4192 if (dtype == SVt_PVGV) {
4193 if (ckWARN(WARN_MISC))
4194 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4197 (void)SvOK_off(dstr);
4199 if (SvTAINTED(sstr))
4204 =for apidoc sv_setsv_mg
4206 Like C<sv_setsv>, but also handles 'set' magic.
4212 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4214 sv_setsv(dstr,sstr);
4218 #ifdef PERL_COPY_ON_WRITE
4220 Perl_sv_setsv_cow(pTHX_ SV *dstr, SV *sstr)
4222 STRLEN cur = SvCUR(sstr);
4223 STRLEN len = SvLEN(sstr);
4224 register char *new_pv;
4227 PerlIO_printf(Perl_debug_log, "Fast copy on write: %p -> %p\n",
4235 if (SvTHINKFIRST(dstr))
4236 sv_force_normal_flags(dstr, SV_COW_DROP_PV);
4237 else if (SvPVX(dstr))
4238 Safefree(SvPVX(dstr));
4242 (void)SvUPGRADE (dstr, SVt_PVIV);
4244 assert (SvPOK(sstr));
4245 assert (SvPOKp(sstr));
4246 assert (!SvIOK(sstr));
4247 assert (!SvIOKp(sstr));
4248 assert (!SvNOK(sstr));
4249 assert (!SvNOKp(sstr));
4251 if (SvIsCOW(sstr)) {
4253 if (SvLEN(sstr) == 0) {
4254 /* source is a COW shared hash key. */
4255 UV hash = SvUVX(sstr);
4256 DEBUG_C(PerlIO_printf(Perl_debug_log,
4257 "Fast copy on write: Sharing hash\n"));
4259 new_pv = sharepvn(SvPVX(sstr), (SvUTF8(sstr)?-cur:cur), hash);
4262 SV_COW_NEXT_SV_SET(dstr, SV_COW_NEXT_SV(sstr));
4264 assert ((SvFLAGS(sstr) & CAN_COW_MASK) == CAN_COW_FLAGS);
4265 (void)SvUPGRADE (sstr, SVt_PVIV);
4266 SvREADONLY_on(sstr);
4268 DEBUG_C(PerlIO_printf(Perl_debug_log,
4269 "Fast copy on write: Converting sstr to COW\n"));
4270 SV_COW_NEXT_SV_SET(dstr, sstr);
4272 SV_COW_NEXT_SV_SET(sstr, dstr);
4273 new_pv = SvPVX(sstr);
4276 SvPV_set(dstr, new_pv);
4277 SvFLAGS(dstr) = (SVt_PVIV|SVf_POK|SVp_POK|SVf_FAKE|SVf_READONLY);
4290 =for apidoc sv_setpvn
4292 Copies a string into an SV. The C<len> parameter indicates the number of
4293 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4299 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4301 register char *dptr;
4303 SV_CHECK_THINKFIRST_COW_DROP(sv);
4309 /* len is STRLEN which is unsigned, need to copy to signed */
4312 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4314 (void)SvUPGRADE(sv, SVt_PV);
4316 SvGROW(sv, len + 1);
4318 Move(ptr,dptr,len,char);
4321 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4326 =for apidoc sv_setpvn_mg
4328 Like C<sv_setpvn>, but also handles 'set' magic.
4334 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4336 sv_setpvn(sv,ptr,len);
4341 =for apidoc sv_setpv
4343 Copies a string into an SV. The string must be null-terminated. Does not
4344 handle 'set' magic. See C<sv_setpv_mg>.
4350 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4352 register STRLEN len;
4354 SV_CHECK_THINKFIRST_COW_DROP(sv);
4360 (void)SvUPGRADE(sv, SVt_PV);
4362 SvGROW(sv, len + 1);
4363 Move(ptr,SvPVX(sv),len+1,char);
4365 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4370 =for apidoc sv_setpv_mg
4372 Like C<sv_setpv>, but also handles 'set' magic.
4378 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4385 =for apidoc sv_usepvn
4387 Tells an SV to use C<ptr> to find its string value. Normally the string is
4388 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4389 The C<ptr> should point to memory that was allocated by C<malloc>. The
4390 string length, C<len>, must be supplied. This function will realloc the
4391 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4392 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4393 See C<sv_usepvn_mg>.
4399 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4401 SV_CHECK_THINKFIRST_COW_DROP(sv);
4402 (void)SvUPGRADE(sv, SVt_PV);
4407 (void)SvOOK_off(sv);
4408 if (SvPVX(sv) && SvLEN(sv))
4409 Safefree(SvPVX(sv));
4410 Renew(ptr, len+1, char);
4413 SvLEN_set(sv, len+1);
4415 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4420 =for apidoc sv_usepvn_mg
4422 Like C<sv_usepvn>, but also handles 'set' magic.
4428 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4430 sv_usepvn(sv,ptr,len);
4434 #ifdef PERL_COPY_ON_WRITE
4435 /* Need to do this *after* making the SV normal, as we need the buffer
4436 pointer to remain valid until after we've copied it. If we let go too early,
4437 another thread could invalidate it by unsharing last of the same hash key
4438 (which it can do by means other than releasing copy-on-write Svs)
4439 or by changing the other copy-on-write SVs in the loop. */
4441 S_sv_release_COW(pTHX_ register SV *sv, char *pvx, STRLEN cur, STRLEN len,
4442 U32 hash, SV *after)
4444 if (len) { /* this SV was SvIsCOW_normal(sv) */
4445 /* we need to find the SV pointing to us. */
4446 SV *current = SV_COW_NEXT_SV(after);
4448 if (current == sv) {
4449 /* The SV we point to points back to us (there were only two of us
4451 Hence other SV is no longer copy on write either. */
4453 SvREADONLY_off(after);
4455 /* We need to follow the pointers around the loop. */
4457 while ((next = SV_COW_NEXT_SV(current)) != sv) {
4460 /* don't loop forever if the structure is bust, and we have
4461 a pointer into a closed loop. */
4462 assert (current != after);
4463 assert (SvPVX(current) == pvx);
4465 /* Make the SV before us point to the SV after us. */
4466 SV_COW_NEXT_SV_SET(current, after);
4469 unsharepvn(pvx, SvUTF8(sv) ? -(I32)cur : cur, hash);
4474 Perl_sv_release_IVX(pTHX_ register SV *sv)
4477 sv_force_normal_flags(sv, 0);
4478 return SvOOK_off(sv);
4482 =for apidoc sv_force_normal_flags
4484 Undo various types of fakery on an SV: if the PV is a shared string, make
4485 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4486 an xpvmg; if we're a copy-on-write scalar, this is the on-write time when
4487 we do the copy, and is also used locally. If C<SV_COW_DROP_PV> is set
4488 then a copy-on-write scalar drops its PV buffer (if any) and becomes
4489 SvPOK_off rather than making a copy. (Used where this scalar is about to be
4490 set to some other value.) In addition, the C<flags> parameter gets passed to
4491 C<sv_unref_flags()> when unrefing. C<sv_force_normal> calls this function
4492 with flags set to 0.
4498 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4500 #ifdef PERL_COPY_ON_WRITE
4501 if (SvREADONLY(sv)) {
4502 /* At this point I believe I should acquire a global SV mutex. */
4504 char *pvx = SvPVX(sv);
4505 STRLEN len = SvLEN(sv);
4506 STRLEN cur = SvCUR(sv);
4507 U32 hash = SvUVX(sv);
4508 SV *next = SV_COW_NEXT_SV(sv); /* next COW sv in the loop. */
4510 PerlIO_printf(Perl_debug_log,
4511 "Copy on write: Force normal %ld\n",
4517 /* This SV doesn't own the buffer, so need to New() a new one: */
4520 if (flags & SV_COW_DROP_PV) {
4521 /* OK, so we don't need to copy our buffer. */
4524 SvGROW(sv, cur + 1);
4525 Move(pvx,SvPVX(sv),cur,char);
4529 sv_release_COW(sv, pvx, cur, len, hash, next);
4534 else if (IN_PERL_RUNTIME)
4535 Perl_croak(aTHX_ PL_no_modify);
4536 /* At this point I believe that I can drop the global SV mutex. */
4539 if (SvREADONLY(sv)) {
4541 char *pvx = SvPVX(sv);
4542 int is_utf8 = SvUTF8(sv);
4543 STRLEN len = SvCUR(sv);
4544 U32 hash = SvUVX(sv);
4549 SvGROW(sv, len + 1);
4550 Move(pvx,SvPVX(sv),len,char);
4552 unsharepvn(pvx, is_utf8 ? -(I32)len : len, hash);
4554 else if (IN_PERL_RUNTIME)
4555 Perl_croak(aTHX_ PL_no_modify);
4559 sv_unref_flags(sv, flags);
4560 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4565 =for apidoc sv_force_normal
4567 Undo various types of fakery on an SV: if the PV is a shared string, make
4568 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4569 an xpvmg. See also C<sv_force_normal_flags>.
4575 Perl_sv_force_normal(pTHX_ register SV *sv)
4577 sv_force_normal_flags(sv, 0);
4583 Efficient removal of characters from the beginning of the string buffer.
4584 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4585 the string buffer. The C<ptr> becomes the first character of the adjusted
4586 string. Uses the "OOK hack".
4587 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4588 refer to the same chunk of data.
4594 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4596 register STRLEN delta;
4597 if (!ptr || !SvPOKp(sv))
4599 delta = ptr - SvPVX(sv);
4600 SV_CHECK_THINKFIRST(sv);
4601 if (SvTYPE(sv) < SVt_PVIV)
4602 sv_upgrade(sv,SVt_PVIV);
4605 if (!SvLEN(sv)) { /* make copy of shared string */
4606 char *pvx = SvPVX(sv);
4607 STRLEN len = SvCUR(sv);
4608 SvGROW(sv, len + 1);
4609 Move(pvx,SvPVX(sv),len,char);
4613 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4614 and we do that anyway inside the SvNIOK_off
4616 SvFLAGS(sv) |= SVf_OOK;
4625 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4626 * this function provided for binary compatibility only
4630 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4632 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4636 =for apidoc sv_catpvn
4638 Concatenates the string onto the end of the string which is in the SV. The
4639 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4640 status set, then the bytes appended should be valid UTF-8.
4641 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4643 =for apidoc sv_catpvn_flags
4645 Concatenates the string onto the end of the string which is in the SV. The
4646 C<len> indicates number of bytes to copy. If the SV has the UTF-8
4647 status set, then the bytes appended should be valid UTF-8.
4648 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4649 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4650 in terms of this function.
4656 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4661 dstr = SvPV_force_flags(dsv, dlen, flags);
4662 SvGROW(dsv, dlen + slen + 1);
4665 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4668 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4673 =for apidoc sv_catpvn_mg
4675 Like C<sv_catpvn>, but also handles 'set' magic.
4681 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4683 sv_catpvn(sv,ptr,len);
4687 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4688 * this function provided for binary compatibility only
4692 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4694 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4698 =for apidoc sv_catsv
4700 Concatenates the string from SV C<ssv> onto the end of the string in
4701 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4702 not 'set' magic. See C<sv_catsv_mg>.
4704 =for apidoc sv_catsv_flags
4706 Concatenates the string from SV C<ssv> onto the end of the string in
4707 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4708 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4709 and C<sv_catsv_nomg> are implemented in terms of this function.
4714 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4720 if ((spv = SvPV(ssv, slen))) {
4721 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4722 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4723 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4724 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4725 dsv->sv_flags doesn't have that bit set.
4726 Andy Dougherty 12 Oct 2001
4728 I32 sutf8 = DO_UTF8(ssv);
4731 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4733 dutf8 = DO_UTF8(dsv);
4735 if (dutf8 != sutf8) {
4737 /* Not modifying source SV, so taking a temporary copy. */
4738 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4740 sv_utf8_upgrade(csv);
4741 spv = SvPV(csv, slen);
4744 sv_utf8_upgrade_nomg(dsv);
4746 sv_catpvn_nomg(dsv, spv, slen);
4751 =for apidoc sv_catsv_mg
4753 Like C<sv_catsv>, but also handles 'set' magic.
4759 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4766 =for apidoc sv_catpv
4768 Concatenates the string onto the end of the string which is in the SV.
4769 If the SV has the UTF-8 status set, then the bytes appended should be
4770 valid UTF-8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4775 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4777 register STRLEN len;
4783 junk = SvPV_force(sv, tlen);
4785 SvGROW(sv, tlen + len + 1);
4788 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4790 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4795 =for apidoc sv_catpv_mg
4797 Like C<sv_catpv>, but also handles 'set' magic.
4803 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4812 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4813 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4820 Perl_newSV(pTHX_ STRLEN len)
4826 sv_upgrade(sv, SVt_PV);
4827 SvGROW(sv, len + 1);
4832 =for apidoc sv_magicext
4834 Adds magic to an SV, upgrading it if necessary. Applies the
4835 supplied vtable and returns pointer to the magic added.
4837 Note that sv_magicext will allow things that sv_magic will not.
4838 In particular you can add magic to SvREADONLY SVs and and more than
4839 one instance of the same 'how'
4841 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4842 if C<namelen> is zero then C<name> is stored as-is and - as another special
4843 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4844 an C<SV*> and has its REFCNT incremented
4846 (This is now used as a subroutine by sv_magic.)
4851 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4852 const char* name, I32 namlen)
4856 if (SvTYPE(sv) < SVt_PVMG) {
4857 (void)SvUPGRADE(sv, SVt_PVMG);
4859 Newz(702,mg, 1, MAGIC);
4860 mg->mg_moremagic = SvMAGIC(sv);
4863 /* Some magic sontains a reference loop, where the sv and object refer to
4864 each other. To prevent a reference loop that would prevent such
4865 objects being freed, we look for such loops and if we find one we
4866 avoid incrementing the object refcount.
4868 Note we cannot do this to avoid self-tie loops as intervening RV must
4869 have its REFCNT incremented to keep it in existence.
4872 if (!obj || obj == sv ||
4873 how == PERL_MAGIC_arylen ||
4874 how == PERL_MAGIC_qr ||
4875 (SvTYPE(obj) == SVt_PVGV &&
4876 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4877 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4878 GvFORM(obj) == (CV*)sv)))
4883 mg->mg_obj = SvREFCNT_inc(obj);
4884 mg->mg_flags |= MGf_REFCOUNTED;
4887 /* Normal self-ties simply pass a null object, and instead of
4888 using mg_obj directly, use the SvTIED_obj macro to produce a
4889 new RV as needed. For glob "self-ties", we are tieing the PVIO
4890 with an RV obj pointing to the glob containing the PVIO. In
4891 this case, to avoid a reference loop, we need to weaken the
4895 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4896 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4902 mg->mg_len = namlen;
4905 mg->mg_ptr = savepvn(name, namlen);
4906 else if (namlen == HEf_SVKEY)
4907 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4909 mg->mg_ptr = (char *) name;
4911 mg->mg_virtual = vtable;
4915 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4920 =for apidoc sv_magic
4922 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4923 then adds a new magic item of type C<how> to the head of the magic list.
4929 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4934 #ifdef PERL_COPY_ON_WRITE
4936 sv_force_normal_flags(sv, 0);
4938 if (SvREADONLY(sv)) {
4940 && how != PERL_MAGIC_regex_global
4941 && how != PERL_MAGIC_bm
4942 && how != PERL_MAGIC_fm
4943 && how != PERL_MAGIC_sv
4944 && how != PERL_MAGIC_backref
4947 Perl_croak(aTHX_ PL_no_modify);
4950 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4951 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4952 /* sv_magic() refuses to add a magic of the same 'how' as an
4955 if (how == PERL_MAGIC_taint)
4963 vtable = &PL_vtbl_sv;
4965 case PERL_MAGIC_overload:
4966 vtable = &PL_vtbl_amagic;
4968 case PERL_MAGIC_overload_elem:
4969 vtable = &PL_vtbl_amagicelem;
4971 case PERL_MAGIC_overload_table:
4972 vtable = &PL_vtbl_ovrld;
4975 vtable = &PL_vtbl_bm;
4977 case PERL_MAGIC_regdata:
4978 vtable = &PL_vtbl_regdata;
4980 case PERL_MAGIC_regdatum:
4981 vtable = &PL_vtbl_regdatum;
4983 case PERL_MAGIC_env:
4984 vtable = &PL_vtbl_env;
4987 vtable = &PL_vtbl_fm;
4989 case PERL_MAGIC_envelem:
4990 vtable = &PL_vtbl_envelem;
4992 case PERL_MAGIC_regex_global:
4993 vtable = &PL_vtbl_mglob;
4995 case PERL_MAGIC_isa:
4996 vtable = &PL_vtbl_isa;
4998 case PERL_MAGIC_isaelem:
4999 vtable = &PL_vtbl_isaelem;
5001 case PERL_MAGIC_nkeys:
5002 vtable = &PL_vtbl_nkeys;
5004 case PERL_MAGIC_dbfile:
5007 case PERL_MAGIC_dbline:
5008 vtable = &PL_vtbl_dbline;
5010 #ifdef USE_LOCALE_COLLATE
5011 case PERL_MAGIC_collxfrm:
5012 vtable = &PL_vtbl_collxfrm;
5014 #endif /* USE_LOCALE_COLLATE */
5015 case PERL_MAGIC_tied:
5016 vtable = &PL_vtbl_pack;
5018 case PERL_MAGIC_tiedelem:
5019 case PERL_MAGIC_tiedscalar:
5020 vtable = &PL_vtbl_packelem;
5023 vtable = &PL_vtbl_regexp;
5025 case PERL_MAGIC_sig:
5026 vtable = &PL_vtbl_sig;
5028 case PERL_MAGIC_sigelem:
5029 vtable = &PL_vtbl_sigelem;
5031 case PERL_MAGIC_taint:
5032 vtable = &PL_vtbl_taint;
5034 case PERL_MAGIC_uvar:
5035 vtable = &PL_vtbl_uvar;
5037 case PERL_MAGIC_vec:
5038 vtable = &PL_vtbl_vec;
5040 case PERL_MAGIC_vstring:
5043 case PERL_MAGIC_utf8:
5044 vtable = &PL_vtbl_utf8;
5046 case PERL_MAGIC_substr:
5047 vtable = &PL_vtbl_substr;
5049 case PERL_MAGIC_defelem:
5050 vtable = &PL_vtbl_defelem;
5052 case PERL_MAGIC_glob:
5053 vtable = &PL_vtbl_glob;
5055 case PERL_MAGIC_arylen:
5056 vtable = &PL_vtbl_arylen;
5058 case PERL_MAGIC_pos:
5059 vtable = &PL_vtbl_pos;
5061 case PERL_MAGIC_backref:
5062 vtable = &PL_vtbl_backref;
5064 case PERL_MAGIC_ext:
5065 /* Reserved for use by extensions not perl internals. */
5066 /* Useful for attaching extension internal data to perl vars. */
5067 /* Note that multiple extensions may clash if magical scalars */
5068 /* etc holding private data from one are passed to another. */
5071 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
5074 /* Rest of work is done else where */
5075 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
5078 case PERL_MAGIC_taint:
5081 case PERL_MAGIC_ext:
5082 case PERL_MAGIC_dbfile:
5089 =for apidoc sv_unmagic
5091 Removes all magic of type C<type> from an SV.
5097 Perl_sv_unmagic(pTHX_ SV *sv, int type)
5101 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
5104 for (mg = *mgp; mg; mg = *mgp) {
5105 if (mg->mg_type == type) {
5106 MGVTBL* vtbl = mg->mg_virtual;
5107 *mgp = mg->mg_moremagic;
5108 if (vtbl && vtbl->svt_free)
5109 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
5110 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
5112 Safefree(mg->mg_ptr);
5113 else if (mg->mg_len == HEf_SVKEY)
5114 SvREFCNT_dec((SV*)mg->mg_ptr);
5115 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
5116 Safefree(mg->mg_ptr);
5118 if (mg->mg_flags & MGf_REFCOUNTED)
5119 SvREFCNT_dec(mg->mg_obj);
5123 mgp = &mg->mg_moremagic;
5127 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
5134 =for apidoc sv_rvweaken
5136 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
5137 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
5138 push a back-reference to this RV onto the array of backreferences
5139 associated with that magic.
5145 Perl_sv_rvweaken(pTHX_ SV *sv)
5148 if (!SvOK(sv)) /* let undefs pass */
5151 Perl_croak(aTHX_ "Can't weaken a nonreference");
5152 else if (SvWEAKREF(sv)) {
5153 if (ckWARN(WARN_MISC))
5154 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
5158 sv_add_backref(tsv, sv);
5164 /* Give tsv backref magic if it hasn't already got it, then push a
5165 * back-reference to sv onto the array associated with the backref magic.
5169 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
5173 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
5174 av = (AV*)mg->mg_obj;
5177 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
5178 /* av now has a refcnt of 2, which avoids it getting freed
5179 * before us during global cleanup. The extra ref is removed
5180 * by magic_killbackrefs() when tsv is being freed */
5182 if (AvFILLp(av) >= AvMAX(av)) {
5184 SV **svp = AvARRAY(av);
5185 for (i = AvFILLp(av); i >= 0; i--)
5187 svp[i] = sv; /* reuse the slot */
5190 av_extend(av, AvFILLp(av)+1);
5192 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
5195 /* delete a back-reference to ourselves from the backref magic associated
5196 * with the SV we point to.
5200 S_sv_del_backref(pTHX_ SV *sv)
5207 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
5208 Perl_croak(aTHX_ "panic: del_backref");
5209 av = (AV *)mg->mg_obj;
5211 for (i = AvFILLp(av); i >= 0; i--)
5212 if (svp[i] == sv) svp[i] = Nullsv;
5216 =for apidoc sv_insert
5218 Inserts a string at the specified offset/length within the SV. Similar to
5219 the Perl substr() function.
5225 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
5229 register char *midend;
5230 register char *bigend;
5236 Perl_croak(aTHX_ "Can't modify non-existent substring");
5237 SvPV_force(bigstr, curlen);
5238 (void)SvPOK_only_UTF8(bigstr);
5239 if (offset + len > curlen) {
5240 SvGROW(bigstr, offset+len+1);
5241 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
5242 SvCUR_set(bigstr, offset+len);
5246 i = littlelen - len;
5247 if (i > 0) { /* string might grow */
5248 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
5249 mid = big + offset + len;
5250 midend = bigend = big + SvCUR(bigstr);
5253 while (midend > mid) /* shove everything down */
5254 *--bigend = *--midend;
5255 Move(little,big+offset,littlelen,char);
5261 Move(little,SvPVX(bigstr)+offset,len,char);
5266 big = SvPVX(bigstr);
5269 bigend = big + SvCUR(bigstr);
5271 if (midend > bigend)
5272 Perl_croak(aTHX_ "panic: sv_insert");
5274 if (mid - big > bigend - midend) { /* faster to shorten from end */
5276 Move(little, mid, littlelen,char);
5279 i = bigend - midend;
5281 Move(midend, mid, i,char);
5285 SvCUR_set(bigstr, mid - big);
5288 else if ((i = mid - big)) { /* faster from front */
5289 midend -= littlelen;
5291 sv_chop(bigstr,midend-i);
5296 Move(little, mid, littlelen,char);
5298 else if (littlelen) {
5299 midend -= littlelen;
5300 sv_chop(bigstr,midend);
5301 Move(little,midend,littlelen,char);
5304 sv_chop(bigstr,midend);
5310 =for apidoc sv_replace
5312 Make the first argument a copy of the second, then delete the original.
5313 The target SV physically takes over ownership of the body of the source SV
5314 and inherits its flags; however, the target keeps any magic it owns,
5315 and any magic in the source is discarded.
5316 Note that this is a rather specialist SV copying operation; most of the
5317 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5323 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5325 U32 refcnt = SvREFCNT(sv);
5326 SV_CHECK_THINKFIRST_COW_DROP(sv);
5327 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5328 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5329 if (SvMAGICAL(sv)) {
5333 sv_upgrade(nsv, SVt_PVMG);
5334 SvMAGIC(nsv) = SvMAGIC(sv);
5335 SvFLAGS(nsv) |= SvMAGICAL(sv);
5341 assert(!SvREFCNT(sv));
5342 StructCopy(nsv,sv,SV);
5343 #ifdef PERL_COPY_ON_WRITE
5344 if (SvIsCOW_normal(nsv)) {
5345 /* We need to follow the pointers around the loop to make the
5346 previous SV point to sv, rather than nsv. */
5349 while ((next = SV_COW_NEXT_SV(current)) != nsv) {
5352 assert(SvPVX(current) == SvPVX(nsv));
5354 /* Make the SV before us point to the SV after us. */
5356 PerlIO_printf(Perl_debug_log, "previous is\n");
5358 PerlIO_printf(Perl_debug_log,
5359 "move it from 0x%"UVxf" to 0x%"UVxf"\n",
5360 (UV) SV_COW_NEXT_SV(current), (UV) sv);
5362 SV_COW_NEXT_SV_SET(current, sv);
5365 SvREFCNT(sv) = refcnt;
5366 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5372 =for apidoc sv_clear
5374 Clear an SV: call any destructors, free up any memory used by the body,
5375 and free the body itself. The SV's head is I<not> freed, although
5376 its type is set to all 1's so that it won't inadvertently be assumed
5377 to be live during global destruction etc.
5378 This function should only be called when REFCNT is zero. Most of the time
5379 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5386 Perl_sv_clear(pTHX_ register SV *sv)
5390 assert(SvREFCNT(sv) == 0);
5393 if (PL_defstash) { /* Still have a symbol table? */
5400 stash = SvSTASH(sv);
5401 destructor = StashHANDLER(stash,DESTROY);
5403 SV* tmpref = newRV(sv);
5404 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5406 PUSHSTACKi(PERLSI_DESTROY);
5411 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5417 if(SvREFCNT(tmpref) < 2) {
5418 /* tmpref is not kept alive! */
5423 SvREFCNT_dec(tmpref);
5425 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5429 if (PL_in_clean_objs)
5430 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5432 /* DESTROY gave object new lease on life */
5438 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5439 SvOBJECT_off(sv); /* Curse the object. */
5440 if (SvTYPE(sv) != SVt_PVIO)
5441 --PL_sv_objcount; /* XXX Might want something more general */
5444 if (SvTYPE(sv) >= SVt_PVMG) {
5447 if (SvFLAGS(sv) & SVpad_TYPED)
5448 SvREFCNT_dec(SvSTASH(sv));
5451 switch (SvTYPE(sv)) {
5454 IoIFP(sv) != PerlIO_stdin() &&
5455 IoIFP(sv) != PerlIO_stdout() &&
5456 IoIFP(sv) != PerlIO_stderr())
5458 io_close((IO*)sv, FALSE);
5460 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5461 PerlDir_close(IoDIRP(sv));
5462 IoDIRP(sv) = (DIR*)NULL;
5463 Safefree(IoTOP_NAME(sv));
5464 Safefree(IoFMT_NAME(sv));
5465 Safefree(IoBOTTOM_NAME(sv));
5480 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5481 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5482 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5483 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5485 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5486 SvREFCNT_dec(LvTARG(sv));
5490 Safefree(GvNAME(sv));
5491 /* cannot decrease stash refcount yet, as we might recursively delete
5492 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5493 of stash until current sv is completely gone.
5494 -- JohnPC, 27 Mar 1998 */
5495 stash = GvSTASH(sv);
5501 (void)SvOOK_off(sv);
5509 SvREFCNT_dec(SvRV(sv));
5511 #ifdef PERL_COPY_ON_WRITE
5512 else if (SvPVX(sv)) {
5514 /* I believe I need to grab the global SV mutex here and
5515 then recheck the COW status. */
5517 PerlIO_printf(Perl_debug_log, "Copy on write: clear\n");
5520 sv_release_COW(sv, SvPVX(sv), SvCUR(sv), SvLEN(sv),
5521 SvUVX(sv), SV_COW_NEXT_SV(sv));
5522 /* And drop it here. */
5524 } else if (SvLEN(sv)) {
5525 Safefree(SvPVX(sv));
5529 else if (SvPVX(sv) && SvLEN(sv))
5530 Safefree(SvPVX(sv));
5531 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5532 unsharepvn(SvPVX(sv),
5533 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5547 switch (SvTYPE(sv)) {
5563 del_XPVIV(SvANY(sv));
5566 del_XPVNV(SvANY(sv));
5569 del_XPVMG(SvANY(sv));
5572 del_XPVLV(SvANY(sv));
5575 del_XPVAV(SvANY(sv));
5578 del_XPVHV(SvANY(sv));
5581 del_XPVCV(SvANY(sv));
5584 del_XPVGV(SvANY(sv));
5585 /* code duplication for increased performance. */
5586 SvFLAGS(sv) &= SVf_BREAK;
5587 SvFLAGS(sv) |= SVTYPEMASK;
5588 /* decrease refcount of the stash that owns this GV, if any */
5590 SvREFCNT_dec(stash);
5591 return; /* not break, SvFLAGS reset already happened */
5593 del_XPVBM(SvANY(sv));
5596 del_XPVFM(SvANY(sv));
5599 del_XPVIO(SvANY(sv));
5602 SvFLAGS(sv) &= SVf_BREAK;
5603 SvFLAGS(sv) |= SVTYPEMASK;
5607 =for apidoc sv_newref
5609 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5616 Perl_sv_newref(pTHX_ SV *sv)
5626 Decrement an SV's reference count, and if it drops to zero, call
5627 C<sv_clear> to invoke destructors and free up any memory used by
5628 the body; finally, deallocate the SV's head itself.
5629 Normally called via a wrapper macro C<SvREFCNT_dec>.
5635 Perl_sv_free(pTHX_ SV *sv)
5639 if (SvREFCNT(sv) == 0) {
5640 if (SvFLAGS(sv) & SVf_BREAK)
5641 /* this SV's refcnt has been artificially decremented to
5642 * trigger cleanup */
5644 if (PL_in_clean_all) /* All is fair */
5646 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5647 /* make sure SvREFCNT(sv)==0 happens very seldom */
5648 SvREFCNT(sv) = (~(U32)0)/2;
5651 if (ckWARN_d(WARN_INTERNAL))
5652 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
5653 "Attempt to free unreferenced scalar: SV 0x%"UVxf,
5657 if (--(SvREFCNT(sv)) > 0)
5659 Perl_sv_free2(aTHX_ sv);
5663 Perl_sv_free2(pTHX_ SV *sv)
5667 if (ckWARN_d(WARN_DEBUGGING))
5668 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5669 "Attempt to free temp prematurely: SV 0x%"UVxf,
5674 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5675 /* make sure SvREFCNT(sv)==0 happens very seldom */
5676 SvREFCNT(sv) = (~(U32)0)/2;
5687 Returns the length of the string in the SV. Handles magic and type
5688 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5694 Perl_sv_len(pTHX_ register SV *sv)
5702 len = mg_length(sv);
5704 (void)SvPV(sv, len);
5709 =for apidoc sv_len_utf8
5711 Returns the number of characters in the string in an SV, counting wide
5712 UTF-8 bytes as a single character. Handles magic and type coercion.
5718 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5719 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5720 * (Note that the mg_len is not the length of the mg_ptr field.)
5725 Perl_sv_len_utf8(pTHX_ register SV *sv)
5731 return mg_length(sv);
5735 U8 *s = (U8*)SvPV(sv, len);
5736 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5738 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0)) {
5740 #ifdef PERL_UTF8_CACHE_ASSERT
5741 assert(ulen == Perl_utf8_length(aTHX_ s, s + len));
5745 ulen = Perl_utf8_length(aTHX_ s, s + len);
5746 if (!mg && !SvREADONLY(sv)) {
5747 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5748 mg = mg_find(sv, PERL_MAGIC_utf8);
5758 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5759 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5760 * between UTF-8 and byte offsets. There are two (substr offset and substr
5761 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5762 * and byte offset) cache positions.
5764 * The mg_len field is used by sv_len_utf8(), see its comments.
5765 * Note that the mg_len is not the length of the mg_ptr field.
5769 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
5773 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5775 *mgp = sv_magicext(sv, 0, PERL_MAGIC_utf8, &PL_vtbl_utf8, 0, 0);
5779 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5781 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5782 (*mgp)->mg_ptr = (char *) *cachep;
5786 (*cachep)[i] = *offsetp;
5787 (*cachep)[i+1] = s - start;
5795 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5796 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5797 * between UTF-8 and byte offsets. See also the comments of
5798 * S_utf8_mg_pos_init().
5802 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
5806 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5808 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5809 if (*mgp && (*mgp)->mg_ptr) {
5810 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5811 ASSERT_UTF8_CACHE(*cachep);
5812 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5814 else { /* We will skip to the right spot. */
5819 /* The assumption is that going backward is half
5820 * the speed of going forward (that's where the
5821 * 2 * backw in the below comes from). (The real
5822 * figure of course depends on the UTF-8 data.) */
5824 if ((*cachep)[i] > (STRLEN)uoff) {
5826 backw = (*cachep)[i] - (STRLEN)uoff;
5828 if (forw < 2 * backw)
5831 p = start + (*cachep)[i+1];
5833 /* Try this only for the substr offset (i == 0),
5834 * not for the substr length (i == 2). */
5835 else if (i == 0) { /* (*cachep)[i] < uoff */
5836 STRLEN ulen = sv_len_utf8(sv);
5838 if ((STRLEN)uoff < ulen) {
5839 forw = (STRLEN)uoff - (*cachep)[i];
5840 backw = ulen - (STRLEN)uoff;
5842 if (forw < 2 * backw)
5843 p = start + (*cachep)[i+1];
5848 /* If the string is not long enough for uoff,
5849 * we could extend it, but not at this low a level. */
5853 if (forw < 2 * backw) {
5860 while (UTF8_IS_CONTINUATION(*p))
5865 /* Update the cache. */
5866 (*cachep)[i] = (STRLEN)uoff;
5867 (*cachep)[i+1] = p - start;
5869 /* Drop the stale "length" cache */
5878 if (found) { /* Setup the return values. */
5879 *offsetp = (*cachep)[i+1];
5880 *sp = start + *offsetp;
5883 *offsetp = send - start;
5885 else if (*sp < start) {
5891 #ifdef PERL_UTF8_CACHE_ASSERT
5896 while (n-- && s < send)
5900 assert(*offsetp == s - start);
5901 assert((*cachep)[0] == (STRLEN)uoff);
5902 assert((*cachep)[1] == *offsetp);
5904 ASSERT_UTF8_CACHE(*cachep);
5913 =for apidoc sv_pos_u2b
5915 Converts the value pointed to by offsetp from a count of UTF-8 chars from
5916 the start of the string, to a count of the equivalent number of bytes; if
5917 lenp is non-zero, it does the same to lenp, but this time starting from
5918 the offset, rather than from the start of the string. Handles magic and
5925 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5926 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5927 * byte offsets. See also the comments of S_utf8_mg_pos().
5932 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5943 start = s = (U8*)SvPV(sv, len);
5945 I32 uoffset = *offsetp;
5950 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5952 if (!found && uoffset > 0) {
5953 while (s < send && uoffset--)
5957 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
5959 *offsetp = s - start;
5964 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp + *offsetp, &s, start, send)) {
5968 if (!found && *lenp > 0) {
5971 while (s < send && ulen--)
5975 if (utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start))
5976 cache[2] += *offsetp;
5980 ASSERT_UTF8_CACHE(cache);
5992 =for apidoc sv_pos_b2u
5994 Converts the value pointed to by offsetp from a count of bytes from the
5995 start of the string, to a count of the equivalent number of UTF-8 chars.
5996 Handles magic and type coercion.
6002 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
6003 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
6004 * byte offsets. See also the comments of S_utf8_mg_pos().
6009 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
6017 s = (U8*)SvPV(sv, len);
6018 if ((I32)len < *offsetp)
6019 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
6021 U8* send = s + *offsetp;
6023 STRLEN *cache = NULL;
6027 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
6028 mg = mg_find(sv, PERL_MAGIC_utf8);
6029 if (mg && mg->mg_ptr) {
6030 cache = (STRLEN *) mg->mg_ptr;
6031 if (cache[1] == (STRLEN)*offsetp) {
6032 /* An exact match. */
6033 *offsetp = cache[0];
6037 else if (cache[1] < (STRLEN)*offsetp) {
6038 /* We already know part of the way. */
6041 /* Let the below loop do the rest. */
6043 else { /* cache[1] > *offsetp */
6044 /* We already know all of the way, now we may
6045 * be able to walk back. The same assumption
6046 * is made as in S_utf8_mg_pos(), namely that
6047 * walking backward is twice slower than
6048 * walking forward. */
6049 STRLEN forw = *offsetp;
6050 STRLEN backw = cache[1] - *offsetp;
6052 if (!(forw < 2 * backw)) {
6053 U8 *p = s + cache[1];
6060 while (UTF8_IS_CONTINUATION(*p)) {
6068 *offsetp = cache[0];
6073 ASSERT_UTF8_CACHE(cache);
6079 /* Call utf8n_to_uvchr() to validate the sequence
6080 * (unless a simple non-UTF character) */
6081 if (!UTF8_IS_INVARIANT(*s))
6082 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
6091 if (!SvREADONLY(sv)) {
6093 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
6094 mg = mg_find(sv, PERL_MAGIC_utf8);
6099 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
6100 mg->mg_ptr = (char *) cache;
6105 cache[1] = *offsetp;
6116 Returns a boolean indicating whether the strings in the two SVs are
6117 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6118 coerce its args to strings if necessary.
6124 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
6132 SV* svrecode = Nullsv;
6139 pv1 = SvPV(sv1, cur1);
6146 pv2 = SvPV(sv2, cur2);
6148 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6149 /* Differing utf8ness.
6150 * Do not UTF8size the comparands as a side-effect. */
6153 svrecode = newSVpvn(pv2, cur2);
6154 sv_recode_to_utf8(svrecode, PL_encoding);
6155 pv2 = SvPV(svrecode, cur2);
6158 svrecode = newSVpvn(pv1, cur1);
6159 sv_recode_to_utf8(svrecode, PL_encoding);
6160 pv1 = SvPV(svrecode, cur1);
6162 /* Now both are in UTF-8. */
6167 bool is_utf8 = TRUE;
6170 /* sv1 is the UTF-8 one,
6171 * if is equal it must be downgrade-able */
6172 char *pv = (char*)bytes_from_utf8((U8*)pv1,
6178 /* sv2 is the UTF-8 one,
6179 * if is equal it must be downgrade-able */
6180 char *pv = (char *)bytes_from_utf8((U8*)pv2,
6186 /* Downgrade not possible - cannot be eq */
6193 eq = (pv1 == pv2) || memEQ(pv1, pv2, cur1);
6196 SvREFCNT_dec(svrecode);
6207 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
6208 string in C<sv1> is less than, equal to, or greater than the string in
6209 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
6210 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
6216 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
6219 char *pv1, *pv2, *tpv = Nullch;
6221 SV *svrecode = Nullsv;
6228 pv1 = SvPV(sv1, cur1);
6235 pv2 = SvPV(sv2, cur2);
6237 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
6238 /* Differing utf8ness.
6239 * Do not UTF8size the comparands as a side-effect. */
6242 svrecode = newSVpvn(pv2, cur2);
6243 sv_recode_to_utf8(svrecode, PL_encoding);
6244 pv2 = SvPV(svrecode, cur2);
6247 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
6252 svrecode = newSVpvn(pv1, cur1);
6253 sv_recode_to_utf8(svrecode, PL_encoding);
6254 pv1 = SvPV(svrecode, cur1);
6257 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
6263 cmp = cur2 ? -1 : 0;
6267 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
6270 cmp = retval < 0 ? -1 : 1;
6271 } else if (cur1 == cur2) {
6274 cmp = cur1 < cur2 ? -1 : 1;
6279 SvREFCNT_dec(svrecode);
6288 =for apidoc sv_cmp_locale
6290 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
6291 'use bytes' aware, handles get magic, and will coerce its args to strings
6292 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
6298 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
6300 #ifdef USE_LOCALE_COLLATE
6306 if (PL_collation_standard)
6310 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
6312 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
6314 if (!pv1 || !len1) {
6325 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
6328 return retval < 0 ? -1 : 1;
6331 * When the result of collation is equality, that doesn't mean
6332 * that there are no differences -- some locales exclude some
6333 * characters from consideration. So to avoid false equalities,
6334 * we use the raw string as a tiebreaker.
6340 #endif /* USE_LOCALE_COLLATE */
6342 return sv_cmp(sv1, sv2);
6346 #ifdef USE_LOCALE_COLLATE
6349 =for apidoc sv_collxfrm
6351 Add Collate Transform magic to an SV if it doesn't already have it.
6353 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
6354 scalar data of the variable, but transformed to such a format that a normal
6355 memory comparison can be used to compare the data according to the locale
6362 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
6366 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
6367 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
6372 Safefree(mg->mg_ptr);
6374 if ((xf = mem_collxfrm(s, len, &xlen))) {
6375 if (SvREADONLY(sv)) {
6378 return xf + sizeof(PL_collation_ix);
6381 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
6382 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6395 if (mg && mg->mg_ptr) {
6397 return mg->mg_ptr + sizeof(PL_collation_ix);
6405 #endif /* USE_LOCALE_COLLATE */
6410 Get a line from the filehandle and store it into the SV, optionally
6411 appending to the currently-stored string.
6417 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6421 register STDCHAR rslast;
6422 register STDCHAR *bp;
6428 if (SvTHINKFIRST(sv))
6429 sv_force_normal_flags(sv, append ? 0 : SV_COW_DROP_PV);
6430 /* XXX. If you make this PVIV, then copy on write can copy scalars read
6432 However, perlbench says it's slower, because the existing swipe code
6433 is faster than copy on write.
6434 Swings and roundabouts. */
6435 (void)SvUPGRADE(sv, SVt_PV);
6440 if (PerlIO_isutf8(fp)) {
6442 sv_utf8_upgrade_nomg(sv);
6443 sv_pos_u2b(sv,&append,0);
6445 } else if (SvUTF8(sv)) {
6446 SV *tsv = NEWSV(0,0);
6447 sv_gets(tsv, fp, 0);
6448 sv_utf8_upgrade_nomg(tsv);
6449 SvCUR_set(sv,append);
6452 goto return_string_or_null;
6457 if (PerlIO_isutf8(fp))
6460 if (IN_PERL_COMPILETIME) {
6461 /* we always read code in line mode */
6465 else if (RsSNARF(PL_rs)) {
6466 /* If it is a regular disk file use size from stat() as estimate
6467 of amount we are going to read - may result in malloc-ing
6468 more memory than we realy need if layers bellow reduce
6469 size we read (e.g. CRLF or a gzip layer)
6472 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6473 Off_t offset = PerlIO_tell(fp);
6474 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6475 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6481 else if (RsRECORD(PL_rs)) {
6485 /* Grab the size of the record we're getting */
6486 recsize = SvIV(SvRV(PL_rs));
6487 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6490 /* VMS wants read instead of fread, because fread doesn't respect */
6491 /* RMS record boundaries. This is not necessarily a good thing to be */
6492 /* doing, but we've got no other real choice - except avoid stdio
6493 as implementation - perhaps write a :vms layer ?
6495 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6497 bytesread = PerlIO_read(fp, buffer, recsize);
6501 SvCUR_set(sv, bytesread += append);
6502 buffer[bytesread] = '\0';
6503 goto return_string_or_null;
6505 else if (RsPARA(PL_rs)) {
6511 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6512 if (PerlIO_isutf8(fp)) {
6513 rsptr = SvPVutf8(PL_rs, rslen);
6516 if (SvUTF8(PL_rs)) {
6517 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6518 Perl_croak(aTHX_ "Wide character in $/");
6521 rsptr = SvPV(PL_rs, rslen);
6525 rslast = rslen ? rsptr[rslen - 1] : '\0';
6527 if (rspara) { /* have to do this both before and after */
6528 do { /* to make sure file boundaries work right */
6531 i = PerlIO_getc(fp);
6535 PerlIO_ungetc(fp,i);
6541 /* See if we know enough about I/O mechanism to cheat it ! */
6543 /* This used to be #ifdef test - it is made run-time test for ease
6544 of abstracting out stdio interface. One call should be cheap
6545 enough here - and may even be a macro allowing compile
6549 if (PerlIO_fast_gets(fp)) {
6552 * We're going to steal some values from the stdio struct
6553 * and put EVERYTHING in the innermost loop into registers.
6555 register STDCHAR *ptr;
6559 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6560 /* An ungetc()d char is handled separately from the regular
6561 * buffer, so we getc() it back out and stuff it in the buffer.
6563 i = PerlIO_getc(fp);
6564 if (i == EOF) return 0;
6565 *(--((*fp)->_ptr)) = (unsigned char) i;
6569 /* Here is some breathtakingly efficient cheating */
6571 cnt = PerlIO_get_cnt(fp); /* get count into register */
6572 /* make sure we have the room */
6573 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6574 /* Not room for all of it
6575 if we are looking for a separator and room for some
6577 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6578 /* just process what we have room for */
6579 shortbuffered = cnt - SvLEN(sv) + append + 1;
6580 cnt -= shortbuffered;
6584 /* remember that cnt can be negative */
6585 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6590 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
6591 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6592 DEBUG_P(PerlIO_printf(Perl_debug_log,
6593 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6594 DEBUG_P(PerlIO_printf(Perl_debug_log,
6595 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6596 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6597 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6602 while (cnt > 0) { /* this | eat */
6604 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6605 goto thats_all_folks; /* screams | sed :-) */
6609 Copy(ptr, bp, cnt, char); /* this | eat */
6610 bp += cnt; /* screams | dust */
6611 ptr += cnt; /* louder | sed :-) */
6616 if (shortbuffered) { /* oh well, must extend */
6617 cnt = shortbuffered;
6619 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6621 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6622 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6626 DEBUG_P(PerlIO_printf(Perl_debug_log,
6627 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6628 PTR2UV(ptr),(long)cnt));
6629 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6631 DEBUG_P(PerlIO_printf(Perl_debug_log,
6632 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6633 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6634 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6636 /* This used to call 'filbuf' in stdio form, but as that behaves like
6637 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6638 another abstraction. */
6639 i = PerlIO_getc(fp); /* get more characters */
6641 DEBUG_P(PerlIO_printf(Perl_debug_log,
6642 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6643 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6644 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6646 cnt = PerlIO_get_cnt(fp);
6647 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6648 DEBUG_P(PerlIO_printf(Perl_debug_log,
6649 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6651 if (i == EOF) /* all done for ever? */
6652 goto thats_really_all_folks;
6654 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6656 SvGROW(sv, bpx + cnt + 2);
6657 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6659 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6661 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6662 goto thats_all_folks;
6666 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6667 memNE((char*)bp - rslen, rsptr, rslen))
6668 goto screamer; /* go back to the fray */
6669 thats_really_all_folks:
6671 cnt += shortbuffered;
6672 DEBUG_P(PerlIO_printf(Perl_debug_log,
6673 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6674 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6675 DEBUG_P(PerlIO_printf(Perl_debug_log,
6676 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6677 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6678 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6680 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6681 DEBUG_P(PerlIO_printf(Perl_debug_log,
6682 "Screamer: done, len=%ld, string=|%.*s|\n",
6683 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6687 /*The big, slow, and stupid way. */
6689 /* Any stack-challenged places. */
6691 /* EPOC: need to work around SDK features. *
6692 * On WINS: MS VC5 generates calls to _chkstk, *
6693 * if a "large" stack frame is allocated. *
6694 * gcc on MARM does not generate calls like these. */
6695 # define USEHEAPINSTEADOFSTACK
6698 #ifdef USEHEAPINSTEADOFSTACK
6700 New(0, buf, 8192, STDCHAR);
6708 register STDCHAR *bpe = buf + sizeof(buf);
6710 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6711 ; /* keep reading */
6715 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6716 /* Accomodate broken VAXC compiler, which applies U8 cast to
6717 * both args of ?: operator, causing EOF to change into 255
6720 i = (U8)buf[cnt - 1];
6726 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6728 sv_catpvn(sv, (char *) buf, cnt);
6730 sv_setpvn(sv, (char *) buf, cnt);
6732 if (i != EOF && /* joy */
6734 SvCUR(sv) < rslen ||
6735 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6739 * If we're reading from a TTY and we get a short read,
6740 * indicating that the user hit his EOF character, we need
6741 * to notice it now, because if we try to read from the TTY
6742 * again, the EOF condition will disappear.
6744 * The comparison of cnt to sizeof(buf) is an optimization
6745 * that prevents unnecessary calls to feof().
6749 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6753 #ifdef USEHEAPINSTEADOFSTACK
6758 if (rspara) { /* have to do this both before and after */
6759 while (i != EOF) { /* to make sure file boundaries work right */
6760 i = PerlIO_getc(fp);
6762 PerlIO_ungetc(fp,i);
6768 return_string_or_null:
6769 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6775 Auto-increment of the value in the SV, doing string to numeric conversion
6776 if necessary. Handles 'get' magic.
6782 Perl_sv_inc(pTHX_ register SV *sv)
6791 if (SvTHINKFIRST(sv)) {
6793 sv_force_normal_flags(sv, 0);
6794 if (SvREADONLY(sv)) {
6795 if (IN_PERL_RUNTIME)
6796 Perl_croak(aTHX_ PL_no_modify);
6800 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6802 i = PTR2IV(SvRV(sv));
6807 flags = SvFLAGS(sv);
6808 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6809 /* It's (privately or publicly) a float, but not tested as an
6810 integer, so test it to see. */
6812 flags = SvFLAGS(sv);
6814 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6815 /* It's publicly an integer, or privately an integer-not-float */
6816 #ifdef PERL_PRESERVE_IVUV
6820 if (SvUVX(sv) == UV_MAX)
6821 sv_setnv(sv, UV_MAX_P1);
6823 (void)SvIOK_only_UV(sv);
6826 if (SvIVX(sv) == IV_MAX)
6827 sv_setuv(sv, (UV)IV_MAX + 1);
6829 (void)SvIOK_only(sv);
6835 if (flags & SVp_NOK) {
6836 (void)SvNOK_only(sv);
6841 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6842 if ((flags & SVTYPEMASK) < SVt_PVIV)
6843 sv_upgrade(sv, SVt_IV);
6844 (void)SvIOK_only(sv);
6849 while (isALPHA(*d)) d++;
6850 while (isDIGIT(*d)) d++;
6852 #ifdef PERL_PRESERVE_IVUV
6853 /* Got to punt this as an integer if needs be, but we don't issue
6854 warnings. Probably ought to make the sv_iv_please() that does
6855 the conversion if possible, and silently. */
6856 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6857 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6858 /* Need to try really hard to see if it's an integer.
6859 9.22337203685478e+18 is an integer.
6860 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6861 so $a="9.22337203685478e+18"; $a+0; $a++
6862 needs to be the same as $a="9.22337203685478e+18"; $a++
6869 /* sv_2iv *should* have made this an NV */
6870 if (flags & SVp_NOK) {
6871 (void)SvNOK_only(sv);
6875 /* I don't think we can get here. Maybe I should assert this
6876 And if we do get here I suspect that sv_setnv will croak. NWC
6878 #if defined(USE_LONG_DOUBLE)
6879 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",
6880 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6882 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6883 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6886 #endif /* PERL_PRESERVE_IVUV */
6887 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6891 while (d >= SvPVX(sv)) {
6899 /* MKS: The original code here died if letters weren't consecutive.
6900 * at least it didn't have to worry about non-C locales. The
6901 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6902 * arranged in order (although not consecutively) and that only
6903 * [A-Za-z] are accepted by isALPHA in the C locale.
6905 if (*d != 'z' && *d != 'Z') {
6906 do { ++*d; } while (!isALPHA(*d));
6909 *(d--) -= 'z' - 'a';
6914 *(d--) -= 'z' - 'a' + 1;
6918 /* oh,oh, the number grew */
6919 SvGROW(sv, SvCUR(sv) + 2);
6921 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6932 Auto-decrement of the value in the SV, doing string to numeric conversion
6933 if necessary. Handles 'get' magic.
6939 Perl_sv_dec(pTHX_ register SV *sv)
6947 if (SvTHINKFIRST(sv)) {
6949 sv_force_normal_flags(sv, 0);
6950 if (SvREADONLY(sv)) {
6951 if (IN_PERL_RUNTIME)
6952 Perl_croak(aTHX_ PL_no_modify);
6956 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6958 i = PTR2IV(SvRV(sv));
6963 /* Unlike sv_inc we don't have to worry about string-never-numbers
6964 and keeping them magic. But we mustn't warn on punting */
6965 flags = SvFLAGS(sv);
6966 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6967 /* It's publicly an integer, or privately an integer-not-float */
6968 #ifdef PERL_PRESERVE_IVUV
6972 if (SvUVX(sv) == 0) {
6973 (void)SvIOK_only(sv);
6977 (void)SvIOK_only_UV(sv);
6981 if (SvIVX(sv) == IV_MIN)
6982 sv_setnv(sv, (NV)IV_MIN - 1.0);
6984 (void)SvIOK_only(sv);
6990 if (flags & SVp_NOK) {
6992 (void)SvNOK_only(sv);
6995 if (!(flags & SVp_POK)) {
6996 if ((flags & SVTYPEMASK) < SVt_PVNV)
6997 sv_upgrade(sv, SVt_NV);
6999 (void)SvNOK_only(sv);
7002 #ifdef PERL_PRESERVE_IVUV
7004 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
7005 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
7006 /* Need to try really hard to see if it's an integer.
7007 9.22337203685478e+18 is an integer.
7008 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
7009 so $a="9.22337203685478e+18"; $a+0; $a--
7010 needs to be the same as $a="9.22337203685478e+18"; $a--
7017 /* sv_2iv *should* have made this an NV */
7018 if (flags & SVp_NOK) {
7019 (void)SvNOK_only(sv);
7023 /* I don't think we can get here. Maybe I should assert this
7024 And if we do get here I suspect that sv_setnv will croak. NWC
7026 #if defined(USE_LONG_DOUBLE)
7027 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",
7028 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7030 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
7031 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
7035 #endif /* PERL_PRESERVE_IVUV */
7036 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
7040 =for apidoc sv_mortalcopy
7042 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
7043 The new SV is marked as mortal. It will be destroyed "soon", either by an
7044 explicit call to FREETMPS, or by an implicit call at places such as
7045 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
7050 /* Make a string that will exist for the duration of the expression
7051 * evaluation. Actually, it may have to last longer than that, but
7052 * hopefully we won't free it until it has been assigned to a
7053 * permanent location. */
7056 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
7061 sv_setsv(sv,oldstr);
7063 PL_tmps_stack[++PL_tmps_ix] = sv;
7069 =for apidoc sv_newmortal
7071 Creates a new null SV which is mortal. The reference count of the SV is
7072 set to 1. It will be destroyed "soon", either by an explicit call to
7073 FREETMPS, or by an implicit call at places such as statement boundaries.
7074 See also C<sv_mortalcopy> and C<sv_2mortal>.
7080 Perl_sv_newmortal(pTHX)
7085 SvFLAGS(sv) = SVs_TEMP;
7087 PL_tmps_stack[++PL_tmps_ix] = sv;
7092 =for apidoc sv_2mortal
7094 Marks an existing SV as mortal. The SV will be destroyed "soon", either
7095 by an explicit call to FREETMPS, or by an implicit call at places such as
7096 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
7102 Perl_sv_2mortal(pTHX_ register SV *sv)
7106 if (SvREADONLY(sv) && SvIMMORTAL(sv))
7109 PL_tmps_stack[++PL_tmps_ix] = sv;
7117 Creates a new SV and copies a string into it. The reference count for the
7118 SV is set to 1. If C<len> is zero, Perl will compute the length using
7119 strlen(). For efficiency, consider using C<newSVpvn> instead.
7125 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
7132 sv_setpvn(sv,s,len);
7137 =for apidoc newSVpvn
7139 Creates a new SV and copies a string into it. The reference count for the
7140 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
7141 string. You are responsible for ensuring that the source string is at least
7148 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
7153 sv_setpvn(sv,s,len);
7158 =for apidoc newSVpvn_share
7160 Creates a new SV with its SvPVX pointing to a shared string in the string
7161 table. If the string does not already exist in the table, it is created
7162 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
7163 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
7164 otherwise the hash is computed. The idea here is that as the string table
7165 is used for shared hash keys these strings will have SvPVX == HeKEY and
7166 hash lookup will avoid string compare.
7172 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
7175 bool is_utf8 = FALSE;
7177 STRLEN tmplen = -len;
7179 /* See the note in hv.c:hv_fetch() --jhi */
7180 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
7184 PERL_HASH(hash, src, len);
7186 sv_upgrade(sv, SVt_PVIV);
7187 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
7200 #if defined(PERL_IMPLICIT_CONTEXT)
7202 /* pTHX_ magic can't cope with varargs, so this is a no-context
7203 * version of the main function, (which may itself be aliased to us).
7204 * Don't access this version directly.
7208 Perl_newSVpvf_nocontext(const char* pat, ...)
7213 va_start(args, pat);
7214 sv = vnewSVpvf(pat, &args);
7221 =for apidoc newSVpvf
7223 Creates a new SV and initializes it with the string formatted like
7230 Perl_newSVpvf(pTHX_ const char* pat, ...)
7234 va_start(args, pat);
7235 sv = vnewSVpvf(pat, &args);
7240 /* backend for newSVpvf() and newSVpvf_nocontext() */
7243 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
7247 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7254 Creates a new SV and copies a floating point value into it.
7255 The reference count for the SV is set to 1.
7261 Perl_newSVnv(pTHX_ NV n)
7273 Creates a new SV and copies an integer into it. The reference count for the
7280 Perl_newSViv(pTHX_ IV i)
7292 Creates a new SV and copies an unsigned integer into it.
7293 The reference count for the SV is set to 1.
7299 Perl_newSVuv(pTHX_ UV u)
7309 =for apidoc newRV_noinc
7311 Creates an RV wrapper for an SV. The reference count for the original
7312 SV is B<not> incremented.
7318 Perl_newRV_noinc(pTHX_ SV *tmpRef)
7323 sv_upgrade(sv, SVt_RV);
7330 /* newRV_inc is the official function name to use now.
7331 * newRV_inc is in fact #defined to newRV in sv.h
7335 Perl_newRV(pTHX_ SV *tmpRef)
7337 return newRV_noinc(SvREFCNT_inc(tmpRef));
7343 Creates a new SV which is an exact duplicate of the original SV.
7350 Perl_newSVsv(pTHX_ register SV *old)
7356 if (SvTYPE(old) == SVTYPEMASK) {
7357 if (ckWARN_d(WARN_INTERNAL))
7358 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
7373 =for apidoc sv_reset
7375 Underlying implementation for the C<reset> Perl function.
7376 Note that the perl-level function is vaguely deprecated.
7382 Perl_sv_reset(pTHX_ register char *s, HV *stash)
7390 char todo[PERL_UCHAR_MAX+1];
7395 if (!*s) { /* reset ?? searches */
7396 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
7397 pm->op_pmdynflags &= ~PMdf_USED;
7402 /* reset variables */
7404 if (!HvARRAY(stash))
7407 Zero(todo, 256, char);
7409 i = (unsigned char)*s;
7413 max = (unsigned char)*s++;
7414 for ( ; i <= max; i++) {
7417 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7418 for (entry = HvARRAY(stash)[i];
7420 entry = HeNEXT(entry))
7422 if (!todo[(U8)*HeKEY(entry)])
7424 gv = (GV*)HeVAL(entry);
7426 if (SvTHINKFIRST(sv)) {
7427 if (!SvREADONLY(sv) && SvROK(sv))
7432 if (SvTYPE(sv) >= SVt_PV) {
7434 if (SvPVX(sv) != Nullch)
7441 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7444 #ifdef USE_ENVIRON_ARRAY
7446 # ifdef USE_ITHREADS
7447 && PL_curinterp == aTHX
7451 environ[0] = Nullch;
7454 #endif /* !PERL_MICRO */
7464 Using various gambits, try to get an IO from an SV: the IO slot if its a
7465 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7466 named after the PV if we're a string.
7472 Perl_sv_2io(pTHX_ SV *sv)
7478 switch (SvTYPE(sv)) {
7486 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7490 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7492 return sv_2io(SvRV(sv));
7493 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
7499 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7508 Using various gambits, try to get a CV from an SV; in addition, try if
7509 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7515 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7522 return *gvp = Nullgv, Nullcv;
7523 switch (SvTYPE(sv)) {
7542 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7543 tryAMAGICunDEREF(to_cv);
7546 if (SvTYPE(sv) == SVt_PVCV) {
7555 Perl_croak(aTHX_ "Not a subroutine reference");
7560 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
7566 if (lref && !GvCVu(gv)) {
7569 tmpsv = NEWSV(704,0);
7570 gv_efullname3(tmpsv, gv, Nullch);
7571 /* XXX this is probably not what they think they're getting.
7572 * It has the same effect as "sub name;", i.e. just a forward
7574 newSUB(start_subparse(FALSE, 0),
7575 newSVOP(OP_CONST, 0, tmpsv),
7580 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7590 Returns true if the SV has a true value by Perl's rules.
7591 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7592 instead use an in-line version.
7598 Perl_sv_true(pTHX_ register SV *sv)
7604 if ((tXpv = (XPV*)SvANY(sv)) &&
7605 (tXpv->xpv_cur > 1 ||
7606 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
7613 return SvIVX(sv) != 0;
7616 return SvNVX(sv) != 0.0;
7618 return sv_2bool(sv);
7626 A private implementation of the C<SvIVx> macro for compilers which can't
7627 cope with complex macro expressions. Always use the macro instead.
7633 Perl_sv_iv(pTHX_ register SV *sv)
7637 return (IV)SvUVX(sv);
7646 A private implementation of the C<SvUVx> macro for compilers which can't
7647 cope with complex macro expressions. Always use the macro instead.
7653 Perl_sv_uv(pTHX_ register SV *sv)
7658 return (UV)SvIVX(sv);
7666 A private implementation of the C<SvNVx> macro for compilers which can't
7667 cope with complex macro expressions. Always use the macro instead.
7673 Perl_sv_nv(pTHX_ register SV *sv)
7680 /* sv_pv() is now a macro using SvPV_nolen();
7681 * this function provided for binary compatibility only
7685 Perl_sv_pv(pTHX_ SV *sv)
7692 return sv_2pv(sv, &n_a);
7698 Use the C<SvPV_nolen> macro instead
7702 A private implementation of the C<SvPV> macro for compilers which can't
7703 cope with complex macro expressions. Always use the macro instead.
7709 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7715 return sv_2pv(sv, lp);
7720 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7726 return sv_2pv_flags(sv, lp, 0);
7729 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7730 * this function provided for binary compatibility only
7734 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7736 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7740 =for apidoc sv_pvn_force
7742 Get a sensible string out of the SV somehow.
7743 A private implementation of the C<SvPV_force> macro for compilers which
7744 can't cope with complex macro expressions. Always use the macro instead.
7746 =for apidoc sv_pvn_force_flags
7748 Get a sensible string out of the SV somehow.
7749 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7750 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7751 implemented in terms of this function.
7752 You normally want to use the various wrapper macros instead: see
7753 C<SvPV_force> and C<SvPV_force_nomg>
7759 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7763 if (SvTHINKFIRST(sv) && !SvROK(sv))
7764 sv_force_normal_flags(sv, 0);
7770 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7771 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7775 s = sv_2pv_flags(sv, lp, flags);
7776 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7781 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7782 SvGROW(sv, len + 1);
7783 Move(s,SvPVX(sv),len,char);
7788 SvPOK_on(sv); /* validate pointer */
7790 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7791 PTR2UV(sv),SvPVX(sv)));
7797 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7798 * this function provided for binary compatibility only
7802 Perl_sv_pvbyte(pTHX_ SV *sv)
7804 sv_utf8_downgrade(sv,0);
7809 =for apidoc sv_pvbyte
7811 Use C<SvPVbyte_nolen> instead.
7813 =for apidoc sv_pvbyten
7815 A private implementation of the C<SvPVbyte> macro for compilers
7816 which can't cope with complex macro expressions. Always use the macro
7823 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7825 sv_utf8_downgrade(sv,0);
7826 return sv_pvn(sv,lp);
7830 =for apidoc sv_pvbyten_force
7832 A private implementation of the C<SvPVbytex_force> macro for compilers
7833 which can't cope with complex macro expressions. Always use the macro
7840 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7842 sv_pvn_force(sv,lp);
7843 sv_utf8_downgrade(sv,0);
7848 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7849 * this function provided for binary compatibility only
7853 Perl_sv_pvutf8(pTHX_ SV *sv)
7855 sv_utf8_upgrade(sv);
7860 =for apidoc sv_pvutf8
7862 Use the C<SvPVutf8_nolen> macro instead
7864 =for apidoc sv_pvutf8n
7866 A private implementation of the C<SvPVutf8> macro for compilers
7867 which can't cope with complex macro expressions. Always use the macro
7874 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7876 sv_utf8_upgrade(sv);
7877 return sv_pvn(sv,lp);
7881 =for apidoc sv_pvutf8n_force
7883 A private implementation of the C<SvPVutf8_force> macro for compilers
7884 which can't cope with complex macro expressions. Always use the macro
7891 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7893 sv_pvn_force(sv,lp);
7894 sv_utf8_upgrade(sv);
7900 =for apidoc sv_reftype
7902 Returns a string describing what the SV is a reference to.
7908 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7910 if (ob && SvOBJECT(sv)) {
7911 if (HvNAME(SvSTASH(sv)))
7912 return HvNAME(SvSTASH(sv));
7917 switch (SvTYPE(sv)) {
7934 case SVt_PVLV: return SvROK(sv) ? "REF"
7935 /* tied lvalues should appear to be
7936 * scalars for backwards compatitbility */
7937 : (LvTYPE(sv) == 't' || LvTYPE(sv) == 'T')
7938 ? "SCALAR" : "LVALUE";
7939 case SVt_PVAV: return "ARRAY";
7940 case SVt_PVHV: return "HASH";
7941 case SVt_PVCV: return "CODE";
7942 case SVt_PVGV: return "GLOB";
7943 case SVt_PVFM: return "FORMAT";
7944 case SVt_PVIO: return "IO";
7945 default: return "UNKNOWN";
7951 =for apidoc sv_isobject
7953 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7954 object. If the SV is not an RV, or if the object is not blessed, then this
7961 Perl_sv_isobject(pTHX_ SV *sv)
7978 Returns a boolean indicating whether the SV is blessed into the specified
7979 class. This does not check for subtypes; use C<sv_derived_from> to verify
7980 an inheritance relationship.
7986 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7997 if (!HvNAME(SvSTASH(sv)))
8000 return strEQ(HvNAME(SvSTASH(sv)), name);
8006 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
8007 it will be upgraded to one. If C<classname> is non-null then the new SV will
8008 be blessed in the specified package. The new SV is returned and its
8009 reference count is 1.
8015 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
8021 SV_CHECK_THINKFIRST_COW_DROP(rv);
8024 if (SvTYPE(rv) >= SVt_PVMG) {
8025 U32 refcnt = SvREFCNT(rv);
8029 SvREFCNT(rv) = refcnt;
8032 if (SvTYPE(rv) < SVt_RV)
8033 sv_upgrade(rv, SVt_RV);
8034 else if (SvTYPE(rv) > SVt_RV) {
8035 (void)SvOOK_off(rv);
8036 if (SvPVX(rv) && SvLEN(rv))
8037 Safefree(SvPVX(rv));
8047 HV* stash = gv_stashpv(classname, TRUE);
8048 (void)sv_bless(rv, stash);
8054 =for apidoc sv_setref_pv
8056 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
8057 argument will be upgraded to an RV. That RV will be modified to point to
8058 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
8059 into the SV. The C<classname> argument indicates the package for the
8060 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8061 will have a reference count of 1, and the RV will be returned.
8063 Do not use with other Perl types such as HV, AV, SV, CV, because those
8064 objects will become corrupted by the pointer copy process.
8066 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
8072 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
8075 sv_setsv(rv, &PL_sv_undef);
8079 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
8084 =for apidoc sv_setref_iv
8086 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
8087 argument will be upgraded to an RV. That RV will be modified to point to
8088 the new SV. The C<classname> argument indicates the package for the
8089 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8090 will have a reference count of 1, and the RV will be returned.
8096 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
8098 sv_setiv(newSVrv(rv,classname), iv);
8103 =for apidoc sv_setref_uv
8105 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
8106 argument will be upgraded to an RV. That RV will be modified to point to
8107 the new SV. The C<classname> argument indicates the package for the
8108 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8109 will have a reference count of 1, and the RV will be returned.
8115 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
8117 sv_setuv(newSVrv(rv,classname), uv);
8122 =for apidoc sv_setref_nv
8124 Copies a double into a new SV, optionally blessing the SV. The C<rv>
8125 argument will be upgraded to an RV. That RV will be modified to point to
8126 the new SV. The C<classname> argument indicates the package for the
8127 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
8128 will have a reference count of 1, and the RV will be returned.
8134 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
8136 sv_setnv(newSVrv(rv,classname), nv);
8141 =for apidoc sv_setref_pvn
8143 Copies a string into a new SV, optionally blessing the SV. The length of the
8144 string must be specified with C<n>. The C<rv> argument will be upgraded to
8145 an RV. That RV will be modified to point to the new SV. The C<classname>
8146 argument indicates the package for the blessing. Set C<classname> to
8147 C<Nullch> to avoid the blessing. The new SV will have a reference count
8148 of 1, and the RV will be returned.
8150 Note that C<sv_setref_pv> copies the pointer while this copies the string.
8156 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
8158 sv_setpvn(newSVrv(rv,classname), pv, n);
8163 =for apidoc sv_bless
8165 Blesses an SV into a specified package. The SV must be an RV. The package
8166 must be designated by its stash (see C<gv_stashpv()>). The reference count
8167 of the SV is unaffected.
8173 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
8177 Perl_croak(aTHX_ "Can't bless non-reference value");
8179 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
8180 if (SvREADONLY(tmpRef))
8181 Perl_croak(aTHX_ PL_no_modify);
8182 if (SvOBJECT(tmpRef)) {
8183 if (SvTYPE(tmpRef) != SVt_PVIO)
8185 SvREFCNT_dec(SvSTASH(tmpRef));
8188 SvOBJECT_on(tmpRef);
8189 if (SvTYPE(tmpRef) != SVt_PVIO)
8191 (void)SvUPGRADE(tmpRef, SVt_PVMG);
8192 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
8199 if(SvSMAGICAL(tmpRef))
8200 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
8208 /* Downgrades a PVGV to a PVMG.
8212 S_sv_unglob(pTHX_ SV *sv)
8216 assert(SvTYPE(sv) == SVt_PVGV);
8221 SvREFCNT_dec(GvSTASH(sv));
8222 GvSTASH(sv) = Nullhv;
8224 sv_unmagic(sv, PERL_MAGIC_glob);
8225 Safefree(GvNAME(sv));
8228 /* need to keep SvANY(sv) in the right arena */
8229 xpvmg = new_XPVMG();
8230 StructCopy(SvANY(sv), xpvmg, XPVMG);
8231 del_XPVGV(SvANY(sv));
8234 SvFLAGS(sv) &= ~SVTYPEMASK;
8235 SvFLAGS(sv) |= SVt_PVMG;
8239 =for apidoc sv_unref_flags
8241 Unsets the RV status of the SV, and decrements the reference count of
8242 whatever was being referenced by the RV. This can almost be thought of
8243 as a reversal of C<newSVrv>. The C<cflags> argument can contain
8244 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
8245 (otherwise the decrementing is conditional on the reference count being
8246 different from one or the reference being a readonly SV).
8253 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
8257 if (SvWEAKREF(sv)) {
8265 /* You can't have a || SvREADONLY(rv) here, as $a = $$a, where $a was
8266 assigned to as BEGIN {$a = \"Foo"} will fail. */
8267 if (SvREFCNT(rv) != 1 || (flags & SV_IMMEDIATE_UNREF))
8269 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
8270 sv_2mortal(rv); /* Schedule for freeing later */
8274 =for apidoc sv_unref
8276 Unsets the RV status of the SV, and decrements the reference count of
8277 whatever was being referenced by the RV. This can almost be thought of
8278 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
8279 being zero. See C<SvROK_off>.
8285 Perl_sv_unref(pTHX_ SV *sv)
8287 sv_unref_flags(sv, 0);
8291 =for apidoc sv_taint
8293 Taint an SV. Use C<SvTAINTED_on> instead.
8298 Perl_sv_taint(pTHX_ SV *sv)
8300 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
8304 =for apidoc sv_untaint
8306 Untaint an SV. Use C<SvTAINTED_off> instead.
8311 Perl_sv_untaint(pTHX_ SV *sv)
8313 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8314 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8321 =for apidoc sv_tainted
8323 Test an SV for taintedness. Use C<SvTAINTED> instead.
8328 Perl_sv_tainted(pTHX_ SV *sv)
8330 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
8331 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
8332 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
8339 =for apidoc sv_setpviv
8341 Copies an integer into the given SV, also updating its string value.
8342 Does not handle 'set' magic. See C<sv_setpviv_mg>.
8348 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
8350 char buf[TYPE_CHARS(UV)];
8352 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8354 sv_setpvn(sv, ptr, ebuf - ptr);
8358 =for apidoc sv_setpviv_mg
8360 Like C<sv_setpviv>, but also handles 'set' magic.
8366 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
8368 char buf[TYPE_CHARS(UV)];
8370 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
8372 sv_setpvn(sv, ptr, ebuf - ptr);
8376 #if defined(PERL_IMPLICIT_CONTEXT)
8378 /* pTHX_ magic can't cope with varargs, so this is a no-context
8379 * version of the main function, (which may itself be aliased to us).
8380 * Don't access this version directly.
8384 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
8388 va_start(args, pat);
8389 sv_vsetpvf(sv, pat, &args);
8393 /* pTHX_ magic can't cope with varargs, so this is a no-context
8394 * version of the main function, (which may itself be aliased to us).
8395 * Don't access this version directly.
8399 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
8403 va_start(args, pat);
8404 sv_vsetpvf_mg(sv, pat, &args);
8410 =for apidoc sv_setpvf
8412 Processes its arguments like C<sprintf> and sets an SV to the formatted
8413 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
8419 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
8422 va_start(args, pat);
8423 sv_vsetpvf(sv, pat, &args);
8427 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
8430 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8432 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8436 =for apidoc sv_setpvf_mg
8438 Like C<sv_setpvf>, but also handles 'set' magic.
8444 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8447 va_start(args, pat);
8448 sv_vsetpvf_mg(sv, pat, &args);
8452 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
8455 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8457 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8461 #if defined(PERL_IMPLICIT_CONTEXT)
8463 /* pTHX_ magic can't cope with varargs, so this is a no-context
8464 * version of the main function, (which may itself be aliased to us).
8465 * Don't access this version directly.
8469 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8473 va_start(args, pat);
8474 sv_vcatpvf(sv, pat, &args);
8478 /* pTHX_ magic can't cope with varargs, so this is a no-context
8479 * version of the main function, (which may itself be aliased to us).
8480 * Don't access this version directly.
8484 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8488 va_start(args, pat);
8489 sv_vcatpvf_mg(sv, pat, &args);
8495 =for apidoc sv_catpvf
8497 Processes its arguments like C<sprintf> and appends the formatted
8498 output to an SV. If the appended data contains "wide" characters
8499 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8500 and characters >255 formatted with %c), the original SV might get
8501 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
8502 C<SvSETMAGIC()> must typically be called after calling this function
8503 to handle 'set' magic.
8508 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8511 va_start(args, pat);
8512 sv_vcatpvf(sv, pat, &args);
8516 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
8519 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8521 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8525 =for apidoc sv_catpvf_mg
8527 Like C<sv_catpvf>, but also handles 'set' magic.
8533 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8536 va_start(args, pat);
8537 sv_vcatpvf_mg(sv, pat, &args);
8541 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
8544 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8546 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8551 =for apidoc sv_vsetpvfn
8553 Works like C<vcatpvfn> but copies the text into the SV instead of
8556 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
8562 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8564 sv_setpvn(sv, "", 0);
8565 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8568 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8571 S_expect_number(pTHX_ char** pattern)
8574 switch (**pattern) {
8575 case '1': case '2': case '3':
8576 case '4': case '5': case '6':
8577 case '7': case '8': case '9':
8578 while (isDIGIT(**pattern))
8579 var = var * 10 + (*(*pattern)++ - '0');
8583 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8586 F0convert(NV nv, char *endbuf, STRLEN *len)
8597 if (uv & 1 && uv == nv)
8598 uv--; /* Round to even */
8600 unsigned dig = uv % 10;
8613 =for apidoc sv_vcatpvfn
8615 Processes its arguments like C<vsprintf> and appends the formatted output
8616 to an SV. Uses an array of SVs if the C style variable argument list is
8617 missing (NULL). When running with taint checks enabled, indicates via
8618 C<maybe_tainted> if results are untrustworthy (often due to the use of
8621 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
8627 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8634 static char nullstr[] = "(null)";
8636 bool has_utf8; /* has the result utf8? */
8637 bool pat_utf8; /* the pattern is in utf8? */
8639 /* Times 4: a decimal digit takes more than 3 binary digits.
8640 * NV_DIG: mantissa takes than many decimal digits.
8641 * Plus 32: Playing safe. */
8642 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8643 /* large enough for "%#.#f" --chip */
8644 /* what about long double NVs? --jhi */
8646 has_utf8 = pat_utf8 = DO_UTF8(sv);
8648 /* no matter what, this is a string now */
8649 (void)SvPV_force(sv, origlen);
8651 /* special-case "", "%s", and "%_" */
8654 if (patlen == 2 && pat[0] == '%') {
8658 char *s = va_arg(*args, char*);
8659 sv_catpv(sv, s ? s : nullstr);
8661 else if (svix < svmax) {
8662 sv_catsv(sv, *svargs);
8663 if (DO_UTF8(*svargs))
8669 argsv = va_arg(*args, SV*);
8670 sv_catsv(sv, argsv);
8675 /* See comment on '_' below */
8680 #ifndef USE_LONG_DOUBLE
8681 /* special-case "%.<number>[gf]" */
8682 if ( patlen <= 5 && pat[0] == '%' && pat[1] == '.'
8683 && (pat[patlen-1] == 'g' || pat[patlen-1] == 'f') ) {
8684 unsigned digits = 0;
8688 while (*pp >= '0' && *pp <= '9')
8689 digits = 10 * digits + (*pp++ - '0');
8690 if (pp - pat == (int)patlen - 1) {
8694 nv = (NV)va_arg(*args, double);
8695 else if (svix < svmax)
8700 /* Add check for digits != 0 because it seems that some
8701 gconverts are buggy in this case, and we don't yet have
8702 a Configure test for this. */
8703 if (digits && digits < sizeof(ebuf) - NV_DIG - 10) {
8704 /* 0, point, slack */
8705 Gconvert(nv, (int)digits, 0, ebuf);
8707 if (*ebuf) /* May return an empty string for digits==0 */
8710 } else if (!digits) {
8713 if ((p = F0convert(nv, ebuf + sizeof ebuf, &l))) {
8714 sv_catpvn(sv, p, l);
8720 #endif /* !USE_LONG_DOUBLE */
8722 if (!args && svix < svmax && DO_UTF8(*svargs))
8725 patend = (char*)pat + patlen;
8726 for (p = (char*)pat; p < patend; p = q) {
8729 bool vectorize = FALSE;
8730 bool vectorarg = FALSE;
8731 bool vec_utf8 = FALSE;
8737 bool has_precis = FALSE;
8740 bool is_utf8 = FALSE; /* is this item utf8? */
8741 #ifdef HAS_LDBL_SPRINTF_BUG
8742 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8743 with sfio - Allen <allens@cpan.org> */
8744 bool fix_ldbl_sprintf_bug = FALSE;
8748 U8 utf8buf[UTF8_MAXLEN+1];
8749 STRLEN esignlen = 0;
8751 char *eptr = Nullch;
8754 U8 *vecstr = Null(U8*);
8761 /* we need a long double target in case HAS_LONG_DOUBLE but
8764 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8773 STRLEN dotstrlen = 1;
8774 I32 efix = 0; /* explicit format parameter index */
8775 I32 ewix = 0; /* explicit width index */
8776 I32 epix = 0; /* explicit precision index */
8777 I32 evix = 0; /* explicit vector index */
8778 bool asterisk = FALSE;
8780 /* echo everything up to the next format specification */
8781 for (q = p; q < patend && *q != '%'; ++q) ;
8783 if (has_utf8 && !pat_utf8)
8784 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8786 sv_catpvn(sv, p, q - p);
8793 We allow format specification elements in this order:
8794 \d+\$ explicit format parameter index
8796 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8797 0 flag (as above): repeated to allow "v02"
8798 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8799 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8801 [%bcdefginopsux_DFOUX] format (mandatory)
8803 if (EXPECT_NUMBER(q, width)) {
8844 if (EXPECT_NUMBER(q, ewix))
8853 if ((vectorarg = asterisk)) {
8865 EXPECT_NUMBER(q, width);
8870 vecsv = va_arg(*args, SV*);
8872 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8873 svargs[evix ? evix-1 : svix++] : &PL_sv_undef;
8874 dotstr = SvPVx(vecsv, dotstrlen);
8879 vecsv = va_arg(*args, SV*);
8880 vecstr = (U8*)SvPVx(vecsv,veclen);
8881 vec_utf8 = DO_UTF8(vecsv);
8883 else if (efix ? efix <= svmax : svix < svmax) {
8884 vecsv = svargs[efix ? efix-1 : svix++];
8885 vecstr = (U8*)SvPVx(vecsv,veclen);
8886 vec_utf8 = DO_UTF8(vecsv);
8896 i = va_arg(*args, int);
8898 i = (ewix ? ewix <= svmax : svix < svmax) ?
8899 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8901 width = (i < 0) ? -i : i;
8911 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8913 /* XXX: todo, support specified precision parameter */
8917 i = va_arg(*args, int);
8919 i = (ewix ? ewix <= svmax : svix < svmax)
8920 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8921 precis = (i < 0) ? 0 : i;
8926 precis = precis * 10 + (*q++ - '0');
8935 case 'I': /* Ix, I32x, and I64x */
8937 if (q[1] == '6' && q[2] == '4') {
8943 if (q[1] == '3' && q[2] == '2') {
8953 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8964 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8965 if (*(q + 1) == 'l') { /* lld, llf */
8990 argsv = (efix ? efix <= svmax : svix < svmax) ?
8991 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8998 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
9000 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
9002 eptr = (char*)utf8buf;
9003 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
9014 if (args && !vectorize) {
9015 eptr = va_arg(*args, char*);
9017 #ifdef MACOS_TRADITIONAL
9018 /* On MacOS, %#s format is used for Pascal strings */
9023 elen = strlen(eptr);
9026 elen = sizeof nullstr - 1;
9030 eptr = SvPVx(argsv, elen);
9031 if (DO_UTF8(argsv)) {
9032 if (has_precis && precis < elen) {
9034 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
9037 if (width) { /* fudge width (can't fudge elen) */
9038 width += elen - sv_len_utf8(argsv);
9047 * The "%_" hack might have to be changed someday,
9048 * if ISO or ANSI decide to use '_' for something.
9049 * So we keep it hidden from users' code.
9051 if (!args || vectorize)
9053 argsv = va_arg(*args, SV*);
9054 eptr = SvPVx(argsv, elen);
9060 if (has_precis && elen > precis)
9067 if (alt || vectorize)
9069 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
9087 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9096 esignbuf[esignlen++] = plus;
9100 case 'h': iv = (short)va_arg(*args, int); break;
9101 case 'l': iv = va_arg(*args, long); break;
9102 case 'V': iv = va_arg(*args, IV); break;
9103 default: iv = va_arg(*args, int); break;
9105 case 'q': iv = va_arg(*args, Quad_t); break;
9110 IV tiv = SvIVx(argsv); /* work around GCC bug #13488 */
9112 case 'h': iv = (short)tiv; break;
9113 case 'l': iv = (long)tiv; break;
9115 default: iv = tiv; break;
9117 case 'q': iv = (Quad_t)tiv; break;
9121 if ( !vectorize ) /* we already set uv above */
9126 esignbuf[esignlen++] = plus;
9130 esignbuf[esignlen++] = '-';
9173 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
9184 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
9185 case 'l': uv = va_arg(*args, unsigned long); break;
9186 case 'V': uv = va_arg(*args, UV); break;
9187 default: uv = va_arg(*args, unsigned); break;
9189 case 'q': uv = va_arg(*args, Uquad_t); break;
9194 UV tuv = SvUVx(argsv); /* work around GCC bug #13488 */
9196 case 'h': uv = (unsigned short)tuv; break;
9197 case 'l': uv = (unsigned long)tuv; break;
9199 default: uv = tuv; break;
9201 case 'q': uv = (Uquad_t)tuv; break;
9207 eptr = ebuf + sizeof ebuf;
9213 p = (char*)((c == 'X')
9214 ? "0123456789ABCDEF" : "0123456789abcdef");
9220 esignbuf[esignlen++] = '0';
9221 esignbuf[esignlen++] = c; /* 'x' or 'X' */
9227 *--eptr = '0' + dig;
9229 if (alt && *eptr != '0')
9235 *--eptr = '0' + dig;
9238 esignbuf[esignlen++] = '0';
9239 esignbuf[esignlen++] = 'b';
9242 default: /* it had better be ten or less */
9243 #if defined(PERL_Y2KWARN)
9244 if (ckWARN(WARN_Y2K)) {
9246 char *s = SvPV(sv,n);
9247 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
9248 && (n == 2 || !isDIGIT(s[n-3])))
9250 Perl_warner(aTHX_ packWARN(WARN_Y2K),
9251 "Possible Y2K bug: %%%c %s",
9252 c, "format string following '19'");
9258 *--eptr = '0' + dig;
9259 } while (uv /= base);
9262 elen = (ebuf + sizeof ebuf) - eptr;
9265 zeros = precis - elen;
9266 else if (precis == 0 && elen == 1 && *eptr == '0')
9271 /* FLOATING POINT */
9274 c = 'f'; /* maybe %F isn't supported here */
9280 /* This is evil, but floating point is even more evil */
9282 /* for SV-style calling, we can only get NV
9283 for C-style calling, we assume %f is double;
9284 for simplicity we allow any of %Lf, %llf, %qf for long double
9288 #if defined(USE_LONG_DOUBLE)
9292 /* [perl #20339] - we should accept and ignore %lf rather than die */
9296 #if defined(USE_LONG_DOUBLE)
9297 intsize = args ? 0 : 'q';
9301 #if defined(HAS_LONG_DOUBLE)
9310 /* now we need (long double) if intsize == 'q', else (double) */
9311 nv = (args && !vectorize) ?
9312 #if LONG_DOUBLESIZE > DOUBLESIZE
9314 va_arg(*args, long double) :
9315 va_arg(*args, double)
9317 va_arg(*args, double)
9323 if (c != 'e' && c != 'E') {
9325 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
9326 will cast our (long double) to (double) */
9327 (void)Perl_frexp(nv, &i);
9328 if (i == PERL_INT_MIN)
9329 Perl_die(aTHX_ "panic: frexp");
9331 need = BIT_DIGITS(i);
9333 need += has_precis ? precis : 6; /* known default */
9338 #ifdef HAS_LDBL_SPRINTF_BUG
9339 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
9340 with sfio - Allen <allens@cpan.org> */
9343 # define MY_DBL_MAX DBL_MAX
9344 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
9345 # if DOUBLESIZE >= 8
9346 # define MY_DBL_MAX 1.7976931348623157E+308L
9348 # define MY_DBL_MAX 3.40282347E+38L
9352 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
9353 # define MY_DBL_MAX_BUG 1L
9355 # define MY_DBL_MAX_BUG MY_DBL_MAX
9359 # define MY_DBL_MIN DBL_MIN
9360 # else /* XXX guessing! -Allen */
9361 # if DOUBLESIZE >= 8
9362 # define MY_DBL_MIN 2.2250738585072014E-308L
9364 # define MY_DBL_MIN 1.17549435E-38L
9368 if ((intsize == 'q') && (c == 'f') &&
9369 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
9371 /* it's going to be short enough that
9372 * long double precision is not needed */
9374 if ((nv <= 0L) && (nv >= -0L))
9375 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
9377 /* would use Perl_fp_class as a double-check but not
9378 * functional on IRIX - see perl.h comments */
9380 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
9381 /* It's within the range that a double can represent */
9382 #if defined(DBL_MAX) && !defined(DBL_MIN)
9383 if ((nv >= ((long double)1/DBL_MAX)) ||
9384 (nv <= (-(long double)1/DBL_MAX)))
9386 fix_ldbl_sprintf_bug = TRUE;
9389 if (fix_ldbl_sprintf_bug == TRUE) {
9399 # undef MY_DBL_MAX_BUG
9402 #endif /* HAS_LDBL_SPRINTF_BUG */
9404 need += 20; /* fudge factor */
9405 if (PL_efloatsize < need) {
9406 Safefree(PL_efloatbuf);
9407 PL_efloatsize = need + 20; /* more fudge */
9408 New(906, PL_efloatbuf, PL_efloatsize, char);
9409 PL_efloatbuf[0] = '\0';
9412 if ( !(width || left || plus || alt) && fill != '0'
9413 && has_precis && intsize != 'q' ) { /* Shortcuts */
9414 /* See earlier comment about buggy Gconvert when digits,
9416 if ( c == 'g' && precis) {
9417 Gconvert((NV)nv, (int)precis, 0, PL_efloatbuf);
9418 if (*PL_efloatbuf) /* May return an empty string for digits==0 */
9419 goto float_converted;
9420 } else if ( c == 'f' && !precis) {
9421 if ((eptr = F0convert(nv, ebuf + sizeof ebuf, &elen)))
9425 eptr = ebuf + sizeof ebuf;
9428 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
9429 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
9430 if (intsize == 'q') {
9431 /* Copy the one or more characters in a long double
9432 * format before the 'base' ([efgEFG]) character to
9433 * the format string. */
9434 static char const prifldbl[] = PERL_PRIfldbl;
9435 char const *p = prifldbl + sizeof(prifldbl) - 3;
9436 while (p >= prifldbl) { *--eptr = *p--; }
9441 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9446 do { *--eptr = '0' + (base % 10); } while (base /= 10);
9458 /* No taint. Otherwise we are in the strange situation
9459 * where printf() taints but print($float) doesn't.
9461 #if defined(HAS_LONG_DOUBLE)
9463 (void)sprintf(PL_efloatbuf, eptr, nv);
9465 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
9467 (void)sprintf(PL_efloatbuf, eptr, nv);
9470 eptr = PL_efloatbuf;
9471 elen = strlen(PL_efloatbuf);
9477 i = SvCUR(sv) - origlen;
9478 if (args && !vectorize) {
9480 case 'h': *(va_arg(*args, short*)) = i; break;
9481 default: *(va_arg(*args, int*)) = i; break;
9482 case 'l': *(va_arg(*args, long*)) = i; break;
9483 case 'V': *(va_arg(*args, IV*)) = i; break;
9485 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
9490 sv_setuv_mg(argsv, (UV)i);
9492 continue; /* not "break" */
9498 if (!args && ckWARN(WARN_PRINTF) &&
9499 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
9500 SV *msg = sv_newmortal();
9501 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
9502 (PL_op->op_type == OP_PRTF) ? "" : "s");
9505 Perl_sv_catpvf(aTHX_ msg,
9506 "\"%%%c\"", c & 0xFF);
9508 Perl_sv_catpvf(aTHX_ msg,
9509 "\"%%\\%03"UVof"\"",
9512 sv_catpv(msg, "end of string");
9513 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9516 /* output mangled stuff ... */
9522 /* ... right here, because formatting flags should not apply */
9523 SvGROW(sv, SvCUR(sv) + elen + 1);
9525 Copy(eptr, p, elen, char);
9528 SvCUR(sv) = p - SvPVX(sv);
9530 continue; /* not "break" */
9533 /* calculate width before utf8_upgrade changes it */
9534 have = esignlen + zeros + elen;
9536 if (is_utf8 != has_utf8) {
9539 sv_utf8_upgrade(sv);
9542 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9543 sv_utf8_upgrade(nsv);
9547 SvGROW(sv, SvCUR(sv) + elen + 1);
9551 /* Use memchr() instead of strchr(), as eptr is not guaranteed */
9552 /* to point to a null-terminated string. */
9553 if (left && ckWARN(WARN_PRINTF) && memchr(eptr, '\n', elen) &&
9554 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF))
9555 Perl_warner(aTHX_ packWARN(WARN_PRINTF),
9556 "Newline in left-justified string for %sprintf",
9557 (PL_op->op_type == OP_PRTF) ? "" : "s");
9559 need = (have > width ? have : width);
9562 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9564 if (esignlen && fill == '0') {
9565 for (i = 0; i < (int)esignlen; i++)
9569 memset(p, fill, gap);
9572 if (esignlen && fill != '0') {
9573 for (i = 0; i < (int)esignlen; i++)
9577 for (i = zeros; i; i--)
9581 Copy(eptr, p, elen, char);
9585 memset(p, ' ', gap);
9590 Copy(dotstr, p, dotstrlen, char);
9594 vectorize = FALSE; /* done iterating over vecstr */
9601 SvCUR(sv) = p - SvPVX(sv);
9609 /* =========================================================================
9611 =head1 Cloning an interpreter
9613 All the macros and functions in this section are for the private use of
9614 the main function, perl_clone().
9616 The foo_dup() functions make an exact copy of an existing foo thinngy.
9617 During the course of a cloning, a hash table is used to map old addresses
9618 to new addresses. The table is created and manipulated with the
9619 ptr_table_* functions.
9623 ============================================================================*/
9626 #if defined(USE_ITHREADS)
9628 #ifndef GpREFCNT_inc
9629 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9633 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9634 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9635 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9636 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9637 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9638 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9639 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9640 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9641 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9642 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9643 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9644 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9645 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9648 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9649 regcomp.c. AMS 20010712 */
9652 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9656 struct reg_substr_datum *s;
9659 return (REGEXP *)NULL;
9661 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9664 len = r->offsets[0];
9665 npar = r->nparens+1;
9667 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9668 Copy(r->program, ret->program, len+1, regnode);
9670 New(0, ret->startp, npar, I32);
9671 Copy(r->startp, ret->startp, npar, I32);
9672 New(0, ret->endp, npar, I32);
9673 Copy(r->startp, ret->startp, npar, I32);
9675 New(0, ret->substrs, 1, struct reg_substr_data);
9676 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9677 s->min_offset = r->substrs->data[i].min_offset;
9678 s->max_offset = r->substrs->data[i].max_offset;
9679 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9680 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9683 ret->regstclass = NULL;
9686 int count = r->data->count;
9688 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9689 char, struct reg_data);
9690 New(0, d->what, count, U8);
9693 for (i = 0; i < count; i++) {
9694 d->what[i] = r->data->what[i];
9695 switch (d->what[i]) {
9697 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9700 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9703 /* This is cheating. */
9704 New(0, d->data[i], 1, struct regnode_charclass_class);
9705 StructCopy(r->data->data[i], d->data[i],
9706 struct regnode_charclass_class);
9707 ret->regstclass = (regnode*)d->data[i];
9710 /* Compiled op trees are readonly, and can thus be
9711 shared without duplication. */
9712 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9715 d->data[i] = r->data->data[i];
9725 New(0, ret->offsets, 2*len+1, U32);
9726 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9728 ret->precomp = SAVEPVN(r->precomp, r->prelen);
9729 ret->refcnt = r->refcnt;
9730 ret->minlen = r->minlen;
9731 ret->prelen = r->prelen;
9732 ret->nparens = r->nparens;
9733 ret->lastparen = r->lastparen;
9734 ret->lastcloseparen = r->lastcloseparen;
9735 ret->reganch = r->reganch;
9737 ret->sublen = r->sublen;
9739 if (RX_MATCH_COPIED(ret))
9740 ret->subbeg = SAVEPVN(r->subbeg, r->sublen);
9742 ret->subbeg = Nullch;
9743 #ifdef PERL_COPY_ON_WRITE
9744 ret->saved_copy = Nullsv;
9747 ptr_table_store(PL_ptr_table, r, ret);
9751 /* duplicate a file handle */
9754 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9758 return (PerlIO*)NULL;
9760 /* look for it in the table first */
9761 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9765 /* create anew and remember what it is */
9766 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9767 ptr_table_store(PL_ptr_table, fp, ret);
9771 /* duplicate a directory handle */
9774 Perl_dirp_dup(pTHX_ DIR *dp)
9782 /* duplicate a typeglob */
9785 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9790 /* look for it in the table first */
9791 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9795 /* create anew and remember what it is */
9796 Newz(0, ret, 1, GP);
9797 ptr_table_store(PL_ptr_table, gp, ret);
9800 ret->gp_refcnt = 0; /* must be before any other dups! */
9801 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9802 ret->gp_io = io_dup_inc(gp->gp_io, param);
9803 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9804 ret->gp_av = av_dup_inc(gp->gp_av, param);
9805 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9806 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9807 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9808 ret->gp_cvgen = gp->gp_cvgen;
9809 ret->gp_flags = gp->gp_flags;
9810 ret->gp_line = gp->gp_line;
9811 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9815 /* duplicate a chain of magic */
9818 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9820 MAGIC *mgprev = (MAGIC*)NULL;
9823 return (MAGIC*)NULL;
9824 /* look for it in the table first */
9825 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9829 for (; mg; mg = mg->mg_moremagic) {
9831 Newz(0, nmg, 1, MAGIC);
9833 mgprev->mg_moremagic = nmg;
9836 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9837 nmg->mg_private = mg->mg_private;
9838 nmg->mg_type = mg->mg_type;
9839 nmg->mg_flags = mg->mg_flags;
9840 if (mg->mg_type == PERL_MAGIC_qr) {
9841 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9843 else if(mg->mg_type == PERL_MAGIC_backref) {
9844 AV *av = (AV*) mg->mg_obj;
9847 SvREFCNT_inc(nmg->mg_obj = (SV*)newAV());
9849 for (i = AvFILLp(av); i >= 0; i--) {
9850 if (!svp[i]) continue;
9851 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9855 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9856 ? sv_dup_inc(mg->mg_obj, param)
9857 : sv_dup(mg->mg_obj, param);
9859 nmg->mg_len = mg->mg_len;
9860 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9861 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9862 if (mg->mg_len > 0) {
9863 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9864 if (mg->mg_type == PERL_MAGIC_overload_table &&
9865 AMT_AMAGIC((AMT*)mg->mg_ptr))
9867 AMT *amtp = (AMT*)mg->mg_ptr;
9868 AMT *namtp = (AMT*)nmg->mg_ptr;
9870 for (i = 1; i < NofAMmeth; i++) {
9871 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9875 else if (mg->mg_len == HEf_SVKEY)
9876 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9878 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9879 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9886 /* create a new pointer-mapping table */
9889 Perl_ptr_table_new(pTHX)
9892 Newz(0, tbl, 1, PTR_TBL_t);
9895 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9899 /* map an existing pointer using a table */
9902 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9904 PTR_TBL_ENT_t *tblent;
9905 UV hash = PTR2UV(sv);
9907 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9908 for (; tblent; tblent = tblent->next) {
9909 if (tblent->oldval == sv)
9910 return tblent->newval;
9915 /* add a new entry to a pointer-mapping table */
9918 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9920 PTR_TBL_ENT_t *tblent, **otblent;
9921 /* XXX this may be pessimal on platforms where pointers aren't good
9922 * hash values e.g. if they grow faster in the most significant
9924 UV hash = PTR2UV(oldv);
9928 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9929 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9930 if (tblent->oldval == oldv) {
9931 tblent->newval = newv;
9935 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9936 tblent->oldval = oldv;
9937 tblent->newval = newv;
9938 tblent->next = *otblent;
9941 if (i && tbl->tbl_items > tbl->tbl_max)
9942 ptr_table_split(tbl);
9945 /* double the hash bucket size of an existing ptr table */
9948 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9950 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9951 UV oldsize = tbl->tbl_max + 1;
9952 UV newsize = oldsize * 2;
9955 Renew(ary, newsize, PTR_TBL_ENT_t*);
9956 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9957 tbl->tbl_max = --newsize;
9959 for (i=0; i < oldsize; i++, ary++) {
9960 PTR_TBL_ENT_t **curentp, **entp, *ent;
9963 curentp = ary + oldsize;
9964 for (entp = ary, ent = *ary; ent; ent = *entp) {
9965 if ((newsize & PTR2UV(ent->oldval)) != i) {
9967 ent->next = *curentp;
9977 /* remove all the entries from a ptr table */
9980 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9982 register PTR_TBL_ENT_t **array;
9983 register PTR_TBL_ENT_t *entry;
9984 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9988 if (!tbl || !tbl->tbl_items) {
9992 array = tbl->tbl_ary;
9999 entry = entry->next;
10003 if (++riter > max) {
10006 entry = array[riter];
10010 tbl->tbl_items = 0;
10013 /* clear and free a ptr table */
10016 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
10021 ptr_table_clear(tbl);
10022 Safefree(tbl->tbl_ary);
10027 char *PL_watch_pvx;
10030 /* attempt to make everything in the typeglob readonly */
10033 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
10035 GV *gv = (GV*)sstr;
10036 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
10038 if (GvIO(gv) || GvFORM(gv)) {
10039 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
10041 else if (!GvCV(gv)) {
10042 GvCV(gv) = (CV*)sv;
10045 /* CvPADLISTs cannot be shared */
10046 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
10051 if (!GvUNIQUE(gv)) {
10053 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
10054 HvNAME(GvSTASH(gv)), GvNAME(gv));
10060 * write attempts will die with
10061 * "Modification of a read-only value attempted"
10067 SvREADONLY_on(GvSV(gv));
10071 GvAV(gv) = (AV*)sv;
10074 SvREADONLY_on(GvAV(gv));
10078 GvHV(gv) = (HV*)sv;
10081 SvREADONLY_on(GvHV(gv));
10084 return sstr; /* he_dup() will SvREFCNT_inc() */
10087 /* duplicate an SV of any type (including AV, HV etc) */
10090 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
10093 SvRV(dstr) = SvWEAKREF(sstr)
10094 ? sv_dup(SvRV(sstr), param)
10095 : sv_dup_inc(SvRV(sstr), param);
10097 else if (SvPVX(sstr)) {
10098 /* Has something there */
10100 /* Normal PV - clone whole allocated space */
10101 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
10102 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10103 /* Not that normal - actually sstr is copy on write.
10104 But we are a true, independant SV, so: */
10105 SvREADONLY_off(dstr);
10110 /* Special case - not normally malloced for some reason */
10111 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
10112 /* A "shared" PV - clone it as unshared string */
10113 if(SvPADTMP(sstr)) {
10114 /* However, some of them live in the pad
10115 and they should not have these flags
10118 SvPVX(dstr) = sharepvn(SvPVX(sstr), SvCUR(sstr),
10120 SvUVX(dstr) = SvUVX(sstr);
10123 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
10125 SvREADONLY_off(dstr);
10129 /* Some other special case - random pointer */
10130 SvPVX(dstr) = SvPVX(sstr);
10135 /* Copy the Null */
10136 SvPVX(dstr) = SvPVX(sstr);
10141 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
10145 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
10147 /* look for it in the table first */
10148 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
10152 if(param->flags & CLONEf_JOIN_IN) {
10153 /** We are joining here so we don't want do clone
10154 something that is bad **/
10156 if(SvTYPE(sstr) == SVt_PVHV &&
10158 /** don't clone stashes if they already exist **/
10159 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
10160 return (SV*) old_stash;
10164 /* create anew and remember what it is */
10166 ptr_table_store(PL_ptr_table, sstr, dstr);
10169 SvFLAGS(dstr) = SvFLAGS(sstr);
10170 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
10171 SvREFCNT(dstr) = 0; /* must be before any other dups! */
10174 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
10175 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
10176 PL_watch_pvx, SvPVX(sstr));
10179 switch (SvTYPE(sstr)) {
10181 SvANY(dstr) = NULL;
10184 SvANY(dstr) = new_XIV();
10185 SvIVX(dstr) = SvIVX(sstr);
10188 SvANY(dstr) = new_XNV();
10189 SvNVX(dstr) = SvNVX(sstr);
10192 SvANY(dstr) = new_XRV();
10193 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10196 SvANY(dstr) = new_XPV();
10197 SvCUR(dstr) = SvCUR(sstr);
10198 SvLEN(dstr) = SvLEN(sstr);
10199 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10202 SvANY(dstr) = new_XPVIV();
10203 SvCUR(dstr) = SvCUR(sstr);
10204 SvLEN(dstr) = SvLEN(sstr);
10205 SvIVX(dstr) = SvIVX(sstr);
10206 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10209 SvANY(dstr) = new_XPVNV();
10210 SvCUR(dstr) = SvCUR(sstr);
10211 SvLEN(dstr) = SvLEN(sstr);
10212 SvIVX(dstr) = SvIVX(sstr);
10213 SvNVX(dstr) = SvNVX(sstr);
10214 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10217 SvANY(dstr) = new_XPVMG();
10218 SvCUR(dstr) = SvCUR(sstr);
10219 SvLEN(dstr) = SvLEN(sstr);
10220 SvIVX(dstr) = SvIVX(sstr);
10221 SvNVX(dstr) = SvNVX(sstr);
10222 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10223 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10224 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10227 SvANY(dstr) = new_XPVBM();
10228 SvCUR(dstr) = SvCUR(sstr);
10229 SvLEN(dstr) = SvLEN(sstr);
10230 SvIVX(dstr) = SvIVX(sstr);
10231 SvNVX(dstr) = SvNVX(sstr);
10232 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10233 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10234 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10235 BmRARE(dstr) = BmRARE(sstr);
10236 BmUSEFUL(dstr) = BmUSEFUL(sstr);
10237 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
10240 SvANY(dstr) = new_XPVLV();
10241 SvCUR(dstr) = SvCUR(sstr);
10242 SvLEN(dstr) = SvLEN(sstr);
10243 SvIVX(dstr) = SvIVX(sstr);
10244 SvNVX(dstr) = SvNVX(sstr);
10245 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10246 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10247 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10248 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
10249 LvTARGLEN(dstr) = LvTARGLEN(sstr);
10250 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
10251 LvTARG(dstr) = dstr;
10252 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
10253 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
10255 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
10256 LvTYPE(dstr) = LvTYPE(sstr);
10259 if (GvUNIQUE((GV*)sstr)) {
10261 if ((share = gv_share(sstr, param))) {
10264 ptr_table_store(PL_ptr_table, sstr, dstr);
10266 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
10267 HvNAME(GvSTASH(share)), GvNAME(share));
10272 SvANY(dstr) = new_XPVGV();
10273 SvCUR(dstr) = SvCUR(sstr);
10274 SvLEN(dstr) = SvLEN(sstr);
10275 SvIVX(dstr) = SvIVX(sstr);
10276 SvNVX(dstr) = SvNVX(sstr);
10277 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10278 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10279 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10280 GvNAMELEN(dstr) = GvNAMELEN(sstr);
10281 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
10282 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
10283 GvFLAGS(dstr) = GvFLAGS(sstr);
10284 GvGP(dstr) = gp_dup(GvGP(sstr), param);
10285 (void)GpREFCNT_inc(GvGP(dstr));
10288 SvANY(dstr) = new_XPVIO();
10289 SvCUR(dstr) = SvCUR(sstr);
10290 SvLEN(dstr) = SvLEN(sstr);
10291 SvIVX(dstr) = SvIVX(sstr);
10292 SvNVX(dstr) = SvNVX(sstr);
10293 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10294 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10295 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10296 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
10297 if (IoOFP(sstr) == IoIFP(sstr))
10298 IoOFP(dstr) = IoIFP(dstr);
10300 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
10301 /* PL_rsfp_filters entries have fake IoDIRP() */
10302 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
10303 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
10305 IoDIRP(dstr) = IoDIRP(sstr);
10306 IoLINES(dstr) = IoLINES(sstr);
10307 IoPAGE(dstr) = IoPAGE(sstr);
10308 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
10309 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
10310 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
10311 /* I have no idea why fake dirp (rsfps)
10312 should be treaded differently but otherwise
10313 we end up with leaks -- sky*/
10314 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
10315 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
10316 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
10318 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
10319 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
10320 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
10322 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
10323 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
10324 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
10325 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
10326 IoTYPE(dstr) = IoTYPE(sstr);
10327 IoFLAGS(dstr) = IoFLAGS(sstr);
10330 SvANY(dstr) = new_XPVAV();
10331 SvCUR(dstr) = SvCUR(sstr);
10332 SvLEN(dstr) = SvLEN(sstr);
10333 SvIVX(dstr) = SvIVX(sstr);
10334 SvNVX(dstr) = SvNVX(sstr);
10335 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10336 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10337 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
10338 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
10339 if (AvARRAY((AV*)sstr)) {
10340 SV **dst_ary, **src_ary;
10341 SSize_t items = AvFILLp((AV*)sstr) + 1;
10343 src_ary = AvARRAY((AV*)sstr);
10344 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
10345 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
10346 SvPVX(dstr) = (char*)dst_ary;
10347 AvALLOC((AV*)dstr) = dst_ary;
10348 if (AvREAL((AV*)sstr)) {
10349 while (items-- > 0)
10350 *dst_ary++ = sv_dup_inc(*src_ary++, param);
10353 while (items-- > 0)
10354 *dst_ary++ = sv_dup(*src_ary++, param);
10356 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
10357 while (items-- > 0) {
10358 *dst_ary++ = &PL_sv_undef;
10362 SvPVX(dstr) = Nullch;
10363 AvALLOC((AV*)dstr) = (SV**)NULL;
10367 SvANY(dstr) = new_XPVHV();
10368 SvCUR(dstr) = SvCUR(sstr);
10369 SvLEN(dstr) = SvLEN(sstr);
10370 SvIVX(dstr) = SvIVX(sstr);
10371 SvNVX(dstr) = SvNVX(sstr);
10372 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10373 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10374 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
10375 if (HvARRAY((HV*)sstr)) {
10377 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
10378 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
10379 Newz(0, dxhv->xhv_array,
10380 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
10381 while (i <= sxhv->xhv_max) {
10382 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
10383 (bool)!!HvSHAREKEYS(sstr),
10387 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
10388 (bool)!!HvSHAREKEYS(sstr), param);
10391 SvPVX(dstr) = Nullch;
10392 HvEITER((HV*)dstr) = (HE*)NULL;
10394 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
10395 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
10396 /* Record stashes for possible cloning in Perl_clone(). */
10397 if(HvNAME((HV*)dstr))
10398 av_push(param->stashes, dstr);
10401 SvANY(dstr) = new_XPVFM();
10402 FmLINES(dstr) = FmLINES(sstr);
10406 SvANY(dstr) = new_XPVCV();
10408 SvCUR(dstr) = SvCUR(sstr);
10409 SvLEN(dstr) = SvLEN(sstr);
10410 SvIVX(dstr) = SvIVX(sstr);
10411 SvNVX(dstr) = SvNVX(sstr);
10412 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
10413 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
10414 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
10415 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
10416 CvSTART(dstr) = CvSTART(sstr);
10417 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
10418 CvXSUB(dstr) = CvXSUB(sstr);
10419 CvXSUBANY(dstr) = CvXSUBANY(sstr);
10420 if (CvCONST(sstr)) {
10421 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
10422 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
10423 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
10425 /* don't dup if copying back - CvGV isn't refcounted, so the
10426 * duped GV may never be freed. A bit of a hack! DAPM */
10427 CvGV(dstr) = (param->flags & CLONEf_JOIN_IN) ?
10428 Nullgv : gv_dup(CvGV(sstr), param) ;
10429 if (param->flags & CLONEf_COPY_STACKS) {
10430 CvDEPTH(dstr) = CvDEPTH(sstr);
10434 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
10435 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
10437 CvWEAKOUTSIDE(sstr)
10438 ? cv_dup( CvOUTSIDE(sstr), param)
10439 : cv_dup_inc(CvOUTSIDE(sstr), param);
10440 CvFLAGS(dstr) = CvFLAGS(sstr);
10441 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
10444 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
10448 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
10454 /* duplicate a context */
10457 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
10459 PERL_CONTEXT *ncxs;
10462 return (PERL_CONTEXT*)NULL;
10464 /* look for it in the table first */
10465 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
10469 /* create anew and remember what it is */
10470 Newz(56, ncxs, max + 1, PERL_CONTEXT);
10471 ptr_table_store(PL_ptr_table, cxs, ncxs);
10474 PERL_CONTEXT *cx = &cxs[ix];
10475 PERL_CONTEXT *ncx = &ncxs[ix];
10476 ncx->cx_type = cx->cx_type;
10477 if (CxTYPE(cx) == CXt_SUBST) {
10478 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
10481 ncx->blk_oldsp = cx->blk_oldsp;
10482 ncx->blk_oldcop = cx->blk_oldcop;
10483 ncx->blk_oldretsp = cx->blk_oldretsp;
10484 ncx->blk_oldmarksp = cx->blk_oldmarksp;
10485 ncx->blk_oldscopesp = cx->blk_oldscopesp;
10486 ncx->blk_oldpm = cx->blk_oldpm;
10487 ncx->blk_gimme = cx->blk_gimme;
10488 switch (CxTYPE(cx)) {
10490 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
10491 ? cv_dup_inc(cx->blk_sub.cv, param)
10492 : cv_dup(cx->blk_sub.cv,param));
10493 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
10494 ? av_dup_inc(cx->blk_sub.argarray, param)
10496 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
10497 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
10498 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10499 ncx->blk_sub.lval = cx->blk_sub.lval;
10502 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
10503 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
10504 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
10505 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
10506 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
10509 ncx->blk_loop.label = cx->blk_loop.label;
10510 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
10511 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
10512 ncx->blk_loop.next_op = cx->blk_loop.next_op;
10513 ncx->blk_loop.last_op = cx->blk_loop.last_op;
10514 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
10515 ? cx->blk_loop.iterdata
10516 : gv_dup((GV*)cx->blk_loop.iterdata, param));
10517 ncx->blk_loop.oldcomppad
10518 = (PAD*)ptr_table_fetch(PL_ptr_table,
10519 cx->blk_loop.oldcomppad);
10520 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10521 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10522 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10523 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10524 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10527 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10528 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10529 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10530 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10542 /* duplicate a stack info structure */
10545 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10550 return (PERL_SI*)NULL;
10552 /* look for it in the table first */
10553 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10557 /* create anew and remember what it is */
10558 Newz(56, nsi, 1, PERL_SI);
10559 ptr_table_store(PL_ptr_table, si, nsi);
10561 nsi->si_stack = av_dup_inc(si->si_stack, param);
10562 nsi->si_cxix = si->si_cxix;
10563 nsi->si_cxmax = si->si_cxmax;
10564 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10565 nsi->si_type = si->si_type;
10566 nsi->si_prev = si_dup(si->si_prev, param);
10567 nsi->si_next = si_dup(si->si_next, param);
10568 nsi->si_markoff = si->si_markoff;
10573 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10574 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10575 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10576 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10577 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10578 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10579 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10580 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10581 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10582 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10583 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10584 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10585 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10586 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10589 #define pv_dup_inc(p) SAVEPV(p)
10590 #define pv_dup(p) SAVEPV(p)
10591 #define svp_dup_inc(p,pp) any_dup(p,pp)
10593 /* map any object to the new equivent - either something in the
10594 * ptr table, or something in the interpreter structure
10598 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10603 return (void*)NULL;
10605 /* look for it in the table first */
10606 ret = ptr_table_fetch(PL_ptr_table, v);
10610 /* see if it is part of the interpreter structure */
10611 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10612 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10620 /* duplicate the save stack */
10623 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10625 ANY *ss = proto_perl->Tsavestack;
10626 I32 ix = proto_perl->Tsavestack_ix;
10627 I32 max = proto_perl->Tsavestack_max;
10640 void (*dptr) (void*);
10641 void (*dxptr) (pTHX_ void*);
10644 Newz(54, nss, max, ANY);
10648 TOPINT(nss,ix) = i;
10650 case SAVEt_ITEM: /* normal string */
10651 sv = (SV*)POPPTR(ss,ix);
10652 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10653 sv = (SV*)POPPTR(ss,ix);
10654 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10656 case SAVEt_SV: /* scalar reference */
10657 sv = (SV*)POPPTR(ss,ix);
10658 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10659 gv = (GV*)POPPTR(ss,ix);
10660 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10662 case SAVEt_GENERIC_PVREF: /* generic char* */
10663 c = (char*)POPPTR(ss,ix);
10664 TOPPTR(nss,ix) = pv_dup(c);
10665 ptr = POPPTR(ss,ix);
10666 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10668 case SAVEt_SHARED_PVREF: /* char* in shared space */
10669 c = (char*)POPPTR(ss,ix);
10670 TOPPTR(nss,ix) = savesharedpv(c);
10671 ptr = POPPTR(ss,ix);
10672 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10674 case SAVEt_GENERIC_SVREF: /* generic sv */
10675 case SAVEt_SVREF: /* scalar reference */
10676 sv = (SV*)POPPTR(ss,ix);
10677 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10678 ptr = POPPTR(ss,ix);
10679 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10681 case SAVEt_AV: /* array reference */
10682 av = (AV*)POPPTR(ss,ix);
10683 TOPPTR(nss,ix) = av_dup_inc(av, param);
10684 gv = (GV*)POPPTR(ss,ix);
10685 TOPPTR(nss,ix) = gv_dup(gv, param);
10687 case SAVEt_HV: /* hash reference */
10688 hv = (HV*)POPPTR(ss,ix);
10689 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10690 gv = (GV*)POPPTR(ss,ix);
10691 TOPPTR(nss,ix) = gv_dup(gv, param);
10693 case SAVEt_INT: /* int reference */
10694 ptr = POPPTR(ss,ix);
10695 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10696 intval = (int)POPINT(ss,ix);
10697 TOPINT(nss,ix) = intval;
10699 case SAVEt_LONG: /* long reference */
10700 ptr = POPPTR(ss,ix);
10701 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10702 longval = (long)POPLONG(ss,ix);
10703 TOPLONG(nss,ix) = longval;
10705 case SAVEt_I32: /* I32 reference */
10706 case SAVEt_I16: /* I16 reference */
10707 case SAVEt_I8: /* I8 reference */
10708 ptr = POPPTR(ss,ix);
10709 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10711 TOPINT(nss,ix) = i;
10713 case SAVEt_IV: /* IV reference */
10714 ptr = POPPTR(ss,ix);
10715 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10717 TOPIV(nss,ix) = iv;
10719 case SAVEt_SPTR: /* SV* reference */
10720 ptr = POPPTR(ss,ix);
10721 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10722 sv = (SV*)POPPTR(ss,ix);
10723 TOPPTR(nss,ix) = sv_dup(sv, param);
10725 case SAVEt_VPTR: /* random* reference */
10726 ptr = POPPTR(ss,ix);
10727 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10728 ptr = POPPTR(ss,ix);
10729 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10731 case SAVEt_PPTR: /* char* reference */
10732 ptr = POPPTR(ss,ix);
10733 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10734 c = (char*)POPPTR(ss,ix);
10735 TOPPTR(nss,ix) = pv_dup(c);
10737 case SAVEt_HPTR: /* HV* reference */
10738 ptr = POPPTR(ss,ix);
10739 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10740 hv = (HV*)POPPTR(ss,ix);
10741 TOPPTR(nss,ix) = hv_dup(hv, param);
10743 case SAVEt_APTR: /* AV* reference */
10744 ptr = POPPTR(ss,ix);
10745 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10746 av = (AV*)POPPTR(ss,ix);
10747 TOPPTR(nss,ix) = av_dup(av, param);
10750 gv = (GV*)POPPTR(ss,ix);
10751 TOPPTR(nss,ix) = gv_dup(gv, param);
10753 case SAVEt_GP: /* scalar reference */
10754 gp = (GP*)POPPTR(ss,ix);
10755 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10756 (void)GpREFCNT_inc(gp);
10757 gv = (GV*)POPPTR(ss,ix);
10758 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10759 c = (char*)POPPTR(ss,ix);
10760 TOPPTR(nss,ix) = pv_dup(c);
10762 TOPIV(nss,ix) = iv;
10764 TOPIV(nss,ix) = iv;
10767 case SAVEt_MORTALIZESV:
10768 sv = (SV*)POPPTR(ss,ix);
10769 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10772 ptr = POPPTR(ss,ix);
10773 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10774 /* these are assumed to be refcounted properly */
10775 switch (((OP*)ptr)->op_type) {
10777 case OP_LEAVESUBLV:
10781 case OP_LEAVEWRITE:
10782 TOPPTR(nss,ix) = ptr;
10787 TOPPTR(nss,ix) = Nullop;
10792 TOPPTR(nss,ix) = Nullop;
10795 c = (char*)POPPTR(ss,ix);
10796 TOPPTR(nss,ix) = pv_dup_inc(c);
10798 case SAVEt_CLEARSV:
10799 longval = POPLONG(ss,ix);
10800 TOPLONG(nss,ix) = longval;
10803 hv = (HV*)POPPTR(ss,ix);
10804 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10805 c = (char*)POPPTR(ss,ix);
10806 TOPPTR(nss,ix) = pv_dup_inc(c);
10808 TOPINT(nss,ix) = i;
10810 case SAVEt_DESTRUCTOR:
10811 ptr = POPPTR(ss,ix);
10812 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10813 dptr = POPDPTR(ss,ix);
10814 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
10816 case SAVEt_DESTRUCTOR_X:
10817 ptr = POPPTR(ss,ix);
10818 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10819 dxptr = POPDXPTR(ss,ix);
10820 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
10822 case SAVEt_REGCONTEXT:
10825 TOPINT(nss,ix) = i;
10828 case SAVEt_STACK_POS: /* Position on Perl stack */
10830 TOPINT(nss,ix) = i;
10832 case SAVEt_AELEM: /* array element */
10833 sv = (SV*)POPPTR(ss,ix);
10834 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10836 TOPINT(nss,ix) = i;
10837 av = (AV*)POPPTR(ss,ix);
10838 TOPPTR(nss,ix) = av_dup_inc(av, param);
10840 case SAVEt_HELEM: /* hash element */
10841 sv = (SV*)POPPTR(ss,ix);
10842 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10843 sv = (SV*)POPPTR(ss,ix);
10844 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10845 hv = (HV*)POPPTR(ss,ix);
10846 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10849 ptr = POPPTR(ss,ix);
10850 TOPPTR(nss,ix) = ptr;
10854 TOPINT(nss,ix) = i;
10856 case SAVEt_COMPPAD:
10857 av = (AV*)POPPTR(ss,ix);
10858 TOPPTR(nss,ix) = av_dup(av, param);
10861 longval = (long)POPLONG(ss,ix);
10862 TOPLONG(nss,ix) = longval;
10863 ptr = POPPTR(ss,ix);
10864 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10865 sv = (SV*)POPPTR(ss,ix);
10866 TOPPTR(nss,ix) = sv_dup(sv, param);
10869 ptr = POPPTR(ss,ix);
10870 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10871 longval = (long)POPBOOL(ss,ix);
10872 TOPBOOL(nss,ix) = (bool)longval;
10874 case SAVEt_SET_SVFLAGS:
10876 TOPINT(nss,ix) = i;
10878 TOPINT(nss,ix) = i;
10879 sv = (SV*)POPPTR(ss,ix);
10880 TOPPTR(nss,ix) = sv_dup(sv, param);
10883 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10891 =for apidoc perl_clone
10893 Create and return a new interpreter by cloning the current one.
10895 perl_clone takes these flags as parameters:
10897 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10898 without it we only clone the data and zero the stacks,
10899 with it we copy the stacks and the new perl interpreter is
10900 ready to run at the exact same point as the previous one.
10901 The pseudo-fork code uses COPY_STACKS while the
10902 threads->new doesn't.
10904 CLONEf_KEEP_PTR_TABLE
10905 perl_clone keeps a ptr_table with the pointer of the old
10906 variable as a key and the new variable as a value,
10907 this allows it to check if something has been cloned and not
10908 clone it again but rather just use the value and increase the
10909 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10910 the ptr_table using the function
10911 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10912 reason to keep it around is if you want to dup some of your own
10913 variable who are outside the graph perl scans, example of this
10914 code is in threads.xs create
10917 This is a win32 thing, it is ignored on unix, it tells perls
10918 win32host code (which is c++) to clone itself, this is needed on
10919 win32 if you want to run two threads at the same time,
10920 if you just want to do some stuff in a separate perl interpreter
10921 and then throw it away and return to the original one,
10922 you don't need to do anything.
10927 /* XXX the above needs expanding by someone who actually understands it ! */
10928 EXTERN_C PerlInterpreter *
10929 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10932 perl_clone(PerlInterpreter *proto_perl, UV flags)
10934 #ifdef PERL_IMPLICIT_SYS
10936 /* perlhost.h so we need to call into it
10937 to clone the host, CPerlHost should have a c interface, sky */
10939 if (flags & CLONEf_CLONE_HOST) {
10940 return perl_clone_host(proto_perl,flags);
10942 return perl_clone_using(proto_perl, flags,
10944 proto_perl->IMemShared,
10945 proto_perl->IMemParse,
10947 proto_perl->IStdIO,
10951 proto_perl->IProc);
10955 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10956 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10957 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10958 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10959 struct IPerlDir* ipD, struct IPerlSock* ipS,
10960 struct IPerlProc* ipP)
10962 /* XXX many of the string copies here can be optimized if they're
10963 * constants; they need to be allocated as common memory and just
10964 * their pointers copied. */
10967 CLONE_PARAMS clone_params;
10968 CLONE_PARAMS* param = &clone_params;
10970 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10971 PERL_SET_THX(my_perl);
10974 Poison(my_perl, 1, PerlInterpreter);
10978 PL_savestack_ix = 0;
10979 PL_savestack_max = -1;
10981 PL_sig_pending = 0;
10982 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10983 # else /* !DEBUGGING */
10984 Zero(my_perl, 1, PerlInterpreter);
10985 # endif /* DEBUGGING */
10987 /* host pointers */
10989 PL_MemShared = ipMS;
10990 PL_MemParse = ipMP;
10997 #else /* !PERL_IMPLICIT_SYS */
10999 CLONE_PARAMS clone_params;
11000 CLONE_PARAMS* param = &clone_params;
11001 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
11002 PERL_SET_THX(my_perl);
11007 Poison(my_perl, 1, PerlInterpreter);
11011 PL_savestack_ix = 0;
11012 PL_savestack_max = -1;
11014 PL_sig_pending = 0;
11015 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
11016 # else /* !DEBUGGING */
11017 Zero(my_perl, 1, PerlInterpreter);
11018 # endif /* DEBUGGING */
11019 #endif /* PERL_IMPLICIT_SYS */
11020 param->flags = flags;
11021 param->proto_perl = proto_perl;
11024 PL_xiv_arenaroot = NULL;
11025 PL_xiv_root = NULL;
11026 PL_xnv_arenaroot = NULL;
11027 PL_xnv_root = NULL;
11028 PL_xrv_arenaroot = NULL;
11029 PL_xrv_root = NULL;
11030 PL_xpv_arenaroot = NULL;
11031 PL_xpv_root = NULL;
11032 PL_xpviv_arenaroot = NULL;
11033 PL_xpviv_root = NULL;
11034 PL_xpvnv_arenaroot = NULL;
11035 PL_xpvnv_root = NULL;
11036 PL_xpvcv_arenaroot = NULL;
11037 PL_xpvcv_root = NULL;
11038 PL_xpvav_arenaroot = NULL;
11039 PL_xpvav_root = NULL;
11040 PL_xpvhv_arenaroot = NULL;
11041 PL_xpvhv_root = NULL;
11042 PL_xpvmg_arenaroot = NULL;
11043 PL_xpvmg_root = NULL;
11044 PL_xpvlv_arenaroot = NULL;
11045 PL_xpvlv_root = NULL;
11046 PL_xpvbm_arenaroot = NULL;
11047 PL_xpvbm_root = NULL;
11048 PL_he_arenaroot = NULL;
11050 PL_nice_chunk = NULL;
11051 PL_nice_chunk_size = 0;
11053 PL_sv_objcount = 0;
11054 PL_sv_root = Nullsv;
11055 PL_sv_arenaroot = Nullsv;
11057 PL_debug = proto_perl->Idebug;
11059 #ifdef USE_REENTRANT_API
11060 /* XXX: things like -Dm will segfault here in perlio, but doing
11061 * PERL_SET_CONTEXT(proto_perl);
11062 * breaks too many other things
11064 Perl_reentrant_init(aTHX);
11067 /* create SV map for pointer relocation */
11068 PL_ptr_table = ptr_table_new();
11070 /* initialize these special pointers as early as possible */
11071 SvANY(&PL_sv_undef) = NULL;
11072 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
11073 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
11074 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
11076 SvANY(&PL_sv_no) = new_XPVNV();
11077 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
11078 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11079 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
11080 SvCUR(&PL_sv_no) = 0;
11081 SvLEN(&PL_sv_no) = 1;
11082 SvNVX(&PL_sv_no) = 0;
11083 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
11085 SvANY(&PL_sv_yes) = new_XPVNV();
11086 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
11087 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
11088 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
11089 SvCUR(&PL_sv_yes) = 1;
11090 SvLEN(&PL_sv_yes) = 2;
11091 SvNVX(&PL_sv_yes) = 1;
11092 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
11094 /* create (a non-shared!) shared string table */
11095 PL_strtab = newHV();
11096 HvSHAREKEYS_off(PL_strtab);
11097 hv_ksplit(PL_strtab, 512);
11098 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
11100 PL_compiling = proto_perl->Icompiling;
11102 /* These two PVs will be free'd special way so must set them same way op.c does */
11103 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
11104 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
11106 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
11107 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
11109 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
11110 if (!specialWARN(PL_compiling.cop_warnings))
11111 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
11112 if (!specialCopIO(PL_compiling.cop_io))
11113 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
11114 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
11116 /* pseudo environmental stuff */
11117 PL_origargc = proto_perl->Iorigargc;
11118 PL_origargv = proto_perl->Iorigargv;
11120 param->stashes = newAV(); /* Setup array of objects to call clone on */
11122 #ifdef PERLIO_LAYERS
11123 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
11124 PerlIO_clone(aTHX_ proto_perl, param);
11127 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
11128 PL_incgv = gv_dup(proto_perl->Iincgv, param);
11129 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
11130 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
11131 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
11132 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
11135 PL_minus_c = proto_perl->Iminus_c;
11136 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
11137 PL_localpatches = proto_perl->Ilocalpatches;
11138 PL_splitstr = proto_perl->Isplitstr;
11139 PL_preprocess = proto_perl->Ipreprocess;
11140 PL_minus_n = proto_perl->Iminus_n;
11141 PL_minus_p = proto_perl->Iminus_p;
11142 PL_minus_l = proto_perl->Iminus_l;
11143 PL_minus_a = proto_perl->Iminus_a;
11144 PL_minus_F = proto_perl->Iminus_F;
11145 PL_doswitches = proto_perl->Idoswitches;
11146 PL_dowarn = proto_perl->Idowarn;
11147 PL_doextract = proto_perl->Idoextract;
11148 PL_sawampersand = proto_perl->Isawampersand;
11149 PL_unsafe = proto_perl->Iunsafe;
11150 PL_inplace = SAVEPV(proto_perl->Iinplace);
11151 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
11152 PL_perldb = proto_perl->Iperldb;
11153 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
11154 PL_exit_flags = proto_perl->Iexit_flags;
11156 /* magical thingies */
11157 /* XXX time(&PL_basetime) when asked for? */
11158 PL_basetime = proto_perl->Ibasetime;
11159 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
11161 PL_maxsysfd = proto_perl->Imaxsysfd;
11162 PL_multiline = proto_perl->Imultiline;
11163 PL_statusvalue = proto_perl->Istatusvalue;
11165 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
11167 PL_encoding = sv_dup(proto_perl->Iencoding, param);
11169 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
11170 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
11171 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
11173 /* Clone the regex array */
11174 PL_regex_padav = newAV();
11176 I32 len = av_len((AV*)proto_perl->Iregex_padav);
11177 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
11178 av_push(PL_regex_padav,
11179 sv_dup_inc(regexen[0],param));
11180 for(i = 1; i <= len; i++) {
11181 if(SvREPADTMP(regexen[i])) {
11182 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
11184 av_push(PL_regex_padav,
11186 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
11187 SvIVX(regexen[i])), param)))
11192 PL_regex_pad = AvARRAY(PL_regex_padav);
11194 /* shortcuts to various I/O objects */
11195 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
11196 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
11197 PL_defgv = gv_dup(proto_perl->Idefgv, param);
11198 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
11199 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
11200 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
11202 /* shortcuts to regexp stuff */
11203 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
11205 /* shortcuts to misc objects */
11206 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
11208 /* shortcuts to debugging objects */
11209 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
11210 PL_DBline = gv_dup(proto_perl->IDBline, param);
11211 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
11212 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
11213 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
11214 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
11215 PL_DBassertion = sv_dup(proto_perl->IDBassertion, param);
11216 PL_lineary = av_dup(proto_perl->Ilineary, param);
11217 PL_dbargs = av_dup(proto_perl->Idbargs, param);
11219 /* symbol tables */
11220 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
11221 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
11222 PL_debstash = hv_dup(proto_perl->Idebstash, param);
11223 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
11224 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
11226 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
11227 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
11228 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
11229 PL_endav = av_dup_inc(proto_perl->Iendav, param);
11230 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
11231 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
11233 PL_sub_generation = proto_perl->Isub_generation;
11235 /* funky return mechanisms */
11236 PL_forkprocess = proto_perl->Iforkprocess;
11238 /* subprocess state */
11239 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
11241 /* internal state */
11242 PL_tainting = proto_perl->Itainting;
11243 PL_taint_warn = proto_perl->Itaint_warn;
11244 PL_maxo = proto_perl->Imaxo;
11245 if (proto_perl->Iop_mask)
11246 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
11248 PL_op_mask = Nullch;
11249 /* PL_asserting = proto_perl->Iasserting; */
11251 /* current interpreter roots */
11252 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
11253 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
11254 PL_main_start = proto_perl->Imain_start;
11255 PL_eval_root = proto_perl->Ieval_root;
11256 PL_eval_start = proto_perl->Ieval_start;
11258 /* runtime control stuff */
11259 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
11260 PL_copline = proto_perl->Icopline;
11262 PL_filemode = proto_perl->Ifilemode;
11263 PL_lastfd = proto_perl->Ilastfd;
11264 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
11267 PL_gensym = proto_perl->Igensym;
11268 PL_preambled = proto_perl->Ipreambled;
11269 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
11270 PL_laststatval = proto_perl->Ilaststatval;
11271 PL_laststype = proto_perl->Ilaststype;
11272 PL_mess_sv = Nullsv;
11274 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
11275 PL_ofmt = SAVEPV(proto_perl->Iofmt);
11277 /* interpreter atexit processing */
11278 PL_exitlistlen = proto_perl->Iexitlistlen;
11279 if (PL_exitlistlen) {
11280 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11281 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
11284 PL_exitlist = (PerlExitListEntry*)NULL;
11285 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
11286 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
11287 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
11289 PL_profiledata = NULL;
11290 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
11291 /* PL_rsfp_filters entries have fake IoDIRP() */
11292 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
11294 PL_compcv = cv_dup(proto_perl->Icompcv, param);
11296 PAD_CLONE_VARS(proto_perl, param);
11298 #ifdef HAVE_INTERP_INTERN
11299 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
11302 /* more statics moved here */
11303 PL_generation = proto_perl->Igeneration;
11304 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
11306 PL_in_clean_objs = proto_perl->Iin_clean_objs;
11307 PL_in_clean_all = proto_perl->Iin_clean_all;
11309 PL_uid = proto_perl->Iuid;
11310 PL_euid = proto_perl->Ieuid;
11311 PL_gid = proto_perl->Igid;
11312 PL_egid = proto_perl->Iegid;
11313 PL_nomemok = proto_perl->Inomemok;
11314 PL_an = proto_perl->Ian;
11315 PL_evalseq = proto_perl->Ievalseq;
11316 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
11317 PL_origalen = proto_perl->Iorigalen;
11318 PL_pidstatus = newHV(); /* XXX flag for cloning? */
11319 PL_osname = SAVEPV(proto_perl->Iosname);
11320 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
11321 PL_sighandlerp = proto_perl->Isighandlerp;
11324 PL_runops = proto_perl->Irunops;
11326 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
11329 PL_cshlen = proto_perl->Icshlen;
11330 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
11333 PL_lex_state = proto_perl->Ilex_state;
11334 PL_lex_defer = proto_perl->Ilex_defer;
11335 PL_lex_expect = proto_perl->Ilex_expect;
11336 PL_lex_formbrack = proto_perl->Ilex_formbrack;
11337 PL_lex_dojoin = proto_perl->Ilex_dojoin;
11338 PL_lex_starts = proto_perl->Ilex_starts;
11339 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
11340 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
11341 PL_lex_op = proto_perl->Ilex_op;
11342 PL_lex_inpat = proto_perl->Ilex_inpat;
11343 PL_lex_inwhat = proto_perl->Ilex_inwhat;
11344 PL_lex_brackets = proto_perl->Ilex_brackets;
11345 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
11346 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
11347 PL_lex_casemods = proto_perl->Ilex_casemods;
11348 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
11349 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
11351 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
11352 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
11353 PL_nexttoke = proto_perl->Inexttoke;
11355 /* XXX This is probably masking the deeper issue of why
11356 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
11357 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
11358 * (A little debugging with a watchpoint on it may help.)
11360 if (SvANY(proto_perl->Ilinestr)) {
11361 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
11362 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
11363 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11364 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
11365 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11366 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
11367 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11368 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
11369 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11372 PL_linestr = NEWSV(65,79);
11373 sv_upgrade(PL_linestr,SVt_PVIV);
11374 sv_setpvn(PL_linestr,"",0);
11375 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
11377 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
11378 PL_pending_ident = proto_perl->Ipending_ident;
11379 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
11381 PL_expect = proto_perl->Iexpect;
11383 PL_multi_start = proto_perl->Imulti_start;
11384 PL_multi_end = proto_perl->Imulti_end;
11385 PL_multi_open = proto_perl->Imulti_open;
11386 PL_multi_close = proto_perl->Imulti_close;
11388 PL_error_count = proto_perl->Ierror_count;
11389 PL_subline = proto_perl->Isubline;
11390 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
11392 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
11393 if (SvANY(proto_perl->Ilinestr)) {
11394 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
11395 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11396 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
11397 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
11398 PL_last_lop_op = proto_perl->Ilast_lop_op;
11401 PL_last_uni = SvPVX(PL_linestr);
11402 PL_last_lop = SvPVX(PL_linestr);
11403 PL_last_lop_op = 0;
11405 PL_in_my = proto_perl->Iin_my;
11406 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
11408 PL_cryptseen = proto_perl->Icryptseen;
11411 PL_hints = proto_perl->Ihints;
11413 PL_amagic_generation = proto_perl->Iamagic_generation;
11415 #ifdef USE_LOCALE_COLLATE
11416 PL_collation_ix = proto_perl->Icollation_ix;
11417 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
11418 PL_collation_standard = proto_perl->Icollation_standard;
11419 PL_collxfrm_base = proto_perl->Icollxfrm_base;
11420 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
11421 #endif /* USE_LOCALE_COLLATE */
11423 #ifdef USE_LOCALE_NUMERIC
11424 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
11425 PL_numeric_standard = proto_perl->Inumeric_standard;
11426 PL_numeric_local = proto_perl->Inumeric_local;
11427 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
11428 #endif /* !USE_LOCALE_NUMERIC */
11430 /* utf8 character classes */
11431 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
11432 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
11433 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
11434 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
11435 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
11436 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
11437 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
11438 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
11439 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
11440 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
11441 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
11442 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
11443 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
11444 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
11445 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
11446 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
11447 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
11448 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
11449 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
11450 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
11452 /* Did the locale setup indicate UTF-8? */
11453 PL_utf8locale = proto_perl->Iutf8locale;
11454 /* Unicode features (see perlrun/-C) */
11455 PL_unicode = proto_perl->Iunicode;
11457 /* Pre-5.8 signals control */
11458 PL_signals = proto_perl->Isignals;
11460 /* times() ticks per second */
11461 PL_clocktick = proto_perl->Iclocktick;
11463 /* Recursion stopper for PerlIO_find_layer */
11464 PL_in_load_module = proto_perl->Iin_load_module;
11466 /* sort() routine */
11467 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
11469 /* Not really needed/useful since the reenrant_retint is "volatile",
11470 * but do it for consistency's sake. */
11471 PL_reentrant_retint = proto_perl->Ireentrant_retint;
11473 /* Hooks to shared SVs and locks. */
11474 PL_sharehook = proto_perl->Isharehook;
11475 PL_lockhook = proto_perl->Ilockhook;
11476 PL_unlockhook = proto_perl->Iunlockhook;
11477 PL_threadhook = proto_perl->Ithreadhook;
11479 PL_runops_std = proto_perl->Irunops_std;
11480 PL_runops_dbg = proto_perl->Irunops_dbg;
11482 #ifdef THREADS_HAVE_PIDS
11483 PL_ppid = proto_perl->Ippid;
11487 PL_last_swash_hv = Nullhv; /* reinits on demand */
11488 PL_last_swash_klen = 0;
11489 PL_last_swash_key[0]= '\0';
11490 PL_last_swash_tmps = (U8*)NULL;
11491 PL_last_swash_slen = 0;
11493 PL_glob_index = proto_perl->Iglob_index;
11494 PL_srand_called = proto_perl->Isrand_called;
11495 PL_hash_seed = proto_perl->Ihash_seed;
11496 PL_rehash_seed = proto_perl->Irehash_seed;
11497 PL_uudmap['M'] = 0; /* reinits on demand */
11498 PL_bitcount = Nullch; /* reinits on demand */
11500 if (proto_perl->Ipsig_pend) {
11501 Newz(0, PL_psig_pend, SIG_SIZE, int);
11504 PL_psig_pend = (int*)NULL;
11507 if (proto_perl->Ipsig_ptr) {
11508 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
11509 Newz(0, PL_psig_name, SIG_SIZE, SV*);
11510 for (i = 1; i < SIG_SIZE; i++) {
11511 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
11512 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
11516 PL_psig_ptr = (SV**)NULL;
11517 PL_psig_name = (SV**)NULL;
11520 /* thrdvar.h stuff */
11522 if (flags & CLONEf_COPY_STACKS) {
11523 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
11524 PL_tmps_ix = proto_perl->Ttmps_ix;
11525 PL_tmps_max = proto_perl->Ttmps_max;
11526 PL_tmps_floor = proto_perl->Ttmps_floor;
11527 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11529 while (i <= PL_tmps_ix) {
11530 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11534 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11535 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11536 Newz(54, PL_markstack, i, I32);
11537 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11538 - proto_perl->Tmarkstack);
11539 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11540 - proto_perl->Tmarkstack);
11541 Copy(proto_perl->Tmarkstack, PL_markstack,
11542 PL_markstack_ptr - PL_markstack + 1, I32);
11544 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11545 * NOTE: unlike the others! */
11546 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11547 PL_scopestack_max = proto_perl->Tscopestack_max;
11548 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11549 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11551 /* next push_return() sets PL_retstack[PL_retstack_ix]
11552 * NOTE: unlike the others! */
11553 PL_retstack_ix = proto_perl->Tretstack_ix;
11554 PL_retstack_max = proto_perl->Tretstack_max;
11555 Newz(54, PL_retstack, PL_retstack_max, OP*);
11556 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
11558 /* NOTE: si_dup() looks at PL_markstack */
11559 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11561 /* PL_curstack = PL_curstackinfo->si_stack; */
11562 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11563 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11565 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11566 PL_stack_base = AvARRAY(PL_curstack);
11567 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11568 - proto_perl->Tstack_base);
11569 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11571 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11572 * NOTE: unlike the others! */
11573 PL_savestack_ix = proto_perl->Tsavestack_ix;
11574 PL_savestack_max = proto_perl->Tsavestack_max;
11575 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11576 PL_savestack = ss_dup(proto_perl, param);
11580 ENTER; /* perl_destruct() wants to LEAVE; */
11583 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11584 PL_top_env = &PL_start_env;
11586 PL_op = proto_perl->Top;
11589 PL_Xpv = (XPV*)NULL;
11590 PL_na = proto_perl->Tna;
11592 PL_statbuf = proto_perl->Tstatbuf;
11593 PL_statcache = proto_perl->Tstatcache;
11594 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11595 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11597 PL_timesbuf = proto_perl->Ttimesbuf;
11600 PL_tainted = proto_perl->Ttainted;
11601 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11602 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11603 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11604 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11605 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11606 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11607 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11608 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11609 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11611 PL_restartop = proto_perl->Trestartop;
11612 PL_in_eval = proto_perl->Tin_eval;
11613 PL_delaymagic = proto_perl->Tdelaymagic;
11614 PL_dirty = proto_perl->Tdirty;
11615 PL_localizing = proto_perl->Tlocalizing;
11617 #ifdef PERL_FLEXIBLE_EXCEPTIONS
11618 PL_protect = proto_perl->Tprotect;
11620 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11621 PL_hv_fetch_ent_mh = Nullhe;
11622 PL_modcount = proto_perl->Tmodcount;
11623 PL_lastgotoprobe = Nullop;
11624 PL_dumpindent = proto_perl->Tdumpindent;
11626 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11627 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11628 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11629 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11630 PL_sortcxix = proto_perl->Tsortcxix;
11631 PL_efloatbuf = Nullch; /* reinits on demand */
11632 PL_efloatsize = 0; /* reinits on demand */
11636 PL_screamfirst = NULL;
11637 PL_screamnext = NULL;
11638 PL_maxscream = -1; /* reinits on demand */
11639 PL_lastscream = Nullsv;
11641 PL_watchaddr = NULL;
11642 PL_watchok = Nullch;
11644 PL_regdummy = proto_perl->Tregdummy;
11645 PL_regprecomp = Nullch;
11648 PL_colorset = 0; /* reinits PL_colors[] */
11649 /*PL_colors[6] = {0,0,0,0,0,0};*/
11650 PL_reginput = Nullch;
11651 PL_regbol = Nullch;
11652 PL_regeol = Nullch;
11653 PL_regstartp = (I32*)NULL;
11654 PL_regendp = (I32*)NULL;
11655 PL_reglastparen = (U32*)NULL;
11656 PL_reglastcloseparen = (U32*)NULL;
11657 PL_regtill = Nullch;
11658 PL_reg_start_tmp = (char**)NULL;
11659 PL_reg_start_tmpl = 0;
11660 PL_regdata = (struct reg_data*)NULL;
11663 PL_reg_eval_set = 0;
11665 PL_regprogram = (regnode*)NULL;
11667 PL_regcc = (CURCUR*)NULL;
11668 PL_reg_call_cc = (struct re_cc_state*)NULL;
11669 PL_reg_re = (regexp*)NULL;
11670 PL_reg_ganch = Nullch;
11671 PL_reg_sv = Nullsv;
11672 PL_reg_match_utf8 = FALSE;
11673 PL_reg_magic = (MAGIC*)NULL;
11675 PL_reg_oldcurpm = (PMOP*)NULL;
11676 PL_reg_curpm = (PMOP*)NULL;
11677 PL_reg_oldsaved = Nullch;
11678 PL_reg_oldsavedlen = 0;
11679 #ifdef PERL_COPY_ON_WRITE
11682 PL_reg_maxiter = 0;
11683 PL_reg_leftiter = 0;
11684 PL_reg_poscache = Nullch;
11685 PL_reg_poscache_size= 0;
11687 /* RE engine - function pointers */
11688 PL_regcompp = proto_perl->Tregcompp;
11689 PL_regexecp = proto_perl->Tregexecp;
11690 PL_regint_start = proto_perl->Tregint_start;
11691 PL_regint_string = proto_perl->Tregint_string;
11692 PL_regfree = proto_perl->Tregfree;
11694 PL_reginterp_cnt = 0;
11695 PL_reg_starttry = 0;
11697 /* Pluggable optimizer */
11698 PL_peepp = proto_perl->Tpeepp;
11700 PL_stashcache = newHV();
11702 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11703 ptr_table_free(PL_ptr_table);
11704 PL_ptr_table = NULL;
11707 /* Call the ->CLONE method, if it exists, for each of the stashes
11708 identified by sv_dup() above.
11710 while(av_len(param->stashes) != -1) {
11711 HV* stash = (HV*) av_shift(param->stashes);
11712 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11713 if (cloner && GvCV(cloner)) {
11718 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
11720 call_sv((SV*)GvCV(cloner), G_DISCARD);
11726 SvREFCNT_dec(param->stashes);
11731 #endif /* USE_ITHREADS */
11734 =head1 Unicode Support
11736 =for apidoc sv_recode_to_utf8
11738 The encoding is assumed to be an Encode object, on entry the PV
11739 of the sv is assumed to be octets in that encoding, and the sv
11740 will be converted into Unicode (and UTF-8).
11742 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11743 is not a reference, nothing is done to the sv. If the encoding is not
11744 an C<Encode::XS> Encoding object, bad things will happen.
11745 (See F<lib/encoding.pm> and L<Encode>).
11747 The PV of the sv is returned.
11752 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11754 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11768 Passing sv_yes is wrong - it needs to be or'ed set of constants
11769 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11770 remove converted chars from source.
11772 Both will default the value - let them.
11774 XPUSHs(&PL_sv_yes);
11777 call_method("decode", G_SCALAR);
11781 s = SvPV(uni, len);
11782 if (s != SvPVX(sv)) {
11783 SvGROW(sv, len + 1);
11784 Move(s, SvPVX(sv), len, char);
11785 SvCUR_set(sv, len);
11786 SvPVX(sv)[len] = 0;
11796 =for apidoc sv_cat_decode
11798 The encoding is assumed to be an Encode object, the PV of the ssv is
11799 assumed to be octets in that encoding and decoding the input starts
11800 from the position which (PV + *offset) pointed to. The dsv will be
11801 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11802 when the string tstr appears in decoding output or the input ends on
11803 the PV of the ssv. The value which the offset points will be modified
11804 to the last input position on the ssv.
11806 Returns TRUE if the terminator was found, else returns FALSE.
11811 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11812 SV *ssv, int *offset, char *tstr, int tlen)
11815 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11826 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11827 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11829 call_method("cat_decode", G_SCALAR);
11831 ret = SvTRUE(TOPs);
11832 *offset = SvIV(offsv);
11838 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");