Lines Matching refs:field
148 #define CK_SLIST_NEXT(elm, field) \ argument
149 ck_pr_load_ptr(&((elm)->field.csle_next))
151 #define CK_SLIST_FOREACH(var, head, field) \ argument
154 (var) = CK_SLIST_NEXT((var), field))
156 #define CK_SLIST_FOREACH_FROM(var, head, field) \ argument
159 (var) = CK_SLIST_NEXT((var), field))
161 #define CK_SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
163 (var) && ((tvar) = CK_SLIST_NEXT(var, field), 1); \
166 #define CK_SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
169 (varp) = &(var)->field.csle_next)
176 #define CK_SLIST_INSERT_AFTER(a, b, field) do { \ argument
177 (b)->field.csle_next = (a)->field.csle_next; \
179 ck_pr_store_ptr(&(a)->field.csle_next, b); \
182 #define CK_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
183 (elm)->field.csle_next = (head)->cslh_first; \
188 #define CK_SLIST_INSERT_PREVPTR(prevp, slistelm, elm, field) do { \ argument
189 (elm)->field.csle_next = (slistelm); \
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
201 CK_SLIST_REMOVE_HEAD((head), field); \
204 while (curelm->field.csle_next != (elm)) \
205 curelm = curelm->field.csle_next; \
206 CK_SLIST_REMOVE_AFTER(curelm, field); \
210 #define CK_SLIST_REMOVE_HEAD(head, field) do { \ argument
212 (head)->cslh_first->field.csle_next); \
215 #define CK_SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \ argument
216 ck_pr_store_ptr(prevptr, (elm)->field.csle_next); \
219 #define CK_SLIST_MOVE(head1, head2, field) do { \ argument
265 #define CK_STAILQ_FOREACH(var, head, field) \ argument
268 (var) = CK_STAILQ_NEXT((var), field))
270 #define CK_STAILQ_FOREACH_FROM(var, head, field) \ argument
273 (var) = CK_STAILQ_NEXT((var), field))
275 #define CK_STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
278 CK_STAILQ_NEXT((var), field), 1); \
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; \
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; \
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
315 CK_STAILQ_REMOVE_HEAD((head), field); \
318 while (curelm->field.cstqe_next != (elm)) \
319 curelm = curelm->field.cstqe_next; \
320 CK_STAILQ_REMOVE_AFTER(head, curelm, field); \
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; \
331 #define CK_STAILQ_REMOVE_HEAD(head, field) do { \ argument
333 (head)->cstqh_first->field.cstqe_next); \
338 #define CK_STAILQ_MOVE(head1, head2, field) do { \ argument
380 #define CK_LIST_NEXT(elm, field) ck_pr_load_ptr(&(elm)->field.cle_next) argument
382 #define CK_LIST_FOREACH(var, head, field) \ argument
385 (var) = CK_LIST_NEXT((var), field))
387 #define CK_LIST_FOREACH_FROM(var, head, field) \ argument
390 (var) = CK_LIST_NEXT((var), field))
392 #define CK_LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
394 (var) && ((tvar) = CK_LIST_NEXT((var), field), 1); \
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; \
406 if ((listelm)->field.cle_next != NULL) \
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; \
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; \
434 #define CK_LIST_MOVE(head1, head2, field) do { \ argument
437 (head1)->clh_first->field.cle_prev = &(head1)->clh_first; \
443 #define CK_LIST_SWAP(head1, head2, type, field) do { \ argument
448 swap_tmp->field.cle_prev = &(head1)->clh_first; \
450 swap_tmp->field.cle_prev = &(head2)->clh_first; \