vm/code_heap.cpp

   1 #include "master.hpp"
   2
   3 namespace factor
   4 {
   5
   6 code_heap::code_heap(cell size)
   7 {
   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 code_heap constructor",size);
  11
  12         cell start = seg->start + getpagesize() + seh_area_size;
  13
  14         allocator = new free_list_allocator<code_block>(seg->end - start,start);
  15
  16         /* See os-windows-x86.64.cpp for seh_area usage */
  17         safepoint_page = (void *)seg->start;
  18         seh_area = (char *)seg->start + getpagesize();
  19 }
  20
  21 code_heap::~code_heap()
  22 {
  23         delete allocator;
  24         allocator = NULL;
  25         delete seg;
  26         seg = NULL;
  27 }
  28
  29 void code_heap::write_barrier(code_block *compiled)
  30 {
  31         points_to_nursery.insert(compiled);
  32         points_to_aging.insert(compiled);
  33 }
  34
  35 void code_heap::clear_remembered_set()
  36 {
  37         points_to_nursery.clear();
  38         points_to_aging.clear();
  39 }
  40
  41 bool code_heap::uninitialized_p(code_block *compiled)
  42 {
  43         return uninitialized_blocks.count(compiled) > 0;
  44 }
  45
  46 bool code_heap::marked_p(code_block *compiled)
  47 {
  48         return allocator->state.marked_p(compiled);
  49 }
  50
  51 void code_heap::set_marked_p(code_block *compiled)
  52 {
  53         allocator->state.set_marked_p(compiled);
  54 }
  55
  56 void code_heap::clear_mark_bits()
  57 {
  58         allocator->state.clear_mark_bits();
  59 }
  60
  61 void code_heap::free(code_block *compiled)
  62 {
  63         FACTOR_ASSERT(!uninitialized_p(compiled));
  64         points_to_nursery.erase(compiled);
  65         points_to_aging.erase(compiled);
  66         all_blocks.erase((cell)compiled);
  67         allocator->free(compiled);
  68 }
  69
  70 void code_heap::flush_icache()
  71 {
  72         factor::flush_icache(seg->start,seg->size);
  73 }
  74
  75 struct clear_free_blocks_from_all_blocks_iterator
  76 {
  77         code_heap *code;
  78
  79         clear_free_blocks_from_all_blocks_iterator(code_heap *code) : code(code) {}
  80
  81         void operator()(code_block *free_block, cell size) {
  82                 std::set<cell>::iterator erase_from =
  83                         code->all_blocks.lower_bound((cell)free_block);
  84                 std::set<cell>::iterator erase_to =
  85                         code->all_blocks.lower_bound((cell)free_block + size);
  86
  87                 code->all_blocks.erase(erase_from, erase_to);
  88         }
  89 };
  90
  91 void code_heap::sweep()
  92 {
  93         clear_free_blocks_from_all_blocks_iterator clearer(this);
  94         allocator->sweep(clearer);
  95 #ifdef FACTOR_DEBUG
  96         verify_all_blocks_set();
  97 #endif
  98 }
  99
 100 struct all_blocks_set_verifier {
 101         std::set<cell> *all_blocks;
 102
 103         all_blocks_set_verifier(std::set<cell> *all_blocks) : all_blocks(all_blocks) {}
 104
 105         void operator()(code_block *block, cell size)
 106         {
 107                 FACTOR_ASSERT(all_blocks->find((cell)block) != all_blocks->end());
 108                 // XXX check block size
 109         }
 110 };
 111
 112 void code_heap::verify_all_blocks_set()
 113 {
 114         all_blocks_set_verifier verifier(&all_blocks);
 115         allocator->iterate(verifier);
 116 }
 117
 118 code_block *code_heap::code_block_for_address(cell address)
 119 {
 120         std::set<cell>::const_iterator blocki =
 121                 all_blocks.upper_bound(address);
 122         FACTOR_ASSERT(blocki != all_blocks.begin());
 123         --blocki;
 124         code_block* found_block = (code_block*)*blocki;
 125         FACTOR_ASSERT((cell)found_block->entry_point() <= address
 126                 /* XXX this isn't valid during fixup. should store the size in the map
 127                 && address - (cell)found_block->entry_point() < found_block->size()*/);
 128         return found_block;
 129 }
 130
 131 struct all_blocks_set_inserter {
 132         code_heap *code;
 133
 134         all_blocks_set_inserter(code_heap *code) : code(code) {}
 135
 136         void operator()(code_block *block, cell size)
 137         {
 138                 code->all_blocks.insert((cell)block);
 139         }
 140 };
 141
 142 void code_heap::initialize_all_blocks_set()
 143 {
 144         all_blocks.clear();
 145         all_blocks_set_inserter inserter(this);
 146         allocator->iterate(inserter);
 147 #if defined(FACTOR_DEBUG)
 148         verify_all_blocks_set();
 149 #endif
 150 }
 151
 152 /* Allocate a code heap during startup */
 153 void factor_vm::init_code_heap(cell size)
 154 {
 155         code = new code_heap(size);
 156 }
 157
 158 struct word_updater {
 159         factor_vm *parent;
 160         bool reset_inline_caches;
 161
 162         word_updater(factor_vm *parent_, bool reset_inline_caches_) :
 163                 parent(parent_), reset_inline_caches(reset_inline_caches_) {}
 164
 165         void operator()(code_block *compiled, cell size)
 166         {
 167                 parent->update_word_references(compiled,reset_inline_caches);
 168         }
 169 };
 170
 171 /* Update pointers to words referenced from all code blocks.
 172 Only needed after redefining an existing word.
 173 If generic words were redefined, inline caches need to be reset. */
 174 void factor_vm::update_code_heap_words(bool reset_inline_caches)
 175 {
 176         word_updater updater(this,reset_inline_caches);
 177         each_code_block(updater);
 178 }
 179
 180 /* Fix up new words only.
 181 Fast path for compilation units that only define new words. */
 182 void factor_vm::initialize_code_blocks()
 183 {
 184         std::map<code_block *, cell>::const_iterator iter = code->uninitialized_blocks.begin();
 185         std::map<code_block *, cell>::const_iterator end = code->uninitialized_blocks.end();
 186
 187         for(; iter != end; iter++)
 188                 initialize_code_block(iter->first,iter->second);
 189
 190         code->uninitialized_blocks.clear();
 191 }
 192
 193 void factor_vm::primitive_modify_code_heap()
 194 {
 195         bool reset_inline_caches = to_boolean(ctx->pop());
 196         bool update_existing_words = to_boolean(ctx->pop());
 197         data_root<array> alist(ctx->pop(),this);
 198
 199         cell count = array_capacity(alist.untagged());
 200
 201         if(count == 0)
 202                 return;
 203
 204         for(cell i = 0; i < count; i++)
 205         {
 206                 data_root<array> pair(array_nth(alist.untagged(),i),this);
 207
 208                 data_root<word> word(array_nth(pair.untagged(),0),this);
 209                 data_root<object> data(array_nth(pair.untagged(),1),this);
 210
 211                 switch(data.type())
 212                 {
 213                 case QUOTATION_TYPE:
 214                         jit_compile_word(word.value(),data.value(),false);
 215                         break;
 216                 case ARRAY_TYPE:
 217                         {
 218                                 array *compiled_data = data.as<array>().untagged();
 219                                 cell parameters = array_nth(compiled_data,0);
 220                                 cell literals = array_nth(compiled_data,1);
 221                                 cell relocation = array_nth(compiled_data,2);
 222                                 cell labels = array_nth(compiled_data,3);
 223                                 cell code = array_nth(compiled_data,4);
 224                                 cell frame_size = untag_fixnum(array_nth(compiled_data,5));
 225
 226                                 code_block *compiled = add_code_block(
 227                                         code_block_optimized,
 228                                         code,
 229                                         labels,
 230                                         word.value(),
 231                                         relocation,
 232                                         parameters,
 233                                         literals,
 234                                         frame_size);
 235
 236                                 word->entry_point = compiled->entry_point();
 237                         }
 238                         break;
 239                 default:
 240                         critical_error("Expected a quotation or an array",data.value());
 241                         break;
 242                 }
 243         }
 244
 245         if(update_existing_words)
 246                 update_code_heap_words(reset_inline_caches);
 247         else
 248                 initialize_code_blocks();
 249 }
 250
 251 code_heap_room factor_vm::code_room()
 252 {
 253         code_heap_room room;
 254
 255         room.size             = code->allocator->size;
 256         room.occupied_space   = code->allocator->occupied_space();
 257         room.total_free       = code->allocator->free_space();
 258         room.contiguous_free  = code->allocator->largest_free_block();
 259         room.free_block_count = code->allocator->free_block_count();
 260
 261         return room;
 262 }
 263
 264 void factor_vm::primitive_code_room()
 265 {
 266         code_heap_room room = code_room();
 267         ctx->push(tag<byte_array>(byte_array_from_value(&room)));
 268 }
 269
 270 struct stack_trace_stripper {
 271         explicit stack_trace_stripper() {}
 272
 273         void operator()(code_block *compiled, cell size)
 274         {
 275                 compiled->owner = false_object;
 276         }
 277 };
 278
 279 void factor_vm::primitive_strip_stack_traces()
 280 {
 281         stack_trace_stripper stripper;
 282         each_code_block(stripper);
 283 }
 284
 285 struct code_block_accumulator {
 286         std::vector<cell> objects;
 287
 288         void operator()(code_block *compiled, cell size)
 289         {
 290                 objects.push_back(compiled->owner);
 291                 objects.push_back(compiled->parameters);
 292                 objects.push_back(compiled->relocation);
 293
 294                 objects.push_back(tag_fixnum(compiled->type()));
 295                 objects.push_back(tag_fixnum(compiled->size()));
 296
 297                 /* Note: the entry point is always a multiple of the heap
 298                 alignment (16 bytes). We cannot allocate while iterating
 299                 through the code heap, so it is not possible to call
 300                 from_unsigned_cell() here. It is OK, however, to add it as
 301                 if it were a fixnum, and have library code shift it to the
 302                 left by 4. */
 303                 cell entry_point = (cell)compiled->entry_point();
 304                 FACTOR_ASSERT((entry_point & (data_alignment - 1)) == 0);
 305                 FACTOR_ASSERT((entry_point & TAG_MASK) == FIXNUM_TYPE);
 306                 objects.push_back(entry_point);
 307         }
 308 };
 309
 310 cell factor_vm::code_blocks()
 311 {
 312         code_block_accumulator accum;
 313         each_code_block(accum);
 314         return std_vector_to_array(accum.objects);
 315 }
 316
 317 void factor_vm::primitive_code_blocks()
 318 {
 319         ctx->push(code_blocks());
 320 }
 321
 322 }