diff options
| author | Nick Kralevich <nnk@google.com> | 2015-02-08 16:20:50 +0100 |
|---|---|---|
| committer | Android Git Automerger <android-git-automerger@android.com> | 2015-02-08 16:20:50 +0100 |
| commit | ec5c1c1e291062576925b80b532d36df118103f5 (patch) | |
| tree | a329cbb5c46df853065a18d54b5c2f24fdb22e2e /minzip/Hash.c | |
| parent | am 6a0d2fbc: Merge "There\'s no GPL code in \'updater\'." (diff) | |
| parent | Merge "Remove dead/unused code and realign some of the comments to make it more cleaner and easier to read" (diff) | |
| download | android_bootable_recovery-ec5c1c1e291062576925b80b532d36df118103f5.tar android_bootable_recovery-ec5c1c1e291062576925b80b532d36df118103f5.tar.gz android_bootable_recovery-ec5c1c1e291062576925b80b532d36df118103f5.tar.bz2 android_bootable_recovery-ec5c1c1e291062576925b80b532d36df118103f5.tar.lz android_bootable_recovery-ec5c1c1e291062576925b80b532d36df118103f5.tar.xz android_bootable_recovery-ec5c1c1e291062576925b80b532d36df118103f5.tar.zst android_bootable_recovery-ec5c1c1e291062576925b80b532d36df118103f5.zip | |
Diffstat (limited to 'minzip/Hash.c')
| -rw-r--r-- | minzip/Hash.c | 11 |
1 files changed, 0 insertions, 11 deletions
diff --git a/minzip/Hash.c b/minzip/Hash.c index 8c6ca9bc2..8f8ed68e5 100644 --- a/minzip/Hash.c +++ b/minzip/Hash.c @@ -140,7 +140,6 @@ static bool resizeHash(HashTable* pHashTable, int newSize) int i; assert(countTombStones(pHashTable) == pHashTable->numDeadEntries); - //LOGI("before: dead=%d\n", pHashTable->numDeadEntries); pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashTable)); if (pNewEntries == NULL) @@ -196,7 +195,6 @@ void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item (*cmpFunc)(pEntry->data, item) == 0) { /* match */ - //LOGD("+++ match on entry %d\n", pEntry - pHashTable->pEntries); break; } @@ -206,8 +204,6 @@ void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item break; /* edge case - single-entry table */ pEntry = pHashTable->pEntries; } - - //LOGI("+++ look probing %d...\n", pEntry - pHashTable->pEntries); } if (pEntry->data == NULL) { @@ -228,10 +224,6 @@ void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item abort(); } /* note "pEntry" is now invalid */ - } else { - //LOGW("okay %d/%d/%d\n", - // pHashTable->numEntries, pHashTable->tableSize, - // (pHashTable->tableSize * LOAD_NUMER) / LOAD_DENOM); } /* full table is bad -- search for nonexistent never halts */ @@ -264,7 +256,6 @@ bool mzHashTableRemove(HashTable* pHashTable, unsigned int itemHash, void* item) pEnd = &pHashTable->pEntries[pHashTable->tableSize]; while (pEntry->data != NULL) { if (pEntry->data == item) { - //LOGI("+++ stepping on entry %d\n", pEntry - pHashTable->pEntries); pEntry->data = HASH_TOMBSTONE; pHashTable->numEntries--; pHashTable->numDeadEntries++; @@ -277,8 +268,6 @@ bool mzHashTableRemove(HashTable* pHashTable, unsigned int itemHash, void* item) break; /* edge case - single-entry table */ pEntry = pHashTable->pEntries; } - - //LOGI("+++ del probing %d...\n", pEntry - pHashTable->pEntries); } return false; |