| /external/v8/src/ |
| D | collector.h | 135 int new_capacity; in Grow() local
139 new_capacity = min_capacity * growth_factor; in Grow()
140 if (new_capacity < kMinCapacity) new_capacity = kMinCapacity; in Grow()
146 new_capacity = current_length + growth; in Grow()
147 if (new_capacity < min_capacity) { in Grow()
148 new_capacity = min_capacity + growth; in Grow()
151 NewChunk(new_capacity); in Grow()
159 virtual void NewChunk(int new_capacity) { in NewChunk() argument
160 Vector<T> new_chunk = Vector<T>::New(new_capacity); in NewChunk()
221 virtual void NewChunk(int new_capacity) { in NewChunk() argument
[all …]
|
| D | layout-descriptor.cc | 78 int new_capacity = field_index + details.field_width_in_words(); in AppendIfFastOrUseFull() local
79 if (new_capacity > layout_descriptor->capacity()) { in AppendIfFastOrUseFull()
95 int new_capacity) { in EnsureCapacity() argument
97 if (new_capacity <= old_capacity) { in EnsureCapacity()
101 LayoutDescriptor::New(isolate, new_capacity); in EnsureCapacity()
|
| D | identity-map.cc | 259 void IdentityMapBase::Resize(int new_capacity) { in Resize() argument
262 DCHECK_GT(new_capacity, size_); in Resize()
267 capacity_ = new_capacity; in Resize()
|
| D | string-stream.cc | 45 unsigned new_capacity = capacity_; in Put() local
46 char* new_buffer = allocator_->grow(&new_capacity); in Put()
47 if (new_capacity > capacity_) { in Put()
48 capacity_ = new_capacity; in Put()
|
| D | transitions.cc | 345 Handle<WeakFixedArray> array, int new_capacity, Isolate* isolate) { in GrowPrototypeTransitionArray() argument
348 new_capacity = Min(kMaxCachedPrototypeTransitions, new_capacity); in GrowPrototypeTransitionArray()
349 DCHECK_GT(new_capacity, capacity); in GrowPrototypeTransitionArray()
350 int grow_by = new_capacity - capacity; in GrowPrototypeTransitionArray()
|
| /external/perfetto/include/perfetto/base/ |
| D | circular_queue.h | 245 void Grow(size_t new_capacity = 0) {
248 new_capacity = new_capacity ? new_capacity : capacity_ * 2;
249 PERFETTO_CHECK((new_capacity & (new_capacity - 1)) == 0); // Must be pow2.
253 PERFETTO_CHECK(new_capacity > capacity_);
254 size_t malloc_size = new_capacity * sizeof(T);
255 PERFETTO_CHECK(malloc_size > new_capacity);
271 capacity_ = new_capacity;
|
| D | container_annotations.h | 45 new_capacity) \ argument
47 ANNOTATE_NEW_BUFFER(buffer, new_capacity, buffer_size);
54 new_capacity) argument
|
| /external/v8/src/builtins/ |
| D | growable-fixed-array-gen.cc | 76 TNode<IntPtrT> const new_capacity = in NewCapacity() local
80 return new_capacity; in NewCapacity()
84 TNode<IntPtrT> const element_count, TNode<IntPtrT> const new_capacity) { in ResizeFixedArray() argument
86 CSA_ASSERT(this, IntPtrGreaterThanOrEqual(new_capacity, IntPtrConstant(0))); in ResizeFixedArray()
87 CSA_ASSERT(this, IntPtrGreaterThanOrEqual(new_capacity, element_count)); in ResizeFixedArray()
94 from_array, nullptr, element_count, new_capacity, flags)); in ResizeFixedArray()
|
| D | growable-fixed-array-gen.h | 45 TNode<IntPtrT> const new_capacity);
|
| /external/mesa3d/src/util/ |
| D | string_buffer.c | 34 uint32_t new_capacity = str->capacity * 2; in ensure_capacity() local
35 while (needed_capacity > new_capacity) in ensure_capacity()
36 new_capacity *= 2; in ensure_capacity()
38 str->buf = reralloc_array_size(str, str->buf, sizeof(char), new_capacity); in ensure_capacity()
42 str->capacity = new_capacity; in ensure_capacity()
|
| /external/libchrome/base/task/sequence_manager/ |
| D | lazily_deallocated_deque.h | 169 size_t new_capacity = max_size_ + 1; in MaybeShrinkQueue() local
170 if (new_capacity < kMinimumRingSize) in MaybeShrinkQueue()
171 new_capacity = kMinimumRingSize; in MaybeShrinkQueue()
179 if (new_capacity + kReclaimThreshold >= capacity()) in MaybeShrinkQueue()
182 SetCapacity(new_capacity); in MaybeShrinkQueue()
187 void SetCapacity(size_t new_capacity) { in SetCapacity() argument
188 std::unique_ptr<Ring> new_ring = std::make_unique<Ring>(new_capacity); in SetCapacity()
190 DCHECK_GE(new_capacity, size_ + 1); in SetCapacity()
|
| /external/vixl/src/ |
| D | code-buffer-vixl.cc | 164 void CodeBuffer::Grow(size_t new_capacity) { in Grow() argument
166 VIXL_ASSERT(new_capacity > capacity_); in Grow()
169 buffer_ = static_cast<byte*>(realloc(buffer_, new_capacity)); in Grow()
179 mremap(buffer_, capacity_, new_capacity, MREMAP_MAYMOVE)); in Grow()
187 capacity_ = new_capacity; in Grow()
|
| /external/v8/src/zone/ |
| D | zone-list-inl.h | 57 int new_capacity = 1 + 2 * capacity_; in ResizeAddInternal() local
61 Resize(new_capacity, alloc); in ResizeAddInternal()
66 void ZoneList<T>::Resize(int new_capacity, ZoneAllocationPolicy alloc) { in Resize() argument
67 DCHECK_LE(length_, new_capacity); in Resize()
68 T* new_data = NewData(new_capacity, alloc); in Resize()
72 capacity_ = new_capacity; in Resize()
|
| /external/swiftshader/third_party/subzero/src/ |
| D | IceAssembler.cpp | 117 intptr_t new_capacity = std::min(old_capacity * 2, old_capacity + OneMB); in extendCapacity() local
118 if (new_capacity < old_capacity) { in extendCapacity()
124 uintptr_t new_contents = NewContents(Assemblr, new_capacity); in extendCapacity()
134 Limit = computeLimit(new_contents, new_capacity); in extendCapacity()
137 assert(capacity() == new_capacity); in extendCapacity()
|
| /external/libchrome/base/ |
| D | pickle.cc | 336 void Pickle::Resize(size_t new_capacity) { in Resize() argument
338 capacity_after_header_ = bits::Align(new_capacity, kPayloadUnit); in Resize()
413 size_t new_capacity = capacity_after_header_ * 2; in ClaimUninitializedBytesInternal() local
415 if (new_capacity > kPickleHeapAlign) in ClaimUninitializedBytesInternal()
416 new_capacity = bits::Align(new_capacity, kPickleHeapAlign) - kPayloadUnit; in ClaimUninitializedBytesInternal()
417 Resize(std::max(new_capacity, new_size)); in ClaimUninitializedBytesInternal()
|
| /external/perfetto/src/protozero/ |
| D | proto_decoder.cc | 206 uint32_t new_capacity = capacity_ * 2; in ExpandHeapStorage() local
207 PERFETTO_CHECK(new_capacity > size_); in ExpandHeapStorage()
208 std::unique_ptr<Field[]> new_storage(new Field[new_capacity]); in ExpandHeapStorage()
216 capacity_ = new_capacity; in ExpandHeapStorage()
|
| /external/flac/libFLAC/ |
| D | bitwriter.c | 104 unsigned new_capacity; in bitwriter_grow_() local
111 …new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WO… in bitwriter_grow_()
116 if(bw->capacity >= new_capacity) in bitwriter_grow_()
120 if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT) in bitwriter_grow_()
121 …new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRIT… in bitwriter_grow_()
123 FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT); in bitwriter_grow_()
124 FLAC__ASSERT(new_capacity > bw->capacity); in bitwriter_grow_()
125 …FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLA… in bitwriter_grow_()
127 new_buffer = safe_realloc_mul_2op_(bw->buffer, sizeof(bwword), /*times*/new_capacity); in bitwriter_grow_()
131 bw->capacity = new_capacity; in bitwriter_grow_()
|
| /external/v8/src/objects/ |
| D | ordered-hash-table.cc | 159 Isolate* isolate, Handle<Derived> table, int new_capacity) { in Rehash() argument
163 isolate, new_capacity, Heap::InNewSpace(*table) ? NOT_TENURED : TENURED); in Rehash()
467 int new_capacity) { in Rehash() argument
468 DCHECK_GE(kMaxCapacity, new_capacity); in Rehash()
471 isolate, new_capacity, Heap::InNewSpace(*table) ? NOT_TENURED : TENURED); in Rehash()
506 int new_capacity = capacity; in Grow() local
511 new_capacity = capacity << 1; in Grow()
516 if (new_capacity == kGrowthHack) { in Grow()
517 new_capacity = kMaxCapacity; in Grow()
521 if (new_capacity > kMaxCapacity) { in Grow()
[all …]
|
| /external/libchrome/base/containers/ |
| D | circular_deque.h | 585 void reserve(size_type new_capacity) { in reserve() argument
586 if (new_capacity > capacity()) in reserve()
587 SetCapacityTo(new_capacity); in reserve()
940 void SetCapacityTo(size_t new_capacity) { in SetCapacityTo() argument
943 VectorBuffer new_buffer(new_capacity + 1); in SetCapacityTo()
958 size_t new_capacity = in ExpandCapacityIfNecessary() local
960 SetCapacityTo(new_capacity); in ExpandCapacityIfNecessary()
976 size_t new_capacity = in ShrinkCapacityIfNecessary() local
978 if (new_capacity < capacity()) { in ShrinkCapacityIfNecessary()
980 SetCapacityTo(new_capacity); in ShrinkCapacityIfNecessary()
|
| D | circular_deque_unittest.cc | 540 size_t new_capacity = 100; in TEST() local
541 q.reserve(new_capacity); in TEST()
542 EXPECT_EQ(new_capacity, q.capacity()); in TEST()
545 for (size_t i = 0; i < new_capacity; i++) in TEST()
547 EXPECT_EQ(new_capacity, q.size()); in TEST()
548 EXPECT_EQ(new_capacity, q.capacity()); in TEST()
551 size_t capacity_2 = new_capacity / 2; in TEST()
|
| /external/protobuf/src/google/protobuf/stubs/ |
| D | bytestream.cc | 122 size_t new_capacity = std::max(capacity_ + amount, (3 * capacity_) / 2); in Expand() local
123 char* bigger = new char[new_capacity]; in Expand()
127 capacity_ = new_capacity; in Expand()
|
| /external/libaom/libaom/common/ |
| D | obudec.c | 197 const size_t new_capacity = capacity + growth_amount; in obudec_grow_buffer() local
200 if (new_capacity > AOM_MAX_ALLOCABLE_MEMORY) { in obudec_grow_buffer()
206 uint8_t *new_buffer = (uint8_t *)realloc(*obu_buffer, new_capacity); in obudec_grow_buffer()
213 *obu_buffer_capacity = new_capacity; in obudec_grow_buffer()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_common.h | 519 uptr new_capacity = RoundUpToPowerOfTwo(size_ + 1); in push_back() local
520 Resize(new_capacity); in push_back()
562 void Resize(uptr new_capacity) { in Resize() argument
563 CHECK_GT(new_capacity, 0); in Resize()
564 CHECK_LE(size_, new_capacity); in Resize()
565 T *new_data = (T *)MmapOrDie(new_capacity * sizeof(T), in Resize()
571 capacity_ = new_capacity; in Resize()
|
| /external/libaom/libaom/third_party/vector/ |
| D | vector.c | 498 int _vector_reallocate(Vector *vector, size_t new_capacity) { in _vector_reallocate() argument
503 if (new_capacity < VECTOR_MINIMUM_CAPACITY) { in _vector_reallocate()
505 new_capacity = VECTOR_MINIMUM_CAPACITY; in _vector_reallocate()
512 new_capacity_in_bytes = new_capacity * vector->element_size; in _vector_reallocate()
532 vector->capacity = new_capacity; in _vector_reallocate()
|
| /external/libtextclassifier/utils/utf8/ |
| D | unicodetext.cc | 66 void UnicodeText::Repr::reserve(int new_capacity) { in reserve() argument
68 if (capacity_ >= new_capacity && ours_) return; in reserve()
71 capacity_ = std::max(new_capacity, (3 * capacity_) / 2 + 20); in reserve()
|