84         if (pEnt->data == HASH_TOMBSTONE) {  in mzHashTableClear()
86             pEnt->data = NULL;  in mzHashTableClear()
87         } else if (pEnt->data != NULL) {  in mzHashTableClear()
90                 (*pHashTable->freeFunc)(pEnt->data);  in mzHashTableClear()
91             pEnt->data = NULL;  in mzHashTableClear()
120         if (pHashTable->pEntries[i].data == HASH_TOMBSTONE)  in countTombStones()
149         void* data = pHashTable->pEntries[i].data;  in resizeHash()  local
150         if (data != NULL && data != HASH_TOMBSTONE) {  in resizeHash()
156             while (pNewEntries[newIdx].data != NULL)  in resizeHash()
160             pNewEntries[newIdx].data = data;  in resizeHash()
192     while (pEntry->data != NULL) {  in mzHashTableLookup()
193         if (pEntry->data != HASH_TOMBSTONE &&  in mzHashTableLookup()
195             (*cmpFunc)(pEntry->data, item) == 0)  in mzHashTableLookup()
209     if (pEntry->data == NULL) {  in mzHashTableLookup()
212             pEntry->data = item;  in mzHashTableLookup()
236         result = pEntry->data;  in mzHashTableLookup()
257     while (pEntry->data != NULL) {  in mzHashTableRemove()
258         if (pEntry->data == item) {  in mzHashTableRemove()
259             pEntry->data = HASH_TOMBSTONE;  in mzHashTableRemove()
288         if (pEnt->data != NULL && pEnt->data != HASH_TOMBSTONE) {  in mzHashForeach()
289             val = (*func)(pEnt->data, arg);  in mzHashForeach()
318     while (pEntry->data != NULL) {  in countProbes()
319         if (pEntry->data != HASH_TOMBSTONE &&  in countProbes()
321             (*cmpFunc)(pEntry->data, item) == 0)  in countProbes()
336     if (pEntry->data == NULL)  in countProbes()
362         const void* data = (const void*)mzHashIterData(&iter);  in mzHashTableProbeCount()  local
365         count = countProbes(pHashTable, (*calcFunc)(data), data, cmpFunc);  in mzHashTableProbeCount()