elf_queue.h

来自「M5,一个功能强大的多处理器系统模拟器.很多针对处理器架构,性能的研究都使用它作」· C头文件 代码 · 共 617 行 · 第 1/2 页

        { NULL }

#define	LIST_ENTRY(type)						\
struct {								\
        struct type *le_next;	/* next element */			\
        struct type **le_prev;	/* address of previous next element */	\
}

/*
 * List functions.
 */

#if (defined(_KERNEL) && defined(INVARIANTS))
#define	QMD_LIST_CHECK_HEAD(head, field) do {				\
        if (LIST_FIRST((head)) != NULL &&				\
            LIST_FIRST((head))->field.le_prev !=			\
             &LIST_FIRST((head)))					\
                panic("Bad list head %p first->prev != head", (head));	\
} while (0)

#define	QMD_LIST_CHECK_NEXT(elm, field) do {				\
        if (LIST_NEXT((elm), field) != NULL &&				\
            LIST_NEXT((elm), field)->field.le_prev !=			\
             &((elm)->field.le_next))					\
                panic("Bad link elm %p next->prev != elm", (elm));	\
} while (0)

#define	QMD_LIST_CHECK_PREV(elm, field) do {				\
        if (*(elm)->field.le_prev != (elm))				\
                panic("Bad link elm %p prev->next != elm", (elm));	\
} while (0)
#else
#define	QMD_LIST_CHECK_HEAD(head, field)
#define	QMD_LIST_CHECK_NEXT(elm, field)
#define	QMD_LIST_CHECK_PREV(elm, field)
#endif /* (_KERNEL && INVARIANTS) */

#define	LIST_EMPTY(head)	((head)->lh_first == NULL)

#define	LIST_FIRST(head)	((head)->lh_first)

#define	LIST_FOREACH(var, head, field)					\
        for ((var) = LIST_FIRST((head));				\
            (var);							\
            (var) = LIST_NEXT((var), field))

#define	LIST_FOREACH_SAFE(var, head, field, tvar)			\
        for ((var) = LIST_FIRST((head));				\
            (var) && ((tvar) = LIST_NEXT((var), field), 1);		\
            (var) = (tvar))

#define	LIST_INIT(head) do {						\
        LIST_FIRST((head)) = NULL;					\
} while (0)

#define	LIST_INSERT_AFTER(listelm, elm, field) do {			\
        QMD_LIST_CHECK_NEXT(listelm, field);				\
        if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
                LIST_NEXT((listelm), field)->field.le_prev =		\
                    &LIST_NEXT((elm), field);				\
        LIST_NEXT((listelm), field) = (elm);				\
        (elm)->field.le_prev = &LIST_NEXT((listelm), field);		\
} while (0)

#define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\
        QMD_LIST_CHECK_PREV(listelm, field);				\
        (elm)->field.le_prev = (listelm)->field.le_prev;		\
        LIST_NEXT((elm), field) = (listelm);				\
        *(listelm)->field.le_prev = (elm);				\
        (listelm)->field.le_prev = &LIST_NEXT((elm), field);		\
} while (0)

#define	LIST_INSERT_HEAD(head, elm, field) do {				\
        QMD_LIST_CHECK_HEAD((head), field);				\
        if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL)	\
                LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
        LIST_FIRST((head)) = (elm);					\
        (elm)->field.le_prev = &LIST_FIRST((head));			\
} while (0)

#define	LIST_NEXT(elm, field)	((elm)->field.le_next)

#define	LIST_REMOVE(elm, field) do {					\
        QMD_LIST_CHECK_NEXT(elm, field);				\
        QMD_LIST_CHECK_PREV(elm, field);				\
        if (LIST_NEXT((elm), field) != NULL)				\
                LIST_NEXT((elm), field)->field.le_prev = 		\
                    (elm)->field.le_prev;				\
        *(elm)->field.le_prev = LIST_NEXT((elm), field);		\
        TRASHIT((elm)->field.le_next);					\
        TRASHIT((elm)->field.le_prev);					\
} while (0)

/*
 * Tail queue declarations.
 */
#define	TAILQ_HEAD(name, type)						\
struct name {								\
        struct type *tqh_first;	/* first element */			\
        struct type **tqh_last;	/* addr of last next element */		\
        TRACEBUF							\
}

#define	TAILQ_HEAD_INITIALIZER(head)					\
        { NULL, &(head).tqh_first }

#define	TAILQ_ENTRY(type)						\
struct {								\
        struct type *tqe_next;	/* next element */			\
        struct type **tqe_prev;	/* address of previous next element */	\
        TRACEBUF							\
}

/*
 * Tail queue functions.
 */
#if (defined(_KERNEL) && defined(INVARIANTS))
#define	QMD_TAILQ_CHECK_HEAD(head, field) do {				\
        if (!TAILQ_EMPTY(head) &&					\
            TAILQ_FIRST((head))->field.tqe_prev !=			\
             &TAILQ_FIRST((head)))					\
                panic("Bad tailq head %p first->prev != head", (head));	\
} while (0)

#define	QMD_TAILQ_CHECK_TAIL(head, field) do {				\
        if (*(head)->tqh_last != NULL)					\
                panic("Bad tailq NEXT(%p->tqh_last) != NULL", (head)); 	\
} while (0)

#define	QMD_TAILQ_CHECK_NEXT(elm, field) do {				\
        if (TAILQ_NEXT((elm), field) != NULL &&				\
            TAILQ_NEXT((elm), field)->field.tqe_prev !=			\
             &((elm)->field.tqe_next))					\
                panic("Bad link elm %p next->prev != elm", (elm));	\
} while (0)

#define	QMD_TAILQ_CHECK_PREV(elm, field) do {				\
        if (*(elm)->field.tqe_prev != (elm))				\
                panic("Bad link elm %p prev->next != elm", (elm));	\
} while (0)
#else
#define	QMD_TAILQ_CHECK_HEAD(head, field)
#define	QMD_TAILQ_CHECK_TAIL(head, headname)
#define	QMD_TAILQ_CHECK_NEXT(elm, field)
#define	QMD_TAILQ_CHECK_PREV(elm, field)
#endif /* (_KERNEL && INVARIANTS) */

#define	TAILQ_CONCAT(head1, head2, field) do {				\
        if (!TAILQ_EMPTY(head2)) {					\
                *(head1)->tqh_last = (head2)->tqh_first;		\
                (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last;	\
                (head1)->tqh_last = (head2)->tqh_last;			\
                TAILQ_INIT((head2));					\
                QMD_TRACE_HEAD(head1);					\
                QMD_TRACE_HEAD(head2);					\
        }								\
} while (0)

#define	TAILQ_EMPTY(head)	((head)->tqh_first == NULL)

#define	TAILQ_FIRST(head)	((head)->tqh_first)

#define	TAILQ_FOREACH(var, head, field)					\
        for ((var) = TAILQ_FIRST((head));				\
            (var);							\
            (var) = TAILQ_NEXT((var), field))

#define	TAILQ_FOREACH_SAFE(var, head, field, tvar)			\
        for ((var) = TAILQ_FIRST((head));				\
            (var) && ((tvar) = TAILQ_NEXT((var), field), 1);		\
            (var) = (tvar))

#define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\
        for ((var) = TAILQ_LAST((head), headname);			\
            (var);							\
            (var) = TAILQ_PREV((var), headname, field))

#define	TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)	\
        for ((var) = TAILQ_LAST((head), headname);			\
            (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1);	\
            (var) = (tvar))

#define	TAILQ_INIT(head) do {						\
        TAILQ_FIRST((head)) = NULL;					\
        (head)->tqh_last = &TAILQ_FIRST((head));			\
        QMD_TRACE_HEAD(head);						\
} while (0)

#define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
        QMD_TAILQ_CHECK_NEXT(listelm, field);				\
        if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
                TAILQ_NEXT((elm), field)->field.tqe_prev = 		\
                    &TAILQ_NEXT((elm), field);				\
        else {								\
                (head)->tqh_last = &TAILQ_NEXT((elm), field);		\
                QMD_TRACE_HEAD(head);					\
        }								\
        TAILQ_NEXT((listelm), field) = (elm);				\
        (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field);		\
        QMD_TRACE_ELEM(&(elm)->field);					\
        QMD_TRACE_ELEM(&listelm->field);				\
} while (0)

#define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\
        QMD_TAILQ_CHECK_PREV(listelm, field);				\
        (elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
        TAILQ_NEXT((elm), field) = (listelm);				\
        *(listelm)->field.tqe_prev = (elm);				\
        (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field);		\
        QMD_TRACE_ELEM(&(elm)->field);					\
        QMD_TRACE_ELEM(&listelm->field);				\
} while (0)

#define	TAILQ_INSERT_HEAD(head, elm, field) do {			\
        QMD_TAILQ_CHECK_HEAD(head, field);				\
        if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL)	\
                TAILQ_FIRST((head))->field.tqe_prev =			\
                    &TAILQ_NEXT((elm), field);				\
        else								\
                (head)->tqh_last = &TAILQ_NEXT((elm), field);		\
        TAILQ_FIRST((head)) = (elm);					\
        (elm)->field.tqe_prev = &TAILQ_FIRST((head));			\
        QMD_TRACE_HEAD(head);						\
        QMD_TRACE_ELEM(&(elm)->field);					\
} while (0)

#define	TAILQ_INSERT_TAIL(head, elm, field) do {			\
        QMD_TAILQ_CHECK_TAIL(head, field);				\
        TAILQ_NEXT((elm), field) = NULL;				\
        (elm)->field.tqe_prev = (head)->tqh_last;			\
        *(head)->tqh_last = (elm);					\
        (head)->tqh_last = &TAILQ_NEXT((elm), field);			\
        QMD_TRACE_HEAD(head);						\
        QMD_TRACE_ELEM(&(elm)->field);					\
} while (0)

#define	TAILQ_LAST(head, headname)					\
        (*(((struct headname *)((head)->tqh_last))->tqh_last))

#define	TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)

#define	TAILQ_PREV(elm, headname, field)				\
        (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))

#define	TAILQ_REMOVE(head, elm, field) do {				\
        QMD_TAILQ_CHECK_NEXT(elm, field);				\
        QMD_TAILQ_CHECK_PREV(elm, field);				\
        if ((TAILQ_NEXT((elm), field)) != NULL)				\
                TAILQ_NEXT((elm), field)->field.tqe_prev = 		\
                    (elm)->field.tqe_prev;				\
        else {								\
                (head)->tqh_last = (elm)->field.tqe_prev;		\
                QMD_TRACE_HEAD(head);					\
        }								\
        *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field);		\
        TRASHIT((elm)->field.tqe_next);					\
        TRASHIT((elm)->field.tqe_prev);					\
        QMD_TRACE_ELEM(&(elm)->field);					\
} 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 __CC_SUPPORTS___INLINE

static __inline void
insque(void *a, void *b)
{
        struct quehead *element = (struct quehead *)a,
                 *head = (struct quehead *)b;

        element->qh_link = head->qh_link;
        element->qh_rlink = head;
        head->qh_link = element;
        element->qh_link->qh_rlink = element;
}

static __inline void
remque(void *a)
{
        struct quehead *element = (struct quehead *)a;

        element->qh_link->qh_rlink = element->qh_rlink;
        element->qh_rlink->qh_link = element->qh_link;
        element->qh_rlink = 0;
}

#else /* !__CC_SUPPORTS___INLINE */

void	insque(void *a, void *b);
void	remque(void *a);

#endif /* __CC_SUPPORTS___INLINE */

#endif /* _KERNEL */

#endif /* !_SYS_QUEUE_H_ */