45   NumBuckets = 0;  in StringMapImpl()
62   NumBuckets = NewNumBuckets;  in init()
66   TheTable[NumBuckets] = (StringMapEntryBase *)2;  in init()
75   unsigned HTSize = NumBuckets;  in LookupBucketFor()
78     HTSize = NumBuckets;  in LookupBucketFor()
82   unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);  in LookupBucketFor()
133   unsigned HTSize = NumBuckets;  in FindKey()
138   unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);  in FindKey()
193   assert(NumItems + NumTombstones <= NumBuckets);  in RemoveKey()
202   unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);  in RehashTable()
207   if (LLVM_UNLIKELY(NumItems * 4 > NumBuckets * 3)) {  in RehashTable()
208     NewSize = NumBuckets * 2;  in RehashTable()
209   } else if (LLVM_UNLIKELY(NumBuckets - (NumItems + NumTombstones) <=  in RehashTable()
210                            NumBuckets / 8)) {  in RehashTable()
211     NewSize = NumBuckets;  in RehashTable()
227   for (unsigned I = 0, E = NumBuckets; I != E; ++I) {  in RehashTable()
258   NumBuckets = NewSize;  in RehashTable()