Lines Matching refs:e
137 ENTRY *e; in h_get() local
139 for (e = h->h_table[i]; e; e = e->e_next) in h_get()
140 if (e->e_hash == hash && h->h_equal(e->e_key, key)) in h_get()
141 return (e->e_key); in h_get()
162 ENTRY *e, *next; in rehash() local
164 for (e = h->h_table[i]; e; e = next) { in rehash()
165 uint_t k = e->e_hash % newtabSize; in rehash()
167 next = (ENTRY *) e->e_next; in rehash()
168 e->e_next = (ENTRY *) newtab[k]; in rehash()
169 newtab[k] = e; in rehash()
191 ENTRY *e; in h_put() local
193 for (e = h->h_table[indx]; e; e = e->e_next) in h_put()
194 if (e->e_hash == hash && h->h_equal(e->e_key, key)) in h_put()
203 e = exmalloc(sizeof (ENTRY)); in h_put()
204 e->e_hash = hash; in h_put()
205 e->e_key = (void *) key; in h_put()
206 e->e_next = h->h_table[indx]; in h_put()
208 h->h_table[indx] = e; in h_put()
227 ENTRY *e, *prev; in h_delete() local
229 for (e = h->h_table[indx], prev = NULL; e; prev = e, e = e->e_next) { in h_delete()
230 if (e->e_hash == hash && h->h_equal(e->e_key, key)) { in h_delete()
231 key = e->e_key; in h_delete()
233 prev->e_next = e->e_next; in h_delete()
235 h->h_table[indx] = e->e_next; in h_delete()
236 free(e); in h_delete()