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

  /frameworks/native/include/utils/
ZipFileRO.h 77 mHashTableSize(-1), mHashTable(NULL)
256 int mHashTableSize;
  /dalvik/libdex/
ZipArchive.cpp 80 if (ent < 0 || ent >= pArchive->mHashTableSize ||
108 const int hashTableSize = pArchive->mHashTableSize;
286 pArchive->mHashTableSize = dexRoundUpPower2(1 + (numEntries * 4) / 3);
288 calloc(pArchive->mHashTableSize, sizeof(ZipHashEntry));
415 pArchive->mHashTableSize = -1;
429 const int hashTableSize = pArchive->mHashTableSize;
462 for (ent = 0; ent < pArchive->mHashTableSize; ent++) {
ZipArchive.h 74 int mHashTableSize;
  /frameworks/native/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...]

Completed in 80 milliseconds