Back to index

glibc  2.9
Defines
queue.h File Reference
This graph shows which files directly or indirectly include this file:

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 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_INIT(head)
#define SLIST_INSERT_AFTER(slistelm, elm, field)
#define SLIST_INSERT_HEAD(head, elm, field)
#define SLIST_REMOVE_HEAD(head, field)
#define SLIST_REMOVE(head, elm, type, field)
#define SLIST_FOREACH(var, head, field)   for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
#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 STAILQ_HEAD(name, type)
#define STAILQ_HEAD_INITIALIZER(head)   { NULL, &(head).stqh_first }
#define STAILQ_ENTRY(type)
#define STAILQ_INIT(head)
#define STAILQ_INSERT_HEAD(head, elm, field)
#define STAILQ_INSERT_TAIL(head, elm, field)
#define STAILQ_INSERT_AFTER(head, listelm, elm, field)
#define STAILQ_REMOVE_HEAD(head, field)
#define STAILQ_REMOVE(head, elm, type, field)
#define STAILQ_FOREACH(var, head, field)
#define STAILQ_CONCAT(head1, head2)
#define STAILQ_EMPTY(head)   ((head)->stqh_first == NULL)
#define STAILQ_FIRST(head)   ((head)->stqh_first)
#define STAILQ_NEXT(elm, field)   ((elm)->field.stqe_next)
#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, field)
#define SIMPLEQ_REMOVE(head, elm, type, 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, qual)
#define TAILQ_HEAD(name, type)   _TAILQ_HEAD(name, struct type,)
#define TAILQ_HEAD_INITIALIZER(head)   { NULL, &(head).tqh_first }
#define _TAILQ_ENTRY(type, qual)
#define TAILQ_ENTRY(type)   _TAILQ_ENTRY(struct type,)
#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_FOREACH(var, head, field)
#define TAILQ_FOREACH_REVERSE(var, head, headname, field)
#define TAILQ_CONCAT(head1, head2, 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 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 CIRCLEQ_LOOP_NEXT(head, elm, field)
#define CIRCLEQ_LOOP_PREV(head, elm, field)

Define Documentation

#define _TAILQ_ENTRY (   type,
  qual 
)
Value:
struct {                                                       \
       qual type *tqe_next;        /* next element */          \
       qual type *qual *tqe_prev;  /* address of previous next element */\
}

Definition at line 377 of file queue.h.

#define _TAILQ_HEAD (   name,
  type,
  qual 
)
Value:
struct name {                                                  \
       qual type *tqh_first;              /* first element */         \
       qual type *qual *tqh_last;  /* addr of last next element */    \
}

Definition at line 367 of file queue.h.

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

Definition at line 559 of file queue.h.

#define CIRCLEQ_ENTRY (   type)
Value:
struct {                                                       \
       struct type *cqe_next;             /* next element */          \
       struct type *cqe_prev;             /* previous element */             \
}

Definition at line 479 of file queue.h.

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

Definition at line 560 of file queue.h.

#define CIRCLEQ_FOREACH (   var,
  head,
  field 
)
Value:
for ((var) = ((head)->cqh_first);                       \
              (var) != (const void *)(head);                          \
              (var) = ((var)->field.cqe_next))

Definition at line 546 of file queue.h.

#define CIRCLEQ_FOREACH_REVERSE (   var,
  head,
  field 
)
Value:
for ((var) = ((head)->cqh_last);                        \
              (var) != (const void *)(head);                          \
              (var) = ((var)->field.cqe_prev))

Definition at line 551 of file queue.h.

#define CIRCLEQ_HEAD (   name,
  type 
)
Value:
struct name {                                                  \
       struct type *cqh_first;            /* first element */         \
       struct type *cqh_last;             /* last element */          \
}

Definition at line 470 of file queue.h.

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

Definition at line 476 of file queue.h.

#define CIRCLEQ_INIT (   head)
Value:
do {                                      \
       (head)->cqh_first = (void *)(head);                            \
       (head)->cqh_last = (void *)(head);                      \
} while (/*CONSTCOND*/0)

Definition at line 488 of file queue.h.

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

Definition at line 493 of file queue.h.

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

Definition at line 503 of file queue.h.

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

Definition at line 513 of file queue.h.

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

Definition at line 523 of file queue.h.

#define CIRCLEQ_LAST (   head)    ((head)->cqh_last)

Definition at line 561 of file queue.h.

#define CIRCLEQ_LOOP_NEXT (   head,
  elm,
  field 
)
Value:
(((elm)->field.cqe_next == (void *)(head))                     \
           ? ((head)->cqh_first)                               \
           : (elm->field.cqe_next))

Definition at line 565 of file queue.h.

#define CIRCLEQ_LOOP_PREV (   head,
  elm,
  field 
)
Value:
(((elm)->field.cqe_prev == (void *)(head))                     \
           ? ((head)->cqh_last)                                \
           : (elm->field.cqe_prev))

Definition at line 569 of file queue.h.

#define CIRCLEQ_NEXT (   elm,
  field 
)    ((elm)->field.cqe_next)

Definition at line 562 of file queue.h.

#define CIRCLEQ_PREV (   elm,
  field 
)    ((elm)->field.cqe_prev)

Definition at line 563 of file queue.h.

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

Definition at line 533 of file queue.h.

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

Definition at line 142 of file queue.h.

#define LIST_ENTRY (   type)
Value:
struct {                                                       \
       struct type *le_next;       /* next element */                 \
       struct type **le_prev;      /* address of previous next element */    \
}

Definition at line 92 of file queue.h.

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

Definition at line 143 of file queue.h.

#define LIST_FOREACH (   var,
  head,
  field 
)
Value:
for ((var) = ((head)->lh_first);                        \
              (var);                                           \
              (var) = ((var)->field.le_next))

Definition at line 134 of file queue.h.

#define LIST_HEAD (   name,
  type 
)
Value:
struct name {                                                  \
       struct type *lh_first;      /* first element */                \
}

Definition at line 84 of file queue.h.

#define LIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 89 of file queue.h.

#define LIST_INIT (   head)
Value:
do {                                      \
       (head)->lh_first = NULL;                                \
} while (/*CONSTCOND*/0)

Definition at line 101 of file queue.h.

#define LIST_INSERT_AFTER (   listelm,
  elm,
  field 
)
Value:
do {                 \
       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)

Definition at line 105 of file queue.h.

#define LIST_INSERT_BEFORE (   listelm,
  elm,
  field 
)
Value:
do {                 \
       (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)

Definition at line 113 of file queue.h.

#define LIST_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do {                        \
       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)

Definition at line 120 of file queue.h.

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

Definition at line 144 of file queue.h.

#define LIST_REMOVE (   elm,
  field 
)
Value:
do {                               \
       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;                  \
} while (/*CONSTCOND*/0)

Definition at line 127 of file queue.h.

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

Definition at line 359 of file queue.h.

#define SIMPLEQ_ENTRY (   type)
Value:
struct {                                                       \
       struct type *sqe_next;      /* next element */                 \
}

Definition at line 302 of file queue.h.

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

Definition at line 360 of file queue.h.

#define SIMPLEQ_FOREACH (   var,
  head,
  field 
)
Value:
for ((var) = ((head)->sqh_first);                       \
              (var);                                           \
              (var) = ((var)->field.sqe_next))

Definition at line 351 of file queue.h.

#define SIMPLEQ_HEAD (   name,
  type 
)
Value:
struct name {                                                  \
       struct type *sqh_first;     /* first element */                \
       struct type **sqh_last;     /* addr of last next element */           \
}

Definition at line 293 of file queue.h.

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

Definition at line 299 of file queue.h.

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

Definition at line 310 of file queue.h.

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

Definition at line 327 of file queue.h.

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

Definition at line 315 of file queue.h.

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

Definition at line 321 of file queue.h.

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

Definition at line 361 of file queue.h.

#define SIMPLEQ_REMOVE (   head,
  elm,
  type,
  field 
)
Value:
do {                 \
       if ((head)->sqh_first == (elm)) {                       \
              SIMPLEQ_REMOVE_HEAD((head), field);                     \
       } else {                                                \
              struct type *curelm = (head)->sqh_first;         \
              while (curelm->field.sqe_next != (elm))                 \
                     curelm = curelm->field.sqe_next;          \
              if ((curelm->field.sqe_next =                           \
                     curelm->field.sqe_next->field.sqe_next) == NULL) \
                         (head)->sqh_last = &(curelm)->field.sqe_next; \
       }                                                       \
} while (/*CONSTCOND*/0)

Definition at line 338 of file queue.h.

#define SIMPLEQ_REMOVE_HEAD (   head,
  field 
)
Value:
do {                        \
       if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
              (head)->sqh_last = &(head)->sqh_first;                  \
} while (/*CONSTCOND*/0)

Definition at line 333 of file queue.h.

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

Definition at line 203 of file queue.h.

#define SLIST_ENTRY (   type)
Value:
struct {                                                       \
       struct type *sle_next;      /* next element */                 \
}

Definition at line 158 of file queue.h.

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

Definition at line 204 of file queue.h.

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

Definition at line 197 of file queue.h.

#define SLIST_HEAD (   name,
  type 
)
Value:
struct name {                                                  \
       struct type *slh_first;     /* first element */                \
}

Definition at line 150 of file queue.h.

#define SLIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 155 of file queue.h.

#define SLIST_INIT (   head)
Value:
do {                                      \
       (head)->slh_first = NULL;                               \
} while (/*CONSTCOND*/0)

Definition at line 166 of file queue.h.

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

Definition at line 170 of file queue.h.

#define SLIST_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do {                 \
       (elm)->field.sle_next = (head)->slh_first;                     \
       (head)->slh_first = (elm);                              \
} while (/*CONSTCOND*/0)

Definition at line 175 of file queue.h.

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

Definition at line 205 of file queue.h.

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

Definition at line 184 of file queue.h.

#define SLIST_REMOVE_HEAD (   head,
  field 
)
Value:
do {                        \
       (head)->slh_first = (head)->slh_first->field.sle_next;         \
} while (/*CONSTCOND*/0)

Definition at line 180 of file queue.h.

#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 (/*CONSTCOND*/0)

Definition at line 274 of file queue.h.

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

Definition at line 285 of file queue.h.

#define STAILQ_ENTRY (   type)
Value:
struct {                                                       \
       struct type *stqe_next;     /* next element */                 \
}

Definition at line 220 of file queue.h.

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

Definition at line 286 of file queue.h.

#define STAILQ_FOREACH (   var,
  head,
  field 
)
Value:
for ((var) = ((head)->stqh_first);                      \
              (var);                                           \
              (var) = ((var)->field.stqe_next))

Definition at line 269 of file queue.h.

#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 211 of file queue.h.

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

Definition at line 217 of file queue.h.

#define STAILQ_INIT (   head)
Value:
do {                                      \
       (head)->stqh_first = NULL;                              \
       (head)->stqh_last = &(head)->stqh_first;                       \
} while (/*CONSTCOND*/0)

Definition at line 228 of file queue.h.

#define STAILQ_INSERT_AFTER (   head,
  listelm,
  elm,
  field 
)
Value:
do {          \
       if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\
              (head)->stqh_last = &(elm)->field.stqe_next;            \
       (listelm)->field.stqe_next = (elm);                            \
} while (/*CONSTCOND*/0)

Definition at line 245 of file queue.h.

#define STAILQ_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do {                 \
       if (((elm)->field.stqe_next = (head)->stqh_first) == NULL)     \
              (head)->stqh_last = &(elm)->field.stqe_next;            \
       (head)->stqh_first = (elm);                             \
} while (/*CONSTCOND*/0)

Definition at line 233 of file queue.h.

#define STAILQ_INSERT_TAIL (   head,
  elm,
  field 
)
Value:
do {                 \
       (elm)->field.stqe_next = NULL;                                 \
       *(head)->stqh_last = (elm);                             \
       (head)->stqh_last = &(elm)->field.stqe_next;                   \
} while (/*CONSTCOND*/0)

Definition at line 239 of file queue.h.

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

Definition at line 287 of file queue.h.

#define STAILQ_REMOVE (   head,
  elm,
  type,
  field 
)
Value:
do {                 \
       if ((head)->stqh_first == (elm)) {                      \
              STAILQ_REMOVE_HEAD((head), field);               \
       } else {                                                \
              struct type *curelm = (head)->stqh_first;        \
              while (curelm->field.stqe_next != (elm))                \
                     curelm = curelm->field.stqe_next;         \
              if ((curelm->field.stqe_next =                          \
                     curelm->field.stqe_next->field.stqe_next) == NULL) \
                         (head)->stqh_last = &(curelm)->field.stqe_next; \
       }                                                       \
} while (/*CONSTCOND*/0)

Definition at line 256 of file queue.h.

#define STAILQ_REMOVE_HEAD (   head,
  field 
)
Value:
do {                        \
       if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == NULL) \
              (head)->stqh_last = &(head)->stqh_first;                \
} while (/*CONSTCOND*/0)

Definition at line 251 of file queue.h.

#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));                             \
       }                                                       \
} while (/*CONSTCOND*/0)

Definition at line 445 of file queue.h.

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

Definition at line 457 of file queue.h.

#define TAILQ_ENTRY (   type)    _TAILQ_ENTRY(struct type,)

Definition at line 382 of file queue.h.

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

Definition at line 458 of file queue.h.

#define TAILQ_FOREACH (   var,
  head,
  field 
)
Value:
for ((var) = ((head)->tqh_first);                       \
              (var);                                           \
              (var) = ((var)->field.tqe_next))

Definition at line 435 of file queue.h.

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

Definition at line 440 of file queue.h.

#define TAILQ_HEAD (   name,
  type 
)    _TAILQ_HEAD(name, struct type,)

Definition at line 372 of file queue.h.

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

Definition at line 374 of file queue.h.

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

Definition at line 387 of file queue.h.

#define TAILQ_INSERT_AFTER (   head,
  listelm,
  elm,
  field 
)
Value:
do {          \
       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)

Definition at line 409 of file queue.h.

#define TAILQ_INSERT_BEFORE (   listelm,
  elm,
  field 
)
Value:
do {                 \
       (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)

Definition at line 419 of file queue.h.

#define TAILQ_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do {                 \
       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)

Definition at line 392 of file queue.h.

#define TAILQ_INSERT_TAIL (   head,
  elm,
  field 
)
Value:
do {                 \
       (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)

Definition at line 402 of file queue.h.

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

Definition at line 461 of file queue.h.

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

Definition at line 459 of file queue.h.

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

Definition at line 463 of file queue.h.

#define TAILQ_REMOVE (   head,
  elm,
  field 
)
Value:
do {                        \
       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;                \
} while (/*CONSTCOND*/0)

Definition at line 426 of file queue.h.