Back to index

openldap  2.4.31
Defines
ldap_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 LDAP_SLIST_HEAD(name, type)
#define LDAP_SLIST_HEAD_INITIALIZER(head)   { NULL }
#define LDAP_SLIST_ENTRY(type)
#define LDAP_SLIST_ENTRY_INITIALIZER(entry)   { NULL }
#define LDAP_SLIST_EMPTY(head)   ((head)->slh_first == NULL)
#define LDAP_SLIST_FIRST(head)   ((head)->slh_first)
#define LDAP_SLIST_FOREACH(var, head, field)   for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
#define LDAP_SLIST_INIT(head)
#define LDAP_SLIST_ENTRY_INIT(var, field)
#define LDAP_SLIST_INSERT_AFTER(slistelm, elm, field)
#define LDAP_SLIST_INSERT_HEAD(head, elm, field)
#define LDAP_SLIST_NEXT(elm, field)   ((elm)->field.sle_next)
#define LDAP_SLIST_REMOVE_HEAD(head, field)
#define LDAP_SLIST_REMOVE(head, elm, type, field)
#define LDAP_STAILQ_HEAD(name, type)
#define LDAP_STAILQ_HEAD_INITIALIZER(head)   { NULL, &(head).stqh_first }
#define LDAP_STAILQ_ENTRY(type)
#define LDAP_STAILQ_ENTRY_INITIALIZER(entry)   { NULL }
#define LDAP_STAILQ_EMPTY(head)   ((head)->stqh_first == NULL)
#define LDAP_STAILQ_INIT(head)
#define LDAP_STAILQ_ENTRY_INIT(var, field)
#define LDAP_STAILQ_FIRST(head)   ((head)->stqh_first)
#define LDAP_STAILQ_LAST(head, type, field)
#define LDAP_STAILQ_FOREACH(var, head, field)   for((var) = (head)->stqh_first; (var); (var) = (var)->field.stqe_next)
#define LDAP_STAILQ_INSERT_HEAD(head, elm, field)
#define LDAP_STAILQ_INSERT_TAIL(head, elm, field)
#define LDAP_STAILQ_INSERT_AFTER(head, tqelm, elm, field)
#define LDAP_STAILQ_NEXT(elm, field)   ((elm)->field.stqe_next)
#define LDAP_STAILQ_REMOVE_HEAD(head, field)
#define LDAP_STAILQ_REMOVE_HEAD_UNTIL(head, elm, field)
#define LDAP_STAILQ_REMOVE(head, elm, type, field)
#define LDAP_LIST_HEAD(name, type)
#define LDAP_LIST_HEAD_INITIALIZER(head)   { NULL }
#define LDAP_LIST_ENTRY(type)
#define LDAP_LIST_ENTRY_INITIALIZER(entry)   { NULL, NULL }
#define LDAP_LIST_EMPTY(head)   ((head)->lh_first == NULL)
#define LDAP_LIST_FIRST(head)   ((head)->lh_first)
#define LDAP_LIST_FOREACH(var, head, field)   for((var) = (head)->lh_first; (var); (var) = (var)->field.le_next)
#define LDAP_LIST_INIT(head)
#define LDAP_LIST_ENTRY_INIT(var, field)
#define LDAP_LIST_INSERT_AFTER(listelm, elm, field)
#define LDAP_LIST_INSERT_BEFORE(listelm, elm, field)
#define LDAP_LIST_INSERT_HEAD(head, elm, field)
#define LDAP_LIST_NEXT(elm, field)   ((elm)->field.le_next)
#define LDAP_LIST_REMOVE(elm, field)
#define LDAP_TAILQ_HEAD(name, type)
#define LDAP_TAILQ_HEAD_INITIALIZER(head)   { NULL, &(head).tqh_first }
#define LDAP_TAILQ_ENTRY(type)
#define LDAP_TAILQ_ENTRY_INITIALIZER(entry)   { NULL, NULL }
#define LDAP_TAILQ_EMPTY(head)   ((head)->tqh_first == NULL)
#define LDAP_TAILQ_FOREACH(var, head, field)   for (var = LDAP_TAILQ_FIRST(head); var; var = LDAP_TAILQ_NEXT(var, field))
#define LDAP_TAILQ_FOREACH_REVERSE(var, head, type, field)
#define LDAP_TAILQ_FIRST(head)   ((head)->tqh_first)
#define LDAP_TAILQ_LAST(head, type, field)
#define LDAP_TAILQ_NEXT(elm, field)   ((elm)->field.tqe_next)
#define LDAP_TAILQ_PREV(elm, head, type, field)
#define LDAP_TAILQ_INIT(head)
#define LDAP_TAILQ_ENTRY_INIT(var, field)
#define LDAP_TAILQ_INSERT_HEAD(head, elm, field)
#define LDAP_TAILQ_INSERT_TAIL(head, elm, field)
#define LDAP_TAILQ_INSERT_AFTER(head, listelm, elm, field)
#define LDAP_TAILQ_INSERT_BEFORE(listelm, elm, field)
#define LDAP_TAILQ_REMOVE(head, elm, field)
#define LDAP_CIRCLEQ_HEAD(name, type)
#define LDAP_CIRCLEQ_ENTRY(type)
#define LDAP_CIRCLEQ_EMPTY(head)   ((head)->cqh_first == (void *)(head))
#define LDAP_CIRCLEQ_FIRST(head)   ((head)->cqh_first)
#define LDAP_CIRCLEQ_FOREACH(var, head, field)
#define LDAP_CIRCLEQ_FOREACH_REVERSE(var, head, field)
#define LDAP_CIRCLEQ_INIT(head)
#define LDAP_CIRCLEQ_ENTRY_INIT(var, field)
#define LDAP_CIRCLEQ_INSERT_AFTER(head, listelm, elm, field)
#define LDAP_CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field)
#define LDAP_CIRCLEQ_INSERT_HEAD(head, elm, field)
#define LDAP_CIRCLEQ_INSERT_TAIL(head, elm, field)
#define LDAP_CIRCLEQ_LAST(head)   ((head)->cqh_last)
#define LDAP_CIRCLEQ_NEXT(elm, field)   ((elm)->field.cqe_next)
#define LDAP_CIRCLEQ_PREV(elm, field)   ((elm)->field.cqe_prev)
#define LDAP_CIRCLEQ_REMOVE(head, elm, field)

Define Documentation

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

Definition at line 479 of file ldap_queue.h.

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

Definition at line 470 of file ldap_queue.h.

#define LDAP_CIRCLEQ_ENTRY_INIT (   var,
  field 
)
Value:
do {                 \
       (var)->field.cqe_next = NULL;                                  \
       (var)->field.cqe_prev = NULL;                                  \
} while (0)

Definition at line 498 of file ldap_queue.h.

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

Definition at line 481 of file ldap_queue.h.

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

Definition at line 483 of file ldap_queue.h.

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

Definition at line 488 of file ldap_queue.h.

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

Definition at line 464 of file ldap_queue.h.

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

Definition at line 493 of file ldap_queue.h.

#define LDAP_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 (0)

Definition at line 503 of file ldap_queue.h.

#define LDAP_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 (0)

Definition at line 513 of file ldap_queue.h.

#define LDAP_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 (0)

Definition at line 523 of file ldap_queue.h.

#define LDAP_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 (0)

Definition at line 533 of file ldap_queue.h.

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

Definition at line 543 of file ldap_queue.h.

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

Definition at line 545 of file ldap_queue.h.

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

Definition at line 547 of file ldap_queue.h.

#define LDAP_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 (0)

Definition at line 549 of file ldap_queue.h.

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

Definition at line 311 of file ldap_queue.h.

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

Definition at line 298 of file ldap_queue.h.

#define LDAP_LIST_ENTRY_INIT (   var,
  field 
)
Value:
do {                        \
       (var)->field.le_next = NULL;                                   \
       (var)->field.le_prev = NULL;                                   \
} while (0)

Definition at line 322 of file ldap_queue.h.

#define LDAP_LIST_ENTRY_INITIALIZER (   entry)    { NULL, NULL }

Definition at line 304 of file ldap_queue.h.

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

Definition at line 313 of file ldap_queue.h.

#define LDAP_LIST_FOREACH (   var,
  head,
  field 
)    for((var) = (head)->lh_first; (var); (var) = (var)->field.le_next)

Definition at line 315 of file ldap_queue.h.

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

Definition at line 290 of file ldap_queue.h.

#define LDAP_LIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 295 of file ldap_queue.h.

#define LDAP_LIST_INIT (   head)
Value:
do {                               \
       (head)->lh_first = NULL;                                \
} while (0)

Definition at line 318 of file ldap_queue.h.

#define LDAP_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 327 of file ldap_queue.h.

#define LDAP_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 335 of file ldap_queue.h.

#define LDAP_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 342 of file ldap_queue.h.

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

Definition at line 349 of file ldap_queue.h.

#define LDAP_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 351 of file ldap_queue.h.

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

Definition at line 153 of file ldap_queue.h.

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

Definition at line 142 of file ldap_queue.h.

#define LDAP_SLIST_ENTRY_INIT (   var,
  field 
)
Value:
{                           \
       (var)->field.sle_next = NULL;                                  \
}

Definition at line 164 of file ldap_queue.h.

#define LDAP_SLIST_ENTRY_INITIALIZER (   entry)    { NULL }

Definition at line 147 of file ldap_queue.h.

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

Definition at line 155 of file ldap_queue.h.

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

Definition at line 157 of file ldap_queue.h.

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

Definition at line 134 of file ldap_queue.h.

#define LDAP_SLIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 139 of file ldap_queue.h.

#define LDAP_SLIST_INIT (   head)
Value:
{                                         \
       (head)->slh_first = NULL;                               \
}

Definition at line 160 of file ldap_queue.h.

#define LDAP_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 168 of file ldap_queue.h.

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

Definition at line 173 of file ldap_queue.h.

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

Definition at line 178 of file ldap_queue.h.

#define LDAP_SLIST_REMOVE (   head,
  elm,
  type,
  field 
)
Value:
do {                 \
       if ((head)->slh_first == (elm)) {                       \
              LDAP_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 184 of file ldap_queue.h.

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

Definition at line 180 of file ldap_queue.h.

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

Definition at line 220 of file ldap_queue.h.

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

Definition at line 209 of file ldap_queue.h.

#define LDAP_STAILQ_ENTRY_INIT (   var,
  field 
)
Value:
{                           \
       (entry)->field.stqe_next = NULL;                        \
}

Definition at line 227 of file ldap_queue.h.

#define LDAP_STAILQ_ENTRY_INITIALIZER (   entry)    { NULL }

Definition at line 214 of file ldap_queue.h.

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

Definition at line 231 of file ldap_queue.h.

#define LDAP_STAILQ_FOREACH (   var,
  head,
  field 
)    for((var) = (head)->stqh_first; (var); (var) = (var)->field.stqe_next)

Definition at line 239 of file ldap_queue.h.

#define LDAP_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 200 of file ldap_queue.h.

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

Definition at line 206 of file ldap_queue.h.

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

Definition at line 222 of file ldap_queue.h.

#define LDAP_STAILQ_INSERT_AFTER (   head,
  tqelm,
  elm,
  field 
)
Value:
do {          \
       if (((elm)->field.stqe_next = (tqelm)->field.stqe_next) == NULL)\
              (head)->stqh_last = &(elm)->field.stqe_next;            \
       (tqelm)->field.stqe_next = (elm);                       \
} while (0)

Definition at line 254 of file ldap_queue.h.

#define LDAP_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 (0)

Definition at line 242 of file ldap_queue.h.

#define LDAP_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 (0)

Definition at line 248 of file ldap_queue.h.

#define LDAP_STAILQ_LAST (   head,
  type,
  field 
)
Value:
(LDAP_STAILQ_EMPTY(head) ?                              \
              NULL :                                           \
               ((struct type *)                                \
              ((char *)((head)->stqh_last) - offsetof(struct type, field))))

Definition at line 233 of file ldap_queue.h.

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

Definition at line 260 of file ldap_queue.h.

#define LDAP_STAILQ_REMOVE (   head,
  elm,
  type,
  field 
)
Value:
do {                 \
       if ((head)->stqh_first == (elm)) {                      \
              LDAP_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 (0)

Definition at line 273 of file ldap_queue.h.

#define LDAP_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 (0)

Definition at line 262 of file ldap_queue.h.

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

Definition at line 268 of file ldap_queue.h.

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

Definition at line 382 of file ldap_queue.h.

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

Definition at line 370 of file ldap_queue.h.

#define LDAP_TAILQ_ENTRY_INIT (   var,
  field 
)
Value:
do {                        \
       (var)->field.tqe_next = NULL;                                  \
       (var)->field.tqe_prev = NULL;                                  \
} while (0)

Definition at line 413 of file ldap_queue.h.

#define LDAP_TAILQ_ENTRY_INITIALIZER (   entry)    { NULL, NULL }

Definition at line 376 of file ldap_queue.h.

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

Definition at line 392 of file ldap_queue.h.

#define LDAP_TAILQ_FOREACH (   var,
  head,
  field 
)    for (var = LDAP_TAILQ_FIRST(head); var; var = LDAP_TAILQ_NEXT(var, field))

Definition at line 384 of file ldap_queue.h.

#define LDAP_TAILQ_FOREACH_REVERSE (   var,
  head,
  type,
  field 
)
Value:
for ((var) = LDAP_TAILQ_LAST((head), type, field);             \
            (var);                                             \
            (var) = LDAP_TAILQ_PREV((var), head, type, field))

Definition at line 387 of file ldap_queue.h.

#define LDAP_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 361 of file ldap_queue.h.

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

Definition at line 367 of file ldap_queue.h.

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

Definition at line 408 of file ldap_queue.h.

#define LDAP_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 435 of file ldap_queue.h.

#define LDAP_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 445 of file ldap_queue.h.

#define LDAP_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 418 of file ldap_queue.h.

#define LDAP_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 428 of file ldap_queue.h.

#define LDAP_TAILQ_LAST (   head,
  type,
  field 
)
Value:
(LDAP_TAILQ_EMPTY(head) ?                               \
              NULL :                                           \
              ((struct type *)                                 \
              ((char *)((head)->tqh_last) - offsetof(struct type, field))))

Definition at line 394 of file ldap_queue.h.

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

Definition at line 400 of file ldap_queue.h.

#define LDAP_TAILQ_PREV (   elm,
  head,
  type,
  field 
)
Value:
((struct type *)((elm)->field.tqe_prev) == LDAP_TAILQ_FIRST(head) ? \
       NULL :                                                  \
       ((struct type *)                                        \
       ((char *)((elm)->field.tqe_prev) - offsetof(struct type, field))))

Definition at line 402 of file ldap_queue.h.

#define LDAP_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 452 of file ldap_queue.h.