import rt.gc.cdgc.bits: GCBits;
import rt.gc.cdgc.stats: GCStats, Stats;
import dynarray = rt.gc.cdgc.dynarray;
-import alloc = rt.gc.cdgc.alloc;
+import os = rt.gc.cdgc.os;
import opts = rt.gc.cdgc.opts;
import cstdlib = tango.stdc.stdlib;
/**
* Compute bin for size.
*/
-static Bins findBin(size_t size)
+Bins findBin(size_t size)
{
Bins bin;
if (size <= 256)
//printf("marking range: %p -> %p\n", pbot, ptop);
for (; p1 + type_size <= p2; p1 += type_size) {
- size_t n = 0;
- if (has_type_info) {
- while (n < type_size && pm_bits[n / BITS_PER_WORD] == 0)
- n += BITS_PER_WORD;
- if (n < type_size && (pm_bits[n / BITS_PER_WORD] &
- ((1 << (BITS_PER_WORD / 2)) - 1)) == 0)
- n += BITS_PER_WORD / 2;
- else if (n < type_size && (pm_bits[n / BITS_PER_WORD] &
- ((1 << (BITS_PER_WORD / 4)) - 1)) == 0)
- n += BITS_PER_WORD / 4;
- }
- for (; n < type_size; n++) {
+ for (size_t n = 0; n < type_size; n++) {
// scan bit set for this word
if (has_type_info &&
!(pm_bits[n / BITS_PER_WORD] & (1 << (n % BITS_PER_WORD))))
{
size_t poolsize = npages * PAGESIZE;
assert(poolsize >= POOLSIZE);
- baseAddr = cast(byte *) alloc.os_mem_map(poolsize);
+ baseAddr = cast(byte *) os.alloc(poolsize);
// Some of the code depends on page alignment of memory pools
assert((cast(size_t)baseAddr & (PAGESIZE - 1)) == 0);
if (npages)
{
- result = alloc.os_mem_unmap(baseAddr, npages * PAGESIZE);
+ result = os.dealloc(baseAddr, npages * PAGESIZE);
assert(result);
npages = 0;
}