113 lines
2.5 KiB
C++
113 lines
2.5 KiB
C++
#include "master.hpp"
|
|
|
|
namespace factor
|
|
{
|
|
|
|
full_collector::full_collector(factor_vm *parent_) :
|
|
collector<tenured_space,full_policy>(
|
|
parent_,
|
|
&parent_->gc_stats.full_stats,
|
|
parent_->data->tenured,
|
|
full_policy(parent_)) {}
|
|
|
|
struct code_block_marker {
|
|
code_heap *code;
|
|
full_collector *collector;
|
|
|
|
explicit code_block_marker(code_heap *code_, full_collector *collector_) :
|
|
code(code_), collector(collector_) {}
|
|
|
|
code_block *operator()(code_block *compiled)
|
|
{
|
|
if(!code->marked_p(compiled))
|
|
{
|
|
code->set_marked_p(compiled);
|
|
collector->trace_literal_references(compiled);
|
|
}
|
|
|
|
return compiled;
|
|
}
|
|
};
|
|
|
|
void full_collector::mark_reachable_objects()
|
|
{
|
|
code_block_marker marker(code,this);
|
|
std::vector<object *> *mark_stack = &this->target->mark_stack;
|
|
|
|
while(!mark_stack->empty())
|
|
{
|
|
object *obj = mark_stack->back();
|
|
mark_stack->pop_back();
|
|
this->trace_slots(obj);
|
|
parent->visit_object_code_block(obj,marker);
|
|
}
|
|
}
|
|
|
|
struct object_start_map_updater {
|
|
object_start_map *starts;
|
|
|
|
object_start_map_updater(object_start_map *starts_) : starts(starts_) {}
|
|
|
|
void operator()(object *obj, cell size)
|
|
{
|
|
starts->record_object_start_offset(obj);
|
|
}
|
|
};
|
|
|
|
void factor_vm::collect_full_impl(bool trace_contexts_p)
|
|
{
|
|
full_collector collector(this);
|
|
|
|
code->clear_mark_bits();
|
|
data->tenured->clear_mark_bits();
|
|
data->tenured->clear_mark_stack();
|
|
|
|
collector.trace_roots();
|
|
if(trace_contexts_p)
|
|
{
|
|
collector.trace_contexts();
|
|
code_block_marker marker(code,&collector);
|
|
visit_context_code_blocks(marker);
|
|
visit_callback_code_blocks(marker);
|
|
}
|
|
|
|
collector.mark_reachable_objects();
|
|
|
|
data->tenured->starts.clear_object_start_offsets();
|
|
object_start_map_updater updater(&data->tenured->starts);
|
|
data->tenured->sweep(updater);
|
|
|
|
data->reset_generation(data->tenured);
|
|
data->reset_generation(data->aging);
|
|
data->reset_generation(&nursery);
|
|
code->clear_remembered_set();
|
|
}
|
|
|
|
void factor_vm::collect_growing_heap(cell requested_bytes,
|
|
bool trace_contexts_p,
|
|
bool compact_code_heap_p)
|
|
{
|
|
/* Grow the data heap and copy all live objects to the new heap. */
|
|
data_heap *old = data;
|
|
set_data_heap(data->grow(requested_bytes));
|
|
collect_full_impl(trace_contexts_p);
|
|
delete old;
|
|
|
|
if(compact_code_heap_p)
|
|
compact_code_heap(trace_contexts_p);
|
|
else
|
|
relocate_code_heap();
|
|
}
|
|
|
|
void factor_vm::collect_full(bool trace_contexts_p, bool compact_code_heap_p)
|
|
{
|
|
collect_full_impl(trace_contexts_p);
|
|
|
|
if(compact_code_heap_p)
|
|
compact_code_heap(trace_contexts_p);
|
|
else
|
|
update_code_heap_words_and_literals();
|
|
}
|
|
|
|
}
|