56 #define __qdf_slist_item(node, cursor, node_field) ({ \  argument
58 	(__n ? qdf_container_of(__n, typeof(*(cursor)), node_field) : NULL); })
60 #define __qdf_slist_next_item(slist, cursor, node_field) \  argument
61 	__qdf_slist_item(cursor ? (cursor)->node_field.next : \
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); \
72 	     cursor; \
73 	     cursor = __qdf_slist_item((cursor)->node_field.next, \
74 				       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); \
87 	     cursor; \
89 		cursor ? cursor : prev, \
90 	     cursor = __qdf_slist_next_item(slist, prev, node_field))
134 #define qdf_slist_push(slist, cursor, node_field) \  argument
135 	__qdf_slist_push(slist, &(cursor)->node_field)
152 #define qdf_slist_pop(slist, cursor, node_field) \  argument
153 	__qdf_slist_item(__qdf_slist_pop(slist), cursor, node_field)