| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | BitVector.h | 38 unsigned Capacity; // Number of BitWords allocated in the Bits array. variable
78 BitVector() : Size(0), Capacity(0) { in BitVector()
85 Capacity = NumBitWords(s); in Size()
86 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in Size()
87 init_words(Bits, Capacity, t); in Size()
96 Capacity = 0; in BitVector()
100 Capacity = NumBitWords(RHS.size()); in BitVector()
101 Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord)); in BitVector()
102 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVector()
106 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity) { in BitVector()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
| D | ArrayRecycler.h | 49 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize()); in pop()
51 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize()); in pop()
63 __asan_poison_memory_region(Ptr, Capacity::get(Idx).getSize()); in push()
71 class Capacity {
73 explicit Capacity(uint8_t idx) : Index(idx) {} in Capacity() function
76 Capacity() : Index(0) {} in Capacity() function
79 static Capacity get(size_t N) { in get()
80 return Capacity(N ? Log2_64_Ceil(N) : 0); in get()
92 Capacity getNext() const { return Capacity(Index + 1); } in getNext()
125 T *allocate(Capacity Cap, AllocatorType &Allocator) { in allocate()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/ |
| D | IceBitVector.h | 258 unsigned Capacity; // Size of allocated memory in BitWord. variable
308 : Size(0), Capacity(0), Alloc(std::move(A)) {
316 Capacity = NumBitWords(s); in Size()
317 Bits = Alloc.allocate(Capacity); in Size()
318 init_words(Bits, Capacity, t); in Size()
327 Capacity = 0; in BitVectorTmpl()
331 Capacity = NumBitWords(RHS.size()); in BitVectorTmpl()
332 Bits = Alloc.allocate(Capacity); in BitVectorTmpl()
333 std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord)); in BitVectorTmpl()
337 : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity), in BitVectorTmpl()
[all …]
|
| D | IceAssembler.cpp | 33 static uintptr_t NewContents(Assembler &Assemblr, intptr_t Capacity) { in NewContents() argument
34 uintptr_t Result = Assemblr.allocateBytes(Capacity); in NewContents()
|
| /third_party/node/deps/v8/src/objects/ |
| D | swiss-name-dictionary-inl.h | 34 field_address(CtrlTableStartOffset(Capacity()))); in OBJECT_CONSTRUCTORS_IMPL()
39 field_address(PropertyDetailsTableStartOffset(Capacity()))); in PropertyDetailsTable()
42 int SwissNameDictionary::Capacity() { in Capacity() function
143 DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(Capacity())); in SetEntryForEnumerationIndex()
174 auto seq = probe(hash, Capacity()); in FindEntry()
211 DCHECK_LT(seq.index(), Capacity()); in FindEntry()
227 DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(Capacity())); in LoadFromDataTable()
235 DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(Capacity())); in StoreToDataTable()
246 DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(Capacity())); in StoreToDataTableNoBarrier()
276 DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(Capacity())); in DetailsAtPut()
[all …]
|
| D | swiss-name-dictionary.cc | 81 if (Capacity() != other.Capacity() || in EqualsForTesting()
88 for (int i = 0; i < Capacity() + kGroupWidth; i++) { in EqualsForTesting()
93 for (int i = 0; i < Capacity(); i++) { in EqualsForTesting()
117 if (table->Capacity() == 0) { in ShallowCopy()
121 int capacity = table->Capacity(); in ShallowCopy()
190 int capacity = table->Capacity(); in Shrink()
220 if (Capacity() == 0) return; in Rehash()
236 Initialize(isolate, meta_table(), Capacity()); in Rehash()
|
| D | ordered-hash-table.h | 110 int Capacity() { return NumberOfBuckets() * kLoadFactor; } in Capacity() function
450 int Capacity() const { in Capacity() function
461 DCHECK_LE(nof_elements, Capacity()); in NumberOfElements()
468 DCHECK_LE(nof_deleted_elements, Capacity()); in NumberOfDeletedElements()
515 int capacity = Capacity(); in GetBucketsStartOffset()
539 DCHECK_EQ(Capacity(), capacity); in GetChainTableOffset()
547 DCHECK_LT(static_cast<unsigned>(entry), Capacity()); in SetNextEntry()
549 DCHECK(next_entry <= Capacity() || next_entry == kNotFound); in SetNextEntry()
554 DCHECK_LT(entry, Capacity()); in GetNextEntry()
565 DCHECK(entry < Capacity() || entry == kNotFound); in HashToFirstEntry()
[all …]
|
| D | transitions-inl.h | 219 int TransitionsAccessor::Capacity() { return transitions().Capacity(); } in Capacity() function
330 int TransitionArray::Capacity() { in Capacity() function
336 DCHECK(number_of_transitions <= Capacity()); in SetNumberOfTransitions()
|
| D | ordered-hash-table.cc | 73 int capacity = table->Capacity(); in EnsureGrowable()
98 int capacity = table->Capacity(); in Shrink()
245 table->Capacity()); in Rehash()
713 if (table->UsedCapacity() >= table->Capacity()) { in Add()
756 if (table->UsedCapacity() >= table->Capacity()) { in Add()
822 if (table->UsedCapacity() >= table->Capacity()) { in Add()
982 int capacity = table->Capacity(); in Shrink()
990 int capacity = table->Capacity(); in Grow()
1402 int OrderedNameDictionaryHandler::Capacity(HeapObject table) { in Capacity() function in v8::internal::OrderedNameDictionaryHandler
1404 return SmallOrderedNameDictionary::cast(table).Capacity(); in Capacity()
[all …]
|
| D | hash-table-inl.h | 93 int HashTableBase::Capacity() const { in Capacity() function
98 return InternalIndex::Range(Capacity()); in IterateEntries()
167 uint32_t capacity = Capacity(); in FindEntry()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/ |
| D | MicrosoftDemangle.h | 32 size_t Capacity = 0; member
36 void addNode(size_t Capacity) { in addNode() argument
38 NewHead->Buf = new uint8_t[Capacity]; in addNode()
40 NewHead->Capacity = Capacity; in addNode()
64 if (Head->Used <= Head->Capacity) in allocUnalignedBuffer()
83 if (Head->Used <= Head->Capacity) in allocArray()
102 if (Head->Used <= Head->Capacity) in alloc()
|
| /third_party/skia/third_party/externals/brotli/csharp/org/brotli/dec/ |
| D | BitReader.cs | 15 private const int Capacity = 1024; field in Org.Brotli.Dec.BitReader
19 private const int IntBufferSize = Capacity + Slack;
21 private const int ByteReadSize = Capacity << 2;
58 if (br.intOffset <= Capacity - 9) in ReadMoreInput()
151 br.intOffset = Capacity; in Init()
198 int limit = Capacity; in IntAvailable()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/PDB/Native/ |
| D | HashTable.h | 106 support::ulittle32_t Capacity; member
116 explicit HashTable(uint32_t Capacity) { in HashTable() argument
117 Buckets.resize(Capacity); in HashTable()
124 if (H->Capacity == 0) in load()
127 if (H->Size > maxLoad(H->Capacity)) in load()
131 Buckets.resize(H->Capacity); in load()
187 H.Capacity = capacity(); in commit()
|
| /third_party/node/deps/v8/src/heap/ |
| D | stress-scavenge-observer.cc | 31 if (has_requested_gc_ || heap_->new_space()->Capacity() == 0) { in Step()
36 heap_->new_space()->Size() * 100.0 / heap_->new_space()->Capacity(); in Step()
66 heap_->new_space()->Size() * 100.0 / heap_->new_space()->Capacity(); in RequestedGCDone()
|
| /third_party/protobuf/csharp/src/Google.Protobuf.Test/Collections/ |
| D | RepeatedFieldTest.cs | 857 Assert.AreEqual(8, list.Capacity); in Capacity_Increase()
860 list.Capacity = 10; // Set capacity to a larger value to trigger growth in Capacity_Increase()
861 Assert.AreEqual(10, list.Capacity, "Capacity increased"); in Capacity_Increase()
872 Assert.AreEqual(8, list.Capacity); in Capacity_Decrease()
873 …Assert.DoesNotThrow(() => list.Capacity = 5, "Can decrease capacity if new capacity is greater tha… in Capacity_Decrease()
874 Assert.AreEqual(5, list.Capacity); in Capacity_Decrease()
876 Assert.DoesNotThrow(() => list.Capacity = 3, "Can set capacity exactly to list.Count" ); in Capacity_Decrease()
878 …Assert.Throws<ArgumentOutOfRangeException>(() => list.Capacity = 2, "Can't set the capacity smalle… in Capacity_Decrease()
880 …Assert.Throws<ArgumentOutOfRangeException>(() => list.Capacity = 0, "Can't set the capacity to zer… in Capacity_Decrease()
882 …Assert.Throws<ArgumentOutOfRangeException>(() => list.Capacity = -1, "Can't set the capacity to ne… in Capacity_Decrease()
[all …]
|
| /third_party/rust/crates/bindgen/bindgen-tests/tests/headers/ |
| D | non-type-params.hpp | 3 template <typename T, unsigned int Capacity>
5 T elements[Capacity];
|
| /third_party/node/deps/v8/src/libplatform/tracing/ |
| D | trace-buffer.cc | 70 return static_cast<uint64_t>(chunk_seq) * Capacity() + in MakeHandle()
77 *chunk_seq = static_cast<uint32_t>(handle / Capacity()); in ExtractHandle()
78 size_t indices = handle % Capacity(); in ExtractHandle()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | IntervalMap.cpp | 119 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity, in distribute() argument
122 assert(Elements + Grow <= Nodes * Capacity && "Not enough room for elements"); in distribute()
149 assert(NewSize[n] <= Capacity && "Overallocated node"); in distribute()
|
| /third_party/node/src/tracing/ |
| D | node_trace_buffer.cc | 83 return ((static_cast<uint64_t>(chunk_seq) * Capacity() + in MakeHandle()
92 *chunk_seq = static_cast<uint32_t>(handle / Capacity()); in ExtractHandle()
93 size_t indices = handle % Capacity(); in ExtractHandle()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | IntervalMap.h | 222 enum { Capacity = N }; enumerator
411 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
508 assert(n <= NodeT::Capacity && "Size too big for node"); in NodeRef()
1083 if (branched() || rootSize == RootLeaf::Capacity) in insert()
1171 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1181 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, in branchRoot()
1212 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1; in splitRoot()
1222 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, in splitRoot()
1744 if (IM.rootSize < RootBranch::Capacity) { in insertNode()
1764 if (P.size(Level) == Branch::Capacity) { in insertNode()
[all …]
|
| D | SmallVector.h | 41 unsigned Size = 0, Capacity; variable
45 : BeginX(FirstEl), Capacity(TotalCapacity) {} in SmallVectorBase()
53 size_t capacity() const { return Capacity; } in capacity()
108 Size = Capacity = 0; // FIXME: Setting Capacity to 0 is suspect. in resetToSmall()
253 this->Capacity = NewCapacity; in grow()
675 std::swap(this->Capacity, RHS.Capacity); in swap()
765 this->Capacity = RHS.Capacity;
|
| /third_party/mesa3d/src/imgui/ |
| D | imgui.h | 1178 int Capacity; member
1187 inline ImVector() { Size = Capacity = 0; Data = NULL; } in ImVector()
1188 …inline ImVector(const ImVector<T>& src) { Size = Capacity = 0; Data = NULL; operat… in ImVector()
1195 inline int capacity() const { return Capacity; } in capacity()
1199 …inline void clear() { if (Data) { Size = Capacity = 0; ImGui::… in clear()
1208 …e; rhs.Size = Size; Size = rhs_size; int rhs_cap = rhs.Capacity; rhs.Capacity = Capacity; Capacity… in swap()
1210 … _grow_capacity(int sz) const { int new_capacity = Capacity ? (Capacity + Capacity/2) : … in _grow_capacity()
1211 …inline void resize(int new_size) { if (new_size > Capacity) reserve(_grow_c… in resize()
1212 …inline void resize(int new_size, const T& v) { if (new_size > Capacity) reserve(_grow_c… in resize()
1213 …Capacity) return; T* new_data = (T*)ImGui::MemAlloc((size_t)new_capacity * sizeof(T)); if (Data) {… in reserve()
[all …]
|
| /third_party/skia/third_party/externals/imgui/ |
| D | imgui.h | 1698 int Capacity; member
1707 inline ImVector() { Size = Capacity = 0; Data = NULL; } in ImVector()
1708 …inline ImVector(const ImVector<T>& src) { Size = Capacity = 0; Data = NULL; operat… in ImVector()
1712 …inline void clear() { if (Data) { Size = Capacity = 0; IM_FREE… in clear()
1720 inline int capacity() const { return Capacity; } in capacity()
1732 …e; rhs.Size = Size; Size = rhs_size; int rhs_cap = rhs.Capacity; rhs.Capacity = Capacity; Capacity… in swap()
1734 … _grow_capacity(int sz) const { int new_capacity = Capacity ? (Capacity + Capacity / 2) … in _grow_capacity()
1735 …inline void resize(int new_size) { if (new_size > Capacity) reserve(_grow_c… in resize()
1736 …inline void resize(int new_size, const T& v) { if (new_size > Capacity) reserve(_grow_c… in resize()
1738 …Capacity) return; T* new_data = (T*)IM_ALLOC((size_t)new_capacity * sizeof(T)); if (Data) { memcpy… in reserve()
[all …]
|
| /third_party/protobuf/csharp/src/Google.Protobuf/ |
| D | ByteString.cs | 188 …byte[] bytes = memoryStream.Length == memoryStream.Capacity ? memoryStream.GetBuffer() : memoryStr… in FromStream()
214 …byte[] bytes = memoryStream.Length == memoryStream.Capacity ? memoryStream.GetBuffer() : memoryStr… in FromStreamAsync()
|
| /third_party/node/deps/v8/src/diagnostics/ |
| D | objects-debug.cc | 488 static_cast<size_t>(instance_size()) < heap->Capacity())); in MapVerify()
1333 int capacity = Capacity(); in SmallOrderedHashTableVerify()
1359 entry < Capacity(); entry++) { in SmallOrderedHashTableVerify()
1416 CHECK(IsValidCapacity(Capacity())); in SwissNameDictionaryVerify()
1423 for (int i = 0; i < Capacity(); i++) { in SwissNameDictionaryVerify()
1462 for (int i = 0; i < std::min(static_cast<int>(Group::kWidth), Capacity()); in SwissNameDictionaryVerify()
1464 CHECK_EQ(CtrlTable()[i], CtrlTable()[Capacity() + i]); in SwissNameDictionaryVerify()
1468 for (int i = 2 * Capacity(); i < Capacity() + kGroupWidth; ++i) { in SwissNameDictionaryVerify()
1474 CHECK_LT(entry, Capacity()); in SwissNameDictionaryVerify()
1971 dict.Capacity() - dict.NumberOfElements(); in IncrementSpillStatistics()
[all …]
|