2009-05-04 02:46:13 -04:00
|
|
|
namespace factor
|
|
|
|
{
|
2009-09-25 21:32:00 -04:00
|
|
|
|
2009-10-20 16:15:05 -04:00
|
|
|
struct code_heap {
|
|
|
|
/* The actual memory area */
|
|
|
|
segment *seg;
|
|
|
|
|
|
|
|
/* Memory allocator */
|
2009-10-24 22:24:06 -04:00
|
|
|
free_list_allocator<code_block> *allocator;
|
2009-10-20 16:15:05 -04:00
|
|
|
|
2009-12-02 05:28:15 -05:00
|
|
|
/* 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;
|
2009-10-06 06:52:45 -04:00
|
|
|
|
2009-10-09 00:10:32 -04:00
|
|
|
/* Code blocks which may reference objects in the nursery */
|
|
|
|
std::set<code_block *> points_to_nursery;
|
|
|
|
|
|
|
|
/* Code blocks which may reference objects in aging space or the nursery */
|
|
|
|
std::set<code_block *> points_to_aging;
|
2009-10-06 05:36:34 -04:00
|
|
|
|
2009-10-20 16:15:05 -04:00
|
|
|
explicit code_heap(cell size);
|
|
|
|
~code_heap();
|
2009-10-06 05:36:34 -04:00
|
|
|
void write_barrier(code_block *compiled);
|
2009-10-16 03:55:02 -04:00
|
|
|
void clear_remembered_set();
|
2009-12-02 05:28:15 -05:00
|
|
|
bool uninitialized_p(code_block *compiled);
|
2009-10-24 22:24:06 -04:00
|
|
|
bool marked_p(code_block *compiled);
|
2009-10-20 16:15:05 -04:00
|
|
|
void set_marked_p(code_block *compiled);
|
|
|
|
void clear_mark_bits();
|
2009-10-06 05:36:34 -04:00
|
|
|
void code_heap_free(code_block *compiled);
|
2009-12-02 01:48:41 -05:00
|
|
|
void flush_icache();
|
2009-10-03 09:47:05 -04:00
|
|
|
};
|
|
|
|
|
2009-10-27 04:32:28 -04:00
|
|
|
struct code_heap_room {
|
|
|
|
cell size;
|
|
|
|
cell occupied_space;
|
|
|
|
cell total_free;
|
|
|
|
cell contiguous_free;
|
|
|
|
cell free_block_count;
|
|
|
|
};
|
|
|
|
|
2009-05-04 02:46:13 -04:00
|
|
|
}
|