Lines Matching defs:entries
31 T_HashTableEl *entries;
65 H->entries = NewArray(size, T_HashTableEl);
66 if (H->entries == NULL)
70 H->entries[i] = &unallocated;
96 if (H->entries[i] != &unallocated &&
97 H->entries[i] != &deleted)
98 entry_free(H->entries[i]);
99 Free(H->entries);
112 while(H->entries[pos] != &unallocated &&
113 H->entries[pos] != &deleted){
119 if(H->entries[pos] == &unallocated)
123 H->entries[pos] = E;
136 oldentries = H->entries;
169 H->entries[pos] != &unallocated &&
170 (H->entries[pos] == &deleted ||
171 ((isIdentity || H->compar(H->entries[pos], E) != 0) &&
172 (!isIdentity || H->entries[pos] != E)))){
175 if (upos == -1 && H->entries[pos] == &deleted)
180 if(H->entries[pos] == &unallocated || !ttl)
183 H->entries[upos] = H->entries[pos];
184 H->entries[pos] = &deleted;
189 *E2= H->entries[pos];
206 H->entries[hint] == E){
208 H->entries[hint] = &deleted;
218 H->entries[hint] = &deleted;