4 const int block_granularity = 16;
5 const int forwarding_granularity = 64;
7 template<typename Block, typename HeapLayout> struct mark_bits {
15 void clear_mark_bits()
17 memset(marked,0,bits_size * sizeof(u64));
20 void clear_forwarding()
22 memset(forwarding,0,bits_size * sizeof(cell));
25 explicit mark_bits(cell start_, cell size_) :
28 bits_size(size / block_granularity / forwarding_granularity),
29 marked(new u64[bits_size]),
30 forwarding(new cell[bits_size])
44 cell block_line(Block *address)
46 return (((cell)address - start) / block_granularity);
49 Block *line_block(cell line)
51 return (Block *)(line * block_granularity + start);
54 std::pair<cell,cell> bitmap_deref(Block *address)
56 cell line_number = block_line(address);
57 cell word_index = (line_number >> 6);
58 cell word_shift = (line_number & 63);
61 assert(word_index < bits_size);
64 return std::make_pair(word_index,word_shift);
67 bool bitmap_elt(u64 *bits, Block *address)
69 std::pair<cell,cell> pair = bitmap_deref(address);
70 return (bits[pair.first] & ((u64)1 << pair.second)) != 0;
73 Block *next_block_after(Block *block)
75 return (Block *)((cell)block + layout.block_size(block));
78 void set_bitmap_range(u64 *bits, Block *address)
80 std::pair<cell,cell> start = bitmap_deref(address);
81 std::pair<cell,cell> end = bitmap_deref(next_block_after(address));
83 u64 start_mask = ((u64)1 << start.second) - 1;
84 u64 end_mask = ((u64)1 << end.second) - 1;
86 if(start.first == end.first)
87 bits[start.first] |= start_mask ^ end_mask;
90 bits[start.first] |= ~start_mask;
92 for(cell index = start.first + 1; index < end.first; index++)
93 bits[index] = (u64)-1;
95 bits[end.first] |= end_mask;
99 bool is_marked_p(Block *address)
101 return bitmap_elt(marked,address);
104 void set_marked_p(Block *address)
106 set_bitmap_range(marked,address);
109 /* From http://chessprogramming.wikispaces.com/Population+Count */
112 u64 k1 = 0x5555555555555555ll;
113 u64 k2 = 0x3333333333333333ll;
114 u64 k4 = 0x0f0f0f0f0f0f0f0fll;
115 u64 kf = 0x0101010101010101ll;
116 x = x - ((x >> 1) & k1); // put count of each 2 bits into those 2 bits
117 x = (x & k2) + ((x >> 2) & k2); // put count of each 4 bits into those 4 bits
118 x = (x + (x >> 4)) & k4 ; // put count of each 8 bits into those 8 bits
119 x = (x * kf) >> 56; // returns 8 most significant bits of x + (x<<8) + (x<<16) + (x<<24) + ...
124 /* The eventual destination of a block after compaction is just the number
125 of marked blocks before it. Live blocks must be marked on entry. */
126 void compute_forwarding()
129 for(cell index = 0; index < bits_size; index++)
131 forwarding[index] = accum;
132 accum += popcount(marked[index]);
136 /* We have the popcount for every 64 entries; look up and compute the rest */
137 Block *forward_block(Block *original)
139 std::pair<cell,cell> pair = bitmap_deref(original);
141 cell approx_popcount = forwarding[pair.first];
142 u64 mask = ((u64)1 << pair.second) - 1;
144 cell new_line_number = approx_popcount + popcount(marked[pair.first] & mask);
145 return line_block(new_line_number);
149 template<typename Block, typename HeapLayout, typename Iterator> struct heap_compactor {
150 mark_bits<Block,HeapLayout> *state;
154 explicit heap_compactor(mark_bits<Block,HeapLayout> *state_, Block *address_, Iterator &iter_) :
155 state(state_), address((char *)address_), iter(iter_) {}
157 void operator()(Block *block, cell size)
159 if(this->state->is_marked_p(block))
161 memmove(address,block,size);
162 iter((Block *)address,size);