| /freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | StringMap.h | 153 StringMapEntryBase *Bucket = RHS.TheTable[I]; StringMap() local
185 StringMapEntryBase *Bucket = TheTable[I]; ~StringMap() local
219 int Bucket = FindKey(Key); find() local
226 int Bucket = FindKey(Key); find() local
289 StringMapEntryBase *&Bucket = TheTable[BucketNo]; insert() local
343 StringMapEntryBase *&Bucket = TheTable[BucketNo]; try_emplace() local
367 StringMapEntryBase *&Bucket = TheTable[I]; clear() local
409 Ptr(Bucket) Ptr() argument
453 base(Bucket,NoAdvance) base() argument
470 base(Bucket,NoAdvance) base() argument
[all...] |
| H A D | ConcurrentHashtable.h | 276 struct Bucket { struct
298 void RehashBucket(Bucket &CurBucket) { in RehashBucket() argument
|
| H A D | FoldingSet.h | 712 FoldingSetIteratorImpl(void **Bucket); in FoldingSetIterator() argument
741 FoldingSetBucketIteratorImpl(void ** Bucket,bool) FoldingSetBucketIteratorImpl() argument
761 FoldingSetBucketIterator(void ** Bucket) FoldingSetBucketIterator() argument
764 FoldingSetBucketIterator(void ** Bucket,bool) FoldingSetBucketIterator() argument
[all...] |
| H A D | SmallPtrSet.h | 188 auto *Bucket = FindBucketFor(Ptr); find_imp() local
[all...] |
| H A D | DenseMap.h | 1258 DenseMapIterator(const DenseMapIterator<KeyT,ValueT,KeyInfoT,Bucket,IsConstSrc> & I) DenseMapIterator() argument
|
| /freebsd-src/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
66 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor() local
|
| H A D | StringMap.cpp | 196 int Bucket = FindKey(Key); RemoveKey() local
233 StringMapEntryBase *Bucket = TheTable[I]; RehashTable() local
|
| /freebsd-src/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 195 struct Bucket { struct
196 Bucket(const SCEV *B, Instruction *I) in Bucket() argument
202 BaseSCEV__anon5d2d199f0111::Bucket global() argument
207 Elements__anon5d2d199f0111::Bucket global() argument
210 ChainSize__anon5d2d199f0111::Bucket global() argument
213 ChainBases__anon5d2d199f0111::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
831 addOneCandidate(Instruction * MemI,const SCEV * LSCEV,SmallVector<Bucket,16> & Buckets,std::function<bool (const SCEV *)> isValidDiff,unsigned MaxCandidateNum) addOneCandidate() argument
1092 updateFormPrep(Loop * L,SmallVector<Bucket,16> & Buckets) updateFormPrep() argument
1097 for (auto &Bucket : Buckets) updateFormPrep() local
1110 dispFormPrep(Loop * L,SmallVector<Bucket,16> & Buckets,PrepForm Form) dispFormPrep() argument
1118 for (auto &Bucket : Buckets) { dispFormPrep() local
[all...] |
| /freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | AccelTable.cpp | 76 uint32_t Bucket = E.second.HashValue % BucketCount; finalize() local
83 for (auto &Bucket : Buckets) finalize() local
257 for (const auto &Bucket : Contents.getBuckets()) { emitHashes() local
337 for (const AccelTableBase::HashList &Bucket : Buckets) { emitData() local
471 for (auto &Bucket : Contents.getBuckets()) { populateAbbrevsMap() local
519 for (const auto &Bucket : enumerate(Contents.getBuckets())) { emitBuckets() local
527 for (const auto &Bucket : enumerate(Contents.getBuckets())) { emitStringOffsets() local
624 for (auto &Bucket : Contents.getBuckets()) { emitData() local
652 for (auto &Bucket : Contents.getBuckets()) Dwarf5AccelTableWriter() local
842 for (const auto &Bucket : Buckets) print() local
[all...] |
| /freebsd-src/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
|
| /freebsd-src/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; global() variable
[all...] |
| H A D | ArrayRecycler.h | 39 SmallVector<FreeList*, 8> Bucket; variable
|
| H A D | BalancedPartitioning.h | 76 std::optional<unsigned> Bucket; variable
|
| H A D | GenericDomTreeConstruction.h | 638 Bucket; global() member
|
| /freebsd-src/contrib/llvm-project/clang/include/clang/Lex/ |
| H A D | HeaderMap.h | 48 for (unsigned Bucket = 0; Bucket < NumBuckets; ++Bucket) { in forEachKey() local
|
| /freebsd-src/contrib/llvm-project/clang/lib/AST/ |
| H A D | Randstruct.cpp | 40 class Bucket { class
|
| /freebsd-src/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | TpiStream.cpp | 164 uint32_t Bucket = hashStringV1(Name) % Header->NumHashBuckets; in findRecordsByName() local
|
| /freebsd-src/contrib/llvm-project/clang/lib/Lex/ |
| H A D | HeaderMap.cpp | 206 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in lookupFilename() local
|
| /freebsd-src/contrib/llvm-project/compiler-rt/lib/ubsan/ |
| H A D | ubsan_type_hash_itanium.cpp | 228 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
|
| /freebsd-src/contrib/llvm-project/clang/lib/AST/Interp/ |
| H A D | Descriptor.cpp | 336 unsigned Bucket = I / PER_FIELD; initializeElement() local
346 unsigned Bucket = I / PER_FIELD; isElementInitialized() local
|
| /freebsd-src/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFAcceleratorTable.cpp | 241 for (unsigned Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) { in dump() local
846 for (uint32_t Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) dump() local
895 uint32_t Bucket = *Hash % Hdr.BucketCount; findEntryOffsetInCurrentIndex() local
[all...] |
| H A D | DWARFVerifier.cpp | 1148 uint32_t Bucket; verifyNameIndexBuckets() member
1167 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { verifyNameIndexBuckets() local
[all...] |
| /freebsd-src/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-src/contrib/llvm-project/clang/lib/Tooling/Transformer/ |
| H A D | RewriteRule.cpp | 431 for (const auto &Bucket : Buckets) { in buildMatchers() local
|