34 QDF_STATUS qdf_list_insert_before(qdf_list_t *list,  in qdf_list_insert_before()  argument
38 	list->count++;  in qdf_list_insert_before()
44 QDF_STATUS qdf_list_insert_after(qdf_list_t *list,  in qdf_list_insert_after()  argument
48 	list->count++;  in qdf_list_insert_after()
61 QDF_STATUS qdf_list_insert_front(qdf_list_t *list, qdf_list_node_t *node)  in qdf_list_insert_front()  argument
63 	list_add(node, &list->anchor);  in qdf_list_insert_front()
64 	list->count++;  in qdf_list_insert_front()
76 QDF_STATUS qdf_list_insert_back(qdf_list_t *list, qdf_list_node_t *node)  in qdf_list_insert_back()  argument
78 	list_add_tail(node, &list->anchor);  in qdf_list_insert_back()
79 	list->count++;  in qdf_list_insert_back()
93 QDF_STATUS qdf_list_insert_back_size(qdf_list_t *list,  in qdf_list_insert_back_size()  argument
96 	list_add_tail(node, &list->anchor);  in qdf_list_insert_back_size()
97 	list->count++;  in qdf_list_insert_back_size()
98 	*p_size = list->count;  in qdf_list_insert_back_size()
110 QDF_STATUS qdf_list_remove_front(qdf_list_t *list, qdf_list_node_t **node2)  in qdf_list_remove_front()  argument
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()
120 	list->count--;  in qdf_list_remove_front()
133 QDF_STATUS qdf_list_remove_back(qdf_list_t *list, qdf_list_node_t **node2)  in qdf_list_remove_back()  argument
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()
143 	list->count--;  in qdf_list_remove_back()
149 bool qdf_list_has_node(qdf_list_t *list, qdf_list_node_t *node)  in qdf_list_has_node()  argument
153 	list_for_each(tmp, &list->anchor) {  in qdf_list_has_node()
172 QDF_STATUS qdf_list_remove_node(qdf_list_t *list,  in qdf_list_remove_node()  argument
175 	if (list_empty(&list->anchor))  in qdf_list_remove_node()
179 	list->count--;  in qdf_list_remove_node()
192 QDF_STATUS qdf_list_peek_front(qdf_list_t *list, qdf_list_node_t **node2)  in qdf_list_peek_front()  argument
196 	if (list_empty(&list->anchor))  in qdf_list_peek_front()
199 	listptr = list->anchor.next;  in qdf_list_peek_front()
214 QDF_STATUS qdf_list_peek_next(qdf_list_t *list,  in qdf_list_peek_next()  argument
218 	if (!list || !node || !node2)  in qdf_list_peek_next()
221 	if (list_empty(&list->anchor))  in qdf_list_peek_next()
224 	if (node->next == &list->anchor)  in qdf_list_peek_next()
239 bool qdf_list_empty(qdf_list_t *list)  in qdf_list_empty()  argument
241 	return list_empty(&list->anchor);  in qdf_list_empty()
266 QDF_STATUS qdf_list_split(qdf_list_t *new, qdf_list_t *list,  in qdf_list_split()  argument
272 	list_cut_position(&new->anchor, &list->anchor, node);  in qdf_list_split()
278 	list->count = list->count - new->count;  in qdf_list_split()