Home
last modified time | relevance | path

Searched refs:FullHashValue (Results 1 – 2 of 2) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DStringMap.cpp87 uint32_t FullHashValue) { in LookupBucketFor() argument
89 assert(FullHashValue == hash(Name)); in LookupBucketFor()
95 FullHashValue = ~FullHashValue; in LookupBucketFor()
96 unsigned BucketNo = FullHashValue & (NumBuckets - 1); in LookupBucketFor()
108 HashTable[FirstTombstone] = FullHashValue; in LookupBucketFor()
112 HashTable[BucketNo] = FullHashValue; in LookupBucketFor()
120 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { in LookupBucketFor()
147 int StringMapImpl::FindKey(StringRef Key, uint32_t FullHashValue) const { in FindKey()
151 assert(FullHashValue == hash(Key)); in FindKey()
154 FullHashValue = ~FullHashValue; in FindKey()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DStringMap.h69 unsigned LookupBucketFor(StringRef Key, uint32_t FullHashValue);
77 int FindKey(StringRef Key, uint32_t FullHashValue) const;
235 iterator find(StringRef Key, uint32_t FullHashValue) { in find() argument
236 int Bucket = FindKey(Key, FullHashValue); in find()
244 const_iterator find(StringRef Key, uint32_t FullHashValue) const { in find() argument
245 int Bucket = FindKey(Key, FullHashValue); in find()
334 uint32_t FullHashValue) { in insert() argument
335 return try_emplace_with_hash(KV.first, FullHashValue, std::move(KV.second)); in insert()
374 uint32_t FullHashValue, in try_emplace_with_hash() argument
376 unsigned BucketNo = LookupBucketFor(Key, FullHashValue); in try_emplace_with_hash()