31   T_HashTableEl *entries;  member
67   H->entries = NewArray(size, T_HashTableEl);  in alloc_ht()
68   if (H->entries == NULL)  in alloc_ht()
72     H->entries[ii] = &unallocated;  in alloc_ht()
98       if (H->entries[i] != &unallocated &&  in free_ht()
99 	  H->entries[i] != &deleted)  in free_ht()
100 	entry_free(H->entries[i]);  in free_ht()
101   Free(H->entries);  in free_ht()
115   while(H->entries[pos] != &unallocated &&  in _hash_add()
116 	H->entries[pos] != &deleted){  in _hash_add()
122   if(H->entries[pos] == &unallocated)  in _hash_add()
126   H->entries[pos] = E;  in _hash_add()
139   oldentries = H->entries;  in rehash()
172 	H->entries[pos] != &unallocated &&  in _hash_lookup()
173 	(H->entries[pos] == &deleted ||  in _hash_lookup()
174 	 ((isIdentity || H->compar(H->entries[pos], E) != 0) &&  in _hash_lookup()
175 	  (!isIdentity || H->entries[pos] != E)))){  in _hash_lookup()
178     if (upos == (size_t) -1 && H->entries[pos] == &deleted)  in _hash_lookup()
183   if(H->entries[pos] == &unallocated || !ttl)  in _hash_lookup()
186     H->entries[upos] = H->entries[pos];  in _hash_lookup()
187     H->entries[pos] = &deleted;  in _hash_lookup()
192   *E2= H->entries[pos];  in _hash_lookup()
209       H->entries[hint] == E){  in hash_remove()
211     H->entries[hint] = &deleted;  in hash_remove()
220   H->entries[hint] = &deleted;  in hash_remove()