factor/vm/code_heap.hpp

58 lines
1.5 KiB
C++
Raw Normal View History

2013-05-11 21:51:54 -04:00
namespace factor {
#if defined(WINDOWS) && defined(FACTOR_64)
2013-05-11 21:51:54 -04:00
const cell seh_area_size = 1024;
#else
2013-05-11 21:51:54 -04:00
const cell seh_area_size = 0;
#endif
struct code_heap {
// The actual memory area
2013-05-11 21:51:54 -04:00
segment* seg;
// Memory area reserved for safepoint guard page
cell safepoint_page;
// Memory area reserved for SEH. Only used on Windows
2013-05-11 21:51:54 -04:00
char* seh_area;
// Memory allocator
2013-05-11 21:51:54 -04:00
free_list_allocator<code_block>* allocator;
2013-05-11 21:51:54 -04:00
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.
2013-05-11 21:51:54 -04:00
std::map<code_block*, cell> uninitialized_blocks;
// Code blocks which may reference objects in the nursery
2013-05-11 21:51:54 -04:00
std::set<code_block*> points_to_nursery;
// Code blocks which may reference objects in aging space or the nursery
2013-05-11 21:51:54 -04:00
std::set<code_block*> points_to_aging;
2013-05-11 21:51:54 -04:00
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);
2013-05-11 21:51:54 -04:00
void verify_all_blocks_set();
void initialize_all_blocks_set();
2013-05-11 21:51:54 -04:00
void sweep();
2013-05-11 21:51:54 -04:00
code_block* code_block_for_address(cell address);
cell frame_predecessor(cell frame_top);
2013-05-11 21:51:54 -04:00
bool safepoint_p(cell addr) {
cell page_mask = ~(getpagesize() - 1);
return (addr & page_mask) == safepoint_page;
2013-05-11 21:51:54 -04:00
}
};
2009-05-04 02:46:13 -04:00
}