/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
D | DenseMap.h | 42 BucketT *Buckets; variable 68 for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { in ~DenseMap() 76 memset((void*)Buckets, 0x5a, sizeof(BucketT)*NumBuckets); in ~DenseMap() 78 operator delete(Buckets); in ~DenseMap() 86 return empty() ? end() : iterator(Buckets, Buckets+NumBuckets); in begin() 89 return iterator(Buckets+NumBuckets, Buckets+NumBuckets); in end() 92 return empty() ? end() : const_iterator(Buckets, Buckets+NumBuckets); in begin() 95 return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets); in end() 118 for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { in clear() 140 return iterator(TheBucket, Buckets+NumBuckets); in find() [all …]
|
D | FoldingSet.h | 115 void **Buckets; 409 iterator begin() { return iterator(Buckets); } in begin() 410 iterator end() { return iterator(Buckets+NumBuckets); } in end() 413 const_iterator begin() const { return const_iterator(Buckets); } in begin() 414 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end() 419 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin() 423 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end() 488 iterator begin() { return iterator(Buckets); } in begin() 489 iterator end() { return iterator(Buckets+NumBuckets); } in end() 492 const_iterator begin() const { return const_iterator(Buckets); } in begin() [all …]
|
/external/swiftshader/third_party/llvm-subzero/lib/Support/ |
D | FoldingSet.cpp | 209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument 212 return Buckets + BucketNum; in GetBucketFor() 217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets() local 219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets() 220 return Buckets; in AllocateBuckets() 232 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl() 237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetImpl() 238 Arg.Buckets = nullptr; in FoldingSetImpl() 244 free(Buckets); // This may be null if the set is in a moved-from state. in operator =() 245 Buckets = RHS.Buckets; in operator =() [all …]
|
/external/llvm/lib/Support/ |
D | FoldingSet.cpp | 209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument 212 return Buckets + BucketNum; in GetBucketFor() 217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets() local 219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets() 220 return Buckets; in AllocateBuckets() 232 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl() 237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetImpl() 238 Arg.Buckets = nullptr; in FoldingSetImpl() 244 free(Buckets); // This may be null if the set is in a moved-from state. in operator =() 245 Buckets = RHS.Buckets; in operator =() [all …]
|
/external/llvm/include/llvm/Support/ |
D | OnDiskHashTable.h | 86 Bucket *Buckets; variable 90 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument 91 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert() 102 for (Item *E = Buckets[I].Head; E;) { in resize() 109 free(Buckets); in resize() 111 Buckets = NewBuckets; in resize() 130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert() 136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains() 173 Bucket &B = Buckets[I]; in Emit() 220 LE.write<offset_type>(Buckets[I].Off); in Emit() [all …]
|
D | GenericDomTreeConstruction.h | 185 SmallVector<unsigned, 32> Buckets; in Calculate() local 186 Buckets.resize(N + 1); in Calculate() 188 Buckets[i] = i; in Calculate() 196 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) { in Calculate() 197 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate() 224 Buckets[i] = Buckets[WInfo.Semi]; in Calculate() 225 Buckets[WInfo.Semi] = i; in Calculate() 231 for (unsigned j = 1; Buckets[j] != 1; j = Buckets[j]) { in Calculate() 232 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
D | DwarfAccelTable.cpp | 95 Buckets.resize(Header.bucket_count); in FinalizeTable() 98 Buckets[bucket].push_back(Data[i]); in FinalizeTable() 105 for (size_t i = 0; i < Buckets.size(); ++i) in FinalizeTable() 106 std::stable_sort(Buckets[i].begin(), Buckets[i].end(), in FinalizeTable() 143 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitBuckets() 145 if (Buckets[i].size() != 0) in EmitBuckets() 152 for (auto *HD : Buckets[i]) { in EmitBuckets() 165 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitHashes() 166 for (HashList::const_iterator HI = Buckets[i].begin(), in EmitHashes() 167 HE = Buckets[i].end(); in EmitHashes() [all …]
|
D | DwarfAccelTable.h | 241 BucketList Buckets; variable
|
/external/llvm/lib/Target/PowerPC/ |
D | PPCLoopPreIncPrep.cpp | 183 SmallVector<Bucket, 16> Buckets; in runOnLoop() local 225 for (auto &B : Buckets) { in runOnLoop() 235 if (Buckets.size() == MaxVars) in runOnLoop() 237 Buckets.push_back(Bucket(LSCEV, MemI)); in runOnLoop() 242 if (Buckets.empty()) in runOnLoop() 258 DEBUG(dbgs() << "PIP: Found " << Buckets.size() << " buckets\n"); in runOnLoop() 261 for (unsigned i = 0, e = Buckets.size(); i != e; ++i) { in runOnLoop() 274 for (int j = 0, je = Buckets[i].Elements.size(); j != je; ++j) { in runOnLoop() 275 if (auto *II = dyn_cast<IntrinsicInst>(Buckets[i].Elements[j].Instr)) in runOnLoop() 285 if (!Buckets[i].Elements[j].Offset || in runOnLoop() [all …]
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
D | FoldingSet.cpp | 208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument 211 return Buckets + BucketNum; in GetBucketFor() 216 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*))); in AllocateBuckets() local 218 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets() 219 return Buckets; in AllocateBuckets() 229 Buckets = AllocateBuckets(NumBuckets); in FoldingSetImpl() 233 free(Buckets); in ~FoldingSetImpl() 237 memset(Buckets, 0, NumBuckets*sizeof(void*)); in clear() 240 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in clear() 249 void **OldBuckets = Buckets; in GrowHashTable() [all …]
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
D | DominatorInternals.h | 186 SmallVector<unsigned, 32> Buckets; in Calculate() local 187 Buckets.resize(N + 1); in Calculate() 189 Buckets[i] = i; in Calculate() 197 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) { in Calculate() 198 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate() 225 Buckets[i] = Buckets[WInfo.Semi]; in Calculate() 226 Buckets[WInfo.Semi] = i; in Calculate() 232 for (unsigned j = 1; Buckets[j] != 1; j = Buckets[j]) { in Calculate() 233 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
|
/external/llvm/test/tools/llvm-readobj/ |
D | elf-gnuhash.test | 22 I386-NEXT: Num Buckets: 3 27 I386-NEXT: Buckets: [1, 4, 0] 33 X86_64-NEXT: Num Buckets: 3 38 X86_64-NEXT: Buckets: [1, 4, 0] 44 PPC-NEXT: Num Buckets: 3 49 PPC-NEXT: Buckets: [1, 5, 0] 55 PPC64-NEXT: Num Buckets: 3 60 PPC64-NEXT: Buckets: [1, 4, 0]
|
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
D | FoldingSet.h | 119 void **Buckets; 454 iterator begin() { return iterator(Buckets); } in begin() 455 iterator end() { return iterator(Buckets+NumBuckets); } in end() 458 const_iterator begin() const { return const_iterator(Buckets); } in begin() 459 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end() 464 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin() 468 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end() 534 iterator begin() { return iterator(Buckets); } in begin() 535 iterator end() { return iterator(Buckets+NumBuckets); } in end() 538 const_iterator begin() const { return const_iterator(Buckets); } in begin() [all …]
|
D | DenseMap.h | 590 BucketT *Buckets; variable 618 operator delete(Buckets); in ~DenseMap() 624 std::swap(Buckets, RHS.Buckets); in swap() 638 operator delete(Buckets); 646 operator delete(Buckets); in copyFrom() 667 BucketT *OldBuckets = Buckets; in grow() 670 assert(Buckets); in grow() 695 operator delete(Buckets); in shrink_and_clear() 715 return Buckets; in getBuckets() 725 Buckets = nullptr; in allocateBuckets() [all …]
|
/external/llvm/include/llvm/ADT/ |
D | FoldingSet.h | 114 void **Buckets; 446 iterator begin() { return iterator(Buckets); } in begin() 447 iterator end() { return iterator(Buckets+NumBuckets); } in end() 450 const_iterator begin() const { return const_iterator(Buckets); } in begin() 451 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end() 456 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin() 460 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end() 524 iterator begin() { return iterator(Buckets); } in begin() 525 iterator end() { return iterator(Buckets+NumBuckets); } in end() 528 const_iterator begin() const { return const_iterator(Buckets); } in begin() [all …]
|
D | DenseMap.h | 592 BucketT *Buckets; variable 620 operator delete(Buckets); in ~DenseMap() 626 std::swap(Buckets, RHS.Buckets); in swap() 640 operator delete(Buckets); 648 operator delete(Buckets); in copyFrom() 669 BucketT *OldBuckets = Buckets; in grow() 672 assert(Buckets); in grow() 697 operator delete(Buckets); in shrink_and_clear() 717 return Buckets; in getBuckets() 727 Buckets = nullptr; in allocateBuckets() [all …]
|
/external/clang/unittests/Lex/ |
D | HeaderMapTest.cpp | 27 HMapBucket Buckets[NumBuckets]; member 35 Header.StringsOffset = sizeof(Header) + sizeof(Buckets); in init() 79 if (!File.Buckets[I].Key) { in addBucket() 80 File.Buckets[I].Key = Key; in addBucket() 81 File.Buckets[I].Prefix = Prefix; in addBucket() 82 File.Buckets[I].Suffix = Suffix; in addBucket() 139 ASSERT_EQ(3 * sizeof(HMapBucket), sizeof(File.Buckets)); in TEST()
|
/external/clang/test/SemaCXX/ |
D | 2008-01-11-BadWarning.cpp | 4 void** f(void **Buckets, unsigned NumBuckets) { in f() argument 5 return Buckets + NumBuckets; in f()
|
/external/clang/lib/Serialization/ |
D | MultiOnDiskHashTable.h | 53 storage_type Buckets, storage_type Payload, storage_type Base, in OnDiskTable() 56 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {} in OnDiskTable() 200 storage_type Buckets = Data + BucketOffset; variable 202 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets); 207 Buckets, Ptr, Data, std::move(InfoObj));
|
/external/llvm/test/Object/ |
D | no-section-table.test | 32 CHECK: Num Buckets: 3 34 CHECK: Buckets: [12, 10, 11]
|
/external/llvm/tools/llvm-dwp/ |
D | llvm-dwp.cpp | 286 std::vector<unsigned> Buckets(NextPowerOf2(3 * IndexEntries.size() / 2)); in writeIndex() local 287 uint64_t Mask = Buckets.size() - 1; in writeIndex() 293 while (Buckets[H]) { in writeIndex() 294 assert(S != IndexEntries.begin()[Buckets[H] - 1].first && in writeIndex() 298 Buckets[H] = i + 1; in writeIndex() 306 Out.EmitIntValue(Buckets.size(), 4); // Num Buckets in writeIndex() 309 for (const auto &I : Buckets) in writeIndex() 313 for (const auto &I : Buckets) in writeIndex()
|
/external/brotli/enc/ |
D | hash_longest_match64_inc.h | 62 static BROTLI_INLINE uint32_t* FN(Buckets)(HashLongestMatch* self) { in FN() argument 117 FN(Buckets)(self)[offset] = (uint32_t)ix; in FN() local 169 uint32_t* buckets = FN(Buckets)(self); in FN()
|
D | hash_longest_match_inc.h | 58 static BROTLI_INLINE uint32_t* FN(Buckets)(HashLongestMatch* self) { in FN() argument 110 FN(Buckets)(self)[offset] = (uint32_t)ix; in FN() local 162 uint32_t* buckets = FN(Buckets)(self); in FN()
|
/external/llvm/lib/ProfileData/ |
D | InstrProfReader.cpp | 556 const unsigned char *Buckets, const unsigned char *const Payload, in InstrProfReaderIndex() argument 561 Buckets, Payload, Base, in InstrProfReaderIndex()
|
/external/llvm/include/llvm/ProfileData/ |
D | InstrProfReader.h | 334 InstrProfReaderIndex(const unsigned char *Buckets,
|