84 #define qdf_slist_for_each_del(slist, prev, cursor, node_field) \  argument
85 	for (prev = NULL, \
88 	     prev = __qdf_slist_next_item(slist, prev, node_field) == \
89 		cursor ? cursor : prev, \
90 	     cursor = __qdf_slist_next_item(slist, prev, node_field))
176 #define qdf_slist_remove(slist, prev, node_field) \  argument
178 			 prev ? &(prev)->node_field : NULL), prev, node_field)
181 __qdf_slist_remove(struct qdf_slist *slist, struct qdf_slist_node *prev)  in __qdf_slist_remove()  argument
185 	if (!prev)  in __qdf_slist_remove()
188 	if (!prev->next)  in __qdf_slist_remove()
191 	node = prev->next;  in __qdf_slist_remove()
192 	prev->next = node->next;  in __qdf_slist_remove()