-namespace factor
-{
+namespace factor {
#if defined(WINDOWS) && defined(FACTOR_64)
- const cell seh_area_size = 1024;
+const cell seh_area_size = 1024;
#else
- const cell seh_area_size = 0;
+const cell seh_area_size = 0;
#endif
struct code_heap {
- /* The actual memory area */
- segment *seg;
+ // The actual memory area
+ segment* seg;
- /* Memory area reserved for safepoint guard page */
- void *safepoint_page;
+ // Memory area reserved for safepoint guard page
+ cell safepoint_page;
- /* Memory area reserved for SEH. Only used on Windows */
- char *seh_area;
+ // Memory area reserved for SEH. Only used on Windows
+ char* seh_area;
- /* Memory allocator */
- free_list_allocator<code_block> *allocator;
+ // Memory allocator
+ free_list_allocator<code_block>* allocator;
- std::set<code_block *> all_blocks;
+ // 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. */
- std::map<code_block *, cell> uninitialized_blocks;
- /* Code blocks which may reference objects in the nursery */
- std::set<code_block *> points_to_nursery;
+ // 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 aging space or the nursery */
- std::set<code_block *> points_to_aging;
+ // Code blocks which may reference objects in the nursery
+ std::set<code_block*> points_to_nursery;
- explicit code_heap(cell size);
- ~code_heap();
- void write_barrier(code_block *compiled);
- void clear_remembered_set();
- bool uninitialized_p(code_block *compiled);
- bool marked_p(code_block *compiled);
- void set_marked_p(code_block *compiled);
- void clear_mark_bits();
- void free(code_block *compiled);
- void flush_icache();
- void guard_safepoint();
- void unguard_safepoint();
- void verify_all_blocks_set();
- void initialize_all_blocks_set();
+ // Code blocks which may reference objects in aging space or the nursery
+ std::set<code_block*> points_to_aging;
- code_block *code_block_for_address(cell address);
+ explicit code_heap(cell size);
+ ~code_heap();
+ void write_barrier(code_block* compiled);
+ void clear_remembered_set();
+ bool uninitialized_p(code_block* compiled);
+ void free(code_block* compiled);
+ void flush_icache();
+ void set_safepoint_guard(bool locked);
+ void verify_all_blocks_set();
+ void initialize_all_blocks_set();
+ cell high_water_mark() { return allocator->size / 20; }
- bool safepoint_p(cell addr)
- {
- cell page_mask = ~(getpagesize() - 1);
- return (addr & page_mask) == (cell)safepoint_page;
- }
-};
+ void sweep();
+
+ code_block* code_block_for_address(cell address);
+ cell frame_predecessor(cell frame_top);
-struct code_heap_room {
- cell size;
- cell occupied_space;
- cell total_free;
- cell contiguous_free;
- cell free_block_count;
+ bool safepoint_p(cell addr) {
+ cell page_mask = ~(getpagesize() - 1);
+ return (addr & page_mask) == safepoint_page;
+ }
};
}