3 static const cell free_list_count = 32;
4 static const cell allocation_page_size = 1024;
6 struct free_heap_block {
9 bool free_p() const { return (header & 1) == 1; }
12 cell size = header & ~7;
13 FACTOR_ASSERT(size > 0);
17 void make_free(cell size) {
18 FACTOR_ASSERT(size > 0);
23 struct block_size_compare {
24 bool operator()(free_heap_block* a, free_heap_block* b) const {
25 return a->size() < b->size();
29 typedef std::multiset<free_heap_block*, block_size_compare> large_block_set;
32 std::vector<free_heap_block*> small_blocks[free_list_count];
33 large_block_set large_blocks;
34 cell free_block_count;
37 void clear_free_list();
38 void initial_free_list(cell start, cell end, cell occupied);
39 void add_to_free_list(free_heap_block* block);
40 free_heap_block* find_free_block(cell size);
41 free_heap_block* split_free_block(free_heap_block* block, cell size);
42 bool can_allot_p(cell size);
43 cell largest_free_block();