202 	struct queue_entry      *next;          /* next element */  member
224 	if (elt->prev->next != elt || elt->next->prev != elt) {  in __QUEUE_ELT_VALIDATE()
232 	queue_entry_t __next = elt->next;  in __QUEUE_ELT_VALIDATE_NEXT()
246 	if (__prev->next != elt) {  in __QUEUE_ELT_VALIDATE_PREV()
256 	elt->next = elt->prev = (queue_entry_t)NULL;  in __DEQUEUE_ELT_CLEANUP()
260 #define __QUEUE_ELT_VALIDATE_NEXT(elt)  ((elt)->next)
285 	elt->next = old_head;  in enqueue_head()
288 	que->next = elt;  in enqueue_head()
299 	elt->next = que;  in enqueue_tail()
301 	old_tail->next = elt;  in enqueue_tail()
312 	if (que->next != que) {  in dequeue_head()
313 		elt = que->next;  in dequeue_head()
315 		new_head = elt->next; /* new_head may point to que if elt was the only element */  in dequeue_head()
317 		que->next = new_head;  in dequeue_head()
335 		new_tail->next = que;  in dequeue_tail()
350 	next_elt = elt->next;  in remqueue()
353 	prev_elt->next = next_elt;  in remqueue()
365 	entry->next = successor;  in insque()
368 	pred->next = entry;  in insque()
398 	n_elt = elt->next;  in re_queue_head()
401 	p_elt->next = n_elt;  in re_queue_head()
404 	n_elt = que->next;  in re_queue_head()
405 	elt->next = n_elt;  in re_queue_head()
408 	que->next = elt;  in re_queue_head()
431 	n_elt = elt->next;  in re_queue_tail()
434 	p_elt->next = n_elt;  in re_queue_tail()
438 	elt->next = que;  in re_queue_tail()
440 	p_elt->next = elt;  in re_queue_tail()
474 	for (qe = (head)->next; qe != (head); qe = (qe)->next)
492 	for (queue_entry_t _ne = ((head)->next)->next, \
493 	         __ ## qe ## _unused_shadow __unused = (qe = (head)->next); \
495 	     qe = _ne, _ne = (qe)->next)
513 	for (elt = qe_element((head)->next, typeof(*(elt)), field); \
515 	     elt = qe_element((elt)->field.next, typeof(*(elt)), field))
536 	for (typeof(*(elt)) *_nelt = qe_element(((head)->next)->next, typeof(*(elt)), field), \
538 	         (elt = qe_element((head)->next, typeof(*(elt)), field)); \
540 	     elt = _nelt, _nelt = qe_element((elt)->field.next, typeof(*(elt)), field)) \
618 	(q)->next = (q);\
652 #define queue_first(q)  ((q)->next)
662 #define queue_next(qc)  ((qc)->next)
737 	next_elt = _old->next;  in movqueue()
740 	_new->next = next_elt;  in movqueue()
743 	prev_elt->next = _new;  in movqueue()
759 	        __fail |= __head->next != (queue_entry_t)__elt;                 \
761 	        __fail |= ((type)(void *)__prev)->field.next !=                 \
788 	        __head->next = (queue_entry_t)__elt;                            \
790 	        ((type)(void *)__prev)->field.next = (queue_entry_t)__elt;      \
842 	__elt->field.next = __head;                                             \
869 	__next = __head->next;                                                  \
874 	__elt->field.next = __next;                                             \
878 	__head->next = (queue_entry_t)__elt;                                    \
915 	__elt->field.next = __cur;                                              \
946 	        __next = __head->next;                                          \
948 	        __next = ((type)(void *)__cur)->field.next;                     \
955 	__elt->field.next = __next;                                             \
990 	__next = __elt->field.next;                                             \
1000 	__elt->field.next = NULL;                                               \
1021 	__entry = (type)(void *)__hd->next;                     \
1061 	((type)(void *)((from)->prev))->field.next = (to);      \
1062 	((type)(void *)((from)->next))->field.prev = (to);      \
1083 	        ((type)(void *)((new)->next))->field.prev =     \
1085 	        ((type)(void *)((new)->prev))->field.next =     \