94 lines
2.2 KiB
C++
94 lines
2.2 KiB
C++
namespace factor
|
|
{
|
|
|
|
static const cell free_list_count = 16;
|
|
static const cell block_size_increment = 32;
|
|
|
|
struct heap_free_list {
|
|
free_heap_block *small_blocks[free_list_count];
|
|
free_heap_block *large_blocks;
|
|
};
|
|
|
|
struct heap {
|
|
bool secure_gc;
|
|
segment *seg;
|
|
heap_free_list free;
|
|
unordered_map<heap_block *, char *> forwarding;
|
|
|
|
explicit heap(bool secure_gc_, cell size, bool executable_p);
|
|
|
|
inline heap_block *next_block(heap_block *block)
|
|
{
|
|
cell next = ((cell)block + block->size());
|
|
if(next == seg->end)
|
|
return NULL;
|
|
else
|
|
return (heap_block *)next;
|
|
}
|
|
|
|
inline heap_block *first_block()
|
|
{
|
|
return (heap_block *)seg->start;
|
|
}
|
|
|
|
inline heap_block *last_block()
|
|
{
|
|
return (heap_block *)seg->end;
|
|
}
|
|
|
|
void clear_free_list();
|
|
void new_heap(cell size);
|
|
void add_to_free_list(free_heap_block *block);
|
|
void build_free_list(cell size);
|
|
void assert_free_block(free_heap_block *block);
|
|
free_heap_block *find_free_block(cell size);
|
|
free_heap_block *split_free_block(free_heap_block *block, cell size);
|
|
heap_block *heap_allot(cell size, cell type);
|
|
void heap_free(heap_block *block);
|
|
void mark_block(heap_block *block);
|
|
void clear_mark_bits();
|
|
void heap_usage(cell *used, cell *total_free, cell *max_free);
|
|
cell heap_size();
|
|
void compact_heap();
|
|
|
|
heap_block *free_allocated(heap_block *prev, heap_block *scan);
|
|
|
|
/* After code GC, all referenced code blocks have status set to B_MARKED, so any
|
|
which are allocated and not marked can be reclaimed. */
|
|
template<typename Iterator> void free_unmarked(Iterator &iter)
|
|
{
|
|
clear_free_list();
|
|
|
|
heap_block *prev = NULL;
|
|
heap_block *scan = first_block();
|
|
|
|
while(scan)
|
|
{
|
|
if(scan->type() == FREE_BLOCK_TYPE)
|
|
{
|
|
if(prev && prev->type() == FREE_BLOCK_TYPE)
|
|
prev->set_size(prev->size() + scan->size());
|
|
else
|
|
prev = scan;
|
|
}
|
|
else if(scan->marked_p())
|
|
{
|
|
if(prev && prev->type() == FREE_BLOCK_TYPE)
|
|
add_to_free_list((free_heap_block *)prev);
|
|
scan->set_marked_p(false);
|
|
prev = scan;
|
|
iter(scan);
|
|
}
|
|
else
|
|
prev = free_allocated(prev,scan);
|
|
|
|
scan = next_block(scan);
|
|
}
|
|
|
|
if(prev && prev->type() == FREE_BLOCK_TYPE)
|
|
add_to_free_list((free_heap_block *)prev);
|
|
}
|
|
};
|
|
|
|
}
|