Lines Matching refs:head
46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
54 * head of the list and the other to the tail of the list. The elements are
57 * to the list after an existing element, at the head of the list, or at the
58 * end of the list. Elements being removed from the head of the tail queue
68 * or after an existing element or at the head of the list. A list
71 * A tail queue is headed by a pair of pointers, one to the head of the
75 * after an existing element, at the head of the list, or at the end of
105 /* Store the last 2 places the queue element or head was altered */
116 #define QMD_TRACE_HEAD(head) do { \
117 (head)->trace.prevline = (head)->trace.lastline; \
118 (head)->trace.prevfile = (head)->trace.lastfile; \
119 (head)->trace.lastline = __LINE__; \
120 (head)->trace.lastfile = __FILE__; \
132 #define QMD_TRACE_HEAD(head)
145 #define SLIST_HEAD_INITIALIZER(head) \
156 #define SLIST_EMPTY(head) ((head)->slh_first == NULL)
158 #define SLIST_FIRST(head) ((head)->slh_first)
160 #define SLIST_FOREACH(var, head, field) \
161 for ((var) = SLIST_FIRST((head)); \
165 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
166 for ((var) = SLIST_FIRST((head)); \
170 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
171 for ((varp) = &SLIST_FIRST((head)); \
175 #define SLIST_INIT(head) do { \
176 SLIST_FIRST((head)) = NULL; \
184 #define SLIST_INSERT_HEAD(head, elm, field) do { \
185 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
186 SLIST_FIRST((head)) = (elm); \
191 #define SLIST_REMOVE(head, elm, type, field) do { \
192 if (SLIST_FIRST((head)) == (elm)) { \
193 SLIST_REMOVE_HEAD((head), field); \
196 struct type *curelm = SLIST_FIRST((head)); \
205 #define SLIST_REMOVE_HEAD(head, field) do { \
206 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
218 #define STAILQ_HEAD_INITIALIZER(head) \
219 { NULL, &(head).stqh_first }
237 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL)
239 #define STAILQ_FIRST(head) ((head)->stqh_first)
241 #define STAILQ_FOREACH(var, head, field) \
242 for((var) = STAILQ_FIRST((head)); \
247 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
248 for ((var) = STAILQ_FIRST((head)); \
252 #define STAILQ_INIT(head) do { \
253 STAILQ_FIRST((head)) = NULL; \
254 (head)->stqh_last = &STAILQ_FIRST((head)); \
257 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
259 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
263 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
264 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
265 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
266 STAILQ_FIRST((head)) = (elm); \
269 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
271 *(head)->stqh_last = (elm); \
272 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
275 #define STAILQ_LAST(head, type, field) \
276 (STAILQ_EMPTY((head)) ? \
279 ((char *)((head)->stqh_last) - __offsetof(struct type, field))))
283 #define STAILQ_REMOVE(head, elm, type, field) do { \
284 if (STAILQ_FIRST((head)) == (elm)) { \
285 STAILQ_REMOVE_HEAD((head), field); \
288 struct type *curelm = STAILQ_FIRST((head)); \
293 (head)->stqh_last = &STAILQ_NEXT((curelm), field);\
298 #define STAILQ_REMOVE_HEAD(head, field) do { \
299 if ((STAILQ_FIRST((head)) = \
300 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
301 (head)->stqh_last = &STAILQ_FIRST((head)); \
304 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \
305 if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL) \
306 (head)->stqh_last = &STAILQ_FIRST((head)); \
317 #define LIST_HEAD_INITIALIZER(head) \
331 #define QMD_LIST_CHECK_HEAD(head, field) do { \
332 if (LIST_FIRST((head)) != NULL && \
333 LIST_FIRST((head))->field.le_prev != \
334 &LIST_FIRST((head))) \
335 panic("Bad list head %p first->prev != head", (head)); \
350 #define QMD_LIST_CHECK_HEAD(head, field)
355 #define LIST_EMPTY(head) ((head)->lh_first == NULL)
357 #define LIST_FIRST(head) ((head)->lh_first)
359 #define LIST_FOREACH(var, head, field) \
360 for ((var) = LIST_FIRST((head)); \
364 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
365 for ((var) = LIST_FIRST((head)); \
369 #define LIST_INIT(head) do { \
370 LIST_FIRST((head)) = NULL; \
390 #define LIST_INSERT_HEAD(head, elm, field) do { \
391 QMD_LIST_CHECK_HEAD((head), field); \
392 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
393 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
394 LIST_FIRST((head)) = (elm); \
395 (elm)->field.le_prev = &LIST_FIRST((head)); \
421 #define TAILQ_HEAD_INITIALIZER(head) \
422 { NULL, &(head).tqh_first }
445 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
447 #define TAILQ_FIRST(head) ((head)->tqh_first)
449 #define TAILQ_FOREACH(var, head, field) \
450 for ((var) = TAILQ_FIRST((head)); \
454 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
455 for ((var) = TAILQ_FIRST((head)); \
459 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
460 for ((var) = TAILQ_LAST((head), headname); \
464 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
465 for ((var) = TAILQ_LAST((head), headname); \
469 #define TAILQ_INIT(head) do { \
470 TAILQ_FIRST((head)) = NULL; \
471 (head)->tqh_last = &TAILQ_FIRST((head)); \
472 QMD_TRACE_HEAD(head); \
475 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
480 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
481 QMD_TRACE_HEAD(head); \
498 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
499 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
500 TAILQ_FIRST((head))->field.tqe_prev = \
503 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
504 TAILQ_FIRST((head)) = (elm); \
505 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
506 QMD_TRACE_HEAD(head); \
510 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
512 (elm)->field.tqe_prev = (head)->tqh_last; \
513 *(head)->tqh_last = (elm); \
514 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
515 QMD_TRACE_HEAD(head); \
519 #define TAILQ_LAST(head, headname) \
520 (*(((struct headname *)((head)->tqh_last))->tqh_last))
527 #define TAILQ_REMOVE(head, elm, field) do { \
532 (head)->tqh_last = (elm)->field.tqe_prev; \
533 QMD_TRACE_HEAD(head); \