6 inline static code_block_visitor<code_workhorse> make_code_visitor(factor_vm *parent)
8 return code_block_visitor<code_workhorse>(parent,code_workhorse(parent));
11 full_collector::full_collector(factor_vm *parent_) :
12 collector<tenured_space,full_policy>(
14 parent_->data->tenured,
15 full_policy(parent_)),
16 code_visitor(make_code_visitor(parent_)) {}
18 void full_collector::trace_code_block(code_block *compiled)
20 data_visitor.visit_code_block_objects(compiled);
21 data_visitor.visit_embedded_literals(compiled);
22 code_visitor.visit_embedded_code_pointers(compiled);
25 void full_collector::trace_context_code_blocks()
27 code_visitor.visit_context_code_blocks();
30 void full_collector::trace_uninitialized_code_blocks()
32 code_visitor.visit_uninitialized_code_blocks();
35 void full_collector::trace_object_code_block(object *obj)
37 code_visitor.visit_object_code_block(obj);
40 /* After a sweep, invalidate any code heap roots which are not marked,
41 so that if a block makes a tail call to a generic word, and the PIC
42 compiler triggers a GC, and the caller block gets gets GCd as a result,
43 the PIC code won't try to overwrite the call site */
44 void factor_vm::update_code_roots_for_sweep()
46 std::vector<code_root *>::const_iterator iter = code_roots.begin();
47 std::vector<code_root *>::const_iterator end = code_roots.end();
49 mark_bits<code_block> *state = &code->allocator->state;
51 for(; iter < end; iter++)
53 code_root *root = *iter;
54 code_block *block = (code_block *)(root->value & (~data_alignment - 1));
55 if(root->valid && !state->marked_p(block))
60 void factor_vm::collect_mark_impl(bool trace_contexts_p)
62 full_collector collector(this);
66 code->clear_mark_bits();
67 data->tenured->clear_mark_bits();
69 collector.trace_roots();
72 collector.trace_contexts();
73 collector.trace_context_code_blocks();
74 collector.trace_uninitialized_code_blocks();
77 while(!mark_stack.empty())
79 cell ptr = mark_stack.back();
80 mark_stack.pop_back();
84 code_block *compiled = (code_block *)(ptr - 1);
85 collector.trace_code_block(compiled);
89 object *obj = (object *)ptr;
90 collector.trace_object(obj);
91 collector.trace_object_code_block(obj);
95 data->reset_generation(data->tenured);
96 data->reset_generation(data->aging);
97 data->reset_generation(&nursery);
98 code->clear_remembered_set();
101 void factor_vm::collect_sweep_impl()
103 current_gc->event->started_data_sweep();
104 data->tenured->sweep();
105 current_gc->event->ended_data_sweep();
107 update_code_roots_for_sweep();
109 current_gc->event->started_code_sweep();
110 code->allocator->sweep();
111 current_gc->event->ended_code_sweep();
114 void factor_vm::collect_full(bool trace_contexts_p)
116 collect_mark_impl(trace_contexts_p);
117 collect_sweep_impl();
119 if(data->low_memory_p())
121 current_gc->op = collect_growing_heap_op;
122 current_gc->event->op = collect_growing_heap_op;
123 collect_growing_heap(0,trace_contexts_p);
125 else if(data->high_fragmentation_p())
127 current_gc->op = collect_compact_op;
128 current_gc->event->op = collect_compact_op;
129 collect_compact_impl(trace_contexts_p);
132 code->flush_icache();