Home
last modified time | relevance | path

Searched refs:pEntries (Results 1 – 4 of 4) sorted by relevance

/dalvik/vm/
DHash.c59 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()
[all …]
DHash.h77 HashEntry* pEntries; /* array on heap */ member
191 void* data = pIter->pHashTable->pEntries[i].data; in dvmHashIterNext()
207 return pIter->pHashTable->pEntries[pIter->idx].data; in dvmHashIterData()
/dalvik/vm/alloc/
DVisit.c45 HashEntry *entry = &table->pEntries[i]; in visitHashTable()
DCopying.c1468 entry = &table->pEntries[i]; in pinHashTableEntries()
1510 entry = &table->pEntries[i]; in scavengeInternedStrings()
1538 entry = &table->pEntries[i]; in pinInternedStrings()