HomeSort by relevance Sort by last modified time
    Searched refs:heap_capacity (Results 1 - 7 of 7) sorted by null

  /art/runtime/gc/accounting/
space_bitmap_test.cc 36 size_t heap_capacity = 16 * MB; local
38 heap_begin, heap_capacity));
62 size_t heap_capacity = 16 * MB; local
65 heap_begin, heap_capacity));
card_table.cc 53 CardTable* CardTable::Create(const byte* heap_begin, size_t heap_capacity) {
55 size_t capacity = heap_capacity / kCardSize;
space_bitmap.cc 54 byte* heap_begin, size_t heap_capacity) {
57 size_t bitmap_size = OffsetToIndex(RoundUp(heap_capacity, kAlignment * kBitsPerWord)) * kWordSize;
61 SpaceBitmap* SpaceBitmap::Create(const std::string& name, byte* heap_begin, size_t heap_capacity) {
63 // Round up since heap_capacity is not necessarily a multiple of kAlignment * kBitsPerWord.
64 size_t bitmap_size = OffsetToIndex(RoundUp(heap_capacity, kAlignment * kBitsPerWord)) * kWordSize;
70 return CreateFromMemMap(name, mem_map.release(), heap_begin, heap_capacity);
card_table.h 53 static CardTable* Create(const byte* heap_begin, size_t heap_capacity);
space_bitmap.h 52 // heap_begin of heap_capacity bytes, where objects are guaranteed to be kAlignment-aligned.
53 static SpaceBitmap* Create(const std::string& name, byte* heap_begin, size_t heap_capacity);
56 // mem map. The address range covered starts at heap_begin and is of size equal to heap_capacity.
59 byte* heap_begin, size_t heap_capacity);
  /art/runtime/gc/
heap_test.cc 60 const size_t heap_capacity = accounting::SpaceBitmap::kAlignment * (sizeof(intptr_t) * 8 + 1); local
63 heap_capacity));
65 reinterpret_cast<mirror::Object*>(&heap_begin[heap_capacity -
heap.cc 185 size_t heap_capacity = continuous_spaces_.back()->End() - continuous_spaces_.front()->Begin(); local
187 heap_capacity += continuous_spaces_.back()->AsDlMallocSpace()->NonGrowthLimitCapacity();
191 card_table_.reset(accounting::CardTable::Create(heap_begin, heap_capacity));
    [all...]

Completed in 37 milliseconds