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 = (cell)(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 = (cell)(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 = (cell)(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 = (cell)(nano_count() - temp_time);
66 void gc_event::started_compaction()
68 temp_time = nano_count();
71 void gc_event::ended_compaction()
73 compaction_time = (cell)(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 = (cell)(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::gc(gc_op op, cell requested_bytes, bool trace_contexts_p)
131 /* Save and reset FPU state before, restore it after, so that
132 nano_count() doesn't bomb on Windows if inexact traps are enabled
134 cell fpu_state = get_fpu_state();
139 current_gc = new gc_state(op,this);
141 /* Keep trying to GC higher and higher generations until we don't run out
147 current_gc->event->op = current_gc->op;
149 switch(current_gc->op)
151 case collect_nursery_op:
154 case collect_aging_op:
156 if(data->high_fragmentation_p())
158 current_gc->op = collect_full_op;
159 current_gc->event->op = collect_full_op;
160 collect_full(trace_contexts_p);
163 case collect_to_tenured_op:
164 collect_to_tenured();
165 if(data->high_fragmentation_p())
167 current_gc->op = collect_full_op;
168 current_gc->event->op = collect_full_op;
169 collect_full(trace_contexts_p);
172 case collect_full_op:
173 collect_full(trace_contexts_p);
175 case collect_compact_op:
176 collect_compact(trace_contexts_p);
178 case collect_growing_heap_op:
179 collect_growing_heap(requested_bytes,trace_contexts_p);
182 critical_error("Bad GC op",current_gc->op);
188 catch(const must_start_gc_again &)
190 /* We come back here if a generation is full */
201 set_fpu_state(fpu_state);
204 /* primitive_minor_gc() is invoked by inline GC checks, and it needs to fill in
205 uninitialized stack locations before actually calling the GC. See the comment
206 in compiler.cfg.stacks.uninitialized for details. */
208 struct call_frame_scrubber {
212 explicit call_frame_scrubber(factor_vm *parent_, context *ctx_) :
213 parent(parent_), ctx(ctx_) {}
215 void operator()(stack_frame *frame)
217 cell return_address = parent->frame_offset(frame);
218 if(return_address == (cell)-1)
221 code_block *compiled = parent->frame_code(frame);
222 gc_info *info = compiled->block_gc_info();
224 assert(return_address < compiled->size());
225 int index = info->return_address_index(return_address);
227 ctx->scrub_stacks(info,index);
231 void factor_vm::scrub_context(context *ctx)
233 call_frame_scrubber scrubber(this,ctx);
234 iterate_callstack(ctx,scrubber);
237 void factor_vm::scrub_contexts()
239 std::set<context *>::const_iterator begin = active_contexts.begin();
240 std::set<context *>::const_iterator end = active_contexts.end();
243 scrub_context(*begin);
248 void factor_vm::primitive_minor_gc()
252 gc(collect_nursery_op,
253 0, /* requested size */
254 true /* trace contexts? */);
257 void factor_vm::primitive_full_gc()
260 0, /* requested size */
261 true /* trace contexts? */);
264 void factor_vm::primitive_compact_gc()
266 gc(collect_compact_op,
267 0, /* requested size */
268 true /* trace contexts? */);
272 * It is up to the caller to fill in the object's fields in a meaningful
275 object *factor_vm::allot_large_object(cell type, cell size)
277 /* If tenured space does not have enough room, collect and compact */
278 if(!data->tenured->can_allot_p(size))
280 primitive_compact_gc();
282 /* If it still won't fit, grow the heap */
283 if(!data->tenured->can_allot_p(size))
285 gc(collect_growing_heap_op,
286 size, /* requested size */
287 true /* trace contexts? */);
291 object *obj = data->tenured->allot(size);
293 /* Allows initialization code to store old->new pointers
294 without hitting the write barrier in the common case of
295 a nursery allocation */
296 write_barrier(obj,size);
298 obj->initialize(type);
302 void factor_vm::primitive_enable_gc_events()
304 gc_events = new std::vector<gc_event>();
307 void factor_vm::primitive_disable_gc_events()
311 growable_array result(this);
313 std::vector<gc_event> *gc_events = this->gc_events;
314 this->gc_events = NULL;
316 std::vector<gc_event>::const_iterator iter = gc_events->begin();
317 std::vector<gc_event>::const_iterator end = gc_events->end();
319 for(; iter != end; iter++)
321 gc_event event = *iter;
322 byte_array *obj = byte_array_from_value(&event);
323 result.add(tag<byte_array>(obj));
327 ctx->push(result.elements.value());
329 delete this->gc_events;
332 ctx->push(false_object);