/
code_heap.cpp
222 lines (189 loc) · 6.96 KB
/
code_heap.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
#include "master.hpp"
namespace factor {
code_heap::code_heap(cell size) {
if (size > ((uint64_t)1 << (sizeof(cell) * 8 - 6)))
fatal_error("Heap too large", size);
seg = new segment(align_page(size), true);
if (!seg)
fatal_error("Out of memory in code_heap constructor", size);
cell start = seg->start + getpagesize() + seh_area_size;
allocator = new free_list_allocator<code_block>(seg->end - start, start);
// See os-windows-x86.64.cpp for seh_area usage
safepoint_page = seg->start;
seh_area = (char*)seg->start + getpagesize();
}
code_heap::~code_heap() {
delete allocator;
allocator = NULL;
delete seg;
seg = NULL;
}
void code_heap::write_barrier(code_block* compiled) {
points_to_nursery.insert(compiled);
points_to_aging.insert(compiled);
}
void code_heap::clear_remembered_set() {
points_to_nursery.clear();
points_to_aging.clear();
}
bool code_heap::uninitialized_p(code_block* compiled) {
return uninitialized_blocks.count(compiled) > 0;
}
void code_heap::free(code_block* compiled) {
FACTOR_ASSERT(!uninitialized_p(compiled));
points_to_nursery.erase(compiled);
points_to_aging.erase(compiled);
all_blocks.erase((cell)compiled);
allocator->free(compiled);
}
void code_heap::flush_icache() { factor::flush_icache(seg->start, seg->size); }
void code_heap::set_safepoint_guard(bool locked) {
if (!set_memory_locked(safepoint_page, getpagesize(), locked)) {
fatal_error("Cannot (un)protect safepoint guard page", safepoint_page);
}
}
void code_heap::sweep() {
auto clear_free_blocks_from_all_blocks = [&](code_block* block, cell size) {
std::set<cell>::iterator erase_from =
all_blocks.lower_bound((cell)block);
std::set<cell>::iterator erase_to =
all_blocks.lower_bound((cell)block + size);
all_blocks.erase(erase_from, erase_to);
};
allocator->sweep(clear_free_blocks_from_all_blocks);
#ifdef FACTOR_DEBUG
verify_all_blocks_set();
#endif
}
void code_heap::verify_all_blocks_set() {
auto all_blocks_set_verifier = [&](code_block* block, cell size) {
(void)block;
(void)size;
FACTOR_ASSERT(all_blocks.find((cell)block) != all_blocks.end());
};
allocator->iterate(all_blocks_set_verifier, no_fixup());
}
code_block* code_heap::code_block_for_address(cell address) {
std::set<cell>::const_iterator blocki = all_blocks.upper_bound(address);
FACTOR_ASSERT(blocki != all_blocks.begin());
--blocki;
code_block* found_block = (code_block*)*blocki;
FACTOR_ASSERT(found_block->entry_point() <=
address // XXX this isn't valid during fixup. should store the
// size in the map
// && address - found_block->entry_point() <
// found_block->size()
);
return found_block;
}
cell code_heap::frame_predecessor(cell frame_top) {
cell addr = *(cell*)frame_top;
FACTOR_ASSERT(seg->in_segment_p(addr));
code_block* owner = code_block_for_address(addr);
cell frame_size = owner->stack_frame_size_for_address(addr);
return frame_top + frame_size;
}
// Recomputes the all_blocks set of code blocks
void code_heap::initialize_all_blocks_set() {
all_blocks.clear();
auto all_blocks_set_inserter = [&](code_block* block, cell size) {
(void)size;
all_blocks.insert((cell)block);
};
allocator->iterate(all_blocks_set_inserter, no_fixup());
#ifdef FACTOR_DEBUG
verify_all_blocks_set();
#endif
}
// Update pointers to words referenced from all code blocks.
// Only needed after redefining an existing word.
// If generic words were redefined, inline caches need to be reset.
void factor_vm::update_code_heap_words(bool reset_inline_caches) {
auto word_updater = [&](code_block* block, cell size) {
(void)size;
update_word_references(block, reset_inline_caches);
};
each_code_block(word_updater);
}
// Allocates memory
void factor_vm::primitive_modify_code_heap() {
bool reset_inline_caches = to_boolean(ctx->pop());
bool update_existing_words = to_boolean(ctx->pop());
data_root<array> alist(ctx->pop(), this);
cell count = array_capacity(alist.untagged());
if (count == 0)
return;
for (cell i = 0; i < count; i++) {
data_root<array> pair(array_nth(alist.untagged(), i), this);
data_root<word> word(array_nth(pair.untagged(), 0), this);
data_root<object> data(array_nth(pair.untagged(), 1), this);
switch (data.type()) {
case QUOTATION_TYPE:
jit_compile_word(word.value(), data.value(), false);
break;
case ARRAY_TYPE: {
array* compiled_data = data.as<array>().untagged();
cell parameters = array_nth(compiled_data, 0);
cell literals = array_nth(compiled_data, 1);
cell relocation = array_nth(compiled_data, 2);
cell labels = array_nth(compiled_data, 3);
cell code = array_nth(compiled_data, 4);
cell frame_size = untag_fixnum(array_nth(compiled_data, 5));
code_block* compiled =
add_code_block(CODE_BLOCK_OPTIMIZED, code, labels, word.value(),
relocation, parameters, literals, frame_size);
word->entry_point = compiled->entry_point();
} break;
default:
critical_error("Expected a quotation or an array", data.value());
break;
}
}
if (update_existing_words)
update_code_heap_words(reset_inline_caches);
else {
// Fast path for compilation units that only define new words.
FACTOR_FOR_EACH(code->uninitialized_blocks) {
initialize_code_block(iter->first, iter->second);
}
code->uninitialized_blocks.clear();
}
FACTOR_ASSERT(code->uninitialized_blocks.size() == 0);
}
// Allocates memory
void factor_vm::primitive_code_room() {
allocator_room room = code->allocator->as_allocator_room();
ctx->push(tag<byte_array>(byte_array_from_value(&room)));
}
void factor_vm::primitive_strip_stack_traces() {
auto stack_trace_stripper = [](code_block* block, cell size) {
(void)size;
block->owner = false_object;
};
each_code_block(stack_trace_stripper);
}
// Allocates memory
void factor_vm::primitive_code_blocks() {
std::vector<cell> objects;
auto code_block_accumulator = [&](code_block* block, cell size) {
(void)size;
objects.push_back(block->owner);
objects.push_back(block->parameters);
objects.push_back(block->relocation);
objects.push_back(tag_fixnum(block->type()));
objects.push_back(tag_fixnum(block->size()));
// Note: the entry point is always a multiple of the heap
// alignment (16 bytes). We cannot allocate while iterating
// through the code heap, so it is not possible to call
// from_unsigned_cell() here. It is OK, however, to add it as
// if it were a fixnum, and have library code shift it to the
// left by 4.
cell entry_point = block->entry_point();
FACTOR_ASSERT((entry_point & (data_alignment - 1)) == 0);
FACTOR_ASSERT((entry_point & TAG_MASK) == FIXNUM_TYPE);
objects.push_back(entry_point);
};
each_code_block(code_block_accumulator);
ctx->push(std_vector_to_array(objects));
}
}