Lines Matching refs:NumBuckets
41 unsigned NumBuckets) { in getHashTable() argument
42 return reinterpret_cast<unsigned *>(TheTable + NumBuckets + 1); in getHashTable()
59 NumBuckets = 0; in StringMapImpl()
75 NumBuckets = NewNumBuckets; in init()
85 if (NumBuckets == 0) in LookupBucketFor()
88 unsigned BucketNo = FullHashValue & (NumBuckets - 1); in LookupBucketFor()
89 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in LookupBucketFor()
128 BucketNo = (BucketNo + ProbeAmt) & (NumBuckets - 1); in LookupBucketFor()
140 if (NumBuckets == 0) in FindKey()
143 unsigned BucketNo = FullHashValue & (NumBuckets - 1); in FindKey()
144 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in FindKey()
171 BucketNo = (BucketNo + ProbeAmt) & (NumBuckets - 1); in FindKey()
199 assert(NumItems + NumTombstones <= NumBuckets); in RemoveKey()
211 if (LLVM_UNLIKELY(NumItems * 4 > NumBuckets * 3)) { in RehashTable()
212 NewSize = NumBuckets * 2; in RehashTable()
213 } else if (LLVM_UNLIKELY(NumBuckets - (NumItems + NumTombstones) <= in RehashTable()
214 NumBuckets / 8)) { in RehashTable()
215 NewSize = NumBuckets; in RehashTable()
223 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in RehashTable()
227 for (unsigned I = 0, E = NumBuckets; I != E; ++I) { in RehashTable()
251 NumBuckets = NewSize; in RehashTable()