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

Macros
#define	QUEUE_MACRO_DEBUG 0

#define	QMD_TRACE_ELEM(elem)

#define	QMD_TRACE_HEAD(head)

#define	TRACEBUF

#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_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_HEAD_UNTIL(head, elm, field)

#define	LIST_HEAD(name, type)

#define	LIST_HEAD_INITIALIZER(head) { NULL }

#define	LIST_ENTRY(type)

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

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

#define	LIST_FOREACH(var, head, field)

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

#define	LIST_INIT(head)

#define	LIST_INSERT_AFTER(listelm, elm, field)

#define	LIST_INSERT_BEFORE(listelm, elm, field)

#define	LIST_INSERT_HEAD(head, elm, field)

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

#define	LIST_REMOVE(elm, field)

#define	TAILQ_HEAD(name, type)

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

#define	TAILQ_ENTRY(type)

#define	TAILQ_CONCAT(head1, head2, field)

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

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

#define	TAILQ_FOREACH(var, head, field)

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

#define	TAILQ_FOREACH_REVERSE(var, head, headname, field)

#define	TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)

#define	TAILQ_INIT(head)

#define	TAILQ_INSERT_AFTER(head, listelm, elm, field)

#define	TAILQ_INSERT_BEFORE(listelm, elm, field)

#define	TAILQ_INSERT_HEAD(head, elm, field)

#define	TAILQ_INSERT_TAIL(head, elm, field)

#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)

Macro Definition Documentation

◆ LIST_EMPTY

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

◆ LIST_ENTRY

#define LIST_ENTRY ( type )

Value:

struct {                                \
    struct type *le_next;   /* next element */          \
    struct type **le_prev;  /* address of previous next element */  \
}

◆ LIST_FIRST

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

◆ LIST_FOREACH

#define LIST_FOREACH	(	var,
		head,
		field
	)

Value:

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

◆ LIST_FOREACH_SAFE

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

Value:

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

◆ LIST_HEAD

#define LIST_HEAD	(	name,
		type
	)

Value:

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

◆ LIST_HEAD_INITIALIZER

#define LIST_HEAD_INITIALIZER ( head ) { NULL }

◆ LIST_INIT

#define LIST_INIT ( head )

Value:

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

◆ LIST_INSERT_AFTER

#define LIST_INSERT_AFTER	(	listelm,
		elm,
		field
	)

Value:

    do {            \
    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)

◆ LIST_INSERT_BEFORE

#define LIST_INSERT_BEFORE	(	listelm,
		elm,
		field
	)

Value:

    do {            \
    (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)

◆ LIST_INSERT_HEAD

#define LIST_INSERT_HEAD	(	head,
		elm,
		field
	)

Value:

    do {                \
    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)

◆ LIST_NEXT

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

◆ LIST_REMOVE

#define LIST_REMOVE	(	elm,
		field
	)

Value:

    do {                    \
    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);        \
} while (0)

◆ QMD_TRACE_ELEM

#define QMD_TRACE_ELEM ( elem )

◆ QMD_TRACE_HEAD

#define QMD_TRACE_HEAD ( head )

◆ QUEUE_MACRO_DEBUG

#define QUEUE_MACRO_DEBUG 0

◆ SLIST_EMPTY

#define SLIST_EMPTY ( head ) ((head)->slh_first == NULL)

◆ SLIST_ENTRY

#define SLIST_ENTRY ( type )

Value:

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

◆ SLIST_FIRST

#define SLIST_FIRST ( head ) ((head)->slh_first)

◆ SLIST_FOREACH

#define SLIST_FOREACH	(	var,
		head,
		field
	)

Value:

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

◆ 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))

◆ 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))

◆ SLIST_HEAD

#define SLIST_HEAD	(	name,
		type
	)

Value:

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

◆ SLIST_HEAD_INITIALIZER

#define SLIST_HEAD_INITIALIZER ( head ) { NULL }

◆ SLIST_INIT

#define SLIST_INIT ( head )

Value:

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

◆ 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)

◆ 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)

◆ SLIST_NEXT

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

◆ SLIST_REMOVE

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

Value:

    do {            \
    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_NEXT(curelm, field) =             \
            SLIST_NEXT(SLIST_NEXT(curelm, field), field);   \
    }                               \
} while (0)

◆ SLIST_REMOVE_HEAD

#define SLIST_REMOVE_HEAD	(	head,
		field
	)

Value:

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

◆ 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)

◆ STAILQ_EMPTY

#define STAILQ_EMPTY ( head ) ((head)->stqh_first == NULL)

◆ STAILQ_ENTRY

#define STAILQ_ENTRY ( type )

Value:

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

◆ STAILQ_FIRST

#define STAILQ_FIRST ( head ) ((head)->stqh_first)

◆ STAILQ_FOREACH

#define STAILQ_FOREACH	(	var,
		head,
		field
	)

Value:

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

◆ 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))

◆ 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 */     \
}

◆ STAILQ_HEAD_INITIALIZER

#define STAILQ_HEAD_INITIALIZER ( head ) { NULL, &(head).stqh_first }

◆ STAILQ_INIT

#define STAILQ_INIT ( head )

Value:

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

◆ 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)

◆ 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)

◆ 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)

◆ STAILQ_LAST

#define STAILQ_LAST	(	head,
		type,
		field
	)

Value:

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

◆ STAILQ_NEXT

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

◆ STAILQ_REMOVE

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

Value:

    do {            \
    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);        \
        if ((STAILQ_NEXT(curelm, field) =           \
             STAILQ_NEXT(STAILQ_NEXT(curelm, field), field)) == NULL)\
            (head)->stqh_last = &STAILQ_NEXT((curelm), field);\
    }                               \
} while (0)

◆ 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)

◆ STAILQ_REMOVE_HEAD_UNTIL

#define STAILQ_REMOVE_HEAD_UNTIL	(	head,
		elm,
		field
	)

Value:

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

◆ TAILQ_CONCAT

#define TAILQ_CONCAT	(	head1,
		head2,
		field
	)

Value:

    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(head);                   \
        QMD_TRACE_HEAD(head2);                  \
    }                               \
} while (0)

◆ TAILQ_EMPTY

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

◆ TAILQ_ENTRY

#define TAILQ_ENTRY ( type )

Value:

struct {                                \
    struct type *tqe_next;  /* next element */          \
    struct type **tqe_prev; /* address of previous next element */  \
    TRACEBUF                            \
}

◆ TAILQ_FIRST

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

◆ TAILQ_FOREACH

#define TAILQ_FOREACH	(	var,
		head,
		field
	)

Value:

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

◆ TAILQ_FOREACH_REVERSE

#define TAILQ_FOREACH_REVERSE	(	var,
		head,
		headname,
		field
	)

Value:

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

◆ TAILQ_FOREACH_REVERSE_SAFE

#define TAILQ_FOREACH_REVERSE_SAFE	(	var,
		head,
		headname,
		field,
		tvar
	)

Value:

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

◆ TAILQ_FOREACH_SAFE

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

Value:

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

◆ TAILQ_HEAD

#define TAILQ_HEAD	(	name,
		type
	)

Value:

struct name {                               \
    struct type *tqh_first; /* first element */         \
    struct type **tqh_last; /* addr of last next element */     \
    TRACEBUF                            \
}

◆ TAILQ_HEAD_INITIALIZER

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

◆ TAILQ_INIT

#define TAILQ_INIT ( head )

Value:

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

◆ TAILQ_INSERT_AFTER

#define TAILQ_INSERT_AFTER	(	head,
		listelm,
		elm,
		field
	)

Value:

    do {        \
    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)

◆ TAILQ_INSERT_BEFORE

#define TAILQ_INSERT_BEFORE	(	listelm,
		elm,
		field
	)

Value:

    do {            \
    (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)

◆ TAILQ_INSERT_HEAD

#define TAILQ_INSERT_HEAD	(	head,
		elm,
		field
	)

Value:

    do {            \
    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)

◆ TAILQ_INSERT_TAIL

#define TAILQ_INSERT_TAIL	(	head,
		elm,
		field
	)

Value:

    do {            \
    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)

◆ TAILQ_LAST

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

◆ TAILQ_NEXT

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

◆ TAILQ_PREV

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

◆ TAILQ_REMOVE

#define TAILQ_REMOVE	(	head,
		elm,
		field
	)

Value:

    do {                \
    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)

◆ TRACEBUF

#define TRACEBUF

◆ TRASHIT

#define TRASHIT ( x )

Macros

Macro Definition Documentation

◆ LIST_EMPTY

◆ LIST_ENTRY

◆ LIST_FIRST

◆ LIST_FOREACH

◆ LIST_FOREACH_SAFE

◆ LIST_HEAD

◆ LIST_HEAD_INITIALIZER

◆ LIST_INIT

◆ LIST_INSERT_AFTER

◆ LIST_INSERT_BEFORE

◆ LIST_INSERT_HEAD

◆ LIST_NEXT

◆ LIST_REMOVE

◆ QMD_TRACE_ELEM

◆ QMD_TRACE_HEAD

◆ QUEUE_MACRO_DEBUG

◆ SLIST_EMPTY

◆ SLIST_ENTRY

◆ SLIST_FIRST

◆ SLIST_FOREACH

◆ SLIST_FOREACH_PREVPTR

◆ SLIST_FOREACH_SAFE

◆ SLIST_HEAD

◆ SLIST_HEAD_INITIALIZER

◆ SLIST_INIT

◆ SLIST_INSERT_AFTER

◆ SLIST_INSERT_HEAD

◆ SLIST_NEXT

◆ SLIST_REMOVE

◆ SLIST_REMOVE_HEAD

◆ STAILQ_CONCAT

◆ STAILQ_EMPTY

◆ STAILQ_ENTRY

◆ STAILQ_FIRST

◆ STAILQ_FOREACH

◆ STAILQ_FOREACH_SAFE

◆ STAILQ_HEAD

◆ STAILQ_HEAD_INITIALIZER

◆ STAILQ_INIT

◆ STAILQ_INSERT_AFTER

◆ STAILQ_INSERT_HEAD

◆ STAILQ_INSERT_TAIL

◆ STAILQ_LAST

◆ STAILQ_NEXT

◆ STAILQ_REMOVE

◆ STAILQ_REMOVE_HEAD

◆ STAILQ_REMOVE_HEAD_UNTIL

◆ TAILQ_CONCAT

◆ TAILQ_EMPTY

◆ TAILQ_ENTRY

◆ TAILQ_FIRST

◆ TAILQ_FOREACH

◆ TAILQ_FOREACH_REVERSE

◆ TAILQ_FOREACH_REVERSE_SAFE

◆ TAILQ_FOREACH_SAFE

◆ TAILQ_HEAD

◆ TAILQ_HEAD_INITIALIZER

◆ TAILQ_INIT

◆ TAILQ_INSERT_AFTER

◆ TAILQ_INSERT_BEFORE

◆ TAILQ_INSERT_HEAD

◆ TAILQ_INSERT_TAIL

◆ TAILQ_LAST

◆ TAILQ_NEXT

◆ TAILQ_PREV

◆ TAILQ_REMOVE

◆ TRACEBUF

◆ TRASHIT