Searched refs:numEntries (Results 1 - 15 of 15) sorted by relevance

/dalvik/vm/analysis/
H A DRegisterMap.h50 * Size of (format==FormatCompact8): 4 + (1 + regWidth) * numEntries
51 * Size of (format==FormatCompact16): 4 + (2 + regWidth) * numEntries
57 u1 numEntries[2]; /* number of entries */ member in struct:RegisterMap
117 return pMap->numEntries[0] | (pMap->numEntries[1] << 8);
123 INLINE void dvmRegisterMapSetNumEntries(RegisterMap* pMap, u2 numEntries) { argument
124 pMap->numEntries[0] = (u1) numEntries;
125 pMap->numEntries[1] = numEntries >>
[all...]
H A DRegisterMap.cpp403 const int numEntries = dvmRegisterMapGetNumEntries(pMap); local
425 for (ent = 0; ent < numEntries; ent++) {
470 const int numEntries = dvmRegisterMapGetNumEntries(pMap); local
496 for (ent = 0; ent < numEntries; ent++) {
574 u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local
582 return kHeaderSize + (1 + pMap->regWidth) * numEntries;
584 return kHeaderSize + (2 + pMap->regWidth) * numEntries;
899 u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local
901 assert(numEntries > 0);
928 if (numEntries < kSearchThreshol
1252 const u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local
1448 int addrWidth, regWidth, numEntries; local
1700 int regWidth, numEntries, newAddrWidth, newMapSize; local
[all...]
H A DCodeVerify.h149 int numEntries; member in struct:UninitInstanceMap
H A DCodeVerify.cpp448 uninitMap->numEntries = newInstanceCount;
502 /* TODO: binary search when numEntries > 8 */
503 for (idx = uninitMap->numEntries - 1; idx >= 0; idx--) {
528 assert(idx >= 0 && idx < uninitMap->numEntries);
/dalvik/vm/
H A DAtomicCache.cpp40 AtomicCache* dvmAllocAtomicCache(int numEntries) argument
48 newCache->numEntries = numEntries;
51 sizeof(AtomicCacheEntry) * numEntries + CPU_CACHE_WIDTH);
179 pCache->numEntries);
H A DHash.cpp57 pHashTable->numEntries = pHashTable->numDeadEntries = 0;
90 pHashTable->numEntries = 0;
212 pHashTable->numEntries++;
217 if ((pHashTable->numEntries+pHashTable->numDeadEntries) * LOAD_DENOM
228 // pHashTable->numEntries, pHashTable->tableSize,
233 assert(pHashTable->numEntries < pHashTable->tableSize);
264 pHashTable->numEntries--;
302 pHashTable->numEntries--;
391 int numEntries, minProbe, maxProbe, totalProbe; local
394 numEntries
[all...]
H A DAtomicCache.h46 * handle "numEntries" separately in ATOMIC_CACHE_LOOKUP.)
50 int numEntries; /* #of entries, must be power of 2 */ member in struct:AtomicCache
148 AtomicCache* dvmAllocAtomicCache(int numEntries);
H A DHash.h75 int numEntries; /* current #of "live" entries */ member in struct:HashTable
125 return pHashTable->numEntries;
H A DJni.cpp403 int numEntries = self->jniLocalRefTable.capacity(); local
404 // TODO: this isn't quite right, since "numEntries" includes holes
405 return ((kJniLocalRefMax - numEntries) >= capacity);
/dalvik/libdex/
H A DDexFile.cpp185 int mask = pLookup->numEntries-1;
215 int i, numEntries; local
229 numEntries = dexRoundUpPower2(pDexFile->pHeader->classDefsSize * 2);
231 + numEntries * sizeof(pLookup->table[0]);
237 pLookup->numEntries = numEntries;
257 pDexFile->pHeader->classDefsSize, numEntries,
258 (100 * pDexFile->pHeader->classDefsSize) / numEntries,
449 mask = pLookup->numEntries - 1;
H A DZipArchive.cpp186 u4 numEntries = get2LE(eocdPtr + kEOCDNumEntries);
195 if (numEntries == 0) {
200 ALOGV("+++ numEntries=%d dirSize=%d dirOffset=%d",
201 numEntries, dirSize, dirOffset);
214 pArchive->mNumEntries = numEntries;
279 int numEntries = pArchive->mNumEntries; local
286 pArchive->mHashTableSize = dexRoundUpPower2(1 + (numEntries * 4) / 3);
296 for (i = 0; i < numEntries; i++) {
328 ALOGV("+++ zip good scan %d entries", numEntries);
H A DDexFile.h458 int numEntries; // size of table[]; always power of 2 member in struct:DexClassLookup
/dalvik/hit/src/com/android/hit/
H A DArrayInstance.java28 public ArrayInstance(long id, StackTrace stack, int type, int numEntries, argument
33 mNumEntries = numEntries;
H A DHprofParser.java450 int numEntries = in.readUnsignedShort();
453 for (int i = 0; i < numEntries; i++) {
459 numEntries = in.readUnsignedShort();
462 String[] staticFieldNames = new String[numEntries];
463 int[] staticFieldTypes = new int[numEntries];
467 for (int i = 0; i < numEntries; i++) {
481 numEntries = in.readUnsignedShort();
484 String[] names = new String[numEntries];
485 int[] types = new int[numEntries];
487 for (int i = 0; i < numEntries;
[all...]
/dalvik/dexdump/
H A DDexDump.cpp1537 u2 numEntries; local
1541 numEntries = *data++;
1542 numEntries |= (*data++) << 8;
1550 int origLen = 4 + (addrWidth + regWidth) * numEntries;
1555 (addrWidth + regWidth) * numEntries, compressedLen);
1604 u2 numEntries; local
1608 numEntries = *data++;
1609 numEntries |= (*data++) << 8;
1611 for (idx = 0; idx < numEntries; idx++) {

Completed in 138 milliseconds