433 #define qe_element(qe, type, field) __container_of(qe, type, field)  argument
520 #define qe_dequeue_head(head, type, field) ({ \  argument
522 	type *_tmp_element = (type*) NULL; \
524 	        _tmp_element = qe_element(_tmp_entry, type, field); \
529 #define qe_dequeue_tail(head, type, field) ({ \  argument
531 	type *_tmp_element = (type*) NULL; \
533 	        _tmp_element = qe_element(_tmp_entry, type, field); \
538 #define qe_queue_first(head, type, field) ({ \  argument
540 	type *_tmp_element = (type*) NULL; \
542 	        _tmp_element = qe_element(_tmp_entry, type, field); \
547 #define qe_queue_last(head, type, field) ({ \  argument
549 	type *_tmp_element = (type*) NULL; \
551 	        _tmp_element = qe_element(_tmp_entry, type, field); \
556 #define qe_queue_next(head, element, type, field) ({ \  argument
558 	type *_tmp_element = (type*) NULL; \
560 	        _tmp_element = qe_element(_tmp_entry, type, field); \
565 #define qe_queue_prev(head, element, type, field) ({ \  argument
567 	type *_tmp_element = (type*) NULL; \
569 	        _tmp_element = qe_element(_tmp_entry, type, field); \
752 #define queue_enter(head, elt, type, field)                     \  argument
764 	        ((type)(void *)__prev)->field.next =            \
783 #define queue_enter_first(head, elt, type, field)               \  argument
792 	        ((type)(void *)__next)->field.prev =            \
814 #define queue_insert_before(head, elt, cur, type, field)                \  argument
825 	                ((type)(void *)__prev)->field.next =            \
837 	                ((type)(void *)__prev)->field.next =            \
858 #define queue_insert_after(head, elt, cur, type, field)                 \  argument
869 	                ((type)(void *)__next)->field.prev =            \
881 	                ((type)(void *)__next)->field.prev =            \
896 #define queue_field(head, thing, type, field)                   \  argument
897 	        (((head) == (thing)) ? (head) : &((type)(void *)(thing))->field)
909 #define queue_remove(head, elt, type, field)                    \  argument
919 	        ((type)(void *)__next)->field.prev = __prev;    \
924 	        ((type)(void *)__prev)->field.next = __next;    \
941 #define queue_remove_first(head, entry, type, field)            \  argument
945 	(entry) = (type)(void *) ((head)->next);                \
951 	        ((type)(void *)(__next))->field.prev = (head);  \
969 #define queue_remove_last(head, entry, type, field)             \  argument
973 	(entry) = (type)(void *) ((head)->prev);                \
979 	        ((type)(void *)(__prev))->field.next = (head);  \
991 #define queue_assign(to, from, type, field)                     \  argument
993 	((type)(void *)((from)->prev))->field.next = (to);      \
994 	((type)(void *)((from)->next))->field.prev = (to);      \
1011 #define queue_new_head(old, new, type, field)                   \  argument
1015 	        ((type)(void *)((new)->next))->field.prev =     \
1017 	        ((type)(void *)((new)->prev))->field.next =     \
1039 #define queue_iterate(head, elt, type, field)                   \  argument
1040 	for ((elt) = (type)(void *) queue_first(head);          \
1042 	     (elt) = (type)(void *) queue_next(&(elt)->field))