Lines Matching refs:type
152 #define QUEUE_TYPEOF(type) type
154 #define QUEUE_TYPEOF(type) struct type
160 #define SLIST_HEAD(name, type) \
162 struct type *slh_first; /* first element */ \
165 #define SLIST_CLASS_HEAD(name, type) \
167 class type *slh_first; /* first element */ \
173 #define SLIST_ENTRY(type) \
175 struct type *sle_next; /* next element */ \
178 #define SLIST_CLASS_ENTRY(type) \
180 class type *sle_next; /* next element */ \
231 #define SLIST_REMOVE(head, elm, type, field) do { \
237 QUEUE_TYPEOF(type) *curelm = SLIST_FIRST(head); \
254 #define SLIST_SWAP(head1, head2, type) do { \
255 QUEUE_TYPEOF(type) *swap_first = SLIST_FIRST(head1); \
263 #define STAILQ_HEAD(name, type) \
265 struct type *stqh_first;/* first element */ \
266 struct type **stqh_last;/* addr of last next element */ \
269 #define STAILQ_CLASS_HEAD(name, type) \
271 class type *stqh_first; /* first element */ \
272 class type **stqh_last; /* addr of last next element */ \
278 #define STAILQ_ENTRY(type) \
280 struct type *stqe_next; /* next element */ \
283 #define STAILQ_CLASS_ENTRY(type) \
285 class type *stqe_next; /* next element */ \
346 #define STAILQ_LAST(head, type, field) \
349 QUEUE_TYPEOF(type), field.stqe_next))
353 #define STAILQ_REMOVE(head, elm, type, field) do { \
359 QUEUE_TYPEOF(type) *curelm = STAILQ_FIRST(head); \
379 #define STAILQ_SWAP(head1, head2, type) do { \
380 QUEUE_TYPEOF(type) *swap_first = STAILQ_FIRST(head1); \
381 QUEUE_TYPEOF(type) **swap_last = (head1)->stqh_last; \
396 #define LIST_HEAD(name, type) \
398 struct type *lh_first; /* first element */ \
401 #define LIST_CLASS_HEAD(name, type) \
403 class type *lh_first; /* first element */ \
409 #define LIST_ENTRY(type) \
411 struct type *le_next; /* next element */ \
412 struct type **le_prev; /* address of previous next element */ \
415 #define LIST_CLASS_ENTRY(type) \
417 class type *le_next; /* next element */ \
418 class type **le_prev; /* address of previous next element */ \
505 #define LIST_PREV(elm, head, type, field) \
508 QUEUE_TYPEOF(type), field.le_next))
523 #define LIST_SWAP(head1, head2, type, field) do { \
524 QUEUE_TYPEOF(type) *swap_tmp = LIST_FIRST(head1); \
536 #define TAILQ_HEAD(name, type) \
538 struct type *tqh_first; /* first element */ \
539 struct type **tqh_last; /* addr of last next element */ \
543 #define TAILQ_CLASS_HEAD(name, type) \
545 class type *tqh_first; /* first element */ \
546 class type **tqh_last; /* addr of last next element */ \
553 #define TAILQ_ENTRY(type) \
555 struct type *tqe_next; /* next element */ \
556 struct type **tqe_prev; /* address of previous next element */ \
560 #define TAILQ_CLASS_ENTRY(type) \
562 class type *tqe_next; /* next element */ \
563 class type **tqe_prev; /* address of previous next element */ \
736 #define TAILQ_SWAP(head1, head2, type, field) do { \
737 QUEUE_TYPEOF(type) *swap_first = (head1)->tqh_first; \
738 QUEUE_TYPEOF(type) **swap_last = (head1)->tqh_last; \