Searched defs:heap_capacity (Results 1 - 5 of 5) sorted by relevance
/art/runtime/gc/ |
H A D | heap_test.cc | 67 const size_t heap_capacity = kObjectAlignment * (sizeof(intptr_t) * 8 + 1); local 69 accounting::ContinuousSpaceBitmap::Create("test bitmap", heap_begin, heap_capacity)); 71 reinterpret_cast<mirror::Object*>(&heap_begin[heap_capacity - kObjectAlignment]);
|
H A D | heap.cc | 423 size_t heap_capacity = heap_end - heap_begin; local 432 card_table_.reset(accounting::CardTable::Create(heap_begin, heap_capacity));
|
/art/runtime/gc/accounting/ |
H A D | card_table.cc | 59 CardTable* CardTable::Create(const uint8_t* heap_begin, size_t heap_capacity) { argument 61 size_t capacity = heap_capacity / kCardSize;
|
H A D | space_bitmap_test.cc | 34 size_t heap_capacity = 16 * MB; local 36 ContinuousSpaceBitmap::Create("test bitmap", heap_begin, heap_capacity)); 61 size_t heap_capacity = 16 * MB; local 64 ContinuousSpaceBitmap::Create("test bitmap", heap_begin, heap_capacity)); 116 size_t heap_capacity = 16 * MB; variable 124 ContinuousSpaceBitmap::Create("test bitmap", heap_begin, heap_capacity)); 127 size_t offset = RoundDown(r.next() % heap_capacity, kAlignment); 141 size_t offset = RoundDown(r.next() % heap_capacity, kAlignment); 142 size_t remain = heap_capacity - offset;
|
H A D | space_bitmap.cc | 44 const std::string& name, MemMap* mem_map, uint8_t* heap_begin, size_t heap_capacity) { 47 const size_t bitmap_size = ComputeBitmapSize(heap_capacity); 66 const std::string& name, uint8_t* heap_begin, size_t heap_capacity) { 67 // Round up since heap_capacity is not necessarily a multiple of kAlignment * kBitsPerWord. 68 const size_t bitmap_size = ComputeBitmapSize(heap_capacity); 77 return CreateFromMemMap(name, mem_map.release(), heap_begin, heap_capacity); 43 CreateFromMemMap( const std::string& name, MemMap* mem_map, uint8_t* heap_begin, size_t heap_capacity) argument 65 Create( const std::string& name, uint8_t* heap_begin, size_t heap_capacity) argument
|
Completed in 25 milliseconds