Lines Matching full:data
80 if (pEnt->data == HASH_TOMBSTONE) {
82 pEnt->data = NULL;
83 } else if (pEnt->data != NULL) {
86 (*pHashTable->freeFunc)(pEnt->data);
87 pEnt->data = NULL;
116 if (pHashTable->pEntries[i].data == HASH_TOMBSTONE)
146 void* data = pHashTable->pEntries[i].data;
147 if (data != NULL && data != HASH_TOMBSTONE) {
153 while (pNewEntries[newIdx].data != NULL)
157 pNewEntries[newIdx].data = data;
189 while (pEntry->data != NULL) {
190 if (pEntry->data != HASH_TOMBSTONE &&
192 (*cmpFunc)(pEntry->data, item) == 0)
209 if (pEntry->data == NULL) {
212 pEntry->data = item;
240 result = pEntry->data;
261 while (pEntry->data != NULL) {
262 if (pEntry->data == item) {
264 pEntry->data = HASH_TOMBSTONE;
299 if (pEnt->data != NULL && pEnt->data != HASH_TOMBSTONE) {
300 val = (*func)(pEnt->data);
302 pEnt->data = HASH_TOMBSTONE;
327 if (pEnt->data != NULL && pEnt->data != HASH_TOMBSTONE) {
328 val = (*func)(pEnt->data, arg);
357 while (pEntry->data != NULL) {
358 if (pEntry->data != HASH_TOMBSTONE &&
360 (*cmpFunc)(pEntry->data, item) == 0)
375 if (pEntry->data == NULL)
401 const void* data = (const void*)dvmHashIterData(&iter);
404 count = countProbes(pHashTable, (*calcFunc)(data), data, cmpFunc);
