Lines Matching refs:e
86 struct entry *e; in hashtable_expand() local
99 while (NULL != (e = h->table[i])) { in hashtable_expand()
100 h->table[i] = e->next; in hashtable_expand()
101 index = indexFor(newsize,e->h); in hashtable_expand()
102 e->next = newtable[index]; in hashtable_expand()
103 newtable[index] = e; in hashtable_expand()
118 for (pE = &(newtable[i]), e = *pE; e != NULL; e = *pE) { in hashtable_expand()
119 index = indexFor(newsize,e->h); in hashtable_expand()
122 pE = &(e->next); in hashtable_expand()
126 *pE = e->next; in hashtable_expand()
127 e->next = newtable[index]; in hashtable_expand()
128 newtable[index] = e; in hashtable_expand()
152 struct entry *e; in hashtable_insert() local
161 e = (struct entry *)calloc(1, sizeof(struct entry)); in hashtable_insert()
162 if (NULL == e) { --(h->entrycount); return 0; } /*oom*/ in hashtable_insert()
163 e->h = hash(h,k); in hashtable_insert()
164 index = indexFor(h->tablelength,e->h); in hashtable_insert()
165 e->k = k; in hashtable_insert()
166 e->v = v; in hashtable_insert()
167 e->next = h->table[index]; in hashtable_insert()
168 h->table[index] = e; in hashtable_insert()
176 struct entry *e; in hashtable_search() local
180 e = h->table[index]; in hashtable_search()
181 while (NULL != e) in hashtable_search()
184 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) return e->v; in hashtable_search()
185 e = e->next; in hashtable_search()
197 struct entry *e; in hashtable_remove() local
205 e = *pE; in hashtable_remove()
206 while (NULL != e) in hashtable_remove()
209 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) in hashtable_remove()
211 *pE = e->next; in hashtable_remove()
213 v = e->v; in hashtable_remove()
214 freekey(e->k); in hashtable_remove()
215 free(e); in hashtable_remove()
218 pE = &(e->next); in hashtable_remove()
219 e = e->next; in hashtable_remove()
230 struct entry *e, *f; in hashtable_destroy() local
236 e = table[i]; in hashtable_destroy()
237 while (NULL != e) in hashtable_destroy()
238 { f = e; e = e->next; freekey(f->k); free(f->v); free(f); } in hashtable_destroy()
245 e = table[i]; in hashtable_destroy()
246 while (NULL != e) in hashtable_destroy()
247 { f = e; e = e->next; freekey(f->k); free(f); } in hashtable_destroy()