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
27 current_gc->op = collect_to_tenured_op;
29 collector<tenured_space, to_tenured_policy> collector(this,
31 to_tenured_policy(this));
32 gc_event* event = current_gc->event;
36 collector.trace_cards(data->tenured, card_points_to_aging, 0xff);
38 event->ended_card_scan(collector.cards_scanned, collector.decks_scanned);
42 collector.trace_code_heap_roots(&code->points_to_aging);
44 event->ended_code_scan(code->points_to_aging.size());
46 collector.visitor.visit_mark_stack(&mark_stack);
49 /* If collection fails here, do a to_tenured collection. */
50 current_gc->op = collect_aging_op;
52 std::swap(data->aging, data->aging_semispace);
55 collector<aging_space, aging_policy> collector(this,
59 collector.visitor.visit_all_roots();
60 collector.cheneys_algorithm();
62 data->reset_nursery();
63 code->clear_remembered_set();