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);
73 /* Compile a word definition with the non-optimizing compiler. Allocates memory */
74 void factor_vm::jit_compile_word(cell word_, cell def_, bool relocate)
76 data_root<word> word(word_,this);
77 data_root<quotation> def(def_,this);
79 jit_compile(def.value(),relocate);
81 word->code = def->code;
83 if(to_boolean(word->pic_def)) jit_compile(word->pic_def,relocate);
84 if(to_boolean(word->pic_tail_def)) jit_compile(word->pic_tail_def,relocate);
90 explicit word_updater(factor_vm *parent_) : parent(parent_) {}
92 void operator()(code_block *compiled, cell size)
94 parent->update_word_references(compiled);
98 /* Update pointers to words referenced from all code blocks. Only after
99 defining a new word. */
100 void factor_vm::update_code_heap_words()
102 word_updater updater(this);
103 iterate_code_heap(updater);
106 void factor_vm::primitive_modify_code_heap()
108 data_root<array> alist(dpop(),this);
110 cell count = array_capacity(alist.untagged());
115 for(cell i = 0; i < count; i++)
117 data_root<array> pair(array_nth(alist.untagged(),i),this);
119 data_root<word> word(array_nth(pair.untagged(),0),this);
120 data_root<object> data(array_nth(pair.untagged(),1),this);
125 jit_compile_word(word.value(),data.value(),false);
129 array *compiled_data = data.as<array>().untagged();
130 cell owner = array_nth(compiled_data,0);
131 cell literals = array_nth(compiled_data,1);
132 cell relocation = array_nth(compiled_data,2);
133 cell labels = array_nth(compiled_data,3);
134 cell code = array_nth(compiled_data,4);
136 code_block *compiled = add_code_block(
137 code_block_optimized,
144 word->code = compiled;
148 critical_error("Expected a quotation or an array",data.value());
152 update_word_xt(word.untagged());
155 update_code_heap_words();
158 code_heap_room factor_vm::code_room()
162 room.size = code->allocator->size;
163 room.occupied_space = code->allocator->occupied_space();
164 room.total_free = code->allocator->free_space();
165 room.contiguous_free = code->allocator->largest_free_block();
166 room.free_block_count = code->allocator->free_block_count();
171 void factor_vm::primitive_code_room()
173 code_heap_room room = code_room();
174 dpush(tag<byte_array>(byte_array_from_value(&room)));
177 struct stack_trace_stripper {
178 explicit stack_trace_stripper() {}
180 void operator()(code_block *compiled, cell size)
182 compiled->owner = false_object;
186 void factor_vm::primitive_strip_stack_traces()
188 stack_trace_stripper stripper;
189 iterate_code_heap(stripper);