Lines Matching refs:cur
68 hashtab_ptr_t *new_htable, *dst, cur, next;
85 cur = h->htable[i];
86 while (cur != NULL) {
87 hvalue = h->hash_value(h, cur->key);
89 while (*dst && h->keycmp(h, cur->key, (*dst)->key) > 0)
92 next = cur->next;
94 cur->next = *dst;
95 *dst = cur;
97 cur = next;
107 hashtab_ptr_t prev, cur, newnode;
116 cur = h->htable[hvalue];
117 while (cur && h->keycmp(h, key, cur->key) > 0) {
118 prev = cur;
119 cur = cur->next;
122 if (cur && (h->keycmp(h, key, cur->key) == 0))
148 hashtab_ptr_t cur, last;
155 cur = h->htable[hvalue];
156 while (cur != NULL && h->keycmp(h, key, cur->key) > 0) {
157 last = cur;
158 cur = cur->next;
161 if (cur == NULL || (h->keycmp(h, key, cur->key) != 0))
165 h->htable[hvalue] = cur->next;
167 last->next = cur->next;
170 destroy(cur->key, cur->datum, args);
171 free(cur);
180 hashtab_ptr_t cur;
186 cur = h->htable[hvalue];
187 while (cur != NULL && h->keycmp(h, key, cur->key) > 0)
188 cur = cur->next;
190 if (cur == NULL || (h->keycmp(h, key, cur->key) != 0))
193 return cur->datum;
199 hashtab_ptr_t cur, temp;
205 cur = h->htable[i];
206 while (cur != NULL) {
207 temp = cur;
208 cur = cur->next;
225 hashtab_ptr_t cur;
232 cur = h->htable[i];
233 while (cur != NULL) {
234 ret = apply(cur->key, cur->datum, args);
237 cur = cur->next;
247 hashtab_ptr_t cur;
252 cur = h->htable[i];
253 if (cur) {
256 while (cur) {
258 cur = cur->next;