| /external/perfetto/include/perfetto/base/ |
| container_annotations.h | 45 new_capacity) \
47 ANNOTATE_NEW_BUFFER(buffer, new_capacity, buffer_size);
54 new_capacity)
|
| 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;
[all...] |
| /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 allocator_->Realloc(contents_, old_capacity, new_capacity, kArenaAllocAssembler));
88 limit_ = ComputeLimit(contents_, new_capacity);
91 CHECK_EQ(Capacity(), new_capacity); local
|
| /external/v8/src/builtins/ |
| growable-fixed-array-gen.cc | 74 // new_capacity = (current_capacity + (current_capacity >> 1)) + 16.
76 TNode<IntPtrT> const new_capacity = local
80 return new_capacity;
84 TNode<IntPtrT> const element_count, TNode<IntPtrT> const new_capacity) {
86 CSA_ASSERT(this, IntPtrGreaterThanOrEqual(new_capacity, IntPtrConstant(0)));
87 CSA_ASSERT(this, IntPtrGreaterThanOrEqual(new_capacity, element_count));
94 from_array, nullptr, element_count, new_capacity, flags));
|
| growable-fixed-array-gen.h | 42 // Creates a new array with {new_capacity} and copies the first
45 TNode<IntPtrT> const new_capacity);
|
| /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 | 78 int new_capacity = field_index + details.field_width_in_words(); local
79 if (new_capacity > layout_descriptor->capacity()) {
95 int new_capacity) {
97 if (new_capacity <= old_capacity) {
101 LayoutDescriptor::New(isolate, new_capacity);
|
| identity-map.cc | 259 void IdentityMapBase::Resize(int new_capacity) {
262 DCHECK_GT(new_capacity, size_);
267 capacity_ = new_capacity;
|
| /external/mesa3d/src/util/ |
| string_buffer.c | 34 uint32_t new_capacity = str->capacity * 2;
35 while (needed_capacity > new_capacity)
36 new_capacity *= 2;
38 str->buf = reralloc_array_size(str, str->buf, sizeof(char), new_capacity);
42 str->capacity = new_capacity;
|
| /external/libchrome/base/task/sequence_manager/ |
| lazily_deallocated_deque.h | 169 size_t new_capacity = max_size_ + 1;
170 if (new_capacity < kMinimumRingSize)
171 new_capacity = kMinimumRingSize;
179 if (new_capacity + kReclaimThreshold >= capacity())
182 SetCapacity(new_capacity);
187 void SetCapacity(size_t new_capacity) {
188 std::unique_ptr<Ring> new_ring = std::make_unique<Ring>(new_capacity);
190 DCHECK_GE(new_capacity, size_ + 1);
|
| /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 | 164 void CodeBuffer::Grow(size_t new_capacity) {
166 VIXL_ASSERT(new_capacity > capacity_);
169 buffer_ = static_cast<byte*>(realloc(buffer_, new_capacity));
179 mremap(buffer_, capacity_, new_capacity, MREMAP_MAYMOVE));
187 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;
|
| /external/perfetto/src/protozero/ |
| proto_decoder.cc | 206 uint32_t new_capacity = capacity_ * 2;
207 PERFETTO_CHECK(new_capacity > size_);
208 std::unique_ptr<Field[]> new_storage(new Field[new_capacity]);
216 capacity_ = new_capacity;
|
| /external/v8/src/zone/ |
| zone-list-inl.h | 57 int new_capacity = 1 + 2 * capacity_; local
61 Resize(new_capacity, alloc);
66 void ZoneList<T>::Resize(int new_capacity, ZoneAllocationPolicy alloc) {
67 DCHECK_LE(length_, new_capacity);
68 T* new_data = NewData(new_capacity, alloc);
72 capacity_ = new_capacity;
|
| /art/runtime/gc/space/ |
| malloc_space.cc | 279 size_t new_capacity = Capacity(); local
280 CHECK_LE(new_capacity, NonGrowthLimitCapacity());
281 GetLiveBitmap()->SetHeapSize(new_capacity);
282 GetMarkBitmap()->SetHeapSize(new_capacity);
285 temp_bitmap_->SetHeapSize(new_capacity);
287 GetMemMap()->SetSize(new_capacity);
288 limit_ = Begin() + new_capacity;
|
| /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 | 336 void Pickle::Resize(size_t new_capacity) {
338 capacity_after_header_ = bits::Align(new_capacity, kPayloadUnit);
413 size_t new_capacity = capacity_after_header_ * 2; local
415 if (new_capacity > kPickleHeapAlign)
416 new_capacity = bits::Align(new_capacity, kPickleHeapAlign) - kPayloadUnit;
417 Resize(std::max(new_capacity, new_size));
|
| /art/openjdkjvmti/ |
| jvmti_weak_table-inl.h | 277 void Resize(size_t new_capacity) {
278 CHECK_GT(new_capacity, capacity);
280 Storage* tmp = allocator.allocate(new_capacity);
288 capacity = new_capacity;
293 size_t new_capacity = 2 * capacity + 1; local
294 Resize(new_capacity);
|
| /external/v8/src/objects/ |
| ordered-hash-table.cc | 159 Isolate* isolate, Handle<Derived> table, int new_capacity) {
163 isolate, new_capacity, Heap::InNewSpace(*table) ? NOT_TENURED : TENURED);
467 int new_capacity) {
468 DCHECK_GE(kMaxCapacity, new_capacity);
471 isolate, new_capacity, Heap::InNewSpace(*table) ? NOT_TENURED : TENURED);
506 int new_capacity = capacity; local
511 new_capacity = capacity << 1;
516 if (new_capacity == kGrowthHack) {
517 new_capacity = kMaxCapacity;
521 if (new_capacity > kMaxCapacity)
[all...] |
| /art/runtime/gc/accounting/ |
| atomic_stack.h | 192 void Resize(size_t new_capacity) {
193 capacity_ = new_capacity;
194 growth_limit_ = new_capacity;
|
| /device/generic/goldfish-opengl/android-emu/android/base/ |
| address_space.h | 149 int new_capacity = address_space_allocator_grow_capacity(allocator->capacity); local
154 sizeof(struct address_block) * new_capacity);
156 allocator->capacity = new_capacity;
|
| /external/flac/libFLAC/ |
| bitwriter.c | 104 unsigned new_capacity; local
111 new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD);
116 if(bw->capacity >= new_capacity)
120 if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT)
121 new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
123 FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
124 FLAC__ASSERT(new_capacity > bw->capacity);
125 FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD));
127 new_buffer = safe_realloc_mul_2op_(bw->buffer, sizeof(bwword), /*times*/new_capacity);
[all...] |
| /external/libchrome/base/containers/ |
| circular_deque.h | 585 void reserve(size_type new_capacity) {
586 if (new_capacity > capacity())
587 SetCapacityTo(new_capacity);
940 void SetCapacityTo(size_t new_capacity) {
943 VectorBuffer new_buffer(new_capacity + 1);
958 size_t new_capacity = local
960 SetCapacityTo(new_capacity);
976 size_t new_capacity
[all...] |
| /external/libtextclassifier/utils/utf8/ |
| unicodetext.cc | 66 void UnicodeText::Repr::reserve(int new_capacity) {
68 if (capacity_ >= new_capacity && ours_) return;
71 capacity_ = std::max(new_capacity, (3 * capacity_) / 2 + 20);
|
