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

  /bootable/recovery/minzip/
Hash.c 64 pHashTable->pEntries =
66 if (pHashTable->pEntries == NULL) {
82 pEnt = pHashTable->pEntries;
107 free(pHashTable->pEntries);
120 if (pHashTable->pEntries[i].data == HASH_TOMBSTONE)
150 void* data = pHashTable->pEntries[i].data;
152 int hashValue = pHashTable->pEntries[i].hashValue;
165 free(pHashTable->pEntries);
166 pHashTable->pEntries = pNewEntries;
191 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)]
    [all...]
Hash.h 65 HashEntry* pEntries; /* array on heap */
156 void* data = pIter->pHashTable->pEntries[i].data;
172 return pIter->pHashTable->pEntries[pIter->idx].data;
Zip.h 50 ZipEntry* pEntries;
102 return pArchive->pEntries + index;
112 return pEntry - pArchive->pEntries;
Zip.c 243 pArchive->pEntries = (ZipEntry*) calloc(numEntries, sizeof(ZipEntry));
245 if (pArchive->pEntries == NULL || pArchive->pHash == NULL)
293 if (pArchive->pEntries[mid].fileNameLen < fileNameLen) {
294 diffLen = pArchive->pEntries[mid].fileNameLen;
298 diff = strncmp(pArchive->pEntries[mid].fileName, fileName,
301 diff = pArchive->pEntries[mid].fileNameLen - fileNameLen;
319 memmove(pArchive->pEntries + target + 1,
320 pArchive->pEntries + target,
323 pEntry = &pArchive->pEntries[target];
325 pEntry = &pArchive->pEntries[0]
    [all...]

Completed in 274 milliseconds