Lines Matching refs:next
27 struct usb_slist_node *next; /**< point to next node. */ member
38 l->next = NULL; in usb_slist_init()
43 n->next = l->next; in usb_slist_add_head()
44 l->next = n; in usb_slist_add_head()
51 while (tmp->next) { in usb_slist_add_tail()
52 tmp = tmp->next; in usb_slist_add_tail()
56 tmp->next = n; in usb_slist_add_tail()
57 n->next = NULL; in usb_slist_add_tail()
60 static inline void usb_slist_insert(usb_slist_t *l, usb_slist_t *next, usb_slist_t *n) in usb_slist_insert() argument
62 if (!next) { in usb_slist_insert()
63 usb_slist_add_tail(next, l); in usb_slist_insert()
67 while (l->next) { in usb_slist_insert()
68 if (l->next == next) { in usb_slist_insert()
69 l->next = n; in usb_slist_insert()
70 n->next = next; in usb_slist_insert()
73 l = l->next; in usb_slist_insert()
81 while (tmp->next && tmp->next != n) { in usb_slist_remove()
82 tmp = tmp->next; in usb_slist_remove()
86 if (tmp->next != (usb_slist_t *)0) { in usb_slist_remove()
87 tmp->next = tmp->next->next; in usb_slist_remove()
96 const usb_slist_t *list = l->next; in usb_slist_len()
99 list = list->next; in usb_slist_len()
108 while (l->next) { in usb_slist_contains()
109 if (l->next == n) { in usb_slist_contains()
113 l = l->next; in usb_slist_contains()
121 return l->next; in usb_slist_head()
126 while (l->next) { in usb_slist_tail()
127 l = l->next; in usb_slist_tail()
135 return n->next; in usb_slist_next()
140 return l->next == NULL; in usb_slist_isempty()
175 usb_slist_entry((ptr)->next, type, member)
205 for (pos = (head)->next; pos != NULL; pos = pos->next)
207 #define usb_slist_for_each_safe(pos, next, head) \ argument
208 for (pos = (head)->next, next = pos->next; pos; \
209 pos = next, next = pos->next)
218 for (pos = usb_slist_entry((head)->next, typeof(*pos), member); \
220 pos = usb_slist_entry(pos->member.next, typeof(*pos), member))
223 for (pos = usb_slist_entry((head)->next, typeof(*pos), member), \
224 n = usb_slist_entry(pos->member.next, typeof(*pos), member); \
226 pos = n, n = usb_slist_entry(pos->member.next, typeof(*pos), member))
232 struct usb_dlist_node *next; /**< point to next node. */ member
244 l->next = l->prev = l; in usb_dlist_init()
255 l->next->prev = n; in usb_dlist_insert_after()
256 n->next = l->next; in usb_dlist_insert_after()
258 l->next = n; in usb_dlist_insert_after()
270 l->prev->next = n; in usb_dlist_insert_before()
274 n->next = l; in usb_dlist_insert_before()
283 n->next->prev = n->prev; in usb_dlist_remove()
284 n->prev->next = n->next; in usb_dlist_remove()
286 n->next = n->prev = n; in usb_dlist_remove()
315 return l->next == l; in usb_dlist_isempty()
327 while (p->next != l) { in usb_dlist_len()
328 p = p->next; in usb_dlist_len()
366 usb_dlist_entry((ptr)->next, type, member)
384 for (pos = (head)->next; pos != (head); pos = pos->next)
401 for (pos = (head)->next, n = pos->next; pos != (head); \
402 pos = n, n = pos->next)
414 for (pos = usb_dlist_entry((head)->next, typeof(*pos), member); \
416 pos = usb_dlist_entry(pos->member.next, typeof(*pos), member))
437 for (pos = usb_dlist_entry((head)->next, typeof(*pos), member), \
438 n = usb_dlist_entry(pos->member.next, typeof(*pos), member); \
440 pos = n, n = usb_dlist_entry(n->member.next, typeof(*n), member))