Searched refs:tableSize (Results 1 – 2 of 2) sorted by relevance
61 pHashTable->tableSize = roundUpPower2(initialSize); in mzHashTableCreate()65 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable)); in mzHashTableCreate()83 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) { in mzHashTableClear()119 for (count = i = 0; i < pHashTable->tableSize; i++) { in countTombStones()149 for (i = 0; i < pHashTable->tableSize; i++) { in resizeHash()167 pHashTable->tableSize = newSize; in resizeHash()186 assert(pHashTable->tableSize > 0); in mzHashTableLookup()191 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)]; in mzHashTableLookup()192 pEnd = &pHashTable->pEntries[pHashTable->tableSize]; in mzHashTableLookup()205 if (pHashTable->tableSize == 1) in mzHashTableLookup()[all …]
62 int tableSize; /* must be power of 2 */ member108 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry); in mzHashTableMemUsage()154 int lim = pIter->pHashTable->tableSize; in mzHashIterNext()168 return (pIter->idx >= pIter->pHashTable->tableSize); in mzHashIterDone()171 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize); in mzHashIterData()