queue.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	QMD_SAVELINK(name, link)
#define	TRASHIT(x)
#define	SLIST_HEAD(name, type)
#define	SLIST_HEAD_INITIALIZER(head)   { NULL }
#define	SLIST_ENTRY(type)
#define	SLIST_EMPTY(head)   ((head)->slh_first == NULL)
#define	SLIST_FIRST(head)   ((head)->slh_first)
#define	SLIST_FOREACH(var, head, field)
#define	SLIST_FOREACH_SAFE(var, head, field, tvar)
#define	SLIST_FOREACH_PREVPTR(var, varp, head, field)
#define	SLIST_INIT(head)
#define	SLIST_INSERT_AFTER(slistelm, elm, field)
#define	SLIST_INSERT_HEAD(head, elm, field)
#define	SLIST_NEXT(elm, field)   ((elm)->field.sle_next)
#define	SLIST_REMOVE(head, elm, type, field)
#define	SLIST_REMOVE_AFTER(elm, field)
#define	SLIST_REMOVE_HEAD(head, field)
#define	STAILQ_HEAD(name, type)
#define	STAILQ_HEAD_INITIALIZER(head)   { NULL, &(head).stqh_first }
#define	STAILQ_ENTRY(type)
#define	STAILQ_CONCAT(head1, head2)
#define	STAILQ_EMPTY(head)   ((head)->stqh_first == NULL)
#define	STAILQ_FIRST(head)   ((head)->stqh_first)
#define	STAILQ_FOREACH(var, head, field)
#define	STAILQ_FOREACH_SAFE(var, head, field, tvar)
#define	STAILQ_INIT(head)
#define	STAILQ_INSERT_AFTER(head, tqelm, elm, field)
#define	STAILQ_INSERT_HEAD(head, elm, field)
#define	STAILQ_INSERT_TAIL(head, elm, field)
#define	STAILQ_LAST(head, type, field)
#define	STAILQ_NEXT(elm, field)   ((elm)->field.stqe_next)
#define	STAILQ_REMOVE(head, elm, type, field)
#define	STAILQ_REMOVE_HEAD(head, field)
#define	STAILQ_REMOVE_AFTER(head, elm, field)
#define	STAILQ_SWAP(head1, head2, type)
#define	STAILQ_INSERT_CHAIN_HEAD(head, elm_chead, elm_ctail, field)

Macro Definition Documentation

QMD_SAVELINK

#define QMD_SAVELINK	(		name,
			link
	)

Definition at line 4 of file queue.h.

SLIST_EMPTY

#define SLIST_EMPTY

(

head

)

((head)->slh_first == NULL)

Definition at line 26 of file queue.h.

SLIST_ENTRY

#define SLIST_ENTRY

(

type

)

Value:

struct {                                \
    struct type *sle_next;  /* next element */          \
}

Definition at line 18 of file queue.h.

SLIST_FIRST

#define SLIST_FIRST

(

head

)

((head)->slh_first)

Definition at line 28 of file queue.h.

SLIST_FOREACH

#define SLIST_FOREACH	(		var,
			head,
			field
	)

Value:

for ((var) = SLIST_FIRST((head));               \
        (var);                          \
        (var) = SLIST_NEXT((var), field))

Definition at line 30 of file queue.h.

SLIST_FOREACH_PREVPTR

#define SLIST_FOREACH_PREVPTR	(		var,
			varp,
			head,
			field
	)

Value:

for ((varp) = &SLIST_FIRST((head));             \
        ((var) = *(varp)) != NULL;                  \
        (varp) = &SLIST_NEXT((var), field))

Definition at line 40 of file queue.h.

SLIST_FOREACH_SAFE

#define SLIST_FOREACH_SAFE	(		var,
			head,
			field,
			tvar
	)

Value:

for ((var) = SLIST_FIRST((head));               \
        (var) && ((tvar) = SLIST_NEXT((var), field), 1);        \
        (var) = (tvar))

Definition at line 35 of file queue.h.

SLIST_HEAD

#define SLIST_HEAD	(		name,
			type
	)

Value:

struct name {                               \
    struct type *slh_first; /* first element */         \
}

Definition at line 10 of file queue.h.

SLIST_HEAD_INITIALIZER

#define SLIST_HEAD_INITIALIZER

(

head

)

{ NULL }

Definition at line 15 of file queue.h.

SLIST_INIT

#define SLIST_INIT

(

head

)

Value:

do {                        \
    SLIST_FIRST((head)) = NULL;                 \
} while (0)

Definition at line 45 of file queue.h.

SLIST_INSERT_AFTER

#define SLIST_INSERT_AFTER	(		slistelm,
			elm,
			field
	)

Value:

do {            \
    SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field);   \
    SLIST_NEXT((slistelm), field) = (elm);              \
} while (0)

Definition at line 49 of file queue.h.

SLIST_INSERT_HEAD

#define SLIST_INSERT_HEAD	(		head,
			elm,
			field
	)

Value:

do {            \
    SLIST_NEXT((elm), field) = SLIST_FIRST((head));         \
    SLIST_FIRST((head)) = (elm);                    \
} while (0)

Definition at line 54 of file queue.h.

SLIST_NEXT

#define SLIST_NEXT	(		elm,
			field
	)		((elm)->field.sle_next)

Definition at line 59 of file queue.h.

SLIST_REMOVE

#define SLIST_REMOVE	(		head,
			elm,
			type,
			field
	)

Value:

do {            \
    QMD_SAVELINK(oldnext, (elm)->field.sle_next);           \
    if (SLIST_FIRST((head)) == (elm)) {             \
        SLIST_REMOVE_HEAD((head), field);           \
    }                               \
    else {                              \
        struct type *curelm = SLIST_FIRST((head));      \
        while (SLIST_NEXT(curelm, field) != (elm))      \
            curelm = SLIST_NEXT(curelm, field);     \
        SLIST_REMOVE_AFTER(curelm, field);          \
    }                               \
    TRASHIT(*oldnext);                      \
} while (0)

Definition at line 61 of file queue.h.

SLIST_REMOVE_AFTER

#define SLIST_REMOVE_AFTER	(		elm,
			field
	)

Value:

do {                \
    SLIST_NEXT(elm, field) =                    \
        SLIST_NEXT(SLIST_NEXT(elm, field), field);          \
} while (0)

Definition at line 75 of file queue.h.

SLIST_REMOVE_HEAD

#define SLIST_REMOVE_HEAD	(		head,
			field
	)

Value:

do {                \
    SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field);   \
} while (0)

Definition at line 80 of file queue.h.

STAILQ_CONCAT

#define STAILQ_CONCAT	(		head1,
			head2
	)

Value:

do {                \
        if (!STAILQ_EMPTY((head2))) {                   \
            *(head1)->stqh_last = (head2)->stqh_first;      \
            (head1)->stqh_last = (head2)->stqh_last;        \
            STAILQ_INIT((head2));                   \
        }                               \
    } while (0)

Definition at line 104 of file queue.h.

STAILQ_EMPTY

#define STAILQ_EMPTY

(

head

)

((head)->stqh_first == NULL)

Definition at line 112 of file queue.h.

STAILQ_ENTRY

#define STAILQ_ENTRY

(

type

)

Value:

struct {                                \
        struct type *stqe_next; /* next element */          \
    }

Definition at line 96 of file queue.h.

STAILQ_FIRST

#define STAILQ_FIRST

(

head

)

((head)->stqh_first)

Definition at line 114 of file queue.h.

STAILQ_FOREACH

#define STAILQ_FOREACH	(		var,
			head,
			field
	)

Value:

for((var) = STAILQ_FIRST((head));               \
            (var);                          \
            (var) = STAILQ_NEXT((var), field))

Definition at line 116 of file queue.h.

STAILQ_FOREACH_SAFE

#define STAILQ_FOREACH_SAFE	(		var,
			head,
			field,
			tvar
	)

Value:

for ((var) = STAILQ_FIRST((head));              \
            (var) && ((tvar) = STAILQ_NEXT((var), field), 1);       \
            (var) = (tvar))

Definition at line 122 of file queue.h.

STAILQ_HEAD

#define STAILQ_HEAD	(		name,
			type
	)

Value:

struct name {                               \
        struct type *stqh_first;/* first element */         \
        struct type **stqh_last;/* addr of last next element */     \
    }

Definition at line 87 of file queue.h.

STAILQ_HEAD_INITIALIZER

#define STAILQ_HEAD_INITIALIZER

(

head

)

{ NULL, &(head).stqh_first }

Definition at line 93 of file queue.h.

STAILQ_INIT

#define STAILQ_INIT

(

head

)

Value:

do {                        \
        STAILQ_FIRST((head)) = NULL;                    \
        (head)->stqh_last = &STAILQ_FIRST((head));          \
    } while (0)

Definition at line 127 of file queue.h.

STAILQ_INSERT_AFTER

#define STAILQ_INSERT_AFTER	(		head,
			tqelm,
			elm,
			field
	)

Value:

do {        \
        if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
            (head)->stqh_last = &STAILQ_NEXT((elm), field);     \
        STAILQ_NEXT((tqelm), field) = (elm);                \
    } while (0)

Definition at line 132 of file queue.h.

STAILQ_INSERT_CHAIN_HEAD

#define STAILQ_INSERT_CHAIN_HEAD	(		head,
			elm_chead,
			elm_ctail,
			field
	)

Value:

do {   \
        if ((STAILQ_NEXT(elm_ctail, field) = STAILQ_FIRST(head)) == NULL ) { \
            (head)->stqh_last = &STAILQ_NEXT(elm_ctail, field);            \
        }                                                                      \
        STAILQ_FIRST(head) = (elm_chead);                                    \
    } while (0)

Definition at line 197 of file queue.h.

STAILQ_INSERT_HEAD

#define STAILQ_INSERT_HEAD	(		head,
			elm,
			field
	)

Value:

do {            \
        if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
            (head)->stqh_last = &STAILQ_NEXT((elm), field);     \
        STAILQ_FIRST((head)) = (elm);                   \
    } while (0)

Definition at line 138 of file queue.h.

STAILQ_INSERT_TAIL

#define STAILQ_INSERT_TAIL	(		head,
			elm,
			field
	)

Value:

do {            \
        STAILQ_NEXT((elm), field) = NULL;               \
        *(head)->stqh_last = (elm);                 \
        (head)->stqh_last = &STAILQ_NEXT((elm), field);         \
    } while (0)

Definition at line 144 of file queue.h.

STAILQ_LAST

#define STAILQ_LAST	(		head,
			type,
			field
	)

Value:

(STAILQ_EMPTY((head)) ?                     \
     NULL :                         \
     ((struct type *)(void *)               \
      ((char *)((head)->stqh_last) - __offsetof(struct type, field))))

Definition at line 150 of file queue.h.

STAILQ_NEXT

#define STAILQ_NEXT	(		elm,
			field
	)		((elm)->field.stqe_next)

Definition at line 156 of file queue.h.

STAILQ_REMOVE

#define STAILQ_REMOVE	(		head,
			elm,
			type,
			field
	)

Value:

do {            \
        QMD_SAVELINK(oldnext, (elm)->field.stqe_next);          \
        if (STAILQ_FIRST((head)) == (elm)) {                \
            STAILQ_REMOVE_HEAD((head), field);          \
        }                               \
        else {                              \
            struct type *curelm = STAILQ_FIRST((head));     \
            while (STAILQ_NEXT(curelm, field) != (elm))     \
                curelm = STAILQ_NEXT(curelm, field);        \
            STAILQ_REMOVE_AFTER(head, curelm, field);       \
        }                               \
        TRASHIT(*oldnext);                      \
    } while (0)

Definition at line 158 of file queue.h.

STAILQ_REMOVE_AFTER

#define STAILQ_REMOVE_AFTER	(		head,
			elm,
			field
	)

Value:

do {            \
        if ((STAILQ_NEXT(elm, field) =                  \
                STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL)   \
            (head)->stqh_last = &STAILQ_NEXT((elm), field);     \
    } while (0)

Definition at line 178 of file queue.h.

STAILQ_REMOVE_HEAD

#define STAILQ_REMOVE_HEAD	(		head,
			field
	)

Value:

do {                \
        if ((STAILQ_FIRST((head)) =                 \
                STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL)      \
            (head)->stqh_last = &STAILQ_FIRST((head));      \
    } while (0)

Definition at line 172 of file queue.h.

STAILQ_SWAP

#define STAILQ_SWAP	(		head1,
			head2,
			type
	)

Value:

do {                \
        struct type *swap_first = STAILQ_FIRST(head1);          \
        struct type **swap_last = (head1)->stqh_last;           \
        STAILQ_FIRST(head1) = STAILQ_FIRST(head2);          \
        (head1)->stqh_last = (head2)->stqh_last;            \
        STAILQ_FIRST(head2) = swap_first;               \
        (head2)->stqh_last = swap_last;                 \
        if (STAILQ_EMPTY(head1))                    \
            (head1)->stqh_last = &STAILQ_FIRST(head1);      \
        if (STAILQ_EMPTY(head2))                    \
            (head2)->stqh_last = &STAILQ_FIRST(head2);      \
    } while (0)

Definition at line 184 of file queue.h.

TRASHIT

#define TRASHIT

(

x

)

Definition at line 5 of file queue.h.