io.streams.256color: faster by caching styles

[factor.git] / vm / code_heap.hpp

diff --git a/vm/code_heap.hpp b/vm/code_heap.hpp
index 65e4379f20b4ebee8efd1fdfa7190068b7a184d0..86c315e3183a1a129dc50372fb4d77232a1e1577 100644 (file)
--- a/vm/code_heap.hpp
+++ b/vm/code_heap.hpp
@@ -19,11 +19,18 @@ struct code_heap {
   // Memory allocator
   free_list_allocator<code_block>* allocator;
 
+  // For fast lookup of blocks from addresses.
   std::set<cell> all_blocks;
 
-  // Keys are blocks which need to be initialized by initialize_code_block().
-  // Values are literal tables. Literal table arrays are GC roots until the
-  // time the block is initialized, after which point they are discarded.
+
+  // Code blocks are initialized in two steps in
+  // primitive_modify_code_heap() because they might reference each
+  // other. First they are all allocated and placed in this map with
+  // their literal tables which are GC roots until the block is
+  // initialized. Then they are all initialized by
+  // initialize_code_block() which resolves relocations and updates
+  // addresses. Uninitialized blocks instructions must not be visited
+  // by GC.
   std::map<code_block*, cell> uninitialized_blocks;
 
   // Code blocks which may reference objects in the nursery
@@ -42,6 +49,7 @@ struct code_heap {
   void set_safepoint_guard(bool locked);
   void verify_all_blocks_set();
   void initialize_all_blocks_set();
+  cell high_water_mark() { return allocator->size / 20; }
 
   void sweep();