148 #define	CK_SLIST_NEXT(elm, field)						\  argument
149 	ck_pr_load_ptr(&((elm)->field.csle_next))
182 #define	CK_SLIST_INSERT_HEAD(head, elm, field) do {				\  argument
183 	(elm)->field.csle_next = (head)->cslh_first;				\
185 	ck_pr_store_ptr(&(head)->cslh_first, elm);				\
188 #define	CK_SLIST_INSERT_PREVPTR(prevp, slistelm, elm, field) do {		\  argument
189 	(elm)->field.csle_next = (slistelm);					\
191 	ck_pr_store_ptr(prevp, elm);						\
194 #define CK_SLIST_REMOVE_AFTER(elm, field) do {					\  argument
195 	ck_pr_store_ptr(&(elm)->field.csle_next,				\
196 	    (elm)->field.csle_next->field.csle_next);				\
199 #define	CK_SLIST_REMOVE(head, elm, type, field) do {				\  argument
200 	if ((head)->cslh_first == (elm)) {					\
204 		while (curelm->field.csle_next != (elm))			\
215 #define CK_SLIST_REMOVE_PREVPTR(prevp, elm, field) do {				\  argument
216 	ck_pr_store_ptr(prevptr, (elm)->field.csle_next);			\
287 #define	CK_STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {			\  argument
288 	(elm)->field.cstqe_next = (tqelm)->field.cstqe_next;			\
290 	ck_pr_store_ptr(&(tqelm)->field.cstqe_next, elm);			\
291 	if ((elm)->field.cstqe_next == NULL)					\
292 		(head)->cstqh_last = &(elm)->field.cstqe_next;			\
295 #define	CK_STAILQ_INSERT_HEAD(head, elm, field) do {				\  argument
296 	(elm)->field.cstqe_next = (head)->cstqh_first;				\
298 	ck_pr_store_ptr(&(head)->cstqh_first, elm);				\
299 	if ((elm)->field.cstqe_next == NULL)					\
300 		(head)->cstqh_last = &(elm)->field.cstqe_next;			\
303 #define	CK_STAILQ_INSERT_TAIL(head, elm, field) do {				\  argument
304 	(elm)->field.cstqe_next = NULL;						\
306 	ck_pr_store_ptr((head)->cstqh_last, (elm));				\
307 	(head)->cstqh_last = &(elm)->field.cstqe_next;				\
310 #define	CK_STAILQ_NEXT(elm, field)						\  argument
311 	(ck_pr_load_ptr(&(elm)->field.cstqe_next))
313 #define	CK_STAILQ_REMOVE(head, elm, type, field) do {				\  argument
314 	if ((head)->cstqh_first == (elm)) {					\
318 		while (curelm->field.cstqe_next != (elm))			\
324 #define CK_STAILQ_REMOVE_AFTER(head, elm, field) do {				\  argument
325 	ck_pr_store_ptr(&(elm)->field.cstqe_next,				\
326 	    (elm)->field.cstqe_next->field.cstqe_next);				\
327 	if ((elm)->field.cstqe_next == NULL)					\
328 		(head)->cstqh_last = &(elm)->field.cstqe_next;			\
380 #define	CK_LIST_NEXT(elm, field)	ck_pr_load_ptr(&(elm)->field.cle_next)  argument
402 #define	CK_LIST_INSERT_AFTER(listelm, elm, field) do {				\  argument
403 	(elm)->field.cle_next = (listelm)->field.cle_next;			\
404 	(elm)->field.cle_prev = &(listelm)->field.cle_next;			\
407 		(listelm)->field.cle_next->field.cle_prev = &(elm)->field.cle_next;\
408 	ck_pr_store_ptr(&(listelm)->field.cle_next, elm);			\
411 #define	CK_LIST_INSERT_BEFORE(listelm, elm, field) do {				\  argument
412 	(elm)->field.cle_prev = (listelm)->field.cle_prev;			\
413 	(elm)->field.cle_next = (listelm);					\
415 	ck_pr_store_ptr((listelm)->field.cle_prev, (elm));			\
416 	(listelm)->field.cle_prev = &(elm)->field.cle_next;			\
419 #define	CK_LIST_INSERT_HEAD(head, elm, field) do {				\  argument
420 	(elm)->field.cle_next = (head)->clh_first;				\
422 	if ((elm)->field.cle_next != NULL)					\
423 		(head)->clh_first->field.cle_prev =  &(elm)->field.cle_next;	\
424 	ck_pr_store_ptr(&(head)->clh_first, elm);				\
425 	(elm)->field.cle_prev = &(head)->clh_first;				\
428 #define	CK_LIST_REMOVE(elm, field) do {						\  argument
429 	ck_pr_store_ptr((elm)->field.cle_prev, (elm)->field.cle_next);		\
430 	if ((elm)->field.cle_next != NULL)					\
431 		(elm)->field.cle_next->field.cle_prev = (elm)->field.cle_prev;	\