30     MppListNode     *next;  member
75     struct list_head *next, *prev;  member
84         (ptr)->next = (ptr); (ptr)->prev = (ptr); \
88     for (pos = (head)->next, n = pos->next; pos != (head); \
89          pos = n, n = pos->next)
95         list_entry((ptr)->next, type, member)
102         struct list_head *pos__ = head__->next; \
107         list_entry((pos)->member.next, type, member)
113     for (pos = list_entry((head)->next, type, member); \
136                                 struct list_head * next)  in __list_add()  argument
138     next->prev = _new;  in __list_add()
139     _new->next = next;  in __list_add()
141     prev->next = _new;  in __list_add()
146     __list_add(_new, head, head->next);  in list_add()
154 static __inline void __list_del(struct list_head * prev, struct list_head * next)  in __list_del()  argument
156     next->prev = prev;  in __list_del()
157     prev->next = next;  in __list_del()
162     __list_del(entry->prev, entry->next);  in list_del_init()
169     __list_del(list->prev, list->next);  in list_move()
175     __list_del(list->prev, list->next);  in list_move_tail()
181     return list->next == head;  in list_is_last()
186     return head->next == head;  in list_empty()