Asterisk - The Open Source Telephony Project GIT-master-27fb039
Loading...
Searching...
No Matches
Macros
queue.h File Reference

Go to the source code of this file.

Macros

#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 LIST_EMPTY(head)   ((head)->lh_first == NULL)
 
#define LIST_ENTRY(type)
 
#define LIST_FIRST(head)   ((head)->lh_first)
 
#define LIST_FOREACH(var, head, field)    for((var) = (head)->lh_first; (var); (var) = (var)->field.le_next)
 
#define LIST_HEAD(name, type)
 
#define LIST_HEAD_INITIALIZER(head)    { NULL }
 
#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_NEXT(elm, field)   ((elm)->field.le_next)
 
#define LIST_REMOVE(elm, field)
 
#define SLIST_EMPTY(head)   ((head)->slh_first == NULL)
 
#define SLIST_ENTRY(type)
 
#define SLIST_FIRST(head)   ((head)->slh_first)
 
#define SLIST_FOREACH(var, head, field)    for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
 
#define SLIST_HEAD(name, type)
 
#define SLIST_HEAD_INITIALIZER(head)    { NULL }
 
#define SLIST_INIT(head)
 
#define SLIST_INSERT_AFTER(slistelm, elm, field)
 
#define SLIST_INSERT_HEAD(head, elm, field)
 
#define SLIST_NEXT(elm, field)   ((elm)->field.sle_next)
 
#define SLIST_REMOVE(head, elm, type, field)
 
#define SLIST_REMOVE_HEAD(head, field)
 
#define STAILQ_EMPTY(head)   ((head)->stqh_first == NULL)
 
#define STAILQ_ENTRY(type)
 
#define STAILQ_FIRST(head)   ((head)->stqh_first)
 
#define STAILQ_FOREACH(var, head, field)    for((var) = (head)->stqh_first; (var); (var) = (var)->field.stqe_next)
 
#define STAILQ_HEAD(name, type)
 
#define STAILQ_HEAD_INITIALIZER(head)    { NULL, &(head).stqh_first }
 
#define STAILQ_INIT(head)
 
#define STAILQ_INSERT_AFTER(head, tqelm, elm, field)
 
#define STAILQ_INSERT_HEAD(head, elm, field)
 
#define STAILQ_INSERT_TAIL(head, elm, field)
 
#define STAILQ_LAST(head)   (*(head)->stqh_last)
 
#define STAILQ_NEXT(elm, field)   ((elm)->field.stqe_next)
 
#define STAILQ_REMOVE(head, elm, type, field)
 
#define STAILQ_REMOVE_HEAD(head, field)
 
#define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field)
 
#define TAILQ_EMPTY(head)   ((head)->tqh_first == NULL)
 
#define TAILQ_ENTRY(type)
 
#define TAILQ_FIRST(head)   ((head)->tqh_first)
 
#define TAILQ_FOREACH(var, head, field)    for (var = TAILQ_FIRST(head); var; var = TAILQ_NEXT(var, field))
 
#define TAILQ_FOREACH_REVERSE(var, head, headname, field)
 
#define TAILQ_HEAD(name, type)
 
#define TAILQ_HEAD_INITIALIZER(head)    { NULL, &(head).tqh_first }
 
#define TAILQ_INIT(head)
 
#define TAILQ_INSERT_AFTER(head, listelm, elm, field)
 
#define TAILQ_INSERT_BEFORE(listelm, elm, field)
 
#define TAILQ_INSERT_HEAD(head, elm, field)
 
#define TAILQ_INSERT_TAIL(head, elm, field)
 
#define TAILQ_LAST(head, headname)    (*(((struct headname *)((head)->tqh_last))->tqh_last))
 
#define TAILQ_NEXT(elm, field)   ((elm)->field.tqe_next)
 
#define TAILQ_PREV(elm, headname, field)    (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
 
#define TAILQ_REMOVE(head, elm, field)
 

Macro Definition Documentation

◆ CIRCLEQ_EMPTY

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

Definition at line 417 of file queue.h.

◆ CIRCLEQ_ENTRY

#define CIRCLEQ_ENTRY (   type)
Value:
struct { \
struct type *cqe_next; /* next element */ \
struct type *cqe_prev; /* previous element */ \
}
type
static const char type[]
Definition chan_ooh323.c:109

Definition at line 408 of file queue.h.

409 { \
410 struct type *cqe_next; /* next element */ \
411 struct type *cqe_prev; /* previous element */ \
412}

◆ CIRCLEQ_FIRST

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

Definition at line 419 of file queue.h.

◆ CIRCLEQ_FOREACH

#define CIRCLEQ_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = (head)->cqh_first; \
(var) != (void *)(head); \
(var) = (var)->field.cqe_next)
var
#define var
Definition ast_expr2f.c:605

Definition at line 421 of file queue.h.

◆ CIRCLEQ_FOREACH_REVERSE

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

Definition at line 426 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 */ \
}
name
static const char name[]
Definition format_mp3.c:68

Definition at line 402 of file queue.h.

403 { \
404 struct type *cqh_first; /* first element */ \
405 struct type *cqh_last; /* last element */ \
406}

◆ CIRCLEQ_INIT

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

Definition at line 431 of file queue.h.

431 { \
432 (head)->cqh_first = (void *)(head); \
433 (head)->cqh_last = (void *)(head); \
434} while (0)

◆ CIRCLEQ_INSERT_AFTER

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

Definition at line 436 of file queue.h.

436 { \
437 (elm)->field.cqe_next = (listelm)->field.cqe_next; \
438 (elm)->field.cqe_prev = (listelm); \
439 if ((listelm)->field.cqe_next == (void *)(head)) \
440 (head)->cqh_last = (elm); \
441 else \
442 (listelm)->field.cqe_next->field.cqe_prev = (elm); \
443 (listelm)->field.cqe_next = (elm); \
444} while (0)

◆ CIRCLEQ_INSERT_BEFORE

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

Definition at line 446 of file queue.h.

446 { \
447 (elm)->field.cqe_next = (listelm); \
448 (elm)->field.cqe_prev = (listelm)->field.cqe_prev; \
449 if ((listelm)->field.cqe_prev == (void *)(head)) \
450 (head)->cqh_first = (elm); \
451 else \
452 (listelm)->field.cqe_prev->field.cqe_next = (elm); \
453 (listelm)->field.cqe_prev = (elm); \
454} while (0)

◆ CIRCLEQ_INSERT_HEAD

#define CIRCLEQ_INSERT_HEAD (   head,
  elm,
  field 
)

Definition at line 456 of file queue.h.

456 { \
457 (elm)->field.cqe_next = (head)->cqh_first; \
458 (elm)->field.cqe_prev = (void *)(head); \
459 if ((head)->cqh_last == (void *)(head)) \
460 (head)->cqh_last = (elm); \
461 else \
462 (head)->cqh_first->field.cqe_prev = (elm); \
463 (head)->cqh_first = (elm); \
464} while (0)

◆ CIRCLEQ_INSERT_TAIL

#define CIRCLEQ_INSERT_TAIL (   head,
  elm,
  field 
)

Definition at line 466 of file queue.h.

466 { \
467 (elm)->field.cqe_next = (void *)(head); \
468 (elm)->field.cqe_prev = (head)->cqh_last; \
469 if ((head)->cqh_first == (void *)(head)) \
470 (head)->cqh_first = (elm); \
471 else \
472 (head)->cqh_last->field.cqe_next = (elm); \
473 (head)->cqh_last = (elm); \
474} while (0)

◆ CIRCLEQ_LAST

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

Definition at line 476 of file queue.h.

◆ CIRCLEQ_NEXT

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

Definition at line 478 of file queue.h.

◆ CIRCLEQ_PREV

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

Definition at line 480 of file queue.h.

◆ CIRCLEQ_REMOVE

#define CIRCLEQ_REMOVE (   head,
  elm,
  field 
)

Definition at line 482 of file queue.h.

482 { \
483 if ((elm)->field.cqe_next == (void *)(head)) \
484 (head)->cqh_last = (elm)->field.cqe_prev; \
485 else \
486 (elm)->field.cqe_next->field.cqe_prev = \
487 (elm)->field.cqe_prev; \
488 if ((elm)->field.cqe_prev == (void *)(head)) \
489 (head)->cqh_first = (elm)->field.cqe_next; \
490 else \
491 (elm)->field.cqe_prev->field.cqe_next = \
492 (elm)->field.cqe_next; \
493} while (0)

◆ LIST_EMPTY

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

Definition at line 268 of file 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 258 of file queue.h.

259 { \
260 struct type *le_next; /* next element */ \
261 struct type **le_prev; /* address of previous next element */ \
262}

◆ LIST_FIRST

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

Definition at line 270 of file queue.h.

◆ LIST_FOREACH

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

Definition at line 272 of file queue.h.

◆ LIST_HEAD

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

Definition at line 250 of file queue.h.

251 { \
252 struct type *lh_first; /* first element */ \
253}

◆ LIST_HEAD_INITIALIZER

#define LIST_HEAD_INITIALIZER (   head)     { NULL }

Definition at line 255 of file queue.h.

256 { NULL }
NULL
#define NULL
Definition resample.c:96

◆ LIST_INIT

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

Definition at line 275 of file queue.h.

275 { \
276 (head)->lh_first = NULL; \
277} while (0)

◆ LIST_INSERT_AFTER

#define LIST_INSERT_AFTER (   listelm,
  elm,
  field 
)

Definition at line 279 of file queue.h.

279 { \
280 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
281 (listelm)->field.le_next->field.le_prev = \
282 &(elm)->field.le_next; \
283 (listelm)->field.le_next = (elm); \
284 (elm)->field.le_prev = &(listelm)->field.le_next; \
285} while (0)

◆ LIST_INSERT_BEFORE

#define LIST_INSERT_BEFORE (   listelm,
  elm,
  field 
)

Definition at line 287 of file queue.h.

287 { \
288 (elm)->field.le_prev = (listelm)->field.le_prev; \
289 (elm)->field.le_next = (listelm); \
290 *(listelm)->field.le_prev = (elm); \
291 (listelm)->field.le_prev = &(elm)->field.le_next; \
292} while (0)

◆ LIST_INSERT_HEAD

#define LIST_INSERT_HEAD (   head,
  elm,
  field 
)

Definition at line 294 of file queue.h.

294 { \
295 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
296 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
297 (head)->lh_first = (elm); \
298 (elm)->field.le_prev = &(head)->lh_first; \
299} while (0)

◆ LIST_NEXT

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

Definition at line 301 of file queue.h.

◆ LIST_REMOVE

#define LIST_REMOVE (   elm,
  field 
)

Definition at line 303 of file queue.h.

303 { \
304 if ((elm)->field.le_next != NULL) \
305 (elm)->field.le_next->field.le_prev = \
306 (elm)->field.le_prev; \
307 *(elm)->field.le_prev = (elm)->field.le_next; \
308} while (0)

◆ SLIST_EMPTY

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

Definition at line 129 of file queue.h.

◆ SLIST_ENTRY

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

Definition at line 121 of file queue.h.

122 { \
123 struct type *sle_next; /* next element */ \
124}

◆ SLIST_FIRST

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

Definition at line 131 of file queue.h.

◆ SLIST_FOREACH

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

Definition at line 133 of file queue.h.

◆ SLIST_HEAD

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

Definition at line 113 of file queue.h.

114 { \
115 struct type *slh_first; /* first element */ \
116}

◆ SLIST_HEAD_INITIALIZER

#define SLIST_HEAD_INITIALIZER (   head)     { NULL }

Definition at line 118 of file queue.h.

119 { NULL }

◆ SLIST_INIT

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

Definition at line 136 of file queue.h.

136 { \
137 (head)->slh_first = NULL; \
138}

◆ 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 140 of file queue.h.

140 { \
141 (elm)->field.sle_next = (slistelm)->field.sle_next; \
142 (slistelm)->field.sle_next = (elm); \
143} while (0)

◆ 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 145 of file queue.h.

145 { \
146 (elm)->field.sle_next = (head)->slh_first; \
147 (head)->slh_first = (elm); \
148} while (0)

◆ SLIST_NEXT

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

Definition at line 150 of file queue.h.

◆ SLIST_REMOVE

#define SLIST_REMOVE (   head,
  elm,
  type,
  field 
)

Definition at line 156 of file queue.h.

156 { \
157 if ((head)->slh_first == (elm)) { \
158 SLIST_REMOVE_HEAD((head), field); \
159 } \
160 else { \
161 struct type *curelm = (head)->slh_first; \
162 while( curelm->field.sle_next != (elm) ) \
163 curelm = curelm->field.sle_next; \
164 curelm->field.sle_next = \
165 curelm->field.sle_next->field.sle_next; \
166 } \
167} while (0)

◆ 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 152 of file queue.h.

152 { \
153 (head)->slh_first = (head)->slh_first->field.sle_next; \
154} while (0)

◆ STAILQ_EMPTY

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

Definition at line 189 of file queue.h.

◆ STAILQ_ENTRY

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

Definition at line 181 of file queue.h.

182 { \
183 struct type *stqe_next; /* next element */ \
184}

◆ STAILQ_FIRST

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

Definition at line 196 of file queue.h.

◆ STAILQ_FOREACH

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

Definition at line 199 of file queue.h.

◆ STAILQ_HEAD

#define 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 172 of file queue.h.

173 { \
174 struct type *stqh_first;/* first element */ \
175 struct type **stqh_last;/* addr of last next element */ \
176}

◆ STAILQ_HEAD_INITIALIZER

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

Definition at line 178 of file queue.h.

179 { NULL, &(head).stqh_first }

◆ STAILQ_INIT

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

Definition at line 191 of file queue.h.

191 { \
192 (head)->stqh_first = NULL; \
193 (head)->stqh_last = &(head)->stqh_first; \
194} while (0)

◆ STAILQ_INSERT_AFTER

#define 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 214 of file queue.h.

214 { \
215 if (((elm)->field.stqe_next = (tqelm)->field.stqe_next) == NULL)\
216 (head)->stqh_last = &(elm)->field.stqe_next; \
217 (tqelm)->field.stqe_next = (elm); \
218} while (0)

◆ STAILQ_INSERT_HEAD

#define 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 202 of file queue.h.

202 { \
203 if (((elm)->field.stqe_next = (head)->stqh_first) == NULL) \
204 (head)->stqh_last = &(elm)->field.stqe_next; \
205 (head)->stqh_first = (elm); \
206} while (0)

◆ STAILQ_INSERT_TAIL

#define 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 208 of file queue.h.

208 { \
209 (elm)->field.stqe_next = NULL; \
210 *(head)->stqh_last = (elm); \
211 (head)->stqh_last = &(elm)->field.stqe_next; \
212} while (0)

◆ STAILQ_LAST

#define STAILQ_LAST (   head)    (*(head)->stqh_last)

Definition at line 197 of file queue.h.

◆ STAILQ_NEXT

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

Definition at line 220 of file queue.h.

◆ STAILQ_REMOVE

#define STAILQ_REMOVE (   head,
  elm,
  type,
  field 
)

Definition at line 233 of file queue.h.

233 { \
234 if ((head)->stqh_first == (elm)) { \
235 STAILQ_REMOVE_HEAD(head, field); \
236 } \
237 else { \
238 struct type *curelm = (head)->stqh_first; \
239 while( curelm->field.stqe_next != (elm) ) \
240 curelm = curelm->field.stqe_next; \
241 if((curelm->field.stqe_next = \
242 curelm->field.stqe_next->field.stqe_next) == NULL) \
243 (head)->stqh_last = &(curelm)->field.stqe_next; \
244 } \
245} while (0)

◆ STAILQ_REMOVE_HEAD

#define 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 222 of file queue.h.

222 { \
223 if (((head)->stqh_first = \
224 (head)->stqh_first->field.stqe_next) == NULL) \
225 (head)->stqh_last = &(head)->stqh_first; \
226} while (0)

◆ STAILQ_REMOVE_HEAD_UNTIL

#define 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 228 of file queue.h.

228 { \
229 if (((head)->stqh_first = (elm)->field.stqe_next) == NULL) \
230 (head)->stqh_last = &(head)->stqh_first; \
231} while (0)

◆ TAILQ_EMPTY

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

Definition at line 331 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 */ \
}

Definition at line 322 of file queue.h.

323 { \
324 struct type *tqe_next; /* next element */ \
325 struct type **tqe_prev; /* address of previous next element */ \
326}

◆ TAILQ_FIRST

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

Definition at line 341 of file queue.h.

◆ TAILQ_FOREACH

#define TAILQ_FOREACH (   var,
  head,
  field 
)     for (var = TAILQ_FIRST(head); var; var = TAILQ_NEXT(var, field))

Definition at line 333 of file queue.h.

◆ TAILQ_FOREACH_REVERSE

#define TAILQ_FOREACH_REVERSE (   var,
  head,
  headname,
  field 
)
Value:
for ((var) = TAILQ_LAST((head), headname); \
(var); \
(var) = TAILQ_PREV((var), headname, field))
TAILQ_PREV
#define TAILQ_PREV(elm, headname, field)
Definition queue.h:348
TAILQ_LAST
#define TAILQ_LAST(head, headname)
Definition queue.h:343

Definition at line 336 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 */ \
}

Definition at line 313 of file queue.h.

314 { \
315 struct type *tqh_first; /* first element */ \
316 struct type **tqh_last; /* addr of last next element */ \
317}

◆ TAILQ_HEAD_INITIALIZER

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

Definition at line 319 of file queue.h.

320 { NULL, &(head).tqh_first }

◆ TAILQ_INIT

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

Definition at line 351 of file queue.h.

351 { \
352 (head)->tqh_first = NULL; \
353 (head)->tqh_last = &(head)->tqh_first; \
354} while (0)

◆ TAILQ_INSERT_AFTER

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

Definition at line 373 of file queue.h.

373 { \
374 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
375 (elm)->field.tqe_next->field.tqe_prev = \
376 &(elm)->field.tqe_next; \
377 else \
378 (head)->tqh_last = &(elm)->field.tqe_next; \
379 (listelm)->field.tqe_next = (elm); \
380 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
381} while (0)

◆ TAILQ_INSERT_BEFORE

#define TAILQ_INSERT_BEFORE (   listelm,
  elm,
  field 
)

Definition at line 383 of file queue.h.

383 { \
384 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
385 (elm)->field.tqe_next = (listelm); \
386 *(listelm)->field.tqe_prev = (elm); \
387 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
388} while (0)

◆ TAILQ_INSERT_HEAD

#define TAILQ_INSERT_HEAD (   head,
  elm,
  field 
)

Definition at line 356 of file queue.h.

356 { \
357 if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
358 (head)->tqh_first->field.tqe_prev = \
359 &(elm)->field.tqe_next; \
360 else \
361 (head)->tqh_last = &(elm)->field.tqe_next; \
362 (head)->tqh_first = (elm); \
363 (elm)->field.tqe_prev = &(head)->tqh_first; \
364} while (0)

◆ TAILQ_INSERT_TAIL

#define TAILQ_INSERT_TAIL (   head,
  elm,
  field 
)

Definition at line 366 of file queue.h.

366 { \
367 (elm)->field.tqe_next = NULL; \
368 (elm)->field.tqe_prev = (head)->tqh_last; \
369 *(head)->tqh_last = (elm); \
370 (head)->tqh_last = &(elm)->field.tqe_next; \
371} while (0)

◆ TAILQ_LAST

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

Definition at line 343 of file queue.h.

◆ TAILQ_NEXT

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

Definition at line 346 of file queue.h.

◆ TAILQ_PREV

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

Definition at line 348 of file queue.h.

◆ TAILQ_REMOVE

#define TAILQ_REMOVE (   head,
  elm,
  field 
)

Definition at line 390 of file queue.h.

390 { \
391 if (((elm)->field.tqe_next) != NULL) \
392 (elm)->field.tqe_next->field.tqe_prev = \
393 (elm)->field.tqe_prev; \
394 else \
395 (head)->tqh_last = (elm)->field.tqe_prev; \
396 *(elm)->field.tqe_prev = (elm)->field.tqe_next; \
397} while (0)
Generated on Wed Oct 29 2025 20:04:35 for Asterisk - The Open Source Telephony Project by doxygen 1.9.8