Lines Matching refs:NumBuckets
42 unsigned NumBuckets) { in getHashTable() argument
43 return reinterpret_cast<unsigned *>(TheTable + NumBuckets + 1); in getHashTable()
60 NumBuckets = 0; in StringMapImpl()
76 NumBuckets = NewNumBuckets; in init()
86 if (NumBuckets == 0) in LookupBucketFor()
91 unsigned BucketNo = FullHashValue & (NumBuckets - 1); in LookupBucketFor()
92 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in LookupBucketFor()
131 BucketNo = (BucketNo + ProbeAmt) & (NumBuckets - 1); in LookupBucketFor()
143 if (NumBuckets == 0) in FindKey()
148 unsigned BucketNo = FullHashValue & (NumBuckets - 1); in FindKey()
149 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in FindKey()
176 BucketNo = (BucketNo + ProbeAmt) & (NumBuckets - 1); in FindKey()
204 assert(NumItems + NumTombstones <= NumBuckets); in RemoveKey()
216 if (LLVM_UNLIKELY(NumItems * 4 > NumBuckets * 3)) { in RehashTable()
217 NewSize = NumBuckets * 2; in RehashTable()
218 } else if (LLVM_UNLIKELY(NumBuckets - (NumItems + NumTombstones) <= in RehashTable()
219 NumBuckets / 8)) { in RehashTable()
220 NewSize = NumBuckets; in RehashTable()
228 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in RehashTable()
232 for (unsigned I = 0, E = NumBuckets; I != E; ++I) { in RehashTable()
256 NumBuckets = NewSize; in RehashTable()