| /llvm-project/llvm/include/llvm/ADT/ |
| H A D | StringMap.h | 169 StringMapEntryBase *Bucket = RHS.TheTable[I]; in StringMap() local
201 StringMapEntryBase *Bucket = TheTable[I]; in ~StringMap() local
236 int Bucket = FindKey(Key, FullHashValue); in find() local
245 int Bucket = FindKey(Key, FullHashValue); in find() local
310 StringMapEntryBase *&Bucket = TheTable[BucketNo]; in insert() local
377 StringMapEntryBase *&Bucket = TheTable[BucketNo]; in try_emplace_with_hash() local
401 StringMapEntryBase *&Bucket = TheTable[I]; in clear() local
443 : Ptr(Bucket) { in Ptr() argument
487 : base(Bucket, NoAdvance) {} in base() argument
504 : base(Bucket, NoAdvance) {} in base() argument
|
| H A D | ConcurrentHashtable.h | 276 struct Bucket { global() struct
298 GuardBucket RehashBucket() argument
[all...] |
| H A D | FoldingSet.h | 727 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator()
756 FoldingSetBucketIteratorImpl(void **Bucket, bool) : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl()
776 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator()
779 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator()
|
| H A D | SmallPtrSet.h | 191 *const_cast<const void **>(Bucket) = getTombstoneMarker(); in find_imp() local
165 auto *Bucket = FindBucketFor(Ptr); erase_imp() local
[all...] |
| /llvm-project/llvm/lib/Support/ |
| H A D | FoldingSet.cpp | 281 void **Bucket = GetBucketFor(IDHash, Buckets, NumBuckets); in FindNodeOrInsertPos() local
317 void **Bucket = static_cast<void**>(InsertPos); in InsertNode() local
359 void **Bucket = GetBucketPtr(Ptr); in RemoveNode() local
390 FoldingSetIteratorImpl::FoldingSetIteratorImpl(void **Bucket) { in FoldingSetIteratorImpl()
407 void **Bucket = GetBucketPtr(Probe); in advance() local
422 FoldingSetBucketIteratorImpl::FoldingSetBucketIteratorImpl(void **Bucket) { in FoldingSetBucketIteratorImpl()
|
| H A D | SmallPtrSet.cpp | 51 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); in insert_imp_big() local
66 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); FindBucketFor() local
[all...] |
| H A D | StringMap.cpp | 203 int Bucket = FindKey(Key); in RemoveKey() local
240 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
|
| /llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 195 struct Bucket { global() struct
196 Bucket__anon091fa8600111::Bucket Bucket() argument
202 BaseSCEV__anon091fa8600111::Bucket global() argument
207 Elements__anon091fa8600111::Bucket global() argument
210 ChainSize__anon091fa8600111::Bucket global() argument
213 ChainBases__anon091fa8600111::Bucket global() argument
529 chainCommoning(Loop * L,SmallVector<Bucket,16> & Buckets) chainCommoning() argument
537 for (auto &Bucket : Buckets) { chainCommoning() local
549 rewriteLoadStoresForCommoningChains(Loop * L,Bucket & Bucket,SmallSet<BasicBlock *,16> & BBChanged) rewriteLoadStoresForCommoningChains() argument
836 addOneCandidate(Instruction * MemI,const SCEV * LSCEV,SmallVector<Bucket,16> & Buckets,std::function<bool (const SCEV *)> isValidDiff,unsigned MaxCandidateNum) addOneCandidate() argument
1097 updateFormPrep(Loop * L,SmallVector<Bucket,16> & Buckets) updateFormPrep() argument
1102 for (auto &Bucket : Buckets) updateFormPrep() local
1115 dispFormPrep(Loop * L,SmallVector<Bucket,16> & Buckets,PrepForm Form) dispFormPrep() argument
1123 for (auto &Bucket : Buckets) { dispFormPrep() local
[all...] |
| /llvm-project/bolt/lib/Core/ |
| H A D | DebugNames.cpp | 414 uint32_t Bucket = E.second.HashValue % BucketCount; finalize() local
464 for (auto &Bucket : getBuckets()) { populateAbbrevsMap() local
578 for (auto &Bucket : getBuckets()) { writeEntries() local
589 for (auto &Bucket : getBuckets()) { writeEntries() local
691 for (const auto &Bucket : enumerate(getBuckets())) { emitBuckets() local
698 for (const auto &Bucket : getBuckets()) { emitHashes() local
705 for (const auto &Bucket : getBuckets()) { emitStringOffsets() local
712 for (const auto &Bucket : getBuckets()) { emitOffsets() local
[all...] |
| /llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_addrhashmap.h | 63 struct Bucket { struct
66 Cell cells[kBucketSize]; argument
88 Bucket *bucket_; argument
|
| /llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | AccelTable.cpp | 64 Buckets[Bucket].push_back(&E.second); in finalize() local
71 llvm::stable_sort(Bucket, [](HashData *LHS, HashData *RHS) { in finalize() local
253 for (const auto &Hash : Bucket) { in emitHashes() local
333 for (const AccelTableBase::HashList &Bucket : Buckets) { emitData() local
431 for (auto &Bucket : Contents.getBuckets()) { populateAbbrevsMap() local
487 for (const auto &Bucket : enumerate(Contents.getBuckets())) { emitBuckets() local
495 for (const auto &Bucket : enumerate(Contents.getBuckets())) { emitStringOffsets() local
586 for (auto &Bucket : Contents.getBuckets()) { emitData() local
614 for (auto &Bucket : Contents.getBuckets()) Dwarf5AccelTableWriter() local
804 for (const auto &Bucket : Buckets) print() local
[all...] |
| /llvm-project/llvm/include/llvm/Support/ |
| H A D | OnDiskHashTable.h | 78 struct Bucket { struct
84 Bucket *Buckets; argument
360 const unsigned char *Bucket = Buckets + sizeof(offset_type) * Idx; variable
|
| H A D | ArrayRecycler.h | 39 SmallVector<FreeList*, 8> Bucket; variable
|
| H A D | BalancedPartitioning.h | 76 std::optional<unsigned> Bucket; variable
|
| /llvm-project/clang/include/clang/Lex/ |
| H A D | HeaderMap.h | 48 for (unsigned Bucket = 0; Bucket < NumBuckets; ++Bucket) { in forEachKey() local
|
| /llvm-project/clang-tools-extra/clang-tidy/portability/ |
| H A D | RestrictSystemIncludesCheck.cpp | 39 for (const auto &Bucket : IncludeDirectives) { in EndOfMainFile() local
|
| /llvm-project/offload/plugins-nextgen/common/src/Utils/ |
| H A D | ELF.cpp | 109 ArrayRef<typename ELFT::Word> Bucket = HashTab.buckets(); getSymbolFromGnuHashTable() local
148 ArrayRef<typename ELFT::Word> Bucket = HashTab.buckets(); getSymbolFromSysVHashTable() local
|
| /llvm-project/llvm/unittests/Support/ |
| H A D | BalancedPartitioningTest.cpp | 51 auto NodeIs = [](BPFunctionNode::IDT Id, std::optional<uint32_t> Bucket) { in TEST_F()
|
| /llvm-project/clang/lib/AST/ |
| H A D | Randstruct.cpp | 40 class Bucket { global() class
[all...] |
| /llvm-project/clang-tools-extra/test/clang-tidy/checkers/readability/ |
| H A D | magic-numbers.cpp | 39 ValueBucket<int, 66> Bucket; in BuggyFunction() local
124 ValueBucket<int, INT_MACRO> Bucket; in SolidFunction() local
|
| /llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | TpiStream.cpp | 164 if (Bucket > HashMap.size()) in findRecordsByName() local
|
| /llvm-project/clang/lib/Lex/ |
| H A D | HeaderMap.cpp | 206 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in lookupFilename() local
|
| /llvm-project/compiler-rt/lib/ubsan/ |
| H A D | ubsan_type_hash_itanium.cpp | 228 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
|
| /llvm-project/clang-tools-extra/clang-tidy/llvm/ |
| H A D | IncludeOrderCheck.cpp | 112 for (auto &Bucket : IncludeDirectives) { in EndOfMainFile() local
|
| /llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFAcceleratorTable.cpp | 241 for (unsigned Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) { in dump() local
928 for (uint32_t Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) dump() local
977 uint32_t Bucket = *Hash % Hdr.BucketCount; findEntryOffsetInCurrentIndex() local
[all...] |