2013-05-11 22:29:34 -04:00
|
|
|
namespace factor {
|
2009-10-07 16:48:09 -04:00
|
|
|
|
2009-10-20 23:20:49 -04:00
|
|
|
struct tenured_space : free_list_allocator<object> {
|
2013-05-11 22:29:34 -04:00
|
|
|
object_start_map starts;
|
|
|
|
|
2013-05-12 21:48:38 -04:00
|
|
|
tenured_space(cell size, cell start)
|
2013-05-11 22:29:34 -04:00
|
|
|
: free_list_allocator<object>(size, start), starts(size, start) {}
|
|
|
|
|
|
|
|
object* allot(cell size) {
|
|
|
|
object* obj = free_list_allocator<object>::allot(size);
|
|
|
|
if (obj) {
|
|
|
|
starts.record_object_start_offset(obj);
|
|
|
|
return obj;
|
2015-08-14 16:31:04 -04:00
|
|
|
}
|
|
|
|
return NULL;
|
2013-05-11 22:29:34 -04:00
|
|
|
}
|
|
|
|
|
2015-05-30 14:07:16 -04:00
|
|
|
cell next_allocated_object_after(cell scan) {
|
|
|
|
while (scan != this->end && ((object*)scan)->free_p()) {
|
|
|
|
free_heap_block* free_block = (free_heap_block*)scan;
|
|
|
|
scan = (cell)free_block + free_block->size();
|
|
|
|
}
|
|
|
|
return scan == this->end ? 0 : scan;
|
|
|
|
}
|
|
|
|
|
2013-05-11 22:29:34 -04:00
|
|
|
cell first_object() {
|
2015-05-30 14:07:16 -04:00
|
|
|
return next_allocated_object_after(this->start);
|
2013-05-11 22:29:34 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
cell next_object_after(cell scan) {
|
|
|
|
cell size = ((object*)scan)->size();
|
2015-05-30 14:07:16 -04:00
|
|
|
return next_allocated_object_after(scan + size);
|
2013-05-11 22:29:34 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
void sweep() {
|
|
|
|
free_list_allocator<object>::sweep();
|
|
|
|
starts.update_for_sweep(&this->state);
|
|
|
|
}
|
2009-10-07 16:48:09 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|