+#define PERL_NO_GET_CONTEXT
+
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
#include "ppport.h"
+/* Not yet in ppport.h */
+#ifndef CvISXSUB
+# define CvISXSUB(cv) (CvXSUB(cv) ? TRUE : FALSE)
+#endif
+
#ifdef _MSC_VER
/* "structured exception" handling is a Microsoft extension to C and C++.
It's *not* C++ exception handling - C++ exception handling can't capture
#define dbg_printf(x)
#endif
-#define TAG //printf( "# %s(%d)\n", __FILE__, __LINE__ )
+#define TAG /* printf( "# %s(%d)\n", __FILE__, __LINE__ ) */
#define carp puts
+/* The idea is to have a tree structure to store 1 bit per possible pointer
+ address. The lowest 16 bits are stored in a block of 8092 bytes.
+ The blocks are in a 256-way tree, indexed by the reset of the pointer.
+ This can cope with 32 and 64 bit pointers, and any address space layout,
+ 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 BIT_BITS 3
-#define BYTE_BITS 14
-#define SLOT_BITS ( sizeof( void*) * 8 ) - ( ALIGN_BITS + BIT_BITS + BYTE_BITS )
-#define BYTES_PER_SLOT 1 << BYTE_BITS
-#define TRACKING_SLOTS 8192 // max. 8192 for 4GB/32-bit machine
+#define BYTE_BITS 3
+#define LEAF_BITS (16 - BYTE_BITS)
+#define LEAF_MASK 0x1FFF
-typedef char* TRACKING[ TRACKING_SLOTS ];
+typedef void * TRACKING[256];
/*
Checks to see if thing is in the bitstring.
*/
static bool
check_new(TRACKING *tv, const void *const p) {
- unsigned long slot = (unsigned long)p >> (SLOT_BITS + BIT_BITS + ALIGN_BITS);
- unsigned int byte = ((unsigned long)p >> (ALIGN_BITS + BIT_BITS)) & 0x00003fffU;
- unsigned int bit = ((unsigned long)p >> ALIGN_BITS) & 0x00000007U;
- unsigned int nop = (unsigned long)p & 0x3U;
-
+ unsigned int bits = 8 * sizeof(void*);
+ const size_t raw_p = PTR2nat(p);
+ /* This effectively rotates the value right by the number of low always-0
+ bits in an aligned pointer. The assmption is that most (if not all)
+ pointers are aligned, and these will be in the same chain of nodes
+ (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));
+ const U8 this_bit = 1 << (cooked_p & 0x7);
+ U8 **leaf_p;
+ U8 *leaf;
+ unsigned int i;
+ void **tv_p = (void **) tv;
+
assert(tv);
if (NULL == p) return FALSE;
TRY_TO_CATCH_SEGV {
warn( "Devel::Size: Encountered invalid pointer: %p\n", p );
return FALSE;
}
- dbg_printf((
- "address: %p slot: %p byte: %4x bit: %4x nop:%x\n",
- p, slot, byte, bit, nop
- ));
- TAG;
- if( slot >= TRACKING_SLOTS ) {
- die( "Devel::Size: Please rebuild D::S with TRACKING_SLOTS > %u\n", slot );
- }
TAG;
- if( (*tv)[ slot ] == NULL ) {
- Newz( 0xfc0ff, (*tv)[ slot ], BYTES_PER_SLOT, char );
- }
- TAG;
- if( (*tv)[ slot ][ byte ] & ( 1 << bit ) ) {
- return FALSE;
- }
- TAG;
- (*tv)[ slot ][ byte ] |= ( 1 << bit );
+
+ bits -= 8;
+ /* bits now 24 (32 bit pointers) or 56 (64 bit pointers) */
+
+ /* First level is always present. */
+ do {
+ i = (unsigned int)((cooked_p >> bits) & 0xFF);
+ if (!tv_p[i])
+ Newxz(tv_p[i], 256, void *);
+ tv_p = (void **)(tv_p[i]);
+ bits -= 8;
+ } while (bits > LEAF_BITS + BYTE_BITS);
+ /* bits now 16 always */
+ assert(bits == 16);
+ leaf_p = (U8 **)tv_p;
+ i = (unsigned int)((cooked_p >> bits) & 0xFF);
+ if (!leaf_p[i])
+ Newxz(leaf_p[i], 1 << LEAF_BITS, U8);
+ leaf = leaf_p[i];
+
TAG;
+
+ i = (unsigned int)((cooked_p >> BYTE_BITS) & LEAF_MASK);
+
+ if(leaf[i] & this_bit)
+ return FALSE;
+
+ leaf[i] |= this_bit;
return TRUE;
}
static void
+free_tracking_at(void **tv, int level)
+{
+ int i = 255;
+
+ if (--level) {
+ /* Nodes */
+ do {
+ if (tv[i]) {
+ free_tracking_at(tv[i], level);
+ Safefree(tv[i]);
+ }
+ } while (i--);
+ } else {
+ /* Leaves */
+ do {
+ if (tv[i])
+ Safefree(tv[i]);
+ } while (i--);
+ }
+}
+
+static void
free_tracking(TRACKING *tv)
{
- int i;
- /* Clean up after ourselves */
- for( i = 0; i < TRACKING_SLOTS; ++i ) {
- if( (*tv)[ i ] )
- Safefree( (*tv)[ i ] );
- }
- Safefree( tv );
+ const int top_level = (sizeof(void *) * 8 - LEAF_BITS - BYTE_BITS) / 8;
+ free_tracking_at((void **)tv, top_level);
+ Safefree(tv);
}
-UV thing_size(const SV *const, TRACKING *);
+static UV thing_size(pTHX_ const SV *const, TRACKING *);
typedef enum {
OPc_NULL, /* 0 */
OPc_BASEOP, /* 1 */
total_size += sizeof(MGVTBL);
}
- /* Get the next in the chain */ // ?try
+ /* Get the next in the chain */
magic_pointer = magic_pointer->mg_moremagic;
}
CAUGHT_EXCEPTION {
return total_size;
}
-UV op_size(const OP * const baseop, TRACKING *tv) {
+static UV
+op_size(pTHX_ const OP * const baseop, TRACKING *tv) {
UV total_size = 0;
TRY_TO_CATCH_SEGV {
TAG;
if (check_new(tv, baseop->op_next)) {
- total_size += op_size(baseop->op_next, tv);
+ total_size += op_size(aTHX_ baseop->op_next, tv);
}
TAG;
switch (cc_opclass(baseop)) {
case OPc_UNOP: TAG;
total_size += sizeof(struct unop);
if (check_new(tv, cUNOPx(baseop)->op_first)) {
- total_size += op_size(cUNOPx(baseop)->op_first, tv);
+ total_size += op_size(aTHX_ cUNOPx(baseop)->op_first, tv);
}
TAG;break;
case OPc_BINOP: TAG;
total_size += sizeof(struct binop);
if (check_new(tv, cBINOPx(baseop)->op_first)) {
- total_size += op_size(cBINOPx(baseop)->op_first, tv);
+ total_size += op_size(aTHX_ cBINOPx(baseop)->op_first, tv);
}
if (check_new(tv, cBINOPx(baseop)->op_last)) {
- total_size += op_size(cBINOPx(baseop)->op_last, tv);
+ total_size += op_size(aTHX_ cBINOPx(baseop)->op_last, tv);
}
TAG;break;
case OPc_LOGOP: TAG;
total_size += sizeof(struct logop);
if (check_new(tv, cLOGOPx(baseop)->op_first)) {
- total_size += op_size(cBINOPx(baseop)->op_first, tv);
+ total_size += op_size(aTHX_ cBINOPx(baseop)->op_first, tv);
}
if (check_new(tv, cLOGOPx(baseop)->op_other)) {
- total_size += op_size(cLOGOPx(baseop)->op_other, tv);
+ total_size += op_size(aTHX_ cLOGOPx(baseop)->op_other, tv);
}
TAG;break;
case OPc_LISTOP: TAG;
total_size += sizeof(struct listop);
if (check_new(tv, cLISTOPx(baseop)->op_first)) {
- total_size += op_size(cLISTOPx(baseop)->op_first, tv);
+ total_size += op_size(aTHX_ cLISTOPx(baseop)->op_first, tv);
}
if (check_new(tv, cLISTOPx(baseop)->op_last)) {
- total_size += op_size(cLISTOPx(baseop)->op_last, tv);
+ total_size += op_size(aTHX_ cLISTOPx(baseop)->op_last, tv);
}
TAG;break;
case OPc_PMOP: TAG;
total_size += sizeof(struct pmop);
if (check_new(tv, cPMOPx(baseop)->op_first)) {
- total_size += op_size(cPMOPx(baseop)->op_first, tv);
+ total_size += op_size(aTHX_ cPMOPx(baseop)->op_first, tv);
}
if (check_new(tv, cPMOPx(baseop)->op_last)) {
- total_size += op_size(cPMOPx(baseop)->op_last, tv);
+ total_size += op_size(aTHX_ cPMOPx(baseop)->op_last, tv);
}
#if PERL_VERSION < 9 || (PERL_VERSION == 9 && PERL_SUBVERSION < 5)
if (check_new(tv, cPMOPx(baseop)->op_pmreplroot)) {
- total_size += op_size(cPMOPx(baseop)->op_pmreplroot, tv);
+ total_size += op_size(aTHX_ cPMOPx(baseop)->op_pmreplroot, tv);
}
if (check_new(tv, cPMOPx(baseop)->op_pmreplstart)) {
- total_size += op_size(cPMOPx(baseop)->op_pmreplstart, tv);
+ total_size += op_size(aTHX_ cPMOPx(baseop)->op_pmreplstart, tv);
}
if (check_new(tv, cPMOPx(baseop)->op_pmnext)) {
- total_size += op_size((OP *)cPMOPx(baseop)->op_pmnext, tv);
+ total_size += op_size(aTHX_ (OP *)cPMOPx(baseop)->op_pmnext, tv);
}
#endif
/* This is defined away in perl 5.8.x, but it is in there for
case OPc_SVOP: TAG;
total_size += sizeof(struct pmop);
if (check_new(tv, cSVOPx(baseop)->op_sv)) {
- total_size += thing_size(cSVOPx(baseop)->op_sv, tv);
+ total_size += thing_size(aTHX_ cSVOPx(baseop)->op_sv, tv);
}
TAG;break;
case OPc_PADOP: TAG;
case OPc_LOOP: TAG;
total_size += sizeof(struct loop);
if (check_new(tv, cLOOPx(baseop)->op_first)) {
- total_size += op_size(cLOOPx(baseop)->op_first, tv);
+ total_size += op_size(aTHX_ cLOOPx(baseop)->op_first, tv);
}
if (check_new(tv, cLOOPx(baseop)->op_last)) {
- total_size += op_size(cLOOPx(baseop)->op_last, tv);
+ total_size += op_size(aTHX_ cLOOPx(baseop)->op_last, tv);
}
if (check_new(tv, cLOOPx(baseop)->op_redoop)) {
- total_size += op_size(cLOOPx(baseop)->op_redoop, tv);
+ total_size += op_size(aTHX_ cLOOPx(baseop)->op_redoop, tv);
}
if (check_new(tv, cLOOPx(baseop)->op_nextop)) {
- total_size += op_size(cLOOPx(baseop)->op_nextop, tv);
+ total_size += op_size(aTHX_ cLOOPx(baseop)->op_nextop, tv);
}
if (check_new(tv, cLOOPx(baseop)->op_lastop)) {
- total_size += op_size(cLOOPx(baseop)->op_lastop, tv);
+ total_size += op_size(aTHX_ cLOOPx(baseop)->op_lastop, tv);
}
TAG;break;
}
#else
if (check_new(tv, basecop->cop_stash)) {
- total_size += thing_size((SV *)basecop->cop_stash, tv);
+ total_size += thing_size(aTHX_ (SV *)basecop->cop_stash, tv);
}
if (check_new(tv, basecop->cop_filegv)) {
- total_size += thing_size((SV *)basecop->cop_filegv, tv);
+ total_size += thing_size(aTHX_ (SV *)basecop->cop_filegv, tv);
}
#endif
# define NEW_HEAD_LAYOUT
#endif
-UV thing_size(const SV * const orig_thing, TRACKING *tv) {
+static UV
+thing_size(pTHX_ const SV * const orig_thing, TRACKING *tv) {
const SV *thing = orig_thing;
UV total_size = sizeof(SV);
case SVt_PV: TAG;
total_size += sizeof(XPV);
#if (PERL_VERSION < 11)
- total_size += SvROK(thing) ? thing_size( SvRV(thing), tv) : SvLEN(thing);
+ total_size += SvROK(thing) ? thing_size(aTHX_ SvRV(thing), tv) : SvLEN(thing);
#else
total_size += SvLEN(thing);
#endif
case SVt_PVIV: TAG;
total_size += sizeof(XPVIV);
#if (PERL_VERSION < 11)
- total_size += SvROK(thing) ? thing_size( SvRV(thing), tv) : SvLEN(thing);
+ total_size += SvROK(thing) ? thing_size(aTHX_ SvRV(thing), tv) : SvLEN(thing);
#else
total_size += SvLEN(thing);
#endif
case SVt_PVNV: TAG;
total_size += sizeof(XPVNV);
#if (PERL_VERSION < 11)
- total_size += SvROK(thing) ? thing_size( SvRV(thing), tv) : SvLEN(thing);
+ total_size += SvROK(thing) ? thing_size(aTHX_ SvRV(thing), tv) : SvLEN(thing);
#else
total_size += SvLEN(thing);
#endif
case SVt_PVMG: TAG;
total_size += sizeof(XPVMG);
#if (PERL_VERSION < 11)
- total_size += SvROK(thing) ? thing_size( SvRV(thing), tv) : SvLEN(thing);
+ total_size += SvROK(thing) ? thing_size(aTHX_ SvRV(thing), tv) : SvLEN(thing);
#else
total_size += SvLEN(thing);
#endif
case SVt_PVBM: TAG;
total_size += sizeof(XPVBM);
#if (PERL_VERSION < 11)
- total_size += SvROK(thing) ? thing_size( SvRV(thing), tv) : SvLEN(thing);
+ total_size += SvROK(thing) ? thing_size(aTHX_ SvRV(thing), tv) : SvLEN(thing);
#else
total_size += SvLEN(thing);
#endif
case SVt_PVLV: TAG;
total_size += sizeof(XPVLV);
#if (PERL_VERSION < 11)
- total_size += SvROK(thing) ? thing_size( SvRV(thing), tv) : SvLEN(thing);
+ total_size += SvROK(thing) ? thing_size(aTHX_ SvRV(thing), tv) : SvLEN(thing);
#else
total_size += SvLEN(thing);
#endif
complain about AvARYLEN() passing thing to it. */
if (AvARYLEN(thing)) {
if (check_new(tv, AvARYLEN(thing))) {
- total_size += thing_size(AvARYLEN(thing), tv);
+ total_size += thing_size(aTHX_ AvARYLEN(thing), tv);
}
}
#endif
total_size += ((XPVIO *) SvANY(thing))->xpv_len;
if (check_new(tv, CvSTASH(thing))) {
- total_size += thing_size((SV *)CvSTASH(thing), tv);
+ total_size += thing_size(aTHX_ (SV *)CvSTASH(thing), tv);
}
if (check_new(tv, SvSTASH(thing))) {
- total_size += thing_size( (SV *)SvSTASH(thing), tv);
+ total_size += thing_size(aTHX_ (SV *)SvSTASH(thing), tv);
}
if (check_new(tv, CvGV(thing))) {
- total_size += thing_size((SV *)CvGV(thing), tv);
+ total_size += thing_size(aTHX_ (SV *)CvGV(thing), tv);
}
if (check_new(tv, CvPADLIST(thing))) {
- total_size += thing_size((SV *)CvPADLIST(thing), tv);
+ total_size += thing_size(aTHX_ (SV *)CvPADLIST(thing), tv);
}
if (check_new(tv, CvOUTSIDE(thing))) {
- total_size += thing_size((SV *)CvOUTSIDE(thing), tv);
- }
- if (check_new(tv, CvSTART(thing))) {
- total_size += op_size(CvSTART(thing), tv);
+ total_size += thing_size(aTHX_ (SV *)CvOUTSIDE(thing), tv);
}
- if (check_new(tv, CvROOT(thing))) {
- total_size += op_size(CvROOT(thing), tv);
+ if (CvISXSUB(thing)) {
+ SV *sv = cv_const_sv((CV *)thing);
+ if (sv) {
+ total_size += thing_size(aTHX_ sv, tv);
+ }
+ } else {
+ if (check_new(tv, CvSTART(thing))) {
+ total_size += op_size(aTHX_ CvSTART(thing), tv);
+ }
+ if (check_new(tv, CvROOT(thing))) {
+ total_size += op_size(aTHX_ CvROOT(thing), tv);
+ }
}
TAG;break;
{
SV *generic_thing;
if ((generic_thing = (SV *)(GvGP(thing)->gp_sv))) {
- total_size += thing_size(generic_thing, tv);
+ total_size += thing_size(aTHX_ generic_thing, tv);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_form))) {
- total_size += thing_size(generic_thing, tv);
+ total_size += thing_size(aTHX_ generic_thing, tv);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_av))) {
- total_size += thing_size(generic_thing, tv);
+ total_size += thing_size(aTHX_ generic_thing, tv);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_hv))) {
- total_size += thing_size(generic_thing, tv);
+ total_size += thing_size(aTHX_ generic_thing, tv);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_egv))) {
- total_size += thing_size(generic_thing, tv);
+ total_size += thing_size(aTHX_ generic_thing, tv);
}
if ((generic_thing = (SV *)(GvGP(thing)->gp_cv))) {
- total_size += thing_size(generic_thing, tv);
+ total_size += thing_size(aTHX_ generic_thing, tv);
}
}
}
total_size += magic_size(thing, tv);
total_size += ((XPVIO *) SvANY(thing))->xpv_len;
if (check_new(tv, CvPADLIST(thing))) {
- total_size += thing_size((SV *)CvPADLIST(thing), tv);
+ total_size += thing_size(aTHX_ (SV *)CvPADLIST(thing), tv);
}
if (check_new(tv, CvOUTSIDE(thing))) {
- total_size += thing_size((SV *)CvOUTSIDE(thing), tv);
+ total_size += thing_size(aTHX_ (SV *)CvOUTSIDE(thing), tv);
}
if (go_yell && !fm_whine) {
}
/* Throw the GVs on the list to be walked if they're not-null */
if (((XPVIO *) SvANY(thing))->xio_top_gv) {
- total_size += thing_size((SV *)((XPVIO *) SvANY(thing))->xio_top_gv,
+ total_size += thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_top_gv,
tv);
}
if (((XPVIO *) SvANY(thing))->xio_bottom_gv) {
- total_size += thing_size((SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv,
+ total_size += thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_bottom_gv,
tv);
}
if (((XPVIO *) SvANY(thing))->xio_fmt_gv) {
- total_size += thing_size((SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv,
+ total_size += thing_size(aTHX_ (SV *)((XPVIO *) SvANY(thing))->xio_fmt_gv,
tv);
}
CODE:
{
SV *thing = orig_thing;
- /* Hash to track our seen pointers */
- //HV *tracking_hash = newHV();
SV *warn_flag;
TRACKING *tv;
Newz( 0xfc0ff, tv, 1, TRACKING );
}
#endif
- RETVAL = thing_size(thing, tv);
+ RETVAL = thing_size(aTHX_ thing, tv);
free_tracking(tv);
}
OUTPUT:
CODE:
{
SV *thing = orig_thing;
- /* Hash to track our seen pointers */
- //HV *tracking_hash;
TRACKING *tv;
/* Array with things we still need to do */
AV *pending_array;
}
/* init these after the go_yell above */
- //tracking_hash = newHV();
Newz( 0xfc0ff, tv, 1, TRACKING );
pending_array = newAV();
the miscalculation.
This is the only way we can check the sizes of arrays and hashes. */
if (SvROK(thing)) {
- RETVAL -= thing_size(thing, NULL);
+ RETVAL -= thing_size(aTHX_ thing, NULL);
}
/* Put it on the pending array */
}
}
- size = thing_size(thing, tv);
+ size = thing_size(aTHX_ thing, tv);
RETVAL += size;
} else {
/* check_new() returned false: */
projects / p5sagit/Devel-Size.git / blobdiff