63 	list_add(node, &list->anchor);  in qdf_list_insert_front()
78 	list_add_tail(node, &list->anchor);  in qdf_list_insert_back()
96 	list_add_tail(node, &list->anchor);  in qdf_list_insert_back_size()
114 	if (list_empty(&list->anchor))  in qdf_list_remove_front()
117 	listptr = list->anchor.next;  in qdf_list_remove_front()
119 	list_del_init(list->anchor.next);  in qdf_list_remove_front()
137 	if (list_empty(&list->anchor))  in qdf_list_remove_back()
140 	listptr = list->anchor.prev;  in qdf_list_remove_back()
142 	list_del_init(list->anchor.prev);  in qdf_list_remove_back()
153 	list_for_each(tmp, &list->anchor) {  in qdf_list_has_node()
175 	if (list_empty(&list->anchor))  in qdf_list_remove_node()
196 	if (list_empty(&list->anchor))  in qdf_list_peek_front()
199 	listptr = list->anchor.next;  in qdf_list_peek_front()
221 	if (list_empty(&list->anchor))  in qdf_list_peek_next()
224 	if (node->next == &list->anchor)  in qdf_list_peek_next()
241 	return list_empty(&list->anchor);  in qdf_list_empty()
272 	list_cut_position(&new->anchor, &list->anchor, node);  in qdf_list_split()
274 	list_for_each(cur_node, &new->anchor)  in qdf_list_split()
287 	list_splice_tail_init(&list2->anchor, &list1->anchor);  in qdf_list_join()