Lines Matching refs:cur
46 sidtab_node_t *prev, *cur, *newnode;
53 cur = s->htable[hvalue];
54 while (cur != NULL && sid > cur->sid) {
55 prev = cur;
56 cur = cur->next;
59 if (cur && sid == cur->sid) {
90 sidtab_node_t *cur, *last;
97 cur = s->htable[hvalue];
98 while (cur != NULL && sid > cur->sid) {
99 last = cur;
100 cur = cur->next;
103 if (cur == NULL || sid != cur->sid)
107 s->htable[hvalue] = cur->next;
109 last->next = cur->next;
111 context_destroy(&cur->context);
113 free(cur);
121 sidtab_node_t *cur;
127 cur = s->htable[hvalue];
128 while (cur != NULL && sid > cur->sid)
129 cur = cur->next;
131 if (cur == NULL || sid != cur->sid) {
135 cur = s->htable[hvalue];
136 while (cur != NULL && sid > cur->sid)
137 cur = cur->next;
138 if (!cur || sid != cur->sid)
142 return &cur->context;
151 sidtab_node_t *cur;
157 cur = s->htable[i];
158 while (cur != NULL) {
159 ret = apply(cur->sid, &cur->context, args);
162 cur = cur->next;
174 sidtab_node_t *last, *cur, *temp;
181 cur = s->htable[i];
182 while (cur != NULL) {
183 ret = apply(cur->sid, &cur->context, args);
186 last->next = cur->next;
188 s->htable[i] = cur->next;
191 temp = cur;
192 cur = cur->next;
197 last = cur;
198 cur = cur->next;
211 sidtab_node_t *cur;
214 cur = s->htable[i];
215 while (cur != NULL) {
216 if (context_cmp(&cur->context, context))
217 return cur->sid;
218 cur = cur->next;
263 sidtab_node_t *cur;
268 cur = h->htable[i];
269 if (cur) {
272 while (cur) {
274 cur = cur->next;
290 sidtab_ptr_t cur, temp;
296 cur = s->htable[i];
297 while (cur != NULL) {
298 temp = cur;
299 cur = cur->next;
