| /art/libartbase/base/ |
| D | arena_allocator_test.cc | 161 const size_t new_size = ArenaAllocator::kAlignment * 3; in TEST_F() local
162 void* realloc_allocation = allocator.Realloc(original_allocation, original_size, new_size); in TEST_F()
174 const size_t new_size = ArenaAllocator::kAlignment * 2 + (ArenaAllocator::kAlignment / 2); in TEST_F() local
175 void* realloc_allocation = allocator.Realloc(original_allocation, original_size, new_size); in TEST_F()
187 const size_t new_size = ArenaAllocator::kAlignment * 4; in TEST_F() local
188 void* realloc_allocation = allocator.Realloc(original_allocation, original_size, new_size); in TEST_F()
200 const size_t new_size = ArenaAllocator::kAlignment * 3; in TEST_F() local
201 void* realloc_allocation = allocator.Realloc(original_allocation, original_size, new_size); in TEST_F()
217 const size_t new_size = arena_allocator::kArenaDefaultSize + ArenaAllocator::kAlignment * 2; in TEST_F() local
218 void* realloc_allocation = allocator.Realloc(original_allocation, original_size, new_size); in TEST_F()
[all …]
|
| D | bit_vector.cc | 353 uint32_t new_size = BitsToWords(idx + 1); in EnsureSize() local
354 DCHECK_GT(new_size, storage_size_); in EnsureSize()
356 static_cast<uint32_t*>(allocator_->Alloc(new_size * kWordBytes)); in EnsureSize()
359 memset(&new_storage[storage_size_], 0, (new_size - storage_size_) * kWordBytes); in EnsureSize()
367 storage_size_ = new_size; in EnsureSize()
|
| D | arena_allocator.h | 306 size_t new_size,
308 DCHECK_GE(new_size, ptr_size);
317 const size_t aligned_new_size = RoundUp(new_size, kAlignment);
328 auto* new_ptr = Alloc(new_size, kind); // Note: Alloc will take care of aligning new_size.
|
| D | mem_map.cc | 728 size_t new_size = new_end - reinterpret_cast<uint8_t*>(begin_); in RemapAtEnd() local
730 DCHECK_LE(begin_ + new_size, reinterpret_cast<uint8_t*>(base_begin_) + new_base_size); in RemapAtEnd()
765 size_ = new_size; in RemapAtEnd()
999 void MemMap::SetSize(size_t new_size) { in SetSize() argument
1000 CHECK_LE(new_size, size_); in SetSize()
1001 size_t new_base_size = RoundUp(new_size + static_cast<size_t>(PointerDiff(Begin(), BaseBegin())), in SetSize()
1004 size_ = new_size; in SetSize()
1017 size_ = new_size; in SetSize()
|
| D | hash_set.h | 669 void Resize(size_t new_size) { in Resize() argument
670 if (new_size < kMinBuckets) { in Resize()
671 new_size = kMinBuckets; in Resize()
673 DCHECK_GE(new_size, size()); in Resize()
678 AllocateStorage(new_size); in Resize()
|
| D | mem_map.h | 249 void SetSize(size_t new_size);
|
| /art/test/1959-redefine-object-instrument/ |
| D | fake_redef_object.cc | 84 size_t new_size; in RedefineObjectHook() local
85 *new_class_data = writer.CreateImage(&allocator, &new_size); in RedefineObjectHook()
86 if (new_size > std::numeric_limits<jint>::max()) { in RedefineObjectHook()
92 *new_class_data_len = static_cast<jint>(new_size); in RedefineObjectHook()
|
| /art/test/980-redefine-object/ |
| D | redef_object.cc | 97 size_t new_size; in RedefineObjectHook() local
98 *new_class_data = writer.CreateImage(&allocator, &new_size); in RedefineObjectHook()
99 if (new_size > std::numeric_limits<jint>::max()) { in RedefineObjectHook()
105 *new_class_data_len = static_cast<jint>(new_size); in RedefineObjectHook()
|
| /art/runtime/ |
| D | linear_alloc.cc | 26 void* LinearAlloc::Realloc(Thread* self, void* ptr, size_t old_size, size_t new_size) { in Realloc() argument
28 return allocator_.Realloc(ptr, old_size, new_size); in Realloc()
|
| D | indirect_reference_table.cc | 213 bool IndirectReferenceTable::Resize(size_t new_size, std::string* error_msg) { in Resize() argument
214 CHECK_GT(new_size, max_entries_); in Resize()
217 if (new_size > kMaxEntries) { in Resize()
218 *error_msg = android::base::StringPrintf("Requested size exceeds maximum: %zu", new_size); in Resize()
223 const size_t table_bytes = new_size * sizeof(IrtEntry); in Resize()
236 max_entries_ = new_size; in Resize()
|
| D | linear_alloc.h | 36 void* Realloc(Thread* self, void* ptr, size_t old_size, size_t new_size) REQUIRES(!lock_);
|
| D | indirect_reference_table.h | 385 bool Resize(size_t new_size, std::string* error_msg);
|
| /art/runtime/gc/space/ |
| D | dlmalloc_space.cc | 310 void DlMallocSpace::SetFootprintLimit(size_t new_size) { in SetFootprintLimit() argument
312 VLOG(heap) << "DlMallocSpace::SetFootprintLimit " << PrettySize(new_size); in SetFootprintLimit()
316 if (new_size < current_space_size) { in SetFootprintLimit()
318 new_size = current_space_size; in SetFootprintLimit()
320 mspace_set_footprint_limit(mspace_, new_size); in SetFootprintLimit()
|
| D | rosalloc_space.cc | 345 void RosAllocSpace::SetFootprintLimit(size_t new_size) { in SetFootprintLimit() argument
347 VLOG(heap) << "RosAllocSpace::SetFootprintLimit " << PrettySize(new_size); in SetFootprintLimit()
351 if (new_size < current_space_size) { in SetFootprintLimit()
353 new_size = current_space_size; in SetFootprintLimit()
355 rosalloc_->SetFootprintLimit(new_size); in SetFootprintLimit()
|
| /art/compiler/utils/ |
| D | assembler.h | 117 void Resize(size_t new_size) { in Resize() argument
118 if (new_size > Capacity()) { in Resize()
119 ExtendCapacity(new_size); in Resize()
121 cursor_ = contents_ + new_size; in Resize()
|
| /art/runtime/gc/accounting/ |
| D | space_bitmap.cc | 102 size_t new_size = OffsetToIndex(new_end - heap_begin_) * sizeof(intptr_t); in SetHeapLimit() local
103 if (new_size < bitmap_size_) { in SetHeapLimit()
104 bitmap_size_ = new_size; in SetHeapLimit()
|
| /art/tools/jvmti-agents/simple-force-redefine/ |
| D | forceredefine.cc | 163 size_t new_size; in CbClassFileLoadHook() local
164 *newClassData = writer.CreateImage(&allocator, &new_size); in CbClassFileLoadHook()
165 *newClassDataLen = new_size; in CbClassFileLoadHook()
|
| /art/runtime/gc/collector/ |
| D | semi_space.cc | 448 void SemiSpace::ResizeMarkStack(size_t new_size) { in ResizeMarkStack() argument
450 CHECK_LE(mark_stack_->Size(), new_size); in ResizeMarkStack()
451 mark_stack_->Resize(new_size); in ResizeMarkStack()
|
| D | semi_space.h | 182 void ResizeMarkStack(size_t new_size) REQUIRES_SHARED(Locks::mutator_lock_);
|
| D | mark_sweep.h | 262 void ResizeMarkStack(size_t new_size)
|
| D | mark_sweep.cc | 387 void MarkSweep::ResizeMarkStack(size_t new_size) { in ResizeMarkStack() argument
394 CHECK_LE(mark_stack_->Size(), new_size); in ResizeMarkStack()
395 mark_stack_->Resize(new_size); in ResizeMarkStack()
|
| /art/tools/hiddenapi/ |
| D | hiddenapi.cc | 679 size_t new_size = old_dex_.Size() + size_delta; in Encode() local
680 AllocateMemory(new_size); in Encode()
701 CHECK_EQ(offset_, new_size); in Encode()
|
| /art/compiler/optimizing/ |
| D | bounds_check_elimination.cc | 1964 size_t new_size = graph_->GetReversePostOrder().size(); in Run() local
1965 DCHECK_GE(new_size, size); in Run()
1966 i += new_size - size; in Run()
1968 size = new_size; in Run()
|
| /art/compiler/utils/mips64/ |
| D | assembler_mips64.cc | 2759 uint32_t new_size = GetSize(); in PromoteIfNeeded() local
2760 CHECK_GT(new_size, old_size); in PromoteIfNeeded()
2761 return new_size - old_size; in PromoteIfNeeded()
2771 uint32_t new_size = GetSize(); in PromoteIfNeeded() local
2772 CHECK_GT(new_size, old_size); in PromoteIfNeeded()
2773 return new_size - old_size; in PromoteIfNeeded()
|
| /art/compiler/utils/mips/ |
| D | assembler_mips.cc | 3443 uint32_t new_size = GetSize(); in PromoteIfNeeded() local
3444 CHECK_GT(new_size, old_size); in PromoteIfNeeded()
3445 return new_size - old_size; in PromoteIfNeeded()
3455 uint32_t new_size = GetSize(); in PromoteIfNeeded() local
3456 CHECK_GT(new_size, old_size); in PromoteIfNeeded()
3457 return new_size - old_size; in PromoteIfNeeded()
|