Searched defs:tableSize (Results 1 - 3 of 3) sorted by relevance

/dalvik/vm/
H A DHash.h74 int tableSize; /* must be power of 2 */ member in struct:HashTable
132 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
189 int lim = pIter->pHashTable->tableSize;
203 return (pIter->idx >= pIter->pHashTable->tableSize);
206 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize);
H A DHash.cpp56 pHashTable->tableSize = dexRoundUpPower2(initialSize);
60 (HashEntry*) calloc(pHashTable->tableSize, sizeof(HashEntry));
78 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) {
114 for (count = i = 0; i < pHashTable->tableSize; i++) {
144 for (i = 0; i < pHashTable->tableSize; i++) {
162 pHashTable->tableSize = newSize;
181 assert(pHashTable->tableSize > 0);
186 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)];
187 pEnd = &pHashTable->pEntries[pHashTable->tableSize];
200 if (pHashTable->tableSize
293 int i, val, tableSize; local
323 int i, val, tableSize; local
[all...]
/dalvik/vm/analysis/
H A DDexVerify.cpp351 u4 valueCount, valueWidth, tableSize; local
380 tableSize = 4 + (valueWidth * valueCount + 1) / 2;
383 if (curOffset + offsetToArrayData + tableSize > insnCount) {
387 curOffset + offsetToArrayData + tableSize, insnCount);
609 u4 switchCount, tableSize; local
650 tableSize = offsetToTargets + switchCount*2;
659 if (curOffset + offsetToSwitch + tableSize > (u4) insnCount) {
662 curOffset, offsetToSwitch, curOffset + offsetToSwitch + tableSize,

Completed in 74 milliseconds