circ-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 CIRCLEQ_EMPTY(head)   ((head)->cqh_first == (void *)(head))
#define CIRCLEQ_ENTRY(type)
#define CIRCLEQ_FIRST(head)   ((head)->cqh_first)
#define CIRCLEQ_FOREACH(var, head, field)
#define CIRCLEQ_FOREACH_REVERSE(var, head, field)
#define CIRCLEQ_HEAD(name, type)
#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_LAST(head)   ((head)->cqh_last)
#define CIRCLEQ_NEXT(elm, field)   ((elm)->field.cqe_next)
#define CIRCLEQ_PREV(elm, field)   ((elm)->field.cqe_prev)
#define CIRCLEQ_REMOVE(head, elm, field)


Define Documentation

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

Definition at line 55 of file circ-queue.h.

#define CIRCLEQ_ENTRY ( type   ) 

Value:

struct {                      \
   struct type *cqe_next;     /* next element */      \
   struct type *cqe_prev;     /* previous element */     \
}

Definition at line 46 of file circ-queue.h.

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

Definition at line 57 of file circ-queue.h.

#define CIRCLEQ_FOREACH ( var,
head,
field   ) 

Value:

for((var) = (head)->cqh_first;               \
       (var) != (void *)(head);              \
       (var) = (var)->field.cqe_next)

Definition at line 59 of file circ-queue.h.

#define CIRCLEQ_FOREACH_REVERSE ( var,
head,
field   ) 

Value:

for((var) = (head)->cqh_last;             \
       (var) != (void *)(head);              \
       (var) = (var)->field.cqe_prev)

Definition at line 64 of file circ-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 40 of file circ-queue.h.

#define CIRCLEQ_INIT ( head   ) 

Value:

do {                 \
   (head)->cqh_first = (void *)(head);          \
   (head)->cqh_last = (void *)(head);           \
} while (0)

Definition at line 69 of file circ-queue.h.

#define CIRCLEQ_INSERT_AFTER ( head,
listelm,
elm,
field   ) 

Definition at line 74 of file circ-queue.h.

#define CIRCLEQ_INSERT_BEFORE ( head,
listelm,
elm,
field   ) 

Definition at line 84 of file circ-queue.h.

#define CIRCLEQ_INSERT_HEAD ( head,
elm,
field   ) 

Definition at line 94 of file circ-queue.h.

#define CIRCLEQ_INSERT_TAIL ( head,
elm,
field   ) 

Definition at line 104 of file circ-queue.h.

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

Definition at line 114 of file circ-queue.h.

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

Definition at line 116 of file circ-queue.h.

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

Definition at line 118 of file circ-queue.h.

#define CIRCLEQ_REMOVE ( head,
elm,
field   ) 

Definition at line 120 of file circ-queue.h.


Generated on Thu Apr 16 06:30:12 2015 for Asterisk - The Open Source Telephony Project by  doxygen 1.5.6