ReactOS  0.4.12-dev-685-gf36cbf7
queue.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

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

Macro Definition Documentation

◆ _Q_INVALIDATE

#define _Q_INVALIDATE (   a)

Definition at line 88 of file queue.h.

◆ CIRCLEQ_EMPTY

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

Definition at line 436 of file queue.h.

◆ CIRCLEQ_END

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

Definition at line 433 of file queue.h.

◆ CIRCLEQ_ENTRY

#define CIRCLEQ_ENTRY (   type)
Value:
struct { \
struct type *cqe_next; /* next element */ \
struct type *cqe_prev; /* previous element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545

Definition at line 422 of file queue.h.

◆ CIRCLEQ_FIRST

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

Definition at line 431 of file queue.h.

◆ CIRCLEQ_FOREACH

#define CIRCLEQ_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = CIRCLEQ_FIRST(head); \
(var) != CIRCLEQ_END(head); \
(var) = CIRCLEQ_NEXT(var, field))
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_NEXT(elm, field)
Definition: queue.h:434
#define CIRCLEQ_END(head)
Definition: queue.h:433
Definition: parser.c:43
#define CIRCLEQ_FIRST(head)
Definition: queue.h:431

Definition at line 439 of file queue.h.

◆ CIRCLEQ_FOREACH_REVERSE

#define CIRCLEQ_FOREACH_REVERSE (   var,
  head,
  field 
)
Value:
for((var) = CIRCLEQ_LAST(head); \
(var) != CIRCLEQ_END(head); \
(var) = CIRCLEQ_PREV(var, field))
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_LAST(head)
Definition: queue.h:432
#define CIRCLEQ_END(head)
Definition: queue.h:433
Definition: parser.c:43
#define CIRCLEQ_PREV(elm, field)
Definition: queue.h:435

Definition at line 444 of file queue.h.

◆ CIRCLEQ_HEAD

#define CIRCLEQ_HEAD (   name,
  type 
)
Value:
struct name { \
struct type *cqh_first; /* first element */ \
struct type *cqh_last; /* last element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545
Definition: name.c:36

Definition at line 413 of file queue.h.

◆ CIRCLEQ_HEAD_INITIALIZER

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

Definition at line 419 of file queue.h.

◆ CIRCLEQ_INIT

#define CIRCLEQ_INIT (   head)
Value:
do { \
(head)->cqh_first = CIRCLEQ_END(head); \
(head)->cqh_last = CIRCLEQ_END(head); \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_END(head)
Definition: queue.h:433

Definition at line 452 of file queue.h.

◆ CIRCLEQ_INSERT_AFTER

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_END(head)
Definition: queue.h:433
Definition: parser.c:43

Definition at line 457 of file queue.h.

◆ CIRCLEQ_INSERT_BEFORE

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_END(head)
Definition: queue.h:433
Definition: parser.c:43

Definition at line 467 of file queue.h.

◆ CIRCLEQ_INSERT_HEAD

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_END(head)
Definition: queue.h:433
Definition: parser.c:43

Definition at line 477 of file queue.h.

◆ CIRCLEQ_INSERT_TAIL

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_END(head)
Definition: queue.h:433
Definition: parser.c:43

Definition at line 487 of file queue.h.

◆ CIRCLEQ_LAST

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

Definition at line 432 of file queue.h.

◆ CIRCLEQ_NEXT

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

Definition at line 434 of file queue.h.

◆ CIRCLEQ_PREV

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

Definition at line 435 of file queue.h.

◆ CIRCLEQ_REMOVE

#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; \
_Q_INVALIDATE((elm)->field.cqe_prev); \
_Q_INVALIDATE((elm)->field.cqe_next); \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_END(head)
Definition: queue.h:433
Definition: parser.c:43

Definition at line 497 of file queue.h.

◆ CIRCLEQ_REPLACE

#define CIRCLEQ_REPLACE (   head,
  elm,
  elm2,
  field 
)
Value:
do { \
if (((elm2)->field.cqe_next = (elm)->field.cqe_next) == \
(head).cqh_last = (elm2); \
else \
(elm2)->field.cqe_next->field.cqe_prev = (elm2); \
if (((elm2)->field.cqe_prev = (elm)->field.cqe_prev) == \
(head).cqh_first = (elm2); \
else \
(elm2)->field.cqe_prev->field.cqe_next = (elm2); \
_Q_INVALIDATE((elm)->field.cqe_prev); \
_Q_INVALIDATE((elm)->field.cqe_next); \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define CIRCLEQ_END(head)
Definition: queue.h:433
Definition: parser.c:43

Definition at line 512 of file queue.h.

◆ LIST_EMPTY

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

Definition at line 186 of file queue.h.

◆ LIST_END

#define LIST_END (   head)    NULL

Definition at line 185 of file queue.h.

◆ LIST_ENTRY

Value:
struct { \
struct type *le_next; /* next element */ \
struct type **le_prev; /* address of previous next element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545

Definition at line 175 of file queue.h.

◆ LIST_FIRST

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

Definition at line 184 of file queue.h.

◆ LIST_FOREACH

#define LIST_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = LIST_FIRST(head); \
(var)!= LIST_END(head); \
(var) = LIST_NEXT(var, field))
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define LIST_FIRST(head)
Definition: queue.h:184
#define LIST_NEXT(elm, field)
Definition: queue.h:187
#define LIST_END(head)
Definition: queue.h:185
Definition: parser.c:43

Definition at line 189 of file queue.h.

◆ LIST_HEAD

#define LIST_HEAD (   name,
  type 
)
Value:
struct name { \
struct type *lh_first; /* first element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545
Definition: name.c:36

Definition at line 167 of file queue.h.

◆ LIST_HEAD_INITIALIZER

#define LIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 172 of file queue.h.

◆ LIST_INIT

#define LIST_INIT (   head)
Value:
do { \
LIST_FIRST(head) = LIST_END(head); \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define LIST_END(head)
Definition: queue.h:185

Definition at line 197 of file queue.h.

◆ LIST_INSERT_AFTER

#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)
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 201 of file queue.h.

◆ LIST_INSERT_BEFORE

#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: parser.c:43

Definition at line 209 of file queue.h.

◆ LIST_INSERT_HEAD

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 216 of file queue.h.

◆ LIST_NEXT

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

Definition at line 187 of file queue.h.

◆ LIST_REMOVE

#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; \
_Q_INVALIDATE((elm)->field.le_prev); \
_Q_INVALIDATE((elm)->field.le_next); \
} while (0)
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 223 of file queue.h.

◆ LIST_REPLACE

#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); \
_Q_INVALIDATE((elm)->field.le_prev); \
_Q_INVALIDATE((elm)->field.le_next); \
} while (0)
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 232 of file queue.h.

◆ SIMPLEQ_EMPTY

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

Definition at line 264 of file queue.h.

◆ SIMPLEQ_END

#define SIMPLEQ_END (   head)    NULL

Definition at line 263 of file queue.h.

◆ SIMPLEQ_ENTRY

#define SIMPLEQ_ENTRY (   type)
Value:
struct { \
struct type *sqe_next; /* next element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545

Definition at line 254 of file queue.h.

◆ SIMPLEQ_FIRST

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

Definition at line 262 of file queue.h.

◆ SIMPLEQ_FOREACH

#define SIMPLEQ_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = SIMPLEQ_FIRST(head); \
(var) != SIMPLEQ_END(head); \
(var) = SIMPLEQ_NEXT(var, field))
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define SIMPLEQ_FIRST(head)
Definition: queue.h:262
Definition: parser.c:43
#define SIMPLEQ_NEXT(elm, field)
Definition: queue.h:265
#define SIMPLEQ_END(head)
Definition: queue.h:263

Definition at line 267 of file queue.h.

◆ SIMPLEQ_HEAD

#define SIMPLEQ_HEAD (   name,
  type 
)
Value:
struct name { \
struct type *sqh_first; /* first element */ \
struct type **sqh_last; /* addr of last next element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545
Definition: name.c:36

Definition at line 245 of file queue.h.

◆ SIMPLEQ_HEAD_INITIALIZER

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

Definition at line 251 of file queue.h.

◆ SIMPLEQ_INIT

#define SIMPLEQ_INIT (   head)
Value:
do { \
(head)->sqh_first = NULL; \
(head)->sqh_last = &(head)->sqh_first; \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416

Definition at line 275 of file queue.h.

◆ SIMPLEQ_INSERT_AFTER

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 292 of file queue.h.

◆ SIMPLEQ_INSERT_HEAD

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 280 of file queue.h.

◆ SIMPLEQ_INSERT_TAIL

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 286 of file queue.h.

◆ SIMPLEQ_NEXT

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

Definition at line 265 of file queue.h.

◆ SIMPLEQ_REMOVE_HEAD

#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 (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416

Definition at line 298 of file queue.h.

◆ SLIST_EMPTY

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

Definition at line 112 of file queue.h.

◆ SLIST_END

#define SLIST_END (   head)    NULL

Definition at line 111 of file queue.h.

◆ SLIST_ENTRY

#define SLIST_ENTRY (   type)
Value:
struct { \
struct type *sle_next; /* next element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545

Definition at line 102 of file queue.h.

◆ SLIST_FIRST

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

Definition at line 110 of file queue.h.

◆ SLIST_FOREACH

#define SLIST_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = SLIST_FIRST(head); \
(var) != SLIST_END(head); \
(var) = SLIST_NEXT(var, field))
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define SLIST_END(head)
Definition: queue.h:111
#define SLIST_NEXT(elm, field)
Definition: queue.h:113
Definition: parser.c:43
#define SLIST_FIRST(head)
Definition: queue.h:110

Definition at line 115 of file queue.h.

◆ SLIST_FOREACH_PREVPTR

#define SLIST_FOREACH_PREVPTR (   var,
  varp,
  head,
  field 
)
Value:
for ((varp) = &SLIST_FIRST((head)); \
((var) = *(varp)) != SLIST_END(head); \
(varp) = &SLIST_NEXT((var), field))
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define SLIST_END(head)
Definition: queue.h:111
#define SLIST_NEXT(elm, field)
Definition: queue.h:113
Definition: parser.c:43
#define SLIST_FIRST(head)
Definition: queue.h:110

Definition at line 120 of file queue.h.

◆ SLIST_HEAD

#define SLIST_HEAD (   name,
  type 
)
Value:
struct name { \
struct type *slh_first; /* first element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545
Definition: name.c:36

Definition at line 94 of file queue.h.

◆ SLIST_HEAD_INITIALIZER

#define SLIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 99 of file queue.h.

◆ SLIST_INIT

#define SLIST_INIT (   head)
Value:
{ \
SLIST_FIRST(head) = SLIST_END(head); \
}
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define SLIST_END(head)
Definition: queue.h:111

Definition at line 128 of file queue.h.

◆ SLIST_INSERT_AFTER

#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: parser.c:43

Definition at line 132 of file queue.h.

◆ SLIST_INSERT_HEAD

#define SLIST_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do { \
(elm)->field.sle_next = (head)->slh_first; \
(head)->slh_first = (elm); \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
Definition: parser.c:43

Definition at line 137 of file queue.h.

◆ SLIST_NEXT

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

Definition at line 113 of file queue.h.

◆ SLIST_REMOVE

#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; \
_Q_INVALIDATE((elm)->field.sle_next); \
} \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545
while(1)
Definition: macro.lex.yy.c:740
Definition: parser.c:43

Definition at line 150 of file queue.h.

◆ SLIST_REMOVE_HEAD

#define SLIST_REMOVE_HEAD (   head,
  field 
)
Value:
do { \
(head)->slh_first = (head)->slh_first->field.sle_next; \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66

Definition at line 146 of file queue.h.

◆ SLIST_REMOVE_NEXT

#define SLIST_REMOVE_NEXT (   head,
  elm,
  field 
)
Value:
do { \
(elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
} while (0)
Definition: parser.c:43

Definition at line 142 of file queue.h.

◆ TAILQ_EMPTY

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

Definition at line 332 of file queue.h.

◆ TAILQ_END

#define TAILQ_END (   head)    NULL

Definition at line 325 of file queue.h.

◆ TAILQ_ENTRY

#define TAILQ_ENTRY (   type)
Value:
struct { \
struct type *tqe_next; /* next element */ \
struct type **tqe_prev; /* address of previous next element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545

Definition at line 315 of file queue.h.

◆ TAILQ_FIRST

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

Definition at line 324 of file queue.h.

◆ TAILQ_FOREACH

#define TAILQ_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = TAILQ_FIRST(head); \
(var) != TAILQ_END(head); \
(var) = TAILQ_NEXT(var, field))
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define TAILQ_END(head)
Definition: queue.h:325
Definition: parser.c:43
#define TAILQ_FIRST(head)
Definition: queue.h:324
#define TAILQ_NEXT(elm, field)
Definition: queue.h:326

Definition at line 335 of file queue.h.

◆ TAILQ_FOREACH_REVERSE

#define TAILQ_FOREACH_REVERSE (   var,
  head,
  headname,
  field 
)
Value:
for((var) = TAILQ_LAST(head, headname); \
(var) != TAILQ_END(head); \
(var) = TAILQ_PREV(var, headname, field))
struct outqueuenode * head
Definition: adnsresfilter.c:66
#define TAILQ_PREV(elm, headname, field)
Definition: queue.h:330
#define TAILQ_END(head)
Definition: queue.h:325
Definition: parser.c:43
#define TAILQ_LAST(head, headname)
Definition: queue.h:327

Definition at line 340 of file queue.h.

◆ TAILQ_HEAD

#define TAILQ_HEAD (   name,
  type 
)
Value:
struct name { \
struct type *tqh_first; /* first element */ \
struct type **tqh_last; /* addr of last next element */ \
}
GLuint GLuint GLsizei GLenum type
Definition: gl.h:1545
Definition: name.c:36

Definition at line 306 of file queue.h.

◆ TAILQ_HEAD_INITIALIZER

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

Definition at line 312 of file queue.h.

◆ TAILQ_INIT

#define TAILQ_INIT (   head)
Value:
do { \
(head)->tqh_first = NULL; \
(head)->tqh_last = &(head)->tqh_first; \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416

Definition at line 348 of file queue.h.

◆ TAILQ_INSERT_AFTER

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 370 of file queue.h.

◆ TAILQ_INSERT_BEFORE

#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: parser.c:43

Definition at line 380 of file queue.h.

◆ TAILQ_INSERT_HEAD

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 353 of file queue.h.

◆ TAILQ_INSERT_TAIL

#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)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 363 of file queue.h.

◆ TAILQ_LAST

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

Definition at line 327 of file queue.h.

◆ TAILQ_NEXT

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

Definition at line 326 of file queue.h.

◆ TAILQ_PREV

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

Definition at line 330 of file queue.h.

◆ TAILQ_REMOVE

#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; \
_Q_INVALIDATE((elm)->field.tqe_prev); \
_Q_INVALIDATE((elm)->field.tqe_next); \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 387 of file queue.h.

◆ TAILQ_REPLACE

#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); \
_Q_INVALIDATE((elm)->field.tqe_prev); \
_Q_INVALIDATE((elm)->field.tqe_next); \
} while (0)
struct outqueuenode * head
Definition: adnsresfilter.c:66
smooth NULL
Definition: ftsmooth.c:416
Definition: parser.c:43

Definition at line 398 of file queue.h.