/art/runtime/gc/space/ |
H A D | dlmalloc_space_random_test.cc | 26 size_t capacity, uint8_t* requested_begin) { 27 return DlMallocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, false); 25 CreateDlMallocSpace(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, uint8_t* requested_begin) argument
|
H A D | dlmalloc_space_static_test.cc | 26 size_t capacity, uint8_t* requested_begin) { 27 return DlMallocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, false); 25 CreateDlMallocSpace(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, uint8_t* requested_begin) argument
|
H A D | rosalloc_space_random_test.cc | 24 size_t capacity, uint8_t* requested_begin) { 25 return RosAllocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, 23 CreateRosAllocSpace(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, uint8_t* requested_begin) argument
|
H A D | rosalloc_space_static_test.cc | 24 size_t capacity, uint8_t* requested_begin) { 25 return RosAllocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, 23 CreateRosAllocSpace(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, uint8_t* requested_begin) argument
|
H A D | malloc_space.cc | 69 size_t* growth_limit, size_t* capacity, uint8_t* requested_begin) { 76 << PrettySize(*initial_size) << ") is larger than its capacity (" 80 if (*growth_limit > *capacity) { 81 LOG(ERROR) << "Failed to create alloc space (" << name << ") where the growth limit capacity (" 82 << PrettySize(*growth_limit) << ") is larger than the capacity (" 83 << PrettySize(*capacity) << ")"; 87 // Page align growth limit and capacity which will be used to manage mmapped storage 89 *capacity = RoundUp(*capacity, kPageSize); 92 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, *capacity, 68 CreateMemMap(const std::string& name, size_t starting_size, size_t* initial_size, size_t* growth_limit, size_t* capacity, uint8_t* requested_begin) argument 177 const size_t capacity = NonGrowthLimitCapacity() - size; local [all...] |
H A D | rosalloc_space.cc | 57 size_t growth_limit, size_t capacity, 64 capacity, low_memory_mode, running_on_memory_tool); 72 if (capacity - starting_size > 0) { 73 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); 82 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit, 85 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, 95 size_t growth_limit, size_t capacity, uint8_t* requested_begin, 103 << " capacity=" << PrettySize(capacity) 112 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity, 55 CreateFromMemMap(MemMap* mem_map, const std::string& name, size_t starting_size, size_t initial_size, size_t growth_limit, size_t capacity, bool low_memory_mode, bool can_move_objects) argument 94 Create(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, uint8_t* requested_begin, bool low_memory_mode, bool can_move_objects) argument [all...] |
H A D | dlmalloc_space.cc | 50 size_t growth_limit, size_t capacity, 61 if (capacity - starting_size > 0) { 62 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); 69 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit, 72 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity, 78 size_t growth_limit, size_t capacity, uint8_t* requested_begin, 86 << " capacity=" << PrettySize(capacity) 95 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity, 99 << PrettySize(capacity); 48 CreateFromMemMap(MemMap* mem_map, const std::string& name, size_t starting_size, size_t initial_size, size_t growth_limit, size_t capacity, bool can_move_objects) argument 77 Create(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, uint8_t* requested_begin, bool can_move_objects) argument [all...] |
H A D | space.cc | 80 const size_t capacity = static_cast<size_t>(std::numeric_limits<uint32_t>::max()); local 82 capacity)); 85 capacity));
|
H A D | bump_pointer_space.cc | 27 BumpPointerSpace* BumpPointerSpace::Create(const std::string& name, size_t capacity, argument 29 capacity = RoundUp(capacity, kPageSize); 31 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), requested_begin, capacity, 36 << PrettySize(capacity) << " with message " << error_msg;
|
H A D | space_test.h | 131 size_t capacity, uint8_t* requested_begin); 329 size_t capacity = 16 * MB; local 330 MallocSpace* space(create_space("test", initial_size, growth_limit, capacity, nullptr)); 335 EXPECT_EQ(space->NonGrowthLimitCapacity(), capacity); 346 EXPECT_EQ(space->Capacity(), capacity); 347 SizeFootPrintGrowthLimitAndTrimBody(space, object_size, 3, capacity);
|
H A D | dlmalloc_space.h | 39 size_t growth_limit, size_t capacity, 47 size_t capacity, uint8_t* requested_begin, bool can_move_objects);
|
H A D | region_space.cc | 31 RegionSpace* RegionSpace::Create(const std::string& name, size_t capacity, argument 33 capacity = RoundUp(capacity, kRegionSize); 35 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), requested_begin, capacity, 40 << PrettySize(capacity) << " with message " << error_msg;
|
H A D | rosalloc_space.h | 42 size_t capacity, uint8_t* requested_begin, bool low_memory_mode, 46 size_t growth_limit, size_t capacity,
|
H A D | space_create_test.cc | 37 size_t capacity, 44 capacity, 52 capacity, 34 CreateSpace(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, uint8_t* requested_begin) argument
|
H A D | malloc_space.h | 102 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the 108 // Override capacity so that we only return the possibly limited capacity 118 // Change the non growth limit capacity by shrinking or expanding the map. Currently, only 155 size_t* growth_limit, size_t* capacity, uint8_t* requested_begin); 181 // The capacity of the alloc space until such time that ClearGrowthLimit is called. 183 // limit is a value <= to the mem_map_ capacity used for ergonomic reasons because of the zygote. 185 // will be set to a lower value. The growth_limit_ is used as the capacity of the alloc_space_, 186 // however, capacity normally can't vary. In the case of the growth_limit_ it can be cleared
|
H A D | bump_pointer_space.h | 45 static BumpPointerSpace* Create(const std::string& name, size_t capacity, uint8_t* requested_begin); 77 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the 83 // Override capacity so that we only return the possibly limited capacity
|
/art/runtime/gc/accounting/ |
H A D | read_barrier_table.h | 36 size_t capacity = static_cast<size_t>(kHeapCapacity / kRegionSize); local 40 MemMap* mem_map = MemMap::MapAnonymous("read barrier table", nullptr, capacity,
|
H A D | atomic_stack.h | 56 static AtomicStack* Create(const std::string& name, size_t growth_limit, size_t capacity) { argument 57 std::unique_ptr<AtomicStack> mark_stack(new AtomicStack(name, growth_limit, capacity)); 211 AtomicStack(const std::string& name, size_t growth_limit, size_t capacity) argument 217 capacity_(capacity),
|
H A D | card_table.cc | 63 size_t capacity = heap_capacity / kCardSize; local 67 MemMap::MapAnonymous("card table", nullptr, capacity + 256, PROT_READ | PROT_WRITE,
|
H A D | space_bitmap.cc | 32 size_t SpaceBitmap<kAlignment>::ComputeBitmapSize(uint64_t capacity) { argument 34 return (RoundUp(capacity, kBytesCoveredPerWord) / kBytesCoveredPerWord) * sizeof(intptr_t); 87 // Not sure if doing this trim is necessary, since nothing past the end of the heap capacity
|
H A D | space_bitmap.h | 192 // Helper function for computing bitmap size based on a 64 bit capacity. 193 static size_t ComputeBitmapSize(uint64_t capacity);
|
/art/runtime/ |
H A D | jni_env_ext.h | 46 void PushFrame(int capacity) SHARED_REQUIRES(Locks::mutator_lock_);
|
H A D | indirect_reference_table.h | 231 IrtIterator(IrtEntry* table, size_t i, size_t capacity) SHARED_REQUIRES(Locks::mutator_lock_) 232 : table_(table), i_(i), capacity_(capacity) {
|
/art/compiler/utils/ |
H A D | assembler.h | 190 // Make sure that extending the capacity leaves a big enough gap 193 // Mark the buffer as having ensured the capacity. 230 // capacity needed for emitting, we add a dummy method in non-debug mode. 243 // Unconditionally increase the capacity. 272 // Compute the limit based on the data area and the capacity. See 274 static uint8_t* ComputeLimit(uint8_t* data, size_t capacity) { argument 275 return data + capacity - kMinimumGap; 335 void ReserveCFIStream(size_t capacity) { argument 336 opcodes_.reserve(capacity);
|
/art/compiler/ |
H A D | exception_test.cc | 91 CHECK_GE(fake_header_code_and_maps_.capacity(), fake_header_code_and_maps_.size() + padding);
|