HomeSort by relevance Sort by last modified time
    Searched refs:mHashTableSize (Results 1 - 4 of 4) sorted by null

  /frameworks/base/include/utils/
ZipFileRO.h 75 mHashTableSize(-1), mHashTable(NULL)
240 int mHashTableSize;
  /frameworks/base/libs/utils/
ZipFileRO.cpp 122 if (ent < 0 || ent >= mHashTableSize || mHashTable[ent].name == NULL) {
334 mHashTableSize = roundUpPower2(1 + (numEntries * 4) / 3);
335 mHashTable = (HashEntry*) calloc(mHashTableSize, sizeof(HashEntry));
400 int ent = hash & (mHashTableSize-1);
406 ent = (ent + 1) & (mHashTableSize-1);
421 * end up being garbage since mHashTableSize is -1.
423 if (mHashTableSize <= 0) {
429 int ent = hash & (mHashTableSize-1);
439 ent = (ent + 1) & (mHashTableSize-1);
459 for (int ent = 0; ent < mHashTableSize; ent++)
    [all...]
  /dalvik/libdex/
ZipArchive.h 76 int mHashTableSize;
ZipArchive.c 77 if (ent < 0 || ent >= pArchive->mHashTableSize ||
105 const int hashTableSize = pArchive->mHashTableSize;
275 pArchive->mHashTableSize = dexRoundUpPower2(1 + (numEntries * 4) / 3);
277 calloc(pArchive->mHashTableSize, sizeof(ZipHashEntry));
404 pArchive->mHashTableSize = -1;
418 const int hashTableSize = pArchive->mHashTableSize;
451 for (ent = 0; ent < pArchive->mHashTableSize; ent++) {

Completed in 540 milliseconds