| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | StringMap.h | 170 StringMapEntryBase *Bucket = RHS.TheTable[I]; in StringMap() local
202 StringMapEntryBase *Bucket = TheTable[I]; in ~StringMap() local
237 int Bucket = FindKey(Key, FullHashValue); in find() local
246 int Bucket = FindKey(Key, FullHashValue); in find() local
311 StringMapEntryBase *&Bucket = TheTable[BucketNo]; in insert() local
378 StringMapEntryBase *&Bucket = TheTable[BucketNo]; in try_emplace_with_hash() local
402 StringMapEntryBase *&Bucket = TheTable[I]; in clear() local
444 : Ptr(Bucket) { in Ptr() argument
488 : base(Bucket, NoAdvance) {} in base() argument
505 : base(Bucket, NoAdvance) {} in base() argument
|
| H A D | ConcurrentHashtable.h | 277 struct Bucket { struct
299 void RehashBucket(Bucket &CurBucket) { in RehashBucket() argument
|
| H A D | DenseMap.h | 177 if (BucketT *Bucket = doFind(Val)) in find() local
184 if (const BucketT *Bucket = doFind(Val)) in find() local
197 if (BucketT *Bucket = doFind(Val)) in find_as() local
205 if (const BucketT *Bucket = doFind(Val)) in find_as() local
215 if (const BucketT *Bucket = doFind(Val)) in lookup() local
225 if (const BucketT *Bucket = doFind(Val)) in lookup_or() local
660 BucketT *Bucket = BucketsPtr + BucketNo; in doFind() local
1278 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) in DenseMapIterator() argument
|
| H A D | FoldingSet.h | 730 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator()
759 FoldingSetBucketIteratorImpl(void **Bucket, bool) : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl()
779 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator()
782 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator()
|
| H A D | SmallPtrSet.h | 191 auto *Bucket = doFind(Ptr); in erase_imp() local
218 if (auto *Bucket = doFind(Ptr)) in find_imp() local
|
| /freebsd/contrib/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
70 const void *const *Bucket = CurArray + BucketNo; in doFind() local
84 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor() local
|
| H A D | StringMap.cpp | 203 int Bucket = FindKey(Key); in RemoveKey() local
240 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 192 struct Bucket { struct
193 Bucket(const SCEV *B, Instruction *I) in Bucket() argument
199 const SCEV *BaseSCEV;
204 SmallVector<BucketElement, 16> Elements;
207 unsigned ChainSize;
210 SmallVector<BucketElement, 16> ChainBases;
520 SmallVector<Bucket, 16> &Buckets) { in chainCommoning()
528 for (auto &Bucket : Buckets) { in chainCommoning() local
540 Loop *L, Bucket &Bucket, SmallSet<BasicBlock *, 16> &BBChanged) { in rewriteLoadStoresForCommoningChains() argument
827 Instruction *MemI, const SCEV *LSCEV, SmallVector<Bucket, 16> &Buckets, in addOneCandidate()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | AccelTable.cpp | 63 uint32_t Bucket = E.second.HashValue % BucketCount; in finalize() local
70 for (auto &Bucket : Buckets) in finalize() local
252 for (const auto &Bucket : Contents.getBuckets()) { in emitHashes() local
332 for (const AccelTableBase::HashList &Bucket : Buckets) { in emitData() local
430 for (auto &Bucket : Contents.getBuckets()) { in populateAbbrevsMap() local
486 for (const auto &Bucket : enumerate(Contents.getBuckets())) { in emitBuckets() local
494 for (const auto &Bucket : enumerate(Contents.getBuckets())) { in emitStringOffsets() local
585 for (auto &Bucket : Contents.getBuckets()) { in emitData() local
613 for (auto &Bucket : Contents.getBuckets()) in Dwarf5AccelTableWriter() local
803 for (const auto &Bucket : Buckets) in print() local
|
| /freebsd/contrib/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
|
| H A D | sanitizer_dense_map.h | 98 if (const BucketT *Bucket = doFind(Key)) in lookup() local
446 BucketT *Bucket = BucketsPtr + BucketNo; in doFind() local
|
| /freebsd/contrib/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 | 77 std::optional<unsigned> Bucket; variable
|
| H A D | GenericDomTreeConstruction.h | 640 Bucket; member
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | Randstruct.cpp | 38 class Bucket { class
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | TpiStream.cpp | 163 uint32_t Bucket = hashStringV1(Name) % Header->NumHashBuckets; in findRecordsByName() local
|
| /freebsd/contrib/llvm-project/clang/lib/Lex/ |
| H A D | HeaderMap.cpp | 209 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in lookupFilename() local
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/ubsan/ |
| H A D | ubsan_type_hash_itanium.cpp | 228 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
|
| /freebsd/contrib/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) in dump() local
977 uint32_t Bucket = *Hash % Hdr.BucketCount; in findEntryOffsetInCurrentIndex() local
|
| H A D | DWARFVerifier.cpp | 1307 uint32_t Bucket; in verifyNameIndexBuckets() member
1326 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { in verifyNameIndexBuckets() local
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ByteCode/ |
| H A D | Descriptor.cpp | 528 unsigned Bucket = I / PER_FIELD; in initializeElement() local
538 unsigned Bucket = I / PER_FIELD; in isElementInitialized() local
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 225 for (auto &Bucket : Blocks) { in getAllReachingDefs() local
238 auto &Bucket = Blocks[MBB]; in getAllReachingDefs() local
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/Transformer/ |
| H A D | RewriteRule.cpp | 430 for (const auto &Bucket : Buckets) { in buildMatchers() local
|