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(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 all_blocks_set_verifier {
  76         std::set<code_block*> *leftovers;
  77
  78         all_blocks_set_verifier(std::set<code_block*> *leftovers) : leftovers(leftovers) {}
  79
  80         void operator()(code_block *block, cell size)
  81         {
  82                 FACTOR_ASSERT(leftovers->find(block) != leftovers->end());
  83                 leftovers->erase(block);
  84         }
  85 };
  86
  87 void code_heap::verify_all_blocks_set()
  88 {
  89         std::set<code_block*> leftovers = all_blocks;
  90         all_blocks_set_verifier verifier(&leftovers);
  91         allocator->iterate(verifier);
  92         FACTOR_ASSERT(leftovers.empty());
  93 }
  94
  95 code_block *code_heap::code_block_for_address(cell address)
  96 {
  97 #ifdef FACTOR_DEBUG
  98         verify_all_blocks_set();
  99 #endif
 100         std::set<code_block*>::const_iterator blocki =
 101                 all_blocks.upper_bound((code_block*)address);
 102         FACTOR_ASSERT(blocki != all_blocks.begin());
 103         --blocki;
 104         code_block* found_block = *blocki;
 105         FACTOR_ASSERT((cell)found_block->entry_point() <= address
 106                 && address - (cell)found_block->entry_point() < found_block->size());
 107         return found_block;
 108 }
 109
 110 struct all_blocks_set_inserter {
 111         code_heap *code;
 112
 113         all_blocks_set_inserter(code_heap *code) : code(code) {}
 114
 115         void operator()(code_block *block, cell size)
 116         {
 117                 code->all_blocks.insert(block);
 118         }
 119 };
 120
 121 void code_heap::initialize_all_blocks_set()
 122 {
 123         all_blocks.clear();
 124         all_blocks_set_inserter inserter(this);
 125         allocator->iterate(inserter);
 126 }
 127
 128 void code_heap::update_all_blocks_set(mark_bits<code_block> *code_forwarding_map)
 129 {
 130         std::set<code_block *> new_all_blocks;
 131         for (std::set<code_block *>::const_iterator oldi = all_blocks.begin();
 132                 oldi != all_blocks.end();
 133                 ++oldi)
 134         {
 135                 code_block *new_block = code_forwarding_map->forward_block(*oldi);
 136                 new_all_blocks.insert(new_block);
 137         }
 138         all_blocks.swap(new_all_blocks);
 139 }
 140
 141 /* Allocate a code heap during startup */
 142 void factor_vm::init_code_heap(cell size)
 143 {
 144         code = new code_heap(size);
 145 }
 146
 147 struct word_updater {
 148         factor_vm *parent;
 149         bool reset_inline_caches;
 150
 151         word_updater(factor_vm *parent_, bool reset_inline_caches_) :
 152                 parent(parent_), reset_inline_caches(reset_inline_caches_) {}
 153
 154         void operator()(code_block *compiled, cell size)
 155         {
 156                 parent->update_word_references(compiled,reset_inline_caches);
 157         }
 158 };
 159
 160 /* Update pointers to words referenced from all code blocks.
 161 Only needed after redefining an existing word.
 162 If generic words were redefined, inline caches need to be reset. */
 163 void factor_vm::update_code_heap_words(bool reset_inline_caches)
 164 {
 165         word_updater updater(this,reset_inline_caches);
 166         each_code_block(updater);
 167 }
 168
 169 /* Fix up new words only.
 170 Fast path for compilation units that only define new words. */
 171 void factor_vm::initialize_code_blocks()
 172 {
 173         std::map<code_block *, cell>::const_iterator iter = code->uninitialized_blocks.begin();
 174         std::map<code_block *, cell>::const_iterator end = code->uninitialized_blocks.end();
 175
 176         for(; iter != end; iter++)
 177                 initialize_code_block(iter->first,iter->second);
 178
 179         code->uninitialized_blocks.clear();
 180 }
 181
 182 void factor_vm::primitive_modify_code_heap()
 183 {
 184         bool reset_inline_caches = to_boolean(ctx->pop());
 185         bool update_existing_words = to_boolean(ctx->pop());
 186         data_root<array> alist(ctx->pop(),this);
 187
 188         cell count = array_capacity(alist.untagged());
 189
 190         if(count == 0)
 191                 return;
 192
 193         for(cell i = 0; i < count; i++)
 194         {
 195                 data_root<array> pair(array_nth(alist.untagged(),i),this);
 196
 197                 data_root<word> word(array_nth(pair.untagged(),0),this);
 198                 data_root<object> data(array_nth(pair.untagged(),1),this);
 199
 200                 switch(data.type())
 201                 {
 202                 case QUOTATION_TYPE:
 203                         jit_compile_word(word.value(),data.value(),false);
 204                         break;
 205                 case ARRAY_TYPE:
 206                         {
 207                                 array *compiled_data = data.as<array>().untagged();
 208                                 cell parameters = array_nth(compiled_data,0);
 209                                 cell literals = array_nth(compiled_data,1);
 210                                 cell relocation = array_nth(compiled_data,2);
 211                                 cell labels = array_nth(compiled_data,3);
 212                                 cell code = array_nth(compiled_data,4);
 213
 214                                 code_block *compiled = add_code_block(
 215                                         code_block_optimized,
 216                                         code,
 217                                         labels,
 218                                         word.value(),
 219                                         relocation,
 220                                         parameters,
 221                                         literals);
 222
 223                                 word->entry_point = compiled->entry_point();
 224                         }
 225                         break;
 226                 default:
 227                         critical_error("Expected a quotation or an array",data.value());
 228                         break;
 229                 }
 230         }
 231
 232         if(update_existing_words)
 233                 update_code_heap_words(reset_inline_caches);
 234         else
 235                 initialize_code_blocks();
 236 }
 237
 238 code_heap_room factor_vm::code_room()
 239 {
 240         code_heap_room room;
 241
 242         room.size             = code->allocator->size;
 243         room.occupied_space   = code->allocator->occupied_space();
 244         room.total_free       = code->allocator->free_space();
 245         room.contiguous_free  = code->allocator->largest_free_block();
 246         room.free_block_count = code->allocator->free_block_count();
 247
 248         return room;
 249 }
 250
 251 void factor_vm::primitive_code_room()
 252 {
 253         code_heap_room room = code_room();
 254         ctx->push(tag<byte_array>(byte_array_from_value(&room)));
 255 }
 256
 257 struct stack_trace_stripper {
 258         explicit stack_trace_stripper() {}
 259
 260         void operator()(code_block *compiled, cell size)
 261         {
 262                 compiled->owner = false_object;
 263         }
 264 };
 265
 266 void factor_vm::primitive_strip_stack_traces()
 267 {
 268         stack_trace_stripper stripper;
 269         each_code_block(stripper);
 270 }
 271
 272 struct code_block_accumulator {
 273         std::vector<cell> objects;
 274
 275         void operator()(code_block *compiled, cell size)
 276         {
 277                 objects.push_back(compiled->owner);
 278                 objects.push_back(compiled->parameters);
 279                 objects.push_back(compiled->relocation);
 280
 281                 objects.push_back(tag_fixnum(compiled->type()));
 282                 objects.push_back(tag_fixnum(compiled->size()));
 283
 284                 /* Note: the entry point is always a multiple of the heap
 285                 alignment (16 bytes). We cannot allocate while iterating
 286                 through the code heap, so it is not possible to call
 287                 from_unsigned_cell() here. It is OK, however, to add it as
 288                 if it were a fixnum, and have library code shift it to the
 289                 left by 4. */
 290                 cell entry_point = (cell)compiled->entry_point();
 291                 FACTOR_ASSERT((entry_point & (data_alignment - 1)) == 0);
 292                 FACTOR_ASSERT((entry_point & TAG_MASK) == FIXNUM_TYPE);
 293                 objects.push_back(entry_point);
 294         }
 295 };
 296
 297 cell factor_vm::code_blocks()
 298 {
 299         code_block_accumulator accum;
 300         each_code_block(accum);
 301         return std_vector_to_array(accum.objects);
 302 }
 303
 304 void factor_vm::primitive_code_blocks()
 305 {
 306         ctx->push(code_blocks());
 307 }
 308
 309 }