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 {
	segment *seg;
	heap_free_list free;
};

typedef void (*heap_iterator)(heap_block *compiled,factor_vm *vm);

inline static heap_block *next_block(heap *h, heap_block *block)
{
	cell next = ((cell)block + block->size);
	if(next == h->seg->end)
		return NULL;
	else
		return (heap_block *)next;
}

inline static heap_block *first_block(heap *h)
{
	return (heap_block *)h->seg->start;
}

inline static heap_block *last_block(heap *h)
{
	return (heap_block *)h->seg->end;
}

}