| /art/runtime/ |
| H A D | jni_internal-inl.h | 33 size_t entry_count = locals.Capacity();
|
| H A D | indirect_reference_table_test.cc | 92 EXPECT_EQ(0U, irt.Capacity());
114 ASSERT_EQ(0U, irt.Capacity());
126 ASSERT_EQ(3U, irt.Capacity());
142 ASSERT_EQ(0U, irt.Capacity());
163 ASSERT_EQ(4U, irt.Capacity()) << "hole not filled";
171 ASSERT_EQ(3U, irt.Capacity()) << "should be 3 after two deletions";
178 ASSERT_EQ(0U, irt.Capacity()) << "not empty after split remove";
194 ASSERT_EQ(0U, irt.Capacity()) << "switching del not empty";
212 ASSERT_EQ(0U, irt.Capacity()) << "temporal del not empty";
237 ASSERT_EQ(kTableInitial + 1, irt.Capacity());
[all...] |
| H A D | indirect_reference_table.h | 322 size_t Capacity() const { function in class:art::IndirectReferenceTable
328 return IrtIterator(table_, 0, Capacity());
332 return IrtIterator(table_, Capacity(), Capacity());
|
| H A D | indirect_reference_table.cc | 236 const size_t top_index = Capacity();
253 for (size_t i = 0; i < Capacity(); ++i) {
|
| H A D | jni_internal.cc | 2570 const size_t capacity = soa.Env()->locals.Capacity();
3177 os << "; globals=" << globals.Capacity();
3181 if (weak_globals_.Capacity() > 0) {
3182 os << " (plus " << weak_globals_.Capacity() << " weak)";
|
| /art/compiler/utils/ |
| H A D | assembler.cc | 51 CHECK_EQ(Capacity(), kInitialBufferCapacity);
84 size_t old_capacity = Capacity();
102 CHECK_EQ(Capacity(), new_capacity);
|
| H A D | assembler.h | 288 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); }
332 size_t Capacity() const { function in class:art::AssemblerBuffer
|
| /art/runtime/gc/space/ |
| H A D | malloc_space.cc | 139 CHECK_LE(new_end, Begin() + Capacity());
176 const size_t capacity = Capacity() - size;
181 << "Capacity " << Capacity();
188 VLOG(heap) << "Capacity " << PrettySize(capacity);
225 << ",size=" << PrettySize(Size()) << ",capacity=" << PrettySize(Capacity())
|
| H A D | bump_pointer_space.h | 84 size_t Capacity() const { function in class:art::gc::space::FINAL
|
| H A D | malloc_space.h | 93 // MoreCore. Note this is used to stop the mspace growing beyond the limit to Capacity. When
104 size_t Capacity() const { function in class:art::gc::space::MallocSpace
|
| H A D | space.h | 282 virtual size_t Capacity() const { function in class:art::gc::space::ContinuousSpace
353 // Size of the space without a limit on its growth. By default this is just the Capacity, but
356 return Capacity();
|
| H A D | dlmalloc_space.cc | 134 size_t max_allowed = Capacity();
|
| H A D | rosalloc_space.cc | 152 size_t max_allowed = Capacity();
|
| H A D | space_test.h | 554 EXPECT_EQ(space->Capacity(), growth_limit);
566 EXPECT_EQ(space->Capacity(), capacity);
|
| /art/runtime/gc/accounting/ |
| H A D | atomic_stack.h | 37 // Capacity is how many elements we can store in the stack.
151 size_t Capacity() const { function in class:art::gc::accounting::AtomicStack
|
| /art/runtime/gc/collector/ |
| H A D | mark_compact.cc | 286 if (UNLIKELY(mark_stack_->Size() >= mark_stack_->Capacity())) {
287 ResizeMarkStack(mark_stack_->Capacity() * 2);
|
| H A D | mark_sweep.cc | 321 ResizeMarkStack(mark_stack_->Capacity() * 2);
326 if (UNLIKELY(mark_stack_->Size() < mark_stack_->Capacity())) {
342 if (UNLIKELY(mark_stack_->Size() >= mark_stack_->Capacity())) {
421 if (UNLIKELY(mark_stack_->Size() >= mark_stack_->Capacity())) {
|
| H A D | semi_space.cc | 423 if (UNLIKELY(mark_stack_->Size() >= mark_stack_->Capacity())) {
424 ResizeMarkStack(mark_stack_->Capacity() * 2);
|
| /art/runtime/gc/ |
| H A D | heap.cc | 310 non_moving_space_->SetFootprintLimit(non_moving_space_->Capacity());
488 malloc_space->SetFootprintLimit(malloc_space->Capacity());
619 mprotect(space->Begin(), space->Capacity(), PROT_READ | PROT_WRITE);
2000 madvise(main_space_->Begin(), main_space_->Capacity(), MADV_DONTNEED);
2052 non_moving_space_->SetFootprintLimit(non_moving_space_->Capacity());
3006 malloc_space->SetFootprintLimit(malloc_space->Capacity());
3012 main_space_backup_->SetFootprintLimit(main_space_backup_->Capacity());
|