Lines Matching refs:cur
48 hashtab_ptr_t prev, cur, newnode;
55 cur = h->htable[hvalue];
56 while (cur && h->keycmp(h, key, cur->key) > 0) {
57 prev = cur;
58 cur = cur->next;
61 if (cur && (h->keycmp(h, key, cur->key) == 0))
87 hashtab_ptr_t cur, last;
94 cur = h->htable[hvalue];
95 while (cur != NULL && h->keycmp(h, key, cur->key) > 0) {
96 last = cur;
97 cur = cur->next;
100 if (cur == NULL || (h->keycmp(h, key, cur->key) != 0))
104 h->htable[hvalue] = cur->next;
106 last->next = cur->next;
109 destroy(cur->key, cur->datum, args);
110 free(cur);
120 hashtab_ptr_t prev, cur, newnode;
127 cur = h->htable[hvalue];
128 while (cur != NULL && h->keycmp(h, key, cur->key) > 0) {
129 prev = cur;
130 cur = cur->next;
133 if (cur && (h->keycmp(h, key, cur->key) == 0)) {
135 destroy(cur->key, cur->datum, args);
136 cur->key = key;
137 cur->datum = datum;
161 hashtab_ptr_t cur;
167 cur = h->htable[hvalue];
168 while (cur != NULL && h->keycmp(h, key, cur->key) > 0)
169 cur = cur->next;
171 if (cur == NULL || (h->keycmp(h, key, cur->key) != 0))
174 return cur->datum;
180 hashtab_ptr_t cur, temp;
186 cur = h->htable[i];
187 while (cur != NULL) {
188 temp = cur;
189 cur = cur->next;
206 hashtab_ptr_t cur;
212 cur = h->htable[i];
213 while (cur != NULL) {
214 ret = apply(cur->key, cur->datum, args);
217 cur = cur->next;
233 hashtab_ptr_t last, cur, temp;
240 cur = h->htable[i];
241 while (cur != NULL) {
242 ret = apply(cur->key, cur->datum, args);
245 last->next = cur->next;
247 h->htable[i] = cur->next;
250 temp = cur;
251 cur = cur->next;
257 last = cur;
258 cur = cur->next;
270 hashtab_ptr_t cur;
275 cur = h->htable[i];
276 if (cur) {
279 while (cur) {
281 cur = cur->next;
