60 #define __qdf_slist_next_item(slist, cursor, node_field) \  argument
62 			 (slist)->head, cursor, node_field)
70 #define qdf_slist_for_each(slist, cursor, node_field) \  argument
71 	for (cursor = __qdf_slist_item((slist)->head, cursor, node_field); \
84 #define qdf_slist_for_each_del(slist, prev, cursor, node_field) \  argument
86 	     cursor = __qdf_slist_item((slist)->head, cursor, node_field); \
88 	     prev = __qdf_slist_next_item(slist, prev, node_field) == \
90 	     cursor = __qdf_slist_next_item(slist, prev, node_field))
98 static inline void qdf_slist_init(struct qdf_slist *slist)  in qdf_slist_init()  argument
100 	slist->head = NULL;  in qdf_slist_init()
109 static inline void qdf_slist_deinit(struct qdf_slist *slist)  in qdf_slist_deinit()  argument
111 	QDF_BUG(!slist->head);  in qdf_slist_deinit()
112 	slist->head = __qdf_slist_poison;  in qdf_slist_deinit()
121 static inline bool qdf_slist_empty(struct qdf_slist *slist)  in qdf_slist_empty()  argument
123 	return !slist->head;  in qdf_slist_empty()
134 #define qdf_slist_push(slist, cursor, node_field) \  argument
135 	__qdf_slist_push(slist, &(cursor)->node_field)
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()
152 #define qdf_slist_pop(slist, cursor, node_field) \  argument
153 	__qdf_slist_item(__qdf_slist_pop(slist), cursor, node_field)
155 static inline struct qdf_slist_node *__qdf_slist_pop(struct qdf_slist *slist)  in __qdf_slist_pop()  argument
157 	struct qdf_slist_node *node = slist->head;  in __qdf_slist_pop()
162 	slist->head = node->next;  in __qdf_slist_pop()
176 #define qdf_slist_remove(slist, prev, node_field) \  argument
177 	__qdf_slist_item(__qdf_slist_remove(slist, \
181 __qdf_slist_remove(struct qdf_slist *slist, struct qdf_slist_node *prev)  in __qdf_slist_remove()  argument
186 		return __qdf_slist_pop(slist);  in __qdf_slist_remove()