Lines Matching refs:type
149 #define SLIST_HEAD(name, type) \
151 struct type *slh_first; /* first element */ \
157 #define SLIST_ENTRY(type) \
159 struct type *sle_next; /* next element */ \
210 #define SLIST_REMOVE(head, elm, type, field) do { \
216 struct type *curelm = SLIST_FIRST((head)); \
233 #define SLIST_SWAP(head1, head2, type) do { \
234 struct type *swap_first = SLIST_FIRST(head1); \
242 #define STAILQ_HEAD(name, type) \
244 struct type *stqh_first;/* first element */ \
245 struct type **stqh_last;/* addr of last next element */ \
251 #define STAILQ_ENTRY(type) \
253 struct type *stqe_next; /* next element */ \
314 #define STAILQ_LAST(head, type, field) \
316 __containerof((head)->stqh_last, struct type, field.stqe_next))
320 #define STAILQ_REMOVE(head, elm, type, field) do { \
326 struct type *curelm = STAILQ_FIRST((head)); \
346 #define STAILQ_SWAP(head1, head2, type) do { \
347 struct type *swap_first = STAILQ_FIRST(head1); \
348 struct type **swap_last = (head1)->stqh_last; \
363 #define LIST_HEAD(name, type) \
365 struct type *lh_first; /* first element */ \
371 #define LIST_ENTRY(type) \
373 struct type *le_next; /* next element */ \
374 struct type **le_prev; /* address of previous next element */ \
461 #define LIST_PREV(elm, head, type, field) \
463 __containerof((elm)->field.le_prev, struct type, field.le_next))
478 #define LIST_SWAP(head1, head2, type, field) do { \
479 struct type *swap_tmp = LIST_FIRST((head1)); \
491 #define TAILQ_HEAD(name, type) \
493 struct type *tqh_first; /* first element */ \
494 struct type **tqh_last; /* addr of last next element */ \
501 #define TAILQ_ENTRY(type) \
503 struct type *tqe_next; /* next element */ \
504 struct type **tqe_prev; /* address of previous next element */ \
677 #define TAILQ_SWAP(head1, head2, type, field) do { \
678 struct type *swap_first = (head1)->tqh_first; \
679 struct type **swap_last = (head1)->tqh_last; \