Searched defs:capacity (Results 1 - 22 of 22) sorted by relevance

/art/runtime/gc/space/
H A Ddlmalloc_space_base_test.cc27 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 Ddlmalloc_space_random_test.cc26 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 Ddlmalloc_space_static_test.cc26 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 Drosalloc_space_base_test.cc24 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 Drosalloc_space_random_test.cc24 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 Drosalloc_space_static_test.cc24 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 Dspace.cc75 const size_t capacity = static_cast<size_t>(std::numeric_limits<uint32_t>::max()); local
77 capacity));
80 capacity));
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,
35 << PrettySize(capacity) << " with message " << error_msg;
H A Dmalloc_space.cc69 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 Ddlmalloc_space.cc50 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 Drosalloc_space.cc56 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 Dspace_test.h113 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 Dcard_table.cc60 size_t capacity = heap_capacity / kCardSize; local
64 MemMap::MapAnonymous("card table", nullptr, capacity + 256, PROT_READ | PROT_WRITE,
H A Datomic_stack.h38 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 Dspace_bitmap.cc31 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
/art/compiler/utils/
H A Dassembler.cc33 static byte* NewContents(size_t capacity) { argument
34 return new byte[capacity];
H A Dassembler.h267 // 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/base/
H A Dstringpiece.h146 int capacity() const { return length_; } function in class:art::StringPiece
/art/runtime/
H A Dcheck_jni.cc1206 static jint PushLocalFrame(JNIEnv* env, jint capacity) { argument
1207 CHECK_JNI_ENTRY(kFlag_Default | kFlag_ExcepOkay, "EI", env, capacity);
1208 return CHECK_JNI_EXIT("I", baseEnv(env)->PushLocalFrame(env, capacity));
1259 static jint EnsureLocalCapacity(JNIEnv *env, jint capacity) { argument
1260 CHECK_JNI_ENTRY(kFlag_Default, "EI", env, capacity);
1261 return CHECK_JNI_EXIT("I", baseEnv(env)->EnsureLocalCapacity(env, capacity));
1758 static jobject NewDirectByteBuffer(JNIEnv* env, void* address, jlong capacity) { argument
1759 CHECK_JNI_ENTRY(kFlag_Default, "EpJ", env, address, capacity);
1764 return CHECK_JNI_EXIT("L", baseEnv(env)->NewDirectByteBuffer(env, address, capacity));
H A Djni_internal.cc772 static jint PushLocalFrame(JNIEnv* env, jint capacity) { argument
775 if (EnsureLocalCapacity(soa, capacity, "PushLocalFrame") != JNI_OK) {
778 static_cast<JNIEnvExt*>(env)->PushFrame(capacity);
2494 static jobject NewDirectByteBuffer(JNIEnv* env, void* address, jlong capacity) { argument
2495 if (capacity < 0) {
2496 JniAbortF("NewDirectByteBuffer", "negative buffer capacity: %" PRId64, capacity);
2499 if (address == nullptr && capacity != 0) {
2500 JniAbortF("NewDirectByteBuffer", "non-zero capacity for nullptr pointer: %" PRId64, capacity);
2570 const size_t capacity = soa.Env()->locals.Capacity(); local
[all...]
/art/runtime/gc/allocator/
H A Drosalloc.cc50 RosAlloc::RosAlloc(void* base, size_t capacity, size_t max_capacity, argument
52 : base_(reinterpret_cast<byte*>(base)), footprint_(capacity),
53 capacity_(capacity), max_capacity_(max_capacity),
58 DCHECK_EQ(RoundUp(capacity, kPageSize), capacity); local
60 CHECK_LE(capacity, max_capacity);
68 << ", capacity=" << std::dec << capacity_
1645 VLOG(heap) << "new capacity=" << capacity_;
/art/runtime/gc/
H A Dheap.cc118 size_t capacity, size_t non_moving_space_capacity, const std::string& image_file_name,
152 capacity_(capacity),
368 // Compute heap capacity. Continuous spaces are sorted in order of Begin().
453 MemMap* Heap::MapAnonymousPreferredAddress(const char* name, byte* request_begin, size_t capacity, argument
456 MemMap* map = MemMap::MapAnonymous(kMemMapSpaceName[0], request_begin, capacity,
468 size_t growth_limit, size_t capacity,
474 initial_size, growth_limit, capacity,
478 initial_size, growth_limit, capacity,
493 size_t capacity) {
511 main_space_ = CreateMallocSpaceFromMemMap(mem_map, initial_size, growth_limit, capacity, nam
116 Heap(size_t initial_size, size_t growth_limit, size_t min_free, size_t max_free, double target_utilization, double foreground_heap_growth_multiplier, size_t capacity, size_t non_moving_space_capacity, const std::string& image_file_name, const InstructionSet image_instruction_set, CollectorType foreground_collector_type, CollectorType background_collector_type, size_t parallel_gc_threads, size_t conc_gc_threads, bool low_memory_mode, size_t long_pause_log_threshold, size_t long_gc_log_threshold, bool ignore_max_footprint, bool use_tlab, bool verify_pre_gc_heap, bool verify_pre_sweeping_heap, bool verify_post_gc_heap, bool verify_pre_gc_rosalloc, bool verify_pre_sweeping_rosalloc, bool verify_post_gc_rosalloc, bool use_homogeneous_space_compaction_for_oom, uint64_t min_interval_homogeneous_space_compaction_by_oom) argument
467 CreateMallocSpaceFromMemMap(MemMap* mem_map, size_t initial_size, size_t growth_limit, size_t capacity, const char* name, bool can_move_objects) argument
492 CreateMainMallocSpace(MemMap* mem_map, size_t initial_size, size_t growth_limit, size_t capacity) argument
[all...]

Completed in 309 milliseconds