|
#define | _Q_INVALIDATE(a) |
|
#define | SLIST_HEAD(name, type) |
|
#define | SLIST_HEAD_INITIALIZER(head) { NULL } |
|
#define | SLIST_ENTRY(type) |
|
#define | SLIST_FIRST(head) ((head)->slh_first) |
|
#define | SLIST_END(head) NULL |
|
#define | SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) |
|
#define | SLIST_NEXT(elm, field) ((elm)->field.sle_next) |
|
#define | SLIST_FOREACH(var, head, field) |
|
#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_REMOVE_NEXT(head, elm, field) |
|
#define | SLIST_REMOVE_HEAD(head, field) |
|
#define | SLIST_REMOVE(head, elm, type, field) |
|
#define | LIST_HEAD(name, type) |
|
#define | LIST_HEAD_INITIALIZER(head) { NULL } |
|
#define | LIST_ENTRY(type) |
|
#define | LIST_FIRST(head) ((head)->lh_first) |
|
#define | LIST_END(head) NULL |
|
#define | LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) |
|
#define | LIST_NEXT(elm, field) ((elm)->field.le_next) |
|
#define | LIST_FOREACH(var, head, field) |
|
#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_REMOVE(elm, field) |
|
#define | LIST_REPLACE(elm, elm2, field) |
|
#define | SIMPLEQ_HEAD(name, type) |
|
#define | SIMPLEQ_HEAD_INITIALIZER(head) { NULL, &(head).sqh_first } |
|
#define | SIMPLEQ_ENTRY(type) |
|
#define | SIMPLEQ_FIRST(head) ((head)->sqh_first) |
|
#define | SIMPLEQ_END(head) NULL |
|
#define | SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) |
|
#define | SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) |
|
#define | SIMPLEQ_FOREACH(var, head, field) |
|
#define | SIMPLEQ_INIT(head) |
|
#define | SIMPLEQ_INSERT_HEAD(head, elm, field) |
|
#define | SIMPLEQ_INSERT_TAIL(head, elm, field) |
|
#define | SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) |
|
#define | SIMPLEQ_REMOVE_HEAD(head, field) |
|
#define | TAILQ_HEAD(name, type) |
|
#define | TAILQ_HEAD_INITIALIZER(head) { NULL, &(head).tqh_first } |
|
#define | TAILQ_ENTRY(type) |
|
#define | TAILQ_FIRST(head) ((head)->tqh_first) |
|
#define | TAILQ_END(head) NULL |
|
#define | TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) |
|
#define | TAILQ_LAST(head, headname) (*(((struct headname *)((head)->tqh_last))->tqh_last)) |
|
#define | TAILQ_PREV(elm, headname, field) (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) |
|
#define | TAILQ_EMPTY(head) (TAILQ_FIRST(head) == TAILQ_END(head)) |
|
#define | TAILQ_FOREACH(var, head, field) |
|
#define | TAILQ_FOREACH_REVERSE(var, head, headname, field) |
|
#define | TAILQ_INIT(head) |
|
#define | TAILQ_INSERT_HEAD(head, elm, field) |
|
#define | TAILQ_INSERT_TAIL(head, elm, field) |
|
#define | TAILQ_INSERT_AFTER(head, listelm, elm, field) |
|
#define | TAILQ_INSERT_BEFORE(listelm, elm, field) |
|
#define | TAILQ_REMOVE(head, elm, field) |
|
#define | TAILQ_REPLACE(head, elm, elm2, field) |
|
#define | CIRCLEQ_HEAD(name, type) |
|
#define | CIRCLEQ_HEAD_INITIALIZER(head) { CIRCLEQ_END(&head), CIRCLEQ_END(&head) } |
|
#define | CIRCLEQ_ENTRY(type) |
|
#define | CIRCLEQ_FIRST(head) ((head)->cqh_first) |
|
#define | CIRCLEQ_LAST(head) ((head)->cqh_last) |
|
#define | CIRCLEQ_END(head) ((void *)(head)) |
|
#define | CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) |
|
#define | CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) |
|
#define | CIRCLEQ_EMPTY(head) (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head)) |
|
#define | CIRCLEQ_FOREACH(var, head, field) |
|
#define | CIRCLEQ_FOREACH_REVERSE(var, head, field) |
|
#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_REMOVE(head, elm, field) |
|
#define | CIRCLEQ_REPLACE(head, elm, elm2, field) |
|