36     MppListNode     *head;  member
87 #define list_for_each_safe(pos, n, head) \  argument
88     for (pos = (head)->next, n = pos->next; pos != (head); \
112 #define list_for_each_entry(pos, head, type, member) \  argument
113     for (pos = list_entry((head)->next, type, member); \
114          &pos->member != (head); \
117 #define list_for_each_entry_safe(pos, n, head, type, member) \  argument
118     for (pos = list_first_entry(head, type, member),  \
120          &pos->member != (head);                    \
123 #define list_for_each_entry_reverse(pos, head, type, member) \  argument
124     for (pos = list_last_entry(head, type, member); \
125          &pos->member != (head); \
128 #define list_for_each_entry_safe_reverse(pos, n, head, type, member) \  argument
129     for (pos = list_last_entry(head, type, member),  \
131          &pos->member != (head);                    \
144 static __inline void list_add(struct list_head *_new, struct list_head *head)  in list_add()  argument
146     __list_add(_new, head, head->next);  in list_add()
149 static __inline void list_add_tail(struct list_head *_new, struct list_head *head)  in list_add_tail()  argument
151     __list_add(_new, head->prev, head);  in list_add_tail()
167 static __inline void list_move(struct list_head *list, struct list_head *head)  in list_move()  argument
170     list_add(list, head);  in list_move()
173 static __inline void list_move_tail(struct list_head *list, struct list_head *head)  in list_move_tail()  argument
176     list_add_tail(list, head);  in list_move_tail()
179 static __inline int list_is_last(const struct list_head *list, const struct list_head *head)  in list_is_last()  argument
181     return list->next == head;  in list_is_last()
184 static __inline int list_empty(struct list_head *head)  in list_empty()  argument
186     return head->next == head;  in list_empty()
191 void list_sort(void *priv, struct list_head *head, ListCmpFunc cmp);