Home
last modified time | relevance | path

Searched refs:capacity (Results 1 – 25 of 32) sorted by relevance

12

/art/runtime/gc/space/
Dmalloc_space.cc69 size_t* growth_limit, size_t* capacity, byte* requested_begin) { in CreateMemMap() argument
80 if (*growth_limit > *capacity) { in CreateMemMap()
83 << PrettySize(*capacity) << ")"; in CreateMemMap()
89 *capacity = RoundUp(*capacity, kPageSize); in CreateMemMap()
92 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, *capacity, in CreateMemMap()
96 << PrettySize(*capacity) << ": " << error_msg; in CreateMemMap()
176 const size_t capacity = Capacity() - size; in CreateZygoteSpace() local
188 VLOG(heap) << "Capacity " << PrettySize(capacity); in CreateZygoteSpace()
194 void* allocator = CreateAllocator(End(), starting_size_, initial_size_, capacity, in CreateZygoteSpace()
198 if (capacity > initial_size_) { in CreateZygoteSpace()
[all …]
Ddlmalloc_space.cc50 size_t growth_limit, size_t capacity, in CreateFromMemMap() argument
61 if (capacity - starting_size > 0) { in CreateFromMemMap()
62 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); in CreateFromMemMap()
69 name, mem_map, mspace, begin, end, begin + capacity, growth_limit, initial_size, in CreateFromMemMap()
72 return new DlMallocSpace(name, mem_map, mspace, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
78 size_t growth_limit, size_t capacity, byte* requested_begin, in Create() argument
86 << " capacity=" << PrettySize(capacity) in Create()
95 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity, in Create()
99 << PrettySize(capacity); in Create()
103 growth_limit, capacity, can_move_objects); in Create()
Drosalloc_space.cc56 size_t growth_limit, size_t capacity, in CreateFromMemMap() argument
60 capacity, low_memory_mode); in CreateFromMemMap()
68 if (capacity - starting_size > 0) { in CreateFromMemMap()
69 CHECK_MEMORY_CALL(mprotect, (end, capacity - starting_size, PROT_NONE), name); in CreateFromMemMap()
79 return new RosAllocSpace(name, mem_map, rosalloc, begin, end, begin + capacity, growth_limit, in CreateFromMemMap()
89 size_t growth_limit, size_t capacity, byte* requested_begin, in Create() argument
97 << " capacity=" << PrettySize(capacity) in Create()
106 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity, in Create()
110 << PrettySize(capacity); in Create()
115 growth_limit, capacity, low_memory_mode, in Create()
Ddlmalloc_space_random_test.cc26 size_t capacity, byte* requested_begin) { in CreateDlMallocSpace() argument
27 return DlMallocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, false); in CreateDlMallocSpace()
Ddlmalloc_space_base_test.cc27 size_t capacity, byte* requested_begin) { in CreateDlMallocSpace() argument
28 return DlMallocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, false); in CreateDlMallocSpace()
Ddlmalloc_space_static_test.cc26 size_t capacity, byte* requested_begin) { in CreateDlMallocSpace() argument
27 return DlMallocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, false); in CreateDlMallocSpace()
Drosalloc_space_static_test.cc24 size_t capacity, byte* requested_begin) { in CreateRosAllocSpace() argument
25 return RosAllocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, in CreateRosAllocSpace()
Drosalloc_space_base_test.cc24 size_t capacity, byte* requested_begin) { in CreateRosAllocSpace() argument
25 return RosAllocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, in CreateRosAllocSpace()
Drosalloc_space_random_test.cc24 size_t capacity, byte* requested_begin) { in CreateRosAllocSpace() argument
25 return RosAllocSpace::Create(name, initial_size, growth_limit, capacity, requested_begin, in CreateRosAllocSpace()
Dspace.cc75 const size_t capacity = static_cast<size_t>(std::numeric_limits<uint32_t>::max()); in DiscontinuousSpace() local
77 capacity)); in DiscontinuousSpace()
80 capacity)); in DiscontinuousSpace()
Dbump_pointer_space.cc27 BumpPointerSpace* BumpPointerSpace::Create(const std::string& name, size_t capacity, in Create() argument
29 capacity = RoundUp(capacity, kPageSize); in Create()
31 std::unique_ptr<MemMap> mem_map(MemMap::MapAnonymous(name.c_str(), requested_begin, capacity, in Create()
35 << PrettySize(capacity) << " with message " << error_msg; in Create()
Ddlmalloc_space.h39 size_t growth_limit, size_t capacity,
47 size_t capacity, byte* requested_begin, bool can_move_objects);
Drosalloc_space.h42 size_t capacity, byte* requested_begin, bool low_memory_mode,
46 size_t growth_limit, size_t capacity,
Dspace_test.h113 size_t capacity, byte* requested_begin);
549 size_t capacity = 16 * MB; in SizeFootPrintGrowthLimitAndTrimDriver() local
550 MallocSpace* space(create_space("test", initial_size, growth_limit, capacity, nullptr)); in SizeFootPrintGrowthLimitAndTrimDriver()
555 EXPECT_EQ(space->NonGrowthLimitCapacity(), capacity); in SizeFootPrintGrowthLimitAndTrimDriver()
566 EXPECT_EQ(space->Capacity(), capacity); in SizeFootPrintGrowthLimitAndTrimDriver()
567 SizeFootPrintGrowthLimitAndTrimBody(space, object_size, 3, capacity); in SizeFootPrintGrowthLimitAndTrimDriver()
Dmalloc_space.h146 size_t* growth_limit, size_t* capacity, byte* requested_begin);
Dbump_pointer_space.h45 static BumpPointerSpace* Create(const std::string& name, size_t capacity, byte* requested_begin);
/art/runtime/gc/accounting/
Datomic_stack.h38 static AtomicStack* Create(const std::string& name, size_t growth_limit, size_t capacity) { in Create() argument
39 std::unique_ptr<AtomicStack> mark_stack(new AtomicStack(name, growth_limit, capacity)); in Create()
183 AtomicStack(const std::string& name, size_t growth_limit, size_t capacity) in AtomicStack() argument
189 capacity_(capacity), in AtomicStack()
Dcard_table.cc60 size_t capacity = heap_capacity / kCardSize; in Create() local
64 MemMap::MapAnonymous("card table", nullptr, capacity + 256, PROT_READ | PROT_WRITE, in Create()
Dspace_bitmap.cc31 size_t SpaceBitmap<kAlignment>::ComputeBitmapSize(uint64_t capacity) { in ComputeBitmapSize() argument
33 return (RoundUp(capacity, kBytesCoveredPerWord) / kBytesCoveredPerWord) * kWordSize; in ComputeBitmapSize()
/art/compiler/utils/
Dassembler.cc33 static byte* NewContents(size_t capacity) { in NewContents() argument
34 return new byte[capacity]; in NewContents()
Dassembler.h343 static byte* ComputeLimit(byte* data, size_t capacity) { in ComputeLimit() argument
344 return data + capacity - kMinimumGap; in ComputeLimit()
/art/runtime/
Dindirect_reference_table.h227 explicit IrtIterator(IrtEntry* table, size_t i, size_t capacity) in IrtIterator() argument
229 : table_(table), i_(i), capacity_(capacity) { in IrtIterator()
Djni_internal.h147 void PushFrame(int capacity);
/art/runtime/gc/
Dheap.h158 double foreground_heap_growth_multiplier, size_t capacity,
613 size_t capacity, int prot_flags,
735 size_t capacity);
739 size_t growth_limit, size_t capacity,
/art/runtime/base/
Dstringpiece.h146 int capacity() const { return length_; } in capacity() function

12