vm/gc.cpp

   1 #include "master.hpp"
   2
   3 namespace factor {
   4
   5 gc_event::gc_event(gc_op op, factor_vm* parent)
   6     : op(op),
   7       cards_scanned(0),
   8       decks_scanned(0),
   9       code_blocks_scanned(0),
  10       start_time(nano_count()),
  11       card_scan_time(0),
  12       code_scan_time(0),
  13       data_sweep_time(0),
  14       code_sweep_time(0),
  15       compaction_time(0) {
  16   data_heap_before = parent->data_room();
  17   code_heap_before = parent->code->allocator->as_allocator_room();
  18   start_time = nano_count();
  19 }
  20
  21 void gc_event::reset_timer() { temp_time = nano_count(); }
  22
  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);
  27 }
  28
  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);
  32 }
  33
  34 void gc_event::ended_data_sweep() {
  35   data_sweep_time = (cell)(nano_count() - temp_time);
  36 }
  37
  38 void gc_event::ended_code_sweep() {
  39   code_sweep_time = (cell)(nano_count() - temp_time);
  40 }
  41
  42 void gc_event::ended_compaction() {
  43   compaction_time = (cell)(nano_count() - temp_time);
  44 }
  45
  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);
  50 }
  51
  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();
  56   } else
  57     event = NULL;
  58 }
  59
  60 gc_state::~gc_state() {
  61   if (event) {
  62     delete event;
  63     event = NULL;
  64   }
  65 }
  66
  67 void factor_vm::end_gc() {
  68   if (gc_events) {
  69     current_gc->event->ended_gc(this);
  70     gc_events->push_back(*current_gc->event);
  71   }
  72 }
  73
  74 void factor_vm::start_gc_again() {
  75   if (current_gc->op == collect_nursery_op) {
  76     // Nursery collection can fail if aging does not have enough
  77     // free space to fit all live objects from nursery.
  78     current_gc->op = collect_aging_op;
  79   } else if (current_gc->op == collect_aging_op) {
  80     // Aging collection can fail if the aging semispace cannot fit
  81     // all the live objects from the other aging semispace and the
  82     // nursery.
  83     current_gc->op = collect_to_tenured_op;
  84   } else {
  85     // Nothing else should fail mid-collection due to insufficient
  86     // space in the target generation.
  87     critical_error("in start_gc_again, bad GC op", current_gc->op);
  88   }
  89 }
  90
  91 void factor_vm::set_current_gc_op(gc_op op) {
  92   current_gc->op = op;
  93   if (gc_events)
  94     current_gc->event->op = op;
  95 }
  96
  97 void factor_vm::gc(gc_op op, cell requested_size) {
  98   FACTOR_ASSERT(!gc_off);
  99   FACTOR_ASSERT(!current_gc);
 100
 101   // Important invariant: tenured space must have enough contiguous free
 102   // space to fit the entire contents of the aging space and nursery. This is
 103   // because when doing a full collection, objects from younger generations
 104   // are promoted before any unreachable tenured objects are freed.
 105   FACTOR_ASSERT(!data->high_fragmentation_p());
 106
 107   current_gc = new gc_state(op, this);
 108   if (ctx)
 109     ctx->callstack_seg->set_border_locked(false);
 110   atomic::store(&current_gc_p, true);
 111
 112   // Keep trying to GC higher and higher generations until we don't run
 113   // out of space in the target generation.
 114   for (;;) {
 115     try {
 116       if (gc_events)
 117         current_gc->event->op = current_gc->op;
 118
 119       switch (current_gc->op) {
 120         case collect_nursery_op:
 121           collect_nursery();
 122           break;
 123         case collect_aging_op:
 124           // We end up here if the above fails.
 125           collect_aging();
 126           if (data->high_fragmentation_p()) {
 127             // Change GC op so that if we fail again, we crash.
 128             set_current_gc_op(collect_full_op);
 129             collect_full();
 130           }
 131           break;
 132         case collect_to_tenured_op:
 133           // We end up here if the above fails.
 134           collect_to_tenured();
 135           if (data->high_fragmentation_p()) {
 136             // Change GC op so that if we fail again, we crash.
 137             set_current_gc_op(collect_full_op);
 138             collect_full();
 139           }
 140           break;
 141         case collect_full_op:
 142           collect_full();
 143           break;
 144         case collect_compact_op:
 145           collect_compact();
 146           break;
 147         case collect_growing_heap_op:
 148           collect_growing_heap(requested_size);
 149           break;
 150         default:
 151           critical_error("in gc, bad GC op", current_gc->op);
 152           break;
 153       }
 154
 155       break;
 156     }
 157     catch (const must_start_gc_again&) {
 158       // We come back here if the target generation is full.
 159       start_gc_again();
 160     }
 161   }
 162
 163   end_gc();
 164
 165   atomic::store(&current_gc_p, false);
 166   if (ctx)
 167     ctx->callstack_seg->set_border_locked(true);
 168   delete current_gc;
 169   current_gc = NULL;
 170
 171   // Check the invariant again, just in case.
 172   FACTOR_ASSERT(!data->high_fragmentation_p());
 173 }
 174
 175 void factor_vm::primitive_minor_gc() {
 176   gc(collect_nursery_op, 0);
 177 }
 178
 179 void factor_vm::primitive_full_gc() {
 180   gc(collect_full_op, 0);
 181 }
 182
 183 void factor_vm::primitive_compact_gc() {
 184   gc(collect_compact_op, 0);
 185 }
 186
 187 void factor_vm::primitive_enable_gc_events() {
 188   gc_events = new std::vector<gc_event>();
 189 }
 190
 191 // Allocates memory (byte_array_from_value, result.add)
 192 // XXX: Remember that growable_array has a data_root already
 193 void factor_vm::primitive_disable_gc_events() {
 194   if (gc_events) {
 195     growable_array result(this);
 196
 197     std::vector<gc_event>* gc_events = this->gc_events;
 198     this->gc_events = NULL;
 199
 200     FACTOR_FOR_EACH(*gc_events) {
 201       gc_event event = *iter;
 202       byte_array* obj = byte_array_from_value(&event);
 203       result.add(tag<byte_array>(obj));
 204     }
 205
 206     result.trim();
 207     ctx->push(result.elements.value());
 208
 209     delete this->gc_events;
 210   } else
 211     ctx->push(false_object);
 212 }
 213
 214 }