28   head->prev = head;  in ares__init_list_head()
35   node->prev = NULL;  in ares__init_list_node()
42   return ((head->next == head) && (head->prev == head));  in ares__is_list_empty()
49   new_node->prev = old_node->prev;  in ares__insert_in_list()
50   old_node->prev->next = new_node;  in ares__insert_in_list()
51   old_node->prev = new_node;  in ares__insert_in_list()
57     node->prev->next = node->next;  in ares__remove_from_list()
58     node->next->prev = node->prev;  in ares__remove_from_list()
59     node->prev = NULL;  in ares__remove_from_list()
76     old_a.next->prev = head_b;  in ares__swap_lists()
77     old_a.prev->next = head_b;  in ares__swap_lists()
83     old_b.next->prev = head_a;  in ares__swap_lists()
84     old_b.prev->next = head_a;  in ares__swap_lists()