Lines Matching refs:cur
40 struct hashtab_node *prev, *cur, *newnode; in hashtab_insert() local
47 cur = h->htable[hvalue]; in hashtab_insert()
48 while ( cur && h->keycmp(h, key, cur->key) > 0 ) in hashtab_insert()
50 prev = cur; in hashtab_insert()
51 cur = cur->next; in hashtab_insert()
54 if ( cur && (h->keycmp(h, key, cur->key) == 0) ) in hashtab_insert()
80 struct hashtab_node *cur; in hashtab_search() local
86 cur = h->htable[hvalue]; in hashtab_search()
87 while ( cur != NULL && h->keycmp(h, key, cur->key) > 0 ) in hashtab_search()
88 cur = cur->next; in hashtab_search()
90 if ( cur == NULL || (h->keycmp(h, key, cur->key) != 0) ) in hashtab_search()
93 return cur->datum; in hashtab_search()
99 struct hashtab_node *cur, *temp; in hashtab_destroy() local
106 cur = h->htable[i]; in hashtab_destroy()
107 while ( cur != NULL ) in hashtab_destroy()
109 temp = cur; in hashtab_destroy()
110 cur = cur->next; in hashtab_destroy()
128 struct hashtab_node *cur; in hashtab_map() local
135 cur = h->htable[i]; in hashtab_map()
136 while ( cur != NULL ) in hashtab_map()
138 ret = apply(cur->key, cur->datum, args); in hashtab_map()
141 cur = cur->next; in hashtab_map()
151 struct hashtab_node *cur; in hashtab_stat() local
157 cur = h->htable[i]; in hashtab_stat()
158 if ( cur ) in hashtab_stat()
162 while ( cur ) in hashtab_stat()
165 cur = cur->next; in hashtab_stat()