rtservice.h - OpenGrok cross reference for /include/rtservice.h

Lines Matching refs:next
52     l->next = l->prev = l;  in rt_list_init()
63     l->next->prev = n;  in rt_list_insert_after()
64     n->next = l->next;  in rt_list_insert_after()
66     l->next = n;  in rt_list_insert_after()
78     l->prev->next = n;  in rt_list_insert_before()
82     n->next = l;  in rt_list_insert_before()
91     n->next->prev = n->prev;  in rt_list_remove()
92     n->prev->next = n->next;  in rt_list_remove()
94     n->next = n->prev = n;  in rt_list_remove()
103     return l->next == l;  in rt_list_isempty()
114     while (p->next != l)  in rt_list_len()
116         p = p->next;  in rt_list_len()
138     for (pos = (head)->next; pos != (head); pos = pos->next)
147     for (pos = (head)->next, n = pos->next; pos != (head); \
148         pos = n, n = pos->next)
157     for (pos = rt_list_entry((head)->next, rt_typeof(*pos), member); \
159          pos = rt_list_entry(pos->member.next, rt_typeof(*pos), member))
169     for (pos = rt_list_entry((head)->next, rt_typeof(*pos), member), \
170          n = rt_list_entry(pos->member.next, rt_typeof(*pos), member); \
172          pos = n, n = rt_list_entry(n->member.next, rt_typeof(*n), member))
183     rt_list_entry((ptr)->next, type, member)
194     l->next = RT_NULL;  in rt_slist_init()
202     while (node->next) node = node->next;  in rt_slist_append()
205     node->next = n;  in rt_slist_append()
206     n->next = RT_NULL;  in rt_slist_append()
211     n->next = l->next;  in rt_slist_insert()
212     l->next = n;  in rt_slist_insert()
218     const rt_slist_t *list = l->next;  in rt_slist_len()
221         list = list->next;  in rt_slist_len()
233     node = node->next;  in rt_slist_pop()
236         ((struct rt_slist_node *)l)->next = node->next;  in rt_slist_pop()
237         node->next = RT_NULL;  in rt_slist_pop()
247     while (node->next && node->next != n) node = node->next;  in rt_slist_remove()
250     if (node->next != (rt_slist_t *)0)  in rt_slist_remove()
252         node->next = node->next->next;  in rt_slist_remove()
253         n->next = RT_NULL;  in rt_slist_remove()
261     return l->next;  in rt_slist_first()
266     while (l->next) l = l->next;  in rt_slist_tail()
273     return n->next;  in rt_slist_next()
278     return l->next == RT_NULL;  in rt_slist_isempty()
296     for (pos = (head)->next; pos != RT_NULL; pos = pos->next)
305 …for (pos = ((head)->next == (RT_NULL) ? (RT_NULL) : rt_slist_entry((head)->next, rt_typeof(*pos), …
307 …pos = (pos->member.next == (RT_NULL) ? (RT_NULL) : rt_slist_entry(pos->member.next, rt_typeof(*pos…
318     rt_slist_entry((ptr)->next, type, member)