62     pHashTable->tableSize = roundUpPower2(initialSize);  in mzHashTableCreate()
66         (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable));  in mzHashTableCreate()
84     for (i = 0; i < pHashTable->tableSize; i++, pEnt++) {  in mzHashTableClear()
120     for (count = i = 0; i < pHashTable->tableSize; i++) {  in countTombStones()
150     for (i = 0; i < pHashTable->tableSize; i++) {  in resizeHash()
168     pHashTable->tableSize = newSize;  in resizeHash()
187     assert(pHashTable->tableSize > 0);  in mzHashTableLookup()
192     pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize - 1)];  in mzHashTableLookup()
193     pEnd = &pHashTable->pEntries[pHashTable->tableSize];  in mzHashTableLookup()
205             if (pHashTable->tableSize == 1)  in mzHashTableLookup()
223                 > pHashTable->tableSize * LOAD_NUMER) {  in mzHashTableLookup()
224                 if (!resizeHash(pHashTable, pHashTable->tableSize * 2)) {  in mzHashTableLookup()
237             assert(pHashTable->numEntries < pHashTable->tableSize);  in mzHashTableLookup()
259     assert(pHashTable->tableSize > 0);  in mzHashTableRemove()
262     pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize - 1)];  in mzHashTableRemove()
263     pEnd = &pHashTable->pEntries[pHashTable->tableSize];  in mzHashTableRemove()
275             if (pHashTable->tableSize == 1)  in mzHashTableRemove()
295     for (i = 0; i < pHashTable->tableSize; i++) {  in mzHashForeach()
321     assert(pHashTable->tableSize > 0);  in countProbes()
326     pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize - 1)];  in countProbes()
327     pEnd = &pHashTable->pEntries[pHashTable->tableSize];  in countProbes()
338             if (pHashTable->tableSize == 1)  in countProbes()
385          minProbe, maxProbe, totalProbe, numEntries, pHashTable->tableSize,  in mzHashTableProbeCount()