2009-10-07 16:48:09 -04:00
|
|
|
namespace factor
|
|
|
|
{
|
|
|
|
|
2009-10-20 23:20:49 -04:00
|
|
|
struct tenured_space : free_list_allocator<object> {
|
2009-10-20 14:47:04 -04:00
|
|
|
object_start_map starts;
|
2009-10-20 23:20:49 -04:00
|
|
|
std::vector<object *> mark_stack;
|
2009-10-20 14:47:04 -04:00
|
|
|
|
|
|
|
tenured_space(cell size, cell start) :
|
2009-10-20 23:20:49 -04:00
|
|
|
free_list_allocator<object>(size,start), starts(size,start) {}
|
2009-10-20 14:47:04 -04:00
|
|
|
|
|
|
|
object *allot(cell size)
|
|
|
|
{
|
2009-10-20 23:20:49 -04:00
|
|
|
object *obj = free_list_allocator<object>::allot(size);
|
|
|
|
if(obj)
|
|
|
|
{
|
|
|
|
starts.record_object_start_offset(obj);
|
|
|
|
return obj;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
object *first_allocated_block_after(object *block)
|
|
|
|
{
|
|
|
|
while(block != this->last_block() && block->free_p())
|
|
|
|
{
|
|
|
|
free_heap_block *free_block = (free_heap_block *)block;
|
|
|
|
block = (object *)((cell)free_block + free_block->size());
|
|
|
|
}
|
|
|
|
|
|
|
|
if(block == this->last_block())
|
|
|
|
return NULL;
|
|
|
|
else
|
|
|
|
return block;
|
|
|
|
}
|
|
|
|
|
|
|
|
cell first_object()
|
|
|
|
{
|
|
|
|
return (cell)first_allocated_block_after(this->first_block());
|
|
|
|
}
|
|
|
|
|
|
|
|
cell next_object_after(cell scan)
|
|
|
|
{
|
|
|
|
cell size = ((object *)scan)->size();
|
|
|
|
object *next = (object *)(scan + size);
|
|
|
|
return (cell)first_allocated_block_after(next);
|
|
|
|
}
|
|
|
|
|
|
|
|
void clear_mark_bits()
|
|
|
|
{
|
|
|
|
state.clear_mark_bits();
|
|
|
|
}
|
2009-10-20 14:47:04 -04:00
|
|
|
|
2009-10-20 23:20:49 -04:00
|
|
|
bool marked_p(object *obj)
|
|
|
|
{
|
|
|
|
return this->state.marked_p(obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mark_and_push(object *obj)
|
|
|
|
{
|
|
|
|
this->state.set_marked_p(obj);
|
|
|
|
this->mark_stack.push_back(obj);
|
2009-10-20 14:47:04 -04:00
|
|
|
}
|
2009-10-07 16:48:09 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|