/third_party/node/deps/v8/src/utils/ |
D | detachable-vector.h | 57 size_t new_capacity = std::max(kMinimumCapacity, 2 * capacity_); in push_back() local 58 Resize(new_capacity); in push_back() 81 size_t new_capacity = std::max(size_, kMinimumCapacity); in shrink_to_fit() local 82 if (new_capacity < capacity_ / 2) { in shrink_to_fit() 83 Resize(new_capacity); in shrink_to_fit() 90 void Resize(size_t new_capacity) { in Resize() argument 91 DCHECK_LE(size_, new_capacity); in Resize() 92 T* new_data_ = new T[new_capacity]; in Resize() 98 capacity_ = new_capacity; in Resize()
|
D | identity-map.cc | 296 void IdentityMapBase::Resize(int new_capacity) { in Resize() argument 299 DCHECK_GT(new_capacity, size_); in Resize() 304 capacity_ = new_capacity; in Resize()
|
/third_party/node/deps/v8/src/execution/ |
D | microtask-queue.cc | 104 intptr_t new_capacity = std::max(kMinimumCapacity, capacity_ << 1); in EnqueueMicrotask() local 105 ResizeBuffer(new_capacity); in EnqueueMicrotask() 217 intptr_t new_capacity = capacity_; in IterateMicrotasks() local 218 while (new_capacity > 2 * size_) { in IterateMicrotasks() 219 new_capacity >>= 1; in IterateMicrotasks() 221 new_capacity = std::max(new_capacity, kMinimumCapacity); in IterateMicrotasks() 222 if (new_capacity < capacity_) { in IterateMicrotasks() 223 ResizeBuffer(new_capacity); in IterateMicrotasks() 260 void MicrotaskQueue::ResizeBuffer(intptr_t new_capacity) { in ResizeBuffer() argument 261 DCHECK_LE(size_, new_capacity); in ResizeBuffer() [all …]
|
/third_party/node/deps/v8/src/builtins/ |
D | growable-fixed-array-gen.cc | 76 const TNode<IntPtrT> new_capacity = in NewCapacity() local 80 return new_capacity; in NewCapacity() 84 const TNode<IntPtrT> element_count, const TNode<IntPtrT> new_capacity) { in ResizeFixedArray() argument 86 CSA_DCHECK(this, IntPtrGreaterThanOrEqual(new_capacity, IntPtrConstant(0))); in ResizeFixedArray() 87 CSA_DCHECK(this, IntPtrGreaterThanOrEqual(new_capacity, element_count)); in ResizeFixedArray() 96 base::Optional<TNode<IntPtrT>>(new_capacity), flags)); in ResizeFixedArray()
|
/third_party/jerryscript/jerry-core/ecma/base/ |
D | ecma-helpers-collection.c | 136 const uint32_t new_capacity = collection_p->capacity + ECMA_COLLECTION_GROW_FACTOR; in ecma_collection_push_back() local 138 const uint32_t new_size = ECMA_COLLECTION_ALLOCATED_SIZE (new_capacity); in ecma_collection_push_back() 142 collection_p->capacity = new_capacity; in ecma_collection_push_back() 157 const uint32_t new_capacity = collection_p->capacity + count; in ecma_collection_reserve() local 159 const uint32_t new_size = ECMA_COLLECTION_ALLOCATED_SIZE (new_capacity); in ecma_collection_reserve() 164 collection_p->capacity = new_capacity; in ecma_collection_reserve()
|
/third_party/vixl/src/ |
D | code-buffer-vixl.cc | 178 void CodeBuffer::Grow(size_t new_capacity) { in Grow() argument 180 VIXL_ASSERT(new_capacity > capacity_); in Grow() 185 buffer_ = static_cast<byte*>(realloc(buffer_, new_capacity)); in Grow() 189 mremap(buffer_, capacity_, new_capacity, MREMAP_MAYMOVE)); in Grow() 191 if ((mmap_max_ != 0) && (new_capacity > mmap_max_)) { in Grow() 200 capacity_ = new_capacity; in Grow()
|
/third_party/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()
|
/third_party/node/deps/v8/src/objects/ |
D | swiss-name-dictionary.cc | 43 IsolateT* isolate, Handle<SwissNameDictionary> table, int new_capacity) { in Rehash() argument 44 DCHECK(IsValidCapacity(new_capacity)); in Rehash() 45 DCHECK_LE(table->NumberOfElements(), MaxUsableCapacity(new_capacity)); in Rehash() 50 new_capacity, Heap::InYoungGeneration(*table) ? AllocationType::kYoung in Rehash() 192 int new_capacity = std::max(capacity / 2, kInitialCapacity); in Shrink() local 193 return Rehash(isolate, table, new_capacity); in Shrink() 306 int new_capacity); 309 int new_capacity);
|
D | ordered-hash-table.cc | 76 int new_capacity; in EnsureGrowable() local 79 new_capacity = kInitialCapacity; in EnsureGrowable() 84 new_capacity = capacity; in EnsureGrowable() 86 new_capacity = capacity << 1; in EnsureGrowable() 89 return Derived::Rehash(isolate, table, new_capacity); in EnsureGrowable() 251 IsolateT* isolate, Handle<Derived> table, int new_capacity) { in Rehash() argument 255 Derived::Allocate(isolate, new_capacity, in Rehash() 303 int new_capacity) { in Rehash() argument 304 return Base::Rehash(isolate, table, new_capacity); in Rehash() 319 int new_capacity) { in Rehash() argument [all …]
|
D | string-table.cc | 65 int new_capacity = ComputeStringTableCapacity(at_least_room_for); in ComputeStringTableCapacityWithShrink() local 66 DCHECK_GE(new_capacity, at_least_room_for); in ComputeStringTableCapacityWithShrink() 68 if (new_capacity < kStringTableMinCapacity) return current_capacity; in ComputeStringTableCapacityWithShrink() 69 return new_capacity; in ComputeStringTableCapacityWithShrink() 601 int new_capacity = -1; in EnsureCapacity() local 605 new_capacity = capacity_after_shrinking; in EnsureCapacity() 609 new_capacity = ComputeStringTableCapacity(current_nof + 1); in EnsureCapacity() 612 if (new_capacity != -1) { in EnsureCapacity() 614 Data::Resize(cage_base, std::unique_ptr<Data>(data), new_capacity); in EnsureCapacity()
|
D | ordered-hash-table.h | 217 int new_capacity); 287 int new_capacity); 331 int new_capacity); 508 int new_capacity); 672 int new_capacity); 706 int new_capacity); 802 IsolateT* isolate, Handle<OrderedNameDictionary> table, int new_capacity); 896 int new_capacity);
|
D | js-objects-inl.h | 907 uint32_t new_capacity) { in ACCESSORS() 911 return size_threshold <= new_capacity; in ACCESSORS() 917 uint32_t* new_capacity) { in ShouldConvertToSlowElements() argument 921 *new_capacity = capacity; in ShouldConvertToSlowElements() 925 *new_capacity = JSObject::NewElementsCapacity(index + 1); in ShouldConvertToSlowElements() 926 DCHECK_LT(index, *new_capacity); in ShouldConvertToSlowElements() 927 if (*new_capacity <= JSObject::kMaxUncheckedOldFastElementsLength || in ShouldConvertToSlowElements() 928 (*new_capacity <= JSObject::kMaxUncheckedFastElementsLength && in ShouldConvertToSlowElements() 933 *new_capacity); in ShouldConvertToSlowElements()
|
/third_party/node/deps/v8/src/sandbox/ |
D | external-pointer-table.cc | 67 uint32_t new_capacity = old_capacity + kEntriesPerBlock; in Grow() local 68 CHECK_LE(new_capacity, kMaxSandboxedExternalPointers); in Grow() 76 capacity_ = new_capacity; in Grow() 80 uint32_t last = new_capacity - 1; in Grow()
|
/third_party/node/deps/v8/src/heap/ |
D | new-spaces.cc | 176 bool SemiSpace::GrowTo(size_t new_capacity) { in GrowTo() argument 180 DCHECK_EQ(new_capacity & kPageAlignmentMask, 0u); in GrowTo() 181 DCHECK_LE(new_capacity, maximum_capacity_); in GrowTo() 182 DCHECK_GT(new_capacity, target_capacity_); in GrowTo() 183 const size_t delta = new_capacity - target_capacity_; in GrowTo() 203 target_capacity_ = new_capacity; in GrowTo() 220 void SemiSpace::ShrinkTo(size_t new_capacity) { in ShrinkTo() argument 221 DCHECK_EQ(new_capacity & kPageAlignmentMask, 0u); in ShrinkTo() 222 DCHECK_GE(new_capacity, minimum_capacity_); in ShrinkTo() 223 DCHECK_LT(new_capacity, target_capacity_); in ShrinkTo() [all …]
|
/third_party/node/deps/v8/src/zone/ |
D | zone-list-inl.h | 58 int new_capacity = 1 + 2 * capacity_; in ResizeAddInternal() local 62 Resize(new_capacity, zone); in ResizeAddInternal() 67 void ZoneList<T>::Resize(int new_capacity, Zone* zone) { in Resize() argument 68 DCHECK_LE(length_, new_capacity); in Resize() 69 T* new_data = zone->NewArray<T>(new_capacity); in Resize() 79 capacity_ = new_capacity; in Resize()
|
/third_party/skia/third_party/externals/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()
|
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
D | inlined_vector.h | 526 size_type new_capacity = ComputeCapacity(GetInlinedCapacity(), n); in InitFrom() local 527 dst = AllocatorTraits::allocate(*GetAllocPtr(), new_capacity); in InitFrom() 528 SetAllocatedData(dst, new_capacity); in InitFrom() 553 size_type new_capacity = ComputeCapacity(GetInlinedCapacity(), new_size); variable 554 construct_data = AllocatorTraits::allocate(*GetAllocPtr(), new_capacity); 555 SetAllocatedData(construct_data, new_capacity); 582 size_type new_capacity = ComputeCapacity(storage_view.capacity, new_size); variable 583 construct_loop = {allocation_tx.Allocate(new_capacity), new_size}; 636 size_type new_capacity = ComputeCapacity(storage_view.capacity, new_size); variable 637 pointer new_data = allocation_tx.Allocate(new_capacity); [all …]
|
/third_party/mesa3d/src/freedreno/vulkan/ |
D | tu_cs.c | 117 uint32_t new_capacity = MAX2(4, 2 * cs->bo_capacity); in tu_cs_add_bo() local 119 realloc(cs->bos, new_capacity * sizeof(struct tu_bo *)); in tu_cs_add_bo() 123 cs->bo_capacity = new_capacity; in tu_cs_add_bo() 161 uint32_t new_capacity = MAX2(4, cs->entry_capacity * 2); in tu_cs_reserve_entry() local 163 realloc(cs->entries, new_capacity * sizeof(struct tu_cs_entry)); in tu_cs_reserve_entry() 167 cs->entry_capacity = new_capacity; in tu_cs_reserve_entry()
|
/third_party/node/src/ |
D | aliased_buffer-inl.h | 180 void AliasedBufferBase<NativeT, V8T>::reserve(size_t new_capacity) { in reserve() argument 182 DCHECK_GE(new_capacity, count_); in reserve() 188 MultiplyWithOverflowCheck(sizeof(NativeT), new_capacity); in reserve() 200 v8::Local<V8T> js_array = V8T::New(ab, byte_offset_, new_capacity); in reserve() 206 count_ = new_capacity; in reserve()
|
/third_party/gn/src/base/containers/ |
D | circular_deque.h | 584 void reserve(size_type new_capacity) { in reserve() argument 585 if (new_capacity > capacity()) in reserve() 586 SetCapacityTo(new_capacity); in reserve() 939 void SetCapacityTo(size_t new_capacity) { in SetCapacityTo() argument 942 VectorBuffer new_buffer(new_capacity + 1); in SetCapacityTo() 957 size_t new_capacity = in ExpandCapacityIfNecessary() local 959 SetCapacityTo(new_capacity); in ExpandCapacityIfNecessary() 975 size_t new_capacity = in ShrinkCapacityIfNecessary() local 977 if (new_capacity < capacity()) { in ShrinkCapacityIfNecessary() 979 SetCapacityTo(new_capacity); in ShrinkCapacityIfNecessary()
|
/third_party/protobuf/src/google/protobuf/stubs/ |
D | bytestream.cc | 124 size_t new_capacity = std::max(capacity_ + amount, (3 * capacity_) / 2); in Expand() local 125 char* bigger = new char[new_capacity]; in Expand() 129 capacity_ = new_capacity; in Expand()
|
/third_party/node/deps/v8/src/base/ |
D | small-vector.h | 161 size_t new_capacity = in Grow() local 163 T* new_storage = AllocateDynamicStorage(new_capacity); in Grow() 175 end_of_storage_ = new_storage + new_capacity; in Grow()
|
/third_party/libuv/src/win/ |
D | core.c | 95 int new_capacity, i; in uv__loops_add() local 100 new_capacity = uv__loops_capacity + UV__LOOPS_CHUNK_SIZE; in uv__loops_add() 101 new_loops = uv__realloc(uv__loops, sizeof(uv_loop_t*) * new_capacity); in uv__loops_add() 105 for (i = uv__loops_capacity; i < new_capacity; ++i) in uv__loops_add() 107 uv__loops_capacity = new_capacity; in uv__loops_add()
|
/third_party/node/deps/uv/src/win/ |
D | core.c | 95 int new_capacity, i; in uv__loops_add() local 100 new_capacity = uv__loops_capacity + UV__LOOPS_CHUNK_SIZE; in uv__loops_add() 101 new_loops = uv__realloc(uv__loops, sizeof(uv_loop_t*) * new_capacity); in uv__loops_add() 105 for (i = uv__loops_capacity; i < new_capacity; ++i) in uv__loops_add() 107 uv__loops_capacity = new_capacity; in uv__loops_add()
|
/third_party/node/deps/v8/src/strings/ |
D | string-stream.cc | 43 unsigned new_capacity = capacity_; in Put() local 44 char* new_buffer = allocator_->grow(&new_capacity); in Put() 45 if (new_capacity > capacity_) { in Put() 46 capacity_ = new_capacity; in Put()
|