45   NumBuckets = 0;  in StringMapImpl()
53   NumBuckets = InitSize ? InitSize : 16;  in init()
57   TheTable = (StringMapEntryBase **)calloc(NumBuckets+1,  in init()
63   TheTable[NumBuckets] = (StringMapEntryBase*)2;  in init()
73   unsigned HTSize = NumBuckets;  in LookupBucketFor()
76     HTSize = NumBuckets;  in LookupBucketFor()
80   unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);  in LookupBucketFor()
131   unsigned HTSize = NumBuckets;  in FindKey()
135   unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);  in FindKey()
189   assert(NumItems + NumTombstones <= NumBuckets);  in RemoveKey()
200   unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);  in RehashTable()
205   if (LLVM_UNLIKELY(NumItems * 4 > NumBuckets * 3)) {  in RehashTable()
206     NewSize = NumBuckets*2;  in RehashTable()
207   } else if (LLVM_UNLIKELY(NumBuckets - (NumItems + NumTombstones) <=  in RehashTable()
208                            NumBuckets / 8)) {  in RehashTable()
209     NewSize = NumBuckets;  in RehashTable()
225   for (unsigned I = 0, E = NumBuckets; I != E; ++I) {  in RehashTable()
256   NumBuckets = NewSize;  in RehashTable()