10     struct List *prev, *next;  member
18     list->prev = list;  in list_init()
32     node->prev = entry;  in list_add()
34     node->next->prev = node;  in list_add()
47     struct List *tail = entry->prev;  in list_append()
58     entry->next->prev = entry->prev;  in list_del()
59     entry->prev->next = entry->next;  in list_del()
78     if (old->prev != NULL)  in list_replace()
79         old->prev->next = new;  in list_replace()
80     new->prev = old->prev;  in list_replace()
82         old->next->prev = new;  in list_replace()
85     old->prev = NULL;  in list_replace()
96     if (entry == entry->next && entry->prev == entry)  in list_empty()
110     if (entry->prev != NULL)  in list_prev()
111         return entry->prev;  in list_prev()
167 #define list_last_entry(ptr, type, member) list_entry((ptr)->prev, type, member)
177 #define list_last_entry_or_full(ptr, type, member) (!list_empty(ptr) ? list_entry((ptr)->prev, type…
193 #define list_prev_entry(pos, member) list_entry((pos)->member.prev, typeof(*(pos)), member)
211     for ((ptr) = (head)->prev; (ptr) != (head); (ptr) = (ptr)->prev)
233     for ((ptr) = (head)->prev, (n) = (ptr)->prev; (ptr) != (head); (ptr) = n, n = (ptr)->prev)