Lines Matching refs:e
91 struct entry *e; in hashtable_expand() local
104 while (NULL != (e = h->table[i])) { in hashtable_expand()
105 h->table[i] = e->next; in hashtable_expand()
106 index = indexFor(newsize,e->h); in hashtable_expand()
107 e->next = newtable[index]; in hashtable_expand()
108 newtable[index] = e; in hashtable_expand()
123 for (pE = &(newtable[i]), e = *pE; e != NULL; e = *pE) { in hashtable_expand()
124 index = indexFor(newsize,e->h); in hashtable_expand()
127 pE = &(e->next); in hashtable_expand()
131 *pE = e->next; in hashtable_expand()
132 e->next = newtable[index]; in hashtable_expand()
133 newtable[index] = e; in hashtable_expand()
157 struct entry *e; in hashtable_insert() local
166 e = (struct entry *)calloc(1, sizeof(struct entry)); in hashtable_insert()
167 if (NULL == e) { --(h->entrycount); return 0; } /*oom*/ in hashtable_insert()
168 e->h = hash(h,k); in hashtable_insert()
169 index = indexFor(h->tablelength,e->h); in hashtable_insert()
170 e->k = k; in hashtable_insert()
171 e->v = v; in hashtable_insert()
172 e->next = h->table[index]; in hashtable_insert()
173 h->table[index] = e; in hashtable_insert()
181 struct entry *e; in hashtable_search() local
185 e = h->table[index]; in hashtable_search()
186 while (NULL != e) in hashtable_search()
189 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) return e->v; in hashtable_search()
190 e = e->next; in hashtable_search()
202 struct entry *e; in hashtable_remove() local
210 e = *pE; in hashtable_remove()
211 while (NULL != e) in hashtable_remove()
214 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) in hashtable_remove()
216 *pE = e->next; in hashtable_remove()
218 v = e->v; in hashtable_remove()
219 freekey(e->k); in hashtable_remove()
220 free(e); in hashtable_remove()
223 pE = &(e->next); in hashtable_remove()
224 e = e->next; in hashtable_remove()
235 struct entry *e, *f; in hashtable_destroy() local
241 e = table[i]; in hashtable_destroy()
242 while (NULL != e) in hashtable_destroy()
243 { f = e; e = e->next; freekey(f->k); free(f->v); free(f); } in hashtable_destroy()
250 e = table[i]; in hashtable_destroy()
251 while (NULL != e) in hashtable_destroy()
252 { f = e; e = e->next; freekey(f->k); free(f); } in hashtable_destroy()