module rt.gc.cdgc.bits;
-import libc = rt.gc.cdgc.libc;
+import os = rt.gc.cdgc.os;
+
+import cstring = tango.stdc.string;
private extern (C) void onOutOfMemoryError();
size_t nwords = 0; // allocated words in data[] excluding sentinals
size_t nbits = 0; // number of bits in data[] excluding sentinals
- void Dtor()
+ /// Get the number of bytes needed to store nbits bits
+ size_t data_size()
{
+ return (nwords + 2) * uint.sizeof; // +2 for sentinels
+ }
+
+ void Dtor(os.Vis vis = os.Vis.PRIV)
+ {
+ // Even when os.dealloc() can be called with a null pointer, the extra
+ // call might be significant. On hard GC benchmarks making the test for
+ // null here (i.e. not making the call) can reduce the GC time by
+ // almost ~5%.
if (data)
{
- libc.free(data);
+ os.dealloc(data, data_size, vis);
data = null;
}
}
invariant
{
if (data)
- {
- assert(nwords * data[0].sizeof * 8 >= nbits);
- }
+ assert (nwords ==
+ ((nbits + (BITS_PER_WORD - 1)) >> BITS_SHIFT));
}
- void alloc(size_t nbits)
+ void alloc(size_t nbits, os.Vis vis = os.Vis.PRIV)
{
this.nbits = nbits;
- nwords = (nbits + (BITS_PER_WORD - 1)) >> BITS_SHIFT;
- data = cast(uint*)libc.calloc(nwords + 2, uint.sizeof);
+ this.nwords = (nbits + (BITS_PER_WORD - 1)) >> BITS_SHIFT;
+ this.data = cast(uint*) os.alloc(data_size, vis);
if (!data)
onOutOfMemoryError();
}
}
}
else
- { uint result;
-
+ {
//result = (cast(bit *)(data + 1))[i];
//(cast(bit *)(data + 1))[i] = 0;
uint* p = &data[1 + (i >> BITS_SHIFT)];
uint mask = (1 << (i & BITS_MASK));
- result = *p & mask;
+ uint result = *p & mask;
*p &= ~mask;
return result;
}
for (;d1!=dEnd;++d1)
*d1=0u;
} else {
- libc.memset(data + 1, 0, nwords * uint.sizeof);
+ cstring.memset(data + 1, 0, nwords * uint.sizeof);
}
}
for (;d1!=dEnd;++d1,++d2)
*d1=*d2;
} else {
- libc.memcpy(data + 1, f.data + 1, nwords * uint.sizeof);
+ cstring.memcpy(data + 1, f.data + 1, nwords * uint.sizeof);
}
}
b.Dtor();
}
+
+
+// vim: set et sw=4 sts=4 :