/art/runtime/gc/space/ |
H A D | dlmalloc_space_base_test.cc | 27 size_t capacity, byte* requested_begin) { 28 return DlMallocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, false); 26 CreateDlMallocSpace(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, byte* requested_begin) argument
|
H A D | dlmalloc_space_random_test.cc | 26 size_t capacity, byte* 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, byte* requested_begin) argument
|
H A D | dlmalloc_space_static_test.cc | 26 size_t capacity, byte* 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, byte* requested_begin) argument
|
H A D | rosalloc_space_base_test.cc | 24 size_t capacity, byte* 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, byte* requested_begin) argument
|
H A D | rosalloc_space_random_test.cc | 24 size_t capacity, byte* 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, byte* requested_begin) argument
|
H A D | rosalloc_space_static_test.cc | 24 size_t capacity, byte* 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, byte* requested_begin) argument
|
H A D | malloc_space.cc | 69 size_t* growth_limit, size_t* capacity, byte* 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, byte* requested_begin) argument 176 const size_t capacity = Capacity() - size; local [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 name, mem_map, mspace, begin, end, begin + capacity, growth_limit, initial_size, 72 return new DlMallocSpace(name, mem_map, mspace, begin, end, begin + capacity, growth_limit, 78 size_t growth_limit, size_t capacity, byte* 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, byte* requested_begin, bool can_move_objects) argument [all...] |
H A D | rosalloc_space.cc | 56 size_t growth_limit, size_t capacity, 60 capacity, low_memory_mode); 68 if (capacity - starting_size > 0) { 69 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); 79 return new RosAllocSpace(name, mem_map, rosalloc, begin, end, begin + capacity, growth_limit, 89 size_t growth_limit, size_t capacity, byte* requested_begin, 97 << " capacity=" << PrettySize(capacity) 106 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity, 110 << PrettySize(capacity); 54 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 88 Create(const std::string& name, size_t initial_size, size_t growth_limit, size_t capacity, byte* requested_begin, bool low_memory_mode, bool can_move_objects) argument [all...] |
H A D | space.cc | 75 const size_t capacity = static_cast<size_t>(std::numeric_limits<uint32_t>::max()); local 77 capacity)); 80 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, 35 << PrettySize(capacity) << " with message " << error_msg;
|
H A D | dlmalloc_space.h | 39 size_t growth_limit, size_t capacity, 47 size_t capacity, byte* requested_begin, bool can_move_objects);
|
H A D | rosalloc_space.h | 42 size_t capacity, byte* requested_begin, bool low_memory_mode, 46 size_t growth_limit, size_t capacity,
|
H A D | bump_pointer_space.h | 45 static BumpPointerSpace* Create(const std::string& name, size_t capacity, byte* 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
|
H A D | malloc_space.h | 97 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the 103 // Override capacity so that we only return the possibly limited capacity 146 size_t* growth_limit, size_t* capacity, byte* requested_begin); 172 // The capacity of the alloc space until such time that ClearGrowthLimit is called. 174 // limit is a value <= to the mem_map_ capacity used for ergonomic reasons because of the zygote. 176 // will be set to a lower value. The growth_limit_ is used as the capacity of the alloc_space_, 177 // however, capacity normally can't vary. In the case of the growth_limit_ it can be cleared
|
H A D | space_test.h | 113 size_t capacity, byte* requested_begin); 549 size_t capacity = 16 * MB; local 550 MallocSpace* space(create_space("test", initial_size, growth_limit, capacity, nullptr)); 555 EXPECT_EQ(space->NonGrowthLimitCapacity(), capacity); 566 EXPECT_EQ(space->Capacity(), capacity); 567 SizeFootPrintGrowthLimitAndTrimBody(space, object_size, 3, capacity);
|
/art/runtime/gc/accounting/ |
H A D | card_table.cc | 60 size_t capacity = heap_capacity / kCardSize; local 64 MemMap::MapAnonymous("card table", nullptr, capacity + 256, PROT_READ | PROT_WRITE,
|
H A D | atomic_stack.h | 38 static AtomicStack* Create(const std::string& name, size_t growth_limit, size_t capacity) { argument 39 std::unique_ptr<AtomicStack> mark_stack(new AtomicStack(name, growth_limit, capacity)); 183 AtomicStack(const std::string& name, size_t growth_limit, size_t capacity) argument 189 capacity_(capacity),
|
H A D | space_bitmap.cc | 31 size_t SpaceBitmap<kAlignment>::ComputeBitmapSize(uint64_t capacity) { argument 33 return (RoundUp(capacity, kBytesCoveredPerWord) / kBytesCoveredPerWord) * kWordSize; 80 // Not sure if doing this trim is necessary, since nothing past the end of the heap capacity
|
H A D | space_bitmap.h | 198 // Helper function for computing bitmap size based on a 64 bit capacity. 199 static size_t ComputeBitmapSize(uint64_t capacity);
|
/art/compiler/utils/ |
H A D | assembler.cc | 33 static byte* NewContents(size_t capacity) { argument 34 return new byte[capacity];
|
H A D | assembler.h | 267 // Make sure that extending the capacity leaves a big enough gap 270 // Mark the buffer as having ensured the capacity. 305 // capacity needed for emitting, we add a dummy method in non-debug mode. 341 // Compute the limit based on the data area and the capacity. See 343 static byte* ComputeLimit(byte* data, size_t capacity) { argument 344 return data + capacity - kMinimumGap;
|
/art/runtime/ |
H A D | indirect_reference_table.h | 227 explicit IrtIterator(IrtEntry* table, size_t i, size_t capacity) 229 : table_(table), i_(i), capacity_(capacity) {
|
/art/runtime/base/ |
H A D | stringpiece.h | 146 int capacity() const { return length_; } function in class:art::StringPiece
|
/art/runtime/gc/ |
H A D | heap.h | 158 double foreground_heap_growth_multiplier, size_t capacity, 290 // Removes the growth limit on the alloc space so it may grow to its maximum capacity. Used to 613 size_t capacity, int prot_flags, 735 size_t capacity); 739 size_t growth_limit, size_t capacity, 847 // If we ignore the max footprint it lets the heap grow until it hits the heap capacity, this is 878 // The size the heap is limited to. This is initially smaller than capacity, but for largeHeap 879 // programs it is "cleared" making it the same as capacity.
|