/dalvik/vm/analysis/ |
H A D | RegisterMap.h | 50 * 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 D | RegisterMap.c | 400 const int numEntries = dvmRegisterMapGetNumEntries(pMap); local 422 for (ent = 0; ent < numEntries; ent++) { 467 const int numEntries = dvmRegisterMapGetNumEntries(pMap); local 494 for (ent = 0; ent < numEntries; ent++) { 573 u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local 581 return kHeaderSize + (1 + pMap->regWidth) * numEntries; 583 return kHeaderSize + (2 + pMap->regWidth) * numEntries; 898 u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local 900 assert(numEntries > 0); 927 if (numEntries < kSearchThreshol 1251 const u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local 1449 int addrWidth, regWidth, numEntries; local 1705 int regWidth, numEntries, newAddrWidth, newMapSize; local [all...] |
H A D | CodeVerify.h | 216 int numEntries; member in struct:UninitInstanceMap
|
H A D | CodeVerify.c | 393 uninitMap->numEntries = newInstanceCount; 442 /* TODO: binary search when numEntries > 8 */ 443 for (idx = uninitMap->numEntries - 1; idx >= 0; idx--) { 467 assert(idx >= 0 && idx < uninitMap->numEntries);
|
/dalvik/vm/ |
H A D | AtomicCache.c | 39 AtomicCache* dvmAllocAtomicCache(int numEntries) argument 47 newCache->numEntries = numEntries; 50 sizeof(AtomicCacheEntry) * numEntries + CPU_CACHE_WIDTH); 171 pCache->numEntries);
|
H A D | Hash.c | 57 pHashTable->numEntries = pHashTable->numDeadEntries = 0; 91 pHashTable->numEntries = 0; 213 pHashTable->numEntries++; 218 if ((pHashTable->numEntries+pHashTable->numDeadEntries) * LOAD_DENOM 229 // pHashTable->numEntries, pHashTable->tableSize, 234 assert(pHashTable->numEntries < pHashTable->tableSize); 265 pHashTable->numEntries--; 303 pHashTable->numEntries--; 392 int numEntries, minProbe, maxProbe, totalProbe; local 395 numEntries [all...] |
H A D | AtomicCache.h | 46 * handle "numEntries" separately in ATOMIC_CACHE_LOOKUP.) 50 int numEntries; /* #of entries, must be power of 2 */ member in struct:AtomicCache 150 AtomicCache* dvmAllocAtomicCache(int numEntries);
|
H A D | Hash.h | 75 int numEntries; /* current #of "live" entries */ member in struct:HashTable 125 return pHashTable->numEntries;
|
H A D | Jni.c | 682 int numEntries = dvmIndirectRefTableEntries(pRefTable); local 683 // TODO: this isn't quite right, since "numEntries" includes holes 684 return ((kJniLocalRefMax - numEntries) >= capacity); 1161 int numEntries = dvmIndirectRefTableEntries(pRefTable); local 1164 for (i = 0; i < numEntries; i++) {
|
H A D | Thread.c | 4000 int numEntries = dvmIndirectRefTableEntries(pRefTable); local 4003 for (i = 0; i < numEntries; i++) {
|
/dalvik/libcore/luni/src/main/java/java/lang/ |
H A D | VMClassLoader.java | 38 int numEntries = getBootClassPathSize(); 41 for (i = 0; i < numEntries; i++) { 62 int numEntries = getBootClassPathSize(); 65 for (i = 0; i < numEntries; i++) {
|
/dalvik/libcore/luni/src/main/java/org/apache/harmony/luni/internal/util/ |
H A D | ZoneInfoDB.java | 108 int numEntries = 111 char[] namebuf = new char[numEntries * TZNAME_LENGTH]; 112 int[] nameend = new int[numEntries]; 115 starts = new int[numEntries]; 116 lengths = new int[numEntries]; 117 offsets = new int[numEntries]; 119 for (int i = 0; i < numEntries; i++) { 140 names = new String[numEntries]; 141 for (int i = 0; i < numEntries; i++) {
|
/dalvik/hit/src/com/android/hit/ |
H A D | ArrayInstance.java | 28 public ArrayInstance(long id, StackTrace stack, int type, int numEntries, argument 33 mNumEntries = numEntries;
|
H A D | HprofParser.java | 450 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/libdex/ |
H A D | ZipArchive.c | 153 unsigned int i, numEntries, cdOffset; local 197 numEntries = get2LE(ptr + kEOCDNumEntries); 204 LOGV("+++ numEntries=%d cdOffset=%d\n", numEntries, cdOffset); 205 if (numEntries == 0 || cdOffset >= length) { 207 numEntries, cdOffset, length); 216 pArchive->mNumEntries = numEntries; 217 pArchive->mHashTableSize = dexRoundUpPower2(1 + (numEntries * 4) / 3); 226 for (i = 0; i < numEntries; i++) {
|
H A D | DexFile.c | 367 int mask = pLookup->numEntries-1; 415 int i, numEntries; local 429 numEntries = dexRoundUpPower2(pDexFile->pHeader->classDefsSize * 2); 431 + numEntries * sizeof(pLookup->table[0]); 437 pLookup->numEntries = numEntries; 457 pDexFile->pHeader->classDefsSize, numEntries, 458 (100 * pDexFile->pHeader->classDefsSize) / numEntries, 865 mask = pLookup->numEntries - 1;
|
H A D | DexFile.h | 436 int numEntries; // size of table[]; always power of 2 member in struct:DexClassLookup
|
/dalvik/libcore/archive/src/main/java/java/util/zip/ |
H A D | ZipFile.java | 335 int numEntries = ler.readShortLE(bin); 341 if (numEntries != totalNumEntries || 352 for (int i = 0; i < numEntries; i++) {
|
/dalvik/dexdump/ |
H A D | DexDump.c | 1414 u2 numEntries; local 1418 numEntries = *data++; 1419 numEntries |= (*data++) << 8; 1427 int origLen = 4 + (addrWidth + regWidth) * numEntries; 1432 (addrWidth + regWidth) * numEntries, compressedLen); 1481 u2 numEntries; local 1485 numEntries = *data++; 1486 numEntries |= (*data++) << 8; 1488 for (idx = 0; idx < numEntries; idx++) {
|