Lines Matching defs:tableSize
56 pHashTable->tableSize = dexRoundUpPower2(initialSize);
60 (HashEntry*) calloc(pHashTable->tableSize, sizeof(HashEntry));
78 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) {
114 for (count = i = 0; i < pHashTable->tableSize; i++) {
144 for (i = 0; i < pHashTable->tableSize; i++) {
162 pHashTable->tableSize = newSize;
181 assert(pHashTable->tableSize > 0);
186 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];
187 pEnd = &pHashTable->pEntries[pHashTable->tableSize];
200 if (pHashTable->tableSize == 1)
218 > pHashTable->tableSize * LOAD_NUMER)
220 if (!resizeHash(pHashTable, pHashTable->tableSize * 2)) {
228 // pHashTable->numEntries, pHashTable->tableSize,
229 // (pHashTable->tableSize * LOAD_NUMER) / LOAD_DENOM);
233 assert(pHashTable->numEntries < pHashTable->tableSize);
255 assert(pHashTable->tableSize > 0);
258 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];
259 pEnd = &pHashTable->pEntries[pHashTable->tableSize];
271 if (pHashTable->tableSize == 1)
293 int i, val, tableSize;
295 tableSize = pHashTable->tableSize;
297 for (i = 0; i < tableSize; i++) {
323 int i, val, tableSize;
325 tableSize = pHashTable->tableSize;
327 for (i = 0; i < tableSize; i++) {
353 assert(pHashTable->tableSize > 0);
358 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];
359 pEnd = &pHashTable->pEntries[pHashTable->tableSize];
371 if (pHashTable->tableSize == 1)
419 minProbe, maxProbe, totalProbe, numEntries, pHashTable->tableSize,