| /dalvik/vm/analysis/ |
| D | RegisterMap.h | 57 u1 numEntries[2]; /* number of entries */ member
117 return pMap->numEntries[0] | (pMap->numEntries[1] << 8); in dvmRegisterMapGetNumEntries()
123 INLINE void dvmRegisterMapSetNumEntries(RegisterMap* pMap, u2 numEntries) { in dvmRegisterMapSetNumEntries() argument
124 pMap->numEntries[0] = (u1) numEntries; in dvmRegisterMapSetNumEntries()
125 pMap->numEntries[1] = numEntries >> 8; in dvmRegisterMapSetNumEntries()
|
| D | RegisterMap.c | 401 const int numEntries = dvmRegisterMapGetNumEntries(pMap); in dumpRegisterMap() local
423 for (ent = 0; ent < numEntries; ent++) { in dumpRegisterMap()
468 const int numEntries = dvmRegisterMapGetNumEntries(pMap); in verifyMap() local
494 for (ent = 0; ent < numEntries; ent++) { in verifyMap()
572 u2 numEntries = dvmRegisterMapGetNumEntries(pMap); in computeRegisterMapSize() local
580 return kHeaderSize + (1 + pMap->regWidth) * numEntries; in computeRegisterMapSize()
582 return kHeaderSize + (2 + pMap->regWidth) * numEntries; in computeRegisterMapSize()
897 u2 numEntries = dvmRegisterMapGetNumEntries(pMap); in dvmRegisterMapGetLine() local
899 assert(numEntries > 0); in dvmRegisterMapGetLine()
926 if (numEntries < kSearchThreshold) { in dvmRegisterMapGetLine()
[all …]
|
| D | CodeVerify.h | 114 int numEntries; member
|
| D | CodeVerify.c | 396 uninitMap->numEntries = newInstanceCount; in dvmCreateUninitInstanceMap()
446 for (idx = uninitMap->numEntries - 1; idx >= 0; idx--) { in dvmSetUninitInstance()
470 assert(idx >= 0 && idx < uninitMap->numEntries); in dvmGetUninitInstance()
|
| /dalvik/vm/ |
| D | AtomicCache.c | 40 AtomicCache* dvmAllocAtomicCache(int numEntries) in dvmAllocAtomicCache() argument
48 newCache->numEntries = numEntries; in dvmAllocAtomicCache()
51 sizeof(AtomicCacheEntry) * numEntries + CPU_CACHE_WIDTH); in dvmAllocAtomicCache()
179 pCache->numEntries); in dvmDumpAtomicCacheStats()
|
| D | Hash.c | 57 pHashTable->numEntries = pHashTable->numDeadEntries = 0; in dvmHashTableCreate()
91 pHashTable->numEntries = 0; in dvmHashTableClear()
213 pHashTable->numEntries++; in dvmHashTableLookup()
218 if ((pHashTable->numEntries+pHashTable->numDeadEntries) * LOAD_DENOM in dvmHashTableLookup()
234 assert(pHashTable->numEntries < pHashTable->tableSize); in dvmHashTableLookup()
265 pHashTable->numEntries--; in dvmHashTableRemove()
303 pHashTable->numEntries--; in dvmHashForeachRemove()
392 int numEntries, minProbe, maxProbe, totalProbe; in dvmHashTableProbeCount() local
395 numEntries = maxProbe = totalProbe = 0; in dvmHashTableProbeCount()
406 numEntries++; in dvmHashTableProbeCount()
[all …]
|
| D | AtomicCache.h | 50 int numEntries; /* #of entries, must be power of 2 */ member
148 AtomicCache* dvmAllocAtomicCache(int numEntries);
|
| D | Hash.h | 75 int numEntries; /* current #of "live" entries */ member
125 return pHashTable->numEntries; in dvmHashTableNumEntries()
|
| D | Jni.c | 682 int numEntries = dvmIndirectRefTableEntries(pRefTable); in ensureLocalCapacity() local
684 return ((kJniLocalRefMax - numEntries) >= capacity); in ensureLocalCapacity()
1112 int numEntries = dvmIndirectRefTableEntries(pRefTable); in dvmGcMarkJniGlobalRefs() local
1115 for (i = 0; i < numEntries; i++) { in dvmGcMarkJniGlobalRefs()
|
| D | Thread.c | 4115 int numEntries = dvmIndirectRefTableEntries(pRefTable); in gcScanIndirectRefTable() local
4118 for (i = 0; i < numEntries; i++) { in gcScanIndirectRefTable()
|
| /dalvik/hit/src/com/android/hit/ |
| D | HprofParser.java | 450 int numEntries = in.readUnsignedShort(); in loadClassDump() local
453 for (int i = 0; i < numEntries; i++) { in loadClassDump()
459 numEntries = in.readUnsignedShort(); in loadClassDump()
462 String[] staticFieldNames = new String[numEntries]; in loadClassDump()
463 int[] staticFieldTypes = new int[numEntries]; in loadClassDump()
467 for (int i = 0; i < numEntries; i++) { in loadClassDump()
481 numEntries = in.readUnsignedShort(); in loadClassDump()
484 String[] names = new String[numEntries]; in loadClassDump()
485 int[] types = new int[numEntries]; in loadClassDump()
487 for (int i = 0; i < numEntries; i++) { in loadClassDump()
|
| D | ArrayInstance.java | 28 public ArrayInstance(long id, StackTrace stack, int type, int numEntries, in ArrayInstance() argument
33 mNumEntries = numEntries; in ArrayInstance()
|
| /dalvik/libdex/ |
| D | ZipArchive.c | 219 u4 numEntries = get2LE(eocdPtr + kEOCDNumEntries); in mapCentralDirectory() local
228 if (numEntries == 0) { in mapCentralDirectory()
234 numEntries, dirSize, dirOffset); in mapCentralDirectory()
247 pArchive->mNumEntries = numEntries; in mapCentralDirectory()
268 int numEntries = pArchive->mNumEntries; in parseZipArchive() local
275 pArchive->mHashTableSize = dexRoundUpPower2(1 + (numEntries * 4) / 3); in parseZipArchive()
285 for (i = 0; i < numEntries; i++) { in parseZipArchive()
317 LOGV("+++ zip good scan %d entries\n", numEntries); in parseZipArchive()
|
| D | DexFile.c | 365 int mask = pLookup->numEntries-1; in classLookupAdd()
413 int i, numEntries; in dexCreateClassLookup() local
427 numEntries = dexRoundUpPower2(pDexFile->pHeader->classDefsSize * 2); in dexCreateClassLookup()
429 + numEntries * sizeof(pLookup->table[0]); in dexCreateClassLookup()
435 pLookup->numEntries = numEntries; in dexCreateClassLookup()
455 pDexFile->pHeader->classDefsSize, numEntries, in dexCreateClassLookup()
456 (100 * pDexFile->pHeader->classDefsSize) / numEntries, in dexCreateClassLookup()
656 mask = pLookup->numEntries - 1; in dexFindClass()
|
| D | DexFile.h | 435 int numEntries; // size of table[]; always power of 2 member
|
| /dalvik/dexdump/ |
| D | DexDump.c | 1518 u2 numEntries; in dumpDifferentialCompressedMap() local
1522 numEntries = *data++; in dumpDifferentialCompressedMap()
1523 numEntries |= (*data++) << 8; in dumpDifferentialCompressedMap()
1531 int origLen = 4 + (addrWidth + regWidth) * numEntries; in dumpDifferentialCompressedMap()
1536 (addrWidth + regWidth) * numEntries, compressedLen); in dumpDifferentialCompressedMap()
1585 u2 numEntries; in dumpMethodMap() local
1589 numEntries = *data++; in dumpMethodMap()
1590 numEntries |= (*data++) << 8; in dumpMethodMap()
1592 for (idx = 0; idx < numEntries; idx++) { in dumpMethodMap()
|