203 	struct queue_entry      *prev;          /* previous element */  member
224 	if (elt->prev->next != elt || elt->next->prev != elt) {  in __QUEUE_ELT_VALIDATE()
234 	if (__next->prev != elt) {  in __QUEUE_ELT_VALIDATE_NEXT()
244 	queue_entry_t __prev = elt->prev;  in __QUEUE_ELT_VALIDATE_PREV()
256 	elt->next = elt->prev = (queue_entry_t)NULL;  in __DEQUEUE_ELT_CLEANUP()
261 #define __QUEUE_ELT_VALIDATE_PREV(elt)  ((elt)->prev)
286 	elt->prev = que;  in enqueue_head()
287 	old_head->prev = elt;  in enqueue_head()
300 	elt->prev = old_tail;  in enqueue_tail()
302 	que->prev = elt;  in enqueue_tail()
316 		new_head->prev = que;  in dequeue_head()
331 	if (que->prev != que) {  in dequeue_tail()
332 		elt = que->prev;  in dequeue_tail()
334 		new_tail = elt->prev; /* new_tail may point to queue if elt was the only element */  in dequeue_tail()
336 		que->prev = new_tail;  in dequeue_tail()
351 …prev_elt = elt->prev; /* next_elt may equal prev_elt (and the queue head) if elt was the only elem…  in remqueue()
352 	next_elt->prev = prev_elt;  in remqueue()
366 	entry->prev = pred;  in insque()
367 	successor->prev = entry;  in insque()
399 …p_elt = elt->prev; /* next_elt may equal prev_elt (and the queue head) if elt was the only element…  in re_queue_head()
400 	n_elt->prev = p_elt;  in re_queue_head()
406 	elt->prev = que;  in re_queue_head()
407 	n_elt->prev = elt;  in re_queue_head()
432 …p_elt = elt->prev; /* next_elt may equal prev_elt (and the queue head) if elt was the only element…  in re_queue_tail()
433 	n_elt->prev = p_elt;  in re_queue_tail()
437 	p_elt = que->prev;  in re_queue_tail()
439 	elt->prev = p_elt;  in re_queue_tail()
441 	que->prev = elt;  in re_queue_tail()
619 	(q)->prev = (q);\
672 #define queue_last(q)   ((q)->prev)
682 #define queue_prev(qc)  ((qc)->prev)
738 	prev_elt = _old->prev;  in movqueue()
741 	_new->prev = prev_elt;  in movqueue()
742 	next_elt->prev = _new;  in movqueue()
770 	        __fail |= __head->prev != (queue_entry_t)__elt;                 \
772 	        __fail |= ((type)(void *)__next)->field.prev !=                 \
798 	        __head->prev = (queue_entry_t)__elt;                            \
800 	        ((type)(void *)__next)->field.prev = (queue_entry_t)__elt;      \
836 	__prev = __head->prev;                                                  \
841 	__elt->field.prev = __prev;                                             \
845 	__head->prev = (queue_entry_t)__elt;                                    \
875 	__elt->field.prev = __head;                                             \
906 	        __prev = __head->prev;                                          \
908 	        __prev = ((type)(void *)__cur)->field.prev;                     \
914 	__elt->field.prev = __prev;                                             \
954 	__elt->field.prev = __cur;                                              \
991 	__prev = __elt->field.prev;                                             \
1001 	__elt->field.prev = NULL;                                               \
1046 	__entry = (type)(void *)__hd->prev;                     \
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 =     \