lseos-lib » libc » conven

queue.h File Reference

Go to the source code of this file.

Defines

#define LIST_HEAD(name, type)
#define LIST_HEAD_INITIALIZER(head)   { NULL }
#define LIST_ENTRY(type)
#define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field)
#define QUEUEDEBUG_LIST_OP(elm, field)
#define QUEUEDEBUG_LIST_POSTREMOVE(elm, 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_FOREACH(var, head, field)
#define LIST_EMPTY(head)   ((head)->lh_first == NULL)
#define LIST_FIRST(head)   ((head)->lh_first)
#define LIST_NEXT(elm, field)   ((elm)->field.le_next)
#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_NEXT(elm, field)   ((elm)->field.sle_next)
#define SLIST_FOREACH(var, head, field)   for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
#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(head, field)
#define SLIST_REMOVE(head, elm, type, field)
#define SIMPLEQ_HEAD(name, type)
#define SIMPLEQ_HEAD_INITIALIZER(head)   { NULL, &(head).sqh_first }
#define SIMPLEQ_ENTRY(type)
#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, elm, field)
#define SIMPLEQ_FOREACH(var, head, field)
#define SIMPLEQ_EMPTY(head)   ((head)->sqh_first == NULL)
#define SIMPLEQ_FIRST(head)   ((head)->sqh_first)
#define SIMPLEQ_NEXT(elm, field)   ((elm)->field.sqe_next)
#define TAILQ_HEAD(name, type)
#define TAILQ_HEAD_INITIALIZER(head)   { NULL, &(head).tqh_first }
#define TAILQ_ENTRY(type)
#define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field)
#define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field)
#define QUEUEDEBUG_TAILQ_OP(elm, field)
#define QUEUEDEBUG_TAILQ_POSTREMOVE(elm, 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_EMPTY(head)   ((head)->tqh_first == NULL)
#define TAILQ_FIRST(head)   ((head)->tqh_first)
#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_FOREACH(var, head, field)
#define TAILQ_FOREACH_REVERSE(var, head, headname, field)
#define CIRCLEQ_HEAD(name, type)
#define CIRCLEQ_HEAD_INITIALIZER(head)   { (void *)&head, (void *)&head }
#define CIRCLEQ_ENTRY(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_REMOVE(head, elm, field)
#define CIRCLEQ_FOREACH(var, head, field)
#define CIRCLEQ_FOREACH_REVERSE(var, head, field)
#define CIRCLEQ_EMPTY(head)   ((head)->cqh_first == (void *)(head))
#define CIRCLEQ_FIRST(head)   ((head)->cqh_first)
#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 RUNQ_HEAD(name, type)
#define RUNQ_HEAD_INITIALIZER(head)   { NULL }
#define RUNQ_ENTRY(type)
#define RUNQ_INIT(head)
#define RUNQ_INSERT_BEFORE(head, listelm, elm, field)
#define RUNQ_SET_PTR(head, elm, field)
#define RUNQ_REMOVE(head, elm, field)
#define RUNQ_FOREACH(var, head, field)
#define RUNQ_EMPTY(head)   ((head)->rqh_ptr == NULL)
#define RUNQ_NEXT(elm, field)   ((elm)->field.rqe_next)
#define RUNQ_PREV(elm, field)   ((elm)->field.rqe_prev)

Define Documentation

#define CIRCLEQ_EMPTY (  head   )     ((head)->cqh_first == (void *)(head))
 

#define CIRCLEQ_ENTRY (  type   ) 
 

Value:

struct {                                                                \
        struct type *cqe_next;          /* next element */              \
        struct type *cqe_prev;          /* previous element */          \
}

#define CIRCLEQ_FIRST (  head   )     ((head)->cqh_first)
 

#define CIRCLEQ_FOREACH (  var,
head,
field   ) 
 

Value:

for ((var) = ((head)->cqh_first);                               \
                (var) != (void *)(head);                                \
                (var) = ((var)->field.cqe_next))

#define CIRCLEQ_FOREACH_REVERSE (  var,
head,
field   ) 
 

Value:

for ((var) = ((head)->cqh_last);                                \
                (var) != (void *)(head);                                \
                (var) = ((var)->field.cqe_prev))

#define CIRCLEQ_HEAD (  name,
type   ) 
 

Value:

struct name {                                                           \
        struct type *cqh_first;         /* first element */             \
        struct type *cqh_last;          /* last element */              \
}

#define CIRCLEQ_HEAD_INITIALIZER (  head   )     { (void *)&head, (void *)&head }
 

#define CIRCLEQ_INIT (  head   ) 
 

Value:

do {                                            \
        (head)->cqh_first = (void *)(head);                             \
        (head)->cqh_last = (void *)(head);                              \
} while (/*CONSTCOND*/0)

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

Value:

do {            \
        (elm)->field.cqe_next = (listelm)->field.cqe_next;              \
        (elm)->field.cqe_prev = (listelm);                              \
        if ((listelm)->field.cqe_next == (void *)(head))                \
                (head)->cqh_last = (elm);                               \
        else                                                            \
                (listelm)->field.cqe_next->field.cqe_prev = (elm);      \
        (listelm)->field.cqe_next = (elm);                              \
} while (/*CONSTCOND*/0)

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

Value:

do {            \
        (elm)->field.cqe_next = (listelm);                              \
        (elm)->field.cqe_prev = (listelm)->field.cqe_prev;              \
        if ((listelm)->field.cqe_prev == (void *)(head))                \
                (head)->cqh_first = (elm);                              \
        else                                                            \
                (listelm)->field.cqe_prev->field.cqe_next = (elm);      \
        (listelm)->field.cqe_prev = (elm);                              \
} while (/*CONSTCOND*/0)

#define CIRCLEQ_INSERT_HEAD (  head,
elm,
field   ) 
 

Value:

do {                    \
        (elm)->field.cqe_next = (head)->cqh_first;                      \
        (elm)->field.cqe_prev = (void *)(head);                         \
        if ((head)->cqh_last == (void *)(head))                         \
                (head)->cqh_last = (elm);                               \
        else                                                            \
                (head)->cqh_first->field.cqe_prev = (elm);              \
        (head)->cqh_first = (elm);                                      \
} while (/*CONSTCOND*/0)

#define CIRCLEQ_INSERT_TAIL (  head,
elm,
field   ) 
 

Value:

do {                    \
        (elm)->field.cqe_next = (void *)(head);                         \
        (elm)->field.cqe_prev = (head)->cqh_last;                       \
        if ((head)->cqh_first == (void *)(head))                        \
                (head)->cqh_first = (elm);                              \
        else                                                            \
                (head)->cqh_last->field.cqe_next = (elm);               \
        (head)->cqh_last = (elm);                                       \
} while (/*CONSTCOND*/0)

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

Value:

do {                            \
        if ((elm)->field.cqe_next == (void *)(head))                    \
                (head)->cqh_last = (elm)->field.cqe_prev;               \
        else                                                            \
                (elm)->field.cqe_next->field.cqe_prev =                 \
                    (elm)->field.cqe_prev;                              \
        if ((elm)->field.cqe_prev == (void *)(head))                    \
                (head)->cqh_first = (elm)->field.cqe_next;              \
        else                                                            \
                (elm)->field.cqe_prev->field.cqe_next =                 \
                    (elm)->field.cqe_next;                              \
} while (/*CONSTCOND*/0)

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

#define LIST_ENTRY (  type   ) 
 

Value:

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

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

#define LIST_FOREACH (  var,
head,
field   ) 
 

Value:

for ((var) = ((head)->lh_first);                                \
                (var);                                                  \
                (var) = ((var)->field.le_next))

#define LIST_HEAD (  name,
type   ) 
 

Value:

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

#define LIST_HEAD_INITIALIZER (  head   )     { NULL }
 

#define LIST_INIT (  head   ) 
 

Value:

do {                                            \
        (head)->lh_first = NULL;                                        \
} while (/*CONSTCOND*/0)

#define LIST_INSERT_AFTER (  listelm,
elm,
field   ) 
 

Value:

do {                    \
        QUEUEDEBUG_LIST_OP((listelm), field)                            \
        if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)  \
                (listelm)->field.le_next->field.le_prev =               \
                    &(elm)->field.le_next;                              \
        (listelm)->field.le_next = (elm);                               \
        (elm)->field.le_prev = &(listelm)->field.le_next;               \
} while (/*CONSTCOND*/0)

#define LIST_INSERT_BEFORE (  listelm,
elm,
field   ) 
 

Value:

do {                    \
        QUEUEDEBUG_LIST_OP((listelm), field)                            \
        (elm)->field.le_prev = (listelm)->field.le_prev;                \
        (elm)->field.le_next = (listelm);                               \
        *(listelm)->field.le_prev = (elm);                              \
        (listelm)->field.le_prev = &(elm)->field.le_next;               \
} while (/*CONSTCOND*/0)

#define LIST_INSERT_HEAD (  head,
elm,
field   ) 
 

Value:

do {                            \
        QUEUEDEBUG_LIST_INSERT_HEAD((head), (elm), field)               \
        if (((elm)->field.le_next = (head)->lh_first) != NULL)          \
                (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
        (head)->lh_first = (elm);                                       \
        (elm)->field.le_prev = &(head)->lh_first;                       \
} while (/*CONSTCOND*/0)

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

#define LIST_REMOVE (  elm,
field   ) 
 

Value:

do {                                    \
        QUEUEDEBUG_LIST_OP((elm), field)                                \
        if ((elm)->field.le_next != NULL)                               \
                (elm)->field.le_next->field.le_prev =                   \
                    (elm)->field.le_prev;                               \
        *(elm)->field.le_prev = (elm)->field.le_next;                   \
        QUEUEDEBUG_LIST_POSTREMOVE((elm), field)                        \
} while (/*CONSTCOND*/0)

#define QUEUEDEBUG_LIST_INSERT_HEAD (  head,
elm,
field   ) 
 

#define QUEUEDEBUG_LIST_OP (  elm,
field   ) 
 

#define QUEUEDEBUG_LIST_POSTREMOVE (  elm,
field   ) 
 

#define QUEUEDEBUG_TAILQ_INSERT_HEAD (  head,
elm,
field   ) 
 

#define QUEUEDEBUG_TAILQ_INSERT_TAIL (  head,
elm,
field   ) 
 

#define QUEUEDEBUG_TAILQ_OP (  elm,
field   ) 
 

#define QUEUEDEBUG_TAILQ_POSTREMOVE (  elm,
field   ) 
 

#define RUNQ_EMPTY (  head   )     ((head)->rqh_ptr == NULL)
 

#define RUNQ_ENTRY (  type   ) 
 

Value:

struct {                                                                \
        struct type *rqe_next;          /* next element */              \
        struct type *rqe_prev;          /* previous element */          \
}

#define RUNQ_FOREACH (  var,
head,
field   ) 
 

Value:

for ((head)->flg = 0, (var) = ((head)->rqh_ptr);                \
                ((head)->flg == 0 || (var) != (head)->rqh_ptr) &&       \
                                                (var) != NULL;          \
                (var) = ((var)->field.rqe_next), (head)->flg = 1)

#define RUNQ_HEAD (  name,
type   ) 
 

Value:

struct name {                                                           \
        struct type *rqh_ptr;           /* ptr element */               \
        int          flg;                                               \
}

#define RUNQ_HEAD_INITIALIZER (  head   )     { NULL }
 

#define RUNQ_INIT (  head   ) 
 

Value:

do {                                            \
        (head)->rqh_ptr = NULL;                                         \
} while (/*CONSTCOND*/0)

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

Value:

do {            \
        (elm)->field.rqe_next = (listelm);                              \
        (elm)->field.rqe_prev = (listelm)->field.rqe_prev;              \
        (listelm)->field.rqe_prev->field.rqe_next = (elm);              \
        (listelm)->field.rqe_prev = (elm);                              \
} while (/*CONSTCOND*/0)

#define RUNQ_NEXT (  elm,
field   )     ((elm)->field.rqe_next)
 

#define RUNQ_PREV (  elm,
field   )     ((elm)->field.rqe_prev)
 

#define RUNQ_REMOVE (  head,
elm,
field   ) 
 

Value:

do {                            \
        if ((elm)->field.rqe_next == (elm))                             \
                (head)->rqh_ptr = NULL;                                 \
        else                                                            \
        {                                                               \
                (elm)->field.rqe_next->field.rqe_prev =                 \
                    (elm)->field.rqe_prev;                              \
                (elm)->field.rqe_prev->field.rqe_next =                 \
                    (elm)->field.rqe_next;                              \
        }                                                               \
} while (/*CONSTCOND*/0)

#define RUNQ_SET_PTR (  head,
elm,
field   ) 
 

Value:

do {                            \
        (head)->rqh_ptr = (elm);                                        \
        (elm)->field.rqe_next = (elm);                                  \
        (elm)->field.rqe_prev = (elm);                                  \
} while (/*CONSTCOND*/0)

#define SIMPLEQ_EMPTY (  head   )     ((head)->sqh_first == NULL)
 

#define SIMPLEQ_ENTRY (  type   ) 
 

Value:

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

#define SIMPLEQ_FIRST (  head   )     ((head)->sqh_first)
 

#define SIMPLEQ_FOREACH (  var,
head,
field   ) 
 

Value:

for ((var) = ((head)->sqh_first);                               \
                (var);                                                  \
                (var) = ((var)->field.sqe_next))

#define SIMPLEQ_HEAD (  name,
type   ) 
 

Value:

struct name {                                                           \
        struct type *sqh_first; /* first element */                     \
        struct type **sqh_last; /* addr of last next element */         \
}

#define SIMPLEQ_HEAD_INITIALIZER (  head   )     { NULL, &(head).sqh_first }
 

#define SIMPLEQ_INIT (  head   ) 
 

Value:

do {                                            \
        (head)->sqh_first = NULL;                                       \
        (head)->sqh_last = &(head)->sqh_first;                          \
} while (/*CONSTCOND*/0)

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

Value:

do {            \
        if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
                (head)->sqh_last = &(elm)->field.sqe_next;              \
        (listelm)->field.sqe_next = (elm);                              \
} while (/*CONSTCOND*/0)

#define SIMPLEQ_INSERT_HEAD (  head,
elm,
field   ) 
 

Value:

do {                    \
        if (((elm)->field.sqe_next = (head)->sqh_first) == NULL)        \
                (head)->sqh_last = &(elm)->field.sqe_next;              \
        (head)->sqh_first = (elm);                                      \
} while (/*CONSTCOND*/0)

#define SIMPLEQ_INSERT_TAIL (  head,
elm,
field   ) 
 

Value:

do {                    \
        (elm)->field.sqe_next = NULL;                                   \
        *(head)->sqh_last = (elm);                                      \
        (head)->sqh_last = &(elm)->field.sqe_next;                      \
} while (/*CONSTCOND*/0)

#define SIMPLEQ_NEXT (  elm,
field   )     ((elm)->field.sqe_next)
 

#define SIMPLEQ_REMOVE_HEAD (  head,
elm,
field   ) 
 

Value:

do {                    \
        if (((head)->sqh_first = (elm)->field.sqe_next) == NULL)        \
                (head)->sqh_last = &(head)->sqh_first;                  \
} while (/*CONSTCOND*/0)

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

#define SLIST_ENTRY (  type   ) 
 

Value:

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

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

#define SLIST_FOREACH (  var,
head,
field   )     for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
 

#define SLIST_HEAD (  name,
type   ) 
 

Value:

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

#define SLIST_HEAD_INITIALIZER (  head   )     { NULL }
 

#define SLIST_INIT (  head   ) 
 

Value:

do {                                            \
        (head)->slh_first = NULL;                                       \
} while (/*CONSTCOND*/0)

#define SLIST_INSERT_AFTER (  slistelm,
elm,
field   ) 
 

Value:

do {                    \
        (elm)->field.sle_next = (slistelm)->field.sle_next;             \
        (slistelm)->field.sle_next = (elm);                             \
} while (/*CONSTCOND*/0)

#define SLIST_INSERT_HEAD (  head,
elm,
field   ) 
 

Value:

do {                    \
        (elm)->field.sle_next = (head)->slh_first;                      \
        (head)->slh_first = (elm);                                      \
} while (/*CONSTCOND*/0)

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

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

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

Value:

do {                    \
        if ((head)->slh_first == (elm)) {                               \
                SLIST_REMOVE_HEAD((head), field);                       \
        }                                                               \
        else {                                                          \
                struct type *curelm = (head)->slh_first;                \
                while(curelm->field.sle_next != (elm))                  \
                        curelm = curelm->field.sle_next;                \
                curelm->field.sle_next =                                \
                    curelm->field.sle_next->field.sle_next;             \
        }                                                               \
} while (/*CONSTCOND*/0)

#define SLIST_REMOVE_HEAD (  head,
field   ) 
 

Value:

do {                            \
        (head)->slh_first = (head)->slh_first->field.sle_next;          \
} while (/*CONSTCOND*/0)

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

#define TAILQ_ENTRY (  type   ) 
 

Value:

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

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

#define TAILQ_FOREACH (  var,
head,
field   ) 
 

Value:

for ((var) = ((head)->tqh_first);                               \
                (var);                                                  \
                (var) = ((var)->field.tqe_next))

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

Value:

for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last));    \
                (var);                                                  \
                (var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last)))

#define TAILQ_HEAD (  name,
type   ) 
 

Value:

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

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

#define TAILQ_INIT (  head   ) 
 

Value:

do {                                            \
        (head)->tqh_first = NULL;                                       \
        (head)->tqh_last = &(head)->tqh_first;                          \
} while (/*CONSTCOND*/0)

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

Value:

do {            \
        QUEUEDEBUG_TAILQ_OP((listelm), field)                           \
        if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
                (elm)->field.tqe_next->field.tqe_prev =                 \
                    &(elm)->field.tqe_next;                             \
        else                                                            \
                (head)->tqh_last = &(elm)->field.tqe_next;              \
        (listelm)->field.tqe_next = (elm);                              \
        (elm)->field.tqe_prev = &(listelm)->field.tqe_next;             \
} while (/*CONSTCOND*/0)

#define TAILQ_INSERT_BEFORE (  listelm,
elm,
field   ) 
 

Value:

do {                    \
        QUEUEDEBUG_TAILQ_OP((listelm), field)                           \
        (elm)->field.tqe_prev = (listelm)->field.tqe_prev;              \
        (elm)->field.tqe_next = (listelm);                              \
        *(listelm)->field.tqe_prev = (elm);                             \
        (listelm)->field.tqe_prev = &(elm)->field.tqe_next;             \
} while (/*CONSTCOND*/0)

#define TAILQ_INSERT_HEAD (  head,
elm,
field   ) 
 

Value:

do {                    \
        QUEUEDEBUG_TAILQ_INSERT_HEAD((head), (elm), field)              \
        if (((elm)->field.tqe_next = (head)->tqh_first) != NULL)        \
                (head)->tqh_first->field.tqe_prev =                     \
                    &(elm)->field.tqe_next;                             \
        else                                                            \
                (head)->tqh_last = &(elm)->field.tqe_next;              \
                (head)->tqh_first = (elm);                              \
        (elm)->field.tqe_prev = &(head)->tqh_first;                     \
} while (/*CONSTCOND*/0)

#define TAILQ_INSERT_TAIL (  head,
elm,
field   ) 
 

Value:

do {                    \
        QUEUEDEBUG_TAILQ_INSERT_TAIL((head), (elm), field)              \
        (elm)->field.tqe_next = NULL;                                   \
        (elm)->field.tqe_prev = (head)->tqh_last;                       \
        *(head)->tqh_last = (elm);                                      \
        (head)->tqh_last = &(elm)->field.tqe_next;                      \
} while (/*CONSTCOND*/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   ) 
 

Value:

do {                            \
        QUEUEDEBUG_TAILQ_OP((elm), field)                               \
        if (((elm)->field.tqe_next) != NULL)                            \
                (elm)->field.tqe_next->field.tqe_prev =                 \
                    (elm)->field.tqe_prev;                              \
        else                                                            \
                (head)->tqh_last = (elm)->field.tqe_prev;               \
        *(elm)->field.tqe_prev = (elm)->field.tqe_next;                 \
        QUEUEDEBUG_TAILQ_POSTREMOVE((elm), field);                      \
} while (/*CONSTCOND*/0)

Generated on Wed May 24 23:05:54 2006 for LSE/OS by  doxygen 1.4.6