42                                      unsigned NumBuckets) {  in getHashTable()  argument
43   return reinterpret_cast<unsigned *>(TheTable + NumBuckets + 1);  in getHashTable()
62   NumBuckets = 0;  in StringMapImpl()
78   NumBuckets = NewNumBuckets;  in init()
92   if (NumBuckets == 0)  in LookupBucketFor()
96   unsigned BucketNo = FullHashValue & (NumBuckets - 1);  in LookupBucketFor()
97   unsigned *HashTable = getHashTable(TheTable, NumBuckets);  in LookupBucketFor()
136     BucketNo = (BucketNo + ProbeAmt) & (NumBuckets - 1);  in LookupBucketFor()
148   if (NumBuckets == 0)  in FindKey()
155   unsigned BucketNo = FullHashValue & (NumBuckets - 1);  in FindKey()
156   unsigned *HashTable = getHashTable(TheTable, NumBuckets);  in FindKey()
183     BucketNo = (BucketNo + ProbeAmt) & (NumBuckets - 1);  in FindKey()
211   assert(NumItems + NumTombstones <= NumBuckets);  in RemoveKey()
223   if (LLVM_UNLIKELY(NumItems * 4 > NumBuckets * 3)) {  in RehashTable()
224     NewSize = NumBuckets * 2;  in RehashTable()
225   } else if (LLVM_UNLIKELY(NumBuckets - (NumItems + NumTombstones) <=  in RehashTable()
226                            NumBuckets / 8)) {  in RehashTable()
227     NewSize = NumBuckets;  in RehashTable()
235   unsigned *HashTable = getHashTable(TheTable, NumBuckets);  in RehashTable()
239   for (unsigned I = 0, E = NumBuckets; I != E; ++I) {  in RehashTable()
263   NumBuckets = NewSize;  in RehashTable()