445 #define qe_element(qe, type, field) __container_of(qe, type, field)  argument
532 #define qe_dequeue_head(head, type, field) ({ \  argument
534 	type *_tmp_element = (type*) NULL; \
536 	        _tmp_element = qe_element(_tmp_entry, type, field); \
541 #define qe_dequeue_tail(head, type, field) ({ \  argument
543 	type *_tmp_element = (type*) NULL; \
545 	        _tmp_element = qe_element(_tmp_entry, type, field); \
550 #define qe_queue_first(head, type, field) ({ \  argument
552 	type *_tmp_element = (type*) NULL; \
554 	        _tmp_element = qe_element(_tmp_entry, type, field); \
559 #define qe_queue_last(head, type, field) ({ \  argument
561 	type *_tmp_element = (type*) NULL; \
563 	        _tmp_element = qe_element(_tmp_entry, type, field); \
568 #define qe_queue_next(head, element, type, field) ({ \  argument
570 	type *_tmp_element = (type*) NULL; \
572 	        _tmp_element = qe_element(_tmp_entry, type, field); \
577 #define qe_queue_prev(head, element, type, field) ({ \  argument
579 	type *_tmp_element = (type*) NULL; \
581 	        _tmp_element = qe_element(_tmp_entry, type, field); \
764 #define queue_enter(head, elt, type, field)                     \  argument
776 	        ((type)(void *)__prev)->field.next =            \
795 #define queue_enter_first(head, elt, type, field)               \  argument
804 	        ((type)(void *)__next)->field.prev =            \
826 #define queue_insert_before(head, elt, cur, type, field)                \  argument
837 	                ((type)(void *)__prev)->field.next =            \
849 	                ((type)(void *)__prev)->field.next =            \
870 #define queue_insert_after(head, elt, cur, type, field)                 \  argument
881 	                ((type)(void *)__next)->field.prev =            \
893 	                ((type)(void *)__next)->field.prev =            \
908 #define queue_field(head, thing, type, field)                   \  argument
909 	        (((head) == (thing)) ? (head) : &((type)(void *)(thing))->field)
921 #define queue_remove(head, elt, type, field)                    \  argument
931 	        ((type)(void *)__next)->field.prev = __prev;    \
936 	        ((type)(void *)__prev)->field.next = __next;    \
953 #define queue_remove_first(head, entry, type, field)            \  argument
957 	(entry) = (type)(void *) ((head)->next);                \
963 	        ((type)(void *)(__next))->field.prev = (head);  \
981 #define queue_remove_last(head, entry, type, field)             \  argument
985 	(entry) = (type)(void *) ((head)->prev);                \
991 	        ((type)(void *)(__prev))->field.next = (head);  \
1003 #define queue_assign(to, from, type, field)                     \  argument
1005 	((type)(void *)((from)->prev))->field.next = (to);      \
1006 	((type)(void *)((from)->next))->field.prev = (to);      \
1023 #define queue_new_head(old, new, type, field)                   \  argument
1027 	        ((type)(void *)((new)->next))->field.prev =     \
1029 	        ((type)(void *)((new)->prev))->field.next =     \
1051 #define queue_iterate(head, elt, type, field)                   \  argument
1052 	for ((elt) = (type)(void *) queue_first(head);          \
1054 	     (elt) = (type)(void *) queue_next(&(elt)->field))