Searched refs:capacity (Results 1 - 25 of 40) sorted by relevance

12

/art/runtime/gc/space/
H A Ddlmalloc_space_random_test.cc26 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 Ddlmalloc_space_static_test.cc26 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 Drosalloc_space_random_test.cc24 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 Drosalloc_space_static_test.cc24 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 Dmalloc_space.cc74 size_t* growth_limit, size_t* capacity, uint8_t* requested_begin) {
81 << PrettySize(*initial_size) << ") is larger than its capacity ("
85 if (*growth_limit > *capacity) {
86 LOG(ERROR) << "Failed to create alloc space (" << name << ") where the growth limit capacity ("
87 << PrettySize(*growth_limit) << ") is larger than the capacity ("
88 << PrettySize(*capacity) << ")";
92 // Page align growth limit and capacity which will be used to manage mmapped storage
94 *capacity = RoundUp(*capacity, kPageSize);
97 MemMap* mem_map = MemMap::MapAnonymous(name.c_str(), requested_begin, *capacity,
73 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
182 const size_t capacity = NonGrowthLimitCapacity() - size; local
[all...]
H A Drosalloc_space.cc59 size_t growth_limit, size_t capacity,
66 capacity, low_memory_mode, running_on_memory_tool);
74 if (capacity - starting_size > 0) {
75 CheckedCall(mprotect, name.c_str(), end, capacity - starting_size, PROT_NONE);
84 mem_map, initial_size, name, rosalloc, begin, end, begin + capacity, growth_limit,
87 return new RosAllocSpace(mem_map, initial_size, name, rosalloc, begin, end, begin + capacity,
97 size_t growth_limit, size_t capacity, uint8_t* requested_begin,
105 << " capacity=" << PrettySize(capacity)
114 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity,
57 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
96 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 Ddlmalloc_space.cc52 size_t growth_limit, size_t capacity,
63 if (capacity - starting_size > 0) {
64 CheckedCall(mprotect, name.c_str(), end, capacity - starting_size, PROT_NONE);
71 mem_map, initial_size, name, mspace, begin, end, begin + capacity, growth_limit,
74 return new DlMallocSpace(mem_map, initial_size, name, mspace, begin, end, begin + capacity,
80 size_t growth_limit, size_t capacity, uint8_t* requested_begin,
88 << " capacity=" << PrettySize(capacity)
97 MemMap* mem_map = CreateMemMap(name, starting_size, &initial_size, &growth_limit, &capacity,
101 << PrettySize(capacity);
50 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
79 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 Dbump_pointer_space.cc27 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 Dspace.cc83 const size_t capacity = static_cast<size_t>(std::numeric_limits<uint32_t>::max()); local
85 capacity));
88 capacity));
H A Dspace_test.h128 size_t capacity, uint8_t* requested_begin);
326 size_t capacity = 16 * MB; local
327 MallocSpace* space(create_space("test", initial_size, growth_limit, capacity, nullptr));
332 EXPECT_EQ(space->NonGrowthLimitCapacity(), capacity);
343 EXPECT_EQ(space->Capacity(), capacity);
344 SizeFootPrintGrowthLimitAndTrimBody(space, object_size, 3, capacity);
H A Ddlmalloc_space.h39 size_t growth_limit, size_t capacity,
47 size_t capacity, uint8_t* requested_begin, bool can_move_objects);
H A Dlarge_object_space_test.cc41 const size_t capacity = 128 * MB; local
45 los = space::FreeListSpace::Create("large object space", nullptr, capacity);
51 CHECK_LE(static_cast<uintptr_t>(los->GetLiveBitmap()->HeapBegin() + capacity),
H A Dregion_space.cc36 MemMap* RegionSpace::CreateMemMap(const std::string& name, size_t capacity, argument
38 CHECK_ALIGNED(capacity, kRegionSize);
40 // Ask for the capacity of an additional kRegionSize so that we can align the map by kRegionSize
46 capacity + kRegionSize,
59 << PrettySize(capacity) << " with message " << error_msg;
63 CHECK_EQ(mem_map->Size(), capacity + kRegionSize);
69 mem_map->SetSize(capacity);
76 CHECK_EQ(mem_map->Size(), capacity);
H A Drosalloc_space.h42 size_t capacity, uint8_t* requested_begin, bool low_memory_mode,
46 size_t growth_limit, size_t capacity,
H A Dspace_create_test.cc37 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 Dmalloc_space.h92 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the
98 // Override capacity so that we only return the possibly limited capacity
108 // Change the non growth limit capacity by shrinking or expanding the map. Currently, only
145 size_t* growth_limit, size_t* capacity, uint8_t* requested_begin);
171 // The capacity of the alloc space until such time that ClearGrowthLimit is called.
173 // limit is a value <= to the mem_map_ capacity used for ergonomic reasons because of the zygote.
175 // will be set to a lower value. The growth_limit_ is used as the capacity of the alloc_space_,
176 // however, capacity normally can't vary. In the case of the growth_limit_ it can be cleared
/art/openjdkjvmti/
H A Djvmti_weak_table-inl.h256 capacity(reserve) {
261 allocator.deallocate(data, capacity);
262 capacity = 0;
272 capacity = 0;
278 CHECK_GT(new_capacity, capacity);
287 allocator.deallocate(old, capacity);
288 capacity = new_capacity;
292 if (size == capacity) {
293 size_t new_capacity = 2 * capacity + 1;
302 size_t capacity; member in struct:openjdkjvmti::JvmtiWeakTable::ReleasableContainer
[all...]
/art/runtime/gc/accounting/
H A Dcard_table.cc64 size_t capacity = heap_capacity / kCardSize; local
68 MemMap::MapAnonymous("card table", nullptr, capacity + 256, PROT_READ | PROT_WRITE,
H A Dread_barrier_table.h38 size_t capacity = static_cast<size_t>(kHeapCapacity / kRegionSize); local
42 MemMap* mem_map = MemMap::MapAnonymous("read barrier table", nullptr, capacity,
H A Datomic_stack.h66 static AtomicStack* Create(const std::string& name, size_t growth_limit, size_t capacity) { argument
67 std::unique_ptr<AtomicStack> mark_stack(new AtomicStack(name, growth_limit, capacity));
221 AtomicStack(const std::string& name, size_t growth_limit, size_t capacity) argument
227 capacity_(capacity),
H A Dspace_bitmap.cc35 size_t SpaceBitmap<kAlignment>::ComputeBitmapSize(uint64_t capacity) { argument
41 // having a size of `capacity` bytes.
42 return (RoundUp(capacity, kBytesCoveredPerWord) / kBytesCoveredPerWord) * sizeof(intptr_t);
104 // Not sure if doing this trim is necessary, since nothing past the end of the heap capacity
/art/compiler/utils/
H A Dassembler.h193 // Make sure that extending the capacity leaves a big enough gap
196 // Mark the buffer as having ensured the capacity.
233 // capacity needed for emitting, we add a dummy method in non-debug mode.
246 // Unconditionally increase the capacity.
275 // Compute the limit based on the data area and the capacity. See
277 static uint8_t* ComputeLimit(uint8_t* data, size_t capacity) { argument
278 return data + capacity - kMinimumGap;
340 void ReserveCFIStream(size_t capacity) { argument
341 opcodes_.reserve(capacity);
/art/runtime/
H A Dindirect_reference_table.h188 IrtIterator(IrtEntry* table, size_t i, size_t capacity) REQUIRES_SHARED(Locks::mutator_lock_)
189 : table_(table), i_(i), capacity_(capacity) {
417 // Whether the table's capacity may be resized. As there are no locks used, it is the caller's
H A Djni_env_ext.cc132 void JNIEnvExt::PushFrame(int capacity) { argument
133 DCHECK_GE(locals_.FreeCapacity(), static_cast<size_t>(capacity));
/art/compiler/
H A Dexception_test.cc101 CHECK_GE(fake_header_code_and_maps_.capacity(), fake_header_code_and_maps_.size() + padding);

Completed in 177 milliseconds

12