6 code_heap::code_heap(cell size)
8 if(size > (1L << (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::needs_fixup_p(code_block *compiled)
36 return needs_fixup.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::code_heap_free(code_block *compiled)
56 points_to_nursery.erase(compiled);
57 points_to_aging.erase(compiled);
58 needs_fixup.erase(compiled);
59 allocator->free(compiled);
62 /* Allocate a code heap during startup */
63 void factor_vm::init_code_heap(cell size)
65 code = new code_heap(size);
68 bool factor_vm::in_code_heap_p(cell ptr)
70 return (ptr >= code->seg->start && ptr <= code->seg->end);
76 explicit word_updater(factor_vm *parent_) : parent(parent_) {}
78 void operator()(code_block *compiled, cell size)
80 parent->update_word_references(compiled);
84 /* Update pointers to words referenced from all code blocks. Only after
85 defining a new word. */
86 void factor_vm::update_code_heap_words()
88 word_updater updater(this);
89 iterate_code_heap(updater);
92 void factor_vm::primitive_modify_code_heap()
94 data_root<array> alist(dpop(),this);
96 cell count = array_capacity(alist.untagged());
101 for(cell i = 0; i < count; i++)
103 data_root<array> pair(array_nth(alist.untagged(),i),this);
105 data_root<word> word(array_nth(pair.untagged(),0),this);
106 data_root<object> data(array_nth(pair.untagged(),1),this);
111 jit_compile_word(word.value(),data.value(),false);
115 array *compiled_data = data.as<array>().untagged();
116 cell literals = array_nth(compiled_data,0);
117 cell relocation = array_nth(compiled_data,1);
118 cell labels = array_nth(compiled_data,2);
119 cell code = array_nth(compiled_data,3);
121 code_block *compiled = add_code_block(
122 code_block_optimized,
129 word->code = compiled;
133 critical_error("Expected a quotation or an array",data.value());
137 update_word_xt(word.untagged());
140 update_code_heap_words();
143 code_heap_room factor_vm::code_room()
147 room.size = code->allocator->size;
148 room.occupied_space = code->allocator->occupied_space();
149 room.total_free = code->allocator->free_space();
150 room.contiguous_free = code->allocator->largest_free_block();
151 room.free_block_count = code->allocator->free_block_count();
156 void factor_vm::primitive_code_room()
158 code_heap_room room = code_room();
159 dpush(tag<byte_array>(byte_array_from_value(&room)));
162 struct stack_trace_stripper {
163 explicit stack_trace_stripper() {}
165 void operator()(code_block *compiled, cell size)
167 compiled->owner = false_object;
171 void factor_vm::primitive_strip_stack_traces()
173 stack_trace_stripper stripper;
174 iterate_code_heap(stripper);