mirror/openldap
2
0
Fork 0
mirror of https://git.openldap.org/openldap/openldap.git synced 2024-12-15 03:01:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

ITS#8732 Extend CIRCLEQ macros

Browse Source
This commit is contained in:
Ondřej Kuzník 2017-05-10 15:57:27 +01:00
parent 0d4cd89786
commit 6aa6daf2f0
1 changed files with 38 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
include/ldap_queue.h
View File

@ -102,7 +102,9 @@
* traverse the list. New elements can be added to the list before or after
* an existing element, at the head of the list, or at the end of the list.
* A circle queue may be traversed in either direction, but has a more
* complex end of list detection.
* complex end of list detection. Also, it is possible to rotate the queue,
* rejoining the ends and splitting it so that a given element becomes the
* new head or tail.
*
* For details on the use of these macros, see the queue(3) manual page.
* All macros are prefixed with LDAP_.
@ -461,6 +463,9 @@ struct name { \
struct type *cqh_last; /* last element */ \
}
#define LDAP_CIRCLEQ_HEAD_INITIALIZER(head) \
{ (void *)&(head), (void *)&(head) }
#define LDAP_CIRCLEQ_ENTRY(type) \
struct { \
struct type *cqe_next; /* next element */ \
@ -553,4 +558,36 @@ struct { \
(elm)->field.cqe_next; \
} while (0)
#define LDAP_CIRCLEQ_LOOP_NEXT(head, elm, field) \
(((elm)->field.cqe_next == (void *)(head)) \
? ((head)->cqh_first) \
: ((elm)->field.cqe_next))
#define LDAP_CIRCLEQ_LOOP_PREV(head, elm, field) \
(((elm)->field.cqe_prev == (void *)(head)) \
? ((head)->cqh_last) \
: ((elm)->field.cqe_prev))
#define LDAP_CIRCLEQ_MAKE_HEAD(head, elm, field) do { \
if ((elm)->field.cqe_prev != (void *)(head)) { \
(head)->cqh_first->field.cqe_prev = (head)->cqh_last; \
(head)->cqh_last->field.cqe_next = (head)->cqh_first; \
(head)->cqh_first = elm; \
(head)->cqh_last = (elm)->field.cqe_prev; \
(elm)->field.cqe_prev->field.cqe_next = (void *)(head); \
(elm)->field.cqe_prev = (void *)(head); \
} \
} while (0)
#define LDAP_CIRCLEQ_MAKE_TAIL(head, elm, field) do { \
if ((elm)->field.cqe_next != (void *)(head)) { \
(head)->cqh_first->field.cqe_prev = (head)->cqh_last; \
(head)->cqh_last->field.cqe_next = (head)->cqh_first; \
(head)->cqh_first = (elm)->field.cqe_next; \
(head)->cqh_last = elm; \
(elm)->field.cqe_next->field.cqe_prev = (void *)(head); \
(elm)->field.cqe_next = (void *)(head); \
} \
} while (0)
#endif /* !_LDAP_QUEUE_H_ */