Searched defs:numEntries (Results 1 - 13 of 13) sorted by relevance

/dalvik/vm/
H A DAtomicCache.cpp40 AtomicCache* dvmAllocAtomicCache(int numEntries) argument
48 newCache->numEntries = numEntries;
51 sizeof(AtomicCacheEntry) * numEntries + CPU_CACHE_WIDTH);
181 pCache->numEntries);
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
150 AtomicCache* dvmAllocAtomicCache(int numEntries);
H A DHash.h75 int numEntries; /* current #of "live" entries */ member in struct:HashTable
125 return pHashTable->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--;
304 pHashTable->numEntries--;
395 int numEntries, minProbe, maxProbe, totalProbe; local
398 numEntries
[all...]
H A DJni.cpp410 int numEntries = self->jniLocalRefTable.capacity(); local
411 // TODO: this isn't quite right, since "numEntries" includes holes
412 return ((kJniLocalRefMax - numEntries) >= capacity);
/dalvik/hit/src/com/android/hit/
H A DArrayInstance.java28 public ArrayInstance(long id, StackTrace stack, int type, int numEntries, argument
33 mNumEntries = numEntries;
/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 DCodeVerify.h149 int numEntries; member in struct:UninitInstanceMap
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++) {
576 u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local
584 return kHeaderSize + (1 + pMap->regWidth) * numEntries;
586 return kHeaderSize + (2 + pMap->regWidth) * numEntries;
901 u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local
903 assert(numEntries > 0);
930 if (numEntries < kSearchThreshol
1254 const u2 numEntries = dvmRegisterMapGetNumEntries(pMap); local
1450 int addrWidth, regWidth, numEntries; local
1702 int regWidth, numEntries, newAddrWidth, newMapSize; local
[all...]
/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.cpp233 u4 numEntries = get2LE(eocdPtr + kEOCDNumEntries);
245 if (numEntries == 0) {
248 } else if (numEntries != totalNumEntries || diskNumber != 0 || diskWithCentralDir != 0) {
260 ALOGV("+++ numEntries=%d dirSize=%d dirOffset=%d\n",
261 numEntries, centralDirSize, centralDirOffset);
274 pArchive->mNumEntries = numEntries;
339 int numEntries = pArchive->mNumEntries; local
346 pArchive->mHashTableSize = dexRoundUpPower2(1 + (numEntries * 4) / 3);
356 for (i = 0; i < numEntries; i++) {
403 ALOGV("+++ zip good scan %d entries", numEntries);
[all...]
H A DDexFile.h458 int numEntries; // size of table[]; always power of 2 member in struct:DexClassLookup
/dalvik/dexdump/
H A DDexDump.cpp1551 u2 numEntries; local
1555 numEntries = *data++;
1556 numEntries |= (*data++) << 8;
1564 int origLen = 4 + (addrWidth + regWidth) * numEntries;
1569 (addrWidth + regWidth) * numEntries, compressedLen);
1618 u2 numEntries; local
1622 numEntries = *data++;
1623 numEntries |= (*data++) << 8;
1625 for (idx = 0; idx < numEntries; idx++) {

Completed in 1294 milliseconds