without excessive memory needs. The assumption is that your CPU cache
works :-) (And that we're not going to bust it) */
-#define ALIGN_BITS ( sizeof(void*) >> 1 )
#define BYTE_BITS 3
#define LEAF_BITS (16 - BYTE_BITS)
#define LEAF_MASK 0x1FFF
(and hence hot in the cache) but we can still deal with any unaligned
pointers. */
const size_t cooked_p
- = (raw_p >> ALIGN_BITS) | (raw_p << (bits - BYTE_BITS));
+ = (raw_p >> ALIGN_BITS) | (raw_p << (bits - ALIGN_BITS));
const U8 this_bit = 1 << (cooked_p & 0x7);
U8 **leaf_p;
U8 *leaf;
if(isGV_with_GP(thing)) {
st->total_size += GvNAMELEN(thing);
#ifdef GvFILE
- /* Is there a file? */
+# if !defined(USE_ITHREADS) || (PERL_VERSION > 8 || (PERL_VERSION == 8 && PERL_SUBVERSION > 8))
+ /* With itreads, before 5.8.9, this can end up pointing to freed memory
+ if the GV was created in an eval, as GvFILE() points to CopFILE(),
+ and the relevant COP has been freed on scope cleanup after the eval.
+ 5.8.9 adds a binary compatible fudge that catches the vast majority
+ of cases. 5.9.something added a proper fix, by converting the GP to
+ use a shared hash key (porperly reference counted), instead of a
+ char * (owned by who knows? possibly no-one now) */
check_new_and_strlen(st, GvFILE(thing));
+# endif
#endif
/* Is there something hanging off the glob? */
if (check_new(st, GvGP(thing))) {
UV
size(orig_thing)
SV *orig_thing
+ALIAS:
+ total_size = TOTAL_SIZE_RECURSION
CODE:
{
SV *thing = orig_thing;
/* If they passed us a reference then dereference it. This is the
only way we can check the sizes of arrays and hashes */
-#if (PERL_VERSION < 11)
- if (SvOK(thing) && SvROK(thing)) {
- thing = SvRV(thing);
- }
-#else
if (SvROK(thing)) {
thing = SvRV(thing);
}
-#endif
-
- sv_size(aTHX_ st, thing, NO_RECURSION);
- RETVAL = st->total_size;
- free_state(st);
-}
-OUTPUT:
- RETVAL
-
-
-UV
-total_size(orig_thing)
- SV *orig_thing
-CODE:
-{
- SV *thing = orig_thing;
- /* Array with things we still need to do */
- AV *pending_array;
- IV size = 0;
- struct state *st = new_state(aTHX);
-
- /* Size starts at zero */
- RETVAL = 0;
-
- pending_array = newAV();
-
- /* If they passed us a reference then dereference it.
- This is the only way we can check the sizes of arrays and hashes. */
- if (SvROK(thing)) {
- thing = SvRV(thing);
- }
-
- /* Put it on the pending array */
- av_push(pending_array, thing);
-
- /* Now just yank things off the end of the array until it's done */
- while (av_len(pending_array) >= 0) {
- thing = av_pop(pending_array);
- /* Process it if we've not seen it */
- if (sv_size(aTHX_ st, thing, TOTAL_SIZE_RECURSION)) {
- dbg_printf(("# Found type %i at %p\n", SvTYPE(thing), thing));
- switch (SvTYPE(thing)) {
- /* fix for bug #24846 (Does not correctly recurse into references in a PVNV-type scalar) */
- case SVt_PVNV: TAG;
- if (SvROK(thing))
- {
- av_push(pending_array, SvRV(thing));
- }
- TAG;break;
-#if (PERL_VERSION < 11)
- case SVt_RV: TAG;
-#else
- case SVt_IV: TAG;
-#endif
- dbg_printf(("# Found RV\n"));
- if (SvROK(thing)) {
- dbg_printf(("# Found RV\n"));
- av_push(pending_array, SvRV(thing));
- }
- TAG;break;
-
- default:
- TAG;break;
- }
- } else {
- /* check_new() returned false: */
-#ifdef DEVEL_SIZE_DEBUGGING
- if (SvOK(sv)) printf("# Ignore ref copy 0x%x\n", sv);
- else printf("# Ignore non-sv 0x%x\n", sv);
-#endif
- }
- } /* end while */
+ sv_size(aTHX_ st, thing, ix);
RETVAL = st->total_size;
free_state(st);
- SvREFCNT_dec(pending_array);
}
OUTPUT:
RETVAL
-