Lines Matching refs:type
53 #define SH_LIST_FIRSTP(head, type) \ argument
54 ((struct type *)(((u_int8_t *)(head)) + (head)->slh_first))
56 #define SH_LIST_FIRST(head, type) \ argument
58 ((struct type *)(((u_int8_t *)(head)) + (head)->slh_first)))
60 #define SH_LIST_NEXTP(elm, field, type) \ argument
61 ((struct type *)(((u_int8_t *)(elm)) + (elm)->field.sle_next))
63 #define SH_LIST_NEXT(elm, field, type) \ argument
65 ((struct type *)(((u_int8_t *)(elm)) + (elm)->field.sle_next)))
85 #define SH_LIST_INSERT_AFTER(listelm, elm, field, type) do { \ argument
88 SH_LIST_NEXTP(listelm, field, type)); \
89 SH_LIST_NEXTP(listelm, field, type)->field.sle_prev = \
97 #define SH_LIST_INSERT_HEAD(head, elm, field, type) do { \ argument
101 SH_LIST_FIRSTP(head, type)->field.sle_prev = \
109 #define SH_LIST_REMOVE(elm, field, type) do { \ argument
111 SH_LIST_NEXTP(elm, field, type)->field.sle_prev = \
136 #define SH_TAILQ_FIRSTP(head, type) \ argument
137 ((struct type *)((u_int8_t *)(head) + (head)->stqh_first))
139 #define SH_TAILQ_FIRST(head, type) \ argument
140 ((head)->stqh_first == -1 ? NULL : SH_TAILQ_FIRSTP(head, type))
142 #define SH_TAILQ_NEXTP(elm, field, type) \ argument
143 ((struct type *)((u_int8_t *)(elm) + (elm)->field.stqe_next))
145 #define SH_TAILQ_NEXT(elm, field, type) \ argument
146 ((elm)->field.stqe_next == -1 ? NULL : SH_TAILQ_NEXTP(elm, field, type))
164 #define SH_TAILQ_INSERT_HEAD(head, elm, field, type) do { \ argument
168 SH_TAILQ_FIRSTP(head, type)->field.stqe_prev = \
195 #define SH_TAILQ_INSERT_AFTER(head, listelm, elm, field, type) do { \ argument
199 SH_TAILQ_NEXTP(listelm, field, type)->field.stqe_prev = \
210 #define SH_TAILQ_REMOVE(head, elm, field, type) do { \ argument
212 SH_TAILQ_NEXTP(elm, field, type)->field.stqe_prev = \
215 field, type), elm); \
242 #define SH_CIRCLEQ_FIRSTP(head, type) \ argument
243 ((struct type *)(((u_int8_t *)(head)) + (head)->scqh_first))
245 #define SH_CIRCLEQ_FIRST(head, type) \ argument
247 (void *)head : SH_CIRCLEQ_FIRSTP(head, type))
249 #define SH_CIRCLEQ_LASTP(head, type) \ argument
250 ((struct type *)(((u_int8_t *)(head)) + (head)->scqh_last))
252 #define SH_CIRCLEQ_LAST(head, type) \ argument
253 ((head)->scqh_last == -1 ? (void *)head : SH_CIRCLEQ_LASTP(head, type))
255 #define SH_CIRCLEQ_NEXTP(elm, field, type) \ argument
256 ((struct type *)(((u_int8_t *)(elm)) + (elm)->field.scqe_next))
258 #define SH_CIRCLEQ_NEXT(head, elm, field, type) \ argument
260 (void *)head : SH_CIRCLEQ_NEXTP(elm, field, type))
262 #define SH_CIRCLEQ_PREVP(elm, field, type) \ argument
263 ((struct type *)(((u_int8_t *)(elm)) + (elm)->field.scqe_prev))
265 #define SH_CIRCLEQ_PREV(head, elm, field, type) \ argument
267 (void *)head : SH_CIRCLEQ_PREVP(elm, field, type))
276 #define SH_CIRCLEQ_INSERT_AFTER(head, listelm, elm, field, type) do { \ argument
280 if (SH_CIRCLEQ_NEXTP(listelm, field, type) == (void *)head) \
284 field, type)->field.scqe_prev = \
286 field, type), elm); \
290 #define SH_CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field, type) do { \ argument
293 SH_CIRCLEQ_PREVP(listelm, field, type)->field.scqe_next;\
294 if (SH_CIRCLEQ_PREVP(listelm, field, type) == (void *)(head)) \
298 field, type)->field.scqe_next = \
300 field, type), elm); \
304 #define SH_CIRCLEQ_INSERT_HEAD(head, elm, field, type) do { \ argument
311 SH_CIRCLEQ_FIRSTP(head, type)->field.scqe_prev = \
312 SH_PTR_TO_OFF(SH_CIRCLEQ_FIRSTP(head, type), elm); \
316 #define SH_CIRCLEQ_INSERT_TAIL(head, elm, field, type) do { \ argument
323 SH_CIRCLEQ_LASTP(head, type)->field.scqe_next = \
324 SH_PTR_TO_OFF(SH_CIRCLEQ_LASTP(head, type), elm); \
328 #define SH_CIRCLEQ_REMOVE(head, elm, field, type) do { \ argument
329 if (SH_CIRCLEQ_NEXTP(elm, field, type) == (void *)(head)) \
332 SH_CIRCLEQ_NEXTP(elm, field, type)->field.scqe_prev += \
334 if (SH_CIRCLEQ_PREVP(elm, field, type) == (void *)(head)) \
337 SH_CIRCLEQ_PREVP(elm, field, type)->field.scqe_next += \