Lines Matching refs:cur
43 sidtab_node_t *prev, *cur, *newnode;
50 cur = s->htable[hvalue];
51 while (cur != NULL && sid > cur->sid) {
52 prev = cur;
53 cur = cur->next;
56 if (cur && sid == cur->sid) {
87 sidtab_node_t *cur;
93 cur = s->htable[hvalue];
94 while (cur != NULL && sid > cur->sid)
95 cur = cur->next;
97 if (cur == NULL || sid != cur->sid) {
101 cur = s->htable[hvalue];
102 while (cur != NULL && sid > cur->sid)
103 cur = cur->next;
104 if (!cur || sid != cur->sid)
108 return &cur->context;
117 sidtab_node_t *cur;
123 cur = s->htable[i];
124 while (cur != NULL) {
125 ret = apply(cur->sid, &cur->context, args);
128 cur = cur->next;
140 sidtab_node_t *last, *cur, *temp;
147 cur = s->htable[i];
148 while (cur != NULL) {
149 ret = apply(cur->sid, &cur->context, args);
152 last->next = cur->next;
154 s->htable[i] = cur->next;
157 temp = cur;
158 cur = cur->next;
163 last = cur;
164 cur = cur->next;
177 sidtab_node_t *cur;
180 cur = s->htable[i];
181 while (cur != NULL) {
182 if (context_cmp(&cur->context, context))
183 return cur->sid;
184 cur = cur->next;
229 sidtab_node_t *cur;
234 cur = h->htable[i];
235 if (cur) {
238 while (cur) {
240 cur = cur->next;
256 sidtab_ptr_t cur, temp;
262 cur = s->htable[i];
263 while (cur != NULL) {
264 temp = cur;
265 cur = cur->next;