Searched refs:tableSize (Results 1 – 7 of 7) sorted by relevance
| /dalvik/vm/ |
| D | Hash.cpp | 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()
[all …]
|
| D | Hash.h | 74 int tableSize; /* must be power of 2 */ member
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry); in dvmHashTableMemUsage()
189 int lim = pIter->pHashTable->tableSize; in dvmHashIterNext()
203 return (pIter->idx >= pIter->pHashTable->tableSize); in dvmHashIterDone()
206 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize); in dvmHashIterData()
|
| /dalvik/vm/analysis/ |
| D | DexVerify.cpp | 351 u4 valueCount, valueWidth, tableSize; in checkArrayData() local
380 tableSize = 4 + (valueWidth * valueCount + 1) / 2; in checkArrayData()
383 if (curOffset + offsetToArrayData + tableSize > insnCount) { in checkArrayData()
387 curOffset + offsetToArrayData + tableSize, insnCount); in checkArrayData()
609 u4 switchCount, tableSize; in checkSwitchTargets() local
650 tableSize = offsetToTargets + switchCount*2; in checkSwitchTargets()
659 if (curOffset + offsetToSwitch + tableSize > (u4) insnCount) { in checkSwitchTargets()
662 curOffset, offsetToSwitch, curOffset + offsetToSwitch + tableSize, in checkSwitchTargets()
|
| /dalvik/dx/src/com/android/dx/dex/file/ |
| D | CatchStructs.java | 200 int tableSize = table.size(); in writeTo() local
201 for (int i = 0; i < tableSize; i++) { in writeTo()
|
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| D | CatchStructs.java | 202 int tableSize = table.size(); in writeTo() local
203 for (int i = 0; i < tableSize; i++) { in writeTo()
|
| /dalvik/vm/alloc/ |
| D | Visit.cpp | 42 for (int i = 0; i < table->tableSize; ++i) { in visitHashTable()
|
| D | Copying.cpp | 1417 for (int i = 0; i < table->tableSize; ++i) { in pinHashTableEntries()
1451 for (int i = 0; i < table->tableSize; ++i) { in scavengeInternedStrings()
1474 for (int i = 0; i < table->tableSize; ++i) { in pinInternedStrings()
|