vm/nursery_collector.cpp

   1 #include "master.hpp"
   2
   3 namespace factor {
   4
   5 struct nursery_policy {
   6   bump_allocator* nursery;
   7
   8   explicit nursery_policy(bump_allocator* nursery) : nursery(nursery) {}
   9
  10   bool should_copy_p(object* obj) {
  11     return nursery->contains_p(obj);
  12   }
  13
  14   void promoted_object(object* obj) {}
  15
  16   void visited_object(object* obj) {}
  17 };
  18
  19 void factor_vm::collect_nursery() {
  20
  21   /* Copy live objects from the nursery (as determined by the root set and
  22      marked cards in aging and tenured) to aging space. */
  23   gc_workhorse<aging_space, nursery_policy>
  24       workhorse(this, data->aging, nursery_policy(data->nursery));
  25   slot_visitor<gc_workhorse<aging_space, nursery_policy>>
  26       visitor(this, workhorse);
  27
  28   cell scan = data->aging->start + data->aging->occupied_space();
  29
  30   visitor.visit_all_roots();
  31   gc_event* event = current_gc->event;
  32
  33   if (event)
  34     event->reset_timer();
  35   visitor.visit_cards(data->tenured, card_points_to_nursery,
  36                       card_points_to_nursery);
  37   visitor.visit_cards(data->aging, card_points_to_nursery, 0xff);
  38   if (event)
  39     event->ended_card_scan(visitor.cards_scanned, visitor.decks_scanned);
  40
  41   if (event)
  42     event->reset_timer();
  43   visitor.visit_code_heap_roots(&code->points_to_nursery);
  44   if (event)
  45     event->ended_code_scan(code->points_to_nursery.size());
  46
  47   visitor.cheneys_algorithm(data->aging, scan);
  48
  49   data->reset_nursery();
  50   code->points_to_nursery.clear();
  51 }
  52
  53 }