3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 * 2000, 2001, 2002, 2003, 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 /* ============================================================================
29 =head1 Allocation and deallocation of SVs.
31 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
32 av, hv...) contains type and reference count information, as well as a
33 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
34 specific to each type.
36 Normally, this allocation is done using arenas, which are approximately
37 1K chunks of memory parcelled up into N heads or bodies. The first slot
38 in each arena is reserved, and is used to hold a link to the next arena.
39 In the case of heads, the unused first slot also contains some flags and
40 a note of the number of slots. Snaked through each arena chain is a
41 linked list of free items; when this becomes empty, an extra arena is
42 allocated and divided up into N items which are threaded into the free
45 The following global variables are associated with arenas:
47 PL_sv_arenaroot pointer to list of SV arenas
48 PL_sv_root pointer to list of free SV structures
50 PL_foo_arenaroot pointer to list of foo arenas,
51 PL_foo_root pointer to list of free foo bodies
52 ... for foo in xiv, xnv, xrv, xpv etc.
54 Note that some of the larger and more rarely used body types (eg xpvio)
55 are not allocated using arenas, but are instead just malloc()/free()ed as
56 required. Also, if PURIFY is defined, arenas are abandoned altogether,
57 with all items individually malloc()ed. In addition, a few SV heads are
58 not allocated from an arena, but are instead directly created as static
59 or auto variables, eg PL_sv_undef.
61 The SV arena serves the secondary purpose of allowing still-live SVs
62 to be located and destroyed during final cleanup.
64 At the lowest level, the macros new_SV() and del_SV() grab and free
65 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
66 to return the SV to the free list with error checking.) new_SV() calls
67 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
68 SVs in the free list have their SvTYPE field set to all ones.
70 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
71 that allocate and return individual body types. Normally these are mapped
72 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
73 instead mapped directly to malloc()/free() if PURIFY is defined. The
74 new/del functions remove from, or add to, the appropriate PL_foo_root
75 list, and call more_xiv() etc to add a new arena if the list is empty.
77 At the time of very final cleanup, sv_free_arenas() is called from
78 perl_destruct() to physically free all the arenas allocated since the
79 start of the interpreter. Note that this also clears PL_he_arenaroot,
80 which is otherwise dealt with in hv.c.
82 Manipulation of any of the PL_*root pointers is protected by enclosing
83 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
84 if threads are enabled.
86 The function visit() scans the SV arenas list, and calls a specified
87 function for each SV it finds which is still live - ie which has an SvTYPE
88 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
89 following functions (specified as [function that calls visit()] / [function
90 called by visit() for each SV]):
92 sv_report_used() / do_report_used()
93 dump all remaining SVs (debugging aid)
95 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
96 Attempt to free all objects pointed to by RVs,
97 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
98 try to do the same for all objects indirectly
99 referenced by typeglobs too. Called once from
100 perl_destruct(), prior to calling sv_clean_all()
103 sv_clean_all() / do_clean_all()
104 SvREFCNT_dec(sv) each remaining SV, possibly
105 triggering an sv_free(). It also sets the
106 SVf_BREAK flag on the SV to indicate that the
107 refcnt has been artificially lowered, and thus
108 stopping sv_free() from giving spurious warnings
109 about SVs which unexpectedly have a refcnt
110 of zero. called repeatedly from perl_destruct()
111 until there are no SVs left.
115 Private API to rest of sv.c
119 new_XIV(), del_XIV(),
120 new_XNV(), del_XNV(),
125 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
130 ============================================================================ */
135 * "A time to plant, and a time to uproot what was planted..."
138 #define plant_SV(p) \
140 SvANY(p) = (void *)PL_sv_root; \
141 SvFLAGS(p) = SVTYPEMASK; \
146 /* sv_mutex must be held while calling uproot_SV() */
147 #define uproot_SV(p) \
150 PL_sv_root = (SV*)SvANY(p); \
155 /* new_SV(): return a new, empty SV head */
157 #ifdef DEBUG_LEAKING_SCALARS
158 /* provide a real function for a debugger to play with */
175 # define new_SV(p) (p)=S_new_SV(aTHX)
193 /* del_SV(): return an empty SV head to the free list */
208 S_del_sv(pTHX_ SV *p)
215 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
217 svend = &sva[SvREFCNT(sva)];
218 if (p >= sv && p < svend)
222 if (ckWARN_d(WARN_INTERNAL))
223 Perl_warner(aTHX_ packWARN(WARN_INTERNAL),
224 "Attempt to free non-arena SV: 0x%"UVxf,
232 #else /* ! DEBUGGING */
234 #define del_SV(p) plant_SV(p)
236 #endif /* DEBUGGING */
240 =head1 SV Manipulation Functions
242 =for apidoc sv_add_arena
244 Given a chunk of memory, link it to the head of the list of arenas,
245 and split it into a list of free SVs.
251 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
256 Zero(ptr, size, char);
258 /* The first SV in an arena isn't an SV. */
259 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
260 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
261 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
263 PL_sv_arenaroot = sva;
264 PL_sv_root = sva + 1;
266 svend = &sva[SvREFCNT(sva) - 1];
269 SvANY(sv) = (void *)(SV*)(sv + 1);
270 SvFLAGS(sv) = SVTYPEMASK;
274 SvFLAGS(sv) = SVTYPEMASK;
277 /* make some more SVs by adding another arena */
279 /* sv_mutex must be held while calling more_sv() */
286 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
287 PL_nice_chunk = Nullch;
288 PL_nice_chunk_size = 0;
291 char *chunk; /* must use New here to match call to */
292 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
293 sv_add_arena(chunk, 1008, 0);
299 /* visit(): call the named function for each non-free SV in the arenas. */
302 S_visit(pTHX_ SVFUNC_t f)
309 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
310 svend = &sva[SvREFCNT(sva)];
311 for (sv = sva + 1; sv < svend; ++sv) {
312 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
323 /* called by sv_report_used() for each live SV */
326 do_report_used(pTHX_ SV *sv)
328 if (SvTYPE(sv) != SVTYPEMASK) {
329 PerlIO_printf(Perl_debug_log, "****\n");
336 =for apidoc sv_report_used
338 Dump the contents of all SVs not yet freed. (Debugging aid).
344 Perl_sv_report_used(pTHX)
347 visit(do_report_used);
351 /* called by sv_clean_objs() for each live SV */
354 do_clean_objs(pTHX_ SV *sv)
358 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
359 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
371 /* XXX Might want to check arrays, etc. */
374 /* called by sv_clean_objs() for each live SV */
376 #ifndef DISABLE_DESTRUCTOR_KLUDGE
378 do_clean_named_objs(pTHX_ SV *sv)
380 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
381 if ( SvOBJECT(GvSV(sv)) ||
382 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
383 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
384 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
385 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
387 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
395 =for apidoc sv_clean_objs
397 Attempt to destroy all objects not yet freed
403 Perl_sv_clean_objs(pTHX)
405 PL_in_clean_objs = TRUE;
406 visit(do_clean_objs);
407 #ifndef DISABLE_DESTRUCTOR_KLUDGE
408 /* some barnacles may yet remain, clinging to typeglobs */
409 visit(do_clean_named_objs);
411 PL_in_clean_objs = FALSE;
414 /* called by sv_clean_all() for each live SV */
417 do_clean_all(pTHX_ SV *sv)
419 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
420 SvFLAGS(sv) |= SVf_BREAK;
425 =for apidoc sv_clean_all
427 Decrement the refcnt of each remaining SV, possibly triggering a
428 cleanup. This function may have to be called multiple times to free
429 SVs which are in complex self-referential hierarchies.
435 Perl_sv_clean_all(pTHX)
438 PL_in_clean_all = TRUE;
439 cleaned = visit(do_clean_all);
440 PL_in_clean_all = FALSE;
445 =for apidoc sv_free_arenas
447 Deallocate the memory used by all arenas. Note that all the individual SV
448 heads and bodies within the arenas must already have been freed.
454 Perl_sv_free_arenas(pTHX)
458 XPV *arena, *arenanext;
460 /* Free arenas here, but be careful about fake ones. (We assume
461 contiguity of the fake ones with the corresponding real ones.) */
463 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
464 svanext = (SV*) SvANY(sva);
465 while (svanext && SvFAKE(svanext))
466 svanext = (SV*) SvANY(svanext);
469 Safefree((void *)sva);
472 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
473 arenanext = (XPV*)arena->xpv_pv;
476 PL_xiv_arenaroot = 0;
478 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
479 arenanext = (XPV*)arena->xpv_pv;
482 PL_xnv_arenaroot = 0;
484 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
485 arenanext = (XPV*)arena->xpv_pv;
488 PL_xrv_arenaroot = 0;
490 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
491 arenanext = (XPV*)arena->xpv_pv;
494 PL_xpv_arenaroot = 0;
496 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
497 arenanext = (XPV*)arena->xpv_pv;
500 PL_xpviv_arenaroot = 0;
502 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
503 arenanext = (XPV*)arena->xpv_pv;
506 PL_xpvnv_arenaroot = 0;
508 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
509 arenanext = (XPV*)arena->xpv_pv;
512 PL_xpvcv_arenaroot = 0;
514 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
515 arenanext = (XPV*)arena->xpv_pv;
518 PL_xpvav_arenaroot = 0;
520 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
521 arenanext = (XPV*)arena->xpv_pv;
524 PL_xpvhv_arenaroot = 0;
526 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
527 arenanext = (XPV*)arena->xpv_pv;
530 PL_xpvmg_arenaroot = 0;
532 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
533 arenanext = (XPV*)arena->xpv_pv;
536 PL_xpvlv_arenaroot = 0;
538 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
539 arenanext = (XPV*)arena->xpv_pv;
542 PL_xpvbm_arenaroot = 0;
544 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
545 arenanext = (XPV*)arena->xpv_pv;
551 Safefree(PL_nice_chunk);
552 PL_nice_chunk = Nullch;
553 PL_nice_chunk_size = 0;
559 =for apidoc report_uninit
561 Print appropriate "Use of uninitialized variable" warning
567 Perl_report_uninit(pTHX)
570 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit,
571 " in ", OP_DESC(PL_op));
573 Perl_warner(aTHX_ packWARN(WARN_UNINITIALIZED), PL_warn_uninit, "", "");
576 /* grab a new IV body from the free list, allocating more if necessary */
587 * See comment in more_xiv() -- RAM.
589 PL_xiv_root = *(IV**)xiv;
591 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
594 /* return an IV body to the free list */
597 S_del_xiv(pTHX_ XPVIV *p)
599 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
601 *(IV**)xiv = PL_xiv_root;
606 /* allocate another arena's worth of IV bodies */
614 New(705, ptr, 1008/sizeof(XPV), XPV);
615 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
616 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
619 xivend = &xiv[1008 / sizeof(IV) - 1];
620 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
622 while (xiv < xivend) {
623 *(IV**)xiv = (IV *)(xiv + 1);
629 /* grab a new NV body from the free list, allocating more if necessary */
639 PL_xnv_root = *(NV**)xnv;
641 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
644 /* return an NV body to the free list */
647 S_del_xnv(pTHX_ XPVNV *p)
649 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
651 *(NV**)xnv = PL_xnv_root;
656 /* allocate another arena's worth of NV bodies */
664 New(711, ptr, 1008/sizeof(XPV), XPV);
665 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
666 PL_xnv_arenaroot = ptr;
669 xnvend = &xnv[1008 / sizeof(NV) - 1];
670 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
672 while (xnv < xnvend) {
673 *(NV**)xnv = (NV*)(xnv + 1);
679 /* grab a new struct xrv from the free list, allocating more if necessary */
689 PL_xrv_root = (XRV*)xrv->xrv_rv;
694 /* return a struct xrv to the free list */
697 S_del_xrv(pTHX_ XRV *p)
700 p->xrv_rv = (SV*)PL_xrv_root;
705 /* allocate another arena's worth of struct xrv */
711 register XRV* xrvend;
713 New(712, ptr, 1008/sizeof(XPV), XPV);
714 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
715 PL_xrv_arenaroot = ptr;
718 xrvend = &xrv[1008 / sizeof(XRV) - 1];
719 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
721 while (xrv < xrvend) {
722 xrv->xrv_rv = (SV*)(xrv + 1);
728 /* grab a new struct xpv from the free list, allocating more if necessary */
738 PL_xpv_root = (XPV*)xpv->xpv_pv;
743 /* return a struct xpv to the free list */
746 S_del_xpv(pTHX_ XPV *p)
749 p->xpv_pv = (char*)PL_xpv_root;
754 /* allocate another arena's worth of struct xpv */
760 register XPV* xpvend;
761 New(713, xpv, 1008/sizeof(XPV), XPV);
762 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
763 PL_xpv_arenaroot = xpv;
765 xpvend = &xpv[1008 / sizeof(XPV) - 1];
767 while (xpv < xpvend) {
768 xpv->xpv_pv = (char*)(xpv + 1);
774 /* grab a new struct xpviv from the free list, allocating more if necessary */
783 xpviv = PL_xpviv_root;
784 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
789 /* return a struct xpviv to the free list */
792 S_del_xpviv(pTHX_ XPVIV *p)
795 p->xpv_pv = (char*)PL_xpviv_root;
800 /* allocate another arena's worth of struct xpviv */
805 register XPVIV* xpviv;
806 register XPVIV* xpvivend;
807 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
808 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
809 PL_xpviv_arenaroot = xpviv;
811 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
812 PL_xpviv_root = ++xpviv;
813 while (xpviv < xpvivend) {
814 xpviv->xpv_pv = (char*)(xpviv + 1);
820 /* grab a new struct xpvnv from the free list, allocating more if necessary */
829 xpvnv = PL_xpvnv_root;
830 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
835 /* return a struct xpvnv to the free list */
838 S_del_xpvnv(pTHX_ XPVNV *p)
841 p->xpv_pv = (char*)PL_xpvnv_root;
846 /* allocate another arena's worth of struct xpvnv */
851 register XPVNV* xpvnv;
852 register XPVNV* xpvnvend;
853 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
854 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
855 PL_xpvnv_arenaroot = xpvnv;
857 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
858 PL_xpvnv_root = ++xpvnv;
859 while (xpvnv < xpvnvend) {
860 xpvnv->xpv_pv = (char*)(xpvnv + 1);
866 /* grab a new struct xpvcv from the free list, allocating more if necessary */
875 xpvcv = PL_xpvcv_root;
876 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
881 /* return a struct xpvcv to the free list */
884 S_del_xpvcv(pTHX_ XPVCV *p)
887 p->xpv_pv = (char*)PL_xpvcv_root;
892 /* allocate another arena's worth of struct xpvcv */
897 register XPVCV* xpvcv;
898 register XPVCV* xpvcvend;
899 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
900 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
901 PL_xpvcv_arenaroot = xpvcv;
903 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
904 PL_xpvcv_root = ++xpvcv;
905 while (xpvcv < xpvcvend) {
906 xpvcv->xpv_pv = (char*)(xpvcv + 1);
912 /* grab a new struct xpvav from the free list, allocating more if necessary */
921 xpvav = PL_xpvav_root;
922 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
927 /* return a struct xpvav to the free list */
930 S_del_xpvav(pTHX_ XPVAV *p)
933 p->xav_array = (char*)PL_xpvav_root;
938 /* allocate another arena's worth of struct xpvav */
943 register XPVAV* xpvav;
944 register XPVAV* xpvavend;
945 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
946 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
947 PL_xpvav_arenaroot = xpvav;
949 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
950 PL_xpvav_root = ++xpvav;
951 while (xpvav < xpvavend) {
952 xpvav->xav_array = (char*)(xpvav + 1);
955 xpvav->xav_array = 0;
958 /* grab a new struct xpvhv from the free list, allocating more if necessary */
967 xpvhv = PL_xpvhv_root;
968 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
973 /* return a struct xpvhv to the free list */
976 S_del_xpvhv(pTHX_ XPVHV *p)
979 p->xhv_array = (char*)PL_xpvhv_root;
984 /* allocate another arena's worth of struct xpvhv */
989 register XPVHV* xpvhv;
990 register XPVHV* xpvhvend;
991 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
992 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
993 PL_xpvhv_arenaroot = xpvhv;
995 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
996 PL_xpvhv_root = ++xpvhv;
997 while (xpvhv < xpvhvend) {
998 xpvhv->xhv_array = (char*)(xpvhv + 1);
1001 xpvhv->xhv_array = 0;
1004 /* grab a new struct xpvmg from the free list, allocating more if necessary */
1013 xpvmg = PL_xpvmg_root;
1014 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
1019 /* return a struct xpvmg to the free list */
1022 S_del_xpvmg(pTHX_ XPVMG *p)
1025 p->xpv_pv = (char*)PL_xpvmg_root;
1030 /* allocate another arena's worth of struct xpvmg */
1035 register XPVMG* xpvmg;
1036 register XPVMG* xpvmgend;
1037 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1038 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1039 PL_xpvmg_arenaroot = xpvmg;
1041 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1042 PL_xpvmg_root = ++xpvmg;
1043 while (xpvmg < xpvmgend) {
1044 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1050 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1059 xpvlv = PL_xpvlv_root;
1060 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1065 /* return a struct xpvlv to the free list */
1068 S_del_xpvlv(pTHX_ XPVLV *p)
1071 p->xpv_pv = (char*)PL_xpvlv_root;
1076 /* allocate another arena's worth of struct xpvlv */
1081 register XPVLV* xpvlv;
1082 register XPVLV* xpvlvend;
1083 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1084 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1085 PL_xpvlv_arenaroot = xpvlv;
1087 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1088 PL_xpvlv_root = ++xpvlv;
1089 while (xpvlv < xpvlvend) {
1090 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1096 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1105 xpvbm = PL_xpvbm_root;
1106 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1111 /* return a struct xpvbm to the free list */
1114 S_del_xpvbm(pTHX_ XPVBM *p)
1117 p->xpv_pv = (char*)PL_xpvbm_root;
1122 /* allocate another arena's worth of struct xpvbm */
1127 register XPVBM* xpvbm;
1128 register XPVBM* xpvbmend;
1129 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1130 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1131 PL_xpvbm_arenaroot = xpvbm;
1133 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1134 PL_xpvbm_root = ++xpvbm;
1135 while (xpvbm < xpvbmend) {
1136 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1142 #define my_safemalloc(s) (void*)safemalloc(s)
1143 #define my_safefree(p) safefree((char*)p)
1147 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1148 #define del_XIV(p) my_safefree(p)
1150 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1151 #define del_XNV(p) my_safefree(p)
1153 #define new_XRV() my_safemalloc(sizeof(XRV))
1154 #define del_XRV(p) my_safefree(p)
1156 #define new_XPV() my_safemalloc(sizeof(XPV))
1157 #define del_XPV(p) my_safefree(p)
1159 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1160 #define del_XPVIV(p) my_safefree(p)
1162 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1163 #define del_XPVNV(p) my_safefree(p)
1165 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1166 #define del_XPVCV(p) my_safefree(p)
1168 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1169 #define del_XPVAV(p) my_safefree(p)
1171 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1172 #define del_XPVHV(p) my_safefree(p)
1174 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1175 #define del_XPVMG(p) my_safefree(p)
1177 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1178 #define del_XPVLV(p) my_safefree(p)
1180 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1181 #define del_XPVBM(p) my_safefree(p)
1185 #define new_XIV() (void*)new_xiv()
1186 #define del_XIV(p) del_xiv((XPVIV*) p)
1188 #define new_XNV() (void*)new_xnv()
1189 #define del_XNV(p) del_xnv((XPVNV*) p)
1191 #define new_XRV() (void*)new_xrv()
1192 #define del_XRV(p) del_xrv((XRV*) p)
1194 #define new_XPV() (void*)new_xpv()
1195 #define del_XPV(p) del_xpv((XPV *)p)
1197 #define new_XPVIV() (void*)new_xpviv()
1198 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1200 #define new_XPVNV() (void*)new_xpvnv()
1201 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1203 #define new_XPVCV() (void*)new_xpvcv()
1204 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1206 #define new_XPVAV() (void*)new_xpvav()
1207 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1209 #define new_XPVHV() (void*)new_xpvhv()
1210 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1212 #define new_XPVMG() (void*)new_xpvmg()
1213 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1215 #define new_XPVLV() (void*)new_xpvlv()
1216 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1218 #define new_XPVBM() (void*)new_xpvbm()
1219 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1223 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1224 #define del_XPVGV(p) my_safefree(p)
1226 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1227 #define del_XPVFM(p) my_safefree(p)
1229 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1230 #define del_XPVIO(p) my_safefree(p)
1233 =for apidoc sv_upgrade
1235 Upgrade an SV to a more complex form. Generally adds a new body type to the
1236 SV, then copies across as much information as possible from the old body.
1237 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1243 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1250 MAGIC* magic = NULL;
1253 if (mt != SVt_PV && SvREADONLY(sv) && SvFAKE(sv)) {
1254 sv_force_normal(sv);
1257 if (SvTYPE(sv) == mt)
1261 (void)SvOOK_off(sv);
1263 switch (SvTYPE(sv)) {
1284 else if (mt < SVt_PVIV)
1301 pv = (char*)SvRV(sv);
1321 else if (mt == SVt_NV)
1332 del_XPVIV(SvANY(sv));
1342 del_XPVNV(SvANY(sv));
1350 magic = SvMAGIC(sv);
1351 stash = SvSTASH(sv);
1352 del_XPVMG(SvANY(sv));
1355 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1360 Perl_croak(aTHX_ "Can't upgrade to undef");
1362 SvANY(sv) = new_XIV();
1366 SvANY(sv) = new_XNV();
1370 SvANY(sv) = new_XRV();
1374 SvANY(sv) = new_XPV();
1380 SvANY(sv) = new_XPVIV();
1390 SvANY(sv) = new_XPVNV();
1398 SvANY(sv) = new_XPVMG();
1404 SvMAGIC(sv) = magic;
1405 SvSTASH(sv) = stash;
1408 SvANY(sv) = new_XPVLV();
1414 SvMAGIC(sv) = magic;
1415 SvSTASH(sv) = stash;
1422 SvANY(sv) = new_XPVAV();
1430 SvMAGIC(sv) = magic;
1431 SvSTASH(sv) = stash;
1437 SvANY(sv) = new_XPVHV();
1443 HvTOTALKEYS(sv) = 0;
1444 HvPLACEHOLDERS(sv) = 0;
1445 SvMAGIC(sv) = magic;
1446 SvSTASH(sv) = stash;
1453 SvANY(sv) = new_XPVCV();
1454 Zero(SvANY(sv), 1, XPVCV);
1460 SvMAGIC(sv) = magic;
1461 SvSTASH(sv) = stash;
1464 SvANY(sv) = new_XPVGV();
1470 SvMAGIC(sv) = magic;
1471 SvSTASH(sv) = stash;
1479 SvANY(sv) = new_XPVBM();
1485 SvMAGIC(sv) = magic;
1486 SvSTASH(sv) = stash;
1492 SvANY(sv) = new_XPVFM();
1493 Zero(SvANY(sv), 1, XPVFM);
1499 SvMAGIC(sv) = magic;
1500 SvSTASH(sv) = stash;
1503 SvANY(sv) = new_XPVIO();
1504 Zero(SvANY(sv), 1, XPVIO);
1510 SvMAGIC(sv) = magic;
1511 SvSTASH(sv) = stash;
1512 IoPAGE_LEN(sv) = 60;
1515 SvFLAGS(sv) &= ~SVTYPEMASK;
1521 =for apidoc sv_backoff
1523 Remove any string offset. You should normally use the C<SvOOK_off> macro
1530 Perl_sv_backoff(pTHX_ register SV *sv)
1534 char *s = SvPVX(sv);
1535 SvLEN(sv) += SvIVX(sv);
1536 SvPVX(sv) -= SvIVX(sv);
1538 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1540 SvFLAGS(sv) &= ~SVf_OOK;
1547 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1548 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1549 Use the C<SvGROW> wrapper instead.
1555 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1561 #ifdef HAS_64K_LIMIT
1562 if (newlen >= 0x10000) {
1563 PerlIO_printf(Perl_debug_log,
1564 "Allocation too large: %"UVxf"\n", (UV)newlen);
1567 #endif /* HAS_64K_LIMIT */
1570 if (SvTYPE(sv) < SVt_PV) {
1571 sv_upgrade(sv, SVt_PV);
1574 else if (SvOOK(sv)) { /* pv is offset? */
1577 if (newlen > SvLEN(sv))
1578 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1579 #ifdef HAS_64K_LIMIT
1580 if (newlen >= 0x10000)
1587 if (newlen > SvLEN(sv)) { /* need more room? */
1588 if (SvLEN(sv) && s) {
1590 STRLEN l = malloced_size((void*)SvPVX(sv));
1596 Renew(s,newlen,char);
1599 /* sv_force_normal_flags() must not try to unshare the new
1600 PVX we allocate below. AMS 20010713 */
1601 if (SvREADONLY(sv) && SvFAKE(sv)) {
1605 New(703, s, newlen, char);
1606 if (SvPVX(sv) && SvCUR(sv)) {
1607 Move(SvPVX(sv), s, (newlen < SvCUR(sv)) ? newlen : SvCUR(sv), char);
1611 SvLEN_set(sv, newlen);
1617 =for apidoc sv_setiv
1619 Copies an integer into the given SV, upgrading first if necessary.
1620 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1626 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1628 SV_CHECK_THINKFIRST(sv);
1629 switch (SvTYPE(sv)) {
1631 sv_upgrade(sv, SVt_IV);
1634 sv_upgrade(sv, SVt_PVNV);
1638 sv_upgrade(sv, SVt_PVIV);
1647 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1650 (void)SvIOK_only(sv); /* validate number */
1656 =for apidoc sv_setiv_mg
1658 Like C<sv_setiv>, but also handles 'set' magic.
1664 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1671 =for apidoc sv_setuv
1673 Copies an unsigned integer into the given SV, upgrading first if necessary.
1674 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1680 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1682 /* With these two if statements:
1683 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1686 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1688 If you wish to remove them, please benchmark to see what the effect is
1690 if (u <= (UV)IV_MAX) {
1691 sv_setiv(sv, (IV)u);
1700 =for apidoc sv_setuv_mg
1702 Like C<sv_setuv>, but also handles 'set' magic.
1708 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1710 /* With these two if statements:
1711 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1714 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1716 If you wish to remove them, please benchmark to see what the effect is
1718 if (u <= (UV)IV_MAX) {
1719 sv_setiv(sv, (IV)u);
1729 =for apidoc sv_setnv
1731 Copies a double into the given SV, upgrading first if necessary.
1732 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1738 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1740 SV_CHECK_THINKFIRST(sv);
1741 switch (SvTYPE(sv)) {
1744 sv_upgrade(sv, SVt_NV);
1749 sv_upgrade(sv, SVt_PVNV);
1758 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1762 (void)SvNOK_only(sv); /* validate number */
1767 =for apidoc sv_setnv_mg
1769 Like C<sv_setnv>, but also handles 'set' magic.
1775 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1781 /* Print an "isn't numeric" warning, using a cleaned-up,
1782 * printable version of the offending string
1786 S_not_a_number(pTHX_ SV *sv)
1793 dsv = sv_2mortal(newSVpv("", 0));
1794 pv = sv_uni_display(dsv, sv, 10, 0);
1797 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1798 /* each *s can expand to 4 chars + "...\0",
1799 i.e. need room for 8 chars */
1802 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1804 if (ch & 128 && !isPRINT_LC(ch)) {
1813 else if (ch == '\r') {
1817 else if (ch == '\f') {
1821 else if (ch == '\\') {
1825 else if (ch == '\0') {
1829 else if (isPRINT_LC(ch))
1846 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1847 "Argument \"%s\" isn't numeric in %s", pv,
1850 Perl_warner(aTHX_ packWARN(WARN_NUMERIC),
1851 "Argument \"%s\" isn't numeric", pv);
1855 =for apidoc looks_like_number
1857 Test if the content of an SV looks like a number (or is a number).
1858 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1859 non-numeric warning), even if your atof() doesn't grok them.
1865 Perl_looks_like_number(pTHX_ SV *sv)
1867 register char *sbegin;
1874 else if (SvPOKp(sv))
1875 sbegin = SvPV(sv, len);
1877 return 1; /* Historic. Wrong? */
1878 return grok_number(sbegin, len, NULL);
1881 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1882 until proven guilty, assume that things are not that bad... */
1887 As 64 bit platforms often have an NV that doesn't preserve all bits of
1888 an IV (an assumption perl has been based on to date) it becomes necessary
1889 to remove the assumption that the NV always carries enough precision to
1890 recreate the IV whenever needed, and that the NV is the canonical form.
1891 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1892 precision as a side effect of conversion (which would lead to insanity
1893 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1894 1) to distinguish between IV/UV/NV slots that have cached a valid
1895 conversion where precision was lost and IV/UV/NV slots that have a
1896 valid conversion which has lost no precision
1897 2) to ensure that if a numeric conversion to one form is requested that
1898 would lose precision, the precise conversion (or differently
1899 imprecise conversion) is also performed and cached, to prevent
1900 requests for different numeric formats on the same SV causing
1901 lossy conversion chains. (lossless conversion chains are perfectly
1906 SvIOKp is true if the IV slot contains a valid value
1907 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1908 SvNOKp is true if the NV slot contains a valid value
1909 SvNOK is true only if the NV value is accurate
1912 while converting from PV to NV, check to see if converting that NV to an
1913 IV(or UV) would lose accuracy over a direct conversion from PV to
1914 IV(or UV). If it would, cache both conversions, return NV, but mark
1915 SV as IOK NOKp (ie not NOK).
1917 While converting from PV to IV, check to see if converting that IV to an
1918 NV would lose accuracy over a direct conversion from PV to NV. If it
1919 would, cache both conversions, flag similarly.
1921 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1922 correctly because if IV & NV were set NV *always* overruled.
1923 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1924 changes - now IV and NV together means that the two are interchangeable:
1925 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1927 The benefit of this is that operations such as pp_add know that if
1928 SvIOK is true for both left and right operands, then integer addition
1929 can be used instead of floating point (for cases where the result won't
1930 overflow). Before, floating point was always used, which could lead to
1931 loss of precision compared with integer addition.
1933 * making IV and NV equal status should make maths accurate on 64 bit
1935 * may speed up maths somewhat if pp_add and friends start to use
1936 integers when possible instead of fp. (Hopefully the overhead in
1937 looking for SvIOK and checking for overflow will not outweigh the
1938 fp to integer speedup)
1939 * will slow down integer operations (callers of SvIV) on "inaccurate"
1940 values, as the change from SvIOK to SvIOKp will cause a call into
1941 sv_2iv each time rather than a macro access direct to the IV slot
1942 * should speed up number->string conversion on integers as IV is
1943 favoured when IV and NV are equally accurate
1945 ####################################################################
1946 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1947 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1948 On the other hand, SvUOK is true iff UV.
1949 ####################################################################
1951 Your mileage will vary depending your CPU's relative fp to integer
1955 #ifndef NV_PRESERVES_UV
1956 # define IS_NUMBER_UNDERFLOW_IV 1
1957 # define IS_NUMBER_UNDERFLOW_UV 2
1958 # define IS_NUMBER_IV_AND_UV 2
1959 # define IS_NUMBER_OVERFLOW_IV 4
1960 # define IS_NUMBER_OVERFLOW_UV 5
1962 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1964 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1966 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1968 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));
1969 if (SvNVX(sv) < (NV)IV_MIN) {
1970 (void)SvIOKp_on(sv);
1973 return IS_NUMBER_UNDERFLOW_IV;
1975 if (SvNVX(sv) > (NV)UV_MAX) {
1976 (void)SvIOKp_on(sv);
1980 return IS_NUMBER_OVERFLOW_UV;
1982 (void)SvIOKp_on(sv);
1984 /* Can't use strtol etc to convert this string. (See truth table in
1986 if (SvNVX(sv) <= (UV)IV_MAX) {
1987 SvIVX(sv) = I_V(SvNVX(sv));
1988 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1989 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1991 /* Integer is imprecise. NOK, IOKp */
1993 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1996 SvUVX(sv) = U_V(SvNVX(sv));
1997 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1998 if (SvUVX(sv) == UV_MAX) {
1999 /* As we know that NVs don't preserve UVs, UV_MAX cannot
2000 possibly be preserved by NV. Hence, it must be overflow.
2002 return IS_NUMBER_OVERFLOW_UV;
2004 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
2006 /* Integer is imprecise. NOK, IOKp */
2008 return IS_NUMBER_OVERFLOW_IV;
2010 #endif /* !NV_PRESERVES_UV*/
2015 Return the integer value of an SV, doing any necessary string conversion,
2016 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
2022 Perl_sv_2iv(pTHX_ register SV *sv)
2026 if (SvGMAGICAL(sv)) {
2031 return I_V(SvNVX(sv));
2033 if (SvPOKp(sv) && SvLEN(sv))
2036 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2037 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2043 if (SvTHINKFIRST(sv)) {
2046 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2047 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2048 return SvIV(tmpstr);
2049 return PTR2IV(SvRV(sv));
2051 if (SvREADONLY(sv) && SvFAKE(sv)) {
2052 sv_force_normal(sv);
2054 if (SvREADONLY(sv) && !SvOK(sv)) {
2055 if (ckWARN(WARN_UNINITIALIZED))
2062 return (IV)(SvUVX(sv));
2069 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2070 * without also getting a cached IV/UV from it at the same time
2071 * (ie PV->NV conversion should detect loss of accuracy and cache
2072 * IV or UV at same time to avoid this. NWC */
2074 if (SvTYPE(sv) == SVt_NV)
2075 sv_upgrade(sv, SVt_PVNV);
2077 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2078 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2079 certainly cast into the IV range at IV_MAX, whereas the correct
2080 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2082 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2083 SvIVX(sv) = I_V(SvNVX(sv));
2084 if (SvNVX(sv) == (NV) SvIVX(sv)
2085 #ifndef NV_PRESERVES_UV
2086 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2087 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2088 /* Don't flag it as "accurately an integer" if the number
2089 came from a (by definition imprecise) NV operation, and
2090 we're outside the range of NV integer precision */
2093 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2094 DEBUG_c(PerlIO_printf(Perl_debug_log,
2095 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (precise)\n",
2101 /* IV not precise. No need to convert from PV, as NV
2102 conversion would already have cached IV if it detected
2103 that PV->IV would be better than PV->NV->IV
2104 flags already correct - don't set public IOK. */
2105 DEBUG_c(PerlIO_printf(Perl_debug_log,
2106 "0x%"UVxf" iv(%"NVgf" => %"IVdf") (imprecise)\n",
2111 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2112 but the cast (NV)IV_MIN rounds to a the value less (more
2113 negative) than IV_MIN which happens to be equal to SvNVX ??
2114 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2115 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2116 (NV)UVX == NVX are both true, but the values differ. :-(
2117 Hopefully for 2s complement IV_MIN is something like
2118 0x8000000000000000 which will be exact. NWC */
2121 SvUVX(sv) = U_V(SvNVX(sv));
2123 (SvNVX(sv) == (NV) SvUVX(sv))
2124 #ifndef NV_PRESERVES_UV
2125 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2126 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2127 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2128 /* Don't flag it as "accurately an integer" if the number
2129 came from a (by definition imprecise) NV operation, and
2130 we're outside the range of NV integer precision */
2136 DEBUG_c(PerlIO_printf(Perl_debug_log,
2137 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2141 return (IV)SvUVX(sv);
2144 else if (SvPOKp(sv) && SvLEN(sv)) {
2146 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2147 /* We want to avoid a possible problem when we cache an IV which
2148 may be later translated to an NV, and the resulting NV is not
2149 the same as the direct translation of the initial string
2150 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2151 be careful to ensure that the value with the .456 is around if the
2152 NV value is requested in the future).
2154 This means that if we cache such an IV, we need to cache the
2155 NV as well. Moreover, we trade speed for space, and do not
2156 cache the NV if we are sure it's not needed.
2159 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2160 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2161 == IS_NUMBER_IN_UV) {
2162 /* It's definitely an integer, only upgrade to PVIV */
2163 if (SvTYPE(sv) < SVt_PVIV)
2164 sv_upgrade(sv, SVt_PVIV);
2166 } else if (SvTYPE(sv) < SVt_PVNV)
2167 sv_upgrade(sv, SVt_PVNV);
2169 /* If NV preserves UV then we only use the UV value if we know that
2170 we aren't going to call atof() below. If NVs don't preserve UVs
2171 then the value returned may have more precision than atof() will
2172 return, even though value isn't perfectly accurate. */
2173 if ((numtype & (IS_NUMBER_IN_UV
2174 #ifdef NV_PRESERVES_UV
2177 )) == IS_NUMBER_IN_UV) {
2178 /* This won't turn off the public IOK flag if it was set above */
2179 (void)SvIOKp_on(sv);
2181 if (!(numtype & IS_NUMBER_NEG)) {
2183 if (value <= (UV)IV_MAX) {
2184 SvIVX(sv) = (IV)value;
2190 /* 2s complement assumption */
2191 if (value <= (UV)IV_MIN) {
2192 SvIVX(sv) = -(IV)value;
2194 /* Too negative for an IV. This is a double upgrade, but
2195 I'm assuming it will be rare. */
2196 if (SvTYPE(sv) < SVt_PVNV)
2197 sv_upgrade(sv, SVt_PVNV);
2201 SvNVX(sv) = -(NV)value;
2206 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2207 will be in the previous block to set the IV slot, and the next
2208 block to set the NV slot. So no else here. */
2210 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2211 != IS_NUMBER_IN_UV) {
2212 /* It wasn't an (integer that doesn't overflow the UV). */
2213 SvNVX(sv) = Atof(SvPVX(sv));
2215 if (! numtype && ckWARN(WARN_NUMERIC))
2218 #if defined(USE_LONG_DOUBLE)
2219 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2220 PTR2UV(sv), SvNVX(sv)));
2222 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"NVgf")\n",
2223 PTR2UV(sv), SvNVX(sv)));
2227 #ifdef NV_PRESERVES_UV
2228 (void)SvIOKp_on(sv);
2230 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2231 SvIVX(sv) = I_V(SvNVX(sv));
2232 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2235 /* Integer is imprecise. NOK, IOKp */
2237 /* UV will not work better than IV */
2239 if (SvNVX(sv) > (NV)UV_MAX) {
2241 /* Integer is inaccurate. NOK, IOKp, is UV */
2245 SvUVX(sv) = U_V(SvNVX(sv));
2246 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2247 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2251 /* Integer is imprecise. NOK, IOKp, is UV */
2257 #else /* NV_PRESERVES_UV */
2258 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2259 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2260 /* The IV slot will have been set from value returned by
2261 grok_number above. The NV slot has just been set using
2264 assert (SvIOKp(sv));
2266 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2267 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2268 /* Small enough to preserve all bits. */
2269 (void)SvIOKp_on(sv);
2271 SvIVX(sv) = I_V(SvNVX(sv));
2272 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2274 /* Assumption: first non-preserved integer is < IV_MAX,
2275 this NV is in the preserved range, therefore: */
2276 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2278 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);
2282 0 0 already failed to read UV.
2283 0 1 already failed to read UV.
2284 1 0 you won't get here in this case. IV/UV
2285 slot set, public IOK, Atof() unneeded.
2286 1 1 already read UV.
2287 so there's no point in sv_2iuv_non_preserve() attempting
2288 to use atol, strtol, strtoul etc. */
2289 if (sv_2iuv_non_preserve (sv, numtype)
2290 >= IS_NUMBER_OVERFLOW_IV)
2294 #endif /* NV_PRESERVES_UV */
2297 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2299 if (SvTYPE(sv) < SVt_IV)
2300 /* Typically the caller expects that sv_any is not NULL now. */
2301 sv_upgrade(sv, SVt_IV);
2304 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2305 PTR2UV(sv),SvIVX(sv)));
2306 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2312 Return the unsigned integer value of an SV, doing any necessary string
2313 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2320 Perl_sv_2uv(pTHX_ register SV *sv)
2324 if (SvGMAGICAL(sv)) {
2329 return U_V(SvNVX(sv));
2330 if (SvPOKp(sv) && SvLEN(sv))
2333 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2334 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2340 if (SvTHINKFIRST(sv)) {
2343 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2344 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2345 return SvUV(tmpstr);
2346 return PTR2UV(SvRV(sv));
2348 if (SvREADONLY(sv) && SvFAKE(sv)) {
2349 sv_force_normal(sv);
2351 if (SvREADONLY(sv) && !SvOK(sv)) {
2352 if (ckWARN(WARN_UNINITIALIZED))
2362 return (UV)SvIVX(sv);
2366 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2367 * without also getting a cached IV/UV from it at the same time
2368 * (ie PV->NV conversion should detect loss of accuracy and cache
2369 * IV or UV at same time to avoid this. */
2370 /* IV-over-UV optimisation - choose to cache IV if possible */
2372 if (SvTYPE(sv) == SVt_NV)
2373 sv_upgrade(sv, SVt_PVNV);
2375 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2376 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2377 SvIVX(sv) = I_V(SvNVX(sv));
2378 if (SvNVX(sv) == (NV) SvIVX(sv)
2379 #ifndef NV_PRESERVES_UV
2380 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2381 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2382 /* Don't flag it as "accurately an integer" if the number
2383 came from a (by definition imprecise) NV operation, and
2384 we're outside the range of NV integer precision */
2387 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2388 DEBUG_c(PerlIO_printf(Perl_debug_log,
2389 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (precise)\n",
2395 /* IV not precise. No need to convert from PV, as NV
2396 conversion would already have cached IV if it detected
2397 that PV->IV would be better than PV->NV->IV
2398 flags already correct - don't set public IOK. */
2399 DEBUG_c(PerlIO_printf(Perl_debug_log,
2400 "0x%"UVxf" uv(%"NVgf" => %"IVdf") (imprecise)\n",
2405 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2406 but the cast (NV)IV_MIN rounds to a the value less (more
2407 negative) than IV_MIN which happens to be equal to SvNVX ??
2408 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2409 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2410 (NV)UVX == NVX are both true, but the values differ. :-(
2411 Hopefully for 2s complement IV_MIN is something like
2412 0x8000000000000000 which will be exact. NWC */
2415 SvUVX(sv) = U_V(SvNVX(sv));
2417 (SvNVX(sv) == (NV) SvUVX(sv))
2418 #ifndef NV_PRESERVES_UV
2419 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2420 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2421 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2422 /* Don't flag it as "accurately an integer" if the number
2423 came from a (by definition imprecise) NV operation, and
2424 we're outside the range of NV integer precision */
2429 DEBUG_c(PerlIO_printf(Perl_debug_log,
2430 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2436 else if (SvPOKp(sv) && SvLEN(sv)) {
2438 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2440 /* We want to avoid a possible problem when we cache a UV which
2441 may be later translated to an NV, and the resulting NV is not
2442 the translation of the initial data.
2444 This means that if we cache such a UV, we need to cache the
2445 NV as well. Moreover, we trade speed for space, and do not
2446 cache the NV if not needed.
2449 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2450 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2451 == IS_NUMBER_IN_UV) {
2452 /* It's definitely an integer, only upgrade to PVIV */
2453 if (SvTYPE(sv) < SVt_PVIV)
2454 sv_upgrade(sv, SVt_PVIV);
2456 } else if (SvTYPE(sv) < SVt_PVNV)
2457 sv_upgrade(sv, SVt_PVNV);
2459 /* If NV preserves UV then we only use the UV value if we know that
2460 we aren't going to call atof() below. If NVs don't preserve UVs
2461 then the value returned may have more precision than atof() will
2462 return, even though it isn't accurate. */
2463 if ((numtype & (IS_NUMBER_IN_UV
2464 #ifdef NV_PRESERVES_UV
2467 )) == IS_NUMBER_IN_UV) {
2468 /* This won't turn off the public IOK flag if it was set above */
2469 (void)SvIOKp_on(sv);
2471 if (!(numtype & IS_NUMBER_NEG)) {
2473 if (value <= (UV)IV_MAX) {
2474 SvIVX(sv) = (IV)value;
2476 /* it didn't overflow, and it was positive. */
2481 /* 2s complement assumption */
2482 if (value <= (UV)IV_MIN) {
2483 SvIVX(sv) = -(IV)value;
2485 /* Too negative for an IV. This is a double upgrade, but
2486 I'm assuming it will be rare. */
2487 if (SvTYPE(sv) < SVt_PVNV)
2488 sv_upgrade(sv, SVt_PVNV);
2492 SvNVX(sv) = -(NV)value;
2498 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2499 != IS_NUMBER_IN_UV) {
2500 /* It wasn't an integer, or it overflowed the UV. */
2501 SvNVX(sv) = Atof(SvPVX(sv));
2503 if (! numtype && ckWARN(WARN_NUMERIC))
2506 #if defined(USE_LONG_DOUBLE)
2507 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2508 PTR2UV(sv), SvNVX(sv)));
2510 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"NVgf")\n",
2511 PTR2UV(sv), SvNVX(sv)));
2514 #ifdef NV_PRESERVES_UV
2515 (void)SvIOKp_on(sv);
2517 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2518 SvIVX(sv) = I_V(SvNVX(sv));
2519 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2522 /* Integer is imprecise. NOK, IOKp */
2524 /* UV will not work better than IV */
2526 if (SvNVX(sv) > (NV)UV_MAX) {
2528 /* Integer is inaccurate. NOK, IOKp, is UV */
2532 SvUVX(sv) = U_V(SvNVX(sv));
2533 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2534 NV preservse UV so can do correct comparison. */
2535 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2539 /* Integer is imprecise. NOK, IOKp, is UV */
2544 #else /* NV_PRESERVES_UV */
2545 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2546 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2547 /* The UV slot will have been set from value returned by
2548 grok_number above. The NV slot has just been set using
2551 assert (SvIOKp(sv));
2553 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2554 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2555 /* Small enough to preserve all bits. */
2556 (void)SvIOKp_on(sv);
2558 SvIVX(sv) = I_V(SvNVX(sv));
2559 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2561 /* Assumption: first non-preserved integer is < IV_MAX,
2562 this NV is in the preserved range, therefore: */
2563 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2565 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);
2568 sv_2iuv_non_preserve (sv, numtype);
2570 #endif /* NV_PRESERVES_UV */
2574 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2575 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2578 if (SvTYPE(sv) < SVt_IV)
2579 /* Typically the caller expects that sv_any is not NULL now. */
2580 sv_upgrade(sv, SVt_IV);
2584 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2585 PTR2UV(sv),SvUVX(sv)));
2586 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2592 Return the num value of an SV, doing any necessary string or integer
2593 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2600 Perl_sv_2nv(pTHX_ register SV *sv)
2604 if (SvGMAGICAL(sv)) {
2608 if (SvPOKp(sv) && SvLEN(sv)) {
2609 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2610 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2612 return Atof(SvPVX(sv));
2616 return (NV)SvUVX(sv);
2618 return (NV)SvIVX(sv);
2621 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2622 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2628 if (SvTHINKFIRST(sv)) {
2631 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2632 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv))))
2633 return SvNV(tmpstr);
2634 return PTR2NV(SvRV(sv));
2636 if (SvREADONLY(sv) && SvFAKE(sv)) {
2637 sv_force_normal(sv);
2639 if (SvREADONLY(sv) && !SvOK(sv)) {
2640 if (ckWARN(WARN_UNINITIALIZED))
2645 if (SvTYPE(sv) < SVt_NV) {
2646 if (SvTYPE(sv) == SVt_IV)
2647 sv_upgrade(sv, SVt_PVNV);
2649 sv_upgrade(sv, SVt_NV);
2650 #ifdef USE_LONG_DOUBLE
2652 STORE_NUMERIC_LOCAL_SET_STANDARD();
2653 PerlIO_printf(Perl_debug_log,
2654 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2655 PTR2UV(sv), SvNVX(sv));
2656 RESTORE_NUMERIC_LOCAL();
2660 STORE_NUMERIC_LOCAL_SET_STANDARD();
2661 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%"NVgf")\n",
2662 PTR2UV(sv), SvNVX(sv));
2663 RESTORE_NUMERIC_LOCAL();
2667 else if (SvTYPE(sv) < SVt_PVNV)
2668 sv_upgrade(sv, SVt_PVNV);
2673 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2674 #ifdef NV_PRESERVES_UV
2677 /* Only set the public NV OK flag if this NV preserves the IV */
2678 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2679 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2680 : (SvIVX(sv) == I_V(SvNVX(sv))))
2686 else if (SvPOKp(sv) && SvLEN(sv)) {
2688 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2689 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2691 #ifdef NV_PRESERVES_UV
2692 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2693 == IS_NUMBER_IN_UV) {
2694 /* It's definitely an integer */
2695 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2697 SvNVX(sv) = Atof(SvPVX(sv));
2700 SvNVX(sv) = Atof(SvPVX(sv));
2701 /* Only set the public NV OK flag if this NV preserves the value in
2702 the PV at least as well as an IV/UV would.
2703 Not sure how to do this 100% reliably. */
2704 /* if that shift count is out of range then Configure's test is
2705 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2707 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2708 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2709 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2710 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2711 /* Can't use strtol etc to convert this string, so don't try.
2712 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2715 /* value has been set. It may not be precise. */
2716 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2717 /* 2s complement assumption for (UV)IV_MIN */
2718 SvNOK_on(sv); /* Integer is too negative. */
2723 if (numtype & IS_NUMBER_NEG) {
2724 SvIVX(sv) = -(IV)value;
2725 } else if (value <= (UV)IV_MAX) {
2726 SvIVX(sv) = (IV)value;
2732 if (numtype & IS_NUMBER_NOT_INT) {
2733 /* I believe that even if the original PV had decimals,
2734 they are lost beyond the limit of the FP precision.
2735 However, neither is canonical, so both only get p
2736 flags. NWC, 2000/11/25 */
2737 /* Both already have p flags, so do nothing */
2740 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2741 if (SvIVX(sv) == I_V(nv)) {
2746 /* It had no "." so it must be integer. */
2749 /* between IV_MAX and NV(UV_MAX).
2750 Could be slightly > UV_MAX */
2752 if (numtype & IS_NUMBER_NOT_INT) {
2753 /* UV and NV both imprecise. */
2755 UV nv_as_uv = U_V(nv);
2757 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2768 #endif /* NV_PRESERVES_UV */
2771 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2773 if (SvTYPE(sv) < SVt_NV)
2774 /* Typically the caller expects that sv_any is not NULL now. */
2775 /* XXX Ilya implies that this is a bug in callers that assume this
2776 and ideally should be fixed. */
2777 sv_upgrade(sv, SVt_NV);
2780 #if defined(USE_LONG_DOUBLE)
2782 STORE_NUMERIC_LOCAL_SET_STANDARD();
2783 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2784 PTR2UV(sv), SvNVX(sv));
2785 RESTORE_NUMERIC_LOCAL();
2789 STORE_NUMERIC_LOCAL_SET_STANDARD();
2790 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%"NVgf")\n",
2791 PTR2UV(sv), SvNVX(sv));
2792 RESTORE_NUMERIC_LOCAL();
2798 /* asIV(): extract an integer from the string value of an SV.
2799 * Caller must validate PVX */
2802 S_asIV(pTHX_ SV *sv)
2805 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2807 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2808 == IS_NUMBER_IN_UV) {
2809 /* It's definitely an integer */
2810 if (numtype & IS_NUMBER_NEG) {
2811 if (value < (UV)IV_MIN)
2814 if (value < (UV)IV_MAX)
2819 if (ckWARN(WARN_NUMERIC))
2822 return I_V(Atof(SvPVX(sv)));
2825 /* asUV(): extract an unsigned integer from the string value of an SV
2826 * Caller must validate PVX */
2829 S_asUV(pTHX_ SV *sv)
2832 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2834 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2835 == IS_NUMBER_IN_UV) {
2836 /* It's definitely an integer */
2837 if (!(numtype & IS_NUMBER_NEG))
2841 if (ckWARN(WARN_NUMERIC))
2844 return U_V(Atof(SvPVX(sv)));
2848 =for apidoc sv_2pv_nolen
2850 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2851 use the macro wrapper C<SvPV_nolen(sv)> instead.
2856 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2859 return sv_2pv(sv, &n_a);
2862 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2863 * UV as a string towards the end of buf, and return pointers to start and
2866 * We assume that buf is at least TYPE_CHARS(UV) long.
2870 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2872 char *ptr = buf + TYPE_CHARS(UV);
2886 *--ptr = '0' + (char)(uv % 10);
2894 /* sv_2pv() is now a macro using Perl_sv_2pv_flags();
2895 * this function provided for binary compatibility only
2899 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2901 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2905 =for apidoc sv_2pv_flags
2907 Returns a pointer to the string value of an SV, and sets *lp to its length.
2908 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2910 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2911 usually end up here too.
2917 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2922 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2923 char *tmpbuf = tbuf;
2929 if (SvGMAGICAL(sv)) {
2930 if (flags & SV_GMAGIC)
2938 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2940 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2945 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2950 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2951 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2958 if (SvTHINKFIRST(sv)) {
2961 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2962 (!SvROK(tmpstr) || (SvRV(tmpstr) != SvRV(sv)))) {
2963 char *pv = SvPV(tmpstr, *lp);
2977 switch (SvTYPE(sv)) {
2979 if ( ((SvFLAGS(sv) &
2980 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2981 == (SVs_OBJECT|SVs_SMG))
2982 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2983 regexp *re = (regexp *)mg->mg_obj;
2986 char *fptr = "msix";
2991 char need_newline = 0;
2992 U16 reganch = (U16)((re->reganch & PMf_COMPILETIME) >> 12);
2994 while((ch = *fptr++)) {
2996 reflags[left++] = ch;
2999 reflags[right--] = ch;
3004 reflags[left] = '-';
3008 mg->mg_len = re->prelen + 4 + left;
3010 * If /x was used, we have to worry about a regex
3011 * ending with a comment later being embedded
3012 * within another regex. If so, we don't want this
3013 * regex's "commentization" to leak out to the
3014 * right part of the enclosing regex, we must cap
3015 * it with a newline.
3017 * So, if /x was used, we scan backwards from the
3018 * end of the regex. If we find a '#' before we
3019 * find a newline, we need to add a newline
3020 * ourself. If we find a '\n' first (or if we
3021 * don't find '#' or '\n'), we don't need to add
3022 * anything. -jfriedl
3024 if (PMf_EXTENDED & re->reganch)
3026 char *endptr = re->precomp + re->prelen;
3027 while (endptr >= re->precomp)
3029 char c = *(endptr--);
3031 break; /* don't need another */
3033 /* we end while in a comment, so we
3035 mg->mg_len++; /* save space for it */
3036 need_newline = 1; /* note to add it */
3042 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
3043 Copy("(?", mg->mg_ptr, 2, char);
3044 Copy(reflags, mg->mg_ptr+2, left, char);
3045 Copy(":", mg->mg_ptr+left+2, 1, char);
3046 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
3048 mg->mg_ptr[mg->mg_len - 2] = '\n';
3049 mg->mg_ptr[mg->mg_len - 1] = ')';
3050 mg->mg_ptr[mg->mg_len] = 0;
3052 PL_reginterp_cnt += re->program[0].next_off;
3054 if (re->reganch & ROPT_UTF8)
3069 case SVt_PVBM: if (SvROK(sv))
3072 s = "SCALAR"; break;
3073 case SVt_PVLV: s = SvROK(sv) ? "REF":"LVALUE"; break;
3074 case SVt_PVAV: s = "ARRAY"; break;
3075 case SVt_PVHV: s = "HASH"; break;
3076 case SVt_PVCV: s = "CODE"; break;
3077 case SVt_PVGV: s = "GLOB"; break;
3078 case SVt_PVFM: s = "FORMAT"; break;
3079 case SVt_PVIO: s = "IO"; break;
3080 default: s = "UNKNOWN"; break;
3084 HV *svs = SvSTASH(sv);
3087 /* [20011101.072] This bandaid for C<package;>
3088 should eventually be removed. AMS 20011103 */
3089 (svs ? HvNAME(svs) : "<none>"), s
3094 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3100 if (SvREADONLY(sv) && !SvOK(sv)) {
3101 if (ckWARN(WARN_UNINITIALIZED))
3107 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3108 /* I'm assuming that if both IV and NV are equally valid then
3109 converting the IV is going to be more efficient */
3110 U32 isIOK = SvIOK(sv);
3111 U32 isUIOK = SvIsUV(sv);
3112 char buf[TYPE_CHARS(UV)];
3115 if (SvTYPE(sv) < SVt_PVIV)
3116 sv_upgrade(sv, SVt_PVIV);
3118 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3120 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3121 SvGROW(sv, (STRLEN)(ebuf - ptr + 1)); /* inlined from sv_setpvn */
3122 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3123 SvCUR_set(sv, ebuf - ptr);
3133 else if (SvNOKp(sv)) {
3134 if (SvTYPE(sv) < SVt_PVNV)
3135 sv_upgrade(sv, SVt_PVNV);
3136 /* The +20 is pure guesswork. Configure test needed. --jhi */
3137 SvGROW(sv, NV_DIG + 20);
3139 olderrno = errno; /* some Xenix systems wipe out errno here */
3141 if (SvNVX(sv) == 0.0)
3142 (void)strcpy(s,"0");
3146 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3149 #ifdef FIXNEGATIVEZERO
3150 if (*s == '-' && s[1] == '0' && !s[2])
3160 if (ckWARN(WARN_UNINITIALIZED)
3161 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3164 if (SvTYPE(sv) < SVt_PV)
3165 /* Typically the caller expects that sv_any is not NULL now. */
3166 sv_upgrade(sv, SVt_PV);
3169 *lp = s - SvPVX(sv);
3172 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3173 PTR2UV(sv),SvPVX(sv)));
3177 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3178 /* Sneaky stuff here */
3182 tsv = newSVpv(tmpbuf, 0);
3198 len = strlen(tmpbuf);
3200 #ifdef FIXNEGATIVEZERO
3201 if (len == 2 && t[0] == '-' && t[1] == '0') {
3206 (void)SvUPGRADE(sv, SVt_PV);
3208 s = SvGROW(sv, len + 1);
3217 =for apidoc sv_copypv
3219 Copies a stringified representation of the source SV into the
3220 destination SV. Automatically performs any necessary mg_get and
3221 coercion of numeric values into strings. Guaranteed to preserve
3222 UTF-8 flag even from overloaded objects. Similar in nature to
3223 sv_2pv[_flags] but operates directly on an SV instead of just the
3224 string. Mostly uses sv_2pv_flags to do its work, except when that
3225 would lose the UTF-8'ness of the PV.
3231 Perl_sv_copypv(pTHX_ SV *dsv, register SV *ssv)
3236 sv_setpvn(dsv,s,len);
3244 =for apidoc sv_2pvbyte_nolen
3246 Return a pointer to the byte-encoded representation of the SV.
3247 May cause the SV to be downgraded from UTF8 as a side-effect.
3249 Usually accessed via the C<SvPVbyte_nolen> macro.
3255 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3258 return sv_2pvbyte(sv, &n_a);
3262 =for apidoc sv_2pvbyte
3264 Return a pointer to the byte-encoded representation of the SV, and set *lp
3265 to its length. May cause the SV to be downgraded from UTF8 as a
3268 Usually accessed via the C<SvPVbyte> macro.
3274 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3276 sv_utf8_downgrade(sv,0);
3277 return SvPV(sv,*lp);
3281 =for apidoc sv_2pvutf8_nolen
3283 Return a pointer to the UTF8-encoded representation of the SV.
3284 May cause the SV to be upgraded to UTF8 as a side-effect.
3286 Usually accessed via the C<SvPVutf8_nolen> macro.
3292 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3295 return sv_2pvutf8(sv, &n_a);
3299 =for apidoc sv_2pvutf8
3301 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3302 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3304 Usually accessed via the C<SvPVutf8> macro.
3310 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3312 sv_utf8_upgrade(sv);
3313 return SvPV(sv,*lp);
3317 =for apidoc sv_2bool
3319 This function is only called on magical items, and is only used by
3320 sv_true() or its macro equivalent.
3326 Perl_sv_2bool(pTHX_ register SV *sv)
3335 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3336 (!SvROK(tmpsv) || (SvRV(tmpsv) != SvRV(sv))))
3337 return (bool)SvTRUE(tmpsv);
3338 return SvRV(sv) != 0;
3341 register XPV* Xpvtmp;
3342 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3343 (*Xpvtmp->xpv_pv > '0' ||
3344 Xpvtmp->xpv_cur > 1 ||
3345 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3352 return SvIVX(sv) != 0;
3355 return SvNVX(sv) != 0.0;
3362 /* sv_utf8_upgrade() is now a macro using sv_utf8_upgrade_flags();
3363 * this function provided for binary compatibility only
3368 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3370 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3374 =for apidoc sv_utf8_upgrade
3376 Convert the PV of an SV to its UTF8-encoded form.
3377 Forces the SV to string form if it is not already.
3378 Always sets the SvUTF8 flag to avoid future validity checks even
3379 if all the bytes have hibit clear.
3381 This is not as a general purpose byte encoding to Unicode interface:
3382 use the Encode extension for that.
3384 =for apidoc sv_utf8_upgrade_flags
3386 Convert the PV of an SV to its UTF8-encoded form.
3387 Forces the SV to string form if it is not already.
3388 Always sets the SvUTF8 flag to avoid future validity checks even
3389 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3390 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3391 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3393 This is not as a general purpose byte encoding to Unicode interface:
3394 use the Encode extension for that.
3400 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3410 (void) sv_2pv_flags(sv,&len, flags);
3418 if (SvREADONLY(sv) && SvFAKE(sv)) {
3419 sv_force_normal(sv);
3422 if (PL_encoding && !(flags & SV_UTF8_NO_ENCODING))
3423 sv_recode_to_utf8(sv, PL_encoding);
3424 else { /* Assume Latin-1/EBCDIC */
3425 /* This function could be much more efficient if we
3426 * had a FLAG in SVs to signal if there are any hibit
3427 * chars in the PV. Given that there isn't such a flag
3428 * make the loop as fast as possible. */
3429 s = (U8 *) SvPVX(sv);
3430 e = (U8 *) SvEND(sv);
3434 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3440 len = SvCUR(sv) + 1; /* Plus the \0 */
3441 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3442 SvCUR(sv) = len - 1;
3444 Safefree(s); /* No longer using what was there before. */
3445 SvLEN(sv) = len; /* No longer know the real size. */
3447 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3454 =for apidoc sv_utf8_downgrade
3456 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3457 This may not be possible if the PV contains non-byte encoding characters;
3458 if this is the case, either returns false or, if C<fail_ok> is not
3461 This is not as a general purpose Unicode to byte encoding interface:
3462 use the Encode extension for that.
3468 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3470 if (SvPOK(sv) && SvUTF8(sv)) {
3475 if (SvREADONLY(sv) && SvFAKE(sv))
3476 sv_force_normal(sv);
3477 s = (U8 *) SvPV(sv, len);
3478 if (!utf8_to_bytes(s, &len)) {
3483 Perl_croak(aTHX_ "Wide character in %s",
3486 Perl_croak(aTHX_ "Wide character");
3497 =for apidoc sv_utf8_encode
3499 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3500 flag so that it looks like octets again. Used as a building block
3501 for encode_utf8 in Encode.xs
3507 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3509 (void) sv_utf8_upgrade(sv);
3514 =for apidoc sv_utf8_decode
3516 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3517 turn off SvUTF8 if needed so that we see characters. Used as a building block
3518 for decode_utf8 in Encode.xs
3524 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3530 /* The octets may have got themselves encoded - get them back as
3533 if (!sv_utf8_downgrade(sv, TRUE))
3536 /* it is actually just a matter of turning the utf8 flag on, but
3537 * we want to make sure everything inside is valid utf8 first.
3539 c = (U8 *) SvPVX(sv);
3540 if (!is_utf8_string(c, SvCUR(sv)+1))
3542 e = (U8 *) SvEND(sv);
3545 if (!UTF8_IS_INVARIANT(ch)) {
3554 /* sv_setsv() is now a macro using Perl_sv_setsv_flags();
3555 * this function provided for binary compatibility only
3559 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3561 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3565 =for apidoc sv_setsv
3567 Copies the contents of the source SV C<ssv> into the destination SV
3568 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3569 function if the source SV needs to be reused. Does not handle 'set' magic.
3570 Loosely speaking, it performs a copy-by-value, obliterating any previous
3571 content of the destination.
3573 You probably want to use one of the assortment of wrappers, such as
3574 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3575 C<SvSetMagicSV_nosteal>.
3577 =for apidoc sv_setsv_flags
3579 Copies the contents of the source SV C<ssv> into the destination SV
3580 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3581 function if the source SV needs to be reused. Does not handle 'set' magic.
3582 Loosely speaking, it performs a copy-by-value, obliterating any previous
3583 content of the destination.
3584 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3585 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3586 implemented in terms of this function.
3588 You probably want to use one of the assortment of wrappers, such as
3589 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3590 C<SvSetMagicSV_nosteal>.
3592 This is the primary function for copying scalars, and most other
3593 copy-ish functions and macros use this underneath.
3599 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3601 register U32 sflags;
3607 SV_CHECK_THINKFIRST(dstr);
3609 sstr = &PL_sv_undef;
3610 stype = SvTYPE(sstr);
3611 dtype = SvTYPE(dstr);
3616 /* need to nuke the magic */
3618 SvRMAGICAL_off(dstr);
3621 /* There's a lot of redundancy below but we're going for speed here */
3626 if (dtype != SVt_PVGV) {
3627 (void)SvOK_off(dstr);
3635 sv_upgrade(dstr, SVt_IV);
3638 sv_upgrade(dstr, SVt_PVNV);
3642 sv_upgrade(dstr, SVt_PVIV);
3645 (void)SvIOK_only(dstr);
3646 SvIVX(dstr) = SvIVX(sstr);
3649 if (SvTAINTED(sstr))
3660 sv_upgrade(dstr, SVt_NV);
3665 sv_upgrade(dstr, SVt_PVNV);
3668 SvNVX(dstr) = SvNVX(sstr);
3669 (void)SvNOK_only(dstr);
3670 if (SvTAINTED(sstr))
3678 sv_upgrade(dstr, SVt_RV);
3679 else if (dtype == SVt_PVGV &&
3680 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3683 if (GvIMPORTED(dstr) != GVf_IMPORTED
3684 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3686 GvIMPORTED_on(dstr);
3697 sv_upgrade(dstr, SVt_PV);
3700 if (dtype < SVt_PVIV)
3701 sv_upgrade(dstr, SVt_PVIV);
3704 if (dtype < SVt_PVNV)
3705 sv_upgrade(dstr, SVt_PVNV);
3712 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3715 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3719 if (dtype <= SVt_PVGV) {
3721 if (dtype != SVt_PVGV) {
3722 char *name = GvNAME(sstr);
3723 STRLEN len = GvNAMELEN(sstr);
3724 sv_upgrade(dstr, SVt_PVGV);
3725 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3726 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3727 GvNAME(dstr) = savepvn(name, len);
3728 GvNAMELEN(dstr) = len;
3729 SvFAKE_on(dstr); /* can coerce to non-glob */
3731 /* ahem, death to those who redefine active sort subs */
3732 else if (PL_curstackinfo->si_type == PERLSI_SORT
3733 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3734 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3737 #ifdef GV_UNIQUE_CHECK
3738 if (GvUNIQUE((GV*)dstr)) {
3739 Perl_croak(aTHX_ PL_no_modify);
3743 (void)SvOK_off(dstr);
3744 GvINTRO_off(dstr); /* one-shot flag */
3746 GvGP(dstr) = gp_ref(GvGP(sstr));
3747 if (SvTAINTED(sstr))
3749 if (GvIMPORTED(dstr) != GVf_IMPORTED
3750 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3752 GvIMPORTED_on(dstr);
3760 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3762 if ((int)SvTYPE(sstr) != stype) {
3763 stype = SvTYPE(sstr);
3764 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3768 if (stype == SVt_PVLV)
3769 (void)SvUPGRADE(dstr, SVt_PVNV);
3771 (void)SvUPGRADE(dstr, (U32)stype);
3774 sflags = SvFLAGS(sstr);
3776 if (sflags & SVf_ROK) {
3777 if (dtype >= SVt_PV) {
3778 if (dtype == SVt_PVGV) {
3779 SV *sref = SvREFCNT_inc(SvRV(sstr));
3781 int intro = GvINTRO(dstr);
3783 #ifdef GV_UNIQUE_CHECK
3784 if (GvUNIQUE((GV*)dstr)) {
3785 Perl_croak(aTHX_ PL_no_modify);
3790 GvINTRO_off(dstr); /* one-shot flag */
3791 GvLINE(dstr) = CopLINE(PL_curcop);
3792 GvEGV(dstr) = (GV*)dstr;
3795 switch (SvTYPE(sref)) {
3798 SAVEGENERICSV(GvAV(dstr));
3800 dref = (SV*)GvAV(dstr);
3801 GvAV(dstr) = (AV*)sref;
3802 if (!GvIMPORTED_AV(dstr)
3803 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3805 GvIMPORTED_AV_on(dstr);
3810 SAVEGENERICSV(GvHV(dstr));
3812 dref = (SV*)GvHV(dstr);
3813 GvHV(dstr) = (HV*)sref;
3814 if (!GvIMPORTED_HV(dstr)
3815 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3817 GvIMPORTED_HV_on(dstr);
3822 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3823 SvREFCNT_dec(GvCV(dstr));
3824 GvCV(dstr) = Nullcv;
3825 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3826 PL_sub_generation++;
3828 SAVEGENERICSV(GvCV(dstr));
3831 dref = (SV*)GvCV(dstr);
3832 if (GvCV(dstr) != (CV*)sref) {
3833 CV* cv = GvCV(dstr);
3835 if (!GvCVGEN((GV*)dstr) &&
3836 (CvROOT(cv) || CvXSUB(cv)))
3838 /* ahem, death to those who redefine
3839 * active sort subs */
3840 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3841 PL_sortcop == CvSTART(cv))
3843 "Can't redefine active sort subroutine %s",
3844 GvENAME((GV*)dstr));
3845 /* Redefining a sub - warning is mandatory if
3846 it was a const and its value changed. */
3847 if (ckWARN(WARN_REDEFINE)
3849 && (!CvCONST((CV*)sref)
3850 || sv_cmp(cv_const_sv(cv),
3851 cv_const_sv((CV*)sref)))))
3853 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
3855 ? "Constant subroutine %s::%s redefined"
3856 : "Subroutine %s::%s redefined",
3857 HvNAME(GvSTASH((GV*)dstr)),
3858 GvENAME((GV*)dstr));
3862 cv_ckproto(cv, (GV*)dstr,
3863 SvPOK(sref) ? SvPVX(sref) : Nullch);
3865 GvCV(dstr) = (CV*)sref;
3866 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3867 GvASSUMECV_on(dstr);
3868 PL_sub_generation++;
3870 if (!GvIMPORTED_CV(dstr)
3871 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3873 GvIMPORTED_CV_on(dstr);
3878 SAVEGENERICSV(GvIOp(dstr));
3880 dref = (SV*)GvIOp(dstr);
3881 GvIOp(dstr) = (IO*)sref;
3885 SAVEGENERICSV(GvFORM(dstr));
3887 dref = (SV*)GvFORM(dstr);
3888 GvFORM(dstr) = (CV*)sref;
3892 SAVEGENERICSV(GvSV(dstr));
3894 dref = (SV*)GvSV(dstr);
3896 if (!GvIMPORTED_SV(dstr)
3897 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3899 GvIMPORTED_SV_on(dstr);
3905 if (SvTAINTED(sstr))
3910 (void)SvOOK_off(dstr); /* backoff */
3912 Safefree(SvPVX(dstr));
3913 SvLEN(dstr)=SvCUR(dstr)=0;
3916 (void)SvOK_off(dstr);
3917 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3919 if (sflags & SVp_NOK) {
3921 /* Only set the public OK flag if the source has public OK. */
3922 if (sflags & SVf_NOK)
3923 SvFLAGS(dstr) |= SVf_NOK;
3924 SvNVX(dstr) = SvNVX(sstr);
3926 if (sflags & SVp_IOK) {
3927 (void)SvIOKp_on(dstr);
3928 if (sflags & SVf_IOK)
3929 SvFLAGS(dstr) |= SVf_IOK;
3930 if (sflags & SVf_IVisUV)
3932 SvIVX(dstr) = SvIVX(sstr);
3934 if (SvAMAGIC(sstr)) {
3938 else if (sflags & SVp_POK) {
3941 * Check to see if we can just swipe the string. If so, it's a
3942 * possible small lose on short strings, but a big win on long ones.
3943 * It might even be a win on short strings if SvPVX(dstr)
3944 * has to be allocated and SvPVX(sstr) has to be freed.
3947 if (SvTEMP(sstr) && /* slated for free anyway? */
3948 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3949 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3950 SvLEN(sstr) && /* and really is a string */
3951 /* and won't be needed again, potentially */
3952 !(PL_op && PL_op->op_type == OP_AASSIGN))
3954 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3956 SvFLAGS(dstr) &= ~SVf_OOK;
3957 Safefree(SvPVX(dstr) - SvIVX(dstr));
3959 else if (SvLEN(dstr))
3960 Safefree(SvPVX(dstr));
3962 (void)SvPOK_only(dstr);
3963 SvPV_set(dstr, SvPVX(sstr));
3964 SvLEN_set(dstr, SvLEN(sstr));
3965 SvCUR_set(dstr, SvCUR(sstr));
3968 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3969 SvPV_set(sstr, Nullch);
3974 else { /* have to copy actual string */
3975 STRLEN len = SvCUR(sstr);
3976 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3977 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3978 SvCUR_set(dstr, len);
3979 *SvEND(dstr) = '\0';
3980 (void)SvPOK_only(dstr);
3982 if (sflags & SVf_UTF8)
3985 if (sflags & SVp_NOK) {
3987 if (sflags & SVf_NOK)
3988 SvFLAGS(dstr) |= SVf_NOK;
3989 SvNVX(dstr) = SvNVX(sstr);
3991 if (sflags & SVp_IOK) {
3992 (void)SvIOKp_on(dstr);
3993 if (sflags & SVf_IOK)
3994 SvFLAGS(dstr) |= SVf_IOK;
3995 if (sflags & SVf_IVisUV)
3997 SvIVX(dstr) = SvIVX(sstr);
3999 if ( SvVOK(sstr) ) {
4000 MAGIC *smg = mg_find(sstr,PERL_MAGIC_vstring);
4001 sv_magic(dstr, NULL, PERL_MAGIC_vstring,
4002 smg->mg_ptr, smg->mg_len);
4003 SvRMAGICAL_on(dstr);
4006 else if (sflags & SVp_IOK) {
4007 if (sflags & SVf_IOK)
4008 (void)SvIOK_only(dstr);
4010 (void)SvOK_off(dstr);
4011 (void)SvIOKp_on(dstr);
4013 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
4014 if (sflags & SVf_IVisUV)
4016 SvIVX(dstr) = SvIVX(sstr);
4017 if (sflags & SVp_NOK) {
4018 if (sflags & SVf_NOK)
4019 (void)SvNOK_on(dstr);
4021 (void)SvNOKp_on(dstr);
4022 SvNVX(dstr) = SvNVX(sstr);
4025 else if (sflags & SVp_NOK) {
4026 if (sflags & SVf_NOK)
4027 (void)SvNOK_only(dstr);
4029 (void)SvOK_off(dstr);
4032 SvNVX(dstr) = SvNVX(sstr);
4035 if (dtype == SVt_PVGV) {
4036 if (ckWARN(WARN_MISC))
4037 Perl_warner(aTHX_ packWARN(WARN_MISC), "Undefined value assigned to typeglob");
4040 (void)SvOK_off(dstr);
4042 if (SvTAINTED(sstr))
4047 =for apidoc sv_setsv_mg
4049 Like C<sv_setsv>, but also handles 'set' magic.
4055 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
4057 sv_setsv(dstr,sstr);
4062 =for apidoc sv_setpvn
4064 Copies a string into an SV. The C<len> parameter indicates the number of
4065 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
4071 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4073 register char *dptr;
4075 SV_CHECK_THINKFIRST(sv);
4081 /* len is STRLEN which is unsigned, need to copy to signed */
4084 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
4086 (void)SvUPGRADE(sv, SVt_PV);
4088 SvGROW(sv, len + 1);
4090 Move(ptr,dptr,len,char);
4093 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4098 =for apidoc sv_setpvn_mg
4100 Like C<sv_setpvn>, but also handles 'set' magic.
4106 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4108 sv_setpvn(sv,ptr,len);
4113 =for apidoc sv_setpv
4115 Copies a string into an SV. The string must be null-terminated. Does not
4116 handle 'set' magic. See C<sv_setpv_mg>.
4122 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4124 register STRLEN len;
4126 SV_CHECK_THINKFIRST(sv);
4132 (void)SvUPGRADE(sv, SVt_PV);
4134 SvGROW(sv, len + 1);
4135 Move(ptr,SvPVX(sv),len+1,char);
4137 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4142 =for apidoc sv_setpv_mg
4144 Like C<sv_setpv>, but also handles 'set' magic.
4150 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4157 =for apidoc sv_usepvn
4159 Tells an SV to use C<ptr> to find its string value. Normally the string is
4160 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4161 The C<ptr> should point to memory that was allocated by C<malloc>. The
4162 string length, C<len>, must be supplied. This function will realloc the
4163 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4164 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4165 See C<sv_usepvn_mg>.
4171 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4173 SV_CHECK_THINKFIRST(sv);
4174 (void)SvUPGRADE(sv, SVt_PV);
4179 (void)SvOOK_off(sv);
4180 if (SvPVX(sv) && SvLEN(sv))
4181 Safefree(SvPVX(sv));
4182 Renew(ptr, len+1, char);
4185 SvLEN_set(sv, len+1);
4187 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4192 =for apidoc sv_usepvn_mg
4194 Like C<sv_usepvn>, but also handles 'set' magic.
4200 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4202 sv_usepvn(sv,ptr,len);
4207 =for apidoc sv_force_normal_flags
4209 Undo various types of fakery on an SV: if the PV is a shared string, make
4210 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4211 an xpvmg. The C<flags> parameter gets passed to C<sv_unref_flags()>
4212 when unrefing. C<sv_force_normal> calls this function with flags set to 0.
4218 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4220 if (SvREADONLY(sv)) {
4222 char *pvx = SvPVX(sv);
4223 STRLEN len = SvCUR(sv);
4224 U32 hash = SvUVX(sv);
4225 SvGROW(sv, len + 1);
4226 Move(pvx,SvPVX(sv),len,char);
4230 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4232 else if (PL_curcop != &PL_compiling)
4233 Perl_croak(aTHX_ PL_no_modify);
4236 sv_unref_flags(sv, flags);
4237 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4242 =for apidoc sv_force_normal
4244 Undo various types of fakery on an SV: if the PV is a shared string, make
4245 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4246 an xpvmg. See also C<sv_force_normal_flags>.
4252 Perl_sv_force_normal(pTHX_ register SV *sv)
4254 sv_force_normal_flags(sv, 0);
4260 Efficient removal of characters from the beginning of the string buffer.
4261 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4262 the string buffer. The C<ptr> becomes the first character of the adjusted
4263 string. Uses the "OOK hack".
4264 Beware: after this function returns, C<ptr> and SvPVX(sv) may no longer
4265 refer to the same chunk of data.
4271 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4273 register STRLEN delta;
4274 if (!ptr || !SvPOKp(sv))
4276 delta = ptr - SvPVX(sv);
4277 SV_CHECK_THINKFIRST(sv);
4278 if (SvTYPE(sv) < SVt_PVIV)
4279 sv_upgrade(sv,SVt_PVIV);
4282 if (!SvLEN(sv)) { /* make copy of shared string */
4283 char *pvx = SvPVX(sv);
4284 STRLEN len = SvCUR(sv);
4285 SvGROW(sv, len + 1);
4286 Move(pvx,SvPVX(sv),len,char);
4290 /* Same SvOOK_on but SvOOK_on does a SvIOK_off
4291 and we do that anyway inside the SvNIOK_off
4293 SvFLAGS(sv) |= SVf_OOK;
4302 /* sv_catpvn() is now a macro using Perl_sv_catpvn_flags();
4303 * this function provided for binary compatibility only
4307 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4309 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4313 =for apidoc sv_catpvn
4315 Concatenates the string onto the end of the string which is in the SV. The
4316 C<len> indicates number of bytes to copy. If the SV has the UTF8
4317 status set, then the bytes appended should be valid UTF8.
4318 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4320 =for apidoc sv_catpvn_flags
4322 Concatenates the string onto the end of the string which is in the SV. The
4323 C<len> indicates number of bytes to copy. If the SV has the UTF8
4324 status set, then the bytes appended should be valid UTF8.
4325 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4326 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4327 in terms of this function.
4333 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4338 dstr = SvPV_force_flags(dsv, dlen, flags);
4339 SvGROW(dsv, dlen + slen + 1);
4342 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4345 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4350 =for apidoc sv_catpvn_mg
4352 Like C<sv_catpvn>, but also handles 'set' magic.
4358 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4360 sv_catpvn(sv,ptr,len);
4364 /* sv_catsv() is now a macro using Perl_sv_catsv_flags();
4365 * this function provided for binary compatibility only
4369 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4371 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4375 =for apidoc sv_catsv
4377 Concatenates the string from SV C<ssv> onto the end of the string in
4378 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4379 not 'set' magic. See C<sv_catsv_mg>.
4381 =for apidoc sv_catsv_flags
4383 Concatenates the string from SV C<ssv> onto the end of the string in
4384 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4385 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4386 and C<sv_catsv_nomg> are implemented in terms of this function.
4391 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4397 if ((spv = SvPV(ssv, slen))) {
4398 /* sutf8 and dutf8 were type bool, but under USE_ITHREADS,
4399 gcc version 2.95.2 20000220 (Debian GNU/Linux) for
4400 Linux xxx 2.2.17 on sparc64 with gcc -O2, we erroneously
4401 get dutf8 = 0x20000000, (i.e. SVf_UTF8) even though
4402 dsv->sv_flags doesn't have that bit set.
4403 Andy Dougherty 12 Oct 2001
4405 I32 sutf8 = DO_UTF8(ssv);
4408 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4410 dutf8 = DO_UTF8(dsv);
4412 if (dutf8 != sutf8) {
4414 /* Not modifying source SV, so taking a temporary copy. */
4415 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4417 sv_utf8_upgrade(csv);
4418 spv = SvPV(csv, slen);
4421 sv_utf8_upgrade_nomg(dsv);
4423 sv_catpvn_nomg(dsv, spv, slen);
4428 =for apidoc sv_catsv_mg
4430 Like C<sv_catsv>, but also handles 'set' magic.
4436 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4443 =for apidoc sv_catpv
4445 Concatenates the string onto the end of the string which is in the SV.
4446 If the SV has the UTF8 status set, then the bytes appended should be
4447 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4452 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4454 register STRLEN len;
4460 junk = SvPV_force(sv, tlen);
4462 SvGROW(sv, tlen + len + 1);
4465 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4467 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4472 =for apidoc sv_catpv_mg
4474 Like C<sv_catpv>, but also handles 'set' magic.
4480 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4489 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4490 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4497 Perl_newSV(pTHX_ STRLEN len)
4503 sv_upgrade(sv, SVt_PV);
4504 SvGROW(sv, len + 1);
4509 =for apidoc sv_magicext
4511 Adds magic to an SV, upgrading it if necessary. Applies the
4512 supplied vtable and returns pointer to the magic added.
4514 Note that sv_magicext will allow things that sv_magic will not.
4515 In particular you can add magic to SvREADONLY SVs and and more than
4516 one instance of the same 'how'
4518 I C<namelen> is greater then zero then a savepvn() I<copy> of C<name> is stored,
4519 if C<namelen> is zero then C<name> is stored as-is and - as another special
4520 case - if C<(name && namelen == HEf_SVKEY)> then C<name> is assumed to contain
4521 an C<SV*> and has its REFCNT incremented
4523 (This is now used as a subroutine by sv_magic.)
4528 Perl_sv_magicext(pTHX_ SV* sv, SV* obj, int how, MGVTBL *vtable,
4529 const char* name, I32 namlen)
4533 if (SvTYPE(sv) < SVt_PVMG) {
4534 (void)SvUPGRADE(sv, SVt_PVMG);
4536 Newz(702,mg, 1, MAGIC);
4537 mg->mg_moremagic = SvMAGIC(sv);
4540 /* Some magic sontains a reference loop, where the sv and object refer to
4541 each other. To prevent a reference loop that would prevent such
4542 objects being freed, we look for such loops and if we find one we
4543 avoid incrementing the object refcount.
4545 Note we cannot do this to avoid self-tie loops as intervening RV must
4546 have its REFCNT incremented to keep it in existence.
4549 if (!obj || obj == sv ||
4550 how == PERL_MAGIC_arylen ||
4551 how == PERL_MAGIC_qr ||
4552 (SvTYPE(obj) == SVt_PVGV &&
4553 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4554 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4555 GvFORM(obj) == (CV*)sv)))
4560 mg->mg_obj = SvREFCNT_inc(obj);
4561 mg->mg_flags |= MGf_REFCOUNTED;
4564 /* Normal self-ties simply pass a null object, and instead of
4565 using mg_obj directly, use the SvTIED_obj macro to produce a
4566 new RV as needed. For glob "self-ties", we are tieing the PVIO
4567 with an RV obj pointing to the glob containing the PVIO. In
4568 this case, to avoid a reference loop, we need to weaken the
4572 if (how == PERL_MAGIC_tiedscalar && SvTYPE(sv) == SVt_PVIO &&
4573 obj && SvROK(obj) && GvIO(SvRV(obj)) == (IO*)sv)
4579 mg->mg_len = namlen;
4582 mg->mg_ptr = savepvn(name, namlen);
4583 else if (namlen == HEf_SVKEY)
4584 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4586 mg->mg_ptr = (char *) name;
4588 mg->mg_virtual = vtable;
4592 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4597 =for apidoc sv_magic
4599 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4600 then adds a new magic item of type C<how> to the head of the magic list.
4606 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4611 if (SvREADONLY(sv)) {
4612 if (PL_curcop != &PL_compiling
4613 && how != PERL_MAGIC_regex_global
4614 && how != PERL_MAGIC_bm
4615 && how != PERL_MAGIC_fm
4616 && how != PERL_MAGIC_sv
4619 Perl_croak(aTHX_ PL_no_modify);
4622 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4623 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4624 /* sv_magic() refuses to add a magic of the same 'how' as an
4627 if (how == PERL_MAGIC_taint)
4635 vtable = &PL_vtbl_sv;
4637 case PERL_MAGIC_overload:
4638 vtable = &PL_vtbl_amagic;
4640 case PERL_MAGIC_overload_elem:
4641 vtable = &PL_vtbl_amagicelem;
4643 case PERL_MAGIC_overload_table:
4644 vtable = &PL_vtbl_ovrld;
4647 vtable = &PL_vtbl_bm;
4649 case PERL_MAGIC_regdata:
4650 vtable = &PL_vtbl_regdata;
4652 case PERL_MAGIC_regdatum:
4653 vtable = &PL_vtbl_regdatum;
4655 case PERL_MAGIC_env:
4656 vtable = &PL_vtbl_env;
4659 vtable = &PL_vtbl_fm;
4661 case PERL_MAGIC_envelem:
4662 vtable = &PL_vtbl_envelem;
4664 case PERL_MAGIC_regex_global:
4665 vtable = &PL_vtbl_mglob;
4667 case PERL_MAGIC_isa:
4668 vtable = &PL_vtbl_isa;
4670 case PERL_MAGIC_isaelem:
4671 vtable = &PL_vtbl_isaelem;
4673 case PERL_MAGIC_nkeys:
4674 vtable = &PL_vtbl_nkeys;
4676 case PERL_MAGIC_dbfile:
4679 case PERL_MAGIC_dbline:
4680 vtable = &PL_vtbl_dbline;
4682 #ifdef USE_5005THREADS
4683 case PERL_MAGIC_mutex:
4684 vtable = &PL_vtbl_mutex;
4686 #endif /* USE_5005THREADS */
4687 #ifdef USE_LOCALE_COLLATE
4688 case PERL_MAGIC_collxfrm:
4689 vtable = &PL_vtbl_collxfrm;
4691 #endif /* USE_LOCALE_COLLATE */
4692 case PERL_MAGIC_tied:
4693 vtable = &PL_vtbl_pack;
4695 case PERL_MAGIC_tiedelem:
4696 case PERL_MAGIC_tiedscalar:
4697 vtable = &PL_vtbl_packelem;
4700 vtable = &PL_vtbl_regexp;
4702 case PERL_MAGIC_sig:
4703 vtable = &PL_vtbl_sig;
4705 case PERL_MAGIC_sigelem:
4706 vtable = &PL_vtbl_sigelem;
4708 case PERL_MAGIC_taint:
4709 vtable = &PL_vtbl_taint;
4711 case PERL_MAGIC_uvar:
4712 vtable = &PL_vtbl_uvar;
4714 case PERL_MAGIC_vec:
4715 vtable = &PL_vtbl_vec;
4717 case PERL_MAGIC_vstring:
4720 case PERL_MAGIC_utf8:
4721 vtable = &PL_vtbl_utf8;
4723 case PERL_MAGIC_substr:
4724 vtable = &PL_vtbl_substr;
4726 case PERL_MAGIC_defelem:
4727 vtable = &PL_vtbl_defelem;
4729 case PERL_MAGIC_glob:
4730 vtable = &PL_vtbl_glob;
4732 case PERL_MAGIC_arylen:
4733 vtable = &PL_vtbl_arylen;
4735 case PERL_MAGIC_pos:
4736 vtable = &PL_vtbl_pos;
4738 case PERL_MAGIC_backref:
4739 vtable = &PL_vtbl_backref;
4741 case PERL_MAGIC_ext:
4742 /* Reserved for use by extensions not perl internals. */
4743 /* Useful for attaching extension internal data to perl vars. */
4744 /* Note that multiple extensions may clash if magical scalars */
4745 /* etc holding private data from one are passed to another. */
4748 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4751 /* Rest of work is done else where */
4752 mg = sv_magicext(sv,obj,how,vtable,name,namlen);
4755 case PERL_MAGIC_taint:
4758 case PERL_MAGIC_ext:
4759 case PERL_MAGIC_dbfile:
4766 =for apidoc sv_unmagic
4768 Removes all magic of type C<type> from an SV.
4774 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4778 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4781 for (mg = *mgp; mg; mg = *mgp) {
4782 if (mg->mg_type == type) {
4783 MGVTBL* vtbl = mg->mg_virtual;
4784 *mgp = mg->mg_moremagic;
4785 if (vtbl && vtbl->svt_free)
4786 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4787 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4789 Safefree(mg->mg_ptr);
4790 else if (mg->mg_len == HEf_SVKEY)
4791 SvREFCNT_dec((SV*)mg->mg_ptr);
4792 else if (mg->mg_type == PERL_MAGIC_utf8 && mg->mg_ptr)
4793 Safefree(mg->mg_ptr);
4795 if (mg->mg_flags & MGf_REFCOUNTED)
4796 SvREFCNT_dec(mg->mg_obj);
4800 mgp = &mg->mg_moremagic;
4804 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4811 =for apidoc sv_rvweaken
4813 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4814 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4815 push a back-reference to this RV onto the array of backreferences
4816 associated with that magic.
4822 Perl_sv_rvweaken(pTHX_ SV *sv)
4825 if (!SvOK(sv)) /* let undefs pass */
4828 Perl_croak(aTHX_ "Can't weaken a nonreference");
4829 else if (SvWEAKREF(sv)) {
4830 if (ckWARN(WARN_MISC))
4831 Perl_warner(aTHX_ packWARN(WARN_MISC), "Reference is already weak");
4835 sv_add_backref(tsv, sv);
4841 /* Give tsv backref magic if it hasn't already got it, then push a
4842 * back-reference to sv onto the array associated with the backref magic.
4846 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4850 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4851 av = (AV*)mg->mg_obj;
4854 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4855 SvREFCNT_dec(av); /* for sv_magic */
4857 if (AvFILLp(av) >= AvMAX(av)) {
4858 SV **svp = AvARRAY(av);
4859 I32 i = AvFILLp(av);
4861 if (svp[i] == &PL_sv_undef) {
4862 svp[i] = sv; /* reuse the slot */
4867 av_extend(av, AvFILLp(av)+1);
4869 AvARRAY(av)[++AvFILLp(av)] = sv; /* av_push() */
4872 /* delete a back-reference to ourselves from the backref magic associated
4873 * with the SV we point to.
4877 S_sv_del_backref(pTHX_ SV *sv)
4884 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4885 Perl_croak(aTHX_ "panic: del_backref");
4886 av = (AV *)mg->mg_obj;
4891 svp[i] = &PL_sv_undef; /* XXX */
4898 =for apidoc sv_insert
4900 Inserts a string at the specified offset/length within the SV. Similar to
4901 the Perl substr() function.
4907 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4911 register char *midend;
4912 register char *bigend;
4918 Perl_croak(aTHX_ "Can't modify non-existent substring");
4919 SvPV_force(bigstr, curlen);
4920 (void)SvPOK_only_UTF8(bigstr);
4921 if (offset + len > curlen) {
4922 SvGROW(bigstr, offset+len+1);
4923 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4924 SvCUR_set(bigstr, offset+len);
4928 i = littlelen - len;
4929 if (i > 0) { /* string might grow */
4930 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4931 mid = big + offset + len;
4932 midend = bigend = big + SvCUR(bigstr);
4935 while (midend > mid) /* shove everything down */
4936 *--bigend = *--midend;
4937 Move(little,big+offset,littlelen,char);
4943 Move(little,SvPVX(bigstr)+offset,len,char);
4948 big = SvPVX(bigstr);
4951 bigend = big + SvCUR(bigstr);
4953 if (midend > bigend)
4954 Perl_croak(aTHX_ "panic: sv_insert");
4956 if (mid - big > bigend - midend) { /* faster to shorten from end */
4958 Move(little, mid, littlelen,char);
4961 i = bigend - midend;
4963 Move(midend, mid, i,char);
4967 SvCUR_set(bigstr, mid - big);
4970 else if ((i = mid - big)) { /* faster from front */
4971 midend -= littlelen;
4973 sv_chop(bigstr,midend-i);
4978 Move(little, mid, littlelen,char);
4980 else if (littlelen) {
4981 midend -= littlelen;
4982 sv_chop(bigstr,midend);
4983 Move(little,midend,littlelen,char);
4986 sv_chop(bigstr,midend);
4992 =for apidoc sv_replace
4994 Make the first argument a copy of the second, then delete the original.
4995 The target SV physically takes over ownership of the body of the source SV
4996 and inherits its flags; however, the target keeps any magic it owns,
4997 and any magic in the source is discarded.
4998 Note that this is a rather specialist SV copying operation; most of the
4999 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
5005 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
5007 U32 refcnt = SvREFCNT(sv);
5008 SV_CHECK_THINKFIRST(sv);
5009 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
5010 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Reference miscount in sv_replace()");
5011 if (SvMAGICAL(sv)) {
5015 sv_upgrade(nsv, SVt_PVMG);
5016 SvMAGIC(nsv) = SvMAGIC(sv);
5017 SvFLAGS(nsv) |= SvMAGICAL(sv);
5023 assert(!SvREFCNT(sv));
5024 StructCopy(nsv,sv,SV);
5025 SvREFCNT(sv) = refcnt;
5026 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
5031 =for apidoc sv_clear
5033 Clear an SV: call any destructors, free up any memory used by the body,
5034 and free the body itself. The SV's head is I<not> freed, although
5035 its type is set to all 1's so that it won't inadvertently be assumed
5036 to be live during global destruction etc.
5037 This function should only be called when REFCNT is zero. Most of the time
5038 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
5045 Perl_sv_clear(pTHX_ register SV *sv)
5049 assert(SvREFCNT(sv) == 0);
5052 if (PL_defstash) { /* Still have a symbol table? */
5059 stash = SvSTASH(sv);
5060 destructor = StashHANDLER(stash,DESTROY);
5062 SV* tmpref = newRV(sv);
5063 SvREADONLY_on(tmpref); /* DESTROY() could be naughty */
5065 PUSHSTACKi(PERLSI_DESTROY);
5070 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR|G_VOID);
5076 if(SvREFCNT(tmpref) < 2) {
5077 /* tmpref is not kept alive! */
5082 SvREFCNT_dec(tmpref);
5084 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
5088 if (PL_in_clean_objs)
5089 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
5091 /* DESTROY gave object new lease on life */
5097 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
5098 SvOBJECT_off(sv); /* Curse the object. */
5099 if (SvTYPE(sv) != SVt_PVIO)
5100 --PL_sv_objcount; /* XXX Might want something more general */
5103 if (SvTYPE(sv) >= SVt_PVMG) {
5106 if (SvFLAGS(sv) & SVpad_TYPED)
5107 SvREFCNT_dec(SvSTASH(sv));
5110 switch (SvTYPE(sv)) {
5113 IoIFP(sv) != PerlIO_stdin() &&
5114 IoIFP(sv) != PerlIO_stdout() &&
5115 IoIFP(sv) != PerlIO_stderr())
5117 io_close((IO*)sv, FALSE);
5119 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
5120 PerlDir_close(IoDIRP(sv));
5121 IoDIRP(sv) = (DIR*)NULL;
5122 Safefree(IoTOP_NAME(sv));
5123 Safefree(IoFMT_NAME(sv));
5124 Safefree(IoBOTTOM_NAME(sv));
5139 if (LvTYPE(sv) == 'T') { /* for tie: return HE to pool */
5140 SvREFCNT_dec(HeKEY_sv((HE*)LvTARG(sv)));
5141 HeNEXT((HE*)LvTARG(sv)) = PL_hv_fetch_ent_mh;
5142 PL_hv_fetch_ent_mh = (HE*)LvTARG(sv);
5144 else if (LvTYPE(sv) != 't') /* unless tie: unrefcnted fake SV** */
5145 SvREFCNT_dec(LvTARG(sv));
5149 Safefree(GvNAME(sv));
5150 /* cannot decrease stash refcount yet, as we might recursively delete
5151 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
5152 of stash until current sv is completely gone.
5153 -- JohnPC, 27 Mar 1998 */
5154 stash = GvSTASH(sv);
5160 (void)SvOOK_off(sv);
5168 SvREFCNT_dec(SvRV(sv));
5170 else if (SvPVX(sv) && SvLEN(sv))
5171 Safefree(SvPVX(sv));
5172 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
5173 unsharepvn(SvPVX(sv),
5174 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
5187 switch (SvTYPE(sv)) {
5203 del_XPVIV(SvANY(sv));
5206 del_XPVNV(SvANY(sv));
5209 del_XPVMG(SvANY(sv));
5212 del_XPVLV(SvANY(sv));
5215 del_XPVAV(SvANY(sv));
5218 del_XPVHV(SvANY(sv));
5221 del_XPVCV(SvANY(sv));
5224 del_XPVGV(SvANY(sv));
5225 /* code duplication for increased performance. */
5226 SvFLAGS(sv) &= SVf_BREAK;
5227 SvFLAGS(sv) |= SVTYPEMASK;
5228 /* decrease refcount of the stash that owns this GV, if any */
5230 SvREFCNT_dec(stash);
5231 return; /* not break, SvFLAGS reset already happened */
5233 del_XPVBM(SvANY(sv));
5236 del_XPVFM(SvANY(sv));
5239 del_XPVIO(SvANY(sv));
5242 SvFLAGS(sv) &= SVf_BREAK;
5243 SvFLAGS(sv) |= SVTYPEMASK;
5247 =for apidoc sv_newref
5249 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5256 Perl_sv_newref(pTHX_ SV *sv)
5259 ATOMIC_INC(SvREFCNT(sv));
5266 Decrement an SV's reference count, and if it drops to zero, call
5267 C<sv_clear> to invoke destructors and free up any memory used by
5268 the body; finally, deallocate the SV's head itself.
5269 Normally called via a wrapper macro C<SvREFCNT_dec>.
5275 Perl_sv_free(pTHX_ SV *sv)
5277 int refcount_is_zero;
5281 if (SvREFCNT(sv) == 0) {
5282 if (SvFLAGS(sv) & SVf_BREAK)
5283 /* this SV's refcnt has been artificially decremented to
5284 * trigger cleanup */
5286 if (PL_in_clean_all) /* All is fair */
5288 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5289 /* make sure SvREFCNT(sv)==0 happens very seldom */
5290 SvREFCNT(sv) = (~(U32)0)/2;
5293 if (ckWARN_d(WARN_INTERNAL))
5294 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "Attempt to free unreferenced scalar");
5297 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5298 if (!refcount_is_zero)
5302 if (ckWARN_d(WARN_DEBUGGING))
5303 Perl_warner(aTHX_ packWARN(WARN_DEBUGGING),
5304 "Attempt to free temp prematurely: SV 0x%"UVxf,
5309 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5310 /* make sure SvREFCNT(sv)==0 happens very seldom */
5311 SvREFCNT(sv) = (~(U32)0)/2;
5322 Returns the length of the string in the SV. Handles magic and type
5323 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5329 Perl_sv_len(pTHX_ register SV *sv)
5337 len = mg_length(sv);
5339 (void)SvPV(sv, len);
5344 =for apidoc sv_len_utf8
5346 Returns the number of characters in the string in an SV, counting wide
5347 UTF8 bytes as a single character. Handles magic and type coercion.
5353 * The length is cached in PERL_UTF8_magic, in the mg_len field. Also the
5354 * mg_ptr is used, by sv_pos_u2b(), see the comments of S_utf8_mg_pos_init().
5355 * (Note that the mg_len is not the length of the mg_ptr field.)
5360 Perl_sv_len_utf8(pTHX_ register SV *sv)
5366 return mg_length(sv);
5370 U8 *s = (U8*)SvPV(sv, len);
5371 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_utf8) : 0;
5373 if (mg && mg->mg_len != -1 && (mg->mg_len > 0 || len == 0))
5376 ulen = Perl_utf8_length(aTHX_ s, s + len);
5377 if (!mg && !SvREADONLY(sv)) {
5378 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5379 mg = mg_find(sv, PERL_MAGIC_utf8);
5389 /* S_utf8_mg_pos_init() is used to initialize the mg_ptr field of
5390 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5391 * between UTF-8 and byte offsets. There are two (substr offset and substr
5392 * length, the i offset, PERL_MAGIC_UTF8_CACHESIZE) times two (UTF-8 offset
5393 * and byte offset) cache positions.
5395 * The mg_len field is used by sv_len_utf8(), see its comments.
5396 * Note that the mg_len is not the length of the mg_ptr field.
5400 S_utf8_mg_pos_init(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, U8 *s, U8 *start)
5404 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5406 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5407 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5412 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5414 Newz(0, *cachep, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5415 (*mgp)->mg_ptr = (char *) *cachep;
5419 (*cachep)[i] = *offsetp;
5420 (*cachep)[i+1] = s - start;
5428 * S_utf8_mg_pos() is used to query and update mg_ptr field of
5429 * a PERL_UTF8_magic. The mg_ptr is used to store the mapping
5430 * between UTF-8 and byte offsets. See also the comments of
5431 * S_utf8_mg_pos_init().
5435 S_utf8_mg_pos(pTHX_ SV *sv, MAGIC **mgp, STRLEN **cachep, I32 i, I32 *offsetp, I32 uoff, U8 **sp, U8 *start, U8 *send)
5439 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5441 *mgp = mg_find(sv, PERL_MAGIC_utf8);
5442 if (*mgp && (*mgp)->mg_ptr) {
5443 *cachep = (STRLEN *) (*mgp)->mg_ptr;
5444 if ((*cachep)[i] == (STRLEN)uoff) /* An exact match. */
5446 else { /* We will skip to the right spot. */
5451 /* The assumption is that going backward is half
5452 * the speed of going forward (that's where the
5453 * 2 * backw in the below comes from). (The real
5454 * figure of course depends on the UTF-8 data.) */
5456 if ((*cachep)[i] > (STRLEN)uoff) {
5458 backw = (*cachep)[i] - (STRLEN)uoff;
5460 if (forw < 2 * backw)
5463 p = start + (*cachep)[i+1];
5465 /* Try this only for the substr offset (i == 0),
5466 * not for the substr length (i == 2). */
5467 else if (i == 0) { /* (*cachep)[i] < uoff */
5468 STRLEN ulen = sv_len_utf8(sv);
5470 if ((STRLEN)uoff < ulen) {
5471 forw = (STRLEN)uoff - (*cachep)[i];
5472 backw = ulen - (STRLEN)uoff;
5474 if (forw < 2 * backw)
5475 p = start + (*cachep)[i+1];
5480 /* If the string is not long enough for uoff,
5481 * we could extend it, but not at this low a level. */
5485 if (forw < 2 * backw) {
5492 while (UTF8_IS_CONTINUATION(*p))
5497 /* Update the cache. */
5498 (*cachep)[i] = (STRLEN)uoff;
5499 (*cachep)[i+1] = p - start;
5504 if (found) { /* Setup the return values. */
5505 *offsetp = (*cachep)[i+1];
5506 *sp = start + *offsetp;
5509 *offsetp = send - start;
5511 else if (*sp < start) {
5523 =for apidoc sv_pos_u2b
5525 Converts the value pointed to by offsetp from a count of UTF8 chars from
5526 the start of the string, to a count of the equivalent number of bytes; if
5527 lenp is non-zero, it does the same to lenp, but this time starting from
5528 the offset, rather than from the start of the string. Handles magic and
5535 * sv_pos_u2b() uses, like sv_pos_b2u(), the mg_ptr of the potential
5536 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5537 * byte offsets. See also the comments of S_utf8_mg_pos().
5542 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5553 start = s = (U8*)SvPV(sv, len);
5555 I32 uoffset = *offsetp;
5560 if (utf8_mg_pos(sv, &mg, &cache, 0, offsetp, *offsetp, &s, start, send))
5562 if (!found && uoffset > 0) {
5563 while (s < send && uoffset--)
5567 if (utf8_mg_pos_init(sv, &mg, &cache, 0, offsetp, s, start))
5569 *offsetp = s - start;
5574 if (utf8_mg_pos(sv, &mg, &cache, 2, lenp, *lenp + *offsetp, &s, start, send)) {
5578 if (!found && *lenp > 0) {
5581 while (s < send && ulen--)
5585 if (utf8_mg_pos_init(sv, &mg, &cache, 2, lenp, s, start))
5586 cache[2] += *offsetp;
5600 =for apidoc sv_pos_b2u
5602 Converts the value pointed to by offsetp from a count of bytes from the
5603 start of the string, to a count of the equivalent number of UTF8 chars.
5604 Handles magic and type coercion.
5610 * sv_pos_b2u() uses, like sv_pos_u2b(), the mg_ptr of the potential
5611 * PERL_UTF8_magic of the sv to store the mapping between UTF-8 and
5612 * byte offsets. See also the comments of S_utf8_mg_pos().
5617 Perl_sv_pos_b2u(pTHX_ register SV* sv, I32* offsetp)
5625 s = (U8*)SvPV(sv, len);
5626 if ((I32)len < *offsetp)
5627 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5629 U8* send = s + *offsetp;
5631 STRLEN *cache = NULL;
5635 if (SvMAGICAL(sv) && !SvREADONLY(sv)) {
5636 mg = mg_find(sv, PERL_MAGIC_utf8);
5637 if (mg && mg->mg_ptr) {
5638 cache = (STRLEN *) mg->mg_ptr;
5639 if (cache[1] == (STRLEN)*offsetp) {
5640 /* An exact match. */
5641 *offsetp = cache[0];
5645 else if (cache[1] < (STRLEN)*offsetp) {
5646 /* We already know part of the way. */
5649 /* Let the below loop do the rest. */
5651 else { /* cache[1] > *offsetp */
5652 /* We already know all of the way, now we may
5653 * be able to walk back. The same assumption
5654 * is made as in S_utf8_mg_pos(), namely that
5655 * walking backward is twice slower than
5656 * walking forward. */
5657 STRLEN forw = *offsetp;
5658 STRLEN backw = cache[1] - *offsetp;
5660 if (!(forw < 2 * backw)) {
5661 U8 *p = s + cache[1];
5668 while (UTF8_IS_CONTINUATION(*p)) {
5676 *offsetp = cache[0];
5686 /* Call utf8n_to_uvchr() to validate the sequence
5687 * (unless a simple non-UTF character) */
5688 if (!UTF8_IS_INVARIANT(*s))
5689 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5698 if (!SvREADONLY(sv)) {
5700 sv_magic(sv, 0, PERL_MAGIC_utf8, 0, 0);
5701 mg = mg_find(sv, PERL_MAGIC_utf8);
5706 Newz(0, cache, PERL_MAGIC_UTF8_CACHESIZE * 2, STRLEN);
5707 mg->mg_ptr = (char *) cache;
5712 cache[1] = *offsetp;
5724 Returns a boolean indicating whether the strings in the two SVs are
5725 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5726 coerce its args to strings if necessary.
5732 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5740 SV* svrecode = Nullsv;
5747 pv1 = SvPV(sv1, cur1);
5754 pv2 = SvPV(sv2, cur2);
5756 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5757 /* Differing utf8ness.
5758 * Do not UTF8size the comparands as a side-effect. */
5761 svrecode = newSVpvn(pv2, cur2);
5762 sv_recode_to_utf8(svrecode, PL_encoding);
5763 pv2 = SvPV(svrecode, cur2);
5766 svrecode = newSVpvn(pv1, cur1);
5767 sv_recode_to_utf8(svrecode, PL_encoding);
5768 pv1 = SvPV(svrecode, cur1);
5770 /* Now both are in UTF-8. */
5775 bool is_utf8 = TRUE;
5778 /* sv1 is the UTF-8 one,
5779 * if is equal it must be downgrade-able */
5780 char *pv = (char*)bytes_from_utf8((U8*)pv1,
5786 /* sv2 is the UTF-8 one,
5787 * if is equal it must be downgrade-able */
5788 char *pv = (char *)bytes_from_utf8((U8*)pv2,
5794 /* Downgrade not possible - cannot be eq */
5801 eq = memEQ(pv1, pv2, cur1);
5804 SvREFCNT_dec(svrecode);
5815 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5816 string in C<sv1> is less than, equal to, or greater than the string in
5817 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5818 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5824 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5827 char *pv1, *pv2, *tpv = Nullch;
5829 SV *svrecode = Nullsv;
5836 pv1 = SvPV(sv1, cur1);
5843 pv2 = SvPV(sv2, cur2);
5845 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5846 /* Differing utf8ness.
5847 * Do not UTF8size the comparands as a side-effect. */
5850 svrecode = newSVpvn(pv2, cur2);
5851 sv_recode_to_utf8(svrecode, PL_encoding);
5852 pv2 = SvPV(svrecode, cur2);
5855 pv2 = tpv = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5860 svrecode = newSVpvn(pv1, cur1);
5861 sv_recode_to_utf8(svrecode, PL_encoding);
5862 pv1 = SvPV(svrecode, cur1);
5865 pv1 = tpv = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5871 cmp = cur2 ? -1 : 0;
5875 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5878 cmp = retval < 0 ? -1 : 1;
5879 } else if (cur1 == cur2) {
5882 cmp = cur1 < cur2 ? -1 : 1;
5887 SvREFCNT_dec(svrecode);
5896 =for apidoc sv_cmp_locale
5898 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5899 'use bytes' aware, handles get magic, and will coerce its args to strings
5900 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5906 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5908 #ifdef USE_LOCALE_COLLATE
5914 if (PL_collation_standard)
5918 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5920 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5922 if (!pv1 || !len1) {
5933 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5936 return retval < 0 ? -1 : 1;
5939 * When the result of collation is equality, that doesn't mean
5940 * that there are no differences -- some locales exclude some
5941 * characters from consideration. So to avoid false equalities,
5942 * we use the raw string as a tiebreaker.
5948 #endif /* USE_LOCALE_COLLATE */
5950 return sv_cmp(sv1, sv2);
5954 #ifdef USE_LOCALE_COLLATE
5957 =for apidoc sv_collxfrm
5959 Add Collate Transform magic to an SV if it doesn't already have it.
5961 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5962 scalar data of the variable, but transformed to such a format that a normal
5963 memory comparison can be used to compare the data according to the locale
5970 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5974 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5975 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5980 Safefree(mg->mg_ptr);
5982 if ((xf = mem_collxfrm(s, len, &xlen))) {
5983 if (SvREADONLY(sv)) {
5986 return xf + sizeof(PL_collation_ix);
5989 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5990 mg = mg_find(sv, PERL_MAGIC_collxfrm);
6003 if (mg && mg->mg_ptr) {
6005 return mg->mg_ptr + sizeof(PL_collation_ix);
6013 #endif /* USE_LOCALE_COLLATE */
6018 Get a line from the filehandle and store it into the SV, optionally
6019 appending to the currently-stored string.
6025 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
6029 register STDCHAR rslast;
6030 register STDCHAR *bp;
6036 SV_CHECK_THINKFIRST(sv);
6037 (void)SvUPGRADE(sv, SVt_PV);
6042 if (PerlIO_isutf8(fp)) {
6044 sv_utf8_upgrade_nomg(sv);
6045 sv_pos_u2b(sv,&append,0);
6047 } else if (SvUTF8(sv)) {
6048 SV *tsv = NEWSV(0,0);
6049 sv_gets(tsv, fp, 0);
6050 sv_utf8_upgrade_nomg(tsv);
6051 SvCUR_set(sv,append);
6054 goto return_string_or_null;
6059 if (PerlIO_isutf8(fp))
6062 if (PL_curcop == &PL_compiling) {
6063 /* we always read code in line mode */
6067 else if (RsSNARF(PL_rs)) {
6068 /* If it is a regular disk file use size from stat() as estimate
6069 of amount we are going to read - may result in malloc-ing
6070 more memory than we realy need if layers bellow reduce
6071 size we read (e.g. CRLF or a gzip layer)
6074 if (!PerlLIO_fstat(PerlIO_fileno(fp), &st) && S_ISREG(st.st_mode)) {
6075 Off_t offset = PerlIO_tell(fp);
6076 if (offset != (Off_t) -1 && st.st_size + append > offset) {
6077 (void) SvGROW(sv, (STRLEN)((st.st_size - offset) + append + 1));
6083 else if (RsRECORD(PL_rs)) {
6087 /* Grab the size of the record we're getting */
6088 recsize = SvIV(SvRV(PL_rs));
6089 buffer = SvGROW(sv, (STRLEN)(recsize + append + 1)) + append;
6092 /* VMS wants read instead of fread, because fread doesn't respect */
6093 /* RMS record boundaries. This is not necessarily a good thing to be */
6094 /* doing, but we've got no other real choice - except avoid stdio
6095 as implementation - perhaps write a :vms layer ?
6097 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
6099 bytesread = PerlIO_read(fp, buffer, recsize);
6103 SvCUR_set(sv, bytesread += append);
6104 buffer[bytesread] = '\0';
6105 goto return_string_or_null;
6107 else if (RsPARA(PL_rs)) {
6113 /* Get $/ i.e. PL_rs into same encoding as stream wants */
6114 if (PerlIO_isutf8(fp)) {
6115 rsptr = SvPVutf8(PL_rs, rslen);
6118 if (SvUTF8(PL_rs)) {
6119 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
6120 Perl_croak(aTHX_ "Wide character in $/");
6123 rsptr = SvPV(PL_rs, rslen);
6127 rslast = rslen ? rsptr[rslen - 1] : '\0';
6129 if (rspara) { /* have to do this both before and after */
6130 do { /* to make sure file boundaries work right */
6133 i = PerlIO_getc(fp);
6137 PerlIO_ungetc(fp,i);
6143 /* See if we know enough about I/O mechanism to cheat it ! */
6145 /* This used to be #ifdef test - it is made run-time test for ease
6146 of abstracting out stdio interface. One call should be cheap
6147 enough here - and may even be a macro allowing compile
6151 if (PerlIO_fast_gets(fp)) {
6154 * We're going to steal some values from the stdio struct
6155 * and put EVERYTHING in the innermost loop into registers.
6157 register STDCHAR *ptr;
6161 #if defined(VMS) && defined(PERLIO_IS_STDIO)
6162 /* An ungetc()d char is handled separately from the regular
6163 * buffer, so we getc() it back out and stuff it in the buffer.
6165 i = PerlIO_getc(fp);
6166 if (i == EOF) return 0;
6167 *(--((*fp)->_ptr)) = (unsigned char) i;
6171 /* Here is some breathtakingly efficient cheating */
6173 cnt = PerlIO_get_cnt(fp); /* get count into register */
6174 /* make sure we have the room */
6175 if ((I32)(SvLEN(sv) - append) <= cnt + 1) {
6176 /* Not room for all of it
6177 if we are looking for a separator and room for some
6179 if (rslen && cnt > 80 && (I32)SvLEN(sv) > append) {
6180 /* just process what we have room for */
6181 shortbuffered = cnt - SvLEN(sv) + append + 1;
6182 cnt -= shortbuffered;
6186 /* remember that cnt can be negative */
6187 SvGROW(sv, (STRLEN)(append + (cnt <= 0 ? 2 : (cnt + 1))));
6192 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
6193 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
6194 DEBUG_P(PerlIO_printf(Perl_debug_log,
6195 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6196 DEBUG_P(PerlIO_printf(Perl_debug_log,
6197 "Screamer: entering: PerlIO * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6198 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6199 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
6204 while (cnt > 0) { /* this | eat */
6206 if ((*bp++ = *ptr++) == rslast) /* really | dust */
6207 goto thats_all_folks; /* screams | sed :-) */
6211 Copy(ptr, bp, cnt, char); /* this | eat */
6212 bp += cnt; /* screams | dust */
6213 ptr += cnt; /* louder | sed :-) */
6218 if (shortbuffered) { /* oh well, must extend */
6219 cnt = shortbuffered;
6221 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6223 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
6224 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6228 DEBUG_P(PerlIO_printf(Perl_debug_log,
6229 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
6230 PTR2UV(ptr),(long)cnt));
6231 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* deregisterize cnt and ptr */
6233 DEBUG_P(PerlIO_printf(Perl_debug_log,
6234 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6235 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6236 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6238 /* This used to call 'filbuf' in stdio form, but as that behaves like
6239 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
6240 another abstraction. */
6241 i = PerlIO_getc(fp); /* get more characters */
6243 DEBUG_P(PerlIO_printf(Perl_debug_log,
6244 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6245 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6246 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6248 cnt = PerlIO_get_cnt(fp);
6249 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
6250 DEBUG_P(PerlIO_printf(Perl_debug_log,
6251 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6253 if (i == EOF) /* all done for ever? */
6254 goto thats_really_all_folks;
6256 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
6258 SvGROW(sv, bpx + cnt + 2);
6259 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
6261 *bp++ = (STDCHAR)i; /* store character from PerlIO_getc */
6263 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
6264 goto thats_all_folks;
6268 if ((rslen > 1 && (STRLEN)(bp - (STDCHAR*)SvPVX(sv)) < rslen) ||
6269 memNE((char*)bp - rslen, rsptr, rslen))
6270 goto screamer; /* go back to the fray */
6271 thats_really_all_folks:
6273 cnt += shortbuffered;
6274 DEBUG_P(PerlIO_printf(Perl_debug_log,
6275 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
6276 PerlIO_set_ptrcnt(fp, (STDCHAR*)ptr, cnt); /* put these back or we're in trouble */
6277 DEBUG_P(PerlIO_printf(Perl_debug_log,
6278 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
6279 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
6280 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
6282 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
6283 DEBUG_P(PerlIO_printf(Perl_debug_log,
6284 "Screamer: done, len=%ld, string=|%.*s|\n",
6285 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
6290 /*The big, slow, and stupid way */
6293 /* Need to work around EPOC SDK features */
6294 /* On WINS: MS VC5 generates calls to _chkstk, */
6295 /* if a `large' stack frame is allocated */
6296 /* gcc on MARM does not generate calls like these */
6302 register STDCHAR *bpe = buf + sizeof(buf);
6304 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = (STDCHAR)i) != rslast && bp < bpe)
6305 ; /* keep reading */
6309 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
6310 /* Accomodate broken VAXC compiler, which applies U8 cast to
6311 * both args of ?: operator, causing EOF to change into 255
6314 i = (U8)buf[cnt - 1];
6320 cnt = 0; /* we do need to re-set the sv even when cnt <= 0 */
6322 sv_catpvn(sv, (char *) buf, cnt);
6324 sv_setpvn(sv, (char *) buf, cnt);
6326 if (i != EOF && /* joy */
6328 SvCUR(sv) < rslen ||
6329 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
6333 * If we're reading from a TTY and we get a short read,
6334 * indicating that the user hit his EOF character, we need
6335 * to notice it now, because if we try to read from the TTY
6336 * again, the EOF condition will disappear.
6338 * The comparison of cnt to sizeof(buf) is an optimization
6339 * that prevents unnecessary calls to feof().
6343 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
6348 if (rspara) { /* have to do this both before and after */
6349 while (i != EOF) { /* to make sure file boundaries work right */
6350 i = PerlIO_getc(fp);
6352 PerlIO_ungetc(fp,i);
6358 return_string_or_null:
6359 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
6365 Auto-increment of the value in the SV, doing string to numeric conversion
6366 if necessary. Handles 'get' magic.
6372 Perl_sv_inc(pTHX_ register SV *sv)
6381 if (SvTHINKFIRST(sv)) {
6382 if (SvREADONLY(sv) && SvFAKE(sv))
6383 sv_force_normal(sv);
6384 if (SvREADONLY(sv)) {
6385 if (PL_curcop != &PL_compiling)
6386 Perl_croak(aTHX_ PL_no_modify);
6390 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
6392 i = PTR2IV(SvRV(sv));
6397 flags = SvFLAGS(sv);
6398 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
6399 /* It's (privately or publicly) a float, but not tested as an
6400 integer, so test it to see. */
6402 flags = SvFLAGS(sv);
6404 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6405 /* It's publicly an integer, or privately an integer-not-float */
6406 #ifdef PERL_PRESERVE_IVUV
6410 if (SvUVX(sv) == UV_MAX)
6411 sv_setnv(sv, UV_MAX_P1);
6413 (void)SvIOK_only_UV(sv);
6416 if (SvIVX(sv) == IV_MAX)
6417 sv_setuv(sv, (UV)IV_MAX + 1);
6419 (void)SvIOK_only(sv);
6425 if (flags & SVp_NOK) {
6426 (void)SvNOK_only(sv);
6431 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
6432 if ((flags & SVTYPEMASK) < SVt_PVIV)
6433 sv_upgrade(sv, SVt_IV);
6434 (void)SvIOK_only(sv);
6439 while (isALPHA(*d)) d++;
6440 while (isDIGIT(*d)) d++;
6442 #ifdef PERL_PRESERVE_IVUV
6443 /* Got to punt this as an integer if needs be, but we don't issue
6444 warnings. Probably ought to make the sv_iv_please() that does
6445 the conversion if possible, and silently. */
6446 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6447 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6448 /* Need to try really hard to see if it's an integer.
6449 9.22337203685478e+18 is an integer.
6450 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6451 so $a="9.22337203685478e+18"; $a+0; $a++
6452 needs to be the same as $a="9.22337203685478e+18"; $a++
6459 /* sv_2iv *should* have made this an NV */
6460 if (flags & SVp_NOK) {
6461 (void)SvNOK_only(sv);
6465 /* I don't think we can get here. Maybe I should assert this
6466 And if we do get here I suspect that sv_setnv will croak. NWC
6468 #if defined(USE_LONG_DOUBLE)
6469 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",
6470 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6472 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6473 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6476 #endif /* PERL_PRESERVE_IVUV */
6477 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
6481 while (d >= SvPVX(sv)) {
6489 /* MKS: The original code here died if letters weren't consecutive.
6490 * at least it didn't have to worry about non-C locales. The
6491 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
6492 * arranged in order (although not consecutively) and that only
6493 * [A-Za-z] are accepted by isALPHA in the C locale.
6495 if (*d != 'z' && *d != 'Z') {
6496 do { ++*d; } while (!isALPHA(*d));
6499 *(d--) -= 'z' - 'a';
6504 *(d--) -= 'z' - 'a' + 1;
6508 /* oh,oh, the number grew */
6509 SvGROW(sv, SvCUR(sv) + 2);
6511 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
6522 Auto-decrement of the value in the SV, doing string to numeric conversion
6523 if necessary. Handles 'get' magic.
6529 Perl_sv_dec(pTHX_ register SV *sv)
6537 if (SvTHINKFIRST(sv)) {
6538 if (SvREADONLY(sv) && SvFAKE(sv))
6539 sv_force_normal(sv);
6540 if (SvREADONLY(sv)) {
6541 if (PL_curcop != &PL_compiling)
6542 Perl_croak(aTHX_ PL_no_modify);
6546 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
6548 i = PTR2IV(SvRV(sv));
6553 /* Unlike sv_inc we don't have to worry about string-never-numbers
6554 and keeping them magic. But we mustn't warn on punting */
6555 flags = SvFLAGS(sv);
6556 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
6557 /* It's publicly an integer, or privately an integer-not-float */
6558 #ifdef PERL_PRESERVE_IVUV
6562 if (SvUVX(sv) == 0) {
6563 (void)SvIOK_only(sv);
6567 (void)SvIOK_only_UV(sv);
6571 if (SvIVX(sv) == IV_MIN)
6572 sv_setnv(sv, (NV)IV_MIN - 1.0);
6574 (void)SvIOK_only(sv);
6580 if (flags & SVp_NOK) {
6582 (void)SvNOK_only(sv);
6585 if (!(flags & SVp_POK)) {
6586 if ((flags & SVTYPEMASK) < SVt_PVNV)
6587 sv_upgrade(sv, SVt_NV);
6589 (void)SvNOK_only(sv);
6592 #ifdef PERL_PRESERVE_IVUV
6594 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6595 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6596 /* Need to try really hard to see if it's an integer.
6597 9.22337203685478e+18 is an integer.
6598 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6599 so $a="9.22337203685478e+18"; $a+0; $a--
6600 needs to be the same as $a="9.22337203685478e+18"; $a--
6607 /* sv_2iv *should* have made this an NV */
6608 if (flags & SVp_NOK) {
6609 (void)SvNOK_only(sv);
6613 /* I don't think we can get here. Maybe I should assert this
6614 And if we do get here I suspect that sv_setnv will croak. NWC
6616 #if defined(USE_LONG_DOUBLE)
6617 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",
6618 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6620 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%"NVgf"\n",
6621 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6625 #endif /* PERL_PRESERVE_IVUV */
6626 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6630 =for apidoc sv_mortalcopy
6632 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6633 The new SV is marked as mortal. It will be destroyed "soon", either by an
6634 explicit call to FREETMPS, or by an implicit call at places such as
6635 statement boundaries. See also C<sv_newmortal> and C<sv_2mortal>.
6640 /* Make a string that will exist for the duration of the expression
6641 * evaluation. Actually, it may have to last longer than that, but
6642 * hopefully we won't free it until it has been assigned to a
6643 * permanent location. */
6646 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6651 sv_setsv(sv,oldstr);
6653 PL_tmps_stack[++PL_tmps_ix] = sv;
6659 =for apidoc sv_newmortal
6661 Creates a new null SV which is mortal. The reference count of the SV is
6662 set to 1. It will be destroyed "soon", either by an explicit call to
6663 FREETMPS, or by an implicit call at places such as statement boundaries.
6664 See also C<sv_mortalcopy> and C<sv_2mortal>.
6670 Perl_sv_newmortal(pTHX)
6675 SvFLAGS(sv) = SVs_TEMP;
6677 PL_tmps_stack[++PL_tmps_ix] = sv;
6682 =for apidoc sv_2mortal
6684 Marks an existing SV as mortal. The SV will be destroyed "soon", either
6685 by an explicit call to FREETMPS, or by an implicit call at places such as
6686 statement boundaries. See also C<sv_newmortal> and C<sv_mortalcopy>.
6692 Perl_sv_2mortal(pTHX_ register SV *sv)
6696 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6699 PL_tmps_stack[++PL_tmps_ix] = sv;
6707 Creates a new SV and copies a string into it. The reference count for the
6708 SV is set to 1. If C<len> is zero, Perl will compute the length using
6709 strlen(). For efficiency, consider using C<newSVpvn> instead.
6715 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6722 sv_setpvn(sv,s,len);
6727 =for apidoc newSVpvn
6729 Creates a new SV and copies a string into it. The reference count for the
6730 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6731 string. You are responsible for ensuring that the source string is at least
6738 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6743 sv_setpvn(sv,s,len);
6748 =for apidoc newSVpvn_share
6750 Creates a new SV with its SvPVX pointing to a shared string in the string
6751 table. If the string does not already exist in the table, it is created
6752 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6753 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6754 otherwise the hash is computed. The idea here is that as the string table
6755 is used for shared hash keys these strings will have SvPVX == HeKEY and
6756 hash lookup will avoid string compare.
6762 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6765 bool is_utf8 = FALSE;
6767 STRLEN tmplen = -len;
6769 /* See the note in hv.c:hv_fetch() --jhi */
6770 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6774 PERL_HASH(hash, src, len);
6776 sv_upgrade(sv, SVt_PVIV);
6777 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6790 #if defined(PERL_IMPLICIT_CONTEXT)
6792 /* pTHX_ magic can't cope with varargs, so this is a no-context
6793 * version of the main function, (which may itself be aliased to us).
6794 * Don't access this version directly.
6798 Perl_newSVpvf_nocontext(const char* pat, ...)
6803 va_start(args, pat);
6804 sv = vnewSVpvf(pat, &args);
6811 =for apidoc newSVpvf
6813 Creates a new SV and initializes it with the string formatted like
6820 Perl_newSVpvf(pTHX_ const char* pat, ...)
6824 va_start(args, pat);
6825 sv = vnewSVpvf(pat, &args);
6830 /* backend for newSVpvf() and newSVpvf_nocontext() */
6833 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6837 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6844 Creates a new SV and copies a floating point value into it.
6845 The reference count for the SV is set to 1.
6851 Perl_newSVnv(pTHX_ NV n)
6863 Creates a new SV and copies an integer into it. The reference count for the
6870 Perl_newSViv(pTHX_ IV i)
6882 Creates a new SV and copies an unsigned integer into it.
6883 The reference count for the SV is set to 1.
6889 Perl_newSVuv(pTHX_ UV u)
6899 =for apidoc newRV_noinc
6901 Creates an RV wrapper for an SV. The reference count for the original
6902 SV is B<not> incremented.
6908 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6913 sv_upgrade(sv, SVt_RV);
6920 /* newRV_inc is the official function name to use now.
6921 * newRV_inc is in fact #defined to newRV in sv.h
6925 Perl_newRV(pTHX_ SV *tmpRef)
6927 return newRV_noinc(SvREFCNT_inc(tmpRef));
6933 Creates a new SV which is an exact duplicate of the original SV.
6940 Perl_newSVsv(pTHX_ register SV *old)
6946 if (SvTYPE(old) == SVTYPEMASK) {
6947 if (ckWARN_d(WARN_INTERNAL))
6948 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "semi-panic: attempt to dup freed string");
6963 =for apidoc sv_reset
6965 Underlying implementation for the C<reset> Perl function.
6966 Note that the perl-level function is vaguely deprecated.
6972 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6980 char todo[PERL_UCHAR_MAX+1];
6985 if (!*s) { /* reset ?? searches */
6986 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6987 pm->op_pmdynflags &= ~PMdf_USED;
6992 /* reset variables */
6994 if (!HvARRAY(stash))
6997 Zero(todo, 256, char);
6999 i = (unsigned char)*s;
7003 max = (unsigned char)*s++;
7004 for ( ; i <= max; i++) {
7007 for (i = 0; i <= (I32) HvMAX(stash); i++) {
7008 for (entry = HvARRAY(stash)[i];
7010 entry = HeNEXT(entry))
7012 if (!todo[(U8)*HeKEY(entry)])
7014 gv = (GV*)HeVAL(entry);
7016 if (SvTHINKFIRST(sv)) {
7017 if (!SvREADONLY(sv) && SvROK(sv))
7022 if (SvTYPE(sv) >= SVt_PV) {
7024 if (SvPVX(sv) != Nullch)
7031 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
7033 #ifdef USE_ENVIRON_ARRAY
7035 # ifdef USE_ITHREADS
7036 && PL_curinterp == aTHX
7040 environ[0] = Nullch;
7052 Using various gambits, try to get an IO from an SV: the IO slot if its a
7053 GV; or the recursive result if we're an RV; or the IO slot of the symbol
7054 named after the PV if we're a string.
7060 Perl_sv_2io(pTHX_ SV *sv)
7066 switch (SvTYPE(sv)) {
7074 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
7078 Perl_croak(aTHX_ PL_no_usym, "filehandle");
7080 return sv_2io(SvRV(sv));
7081 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
7087 Perl_croak(aTHX_ "Bad filehandle: %"SVf, sv);
7096 Using various gambits, try to get a CV from an SV; in addition, try if
7097 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
7103 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
7110 return *gvp = Nullgv, Nullcv;
7111 switch (SvTYPE(sv)) {
7130 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
7131 tryAMAGICunDEREF(to_cv);
7134 if (SvTYPE(sv) == SVt_PVCV) {
7143 Perl_croak(aTHX_ "Not a subroutine reference");
7148 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
7154 if (lref && !GvCVu(gv)) {
7157 tmpsv = NEWSV(704,0);
7158 gv_efullname3(tmpsv, gv, Nullch);
7159 /* XXX this is probably not what they think they're getting.
7160 * It has the same effect as "sub name;", i.e. just a forward
7162 newSUB(start_subparse(FALSE, 0),
7163 newSVOP(OP_CONST, 0, tmpsv),
7168 Perl_croak(aTHX_ "Unable to create sub named \"%"SVf"\"",
7178 Returns true if the SV has a true value by Perl's rules.
7179 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
7180 instead use an in-line version.
7186 Perl_sv_true(pTHX_ register SV *sv)
7192 if ((tXpv = (XPV*)SvANY(sv)) &&
7193 (tXpv->xpv_cur > 1 ||
7194 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
7201 return SvIVX(sv) != 0;
7204 return SvNVX(sv) != 0.0;
7206 return sv_2bool(sv);
7214 A private implementation of the C<SvIVx> macro for compilers which can't
7215 cope with complex macro expressions. Always use the macro instead.
7221 Perl_sv_iv(pTHX_ register SV *sv)
7225 return (IV)SvUVX(sv);
7234 A private implementation of the C<SvUVx> macro for compilers which can't
7235 cope with complex macro expressions. Always use the macro instead.
7241 Perl_sv_uv(pTHX_ register SV *sv)
7246 return (UV)SvIVX(sv);
7254 A private implementation of the C<SvNVx> macro for compilers which can't
7255 cope with complex macro expressions. Always use the macro instead.
7261 Perl_sv_nv(pTHX_ register SV *sv)
7268 /* sv_pv() is now a macro using SvPV_nolen();
7269 * this function provided for binary compatibility only
7273 Perl_sv_pv(pTHX_ SV *sv)
7280 return sv_2pv(sv, &n_a);
7286 Use the C<SvPV_nolen> macro instead
7290 A private implementation of the C<SvPV> macro for compilers which can't
7291 cope with complex macro expressions. Always use the macro instead.
7297 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
7303 return sv_2pv(sv, lp);
7308 Perl_sv_pvn_nomg(pTHX_ register SV *sv, STRLEN *lp)
7314 return sv_2pv_flags(sv, lp, 0);
7317 /* sv_pvn_force() is now a macro using Perl_sv_pvn_force_flags();
7318 * this function provided for binary compatibility only
7322 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
7324 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
7328 =for apidoc sv_pvn_force
7330 Get a sensible string out of the SV somehow.
7331 A private implementation of the C<SvPV_force> macro for compilers which
7332 can't cope with complex macro expressions. Always use the macro instead.
7334 =for apidoc sv_pvn_force_flags
7336 Get a sensible string out of the SV somehow.
7337 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
7338 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
7339 implemented in terms of this function.
7340 You normally want to use the various wrapper macros instead: see
7341 C<SvPV_force> and C<SvPV_force_nomg>
7347 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
7351 if (SvTHINKFIRST(sv) && !SvROK(sv))
7352 sv_force_normal(sv);
7358 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
7359 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
7363 s = sv_2pv_flags(sv, lp, flags);
7364 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
7369 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
7370 SvGROW(sv, len + 1);
7371 Move(s,SvPVX(sv),len,char);
7376 SvPOK_on(sv); /* validate pointer */
7378 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
7379 PTR2UV(sv),SvPVX(sv)));
7385 /* sv_pvbyte () is now a macro using Perl_sv_2pv_flags();
7386 * this function provided for binary compatibility only
7390 Perl_sv_pvbyte(pTHX_ SV *sv)
7392 sv_utf8_downgrade(sv,0);
7397 =for apidoc sv_pvbyte
7399 Use C<SvPVbyte_nolen> instead.
7401 =for apidoc sv_pvbyten
7403 A private implementation of the C<SvPVbyte> macro for compilers
7404 which can't cope with complex macro expressions. Always use the macro
7411 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
7413 sv_utf8_downgrade(sv,0);
7414 return sv_pvn(sv,lp);
7418 =for apidoc sv_pvbyten_force
7420 A private implementation of the C<SvPVbytex_force> macro for compilers
7421 which can't cope with complex macro expressions. Always use the macro
7428 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
7430 sv_utf8_downgrade(sv,0);
7431 return sv_pvn_force(sv,lp);
7434 /* sv_pvutf8 () is now a macro using Perl_sv_2pv_flags();
7435 * this function provided for binary compatibility only
7439 Perl_sv_pvutf8(pTHX_ SV *sv)
7441 sv_utf8_upgrade(sv);
7446 =for apidoc sv_pvutf8
7448 Use the C<SvPVutf8_nolen> macro instead
7450 =for apidoc sv_pvutf8n
7452 A private implementation of the C<SvPVutf8> macro for compilers
7453 which can't cope with complex macro expressions. Always use the macro
7460 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
7462 sv_utf8_upgrade(sv);
7463 return sv_pvn(sv,lp);
7467 =for apidoc sv_pvutf8n_force
7469 A private implementation of the C<SvPVutf8_force> macro for compilers
7470 which can't cope with complex macro expressions. Always use the macro
7477 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
7479 sv_utf8_upgrade(sv);
7480 return sv_pvn_force(sv,lp);
7484 =for apidoc sv_reftype
7486 Returns a string describing what the SV is a reference to.
7492 Perl_sv_reftype(pTHX_ SV *sv, int ob)
7494 if (ob && SvOBJECT(sv)) {
7495 HV *svs = SvSTASH(sv);
7496 /* [20011101.072] This bandaid for C<package;> should eventually
7497 be removed. AMS 20011103 */
7498 return (svs ? HvNAME(svs) : "<none>");
7501 switch (SvTYPE(sv)) {
7515 case SVt_PVLV: return SvROK(sv) ? "REF" : "LVALUE";
7516 case SVt_PVAV: return "ARRAY";
7517 case SVt_PVHV: return "HASH";
7518 case SVt_PVCV: return "CODE";
7519 case SVt_PVGV: return "GLOB";
7520 case SVt_PVFM: return "FORMAT";
7521 case SVt_PVIO: return "IO";
7522 default: return "UNKNOWN";
7528 =for apidoc sv_isobject
7530 Returns a boolean indicating whether the SV is an RV pointing to a blessed
7531 object. If the SV is not an RV, or if the object is not blessed, then this
7538 Perl_sv_isobject(pTHX_ SV *sv)
7555 Returns a boolean indicating whether the SV is blessed into the specified
7556 class. This does not check for subtypes; use C<sv_derived_from> to verify
7557 an inheritance relationship.
7563 Perl_sv_isa(pTHX_ SV *sv, const char *name)
7575 return strEQ(HvNAME(SvSTASH(sv)), name);
7581 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
7582 it will be upgraded to one. If C<classname> is non-null then the new SV will
7583 be blessed in the specified package. The new SV is returned and its
7584 reference count is 1.
7590 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7596 SV_CHECK_THINKFIRST(rv);
7599 if (SvTYPE(rv) >= SVt_PVMG) {
7600 U32 refcnt = SvREFCNT(rv);
7604 SvREFCNT(rv) = refcnt;
7607 if (SvTYPE(rv) < SVt_RV)
7608 sv_upgrade(rv, SVt_RV);
7609 else if (SvTYPE(rv) > SVt_RV) {
7610 (void)SvOOK_off(rv);
7611 if (SvPVX(rv) && SvLEN(rv))
7612 Safefree(SvPVX(rv));
7622 HV* stash = gv_stashpv(classname, TRUE);
7623 (void)sv_bless(rv, stash);
7629 =for apidoc sv_setref_pv
7631 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7632 argument will be upgraded to an RV. That RV will be modified to point to
7633 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7634 into the SV. The C<classname> argument indicates the package for the
7635 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7636 will be returned and will have a reference count of 1.
7638 Do not use with other Perl types such as HV, AV, SV, CV, because those
7639 objects will become corrupted by the pointer copy process.
7641 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7647 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7650 sv_setsv(rv, &PL_sv_undef);
7654 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7659 =for apidoc sv_setref_iv
7661 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7662 argument will be upgraded to an RV. That RV will be modified to point to
7663 the new SV. The C<classname> argument indicates the package for the
7664 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7665 will be returned and will have a reference count of 1.
7671 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7673 sv_setiv(newSVrv(rv,classname), iv);
7678 =for apidoc sv_setref_uv
7680 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7681 argument will be upgraded to an RV. That RV will be modified to point to
7682 the new SV. The C<classname> argument indicates the package for the
7683 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7684 will be returned and will have a reference count of 1.
7690 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7692 sv_setuv(newSVrv(rv,classname), uv);
7697 =for apidoc sv_setref_nv
7699 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7700 argument will be upgraded to an RV. That RV will be modified to point to
7701 the new SV. The C<classname> argument indicates the package for the
7702 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7703 will be returned and will have a reference count of 1.
7709 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7711 sv_setnv(newSVrv(rv,classname), nv);
7716 =for apidoc sv_setref_pvn
7718 Copies a string into a new SV, optionally blessing the SV. The length of the
7719 string must be specified with C<n>. The C<rv> argument will be upgraded to
7720 an RV. That RV will be modified to point to the new SV. The C<classname>
7721 argument indicates the package for the blessing. Set C<classname> to
7722 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7723 a reference count of 1.
7725 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7731 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7733 sv_setpvn(newSVrv(rv,classname), pv, n);
7738 =for apidoc sv_bless
7740 Blesses an SV into a specified package. The SV must be an RV. The package
7741 must be designated by its stash (see C<gv_stashpv()>). The reference count
7742 of the SV is unaffected.
7748 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7752 Perl_croak(aTHX_ "Can't bless non-reference value");
7754 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7755 if (SvREADONLY(tmpRef))
7756 Perl_croak(aTHX_ PL_no_modify);
7757 if (SvOBJECT(tmpRef)) {
7758 if (SvTYPE(tmpRef) != SVt_PVIO)
7760 SvREFCNT_dec(SvSTASH(tmpRef));
7763 SvOBJECT_on(tmpRef);
7764 if (SvTYPE(tmpRef) != SVt_PVIO)
7766 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7767 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7774 if(SvSMAGICAL(tmpRef))
7775 if(mg_find(tmpRef, PERL_MAGIC_ext) || mg_find(tmpRef, PERL_MAGIC_uvar))
7783 /* Downgrades a PVGV to a PVMG.
7787 S_sv_unglob(pTHX_ SV *sv)
7791 assert(SvTYPE(sv) == SVt_PVGV);
7796 SvREFCNT_dec(GvSTASH(sv));
7797 GvSTASH(sv) = Nullhv;
7799 sv_unmagic(sv, PERL_MAGIC_glob);
7800 Safefree(GvNAME(sv));
7803 /* need to keep SvANY(sv) in the right arena */
7804 xpvmg = new_XPVMG();
7805 StructCopy(SvANY(sv), xpvmg, XPVMG);
7806 del_XPVGV(SvANY(sv));
7809 SvFLAGS(sv) &= ~SVTYPEMASK;
7810 SvFLAGS(sv) |= SVt_PVMG;
7814 =for apidoc sv_unref_flags
7816 Unsets the RV status of the SV, and decrements the reference count of
7817 whatever was being referenced by the RV. This can almost be thought of
7818 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7819 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7820 (otherwise the decrementing is conditional on the reference count being
7821 different from one or the reference being a readonly SV).
7828 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7832 if (SvWEAKREF(sv)) {
7840 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || flags) /* SV_IMMEDIATE_UNREF */
7842 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7843 sv_2mortal(rv); /* Schedule for freeing later */
7847 =for apidoc sv_unref
7849 Unsets the RV status of the SV, and decrements the reference count of
7850 whatever was being referenced by the RV. This can almost be thought of
7851 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7852 being zero. See C<SvROK_off>.
7858 Perl_sv_unref(pTHX_ SV *sv)
7860 sv_unref_flags(sv, 0);
7864 =for apidoc sv_taint
7866 Taint an SV. Use C<SvTAINTED_on> instead.
7871 Perl_sv_taint(pTHX_ SV *sv)
7873 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7877 =for apidoc sv_untaint
7879 Untaint an SV. Use C<SvTAINTED_off> instead.
7884 Perl_sv_untaint(pTHX_ SV *sv)
7886 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7887 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7894 =for apidoc sv_tainted
7896 Test an SV for taintedness. Use C<SvTAINTED> instead.
7901 Perl_sv_tainted(pTHX_ SV *sv)
7903 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7904 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7905 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7912 =for apidoc sv_setpviv
7914 Copies an integer into the given SV, also updating its string value.
7915 Does not handle 'set' magic. See C<sv_setpviv_mg>.
7921 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
7923 char buf[TYPE_CHARS(UV)];
7925 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
7927 sv_setpvn(sv, ptr, ebuf - ptr);
7931 =for apidoc sv_setpviv_mg
7933 Like C<sv_setpviv>, but also handles 'set' magic.
7939 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
7941 char buf[TYPE_CHARS(UV)];
7943 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
7945 sv_setpvn(sv, ptr, ebuf - ptr);
7949 #if defined(PERL_IMPLICIT_CONTEXT)
7951 /* pTHX_ magic can't cope with varargs, so this is a no-context
7952 * version of the main function, (which may itself be aliased to us).
7953 * Don't access this version directly.
7957 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7961 va_start(args, pat);
7962 sv_vsetpvf(sv, pat, &args);
7966 /* pTHX_ magic can't cope with varargs, so this is a no-context
7967 * version of the main function, (which may itself be aliased to us).
7968 * Don't access this version directly.
7972 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7976 va_start(args, pat);
7977 sv_vsetpvf_mg(sv, pat, &args);
7983 =for apidoc sv_setpvf
7985 Processes its arguments like C<sprintf> and sets an SV to the formatted
7986 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7992 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7995 va_start(args, pat);
7996 sv_vsetpvf(sv, pat, &args);
8000 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
8003 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8005 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8009 =for apidoc sv_setpvf_mg
8011 Like C<sv_setpvf>, but also handles 'set' magic.
8017 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8020 va_start(args, pat);
8021 sv_vsetpvf_mg(sv, pat, &args);
8025 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
8028 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8030 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8034 #if defined(PERL_IMPLICIT_CONTEXT)
8036 /* pTHX_ magic can't cope with varargs, so this is a no-context
8037 * version of the main function, (which may itself be aliased to us).
8038 * Don't access this version directly.
8042 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
8046 va_start(args, pat);
8047 sv_vcatpvf(sv, pat, &args);
8051 /* pTHX_ magic can't cope with varargs, so this is a no-context
8052 * version of the main function, (which may itself be aliased to us).
8053 * Don't access this version directly.
8057 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
8061 va_start(args, pat);
8062 sv_vcatpvf_mg(sv, pat, &args);
8068 =for apidoc sv_catpvf
8070 Processes its arguments like C<sprintf> and appends the formatted
8071 output to an SV. If the appended data contains "wide" characters
8072 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
8073 and characters >255 formatted with %c), the original SV might get
8074 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
8075 C<SvSETMAGIC()> must typically be called after calling this function
8076 to handle 'set' magic.
8081 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
8084 va_start(args, pat);
8085 sv_vcatpvf(sv, pat, &args);
8089 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
8092 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
8094 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8098 =for apidoc sv_catpvf_mg
8100 Like C<sv_catpvf>, but also handles 'set' magic.
8106 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
8109 va_start(args, pat);
8110 sv_vcatpvf_mg(sv, pat, &args);
8114 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
8117 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
8119 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
8124 =for apidoc sv_vsetpvfn
8126 Works like C<vcatpvfn> but copies the text into the SV instead of
8129 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
8135 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8137 sv_setpvn(sv, "", 0);
8138 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
8141 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
8144 S_expect_number(pTHX_ char** pattern)
8147 switch (**pattern) {
8148 case '1': case '2': case '3':
8149 case '4': case '5': case '6':
8150 case '7': case '8': case '9':
8151 while (isDIGIT(**pattern))
8152 var = var * 10 + (*(*pattern)++ - '0');
8156 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
8159 =for apidoc sv_vcatpvfn
8161 Processes its arguments like C<vsprintf> and appends the formatted output
8162 to an SV. Uses an array of SVs if the C style variable argument list is
8163 missing (NULL). When running with taint checks enabled, indicates via
8164 C<maybe_tainted> if results are untrustworthy (often due to the use of
8167 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
8173 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
8180 static char nullstr[] = "(null)";
8182 bool has_utf8; /* has the result utf8? */
8183 bool pat_utf8; /* the pattern is in utf8? */
8186 has_utf8 = pat_utf8 = DO_UTF8(sv);
8188 /* no matter what, this is a string now */
8189 (void)SvPV_force(sv, origlen);
8191 /* special-case "", "%s", and "%_" */
8194 if (patlen == 2 && pat[0] == '%') {
8198 char *s = va_arg(*args, char*);
8199 sv_catpv(sv, s ? s : nullstr);
8201 else if (svix < svmax) {
8202 sv_catsv(sv, *svargs);
8203 if (DO_UTF8(*svargs))
8209 argsv = va_arg(*args, SV*);
8210 sv_catsv(sv, argsv);
8215 /* See comment on '_' below */
8220 if (!args && svix < svmax && DO_UTF8(*svargs))
8223 patend = (char*)pat + patlen;
8224 for (p = (char*)pat; p < patend; p = q) {
8227 bool vectorize = FALSE;
8228 bool vectorarg = FALSE;
8229 bool vec_utf8 = FALSE;
8235 bool has_precis = FALSE;
8238 bool is_utf8 = FALSE; /* is this item utf8? */
8239 #ifdef HAS_LDBL_SPRINTF_BUG
8240 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8241 with sfio - Allen <allens@cpan.org> */
8242 bool fix_ldbl_sprintf_bug = FALSE;
8246 U8 utf8buf[UTF8_MAXLEN+1];
8247 STRLEN esignlen = 0;
8249 char *eptr = Nullch;
8251 /* Times 4: a decimal digit takes more than 3 binary digits.
8252 * NV_DIG: mantissa takes than many decimal digits.
8253 * Plus 32: Playing safe. */
8254 char ebuf[IV_DIG * 4 + NV_DIG + 32];
8255 /* large enough for "%#.#f" --chip */
8256 /* what about long double NVs? --jhi */
8259 U8 *vecstr = Null(U8*);
8266 /* we need a long double target in case HAS_LONG_DOUBLE but
8269 #if defined(HAS_LONG_DOUBLE) && LONG_DOUBLESIZE > DOUBLESIZE
8278 STRLEN dotstrlen = 1;
8279 I32 efix = 0; /* explicit format parameter index */
8280 I32 ewix = 0; /* explicit width index */
8281 I32 epix = 0; /* explicit precision index */
8282 I32 evix = 0; /* explicit vector index */
8283 bool asterisk = FALSE;
8285 /* echo everything up to the next format specification */
8286 for (q = p; q < patend && *q != '%'; ++q) ;
8288 if (has_utf8 && !pat_utf8)
8289 sv_catpvn_utf8_upgrade(sv, p, q - p, nsv);
8291 sv_catpvn(sv, p, q - p);
8298 We allow format specification elements in this order:
8299 \d+\$ explicit format parameter index
8301 v|\*(\d+\$)?v vector with optional (optionally specified) arg
8302 0 flag (as above): repeated to allow "v02"
8303 \d+|\*(\d+\$)? width using optional (optionally specified) arg
8304 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
8306 [%bcdefginopsux_DFOUX] format (mandatory)
8308 if (EXPECT_NUMBER(q, width)) {
8349 if (EXPECT_NUMBER(q, ewix))
8358 if ((vectorarg = asterisk)) {
8370 EXPECT_NUMBER(q, width);
8375 vecsv = va_arg(*args, SV*);
8377 vecsv = (evix ? evix <= svmax : svix < svmax) ?
8378 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
8379 dotstr = SvPVx(vecsv, dotstrlen);
8384 vecsv = va_arg(*args, SV*);
8385 vecstr = (U8*)SvPVx(vecsv,veclen);
8386 vec_utf8 = DO_UTF8(vecsv);
8388 else if (efix ? efix <= svmax : svix < svmax) {
8389 vecsv = svargs[efix ? efix-1 : svix++];
8390 vecstr = (U8*)SvPVx(vecsv,veclen);
8391 vec_utf8 = DO_UTF8(vecsv);
8401 i = va_arg(*args, int);
8403 i = (ewix ? ewix <= svmax : svix < svmax) ?
8404 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8406 width = (i < 0) ? -i : i;
8416 if (EXPECT_NUMBER(q, epix) && *q++ != '$')
8418 /* XXX: todo, support specified precision parameter */
8422 i = va_arg(*args, int);
8424 i = (ewix ? ewix <= svmax : svix < svmax)
8425 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
8426 precis = (i < 0) ? 0 : i;
8431 precis = precis * 10 + (*q++ - '0');
8440 case 'I': /* Ix, I32x, and I64x */
8442 if (q[1] == '6' && q[2] == '4') {
8448 if (q[1] == '3' && q[2] == '2') {
8458 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8469 #if defined(HAS_QUAD) || defined(HAS_LONG_DOUBLE)
8470 if (*(q + 1) == 'l') { /* lld, llf */
8495 argsv = (efix ? efix <= svmax : svix < svmax) ?
8496 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
8503 uv = (args && !vectorize) ? va_arg(*args, int) : SvIVx(argsv);
8505 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
8507 eptr = (char*)utf8buf;
8508 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
8519 if (args && !vectorize) {
8520 eptr = va_arg(*args, char*);
8522 #ifdef MACOS_TRADITIONAL
8523 /* On MacOS, %#s format is used for Pascal strings */
8528 elen = strlen(eptr);
8531 elen = sizeof nullstr - 1;
8535 eptr = SvPVx(argsv, elen);
8536 if (DO_UTF8(argsv)) {
8537 if (has_precis && precis < elen) {
8539 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
8542 if (width) { /* fudge width (can't fudge elen) */
8543 width += elen - sv_len_utf8(argsv);
8552 * The "%_" hack might have to be changed someday,
8553 * if ISO or ANSI decide to use '_' for something.
8554 * So we keep it hidden from users' code.
8556 if (!args || vectorize)
8558 argsv = va_arg(*args, SV*);
8559 eptr = SvPVx(argsv, elen);
8565 if (has_precis && elen > precis)
8572 if (alt || vectorize)
8574 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
8592 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8601 esignbuf[esignlen++] = plus;
8605 case 'h': iv = (short)va_arg(*args, int); break;
8606 default: iv = va_arg(*args, int); break;
8607 case 'l': iv = va_arg(*args, long); break;
8608 case 'V': iv = va_arg(*args, IV); break;
8610 case 'q': iv = va_arg(*args, Quad_t); break;
8617 case 'h': iv = (short)iv; break;
8619 case 'l': iv = (long)iv; break;
8622 case 'q': iv = (Quad_t)iv; break;
8626 if ( !vectorize ) /* we already set uv above */
8631 esignbuf[esignlen++] = plus;
8635 esignbuf[esignlen++] = '-';
8678 uv = utf8n_to_uvchr(vecstr, veclen, &ulen,
8689 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8690 default: uv = va_arg(*args, unsigned); break;
8691 case 'l': uv = va_arg(*args, unsigned long); break;
8692 case 'V': uv = va_arg(*args, UV); break;
8694 case 'q': uv = va_arg(*args, Quad_t); break;
8701 case 'h': uv = (unsigned short)uv; break;
8703 case 'l': uv = (unsigned long)uv; break;
8706 case 'q': uv = (Quad_t)uv; break;
8712 eptr = ebuf + sizeof ebuf;
8718 p = (char*)((c == 'X')
8719 ? "0123456789ABCDEF" : "0123456789abcdef");
8725 esignbuf[esignlen++] = '0';
8726 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8732 *--eptr = '0' + dig;
8734 if (alt && *eptr != '0')
8740 *--eptr = '0' + dig;
8743 esignbuf[esignlen++] = '0';
8744 esignbuf[esignlen++] = 'b';
8747 default: /* it had better be ten or less */
8748 #if defined(PERL_Y2KWARN)
8749 if (ckWARN(WARN_Y2K)) {
8751 char *s = SvPV(sv,n);
8752 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8753 && (n == 2 || !isDIGIT(s[n-3])))
8755 Perl_warner(aTHX_ packWARN(WARN_Y2K),
8756 "Possible Y2K bug: %%%c %s",
8757 c, "format string following '19'");
8763 *--eptr = '0' + dig;
8764 } while (uv /= base);
8767 elen = (ebuf + sizeof ebuf) - eptr;
8770 zeros = precis - elen;
8771 else if (precis == 0 && elen == 1 && *eptr == '0')
8776 /* FLOATING POINT */
8779 c = 'f'; /* maybe %F isn't supported here */
8785 /* This is evil, but floating point is even more evil */
8787 /* for SV-style calling, we can only get NV
8788 for C-style calling, we assume %f is double;
8789 for simplicity we allow any of %Lf, %llf, %qf for long double
8793 #if defined(USE_LONG_DOUBLE)
8797 /* [perl #20339] - we should accept and ignore %lf rather than die */
8801 #if defined(USE_LONG_DOUBLE)
8802 intsize = args ? 0 : 'q';
8806 #if defined(HAS_LONG_DOUBLE)
8815 /* now we need (long double) if intsize == 'q', else (double) */
8816 nv = (args && !vectorize) ?
8817 #if LONG_DOUBLESIZE > DOUBLESIZE
8819 va_arg(*args, long double) :
8820 va_arg(*args, double)
8822 va_arg(*args, double)
8828 if (c != 'e' && c != 'E') {
8830 /* FIXME: if HAS_LONG_DOUBLE but not USE_LONG_DOUBLE this
8831 will cast our (long double) to (double) */
8832 (void)Perl_frexp(nv, &i);
8833 if (i == PERL_INT_MIN)
8834 Perl_die(aTHX_ "panic: frexp");
8836 need = BIT_DIGITS(i);
8838 need += has_precis ? precis : 6; /* known default */
8843 #ifdef HAS_LDBL_SPRINTF_BUG
8844 /* This is to try to fix a bug with irix/nonstop-ux/powerux and
8845 with sfio - Allen <allens@cpan.org> */
8848 # define MY_DBL_MAX DBL_MAX
8849 # else /* XXX guessing! HUGE_VAL may be defined as infinity, so not using */
8850 # if DOUBLESIZE >= 8
8851 # define MY_DBL_MAX 1.7976931348623157E+308L
8853 # define MY_DBL_MAX 3.40282347E+38L
8857 # ifdef HAS_LDBL_SPRINTF_BUG_LESS1 /* only between -1L & 1L - Allen */
8858 # define MY_DBL_MAX_BUG 1L
8860 # define MY_DBL_MAX_BUG MY_DBL_MAX
8864 # define MY_DBL_MIN DBL_MIN
8865 # else /* XXX guessing! -Allen */
8866 # if DOUBLESIZE >= 8
8867 # define MY_DBL_MIN 2.2250738585072014E-308L
8869 # define MY_DBL_MIN 1.17549435E-38L
8873 if ((intsize == 'q') && (c == 'f') &&
8874 ((nv < MY_DBL_MAX_BUG) && (nv > -MY_DBL_MAX_BUG)) &&
8876 /* it's going to be short enough that
8877 * long double precision is not needed */
8879 if ((nv <= 0L) && (nv >= -0L))
8880 fix_ldbl_sprintf_bug = TRUE; /* 0 is 0 - easiest */
8882 /* would use Perl_fp_class as a double-check but not
8883 * functional on IRIX - see perl.h comments */
8885 if ((nv >= MY_DBL_MIN) || (nv <= -MY_DBL_MIN)) {
8886 /* It's within the range that a double can represent */
8887 #if defined(DBL_MAX) && !defined(DBL_MIN)
8888 if ((nv >= ((long double)1/DBL_MAX)) ||
8889 (nv <= (-(long double)1/DBL_MAX)))
8891 fix_ldbl_sprintf_bug = TRUE;
8894 if (fix_ldbl_sprintf_bug == TRUE) {
8904 # undef MY_DBL_MAX_BUG
8907 #endif /* HAS_LDBL_SPRINTF_BUG */
8909 need += 20; /* fudge factor */
8910 if (PL_efloatsize < need) {
8911 Safefree(PL_efloatbuf);
8912 PL_efloatsize = need + 20; /* more fudge */
8913 New(906, PL_efloatbuf, PL_efloatsize, char);
8914 PL_efloatbuf[0] = '\0';
8917 eptr = ebuf + sizeof ebuf;
8920 /* FIXME: what to do if HAS_LONG_DOUBLE but not PERL_PRIfldbl? */
8921 #if defined(HAS_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8922 if (intsize == 'q') {
8923 /* Copy the one or more characters in a long double
8924 * format before the 'base' ([efgEFG]) character to
8925 * the format string. */
8926 static char const prifldbl[] = PERL_PRIfldbl;
8927 char const *p = prifldbl + sizeof(prifldbl) - 3;
8928 while (p >= prifldbl) { *--eptr = *p--; }
8933 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8938 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8950 /* No taint. Otherwise we are in the strange situation
8951 * where printf() taints but print($float) doesn't.
8953 #if defined(HAS_LONG_DOUBLE)
8955 (void)sprintf(PL_efloatbuf, eptr, nv);
8957 (void)sprintf(PL_efloatbuf, eptr, (double)nv);
8959 (void)sprintf(PL_efloatbuf, eptr, nv);
8961 eptr = PL_efloatbuf;
8962 elen = strlen(PL_efloatbuf);
8968 i = SvCUR(sv) - origlen;
8969 if (args && !vectorize) {
8971 case 'h': *(va_arg(*args, short*)) = i; break;
8972 default: *(va_arg(*args, int*)) = i; break;
8973 case 'l': *(va_arg(*args, long*)) = i; break;
8974 case 'V': *(va_arg(*args, IV*)) = i; break;
8976 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8981 sv_setuv_mg(argsv, (UV)i);
8983 continue; /* not "break" */
8989 if (!args && ckWARN(WARN_PRINTF) &&
8990 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8991 SV *msg = sv_newmortal();
8992 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %sprintf: ",
8993 (PL_op->op_type == OP_PRTF) ? "" : "s");
8996 Perl_sv_catpvf(aTHX_ msg,
8997 "\"%%%c\"", c & 0xFF);
8999 Perl_sv_catpvf(aTHX_ msg,
9000 "\"%%\\%03"UVof"\"",
9003 sv_catpv(msg, "end of string");
9004 Perl_warner(aTHX_ packWARN(WARN_PRINTF), "%"SVf, msg); /* yes, this is reentrant */
9007 /* output mangled stuff ... */
9013 /* ... right here, because formatting flags should not apply */
9014 SvGROW(sv, SvCUR(sv) + elen + 1);
9016 Copy(eptr, p, elen, char);
9019 SvCUR(sv) = p - SvPVX(sv);
9021 continue; /* not "break" */
9024 if (is_utf8 != has_utf8) {
9027 sv_utf8_upgrade(sv);
9030 SV *nsv = sv_2mortal(newSVpvn(eptr, elen));
9031 sv_utf8_upgrade(nsv);
9035 SvGROW(sv, SvCUR(sv) + elen + 1);
9039 /* Use memchr() instead of strchr(), as eptr is not guaranteed */
9040 /* to point to a null-terminated string. */
9041 if (left && ckWARN(WARN_PRINTF) && memchr(eptr, '\n', elen) &&
9042 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF))
9043 Perl_warner(aTHX_ packWARN(WARN_PRINTF),
9044 "Newline in left-justified string for %sprintf",
9045 (PL_op->op_type == OP_PRTF) ? "" : "s");
9047 have = esignlen + zeros + elen;
9048 need = (have > width ? have : width);
9051 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
9053 if (esignlen && fill == '0') {
9054 for (i = 0; i < (int)esignlen; i++)
9058 memset(p, fill, gap);
9061 if (esignlen && fill != '0') {
9062 for (i = 0; i < (int)esignlen; i++)
9066 for (i = zeros; i; i--)
9070 Copy(eptr, p, elen, char);
9074 memset(p, ' ', gap);
9079 Copy(dotstr, p, dotstrlen, char);
9083 vectorize = FALSE; /* done iterating over vecstr */
9090 SvCUR(sv) = p - SvPVX(sv);
9098 /* =========================================================================
9100 =head1 Cloning an interpreter
9102 All the macros and functions in this section are for the private use of
9103 the main function, perl_clone().
9105 The foo_dup() functions make an exact copy of an existing foo thinngy.
9106 During the course of a cloning, a hash table is used to map old addresses
9107 to new addresses. The table is created and manipulated with the
9108 ptr_table_* functions.
9112 ============================================================================*/
9115 #if defined(USE_ITHREADS)
9117 #if defined(USE_5005THREADS)
9118 # include "error: USE_5005THREADS and USE_ITHREADS are incompatible"
9121 #ifndef GpREFCNT_inc
9122 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
9126 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
9127 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
9128 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9129 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
9130 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9131 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
9132 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9133 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
9134 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
9135 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
9136 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
9137 #define SAVEPV(p) (p ? savepv(p) : Nullch)
9138 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
9141 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
9142 regcomp.c. AMS 20010712 */
9145 Perl_re_dup(pTHX_ REGEXP *r, CLONE_PARAMS *param)
9149 struct reg_substr_datum *s;
9152 return (REGEXP *)NULL;
9154 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
9157 len = r->offsets[0];
9158 npar = r->nparens+1;
9160 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
9161 Copy(r->program, ret->program, len+1, regnode);
9163 New(0, ret->startp, npar, I32);
9164 Copy(r->startp, ret->startp, npar, I32);
9165 New(0, ret->endp, npar, I32);
9166 Copy(r->startp, ret->startp, npar, I32);
9168 New(0, ret->substrs, 1, struct reg_substr_data);
9169 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
9170 s->min_offset = r->substrs->data[i].min_offset;
9171 s->max_offset = r->substrs->data[i].max_offset;
9172 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
9173 s->utf8_substr = sv_dup_inc(r->substrs->data[i].utf8_substr, param);
9176 ret->regstclass = NULL;
9179 int count = r->data->count;
9181 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
9182 char, struct reg_data);
9183 New(0, d->what, count, U8);
9186 for (i = 0; i < count; i++) {
9187 d->what[i] = r->data->what[i];
9188 switch (d->what[i]) {
9190 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
9193 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
9196 /* This is cheating. */
9197 New(0, d->data[i], 1, struct regnode_charclass_class);
9198 StructCopy(r->data->data[i], d->data[i],
9199 struct regnode_charclass_class);
9200 ret->regstclass = (regnode*)d->data[i];
9203 /* Compiled op trees are readonly, and can thus be
9204 shared without duplication. */
9205 d->data[i] = (void*)OpREFCNT_inc((OP*)r->data->data[i]);
9208 d->data[i] = r->data->data[i];
9218 New(0, ret->offsets, 2*len+1, U32);
9219 Copy(r->offsets, ret->offsets, 2*len+1, U32);
9221 ret->precomp = SAVEPV(r->precomp);
9222 ret->refcnt = r->refcnt;
9223 ret->minlen = r->minlen;
9224 ret->prelen = r->prelen;
9225 ret->nparens = r->nparens;
9226 ret->lastparen = r->lastparen;
9227 ret->lastcloseparen = r->lastcloseparen;
9228 ret->reganch = r->reganch;
9230 ret->sublen = r->sublen;
9232 if (RX_MATCH_COPIED(ret))
9233 ret->subbeg = SAVEPV(r->subbeg);
9235 ret->subbeg = Nullch;
9237 ptr_table_store(PL_ptr_table, r, ret);
9241 /* duplicate a file handle */
9244 Perl_fp_dup(pTHX_ PerlIO *fp, char type, CLONE_PARAMS *param)
9248 return (PerlIO*)NULL;
9250 /* look for it in the table first */
9251 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
9255 /* create anew and remember what it is */
9256 ret = PerlIO_fdupopen(aTHX_ fp, param, PERLIO_DUP_CLONE);
9257 ptr_table_store(PL_ptr_table, fp, ret);
9261 /* duplicate a directory handle */
9264 Perl_dirp_dup(pTHX_ DIR *dp)
9272 /* duplicate a typeglob */
9275 Perl_gp_dup(pTHX_ GP *gp, CLONE_PARAMS* param)
9280 /* look for it in the table first */
9281 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
9285 /* create anew and remember what it is */
9286 Newz(0, ret, 1, GP);
9287 ptr_table_store(PL_ptr_table, gp, ret);
9290 ret->gp_refcnt = 0; /* must be before any other dups! */
9291 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
9292 ret->gp_io = io_dup_inc(gp->gp_io, param);
9293 ret->gp_form = cv_dup_inc(gp->gp_form, param);
9294 ret->gp_av = av_dup_inc(gp->gp_av, param);
9295 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
9296 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
9297 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
9298 ret->gp_cvgen = gp->gp_cvgen;
9299 ret->gp_flags = gp->gp_flags;
9300 ret->gp_line = gp->gp_line;
9301 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
9305 /* duplicate a chain of magic */
9308 Perl_mg_dup(pTHX_ MAGIC *mg, CLONE_PARAMS* param)
9310 MAGIC *mgprev = (MAGIC*)NULL;
9313 return (MAGIC*)NULL;
9314 /* look for it in the table first */
9315 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
9319 for (; mg; mg = mg->mg_moremagic) {
9321 Newz(0, nmg, 1, MAGIC);
9323 mgprev->mg_moremagic = nmg;
9326 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
9327 nmg->mg_private = mg->mg_private;
9328 nmg->mg_type = mg->mg_type;
9329 nmg->mg_flags = mg->mg_flags;
9330 if (mg->mg_type == PERL_MAGIC_qr) {
9331 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
9333 else if(mg->mg_type == PERL_MAGIC_backref) {
9334 AV *av = (AV*) mg->mg_obj;
9337 nmg->mg_obj = (SV*)newAV();
9341 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
9346 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
9347 ? sv_dup_inc(mg->mg_obj, param)
9348 : sv_dup(mg->mg_obj, param);
9350 nmg->mg_len = mg->mg_len;
9351 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
9352 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
9353 if (mg->mg_len > 0) {
9354 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
9355 if (mg->mg_type == PERL_MAGIC_overload_table &&
9356 AMT_AMAGIC((AMT*)mg->mg_ptr))
9358 AMT *amtp = (AMT*)mg->mg_ptr;
9359 AMT *namtp = (AMT*)nmg->mg_ptr;
9361 for (i = 1; i < NofAMmeth; i++) {
9362 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
9366 else if (mg->mg_len == HEf_SVKEY)
9367 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
9369 if ((mg->mg_flags & MGf_DUP) && mg->mg_virtual && mg->mg_virtual->svt_dup) {
9370 CALL_FPTR(nmg->mg_virtual->svt_dup)(aTHX_ nmg, param);
9377 /* create a new pointer-mapping table */
9380 Perl_ptr_table_new(pTHX)
9383 Newz(0, tbl, 1, PTR_TBL_t);
9386 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
9390 /* map an existing pointer using a table */
9393 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
9395 PTR_TBL_ENT_t *tblent;
9396 UV hash = PTR2UV(sv);
9398 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
9399 for (; tblent; tblent = tblent->next) {
9400 if (tblent->oldval == sv)
9401 return tblent->newval;
9406 /* add a new entry to a pointer-mapping table */
9409 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
9411 PTR_TBL_ENT_t *tblent, **otblent;
9412 /* XXX this may be pessimal on platforms where pointers aren't good
9413 * hash values e.g. if they grow faster in the most significant
9415 UV hash = PTR2UV(oldv);
9419 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
9420 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
9421 if (tblent->oldval == oldv) {
9422 tblent->newval = newv;
9426 Newz(0, tblent, 1, PTR_TBL_ENT_t);
9427 tblent->oldval = oldv;
9428 tblent->newval = newv;
9429 tblent->next = *otblent;
9432 if (i && tbl->tbl_items > tbl->tbl_max)
9433 ptr_table_split(tbl);
9436 /* double the hash bucket size of an existing ptr table */
9439 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
9441 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
9442 UV oldsize = tbl->tbl_max + 1;
9443 UV newsize = oldsize * 2;
9446 Renew(ary, newsize, PTR_TBL_ENT_t*);
9447 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
9448 tbl->tbl_max = --newsize;
9450 for (i=0; i < oldsize; i++, ary++) {
9451 PTR_TBL_ENT_t **curentp, **entp, *ent;
9454 curentp = ary + oldsize;
9455 for (entp = ary, ent = *ary; ent; ent = *entp) {
9456 if ((newsize & PTR2UV(ent->oldval)) != i) {
9458 ent->next = *curentp;
9468 /* remove all the entries from a ptr table */
9471 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
9473 register PTR_TBL_ENT_t **array;
9474 register PTR_TBL_ENT_t *entry;
9475 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
9479 if (!tbl || !tbl->tbl_items) {
9483 array = tbl->tbl_ary;
9490 entry = entry->next;
9494 if (++riter > max) {
9497 entry = array[riter];
9504 /* clear and free a ptr table */
9507 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
9512 ptr_table_clear(tbl);
9513 Safefree(tbl->tbl_ary);
9521 /* attempt to make everything in the typeglob readonly */
9524 S_gv_share(pTHX_ SV *sstr, CLONE_PARAMS *param)
9527 SV *sv = ¶m->proto_perl->Isv_no; /* just need SvREADONLY-ness */
9529 if (GvIO(gv) || GvFORM(gv)) {
9530 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
9532 else if (!GvCV(gv)) {
9536 /* CvPADLISTs cannot be shared */
9537 if (!SvREADONLY(GvCV(gv)) && !CvXSUB(GvCV(gv))) {
9542 if (!GvUNIQUE(gv)) {
9544 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
9545 HvNAME(GvSTASH(gv)), GvNAME(gv));
9551 * write attempts will die with
9552 * "Modification of a read-only value attempted"
9558 SvREADONLY_on(GvSV(gv));
9565 SvREADONLY_on(GvAV(gv));
9572 SvREADONLY_on(GvAV(gv));
9575 return sstr; /* he_dup() will SvREFCNT_inc() */
9578 /* duplicate an SV of any type (including AV, HV etc) */
9581 Perl_rvpv_dup(pTHX_ SV *dstr, SV *sstr, CLONE_PARAMS* param)
9584 SvRV(dstr) = SvWEAKREF(sstr)
9585 ? sv_dup(SvRV(sstr), param)
9586 : sv_dup_inc(SvRV(sstr), param);
9588 else if (SvPVX(sstr)) {
9589 /* Has something there */
9591 /* Normal PV - clone whole allocated space */
9592 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9595 /* Special case - not normally malloced for some reason */
9596 if (SvREADONLY(sstr) && SvFAKE(sstr)) {
9597 /* A "shared" PV - clone it as unshared string */
9598 if(SvPADTMP(sstr)) {
9599 /* However, some of them live in the pad
9600 and they should not have these flags
9603 SvPVX(dstr) = sharepvn(SvPVX(sstr), SvCUR(sstr),
9605 SvUVX(dstr) = SvUVX(sstr);
9608 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvCUR(sstr));
9610 SvREADONLY_off(dstr);
9614 /* Some other special case - random pointer */
9615 SvPVX(dstr) = SvPVX(sstr);
9621 SvPVX(dstr) = SvPVX(sstr);
9626 Perl_sv_dup(pTHX_ SV *sstr, CLONE_PARAMS* param)
9630 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
9632 /* look for it in the table first */
9633 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
9637 if(param->flags & CLONEf_JOIN_IN) {
9638 /** We are joining here so we don't want do clone
9639 something that is bad **/
9641 if(SvTYPE(sstr) == SVt_PVHV &&
9643 /** don't clone stashes if they already exist **/
9644 HV* old_stash = gv_stashpv(HvNAME(sstr),0);
9645 return (SV*) old_stash;
9649 /* create anew and remember what it is */
9651 ptr_table_store(PL_ptr_table, sstr, dstr);
9654 SvFLAGS(dstr) = SvFLAGS(sstr);
9655 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
9656 SvREFCNT(dstr) = 0; /* must be before any other dups! */
9659 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
9660 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
9661 PL_watch_pvx, SvPVX(sstr));
9664 switch (SvTYPE(sstr)) {
9669 SvANY(dstr) = new_XIV();
9670 SvIVX(dstr) = SvIVX(sstr);
9673 SvANY(dstr) = new_XNV();
9674 SvNVX(dstr) = SvNVX(sstr);
9677 SvANY(dstr) = new_XRV();
9678 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9681 SvANY(dstr) = new_XPV();
9682 SvCUR(dstr) = SvCUR(sstr);
9683 SvLEN(dstr) = SvLEN(sstr);
9684 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9687 SvANY(dstr) = new_XPVIV();
9688 SvCUR(dstr) = SvCUR(sstr);
9689 SvLEN(dstr) = SvLEN(sstr);
9690 SvIVX(dstr) = SvIVX(sstr);
9691 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9694 SvANY(dstr) = new_XPVNV();
9695 SvCUR(dstr) = SvCUR(sstr);
9696 SvLEN(dstr) = SvLEN(sstr);
9697 SvIVX(dstr) = SvIVX(sstr);
9698 SvNVX(dstr) = SvNVX(sstr);
9699 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9702 SvANY(dstr) = new_XPVMG();
9703 SvCUR(dstr) = SvCUR(sstr);
9704 SvLEN(dstr) = SvLEN(sstr);
9705 SvIVX(dstr) = SvIVX(sstr);
9706 SvNVX(dstr) = SvNVX(sstr);
9707 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9708 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9709 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9712 SvANY(dstr) = new_XPVBM();
9713 SvCUR(dstr) = SvCUR(sstr);
9714 SvLEN(dstr) = SvLEN(sstr);
9715 SvIVX(dstr) = SvIVX(sstr);
9716 SvNVX(dstr) = SvNVX(sstr);
9717 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9718 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9719 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9720 BmRARE(dstr) = BmRARE(sstr);
9721 BmUSEFUL(dstr) = BmUSEFUL(sstr);
9722 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
9725 SvANY(dstr) = new_XPVLV();
9726 SvCUR(dstr) = SvCUR(sstr);
9727 SvLEN(dstr) = SvLEN(sstr);
9728 SvIVX(dstr) = SvIVX(sstr);
9729 SvNVX(dstr) = SvNVX(sstr);
9730 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9731 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9732 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9733 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
9734 LvTARGLEN(dstr) = LvTARGLEN(sstr);
9735 if (LvTYPE(sstr) == 't') /* for tie: unrefcnted fake (SV**) */
9736 LvTARG(dstr) = dstr;
9737 else if (LvTYPE(sstr) == 'T') /* for tie: fake HE */
9738 LvTARG(dstr) = (SV*)he_dup((HE*)LvTARG(sstr), 0, param);
9740 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
9741 LvTYPE(dstr) = LvTYPE(sstr);
9744 if (GvUNIQUE((GV*)sstr)) {
9746 if ((share = gv_share(sstr, param))) {
9749 ptr_table_store(PL_ptr_table, sstr, dstr);
9751 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
9752 HvNAME(GvSTASH(share)), GvNAME(share));
9757 SvANY(dstr) = new_XPVGV();
9758 SvCUR(dstr) = SvCUR(sstr);
9759 SvLEN(dstr) = SvLEN(sstr);
9760 SvIVX(dstr) = SvIVX(sstr);
9761 SvNVX(dstr) = SvNVX(sstr);
9762 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9763 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9764 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9765 GvNAMELEN(dstr) = GvNAMELEN(sstr);
9766 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
9767 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
9768 GvFLAGS(dstr) = GvFLAGS(sstr);
9769 GvGP(dstr) = gp_dup(GvGP(sstr), param);
9770 (void)GpREFCNT_inc(GvGP(dstr));
9773 SvANY(dstr) = new_XPVIO();
9774 SvCUR(dstr) = SvCUR(sstr);
9775 SvLEN(dstr) = SvLEN(sstr);
9776 SvIVX(dstr) = SvIVX(sstr);
9777 SvNVX(dstr) = SvNVX(sstr);
9778 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9779 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9780 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9781 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr), param);
9782 if (IoOFP(sstr) == IoIFP(sstr))
9783 IoOFP(dstr) = IoIFP(dstr);
9785 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr), param);
9786 /* PL_rsfp_filters entries have fake IoDIRP() */
9787 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
9788 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
9790 IoDIRP(dstr) = IoDIRP(sstr);
9791 IoLINES(dstr) = IoLINES(sstr);
9792 IoPAGE(dstr) = IoPAGE(sstr);
9793 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
9794 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
9795 if(IoFLAGS(sstr) & IOf_FAKE_DIRP) {
9796 /* I have no idea why fake dirp (rsfps)
9797 should be treaded differently but otherwise
9798 we end up with leaks -- sky*/
9799 IoTOP_GV(dstr) = gv_dup_inc(IoTOP_GV(sstr), param);
9800 IoFMT_GV(dstr) = gv_dup_inc(IoFMT_GV(sstr), param);
9801 IoBOTTOM_GV(dstr) = gv_dup_inc(IoBOTTOM_GV(sstr), param);
9803 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
9804 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
9805 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
9807 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
9808 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
9809 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
9810 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
9811 IoTYPE(dstr) = IoTYPE(sstr);
9812 IoFLAGS(dstr) = IoFLAGS(sstr);
9815 SvANY(dstr) = new_XPVAV();
9816 SvCUR(dstr) = SvCUR(sstr);
9817 SvLEN(dstr) = SvLEN(sstr);
9818 SvIVX(dstr) = SvIVX(sstr);
9819 SvNVX(dstr) = SvNVX(sstr);
9820 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9821 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9822 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
9823 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
9824 if (AvARRAY((AV*)sstr)) {
9825 SV **dst_ary, **src_ary;
9826 SSize_t items = AvFILLp((AV*)sstr) + 1;
9828 src_ary = AvARRAY((AV*)sstr);
9829 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
9830 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9831 SvPVX(dstr) = (char*)dst_ary;
9832 AvALLOC((AV*)dstr) = dst_ary;
9833 if (AvREAL((AV*)sstr)) {
9835 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9839 *dst_ary++ = sv_dup(*src_ary++, param);
9841 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9842 while (items-- > 0) {
9843 *dst_ary++ = &PL_sv_undef;
9847 SvPVX(dstr) = Nullch;
9848 AvALLOC((AV*)dstr) = (SV**)NULL;
9852 SvANY(dstr) = new_XPVHV();
9853 SvCUR(dstr) = SvCUR(sstr);
9854 SvLEN(dstr) = SvLEN(sstr);
9855 SvIVX(dstr) = SvIVX(sstr);
9856 SvNVX(dstr) = SvNVX(sstr);
9857 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9858 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9859 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
9860 if (HvARRAY((HV*)sstr)) {
9862 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
9863 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
9864 Newz(0, dxhv->xhv_array,
9865 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
9866 while (i <= sxhv->xhv_max) {
9867 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
9868 (bool)!!HvSHAREKEYS(sstr),
9872 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter,
9873 (bool)!!HvSHAREKEYS(sstr), param);
9876 SvPVX(dstr) = Nullch;
9877 HvEITER((HV*)dstr) = (HE*)NULL;
9879 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
9880 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
9881 /* Record stashes for possible cloning in Perl_clone(). */
9882 if(HvNAME((HV*)dstr))
9883 av_push(param->stashes, dstr);
9886 SvANY(dstr) = new_XPVFM();
9887 FmLINES(dstr) = FmLINES(sstr);
9891 SvANY(dstr) = new_XPVCV();
9893 SvCUR(dstr) = SvCUR(sstr);
9894 SvLEN(dstr) = SvLEN(sstr);
9895 SvIVX(dstr) = SvIVX(sstr);
9896 SvNVX(dstr) = SvNVX(sstr);
9897 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9898 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9899 Perl_rvpv_dup(aTHX_ dstr, sstr, param);
9900 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
9901 CvSTART(dstr) = CvSTART(sstr);
9902 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
9903 CvXSUB(dstr) = CvXSUB(sstr);
9904 CvXSUBANY(dstr) = CvXSUBANY(sstr);
9905 if (CvCONST(sstr)) {
9906 CvXSUBANY(dstr).any_ptr = GvUNIQUE(CvGV(sstr)) ?
9907 SvREFCNT_inc(CvXSUBANY(sstr).any_ptr) :
9908 sv_dup_inc(CvXSUBANY(sstr).any_ptr, param);
9910 CvGV(dstr) = gv_dup(CvGV(sstr), param);
9911 if (param->flags & CLONEf_COPY_STACKS) {
9912 CvDEPTH(dstr) = CvDEPTH(sstr);
9916 PAD_DUP(CvPADLIST(dstr), CvPADLIST(sstr), param);
9917 CvOUTSIDE_SEQ(dstr) = CvOUTSIDE_SEQ(sstr);
9920 ? cv_dup( CvOUTSIDE(sstr), param)
9921 : cv_dup_inc(CvOUTSIDE(sstr), param);
9922 CvFLAGS(dstr) = CvFLAGS(sstr);
9923 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
9926 Perl_croak(aTHX_ "Bizarre SvTYPE [%" IVdf "]", (IV)SvTYPE(sstr));
9930 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9936 /* duplicate a context */
9939 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, CLONE_PARAMS* param)
9944 return (PERL_CONTEXT*)NULL;
9946 /* look for it in the table first */
9947 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9951 /* create anew and remember what it is */
9952 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9953 ptr_table_store(PL_ptr_table, cxs, ncxs);
9956 PERL_CONTEXT *cx = &cxs[ix];
9957 PERL_CONTEXT *ncx = &ncxs[ix];
9958 ncx->cx_type = cx->cx_type;
9959 if (CxTYPE(cx) == CXt_SUBST) {
9960 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9963 ncx->blk_oldsp = cx->blk_oldsp;
9964 ncx->blk_oldcop = cx->blk_oldcop;
9965 ncx->blk_oldretsp = cx->blk_oldretsp;
9966 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9967 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9968 ncx->blk_oldpm = cx->blk_oldpm;
9969 ncx->blk_gimme = cx->blk_gimme;
9970 switch (CxTYPE(cx)) {
9972 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9973 ? cv_dup_inc(cx->blk_sub.cv, param)
9974 : cv_dup(cx->blk_sub.cv,param));
9975 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9976 ? av_dup_inc(cx->blk_sub.argarray, param)
9978 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9979 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9980 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9981 ncx->blk_sub.lval = cx->blk_sub.lval;
9984 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9985 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9986 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);
9987 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9988 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9991 ncx->blk_loop.label = cx->blk_loop.label;
9992 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9993 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9994 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9995 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9996 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9997 ? cx->blk_loop.iterdata
9998 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9999 ncx->blk_loop.oldcomppad
10000 = (PAD*)ptr_table_fetch(PL_ptr_table,
10001 cx->blk_loop.oldcomppad);
10002 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
10003 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
10004 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
10005 ncx->blk_loop.iterix = cx->blk_loop.iterix;
10006 ncx->blk_loop.itermax = cx->blk_loop.itermax;
10009 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
10010 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
10011 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
10012 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
10024 /* duplicate a stack info structure */
10027 Perl_si_dup(pTHX_ PERL_SI *si, CLONE_PARAMS* param)
10032 return (PERL_SI*)NULL;
10034 /* look for it in the table first */
10035 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
10039 /* create anew and remember what it is */
10040 Newz(56, nsi, 1, PERL_SI);
10041 ptr_table_store(PL_ptr_table, si, nsi);
10043 nsi->si_stack = av_dup_inc(si->si_stack, param);
10044 nsi->si_cxix = si->si_cxix;
10045 nsi->si_cxmax = si->si_cxmax;
10046 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
10047 nsi->si_type = si->si_type;
10048 nsi->si_prev = si_dup(si->si_prev, param);
10049 nsi->si_next = si_dup(si->si_next, param);
10050 nsi->si_markoff = si->si_markoff;
10055 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
10056 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
10057 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
10058 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
10059 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
10060 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
10061 #define POPBOOL(ss,ix) ((ss)[--(ix)].any_bool)
10062 #define TOPBOOL(ss,ix) ((ss)[ix].any_bool)
10063 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
10064 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
10065 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
10066 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
10067 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
10068 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
10071 #define pv_dup_inc(p) SAVEPV(p)
10072 #define pv_dup(p) SAVEPV(p)
10073 #define svp_dup_inc(p,pp) any_dup(p,pp)
10075 /* map any object to the new equivent - either something in the
10076 * ptr table, or something in the interpreter structure
10080 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
10085 return (void*)NULL;
10087 /* look for it in the table first */
10088 ret = ptr_table_fetch(PL_ptr_table, v);
10092 /* see if it is part of the interpreter structure */
10093 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
10094 ret = (void*)(((char*)aTHX) + (((char*)v) - (char*)proto_perl));
10102 /* duplicate the save stack */
10105 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, CLONE_PARAMS* param)
10107 ANY *ss = proto_perl->Tsavestack;
10108 I32 ix = proto_perl->Tsavestack_ix;
10109 I32 max = proto_perl->Tsavestack_max;
10122 void (*dptr) (void*);
10123 void (*dxptr) (pTHX_ void*);
10126 Newz(54, nss, max, ANY);
10130 TOPINT(nss,ix) = i;
10132 case SAVEt_ITEM: /* normal string */
10133 sv = (SV*)POPPTR(ss,ix);
10134 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10135 sv = (SV*)POPPTR(ss,ix);
10136 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10138 case SAVEt_SV: /* scalar reference */
10139 sv = (SV*)POPPTR(ss,ix);
10140 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10141 gv = (GV*)POPPTR(ss,ix);
10142 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10144 case SAVEt_GENERIC_PVREF: /* generic char* */
10145 c = (char*)POPPTR(ss,ix);
10146 TOPPTR(nss,ix) = pv_dup(c);
10147 ptr = POPPTR(ss,ix);
10148 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10150 case SAVEt_SHARED_PVREF: /* char* in shared space */
10151 c = (char*)POPPTR(ss,ix);
10152 TOPPTR(nss,ix) = savesharedpv(c);
10153 ptr = POPPTR(ss,ix);
10154 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10156 case SAVEt_GENERIC_SVREF: /* generic sv */
10157 case SAVEt_SVREF: /* scalar reference */
10158 sv = (SV*)POPPTR(ss,ix);
10159 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10160 ptr = POPPTR(ss,ix);
10161 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
10163 case SAVEt_AV: /* array reference */
10164 av = (AV*)POPPTR(ss,ix);
10165 TOPPTR(nss,ix) = av_dup_inc(av, param);
10166 gv = (GV*)POPPTR(ss,ix);
10167 TOPPTR(nss,ix) = gv_dup(gv, param);
10169 case SAVEt_HV: /* hash reference */
10170 hv = (HV*)POPPTR(ss,ix);
10171 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10172 gv = (GV*)POPPTR(ss,ix);
10173 TOPPTR(nss,ix) = gv_dup(gv, param);
10175 case SAVEt_INT: /* int reference */
10176 ptr = POPPTR(ss,ix);
10177 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10178 intval = (int)POPINT(ss,ix);
10179 TOPINT(nss,ix) = intval;
10181 case SAVEt_LONG: /* long reference */
10182 ptr = POPPTR(ss,ix);
10183 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10184 longval = (long)POPLONG(ss,ix);
10185 TOPLONG(nss,ix) = longval;
10187 case SAVEt_I32: /* I32 reference */
10188 case SAVEt_I16: /* I16 reference */
10189 case SAVEt_I8: /* I8 reference */
10190 ptr = POPPTR(ss,ix);
10191 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10193 TOPINT(nss,ix) = i;
10195 case SAVEt_IV: /* IV reference */
10196 ptr = POPPTR(ss,ix);
10197 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10199 TOPIV(nss,ix) = iv;
10201 case SAVEt_SPTR: /* SV* reference */
10202 ptr = POPPTR(ss,ix);
10203 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10204 sv = (SV*)POPPTR(ss,ix);
10205 TOPPTR(nss,ix) = sv_dup(sv, param);
10207 case SAVEt_VPTR: /* random* reference */
10208 ptr = POPPTR(ss,ix);
10209 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10210 ptr = POPPTR(ss,ix);
10211 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10213 case SAVEt_PPTR: /* char* reference */
10214 ptr = POPPTR(ss,ix);
10215 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10216 c = (char*)POPPTR(ss,ix);
10217 TOPPTR(nss,ix) = pv_dup(c);
10219 case SAVEt_HPTR: /* HV* reference */
10220 ptr = POPPTR(ss,ix);
10221 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10222 hv = (HV*)POPPTR(ss,ix);
10223 TOPPTR(nss,ix) = hv_dup(hv, param);
10225 case SAVEt_APTR: /* AV* reference */
10226 ptr = POPPTR(ss,ix);
10227 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10228 av = (AV*)POPPTR(ss,ix);
10229 TOPPTR(nss,ix) = av_dup(av, param);
10232 gv = (GV*)POPPTR(ss,ix);
10233 TOPPTR(nss,ix) = gv_dup(gv, param);
10235 case SAVEt_GP: /* scalar reference */
10236 gp = (GP*)POPPTR(ss,ix);
10237 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
10238 (void)GpREFCNT_inc(gp);
10239 gv = (GV*)POPPTR(ss,ix);
10240 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
10241 c = (char*)POPPTR(ss,ix);
10242 TOPPTR(nss,ix) = pv_dup(c);
10244 TOPIV(nss,ix) = iv;
10246 TOPIV(nss,ix) = iv;
10249 case SAVEt_MORTALIZESV:
10250 sv = (SV*)POPPTR(ss,ix);
10251 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10254 ptr = POPPTR(ss,ix);
10255 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
10256 /* these are assumed to be refcounted properly */
10257 switch (((OP*)ptr)->op_type) {
10259 case OP_LEAVESUBLV:
10263 case OP_LEAVEWRITE:
10264 TOPPTR(nss,ix) = ptr;
10269 TOPPTR(nss,ix) = Nullop;
10274 TOPPTR(nss,ix) = Nullop;
10277 c = (char*)POPPTR(ss,ix);
10278 TOPPTR(nss,ix) = pv_dup_inc(c);
10280 case SAVEt_CLEARSV:
10281 longval = POPLONG(ss,ix);
10282 TOPLONG(nss,ix) = longval;
10285 hv = (HV*)POPPTR(ss,ix);
10286 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10287 c = (char*)POPPTR(ss,ix);
10288 TOPPTR(nss,ix) = pv_dup_inc(c);
10290 TOPINT(nss,ix) = i;
10292 case SAVEt_DESTRUCTOR:
10293 ptr = POPPTR(ss,ix);
10294 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10295 dptr = POPDPTR(ss,ix);
10296 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
10298 case SAVEt_DESTRUCTOR_X:
10299 ptr = POPPTR(ss,ix);
10300 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
10301 dxptr = POPDXPTR(ss,ix);
10302 TOPDXPTR(nss,ix) = (void (*)(pTHX_ void*))any_dup((void *)dxptr, proto_perl);
10304 case SAVEt_REGCONTEXT:
10307 TOPINT(nss,ix) = i;
10310 case SAVEt_STACK_POS: /* Position on Perl stack */
10312 TOPINT(nss,ix) = i;
10314 case SAVEt_AELEM: /* array element */
10315 sv = (SV*)POPPTR(ss,ix);
10316 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10318 TOPINT(nss,ix) = i;
10319 av = (AV*)POPPTR(ss,ix);
10320 TOPPTR(nss,ix) = av_dup_inc(av, param);
10322 case SAVEt_HELEM: /* hash element */
10323 sv = (SV*)POPPTR(ss,ix);
10324 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10325 sv = (SV*)POPPTR(ss,ix);
10326 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
10327 hv = (HV*)POPPTR(ss,ix);
10328 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
10331 ptr = POPPTR(ss,ix);
10332 TOPPTR(nss,ix) = ptr;
10336 TOPINT(nss,ix) = i;
10338 case SAVEt_COMPPAD:
10339 av = (AV*)POPPTR(ss,ix);
10340 TOPPTR(nss,ix) = av_dup(av, param);
10343 longval = (long)POPLONG(ss,ix);
10344 TOPLONG(nss,ix) = longval;
10345 ptr = POPPTR(ss,ix);
10346 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10347 sv = (SV*)POPPTR(ss,ix);
10348 TOPPTR(nss,ix) = sv_dup(sv, param);
10351 ptr = POPPTR(ss,ix);
10352 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
10353 longval = (long)POPBOOL(ss,ix);
10354 TOPBOOL(nss,ix) = (bool)longval;
10357 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
10365 =for apidoc perl_clone
10367 Create and return a new interpreter by cloning the current one.
10369 perl_clone takes these flags as paramters:
10371 CLONEf_COPY_STACKS - is used to, well, copy the stacks also,
10372 without it we only clone the data and zero the stacks,
10373 with it we copy the stacks and the new perl interpreter is
10374 ready to run at the exact same point as the previous one.
10375 The pseudo-fork code uses COPY_STACKS while the
10376 threads->new doesn't.
10378 CLONEf_KEEP_PTR_TABLE
10379 perl_clone keeps a ptr_table with the pointer of the old
10380 variable as a key and the new variable as a value,
10381 this allows it to check if something has been cloned and not
10382 clone it again but rather just use the value and increase the
10383 refcount. If KEEP_PTR_TABLE is not set then perl_clone will kill
10384 the ptr_table using the function
10385 C<ptr_table_free(PL_ptr_table); PL_ptr_table = NULL;>,
10386 reason to keep it around is if you want to dup some of your own
10387 variable who are outside the graph perl scans, example of this
10388 code is in threads.xs create
10391 This is a win32 thing, it is ignored on unix, it tells perls
10392 win32host code (which is c++) to clone itself, this is needed on
10393 win32 if you want to run two threads at the same time,
10394 if you just want to do some stuff in a separate perl interpreter
10395 and then throw it away and return to the original one,
10396 you don't need to do anything.
10401 /* XXX the above needs expanding by someone who actually understands it ! */
10402 EXTERN_C PerlInterpreter *
10403 perl_clone_host(PerlInterpreter* proto_perl, UV flags);
10406 perl_clone(PerlInterpreter *proto_perl, UV flags)
10408 #ifdef PERL_IMPLICIT_SYS
10410 /* perlhost.h so we need to call into it
10411 to clone the host, CPerlHost should have a c interface, sky */
10413 if (flags & CLONEf_CLONE_HOST) {
10414 return perl_clone_host(proto_perl,flags);
10416 return perl_clone_using(proto_perl, flags,
10418 proto_perl->IMemShared,
10419 proto_perl->IMemParse,
10421 proto_perl->IStdIO,
10425 proto_perl->IProc);
10429 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
10430 struct IPerlMem* ipM, struct IPerlMem* ipMS,
10431 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
10432 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
10433 struct IPerlDir* ipD, struct IPerlSock* ipS,
10434 struct IPerlProc* ipP)
10436 /* XXX many of the string copies here can be optimized if they're
10437 * constants; they need to be allocated as common memory and just
10438 * their pointers copied. */
10441 CLONE_PARAMS clone_params;
10442 CLONE_PARAMS* param = &clone_params;
10444 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
10445 PERL_SET_THX(my_perl);
10448 Poison(my_perl, 1, PerlInterpreter);
10453 PL_sig_pending = 0;
10454 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10455 # else /* !DEBUGGING */
10456 Zero(my_perl, 1, PerlInterpreter);
10457 # endif /* DEBUGGING */
10459 /* host pointers */
10461 PL_MemShared = ipMS;
10462 PL_MemParse = ipMP;
10469 #else /* !PERL_IMPLICIT_SYS */
10471 CLONE_PARAMS clone_params;
10472 CLONE_PARAMS* param = &clone_params;
10473 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
10474 PERL_SET_THX(my_perl);
10479 Poison(my_perl, 1, PerlInterpreter);
10484 PL_sig_pending = 0;
10485 Zero(&PL_debug_pad, 1, struct perl_debug_pad);
10486 # else /* !DEBUGGING */
10487 Zero(my_perl, 1, PerlInterpreter);
10488 # endif /* DEBUGGING */
10489 #endif /* PERL_IMPLICIT_SYS */
10490 param->flags = flags;
10491 param->proto_perl = proto_perl;
10494 PL_xiv_arenaroot = NULL;
10495 PL_xiv_root = NULL;
10496 PL_xnv_arenaroot = NULL;
10497 PL_xnv_root = NULL;
10498 PL_xrv_arenaroot = NULL;
10499 PL_xrv_root = NULL;
10500 PL_xpv_arenaroot = NULL;
10501 PL_xpv_root = NULL;
10502 PL_xpviv_arenaroot = NULL;
10503 PL_xpviv_root = NULL;
10504 PL_xpvnv_arenaroot = NULL;
10505 PL_xpvnv_root = NULL;
10506 PL_xpvcv_arenaroot = NULL;
10507 PL_xpvcv_root = NULL;
10508 PL_xpvav_arenaroot = NULL;
10509 PL_xpvav_root = NULL;
10510 PL_xpvhv_arenaroot = NULL;
10511 PL_xpvhv_root = NULL;
10512 PL_xpvmg_arenaroot = NULL;
10513 PL_xpvmg_root = NULL;
10514 PL_xpvlv_arenaroot = NULL;
10515 PL_xpvlv_root = NULL;
10516 PL_xpvbm_arenaroot = NULL;
10517 PL_xpvbm_root = NULL;
10518 PL_he_arenaroot = NULL;
10520 PL_nice_chunk = NULL;
10521 PL_nice_chunk_size = 0;
10523 PL_sv_objcount = 0;
10524 PL_sv_root = Nullsv;
10525 PL_sv_arenaroot = Nullsv;
10527 PL_debug = proto_perl->Idebug;
10529 #ifdef USE_REENTRANT_API
10530 Perl_reentrant_init(aTHX);
10533 /* create SV map for pointer relocation */
10534 PL_ptr_table = ptr_table_new();
10536 /* initialize these special pointers as early as possible */
10537 SvANY(&PL_sv_undef) = NULL;
10538 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
10539 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
10540 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
10542 SvANY(&PL_sv_no) = new_XPVNV();
10543 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
10544 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10545 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
10546 SvCUR(&PL_sv_no) = 0;
10547 SvLEN(&PL_sv_no) = 1;
10548 SvNVX(&PL_sv_no) = 0;
10549 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
10551 SvANY(&PL_sv_yes) = new_XPVNV();
10552 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
10553 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
10554 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
10555 SvCUR(&PL_sv_yes) = 1;
10556 SvLEN(&PL_sv_yes) = 2;
10557 SvNVX(&PL_sv_yes) = 1;
10558 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
10560 /* create (a non-shared!) shared string table */
10561 PL_strtab = newHV();
10562 HvSHAREKEYS_off(PL_strtab);
10563 hv_ksplit(PL_strtab, 512);
10564 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
10566 PL_compiling = proto_perl->Icompiling;
10568 /* These two PVs will be free'd special way so must set them same way op.c does */
10569 PL_compiling.cop_stashpv = savesharedpv(PL_compiling.cop_stashpv);
10570 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_stashpv, PL_compiling.cop_stashpv);
10572 PL_compiling.cop_file = savesharedpv(PL_compiling.cop_file);
10573 ptr_table_store(PL_ptr_table, proto_perl->Icompiling.cop_file, PL_compiling.cop_file);
10575 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
10576 if (!specialWARN(PL_compiling.cop_warnings))
10577 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
10578 if (!specialCopIO(PL_compiling.cop_io))
10579 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
10580 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
10582 /* pseudo environmental stuff */
10583 PL_origargc = proto_perl->Iorigargc;
10584 PL_origargv = proto_perl->Iorigargv;
10586 param->stashes = newAV(); /* Setup array of objects to call clone on */
10588 #ifdef PERLIO_LAYERS
10589 /* Clone PerlIO tables as soon as we can handle general xx_dup() */
10590 PerlIO_clone(aTHX_ proto_perl, param);
10593 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
10594 PL_incgv = gv_dup(proto_perl->Iincgv, param);
10595 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
10596 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
10597 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
10598 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
10601 PL_minus_c = proto_perl->Iminus_c;
10602 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
10603 PL_localpatches = proto_perl->Ilocalpatches;
10604 PL_splitstr = proto_perl->Isplitstr;
10605 PL_preprocess = proto_perl->Ipreprocess;
10606 PL_minus_n = proto_perl->Iminus_n;
10607 PL_minus_p = proto_perl->Iminus_p;
10608 PL_minus_l = proto_perl->Iminus_l;
10609 PL_minus_a = proto_perl->Iminus_a;
10610 PL_minus_F = proto_perl->Iminus_F;
10611 PL_doswitches = proto_perl->Idoswitches;
10612 PL_dowarn = proto_perl->Idowarn;
10613 PL_doextract = proto_perl->Idoextract;
10614 PL_sawampersand = proto_perl->Isawampersand;
10615 PL_unsafe = proto_perl->Iunsafe;
10616 PL_inplace = SAVEPV(proto_perl->Iinplace);
10617 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
10618 PL_perldb = proto_perl->Iperldb;
10619 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
10620 PL_exit_flags = proto_perl->Iexit_flags;
10622 /* magical thingies */
10623 /* XXX time(&PL_basetime) when asked for? */
10624 PL_basetime = proto_perl->Ibasetime;
10625 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
10627 PL_maxsysfd = proto_perl->Imaxsysfd;
10628 PL_multiline = proto_perl->Imultiline;
10629 PL_statusvalue = proto_perl->Istatusvalue;
10631 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
10633 PL_encoding = sv_dup(proto_perl->Iencoding, param);
10635 sv_setpvn(PERL_DEBUG_PAD(0), "", 0); /* For regex debugging. */
10636 sv_setpvn(PERL_DEBUG_PAD(1), "", 0); /* ext/re needs these */
10637 sv_setpvn(PERL_DEBUG_PAD(2), "", 0); /* even without DEBUGGING. */
10639 /* Clone the regex array */
10640 PL_regex_padav = newAV();
10642 I32 len = av_len((AV*)proto_perl->Iregex_padav);
10643 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
10644 av_push(PL_regex_padav,
10645 sv_dup_inc(regexen[0],param));
10646 for(i = 1; i <= len; i++) {
10647 if(SvREPADTMP(regexen[i])) {
10648 av_push(PL_regex_padav, sv_dup_inc(regexen[i], param));
10650 av_push(PL_regex_padav,
10652 newSViv(PTR2IV(re_dup(INT2PTR(REGEXP *,
10653 SvIVX(regexen[i])), param)))
10658 PL_regex_pad = AvARRAY(PL_regex_padav);
10660 /* shortcuts to various I/O objects */
10661 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
10662 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
10663 PL_defgv = gv_dup(proto_perl->Idefgv, param);
10664 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
10665 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
10666 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
10668 /* shortcuts to regexp stuff */
10669 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
10671 /* shortcuts to misc objects */
10672 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
10674 /* shortcuts to debugging objects */
10675 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
10676 PL_DBline = gv_dup(proto_perl->IDBline, param);
10677 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
10678 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
10679 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
10680 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
10681 PL_lineary = av_dup(proto_perl->Ilineary, param);
10682 PL_dbargs = av_dup(proto_perl->Idbargs, param);
10684 /* symbol tables */
10685 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
10686 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
10687 PL_nullstash = hv_dup(proto_perl->Inullstash, param);
10688 PL_debstash = hv_dup(proto_perl->Idebstash, param);
10689 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
10690 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
10692 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
10693 PL_beginav_save = av_dup_inc(proto_perl->Ibeginav_save, param);
10694 PL_checkav_save = av_dup_inc(proto_perl->Icheckav_save, param);
10695 PL_endav = av_dup_inc(proto_perl->Iendav, param);
10696 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
10697 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
10699 PL_sub_generation = proto_perl->Isub_generation;
10701 /* funky return mechanisms */
10702 PL_forkprocess = proto_perl->Iforkprocess;
10704 /* subprocess state */
10705 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
10707 /* internal state */
10708 PL_tainting = proto_perl->Itainting;
10709 PL_taint_warn = proto_perl->Itaint_warn;
10710 PL_maxo = proto_perl->Imaxo;
10711 if (proto_perl->Iop_mask)
10712 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
10714 PL_op_mask = Nullch;
10716 /* current interpreter roots */
10717 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
10718 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
10719 PL_main_start = proto_perl->Imain_start;
10720 PL_eval_root = proto_perl->Ieval_root;
10721 PL_eval_start = proto_perl->Ieval_start;
10723 /* runtime control stuff */
10724 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
10725 PL_copline = proto_perl->Icopline;
10727 PL_filemode = proto_perl->Ifilemode;
10728 PL_lastfd = proto_perl->Ilastfd;
10729 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
10732 PL_gensym = proto_perl->Igensym;
10733 PL_preambled = proto_perl->Ipreambled;
10734 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
10735 PL_laststatval = proto_perl->Ilaststatval;
10736 PL_laststype = proto_perl->Ilaststype;
10737 PL_mess_sv = Nullsv;
10739 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
10740 PL_ofmt = SAVEPV(proto_perl->Iofmt);
10742 /* interpreter atexit processing */
10743 PL_exitlistlen = proto_perl->Iexitlistlen;
10744 if (PL_exitlistlen) {
10745 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10746 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
10749 PL_exitlist = (PerlExitListEntry*)NULL;
10750 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
10751 PL_custom_op_names = hv_dup_inc(proto_perl->Icustom_op_names,param);
10752 PL_custom_op_descs = hv_dup_inc(proto_perl->Icustom_op_descs,param);
10754 PL_profiledata = NULL;
10755 PL_rsfp = fp_dup(proto_perl->Irsfp, '<', param);
10756 /* PL_rsfp_filters entries have fake IoDIRP() */
10757 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
10759 PL_compcv = cv_dup(proto_perl->Icompcv, param);
10761 PAD_CLONE_VARS(proto_perl, param);
10763 #ifdef HAVE_INTERP_INTERN
10764 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
10767 /* more statics moved here */
10768 PL_generation = proto_perl->Igeneration;
10769 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
10771 PL_in_clean_objs = proto_perl->Iin_clean_objs;
10772 PL_in_clean_all = proto_perl->Iin_clean_all;
10774 PL_uid = proto_perl->Iuid;
10775 PL_euid = proto_perl->Ieuid;
10776 PL_gid = proto_perl->Igid;
10777 PL_egid = proto_perl->Iegid;
10778 PL_nomemok = proto_perl->Inomemok;
10779 PL_an = proto_perl->Ian;
10780 PL_op_seqmax = proto_perl->Iop_seqmax;
10781 PL_evalseq = proto_perl->Ievalseq;
10782 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
10783 PL_origalen = proto_perl->Iorigalen;
10784 PL_pidstatus = newHV(); /* XXX flag for cloning? */
10785 PL_osname = SAVEPV(proto_perl->Iosname);
10786 PL_sh_path_compat = proto_perl->Ish_path_compat; /* XXX never deallocated */
10787 PL_sighandlerp = proto_perl->Isighandlerp;
10790 PL_runops = proto_perl->Irunops;
10792 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
10795 PL_cshlen = proto_perl->Icshlen;
10796 PL_cshname = proto_perl->Icshname; /* XXX never deallocated */
10799 PL_lex_state = proto_perl->Ilex_state;
10800 PL_lex_defer = proto_perl->Ilex_defer;
10801 PL_lex_expect = proto_perl->Ilex_expect;
10802 PL_lex_formbrack = proto_perl->Ilex_formbrack;
10803 PL_lex_dojoin = proto_perl->Ilex_dojoin;
10804 PL_lex_starts = proto_perl->Ilex_starts;
10805 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
10806 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
10807 PL_lex_op = proto_perl->Ilex_op;
10808 PL_lex_inpat = proto_perl->Ilex_inpat;
10809 PL_lex_inwhat = proto_perl->Ilex_inwhat;
10810 PL_lex_brackets = proto_perl->Ilex_brackets;
10811 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
10812 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
10813 PL_lex_casemods = proto_perl->Ilex_casemods;
10814 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
10815 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
10817 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
10818 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
10819 PL_nexttoke = proto_perl->Inexttoke;
10821 /* XXX This is probably masking the deeper issue of why
10822 * SvANY(proto_perl->Ilinestr) can be NULL at this point. For test case:
10823 * http://archive.develooper.com/perl5-porters%40perl.org/msg83298.html
10824 * (A little debugging with a watchpoint on it may help.)
10826 if (SvANY(proto_perl->Ilinestr)) {
10827 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
10828 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
10829 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10830 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
10831 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10832 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
10833 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10834 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
10835 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10838 PL_linestr = NEWSV(65,79);
10839 sv_upgrade(PL_linestr,SVt_PVIV);
10840 sv_setpvn(PL_linestr,"",0);
10841 PL_bufptr = PL_oldbufptr = PL_oldoldbufptr = PL_linestart = SvPVX(PL_linestr);
10843 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
10844 PL_pending_ident = proto_perl->Ipending_ident;
10845 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
10847 PL_expect = proto_perl->Iexpect;
10849 PL_multi_start = proto_perl->Imulti_start;
10850 PL_multi_end = proto_perl->Imulti_end;
10851 PL_multi_open = proto_perl->Imulti_open;
10852 PL_multi_close = proto_perl->Imulti_close;
10854 PL_error_count = proto_perl->Ierror_count;
10855 PL_subline = proto_perl->Isubline;
10856 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
10858 /* XXX See comment on SvANY(proto_perl->Ilinestr) above */
10859 if (SvANY(proto_perl->Ilinestr)) {
10860 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
10861 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10862 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
10863 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10864 PL_last_lop_op = proto_perl->Ilast_lop_op;
10867 PL_last_uni = SvPVX(PL_linestr);
10868 PL_last_lop = SvPVX(PL_linestr);
10869 PL_last_lop_op = 0;
10871 PL_in_my = proto_perl->Iin_my;
10872 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10874 PL_cryptseen = proto_perl->Icryptseen;
10877 PL_hints = proto_perl->Ihints;
10879 PL_amagic_generation = proto_perl->Iamagic_generation;
10881 #ifdef USE_LOCALE_COLLATE
10882 PL_collation_ix = proto_perl->Icollation_ix;
10883 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10884 PL_collation_standard = proto_perl->Icollation_standard;
10885 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10886 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10887 #endif /* USE_LOCALE_COLLATE */
10889 #ifdef USE_LOCALE_NUMERIC
10890 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10891 PL_numeric_standard = proto_perl->Inumeric_standard;
10892 PL_numeric_local = proto_perl->Inumeric_local;
10893 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10894 #endif /* !USE_LOCALE_NUMERIC */
10896 /* utf8 character classes */
10897 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10898 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10899 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10900 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10901 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10902 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10903 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10904 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10905 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10906 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10907 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10908 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10909 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10910 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10911 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10912 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10913 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10914 PL_utf8_tofold = sv_dup_inc(proto_perl->Iutf8_tofold, param);
10915 PL_utf8_idstart = sv_dup_inc(proto_perl->Iutf8_idstart, param);
10916 PL_utf8_idcont = sv_dup_inc(proto_perl->Iutf8_idcont, param);
10918 /* Did the locale setup indicate UTF-8? */
10919 PL_utf8locale = proto_perl->Iutf8locale;
10920 /* Unicode features (see perlrun/-C) */
10921 PL_unicode = proto_perl->Iunicode;
10923 /* Pre-5.8 signals control */
10924 PL_signals = proto_perl->Isignals;
10926 /* times() ticks per second */
10927 PL_clocktick = proto_perl->Iclocktick;
10929 /* Recursion stopper for PerlIO_find_layer */
10930 PL_in_load_module = proto_perl->Iin_load_module;
10932 /* sort() routine */
10933 PL_sort_RealCmp = proto_perl->Isort_RealCmp;
10935 /* Not really needed/useful since the reenrant_retint is "volatile",
10936 * but do it for consistency's sake. */
10937 PL_reentrant_retint = proto_perl->Ireentrant_retint;
10939 /* Hooks to shared SVs and locks. */
10940 PL_sharehook = proto_perl->Isharehook;
10941 PL_lockhook = proto_perl->Ilockhook;
10942 PL_unlockhook = proto_perl->Iunlockhook;
10943 PL_threadhook = proto_perl->Ithreadhook;
10945 PL_runops_std = proto_perl->Irunops_std;
10946 PL_runops_dbg = proto_perl->Irunops_dbg;
10948 #ifdef THREADS_HAVE_PIDS
10949 PL_ppid = proto_perl->Ippid;
10953 PL_last_swash_hv = Nullhv; /* reinits on demand */
10954 PL_last_swash_klen = 0;
10955 PL_last_swash_key[0]= '\0';
10956 PL_last_swash_tmps = (U8*)NULL;
10957 PL_last_swash_slen = 0;
10959 /* perly.c globals */
10960 PL_yydebug = proto_perl->Iyydebug;
10961 PL_yynerrs = proto_perl->Iyynerrs;
10962 PL_yyerrflag = proto_perl->Iyyerrflag;
10963 PL_yychar = proto_perl->Iyychar;
10964 PL_yyval = proto_perl->Iyyval;
10965 PL_yylval = proto_perl->Iyylval;
10967 PL_glob_index = proto_perl->Iglob_index;
10968 PL_srand_called = proto_perl->Isrand_called;
10969 PL_uudmap['M'] = 0; /* reinits on demand */
10970 PL_bitcount = Nullch; /* reinits on demand */
10972 if (proto_perl->Ipsig_pend) {
10973 Newz(0, PL_psig_pend, SIG_SIZE, int);
10976 PL_psig_pend = (int*)NULL;
10979 if (proto_perl->Ipsig_ptr) {
10980 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
10981 Newz(0, PL_psig_name, SIG_SIZE, SV*);
10982 for (i = 1; i < SIG_SIZE; i++) {
10983 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10984 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10988 PL_psig_ptr = (SV**)NULL;
10989 PL_psig_name = (SV**)NULL;
10992 /* thrdvar.h stuff */
10994 if (flags & CLONEf_COPY_STACKS) {
10995 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10996 PL_tmps_ix = proto_perl->Ttmps_ix;
10997 PL_tmps_max = proto_perl->Ttmps_max;
10998 PL_tmps_floor = proto_perl->Ttmps_floor;
10999 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
11001 while (i <= PL_tmps_ix) {
11002 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
11006 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
11007 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
11008 Newz(54, PL_markstack, i, I32);
11009 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
11010 - proto_perl->Tmarkstack);
11011 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
11012 - proto_perl->Tmarkstack);
11013 Copy(proto_perl->Tmarkstack, PL_markstack,
11014 PL_markstack_ptr - PL_markstack + 1, I32);
11016 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
11017 * NOTE: unlike the others! */
11018 PL_scopestack_ix = proto_perl->Tscopestack_ix;
11019 PL_scopestack_max = proto_perl->Tscopestack_max;
11020 Newz(54, PL_scopestack, PL_scopestack_max, I32);
11021 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
11023 /* next push_return() sets PL_retstack[PL_retstack_ix]
11024 * NOTE: unlike the others! */
11025 PL_retstack_ix = proto_perl->Tretstack_ix;
11026 PL_retstack_max = proto_perl->Tretstack_max;
11027 Newz(54, PL_retstack, PL_retstack_max, OP*);
11028 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, OP*);
11030 /* NOTE: si_dup() looks at PL_markstack */
11031 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
11033 /* PL_curstack = PL_curstackinfo->si_stack; */
11034 PL_curstack = av_dup(proto_perl->Tcurstack, param);
11035 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
11037 /* next PUSHs() etc. set *(PL_stack_sp+1) */
11038 PL_stack_base = AvARRAY(PL_curstack);
11039 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
11040 - proto_perl->Tstack_base);
11041 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
11043 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
11044 * NOTE: unlike the others! */
11045 PL_savestack_ix = proto_perl->Tsavestack_ix;
11046 PL_savestack_max = proto_perl->Tsavestack_max;
11047 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
11048 PL_savestack = ss_dup(proto_perl, param);
11052 ENTER; /* perl_destruct() wants to LEAVE; */
11055 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
11056 PL_top_env = &PL_start_env;
11058 PL_op = proto_perl->Top;
11061 PL_Xpv = (XPV*)NULL;
11062 PL_na = proto_perl->Tna;
11064 PL_statbuf = proto_perl->Tstatbuf;
11065 PL_statcache = proto_perl->Tstatcache;
11066 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
11067 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
11069 PL_timesbuf = proto_perl->Ttimesbuf;
11072 PL_tainted = proto_perl->Ttainted;
11073 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
11074 PL_rs = sv_dup_inc(proto_perl->Trs, param);
11075 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
11076 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
11077 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
11078 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
11079 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
11080 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
11081 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
11083 PL_restartop = proto_perl->Trestartop;
11084 PL_in_eval = proto_perl->Tin_eval;
11085 PL_delaymagic = proto_perl->Tdelaymagic;
11086 PL_dirty = proto_perl->Tdirty;
11087 PL_localizing = proto_perl->Tlocalizing;
11089 #ifdef PERL_FLEXIBLE_EXCEPTIONS
11090 PL_protect = proto_perl->Tprotect;
11092 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
11093 PL_hv_fetch_ent_mh = Nullhe;
11094 PL_modcount = proto_perl->Tmodcount;
11095 PL_lastgotoprobe = Nullop;
11096 PL_dumpindent = proto_perl->Tdumpindent;
11098 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
11099 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
11100 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
11101 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
11102 PL_sortcxix = proto_perl->Tsortcxix;
11103 PL_efloatbuf = Nullch; /* reinits on demand */
11104 PL_efloatsize = 0; /* reinits on demand */
11108 PL_screamfirst = NULL;
11109 PL_screamnext = NULL;
11110 PL_maxscream = -1; /* reinits on demand */
11111 PL_lastscream = Nullsv;
11113 PL_watchaddr = NULL;
11114 PL_watchok = Nullch;
11116 PL_regdummy = proto_perl->Tregdummy;
11117 PL_regcomp_parse = Nullch;
11118 PL_regxend = Nullch;
11119 PL_regcode = (regnode*)NULL;
11122 PL_regprecomp = Nullch;
11127 PL_seen_zerolen = 0;
11129 PL_regcomp_rx = (regexp*)NULL;
11131 PL_colorset = 0; /* reinits PL_colors[] */
11132 /*PL_colors[6] = {0,0,0,0,0,0};*/
11133 PL_reg_whilem_seen = 0;
11134 PL_reginput = Nullch;
11135 PL_regbol = Nullch;
11136 PL_regeol = Nullch;
11137 PL_regstartp = (I32*)NULL;
11138 PL_regendp = (I32*)NULL;
11139 PL_reglastparen = (U32*)NULL;
11140 PL_regtill = Nullch;
11141 PL_reg_start_tmp = (char**)NULL;
11142 PL_reg_start_tmpl = 0;
11143 PL_regdata = (struct reg_data*)NULL;
11146 PL_reg_eval_set = 0;
11148 PL_regprogram = (regnode*)NULL;
11150 PL_regcc = (CURCUR*)NULL;
11151 PL_reg_call_cc = (struct re_cc_state*)NULL;
11152 PL_reg_re = (regexp*)NULL;
11153 PL_reg_ganch = Nullch;
11154 PL_reg_sv = Nullsv;
11155 PL_reg_match_utf8 = FALSE;
11156 PL_reg_magic = (MAGIC*)NULL;
11158 PL_reg_oldcurpm = (PMOP*)NULL;
11159 PL_reg_curpm = (PMOP*)NULL;
11160 PL_reg_oldsaved = Nullch;
11161 PL_reg_oldsavedlen = 0;
11162 PL_reg_maxiter = 0;
11163 PL_reg_leftiter = 0;
11164 PL_reg_poscache = Nullch;
11165 PL_reg_poscache_size= 0;
11167 /* RE engine - function pointers */
11168 PL_regcompp = proto_perl->Tregcompp;
11169 PL_regexecp = proto_perl->Tregexecp;
11170 PL_regint_start = proto_perl->Tregint_start;
11171 PL_regint_string = proto_perl->Tregint_string;
11172 PL_regfree = proto_perl->Tregfree;
11174 PL_reginterp_cnt = 0;
11175 PL_reg_starttry = 0;
11177 /* Pluggable optimizer */
11178 PL_peepp = proto_perl->Tpeepp;
11180 PL_stashcache = newHV();
11182 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
11183 ptr_table_free(PL_ptr_table);
11184 PL_ptr_table = NULL;
11187 /* Call the ->CLONE method, if it exists, for each of the stashes
11188 identified by sv_dup() above.
11190 while(av_len(param->stashes) != -1) {
11191 HV* stash = (HV*) av_shift(param->stashes);
11192 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
11193 if (cloner && GvCV(cloner)) {
11198 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
11200 call_sv((SV*)GvCV(cloner), G_DISCARD);
11206 SvREFCNT_dec(param->stashes);
11211 #endif /* USE_ITHREADS */
11214 =head1 Unicode Support
11216 =for apidoc sv_recode_to_utf8
11218 The encoding is assumed to be an Encode object, on entry the PV
11219 of the sv is assumed to be octets in that encoding, and the sv
11220 will be converted into Unicode (and UTF-8).
11222 If the sv already is UTF-8 (or if it is not POK), or if the encoding
11223 is not a reference, nothing is done to the sv. If the encoding is not
11224 an C<Encode::XS> Encoding object, bad things will happen.
11225 (See F<lib/encoding.pm> and L<Encode>).
11227 The PV of the sv is returned.
11232 Perl_sv_recode_to_utf8(pTHX_ SV *sv, SV *encoding)
11234 if (SvPOK(sv) && !SvUTF8(sv) && !IN_BYTES && SvROK(encoding)) {
11248 Passing sv_yes is wrong - it needs to be or'ed set of constants
11249 for Encode::XS, while UTf-8 decode (currently) assumes a true value means
11250 remove converted chars from source.
11252 Both will default the value - let them.
11254 XPUSHs(&PL_sv_yes);
11257 call_method("decode", G_SCALAR);
11261 s = SvPV(uni, len);
11262 if (s != SvPVX(sv)) {
11263 SvGROW(sv, len + 1);
11264 Move(s, SvPVX(sv), len, char);
11265 SvCUR_set(sv, len);
11266 SvPVX(sv)[len] = 0;
11276 =for apidoc sv_cat_decode
11278 The encoding is assumed to be an Encode object, the PV of the ssv is
11279 assumed to be octets in that encoding and decoding the input starts
11280 from the position which (PV + *offset) pointed to. The dsv will be
11281 concatenated the decoded UTF-8 string from ssv. Decoding will terminate
11282 when the string tstr appears in decoding output or the input ends on
11283 the PV of the ssv. The value which the offset points will be modified
11284 to the last input position on the ssv.
11286 Returns TRUE if the terminator was found, else returns FALSE.
11291 Perl_sv_cat_decode(pTHX_ SV *dsv, SV *encoding,
11292 SV *ssv, int *offset, char *tstr, int tlen)
11295 if (SvPOK(ssv) && SvPOK(dsv) && SvROK(encoding) && offset) {
11306 XPUSHs(offsv = sv_2mortal(newSViv(*offset)));
11307 XPUSHs(sv_2mortal(newSVpvn(tstr, tlen)));
11309 call_method("cat_decode", G_SCALAR);
11311 ret = SvTRUE(TOPs);
11312 *offset = SvIV(offsv);
11318 Perl_croak(aTHX_ "Invalid argument to sv_cat_decode");