59     pHashTable->pEntries =  in dvmHashTableCreate()
61     if (pHashTable->pEntries == NULL) {  in dvmHashTableCreate()
66     memset(pHashTable->pEntries, 0, pHashTable->tableSize * sizeof(HashEntry));  in dvmHashTableCreate()
78     pEnt = pHashTable->pEntries;  in dvmHashTableClear()
103     free(pHashTable->pEntries);  in dvmHashTableFree()
116         if (pHashTable->pEntries[i].data == HASH_TOMBSTONE)  in countTombStones()
146         void* data = pHashTable->pEntries[i].data;  in resizeHash()
148             int hashValue = pHashTable->pEntries[i].hashValue;  in resizeHash()
161     free(pHashTable->pEntries);  in resizeHash()
162     pHashTable->pEntries = pNewEntries;  in resizeHash()
187     pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];  in dvmHashTableLookup()
188     pEnd = &pHashTable->pEntries[pHashTable->tableSize];  in dvmHashTableLookup()
203             pEntry = pHashTable->pEntries;  in dvmHashTableLookup()
259     pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];  in dvmHashTableRemove()
260     pEnd = &pHashTable->pEntries[pHashTable->tableSize];  in dvmHashTableRemove()
274             pEntry = pHashTable->pEntries;  in dvmHashTableRemove()
297         HashEntry* pEnt = &pHashTable->pEntries[i];  in dvmHashForeachRemove()
325         HashEntry* pEnt = &pHashTable->pEntries[i];  in dvmHashForeach()
355     pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];  in countProbes()
356     pEnd = &pHashTable->pEntries[pHashTable->tableSize];  in countProbes()
370             pEntry = pHashTable->pEntries;  in countProbes()