Lines Matching defs:pHashTable
103 void dvmHashTableClear(HashTable* pHashTable);
108 void dvmHashTableFree(HashTable* pHashTable);
114 INLINE void dvmHashTableLock(HashTable* pHashTable) {
115 dvmLockMutex(&pHashTable->lock);
117 INLINE void dvmHashTableUnlock(HashTable* pHashTable) {
118 dvmUnlockMutex(&pHashTable->lock);
124 INLINE int dvmHashTableNumEntries(HashTable* pHashTable) {
125 return pHashTable->numEntries;
131 INLINE int dvmHashTableMemUsage(HashTable* pHashTable) {
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
145 void* dvmHashTableLookup(HashTable* pHashTable, u4 itemHash, void* item,
152 bool dvmHashTableRemove(HashTable* pHashTable, u4 hash, void* item);
159 int dvmHashForeach(HashTable* pHashTable, HashForeachFunc func, void* arg);
169 int dvmHashForeachRemove(HashTable* pHashTable, HashForeachRemoveFunc func);
184 HashTable* pHashTable;
189 int lim = pIter->pHashTable->tableSize;
191 void* data = pIter->pHashTable->pEntries[i].data;
197 INLINE void dvmHashIterBegin(HashTable* pHashTable, HashIter* pIter) {
198 pIter->pHashTable = pHashTable;
203 return (pIter->idx >= pIter->pHashTable->tableSize);
206 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize);
207 return pIter->pHashTable->pEntries[pIter->idx].data;
218 void dvmHashTableProbeCount(HashTable* pHashTable, HashCalcFunc calcFunc,