6 code_heap::code_heap(cell size)
8 if(size > ((u64)1 << (sizeof(cell) * 8 - 6))) fatal_error("Heap too large",size);
9 seg = new segment(align_page(size),true);
10 if(!seg) fatal_error("Out of memory in heap allocator",size);
11 allocator = new free_list_allocator<code_block>(size,seg->start);
14 code_heap::~code_heap()
22 void code_heap::write_barrier(code_block *compiled)
24 points_to_nursery.insert(compiled);
25 points_to_aging.insert(compiled);
28 void code_heap::clear_remembered_set()
30 points_to_nursery.clear();
31 points_to_aging.clear();
34 bool code_heap::uninitialized_p(code_block *compiled)
36 return uninitialized_blocks.count(compiled) > 0;
39 bool code_heap::marked_p(code_block *compiled)
41 return allocator->state.marked_p(compiled);
44 void code_heap::set_marked_p(code_block *compiled)
46 allocator->state.set_marked_p(compiled);
49 void code_heap::clear_mark_bits()
51 allocator->state.clear_mark_bits();
54 void code_heap::free(code_block *compiled)
56 assert(!uninitialized_p(compiled));
57 points_to_nursery.erase(compiled);
58 points_to_aging.erase(compiled);
59 allocator->free(compiled);
62 void code_heap::flush_icache()
64 factor::flush_icache(seg->start,seg->size);
67 /* Allocate a code heap during startup */
68 void factor_vm::init_code_heap(cell size)
70 code = new code_heap(size);
73 bool factor_vm::in_code_heap_p(cell ptr)
75 return (ptr >= code->seg->start && ptr <= code->seg->end);
81 explicit word_updater(factor_vm *parent_) : parent(parent_) {}
83 void operator()(code_block *compiled, cell size)
85 parent->update_word_references(compiled);
89 /* Update pointers to words referenced from all code blocks. Only after
90 defining a new word. */
91 void factor_vm::update_code_heap_words()
93 word_updater updater(this);
94 each_code_block(updater);
97 void factor_vm::primitive_modify_code_heap()
99 data_root<array> alist(ctx->pop(),this);
101 cell count = array_capacity(alist.untagged());
106 for(cell i = 0; i < count; i++)
108 data_root<array> pair(array_nth(alist.untagged(),i),this);
110 data_root<word> word(array_nth(pair.untagged(),0),this);
111 data_root<object> data(array_nth(pair.untagged(),1),this);
116 jit_compile_word(word.value(),data.value(),false);
120 array *compiled_data = data.as<array>().untagged();
121 cell parameters = array_nth(compiled_data,0);
122 cell literals = array_nth(compiled_data,1);
123 cell relocation = array_nth(compiled_data,2);
124 cell labels = array_nth(compiled_data,3);
125 cell code = array_nth(compiled_data,4);
127 code_block *compiled = add_code_block(
128 code_block_optimized,
136 word->code = compiled;
140 critical_error("Expected a quotation or an array",data.value());
144 update_word_xt(word.untagged());
147 update_code_heap_words();
150 code_heap_room factor_vm::code_room()
154 room.size = code->allocator->size;
155 room.occupied_space = code->allocator->occupied_space();
156 room.total_free = code->allocator->free_space();
157 room.contiguous_free = code->allocator->largest_free_block();
158 room.free_block_count = code->allocator->free_block_count();
163 void factor_vm::primitive_code_room()
165 code_heap_room room = code_room();
166 ctx->push(tag<byte_array>(byte_array_from_value(&room)));
169 struct stack_trace_stripper {
170 explicit stack_trace_stripper() {}
172 void operator()(code_block *compiled, cell size)
174 compiled->owner = false_object;
178 void factor_vm::primitive_strip_stack_traces()
180 stack_trace_stripper stripper;
181 each_code_block(stripper);