5 void factor_vm::init_card_decks() {
6 cards_offset = (cell)data->cards - addr_to_card(data->start);
7 decks_offset = (cell)data->decks - addr_to_deck(data->start);
10 data_heap::data_heap(cell young_size_, cell aging_size_, cell tenured_size_) {
11 young_size_ = align(young_size_, deck_size);
12 aging_size_ = align(aging_size_, deck_size);
13 tenured_size_ = align(tenured_size_, deck_size);
15 young_size = young_size_;
16 aging_size = aging_size_;
17 tenured_size = tenured_size_;
19 cell total_size = young_size + 2 * aging_size + tenured_size + deck_size;
20 seg = new segment(total_size, false);
22 cell cards_size = addr_to_card(total_size);
23 cards = new card[cards_size];
24 cards_end = cards + cards_size;
25 memset(cards, 0, cards_size);
27 cell decks_size = addr_to_deck(total_size);
28 decks = new card_deck[decks_size];
29 decks_end = decks + decks_size;
30 memset(decks, 0, decks_size);
32 start = align(seg->start, deck_size);
34 tenured = new tenured_space(tenured_size, start);
36 aging = new aging_space(aging_size, tenured->end);
37 aging_semispace = new aging_space(aging_size, aging->end);
39 nursery = new nursery_space(young_size, aging_semispace->end);
41 FACTOR_ASSERT(seg->end - nursery->end <= deck_size);
44 data_heap::~data_heap() {
48 delete aging_semispace;
54 data_heap* data_heap::grow(cell requested_bytes) {
55 cell new_tenured_size = (tenured_size * 2) + requested_bytes;
56 return new data_heap(young_size, aging_size, new_tenured_size);
59 template <typename Generation> void data_heap::clear_cards(Generation* gen) {
60 cell first_card = addr_to_card(gen->start - start);
61 cell last_card = addr_to_card(gen->end - start);
62 memset(&cards[first_card], 0, last_card - first_card);
65 template <typename Generation> void data_heap::clear_decks(Generation* gen) {
66 cell first_deck = addr_to_deck(gen->start - start);
67 cell last_deck = addr_to_deck(gen->end - start);
68 memset(&decks[first_deck], 0, last_deck - first_deck);
71 void data_heap::reset_generation(nursery_space* gen) {
75 void data_heap::reset_generation(aging_space* gen) {
79 gen->starts.clear_object_start_offsets();
82 void data_heap::reset_generation(tenured_space* gen) {
87 bool data_heap::high_fragmentation_p() {
88 return (tenured->largest_free_block() <= high_water_mark());
91 bool data_heap::low_memory_p() {
92 return (tenured->free_space() <= high_water_mark());
95 void data_heap::mark_all_cards() {
96 memset(cards, -1, cards_end - cards);
97 memset(decks, -1, decks_end - decks);
100 void factor_vm::set_data_heap(data_heap* data_) {
102 nursery = *data->nursery;
106 void factor_vm::init_data_heap(cell young_size, cell aging_size,
108 set_data_heap(new data_heap(young_size, aging_size, tenured_size));
111 data_heap_room factor_vm::data_room() {
114 room.nursery_size = nursery.size;
115 room.nursery_occupied = nursery.occupied_space();
116 room.nursery_free = nursery.free_space();
117 room.aging_size = data->aging->size;
118 room.aging_occupied = data->aging->occupied_space();
119 room.aging_free = data->aging->free_space();
120 room.tenured_size = data->tenured->size;
121 room.tenured_occupied = data->tenured->occupied_space();
122 room.tenured_total_free = data->tenured->free_space();
123 room.tenured_contiguous_free = data->tenured->largest_free_block();
124 room.tenured_free_block_count = data->tenured->free_block_count();
125 room.cards = data->cards_end - data->cards;
126 room.decks = data->decks_end - data->decks;
127 room.mark_stack = mark_stack.capacity() * sizeof(cell);
132 /* Allocates memory */
133 void factor_vm::primitive_data_room() {
134 data_heap_room room = data_room();
135 ctx->push(tag<byte_array>(byte_array_from_value(&room)));
138 struct object_accumulator {
140 std::vector<cell> objects;
142 explicit object_accumulator(cell type) : type(type) {}
144 void operator()(object* obj) {
145 if (type == TYPE_COUNT || obj->type() == type)
146 objects.push_back(tag_dynamic(obj));
150 /* Allocates memory */
151 cell factor_vm::instances(cell type) {
153 object_accumulator accum(type);
155 return std_vector_to_array(accum.objects);
158 /* Allocates memory */
159 void factor_vm::primitive_all_instances() {
160 ctx->push(instances(TYPE_COUNT));