Lines Matching refs:type
176 #define SLIST_HEAD(name, type) \
178 struct type *slh_first; /* first element */ \
184 #define SLIST_ENTRY(type) \
186 struct type *sle_next; /* next element */ \
227 #define SLIST_REMOVE(head, elm, type, field) do { \
232 struct type *curelm = SLIST_FIRST((head)); \
248 #define STAILQ_HEAD(name, type) \
250 struct type *stqh_first;/* first element */ \
251 struct type **stqh_last;/* addr of last next element */ \
257 #define STAILQ_ENTRY(type) \
259 struct type *stqe_next; /* next element */ \
311 #define STAILQ_LAST(head, type, field) \
314 ((struct type *)(void *) \
315 ((char *)((head)->stqh_last) - __offsetof(struct type, field))))
319 #define STAILQ_REMOVE(head, elm, type, field) do { \
324 struct type *curelm = STAILQ_FIRST((head)); \
348 #define LIST_HEAD(name, type) \
350 struct type *lh_first; /* first element */ \
356 #define LIST_ENTRY(type) \
358 struct type *le_next; /* next element */ \
359 struct type **le_prev; /* address of previous next element */ \
450 #define TAILQ_HEAD(name, type) \
452 struct type *tqh_first; /* first element */ \
453 struct type **tqh_last; /* addr of last next element */ \
460 #define TAILQ_ENTRY(type) \
462 struct type *tqe_next; /* next element */ \
463 struct type **tqe_prev; /* address of previous next element */ \
580 #define CIRCLEQ_HEAD(name, type) \
582 struct type *cqh_first; /* first element */ \
583 struct type *cqh_last; /* last element */ \
586 #define CIRCLEQ_ENTRY(type) \
588 struct type *cqe_next; /* next element */ \
589 struct type *cqe_prev; /* previous element */ \