6 void factor_vm::init_card_decks()
8 cards_offset = (cell)data->cards - addr_to_card(data->start);
9 decks_offset = (cell)data->decks - addr_to_deck(data->start);
12 data_heap::data_heap(cell young_size_,
16 young_size_ = align(young_size_,deck_size);
17 aging_size_ = align(aging_size_,deck_size);
18 tenured_size_ = align(tenured_size_,deck_size);
20 young_size = young_size_;
21 aging_size = aging_size_;
22 tenured_size = tenured_size_;
24 cell total_size = young_size + 2 * aging_size + tenured_size + deck_size;
25 seg = new segment(total_size,false);
27 cell cards_size = addr_to_card(total_size);
28 cards = new card[cards_size];
29 cards_end = cards + cards_size;
30 memset(cards,0,cards_size);
32 cell decks_size = addr_to_deck(total_size);
33 decks = new card_deck[decks_size];
34 decks_end = decks + decks_size;
35 memset(decks,0,decks_size);
37 start = align(seg->start,deck_size);
39 tenured = new tenured_space(tenured_size,start);
41 aging = new aging_space(aging_size,tenured->end);
42 aging_semispace = new aging_space(aging_size,aging->end);
44 nursery = new nursery_space(young_size,aging_semispace->end);
46 FACTOR_ASSERT(seg->end - nursery->end <= deck_size);
49 data_heap::~data_heap()
54 delete aging_semispace;
60 data_heap *data_heap::grow(cell requested_bytes)
62 cell new_tenured_size = (tenured_size * 2) + requested_bytes;
63 return new data_heap(young_size,
68 template<typename Generation> void data_heap::clear_cards(Generation *gen)
70 cell first_card = addr_to_card(gen->start - start);
71 cell last_card = addr_to_card(gen->end - start);
72 memset(&cards[first_card],0,last_card - first_card);
75 template<typename Generation> void data_heap::clear_decks(Generation *gen)
77 cell first_deck = addr_to_deck(gen->start - start);
78 cell last_deck = addr_to_deck(gen->end - start);
79 memset(&decks[first_deck],0,last_deck - first_deck);
82 void data_heap::reset_generation(nursery_space *gen)
84 gen->here = gen->start;
87 void data_heap::reset_generation(aging_space *gen)
89 gen->here = gen->start;
92 gen->starts.clear_object_start_offsets();
95 void data_heap::reset_generation(tenured_space *gen)
101 bool data_heap::high_fragmentation_p()
103 return (tenured->largest_free_block() <= high_water_mark());
106 bool data_heap::low_memory_p()
108 return (tenured->free_space() <= high_water_mark());
111 void data_heap::mark_all_cards()
113 memset(cards,-1,cards_end - cards);
114 memset(decks,-1,decks_end - decks);
117 void factor_vm::set_data_heap(data_heap *data_)
120 nursery = *data->nursery;
124 void factor_vm::init_data_heap(cell young_size, cell aging_size, cell tenured_size)
126 set_data_heap(new data_heap(young_size,aging_size,tenured_size));
129 data_heap_room factor_vm::data_room()
133 room.nursery_size = nursery.size;
134 room.nursery_occupied = nursery.occupied_space();
135 room.nursery_free = nursery.free_space();
136 room.aging_size = data->aging->size;
137 room.aging_occupied = data->aging->occupied_space();
138 room.aging_free = data->aging->free_space();
139 room.tenured_size = data->tenured->size;
140 room.tenured_occupied = data->tenured->occupied_space();
141 room.tenured_total_free = data->tenured->free_space();
142 room.tenured_contiguous_free = data->tenured->largest_free_block();
143 room.tenured_free_block_count = data->tenured->free_block_count();
144 room.cards = data->cards_end - data->cards;
145 room.decks = data->decks_end - data->decks;
146 room.mark_stack = mark_stack.capacity() * sizeof(cell);
151 void factor_vm::primitive_data_room()
153 data_heap_room room = data_room();
154 ctx->push(tag<byte_array>(byte_array_from_value(&room)));
157 struct object_accumulator {
159 std::vector<cell> objects;
161 explicit object_accumulator(cell type_) : type(type_) {}
163 void operator()(object *obj)
165 if(type == TYPE_COUNT || obj->type() == type)
166 objects.push_back(tag_dynamic(obj));
170 cell factor_vm::instances(cell type)
172 object_accumulator accum(type);
174 return std_vector_to_array(accum.objects);
177 void factor_vm::primitive_all_instances()
180 ctx->push(instances(TYPE_COUNT));