Lines Matching refs:head
50 * added to the list after an existing element or at the head of the list.
51 * Elements being removed from the head of the list should use the explicit
58 * head of the list and the other to the tail of the list. The elements are
61 * to the list after an existing element, at the head of the list, or at the
62 * end of the list. Elements being removed from the head of the tail queue
72 * or after an existing element or at the head of the list. A list
75 * A tail queue is headed by a pair of pointers, one to the head of the
79 * after an existing element, at the head of the list, or at the end of
109 /* Store the last 2 places the queue element or head was altered */
120 #define QMD_TRACE_HEAD(head) do { \
121 (head)->trace.prevline = (head)->trace.lastline; \
122 (head)->trace.prevfile = (head)->trace.lastfile; \
123 (head)->trace.lastline = __LINE__; \
124 (head)->trace.lastfile = __FILE__; \
136 #define QMD_TRACE_HEAD(head)
149 #define SLIST_HEAD_INITIALIZER(head) \
160 #define SLIST_EMPTY(head) ((head)->slh_first == NULL)
162 #define SLIST_FIRST(head) ((head)->slh_first)
164 #define SLIST_FOREACH(var, head, field) \
165 for ((var) = SLIST_FIRST((head)); \
169 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
170 for ((var) = SLIST_FIRST((head)); \
174 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
175 for ((varp) = &SLIST_FIRST((head)); \
179 #define SLIST_INIT(head) do { \
180 SLIST_FIRST((head)) = NULL; \
188 #define SLIST_INSERT_HEAD(head, elm, field) do { \
189 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
190 SLIST_FIRST((head)) = (elm); \
195 #define SLIST_REMOVE(head, elm, type, field) do { \
196 if (SLIST_FIRST((head)) == (elm)) { \
197 SLIST_REMOVE_HEAD((head), field); \
200 struct type *curelm = SLIST_FIRST((head)); \
209 #define SLIST_REMOVE_HEAD(head, field) do { \
210 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
222 #define STAILQ_HEAD_INITIALIZER(head) \
223 { NULL, &(head).stqh_first }
241 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL)
243 #define STAILQ_FIRST(head) ((head)->stqh_first)
245 #define STAILQ_FOREACH(var, head, field) \
246 for((var) = STAILQ_FIRST((head)); \
251 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
252 for ((var) = STAILQ_FIRST((head)); \
256 #define STAILQ_INIT(head) do { \
257 STAILQ_FIRST((head)) = NULL; \
258 (head)->stqh_last = &STAILQ_FIRST((head)); \
261 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
263 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
267 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
268 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
269 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
270 STAILQ_FIRST((head)) = (elm); \
273 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
275 *(head)->stqh_last = (elm); \
276 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
279 #define STAILQ_LAST(head, type, field) \
280 (STAILQ_EMPTY((head)) ? \
283 ((char *)((head)->stqh_last) - __offsetof(struct type, field))))
287 #define STAILQ_REMOVE(head, elm, type, field) do { \
288 if (STAILQ_FIRST((head)) == (elm)) { \
289 STAILQ_REMOVE_HEAD((head), field); \
292 struct type *curelm = STAILQ_FIRST((head)); \
297 (head)->stqh_last = &STAILQ_NEXT((curelm), field);\
302 #define STAILQ_REMOVE_HEAD(head, field) do { \
303 if ((STAILQ_FIRST((head)) = \
304 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
305 (head)->stqh_last = &STAILQ_FIRST((head)); \
316 #define LIST_HEAD_INITIALIZER(head) \
330 #define QMD_LIST_CHECK_HEAD(head, field) do { \
331 if (LIST_FIRST((head)) != NULL && \
332 LIST_FIRST((head))->field.le_prev != \
333 &LIST_FIRST((head))) \
334 panic("Bad list head %p first->prev != head", (head)); \
349 #define QMD_LIST_CHECK_HEAD(head, field)
354 #define LIST_EMPTY(head) ((head)->lh_first == NULL)
356 #define LIST_FIRST(head) ((head)->lh_first)
358 #define LIST_FOREACH(var, head, field) \
359 for ((var) = LIST_FIRST((head)); \
363 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
364 for ((var) = LIST_FIRST((head)); \
368 #define LIST_INIT(head) do { \
369 LIST_FIRST((head)) = NULL; \
389 #define LIST_INSERT_HEAD(head, elm, field) do { \
390 QMD_LIST_CHECK_HEAD((head), field); \
391 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
392 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
393 LIST_FIRST((head)) = (elm); \
394 (elm)->field.le_prev = &LIST_FIRST((head)); \
420 #define TAILQ_HEAD_INITIALIZER(head) \
421 { NULL, &(head).tqh_first }
434 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \
435 if (!TAILQ_EMPTY(head) && \
436 TAILQ_FIRST((head))->field.tqe_prev != \
437 &TAILQ_FIRST((head))) \
438 panic("Bad tailq head %p first->prev != head", (head)); \
441 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \
442 if (*(head)->tqh_last != NULL) \
443 panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); \
458 #define QMD_TAILQ_CHECK_HEAD(head, field)
459 #define QMD_TAILQ_CHECK_TAIL(head, headname)
475 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
477 #define TAILQ_FIRST(head) ((head)->tqh_first)
479 #define TAILQ_FOREACH(var, head, field) \
480 for ((var) = TAILQ_FIRST((head)); \
484 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
485 for ((var) = TAILQ_FIRST((head)); \
489 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
490 for ((var) = TAILQ_LAST((head), headname); \
494 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
495 for ((var) = TAILQ_LAST((head), headname); \
499 #define TAILQ_INIT(head) do { \
500 TAILQ_FIRST((head)) = NULL; \
501 (head)->tqh_last = &TAILQ_FIRST((head)); \
502 QMD_TRACE_HEAD(head); \
505 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
511 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
512 QMD_TRACE_HEAD(head); \
530 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
531 QMD_TAILQ_CHECK_HEAD(head, field); \
532 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
533 TAILQ_FIRST((head))->field.tqe_prev = \
536 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
537 TAILQ_FIRST((head)) = (elm); \
538 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
539 QMD_TRACE_HEAD(head); \
543 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
544 QMD_TAILQ_CHECK_TAIL(head, field); \
546 (elm)->field.tqe_prev = (head)->tqh_last; \
547 *(head)->tqh_last = (elm); \
548 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
549 QMD_TRACE_HEAD(head); \
553 #define TAILQ_LAST(head, headname) \
554 (*(((struct headname *)((head)->tqh_last))->tqh_last))
561 #define TAILQ_REMOVE(head, elm, field) do { \
568 (head)->tqh_last = (elm)->field.tqe_prev; \
569 QMD_TRACE_HEAD(head); \
596 *head = (struct quehead *)b;
598 element->qh_link = head->qh_link;
599 element->qh_rlink = head;
600 head->qh_link = element;