HomeSort by relevance Sort by last modified time
    Searched defs:numEntries (Results 1 - 25 of 59) sorted by null

1 2 3

  /frameworks/base/libs/ui/
PixelFormat.cpp 79 size_t numEntries;
80 const GGLFormat *i = gglGetPixelFormatTable(&numEntries) + format;
81 bool valid = uint32_t(format) < numEntries;
  /dalvik/vm/
AtomicCache.h 46 * handle "numEntries" separately in ATOMIC_CACHE_LOOKUP.)
50 int numEntries; /* #of entries, must be power of 2 */
148 AtomicCache* dvmAllocAtomicCache(int numEntries);
Hash.cpp 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;
395 numEntries = maxProbe = totalProbe = 0
    [all...]
Hash.h 75 int numEntries; /* current #of "live" entries */
125 return pHashTable->numEntries;
  /external/llvm/include/llvm/Analysis/
ProfileInfoTypes.h 45 unsigned numEntries; /* number of entries stored */
  /external/webkit/Source/WebCore/html/canvas/
WebGLBuffer.cpp 183 size_t numEntries = WTF_ARRAY_LENGTH(m_maxIndexCache);
184 for (size_t i = 0; i < numEntries; ++i)
191 m_nextAvailableCacheEntry = (m_nextAvailableCacheEntry + 1) % numEntries;
  /frameworks/base/core/java/android/content/
SyncStats.java 87 public long numEntries;
104 numEntries = 0;
116 numEntries = in.readLong();
132 if (numEntries > 0) sb.append(" numEntries: ").append(numEntries);
149 numEntries = 0;
165 dest.writeLong(numEntries);
  /libcore/luni/src/main/java/java/lang/
VMClassLoader.java 36 int numEntries = getBootClassPathSize();
37 for (int i = 0; i < numEntries; i++) {
56 int numEntries = getBootClassPathSize();
57 for (int i = 0; i < numEntries; i++) {
  /bionic/libc/bionic/
malloc_debug_common.h 57 size_t numEntries;
  /bootable/recovery/minzip/
Hash.h 63 int numEntries; /* current #of "live" entries */
101 return pHashTable->numEntries;
Hash.c 62 pHashTable->numEntries = pHashTable->numDeadEntries = 0;
95 pHashTable->numEntries = 0;
217 pHashTable->numEntries++;
222 if ((pHashTable->numEntries+pHashTable->numDeadEntries) * LOAD_DENOM
233 // pHashTable->numEntries, pHashTable->tableSize,
238 assert(pHashTable->numEntries < pHashTable->tableSize);
269 pHashTable->numEntries--;
364 int numEntries, minProbe, maxProbe, totalProbe;
367 numEntries = maxProbe = totalProbe = 0;
378 numEntries++
    [all...]
Zip.h 43 unsigned int numEntries;
85 return pArchive->numEntries;
94 if (index < pArchive->numEntries) {
  /build/tools/zipalign/
ZipAlign.cpp 49 int numEntries = pZin->getNumEntries();
54 for (int i = 0; i < numEntries; i++) {
156 int numEntries = zipFile.getNumEntries();
159 for (int i = 0; i < numEntries; i++) {
  /frameworks/base/libs/rs/driver/
rsdShaderCache.cpp 249 int32_t numEntries = (int32_t)mEntries.size();
250 for (int32_t ct = 0; ct < numEntries; ct ++) {
256 numEntries = (int32_t)mEntries.size();
263 int32_t numEntries = (int32_t)mEntries.size();
264 for (int32_t ct = 0; ct < numEntries; ct ++) {
270 numEntries = (int32_t)mEntries.size();
  /frameworks/base/media/libstagefright/
VBRISeeker.cpp 74 size_t numEntries = U16_AT(&vbriHeader[18]);
79 numEntries,
83 size_t totalEntrySize = numEntries * entrySize;
99 for (size_t i = 0; i < numEntries; ++i) {
  /dalvik/vm/analysis/
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 */
117 return pMap->numEntries[0] | (pMap->numEntries[1] << 8);
123 INLINE void dvmRegisterMapSetNumEntries(RegisterMap* pMap, u2 numEntries) {
124 pMap->numEntries[0] = (u1) numEntries;
125 pMap->numEntries[1] = numEntries >> 8
    [all...]
  /external/apache-http/src/org/apache/http/impl/conn/tsccm/
RouteSpecificPool.java 71 protected int numEntries;
85 this.numEntries = 0;
118 return (numEntries < 1) && waitingThreads.isEmpty();
128 return maxEntries - numEntries;
140 return numEntries;
183 if (numEntries < 1) {
187 if (numEntries <= freeEntries.size()) {
212 numEntries++;
230 numEntries--;
242 if (numEntries < 1)
    [all...]
  /dalvik/libdex/
DexFile.cpp 185 int mask = pLookup->numEntries-1;
215 int i, numEntries;
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;
  /frameworks/base/core/java/android/app/
FragmentBreadCrumbs.java 237 int numEntries = fm.getBackStackEntryCount();
240 for (int i = 0; i < numEntries + numPreEntries; i++) {
268 int viewI = numEntries + numPreEntries;
  /frameworks/base/libs/utils/
BlobCache.cpp 260 size_t numEntries = header->mNumEntries;
261 for (size_t i = 0; i < numEntries; i++) {
  /frameworks/base/tests/RenderScriptTests/FBOTest/src/com/android/fbotest/
FBOSyncRS.java 131 int numEntries = model.getIndexEntryCount();
133 for (int i = 0; i < numEntries; i ++) {
143 for (int i = 0; i < numEntries; i ++) {
FBOTestRS.java 130 int numEntries = model.getIndexEntryCount();
132 for (int i = 0; i < numEntries; i ++) {
142 for (int i = 0; i < numEntries; i ++) {
  /frameworks/base/tests/RenderScriptTests/ModelViewer/src/com/android/modelviewer/
SimpleModelRS.java 129 int numEntries = model.getIndexEntryCount();
131 for (int i = 0; i < numEntries; i ++) {
141 for (int i = 0; i < numEntries; i ++) {
  /frameworks/base/tests/RenderScriptTests/ShadersTest/src/com/android/shaderstest/
ShadersTestRS.java 142 int numEntries = model.getIndexEntryCount();
144 for (int i = 0; i < numEntries; i ++) {
154 for (int i = 0; i < numEntries; i ++) {
  /libcore/luni/src/main/java/libcore/util/
ZoneInfoDB.java 144 int numEntries = (int) mappedFile.size() / (SIZEOF_TZNAME + 3*SIZEOF_TZINT);
146 char[] idChars = new char[numEntries * SIZEOF_TZNAME];
147 int[] idEnd = new int[numEntries];
150 byteOffsets = new int[numEntries];
151 rawUtcOffsets = new int[numEntries];
153 for (int i = 0; i < numEntries; i++) {
177 ids = new String[numEntries];
178 for (int i = 0; i < numEntries; i++) {

Completed in 606 milliseconds

1 2 3