3 * Copyright (c) 1991-2001, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
8 * "I wonder what the Entish is for 'yes' and 'no'," he thought.
11 * This file contains the code that creates, manipulates and destroys
12 * scalar values (SVs). The other types (AV, HV, GV, etc.) reuse the
13 * structure of an SV, so their creation and destruction is handled
14 * here; higher-level functions are in av.c, hv.c, and so on. Opcode
15 * level functions (eg. substr, split, join) for each of the types are
25 #define SV_CHECK_THINKFIRST(sv) if (SvTHINKFIRST(sv)) sv_force_normal(sv)
28 /* ============================================================================
30 =head1 Allocation and deallocation of SVs.
32 An SV (or AV, HV, etc.) is allocated in two parts: the head (struct sv,
33 av, hv...) contains type and reference count information, as well as a
34 pointer to the body (struct xrv, xpv, xpviv...), which contains fields
35 specific to each type.
37 Normally, this allocation is done using arenas, which are approximately
38 1K chunks of memory parcelled up into N heads or bodies. The first slot
39 in each arena is reserved, and is used to hold a link to the next arena.
40 In the case of heads, the unused first slot also contains some flags and
41 a note of the number of slots. Snaked through each arena chain is a
42 linked list of free items; when this becomes empty, an extra arena is
43 allocated and divided up into N items which are threaded into the free
46 The following global variables are associated with arenas:
48 PL_sv_arenaroot pointer to list of SV arenas
49 PL_sv_root pointer to list of free SV structures
51 PL_foo_arenaroot pointer to list of foo arenas,
52 PL_foo_root pointer to list of free foo bodies
53 ... for foo in xiv, xnv, xrv, xpv etc.
55 Note that some of the larger and more rarely used body types (eg xpvio)
56 are not allocated using arenas, but are instead just malloc()/free()ed as
57 required. Also, if PURIFY is defined, arenas are abandoned altogether,
58 with all items individually malloc()ed. In addition, a few SV heads are
59 not allocated from an arena, but are instead directly created as static
60 or auto variables, eg PL_sv_undef.
62 The SV arena serves the secondary purpose of allowing still-live SVs
63 to be located and destroyed during final cleanup.
65 At the lowest level, the macros new_SV() and del_SV() grab and free
66 an SV head. (If debugging with -DD, del_SV() calls the function S_del_sv()
67 to return the SV to the free list with error checking.) new_SV() calls
68 more_sv() / sv_add_arena() to add an extra arena if the free list is empty.
69 SVs in the free list have their SvTYPE field set to all ones.
71 Similarly, there are macros new_XIV()/del_XIV(), new_XNV()/del_XNV() etc
72 that allocate and return individual body types. Normally these are mapped
73 to the arena-manipulating functions new_xiv()/del_xiv() etc, but may be
74 instead mapped directly to malloc()/free() if PURIFY is defined. The
75 new/del functions remove from, or add to, the appropriate PL_foo_root
76 list, and call more_xiv() etc to add a new arena if the list is empty.
78 At the time of very final cleanup, sv_free_arenas() is called from
79 perl_destruct() to physically free all the arenas allocated since the
80 start of the interpreter. Note that this also clears PL_he_arenaroot,
81 which is otherwise dealt with in hv.c.
83 Manipulation of any of the PL_*root pointers is protected by enclosing
84 LOCK_SV_MUTEX; ... UNLOCK_SV_MUTEX calls which should Do the Right Thing
85 if threads are enabled.
87 The function visit() scans the SV arenas list, and calls a specified
88 function for each SV it finds which is still live - ie which has an SvTYPE
89 other than all 1's, and a non-zero SvREFCNT. visit() is used by the
90 following functions (specified as [function that calls visit()] / [function
91 called by visit() for each SV]):
93 sv_report_used() / do_report_used()
94 dump all remaining SVs (debugging aid)
96 sv_clean_objs() / do_clean_objs(),do_clean_named_objs()
97 Attempt to free all objects pointed to by RVs,
98 and, unless DISABLE_DESTRUCTOR_KLUDGE is defined,
99 try to do the same for all objects indirectly
100 referenced by typeglobs too. Called once from
101 perl_destruct(), prior to calling sv_clean_all()
104 sv_clean_all() / do_clean_all()
105 SvREFCNT_dec(sv) each remaining SV, possibly
106 triggering an sv_free(). It also sets the
107 SVf_BREAK flag on the SV to indicate that the
108 refcnt has been artificially lowered, and thus
109 stopping sv_free() from giving spurious warnings
110 about SVs which unexpectedly have a refcnt
111 of zero. called repeatedly from perl_destruct()
112 until there are no SVs left.
116 Private API to rest of sv.c
120 new_XIV(), del_XIV(),
121 new_XNV(), del_XNV(),
126 sv_report_used(), sv_clean_objs(), sv_clean_all(), sv_free_arenas()
131 ============================================================================ */
136 * "A time to plant, and a time to uproot what was planted..."
139 #define plant_SV(p) \
141 SvANY(p) = (void *)PL_sv_root; \
142 SvFLAGS(p) = SVTYPEMASK; \
147 /* sv_mutex must be held while calling uproot_SV() */
148 #define uproot_SV(p) \
151 PL_sv_root = (SV*)SvANY(p); \
156 /* new_SV(): return a new, empty SV head */
172 /* del_SV(): return an empty SV head to the free list */
187 S_del_sv(pTHX_ SV *p)
194 for (sva = PL_sv_arenaroot; sva; sva = (SV *) SvANY(sva)) {
196 svend = &sva[SvREFCNT(sva)];
197 if (p >= sv && p < svend)
201 if (ckWARN_d(WARN_INTERNAL))
202 Perl_warner(aTHX_ WARN_INTERNAL,
203 "Attempt to free non-arena SV: 0x%"UVxf,
211 #else /* ! DEBUGGING */
213 #define del_SV(p) plant_SV(p)
215 #endif /* DEBUGGING */
219 =for apidoc sv_add_arena
221 Given a chunk of memory, link it to the head of the list of arenas,
222 and split it into a list of free SVs.
228 Perl_sv_add_arena(pTHX_ char *ptr, U32 size, U32 flags)
233 Zero(ptr, size, char);
235 /* The first SV in an arena isn't an SV. */
236 SvANY(sva) = (void *) PL_sv_arenaroot; /* ptr to next arena */
237 SvREFCNT(sva) = size / sizeof(SV); /* number of SV slots */
238 SvFLAGS(sva) = flags; /* FAKE if not to be freed */
240 PL_sv_arenaroot = sva;
241 PL_sv_root = sva + 1;
243 svend = &sva[SvREFCNT(sva) - 1];
246 SvANY(sv) = (void *)(SV*)(sv + 1);
247 SvFLAGS(sv) = SVTYPEMASK;
251 SvFLAGS(sv) = SVTYPEMASK;
254 /* make some more SVs by adding another arena */
256 /* sv_mutex must be held while calling more_sv() */
263 sv_add_arena(PL_nice_chunk, PL_nice_chunk_size, 0);
264 PL_nice_chunk = Nullch;
265 PL_nice_chunk_size = 0;
268 char *chunk; /* must use New here to match call to */
269 New(704,chunk,1008,char); /* Safefree() in sv_free_arenas() */
270 sv_add_arena(chunk, 1008, 0);
276 /* visit(): call the named function for each non-free SV in the arenas. */
279 S_visit(pTHX_ SVFUNC_t f)
286 for (sva = PL_sv_arenaroot; sva; sva = (SV*)SvANY(sva)) {
287 svend = &sva[SvREFCNT(sva)];
288 for (sv = sva + 1; sv < svend; ++sv) {
289 if (SvTYPE(sv) != SVTYPEMASK && SvREFCNT(sv)) {
298 /* called by sv_report_used() for each live SV */
301 do_report_used(pTHXo_ SV *sv)
303 if (SvTYPE(sv) != SVTYPEMASK) {
304 PerlIO_printf(Perl_debug_log, "****\n");
310 =for apidoc sv_report_used
312 Dump the contents of all SVs not yet freed. (Debugging aid).
318 Perl_sv_report_used(pTHX)
320 visit(do_report_used);
323 /* called by sv_clean_objs() for each live SV */
326 do_clean_objs(pTHXo_ SV *sv)
330 if (SvROK(sv) && SvOBJECT(rv = SvRV(sv))) {
331 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning object ref:\n "), sv_dump(sv)));
343 /* XXX Might want to check arrays, etc. */
346 /* called by sv_clean_objs() for each live SV */
348 #ifndef DISABLE_DESTRUCTOR_KLUDGE
350 do_clean_named_objs(pTHXo_ SV *sv)
352 if (SvTYPE(sv) == SVt_PVGV && GvGP(sv)) {
353 if ( SvOBJECT(GvSV(sv)) ||
354 (GvAV(sv) && SvOBJECT(GvAV(sv))) ||
355 (GvHV(sv) && SvOBJECT(GvHV(sv))) ||
356 (GvIO(sv) && SvOBJECT(GvIO(sv))) ||
357 (GvCV(sv) && SvOBJECT(GvCV(sv))) )
359 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning named glob object:\n "), sv_dump(sv)));
367 =for apidoc sv_clean_objs
369 Attempt to destroy all objects not yet freed
375 Perl_sv_clean_objs(pTHX)
377 PL_in_clean_objs = TRUE;
378 visit(do_clean_objs);
379 #ifndef DISABLE_DESTRUCTOR_KLUDGE
380 /* some barnacles may yet remain, clinging to typeglobs */
381 visit(do_clean_named_objs);
383 PL_in_clean_objs = FALSE;
386 /* called by sv_clean_all() for each live SV */
389 do_clean_all(pTHXo_ SV *sv)
391 DEBUG_D((PerlIO_printf(Perl_debug_log, "Cleaning loops: SV at 0x%"UVxf"\n", PTR2UV(sv)) ));
392 SvFLAGS(sv) |= SVf_BREAK;
397 =for apidoc sv_clean_all
399 Decrement the refcnt of each remaining SV, possibly triggering a
400 cleanup. This function may have to be called multiple times to free
401 SVs which are in complex self-referential hierarchies.
407 Perl_sv_clean_all(pTHX)
410 PL_in_clean_all = TRUE;
411 cleaned = visit(do_clean_all);
412 PL_in_clean_all = FALSE;
417 =for apidoc sv_free_arenas
419 Deallocate the memory used by all arenas. Note that all the individual SV
420 heads and bodies within the arenas must already have been freed.
426 Perl_sv_free_arenas(pTHX)
430 XPV *arena, *arenanext;
432 /* Free arenas here, but be careful about fake ones. (We assume
433 contiguity of the fake ones with the corresponding real ones.) */
435 for (sva = PL_sv_arenaroot; sva; sva = svanext) {
436 svanext = (SV*) SvANY(sva);
437 while (svanext && SvFAKE(svanext))
438 svanext = (SV*) SvANY(svanext);
441 Safefree((void *)sva);
444 for (arena = PL_xiv_arenaroot; arena; arena = arenanext) {
445 arenanext = (XPV*)arena->xpv_pv;
448 PL_xiv_arenaroot = 0;
450 for (arena = PL_xnv_arenaroot; arena; arena = arenanext) {
451 arenanext = (XPV*)arena->xpv_pv;
454 PL_xnv_arenaroot = 0;
456 for (arena = PL_xrv_arenaroot; arena; arena = arenanext) {
457 arenanext = (XPV*)arena->xpv_pv;
460 PL_xrv_arenaroot = 0;
462 for (arena = PL_xpv_arenaroot; arena; arena = arenanext) {
463 arenanext = (XPV*)arena->xpv_pv;
466 PL_xpv_arenaroot = 0;
468 for (arena = (XPV*)PL_xpviv_arenaroot; arena; arena = arenanext) {
469 arenanext = (XPV*)arena->xpv_pv;
472 PL_xpviv_arenaroot = 0;
474 for (arena = (XPV*)PL_xpvnv_arenaroot; arena; arena = arenanext) {
475 arenanext = (XPV*)arena->xpv_pv;
478 PL_xpvnv_arenaroot = 0;
480 for (arena = (XPV*)PL_xpvcv_arenaroot; arena; arena = arenanext) {
481 arenanext = (XPV*)arena->xpv_pv;
484 PL_xpvcv_arenaroot = 0;
486 for (arena = (XPV*)PL_xpvav_arenaroot; arena; arena = arenanext) {
487 arenanext = (XPV*)arena->xpv_pv;
490 PL_xpvav_arenaroot = 0;
492 for (arena = (XPV*)PL_xpvhv_arenaroot; arena; arena = arenanext) {
493 arenanext = (XPV*)arena->xpv_pv;
496 PL_xpvhv_arenaroot = 0;
498 for (arena = (XPV*)PL_xpvmg_arenaroot; arena; arena = arenanext) {
499 arenanext = (XPV*)arena->xpv_pv;
502 PL_xpvmg_arenaroot = 0;
504 for (arena = (XPV*)PL_xpvlv_arenaroot; arena; arena = arenanext) {
505 arenanext = (XPV*)arena->xpv_pv;
508 PL_xpvlv_arenaroot = 0;
510 for (arena = (XPV*)PL_xpvbm_arenaroot; arena; arena = arenanext) {
511 arenanext = (XPV*)arena->xpv_pv;
514 PL_xpvbm_arenaroot = 0;
516 for (arena = (XPV*)PL_he_arenaroot; arena; arena = arenanext) {
517 arenanext = (XPV*)arena->xpv_pv;
523 Safefree(PL_nice_chunk);
524 PL_nice_chunk = Nullch;
525 PL_nice_chunk_size = 0;
531 =for apidoc report_uninit
533 Print appropriate "Use of uninitialized variable" warning
539 Perl_report_uninit(pTHX)
542 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit,
543 " in ", PL_op_desc[PL_op->op_type]);
545 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit, "", "");
548 /* grab a new IV body from the free list, allocating more if necessary */
559 * See comment in more_xiv() -- RAM.
561 PL_xiv_root = *(IV**)xiv;
563 return (XPVIV*)((char*)xiv - STRUCT_OFFSET(XPVIV, xiv_iv));
566 /* return an IV body to the free list */
569 S_del_xiv(pTHX_ XPVIV *p)
571 IV* xiv = (IV*)((char*)(p) + STRUCT_OFFSET(XPVIV, xiv_iv));
573 *(IV**)xiv = PL_xiv_root;
578 /* allocate another arena's worth of IV bodies */
586 New(705, ptr, 1008/sizeof(XPV), XPV);
587 ptr->xpv_pv = (char*)PL_xiv_arenaroot; /* linked list of xiv arenas */
588 PL_xiv_arenaroot = ptr; /* to keep Purify happy */
591 xivend = &xiv[1008 / sizeof(IV) - 1];
592 xiv += (sizeof(XPV) - 1) / sizeof(IV) + 1; /* fudge by size of XPV */
594 while (xiv < xivend) {
595 *(IV**)xiv = (IV *)(xiv + 1);
601 /* grab a new NV body from the free list, allocating more if necessary */
611 PL_xnv_root = *(NV**)xnv;
613 return (XPVNV*)((char*)xnv - STRUCT_OFFSET(XPVNV, xnv_nv));
616 /* return an NV body to the free list */
619 S_del_xnv(pTHX_ XPVNV *p)
621 NV* xnv = (NV*)((char*)(p) + STRUCT_OFFSET(XPVNV, xnv_nv));
623 *(NV**)xnv = PL_xnv_root;
628 /* allocate another arena's worth of NV bodies */
636 New(711, ptr, 1008/sizeof(XPV), XPV);
637 ptr->xpv_pv = (char*)PL_xnv_arenaroot;
638 PL_xnv_arenaroot = ptr;
641 xnvend = &xnv[1008 / sizeof(NV) - 1];
642 xnv += (sizeof(XPVIV) - 1) / sizeof(NV) + 1; /* fudge by sizeof XPVIV */
644 while (xnv < xnvend) {
645 *(NV**)xnv = (NV*)(xnv + 1);
651 /* grab a new struct xrv from the free list, allocating more if necessary */
661 PL_xrv_root = (XRV*)xrv->xrv_rv;
666 /* return a struct xrv to the free list */
669 S_del_xrv(pTHX_ XRV *p)
672 p->xrv_rv = (SV*)PL_xrv_root;
677 /* allocate another arena's worth of struct xrv */
683 register XRV* xrvend;
685 New(712, ptr, 1008/sizeof(XPV), XPV);
686 ptr->xpv_pv = (char*)PL_xrv_arenaroot;
687 PL_xrv_arenaroot = ptr;
690 xrvend = &xrv[1008 / sizeof(XRV) - 1];
691 xrv += (sizeof(XPV) - 1) / sizeof(XRV) + 1;
693 while (xrv < xrvend) {
694 xrv->xrv_rv = (SV*)(xrv + 1);
700 /* grab a new struct xpv from the free list, allocating more if necessary */
710 PL_xpv_root = (XPV*)xpv->xpv_pv;
715 /* return a struct xpv to the free list */
718 S_del_xpv(pTHX_ XPV *p)
721 p->xpv_pv = (char*)PL_xpv_root;
726 /* allocate another arena's worth of struct xpv */
732 register XPV* xpvend;
733 New(713, xpv, 1008/sizeof(XPV), XPV);
734 xpv->xpv_pv = (char*)PL_xpv_arenaroot;
735 PL_xpv_arenaroot = xpv;
737 xpvend = &xpv[1008 / sizeof(XPV) - 1];
739 while (xpv < xpvend) {
740 xpv->xpv_pv = (char*)(xpv + 1);
746 /* grab a new struct xpviv from the free list, allocating more if necessary */
755 xpviv = PL_xpviv_root;
756 PL_xpviv_root = (XPVIV*)xpviv->xpv_pv;
761 /* return a struct xpviv to the free list */
764 S_del_xpviv(pTHX_ XPVIV *p)
767 p->xpv_pv = (char*)PL_xpviv_root;
772 /* allocate another arena's worth of struct xpviv */
777 register XPVIV* xpviv;
778 register XPVIV* xpvivend;
779 New(714, xpviv, 1008/sizeof(XPVIV), XPVIV);
780 xpviv->xpv_pv = (char*)PL_xpviv_arenaroot;
781 PL_xpviv_arenaroot = xpviv;
783 xpvivend = &xpviv[1008 / sizeof(XPVIV) - 1];
784 PL_xpviv_root = ++xpviv;
785 while (xpviv < xpvivend) {
786 xpviv->xpv_pv = (char*)(xpviv + 1);
792 /* grab a new struct xpvnv from the free list, allocating more if necessary */
801 xpvnv = PL_xpvnv_root;
802 PL_xpvnv_root = (XPVNV*)xpvnv->xpv_pv;
807 /* return a struct xpvnv to the free list */
810 S_del_xpvnv(pTHX_ XPVNV *p)
813 p->xpv_pv = (char*)PL_xpvnv_root;
818 /* allocate another arena's worth of struct xpvnv */
823 register XPVNV* xpvnv;
824 register XPVNV* xpvnvend;
825 New(715, xpvnv, 1008/sizeof(XPVNV), XPVNV);
826 xpvnv->xpv_pv = (char*)PL_xpvnv_arenaroot;
827 PL_xpvnv_arenaroot = xpvnv;
829 xpvnvend = &xpvnv[1008 / sizeof(XPVNV) - 1];
830 PL_xpvnv_root = ++xpvnv;
831 while (xpvnv < xpvnvend) {
832 xpvnv->xpv_pv = (char*)(xpvnv + 1);
838 /* grab a new struct xpvcv from the free list, allocating more if necessary */
847 xpvcv = PL_xpvcv_root;
848 PL_xpvcv_root = (XPVCV*)xpvcv->xpv_pv;
853 /* return a struct xpvcv to the free list */
856 S_del_xpvcv(pTHX_ XPVCV *p)
859 p->xpv_pv = (char*)PL_xpvcv_root;
864 /* allocate another arena's worth of struct xpvcv */
869 register XPVCV* xpvcv;
870 register XPVCV* xpvcvend;
871 New(716, xpvcv, 1008/sizeof(XPVCV), XPVCV);
872 xpvcv->xpv_pv = (char*)PL_xpvcv_arenaroot;
873 PL_xpvcv_arenaroot = xpvcv;
875 xpvcvend = &xpvcv[1008 / sizeof(XPVCV) - 1];
876 PL_xpvcv_root = ++xpvcv;
877 while (xpvcv < xpvcvend) {
878 xpvcv->xpv_pv = (char*)(xpvcv + 1);
884 /* grab a new struct xpvav from the free list, allocating more if necessary */
893 xpvav = PL_xpvav_root;
894 PL_xpvav_root = (XPVAV*)xpvav->xav_array;
899 /* return a struct xpvav to the free list */
902 S_del_xpvav(pTHX_ XPVAV *p)
905 p->xav_array = (char*)PL_xpvav_root;
910 /* allocate another arena's worth of struct xpvav */
915 register XPVAV* xpvav;
916 register XPVAV* xpvavend;
917 New(717, xpvav, 1008/sizeof(XPVAV), XPVAV);
918 xpvav->xav_array = (char*)PL_xpvav_arenaroot;
919 PL_xpvav_arenaroot = xpvav;
921 xpvavend = &xpvav[1008 / sizeof(XPVAV) - 1];
922 PL_xpvav_root = ++xpvav;
923 while (xpvav < xpvavend) {
924 xpvav->xav_array = (char*)(xpvav + 1);
927 xpvav->xav_array = 0;
930 /* grab a new struct xpvhv from the free list, allocating more if necessary */
939 xpvhv = PL_xpvhv_root;
940 PL_xpvhv_root = (XPVHV*)xpvhv->xhv_array;
945 /* return a struct xpvhv to the free list */
948 S_del_xpvhv(pTHX_ XPVHV *p)
951 p->xhv_array = (char*)PL_xpvhv_root;
956 /* allocate another arena's worth of struct xpvhv */
961 register XPVHV* xpvhv;
962 register XPVHV* xpvhvend;
963 New(718, xpvhv, 1008/sizeof(XPVHV), XPVHV);
964 xpvhv->xhv_array = (char*)PL_xpvhv_arenaroot;
965 PL_xpvhv_arenaroot = xpvhv;
967 xpvhvend = &xpvhv[1008 / sizeof(XPVHV) - 1];
968 PL_xpvhv_root = ++xpvhv;
969 while (xpvhv < xpvhvend) {
970 xpvhv->xhv_array = (char*)(xpvhv + 1);
973 xpvhv->xhv_array = 0;
976 /* grab a new struct xpvmg from the free list, allocating more if necessary */
985 xpvmg = PL_xpvmg_root;
986 PL_xpvmg_root = (XPVMG*)xpvmg->xpv_pv;
991 /* return a struct xpvmg to the free list */
994 S_del_xpvmg(pTHX_ XPVMG *p)
997 p->xpv_pv = (char*)PL_xpvmg_root;
1002 /* allocate another arena's worth of struct xpvmg */
1007 register XPVMG* xpvmg;
1008 register XPVMG* xpvmgend;
1009 New(719, xpvmg, 1008/sizeof(XPVMG), XPVMG);
1010 xpvmg->xpv_pv = (char*)PL_xpvmg_arenaroot;
1011 PL_xpvmg_arenaroot = xpvmg;
1013 xpvmgend = &xpvmg[1008 / sizeof(XPVMG) - 1];
1014 PL_xpvmg_root = ++xpvmg;
1015 while (xpvmg < xpvmgend) {
1016 xpvmg->xpv_pv = (char*)(xpvmg + 1);
1022 /* grab a new struct xpvlv from the free list, allocating more if necessary */
1031 xpvlv = PL_xpvlv_root;
1032 PL_xpvlv_root = (XPVLV*)xpvlv->xpv_pv;
1037 /* return a struct xpvlv to the free list */
1040 S_del_xpvlv(pTHX_ XPVLV *p)
1043 p->xpv_pv = (char*)PL_xpvlv_root;
1048 /* allocate another arena's worth of struct xpvlv */
1053 register XPVLV* xpvlv;
1054 register XPVLV* xpvlvend;
1055 New(720, xpvlv, 1008/sizeof(XPVLV), XPVLV);
1056 xpvlv->xpv_pv = (char*)PL_xpvlv_arenaroot;
1057 PL_xpvlv_arenaroot = xpvlv;
1059 xpvlvend = &xpvlv[1008 / sizeof(XPVLV) - 1];
1060 PL_xpvlv_root = ++xpvlv;
1061 while (xpvlv < xpvlvend) {
1062 xpvlv->xpv_pv = (char*)(xpvlv + 1);
1068 /* grab a new struct xpvbm from the free list, allocating more if necessary */
1077 xpvbm = PL_xpvbm_root;
1078 PL_xpvbm_root = (XPVBM*)xpvbm->xpv_pv;
1083 /* return a struct xpvbm to the free list */
1086 S_del_xpvbm(pTHX_ XPVBM *p)
1089 p->xpv_pv = (char*)PL_xpvbm_root;
1094 /* allocate another arena's worth of struct xpvbm */
1099 register XPVBM* xpvbm;
1100 register XPVBM* xpvbmend;
1101 New(721, xpvbm, 1008/sizeof(XPVBM), XPVBM);
1102 xpvbm->xpv_pv = (char*)PL_xpvbm_arenaroot;
1103 PL_xpvbm_arenaroot = xpvbm;
1105 xpvbmend = &xpvbm[1008 / sizeof(XPVBM) - 1];
1106 PL_xpvbm_root = ++xpvbm;
1107 while (xpvbm < xpvbmend) {
1108 xpvbm->xpv_pv = (char*)(xpvbm + 1);
1115 # define my_safemalloc(s) (void*)safexmalloc(717,s)
1116 # define my_safefree(p) safexfree((char*)p)
1118 # define my_safemalloc(s) (void*)safemalloc(s)
1119 # define my_safefree(p) safefree((char*)p)
1124 #define new_XIV() my_safemalloc(sizeof(XPVIV))
1125 #define del_XIV(p) my_safefree(p)
1127 #define new_XNV() my_safemalloc(sizeof(XPVNV))
1128 #define del_XNV(p) my_safefree(p)
1130 #define new_XRV() my_safemalloc(sizeof(XRV))
1131 #define del_XRV(p) my_safefree(p)
1133 #define new_XPV() my_safemalloc(sizeof(XPV))
1134 #define del_XPV(p) my_safefree(p)
1136 #define new_XPVIV() my_safemalloc(sizeof(XPVIV))
1137 #define del_XPVIV(p) my_safefree(p)
1139 #define new_XPVNV() my_safemalloc(sizeof(XPVNV))
1140 #define del_XPVNV(p) my_safefree(p)
1142 #define new_XPVCV() my_safemalloc(sizeof(XPVCV))
1143 #define del_XPVCV(p) my_safefree(p)
1145 #define new_XPVAV() my_safemalloc(sizeof(XPVAV))
1146 #define del_XPVAV(p) my_safefree(p)
1148 #define new_XPVHV() my_safemalloc(sizeof(XPVHV))
1149 #define del_XPVHV(p) my_safefree(p)
1151 #define new_XPVMG() my_safemalloc(sizeof(XPVMG))
1152 #define del_XPVMG(p) my_safefree(p)
1154 #define new_XPVLV() my_safemalloc(sizeof(XPVLV))
1155 #define del_XPVLV(p) my_safefree(p)
1157 #define new_XPVBM() my_safemalloc(sizeof(XPVBM))
1158 #define del_XPVBM(p) my_safefree(p)
1162 #define new_XIV() (void*)new_xiv()
1163 #define del_XIV(p) del_xiv((XPVIV*) p)
1165 #define new_XNV() (void*)new_xnv()
1166 #define del_XNV(p) del_xnv((XPVNV*) p)
1168 #define new_XRV() (void*)new_xrv()
1169 #define del_XRV(p) del_xrv((XRV*) p)
1171 #define new_XPV() (void*)new_xpv()
1172 #define del_XPV(p) del_xpv((XPV *)p)
1174 #define new_XPVIV() (void*)new_xpviv()
1175 #define del_XPVIV(p) del_xpviv((XPVIV *)p)
1177 #define new_XPVNV() (void*)new_xpvnv()
1178 #define del_XPVNV(p) del_xpvnv((XPVNV *)p)
1180 #define new_XPVCV() (void*)new_xpvcv()
1181 #define del_XPVCV(p) del_xpvcv((XPVCV *)p)
1183 #define new_XPVAV() (void*)new_xpvav()
1184 #define del_XPVAV(p) del_xpvav((XPVAV *)p)
1186 #define new_XPVHV() (void*)new_xpvhv()
1187 #define del_XPVHV(p) del_xpvhv((XPVHV *)p)
1189 #define new_XPVMG() (void*)new_xpvmg()
1190 #define del_XPVMG(p) del_xpvmg((XPVMG *)p)
1192 #define new_XPVLV() (void*)new_xpvlv()
1193 #define del_XPVLV(p) del_xpvlv((XPVLV *)p)
1195 #define new_XPVBM() (void*)new_xpvbm()
1196 #define del_XPVBM(p) del_xpvbm((XPVBM *)p)
1200 #define new_XPVGV() my_safemalloc(sizeof(XPVGV))
1201 #define del_XPVGV(p) my_safefree(p)
1203 #define new_XPVFM() my_safemalloc(sizeof(XPVFM))
1204 #define del_XPVFM(p) my_safefree(p)
1206 #define new_XPVIO() my_safemalloc(sizeof(XPVIO))
1207 #define del_XPVIO(p) my_safefree(p)
1210 =for apidoc sv_upgrade
1212 Upgrade an SV to a more complex form. Generally adds a new body type to the
1213 SV, then copies across as much information as possible from the old body.
1214 You generally want to use the C<SvUPGRADE> macro wrapper. See also C<svtype>.
1220 Perl_sv_upgrade(pTHX_ register SV *sv, U32 mt)
1230 if (mt != SVt_PV && SvREADONLY(sv) && SvFAKE(sv)) {
1231 sv_force_normal(sv);
1234 if (SvTYPE(sv) == mt)
1238 (void)SvOOK_off(sv);
1240 switch (SvTYPE(sv)) {
1261 else if (mt < SVt_PVIV)
1278 pv = (char*)SvRV(sv);
1298 else if (mt == SVt_NV)
1309 del_XPVIV(SvANY(sv));
1319 del_XPVNV(SvANY(sv));
1327 magic = SvMAGIC(sv);
1328 stash = SvSTASH(sv);
1329 del_XPVMG(SvANY(sv));
1332 Perl_croak(aTHX_ "Can't upgrade that kind of scalar");
1337 Perl_croak(aTHX_ "Can't upgrade to undef");
1339 SvANY(sv) = new_XIV();
1343 SvANY(sv) = new_XNV();
1347 SvANY(sv) = new_XRV();
1351 SvANY(sv) = new_XPV();
1357 SvANY(sv) = new_XPVIV();
1367 SvANY(sv) = new_XPVNV();
1375 SvANY(sv) = new_XPVMG();
1381 SvMAGIC(sv) = magic;
1382 SvSTASH(sv) = stash;
1385 SvANY(sv) = new_XPVLV();
1391 SvMAGIC(sv) = magic;
1392 SvSTASH(sv) = stash;
1399 SvANY(sv) = new_XPVAV();
1407 SvMAGIC(sv) = magic;
1408 SvSTASH(sv) = stash;
1414 SvANY(sv) = new_XPVHV();
1422 SvMAGIC(sv) = magic;
1423 SvSTASH(sv) = stash;
1430 SvANY(sv) = new_XPVCV();
1431 Zero(SvANY(sv), 1, XPVCV);
1437 SvMAGIC(sv) = magic;
1438 SvSTASH(sv) = stash;
1441 SvANY(sv) = new_XPVGV();
1447 SvMAGIC(sv) = magic;
1448 SvSTASH(sv) = stash;
1456 SvANY(sv) = new_XPVBM();
1462 SvMAGIC(sv) = magic;
1463 SvSTASH(sv) = stash;
1469 SvANY(sv) = new_XPVFM();
1470 Zero(SvANY(sv), 1, XPVFM);
1476 SvMAGIC(sv) = magic;
1477 SvSTASH(sv) = stash;
1480 SvANY(sv) = new_XPVIO();
1481 Zero(SvANY(sv), 1, XPVIO);
1487 SvMAGIC(sv) = magic;
1488 SvSTASH(sv) = stash;
1489 IoPAGE_LEN(sv) = 60;
1492 SvFLAGS(sv) &= ~SVTYPEMASK;
1498 =for apidoc sv_backoff
1500 Remove any string offset. You should normally use the C<SvOOK_off> macro
1507 Perl_sv_backoff(pTHX_ register SV *sv)
1511 char *s = SvPVX(sv);
1512 SvLEN(sv) += SvIVX(sv);
1513 SvPVX(sv) -= SvIVX(sv);
1515 Move(s, SvPVX(sv), SvCUR(sv)+1, char);
1517 SvFLAGS(sv) &= ~SVf_OOK;
1524 Expands the character buffer in the SV. If necessary, uses C<sv_unref> and
1525 upgrades the SV to C<SVt_PV>. Returns a pointer to the character buffer.
1526 Use the C<SvGROW> wrapper instead.
1532 Perl_sv_grow(pTHX_ register SV *sv, register STRLEN newlen)
1536 #ifdef HAS_64K_LIMIT
1537 if (newlen >= 0x10000) {
1538 PerlIO_printf(Perl_debug_log,
1539 "Allocation too large: %"UVxf"\n", (UV)newlen);
1542 #endif /* HAS_64K_LIMIT */
1545 if (SvTYPE(sv) < SVt_PV) {
1546 sv_upgrade(sv, SVt_PV);
1549 else if (SvOOK(sv)) { /* pv is offset? */
1552 if (newlen > SvLEN(sv))
1553 newlen += 10 * (newlen - SvCUR(sv)); /* avoid copy each time */
1554 #ifdef HAS_64K_LIMIT
1555 if (newlen >= 0x10000)
1561 if (newlen > SvLEN(sv)) { /* need more room? */
1562 if (SvLEN(sv) && s) {
1563 #if defined(MYMALLOC) && !defined(LEAKTEST)
1564 STRLEN l = malloced_size((void*)SvPVX(sv));
1570 Renew(s,newlen,char);
1573 /* If we're growing a newSVpvn_share()d SV, we must unshare
1574 the PVX by hand, since sv_force_normal_flags() will try
1575 to grow the SV. AMS 20010713 */
1576 if (SvREADONLY(sv) && SvFAKE(sv)) {
1577 STRLEN len = SvCUR(sv);
1580 unsharepvn(SvPVX(sv), SvUTF8(sv) ? -(I32)len : len, SvUVX(sv));
1582 New(703, s, newlen, char);
1585 SvLEN_set(sv, newlen);
1591 =for apidoc sv_setiv
1593 Copies an integer into the given SV, upgrading first if necessary.
1594 Does not handle 'set' magic. See also C<sv_setiv_mg>.
1600 Perl_sv_setiv(pTHX_ register SV *sv, IV i)
1602 SV_CHECK_THINKFIRST(sv);
1603 switch (SvTYPE(sv)) {
1605 sv_upgrade(sv, SVt_IV);
1608 sv_upgrade(sv, SVt_PVNV);
1612 sv_upgrade(sv, SVt_PVIV);
1621 Perl_croak(aTHX_ "Can't coerce %s to integer in %s", sv_reftype(sv,0),
1622 PL_op_desc[PL_op->op_type]);
1624 (void)SvIOK_only(sv); /* validate number */
1630 =for apidoc sv_setiv_mg
1632 Like C<sv_setiv>, but also handles 'set' magic.
1638 Perl_sv_setiv_mg(pTHX_ register SV *sv, IV i)
1645 =for apidoc sv_setuv
1647 Copies an unsigned integer into the given SV, upgrading first if necessary.
1648 Does not handle 'set' magic. See also C<sv_setuv_mg>.
1654 Perl_sv_setuv(pTHX_ register SV *sv, UV u)
1656 /* With these two if statements:
1657 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1660 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1662 If you wish to remove them, please benchmark to see what the effect is
1664 if (u <= (UV)IV_MAX) {
1665 sv_setiv(sv, (IV)u);
1674 =for apidoc sv_setuv_mg
1676 Like C<sv_setuv>, but also handles 'set' magic.
1682 Perl_sv_setuv_mg(pTHX_ register SV *sv, UV u)
1684 /* With these two if statements:
1685 u=1.49 s=0.52 cu=72.49 cs=10.64 scripts=270 tests=20865
1688 u=1.35 s=0.47 cu=73.45 cs=11.43 scripts=270 tests=20865
1690 If you wish to remove them, please benchmark to see what the effect is
1692 if (u <= (UV)IV_MAX) {
1693 sv_setiv(sv, (IV)u);
1703 =for apidoc sv_setnv
1705 Copies a double into the given SV, upgrading first if necessary.
1706 Does not handle 'set' magic. See also C<sv_setnv_mg>.
1712 Perl_sv_setnv(pTHX_ register SV *sv, NV num)
1714 SV_CHECK_THINKFIRST(sv);
1715 switch (SvTYPE(sv)) {
1718 sv_upgrade(sv, SVt_NV);
1723 sv_upgrade(sv, SVt_PVNV);
1732 Perl_croak(aTHX_ "Can't coerce %s to number in %s", sv_reftype(sv,0),
1733 PL_op_name[PL_op->op_type]);
1736 (void)SvNOK_only(sv); /* validate number */
1741 =for apidoc sv_setnv_mg
1743 Like C<sv_setnv>, but also handles 'set' magic.
1749 Perl_sv_setnv_mg(pTHX_ register SV *sv, NV num)
1755 /* Print an "isn't numeric" warning, using a cleaned-up,
1756 * printable version of the offending string
1760 S_not_a_number(pTHX_ SV *sv)
1764 char *limit = tmpbuf + sizeof(tmpbuf) - 8;
1765 /* each *s can expand to 4 chars + "...\0",
1766 i.e. need room for 8 chars */
1769 for (s = SvPVX(sv), end = s + SvCUR(sv); s < end && d < limit; s++) {
1771 if (ch & 128 && !isPRINT_LC(ch)) {
1780 else if (ch == '\r') {
1784 else if (ch == '\f') {
1788 else if (ch == '\\') {
1792 else if (ch == '\0') {
1796 else if (isPRINT_LC(ch))
1811 Perl_warner(aTHX_ WARN_NUMERIC,
1812 "Argument \"%s\" isn't numeric in %s", tmpbuf,
1813 PL_op_desc[PL_op->op_type]);
1815 Perl_warner(aTHX_ WARN_NUMERIC,
1816 "Argument \"%s\" isn't numeric", tmpbuf);
1820 =for apidoc looks_like_number
1822 Test if the content of an SV looks like a number (or is a number).
1823 C<Inf> and C<Infinity> are treated as numbers (so will not issue a
1824 non-numeric warning), even if your atof() doesn't grok them.
1830 Perl_looks_like_number(pTHX_ SV *sv)
1832 register char *sbegin;
1839 else if (SvPOKp(sv))
1840 sbegin = SvPV(sv, len);
1842 return 1; /* Historic. Wrong? */
1843 return grok_number(sbegin, len, NULL);
1846 /* Actually, ISO C leaves conversion of UV to IV undefined, but
1847 until proven guilty, assume that things are not that bad... */
1852 As 64 bit platforms often have an NV that doesn't preserve all bits of
1853 an IV (an assumption perl has been based on to date) it becomes necessary
1854 to remove the assumption that the NV always carries enough precision to
1855 recreate the IV whenever needed, and that the NV is the canonical form.
1856 Instead, IV/UV and NV need to be given equal rights. So as to not lose
1857 precision as a side effect of conversion (which would lead to insanity
1858 and the dragon(s) in t/op/numconvert.t getting very angry) the intent is
1859 1) to distinguish between IV/UV/NV slots that have cached a valid
1860 conversion where precision was lost and IV/UV/NV slots that have a
1861 valid conversion which has lost no precision
1862 2) to ensure that if a numeric conversion to one form is requested that
1863 would lose precision, the precise conversion (or differently
1864 imprecise conversion) is also performed and cached, to prevent
1865 requests for different numeric formats on the same SV causing
1866 lossy conversion chains. (lossless conversion chains are perfectly
1871 SvIOKp is true if the IV slot contains a valid value
1872 SvIOK is true only if the IV value is accurate (UV if SvIOK_UV true)
1873 SvNOKp is true if the NV slot contains a valid value
1874 SvNOK is true only if the NV value is accurate
1877 while converting from PV to NV, check to see if converting that NV to an
1878 IV(or UV) would lose accuracy over a direct conversion from PV to
1879 IV(or UV). If it would, cache both conversions, return NV, but mark
1880 SV as IOK NOKp (ie not NOK).
1882 While converting from PV to IV, check to see if converting that IV to an
1883 NV would lose accuracy over a direct conversion from PV to NV. If it
1884 would, cache both conversions, flag similarly.
1886 Before, the SV value "3.2" could become NV=3.2 IV=3 NOK, IOK quite
1887 correctly because if IV & NV were set NV *always* overruled.
1888 Now, "3.2" will become NV=3.2 IV=3 NOK, IOKp, because the flag's meaning
1889 changes - now IV and NV together means that the two are interchangeable:
1890 SvIVX == (IV) SvNVX && SvNVX == (NV) SvIVX;
1892 The benefit of this is that operations such as pp_add know that if
1893 SvIOK is true for both left and right operands, then integer addition
1894 can be used instead of floating point (for cases where the result won't
1895 overflow). Before, floating point was always used, which could lead to
1896 loss of precision compared with integer addition.
1898 * making IV and NV equal status should make maths accurate on 64 bit
1900 * may speed up maths somewhat if pp_add and friends start to use
1901 integers when possible instead of fp. (Hopefully the overhead in
1902 looking for SvIOK and checking for overflow will not outweigh the
1903 fp to integer speedup)
1904 * will slow down integer operations (callers of SvIV) on "inaccurate"
1905 values, as the change from SvIOK to SvIOKp will cause a call into
1906 sv_2iv each time rather than a macro access direct to the IV slot
1907 * should speed up number->string conversion on integers as IV is
1908 favoured when IV and NV are equally accurate
1910 ####################################################################
1911 You had better be using SvIOK_notUV if you want an IV for arithmetic:
1912 SvIOK is true if (IV or UV), so you might be getting (IV)SvUV.
1913 On the other hand, SvUOK is true iff UV.
1914 ####################################################################
1916 Your mileage will vary depending your CPU's relative fp to integer
1920 #ifndef NV_PRESERVES_UV
1921 # define IS_NUMBER_UNDERFLOW_IV 1
1922 # define IS_NUMBER_UNDERFLOW_UV 2
1923 # define IS_NUMBER_IV_AND_UV 2
1924 # define IS_NUMBER_OVERFLOW_IV 4
1925 # define IS_NUMBER_OVERFLOW_UV 5
1927 /* sv_2iuv_non_preserve(): private routine for use by sv_2iv() and sv_2uv() */
1929 /* For sv_2nv these three cases are "SvNOK and don't bother casting" */
1931 S_sv_2iuv_non_preserve(pTHX_ register SV *sv, I32 numtype)
1933 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_2iuv_non '%s', IV=0x%"UVxf" NV=%g inttype=%"UVXf"\n", SvPVX(sv), SvIVX(sv), SvNVX(sv), (UV)numtype));
1934 if (SvNVX(sv) < (NV)IV_MIN) {
1935 (void)SvIOKp_on(sv);
1938 return IS_NUMBER_UNDERFLOW_IV;
1940 if (SvNVX(sv) > (NV)UV_MAX) {
1941 (void)SvIOKp_on(sv);
1945 return IS_NUMBER_OVERFLOW_UV;
1947 (void)SvIOKp_on(sv);
1949 /* Can't use strtol etc to convert this string. (See truth table in
1951 if (SvNVX(sv) <= (UV)IV_MAX) {
1952 SvIVX(sv) = I_V(SvNVX(sv));
1953 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
1954 SvIOK_on(sv); /* Integer is precise. NOK, IOK */
1956 /* Integer is imprecise. NOK, IOKp */
1958 return SvNVX(sv) < 0 ? IS_NUMBER_UNDERFLOW_UV : IS_NUMBER_IV_AND_UV;
1961 SvUVX(sv) = U_V(SvNVX(sv));
1962 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
1963 if (SvUVX(sv) == UV_MAX) {
1964 /* As we know that NVs don't preserve UVs, UV_MAX cannot
1965 possibly be preserved by NV. Hence, it must be overflow.
1967 return IS_NUMBER_OVERFLOW_UV;
1969 SvIOK_on(sv); /* Integer is precise. NOK, UOK */
1971 /* Integer is imprecise. NOK, IOKp */
1973 return IS_NUMBER_OVERFLOW_IV;
1975 #endif /* !NV_PRESERVES_UV*/
1980 Return the integer value of an SV, doing any necessary string conversion,
1981 magic etc. Normally used via the C<SvIV(sv)> and C<SvIVx(sv)> macros.
1987 Perl_sv_2iv(pTHX_ register SV *sv)
1991 if (SvGMAGICAL(sv)) {
1996 return I_V(SvNVX(sv));
1998 if (SvPOKp(sv) && SvLEN(sv))
2001 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2002 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2008 if (SvTHINKFIRST(sv)) {
2011 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2012 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2013 return SvIV(tmpstr);
2014 return PTR2IV(SvRV(sv));
2016 if (SvREADONLY(sv) && SvFAKE(sv)) {
2017 sv_force_normal(sv);
2019 if (SvREADONLY(sv) && !SvOK(sv)) {
2020 if (ckWARN(WARN_UNINITIALIZED))
2027 return (IV)(SvUVX(sv));
2034 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2035 * without also getting a cached IV/UV from it at the same time
2036 * (ie PV->NV conversion should detect loss of accuracy and cache
2037 * IV or UV at same time to avoid this. NWC */
2039 if (SvTYPE(sv) == SVt_NV)
2040 sv_upgrade(sv, SVt_PVNV);
2042 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2043 /* < not <= as for NV doesn't preserve UV, ((NV)IV_MAX+1) will almost
2044 certainly cast into the IV range at IV_MAX, whereas the correct
2045 answer is the UV IV_MAX +1. Hence < ensures that dodgy boundary
2047 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2048 SvIVX(sv) = I_V(SvNVX(sv));
2049 if (SvNVX(sv) == (NV) SvIVX(sv)
2050 #ifndef NV_PRESERVES_UV
2051 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2052 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2053 /* Don't flag it as "accurately an integer" if the number
2054 came from a (by definition imprecise) NV operation, and
2055 we're outside the range of NV integer precision */
2058 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2059 DEBUG_c(PerlIO_printf(Perl_debug_log,
2060 "0x%"UVxf" iv(%g => %"IVdf") (precise)\n",
2066 /* IV not precise. No need to convert from PV, as NV
2067 conversion would already have cached IV if it detected
2068 that PV->IV would be better than PV->NV->IV
2069 flags already correct - don't set public IOK. */
2070 DEBUG_c(PerlIO_printf(Perl_debug_log,
2071 "0x%"UVxf" iv(%g => %"IVdf") (imprecise)\n",
2076 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2077 but the cast (NV)IV_MIN rounds to a the value less (more
2078 negative) than IV_MIN which happens to be equal to SvNVX ??
2079 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2080 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2081 (NV)UVX == NVX are both true, but the values differ. :-(
2082 Hopefully for 2s complement IV_MIN is something like
2083 0x8000000000000000 which will be exact. NWC */
2086 SvUVX(sv) = U_V(SvNVX(sv));
2088 (SvNVX(sv) == (NV) SvUVX(sv))
2089 #ifndef NV_PRESERVES_UV
2090 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2091 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2092 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2093 /* Don't flag it as "accurately an integer" if the number
2094 came from a (by definition imprecise) NV operation, and
2095 we're outside the range of NV integer precision */
2101 DEBUG_c(PerlIO_printf(Perl_debug_log,
2102 "0x%"UVxf" 2iv(%"UVuf" => %"IVdf") (as unsigned)\n",
2106 return (IV)SvUVX(sv);
2109 else if (SvPOKp(sv) && SvLEN(sv)) {
2111 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2112 /* We want to avoid a possible problem when we cache an IV which
2113 may be later translated to an NV, and the resulting NV is not
2114 the same as the direct translation of the initial string
2115 (eg 123.456 can shortcut to the IV 123 with atol(), but we must
2116 be careful to ensure that the value with the .456 is around if the
2117 NV value is requested in the future).
2119 This means that if we cache such an IV, we need to cache the
2120 NV as well. Moreover, we trade speed for space, and do not
2121 cache the NV if we are sure it's not needed.
2124 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2125 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2126 == IS_NUMBER_IN_UV) {
2127 /* It's definitely an integer, only upgrade to PVIV */
2128 if (SvTYPE(sv) < SVt_PVIV)
2129 sv_upgrade(sv, SVt_PVIV);
2131 } else if (SvTYPE(sv) < SVt_PVNV)
2132 sv_upgrade(sv, SVt_PVNV);
2134 /* If NV preserves UV then we only use the UV value if we know that
2135 we aren't going to call atof() below. If NVs don't preserve UVs
2136 then the value returned may have more precision than atof() will
2137 return, even though value isn't perfectly accurate. */
2138 if ((numtype & (IS_NUMBER_IN_UV
2139 #ifdef NV_PRESERVES_UV
2142 )) == IS_NUMBER_IN_UV) {
2143 /* This won't turn off the public IOK flag if it was set above */
2144 (void)SvIOKp_on(sv);
2146 if (!(numtype & IS_NUMBER_NEG)) {
2148 if (value <= (UV)IV_MAX) {
2149 SvIVX(sv) = (IV)value;
2155 /* 2s complement assumption */
2156 if (value <= (UV)IV_MIN) {
2157 SvIVX(sv) = -(IV)value;
2159 /* Too negative for an IV. This is a double upgrade, but
2160 I'm assuming it will be be rare. */
2161 if (SvTYPE(sv) < SVt_PVNV)
2162 sv_upgrade(sv, SVt_PVNV);
2166 SvNVX(sv) = -(NV)value;
2171 /* For !NV_PRESERVES_UV and IS_NUMBER_IN_UV and IS_NUMBER_NOT_INT we
2172 will be in the previous block to set the IV slot, and the next
2173 block to set the NV slot. So no else here. */
2175 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2176 != IS_NUMBER_IN_UV) {
2177 /* It wasn't an (integer that doesn't overflow the UV). */
2178 SvNVX(sv) = Atof(SvPVX(sv));
2180 if (! numtype && ckWARN(WARN_NUMERIC))
2183 #if defined(USE_LONG_DOUBLE)
2184 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%" PERL_PRIgldbl ")\n",
2185 PTR2UV(sv), SvNVX(sv)));
2187 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%g)\n",
2188 PTR2UV(sv), SvNVX(sv)));
2192 #ifdef NV_PRESERVES_UV
2193 (void)SvIOKp_on(sv);
2195 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2196 SvIVX(sv) = I_V(SvNVX(sv));
2197 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2200 /* Integer is imprecise. NOK, IOKp */
2202 /* UV will not work better than IV */
2204 if (SvNVX(sv) > (NV)UV_MAX) {
2206 /* Integer is inaccurate. NOK, IOKp, is UV */
2210 SvUVX(sv) = U_V(SvNVX(sv));
2211 /* 0xFFFFFFFFFFFFFFFF not an issue in here */
2212 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2216 /* Integer is imprecise. NOK, IOKp, is UV */
2222 #else /* NV_PRESERVES_UV */
2223 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2224 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2225 /* The IV slot will have been set from value returned by
2226 grok_number above. The NV slot has just been set using
2229 assert (SvIOKp(sv));
2231 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2232 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2233 /* Small enough to preserve all bits. */
2234 (void)SvIOKp_on(sv);
2236 SvIVX(sv) = I_V(SvNVX(sv));
2237 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2239 /* Assumption: first non-preserved integer is < IV_MAX,
2240 this NV is in the preserved range, therefore: */
2241 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2243 Perl_croak(aTHX_ "sv_2iv assumed (U_V(fabs(SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%g U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2247 0 0 already failed to read UV.
2248 0 1 already failed to read UV.
2249 1 0 you won't get here in this case. IV/UV
2250 slot set, public IOK, Atof() unneeded.
2251 1 1 already read UV.
2252 so there's no point in sv_2iuv_non_preserve() attempting
2253 to use atol, strtol, strtoul etc. */
2254 if (sv_2iuv_non_preserve (sv, numtype)
2255 >= IS_NUMBER_OVERFLOW_IV)
2259 #endif /* NV_PRESERVES_UV */
2262 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2264 if (SvTYPE(sv) < SVt_IV)
2265 /* Typically the caller expects that sv_any is not NULL now. */
2266 sv_upgrade(sv, SVt_IV);
2269 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2iv(%"IVdf")\n",
2270 PTR2UV(sv),SvIVX(sv)));
2271 return SvIsUV(sv) ? (IV)SvUVX(sv) : SvIVX(sv);
2277 Return the unsigned integer value of an SV, doing any necessary string
2278 conversion, magic etc. Normally used via the C<SvUV(sv)> and C<SvUVx(sv)>
2285 Perl_sv_2uv(pTHX_ register SV *sv)
2289 if (SvGMAGICAL(sv)) {
2294 return U_V(SvNVX(sv));
2295 if (SvPOKp(sv) && SvLEN(sv))
2298 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2299 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2305 if (SvTHINKFIRST(sv)) {
2308 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2309 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2310 return SvUV(tmpstr);
2311 return PTR2UV(SvRV(sv));
2313 if (SvREADONLY(sv) && SvFAKE(sv)) {
2314 sv_force_normal(sv);
2316 if (SvREADONLY(sv) && !SvOK(sv)) {
2317 if (ckWARN(WARN_UNINITIALIZED))
2327 return (UV)SvIVX(sv);
2331 /* erm. not sure. *should* never get NOKp (without NOK) from sv_2nv
2332 * without also getting a cached IV/UV from it at the same time
2333 * (ie PV->NV conversion should detect loss of accuracy and cache
2334 * IV or UV at same time to avoid this. */
2335 /* IV-over-UV optimisation - choose to cache IV if possible */
2337 if (SvTYPE(sv) == SVt_NV)
2338 sv_upgrade(sv, SVt_PVNV);
2340 (void)SvIOKp_on(sv); /* Must do this first, to clear any SvOOK */
2341 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2342 SvIVX(sv) = I_V(SvNVX(sv));
2343 if (SvNVX(sv) == (NV) SvIVX(sv)
2344 #ifndef NV_PRESERVES_UV
2345 && (((UV)1 << NV_PRESERVES_UV_BITS) >
2346 (UV)(SvIVX(sv) > 0 ? SvIVX(sv) : -SvIVX(sv)))
2347 /* Don't flag it as "accurately an integer" if the number
2348 came from a (by definition imprecise) NV operation, and
2349 we're outside the range of NV integer precision */
2352 SvIOK_on(sv); /* Can this go wrong with rounding? NWC */
2353 DEBUG_c(PerlIO_printf(Perl_debug_log,
2354 "0x%"UVxf" uv(%g => %"IVdf") (precise)\n",
2360 /* IV not precise. No need to convert from PV, as NV
2361 conversion would already have cached IV if it detected
2362 that PV->IV would be better than PV->NV->IV
2363 flags already correct - don't set public IOK. */
2364 DEBUG_c(PerlIO_printf(Perl_debug_log,
2365 "0x%"UVxf" uv(%g => %"IVdf") (imprecise)\n",
2370 /* Can the above go wrong if SvIVX == IV_MIN and SvNVX < IV_MIN,
2371 but the cast (NV)IV_MIN rounds to a the value less (more
2372 negative) than IV_MIN which happens to be equal to SvNVX ??
2373 Analogous to 0xFFFFFFFFFFFFFFFF rounding up to NV (2**64) and
2374 NV rounding back to 0xFFFFFFFFFFFFFFFF, so UVX == UV(NVX) and
2375 (NV)UVX == NVX are both true, but the values differ. :-(
2376 Hopefully for 2s complement IV_MIN is something like
2377 0x8000000000000000 which will be exact. NWC */
2380 SvUVX(sv) = U_V(SvNVX(sv));
2382 (SvNVX(sv) == (NV) SvUVX(sv))
2383 #ifndef NV_PRESERVES_UV
2384 /* Make sure it's not 0xFFFFFFFFFFFFFFFF */
2385 /*&& (SvUVX(sv) != UV_MAX) irrelevant with code below */
2386 && (((UV)1 << NV_PRESERVES_UV_BITS) > SvUVX(sv))
2387 /* Don't flag it as "accurately an integer" if the number
2388 came from a (by definition imprecise) NV operation, and
2389 we're outside the range of NV integer precision */
2394 DEBUG_c(PerlIO_printf(Perl_debug_log,
2395 "0x%"UVxf" 2uv(%"UVuf" => %"IVdf") (as unsigned)\n",
2401 else if (SvPOKp(sv) && SvLEN(sv)) {
2403 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2405 /* We want to avoid a possible problem when we cache a UV which
2406 may be later translated to an NV, and the resulting NV is not
2407 the translation of the initial data.
2409 This means that if we cache such a UV, we need to cache the
2410 NV as well. Moreover, we trade speed for space, and do not
2411 cache the NV if not needed.
2414 /* SVt_PVNV is one higher than SVt_PVIV, hence this order */
2415 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2416 == IS_NUMBER_IN_UV) {
2417 /* It's definitely an integer, only upgrade to PVIV */
2418 if (SvTYPE(sv) < SVt_PVIV)
2419 sv_upgrade(sv, SVt_PVIV);
2421 } else if (SvTYPE(sv) < SVt_PVNV)
2422 sv_upgrade(sv, SVt_PVNV);
2424 /* If NV preserves UV then we only use the UV value if we know that
2425 we aren't going to call atof() below. If NVs don't preserve UVs
2426 then the value returned may have more precision than atof() will
2427 return, even though it isn't accurate. */
2428 if ((numtype & (IS_NUMBER_IN_UV
2429 #ifdef NV_PRESERVES_UV
2432 )) == IS_NUMBER_IN_UV) {
2433 /* This won't turn off the public IOK flag if it was set above */
2434 (void)SvIOKp_on(sv);
2436 if (!(numtype & IS_NUMBER_NEG)) {
2438 if (value <= (UV)IV_MAX) {
2439 SvIVX(sv) = (IV)value;
2441 /* it didn't overflow, and it was positive. */
2446 /* 2s complement assumption */
2447 if (value <= (UV)IV_MIN) {
2448 SvIVX(sv) = -(IV)value;
2450 /* Too negative for an IV. This is a double upgrade, but
2451 I'm assuming it will be be rare. */
2452 if (SvTYPE(sv) < SVt_PVNV)
2453 sv_upgrade(sv, SVt_PVNV);
2457 SvNVX(sv) = -(NV)value;
2463 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2464 != IS_NUMBER_IN_UV) {
2465 /* It wasn't an integer, or it overflowed the UV. */
2466 SvNVX(sv) = Atof(SvPVX(sv));
2468 if (! numtype && ckWARN(WARN_NUMERIC))
2471 #if defined(USE_LONG_DOUBLE)
2472 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%" PERL_PRIgldbl ")\n",
2473 PTR2UV(sv), SvNVX(sv)));
2475 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%g)\n",
2476 PTR2UV(sv), SvNVX(sv)));
2479 #ifdef NV_PRESERVES_UV
2480 (void)SvIOKp_on(sv);
2482 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2483 SvIVX(sv) = I_V(SvNVX(sv));
2484 if ((NV)(SvIVX(sv)) == SvNVX(sv)) {
2487 /* Integer is imprecise. NOK, IOKp */
2489 /* UV will not work better than IV */
2491 if (SvNVX(sv) > (NV)UV_MAX) {
2493 /* Integer is inaccurate. NOK, IOKp, is UV */
2497 SvUVX(sv) = U_V(SvNVX(sv));
2498 /* 0xFFFFFFFFFFFFFFFF not an issue in here, NVs
2499 NV preservse UV so can do correct comparison. */
2500 if ((NV)(SvUVX(sv)) == SvNVX(sv)) {
2504 /* Integer is imprecise. NOK, IOKp, is UV */
2509 #else /* NV_PRESERVES_UV */
2510 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2511 == (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT)) {
2512 /* The UV slot will have been set from value returned by
2513 grok_number above. The NV slot has just been set using
2516 assert (SvIOKp(sv));
2518 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2519 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2520 /* Small enough to preserve all bits. */
2521 (void)SvIOKp_on(sv);
2523 SvIVX(sv) = I_V(SvNVX(sv));
2524 if ((NV)(SvIVX(sv)) == SvNVX(sv))
2526 /* Assumption: first non-preserved integer is < IV_MAX,
2527 this NV is in the preserved range, therefore: */
2528 if (!(U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))
2530 Perl_croak(aTHX_ "sv_2uv assumed (U_V(fabs(SvNVX(sv))) < (UV)IV_MAX) but SvNVX(sv)=%g U_V is 0x%"UVxf", IV_MAX is 0x%"UVxf"\n", SvNVX(sv), U_V(SvNVX(sv)), (UV)IV_MAX);
2533 sv_2iuv_non_preserve (sv, numtype);
2535 #endif /* NV_PRESERVES_UV */
2539 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2540 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2543 if (SvTYPE(sv) < SVt_IV)
2544 /* Typically the caller expects that sv_any is not NULL now. */
2545 sv_upgrade(sv, SVt_IV);
2549 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2uv(%"UVuf")\n",
2550 PTR2UV(sv),SvUVX(sv)));
2551 return SvIsUV(sv) ? SvUVX(sv) : (UV)SvIVX(sv);
2557 Return the num value of an SV, doing any necessary string or integer
2558 conversion, magic etc. Normally used via the C<SvNV(sv)> and C<SvNVx(sv)>
2565 Perl_sv_2nv(pTHX_ register SV *sv)
2569 if (SvGMAGICAL(sv)) {
2573 if (SvPOKp(sv) && SvLEN(sv)) {
2574 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) &&
2575 !grok_number(SvPVX(sv), SvCUR(sv), NULL))
2577 return Atof(SvPVX(sv));
2581 return (NV)SvUVX(sv);
2583 return (NV)SvIVX(sv);
2586 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2587 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2593 if (SvTHINKFIRST(sv)) {
2596 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,numer)) &&
2597 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2598 return SvNV(tmpstr);
2599 return PTR2NV(SvRV(sv));
2601 if (SvREADONLY(sv) && SvFAKE(sv)) {
2602 sv_force_normal(sv);
2604 if (SvREADONLY(sv) && !SvOK(sv)) {
2605 if (ckWARN(WARN_UNINITIALIZED))
2610 if (SvTYPE(sv) < SVt_NV) {
2611 if (SvTYPE(sv) == SVt_IV)
2612 sv_upgrade(sv, SVt_PVNV);
2614 sv_upgrade(sv, SVt_NV);
2615 #ifdef USE_LONG_DOUBLE
2617 STORE_NUMERIC_LOCAL_SET_STANDARD();
2618 PerlIO_printf(Perl_debug_log,
2619 "0x%"UVxf" num(%" PERL_PRIgldbl ")\n",
2620 PTR2UV(sv), SvNVX(sv));
2621 RESTORE_NUMERIC_LOCAL();
2625 STORE_NUMERIC_LOCAL_SET_STANDARD();
2626 PerlIO_printf(Perl_debug_log, "0x%"UVxf" num(%g)\n",
2627 PTR2UV(sv), SvNVX(sv));
2628 RESTORE_NUMERIC_LOCAL();
2632 else if (SvTYPE(sv) < SVt_PVNV)
2633 sv_upgrade(sv, SVt_PVNV);
2634 if (SvNOKp(sv) && !(SvIOK(sv) || SvPOK(sv))) {
2637 else if (SvIOKp(sv)) {
2638 SvNVX(sv) = SvIsUV(sv) ? (NV)SvUVX(sv) : (NV)SvIVX(sv);
2639 #ifdef NV_PRESERVES_UV
2642 /* Only set the public NV OK flag if this NV preserves the IV */
2643 /* Check it's not 0xFFFFFFFFFFFFFFFF */
2644 if (SvIsUV(sv) ? ((SvUVX(sv) != UV_MAX)&&(SvUVX(sv) == U_V(SvNVX(sv))))
2645 : (SvIVX(sv) == I_V(SvNVX(sv))))
2651 else if (SvPOKp(sv) && SvLEN(sv)) {
2653 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2654 if (ckWARN(WARN_NUMERIC) && !SvIOKp(sv) && !numtype)
2656 #ifdef NV_PRESERVES_UV
2657 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2658 == IS_NUMBER_IN_UV) {
2659 /* It's definitely an integer */
2660 SvNVX(sv) = (numtype & IS_NUMBER_NEG) ? -(NV)value : (NV)value;
2662 SvNVX(sv) = Atof(SvPVX(sv));
2665 SvNVX(sv) = Atof(SvPVX(sv));
2666 /* Only set the public NV OK flag if this NV preserves the value in
2667 the PV at least as well as an IV/UV would.
2668 Not sure how to do this 100% reliably. */
2669 /* if that shift count is out of range then Configure's test is
2670 wonky. We shouldn't be in here with NV_PRESERVES_UV_BITS ==
2672 if (((UV)1 << NV_PRESERVES_UV_BITS) >
2673 U_V(SvNVX(sv) > 0 ? SvNVX(sv) : -SvNVX(sv))) {
2674 SvNOK_on(sv); /* Definitely small enough to preserve all bits */
2675 } else if (!(numtype & IS_NUMBER_IN_UV)) {
2676 /* Can't use strtol etc to convert this string, so don't try.
2677 sv_2iv and sv_2uv will use the NV to convert, not the PV. */
2680 /* value has been set. It may not be precise. */
2681 if ((numtype & IS_NUMBER_NEG) && (value > (UV)IV_MIN)) {
2682 /* 2s complement assumption for (UV)IV_MIN */
2683 SvNOK_on(sv); /* Integer is too negative. */
2688 if (numtype & IS_NUMBER_NEG) {
2689 SvIVX(sv) = -(IV)value;
2690 } else if (value <= (UV)IV_MAX) {
2691 SvIVX(sv) = (IV)value;
2697 if (numtype & IS_NUMBER_NOT_INT) {
2698 /* I believe that even if the original PV had decimals,
2699 they are lost beyond the limit of the FP precision.
2700 However, neither is canonical, so both only get p
2701 flags. NWC, 2000/11/25 */
2702 /* Both already have p flags, so do nothing */
2705 if (SvNVX(sv) < (NV)IV_MAX + 0.5) {
2706 if (SvIVX(sv) == I_V(nv)) {
2711 /* It had no "." so it must be integer. */
2714 /* between IV_MAX and NV(UV_MAX).
2715 Could be slightly > UV_MAX */
2717 if (numtype & IS_NUMBER_NOT_INT) {
2718 /* UV and NV both imprecise. */
2720 UV nv_as_uv = U_V(nv);
2722 if (value == nv_as_uv && SvUVX(sv) != UV_MAX) {
2733 #endif /* NV_PRESERVES_UV */
2736 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
2738 if (SvTYPE(sv) < SVt_NV)
2739 /* Typically the caller expects that sv_any is not NULL now. */
2740 /* XXX Ilya implies that this is a bug in callers that assume this
2741 and ideally should be fixed. */
2742 sv_upgrade(sv, SVt_NV);
2745 #if defined(USE_LONG_DOUBLE)
2747 STORE_NUMERIC_LOCAL_SET_STANDARD();
2748 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2nv(%" PERL_PRIgldbl ")\n",
2749 PTR2UV(sv), SvNVX(sv));
2750 RESTORE_NUMERIC_LOCAL();
2754 STORE_NUMERIC_LOCAL_SET_STANDARD();
2755 PerlIO_printf(Perl_debug_log, "0x%"UVxf" 1nv(%g)\n",
2756 PTR2UV(sv), SvNVX(sv));
2757 RESTORE_NUMERIC_LOCAL();
2763 /* asIV(): extract an integer from the string value of an SV.
2764 * Caller must validate PVX */
2767 S_asIV(pTHX_ SV *sv)
2770 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2772 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2773 == IS_NUMBER_IN_UV) {
2774 /* It's definitely an integer */
2775 if (numtype & IS_NUMBER_NEG) {
2776 if (value < (UV)IV_MIN)
2779 if (value < (UV)IV_MAX)
2784 if (ckWARN(WARN_NUMERIC))
2787 return I_V(Atof(SvPVX(sv)));
2790 /* asUV(): extract an unsigned integer from the string value of an SV
2791 * Caller must validate PVX */
2794 S_asUV(pTHX_ SV *sv)
2797 int numtype = grok_number(SvPVX(sv), SvCUR(sv), &value);
2799 if ((numtype & (IS_NUMBER_IN_UV | IS_NUMBER_NOT_INT))
2800 == IS_NUMBER_IN_UV) {
2801 /* It's definitely an integer */
2802 if (!(numtype & IS_NUMBER_NEG))
2806 if (ckWARN(WARN_NUMERIC))
2809 return U_V(Atof(SvPVX(sv)));
2813 =for apidoc sv_2pv_nolen
2815 Like C<sv_2pv()>, but doesn't return the length too. You should usually
2816 use the macro wrapper C<SvPV_nolen(sv)> instead.
2821 Perl_sv_2pv_nolen(pTHX_ register SV *sv)
2824 return sv_2pv(sv, &n_a);
2827 /* uiv_2buf(): private routine for use by sv_2pv_flags(): print an IV or
2828 * UV as a string towards the end of buf, and return pointers to start and
2831 * We assume that buf is at least TYPE_CHARS(UV) long.
2835 uiv_2buf(char *buf, IV iv, UV uv, int is_uv, char **peob)
2837 char *ptr = buf + TYPE_CHARS(UV);
2851 *--ptr = '0' + (uv % 10);
2859 /* For backwards-compatibility only. sv_2pv() is normally #def'ed to
2860 * C<sv_2pv_macro()>. See also C<sv_2pv_flags()>.
2864 Perl_sv_2pv(pTHX_ register SV *sv, STRLEN *lp)
2866 return sv_2pv_flags(sv, lp, SV_GMAGIC);
2870 =for apidoc sv_2pv_flags
2872 Returns a pointer to the string value of an SV, and sets *lp to its length.
2873 If flags includes SV_GMAGIC, does an mg_get() first. Coerces sv to a string
2875 Normally invoked via the C<SvPV_flags> macro. C<sv_2pv()> and C<sv_2pv_nomg>
2876 usually end up here too.
2882 Perl_sv_2pv_flags(pTHX_ register SV *sv, STRLEN *lp, I32 flags)
2887 char tbuf[64]; /* Must fit sprintf/Gconvert of longest IV/NV */
2888 char *tmpbuf = tbuf;
2894 if (SvGMAGICAL(sv)) {
2895 if (flags & SV_GMAGIC)
2903 (void)sprintf(tmpbuf,"%"UVuf, (UV)SvUVX(sv));
2905 (void)sprintf(tmpbuf,"%"IVdf, (IV)SvIVX(sv));
2910 Gconvert(SvNVX(sv), NV_DIG, 0, tmpbuf);
2915 if (!(SvFLAGS(sv) & SVs_PADTMP)) {
2916 if (ckWARN(WARN_UNINITIALIZED) && !PL_localizing)
2923 if (SvTHINKFIRST(sv)) {
2926 if (SvAMAGIC(sv) && (tmpstr=AMG_CALLun(sv,string)) &&
2927 (SvTYPE(tmpstr) != SVt_RV || (SvRV(tmpstr) != SvRV(sv))))
2928 return SvPV(tmpstr,*lp);
2935 switch (SvTYPE(sv)) {
2937 if ( ((SvFLAGS(sv) &
2938 (SVs_OBJECT|SVf_OK|SVs_GMG|SVs_SMG|SVs_RMG))
2939 == (SVs_OBJECT|SVs_RMG))
2940 && strEQ(s=HvNAME(SvSTASH(sv)), "Regexp")
2941 && (mg = mg_find(sv, PERL_MAGIC_qr))) {
2942 regexp *re = (regexp *)mg->mg_obj;
2945 char *fptr = "msix";
2950 U16 reganch = (re->reganch & PMf_COMPILETIME) >> 12;
2952 while((ch = *fptr++)) {
2954 reflags[left++] = ch;
2957 reflags[right--] = ch;
2962 reflags[left] = '-';
2966 mg->mg_len = re->prelen + 4 + left;
2967 New(616, mg->mg_ptr, mg->mg_len + 1 + left, char);
2968 Copy("(?", mg->mg_ptr, 2, char);
2969 Copy(reflags, mg->mg_ptr+2, left, char);
2970 Copy(":", mg->mg_ptr+left+2, 1, char);
2971 Copy(re->precomp, mg->mg_ptr+3+left, re->prelen, char);
2972 mg->mg_ptr[mg->mg_len - 1] = ')';
2973 mg->mg_ptr[mg->mg_len] = 0;
2975 PL_reginterp_cnt += re->program[0].next_off;
2987 case SVt_PVBM: if (SvROK(sv))
2990 s = "SCALAR"; break;
2991 case SVt_PVLV: s = "LVALUE"; break;
2992 case SVt_PVAV: s = "ARRAY"; break;
2993 case SVt_PVHV: s = "HASH"; break;
2994 case SVt_PVCV: s = "CODE"; break;
2995 case SVt_PVGV: s = "GLOB"; break;
2996 case SVt_PVFM: s = "FORMAT"; break;
2997 case SVt_PVIO: s = "IO"; break;
2998 default: s = "UNKNOWN"; break;
3002 Perl_sv_setpvf(aTHX_ tsv, "%s=%s", HvNAME(SvSTASH(sv)), s);
3005 Perl_sv_catpvf(aTHX_ tsv, "(0x%"UVxf")", PTR2UV(sv));
3011 if (SvREADONLY(sv) && !SvOK(sv)) {
3012 if (ckWARN(WARN_UNINITIALIZED))
3018 if (SvIOK(sv) || ((SvIOKp(sv) && !SvNOKp(sv)))) {
3019 /* I'm assuming that if both IV and NV are equally valid then
3020 converting the IV is going to be more efficient */
3021 U32 isIOK = SvIOK(sv);
3022 U32 isUIOK = SvIsUV(sv);
3023 char buf[TYPE_CHARS(UV)];
3026 if (SvTYPE(sv) < SVt_PVIV)
3027 sv_upgrade(sv, SVt_PVIV);
3029 ptr = uiv_2buf(buf, 0, SvUVX(sv), 1, &ebuf);
3031 ptr = uiv_2buf(buf, SvIVX(sv), 0, 0, &ebuf);
3032 SvGROW(sv, ebuf - ptr + 1); /* inlined from sv_setpvn */
3033 Move(ptr,SvPVX(sv),ebuf - ptr,char);
3034 SvCUR_set(sv, ebuf - ptr);
3044 else if (SvNOKp(sv)) {
3045 if (SvTYPE(sv) < SVt_PVNV)
3046 sv_upgrade(sv, SVt_PVNV);
3047 /* The +20 is pure guesswork. Configure test needed. --jhi */
3048 SvGROW(sv, NV_DIG + 20);
3050 olderrno = errno; /* some Xenix systems wipe out errno here */
3052 if (SvNVX(sv) == 0.0)
3053 (void)strcpy(s,"0");
3057 Gconvert(SvNVX(sv), NV_DIG, 0, s);
3060 #ifdef FIXNEGATIVEZERO
3061 if (*s == '-' && s[1] == '0' && !s[2])
3071 if (ckWARN(WARN_UNINITIALIZED)
3072 && !PL_localizing && !(SvFLAGS(sv) & SVs_PADTMP))
3075 if (SvTYPE(sv) < SVt_PV)
3076 /* Typically the caller expects that sv_any is not NULL now. */
3077 sv_upgrade(sv, SVt_PV);
3080 *lp = s - SvPVX(sv);
3083 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
3084 PTR2UV(sv),SvPVX(sv)));
3088 if (SvROK(sv)) { /* XXX Skip this when sv_pvn_force calls */
3089 /* Sneaky stuff here */
3093 tsv = newSVpv(tmpbuf, 0);
3109 len = strlen(tmpbuf);
3111 #ifdef FIXNEGATIVEZERO
3112 if (len == 2 && t[0] == '-' && t[1] == '0') {
3117 (void)SvUPGRADE(sv, SVt_PV);
3119 s = SvGROW(sv, len + 1);
3128 =for apidoc sv_2pvbyte_nolen
3130 Return a pointer to the byte-encoded representation of the SV.
3131 May cause the SV to be downgraded from UTF8 as a side-effect.
3133 Usually accessed via the C<SvPVbyte_nolen> macro.
3139 Perl_sv_2pvbyte_nolen(pTHX_ register SV *sv)
3142 return sv_2pvbyte(sv, &n_a);
3146 =for apidoc sv_2pvbyte
3148 Return a pointer to the byte-encoded representation of the SV, and set *lp
3149 to its length. May cause the SV to be downgraded from UTF8 as a
3152 Usually accessed via the C<SvPVbyte> macro.
3158 Perl_sv_2pvbyte(pTHX_ register SV *sv, STRLEN *lp)
3160 sv_utf8_downgrade(sv,0);
3161 return SvPV(sv,*lp);
3165 =for apidoc sv_2pvutf8_nolen
3167 Return a pointer to the UTF8-encoded representation of the SV.
3168 May cause the SV to be upgraded to UTF8 as a side-effect.
3170 Usually accessed via the C<SvPVutf8_nolen> macro.
3176 Perl_sv_2pvutf8_nolen(pTHX_ register SV *sv)
3179 return sv_2pvutf8(sv, &n_a);
3183 =for apidoc sv_2pvutf8
3185 Return a pointer to the UTF8-encoded representation of the SV, and set *lp
3186 to its length. May cause the SV to be upgraded to UTF8 as a side-effect.
3188 Usually accessed via the C<SvPVutf8> macro.
3194 Perl_sv_2pvutf8(pTHX_ register SV *sv, STRLEN *lp)
3196 sv_utf8_upgrade(sv);
3197 return SvPV(sv,*lp);
3201 =for apidoc sv_2bool
3203 This function is only called on magical items, and is only used by
3204 sv_true() or its macro equivalent.
3210 Perl_sv_2bool(pTHX_ register SV *sv)
3219 if (SvAMAGIC(sv) && (tmpsv=AMG_CALLun(sv,bool_)) &&
3220 (SvTYPE(tmpsv) != SVt_RV || (SvRV(tmpsv) != SvRV(sv))))
3221 return SvTRUE(tmpsv);
3222 return SvRV(sv) != 0;
3225 register XPV* Xpvtmp;
3226 if ((Xpvtmp = (XPV*)SvANY(sv)) &&
3227 (*Xpvtmp->xpv_pv > '0' ||
3228 Xpvtmp->xpv_cur > 1 ||
3229 (Xpvtmp->xpv_cur && *Xpvtmp->xpv_pv != '0')))
3236 return SvIVX(sv) != 0;
3239 return SvNVX(sv) != 0.0;
3247 =for apidoc sv_utf8_upgrade
3249 Convert the PV of an SV to its UTF8-encoded form.
3250 Forces the SV to string form if it is not already.
3251 Always sets the SvUTF8 flag to avoid future validity checks even
3252 if all the bytes have hibit clear.
3258 Perl_sv_utf8_upgrade(pTHX_ register SV *sv)
3260 return sv_utf8_upgrade_flags(sv, SV_GMAGIC);
3264 =for apidoc sv_utf8_upgrade_flags
3266 Convert the PV of an SV to its UTF8-encoded form.
3267 Forces the SV to string form if it is not already.
3268 Always sets the SvUTF8 flag to avoid future validity checks even
3269 if all the bytes have hibit clear. If C<flags> has C<SV_GMAGIC> bit set,
3270 will C<mg_get> on C<sv> if appropriate, else not. C<sv_utf8_upgrade> and
3271 C<sv_utf8_upgrade_nomg> are implemented in terms of this function.
3277 Perl_sv_utf8_upgrade_flags(pTHX_ register SV *sv, I32 flags)
3287 (void) sv_2pv_flags(sv,&len, flags);
3295 if (SvREADONLY(sv) && SvFAKE(sv)) {
3296 sv_force_normal(sv);
3299 /* This function could be much more efficient if we had a FLAG in SVs
3300 * to signal if there are any hibit chars in the PV.
3301 * Given that there isn't make loop fast as possible
3303 s = (U8 *) SvPVX(sv);
3304 e = (U8 *) SvEND(sv);
3308 if ((hibit = !NATIVE_IS_INVARIANT(ch)))
3314 len = SvCUR(sv) + 1; /* Plus the \0 */
3315 SvPVX(sv) = (char*)bytes_to_utf8((U8*)s, &len);
3316 SvCUR(sv) = len - 1;
3318 Safefree(s); /* No longer using what was there before. */
3319 SvLEN(sv) = len; /* No longer know the real size. */
3321 /* Mark as UTF-8 even if no hibit - saves scanning loop */
3327 =for apidoc sv_utf8_downgrade
3329 Attempt to convert the PV of an SV from UTF8-encoded to byte encoding.
3330 This may not be possible if the PV contains non-byte encoding characters;
3331 if this is the case, either returns false or, if C<fail_ok> is not
3338 Perl_sv_utf8_downgrade(pTHX_ register SV* sv, bool fail_ok)
3340 if (SvPOK(sv) && SvUTF8(sv)) {
3345 if (SvREADONLY(sv) && SvFAKE(sv))
3346 sv_force_normal(sv);
3347 s = (U8 *) SvPV(sv, len);
3348 if (!utf8_to_bytes(s, &len)) {
3351 #ifdef USE_BYTES_DOWNGRADES
3352 else if (IN_BYTES) {
3354 U8 *e = (U8 *) SvEND(sv);
3357 UV ch = utf8n_to_uvchr(s,(e-s),&len,0);
3358 if (first && ch > 255) {
3360 Perl_warner(aTHX_ WARN_UTF8, "Wide character in byte %s",
3361 PL_op_desc[PL_op->op_type]);
3363 Perl_warner(aTHX_ WARN_UTF8, "Wide character in byte");
3370 len = (d - (U8 *) SvPVX(sv));
3375 Perl_croak(aTHX_ "Wide character in %s",
3376 PL_op_desc[PL_op->op_type]);
3378 Perl_croak(aTHX_ "Wide character");
3389 =for apidoc sv_utf8_encode
3391 Convert the PV of an SV to UTF8-encoded, but then turn off the C<SvUTF8>
3392 flag so that it looks like octets again. Used as a building block
3393 for encode_utf8 in Encode.xs
3399 Perl_sv_utf8_encode(pTHX_ register SV *sv)
3401 (void) sv_utf8_upgrade(sv);
3406 =for apidoc sv_utf8_decode
3408 Convert the octets in the PV from UTF-8 to chars. Scan for validity and then
3409 turn off SvUTF8 if needed so that we see characters. Used as a building block
3410 for decode_utf8 in Encode.xs
3416 Perl_sv_utf8_decode(pTHX_ register SV *sv)
3422 /* The octets may have got themselves encoded - get them back as
3425 if (!sv_utf8_downgrade(sv, TRUE))
3428 /* it is actually just a matter of turning the utf8 flag on, but
3429 * we want to make sure everything inside is valid utf8 first.
3431 c = (U8 *) SvPVX(sv);
3432 if (!is_utf8_string(c, SvCUR(sv)+1))
3434 e = (U8 *) SvEND(sv);
3437 if (!UTF8_IS_INVARIANT(ch)) {
3447 =for apidoc sv_setsv
3449 Copies the contents of the source SV C<ssv> into the destination SV
3450 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3451 function if the source SV needs to be reused. Does not handle 'set' magic.
3452 Loosely speaking, it performs a copy-by-value, obliterating any previous
3453 content of the destination.
3455 You probably want to use one of the assortment of wrappers, such as
3456 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3457 C<SvSetMagicSV_nosteal>.
3463 /* sv_setsv() is aliased to Perl_sv_setsv_macro; this function provided
3464 for binary compatibility only
3467 Perl_sv_setsv(pTHX_ SV *dstr, register SV *sstr)
3469 sv_setsv_flags(dstr, sstr, SV_GMAGIC);
3473 =for apidoc sv_setsv_flags
3475 Copies the contents of the source SV C<ssv> into the destination SV
3476 C<dsv>. The source SV may be destroyed if it is mortal, so don't use this
3477 function if the source SV needs to be reused. Does not handle 'set' magic.
3478 Loosely speaking, it performs a copy-by-value, obliterating any previous
3479 content of the destination.
3480 If the C<flags> parameter has the C<SV_GMAGIC> bit set, will C<mg_get> on
3481 C<ssv> if appropriate, else not. C<sv_setsv> and C<sv_setsv_nomg> are
3482 implemented in terms of this function.
3484 You probably want to use one of the assortment of wrappers, such as
3485 C<SvSetSV>, C<SvSetSV_nosteal>, C<SvSetMagicSV> and
3486 C<SvSetMagicSV_nosteal>.
3488 This is the primary function for copying scalars, and most other
3489 copy-ish functions and macros use this underneath.
3495 Perl_sv_setsv_flags(pTHX_ SV *dstr, register SV *sstr, I32 flags)
3497 register U32 sflags;
3503 SV_CHECK_THINKFIRST(dstr);
3505 sstr = &PL_sv_undef;
3506 stype = SvTYPE(sstr);
3507 dtype = SvTYPE(dstr);
3511 /* There's a lot of redundancy below but we're going for speed here */
3516 if (dtype != SVt_PVGV) {
3517 (void)SvOK_off(dstr);
3525 sv_upgrade(dstr, SVt_IV);
3528 sv_upgrade(dstr, SVt_PVNV);
3532 sv_upgrade(dstr, SVt_PVIV);
3535 (void)SvIOK_only(dstr);
3536 SvIVX(dstr) = SvIVX(sstr);
3539 if (SvTAINTED(sstr))
3550 sv_upgrade(dstr, SVt_NV);
3555 sv_upgrade(dstr, SVt_PVNV);
3558 SvNVX(dstr) = SvNVX(sstr);
3559 (void)SvNOK_only(dstr);
3560 if (SvTAINTED(sstr))
3568 sv_upgrade(dstr, SVt_RV);
3569 else if (dtype == SVt_PVGV &&
3570 SvTYPE(SvRV(sstr)) == SVt_PVGV) {
3573 if (GvIMPORTED(dstr) != GVf_IMPORTED
3574 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3576 GvIMPORTED_on(dstr);
3587 sv_upgrade(dstr, SVt_PV);
3590 if (dtype < SVt_PVIV)
3591 sv_upgrade(dstr, SVt_PVIV);
3594 if (dtype < SVt_PVNV)
3595 sv_upgrade(dstr, SVt_PVNV);
3602 Perl_croak(aTHX_ "Bizarre copy of %s in %s", sv_reftype(sstr, 0),
3603 PL_op_name[PL_op->op_type]);
3605 Perl_croak(aTHX_ "Bizarre copy of %s", sv_reftype(sstr, 0));
3609 if (dtype <= SVt_PVGV) {
3611 if (dtype != SVt_PVGV) {
3612 char *name = GvNAME(sstr);
3613 STRLEN len = GvNAMELEN(sstr);
3614 sv_upgrade(dstr, SVt_PVGV);
3615 sv_magic(dstr, dstr, PERL_MAGIC_glob, Nullch, 0);
3616 GvSTASH(dstr) = (HV*)SvREFCNT_inc(GvSTASH(sstr));
3617 GvNAME(dstr) = savepvn(name, len);
3618 GvNAMELEN(dstr) = len;
3619 SvFAKE_on(dstr); /* can coerce to non-glob */
3621 /* ahem, death to those who redefine active sort subs */
3622 else if (PL_curstackinfo->si_type == PERLSI_SORT
3623 && GvCV(dstr) && PL_sortcop == CvSTART(GvCV(dstr)))
3624 Perl_croak(aTHX_ "Can't redefine active sort subroutine %s",
3627 #ifdef GV_UNIQUE_CHECK
3628 if (GvUNIQUE((GV*)dstr)) {
3629 Perl_croak(aTHX_ PL_no_modify);
3633 (void)SvOK_off(dstr);
3634 GvINTRO_off(dstr); /* one-shot flag */
3636 GvGP(dstr) = gp_ref(GvGP(sstr));
3637 if (SvTAINTED(sstr))
3639 if (GvIMPORTED(dstr) != GVf_IMPORTED
3640 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3642 GvIMPORTED_on(dstr);
3650 if (SvGMAGICAL(sstr) && (flags & SV_GMAGIC)) {
3652 if (SvTYPE(sstr) != stype) {
3653 stype = SvTYPE(sstr);
3654 if (stype == SVt_PVGV && dtype <= SVt_PVGV)
3658 if (stype == SVt_PVLV)
3659 (void)SvUPGRADE(dstr, SVt_PVNV);
3661 (void)SvUPGRADE(dstr, stype);
3664 sflags = SvFLAGS(sstr);
3666 if (sflags & SVf_ROK) {
3667 if (dtype >= SVt_PV) {
3668 if (dtype == SVt_PVGV) {
3669 SV *sref = SvREFCNT_inc(SvRV(sstr));
3671 int intro = GvINTRO(dstr);
3673 #ifdef GV_UNIQUE_CHECK
3674 if (GvUNIQUE((GV*)dstr)) {
3675 Perl_croak(aTHX_ PL_no_modify);
3680 GvINTRO_off(dstr); /* one-shot flag */
3681 GvLINE(dstr) = CopLINE(PL_curcop);
3682 GvEGV(dstr) = (GV*)dstr;
3685 switch (SvTYPE(sref)) {
3688 SAVESPTR(GvAV(dstr));
3690 dref = (SV*)GvAV(dstr);
3691 GvAV(dstr) = (AV*)sref;
3692 if (!GvIMPORTED_AV(dstr)
3693 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3695 GvIMPORTED_AV_on(dstr);
3700 SAVESPTR(GvHV(dstr));
3702 dref = (SV*)GvHV(dstr);
3703 GvHV(dstr) = (HV*)sref;
3704 if (!GvIMPORTED_HV(dstr)
3705 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3707 GvIMPORTED_HV_on(dstr);
3712 if (GvCVGEN(dstr) && GvCV(dstr) != (CV*)sref) {
3713 SvREFCNT_dec(GvCV(dstr));
3714 GvCV(dstr) = Nullcv;
3715 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3716 PL_sub_generation++;
3718 SAVESPTR(GvCV(dstr));
3721 dref = (SV*)GvCV(dstr);
3722 if (GvCV(dstr) != (CV*)sref) {
3723 CV* cv = GvCV(dstr);
3725 if (!GvCVGEN((GV*)dstr) &&
3726 (CvROOT(cv) || CvXSUB(cv)))
3728 /* ahem, death to those who redefine
3729 * active sort subs */
3730 if (PL_curstackinfo->si_type == PERLSI_SORT &&
3731 PL_sortcop == CvSTART(cv))
3733 "Can't redefine active sort subroutine %s",
3734 GvENAME((GV*)dstr));
3735 /* Redefining a sub - warning is mandatory if
3736 it was a const and its value changed. */
3737 if (ckWARN(WARN_REDEFINE)
3739 && (!CvCONST((CV*)sref)
3740 || sv_cmp(cv_const_sv(cv),
3741 cv_const_sv((CV*)sref)))))
3743 Perl_warner(aTHX_ WARN_REDEFINE,
3745 ? "Constant subroutine %s redefined"
3746 : "Subroutine %s redefined",
3747 GvENAME((GV*)dstr));
3750 cv_ckproto(cv, (GV*)dstr,
3751 SvPOK(sref) ? SvPVX(sref) : Nullch);
3753 GvCV(dstr) = (CV*)sref;
3754 GvCVGEN(dstr) = 0; /* Switch off cacheness. */
3755 GvASSUMECV_on(dstr);
3756 PL_sub_generation++;
3758 if (!GvIMPORTED_CV(dstr)
3759 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3761 GvIMPORTED_CV_on(dstr);
3766 SAVESPTR(GvIOp(dstr));
3768 dref = (SV*)GvIOp(dstr);
3769 GvIOp(dstr) = (IO*)sref;
3773 SAVESPTR(GvFORM(dstr));
3775 dref = (SV*)GvFORM(dstr);
3776 GvFORM(dstr) = (CV*)sref;
3780 SAVESPTR(GvSV(dstr));
3782 dref = (SV*)GvSV(dstr);
3784 if (!GvIMPORTED_SV(dstr)
3785 && CopSTASH_ne(PL_curcop, GvSTASH(dstr)))
3787 GvIMPORTED_SV_on(dstr);
3795 if (SvTAINTED(sstr))
3800 (void)SvOOK_off(dstr); /* backoff */
3802 Safefree(SvPVX(dstr));
3803 SvLEN(dstr)=SvCUR(dstr)=0;
3806 (void)SvOK_off(dstr);
3807 SvRV(dstr) = SvREFCNT_inc(SvRV(sstr));
3809 if (sflags & SVp_NOK) {
3811 /* Only set the public OK flag if the source has public OK. */
3812 if (sflags & SVf_NOK)
3813 SvFLAGS(dstr) |= SVf_NOK;
3814 SvNVX(dstr) = SvNVX(sstr);
3816 if (sflags & SVp_IOK) {
3817 (void)SvIOKp_on(dstr);
3818 if (sflags & SVf_IOK)
3819 SvFLAGS(dstr) |= SVf_IOK;
3820 if (sflags & SVf_IVisUV)
3822 SvIVX(dstr) = SvIVX(sstr);
3824 if (SvAMAGIC(sstr)) {
3828 else if (sflags & SVp_POK) {
3831 * Check to see if we can just swipe the string. If so, it's a
3832 * possible small lose on short strings, but a big win on long ones.
3833 * It might even be a win on short strings if SvPVX(dstr)
3834 * has to be allocated and SvPVX(sstr) has to be freed.
3837 if (SvTEMP(sstr) && /* slated for free anyway? */
3838 SvREFCNT(sstr) == 1 && /* and no other references to it? */
3839 !(sflags & SVf_OOK) && /* and not involved in OOK hack? */
3840 SvLEN(sstr) && /* and really is a string */
3841 /* and won't be needed again, potentially */
3842 !(PL_op && PL_op->op_type == OP_AASSIGN))
3844 if (SvPVX(dstr)) { /* we know that dtype >= SVt_PV */
3846 SvFLAGS(dstr) &= ~SVf_OOK;
3847 Safefree(SvPVX(dstr) - SvIVX(dstr));
3849 else if (SvLEN(dstr))
3850 Safefree(SvPVX(dstr));
3852 (void)SvPOK_only(dstr);
3853 SvPV_set(dstr, SvPVX(sstr));
3854 SvLEN_set(dstr, SvLEN(sstr));
3855 SvCUR_set(dstr, SvCUR(sstr));
3858 (void)SvOK_off(sstr); /* NOTE: nukes most SvFLAGS on sstr */
3859 SvPV_set(sstr, Nullch);
3864 else { /* have to copy actual string */
3865 STRLEN len = SvCUR(sstr);
3867 SvGROW(dstr, len + 1); /* inlined from sv_setpvn */
3868 Move(SvPVX(sstr),SvPVX(dstr),len,char);
3869 SvCUR_set(dstr, len);
3870 *SvEND(dstr) = '\0';
3871 (void)SvPOK_only(dstr);
3873 if (sflags & SVf_UTF8)
3876 if (sflags & SVp_NOK) {
3878 if (sflags & SVf_NOK)
3879 SvFLAGS(dstr) |= SVf_NOK;
3880 SvNVX(dstr) = SvNVX(sstr);
3882 if (sflags & SVp_IOK) {
3883 (void)SvIOKp_on(dstr);
3884 if (sflags & SVf_IOK)
3885 SvFLAGS(dstr) |= SVf_IOK;
3886 if (sflags & SVf_IVisUV)
3888 SvIVX(dstr) = SvIVX(sstr);
3891 else if (sflags & SVp_IOK) {
3892 if (sflags & SVf_IOK)
3893 (void)SvIOK_only(dstr);
3895 (void)SvOK_off(dstr);
3896 (void)SvIOKp_on(dstr);
3898 /* XXXX Do we want to set IsUV for IV(ROK)? Be extra safe... */
3899 if (sflags & SVf_IVisUV)
3901 SvIVX(dstr) = SvIVX(sstr);
3902 if (sflags & SVp_NOK) {
3903 if (sflags & SVf_NOK)
3904 (void)SvNOK_on(dstr);
3906 (void)SvNOKp_on(dstr);
3907 SvNVX(dstr) = SvNVX(sstr);
3910 else if (sflags & SVp_NOK) {
3911 if (sflags & SVf_NOK)
3912 (void)SvNOK_only(dstr);
3914 (void)SvOK_off(dstr);
3917 SvNVX(dstr) = SvNVX(sstr);
3920 if (dtype == SVt_PVGV) {
3921 if (ckWARN(WARN_MISC))
3922 Perl_warner(aTHX_ WARN_MISC, "Undefined value assigned to typeglob");
3925 (void)SvOK_off(dstr);
3927 if (SvTAINTED(sstr))
3932 =for apidoc sv_setsv_mg
3934 Like C<sv_setsv>, but also handles 'set' magic.
3940 Perl_sv_setsv_mg(pTHX_ SV *dstr, register SV *sstr)
3942 sv_setsv(dstr,sstr);
3947 =for apidoc sv_setpvn
3949 Copies a string into an SV. The C<len> parameter indicates the number of
3950 bytes to be copied. Does not handle 'set' magic. See C<sv_setpvn_mg>.
3956 Perl_sv_setpvn(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3958 register char *dptr;
3960 SV_CHECK_THINKFIRST(sv);
3966 /* len is STRLEN which is unsigned, need to copy to signed */
3969 Perl_croak(aTHX_ "panic: sv_setpvn called with negative strlen");
3971 (void)SvUPGRADE(sv, SVt_PV);
3973 SvGROW(sv, len + 1);
3975 Move(ptr,dptr,len,char);
3978 (void)SvPOK_only_UTF8(sv); /* validate pointer */
3983 =for apidoc sv_setpvn_mg
3985 Like C<sv_setpvn>, but also handles 'set' magic.
3991 Perl_sv_setpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
3993 sv_setpvn(sv,ptr,len);
3998 =for apidoc sv_setpv
4000 Copies a string into an SV. The string must be null-terminated. Does not
4001 handle 'set' magic. See C<sv_setpv_mg>.
4007 Perl_sv_setpv(pTHX_ register SV *sv, register const char *ptr)
4009 register STRLEN len;
4011 SV_CHECK_THINKFIRST(sv);
4017 (void)SvUPGRADE(sv, SVt_PV);
4019 SvGROW(sv, len + 1);
4020 Move(ptr,SvPVX(sv),len+1,char);
4022 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4027 =for apidoc sv_setpv_mg
4029 Like C<sv_setpv>, but also handles 'set' magic.
4035 Perl_sv_setpv_mg(pTHX_ register SV *sv, register const char *ptr)
4042 =for apidoc sv_usepvn
4044 Tells an SV to use C<ptr> to find its string value. Normally the string is
4045 stored inside the SV but sv_usepvn allows the SV to use an outside string.
4046 The C<ptr> should point to memory that was allocated by C<malloc>. The
4047 string length, C<len>, must be supplied. This function will realloc the
4048 memory pointed to by C<ptr>, so that pointer should not be freed or used by
4049 the programmer after giving it to sv_usepvn. Does not handle 'set' magic.
4050 See C<sv_usepvn_mg>.
4056 Perl_sv_usepvn(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4058 SV_CHECK_THINKFIRST(sv);
4059 (void)SvUPGRADE(sv, SVt_PV);
4064 (void)SvOOK_off(sv);
4065 if (SvPVX(sv) && SvLEN(sv))
4066 Safefree(SvPVX(sv));
4067 Renew(ptr, len+1, char);
4070 SvLEN_set(sv, len+1);
4072 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4077 =for apidoc sv_usepvn_mg
4079 Like C<sv_usepvn>, but also handles 'set' magic.
4085 Perl_sv_usepvn_mg(pTHX_ register SV *sv, register char *ptr, register STRLEN len)
4087 sv_usepvn(sv,ptr,len);
4092 =for apidoc sv_force_normal_flags
4094 Undo various types of fakery on an SV: if the PV is a shared string, make
4095 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4096 an xpvmg. The C<flags> parameter gets passed to C<sv_unref_flags()>
4097 when unrefing. C<sv_force_normal> calls this function with flags set to 0.
4103 Perl_sv_force_normal_flags(pTHX_ register SV *sv, U32 flags)
4105 if (SvREADONLY(sv)) {
4107 char *pvx = SvPVX(sv);
4108 STRLEN len = SvCUR(sv);
4109 U32 hash = SvUVX(sv);
4110 SvGROW(sv, len + 1);
4111 Move(pvx,SvPVX(sv),len,char);
4115 unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
4117 else if (PL_curcop != &PL_compiling)
4118 Perl_croak(aTHX_ PL_no_modify);
4121 sv_unref_flags(sv, flags);
4122 else if (SvFAKE(sv) && SvTYPE(sv) == SVt_PVGV)
4127 =for apidoc sv_force_normal
4129 Undo various types of fakery on an SV: if the PV is a shared string, make
4130 a private copy; if we're a ref, stop refing; if we're a glob, downgrade to
4131 an xpvmg. See also C<sv_force_normal_flags>.
4137 Perl_sv_force_normal(pTHX_ register SV *sv)
4139 sv_force_normal_flags(sv, 0);
4145 Efficient removal of characters from the beginning of the string buffer.
4146 SvPOK(sv) must be true and the C<ptr> must be a pointer to somewhere inside
4147 the string buffer. The C<ptr> becomes the first character of the adjusted
4148 string. Uses the "OOK hack".
4154 Perl_sv_chop(pTHX_ register SV *sv, register char *ptr)
4156 register STRLEN delta;
4158 if (!ptr || !SvPOKp(sv))
4160 SV_CHECK_THINKFIRST(sv);
4161 if (SvTYPE(sv) < SVt_PVIV)
4162 sv_upgrade(sv,SVt_PVIV);
4165 if (!SvLEN(sv)) { /* make copy of shared string */
4166 char *pvx = SvPVX(sv);
4167 STRLEN len = SvCUR(sv);
4168 SvGROW(sv, len + 1);
4169 Move(pvx,SvPVX(sv),len,char);
4173 SvFLAGS(sv) |= SVf_OOK;
4175 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVp_IOK|SVp_NOK|SVf_IVisUV);
4176 delta = ptr - SvPVX(sv);
4184 =for apidoc sv_catpvn
4186 Concatenates the string onto the end of the string which is in the SV. The
4187 C<len> indicates number of bytes to copy. If the SV has the UTF8
4188 status set, then the bytes appended should be valid UTF8.
4189 Handles 'get' magic, but not 'set' magic. See C<sv_catpvn_mg>.
4194 /* sv_catpvn() is aliased to Perl_sv_catpvn_macro; this function provided
4195 for binary compatibility only
4198 Perl_sv_catpvn(pTHX_ SV *dsv, const char* sstr, STRLEN slen)
4200 sv_catpvn_flags(dsv, sstr, slen, SV_GMAGIC);
4204 =for apidoc sv_catpvn_flags
4206 Concatenates the string onto the end of the string which is in the SV. The
4207 C<len> indicates number of bytes to copy. If the SV has the UTF8
4208 status set, then the bytes appended should be valid UTF8.
4209 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<dsv> if
4210 appropriate, else not. C<sv_catpvn> and C<sv_catpvn_nomg> are implemented
4211 in terms of this function.
4217 Perl_sv_catpvn_flags(pTHX_ register SV *dsv, register const char *sstr, register STRLEN slen, I32 flags)
4222 dstr = SvPV_force_flags(dsv, dlen, flags);
4223 SvGROW(dsv, dlen + slen + 1);
4226 Move(sstr, SvPVX(dsv) + dlen, slen, char);
4229 (void)SvPOK_only_UTF8(dsv); /* validate pointer */
4234 =for apidoc sv_catpvn_mg
4236 Like C<sv_catpvn>, but also handles 'set' magic.
4242 Perl_sv_catpvn_mg(pTHX_ register SV *sv, register const char *ptr, register STRLEN len)
4244 sv_catpvn(sv,ptr,len);
4249 =for apidoc sv_catsv
4251 Concatenates the string from SV C<ssv> onto the end of the string in
4252 SV C<dsv>. Modifies C<dsv> but not C<ssv>. Handles 'get' magic, but
4253 not 'set' magic. See C<sv_catsv_mg>.
4257 /* sv_catsv() is aliased to Perl_sv_catsv_macro; this function provided
4258 for binary compatibility only
4261 Perl_sv_catsv(pTHX_ SV *dstr, register SV *sstr)
4263 sv_catsv_flags(dstr, sstr, SV_GMAGIC);
4267 =for apidoc sv_catsv_flags
4269 Concatenates the string from SV C<ssv> onto the end of the string in
4270 SV C<dsv>. Modifies C<dsv> but not C<ssv>. If C<flags> has C<SV_GMAGIC>
4271 bit set, will C<mg_get> on the SVs if appropriate, else not. C<sv_catsv>
4272 and C<sv_catsv_nomg> are implemented in terms of this function.
4277 Perl_sv_catsv_flags(pTHX_ SV *dsv, register SV *ssv, I32 flags)
4283 if ((spv = SvPV(ssv, slen))) {
4284 bool sutf8 = DO_UTF8(ssv);
4287 if (SvGMAGICAL(dsv) && (flags & SV_GMAGIC))
4289 dutf8 = DO_UTF8(dsv);
4291 if (dutf8 != sutf8) {
4293 /* Not modifying source SV, so taking a temporary copy. */
4294 SV* csv = sv_2mortal(newSVpvn(spv, slen));
4296 sv_utf8_upgrade(csv);
4297 spv = SvPV(csv, slen);
4300 sv_utf8_upgrade_nomg(dsv);
4302 sv_catpvn_nomg(dsv, spv, slen);
4307 =for apidoc sv_catsv_mg
4309 Like C<sv_catsv>, but also handles 'set' magic.
4315 Perl_sv_catsv_mg(pTHX_ SV *dsv, register SV *ssv)
4322 =for apidoc sv_catpv
4324 Concatenates the string onto the end of the string which is in the SV.
4325 If the SV has the UTF8 status set, then the bytes appended should be
4326 valid UTF8. Handles 'get' magic, but not 'set' magic. See C<sv_catpv_mg>.
4331 Perl_sv_catpv(pTHX_ register SV *sv, register const char *ptr)
4333 register STRLEN len;
4339 junk = SvPV_force(sv, tlen);
4341 SvGROW(sv, tlen + len + 1);
4344 Move(ptr,SvPVX(sv)+tlen,len+1,char);
4346 (void)SvPOK_only_UTF8(sv); /* validate pointer */
4351 =for apidoc sv_catpv_mg
4353 Like C<sv_catpv>, but also handles 'set' magic.
4359 Perl_sv_catpv_mg(pTHX_ register SV *sv, register const char *ptr)
4368 Create a new null SV, or if len > 0, create a new empty SVt_PV type SV
4369 with an initial PV allocation of len+1. Normally accessed via the C<NEWSV>
4376 Perl_newSV(pTHX_ STRLEN len)
4382 sv_upgrade(sv, SVt_PV);
4383 SvGROW(sv, len + 1);
4389 =for apidoc sv_magic
4391 Adds magic to an SV. First upgrades C<sv> to type C<SVt_PVMG> if necessary,
4392 then adds a new magic item of type C<how> to the head of the magic list.
4394 C<name> is assumed to contain an C<SV*> if C<(name && namelen == HEf_SVKEY)>
4400 Perl_sv_magic(pTHX_ register SV *sv, SV *obj, int how, const char *name, I32 namlen)
4404 if (SvREADONLY(sv)) {
4405 if (PL_curcop != &PL_compiling
4406 && how != PERL_MAGIC_regex_global
4407 && how != PERL_MAGIC_bm
4408 && how != PERL_MAGIC_fm
4409 && how != PERL_MAGIC_sv
4412 Perl_croak(aTHX_ PL_no_modify);
4415 if (SvMAGICAL(sv) || (how == PERL_MAGIC_taint && SvTYPE(sv) >= SVt_PVMG)) {
4416 if (SvMAGIC(sv) && (mg = mg_find(sv, how))) {
4417 if (how == PERL_MAGIC_taint)
4423 (void)SvUPGRADE(sv, SVt_PVMG);
4425 Newz(702,mg, 1, MAGIC);
4426 mg->mg_moremagic = SvMAGIC(sv);
4429 /* Some magic contains a reference loop, where the sv and object refer to
4430 each other. To avoid a reference loop that would prevent such objects
4431 being freed, we look for such loops and if we find one we avoid
4432 incrementing the object refcount. */
4433 if (!obj || obj == sv ||
4434 how == PERL_MAGIC_arylen ||
4435 how == PERL_MAGIC_qr ||
4436 (SvTYPE(obj) == SVt_PVGV &&
4437 (GvSV(obj) == sv || GvHV(obj) == (HV*)sv || GvAV(obj) == (AV*)sv ||
4438 GvCV(obj) == (CV*)sv || GvIOp(obj) == (IO*)sv ||
4439 GvFORM(obj) == (CV*)sv)))
4444 mg->mg_obj = SvREFCNT_inc(obj);
4445 mg->mg_flags |= MGf_REFCOUNTED;
4448 mg->mg_len = namlen;
4451 mg->mg_ptr = savepvn(name, namlen);
4452 else if (namlen == HEf_SVKEY)
4453 mg->mg_ptr = (char*)SvREFCNT_inc((SV*)name);
4458 mg->mg_virtual = &PL_vtbl_sv;
4460 case PERL_MAGIC_overload:
4461 mg->mg_virtual = &PL_vtbl_amagic;
4463 case PERL_MAGIC_overload_elem:
4464 mg->mg_virtual = &PL_vtbl_amagicelem;
4466 case PERL_MAGIC_overload_table:
4467 mg->mg_virtual = &PL_vtbl_ovrld;
4470 mg->mg_virtual = &PL_vtbl_bm;
4472 case PERL_MAGIC_regdata:
4473 mg->mg_virtual = &PL_vtbl_regdata;
4475 case PERL_MAGIC_regdatum:
4476 mg->mg_virtual = &PL_vtbl_regdatum;
4478 case PERL_MAGIC_env:
4479 mg->mg_virtual = &PL_vtbl_env;
4482 mg->mg_virtual = &PL_vtbl_fm;
4484 case PERL_MAGIC_envelem:
4485 mg->mg_virtual = &PL_vtbl_envelem;
4487 case PERL_MAGIC_regex_global:
4488 mg->mg_virtual = &PL_vtbl_mglob;
4490 case PERL_MAGIC_isa:
4491 mg->mg_virtual = &PL_vtbl_isa;
4493 case PERL_MAGIC_isaelem:
4494 mg->mg_virtual = &PL_vtbl_isaelem;
4496 case PERL_MAGIC_nkeys:
4497 mg->mg_virtual = &PL_vtbl_nkeys;
4499 case PERL_MAGIC_dbfile:
4503 case PERL_MAGIC_dbline:
4504 mg->mg_virtual = &PL_vtbl_dbline;
4507 case PERL_MAGIC_mutex:
4508 mg->mg_virtual = &PL_vtbl_mutex;
4510 #endif /* USE_THREADS */
4511 #ifdef USE_LOCALE_COLLATE
4512 case PERL_MAGIC_collxfrm:
4513 mg->mg_virtual = &PL_vtbl_collxfrm;
4515 #endif /* USE_LOCALE_COLLATE */
4516 case PERL_MAGIC_tied:
4517 mg->mg_virtual = &PL_vtbl_pack;
4519 case PERL_MAGIC_tiedelem:
4520 case PERL_MAGIC_tiedscalar:
4521 mg->mg_virtual = &PL_vtbl_packelem;
4524 mg->mg_virtual = &PL_vtbl_regexp;
4526 case PERL_MAGIC_sig:
4527 mg->mg_virtual = &PL_vtbl_sig;
4529 case PERL_MAGIC_sigelem:
4530 mg->mg_virtual = &PL_vtbl_sigelem;
4532 case PERL_MAGIC_taint:
4533 mg->mg_virtual = &PL_vtbl_taint;
4536 case PERL_MAGIC_uvar:
4537 mg->mg_virtual = &PL_vtbl_uvar;
4539 case PERL_MAGIC_vec:
4540 mg->mg_virtual = &PL_vtbl_vec;
4542 case PERL_MAGIC_substr:
4543 mg->mg_virtual = &PL_vtbl_substr;
4545 case PERL_MAGIC_defelem:
4546 mg->mg_virtual = &PL_vtbl_defelem;
4548 case PERL_MAGIC_glob:
4549 mg->mg_virtual = &PL_vtbl_glob;
4551 case PERL_MAGIC_arylen:
4552 mg->mg_virtual = &PL_vtbl_arylen;
4554 case PERL_MAGIC_pos:
4555 mg->mg_virtual = &PL_vtbl_pos;
4557 case PERL_MAGIC_backref:
4558 mg->mg_virtual = &PL_vtbl_backref;
4560 case PERL_MAGIC_ext:
4561 /* Reserved for use by extensions not perl internals. */
4562 /* Useful for attaching extension internal data to perl vars. */
4563 /* Note that multiple extensions may clash if magical scalars */
4564 /* etc holding private data from one are passed to another. */
4568 Perl_croak(aTHX_ "Don't know how to handle magic of type \\%o", how);
4572 SvFLAGS(sv) &= ~(SVf_IOK|SVf_NOK|SVf_POK);
4576 =for apidoc sv_unmagic
4578 Removes all magic of type C<type> from an SV.
4584 Perl_sv_unmagic(pTHX_ SV *sv, int type)
4588 if (SvTYPE(sv) < SVt_PVMG || !SvMAGIC(sv))
4591 for (mg = *mgp; mg; mg = *mgp) {
4592 if (mg->mg_type == type) {
4593 MGVTBL* vtbl = mg->mg_virtual;
4594 *mgp = mg->mg_moremagic;
4595 if (vtbl && vtbl->svt_free)
4596 CALL_FPTR(vtbl->svt_free)(aTHX_ sv, mg);
4597 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
4598 if (mg->mg_len >= 0)
4599 Safefree(mg->mg_ptr);
4600 else if (mg->mg_len == HEf_SVKEY)
4601 SvREFCNT_dec((SV*)mg->mg_ptr);
4603 if (mg->mg_flags & MGf_REFCOUNTED)
4604 SvREFCNT_dec(mg->mg_obj);
4608 mgp = &mg->mg_moremagic;
4612 SvFLAGS(sv) |= (SvFLAGS(sv) & (SVp_NOK|SVp_POK)) >> PRIVSHIFT;
4619 =for apidoc sv_rvweaken
4621 Weaken a reference: set the C<SvWEAKREF> flag on this RV; give the
4622 referred-to SV C<PERL_MAGIC_backref> magic if it hasn't already; and
4623 push a back-reference to this RV onto the array of backreferences
4624 associated with that magic.
4630 Perl_sv_rvweaken(pTHX_ SV *sv)
4633 if (!SvOK(sv)) /* let undefs pass */
4636 Perl_croak(aTHX_ "Can't weaken a nonreference");
4637 else if (SvWEAKREF(sv)) {
4638 if (ckWARN(WARN_MISC))
4639 Perl_warner(aTHX_ WARN_MISC, "Reference is already weak");
4643 sv_add_backref(tsv, sv);
4649 /* Give tsv backref magic if it hasn't already got it, then push a
4650 * back-reference to sv onto the array associated with the backref magic.
4654 S_sv_add_backref(pTHX_ SV *tsv, SV *sv)
4658 if (SvMAGICAL(tsv) && (mg = mg_find(tsv, PERL_MAGIC_backref)))
4659 av = (AV*)mg->mg_obj;
4662 sv_magic(tsv, (SV*)av, PERL_MAGIC_backref, NULL, 0);
4663 SvREFCNT_dec(av); /* for sv_magic */
4668 /* delete a back-reference to ourselves from the backref magic associated
4669 * with the SV we point to.
4673 S_sv_del_backref(pTHX_ SV *sv)
4680 if (!SvMAGICAL(tsv) || !(mg = mg_find(tsv, PERL_MAGIC_backref)))
4681 Perl_croak(aTHX_ "panic: del_backref");
4682 av = (AV *)mg->mg_obj;
4687 svp[i] = &PL_sv_undef; /* XXX */
4694 =for apidoc sv_insert
4696 Inserts a string at the specified offset/length within the SV. Similar to
4697 the Perl substr() function.
4703 Perl_sv_insert(pTHX_ SV *bigstr, STRLEN offset, STRLEN len, char *little, STRLEN littlelen)
4707 register char *midend;
4708 register char *bigend;
4714 Perl_croak(aTHX_ "Can't modify non-existent substring");
4715 SvPV_force(bigstr, curlen);
4716 (void)SvPOK_only_UTF8(bigstr);
4717 if (offset + len > curlen) {
4718 SvGROW(bigstr, offset+len+1);
4719 Zero(SvPVX(bigstr)+curlen, offset+len-curlen, char);
4720 SvCUR_set(bigstr, offset+len);
4724 i = littlelen - len;
4725 if (i > 0) { /* string might grow */
4726 big = SvGROW(bigstr, SvCUR(bigstr) + i + 1);
4727 mid = big + offset + len;
4728 midend = bigend = big + SvCUR(bigstr);
4731 while (midend > mid) /* shove everything down */
4732 *--bigend = *--midend;
4733 Move(little,big+offset,littlelen,char);
4739 Move(little,SvPVX(bigstr)+offset,len,char);
4744 big = SvPVX(bigstr);
4747 bigend = big + SvCUR(bigstr);
4749 if (midend > bigend)
4750 Perl_croak(aTHX_ "panic: sv_insert");
4752 if (mid - big > bigend - midend) { /* faster to shorten from end */
4754 Move(little, mid, littlelen,char);
4757 i = bigend - midend;
4759 Move(midend, mid, i,char);
4763 SvCUR_set(bigstr, mid - big);
4766 else if ((i = mid - big)) { /* faster from front */
4767 midend -= littlelen;
4769 sv_chop(bigstr,midend-i);
4774 Move(little, mid, littlelen,char);
4776 else if (littlelen) {
4777 midend -= littlelen;
4778 sv_chop(bigstr,midend);
4779 Move(little,midend,littlelen,char);
4782 sv_chop(bigstr,midend);
4788 =for apidoc sv_replace
4790 Make the first argument a copy of the second, then delete the original.
4791 The target SV physically takes over ownership of the body of the source SV
4792 and inherits its flags; however, the target keeps any magic it owns,
4793 and any magic in the source is discarded.
4794 Note that this is a rather specialist SV copying operation; most of the
4795 time you'll want to use C<sv_setsv> or one of its many macro front-ends.
4801 Perl_sv_replace(pTHX_ register SV *sv, register SV *nsv)
4803 U32 refcnt = SvREFCNT(sv);
4804 SV_CHECK_THINKFIRST(sv);
4805 if (SvREFCNT(nsv) != 1 && ckWARN_d(WARN_INTERNAL))
4806 Perl_warner(aTHX_ WARN_INTERNAL, "Reference miscount in sv_replace()");
4807 if (SvMAGICAL(sv)) {
4811 sv_upgrade(nsv, SVt_PVMG);
4812 SvMAGIC(nsv) = SvMAGIC(sv);
4813 SvFLAGS(nsv) |= SvMAGICAL(sv);
4819 assert(!SvREFCNT(sv));
4820 StructCopy(nsv,sv,SV);
4821 SvREFCNT(sv) = refcnt;
4822 SvFLAGS(nsv) |= SVTYPEMASK; /* Mark as freed */
4827 =for apidoc sv_clear
4829 Clear an SV: call any destructors, free up any memory used by the body,
4830 and free the body itself. The SV's head is I<not> freed, although
4831 its type is set to all 1's so that it won't inadvertently be assumed
4832 to be live during global destruction etc.
4833 This function should only be called when REFCNT is zero. Most of the time
4834 you'll want to call C<sv_free()> (or its macro wrapper C<SvREFCNT_dec>)
4841 Perl_sv_clear(pTHX_ register SV *sv)
4845 assert(SvREFCNT(sv) == 0);
4848 if (PL_defstash) { /* Still have a symbol table? */
4853 Zero(&tmpref, 1, SV);
4854 sv_upgrade(&tmpref, SVt_RV);
4856 SvREADONLY_on(&tmpref); /* DESTROY() could be naughty */
4857 SvREFCNT(&tmpref) = 1;
4860 stash = SvSTASH(sv);
4861 destructor = StashHANDLER(stash,DESTROY);
4864 PUSHSTACKi(PERLSI_DESTROY);
4865 SvRV(&tmpref) = SvREFCNT_inc(sv);
4870 call_sv((SV*)destructor, G_DISCARD|G_EVAL|G_KEEPERR);
4876 } while (SvOBJECT(sv) && SvSTASH(sv) != stash);
4878 del_XRV(SvANY(&tmpref));
4881 if (PL_in_clean_objs)
4882 Perl_croak(aTHX_ "DESTROY created new reference to dead object '%s'",
4884 /* DESTROY gave object new lease on life */
4890 SvREFCNT_dec(SvSTASH(sv)); /* possibly of changed persuasion */
4891 SvOBJECT_off(sv); /* Curse the object. */
4892 if (SvTYPE(sv) != SVt_PVIO)
4893 --PL_sv_objcount; /* XXX Might want something more general */
4896 if (SvTYPE(sv) >= SVt_PVMG) {
4899 if (SvFLAGS(sv) & SVpad_TYPED)
4900 SvREFCNT_dec(SvSTASH(sv));
4903 switch (SvTYPE(sv)) {
4906 IoIFP(sv) != PerlIO_stdin() &&
4907 IoIFP(sv) != PerlIO_stdout() &&
4908 IoIFP(sv) != PerlIO_stderr())
4910 io_close((IO*)sv, FALSE);
4912 if (IoDIRP(sv) && !(IoFLAGS(sv) & IOf_FAKE_DIRP))
4913 PerlDir_close(IoDIRP(sv));
4914 IoDIRP(sv) = (DIR*)NULL;
4915 Safefree(IoTOP_NAME(sv));
4916 Safefree(IoFMT_NAME(sv));
4917 Safefree(IoBOTTOM_NAME(sv));
4932 SvREFCNT_dec(LvTARG(sv));
4936 Safefree(GvNAME(sv));
4937 /* cannot decrease stash refcount yet, as we might recursively delete
4938 ourselves when the refcnt drops to zero. Delay SvREFCNT_dec
4939 of stash until current sv is completely gone.
4940 -- JohnPC, 27 Mar 1998 */
4941 stash = GvSTASH(sv);
4947 (void)SvOOK_off(sv);
4955 SvREFCNT_dec(SvRV(sv));
4957 else if (SvPVX(sv) && SvLEN(sv))
4958 Safefree(SvPVX(sv));
4959 else if (SvPVX(sv) && SvREADONLY(sv) && SvFAKE(sv)) {
4960 unsharepvn(SvPVX(sv),
4961 SvUTF8(sv) ? -(I32)SvCUR(sv) : SvCUR(sv),
4974 switch (SvTYPE(sv)) {
4990 del_XPVIV(SvANY(sv));
4993 del_XPVNV(SvANY(sv));
4996 del_XPVMG(SvANY(sv));
4999 del_XPVLV(SvANY(sv));
5002 del_XPVAV(SvANY(sv));
5005 del_XPVHV(SvANY(sv));
5008 del_XPVCV(SvANY(sv));
5011 del_XPVGV(SvANY(sv));
5012 /* code duplication for increased performance. */
5013 SvFLAGS(sv) &= SVf_BREAK;
5014 SvFLAGS(sv) |= SVTYPEMASK;
5015 /* decrease refcount of the stash that owns this GV, if any */
5017 SvREFCNT_dec(stash);
5018 return; /* not break, SvFLAGS reset already happened */
5020 del_XPVBM(SvANY(sv));
5023 del_XPVFM(SvANY(sv));
5026 del_XPVIO(SvANY(sv));
5029 SvFLAGS(sv) &= SVf_BREAK;
5030 SvFLAGS(sv) |= SVTYPEMASK;
5034 =for apidoc sv_newref
5036 Increment an SV's reference count. Use the C<SvREFCNT_inc()> wrapper
5043 Perl_sv_newref(pTHX_ SV *sv)
5046 ATOMIC_INC(SvREFCNT(sv));
5053 Decrement an SV's reference count, and if it drops to zero, call
5054 C<sv_clear> to invoke destructors and free up any memory used by
5055 the body; finally, deallocate the SV's head itself.
5056 Normally called via a wrapper macro C<SvREFCNT_dec>.
5062 Perl_sv_free(pTHX_ SV *sv)
5064 int refcount_is_zero;
5068 if (SvREFCNT(sv) == 0) {
5069 if (SvFLAGS(sv) & SVf_BREAK)
5070 /* this SV's refcnt has been artificially decremented to
5071 * trigger cleanup */
5073 if (PL_in_clean_all) /* All is fair */
5075 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5076 /* make sure SvREFCNT(sv)==0 happens very seldom */
5077 SvREFCNT(sv) = (~(U32)0)/2;
5080 if (ckWARN_d(WARN_INTERNAL))
5081 Perl_warner(aTHX_ WARN_INTERNAL, "Attempt to free unreferenced scalar");
5084 ATOMIC_DEC_AND_TEST(refcount_is_zero, SvREFCNT(sv));
5085 if (!refcount_is_zero)
5089 if (ckWARN_d(WARN_DEBUGGING))
5090 Perl_warner(aTHX_ WARN_DEBUGGING,
5091 "Attempt to free temp prematurely: SV 0x%"UVxf,
5096 if (SvREADONLY(sv) && SvIMMORTAL(sv)) {
5097 /* make sure SvREFCNT(sv)==0 happens very seldom */
5098 SvREFCNT(sv) = (~(U32)0)/2;
5109 Returns the length of the string in the SV. Handles magic and type
5110 coercion. See also C<SvCUR>, which gives raw access to the xpv_cur slot.
5116 Perl_sv_len(pTHX_ register SV *sv)
5124 len = mg_length(sv);
5126 (void)SvPV(sv, len);
5131 =for apidoc sv_len_utf8
5133 Returns the number of characters in the string in an SV, counting wide
5134 UTF8 bytes as a single character. Handles magic and type coercion.
5140 Perl_sv_len_utf8(pTHX_ register SV *sv)
5146 return mg_length(sv);
5150 U8 *s = (U8*)SvPV(sv, len);
5152 return Perl_utf8_length(aTHX_ s, s + len);
5157 =for apidoc sv_pos_u2b
5159 Converts the value pointed to by offsetp from a count of UTF8 chars from
5160 the start of the string, to a count of the equivalent number of bytes; if
5161 lenp is non-zero, it does the same to lenp, but this time starting from
5162 the offset, rather than from the start of the string. Handles magic and
5169 Perl_sv_pos_u2b(pTHX_ register SV *sv, I32* offsetp, I32* lenp)
5174 I32 uoffset = *offsetp;
5180 start = s = (U8*)SvPV(sv, len);
5182 while (s < send && uoffset--)
5186 *offsetp = s - start;
5190 while (s < send && ulen--)
5200 =for apidoc sv_pos_b2u
5202 Converts the value pointed to by offsetp from a count of bytes from the
5203 start of the string, to a count of the equivalent number of UTF8 chars.
5204 Handles magic and type coercion.
5210 Perl_sv_pos_b2u(pTHX_ register SV *sv, I32* offsetp)
5219 s = (U8*)SvPV(sv, len);
5221 Perl_croak(aTHX_ "panic: sv_pos_b2u: bad byte offset");
5222 send = s + *offsetp;
5226 /* Call utf8n_to_uvchr() to validate the sequence */
5227 utf8n_to_uvchr(s, UTF8SKIP(s), &n, 0);
5242 Returns a boolean indicating whether the strings in the two SVs are
5243 identical. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5244 coerce its args to strings if necessary.
5250 Perl_sv_eq(pTHX_ register SV *sv1, register SV *sv2)
5264 pv1 = SvPV(sv1, cur1);
5271 pv2 = SvPV(sv2, cur2);
5273 /* do not utf8ize the comparands as a side-effect */
5274 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5275 bool is_utf8 = TRUE;
5276 /* UTF-8ness differs */
5277 if (PL_hints & HINT_UTF8_DISTINCT)
5281 /* sv1 is the UTF-8 one , If is equal it must be downgrade-able */
5282 char *pv = (char*)bytes_from_utf8((U8*)pv1, &cur1, &is_utf8);
5287 /* sv2 is the UTF-8 one , If is equal it must be downgrade-able */
5288 char *pv = (char *)bytes_from_utf8((U8*)pv2, &cur2, &is_utf8);
5293 /* Downgrade not possible - cannot be eq */
5299 eq = memEQ(pv1, pv2, cur1);
5310 Compares the strings in two SVs. Returns -1, 0, or 1 indicating whether the
5311 string in C<sv1> is less than, equal to, or greater than the string in
5312 C<sv2>. Is UTF-8 and 'use bytes' aware, handles get magic, and will
5313 coerce its args to strings if necessary. See also C<sv_cmp_locale>.
5319 Perl_sv_cmp(pTHX_ register SV *sv1, register SV *sv2)
5324 bool pv1tmp = FALSE;
5325 bool pv2tmp = FALSE;
5332 pv1 = SvPV(sv1, cur1);
5339 pv2 = SvPV(sv2, cur2);
5341 /* do not utf8ize the comparands as a side-effect */
5342 if (cur1 && cur2 && SvUTF8(sv1) != SvUTF8(sv2) && !IN_BYTES) {
5343 if (PL_hints & HINT_UTF8_DISTINCT)
5344 return SvUTF8(sv1) ? 1 : -1;
5347 pv2 = (char*)bytes_to_utf8((U8*)pv2, &cur2);
5351 pv1 = (char*)bytes_to_utf8((U8*)pv1, &cur1);
5357 cmp = cur2 ? -1 : 0;
5361 I32 retval = memcmp((void*)pv1, (void*)pv2, cur1 < cur2 ? cur1 : cur2);
5364 cmp = retval < 0 ? -1 : 1;
5365 } else if (cur1 == cur2) {
5368 cmp = cur1 < cur2 ? -1 : 1;
5381 =for apidoc sv_cmp_locale
5383 Compares the strings in two SVs in a locale-aware manner. Is UTF-8 and
5384 'use bytes' aware, handles get magic, and will coerce its args to strings
5385 if necessary. See also C<sv_cmp_locale>. See also C<sv_cmp>.
5391 Perl_sv_cmp_locale(pTHX_ register SV *sv1, register SV *sv2)
5393 #ifdef USE_LOCALE_COLLATE
5399 if (PL_collation_standard)
5403 pv1 = sv1 ? sv_collxfrm(sv1, &len1) : (char *) NULL;
5405 pv2 = sv2 ? sv_collxfrm(sv2, &len2) : (char *) NULL;
5407 if (!pv1 || !len1) {
5418 retval = memcmp((void*)pv1, (void*)pv2, len1 < len2 ? len1 : len2);
5421 return retval < 0 ? -1 : 1;
5424 * When the result of collation is equality, that doesn't mean
5425 * that there are no differences -- some locales exclude some
5426 * characters from consideration. So to avoid false equalities,
5427 * we use the raw string as a tiebreaker.
5433 #endif /* USE_LOCALE_COLLATE */
5435 return sv_cmp(sv1, sv2);
5439 #ifdef USE_LOCALE_COLLATE
5442 =for apidoc sv_collxfrm
5444 Add Collate Transform magic to an SV if it doesn't already have it.
5446 Any scalar variable may carry PERL_MAGIC_collxfrm magic that contains the
5447 scalar data of the variable, but transformed to such a format that a normal
5448 memory comparison can be used to compare the data according to the locale
5455 Perl_sv_collxfrm(pTHX_ SV *sv, STRLEN *nxp)
5459 mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_collxfrm) : (MAGIC *) NULL;
5460 if (!mg || !mg->mg_ptr || *(U32*)mg->mg_ptr != PL_collation_ix) {
5465 Safefree(mg->mg_ptr);
5467 if ((xf = mem_collxfrm(s, len, &xlen))) {
5468 if (SvREADONLY(sv)) {
5471 return xf + sizeof(PL_collation_ix);
5474 sv_magic(sv, 0, PERL_MAGIC_collxfrm, 0, 0);
5475 mg = mg_find(sv, PERL_MAGIC_collxfrm);
5488 if (mg && mg->mg_ptr) {
5490 return mg->mg_ptr + sizeof(PL_collation_ix);
5498 #endif /* USE_LOCALE_COLLATE */
5503 Get a line from the filehandle and store it into the SV, optionally
5504 appending to the currently-stored string.
5510 Perl_sv_gets(pTHX_ register SV *sv, register PerlIO *fp, I32 append)
5514 register STDCHAR rslast;
5515 register STDCHAR *bp;
5519 SV_CHECK_THINKFIRST(sv);
5520 (void)SvUPGRADE(sv, SVt_PV);
5524 if (RsSNARF(PL_rs)) {
5528 else if (RsRECORD(PL_rs)) {
5529 I32 recsize, bytesread;
5532 /* Grab the size of the record we're getting */
5533 recsize = SvIV(SvRV(PL_rs));
5534 (void)SvPOK_only(sv); /* Validate pointer */
5535 buffer = SvGROW(sv, recsize + 1);
5538 /* VMS wants read instead of fread, because fread doesn't respect */
5539 /* RMS record boundaries. This is not necessarily a good thing to be */
5540 /* doing, but we've got no other real choice */
5541 bytesread = PerlLIO_read(PerlIO_fileno(fp), buffer, recsize);
5543 bytesread = PerlIO_read(fp, buffer, recsize);
5545 SvCUR_set(sv, bytesread);
5546 buffer[bytesread] = '\0';
5547 if (PerlIO_isutf8(fp))
5551 return(SvCUR(sv) ? SvPVX(sv) : Nullch);
5553 else if (RsPARA(PL_rs)) {
5558 /* Get $/ i.e. PL_rs into same encoding as stream wants */
5559 if (PerlIO_isutf8(fp)) {
5560 rsptr = SvPVutf8(PL_rs, rslen);
5563 if (SvUTF8(PL_rs)) {
5564 if (!sv_utf8_downgrade(PL_rs, TRUE)) {
5565 Perl_croak(aTHX_ "Wide character in $/");
5568 rsptr = SvPV(PL_rs, rslen);
5572 rslast = rslen ? rsptr[rslen - 1] : '\0';
5574 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5575 do { /* to make sure file boundaries work right */
5578 i = PerlIO_getc(fp);
5582 PerlIO_ungetc(fp,i);
5588 /* See if we know enough about I/O mechanism to cheat it ! */
5590 /* This used to be #ifdef test - it is made run-time test for ease
5591 of abstracting out stdio interface. One call should be cheap
5592 enough here - and may even be a macro allowing compile
5596 if (PerlIO_fast_gets(fp)) {
5599 * We're going to steal some values from the stdio struct
5600 * and put EVERYTHING in the innermost loop into registers.
5602 register STDCHAR *ptr;
5606 #if defined(VMS) && defined(PERLIO_IS_STDIO)
5607 /* An ungetc()d char is handled separately from the regular
5608 * buffer, so we getc() it back out and stuff it in the buffer.
5610 i = PerlIO_getc(fp);
5611 if (i == EOF) return 0;
5612 *(--((*fp)->_ptr)) = (unsigned char) i;
5616 /* Here is some breathtakingly efficient cheating */
5618 cnt = PerlIO_get_cnt(fp); /* get count into register */
5619 (void)SvPOK_only(sv); /* validate pointer */
5620 if (SvLEN(sv) - append <= cnt + 1) { /* make sure we have the room */
5621 if (cnt > 80 && SvLEN(sv) > append) {
5622 shortbuffered = cnt - SvLEN(sv) + append + 1;
5623 cnt -= shortbuffered;
5627 /* remember that cnt can be negative */
5628 SvGROW(sv, append + (cnt <= 0 ? 2 : (cnt + 1)));
5633 bp = (STDCHAR*)SvPVX(sv) + append; /* move these two too to registers */
5634 ptr = (STDCHAR*)PerlIO_get_ptr(fp);
5635 DEBUG_P(PerlIO_printf(Perl_debug_log,
5636 "Screamer: entering, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5637 DEBUG_P(PerlIO_printf(Perl_debug_log,
5638 "Screamer: entering: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5639 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5640 PTR2UV(PerlIO_has_base(fp) ? PerlIO_get_base(fp) : 0)));
5645 while (cnt > 0) { /* this | eat */
5647 if ((*bp++ = *ptr++) == rslast) /* really | dust */
5648 goto thats_all_folks; /* screams | sed :-) */
5652 Copy(ptr, bp, cnt, char); /* this | eat */
5653 bp += cnt; /* screams | dust */
5654 ptr += cnt; /* louder | sed :-) */
5659 if (shortbuffered) { /* oh well, must extend */
5660 cnt = shortbuffered;
5662 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5664 SvGROW(sv, SvLEN(sv) + append + cnt + 2);
5665 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5669 DEBUG_P(PerlIO_printf(Perl_debug_log,
5670 "Screamer: going to getc, ptr=%"UVuf", cnt=%ld\n",
5671 PTR2UV(ptr),(long)cnt));
5672 PerlIO_set_ptrcnt(fp, ptr, cnt); /* deregisterize cnt and ptr */
5673 DEBUG_P(PerlIO_printf(Perl_debug_log,
5674 "Screamer: pre: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5675 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5676 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5677 /* This used to call 'filbuf' in stdio form, but as that behaves like
5678 getc when cnt <= 0 we use PerlIO_getc here to avoid introducing
5679 another abstraction. */
5680 i = PerlIO_getc(fp); /* get more characters */
5681 DEBUG_P(PerlIO_printf(Perl_debug_log,
5682 "Screamer: post: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5683 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5684 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5685 cnt = PerlIO_get_cnt(fp);
5686 ptr = (STDCHAR*)PerlIO_get_ptr(fp); /* reregisterize cnt and ptr */
5687 DEBUG_P(PerlIO_printf(Perl_debug_log,
5688 "Screamer: after getc, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5690 if (i == EOF) /* all done for ever? */
5691 goto thats_really_all_folks;
5693 bpx = bp - (STDCHAR*)SvPVX(sv); /* box up before relocation */
5695 SvGROW(sv, bpx + cnt + 2);
5696 bp = (STDCHAR*)SvPVX(sv) + bpx; /* unbox after relocation */
5698 *bp++ = i; /* store character from PerlIO_getc */
5700 if (rslen && (STDCHAR)i == rslast) /* all done for now? */
5701 goto thats_all_folks;
5705 if ((rslen > 1 && (bp - (STDCHAR*)SvPVX(sv) < rslen)) ||
5706 memNE((char*)bp - rslen, rsptr, rslen))
5707 goto screamer; /* go back to the fray */
5708 thats_really_all_folks:
5710 cnt += shortbuffered;
5711 DEBUG_P(PerlIO_printf(Perl_debug_log,
5712 "Screamer: quitting, ptr=%"UVuf", cnt=%ld\n",PTR2UV(ptr),(long)cnt));
5713 PerlIO_set_ptrcnt(fp, ptr, cnt); /* put these back or we're in trouble */
5714 DEBUG_P(PerlIO_printf(Perl_debug_log,
5715 "Screamer: end: FILE * thinks ptr=%"UVuf", cnt=%ld, base=%"UVuf"\n",
5716 PTR2UV(PerlIO_get_ptr(fp)), (long)PerlIO_get_cnt(fp),
5717 PTR2UV(PerlIO_has_base (fp) ? PerlIO_get_base(fp) : 0)));
5719 SvCUR_set(sv, bp - (STDCHAR*)SvPVX(sv)); /* set length */
5720 DEBUG_P(PerlIO_printf(Perl_debug_log,
5721 "Screamer: done, len=%ld, string=|%.*s|\n",
5722 (long)SvCUR(sv),(int)SvCUR(sv),SvPVX(sv)));
5727 /*The big, slow, and stupid way */
5730 /* Need to work around EPOC SDK features */
5731 /* On WINS: MS VC5 generates calls to _chkstk, */
5732 /* if a `large' stack frame is allocated */
5733 /* gcc on MARM does not generate calls like these */
5739 register STDCHAR *bpe = buf + sizeof(buf);
5741 while ((i = PerlIO_getc(fp)) != EOF && (*bp++ = i) != rslast && bp < bpe)
5742 ; /* keep reading */
5746 cnt = PerlIO_read(fp,(char*)buf, sizeof(buf));
5747 /* Accomodate broken VAXC compiler, which applies U8 cast to
5748 * both args of ?: operator, causing EOF to change into 255
5750 if (cnt) { i = (U8)buf[cnt - 1]; } else { i = EOF; }
5754 sv_catpvn(sv, (char *) buf, cnt);
5756 sv_setpvn(sv, (char *) buf, cnt);
5758 if (i != EOF && /* joy */
5760 SvCUR(sv) < rslen ||
5761 memNE(SvPVX(sv) + SvCUR(sv) - rslen, rsptr, rslen)))
5765 * If we're reading from a TTY and we get a short read,
5766 * indicating that the user hit his EOF character, we need
5767 * to notice it now, because if we try to read from the TTY
5768 * again, the EOF condition will disappear.
5770 * The comparison of cnt to sizeof(buf) is an optimization
5771 * that prevents unnecessary calls to feof().
5775 if (!(cnt < sizeof(buf) && PerlIO_eof(fp)))
5780 if (RsPARA(PL_rs)) { /* have to do this both before and after */
5781 while (i != EOF) { /* to make sure file boundaries work right */
5782 i = PerlIO_getc(fp);
5784 PerlIO_ungetc(fp,i);
5790 if (PerlIO_isutf8(fp))
5795 return (SvCUR(sv) - append) ? SvPVX(sv) : Nullch;
5801 Auto-increment of the value in the SV, doing string to numeric conversion
5802 if necessary. Handles 'get' magic.
5808 Perl_sv_inc(pTHX_ register SV *sv)
5817 if (SvTHINKFIRST(sv)) {
5818 if (SvREADONLY(sv)) {
5819 if (PL_curcop != &PL_compiling)
5820 Perl_croak(aTHX_ PL_no_modify);
5824 if (SvAMAGIC(sv) && AMG_CALLun(sv,inc))
5826 i = PTR2IV(SvRV(sv));
5831 flags = SvFLAGS(sv);
5832 if ((flags & (SVp_NOK|SVp_IOK)) == SVp_NOK) {
5833 /* It's (privately or publicly) a float, but not tested as an
5834 integer, so test it to see. */
5836 flags = SvFLAGS(sv);
5838 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5839 /* It's publicly an integer, or privately an integer-not-float */
5842 if (SvUVX(sv) == UV_MAX)
5843 sv_setnv(sv, (NV)UV_MAX + 1.0);
5845 (void)SvIOK_only_UV(sv);
5848 if (SvIVX(sv) == IV_MAX)
5849 sv_setuv(sv, (UV)IV_MAX + 1);
5851 (void)SvIOK_only(sv);
5857 if (flags & SVp_NOK) {
5858 (void)SvNOK_only(sv);
5863 if (!(flags & SVp_POK) || !*SvPVX(sv)) {
5864 if ((flags & SVTYPEMASK) < SVt_PVIV)
5865 sv_upgrade(sv, SVt_IV);
5866 (void)SvIOK_only(sv);
5871 while (isALPHA(*d)) d++;
5872 while (isDIGIT(*d)) d++;
5874 #ifdef PERL_PRESERVE_IVUV
5875 /* Got to punt this an an integer if needs be, but we don't issue
5876 warnings. Probably ought to make the sv_iv_please() that does
5877 the conversion if possible, and silently. */
5878 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
5879 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
5880 /* Need to try really hard to see if it's an integer.
5881 9.22337203685478e+18 is an integer.
5882 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
5883 so $a="9.22337203685478e+18"; $a+0; $a++
5884 needs to be the same as $a="9.22337203685478e+18"; $a++
5891 /* sv_2iv *should* have made this an NV */
5892 if (flags & SVp_NOK) {
5893 (void)SvNOK_only(sv);
5897 /* I don't think we can get here. Maybe I should assert this
5898 And if we do get here I suspect that sv_setnv will croak. NWC
5900 #if defined(USE_LONG_DOUBLE)
5901 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",
5902 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5904 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_inc punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
5905 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
5908 #endif /* PERL_PRESERVE_IVUV */
5909 sv_setnv(sv,Atof(SvPVX(sv)) + 1.0);
5913 while (d >= SvPVX(sv)) {
5921 /* MKS: The original code here died if letters weren't consecutive.
5922 * at least it didn't have to worry about non-C locales. The
5923 * new code assumes that ('z'-'a')==('Z'-'A'), letters are
5924 * arranged in order (although not consecutively) and that only
5925 * [A-Za-z] are accepted by isALPHA in the C locale.
5927 if (*d != 'z' && *d != 'Z') {
5928 do { ++*d; } while (!isALPHA(*d));
5931 *(d--) -= 'z' - 'a';
5936 *(d--) -= 'z' - 'a' + 1;
5940 /* oh,oh, the number grew */
5941 SvGROW(sv, SvCUR(sv) + 2);
5943 for (d = SvPVX(sv) + SvCUR(sv); d > SvPVX(sv); d--)
5954 Auto-decrement of the value in the SV, doing string to numeric conversion
5955 if necessary. Handles 'get' magic.
5961 Perl_sv_dec(pTHX_ register SV *sv)
5969 if (SvTHINKFIRST(sv)) {
5970 if (SvREADONLY(sv)) {
5971 if (PL_curcop != &PL_compiling)
5972 Perl_croak(aTHX_ PL_no_modify);
5976 if (SvAMAGIC(sv) && AMG_CALLun(sv,dec))
5978 i = PTR2IV(SvRV(sv));
5983 /* Unlike sv_inc we don't have to worry about string-never-numbers
5984 and keeping them magic. But we mustn't warn on punting */
5985 flags = SvFLAGS(sv);
5986 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
5987 /* It's publicly an integer, or privately an integer-not-float */
5990 if (SvUVX(sv) == 0) {
5991 (void)SvIOK_only(sv);
5995 (void)SvIOK_only_UV(sv);
5999 if (SvIVX(sv) == IV_MIN)
6000 sv_setnv(sv, (NV)IV_MIN - 1.0);
6002 (void)SvIOK_only(sv);
6008 if (flags & SVp_NOK) {
6010 (void)SvNOK_only(sv);
6013 if (!(flags & SVp_POK)) {
6014 if ((flags & SVTYPEMASK) < SVt_PVNV)
6015 sv_upgrade(sv, SVt_NV);
6017 (void)SvNOK_only(sv);
6020 #ifdef PERL_PRESERVE_IVUV
6022 int numtype = grok_number(SvPVX(sv), SvCUR(sv), NULL);
6023 if (numtype && !(numtype & IS_NUMBER_INFINITY)) {
6024 /* Need to try really hard to see if it's an integer.
6025 9.22337203685478e+18 is an integer.
6026 but "9.22337203685478e+18" + 0 is UV=9223372036854779904
6027 so $a="9.22337203685478e+18"; $a+0; $a--
6028 needs to be the same as $a="9.22337203685478e+18"; $a--
6035 /* sv_2iv *should* have made this an NV */
6036 if (flags & SVp_NOK) {
6037 (void)SvNOK_only(sv);
6041 /* I don't think we can get here. Maybe I should assert this
6042 And if we do get here I suspect that sv_setnv will croak. NWC
6044 #if defined(USE_LONG_DOUBLE)
6045 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",
6046 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6048 DEBUG_c(PerlIO_printf(Perl_debug_log,"sv_dec punt failed to convert '%s' to IOK or NOKp, UV=0x%"UVxf" NV=%g\n",
6049 SvPVX(sv), SvIVX(sv), SvNVX(sv)));
6053 #endif /* PERL_PRESERVE_IVUV */
6054 sv_setnv(sv,Atof(SvPVX(sv)) - 1.0); /* punt */
6058 =for apidoc sv_mortalcopy
6060 Creates a new SV which is a copy of the original SV (using C<sv_setsv>).
6061 The new SV is marked as mortal. It will be destroyed when the current
6062 context ends. See also C<sv_newmortal> and C<sv_2mortal>.
6067 /* Make a string that will exist for the duration of the expression
6068 * evaluation. Actually, it may have to last longer than that, but
6069 * hopefully we won't free it until it has been assigned to a
6070 * permanent location. */
6073 Perl_sv_mortalcopy(pTHX_ SV *oldstr)
6078 sv_setsv(sv,oldstr);
6080 PL_tmps_stack[++PL_tmps_ix] = sv;
6086 =for apidoc sv_newmortal
6088 Creates a new null SV which is mortal. The reference count of the SV is
6089 set to 1. It will be destroyed when the current context ends. See
6090 also C<sv_mortalcopy> and C<sv_2mortal>.
6096 Perl_sv_newmortal(pTHX)
6101 SvFLAGS(sv) = SVs_TEMP;
6103 PL_tmps_stack[++PL_tmps_ix] = sv;
6108 =for apidoc sv_2mortal
6110 Marks an existing SV as mortal. The SV will be destroyed when the current
6111 context ends. See also C<sv_newmortal> and C<sv_mortalcopy>.
6117 Perl_sv_2mortal(pTHX_ register SV *sv)
6121 if (SvREADONLY(sv) && SvIMMORTAL(sv))
6124 PL_tmps_stack[++PL_tmps_ix] = sv;
6132 Creates a new SV and copies a string into it. The reference count for the
6133 SV is set to 1. If C<len> is zero, Perl will compute the length using
6134 strlen(). For efficiency, consider using C<newSVpvn> instead.
6140 Perl_newSVpv(pTHX_ const char *s, STRLEN len)
6147 sv_setpvn(sv,s,len);
6152 =for apidoc newSVpvn
6154 Creates a new SV and copies a string into it. The reference count for the
6155 SV is set to 1. Note that if C<len> is zero, Perl will create a zero length
6156 string. You are responsible for ensuring that the source string is at least
6163 Perl_newSVpvn(pTHX_ const char *s, STRLEN len)
6168 sv_setpvn(sv,s,len);
6173 =for apidoc newSVpvn_share
6175 Creates a new SV with its SvPVX pointing to a shared string in the string
6176 table. If the string does not already exist in the table, it is created
6177 first. Turns on READONLY and FAKE. The string's hash is stored in the UV
6178 slot of the SV; if the C<hash> parameter is non-zero, that value is used;
6179 otherwise the hash is computed. The idea here is that as the string table
6180 is used for shared hash keys these strings will have SvPVX == HeKEY and
6181 hash lookup will avoid string compare.
6187 Perl_newSVpvn_share(pTHX_ const char *src, I32 len, U32 hash)
6190 bool is_utf8 = FALSE;
6195 if (is_utf8 && !(PL_hints & HINT_UTF8_DISTINCT)) {
6196 STRLEN tmplen = len;
6197 /* See the note in hv.c:hv_fetch() --jhi */
6198 src = (char*)bytes_from_utf8((U8*)src, &tmplen, &is_utf8);
6202 PERL_HASH(hash, src, len);
6204 sv_upgrade(sv, SVt_PVIV);
6205 SvPVX(sv) = sharepvn(src, is_utf8?-len:len, hash);
6218 #if defined(PERL_IMPLICIT_CONTEXT)
6220 /* pTHX_ magic can't cope with varargs, so this is a no-context
6221 * version of the main function, (which may itself be aliased to us).
6222 * Don't access this version directly.
6226 Perl_newSVpvf_nocontext(const char* pat, ...)
6231 va_start(args, pat);
6232 sv = vnewSVpvf(pat, &args);
6239 =for apidoc newSVpvf
6241 Creates a new SV and initializes it with the string formatted like
6248 Perl_newSVpvf(pTHX_ const char* pat, ...)
6252 va_start(args, pat);
6253 sv = vnewSVpvf(pat, &args);
6258 /* backend for newSVpvf() and newSVpvf_nocontext() */
6261 Perl_vnewSVpvf(pTHX_ const char* pat, va_list* args)
6265 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
6272 Creates a new SV and copies a floating point value into it.
6273 The reference count for the SV is set to 1.
6279 Perl_newSVnv(pTHX_ NV n)
6291 Creates a new SV and copies an integer into it. The reference count for the
6298 Perl_newSViv(pTHX_ IV i)
6310 Creates a new SV and copies an unsigned integer into it.
6311 The reference count for the SV is set to 1.
6317 Perl_newSVuv(pTHX_ UV u)
6327 =for apidoc newRV_noinc
6329 Creates an RV wrapper for an SV. The reference count for the original
6330 SV is B<not> incremented.
6336 Perl_newRV_noinc(pTHX_ SV *tmpRef)
6341 sv_upgrade(sv, SVt_RV);
6348 /* newRV_inc is the official function name to use now.
6349 * newRV_inc is in fact #defined to newRV in sv.h
6353 Perl_newRV(pTHX_ SV *tmpRef)
6355 return newRV_noinc(SvREFCNT_inc(tmpRef));
6361 Creates a new SV which is an exact duplicate of the original SV.
6368 Perl_newSVsv(pTHX_ register SV *old)
6374 if (SvTYPE(old) == SVTYPEMASK) {
6375 if (ckWARN_d(WARN_INTERNAL))
6376 Perl_warner(aTHX_ WARN_INTERNAL, "semi-panic: attempt to dup freed string");
6391 =for apidoc sv_reset
6393 Underlying implementation for the C<reset> Perl function.
6394 Note that the perl-level function is vaguely deprecated.
6400 Perl_sv_reset(pTHX_ register char *s, HV *stash)
6408 char todo[PERL_UCHAR_MAX+1];
6413 if (!*s) { /* reset ?? searches */
6414 for (pm = HvPMROOT(stash); pm; pm = pm->op_pmnext) {
6415 pm->op_pmdynflags &= ~PMdf_USED;
6420 /* reset variables */
6422 if (!HvARRAY(stash))
6425 Zero(todo, 256, char);
6427 i = (unsigned char)*s;
6431 max = (unsigned char)*s++;
6432 for ( ; i <= max; i++) {
6435 for (i = 0; i <= (I32) HvMAX(stash); i++) {
6436 for (entry = HvARRAY(stash)[i];
6438 entry = HeNEXT(entry))
6440 if (!todo[(U8)*HeKEY(entry)])
6442 gv = (GV*)HeVAL(entry);
6444 if (SvTHINKFIRST(sv)) {
6445 if (!SvREADONLY(sv) && SvROK(sv))
6450 if (SvTYPE(sv) >= SVt_PV) {
6452 if (SvPVX(sv) != Nullch)
6459 if (GvHV(gv) && !HvNAME(GvHV(gv))) {
6461 #ifdef USE_ENVIRON_ARRAY
6463 environ[0] = Nullch;
6474 Using various gambits, try to get an IO from an SV: the IO slot if its a
6475 GV; or the recursive result if we're an RV; or the IO slot of the symbol
6476 named after the PV if we're a string.
6482 Perl_sv_2io(pTHX_ SV *sv)
6488 switch (SvTYPE(sv)) {
6496 Perl_croak(aTHX_ "Bad filehandle: %s", GvNAME(gv));
6500 Perl_croak(aTHX_ PL_no_usym, "filehandle");
6502 return sv_2io(SvRV(sv));
6503 gv = gv_fetchpv(SvPV(sv,n_a), FALSE, SVt_PVIO);
6509 Perl_croak(aTHX_ "Bad filehandle: %s", SvPV(sv,n_a));
6518 Using various gambits, try to get a CV from an SV; in addition, try if
6519 possible to set C<*st> and C<*gvp> to the stash and GV associated with it.
6525 Perl_sv_2cv(pTHX_ SV *sv, HV **st, GV **gvp, I32 lref)
6532 return *gvp = Nullgv, Nullcv;
6533 switch (SvTYPE(sv)) {
6552 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
6553 tryAMAGICunDEREF(to_cv);
6556 if (SvTYPE(sv) == SVt_PVCV) {
6565 Perl_croak(aTHX_ "Not a subroutine reference");
6570 gv = gv_fetchpv(SvPV(sv, n_a), lref, SVt_PVCV);
6576 if (lref && !GvCVu(gv)) {
6579 tmpsv = NEWSV(704,0);
6580 gv_efullname3(tmpsv, gv, Nullch);
6581 /* XXX this is probably not what they think they're getting.
6582 * It has the same effect as "sub name;", i.e. just a forward
6584 newSUB(start_subparse(FALSE, 0),
6585 newSVOP(OP_CONST, 0, tmpsv),
6590 Perl_croak(aTHX_ "Unable to create sub named \"%s\"", SvPV(sv,n_a));
6599 Returns true if the SV has a true value by Perl's rules.
6600 Use the C<SvTRUE> macro instead, which may call C<sv_true()> or may
6601 instead use an in-line version.
6607 Perl_sv_true(pTHX_ register SV *sv)
6613 if ((tXpv = (XPV*)SvANY(sv)) &&
6614 (tXpv->xpv_cur > 1 ||
6615 (tXpv->xpv_cur && *tXpv->xpv_pv != '0')))
6622 return SvIVX(sv) != 0;
6625 return SvNVX(sv) != 0.0;
6627 return sv_2bool(sv);
6635 A private implementation of the C<SvIVx> macro for compilers which can't
6636 cope with complex macro expressions. Always use the macro instead.
6642 Perl_sv_iv(pTHX_ register SV *sv)
6646 return (IV)SvUVX(sv);
6655 A private implementation of the C<SvUVx> macro for compilers which can't
6656 cope with complex macro expressions. Always use the macro instead.
6662 Perl_sv_uv(pTHX_ register SV *sv)
6667 return (UV)SvIVX(sv);
6675 A private implementation of the C<SvNVx> macro for compilers which can't
6676 cope with complex macro expressions. Always use the macro instead.
6682 Perl_sv_nv(pTHX_ register SV *sv)
6692 A private implementation of the C<SvPV_nolen> macro for compilers which can't
6693 cope with complex macro expressions. Always use the macro instead.
6699 Perl_sv_pv(pTHX_ SV *sv)
6706 return sv_2pv(sv, &n_a);
6712 A private implementation of the C<SvPV> macro for compilers which can't
6713 cope with complex macro expressions. Always use the macro instead.
6719 Perl_sv_pvn(pTHX_ SV *sv, STRLEN *lp)
6725 return sv_2pv(sv, lp);
6729 =for apidoc sv_pvn_force
6731 Get a sensible string out of the SV somehow.
6732 A private implementation of the C<SvPV_force> macro for compilers which
6733 can't cope with complex macro expressions. Always use the macro instead.
6739 Perl_sv_pvn_force(pTHX_ SV *sv, STRLEN *lp)
6741 return sv_pvn_force_flags(sv, lp, SV_GMAGIC);
6745 =for apidoc sv_pvn_force_flags
6747 Get a sensible string out of the SV somehow.
6748 If C<flags> has C<SV_GMAGIC> bit set, will C<mg_get> on C<sv> if
6749 appropriate, else not. C<sv_pvn_force> and C<sv_pvn_force_nomg> are
6750 implemented in terms of this function.
6751 You normally want to use the various wrapper macros instead: see
6752 C<SvPV_force> and C<SvPV_force_nomg>
6758 Perl_sv_pvn_force_flags(pTHX_ SV *sv, STRLEN *lp, I32 flags)
6762 if (SvTHINKFIRST(sv) && !SvROK(sv))
6763 sv_force_normal(sv);
6769 if (SvTYPE(sv) > SVt_PVLV && SvTYPE(sv) != SVt_PVFM) {
6770 Perl_croak(aTHX_ "Can't coerce %s to string in %s", sv_reftype(sv,0),
6771 PL_op_name[PL_op->op_type]);
6774 s = sv_2pv_flags(sv, lp, flags);
6775 if (s != SvPVX(sv)) { /* Almost, but not quite, sv_setpvn() */
6780 (void)SvUPGRADE(sv, SVt_PV); /* Never FALSE */
6781 SvGROW(sv, len + 1);
6782 Move(s,SvPVX(sv),len,char);
6787 SvPOK_on(sv); /* validate pointer */
6789 DEBUG_c(PerlIO_printf(Perl_debug_log, "0x%"UVxf" 2pv(%s)\n",
6790 PTR2UV(sv),SvPVX(sv)));
6797 =for apidoc sv_pvbyte
6799 A private implementation of the C<SvPVbyte_nolen> macro for compilers
6800 which can't cope with complex macro expressions. Always use the macro
6807 Perl_sv_pvbyte(pTHX_ SV *sv)
6809 sv_utf8_downgrade(sv,0);
6814 =for apidoc sv_pvbyten
6816 A private implementation of the C<SvPVbyte> macro for compilers
6817 which can't cope with complex macro expressions. Always use the macro
6824 Perl_sv_pvbyten(pTHX_ SV *sv, STRLEN *lp)
6826 sv_utf8_downgrade(sv,0);
6827 return sv_pvn(sv,lp);
6831 =for apidoc sv_pvbyten_force
6833 A private implementation of the C<SvPVbytex_force> macro for compilers
6834 which can't cope with complex macro expressions. Always use the macro
6841 Perl_sv_pvbyten_force(pTHX_ SV *sv, STRLEN *lp)
6843 sv_utf8_downgrade(sv,0);
6844 return sv_pvn_force(sv,lp);
6848 =for apidoc sv_pvutf8
6850 A private implementation of the C<SvPVutf8_nolen> macro for compilers
6851 which can't cope with complex macro expressions. Always use the macro
6858 Perl_sv_pvutf8(pTHX_ SV *sv)
6860 sv_utf8_upgrade(sv);
6865 =for apidoc sv_pvutf8n
6867 A private implementation of the C<SvPVutf8> macro for compilers
6868 which can't cope with complex macro expressions. Always use the macro
6875 Perl_sv_pvutf8n(pTHX_ SV *sv, STRLEN *lp)
6877 sv_utf8_upgrade(sv);
6878 return sv_pvn(sv,lp);
6882 =for apidoc sv_pvutf8n_force
6884 A private implementation of the C<SvPVutf8_force> macro for compilers
6885 which can't cope with complex macro expressions. Always use the macro
6892 Perl_sv_pvutf8n_force(pTHX_ SV *sv, STRLEN *lp)
6894 sv_utf8_upgrade(sv);
6895 return sv_pvn_force(sv,lp);
6899 =for apidoc sv_reftype
6901 Returns a string describing what the SV is a reference to.
6907 Perl_sv_reftype(pTHX_ SV *sv, int ob)
6909 if (ob && SvOBJECT(sv))
6910 return HvNAME(SvSTASH(sv));
6912 switch (SvTYPE(sv)) {
6926 case SVt_PVLV: return "LVALUE";
6927 case SVt_PVAV: return "ARRAY";
6928 case SVt_PVHV: return "HASH";
6929 case SVt_PVCV: return "CODE";
6930 case SVt_PVGV: return "GLOB";
6931 case SVt_PVFM: return "FORMAT";
6932 case SVt_PVIO: return "IO";
6933 default: return "UNKNOWN";
6939 =for apidoc sv_isobject
6941 Returns a boolean indicating whether the SV is an RV pointing to a blessed
6942 object. If the SV is not an RV, or if the object is not blessed, then this
6949 Perl_sv_isobject(pTHX_ SV *sv)
6966 Returns a boolean indicating whether the SV is blessed into the specified
6967 class. This does not check for subtypes; use C<sv_derived_from> to verify
6968 an inheritance relationship.
6974 Perl_sv_isa(pTHX_ SV *sv, const char *name)
6986 return strEQ(HvNAME(SvSTASH(sv)), name);
6992 Creates a new SV for the RV, C<rv>, to point to. If C<rv> is not an RV then
6993 it will be upgraded to one. If C<classname> is non-null then the new SV will
6994 be blessed in the specified package. The new SV is returned and its
6995 reference count is 1.
7001 Perl_newSVrv(pTHX_ SV *rv, const char *classname)
7007 SV_CHECK_THINKFIRST(rv);
7010 if (SvTYPE(rv) >= SVt_PVMG) {
7011 U32 refcnt = SvREFCNT(rv);
7015 SvREFCNT(rv) = refcnt;
7018 if (SvTYPE(rv) < SVt_RV)
7019 sv_upgrade(rv, SVt_RV);
7020 else if (SvTYPE(rv) > SVt_RV) {
7021 (void)SvOOK_off(rv);
7022 if (SvPVX(rv) && SvLEN(rv))
7023 Safefree(SvPVX(rv));
7033 HV* stash = gv_stashpv(classname, TRUE);
7034 (void)sv_bless(rv, stash);
7040 =for apidoc sv_setref_pv
7042 Copies a pointer into a new SV, optionally blessing the SV. The C<rv>
7043 argument will be upgraded to an RV. That RV will be modified to point to
7044 the new SV. If the C<pv> argument is NULL then C<PL_sv_undef> will be placed
7045 into the SV. The C<classname> argument indicates the package for the
7046 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7047 will be returned and will have a reference count of 1.
7049 Do not use with other Perl types such as HV, AV, SV, CV, because those
7050 objects will become corrupted by the pointer copy process.
7052 Note that C<sv_setref_pvn> copies the string while this copies the pointer.
7058 Perl_sv_setref_pv(pTHX_ SV *rv, const char *classname, void *pv)
7061 sv_setsv(rv, &PL_sv_undef);
7065 sv_setiv(newSVrv(rv,classname), PTR2IV(pv));
7070 =for apidoc sv_setref_iv
7072 Copies an integer into a new SV, optionally blessing the SV. The C<rv>
7073 argument will be upgraded to an RV. That RV will be modified to point to
7074 the new SV. The C<classname> argument indicates the package for the
7075 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7076 will be returned and will have a reference count of 1.
7082 Perl_sv_setref_iv(pTHX_ SV *rv, const char *classname, IV iv)
7084 sv_setiv(newSVrv(rv,classname), iv);
7089 =for apidoc sv_setref_uv
7091 Copies an unsigned integer into a new SV, optionally blessing the SV. The C<rv>
7092 argument will be upgraded to an RV. That RV will be modified to point to
7093 the new SV. The C<classname> argument indicates the package for the
7094 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7095 will be returned and will have a reference count of 1.
7101 Perl_sv_setref_uv(pTHX_ SV *rv, const char *classname, UV uv)
7103 sv_setuv(newSVrv(rv,classname), uv);
7108 =for apidoc sv_setref_nv
7110 Copies a double into a new SV, optionally blessing the SV. The C<rv>
7111 argument will be upgraded to an RV. That RV will be modified to point to
7112 the new SV. The C<classname> argument indicates the package for the
7113 blessing. Set C<classname> to C<Nullch> to avoid the blessing. The new SV
7114 will be returned and will have a reference count of 1.
7120 Perl_sv_setref_nv(pTHX_ SV *rv, const char *classname, NV nv)
7122 sv_setnv(newSVrv(rv,classname), nv);
7127 =for apidoc sv_setref_pvn
7129 Copies a string into a new SV, optionally blessing the SV. The length of the
7130 string must be specified with C<n>. The C<rv> argument will be upgraded to
7131 an RV. That RV will be modified to point to the new SV. The C<classname>
7132 argument indicates the package for the blessing. Set C<classname> to
7133 C<Nullch> to avoid the blessing. The new SV will be returned and will have
7134 a reference count of 1.
7136 Note that C<sv_setref_pv> copies the pointer while this copies the string.
7142 Perl_sv_setref_pvn(pTHX_ SV *rv, const char *classname, char *pv, STRLEN n)
7144 sv_setpvn(newSVrv(rv,classname), pv, n);
7149 =for apidoc sv_bless
7151 Blesses an SV into a specified package. The SV must be an RV. The package
7152 must be designated by its stash (see C<gv_stashpv()>). The reference count
7153 of the SV is unaffected.
7159 Perl_sv_bless(pTHX_ SV *sv, HV *stash)
7163 Perl_croak(aTHX_ "Can't bless non-reference value");
7165 if (SvFLAGS(tmpRef) & (SVs_OBJECT|SVf_READONLY)) {
7166 if (SvREADONLY(tmpRef))
7167 Perl_croak(aTHX_ PL_no_modify);
7168 if (SvOBJECT(tmpRef)) {
7169 if (SvTYPE(tmpRef) != SVt_PVIO)
7171 SvREFCNT_dec(SvSTASH(tmpRef));
7174 SvOBJECT_on(tmpRef);
7175 if (SvTYPE(tmpRef) != SVt_PVIO)
7177 (void)SvUPGRADE(tmpRef, SVt_PVMG);
7178 SvSTASH(tmpRef) = (HV*)SvREFCNT_inc(stash);
7188 /* Downgrades a PVGV to a PVMG.
7190 * XXX This function doesn't actually appear to be used anywhere
7195 S_sv_unglob(pTHX_ SV *sv)
7199 assert(SvTYPE(sv) == SVt_PVGV);
7204 SvREFCNT_dec(GvSTASH(sv));
7205 GvSTASH(sv) = Nullhv;
7207 sv_unmagic(sv, PERL_MAGIC_glob);
7208 Safefree(GvNAME(sv));
7211 /* need to keep SvANY(sv) in the right arena */
7212 xpvmg = new_XPVMG();
7213 StructCopy(SvANY(sv), xpvmg, XPVMG);
7214 del_XPVGV(SvANY(sv));
7217 SvFLAGS(sv) &= ~SVTYPEMASK;
7218 SvFLAGS(sv) |= SVt_PVMG;
7222 =for apidoc sv_unref_flags
7224 Unsets the RV status of the SV, and decrements the reference count of
7225 whatever was being referenced by the RV. This can almost be thought of
7226 as a reversal of C<newSVrv>. The C<cflags> argument can contain
7227 C<SV_IMMEDIATE_UNREF> to force the reference count to be decremented
7228 (otherwise the decrementing is conditional on the reference count being
7229 different from one or the reference being a readonly SV).
7236 Perl_sv_unref_flags(pTHX_ SV *sv, U32 flags)
7240 if (SvWEAKREF(sv)) {
7248 if (SvREFCNT(rv) != 1 || SvREADONLY(rv) || flags) /* SV_IMMEDIATE_UNREF */
7250 else /* XXX Hack, but hard to make $a=$a->[1] work otherwise */
7251 sv_2mortal(rv); /* Schedule for freeing later */
7255 =for apidoc sv_unref
7257 Unsets the RV status of the SV, and decrements the reference count of
7258 whatever was being referenced by the RV. This can almost be thought of
7259 as a reversal of C<newSVrv>. This is C<sv_unref_flags> with the C<flag>
7260 being zero. See C<SvROK_off>.
7266 Perl_sv_unref(pTHX_ SV *sv)
7268 sv_unref_flags(sv, 0);
7272 =for apidoc sv_taint
7274 Taint an SV. Use C<SvTAINTED_on> instead.
7279 Perl_sv_taint(pTHX_ SV *sv)
7281 sv_magic((sv), Nullsv, PERL_MAGIC_taint, Nullch, 0);
7285 =for apidoc sv_untaint
7287 Untaint an SV. Use C<SvTAINTED_off> instead.
7292 Perl_sv_untaint(pTHX_ SV *sv)
7294 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7295 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7302 =for apidoc sv_tainted
7304 Test an SV for taintedness. Use C<SvTAINTED> instead.
7309 Perl_sv_tainted(pTHX_ SV *sv)
7311 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
7312 MAGIC *mg = mg_find(sv, PERL_MAGIC_taint);
7313 if (mg && ((mg->mg_len & 1) || ((mg->mg_len & 2) && mg->mg_obj == sv)))
7320 =for apidoc sv_setpviv
7322 Copies an integer into the given SV, also updating its string value.
7323 Does not handle 'set' magic. See C<sv_setpviv_mg>.
7329 Perl_sv_setpviv(pTHX_ SV *sv, IV iv)
7331 char buf[TYPE_CHARS(UV)];
7333 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
7335 sv_setpvn(sv, ptr, ebuf - ptr);
7339 =for apidoc sv_setpviv_mg
7341 Like C<sv_setpviv>, but also handles 'set' magic.
7347 Perl_sv_setpviv_mg(pTHX_ SV *sv, IV iv)
7349 char buf[TYPE_CHARS(UV)];
7351 char *ptr = uiv_2buf(buf, iv, 0, 0, &ebuf);
7353 sv_setpvn(sv, ptr, ebuf - ptr);
7357 #if defined(PERL_IMPLICIT_CONTEXT)
7359 /* pTHX_ magic can't cope with varargs, so this is a no-context
7360 * version of the main function, (which may itself be aliased to us).
7361 * Don't access this version directly.
7365 Perl_sv_setpvf_nocontext(SV *sv, const char* pat, ...)
7369 va_start(args, pat);
7370 sv_vsetpvf(sv, pat, &args);
7374 /* pTHX_ magic can't cope with varargs, so this is a no-context
7375 * version of the main function, (which may itself be aliased to us).
7376 * Don't access this version directly.
7380 Perl_sv_setpvf_mg_nocontext(SV *sv, const char* pat, ...)
7384 va_start(args, pat);
7385 sv_vsetpvf_mg(sv, pat, &args);
7391 =for apidoc sv_setpvf
7393 Processes its arguments like C<sprintf> and sets an SV to the formatted
7394 output. Does not handle 'set' magic. See C<sv_setpvf_mg>.
7400 Perl_sv_setpvf(pTHX_ SV *sv, const char* pat, ...)
7403 va_start(args, pat);
7404 sv_vsetpvf(sv, pat, &args);
7408 /* backend for C<sv_setpvf> and C<sv_setpvf_nocontext> */
7411 Perl_sv_vsetpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7413 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7417 =for apidoc sv_setpvf_mg
7419 Like C<sv_setpvf>, but also handles 'set' magic.
7425 Perl_sv_setpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7428 va_start(args, pat);
7429 sv_vsetpvf_mg(sv, pat, &args);
7433 /* backend for C<sv_setpvf_mg> C<setpvf_mg_nocontext> */
7436 Perl_sv_vsetpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7438 sv_vsetpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7442 #if defined(PERL_IMPLICIT_CONTEXT)
7444 /* pTHX_ magic can't cope with varargs, so this is a no-context
7445 * version of the main function, (which may itself be aliased to us).
7446 * Don't access this version directly.
7450 Perl_sv_catpvf_nocontext(SV *sv, const char* pat, ...)
7454 va_start(args, pat);
7455 sv_vcatpvf(sv, pat, &args);
7459 /* pTHX_ magic can't cope with varargs, so this is a no-context
7460 * version of the main function, (which may itself be aliased to us).
7461 * Don't access this version directly.
7465 Perl_sv_catpvf_mg_nocontext(SV *sv, const char* pat, ...)
7469 va_start(args, pat);
7470 sv_vcatpvf_mg(sv, pat, &args);
7476 =for apidoc sv_catpvf
7478 Processes its arguments like C<sprintf> and appends the formatted
7479 output to an SV. If the appended data contains "wide" characters
7480 (including, but not limited to, SVs with a UTF-8 PV formatted with %s,
7481 and characters >255 formatted with %c), the original SV might get
7482 upgraded to UTF-8. Handles 'get' magic, but not 'set' magic.
7483 C<SvSETMAGIC()> must typically be called after calling this function
7484 to handle 'set' magic.
7489 Perl_sv_catpvf(pTHX_ SV *sv, const char* pat, ...)
7492 va_start(args, pat);
7493 sv_vcatpvf(sv, pat, &args);
7497 /* backend for C<sv_catpvf> and C<catpvf_mg_nocontext> */
7500 Perl_sv_vcatpvf(pTHX_ SV *sv, const char* pat, va_list* args)
7502 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7506 =for apidoc sv_catpvf_mg
7508 Like C<sv_catpvf>, but also handles 'set' magic.
7514 Perl_sv_catpvf_mg(pTHX_ SV *sv, const char* pat, ...)
7517 va_start(args, pat);
7518 sv_vcatpvf_mg(sv, pat, &args);
7522 /* backend for C<catpvf_mg> and C<catpvf_mg_nocontext> */
7525 Perl_sv_vcatpvf_mg(pTHX_ SV *sv, const char* pat, va_list* args)
7527 sv_vcatpvfn(sv, pat, strlen(pat), args, Null(SV**), 0, Null(bool*));
7532 =for apidoc sv_vsetpvfn
7534 Works like C<vcatpvfn> but copies the text into the SV instead of
7537 Usually used via one of its frontends C<sv_setpvf> and C<sv_setpvf_mg>.
7543 Perl_sv_vsetpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7545 sv_setpvn(sv, "", 0);
7546 sv_vcatpvfn(sv, pat, patlen, args, svargs, svmax, maybe_tainted);
7549 /* private function for use in sv_vcatpvfn via the EXPECT_NUMBER macro */
7552 S_expect_number(pTHX_ char** pattern)
7555 switch (**pattern) {
7556 case '1': case '2': case '3':
7557 case '4': case '5': case '6':
7558 case '7': case '8': case '9':
7559 while (isDIGIT(**pattern))
7560 var = var * 10 + (*(*pattern)++ - '0');
7564 #define EXPECT_NUMBER(pattern, var) (var = S_expect_number(aTHX_ &pattern))
7567 =for apidoc sv_vcatpvfn
7569 Processes its arguments like C<vsprintf> and appends the formatted output
7570 to an SV. Uses an array of SVs if the C style variable argument list is
7571 missing (NULL). When running with taint checks enabled, indicates via
7572 C<maybe_tainted> if results are untrustworthy (often due to the use of
7575 Usually used via one of its frontends C<sv_catpvf> and C<sv_catpvf_mg>.
7581 Perl_sv_vcatpvfn(pTHX_ SV *sv, const char *pat, STRLEN patlen, va_list *args, SV **svargs, I32 svmax, bool *maybe_tainted)
7588 static char nullstr[] = "(null)";
7591 /* no matter what, this is a string now */
7592 (void)SvPV_force(sv, origlen);
7594 /* special-case "", "%s", and "%_" */
7597 if (patlen == 2 && pat[0] == '%') {
7601 char *s = va_arg(*args, char*);
7602 sv_catpv(sv, s ? s : nullstr);
7604 else if (svix < svmax) {
7605 sv_catsv(sv, *svargs);
7606 if (DO_UTF8(*svargs))
7612 argsv = va_arg(*args, SV*);
7613 sv_catsv(sv, argsv);
7618 /* See comment on '_' below */
7623 patend = (char*)pat + patlen;
7624 for (p = (char*)pat; p < patend; p = q) {
7627 bool vectorize = FALSE;
7628 bool vectorarg = FALSE;
7629 bool vec_utf = FALSE;
7635 bool has_precis = FALSE;
7637 bool is_utf = FALSE;
7640 U8 utf8buf[UTF8_MAXLEN+1];
7641 STRLEN esignlen = 0;
7643 char *eptr = Nullch;
7645 /* Times 4: a decimal digit takes more than 3 binary digits.
7646 * NV_DIG: mantissa takes than many decimal digits.
7647 * Plus 32: Playing safe. */
7648 char ebuf[IV_DIG * 4 + NV_DIG + 32];
7649 /* large enough for "%#.#f" --chip */
7650 /* what about long double NVs? --jhi */
7653 U8 *vecstr = Null(U8*);
7665 STRLEN dotstrlen = 1;
7666 I32 efix = 0; /* explicit format parameter index */
7667 I32 ewix = 0; /* explicit width index */
7668 I32 epix = 0; /* explicit precision index */
7669 I32 evix = 0; /* explicit vector index */
7670 bool asterisk = FALSE;
7672 /* echo everything up to the next format specification */
7673 for (q = p; q < patend && *q != '%'; ++q) ;
7675 sv_catpvn(sv, p, q - p);
7682 We allow format specification elements in this order:
7683 \d+\$ explicit format parameter index
7685 \*?(\d+\$)?v vector with optional (optionally specified) arg
7686 \d+|\*(\d+\$)? width using optional (optionally specified) arg
7687 \.(\d*|\*(\d+\$)?) precision using optional (optionally specified) arg
7689 [%bcdefginopsux_DFOUX] format (mandatory)
7691 if (EXPECT_NUMBER(q, width)) {
7732 if (EXPECT_NUMBER(q, ewix))
7741 if ((vectorarg = asterisk)) {
7751 EXPECT_NUMBER(q, width);
7756 vecsv = va_arg(*args, SV*);
7758 vecsv = (evix ? evix <= svmax : svix < svmax) ?
7759 svargs[ewix ? ewix-1 : svix++] : &PL_sv_undef;
7760 dotstr = SvPVx(vecsv, dotstrlen);
7765 vecsv = va_arg(*args, SV*);
7766 vecstr = (U8*)SvPVx(vecsv,veclen);
7767 vec_utf = DO_UTF8(vecsv);
7769 else if (efix ? efix <= svmax : svix < svmax) {
7770 vecsv = svargs[efix ? efix-1 : svix++];
7771 vecstr = (U8*)SvPVx(vecsv,veclen);
7772 vec_utf = DO_UTF8(vecsv);
7782 i = va_arg(*args, int);
7784 i = (ewix ? ewix <= svmax : svix < svmax) ?
7785 SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
7787 width = (i < 0) ? -i : i;
7797 if (EXPECT_NUMBER(q, epix) && *q++ != '$') /* epix currently unused */
7800 i = va_arg(*args, int);
7802 i = (ewix ? ewix <= svmax : svix < svmax)
7803 ? SvIVx(svargs[ewix ? ewix-1 : svix++]) : 0;
7804 precis = (i < 0) ? 0 : i;
7809 precis = precis * 10 + (*q++ - '0');
7817 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
7828 #if defined(HAS_QUAD) || (defined(HAS_LONG_DOUBLE) && defined(USE_LONG_DOUBLE))
7829 if (*(q + 1) == 'l') { /* lld, llf */
7852 argsv = (efix ? efix <= svmax : svix < svmax) ?
7853 svargs[efix ? efix-1 : svix++] : &PL_sv_undef;
7860 uv = args ? va_arg(*args, int) : SvIVx(argsv);
7862 (!UNI_IS_INVARIANT(uv) && SvUTF8(sv)))
7864 eptr = (char*)utf8buf;
7865 elen = uvchr_to_utf8((U8*)eptr, uv) - utf8buf;
7877 eptr = va_arg(*args, char*);
7879 #ifdef MACOS_TRADITIONAL
7880 /* On MacOS, %#s format is used for Pascal strings */
7885 elen = strlen(eptr);
7888 elen = sizeof nullstr - 1;
7892 eptr = SvPVx(argsv, elen);
7893 if (DO_UTF8(argsv)) {
7894 if (has_precis && precis < elen) {
7896 sv_pos_u2b(argsv, &p, 0); /* sticks at end */
7899 if (width) { /* fudge width (can't fudge elen) */
7900 width += elen - sv_len_utf8(argsv);
7909 * The "%_" hack might have to be changed someday,
7910 * if ISO or ANSI decide to use '_' for something.
7911 * So we keep it hidden from users' code.
7915 argsv = va_arg(*args, SV*);
7916 eptr = SvPVx(argsv, elen);
7922 if (has_precis && elen > precis)
7931 uv = PTR2UV(args ? va_arg(*args, void*) : argsv);
7949 iv = (IV)utf8n_to_uvchr(vecstr, veclen, &ulen, 0);
7959 case 'h': iv = (short)va_arg(*args, int); break;
7960 default: iv = va_arg(*args, int); break;
7961 case 'l': iv = va_arg(*args, long); break;
7962 case 'V': iv = va_arg(*args, IV); break;
7964 case 'q': iv = va_arg(*args, Quad_t); break;
7971 case 'h': iv = (short)iv; break;
7973 case 'l': iv = (long)iv; break;
7976 case 'q': iv = (Quad_t)iv; break;
7983 esignbuf[esignlen++] = plus;
7987 esignbuf[esignlen++] = '-';
8029 uv = utf8n_to_uvchr(vecstr, veclen, &ulen, 0);
8039 case 'h': uv = (unsigned short)va_arg(*args, unsigned); break;
8040 default: uv = va_arg(*args, unsigned); break;
8041 case 'l': uv = va_arg(*args, unsigned long); break;
8042 case 'V': uv = va_arg(*args, UV); break;
8044 case 'q': uv = va_arg(*args, Quad_t); break;
8051 case 'h': uv = (unsigned short)uv; break;
8053 case 'l': uv = (unsigned long)uv; break;
8056 case 'q': uv = (Quad_t)uv; break;
8062 eptr = ebuf + sizeof ebuf;
8068 p = (char*)((c == 'X')
8069 ? "0123456789ABCDEF" : "0123456789abcdef");
8075 esignbuf[esignlen++] = '0';
8076 esignbuf[esignlen++] = c; /* 'x' or 'X' */
8082 *--eptr = '0' + dig;
8084 if (alt && *eptr != '0')
8090 *--eptr = '0' + dig;
8093 esignbuf[esignlen++] = '0';
8094 esignbuf[esignlen++] = 'b';
8097 default: /* it had better be ten or less */
8098 #if defined(PERL_Y2KWARN)
8099 if (ckWARN(WARN_Y2K)) {
8101 char *s = SvPV(sv,n);
8102 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
8103 && (n == 2 || !isDIGIT(s[n-3])))
8105 Perl_warner(aTHX_ WARN_Y2K,
8106 "Possible Y2K bug: %%%c %s",
8107 c, "format string following '19'");
8113 *--eptr = '0' + dig;
8114 } while (uv /= base);
8117 elen = (ebuf + sizeof ebuf) - eptr;
8120 zeros = precis - elen;
8121 else if (precis == 0 && elen == 1 && *eptr == '0')
8126 /* FLOATING POINT */
8129 c = 'f'; /* maybe %F isn't supported here */
8135 /* This is evil, but floating point is even more evil */
8138 nv = args ? va_arg(*args, NV) : SvNVx(argsv);
8141 if (c != 'e' && c != 'E') {
8143 (void)Perl_frexp(nv, &i);
8144 if (i == PERL_INT_MIN)
8145 Perl_die(aTHX_ "panic: frexp");
8147 need = BIT_DIGITS(i);
8149 need += has_precis ? precis : 6; /* known default */
8153 need += 20; /* fudge factor */
8154 if (PL_efloatsize < need) {
8155 Safefree(PL_efloatbuf);
8156 PL_efloatsize = need + 20; /* more fudge */
8157 New(906, PL_efloatbuf, PL_efloatsize, char);
8158 PL_efloatbuf[0] = '\0';
8161 eptr = ebuf + sizeof ebuf;
8164 #if defined(USE_LONG_DOUBLE) && defined(PERL_PRIfldbl)
8166 /* Copy the one or more characters in a long double
8167 * format before the 'base' ([efgEFG]) character to
8168 * the format string. */
8169 static char const prifldbl[] = PERL_PRIfldbl;
8170 char const *p = prifldbl + sizeof(prifldbl) - 3;
8171 while (p >= prifldbl) { *--eptr = *p--; }
8176 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8181 do { *--eptr = '0' + (base % 10); } while (base /= 10);
8193 /* No taint. Otherwise we are in the strange situation
8194 * where printf() taints but print($float) doesn't.
8196 (void)sprintf(PL_efloatbuf, eptr, nv);
8198 eptr = PL_efloatbuf;
8199 elen = strlen(PL_efloatbuf);
8206 i = SvCUR(sv) - origlen;
8209 case 'h': *(va_arg(*args, short*)) = i; break;
8210 default: *(va_arg(*args, int*)) = i; break;
8211 case 'l': *(va_arg(*args, long*)) = i; break;
8212 case 'V': *(va_arg(*args, IV*)) = i; break;
8214 case 'q': *(va_arg(*args, Quad_t*)) = i; break;
8219 sv_setuv_mg(argsv, (UV)i);
8220 continue; /* not "break" */
8227 if (!args && ckWARN(WARN_PRINTF) &&
8228 (PL_op->op_type == OP_PRTF || PL_op->op_type == OP_SPRINTF)) {
8229 SV *msg = sv_newmortal();
8230 Perl_sv_setpvf(aTHX_ msg, "Invalid conversion in %s: ",
8231 (PL_op->op_type == OP_PRTF) ? "printf" : "sprintf");
8234 Perl_sv_catpvf(aTHX_ msg,
8235 "\"%%%c\"", c & 0xFF);
8237 Perl_sv_catpvf(aTHX_ msg,
8238 "\"%%\\%03"UVof"\"",
8241 sv_catpv(msg, "end of string");
8242 Perl_warner(aTHX_ WARN_PRINTF, "%"SVf, msg); /* yes, this is reentrant */
8245 /* output mangled stuff ... */
8251 /* ... right here, because formatting flags should not apply */
8252 SvGROW(sv, SvCUR(sv) + elen + 1);
8254 Copy(eptr, p, elen, char);
8257 SvCUR(sv) = p - SvPVX(sv);
8258 continue; /* not "break" */
8261 have = esignlen + zeros + elen;
8262 need = (have > width ? have : width);
8265 SvGROW(sv, SvCUR(sv) + need + dotstrlen + 1);
8267 if (esignlen && fill == '0') {
8268 for (i = 0; i < esignlen; i++)
8272 memset(p, fill, gap);
8275 if (esignlen && fill != '0') {
8276 for (i = 0; i < esignlen; i++)
8280 for (i = zeros; i; i--)
8284 Copy(eptr, p, elen, char);
8288 memset(p, ' ', gap);
8293 Copy(dotstr, p, dotstrlen, char);
8297 vectorize = FALSE; /* done iterating over vecstr */
8302 SvCUR(sv) = p - SvPVX(sv);
8310 /* =========================================================================
8312 =head1 Cloning an interpreter
8314 All the macros and functions in this section are for the private use of
8315 the main function, perl_clone().
8317 The foo_dup() functions make an exact copy of an existing foo thinngy.
8318 During the course of a cloning, a hash table is used to map old addresses
8319 to new addresses. The table is created and manipulated with the
8320 ptr_table_* functions.
8324 ============================================================================*/
8327 #if defined(USE_ITHREADS)
8329 #if defined(USE_THREADS)
8330 # include "error: USE_THREADS and USE_ITHREADS are incompatible"
8333 #ifndef GpREFCNT_inc
8334 # define GpREFCNT_inc(gp) ((gp) ? (++(gp)->gp_refcnt, (gp)) : (GP*)NULL)
8338 #define sv_dup_inc(s,t) SvREFCNT_inc(sv_dup(s,t))
8339 #define av_dup(s,t) (AV*)sv_dup((SV*)s,t)
8340 #define av_dup_inc(s,t) (AV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8341 #define hv_dup(s,t) (HV*)sv_dup((SV*)s,t)
8342 #define hv_dup_inc(s,t) (HV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8343 #define cv_dup(s,t) (CV*)sv_dup((SV*)s,t)
8344 #define cv_dup_inc(s,t) (CV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8345 #define io_dup(s,t) (IO*)sv_dup((SV*)s,t)
8346 #define io_dup_inc(s,t) (IO*)SvREFCNT_inc(sv_dup((SV*)s,t))
8347 #define gv_dup(s,t) (GV*)sv_dup((SV*)s,t)
8348 #define gv_dup_inc(s,t) (GV*)SvREFCNT_inc(sv_dup((SV*)s,t))
8349 #define SAVEPV(p) (p ? savepv(p) : Nullch)
8350 #define SAVEPVN(p,n) (p ? savepvn(p,n) : Nullch)
8353 /* Duplicate a regexp. Required reading: pregcomp() and pregfree() in
8354 regcomp.c. AMS 20010712 */
8357 Perl_re_dup(pTHX_ REGEXP *r, clone_params *param)
8361 struct reg_substr_datum *s;
8364 return (REGEXP *)NULL;
8366 if ((ret = (REGEXP *)ptr_table_fetch(PL_ptr_table, r)))
8369 len = r->offsets[0];
8370 npar = r->nparens+1;
8372 Newc(0, ret, sizeof(regexp) + (len+1)*sizeof(regnode), char, regexp);
8373 Copy(r->program, ret->program, len+1, regnode);
8375 New(0, ret->startp, npar, I32);
8376 Copy(r->startp, ret->startp, npar, I32);
8377 New(0, ret->endp, npar, I32);
8378 Copy(r->startp, ret->startp, npar, I32);
8380 if (r->regstclass) {
8381 New(0, ret->regstclass, 1, regnode);
8382 ret->regstclass->flags = r->regstclass->flags;
8385 ret->regstclass = NULL;
8387 New(0, ret->substrs, 1, struct reg_substr_data);
8388 for (s = ret->substrs->data, i = 0; i < 3; i++, s++) {
8389 s->min_offset = r->substrs->data[i].min_offset;
8390 s->max_offset = r->substrs->data[i].max_offset;
8391 s->substr = sv_dup_inc(r->substrs->data[i].substr, param);
8396 int count = r->data->count;
8398 Newc(0, d, sizeof(struct reg_data) + count*sizeof(void *),
8399 char, struct reg_data);
8400 New(0, d->what, count, U8);
8403 for (i = 0; i < count; i++) {
8404 d->what[i] = r->data->what[i];
8405 switch (d->what[i]) {
8407 d->data[i] = sv_dup_inc((SV *)r->data->data[i], param);
8410 d->data[i] = av_dup_inc((AV *)r->data->data[i], param);
8413 /* This is cheating. */
8414 New(0, d->data[i], 1, struct regnode_charclass_class);
8415 StructCopy(r->data->data[i], d->data[i],
8416 struct regnode_charclass_class);
8420 d->data[i] = r->data->data[i];
8430 New(0, ret->offsets, 2*len+1, U32);
8431 Copy(r->offsets, ret->offsets, 2*len+1, U32);
8433 ret->precomp = SAVEPV(r->precomp);
8434 ret->subbeg = SAVEPV(r->subbeg);
8435 ret->sublen = r->sublen;
8436 ret->refcnt = r->refcnt;
8437 ret->minlen = r->minlen;
8438 ret->prelen = r->prelen;
8439 ret->nparens = r->nparens;
8440 ret->lastparen = r->lastparen;
8441 ret->lastcloseparen = r->lastcloseparen;
8442 ret->reganch = r->reganch;
8444 ptr_table_store(PL_ptr_table, r, ret);
8448 /* duplicate a file handle */
8451 Perl_fp_dup(pTHX_ PerlIO *fp, char type)
8455 return (PerlIO*)NULL;
8457 /* look for it in the table first */
8458 ret = (PerlIO*)ptr_table_fetch(PL_ptr_table, fp);
8462 /* create anew and remember what it is */
8463 ret = PerlIO_fdupopen(aTHX_ fp);
8464 ptr_table_store(PL_ptr_table, fp, ret);
8468 /* duplicate a directory handle */
8471 Perl_dirp_dup(pTHX_ DIR *dp)
8479 /* duplicate a typeglob */
8482 Perl_gp_dup(pTHX_ GP *gp, clone_params* param)
8487 /* look for it in the table first */
8488 ret = (GP*)ptr_table_fetch(PL_ptr_table, gp);
8492 /* create anew and remember what it is */
8493 Newz(0, ret, 1, GP);
8494 ptr_table_store(PL_ptr_table, gp, ret);
8497 ret->gp_refcnt = 0; /* must be before any other dups! */
8498 ret->gp_sv = sv_dup_inc(gp->gp_sv, param);
8499 ret->gp_io = io_dup_inc(gp->gp_io, param);
8500 ret->gp_form = cv_dup_inc(gp->gp_form, param);
8501 ret->gp_av = av_dup_inc(gp->gp_av, param);
8502 ret->gp_hv = hv_dup_inc(gp->gp_hv, param);
8503 ret->gp_egv = gv_dup(gp->gp_egv, param);/* GvEGV is not refcounted */
8504 ret->gp_cv = cv_dup_inc(gp->gp_cv, param);
8505 ret->gp_cvgen = gp->gp_cvgen;
8506 ret->gp_flags = gp->gp_flags;
8507 ret->gp_line = gp->gp_line;
8508 ret->gp_file = gp->gp_file; /* points to COP.cop_file */
8512 /* duplicate a chain of magic */
8515 Perl_mg_dup(pTHX_ MAGIC *mg, clone_params* param)
8517 MAGIC *mgprev = (MAGIC*)NULL;
8520 return (MAGIC*)NULL;
8521 /* look for it in the table first */
8522 mgret = (MAGIC*)ptr_table_fetch(PL_ptr_table, mg);
8526 for (; mg; mg = mg->mg_moremagic) {
8528 Newz(0, nmg, 1, MAGIC);
8530 mgprev->mg_moremagic = nmg;
8533 nmg->mg_virtual = mg->mg_virtual; /* XXX copy dynamic vtable? */
8534 nmg->mg_private = mg->mg_private;
8535 nmg->mg_type = mg->mg_type;
8536 nmg->mg_flags = mg->mg_flags;
8537 if (mg->mg_type == PERL_MAGIC_qr) {
8538 nmg->mg_obj = (SV*)re_dup((REGEXP*)mg->mg_obj, param);
8540 else if(mg->mg_type == PERL_MAGIC_backref) {
8541 AV *av = (AV*) mg->mg_obj;
8544 nmg->mg_obj = (SV*)newAV();
8548 av_push((AV*)nmg->mg_obj,sv_dup(svp[i],param));
8553 nmg->mg_obj = (mg->mg_flags & MGf_REFCOUNTED)
8554 ? sv_dup_inc(mg->mg_obj, param)
8555 : sv_dup(mg->mg_obj, param);
8557 nmg->mg_len = mg->mg_len;
8558 nmg->mg_ptr = mg->mg_ptr; /* XXX random ptr? */
8559 if (mg->mg_ptr && mg->mg_type != PERL_MAGIC_regex_global) {
8560 if (mg->mg_len >= 0) {
8561 nmg->mg_ptr = SAVEPVN(mg->mg_ptr, mg->mg_len);
8562 if (mg->mg_type == PERL_MAGIC_overload_table &&
8563 AMT_AMAGIC((AMT*)mg->mg_ptr))
8565 AMT *amtp = (AMT*)mg->mg_ptr;
8566 AMT *namtp = (AMT*)nmg->mg_ptr;
8568 for (i = 1; i < NofAMmeth; i++) {
8569 namtp->table[i] = cv_dup_inc(amtp->table[i], param);
8573 else if (mg->mg_len == HEf_SVKEY)
8574 nmg->mg_ptr = (char*)sv_dup_inc((SV*)mg->mg_ptr, param);
8581 /* create a new pointer-mapping table */
8584 Perl_ptr_table_new(pTHX)
8587 Newz(0, tbl, 1, PTR_TBL_t);
8590 Newz(0, tbl->tbl_ary, tbl->tbl_max + 1, PTR_TBL_ENT_t*);
8594 /* map an existing pointer using a table */
8597 Perl_ptr_table_fetch(pTHX_ PTR_TBL_t *tbl, void *sv)
8599 PTR_TBL_ENT_t *tblent;
8600 UV hash = PTR2UV(sv);
8602 tblent = tbl->tbl_ary[hash & tbl->tbl_max];
8603 for (; tblent; tblent = tblent->next) {
8604 if (tblent->oldval == sv)
8605 return tblent->newval;
8610 /* add a new entry to a pointer-mapping table */
8613 Perl_ptr_table_store(pTHX_ PTR_TBL_t *tbl, void *oldv, void *newv)
8615 PTR_TBL_ENT_t *tblent, **otblent;
8616 /* XXX this may be pessimal on platforms where pointers aren't good
8617 * hash values e.g. if they grow faster in the most significant
8619 UV hash = PTR2UV(oldv);
8623 otblent = &tbl->tbl_ary[hash & tbl->tbl_max];
8624 for (tblent = *otblent; tblent; i=0, tblent = tblent->next) {
8625 if (tblent->oldval == oldv) {
8626 tblent->newval = newv;
8631 Newz(0, tblent, 1, PTR_TBL_ENT_t);
8632 tblent->oldval = oldv;
8633 tblent->newval = newv;
8634 tblent->next = *otblent;
8637 if (i && tbl->tbl_items > tbl->tbl_max)
8638 ptr_table_split(tbl);
8641 /* double the hash bucket size of an existing ptr table */
8644 Perl_ptr_table_split(pTHX_ PTR_TBL_t *tbl)
8646 PTR_TBL_ENT_t **ary = tbl->tbl_ary;
8647 UV oldsize = tbl->tbl_max + 1;
8648 UV newsize = oldsize * 2;
8651 Renew(ary, newsize, PTR_TBL_ENT_t*);
8652 Zero(&ary[oldsize], newsize-oldsize, PTR_TBL_ENT_t*);
8653 tbl->tbl_max = --newsize;
8655 for (i=0; i < oldsize; i++, ary++) {
8656 PTR_TBL_ENT_t **curentp, **entp, *ent;
8659 curentp = ary + oldsize;
8660 for (entp = ary, ent = *ary; ent; ent = *entp) {
8661 if ((newsize & PTR2UV(ent->oldval)) != i) {
8663 ent->next = *curentp;
8673 /* remove all the entries from a ptr table */
8676 Perl_ptr_table_clear(pTHX_ PTR_TBL_t *tbl)
8678 register PTR_TBL_ENT_t **array;
8679 register PTR_TBL_ENT_t *entry;
8680 register PTR_TBL_ENT_t *oentry = Null(PTR_TBL_ENT_t*);
8684 if (!tbl || !tbl->tbl_items) {
8688 array = tbl->tbl_ary;
8695 entry = entry->next;
8699 if (++riter > max) {
8702 entry = array[riter];
8709 /* clear and free a ptr table */
8712 Perl_ptr_table_free(pTHX_ PTR_TBL_t *tbl)
8717 ptr_table_clear(tbl);
8718 Safefree(tbl->tbl_ary);
8726 /* attempt to make everything in the typeglob readonly */
8729 S_gv_share(pTHX_ SV *sstr)
8732 SV *sv = &PL_sv_no; /* just need SvREADONLY-ness */
8734 if (GvIO(gv) || GvFORM(gv)) {
8735 GvUNIQUE_off(gv); /* GvIOs cannot be shared. nor can GvFORMs */
8737 else if (!GvCV(gv)) {
8741 /* CvPADLISTs cannot be shared */
8742 if (!CvXSUB(GvCV(gv))) {
8747 if (!GvUNIQUE(gv)) {
8749 PerlIO_printf(Perl_debug_log, "gv_share: unable to share %s::%s\n",
8750 HvNAME(GvSTASH(gv)), GvNAME(gv));
8756 * write attempts will die with
8757 * "Modification of a read-only value attempted"
8763 SvREADONLY_on(GvSV(gv));
8770 SvREADONLY_on(GvAV(gv));
8777 SvREADONLY_on(GvAV(gv));
8780 return sstr; /* he_dup() will SvREFCNT_inc() */
8783 /* duplicate an SV of any type (including AV, HV etc) */
8786 Perl_sv_dup(pTHX_ SV *sstr, clone_params* param)
8790 if (!sstr || SvTYPE(sstr) == SVTYPEMASK)
8792 /* look for it in the table first */
8793 dstr = (SV*)ptr_table_fetch(PL_ptr_table, sstr);
8797 /* create anew and remember what it is */
8799 ptr_table_store(PL_ptr_table, sstr, dstr);
8802 SvFLAGS(dstr) = SvFLAGS(sstr);
8803 SvFLAGS(dstr) &= ~SVf_OOK; /* don't propagate OOK hack */
8804 SvREFCNT(dstr) = 0; /* must be before any other dups! */
8807 if (SvANY(sstr) && PL_watch_pvx && SvPVX(sstr) == PL_watch_pvx)
8808 PerlIO_printf(Perl_debug_log, "watch at %p hit, found string \"%s\"\n",
8809 PL_watch_pvx, SvPVX(sstr));
8812 switch (SvTYPE(sstr)) {
8817 SvANY(dstr) = new_XIV();
8818 SvIVX(dstr) = SvIVX(sstr);
8821 SvANY(dstr) = new_XNV();
8822 SvNVX(dstr) = SvNVX(sstr);
8825 SvANY(dstr) = new_XRV();
8826 SvRV(dstr) = SvRV(sstr) && SvWEAKREF(sstr)
8827 ? sv_dup(SvRV(sstr), param)
8828 : sv_dup_inc(SvRV(sstr), param);
8831 SvANY(dstr) = new_XPV();
8832 SvCUR(dstr) = SvCUR(sstr);
8833 SvLEN(dstr) = SvLEN(sstr);
8835 SvRV(dstr) = SvWEAKREF(sstr)
8836 ? sv_dup(SvRV(sstr), param)
8837 : sv_dup_inc(SvRV(sstr), param);
8838 else if (SvPVX(sstr) && SvLEN(sstr))
8839 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8841 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8844 SvANY(dstr) = new_XPVIV();
8845 SvCUR(dstr) = SvCUR(sstr);
8846 SvLEN(dstr) = SvLEN(sstr);
8847 SvIVX(dstr) = SvIVX(sstr);
8849 SvRV(dstr) = SvWEAKREF(sstr)
8850 ? sv_dup(SvRV(sstr), param)
8851 : sv_dup_inc(SvRV(sstr), param);
8852 else if (SvPVX(sstr) && SvLEN(sstr))
8853 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8855 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8858 SvANY(dstr) = new_XPVNV();
8859 SvCUR(dstr) = SvCUR(sstr);
8860 SvLEN(dstr) = SvLEN(sstr);
8861 SvIVX(dstr) = SvIVX(sstr);
8862 SvNVX(dstr) = SvNVX(sstr);
8864 SvRV(dstr) = SvWEAKREF(sstr)
8865 ? sv_dup(SvRV(sstr), param)
8866 : sv_dup_inc(SvRV(sstr), param);
8867 else if (SvPVX(sstr) && SvLEN(sstr))
8868 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8870 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8873 SvANY(dstr) = new_XPVMG();
8874 SvCUR(dstr) = SvCUR(sstr);
8875 SvLEN(dstr) = SvLEN(sstr);
8876 SvIVX(dstr) = SvIVX(sstr);
8877 SvNVX(dstr) = SvNVX(sstr);
8878 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8879 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8881 SvRV(dstr) = SvWEAKREF(sstr)
8882 ? sv_dup(SvRV(sstr), param)
8883 : sv_dup_inc(SvRV(sstr), param);
8884 else if (SvPVX(sstr) && SvLEN(sstr))
8885 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8887 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8890 SvANY(dstr) = new_XPVBM();
8891 SvCUR(dstr) = SvCUR(sstr);
8892 SvLEN(dstr) = SvLEN(sstr);
8893 SvIVX(dstr) = SvIVX(sstr);
8894 SvNVX(dstr) = SvNVX(sstr);
8895 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8896 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8898 SvRV(dstr) = SvWEAKREF(sstr)
8899 ? sv_dup(SvRV(sstr), param)
8900 : sv_dup_inc(SvRV(sstr), param);
8901 else if (SvPVX(sstr) && SvLEN(sstr))
8902 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8904 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8905 BmRARE(dstr) = BmRARE(sstr);
8906 BmUSEFUL(dstr) = BmUSEFUL(sstr);
8907 BmPREVIOUS(dstr)= BmPREVIOUS(sstr);
8910 SvANY(dstr) = new_XPVLV();
8911 SvCUR(dstr) = SvCUR(sstr);
8912 SvLEN(dstr) = SvLEN(sstr);
8913 SvIVX(dstr) = SvIVX(sstr);
8914 SvNVX(dstr) = SvNVX(sstr);
8915 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8916 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8918 SvRV(dstr) = SvWEAKREF(sstr)
8919 ? sv_dup(SvRV(sstr), param)
8920 : sv_dup_inc(SvRV(sstr), param);
8921 else if (SvPVX(sstr) && SvLEN(sstr))
8922 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8924 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8925 LvTARGOFF(dstr) = LvTARGOFF(sstr); /* XXX sometimes holds PMOP* when DEBUGGING */
8926 LvTARGLEN(dstr) = LvTARGLEN(sstr);
8927 LvTARG(dstr) = sv_dup_inc(LvTARG(sstr), param);
8928 LvTYPE(dstr) = LvTYPE(sstr);
8931 if (GvUNIQUE((GV*)sstr)) {
8933 if ((share = gv_share(sstr))) {
8937 PerlIO_printf(Perl_debug_log, "sv_dup: sharing %s::%s\n",
8938 HvNAME(GvSTASH(share)), GvNAME(share));
8943 SvANY(dstr) = new_XPVGV();
8944 SvCUR(dstr) = SvCUR(sstr);
8945 SvLEN(dstr) = SvLEN(sstr);
8946 SvIVX(dstr) = SvIVX(sstr);
8947 SvNVX(dstr) = SvNVX(sstr);
8948 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8949 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8951 SvRV(dstr) = SvWEAKREF(sstr)
8952 ? sv_dup(SvRV(sstr), param)
8953 : sv_dup_inc(SvRV(sstr), param);
8954 else if (SvPVX(sstr) && SvLEN(sstr))
8955 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8957 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8958 GvNAMELEN(dstr) = GvNAMELEN(sstr);
8959 GvNAME(dstr) = SAVEPVN(GvNAME(sstr), GvNAMELEN(sstr));
8960 GvSTASH(dstr) = hv_dup_inc(GvSTASH(sstr), param);
8961 GvFLAGS(dstr) = GvFLAGS(sstr);
8962 GvGP(dstr) = gp_dup(GvGP(sstr), param);
8963 (void)GpREFCNT_inc(GvGP(dstr));
8966 SvANY(dstr) = new_XPVIO();
8967 SvCUR(dstr) = SvCUR(sstr);
8968 SvLEN(dstr) = SvLEN(sstr);
8969 SvIVX(dstr) = SvIVX(sstr);
8970 SvNVX(dstr) = SvNVX(sstr);
8971 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
8972 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
8974 SvRV(dstr) = SvWEAKREF(sstr)
8975 ? sv_dup(SvRV(sstr), param)
8976 : sv_dup_inc(SvRV(sstr), param);
8977 else if (SvPVX(sstr) && SvLEN(sstr))
8978 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
8980 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
8981 IoIFP(dstr) = fp_dup(IoIFP(sstr), IoTYPE(sstr));
8982 if (IoOFP(sstr) == IoIFP(sstr))
8983 IoOFP(dstr) = IoIFP(dstr);
8985 IoOFP(dstr) = fp_dup(IoOFP(sstr), IoTYPE(sstr));
8986 /* PL_rsfp_filters entries have fake IoDIRP() */
8987 if (IoDIRP(sstr) && !(IoFLAGS(sstr) & IOf_FAKE_DIRP))
8988 IoDIRP(dstr) = dirp_dup(IoDIRP(sstr));
8990 IoDIRP(dstr) = IoDIRP(sstr);
8991 IoLINES(dstr) = IoLINES(sstr);
8992 IoPAGE(dstr) = IoPAGE(sstr);
8993 IoPAGE_LEN(dstr) = IoPAGE_LEN(sstr);
8994 IoLINES_LEFT(dstr) = IoLINES_LEFT(sstr);
8995 IoTOP_NAME(dstr) = SAVEPV(IoTOP_NAME(sstr));
8996 IoTOP_GV(dstr) = gv_dup(IoTOP_GV(sstr), param);
8997 IoFMT_NAME(dstr) = SAVEPV(IoFMT_NAME(sstr));
8998 IoFMT_GV(dstr) = gv_dup(IoFMT_GV(sstr), param);
8999 IoBOTTOM_NAME(dstr) = SAVEPV(IoBOTTOM_NAME(sstr));
9000 IoBOTTOM_GV(dstr) = gv_dup(IoBOTTOM_GV(sstr), param);
9001 IoSUBPROCESS(dstr) = IoSUBPROCESS(sstr);
9002 IoTYPE(dstr) = IoTYPE(sstr);
9003 IoFLAGS(dstr) = IoFLAGS(sstr);
9006 SvANY(dstr) = new_XPVAV();
9007 SvCUR(dstr) = SvCUR(sstr);
9008 SvLEN(dstr) = SvLEN(sstr);
9009 SvIVX(dstr) = SvIVX(sstr);
9010 SvNVX(dstr) = SvNVX(sstr);
9011 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9012 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9013 AvARYLEN((AV*)dstr) = sv_dup_inc(AvARYLEN((AV*)sstr), param);
9014 AvFLAGS((AV*)dstr) = AvFLAGS((AV*)sstr);
9015 if (AvARRAY((AV*)sstr)) {
9016 SV **dst_ary, **src_ary;
9017 SSize_t items = AvFILLp((AV*)sstr) + 1;
9019 src_ary = AvARRAY((AV*)sstr);
9020 Newz(0, dst_ary, AvMAX((AV*)sstr)+1, SV*);
9021 ptr_table_store(PL_ptr_table, src_ary, dst_ary);
9022 SvPVX(dstr) = (char*)dst_ary;
9023 AvALLOC((AV*)dstr) = dst_ary;
9024 if (AvREAL((AV*)sstr)) {
9026 *dst_ary++ = sv_dup_inc(*src_ary++, param);
9030 *dst_ary++ = sv_dup(*src_ary++, param);
9032 items = AvMAX((AV*)sstr) - AvFILLp((AV*)sstr);
9033 while (items-- > 0) {
9034 *dst_ary++ = &PL_sv_undef;
9038 SvPVX(dstr) = Nullch;
9039 AvALLOC((AV*)dstr) = (SV**)NULL;
9043 SvANY(dstr) = new_XPVHV();
9044 SvCUR(dstr) = SvCUR(sstr);
9045 SvLEN(dstr) = SvLEN(sstr);
9046 SvIVX(dstr) = SvIVX(sstr);
9047 SvNVX(dstr) = SvNVX(sstr);
9048 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9049 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9050 HvRITER((HV*)dstr) = HvRITER((HV*)sstr);
9051 if (HvARRAY((HV*)sstr)) {
9053 XPVHV *dxhv = (XPVHV*)SvANY(dstr);
9054 XPVHV *sxhv = (XPVHV*)SvANY(sstr);
9055 Newz(0, dxhv->xhv_array,
9056 PERL_HV_ARRAY_ALLOC_BYTES(dxhv->xhv_max+1), char);
9057 while (i <= sxhv->xhv_max) {
9058 ((HE**)dxhv->xhv_array)[i] = he_dup(((HE**)sxhv->xhv_array)[i],
9059 !!HvSHAREKEYS(sstr), param);
9062 dxhv->xhv_eiter = he_dup(sxhv->xhv_eiter, !!HvSHAREKEYS(sstr), param);
9065 SvPVX(dstr) = Nullch;
9066 HvEITER((HV*)dstr) = (HE*)NULL;
9068 HvPMROOT((HV*)dstr) = HvPMROOT((HV*)sstr); /* XXX */
9069 HvNAME((HV*)dstr) = SAVEPV(HvNAME((HV*)sstr));
9070 /* Record stashes for possible cloning in Perl_clone(). */
9071 if(HvNAME((HV*)dstr))
9072 av_push(param->stashes, dstr);
9075 SvANY(dstr) = new_XPVFM();
9076 FmLINES(dstr) = FmLINES(sstr);
9080 SvANY(dstr) = new_XPVCV();
9082 SvCUR(dstr) = SvCUR(sstr);
9083 SvLEN(dstr) = SvLEN(sstr);
9084 SvIVX(dstr) = SvIVX(sstr);
9085 SvNVX(dstr) = SvNVX(sstr);
9086 SvMAGIC(dstr) = mg_dup(SvMAGIC(sstr), param);
9087 SvSTASH(dstr) = hv_dup_inc(SvSTASH(sstr), param);
9088 if (SvPVX(sstr) && SvLEN(sstr))
9089 SvPVX(dstr) = SAVEPVN(SvPVX(sstr), SvLEN(sstr)-1);
9091 SvPVX(dstr) = SvPVX(sstr); /* XXX shared string/random ptr? */
9092 CvSTASH(dstr) = hv_dup(CvSTASH(sstr), param); /* NOTE: not refcounted */
9093 CvSTART(dstr) = CvSTART(sstr);
9094 CvROOT(dstr) = OpREFCNT_inc(CvROOT(sstr));
9095 CvXSUB(dstr) = CvXSUB(sstr);
9096 CvXSUBANY(dstr) = CvXSUBANY(sstr);
9097 CvGV(dstr) = gv_dup(CvGV(sstr), param);
9098 if (param->flags & CLONEf_COPY_STACKS) {
9099 CvDEPTH(dstr) = CvDEPTH(sstr);
9103 if (CvPADLIST(sstr) && !AvREAL(CvPADLIST(sstr))) {
9104 /* XXX padlists are real, but pretend to be not */
9105 AvREAL_on(CvPADLIST(sstr));
9106 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9107 AvREAL_off(CvPADLIST(sstr));
9108 AvREAL_off(CvPADLIST(dstr));
9111 CvPADLIST(dstr) = av_dup_inc(CvPADLIST(sstr), param);
9112 if (!CvANON(sstr) || CvCLONED(sstr))
9113 CvOUTSIDE(dstr) = cv_dup_inc(CvOUTSIDE(sstr), param);
9115 CvOUTSIDE(dstr) = cv_dup(CvOUTSIDE(sstr), param);
9116 CvFLAGS(dstr) = CvFLAGS(sstr);
9117 CvFILE(dstr) = CvXSUB(sstr) ? CvFILE(sstr) : SAVEPV(CvFILE(sstr));
9120 Perl_croak(aTHX_ "Bizarre SvTYPE [%d]", SvTYPE(sstr));
9124 if (SvOBJECT(dstr) && SvTYPE(dstr) != SVt_PVIO)
9130 /* duplicate a context */
9133 Perl_cx_dup(pTHX_ PERL_CONTEXT *cxs, I32 ix, I32 max, clone_params* param)
9138 return (PERL_CONTEXT*)NULL;
9140 /* look for it in the table first */
9141 ncxs = (PERL_CONTEXT*)ptr_table_fetch(PL_ptr_table, cxs);
9145 /* create anew and remember what it is */
9146 Newz(56, ncxs, max + 1, PERL_CONTEXT);
9147 ptr_table_store(PL_ptr_table, cxs, ncxs);
9150 PERL_CONTEXT *cx = &cxs[ix];
9151 PERL_CONTEXT *ncx = &ncxs[ix];
9152 ncx->cx_type = cx->cx_type;
9153 if (CxTYPE(cx) == CXt_SUBST) {
9154 Perl_croak(aTHX_ "Cloning substitution context is unimplemented");
9157 ncx->blk_oldsp = cx->blk_oldsp;
9158 ncx->blk_oldcop = cx->blk_oldcop;
9159 ncx->blk_oldretsp = cx->blk_oldretsp;
9160 ncx->blk_oldmarksp = cx->blk_oldmarksp;
9161 ncx->blk_oldscopesp = cx->blk_oldscopesp;
9162 ncx->blk_oldpm = cx->blk_oldpm;
9163 ncx->blk_gimme = cx->blk_gimme;
9164 switch (CxTYPE(cx)) {
9166 ncx->blk_sub.cv = (cx->blk_sub.olddepth == 0
9167 ? cv_dup_inc(cx->blk_sub.cv, param)
9168 : cv_dup(cx->blk_sub.cv,param));
9169 ncx->blk_sub.argarray = (cx->blk_sub.hasargs
9170 ? av_dup_inc(cx->blk_sub.argarray, param)
9172 ncx->blk_sub.savearray = av_dup_inc(cx->blk_sub.savearray, param);
9173 ncx->blk_sub.olddepth = cx->blk_sub.olddepth;
9174 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9175 ncx->blk_sub.lval = cx->blk_sub.lval;
9178 ncx->blk_eval.old_in_eval = cx->blk_eval.old_in_eval;
9179 ncx->blk_eval.old_op_type = cx->blk_eval.old_op_type;
9180 ncx->blk_eval.old_namesv = sv_dup_inc(cx->blk_eval.old_namesv, param);;
9181 ncx->blk_eval.old_eval_root = cx->blk_eval.old_eval_root;
9182 ncx->blk_eval.cur_text = sv_dup(cx->blk_eval.cur_text, param);
9185 ncx->blk_loop.label = cx->blk_loop.label;
9186 ncx->blk_loop.resetsp = cx->blk_loop.resetsp;
9187 ncx->blk_loop.redo_op = cx->blk_loop.redo_op;
9188 ncx->blk_loop.next_op = cx->blk_loop.next_op;
9189 ncx->blk_loop.last_op = cx->blk_loop.last_op;
9190 ncx->blk_loop.iterdata = (CxPADLOOP(cx)
9191 ? cx->blk_loop.iterdata
9192 : gv_dup((GV*)cx->blk_loop.iterdata, param));
9193 ncx->blk_loop.oldcurpad
9194 = (SV**)ptr_table_fetch(PL_ptr_table,
9195 cx->blk_loop.oldcurpad);
9196 ncx->blk_loop.itersave = sv_dup_inc(cx->blk_loop.itersave, param);
9197 ncx->blk_loop.iterlval = sv_dup_inc(cx->blk_loop.iterlval, param);
9198 ncx->blk_loop.iterary = av_dup_inc(cx->blk_loop.iterary, param);
9199 ncx->blk_loop.iterix = cx->blk_loop.iterix;
9200 ncx->blk_loop.itermax = cx->blk_loop.itermax;
9203 ncx->blk_sub.cv = cv_dup(cx->blk_sub.cv, param);
9204 ncx->blk_sub.gv = gv_dup(cx->blk_sub.gv, param);
9205 ncx->blk_sub.dfoutgv = gv_dup_inc(cx->blk_sub.dfoutgv, param);
9206 ncx->blk_sub.hasargs = cx->blk_sub.hasargs;
9218 /* duplicate a stack info structure */
9221 Perl_si_dup(pTHX_ PERL_SI *si, clone_params* param)
9226 return (PERL_SI*)NULL;
9228 /* look for it in the table first */
9229 nsi = (PERL_SI*)ptr_table_fetch(PL_ptr_table, si);
9233 /* create anew and remember what it is */
9234 Newz(56, nsi, 1, PERL_SI);
9235 ptr_table_store(PL_ptr_table, si, nsi);
9237 nsi->si_stack = av_dup_inc(si->si_stack, param);
9238 nsi->si_cxix = si->si_cxix;
9239 nsi->si_cxmax = si->si_cxmax;
9240 nsi->si_cxstack = cx_dup(si->si_cxstack, si->si_cxix, si->si_cxmax, param);
9241 nsi->si_type = si->si_type;
9242 nsi->si_prev = si_dup(si->si_prev, param);
9243 nsi->si_next = si_dup(si->si_next, param);
9244 nsi->si_markoff = si->si_markoff;
9249 #define POPINT(ss,ix) ((ss)[--(ix)].any_i32)
9250 #define TOPINT(ss,ix) ((ss)[ix].any_i32)
9251 #define POPLONG(ss,ix) ((ss)[--(ix)].any_long)
9252 #define TOPLONG(ss,ix) ((ss)[ix].any_long)
9253 #define POPIV(ss,ix) ((ss)[--(ix)].any_iv)
9254 #define TOPIV(ss,ix) ((ss)[ix].any_iv)
9255 #define POPPTR(ss,ix) ((ss)[--(ix)].any_ptr)
9256 #define TOPPTR(ss,ix) ((ss)[ix].any_ptr)
9257 #define POPDPTR(ss,ix) ((ss)[--(ix)].any_dptr)
9258 #define TOPDPTR(ss,ix) ((ss)[ix].any_dptr)
9259 #define POPDXPTR(ss,ix) ((ss)[--(ix)].any_dxptr)
9260 #define TOPDXPTR(ss,ix) ((ss)[ix].any_dxptr)
9263 #define pv_dup_inc(p) SAVEPV(p)
9264 #define pv_dup(p) SAVEPV(p)
9265 #define svp_dup_inc(p,pp) any_dup(p,pp)
9267 /* map any object to the new equivent - either something in the
9268 * ptr table, or something in the interpreter structure
9272 Perl_any_dup(pTHX_ void *v, PerlInterpreter *proto_perl)
9279 /* look for it in the table first */
9280 ret = ptr_table_fetch(PL_ptr_table, v);
9284 /* see if it is part of the interpreter structure */
9285 if (v >= (void*)proto_perl && v < (void*)(proto_perl+1))
9286 ret = (void*)(((char*)aTHXo) + (((char*)v) - (char*)proto_perl));
9293 /* duplicate the save stack */
9296 Perl_ss_dup(pTHX_ PerlInterpreter *proto_perl, clone_params* param)
9298 ANY *ss = proto_perl->Tsavestack;
9299 I32 ix = proto_perl->Tsavestack_ix;
9300 I32 max = proto_perl->Tsavestack_max;
9313 void (*dptr) (void*);
9314 void (*dxptr) (pTHXo_ void*);
9317 Newz(54, nss, max, ANY);
9323 case SAVEt_ITEM: /* normal string */
9324 sv = (SV*)POPPTR(ss,ix);
9325 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9326 sv = (SV*)POPPTR(ss,ix);
9327 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9329 case SAVEt_SV: /* scalar reference */
9330 sv = (SV*)POPPTR(ss,ix);
9331 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9332 gv = (GV*)POPPTR(ss,ix);
9333 TOPPTR(nss,ix) = gv_dup_inc(gv, param);
9335 case SAVEt_GENERIC_PVREF: /* generic char* */
9336 c = (char*)POPPTR(ss,ix);
9337 TOPPTR(nss,ix) = pv_dup(c);
9338 ptr = POPPTR(ss,ix);
9339 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9341 case SAVEt_GENERIC_SVREF: /* generic sv */
9342 case SAVEt_SVREF: /* scalar reference */
9343 sv = (SV*)POPPTR(ss,ix);
9344 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9345 ptr = POPPTR(ss,ix);
9346 TOPPTR(nss,ix) = svp_dup_inc((SV**)ptr, proto_perl);/* XXXXX */
9348 case SAVEt_AV: /* array reference */
9349 av = (AV*)POPPTR(ss,ix);
9350 TOPPTR(nss,ix) = av_dup_inc(av, param);
9351 gv = (GV*)POPPTR(ss,ix);
9352 TOPPTR(nss,ix) = gv_dup(gv, param);
9354 case SAVEt_HV: /* hash reference */
9355 hv = (HV*)POPPTR(ss,ix);
9356 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9357 gv = (GV*)POPPTR(ss,ix);
9358 TOPPTR(nss,ix) = gv_dup(gv, param);
9360 case SAVEt_INT: /* int reference */
9361 ptr = POPPTR(ss,ix);
9362 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9363 intval = (int)POPINT(ss,ix);
9364 TOPINT(nss,ix) = intval;
9366 case SAVEt_LONG: /* long reference */
9367 ptr = POPPTR(ss,ix);
9368 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9369 longval = (long)POPLONG(ss,ix);
9370 TOPLONG(nss,ix) = longval;
9372 case SAVEt_I32: /* I32 reference */
9373 case SAVEt_I16: /* I16 reference */
9374 case SAVEt_I8: /* I8 reference */
9375 ptr = POPPTR(ss,ix);
9376 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9380 case SAVEt_IV: /* IV reference */
9381 ptr = POPPTR(ss,ix);
9382 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9386 case SAVEt_SPTR: /* SV* reference */
9387 ptr = POPPTR(ss,ix);
9388 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9389 sv = (SV*)POPPTR(ss,ix);
9390 TOPPTR(nss,ix) = sv_dup(sv, param);
9392 case SAVEt_VPTR: /* random* reference */
9393 ptr = POPPTR(ss,ix);
9394 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9395 ptr = POPPTR(ss,ix);
9396 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9398 case SAVEt_PPTR: /* char* reference */
9399 ptr = POPPTR(ss,ix);
9400 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9401 c = (char*)POPPTR(ss,ix);
9402 TOPPTR(nss,ix) = pv_dup(c);
9404 case SAVEt_HPTR: /* HV* reference */
9405 ptr = POPPTR(ss,ix);
9406 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9407 hv = (HV*)POPPTR(ss,ix);
9408 TOPPTR(nss,ix) = hv_dup(hv, param);
9410 case SAVEt_APTR: /* AV* reference */
9411 ptr = POPPTR(ss,ix);
9412 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9413 av = (AV*)POPPTR(ss,ix);
9414 TOPPTR(nss,ix) = av_dup(av, param);
9417 gv = (GV*)POPPTR(ss,ix);
9418 TOPPTR(nss,ix) = gv_dup(gv, param);
9420 case SAVEt_GP: /* scalar reference */
9421 gp = (GP*)POPPTR(ss,ix);
9422 TOPPTR(nss,ix) = gp = gp_dup(gp, param);
9423 (void)GpREFCNT_inc(gp);
9424 gv = (GV*)POPPTR(ss,ix);
9425 TOPPTR(nss,ix) = gv_dup_inc(c, param);
9426 c = (char*)POPPTR(ss,ix);
9427 TOPPTR(nss,ix) = pv_dup(c);
9434 case SAVEt_MORTALIZESV:
9435 sv = (SV*)POPPTR(ss,ix);
9436 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9439 ptr = POPPTR(ss,ix);
9440 if (ptr && (((OP*)ptr)->op_private & OPpREFCOUNTED)) {
9441 /* these are assumed to be refcounted properly */
9442 switch (((OP*)ptr)->op_type) {
9449 TOPPTR(nss,ix) = ptr;
9454 TOPPTR(nss,ix) = Nullop;
9459 TOPPTR(nss,ix) = Nullop;
9462 c = (char*)POPPTR(ss,ix);
9463 TOPPTR(nss,ix) = pv_dup_inc(c);
9466 longval = POPLONG(ss,ix);
9467 TOPLONG(nss,ix) = longval;
9470 hv = (HV*)POPPTR(ss,ix);
9471 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9472 c = (char*)POPPTR(ss,ix);
9473 TOPPTR(nss,ix) = pv_dup_inc(c);
9477 case SAVEt_DESTRUCTOR:
9478 ptr = POPPTR(ss,ix);
9479 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9480 dptr = POPDPTR(ss,ix);
9481 TOPDPTR(nss,ix) = (void (*)(void*))any_dup((void *)dptr, proto_perl);
9483 case SAVEt_DESTRUCTOR_X:
9484 ptr = POPPTR(ss,ix);
9485 TOPPTR(nss,ix) = any_dup(ptr, proto_perl); /* XXX quite arbitrary */
9486 dxptr = POPDXPTR(ss,ix);
9487 TOPDXPTR(nss,ix) = (void (*)(pTHXo_ void*))any_dup((void *)dxptr, proto_perl);
9489 case SAVEt_REGCONTEXT:
9495 case SAVEt_STACK_POS: /* Position on Perl stack */
9499 case SAVEt_AELEM: /* array element */
9500 sv = (SV*)POPPTR(ss,ix);
9501 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9504 av = (AV*)POPPTR(ss,ix);
9505 TOPPTR(nss,ix) = av_dup_inc(av, param);
9507 case SAVEt_HELEM: /* hash element */
9508 sv = (SV*)POPPTR(ss,ix);
9509 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9510 sv = (SV*)POPPTR(ss,ix);
9511 TOPPTR(nss,ix) = sv_dup_inc(sv, param);
9512 hv = (HV*)POPPTR(ss,ix);
9513 TOPPTR(nss,ix) = hv_dup_inc(hv, param);
9516 ptr = POPPTR(ss,ix);
9517 TOPPTR(nss,ix) = ptr;
9524 av = (AV*)POPPTR(ss,ix);
9525 TOPPTR(nss,ix) = av_dup(av, param);
9528 longval = (long)POPLONG(ss,ix);
9529 TOPLONG(nss,ix) = longval;
9530 ptr = POPPTR(ss,ix);
9531 TOPPTR(nss,ix) = any_dup(ptr, proto_perl);
9532 sv = (SV*)POPPTR(ss,ix);
9533 TOPPTR(nss,ix) = sv_dup(sv, param);
9536 Perl_croak(aTHX_ "panic: ss_dup inconsistency");
9548 =for apidoc perl_clone
9550 Create and return a new interpreter by cloning the current one.
9555 /* XXX the above needs expanding by someone who actually understands it ! */
9558 perl_clone(PerlInterpreter *proto_perl, UV flags)
9561 CPerlObj *pPerl = (CPerlObj*)proto_perl;
9564 #ifdef PERL_IMPLICIT_SYS
9566 /* perlhost.h so we need to call into it
9567 to clone the host, CPerlHost should have a c interface, sky */
9569 if (flags & CLONEf_CLONE_HOST) {
9570 return perl_clone_host(proto_perl,flags);
9572 return perl_clone_using(proto_perl, flags,
9574 proto_perl->IMemShared,
9575 proto_perl->IMemParse,
9585 perl_clone_using(PerlInterpreter *proto_perl, UV flags,
9586 struct IPerlMem* ipM, struct IPerlMem* ipMS,
9587 struct IPerlMem* ipMP, struct IPerlEnv* ipE,
9588 struct IPerlStdIO* ipStd, struct IPerlLIO* ipLIO,
9589 struct IPerlDir* ipD, struct IPerlSock* ipS,
9590 struct IPerlProc* ipP)
9592 /* XXX many of the string copies here can be optimized if they're
9593 * constants; they need to be allocated as common memory and just
9594 * their pointers copied. */
9597 clone_params* param = (clone_params*) malloc(sizeof(clone_params));
9602 CPerlObj *pPerl = new(ipM) CPerlObj(ipM, ipMS, ipMP, ipE, ipStd, ipLIO,
9604 PERL_SET_THX(pPerl);
9605 # else /* !PERL_OBJECT */
9606 PerlInterpreter *my_perl = (PerlInterpreter*)(*ipM->pMalloc)(ipM, sizeof(PerlInterpreter));
9607 PERL_SET_THX(my_perl);
9610 memset(my_perl, 0xab, sizeof(PerlInterpreter));
9616 # else /* !DEBUGGING */
9617 Zero(my_perl, 1, PerlInterpreter);
9618 # endif /* DEBUGGING */
9622 PL_MemShared = ipMS;
9630 # endif /* PERL_OBJECT */
9631 #else /* !PERL_IMPLICIT_SYS */
9633 clone_params* param = (clone_params*) malloc(sizeof(clone_params));
9634 PerlInterpreter *my_perl = (PerlInterpreter*)PerlMem_malloc(sizeof(PerlInterpreter));
9635 PERL_SET_THX(my_perl);
9640 memset(my_perl, 0xab, sizeof(PerlInterpreter));
9646 # else /* !DEBUGGING */
9647 Zero(my_perl, 1, PerlInterpreter);
9648 # endif /* DEBUGGING */
9649 #endif /* PERL_IMPLICIT_SYS */
9650 param->flags = flags;
9653 PL_xiv_arenaroot = NULL;
9655 PL_xnv_arenaroot = NULL;
9657 PL_xrv_arenaroot = NULL;
9659 PL_xpv_arenaroot = NULL;
9661 PL_xpviv_arenaroot = NULL;
9662 PL_xpviv_root = NULL;
9663 PL_xpvnv_arenaroot = NULL;
9664 PL_xpvnv_root = NULL;
9665 PL_xpvcv_arenaroot = NULL;
9666 PL_xpvcv_root = NULL;
9667 PL_xpvav_arenaroot = NULL;
9668 PL_xpvav_root = NULL;
9669 PL_xpvhv_arenaroot = NULL;
9670 PL_xpvhv_root = NULL;
9671 PL_xpvmg_arenaroot = NULL;
9672 PL_xpvmg_root = NULL;
9673 PL_xpvlv_arenaroot = NULL;
9674 PL_xpvlv_root = NULL;
9675 PL_xpvbm_arenaroot = NULL;
9676 PL_xpvbm_root = NULL;
9677 PL_he_arenaroot = NULL;
9679 PL_nice_chunk = NULL;
9680 PL_nice_chunk_size = 0;
9683 PL_sv_root = Nullsv;
9684 PL_sv_arenaroot = Nullsv;
9686 PL_debug = proto_perl->Idebug;
9688 #ifdef USE_REENTRANT_API
9689 New(31337, PL_reentrant_buffer,1, REBUF);
9690 New(31337, PL_reentrant_buffer->tmbuff,1, struct tm);
9693 /* create SV map for pointer relocation */
9694 PL_ptr_table = ptr_table_new();
9696 /* initialize these special pointers as early as possible */
9697 SvANY(&PL_sv_undef) = NULL;
9698 SvREFCNT(&PL_sv_undef) = (~(U32)0)/2;
9699 SvFLAGS(&PL_sv_undef) = SVf_READONLY|SVt_NULL;
9700 ptr_table_store(PL_ptr_table, &proto_perl->Isv_undef, &PL_sv_undef);
9703 SvUPGRADE(&PL_sv_no, SVt_PVNV);
9705 SvANY(&PL_sv_no) = new_XPVNV();
9707 SvREFCNT(&PL_sv_no) = (~(U32)0)/2;
9708 SvFLAGS(&PL_sv_no) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
9709 SvPVX(&PL_sv_no) = SAVEPVN(PL_No, 0);
9710 SvCUR(&PL_sv_no) = 0;
9711 SvLEN(&PL_sv_no) = 1;
9712 SvNVX(&PL_sv_no) = 0;
9713 ptr_table_store(PL_ptr_table, &proto_perl->Isv_no, &PL_sv_no);
9716 SvUPGRADE(&PL_sv_yes, SVt_PVNV);
9718 SvANY(&PL_sv_yes) = new_XPVNV();
9720 SvREFCNT(&PL_sv_yes) = (~(U32)0)/2;
9721 SvFLAGS(&PL_sv_yes) = SVp_NOK|SVf_NOK|SVp_POK|SVf_POK|SVf_READONLY|SVt_PVNV;
9722 SvPVX(&PL_sv_yes) = SAVEPVN(PL_Yes, 1);
9723 SvCUR(&PL_sv_yes) = 1;
9724 SvLEN(&PL_sv_yes) = 2;
9725 SvNVX(&PL_sv_yes) = 1;
9726 ptr_table_store(PL_ptr_table, &proto_perl->Isv_yes, &PL_sv_yes);
9728 /* create shared string table */
9729 PL_strtab = newHV();
9730 HvSHAREKEYS_off(PL_strtab);
9731 hv_ksplit(PL_strtab, 512);
9732 ptr_table_store(PL_ptr_table, proto_perl->Istrtab, PL_strtab);
9734 PL_compiling = proto_perl->Icompiling;
9735 PL_compiling.cop_stashpv = SAVEPV(PL_compiling.cop_stashpv);
9736 PL_compiling.cop_file = SAVEPV(PL_compiling.cop_file);
9737 ptr_table_store(PL_ptr_table, &proto_perl->Icompiling, &PL_compiling);
9738 if (!specialWARN(PL_compiling.cop_warnings))
9739 PL_compiling.cop_warnings = sv_dup_inc(PL_compiling.cop_warnings, param);
9740 if (!specialCopIO(PL_compiling.cop_io))
9741 PL_compiling.cop_io = sv_dup_inc(PL_compiling.cop_io, param);
9742 PL_curcop = (COP*)any_dup(proto_perl->Tcurcop, proto_perl);
9744 /* pseudo environmental stuff */
9745 PL_origargc = proto_perl->Iorigargc;
9747 New(0, PL_origargv, i+1, char*);
9748 PL_origargv[i] = '\0';
9750 PL_origargv[i] = SAVEPV(proto_perl->Iorigargv[i]);
9754 param->stashes = newAV(); /* Setup array of objects to call clone on */
9757 PL_envgv = gv_dup(proto_perl->Ienvgv, param);
9758 PL_incgv = gv_dup(proto_perl->Iincgv, param);
9759 PL_hintgv = gv_dup(proto_perl->Ihintgv, param);
9760 PL_origfilename = SAVEPV(proto_perl->Iorigfilename);
9761 PL_diehook = sv_dup_inc(proto_perl->Idiehook, param);
9762 PL_warnhook = sv_dup_inc(proto_perl->Iwarnhook, param);
9765 PL_minus_c = proto_perl->Iminus_c;
9766 PL_patchlevel = sv_dup_inc(proto_perl->Ipatchlevel, param);
9767 PL_localpatches = proto_perl->Ilocalpatches;
9768 PL_splitstr = proto_perl->Isplitstr;
9769 PL_preprocess = proto_perl->Ipreprocess;
9770 PL_minus_n = proto_perl->Iminus_n;
9771 PL_minus_p = proto_perl->Iminus_p;
9772 PL_minus_l = proto_perl->Iminus_l;
9773 PL_minus_a = proto_perl->Iminus_a;
9774 PL_minus_F = proto_perl->Iminus_F;
9775 PL_doswitches = proto_perl->Idoswitches;
9776 PL_dowarn = proto_perl->Idowarn;
9777 PL_doextract = proto_perl->Idoextract;
9778 PL_sawampersand = proto_perl->Isawampersand;
9779 PL_unsafe = proto_perl->Iunsafe;
9780 PL_inplace = SAVEPV(proto_perl->Iinplace);
9781 PL_e_script = sv_dup_inc(proto_perl->Ie_script, param);
9782 PL_perldb = proto_perl->Iperldb;
9783 PL_perl_destruct_level = proto_perl->Iperl_destruct_level;
9785 /* magical thingies */
9786 /* XXX time(&PL_basetime) when asked for? */
9787 PL_basetime = proto_perl->Ibasetime;
9788 PL_formfeed = sv_dup(proto_perl->Iformfeed, param);
9790 PL_maxsysfd = proto_perl->Imaxsysfd;
9791 PL_multiline = proto_perl->Imultiline;
9792 PL_statusvalue = proto_perl->Istatusvalue;
9794 PL_statusvalue_vms = proto_perl->Istatusvalue_vms;
9797 /* Clone the regex array */
9798 PL_regex_padav = newAV();
9800 I32 len = av_len((AV*)proto_perl->Iregex_padav);
9801 SV** regexen = AvARRAY((AV*)proto_perl->Iregex_padav);
9802 for(i = 0; i <= len; i++) {
9803 av_push(PL_regex_padav,
9805 newSViv((IV)re_dup((REGEXP *)
9806 SvIVX(regexen[i]), param))
9810 PL_regex_pad = AvARRAY(PL_regex_padav);
9812 /* shortcuts to various I/O objects */
9813 PL_stdingv = gv_dup(proto_perl->Istdingv, param);
9814 PL_stderrgv = gv_dup(proto_perl->Istderrgv, param);
9815 PL_defgv = gv_dup(proto_perl->Idefgv, param);
9816 PL_argvgv = gv_dup(proto_perl->Iargvgv, param);
9817 PL_argvoutgv = gv_dup(proto_perl->Iargvoutgv, param);
9818 PL_argvout_stack = av_dup_inc(proto_perl->Iargvout_stack, param);
9820 /* shortcuts to regexp stuff */
9821 PL_replgv = gv_dup(proto_perl->Ireplgv, param);
9823 /* shortcuts to misc objects */
9824 PL_errgv = gv_dup(proto_perl->Ierrgv, param);
9826 /* shortcuts to debugging objects */
9827 PL_DBgv = gv_dup(proto_perl->IDBgv, param);
9828 PL_DBline = gv_dup(proto_perl->IDBline, param);
9829 PL_DBsub = gv_dup(proto_perl->IDBsub, param);
9830 PL_DBsingle = sv_dup(proto_perl->IDBsingle, param);
9831 PL_DBtrace = sv_dup(proto_perl->IDBtrace, param);
9832 PL_DBsignal = sv_dup(proto_perl->IDBsignal, param);
9833 PL_lineary = av_dup(proto_perl->Ilineary, param);
9834 PL_dbargs = av_dup(proto_perl->Idbargs, param);
9837 PL_defstash = hv_dup_inc(proto_perl->Tdefstash, param);
9838 PL_curstash = hv_dup(proto_perl->Tcurstash, param);
9839 PL_nullstash = hv_dup(proto_perl->Inullstash, param);
9840 PL_debstash = hv_dup(proto_perl->Idebstash, param);
9841 PL_globalstash = hv_dup(proto_perl->Iglobalstash, param);
9842 PL_curstname = sv_dup_inc(proto_perl->Icurstname, param);
9844 PL_beginav = av_dup_inc(proto_perl->Ibeginav, param);
9845 PL_endav = av_dup_inc(proto_perl->Iendav, param);
9846 PL_checkav = av_dup_inc(proto_perl->Icheckav, param);
9847 PL_initav = av_dup_inc(proto_perl->Iinitav, param);
9849 PL_sub_generation = proto_perl->Isub_generation;
9851 /* funky return mechanisms */
9852 PL_forkprocess = proto_perl->Iforkprocess;
9854 /* subprocess state */
9855 PL_fdpid = av_dup_inc(proto_perl->Ifdpid, param);
9857 /* internal state */
9858 PL_tainting = proto_perl->Itainting;
9859 PL_maxo = proto_perl->Imaxo;
9860 if (proto_perl->Iop_mask)
9861 PL_op_mask = SAVEPVN(proto_perl->Iop_mask, PL_maxo);
9863 PL_op_mask = Nullch;
9865 /* current interpreter roots */
9866 PL_main_cv = cv_dup_inc(proto_perl->Imain_cv, param);
9867 PL_main_root = OpREFCNT_inc(proto_perl->Imain_root);
9868 PL_main_start = proto_perl->Imain_start;
9869 PL_eval_root = proto_perl->Ieval_root;
9870 PL_eval_start = proto_perl->Ieval_start;
9872 /* runtime control stuff */
9873 PL_curcopdb = (COP*)any_dup(proto_perl->Icurcopdb, proto_perl);
9874 PL_copline = proto_perl->Icopline;
9876 PL_filemode = proto_perl->Ifilemode;
9877 PL_lastfd = proto_perl->Ilastfd;
9878 PL_oldname = proto_perl->Ioldname; /* XXX not quite right */
9881 PL_gensym = proto_perl->Igensym;
9882 PL_preambled = proto_perl->Ipreambled;
9883 PL_preambleav = av_dup_inc(proto_perl->Ipreambleav, param);
9884 PL_laststatval = proto_perl->Ilaststatval;
9885 PL_laststype = proto_perl->Ilaststype;
9886 PL_mess_sv = Nullsv;
9888 PL_ors_sv = sv_dup_inc(proto_perl->Iors_sv, param);
9889 PL_ofmt = SAVEPV(proto_perl->Iofmt);
9891 /* interpreter atexit processing */
9892 PL_exitlistlen = proto_perl->Iexitlistlen;
9893 if (PL_exitlistlen) {
9894 New(0, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
9895 Copy(proto_perl->Iexitlist, PL_exitlist, PL_exitlistlen, PerlExitListEntry);
9898 PL_exitlist = (PerlExitListEntry*)NULL;
9899 PL_modglobal = hv_dup_inc(proto_perl->Imodglobal, param);
9901 PL_profiledata = NULL;
9902 PL_rsfp = fp_dup(proto_perl->Irsfp, '<');
9903 /* PL_rsfp_filters entries have fake IoDIRP() */
9904 PL_rsfp_filters = av_dup_inc(proto_perl->Irsfp_filters, param);
9906 PL_compcv = cv_dup(proto_perl->Icompcv, param);
9907 PL_comppad = av_dup(proto_perl->Icomppad, param);
9908 PL_comppad_name = av_dup(proto_perl->Icomppad_name, param);
9909 PL_comppad_name_fill = proto_perl->Icomppad_name_fill;
9910 PL_comppad_name_floor = proto_perl->Icomppad_name_floor;
9911 PL_curpad = (SV**)ptr_table_fetch(PL_ptr_table,
9912 proto_perl->Tcurpad);
9914 #ifdef HAVE_INTERP_INTERN
9915 sys_intern_dup(&proto_perl->Isys_intern, &PL_sys_intern);
9918 /* more statics moved here */
9919 PL_generation = proto_perl->Igeneration;
9920 PL_DBcv = cv_dup(proto_perl->IDBcv, param);
9922 PL_in_clean_objs = proto_perl->Iin_clean_objs;
9923 PL_in_clean_all = proto_perl->Iin_clean_all;
9925 PL_uid = proto_perl->Iuid;
9926 PL_euid = proto_perl->Ieuid;
9927 PL_gid = proto_perl->Igid;
9928 PL_egid = proto_perl->Iegid;
9929 PL_nomemok = proto_perl->Inomemok;
9930 PL_an = proto_perl->Ian;
9931 PL_cop_seqmax = proto_perl->Icop_seqmax;
9932 PL_op_seqmax = proto_perl->Iop_seqmax;
9933 PL_evalseq = proto_perl->Ievalseq;
9934 PL_origenviron = proto_perl->Iorigenviron; /* XXX not quite right */
9935 PL_origalen = proto_perl->Iorigalen;
9936 PL_pidstatus = newHV(); /* XXX flag for cloning? */
9937 PL_osname = SAVEPV(proto_perl->Iosname);
9938 PL_sh_path = SAVEPV(proto_perl->Ish_path);
9939 PL_sighandlerp = proto_perl->Isighandlerp;
9942 PL_runops = proto_perl->Irunops;
9944 Copy(proto_perl->Itokenbuf, PL_tokenbuf, 256, char);
9947 PL_cshlen = proto_perl->Icshlen;
9948 PL_cshname = SAVEPVN(proto_perl->Icshname, PL_cshlen);
9951 PL_lex_state = proto_perl->Ilex_state;
9952 PL_lex_defer = proto_perl->Ilex_defer;
9953 PL_lex_expect = proto_perl->Ilex_expect;
9954 PL_lex_formbrack = proto_perl->Ilex_formbrack;
9955 PL_lex_dojoin = proto_perl->Ilex_dojoin;
9956 PL_lex_starts = proto_perl->Ilex_starts;
9957 PL_lex_stuff = sv_dup_inc(proto_perl->Ilex_stuff, param);
9958 PL_lex_repl = sv_dup_inc(proto_perl->Ilex_repl, param);
9959 PL_lex_op = proto_perl->Ilex_op;
9960 PL_lex_inpat = proto_perl->Ilex_inpat;
9961 PL_lex_inwhat = proto_perl->Ilex_inwhat;
9962 PL_lex_brackets = proto_perl->Ilex_brackets;
9963 i = (PL_lex_brackets < 120 ? 120 : PL_lex_brackets);
9964 PL_lex_brackstack = SAVEPVN(proto_perl->Ilex_brackstack,i);
9965 PL_lex_casemods = proto_perl->Ilex_casemods;
9966 i = (PL_lex_casemods < 12 ? 12 : PL_lex_casemods);
9967 PL_lex_casestack = SAVEPVN(proto_perl->Ilex_casestack,i);
9969 Copy(proto_perl->Inextval, PL_nextval, 5, YYSTYPE);
9970 Copy(proto_perl->Inexttype, PL_nexttype, 5, I32);
9971 PL_nexttoke = proto_perl->Inexttoke;
9973 PL_linestr = sv_dup_inc(proto_perl->Ilinestr, param);
9974 i = proto_perl->Ibufptr - SvPVX(proto_perl->Ilinestr);
9975 PL_bufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9976 i = proto_perl->Ioldbufptr - SvPVX(proto_perl->Ilinestr);
9977 PL_oldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9978 i = proto_perl->Ioldoldbufptr - SvPVX(proto_perl->Ilinestr);
9979 PL_oldoldbufptr = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9980 PL_bufend = SvPVX(PL_linestr) + SvCUR(PL_linestr);
9981 i = proto_perl->Ilinestart - SvPVX(proto_perl->Ilinestr);
9982 PL_linestart = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
9983 PL_pending_ident = proto_perl->Ipending_ident;
9984 PL_sublex_info = proto_perl->Isublex_info; /* XXX not quite right */
9986 PL_expect = proto_perl->Iexpect;
9988 PL_multi_start = proto_perl->Imulti_start;
9989 PL_multi_end = proto_perl->Imulti_end;
9990 PL_multi_open = proto_perl->Imulti_open;
9991 PL_multi_close = proto_perl->Imulti_close;
9993 PL_error_count = proto_perl->Ierror_count;
9994 PL_subline = proto_perl->Isubline;
9995 PL_subname = sv_dup_inc(proto_perl->Isubname, param);
9997 PL_min_intro_pending = proto_perl->Imin_intro_pending;
9998 PL_max_intro_pending = proto_perl->Imax_intro_pending;
9999 PL_padix = proto_perl->Ipadix;
10000 PL_padix_floor = proto_perl->Ipadix_floor;
10001 PL_pad_reset_pending = proto_perl->Ipad_reset_pending;
10003 i = proto_perl->Ilast_uni - SvPVX(proto_perl->Ilinestr);
10004 PL_last_uni = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10005 i = proto_perl->Ilast_lop - SvPVX(proto_perl->Ilinestr);
10006 PL_last_lop = SvPVX(PL_linestr) + (i < 0 ? 0 : i);
10007 PL_last_lop_op = proto_perl->Ilast_lop_op;
10008 PL_in_my = proto_perl->Iin_my;
10009 PL_in_my_stash = hv_dup(proto_perl->Iin_my_stash, param);
10011 PL_cryptseen = proto_perl->Icryptseen;
10014 PL_hints = proto_perl->Ihints;
10016 PL_amagic_generation = proto_perl->Iamagic_generation;
10018 #ifdef USE_LOCALE_COLLATE
10019 PL_collation_ix = proto_perl->Icollation_ix;
10020 PL_collation_name = SAVEPV(proto_perl->Icollation_name);
10021 PL_collation_standard = proto_perl->Icollation_standard;
10022 PL_collxfrm_base = proto_perl->Icollxfrm_base;
10023 PL_collxfrm_mult = proto_perl->Icollxfrm_mult;
10024 #endif /* USE_LOCALE_COLLATE */
10026 #ifdef USE_LOCALE_NUMERIC
10027 PL_numeric_name = SAVEPV(proto_perl->Inumeric_name);
10028 PL_numeric_standard = proto_perl->Inumeric_standard;
10029 PL_numeric_local = proto_perl->Inumeric_local;
10030 PL_numeric_radix_sv = sv_dup_inc(proto_perl->Inumeric_radix_sv, param);
10031 #endif /* !USE_LOCALE_NUMERIC */
10033 /* utf8 character classes */
10034 PL_utf8_alnum = sv_dup_inc(proto_perl->Iutf8_alnum, param);
10035 PL_utf8_alnumc = sv_dup_inc(proto_perl->Iutf8_alnumc, param);
10036 PL_utf8_ascii = sv_dup_inc(proto_perl->Iutf8_ascii, param);
10037 PL_utf8_alpha = sv_dup_inc(proto_perl->Iutf8_alpha, param);
10038 PL_utf8_space = sv_dup_inc(proto_perl->Iutf8_space, param);
10039 PL_utf8_cntrl = sv_dup_inc(proto_perl->Iutf8_cntrl, param);
10040 PL_utf8_graph = sv_dup_inc(proto_perl->Iutf8_graph, param);
10041 PL_utf8_digit = sv_dup_inc(proto_perl->Iutf8_digit, param);
10042 PL_utf8_upper = sv_dup_inc(proto_perl->Iutf8_upper, param);
10043 PL_utf8_lower = sv_dup_inc(proto_perl->Iutf8_lower, param);
10044 PL_utf8_print = sv_dup_inc(proto_perl->Iutf8_print, param);
10045 PL_utf8_punct = sv_dup_inc(proto_perl->Iutf8_punct, param);
10046 PL_utf8_xdigit = sv_dup_inc(proto_perl->Iutf8_xdigit, param);
10047 PL_utf8_mark = sv_dup_inc(proto_perl->Iutf8_mark, param);
10048 PL_utf8_toupper = sv_dup_inc(proto_perl->Iutf8_toupper, param);
10049 PL_utf8_totitle = sv_dup_inc(proto_perl->Iutf8_totitle, param);
10050 PL_utf8_tolower = sv_dup_inc(proto_perl->Iutf8_tolower, param);
10053 PL_last_swash_hv = Nullhv; /* reinits on demand */
10054 PL_last_swash_klen = 0;
10055 PL_last_swash_key[0]= '\0';
10056 PL_last_swash_tmps = (U8*)NULL;
10057 PL_last_swash_slen = 0;
10059 /* perly.c globals */
10060 PL_yydebug = proto_perl->Iyydebug;
10061 PL_yynerrs = proto_perl->Iyynerrs;
10062 PL_yyerrflag = proto_perl->Iyyerrflag;
10063 PL_yychar = proto_perl->Iyychar;
10064 PL_yyval = proto_perl->Iyyval;
10065 PL_yylval = proto_perl->Iyylval;
10067 PL_glob_index = proto_perl->Iglob_index;
10068 PL_srand_called = proto_perl->Isrand_called;
10069 PL_uudmap['M'] = 0; /* reinits on demand */
10070 PL_bitcount = Nullch; /* reinits on demand */
10072 if (proto_perl->Ipsig_pend) {
10073 Newz(0, PL_psig_pend, SIG_SIZE, int);
10076 PL_psig_pend = (int*)NULL;
10079 if (proto_perl->Ipsig_ptr) {
10080 Newz(0, PL_psig_ptr, SIG_SIZE, SV*);
10081 Newz(0, PL_psig_name, SIG_SIZE, SV*);
10082 for (i = 1; i < SIG_SIZE; i++) {
10083 PL_psig_ptr[i] = sv_dup_inc(proto_perl->Ipsig_ptr[i], param);
10084 PL_psig_name[i] = sv_dup_inc(proto_perl->Ipsig_name[i], param);
10088 PL_psig_ptr = (SV**)NULL;
10089 PL_psig_name = (SV**)NULL;
10092 /* thrdvar.h stuff */
10094 if (flags & CLONEf_COPY_STACKS) {
10095 /* next allocation will be PL_tmps_stack[PL_tmps_ix+1] */
10096 PL_tmps_ix = proto_perl->Ttmps_ix;
10097 PL_tmps_max = proto_perl->Ttmps_max;
10098 PL_tmps_floor = proto_perl->Ttmps_floor;
10099 Newz(50, PL_tmps_stack, PL_tmps_max, SV*);
10101 while (i <= PL_tmps_ix) {
10102 PL_tmps_stack[i] = sv_dup_inc(proto_perl->Ttmps_stack[i], param);
10106 /* next PUSHMARK() sets *(PL_markstack_ptr+1) */
10107 i = proto_perl->Tmarkstack_max - proto_perl->Tmarkstack;
10108 Newz(54, PL_markstack, i, I32);
10109 PL_markstack_max = PL_markstack + (proto_perl->Tmarkstack_max
10110 - proto_perl->Tmarkstack);
10111 PL_markstack_ptr = PL_markstack + (proto_perl->Tmarkstack_ptr
10112 - proto_perl->Tmarkstack);
10113 Copy(proto_perl->Tmarkstack, PL_markstack,
10114 PL_markstack_ptr - PL_markstack + 1, I32);
10116 /* next push_scope()/ENTER sets PL_scopestack[PL_scopestack_ix]
10117 * NOTE: unlike the others! */
10118 PL_scopestack_ix = proto_perl->Tscopestack_ix;
10119 PL_scopestack_max = proto_perl->Tscopestack_max;
10120 Newz(54, PL_scopestack, PL_scopestack_max, I32);
10121 Copy(proto_perl->Tscopestack, PL_scopestack, PL_scopestack_ix, I32);
10123 /* next push_return() sets PL_retstack[PL_retstack_ix]
10124 * NOTE: unlike the others! */
10125 PL_retstack_ix = proto_perl->Tretstack_ix;
10126 PL_retstack_max = proto_perl->Tretstack_max;
10127 Newz(54, PL_retstack, PL_retstack_max, OP*);
10128 Copy(proto_perl->Tretstack, PL_retstack, PL_retstack_ix, I32);
10130 /* NOTE: si_dup() looks at PL_markstack */
10131 PL_curstackinfo = si_dup(proto_perl->Tcurstackinfo, param);
10133 /* PL_curstack = PL_curstackinfo->si_stack; */
10134 PL_curstack = av_dup(proto_perl->Tcurstack, param);
10135 PL_mainstack = av_dup(proto_perl->Tmainstack, param);
10137 /* next PUSHs() etc. set *(PL_stack_sp+1) */
10138 PL_stack_base = AvARRAY(PL_curstack);
10139 PL_stack_sp = PL_stack_base + (proto_perl->Tstack_sp
10140 - proto_perl->Tstack_base);
10141 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
10143 /* next SSPUSHFOO() sets PL_savestack[PL_savestack_ix]
10144 * NOTE: unlike the others! */
10145 PL_savestack_ix = proto_perl->Tsavestack_ix;
10146 PL_savestack_max = proto_perl->Tsavestack_max;
10147 /*Newz(54, PL_savestack, PL_savestack_max, ANY);*/
10148 PL_savestack = ss_dup(proto_perl, param);
10152 ENTER; /* perl_destruct() wants to LEAVE; */
10155 PL_start_env = proto_perl->Tstart_env; /* XXXXXX */
10156 PL_top_env = &PL_start_env;
10158 PL_op = proto_perl->Top;
10161 PL_Xpv = (XPV*)NULL;
10162 PL_na = proto_perl->Tna;
10164 PL_statbuf = proto_perl->Tstatbuf;
10165 PL_statcache = proto_perl->Tstatcache;
10166 PL_statgv = gv_dup(proto_perl->Tstatgv, param);
10167 PL_statname = sv_dup_inc(proto_perl->Tstatname, param);
10169 PL_timesbuf = proto_perl->Ttimesbuf;
10172 PL_tainted = proto_perl->Ttainted;
10173 PL_curpm = proto_perl->Tcurpm; /* XXX No PMOP ref count */
10174 PL_nrs = sv_dup_inc(proto_perl->Tnrs, param);
10175 PL_rs = sv_dup_inc(proto_perl->Trs, param);
10176 PL_last_in_gv = gv_dup(proto_perl->Tlast_in_gv, param);
10177 PL_ofs_sv = sv_dup_inc(proto_perl->Tofs_sv, param);
10178 PL_defoutgv = gv_dup_inc(proto_perl->Tdefoutgv, param);
10179 PL_chopset = proto_perl->Tchopset; /* XXX never deallocated */
10180 PL_toptarget = sv_dup_inc(proto_perl->Ttoptarget, param);
10181 PL_bodytarget = sv_dup_inc(proto_perl->Tbodytarget, param);
10182 PL_formtarget = sv_dup(proto_perl->Tformtarget, param);
10184 PL_restartop = proto_perl->Trestartop;
10185 PL_in_eval = proto_perl->Tin_eval;
10186 PL_delaymagic = proto_perl->Tdelaymagic;
10187 PL_dirty = proto_perl->Tdirty;
10188 PL_localizing = proto_perl->Tlocalizing;
10190 #ifdef PERL_FLEXIBLE_EXCEPTIONS
10191 PL_protect = proto_perl->Tprotect;
10193 PL_errors = sv_dup_inc(proto_perl->Terrors, param);
10194 PL_av_fetch_sv = Nullsv;
10195 PL_hv_fetch_sv = Nullsv;
10196 Zero(&PL_hv_fetch_ent_mh, 1, HE); /* XXX */
10197 PL_modcount = proto_perl->Tmodcount;
10198 PL_lastgotoprobe = Nullop;
10199 PL_dumpindent = proto_perl->Tdumpindent;
10201 PL_sortcop = (OP*)any_dup(proto_perl->Tsortcop, proto_perl);
10202 PL_sortstash = hv_dup(proto_perl->Tsortstash, param);
10203 PL_firstgv = gv_dup(proto_perl->Tfirstgv, param);
10204 PL_secondgv = gv_dup(proto_perl->Tsecondgv, param);
10205 PL_sortcxix = proto_perl->Tsortcxix;
10206 PL_efloatbuf = Nullch; /* reinits on demand */
10207 PL_efloatsize = 0; /* reinits on demand */
10211 PL_screamfirst = NULL;
10212 PL_screamnext = NULL;
10213 PL_maxscream = -1; /* reinits on demand */
10214 PL_lastscream = Nullsv;
10216 PL_watchaddr = NULL;
10217 PL_watchok = Nullch;
10219 PL_regdummy = proto_perl->Tregdummy;
10220 PL_regcomp_parse = Nullch;
10221 PL_regxend = Nullch;
10222 PL_regcode = (regnode*)NULL;
10225 PL_regprecomp = Nullch;
10230 PL_seen_zerolen = 0;
10232 PL_regcomp_rx = (regexp*)NULL;
10234 PL_colorset = 0; /* reinits PL_colors[] */
10235 /*PL_colors[6] = {0,0,0,0,0,0};*/
10236 PL_reg_whilem_seen = 0;
10237 PL_reginput = Nullch;
10238 PL_regbol = Nullch;
10239 PL_regeol = Nullch;
10240 PL_regstartp = (I32*)NULL;
10241 PL_regendp = (I32*)NULL;
10242 PL_reglastparen = (U32*)NULL;
10243 PL_regtill = Nullch;
10244 PL_reg_start_tmp = (char**)NULL;
10245 PL_reg_start_tmpl = 0;
10246 PL_regdata = (struct reg_data*)NULL;
10249 PL_reg_eval_set = 0;
10251 PL_regprogram = (regnode*)NULL;
10253 PL_regcc = (CURCUR*)NULL;
10254 PL_reg_call_cc = (struct re_cc_state*)NULL;
10255 PL_reg_re = (regexp*)NULL;
10256 PL_reg_ganch = Nullch;
10257 PL_reg_sv = Nullsv;
10258 PL_reg_magic = (MAGIC*)NULL;
10260 PL_reg_oldcurpm = (PMOP*)NULL;
10261 PL_reg_curpm = (PMOP*)NULL;
10262 PL_reg_oldsaved = Nullch;
10263 PL_reg_oldsavedlen = 0;
10264 PL_reg_maxiter = 0;
10265 PL_reg_leftiter = 0;
10266 PL_reg_poscache = Nullch;
10267 PL_reg_poscache_size= 0;
10269 /* RE engine - function pointers */
10270 PL_regcompp = proto_perl->Tregcompp;
10271 PL_regexecp = proto_perl->Tregexecp;
10272 PL_regint_start = proto_perl->Tregint_start;
10273 PL_regint_string = proto_perl->Tregint_string;
10274 PL_regfree = proto_perl->Tregfree;
10276 PL_reginterp_cnt = 0;
10277 PL_reg_starttry = 0;
10279 if (!(flags & CLONEf_KEEP_PTR_TABLE)) {
10280 ptr_table_free(PL_ptr_table);
10281 PL_ptr_table = NULL;
10284 /* Call the ->CLONE method, if it exists, for each of the stashes
10285 identified by sv_dup() above.
10287 while(av_len(param->stashes) != -1) {
10288 HV* stash = (HV*) av_shift(param->stashes);
10289 GV* cloner = gv_fetchmethod_autoload(stash, "CLONE", 0);
10290 if (cloner && GvCV(cloner)) {
10295 XPUSHs(sv_2mortal(newSVpv(HvNAME(stash), 0)));
10297 call_sv((SV*)GvCV(cloner), G_DISCARD);
10303 SvREFCNT_dec(param->stashes);
10307 return (PerlInterpreter*)pPerl;
10313 #else /* !USE_ITHREADS */
10319 #endif /* USE_ITHREADS */