#define FT_LIST_FOREACH(var, head, field)				\	for((var) = (head)->lh_first; (var); (var) = (var)->field.le_next)#define	FT_LIST_INIT(head) do {						\	(head)->lh_first = NULL;					\} while (0)#define FT_LIST_INSERT_AFTER(listelm, elm, field) do {			\	if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)	\		(listelm)->field.le_next->field.le_prev =		\		    &(elm)->field.le_next;				\	(listelm)->field.le_next = (elm);				\	(elm)->field.le_prev = &(listelm)->field.le_next;		\} while (0)#define FT_LIST_INSERT_BEFORE(listelm, elm, field) do {			\	(elm)->field.le_prev = (listelm)->field.le_prev;		\	(elm)->field.le_next = (listelm);				\	*(listelm)->field.le_prev = (elm);				\	(listelm)->field.le_prev = &(elm)->field.le_next;		\} while (0)#define FT_LIST_INSERT_HEAD(head, elm, field) do {			\	if (((elm)->field.le_next = (head)->lh_first) != NULL)		\		(head)->lh_first->field.le_prev = &(elm)->field.le_next;\	(head)->lh_first = (elm);					\	(elm)->field.le_prev = &(head)->lh_first;			\} while (0)#define FT_LIST_NEXT(elm, field)	((elm)->field.le_next)#define FT_LIST_REMOVE(elm, field) do {					\	if ((elm)->field.le_next != NULL)				\		(elm)->field.le_next->field.le_prev = 			\		    (elm)->field.le_prev;				\	*(elm)->field.le_prev = (elm)->field.le_next;			\} while (0)/* * Tail queue definitions. */#define FT_TAILQ_HEAD(name, type)					\struct name {								\	struct type *tqh_first;	/* first element */			\	struct type **tqh_last;	/* addr of last next element */		\}#define FT_TAILQ_HEAD_INITIALIZER(head)					\	{ NULL, &(head).tqh_first }#define FT_TAILQ_ENTRY(type)						\struct {								\	struct type *tqe_next;	/* next element */			\	struct type **tqe_prev;	/* address of previous next element */	\}/* * Tail queue functions. */#define	FT_TAILQ_EMPTY(head) ((head)->tqh_first == NULL)#define FT_TAILQ_FOREACH(var, head, field)				\	for (var = FT_TAILQ_FIRST(head); var; var = FT_TAILQ_NEXT(var, field))#define	FT_TAILQ_FIRST(head) ((head)->tqh_first)#define	FT_TAILQ_LAST(head, headname) \	(*(((struct headname *)((head)->tqh_last))->tqh_last))#define	FT_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)#define FT_TAILQ_PREV(elm, headname, field) \	(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))#define	FT_TAILQ_INIT(head) do {					\	(head)->tqh_first = NULL;					\	(head)->tqh_last = &(head)->tqh_first;				\} while (0)#define FT_TAILQ_INSERT_HEAD(head, elm, field) do {			\	if (((elm)->field.tqe_next = (head)->tqh_first) != NULL)	\		(head)->tqh_first->field.tqe_prev =			\		    &(elm)->field.tqe_next;				\	else								\		(head)->tqh_last = &(elm)->field.tqe_next;		\	(head)->tqh_first = (elm);					\	(elm)->field.tqe_prev = &(head)->tqh_first;			\} while (0)#define FT_TAILQ_INSERT_TAIL(head, elm, field) do {			\	(elm)->field.tqe_next = NULL;					\	(elm)->field.tqe_prev = (head)->tqh_last;			\	*(head)->tqh_last = (elm);					\	(head)->tqh_last = &(elm)->field.tqe_next;			\} while (0)#define FT_TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\		(elm)->field.tqe_next->field.tqe_prev = 		\		    &(elm)->field.tqe_next;				\	else								\		(head)->tqh_last = &(elm)->field.tqe_next;		\	(listelm)->field.tqe_next = (elm);				\	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\} while (0)#define FT_TAILQ_INSERT_BEFORE(listelm, elm, field) do {		\	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\	(elm)->field.tqe_next = (listelm);				\	*(listelm)->field.tqe_prev = (elm);				\	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\} while (0)#define FT_TAILQ_REMOVE(head, elm, field) do {				\	if (((elm)->field.tqe_next) != NULL)				\		(elm)->field.tqe_next->field.tqe_prev = 		\		    (elm)->field.tqe_prev;				\	else								\		(head)->tqh_last = (elm)->field.tqe_prev;		\	*(elm)->field.tqe_prev = (elm)->field.tqe_next;			\} while (0)/* * Circular queue definitions. */#define FT_CIRCLEQ_HEAD(name, type)					\struct name {								\	struct type *cqh_first;		/* first element */		\	struct type *cqh_last;		/* last element */		\}#define FT_CIRCLEQ_ENTRY(type)						\struct {								\	struct type *cqe_next;		/* next element */		\	struct type *cqe_prev;		/* previous element */		\}/* * Circular queue functions. */#define FT_CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head))#define FT_CIRCLEQ_FIRST(head) ((head)->cqh_first)#define FT_CIRCLEQ_FOREACH(var, head, field)				\	for((var) = (head)->cqh_first;					\	    (var) != (void *)(head);					\	    (var) = (var)->field.cqe_next)#define	FT_CIRCLEQ_INIT(head) do {					\	(head)->cqh_first = (void *)(head);				\	(head)->cqh_last = (void *)(head);				\} while (0)#define FT_CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\	(elm)->field.cqe_next = (listelm)->field.cqe_next;		\	(elm)->field.cqe_prev = (listelm);				\	if ((listelm)->field.cqe_next == (void *)(head))		\		(head)->cqh_last = (elm);				\	else								\		(listelm)->field.cqe_next->field.cqe_prev = (elm);	\	(listelm)->field.cqe_next = (elm);				\} while (0)#define FT_CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {	\	(elm)->field.cqe_next = (listelm);				\	(elm)->field.cqe_prev = (listelm)->field.cqe_prev;		\	if ((listelm)->field.cqe_prev == (void *)(head))		\		(head)->cqh_first = (elm);				\	else								\		(listelm)->field.cqe_prev->field.cqe_next = (elm);	\	(listelm)->field.cqe_prev = (elm);				\} while (0)#define FT_CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\	(elm)->field.cqe_next = (head)->cqh_first;			\	(elm)->field.cqe_prev = (void *)(head);				\	if ((head)->cqh_last == (void *)(head))				\		(head)->cqh_last = (elm);				\	else								\		(head)->cqh_first->field.cqe_prev = (elm);		\	(head)->cqh_first = (elm);					\} while (0)#define FT_CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\	(elm)->field.cqe_next = (void *)(head);				\	(elm)->field.cqe_prev = (head)->cqh_last;			\	if ((head)->cqh_first == (void *)(head))			\		(head)->cqh_first = (elm);				\	else								\		(head)->cqh_last->field.cqe_next = (elm);		\	(head)->cqh_last = (elm);					\} while (0)#define FT_CIRCLEQ_LAST(head) ((head)->cqh_last)#define FT_CIRCLEQ_NEXT(elm,field) ((elm)->field.cqe_next)#define FT_CIRCLEQ_PREV(elm,field) ((elm)->field.cqe_prev)#define	FT_CIRCLEQ_REMOVE(head, elm, field) do {			\	if ((elm)->field.cqe_next == (void *)(head))			\		(head)->cqh_last = (elm)->field.cqe_prev;		\	else								\		(elm)->field.cqe_next->field.cqe_prev =			\		    (elm)->field.cqe_prev;				\	if ((elm)->field.cqe_prev == (void *)(head))			\		(head)->cqh_first = (elm)->field.cqe_next;		\	else								\		(elm)->field.cqe_prev->field.cqe_next =			\		    (elm)->field.cqe_next;				\} while (0)#ifdef KERNEL/* * XXX insque() and remque() are an old way of handling certain queues. * They bogusly assumes that all queue heads look alike. */struct quehead {	struct quehead *qh_link;	struct quehead *qh_rlink;};#ifdef	__GNUC__static __inline voidinsque(void *a, void *b){	struct quehead *element = a, *head = b;	element->qh_link = head->qh_link;	element->qh_rlink = head;	head->qh_link = element;	element->qh_link->qh_rlink = element;}static __inline voidremque(void *a){	struct quehead *element = a;	element->qh_link->qh_rlink = element->qh_rlink;	element->qh_rlink->qh_link = element->qh_link;	element->qh_rlink = 0;}#else /* !__GNUC__ */void	insque __P((void *a, void *b));void	remque __P((void *a));#endif /* __GNUC__ */#endif /* KERNEL */#endif /* !_FT_QUEUE_H_ */