473 #define qe_foreach(qe, head) \  argument
474 	for (qe = (head)->next; qe != (head); qe = (qe)->next)
491 #define qe_foreach_safe(qe, head) \  argument
492 	for (queue_entry_t _ne = ((head)->next)->next, \
493 	         __ ## qe ## _unused_shadow __unused = (qe = (head)->next); \
494 	     qe != (head); \
512 #define qe_foreach_element(elt, head, field) \  argument
513 	for (elt = qe_element((head)->next, typeof(*(elt)), field); \
514 	     &((elt)->field) != (head); \
535 #define qe_foreach_element_safe(elt, head, field) \  argument
536 	for (typeof(*(elt)) *_nelt = qe_element(((head)->next)->next, typeof(*(elt)), field), \
538 	         (elt = qe_element((head)->next, typeof(*(elt)), field)); \
539 	     &((elt)->field) != (head); \
545 #define qe_dequeue_head(head, type, field) ({ \  argument
546 	queue_entry_t _tmp_entry = dequeue_head((head)); \
554 #define qe_dequeue_tail(head, type, field) ({ \  argument
555 	queue_entry_t _tmp_entry = dequeue_tail((head)); \
563 #define qe_queue_first(head, type, field) ({ \  argument
564 	queue_entry_t _tmp_entry = queue_first((head)); \
566 	if (_tmp_entry != (queue_entry_t) head) \
572 #define qe_queue_last(head, type, field) ({ \  argument
573 	queue_entry_t _tmp_entry = queue_last((head)); \
575 	if (_tmp_entry != (queue_entry_t) head) \
581 #define qe_queue_next(head, element, type, field) ({ \  argument
584 	if (_tmp_entry != (queue_entry_t) head) \
590 #define qe_queue_prev(head, element, type, field) ({ \  argument
593 	if (_tmp_entry != (queue_entry_t) head) \
828 #define queue_enter(head, elt, type, field)                                     \  argument
835 	__head = (head);                                                        \
861 #define queue_enter_first(head, elt, type, field)                               \  argument
868 	__head = (head);                                                        \
895 #define queue_insert_before(head, elt, cur, type, field)                        \  argument
903 	__head = (head);                                                        \
935 #define queue_insert_after(head, elt, cur, type, field)                         \  argument
943 	__head = (head);                                                        \
969 #define queue_field(head, thing, type, field)                   \  argument
970 	        (((head) == (thing)) ? (head) : &((type)(void *)(thing))->field)
982 #define queue_remove(head, elt, type, field)                                    \  argument
989 	__head = (head);                                                        \
1015 #define queue_remove_first(head, entry, type, field)            \  argument
1020 	__hd    = (head);                                       \
1040 #define queue_remove_last(head, entry, type, field)             \  argument
1045 	__hd    = (head);                                       \
1107 #define queue_iterate(head, elt, type, field)                   \  argument
1108 	for ((elt) = (type)(void *) queue_first(head);          \
1109 	     !queue_end((head), (queue_entry_t)(elt));          \