| /art/compiler/utils/ |
| assembler.cc | 79 size_t new_capacity = std::min(old_capacity * 2, old_capacity + 1 * MB); local
80 new_capacity = std::max(new_capacity, min_capacity);
84 arena_->Realloc(contents_, old_capacity, new_capacity, kArenaAllocAssembler));
88 limit_ = ComputeLimit(contents_, new_capacity);
91 CHECK_EQ(Capacity(), new_capacity); local
|
| /prebuilts/ndk/r11/sources/android/support/tests/minitest/ |
| minitest.cc | 107 size_t new_capacity = capacity_; local
108 while (new_capacity < new_size)
109 new_capacity += (new_capacity >> 1) + 8;
111 Reserve(new_capacity);
117 void String::Reserve(size_t new_capacity) {
118 str_ = reinterpret_cast<char*>(::realloc(str_, new_capacity + 1));
119 if (new_capacity > capacity_)
120 ::memset(str_ + capacity_, '\0', new_capacity - capacity_);
121 capacity_ = new_capacity;
[all...] |
| /prebuilts/ndk/r13/sources/android/support/tests/minitest/ |
| minitest.cc | 107 size_t new_capacity = capacity_; local
108 while (new_capacity < new_size)
109 new_capacity += (new_capacity >> 1) + 8;
111 Reserve(new_capacity);
117 void String::Reserve(size_t new_capacity) {
118 str_ = reinterpret_cast<char*>(::realloc(str_, new_capacity + 1));
119 if (new_capacity > capacity_)
120 ::memset(str_ + capacity_, '\0', new_capacity - capacity_);
121 capacity_ = new_capacity;
[all...] |
| /external/v8/src/ |
| collector.h | 135 int new_capacity; local
139 new_capacity = min_capacity * growth_factor;
140 if (new_capacity < kMinCapacity) new_capacity = kMinCapacity;
146 new_capacity = current_length + growth;
147 if (new_capacity < min_capacity) {
148 new_capacity = min_capacity + growth;
151 NewChunk(new_capacity);
159 virtual void NewChunk(int new_capacity) {
160 Vector<T> new_chunk = Vector<T>::New(new_capacity);
[all...] |
| layout-descriptor.cc | 83 int new_capacity = field_index + details.field_width_in_words(); local
84 if (new_capacity > layout_descriptor->capacity()) {
100 int new_capacity) {
102 if (new_capacity <= old_capacity) {
106 LayoutDescriptor::New(isolate, new_capacity);
|
| list-inl.h | 60 int new_capacity = 1 + 2 * capacity_; local
64 Resize(new_capacity, alloc);
70 void List<T, P>::Resize(int new_capacity, P alloc) {
71 DCHECK_LE(length_, new_capacity);
72 T* new_data = NewData(new_capacity, alloc);
76 capacity_ = new_capacity;
|
| identity-map.cc | 255 void IdentityMapBase::Resize(int new_capacity) {
258 DCHECK_GT(new_capacity, size_);
263 capacity_ = new_capacity;
|
| layout-descriptor.h | 122 int new_capacity);
|
| transitions.cc | 270 Handle<FixedArray> array, int new_capacity, Isolate* isolate) {
273 new_capacity = Min(kMaxCachedPrototypeTransitions, new_capacity);
274 DCHECK_GT(new_capacity, capacity);
275 int grow_by = new_capacity - capacity;
|
| /system/nvram/messages/include/nvram/messages/ |
| vector.h | 92 size_t new_capacity = capacity_;
94 new_capacity = size;
96 new_capacity = capacity_ * 2 > size ? capacity_ * 2 : size;
98 NVRAM_CHECK(new_capacity >= size);
102 if (new_capacity != capacity_) {
103 if (new_capacity == 0) {
107 calloc(new_capacity, sizeof(ElementType)));
138 capacity_ = new_capacity;
|
| /external/valgrind/drd/ |
| drd_vc.c | 36 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity);
314 void DRD_(vc_reserve)(VectorClock* const vc, const unsigned new_capacity)
321 if (new_capacity > vc->capacity)
329 vc->vc, new_capacity * sizeof(vc->vc[0]));
331 else if (vc->vc && new_capacity > VC_PREALLOCATED)
334 && new_capacity > VC_PREALLOCATED
337 new_capacity * sizeof(vc->vc[0]));
344 && new_capacity <= VC_PREALLOCATED
347 else if (new_capacity > VC_PREALLOCATED)
350 && new_capacity > VC_PREALLOCATE
[all...] |
| /external/swiftshader/third_party/subzero/src/ |
| IceAssembler.cpp | 117 intptr_t new_capacity = std::min(old_capacity * 2, old_capacity + OneMB); local
118 if (new_capacity < old_capacity) {
124 uintptr_t new_contents = NewContents(Assemblr, new_capacity);
134 Limit = computeLimit(new_contents, new_capacity);
137 assert(capacity() == new_capacity);
|
| /external/vixl/src/ |
| code-buffer-vixl.cc | 161 void CodeBuffer::Grow(size_t new_capacity) {
163 VIXL_ASSERT(new_capacity > capacity_);
166 buffer_ = static_cast<byte*>(realloc(buffer_, new_capacity));
176 mremap(buffer_, capacity_, new_capacity, MREMAP_MAYMOVE));
184 capacity_ = new_capacity;
|
| /bionic/libc/bionic/ |
| scandir.cpp | 54 size_t new_capacity = capacity_ + 32; local
56 reinterpret_cast<dirent**>(realloc(names_, new_capacity * sizeof(dirent*)));
61 capacity_ = new_capacity;
|
| /system/bt/osi/src/ |
| array.cc | 97 const size_t new_capacity = array->capacity + (array->capacity / 2); local
101 new_capacity * array->element_size);
109 array->capacity = new_capacity;
|
| /system/core/libutils/ |
| VectorImpl.cpp | 336 ssize_t VectorImpl::setCapacity(size_t new_capacity)
340 if (new_capacity <= size()) {
345 LOG_ALWAYS_FATAL_IF(!safe_mul(&new_allocation_size, new_capacity, mItemSize));
355 return new_capacity;
399 size_t new_capacity = 0;
400 LOG_ALWAYS_FATAL_IF(!safe_add(&new_capacity, new_size, (new_size / 2)),
401 "new_capacity overflow");
402 LOG_ALWAYS_FATAL_IF(!safe_add(&new_capacity, new_capacity, static_cast<size_t>(1u)),
403 "new_capacity overflow")
[all...] |
| /art/runtime/gc/space/ |
| malloc_space.cc | 256 size_t new_capacity = Capacity(); local
257 CHECK_LE(new_capacity, NonGrowthLimitCapacity());
258 GetLiveBitmap()->SetHeapSize(new_capacity);
259 GetMarkBitmap()->SetHeapSize(new_capacity);
262 temp_bitmap_->SetHeapSize(new_capacity);
264 GetMemMap()->SetSize(new_capacity);
265 limit_ = Begin() + new_capacity;
|
| /external/libtextclassifier/util/utf8/ |
| unicodetext.cc | 52 void UnicodeText::Repr::reserve(int new_capacity) {
54 if (capacity_ >= new_capacity && ours_) return;
57 capacity_ = std::max(new_capacity, (3 * capacity_) / 2 + 20);
|
| /external/protobuf/src/google/protobuf/stubs/ |
| bytestream.cc | 122 size_t new_capacity = std::max(capacity_ + amount, (3 * capacity_) / 2); local
123 char* bigger = new char[new_capacity];
127 capacity_ = new_capacity;
|
| /external/libchrome/base/ |
| pickle.cc | 380 void Pickle::Resize(size_t new_capacity) {
382 capacity_after_header_ = bits::Align(new_capacity, kPayloadUnit);
461 size_t new_capacity = capacity_after_header_ * 2; local
463 if (new_capacity > kPickleHeapAlign)
464 new_capacity = bits::Align(new_capacity, kPickleHeapAlign) - kPayloadUnit;
465 Resize(std::max(new_capacity, new_size));
|
| /external/v8/src/crankshaft/ |
| unique.h | 347 int new_capacity = 2 * capacity_ + size;
348 if (new_capacity > kMaxCapacity) new_capacity = kMaxCapacity;
349 Unique<T>* new_array = zone->NewArray<Unique<T> >(new_capacity);
353 capacity_ = new_capacity;
|
| /art/runtime/openjdkjvmti/ |
| jvmti_weak_table-inl.h | 276 void Resize(size_t new_capacity) {
277 CHECK_GT(new_capacity, capacity);
279 Storage* tmp = allocator.allocate(new_capacity);
287 capacity = new_capacity;
292 size_t new_capacity = 2 * capacity + 1; local
293 Resize(new_capacity);
|
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 188 void Resize(size_t new_capacity) {
189 capacity_ = new_capacity;
190 growth_limit_ = new_capacity;
|
| /external/flac/libFLAC/ |
| bitwriter.c | 87 unsigned new_capacity; local
94 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD);
99 if(bw->capacity >= new_capacity)
103 if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT)
104 new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
106 FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
107 FLAC__ASSERT(new_capacity > bw->capacity);
108 FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD));
110 new_buffer = safe_realloc_mul_2op_(bw->buffer, sizeof(uint32_t), /*times*/new_capacity);
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_common.h | 519 uptr new_capacity = RoundUpToPowerOfTwo(size_ + 1);
520 Resize(new_capacity);
562 void Resize(uptr new_capacity) {
563 CHECK_GT(new_capacity, 0);
564 CHECK_LE(size_, new_capacity);
565 T *new_data = (T *)MmapOrDie(new_capacity * sizeof(T),
571 capacity_ = new_capacity;
|
