Lines Matching refs:head
94 static inline int dlist_empty(const dlist_t *head) in dlist_empty() argument
96 return head->next == head; in dlist_empty()
122 #define dlist_for_each(pos, head) \ argument
123 for (pos = (head)->next; pos != (head); pos = pos->next)
132 #define dlist_for_each_safe(pos, n, head) \ argument
133 for (pos = (head)->next, n = pos->next; pos != (head); \
183 #define dlist_for_each_entry_reverse(pos, head, member, type) \ argument
184 for (pos = list_entry((head)->prev, type, member); \
185 &pos->member != (head); \
215 static inline void slist_add(slist_t *node, slist_t *head) in slist_add() argument
217 node->next = head->next; in slist_add()
218 head->next = node; in slist_add()
221 void slist_add_tail(slist_t *node, slist_t *head);
223 static inline void slist_del(slist_t *node, slist_t *head) in slist_del() argument
225 while (head->next) { in slist_del()
226 if (head->next == node) { in slist_del()
227 head->next = node->next; in slist_del()
231 head = head->next; in slist_del()
235 static inline int slist_empty(const slist_t *head) in slist_empty() argument
237 return !head->next; in slist_empty()
240 static inline void slist_init(slist_t *head) in slist_init() argument
242 head->next = 0; in slist_init()