23     node->prev = node->next = node;  in list_node_init()
47 static inline void _mpp_list_add(MppListNode * _new, MppListNode * prev, MppListNode * next)  in _mpp_list_add()  argument
49     next->prev = _new;  in _mpp_list_add()
51     _new->prev = prev;  in _mpp_list_add()
52     prev->next = _new;  in _mpp_list_add()
62     _mpp_list_add(_new, head->prev, head);  in mpp_list_add_tail()
116 static inline void _mpp_list_del(MppListNode *prev, MppListNode *next)  in _mpp_list_del()  argument
118     next->prev = prev;  in _mpp_list_del()
119     prev->next = next;  in _mpp_list_del()
124     _mpp_list_del(node->prev, node->next);  in mpp_list_del_init()
151         _list_del_node_no_lock(list->head->prev, data, size);  in mpp_list_del_at_tail()
492             a->prev = tail;  in merge_final()
499             b->prev = tail;  in merge_final()
521         b->prev = tail;  in merge_final()
528     head->prev = tail;  in merge_final()
536     if (list == head->prev) /* Zero or one elements */  in list_sort()
540     head->prev->next = NULL;  in list_sort()
566             tail = &(*tail)->prev;  in list_sort()
569             struct list_head *a = *tail, *b = a->prev;  in list_sort()
573             a->prev = b->prev;  in list_sort()
578         list->prev = pending;  in list_sort()
587     pending = pending->prev;  in list_sort()
589         struct list_head *next = pending->prev;  in list_sort()