open62541_queue.h File Reference
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_SAFE(var, head, field, tvar) |
| #define | SLIST_INIT(head) |
| #define | SLIST_INSERT_AFTER(slistelm, elm, field) |
| #define | SLIST_INSERT_HEAD(head, elm, field) |
| #define | SLIST_REMOVE_AFTER(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_FOREACH_SAFE(var, head, field, tvar) |
| #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_FOREACH_SAFE(var, head, field, tvar) |
| #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_AFTER(head, elm, field) |
| #define | XSIMPLEQ_HEAD(name, type) |
| #define | XSIMPLEQ_ENTRY(type) |
| #define | XSIMPLEQ_XOR(head, ptr) |
| #define | XSIMPLEQ_FIRST(head) XSIMPLEQ_XOR(head, ((head)->sqx_first)) |
| #define | XSIMPLEQ_END(head) NULL |
| #define | XSIMPLEQ_EMPTY(head) (XSIMPLEQ_FIRST(head) == XSIMPLEQ_END(head)) |
| #define | XSIMPLEQ_NEXT(head, elm, field) XSIMPLEQ_XOR(head, ((elm)->field.sqx_next)) |
| #define | XSIMPLEQ_FOREACH(var, head, field) |
| #define | XSIMPLEQ_FOREACH_SAFE(var, head, field, tvar) |
| #define | XSIMPLEQ_INIT(head) |
| #define | XSIMPLEQ_INSERT_HEAD(head, elm, field) |
| #define | XSIMPLEQ_INSERT_TAIL(head, elm, field) |
| #define | XSIMPLEQ_INSERT_AFTER(head, listelm, elm, field) |
| #define | XSIMPLEQ_REMOVE_HEAD(head, field) |
| #define | XSIMPLEQ_REMOVE_AFTER(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_SAFE(var, head, field, tvar) |
| #define | TAILQ_FOREACH_REVERSE(var, head, headname, field) |
| #define | TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) |
| #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_SAFE(var, head, field, tvar) |
| #define | CIRCLEQ_FOREACH_REVERSE(var, head, field) |
| #define | CIRCLEQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) |
| #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 open62541_queue.h.
◆ SLIST_HEAD
| #define SLIST_HEAD | ( | name, | |
| type ) |
Value:
struct name { \
struct type *slh_first; /* first element */ \
}
Definition at line 94 of file open62541_queue.h.
◆ SLIST_HEAD_INITIALIZER
| #define SLIST_HEAD_INITIALIZER | ( | head | ) | { NULL } |
Definition at line 99 of file open62541_queue.h.
◆ SLIST_ENTRY
| #define SLIST_ENTRY | ( | type | ) |
Value:
struct { \
struct type *sle_next; /* next element */ \
}
Definition at line 102 of file open62541_queue.h.
◆ SLIST_FIRST
| #define SLIST_FIRST | ( | head | ) | ((head)->slh_first) |
Definition at line 110 of file open62541_queue.h.
◆ SLIST_END
| #define SLIST_END | ( | head | ) | NULL |
Definition at line 111 of file open62541_queue.h.
◆ SLIST_EMPTY
| #define SLIST_EMPTY | ( | head | ) | (SLIST_FIRST(head) == SLIST_END(head)) |
Definition at line 112 of file open62541_queue.h.
◆ SLIST_NEXT
| #define SLIST_NEXT | ( | elm, | |
| field ) ((elm)->field.sle_next) |
Definition at line 113 of file open62541_queue.h.
◆ SLIST_FOREACH
| #define SLIST_FOREACH | ( | var, | |
| head, | |||
| field ) |
Value:
Definition at line 115 of file open62541_queue.h.
◆ SLIST_FOREACH_SAFE
| #define SLIST_FOREACH_SAFE | ( | var, | |
| head, | |||
| field, | |||
| tvar ) |
Value:
Definition at line 120 of file open62541_queue.h.
◆ SLIST_INIT
| #define SLIST_INIT | ( | head | ) |
Value:
Definition at line 128 of file open62541_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 at line 132 of file open62541_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)
Definition at line 137 of file open62541_queue.h.
◆ SLIST_REMOVE_AFTER
| #define SLIST_REMOVE_AFTER | ( | elm, | |
| field ) |
Value:
do { \
(elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
} while (0)
Definition at line 142 of file open62541_queue.h.
◆ SLIST_REMOVE_HEAD
| #define SLIST_REMOVE_HEAD | ( | head, | |
| field ) |
Value:
do { \
(head)->slh_first = (head)->slh_first->field.sle_next; \
} while (0)
Definition at line 146 of file open62541_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)
Definition at line 150 of file open62541_queue.h.
◆ LIST_HEAD
| #define LIST_HEAD | ( | name, | |
| type ) |
Value:
struct name { \
struct type *lh_first; /* first element */ \
}
Definition at line 167 of file open62541_queue.h.
◆ LIST_HEAD_INITIALIZER
| #define LIST_HEAD_INITIALIZER | ( | head | ) | { NULL } |
Definition at line 172 of file open62541_queue.h.
◆ LIST_ENTRY
| #define LIST_ENTRY | ( | type | ) |
Value:
struct { \
struct type *le_next; /* next element */ \
struct type **le_prev; /* address of previous next element */ \
}
Definition at line 175 of file open62541_queue.h.
◆ LIST_FIRST
| #define LIST_FIRST | ( | head | ) | ((head)->lh_first) |
Definition at line 184 of file open62541_queue.h.
◆ LIST_END
| #define LIST_END | ( | head | ) | NULL |
Definition at line 185 of file open62541_queue.h.
◆ LIST_EMPTY
| #define LIST_EMPTY | ( | head | ) | (LIST_FIRST(head) == LIST_END(head)) |
Definition at line 186 of file open62541_queue.h.
◆ LIST_NEXT
| #define LIST_NEXT | ( | elm, | |
| field ) ((elm)->field.le_next) |
Definition at line 187 of file open62541_queue.h.
◆ LIST_FOREACH
| #define LIST_FOREACH | ( | var, | |
| head, | |||
| field ) |
Value:
Definition at line 189 of file open62541_queue.h.
◆ LIST_FOREACH_SAFE
| #define LIST_FOREACH_SAFE | ( | var, | |
| head, | |||
| field, | |||
| tvar ) |
Value:
Definition at line 194 of file open62541_queue.h.
◆ LIST_INIT
| #define LIST_INIT | ( | head | ) |
Value:
Definition at line 202 of file open62541_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)
Definition at line 206 of file open62541_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 at line 214 of file open62541_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)
Definition at line 221 of file open62541_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)
Definition at line 228 of file open62541_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)
Definition at line 237 of file open62541_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 */ \
}
Definition at line 250 of file open62541_queue.h.
◆ SIMPLEQ_HEAD_INITIALIZER
| #define SIMPLEQ_HEAD_INITIALIZER | ( | head | ) | { NULL, &(head).sqh_first } |
Definition at line 256 of file open62541_queue.h.
◆ SIMPLEQ_ENTRY
| #define SIMPLEQ_ENTRY | ( | type | ) |
Value:
struct { \
struct type *sqe_next; /* next element */ \
}
Definition at line 259 of file open62541_queue.h.
◆ SIMPLEQ_FIRST
| #define SIMPLEQ_FIRST | ( | head | ) | ((head)->sqh_first) |
Definition at line 267 of file open62541_queue.h.
◆ SIMPLEQ_END
| #define SIMPLEQ_END | ( | head | ) | NULL |
Definition at line 268 of file open62541_queue.h.
◆ SIMPLEQ_EMPTY
| #define SIMPLEQ_EMPTY | ( | head | ) | (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) |
Definition at line 269 of file open62541_queue.h.
◆ SIMPLEQ_NEXT
| #define SIMPLEQ_NEXT | ( | elm, | |
| field ) ((elm)->field.sqe_next) |
Definition at line 270 of file open62541_queue.h.
◆ SIMPLEQ_FOREACH
| #define SIMPLEQ_FOREACH | ( | var, | |
| head, | |||
| field ) |
Value:
Definition at line 272 of file open62541_queue.h.
◆ SIMPLEQ_FOREACH_SAFE
| #define SIMPLEQ_FOREACH_SAFE | ( | var, | |
| head, | |||
| field, | |||
| tvar ) |
Value:
for ((var) = SIMPLEQ_FIRST(head); \
(var) && ((tvar) = SIMPLEQ_NEXT(var, field), 1); \
(var) = (tvar))
Definition at line 277 of file open62541_queue.h.
◆ SIMPLEQ_INIT
| #define SIMPLEQ_INIT | ( | head | ) |
Value:
do { \
(head)->sqh_first = NULL; \
(head)->sqh_last = &(head)->sqh_first; \
} while (0)
Definition at line 285 of file open62541_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)
Definition at line 290 of file open62541_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)
Definition at line 296 of file open62541_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)
Definition at line 302 of file open62541_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)
Definition at line 308 of file open62541_queue.h.
◆ SIMPLEQ_REMOVE_AFTER
| #define SIMPLEQ_REMOVE_AFTER | ( | head, | |
| elm, | |||
| field ) |
Value:
do { \
if (((elm)->field.sqe_next = (elm)->field.sqe_next->field.sqe_next) \
== NULL) \
(head)->sqh_last = &(elm)->field.sqe_next; \
} while (0)
Definition at line 313 of file open62541_queue.h.
◆ XSIMPLEQ_HEAD
| #define XSIMPLEQ_HEAD | ( | name, | |
| type ) |
Value:
struct name { \
struct type *sqx_first; /* first element */ \
struct type **sqx_last; /* addr of last next element */ \
unsigned long sqx_cookie; \
}
Definition at line 322 of file open62541_queue.h.
◆ XSIMPLEQ_ENTRY
| #define XSIMPLEQ_ENTRY | ( | type | ) |
Value:
struct { \
struct type *sqx_next; /* next element */ \
}
Definition at line 329 of file open62541_queue.h.
◆ XSIMPLEQ_XOR
| #define XSIMPLEQ_XOR | ( | head, | |
| ptr ) |
Value:
((__typeof(ptr))((head)->sqx_cookie ^ \
(unsigned long)(ptr)))
Definition at line 337 of file open62541_queue.h.
◆ XSIMPLEQ_FIRST
| #define XSIMPLEQ_FIRST | ( | head | ) | XSIMPLEQ_XOR(head, ((head)->sqx_first)) |
Definition at line 339 of file open62541_queue.h.
◆ XSIMPLEQ_END
| #define XSIMPLEQ_END | ( | head | ) | NULL |
Definition at line 340 of file open62541_queue.h.
◆ XSIMPLEQ_EMPTY
| #define XSIMPLEQ_EMPTY | ( | head | ) | (XSIMPLEQ_FIRST(head) == XSIMPLEQ_END(head)) |
Definition at line 341 of file open62541_queue.h.
◆ XSIMPLEQ_NEXT
| #define XSIMPLEQ_NEXT | ( | head, | |
| elm, | |||
| field ) XSIMPLEQ_XOR(head, ((elm)->field.sqx_next)) |
Definition at line 342 of file open62541_queue.h.
◆ XSIMPLEQ_FOREACH
| #define XSIMPLEQ_FOREACH | ( | var, | |
| head, | |||
| field ) |
Value:
for ((var) = XSIMPLEQ_FIRST(head); \
(var) != XSIMPLEQ_END(head); \
(var) = XSIMPLEQ_NEXT(head, var, field))
Definition at line 345 of file open62541_queue.h.
◆ XSIMPLEQ_FOREACH_SAFE
| #define XSIMPLEQ_FOREACH_SAFE | ( | var, | |
| head, | |||
| field, | |||
| tvar ) |
Value:
for ((var) = XSIMPLEQ_FIRST(head); \
(var) && ((tvar) = XSIMPLEQ_NEXT(head, var, field), 1); \
(var) = (tvar))
Definition at line 350 of file open62541_queue.h.
◆ XSIMPLEQ_INIT
| #define XSIMPLEQ_INIT | ( | head | ) |
Value:
do { \
arc4random_buf(&(head)->sqx_cookie, sizeof((head)->sqx_cookie)); \
(head)->sqx_first = XSIMPLEQ_XOR(head, NULL); \
(head)->sqx_last = XSIMPLEQ_XOR(head, &(head)->sqx_first); \
} while (0)
Definition at line 358 of file open62541_queue.h.
◆ XSIMPLEQ_INSERT_HEAD
| #define XSIMPLEQ_INSERT_HEAD | ( | head, | |
| elm, | |||
| field ) |
Value:
do { \
if (((elm)->field.sqx_next = (head)->sqx_first) == \
XSIMPLEQ_XOR(head, NULL)) \
(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \
(head)->sqx_first = XSIMPLEQ_XOR(head, (elm)); \
} while (0)
Definition at line 364 of file open62541_queue.h.
◆ XSIMPLEQ_INSERT_TAIL
| #define XSIMPLEQ_INSERT_TAIL | ( | head, | |
| elm, | |||
| field ) |
Value:
do { \
(elm)->field.sqx_next = XSIMPLEQ_XOR(head, NULL); \
*(XSIMPLEQ_XOR(head, (head)->sqx_last)) = XSIMPLEQ_XOR(head, (elm)); \
(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \
} while (0)
Definition at line 371 of file open62541_queue.h.
◆ XSIMPLEQ_INSERT_AFTER
| #define XSIMPLEQ_INSERT_AFTER | ( | head, | |
| listelm, | |||
| elm, | |||
| field ) |
Value:
do { \
if (((elm)->field.sqx_next = (listelm)->field.sqx_next) == \
XSIMPLEQ_XOR(head, NULL)) \
(head)->sqx_last = XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \
(listelm)->field.sqx_next = XSIMPLEQ_XOR(head, (elm)); \
} while (0)
Definition at line 377 of file open62541_queue.h.
◆ XSIMPLEQ_REMOVE_HEAD
| #define XSIMPLEQ_REMOVE_HEAD | ( | head, | |
| field ) |
Value:
do { \
if (((head)->sqx_first = XSIMPLEQ_XOR(head, \
(head)->sqx_first)->field.sqx_next) == XSIMPLEQ_XOR(head, NULL)) \
(head)->sqx_last = XSIMPLEQ_XOR(head, &(head)->sqx_first); \
} while (0)
Definition at line 384 of file open62541_queue.h.
◆ XSIMPLEQ_REMOVE_AFTER
| #define XSIMPLEQ_REMOVE_AFTER | ( | head, | |
| elm, | |||
| field ) |
Value:
do { \
if (((elm)->field.sqx_next = XSIMPLEQ_XOR(head, \
(elm)->field.sqx_next)->field.sqx_next) \
== XSIMPLEQ_XOR(head, NULL)) \
(head)->sqx_last = \
XSIMPLEQ_XOR(head, &(elm)->field.sqx_next); \
} while (0)
Definition at line 390 of file open62541_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 */ \
}
Definition at line 402 of file open62541_queue.h.
◆ TAILQ_HEAD_INITIALIZER
| #define TAILQ_HEAD_INITIALIZER | ( | head | ) | { NULL, &(head).tqh_first } |
Definition at line 408 of file open62541_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 */ \
}
Definition at line 411 of file open62541_queue.h.
◆ TAILQ_FIRST
| #define TAILQ_FIRST | ( | head | ) | ((head)->tqh_first) |
tail queue access methods
Definition at line 420 of file open62541_queue.h.
◆ TAILQ_END
| #define TAILQ_END | ( | head | ) | NULL |
Definition at line 421 of file open62541_queue.h.
◆ TAILQ_NEXT
| #define TAILQ_NEXT | ( | elm, | |
| field ) ((elm)->field.tqe_next) |
Definition at line 422 of file open62541_queue.h.
◆ TAILQ_LAST
| #define TAILQ_LAST | ( | head, | |
| headname ) (*(((struct headname *)((head)->tqh_last))->tqh_last)) |
Definition at line 423 of file open62541_queue.h.
◆ TAILQ_PREV
| #define TAILQ_PREV | ( | elm, | |
| headname, | |||
| field ) (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) |
XXX.
Definition at line 426 of file open62541_queue.h.
◆ TAILQ_EMPTY
| #define TAILQ_EMPTY | ( | head | ) | (TAILQ_FIRST(head) == TAILQ_END(head)) |
Definition at line 428 of file open62541_queue.h.
◆ TAILQ_FOREACH
| #define TAILQ_FOREACH | ( | var, | |
| head, | |||
| field ) |
Value:
Definition at line 431 of file open62541_queue.h.
◆ TAILQ_FOREACH_SAFE
| #define TAILQ_FOREACH_SAFE | ( | var, | |
| head, | |||
| field, | |||
| tvar ) |
Value:
for ((var) = TAILQ_FIRST(head); \
(var) != TAILQ_END(head) && \
((tvar) = TAILQ_NEXT(var, field), 1); \
(var) = (tvar))
Definition at line 436 of file open62541_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))
Definition at line 443 of file open62541_queue.h.
◆ TAILQ_FOREACH_REVERSE_SAFE
| #define TAILQ_FOREACH_REVERSE_SAFE | ( | var, | |
| head, | |||
| headname, | |||
| field, | |||
| tvar ) |
Value:
for ((var) = TAILQ_LAST(head, headname); \
(var) != TAILQ_END(head) && \
((tvar) = TAILQ_PREV(var, headname, field), 1); \
(var) = (tvar))
Definition at line 448 of file open62541_queue.h.
◆ TAILQ_INIT
| #define TAILQ_INIT | ( | head | ) |
Value:
do { \
(head)->tqh_first = NULL; \
(head)->tqh_last = &(head)->tqh_first; \
} while (0)
Definition at line 457 of file open62541_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)
Definition at line 462 of file open62541_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)
Definition at line 472 of file open62541_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)
Definition at line 479 of file open62541_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 at line 489 of file open62541_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)
Definition at line 496 of file open62541_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)
Definition at line 507 of file open62541_queue.h.
◆ CIRCLEQ_HEAD
| #define CIRCLEQ_HEAD | ( | name, | |
| type ) |
Value:
struct name { \
struct type *cqh_first; /* first element */ \
struct type *cqh_last; /* last element */ \
}
Definition at line 522 of file open62541_queue.h.
◆ CIRCLEQ_HEAD_INITIALIZER
| #define CIRCLEQ_HEAD_INITIALIZER | ( | head | ) | { CIRCLEQ_END(&head), CIRCLEQ_END(&head) } |
Definition at line 528 of file open62541_queue.h.
◆ CIRCLEQ_ENTRY
| #define CIRCLEQ_ENTRY | ( | type | ) |
Value:
struct { \
struct type *cqe_next; /* next element */ \
struct type *cqe_prev; /* previous element */ \
}
Definition at line 531 of file open62541_queue.h.
◆ CIRCLEQ_FIRST
| #define CIRCLEQ_FIRST | ( | head | ) | ((head)->cqh_first) |
Definition at line 540 of file open62541_queue.h.
◆ CIRCLEQ_LAST
| #define CIRCLEQ_LAST | ( | head | ) | ((head)->cqh_last) |
Definition at line 541 of file open62541_queue.h.
◆ CIRCLEQ_END
| #define CIRCLEQ_END | ( | head | ) | ((void *)(head)) |
Definition at line 542 of file open62541_queue.h.
◆ CIRCLEQ_NEXT
| #define CIRCLEQ_NEXT | ( | elm, | |
| field ) ((elm)->field.cqe_next) |
Definition at line 543 of file open62541_queue.h.
◆ CIRCLEQ_PREV
| #define CIRCLEQ_PREV | ( | elm, | |
| field ) ((elm)->field.cqe_prev) |
Definition at line 544 of file open62541_queue.h.
◆ CIRCLEQ_EMPTY
| #define CIRCLEQ_EMPTY | ( | head | ) | (CIRCLEQ_FIRST(head) == CIRCLEQ_END(head)) |
Definition at line 545 of file open62541_queue.h.
◆ CIRCLEQ_FOREACH
| #define CIRCLEQ_FOREACH | ( | var, | |
| head, | |||
| field ) |
Value:
Definition at line 548 of file open62541_queue.h.
◆ CIRCLEQ_FOREACH_SAFE
| #define CIRCLEQ_FOREACH_SAFE | ( | var, | |
| head, | |||
| field, | |||
| tvar ) |
Value:
for ((var) = CIRCLEQ_FIRST(head); \
(var) != CIRCLEQ_END(head) && \
((tvar) = CIRCLEQ_NEXT(var, field), 1); \
(var) = (tvar))
Definition at line 553 of file open62541_queue.h.
◆ CIRCLEQ_FOREACH_REVERSE
| #define CIRCLEQ_FOREACH_REVERSE | ( | var, | |
| head, | |||
| field ) |
Value:
Definition at line 559 of file open62541_queue.h.
◆ CIRCLEQ_FOREACH_REVERSE_SAFE
| #define CIRCLEQ_FOREACH_REVERSE_SAFE | ( | var, | |
| head, | |||
| headname, | |||
| field, | |||
| tvar ) |
Value:
for ((var) = CIRCLEQ_LAST(head, headname); \
(var) != CIRCLEQ_END(head) && \
((tvar) = CIRCLEQ_PREV(var, headname, field), 1); \
(var) = (tvar))
Definition at line 564 of file open62541_queue.h.
◆ CIRCLEQ_INIT
| #define CIRCLEQ_INIT | ( | head | ) |
Value:
Definition at line 573 of file open62541_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)
Definition at line 578 of file open62541_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)
Definition at line 588 of file open62541_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)
Definition at line 598 of file open62541_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)
Definition at line 608 of file open62541_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)
Definition at line 618 of file open62541_queue.h.
◆ CIRCLEQ_REPLACE
| #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); \
_Q_INVALIDATE((elm)->field.cqe_prev); \
_Q_INVALIDATE((elm)->field.cqe_next); \
} while (0)
Definition at line 633 of file open62541_queue.h.
Generated by
1.11.0