Searched defs:pHashTable (Results 1 - 2 of 2) sorted by relevance
| /dalvik/vm/ |
| H A D | Hash.h | 103 void dvmHashTableClear(HashTable* pHashTable);
108 void dvmHashTableFree(HashTable* pHashTable);
114 INLINE void dvmHashTableLock(HashTable* pHashTable) { argument
115 dvmLockMutex(&pHashTable->lock);
117 INLINE void dvmHashTableUnlock(HashTable* pHashTable) { argument
118 dvmUnlockMutex(&pHashTable->lock);
124 INLINE int dvmHashTableNumEntries(HashTable* pHashTable) { argument
125 return pHashTable->numEntries;
131 INLINE int dvmHashTableMemUsage(HashTable* pHashTable) { argument
132 return sizeof(HashTable) + pHashTable
184 HashTable* pHashTable; member in struct:HashIter
197 dvmHashIterBegin(HashTable* pHashTable, HashIter* pIter) argument
[all...] |
| H A D | Hash.cpp | 46 HashTable* pHashTable; local
50 pHashTable = (HashTable*) malloc(sizeof(*pHashTable));
51 if (pHashTable == NULL)
54 dvmInitMutex(&pHashTable->lock);
56 pHashTable->tableSize = dexRoundUpPower2(initialSize);
57 pHashTable->numEntries = pHashTable->numDeadEntries = 0;
58 pHashTable->freeFunc = freeFunc;
59 pHashTable
72 dvmHashTableClear(HashTable* pHashTable) argument
97 dvmHashTableFree(HashTable* pHashTable) argument
110 countTombStones(HashTable* pHashTable) argument
132 resizeHash(HashTable* pHashTable, int newSize) argument
174 dvmHashTableLookup(HashTable* pHashTable, u4 itemHash, void* item, HashCompareFunc cmpFunc, bool doAdd) argument
250 dvmHashTableRemove(HashTable* pHashTable, u4 itemHash, void* item) argument
291 dvmHashForeachRemove(HashTable* pHashTable, HashForeachRemoveFunc func) argument
321 dvmHashForeach(HashTable* pHashTable, HashForeachFunc func, void* arg) argument
346 countProbes(HashTable* pHashTable, u4 itemHash, const void* item, HashCompareFunc cmpFunc) argument
392 dvmHashTableProbeCount(HashTable* pHashTable, HashCalcFunc calcFunc, HashCompareFunc cmpFunc) argument
[all...] |
Completed in 206 milliseconds