| /freebsd/contrib/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 | 277 struct Bucket { global() struct
299 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 | 165 auto *Bucket = FindBucketFor(Ptr); in erase_imp() local
191 auto *Bucket = FindBucketFor(Ptr); in find_imp() local
|
| H A D | DenseMap.h | 1274 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) in DenseMapIterator() argument
|
| /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
66 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 | 195 struct Bucket { struct
196 Bucket(const SCEV *B, Instruction *I) in Bucket() function
202 const SCEV *BaseSCEV;
207 SmallVector<BucketElement, 16> Elements;
210 unsigned ChainSize;
213 SmallVector<BucketElement, 16> ChainBases;
529 SmallVector<Bucket, 16> &Buckets) { in chainCommoning()
537 for (auto &Bucket : Buckets) { in chainCommoning() local
549 Loop *L, Bucket &Bucket, SmallSet<BasicBlock *, 16> &BBChanged) { in rewriteLoadStoresForCommoningChains() argument
836 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 | 64 uint32_t Bucket = E.second.HashValue % BucketCount; in finalize() local
71 for (auto &Bucket : Buckets) in finalize() local
253 for (const auto &Bucket : Contents.getBuckets()) { in emitHashes() local
333 for (const AccelTableBase::HashList &Bucket : Buckets) { in emitData() local
431 for (auto &Bucket : Contents.getBuckets()) { in populateAbbrevsMap() local
487 for (const auto &Bucket : enumerate(Contents.getBuckets())) { in emitBuckets() local
495 for (const auto &Bucket : enumerate(Contents.getBuckets())) { in emitStringOffsets() local
586 for (auto &Bucket : Contents.getBuckets()) { in emitData() local
614 for (auto &Bucket : Contents.getBuckets()) in Dwarf5AccelTableWriter() local
804 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
|
| /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 | 76 std::optional<unsigned> Bucket; variable
|
| H A D | GenericDomTreeConstruction.h | 624 Bucket; member
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | Randstruct.cpp | 40 class Bucket { class
|
| /freebsd/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/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 | 1284 uint32_t Bucket; in verifyNameIndexBuckets() member
1303 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { in verifyNameIndexBuckets() local
|
| /freebsd/contrib/llvm-project/clang/lib/AST/Interp/ |
| H A D | Descriptor.cpp | 402 unsigned Bucket = I / PER_FIELD; in initializeElement() local
412 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 | 431 for (const auto &Bucket : Buckets) { in buildMatchers() local
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ObjectYAML/ |
| H A D | ELFYAML.h | 420 std::optional<std::vector<uint32_t>> Bucket; member
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-readobj/ |
| H A D | ELFDumper.cpp | 4325 uint32_t Bucket) { in printHashedSymbol()
7651 DictScope Bucket(W, BucketName); in printHashHistogramStats() local
|