queue.h File Reference

Go to the source code of this file.

Defines
#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_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	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, elm, 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, field, headname)
#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)

---

Define Documentation

#define CIRCLEQ_EMPTY (  head   )     (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head))

Definition at line 416 of file queue.h.

#define CIRCLEQ_END (  head   )     ((void *)(head))

Definition at line 413 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 402 of file queue.h.

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

Definition at line 411 of file queue.h.

#define CIRCLEQ_FOREACH (  var, head, field   )

Value: for((var) = CIRCLEQ_FIRST(head); \ (var) != CIRCLEQ_END(head); \ (var) = CIRCLEQ_NEXT(var, field)) Definition at line 419 of file queue.h.

#define CIRCLEQ_FOREACH_REVERSE (  var, head, field   )

Value: for((var) = CIRCLEQ_LAST(head); \ (var) != CIRCLEQ_END(head); \ (var) = CIRCLEQ_PREV(var, field)) Definition at line 424 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 393 of file queue.h.

#define CIRCLEQ_HEAD_INITIALIZER (  head   )     { CIRCLEQ_END(&head), CIRCLEQ_END(&head) }

Definition at line 399 of file queue.h.

#define CIRCLEQ_INIT (  head   )

Value: do { \ (head)->cqh_first = CIRCLEQ_END(head); \ (head)->cqh_last = CIRCLEQ_END(head); \ } while (0) Definition at line 432 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 == CIRCLEQ_END(head)) \ (head)->cqh_last = (elm); \ else \ (listelm)->field.cqe_next->field.cqe_prev = (elm); \ (listelm)->field.cqe_next = (elm); \ } while (0) Definition at line 437 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 == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm); \ else \ (listelm)->field.cqe_prev->field.cqe_next = (elm); \ (listelm)->field.cqe_prev = (elm); \ } while (0) Definition at line 447 of file queue.h.

#define CIRCLEQ_INSERT_HEAD (  head, elm, field   )

Value: do { \ (elm)->field.cqe_next = (head)->cqh_first; \ (elm)->field.cqe_prev = CIRCLEQ_END(head); \ if ((head)->cqh_last == CIRCLEQ_END(head)) \ (head)->cqh_last = (elm); \ else \ (head)->cqh_first->field.cqe_prev = (elm); \ (head)->cqh_first = (elm); \ } while (0) Definition at line 457 of file queue.h.

#define CIRCLEQ_INSERT_TAIL (  head, elm, field   )

Value: do { \ (elm)->field.cqe_next = CIRCLEQ_END(head); \ (elm)->field.cqe_prev = (head)->cqh_last; \ if ((head)->cqh_first == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm); \ else \ (head)->cqh_last->field.cqe_next = (elm); \ (head)->cqh_last = (elm); \ } while (0) Definition at line 467 of file queue.h.

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

Definition at line 412 of file queue.h.

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

Definition at line 414 of file queue.h.

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

Definition at line 415 of file queue.h.

#define CIRCLEQ_REMOVE (  head, elm, field   )

Value: do { \ if ((elm)->field.cqe_next == CIRCLEQ_END(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 == CIRCLEQ_END(head)) \ (head)->cqh_first = (elm)->field.cqe_next; \ else \ (elm)->field.cqe_prev->field.cqe_next = \ (elm)->field.cqe_next; \ } while (0) Definition at line 477 of file queue.h.

#define CIRCLEQ_REPLACE (  head, elm, elm2, field   )

Value: do { \ if (((elm2)->field.cqe_next = (elm)->field.cqe_next) == \ CIRCLEQ_END(head)) \ (head).cqh_last = (elm2); \ else \ (elm2)->field.cqe_next->field.cqe_prev = (elm2); \ if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) == \ CIRCLEQ_END(head)) \ (head).cqh_first = (elm2); \ else \ (elm2)->field.cqe_prev->field.cqe_next = (elm2); \ } while (0) Definition at line 490 of file queue.h.

#define LIST_EMPTY (  head   )     (LIST_FIRST(head) == LIST_END(head))

Definition at line 174 of file queue.h.

#define LIST_END (  head   )     NULL

Definition at line 173 of file queue.h. Referenced by ip_close().

#define LIST_ENTRY (  type   )

Value: struct { \ struct type *le_next; /* next element */ \ struct type **le_prev; /* address of previous next element */ \ } Definition at line 163 of file queue.h.

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

Definition at line 172 of file queue.h. Referenced by _lookup_ip_intf(), and ip_close().

#define LIST_FOREACH (  var, head, field   )

Value: for((var) = LIST_FIRST(head); \ (var)!= LIST_END(head); \ (var) = LIST_NEXT(var, field)) Definition at line 177 of file queue.h. Referenced by _lookup_ip_intf().

#define LIST_HEAD (  name, type   )

Value: struct name { \ struct type *lh_first; /* first element */ \ } Definition at line 155 of file queue.h.

#define LIST_HEAD_INITIALIZER (  head   )     { NULL }

Definition at line 160 of file queue.h.

#define LIST_INIT (  head   )

Value: do { \ LIST_FIRST(head) = LIST_END(head); \ } while (0) Definition at line 185 of file queue.h. Referenced by ip_open().

#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 (0) Definition at line 189 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 (0) Definition at line 197 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 (0) Definition at line 204 of file queue.h. Referenced by _add_ip_intf(), and _lookup_ip_intf().

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

Definition at line 175 of file queue.h. Referenced by ip_close().

#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 (0) Definition at line 211 of file queue.h. Referenced by _lookup_ip_intf().

#define LIST_REPLACE (  elm, elm2, field   )

Value: do { \ if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \ (elm2)->field.le_next->field.le_prev = \ &(elm2)->field.le_next; \ (elm2)->field.le_prev = (elm)->field.le_prev; \ *(elm2)->field.le_prev = (elm2); \ } while (0) Definition at line 218 of file queue.h.

#define SIMPLEQ_EMPTY (  head   )     (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head))

Definition at line 248 of file queue.h.

#define SIMPLEQ_END (  head   )     NULL

Definition at line 247 of file queue.h.

#define SIMPLEQ_ENTRY (  type   )

Value: struct { \ struct type *sqe_next; /* next element */ \ } Definition at line 238 of file queue.h.

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

Definition at line 246 of file queue.h.

#define SIMPLEQ_FOREACH (  var, head, field   )

Value: for((var) = SIMPLEQ_FIRST(head); \ (var) != SIMPLEQ_END(head); \ (var) = SIMPLEQ_NEXT(var, field)) Definition at line 251 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 229 of file queue.h.

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

Definition at line 235 of file queue.h.

#define SIMPLEQ_INIT (  head   )

Value: do { \ (head)->sqh_first = NULL; \ (head)->sqh_last = &(head)->sqh_first; \ } while (0) Definition at line 259 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 (0) Definition at line 276 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 (0) Definition at line 264 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 (0) Definition at line 270 of file queue.h.

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

Definition at line 249 of file queue.h.

#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 (0) Definition at line 282 of file queue.h.

#define SLIST_EMPTY (  head   )     (SLIST_FIRST(head) == SLIST_END(head))

Definition at line 110 of file queue.h.

#define SLIST_END (  head   )     NULL

Definition at line 109 of file queue.h.

#define SLIST_ENTRY (  type   )

Value: struct { \ struct type *sle_next; /* next element */ \ } Definition at line 100 of file queue.h.

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

Definition at line 108 of file queue.h.

#define SLIST_FOREACH (  var, head, field   )

Value: for((var) = SLIST_FIRST(head); \ (var) != SLIST_END(head); \ (var) = SLIST_NEXT(var, field)) Definition at line 113 of file queue.h.

#define SLIST_HEAD (  name, type   )

Value: struct name { \ struct type *slh_first; /* first element */ \ } Definition at line 92 of file queue.h.

#define SLIST_HEAD_INITIALIZER (  head   )     { NULL }

Definition at line 97 of file queue.h.

#define SLIST_INIT (  head   )

Value: { \ SLIST_FIRST(head) = SLIST_END(head); \ } Definition at line 121 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 (0) Definition at line 125 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 (0) Definition at line 130 of file queue.h.

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

Definition at line 111 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 (0) Definition at line 139 of file queue.h.

#define SLIST_REMOVE_HEAD (  head, field   )

Value: do { \ (head)->slh_first = (head)->slh_first->field.sle_next; \ } while (0) Definition at line 135 of file queue.h.

#define TAILQ_EMPTY (  head   )     (TAILQ_FIRST(head) == TAILQ_END(head))

Definition at line 316 of file queue.h.

#define TAILQ_END (  head   )     NULL

Definition at line 309 of file queue.h.

#define TAILQ_ENTRY (  type   )

Value: struct { \ struct type *tqe_next; /* next element */ \ struct type **tqe_prev; /* address of previous next element */ \ } Definition at line 299 of file queue.h.

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

Definition at line 308 of file queue.h.

#define TAILQ_FOREACH (  var, head, field   )

Value: for((var) = TAILQ_FIRST(head); \ (var) != TAILQ_END(head); \ (var) = TAILQ_NEXT(var, field)) Definition at line 319 of file queue.h.

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

Value: for((var) = TAILQ_LAST(head, headname); \ (var) != TAILQ_END(head); \ (var) = TAILQ_PREV(var, headname, field)) Definition at line 324 of file queue.h.

#define TAILQ_HEAD (  name, type   )

Value: struct name { \ struct type *tqh_first; /* first element */ \ struct type **tqh_last; /* addr of last next element */ \ } Definition at line 290 of file queue.h.

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

Definition at line 296 of file queue.h.

#define TAILQ_INIT (  head   )

Value: do { \ (head)->tqh_first = NULL; \ (head)->tqh_last = &(head)->tqh_first; \ } while (0) Definition at line 332 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 (0) Definition at line 354 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 (0) Definition at line 364 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 (0) Definition at line 337 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 (0) Definition at line 347 of file queue.h.

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

Definition at line 311 of file queue.h.

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

Definition at line 310 of file queue.h.

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

Definition at line 314 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 (0) Definition at line 371 of file queue.h.

#define TAILQ_REPLACE (  head, elm, elm2, field   )

Value: do { \ if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \ (elm2)->field.tqe_next->field.tqe_prev = \ &(elm2)->field.tqe_next; \ else \ (head)->tqh_last = &(elm2)->field.tqe_next; \ (elm2)->field.tqe_prev = (elm)->field.tqe_prev; \ *(elm2)->field.tqe_prev = (elm2); \ } while (0) Definition at line 380 of file queue.h.

---