• Home
  • Raw
  • Download

Lines Matching refs:tableSize

56     pHashTable->tableSize = dexRoundUpPower2(initialSize);  in dvmHashTableCreate()
60 (HashEntry*) malloc(pHashTable->tableSize * sizeof(HashEntry)); in dvmHashTableCreate()
66 memset(pHashTable->pEntries, 0, pHashTable->tableSize * sizeof(HashEntry)); in dvmHashTableCreate()
79 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) { in dvmHashTableClear()
115 for (count = i = 0; i < pHashTable->tableSize; i++) { in countTombStones()
145 for (i = 0; i < pHashTable->tableSize; i++) { in resizeHash()
163 pHashTable->tableSize = newSize; in resizeHash()
182 assert(pHashTable->tableSize > 0); in dvmHashTableLookup()
187 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)]; in dvmHashTableLookup()
188 pEnd = &pHashTable->pEntries[pHashTable->tableSize]; in dvmHashTableLookup()
201 if (pHashTable->tableSize == 1) in dvmHashTableLookup()
219 > pHashTable->tableSize * LOAD_NUMER) in dvmHashTableLookup()
221 if (!resizeHash(pHashTable, pHashTable->tableSize * 2)) { in dvmHashTableLookup()
234 assert(pHashTable->numEntries < pHashTable->tableSize); in dvmHashTableLookup()
256 assert(pHashTable->tableSize > 0); in dvmHashTableRemove()
259 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)]; in dvmHashTableRemove()
260 pEnd = &pHashTable->pEntries[pHashTable->tableSize]; in dvmHashTableRemove()
272 if (pHashTable->tableSize == 1) in dvmHashTableRemove()
296 for (i = 0; i < pHashTable->tableSize; i++) { in dvmHashForeachRemove()
324 for (i = 0; i < pHashTable->tableSize; i++) { in dvmHashForeach()
350 assert(pHashTable->tableSize > 0); in countProbes()
355 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)]; in countProbes()
356 pEnd = &pHashTable->pEntries[pHashTable->tableSize]; in countProbes()
368 if (pHashTable->tableSize == 1) in countProbes()
416 minProbe, maxProbe, totalProbe, numEntries, pHashTable->tableSize, in dvmHashTableProbeCount()