Lines Matching refs:field
90 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
100 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
101 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
102 (listelm)->field.le_next->field.le_prev = \
103 &(elm)->field.le_next; \
104 (listelm)->field.le_next = (elm); \
105 (elm)->field.le_prev = &(listelm)->field.le_next; \
108 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
109 (elm)->field.le_prev = (listelm)->field.le_prev; \
110 (elm)->field.le_next = (listelm); \
111 *(listelm)->field.le_prev = (elm); \
112 (listelm)->field.le_prev = &(elm)->field.le_next; \
115 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
116 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
117 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
119 (elm)->field.le_prev = &(head)->lh_first; \
122 #define LIST_REMOVE(elm, field) do { \ argument
123 if ((elm)->field.le_next != NULL) \
124 (elm)->field.le_next->field.le_prev = \
125 (elm)->field.le_prev; \
126 *(elm)->field.le_prev = (elm)->field.le_next; \
145 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
156 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
157 if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
158 (head)->tqh_first->field.tqe_prev = \
159 &(elm)->field.tqe_next; \
161 (head)->tqh_last = &(elm)->field.tqe_next; \
163 (elm)->field.tqe_prev = &(head)->tqh_first; \
166 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
167 (elm)->field.tqe_next = NULL; \
168 (elm)->field.tqe_prev = (head)->tqh_last; \
170 (head)->tqh_last = &(elm)->field.tqe_next; \
173 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
174 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
175 (elm)->field.tqe_next->field.tqe_prev = \
176 &(elm)->field.tqe_next; \
178 (head)->tqh_last = &(elm)->field.tqe_next; \
179 (listelm)->field.tqe_next = (elm); \
180 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
183 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
184 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
185 (elm)->field.tqe_next = (listelm); \
186 *(listelm)->field.tqe_prev = (elm); \
187 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
190 #define TAILQ_REMOVE(head, elm, field) do { \ argument
191 if (((elm)->field.tqe_next) != NULL) \
192 (elm)->field.tqe_next->field.tqe_prev = \
193 (elm)->field.tqe_prev; \
195 (head)->tqh_last = (elm)->field.tqe_prev; \
196 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
217 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
218 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) argument
228 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
229 (elm)->field.cqe_next = (listelm)->field.cqe_next; \
230 (elm)->field.cqe_prev = (listelm); \
231 if ((listelm)->field.cqe_next == (void *)(head)) \
234 (listelm)->field.cqe_next->field.cqe_prev = (elm); \
235 (listelm)->field.cqe_next = (elm); \
238 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
239 (elm)->field.cqe_next = (listelm); \
240 (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \
241 if ((listelm)->field.cqe_prev == (void *)(head)) \
244 (listelm)->field.cqe_prev->field.cqe_next = (elm); \
245 (listelm)->field.cqe_prev = (elm); \
248 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
249 (elm)->field.cqe_next = (head)->cqh_first; \
250 (elm)->field.cqe_prev = (void *)(head); \
254 (head)->cqh_first->field.cqe_prev = (elm); \
258 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
259 (elm)->field.cqe_next = (void *)(head); \
260 (elm)->field.cqe_prev = (head)->cqh_last; \
264 (head)->cqh_last->field.cqe_next = (elm); \
268 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
269 if ((elm)->field.cqe_next == (void *)(head)) \
270 (head)->cqh_last = (elm)->field.cqe_prev; \
272 (elm)->field.cqe_next->field.cqe_prev = \
273 (elm)->field.cqe_prev; \
274 if ((elm)->field.cqe_prev == (void *)(head)) \
275 (head)->cqh_first = (elm)->field.cqe_next; \
277 (elm)->field.cqe_prev->field.cqe_next = \
278 (elm)->field.cqe_next; \