Lines Matching refs:cur
69 hashtab_ptr_t prev, cur, newnode;
76 cur = h->htable[hvalue];
77 while (cur && h->keycmp(h, key, cur->key) > 0) {
78 prev = cur;
79 cur = cur->next;
82 if (cur && (h->keycmp(h, key, cur->key) == 0))
108 hashtab_ptr_t cur, last;
115 cur = h->htable[hvalue];
116 while (cur != NULL && h->keycmp(h, key, cur->key) > 0) {
117 last = cur;
118 cur = cur->next;
121 if (cur == NULL || (h->keycmp(h, key, cur->key) != 0))
125 h->htable[hvalue] = cur->next;
127 last->next = cur->next;
130 destroy(cur->key, cur->datum, args);
131 free(cur);
141 hashtab_ptr_t prev, cur, newnode;
148 cur = h->htable[hvalue];
149 while (cur != NULL && h->keycmp(h, key, cur->key) > 0) {
150 prev = cur;
151 cur = cur->next;
154 if (cur && (h->keycmp(h, key, cur->key) == 0)) {
156 destroy(cur->key, cur->datum, args);
157 cur->key = key;
158 cur->datum = datum;
182 hashtab_ptr_t cur;
188 cur = h->htable[hvalue];
189 while (cur != NULL && h->keycmp(h, key, cur->key) > 0)
190 cur = cur->next;
192 if (cur == NULL || (h->keycmp(h, key, cur->key) != 0))
195 return cur->datum;
201 hashtab_ptr_t cur, temp;
207 cur = h->htable[i];
208 while (cur != NULL) {
209 temp = cur;
210 cur = cur->next;
227 hashtab_ptr_t cur;
233 cur = h->htable[i];
234 while (cur != NULL) {
235 ret = apply(cur->key, cur->datum, args);
238 cur = cur->next;
254 hashtab_ptr_t last, cur, temp;
261 cur = h->htable[i];
262 while (cur != NULL) {
263 ret = apply(cur->key, cur->datum, args);
266 last->next = cur->next;
268 h->htable[i] = cur->next;
271 temp = cur;
272 cur = cur->next;
278 last = cur;
279 cur = cur->next;
291 hashtab_ptr_t cur;
296 cur = h->htable[i];
297 if (cur) {
300 while (cur) {
302 cur = cur->next;
