54 lines
1.4 KiB
C++
54 lines
1.4 KiB
C++
#include "master.hpp"
|
|
|
|
namespace factor {
|
|
|
|
struct nursery_policy {
|
|
bump_allocator* nursery;
|
|
|
|
explicit nursery_policy(bump_allocator* nursery) : nursery(nursery) {}
|
|
|
|
bool should_copy_p(object* obj) {
|
|
return nursery->contains_p(obj);
|
|
}
|
|
|
|
void promoted_object(object* obj) {}
|
|
|
|
void visited_object(object* obj) {}
|
|
};
|
|
|
|
void factor_vm::collect_nursery() {
|
|
|
|
/* Copy live objects from the nursery (as determined by the root set and
|
|
marked cards in aging and tenured) to aging space. */
|
|
nursery_policy policy(this->data->nursery);
|
|
collector<aging_space, nursery_policy>
|
|
collector(this, this->data->aging, policy);
|
|
|
|
collector.visitor.visit_all_roots();
|
|
gc_event* event = current_gc->event;
|
|
|
|
if (event)
|
|
event->reset_timer();
|
|
collector.visitor.visit_cards(data->tenured, card_points_to_nursery,
|
|
card_points_to_nursery);
|
|
collector.visitor.visit_cards(data->aging, card_points_to_nursery, 0xff);
|
|
|
|
if (event) {
|
|
event->ended_card_scan(collector.visitor.cards_scanned,
|
|
collector.visitor.decks_scanned);
|
|
}
|
|
|
|
if (event)
|
|
event->reset_timer();
|
|
collector.visitor.visit_code_heap_roots(&code->points_to_nursery);
|
|
if (event)
|
|
event->ended_code_scan(code->points_to_nursery.size());
|
|
|
|
collector.cheneys_algorithm();
|
|
|
|
data->reset_nursery();
|
|
code->points_to_nursery.clear();
|
|
}
|
|
|
|
}
|