Go to the source code of this file.
Defines | |
#define | CIRCLEQ_END(head) ((void *)(head)) |
#define | CIRCLEQ_ENTRY(type) |
#define | CIRCLEQ_FIRST(head) ((head)->cqh_first) |
#define | CIRCLEQ_HEAD(name, type) |
#define | CIRCLEQ_INIT(head) |
#define | CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) |
#define | CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) |
#define | CIRCLEQ_INSERT_HEAD(head, elm, field) |
#define | CIRCLEQ_INSERT_TAIL(head, elm, field) |
#define | CIRCLEQ_LAST(head) ((head)->cqh_last) |
#define | CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) |
#define | CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) |
#define | CIRCLEQ_REMOVE(head, elm, field) |
#define | LIST_END(head) NULL |
#define | LIST_ENTRY(type) |
#define | LIST_FIRST(head) ((head)->lh_first) |
#define | LIST_HEAD(name, type) |
#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_END(head) NULL |
#define | TAILQ_ENTRY(type) |
#define | TAILQ_FIRST(head) ((head)->tqh_first) |
#define | TAILQ_HEAD(name, type) |
#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_NEXT(elm, field) ((elm)->field.tqe_next) |
#define | TAILQ_REMOVE(head, elm, field) |