6 full_collector::full_collector(factor_vm *parent_) :
7 collector<tenured_space,full_policy>(parent_,parent_->data->tenured,full_policy(parent_)),
8 code_visitor(parent,workhorse) {}
10 void full_collector::trace_code_block(code_block *compiled)
12 data_visitor.visit_code_block_objects(compiled);
13 data_visitor.visit_embedded_literals(compiled);
14 code_visitor.visit_embedded_code_pointers(compiled);
17 void full_collector::trace_context_code_blocks()
19 code_visitor.visit_context_code_blocks();
22 void full_collector::trace_uninitialized_code_blocks()
24 code_visitor.visit_uninitialized_code_blocks();
27 void full_collector::trace_object_code_block(object *obj)
29 code_visitor.visit_object_code_block(obj);
32 /* After a sweep, invalidate any code heap roots which are not marked,
33 so that if a block makes a tail call to a generic word, and the PIC
34 compiler triggers a GC, and the caller block gets gets GCd as a result,
35 the PIC code won't try to overwrite the call site */
36 void factor_vm::update_code_roots_for_sweep()
38 std::vector<code_root *>::const_iterator iter = code_roots.begin();
39 std::vector<code_root *>::const_iterator end = code_roots.end();
41 mark_bits<code_block> *state = &code->allocator->state;
43 for(; iter < end; iter++)
45 code_root *root = *iter;
46 code_block *block = (code_block *)(root->value & (~data_alignment - 1));
47 if(root->valid && !state->marked_p(block))
52 void factor_vm::collect_mark_impl(bool trace_contexts_p)
54 full_collector collector(this);
58 code->clear_mark_bits();
59 data->tenured->clear_mark_bits();
61 collector.trace_roots();
64 collector.trace_contexts();
65 collector.trace_context_code_blocks();
66 collector.trace_uninitialized_code_blocks();
69 while(!mark_stack.empty())
71 cell ptr = mark_stack.back();
72 mark_stack.pop_back();
76 code_block *compiled = (code_block *)(ptr - 1);
77 collector.trace_code_block(compiled);
81 object *obj = (object *)ptr;
82 collector.trace_object(obj);
83 collector.trace_object_code_block(obj);
87 data->reset_generation(data->tenured);
88 data->reset_generation(data->aging);
89 data->reset_generation(&nursery);
90 code->clear_remembered_set();
93 void factor_vm::collect_sweep_impl()
95 current_gc->event->started_data_sweep();
96 data->tenured->sweep();
97 current_gc->event->ended_data_sweep();
99 update_code_roots_for_sweep();
101 current_gc->event->started_code_sweep();
102 code->allocator->sweep();
103 current_gc->event->ended_code_sweep();
106 void factor_vm::collect_full(bool trace_contexts_p)
108 collect_mark_impl(trace_contexts_p);
109 collect_sweep_impl();
111 if(data->low_memory_p())
113 current_gc->op = collect_growing_heap_op;
114 current_gc->event->op = collect_growing_heap_op;
115 collect_growing_heap(0,trace_contexts_p);
117 else if(data->high_fragmentation_p())
119 current_gc->op = collect_compact_op;
120 current_gc->event->op = collect_compact_op;
121 collect_compact_impl(trace_contexts_p);
124 code->flush_icache();