5 gc_event::gc_event(gc_op op, factor_vm* parent)
9 code_blocks_scanned(0),
10 start_time(nano_count()),
16 data_heap_before = parent->data_room();
17 code_heap_before = parent->code->allocator->as_allocator_room();
18 start_time = nano_count();
21 void gc_event::reset_timer() { temp_time = nano_count(); }
23 void gc_event::ended_card_scan(cell cards_scanned_, cell decks_scanned_) {
24 cards_scanned += cards_scanned_;
25 decks_scanned += decks_scanned_;
26 card_scan_time = (cell)(nano_count() - temp_time);
29 void gc_event::ended_code_scan(cell code_blocks_scanned_) {
30 code_blocks_scanned += code_blocks_scanned_;
31 code_scan_time = (cell)(nano_count() - temp_time);
34 void gc_event::ended_data_sweep() {
35 data_sweep_time = (cell)(nano_count() - temp_time);
38 void gc_event::ended_code_sweep() {
39 code_sweep_time = (cell)(nano_count() - temp_time);
42 void gc_event::ended_compaction() {
43 compaction_time = (cell)(nano_count() - temp_time);
46 void gc_event::ended_gc(factor_vm* parent) {
47 data_heap_after = parent->data_room();
48 code_heap_after = parent->code->allocator->as_allocator_room();
49 total_time = (cell)(nano_count() - start_time);
52 gc_state::gc_state(gc_op op, factor_vm* parent) : op(op) {
53 if (parent->gc_events) {
54 event = new gc_event(op, parent);
55 start_time = nano_count();
60 gc_state::~gc_state() {
67 void factor_vm::start_gc_again() {
68 if (current_gc->op == collect_nursery_op) {
69 // Nursery collection can fail if aging does not have enough
70 // free space to fit all live objects from nursery.
71 current_gc->op = collect_aging_op;
72 } else if (current_gc->op == collect_aging_op) {
73 // Aging collection can fail if the aging semispace cannot fit
74 // all the live objects from the other aging semispace and the
76 current_gc->op = collect_to_tenured_op;
78 // Nothing else should fail mid-collection due to insufficient
79 // space in the target generation.
80 critical_error("in start_gc_again, bad GC op", current_gc->op);
84 void factor_vm::set_current_gc_op(gc_op op) {
87 current_gc->event->op = op;
90 void factor_vm::gc(gc_op op, cell requested_size) {
91 FACTOR_ASSERT(!gc_off);
92 FACTOR_ASSERT(!current_gc);
94 // Important invariant: tenured space must have enough contiguous free
95 // space to fit the entire contents of the aging space and nursery. This is
96 // because when doing a full collection, objects from younger generations
97 // are promoted before any unreachable tenured objects are freed.
98 FACTOR_ASSERT(!data->high_fragmentation_p());
100 current_gc = new gc_state(op, this);
102 ctx->callstack_seg->set_border_locked(false);
103 atomic::store(¤t_gc_p, true);
105 // Keep trying to GC higher and higher generations until we don't run
106 // out of space in the target generation.
110 current_gc->event->op = current_gc->op;
112 switch (current_gc->op) {
113 case collect_nursery_op:
116 case collect_aging_op:
117 // We end up here if the above fails.
119 if (data->high_fragmentation_p()) {
120 // Change GC op so that if we fail again, we crash.
121 set_current_gc_op(collect_full_op);
125 case collect_to_tenured_op:
126 // We end up here if the above fails.
127 collect_to_tenured();
128 if (data->high_fragmentation_p()) {
129 // Change GC op so that if we fail again, we crash.
130 set_current_gc_op(collect_full_op);
134 case collect_full_op:
137 case collect_compact_op:
140 case collect_growing_data_heap_op:
141 collect_growing_data_heap(requested_size);
144 critical_error("in gc, bad GC op", current_gc->op);
150 catch (const must_start_gc_again&) {
151 // We come back here if the target generation is full.
157 current_gc->event->ended_gc(this);
158 gc_events->push_back(*current_gc->event);
161 atomic::store(¤t_gc_p, false);
163 ctx->callstack_seg->set_border_locked(true);
167 // Check the invariant again, just in case.
168 FACTOR_ASSERT(!data->high_fragmentation_p());
171 void factor_vm::primitive_minor_gc() {
172 gc(collect_nursery_op, 0);
175 void factor_vm::primitive_full_gc() {
176 gc(collect_full_op, 0);
179 void factor_vm::primitive_compact_gc() {
180 gc(collect_compact_op, 0);
183 void factor_vm::primitive_enable_gc_events() {
184 gc_events = new std::vector<gc_event>();
187 // Allocates memory (byte_array_from_value, result.add)
188 // XXX: Remember that growable_array has a data_root already
189 void factor_vm::primitive_disable_gc_events() {
191 growable_array result(this);
193 std::vector<gc_event>* gc_events = this->gc_events;
194 this->gc_events = NULL;
196 FACTOR_FOR_EACH(*gc_events) {
197 gc_event event = *iter;
198 byte_array* obj = byte_array_from_value(&event);
199 result.add(tag<byte_array>(obj));
203 ctx->push(result.elements.value());
205 delete this->gc_events;
207 ctx->push(false_object);