6 gc_event::gc_event(gc_op op_, factor_vm *parent) :
10 code_blocks_scanned(0),
11 start_time(nano_count()),
18 data_heap_before = parent->data_room();
19 code_heap_before = parent->code_room();
20 start_time = nano_count();
23 void gc_event::started_card_scan()
25 temp_time = nano_count();
28 void gc_event::ended_card_scan(cell cards_scanned_, cell decks_scanned_)
30 cards_scanned += cards_scanned_;
31 decks_scanned += decks_scanned_;
32 card_scan_time = (nano_count() - temp_time);
35 void gc_event::started_code_scan()
37 temp_time = nano_count();
40 void gc_event::ended_code_scan(cell code_blocks_scanned_)
42 code_blocks_scanned += code_blocks_scanned_;
43 code_scan_time = (nano_count() - temp_time);
46 void gc_event::started_data_sweep()
48 temp_time = nano_count();
51 void gc_event::ended_data_sweep()
53 data_sweep_time = (nano_count() - temp_time);
56 void gc_event::started_code_sweep()
58 temp_time = nano_count();
61 void gc_event::ended_code_sweep()
63 code_sweep_time = (nano_count() - temp_time);
66 void gc_event::started_compaction()
68 temp_time = nano_count();
71 void gc_event::ended_compaction()
73 compaction_time = (nano_count() - temp_time);
76 void gc_event::ended_gc(factor_vm *parent)
78 data_heap_after = parent->data_room();
79 code_heap_after = parent->code_room();
80 total_time = nano_count() - start_time;
83 gc_state::gc_state(gc_op op_, factor_vm *parent) : op(op_), start_time(nano_count())
85 event = new gc_event(op,parent);
94 void factor_vm::end_gc()
96 current_gc->event->ended_gc(this);
97 if(gc_events) gc_events->push_back(*current_gc->event);
98 delete current_gc->event;
99 current_gc->event = NULL;
102 void factor_vm::start_gc_again()
106 switch(current_gc->op)
108 case collect_nursery_op:
109 current_gc->op = collect_aging_op;
111 case collect_aging_op:
112 current_gc->op = collect_to_tenured_op;
114 case collect_to_tenured_op:
115 current_gc->op = collect_full_op;
117 case collect_full_op:
118 case collect_compact_op:
119 current_gc->op = collect_growing_heap_op;
122 critical_error("Bad GC op",current_gc->op);
126 current_gc->event = new gc_event(current_gc->op,this);
129 void factor_vm::update_code_heap_for_minor_gc(std::set<code_block *> *remembered_set)
131 /* The youngest generation that any code block can now reference */
132 std::set<code_block *>::const_iterator iter = remembered_set->begin();
133 std::set<code_block *>::const_iterator end = remembered_set->end();
135 for(; iter != end; iter++) update_literal_references(*iter);
138 void factor_vm::gc(gc_op op, cell requested_bytes, bool trace_contexts_p)
145 current_gc = new gc_state(op,this);
147 /* Keep trying to GC higher and higher generations until we don't run out
149 if(setjmp(current_gc->gc_unwind))
151 /* We come back here if a generation is full */
155 current_gc->event->op = current_gc->op;
157 switch(current_gc->op)
159 case collect_nursery_op:
162 case collect_aging_op:
164 if(data->low_memory_p())
166 current_gc->op = collect_full_op;
167 current_gc->event->op = collect_full_op;
168 collect_full(trace_contexts_p);
171 case collect_to_tenured_op:
172 collect_to_tenured();
173 if(data->low_memory_p())
175 current_gc->op = collect_full_op;
176 current_gc->event->op = collect_full_op;
177 collect_full(trace_contexts_p);
180 case collect_full_op:
181 collect_full(trace_contexts_p);
183 case collect_compact_op:
184 collect_compact(trace_contexts_p);
186 case collect_growing_heap_op:
187 collect_growing_heap(requested_bytes,trace_contexts_p);
190 critical_error("Bad GC op",current_gc->op);
200 void factor_vm::primitive_minor_gc()
202 gc(collect_nursery_op,
203 0, /* requested size */
204 true /* trace contexts? */);
207 void factor_vm::primitive_full_gc()
210 0, /* requested size */
211 true /* trace contexts? */);
214 void factor_vm::primitive_compact_gc()
216 gc(collect_compact_op,
217 0, /* requested size */
218 true /* trace contexts? */);
221 void factor_vm::inline_gc(cell *data_roots_base, cell data_roots_size)
223 data_roots.push_back(data_root_range(data_roots_base,data_roots_size));
224 primitive_minor_gc();
225 data_roots.pop_back();
228 VM_C_API void inline_gc(cell *data_roots_base, cell data_roots_size, factor_vm *parent)
230 parent->inline_gc(data_roots_base,data_roots_size);
234 * It is up to the caller to fill in the object's fields in a meaningful
237 object *factor_vm::allot_large_object(cell type, cell size)
239 /* If tenured space does not have enough room, collect and compact */
240 if(!data->tenured->can_allot_p(size))
242 primitive_compact_gc();
244 /* If it still won't fit, grow the heap */
245 if(!data->tenured->can_allot_p(size))
247 gc(collect_growing_heap_op,
248 size, /* requested size */
249 true /* trace contexts? */);
253 object *obj = data->tenured->allot(size);
255 /* Allows initialization code to store old->new pointers
256 without hitting the write barrier in the common case of
257 a nursery allocation */
258 write_barrier(obj,size);
260 obj->initialize(type);
264 void factor_vm::primitive_enable_gc_events()
266 gc_events = new std::vector<gc_event>();
269 void factor_vm::primitive_disable_gc_events()
273 growable_array result(this);
275 std::vector<gc_event> *gc_events = this->gc_events;
276 this->gc_events = NULL;
278 std::vector<gc_event>::const_iterator iter = gc_events->begin();
279 std::vector<gc_event>::const_iterator end = gc_events->end();
281 for(; iter != end; iter++)
283 gc_event event = *iter;
284 byte_array *obj = byte_array_from_value(&event);
285 result.add(tag<byte_array>(obj));
289 dpush(result.elements.value());
291 delete this->gc_events;