osfmk/kern/queue.h

97 	struct queue_entry	*next;		/* next element */
157 		(elt)->next = (queue_entry_t) 0; \
169 	elt->next = que->next;
171 	elt->next->prev = elt;
172 	que->next = elt;
180 	elt->next = que;
182 	elt->prev->next = elt;
192 	if (que->next != que) {
193 		elt = que->next;
194 		elt->next->prev = que;
195 		que->next = elt->next;
210 		elt->prev->next = que;
222 	elt->next->prev = elt->prev;
223 	elt->prev->next = elt->next;
232 	entry->next = pred->next;
234 	(pred->next)->prev = entry;
235 	pred->next = entry;
242 	(elt->next)->prev = elt->prev;
243 	(elt->prev)->next = elt->next;
259 	(q)->next = (q);\
271 #define	queue_first(q)	((q)->next)
281 #define	queue_next(qc)	((qc)->next)
350 		(head)->next = (queue_entry_t) (elt);		\
353 		((type)__prev)->field.next = (queue_entry_t)(elt);\
356 	(elt)->field.next = head;				\
375 	__next = (head)->next;					\
382 	(elt)->field.next = __next;				\
384 	(head)->next = (queue_entry_t) elt;			\
404 		(elt)->field.next = (head);				\
405 		if ((head)->next == (head)) {	/* only element */	\
407 			(head)->next = (queue_entry_t)(elt);		\
410 			((type)__prev)->field.next = (queue_entry_t)(elt);\
414 		(elt)->field.next = (queue_entry_t)(cur);		\
415 		if ((head)->next == (queue_entry_t)(cur)) {		\
418 			(head)->next = (queue_entry_t)(elt);		\
421 			((type)__prev)->field.next = (queue_entry_t)(elt);\
445 		if ((head)->next == (head)) {	/* only element */	\
446 			(elt)->field.next = (head);			\
449 			__next = (elt)->field.next = (head)->next;	\
452 		(head)->next = (queue_entry_t)(elt);			\
457 			(elt)->field.next = (head);			\
460 			__next = (elt)->field.next = (cur)->field.next;	\
463 		(cur)->field.next = (queue_entry_t)(elt);		\
488 	__next = (elt)->field.next;				\
497 		(head)->next = __next;				\
499 		((type)__prev)->field.next = __next;		\
501 	(elt)->field.next = NULL;				\
518 	(entry) = (type) ((head)->next);			\
519 	__next = (entry)->field.next;				\
525 	(head)->next = __next;					\
527 	(entry)->field.next = NULL;				\
548 		(head)->next = (head);				\
550 		((type)(__prev))->field.next = (head);		\
553 	(entry)->field.next = NULL;				\
562 	((type)((from)->prev))->field.next = (to);		\
563 	((type)((from)->next))->field.prev = (to);		\
582 		((type)((new)->next))->field.prev = (new);	\
583 		((type)((new)->prev))->field.next = (new);	\