10     struct List *prev, *next;  member
16     list->next = list;  in list_init()
30     node->next = entry->next;  in list_add()
34     node->next->prev = node;  in list_add()
36     entry->next = node;  in list_add()
58     entry->next->prev = entry->prev;  in list_del()
59     entry->prev->next = entry->next;  in list_del()
79         old->prev->next = new;  in list_replace()
81     if (old->next != NULL)  in list_replace()
82         old->next->prev = new;  in list_replace()
83     new->next = old->next;  in list_replace()
86     old->next = NULL;  in list_replace()
96     if (entry == entry->next && entry->prev == entry)  in list_empty()
124     if (entry->next != NULL)  in list_next()
125         return entry->next;  in list_next()
147 #define list_first_entry(ptr, type, member) list_entry((ptr)->next, type, member)
157 #define list_first_entry_or_null(ptr, type, member) (!list_empty(ptr) ? list_entry((ptr)->next, typ…
185 #define list_next_entry(pos, member) list_entry((pos)->member.next, typeof(*(pos)), member)
202     for ((ptr) = (head)->next; (ptr) != (head); (ptr) = (ptr)->next)
222     for ((ptr) = (head)->next, (n) = (ptr)->next; (ptr) != (head); (ptr) = n, n = (ptr)->next)