7 tenured_space* tenured;
9 explicit aging_policy(factor_vm* parent)
10 : aging(parent->data->aging), tenured(parent->data->tenured) {}
12 bool should_copy_p(object* untagged) {
13 return !(aging->contains_p(untagged) || tenured->contains_p(untagged));
16 void promoted_object(object* obj) {}
18 void visited_object(object* obj) {}
21 void factor_vm::collect_aging() {
22 // Promote objects referenced from tenured space to tenured space, copy
23 // everything else to the aging semi-space, and reset the nursery pointer.
25 // Change the op so that if we fail here, an assertion will be raised.
26 current_gc->op = collect_to_tenured_op;
28 gc_workhorse<tenured_space, to_tenured_policy>
29 workhorse(this, data->tenured, to_tenured_policy(this));
30 slot_visitor<gc_workhorse<tenured_space, to_tenured_policy>>
31 visitor(this, workhorse);
33 gc_event* event = current_gc->event;
37 visitor.visit_cards(data->tenured, card_points_to_aging, 0xff);
39 event->ended_card_scan(visitor.cards_scanned, visitor.decks_scanned);
43 visitor.visit_code_heap_roots(&code->points_to_aging);
45 event->ended_code_scan(code->points_to_aging.size());
47 visitor.visit_mark_stack(&mark_stack);
50 // If collection fails here, do a to_tenured collection.
51 current_gc->op = collect_aging_op;
53 std::swap(data->aging, data->aging_semispace);
56 aging_space *target = data->aging;
57 gc_workhorse<aging_space, aging_policy>
58 workhorse(this, target, aging_policy(this));
59 slot_visitor<gc_workhorse<aging_space, aging_policy>>
60 visitor(this, workhorse);
61 cell scan = target->start + target->occupied_space();
63 visitor.visit_all_roots();
64 visitor.cheneys_algorithm(target, scan);
66 data->reset_nursery();
67 code->clear_remembered_set();