56 #define __qdf_slist_item(node, cursor, node_field) ({ \  argument
57 	struct qdf_slist_node *__n = (node); \
138 __qdf_slist_push(struct qdf_slist *slist, struct qdf_slist_node *node)  in __qdf_slist_push()  argument
140 	node->next = slist->head;  in __qdf_slist_push()
141 	slist->head = node;  in __qdf_slist_push()
157 	struct qdf_slist_node *node = slist->head;  in __qdf_slist_pop()  local
159 	if (!node)  in __qdf_slist_pop()
162 	slist->head = node->next;  in __qdf_slist_pop()
163 	node->next = __qdf_slist_poison;  in __qdf_slist_pop()
165 	return node;  in __qdf_slist_pop()
183 	struct qdf_slist_node *node;  in __qdf_slist_remove()  local
191 	node = prev->next;  in __qdf_slist_remove()
192 	prev->next = node->next;  in __qdf_slist_remove()
193 	node->next = __qdf_slist_poison;  in __qdf_slist_remove()
195 	return node;  in __qdf_slist_remove()