148 #define	CK_SLIST_NEXT(elm, field)						\  argument
151 #define	CK_SLIST_FOREACH(var, head, field)					\  argument
156 #define	CK_SLIST_FOREACH_SAFE(var, head, field, tvar)				 \  argument
161 #define	CK_SLIST_FOREACH_PREVPTR(var, varp, head, field)			\  argument
171 #define	CK_SLIST_INSERT_AFTER(a, b, field) do {					\  argument
177 #define	CK_SLIST_INSERT_HEAD(head, elm, field) do {				\  argument
183 #define CK_SLIST_REMOVE_AFTER(elm, field) do {					\  argument
188 #define	CK_SLIST_REMOVE(head, elm, type, field) do {				\  argument
199 #define	CK_SLIST_REMOVE_HEAD(head, field) do {					\  argument
204 #define CK_SLIST_MOVE(head1, head2, field) do {					\  argument
250 #define	CK_STAILQ_FOREACH(var, head, field)				\  argument
255 #define	CK_STAILQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
267 #define	CK_STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {			\  argument
275 #define	CK_STAILQ_INSERT_HEAD(head, elm, field) do {				\  argument
283 #define	CK_STAILQ_INSERT_TAIL(head, elm, field) do {				\  argument
290 #define	CK_STAILQ_NEXT(elm, field)						\  argument
293 #define	CK_STAILQ_REMOVE(head, elm, type, field) do {				\  argument
304 #define CK_STAILQ_REMOVE_AFTER(head, elm, field) do {				\  argument
311 #define	CK_STAILQ_REMOVE_HEAD(head, field) do {					\  argument
318 #define CK_STAILQ_MOVE(head1, head2, field) do {				\  argument
360 #define	CK_LIST_NEXT(elm, field)	ck_pr_load_ptr(&(elm)->field.le_next)  argument
362 #define	CK_LIST_FOREACH(var, head, field)					\  argument
367 #define	CK_LIST_FOREACH_SAFE(var, head, field, tvar)				  \  argument
377 #define	CK_LIST_INSERT_AFTER(listelm, elm, field) do {				\  argument
386 #define	CK_LIST_INSERT_BEFORE(listelm, elm, field) do {				\  argument
394 #define	CK_LIST_INSERT_HEAD(head, elm, field) do {				\  argument
403 #define	CK_LIST_REMOVE(elm, field) do {						\  argument
409 #define CK_LIST_MOVE(head1, head2, field) do {				\  argument
418 #define CK_LIST_SWAP(head1, head2, type, field) do {			\  argument