PLASMA  2.4.5
PLASMA - Parallel Linear Algebra for Scalable Multi-core Architectures
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups
Macros
bsd_queue.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

#define QMD_TRACE_ELEM(elem)
#define QMD_TRACE_HEAD(head)
#define TRACEBUF
#define TRASHIT(x)
#define SLLIST_HEAD(name, type)
#define SLLIST_HEAD_INITIALIZER(head)   { NULL }
#define SLLIST_ENTRY(type)
#define SLLIST_EMPTY(head)   ((head)->slh_first == NULL)
#define SLLIST_FIRST(head)   ((head)->slh_first)
#define SLLIST_FOREACH(var, head, field)
#define SLLIST_FOREACH_SAFE(var, head, field, tvar)
#define SLLIST_FOREACH_PREVPTR(var, varp, head, field)
#define SLLIST_INIT(head)
#define SLLIST_INSERT_AFTER(slistelm, elm, field)
#define SLLIST_INSERT_HEAD(head, elm, field)
#define SLLIST_NEXT(elm, field)   ((elm)->field.sle_next)
#define SLLIST_REMOVE(head, elm, type, field)
#define SLLIST_REMOVE_AFTER(elm, field)
#define SLLIST_REMOVE_HEAD(head, field)
#define STAILQ_HEAD(name, type)
#define STAILQ_HEAD_INITIALIZER(head)   { NULL, &(head).stqh_first }
#define STAILQ_ENTRY(type)
#define STAILQ_CONCAT(head1, head2)
#define STAILQ_EMPTY(head)   ((head)->stqh_first == NULL)
#define STAILQ_FIRST(head)   ((head)->stqh_first)
#define STAILQ_FOREACH(var, head, field)
#define STAILQ_FOREACH_SAFE(var, head, field, tvar)
#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, type, field)
#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_AFTER(head, elm, field)
#define LIST_HEAD(name, type)
#define LIST_HEAD_INITIALIZER(head)   { NULL }
#define LIST_ENTRY(type)
#define QMD_LIST_CHECK_HEAD(head, field)
#define QMD_LIST_CHECK_NEXT(elm, field)
#define QMD_LIST_CHECK_PREV(elm, field)
#define LIST_EMPTY(head)   ((head)->lh_first == NULL)
#define LIST_FIRST(head)   ((head)->lh_first)
#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_NEXT(elm, field)   ((elm)->field.le_next)
#define LIST_REMOVE(elm, field)
#define TAILQ_HEAD(name, type)
#define TAILQ_HEAD_INITIALIZER(head)   { NULL, &(head).tqh_first }
#define TAILQ_ENTRY(type)
#define QMD_TAILQ_CHECK_HEAD(head, field)
#define QMD_TAILQ_CHECK_TAIL(head, headname)
#define QMD_TAILQ_CHECK_NEXT(elm, field)
#define QMD_TAILQ_CHECK_PREV(elm, field)
#define TAILQ_CONCAT(head1, head2, field)
#define TAILQ_EMPTY(head)   ((head)->tqh_first == NULL)
#define TAILQ_FIRST(head)   ((head)->tqh_first)
#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_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

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

Definition at line 358 of file bsd_queue.h.

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

Definition at line 323 of file bsd_queue.h.

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

Definition at line 360 of file bsd_queue.h.

#define LIST_FOREACH (   var,
  head,
  field 
)
Value:
for ((var) = LIST_FIRST((head)); \
(var); \
(var) = LIST_NEXT((var), field))

Definition at line 362 of file bsd_queue.h.

#define LIST_FOREACH_SAFE (   var,
  head,
  field,
  tvar 
)
Value:
for ((var) = LIST_FIRST((head)); \
(var) && ((tvar) = LIST_NEXT((var), field), 1); \
(var) = (tvar))

Definition at line 367 of file bsd_queue.h.

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

Definition at line 315 of file bsd_queue.h.

#define LIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 320 of file bsd_queue.h.

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

Definition at line 372 of file bsd_queue.h.

#define LIST_INSERT_AFTER (   listelm,
  elm,
  field 
)
Value:
do { \
QMD_LIST_CHECK_NEXT(listelm, field); \
if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
LIST_NEXT((listelm), field)->field.le_prev = \
&LIST_NEXT((elm), field); \
LIST_NEXT((listelm), field) = (elm); \
(elm)->field.le_prev = &LIST_NEXT((listelm), field); \
} while (0)

Definition at line 376 of file bsd_queue.h.

#define LIST_INSERT_BEFORE (   listelm,
  elm,
  field 
)
Value:
do { \
QMD_LIST_CHECK_PREV(listelm, field); \
(elm)->field.le_prev = (listelm)->field.le_prev; \
LIST_NEXT((elm), field) = (listelm); \
*(listelm)->field.le_prev = (elm); \
(listelm)->field.le_prev = &LIST_NEXT((elm), field); \
} while (0)

Definition at line 385 of file bsd_queue.h.

#define LIST_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do { \
QMD_LIST_CHECK_HEAD((head), field); \
if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
LIST_FIRST((head)) = (elm); \
(elm)->field.le_prev = &LIST_FIRST((head)); \
} while (0)

Definition at line 393 of file bsd_queue.h.

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

Definition at line 401 of file bsd_queue.h.

#define LIST_REMOVE (   elm,
  field 
)
Value:
do { \
QMD_LIST_CHECK_NEXT(elm, field); \
QMD_LIST_CHECK_PREV(elm, field); \
if (LIST_NEXT((elm), field) != NULL) \
LIST_NEXT((elm), field)->field.le_prev = \
(elm)->field.le_prev; \
*(elm)->field.le_prev = LIST_NEXT((elm), field); \
TRASHIT((elm)->field.le_next); \
TRASHIT((elm)->field.le_prev); \
} while (0)

Definition at line 403 of file bsd_queue.h.

#define QMD_LIST_CHECK_HEAD (   head,
  field 
)

Definition at line 353 of file bsd_queue.h.

#define QMD_LIST_CHECK_NEXT (   elm,
  field 
)

Definition at line 354 of file bsd_queue.h.

#define QMD_LIST_CHECK_PREV (   elm,
  field 
)

Definition at line 355 of file bsd_queue.h.

#define QMD_TAILQ_CHECK_HEAD (   head,
  field 
)

Definition at line 462 of file bsd_queue.h.

#define QMD_TAILQ_CHECK_NEXT (   elm,
  field 
)

Definition at line 464 of file bsd_queue.h.

#define QMD_TAILQ_CHECK_PREV (   elm,
  field 
)

Definition at line 465 of file bsd_queue.h.

#define QMD_TAILQ_CHECK_TAIL (   head,
  headname 
)

Definition at line 463 of file bsd_queue.h.

#define QMD_TRACE_ELEM (   elem)

Definition at line 131 of file bsd_queue.h.

#define QMD_TRACE_HEAD (   head)

Definition at line 132 of file bsd_queue.h.

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

Definition at line 156 of file bsd_queue.h.

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

Definition at line 148 of file bsd_queue.h.

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

Definition at line 158 of file bsd_queue.h.

#define SLLIST_FOREACH (   var,
  head,
  field 
)
Value:
for ((var) = SLLIST_FIRST((head)); \
(var); \
(var) = SLLIST_NEXT((var), field))

Definition at line 160 of file bsd_queue.h.

#define SLLIST_FOREACH_PREVPTR (   var,
  varp,
  head,
  field 
)
Value:
for ((varp) = &SLLIST_FIRST((head)); \
((var) = *(varp)) != NULL; \
(varp) = &SLLIST_NEXT((var), field))

Definition at line 170 of file bsd_queue.h.

#define SLLIST_FOREACH_SAFE (   var,
  head,
  field,
  tvar 
)
Value:
for ((var) = SLLIST_FIRST((head)); \
(var) && ((tvar) = SLLIST_NEXT((var), field), 1); \
(var) = (tvar))

Definition at line 165 of file bsd_queue.h.

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

Definition at line 140 of file bsd_queue.h.

#define SLLIST_HEAD_INITIALIZER (   head)    { NULL }

Definition at line 145 of file bsd_queue.h.

#define SLLIST_INIT (   head)
Value:
do { \
SLLIST_FIRST((head)) = NULL; \
} while (0)

Definition at line 175 of file bsd_queue.h.

#define SLLIST_INSERT_AFTER (   slistelm,
  elm,
  field 
)
Value:
do { \
SLLIST_NEXT((elm), field) = SLLIST_NEXT((slistelm), field); \
SLLIST_NEXT((slistelm), field) = (elm); \
} while (0)

Definition at line 179 of file bsd_queue.h.

#define SLLIST_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do { \
SLLIST_NEXT((elm), field) = SLLIST_FIRST((head)); \
SLLIST_FIRST((head)) = (elm); \
} while (0)

Definition at line 184 of file bsd_queue.h.

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

Definition at line 189 of file bsd_queue.h.

#define SLLIST_REMOVE (   head,
  elm,
  type,
  field 
)
Value:
do { \
if (SLLIST_FIRST((head)) == (elm)) { \
SLLIST_REMOVE_HEAD((head), field); \
} \
else { \
struct type *curelm = SLLIST_FIRST((head)); \
while (SLLIST_NEXT(curelm, field) != (elm)) \
curelm = SLLIST_NEXT(curelm, field); \
SLLIST_REMOVE_AFTER(curelm, field); \
} \
TRASHIT((elm)->field.sle_next); \
} while (0)

Definition at line 191 of file bsd_queue.h.

#define SLLIST_REMOVE_AFTER (   elm,
  field 
)
Value:
do { \
SLLIST_NEXT(elm, field) = \
SLLIST_NEXT(SLLIST_NEXT(elm, field), field); \
} while (0)

Definition at line 204 of file bsd_queue.h.

#define SLLIST_REMOVE_HEAD (   head,
  field 
)
Value:
do { \
SLLIST_FIRST((head)) = SLLIST_NEXT(SLLIST_FIRST((head)), field); \
} while (0)

Definition at line 209 of file bsd_queue.h.

#define STAILQ_CONCAT (   head1,
  head2 
)
Value:
do { \
if (!STAILQ_EMPTY((head2))) { \
*(head1)->stqh_last = (head2)->stqh_first; \
(head1)->stqh_last = (head2)->stqh_last; \
STAILQ_INIT((head2)); \
} \
} while (0)

Definition at line 233 of file bsd_queue.h.

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

Definition at line 241 of file bsd_queue.h.

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

Definition at line 225 of file bsd_queue.h.

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

Definition at line 243 of file bsd_queue.h.

#define STAILQ_FOREACH (   var,
  head,
  field 
)
Value:
for((var) = STAILQ_FIRST((head)); \
(var); \
(var) = STAILQ_NEXT((var), field))

Definition at line 245 of file bsd_queue.h.

#define STAILQ_FOREACH_SAFE (   var,
  head,
  field,
  tvar 
)
Value:
for ((var) = STAILQ_FIRST((head)); \
(var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
(var) = (tvar))

Definition at line 251 of file bsd_queue.h.

#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 216 of file bsd_queue.h.

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

Definition at line 222 of file bsd_queue.h.

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

Definition at line 256 of file bsd_queue.h.

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

Definition at line 261 of file bsd_queue.h.

#define STAILQ_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do { \
if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
(head)->stqh_last = &STAILQ_NEXT((elm), field); \
STAILQ_FIRST((head)) = (elm); \
} while (0)

Definition at line 267 of file bsd_queue.h.

#define STAILQ_INSERT_TAIL (   head,
  elm,
  field 
)
Value:
do { \
STAILQ_NEXT((elm), field) = NULL; \
*(head)->stqh_last = (elm); \
(head)->stqh_last = &STAILQ_NEXT((elm), field); \
} while (0)

Definition at line 273 of file bsd_queue.h.

#define STAILQ_LAST (   head,
  type,
  field 
)
Value:
(STAILQ_EMPTY((head)) ? \
NULL : \
((struct type *)(void *) \
((char *)((head)->stqh_last) - __offsetof(struct type, field))))

Definition at line 279 of file bsd_queue.h.

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

Definition at line 285 of file bsd_queue.h.

#define STAILQ_REMOVE (   head,
  elm,
  type,
  field 
)
Value:
do { \
if (STAILQ_FIRST((head)) == (elm)) { \
STAILQ_REMOVE_HEAD((head), field); \
} \
else { \
struct type *curelm = STAILQ_FIRST((head)); \
while (STAILQ_NEXT(curelm, field) != (elm)) \
curelm = STAILQ_NEXT(curelm, field); \
STAILQ_REMOVE_AFTER(head, curelm, field); \
} \
TRASHIT((elm)->field.stqe_next); \
} while (0)

Definition at line 287 of file bsd_queue.h.

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

Definition at line 306 of file bsd_queue.h.

#define STAILQ_REMOVE_HEAD (   head,
  field 
)
Value:
do { \
if ((STAILQ_FIRST((head)) = \
STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
(head)->stqh_last = &STAILQ_FIRST((head)); \
} while (0)

Definition at line 300 of file bsd_queue.h.

#define TAILQ_CONCAT (   head1,
  head2,
  field 
)
Value:
do { \
if (!TAILQ_EMPTY(head2)) { \
*(head1)->tqh_last = (head2)->tqh_first; \
(head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
(head1)->tqh_last = (head2)->tqh_last; \
TAILQ_INIT((head2)); \
QMD_TRACE_HEAD(head1); \
QMD_TRACE_HEAD(head2); \
} \
} while (0)

Definition at line 468 of file bsd_queue.h.

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

Definition at line 479 of file bsd_queue.h.

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

Definition at line 427 of file bsd_queue.h.

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

Definition at line 481 of file bsd_queue.h.

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

Definition at line 483 of file bsd_queue.h.

#define TAILQ_FOREACH_REVERSE (   var,
  head,
  headname,
  field 
)
Value:
for ((var) = TAILQ_LAST((head), headname); \
(var); \
(var) = TAILQ_PREV((var), headname, field))

Definition at line 493 of file bsd_queue.h.

#define TAILQ_FOREACH_REVERSE_SAFE (   var,
  head,
  headname,
  field,
  tvar 
)
Value:
for ((var) = TAILQ_LAST((head), headname); \
(var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
(var) = (tvar))

Definition at line 498 of file bsd_queue.h.

#define TAILQ_FOREACH_SAFE (   var,
  head,
  field,
  tvar 
)
Value:
for ((var) = TAILQ_FIRST((head)); \
(var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
(var) = (tvar))

Definition at line 488 of file bsd_queue.h.

#define TAILQ_HEAD (   name,
  type 
)
Value:
struct name { \
struct type *tqh_first; /* first element */ \
struct type **tqh_last; /* addr of last next element */ \
TRACEBUF \
}

Definition at line 417 of file bsd_queue.h.

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

Definition at line 424 of file bsd_queue.h.

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

Definition at line 503 of file bsd_queue.h.

#define TAILQ_INSERT_AFTER (   head,
  listelm,
  elm,
  field 
)
Value:
do { \
QMD_TAILQ_CHECK_NEXT(listelm, field); \
if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
TAILQ_NEXT((elm), field)->field.tqe_prev = \
&TAILQ_NEXT((elm), field); \
else { \
(head)->tqh_last = &TAILQ_NEXT((elm), field); \
QMD_TRACE_HEAD(head); \
} \
TAILQ_NEXT((listelm), field) = (elm); \
(elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
QMD_TRACE_ELEM(&(elm)->field); \
QMD_TRACE_ELEM(&listelm->field); \
} while (0)

Definition at line 509 of file bsd_queue.h.

#define TAILQ_INSERT_BEFORE (   listelm,
  elm,
  field 
)
Value:
do { \
QMD_TAILQ_CHECK_PREV(listelm, field); \
(elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
TAILQ_NEXT((elm), field) = (listelm); \
*(listelm)->field.tqe_prev = (elm); \
(listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
QMD_TRACE_ELEM(&(elm)->field); \
QMD_TRACE_ELEM(&listelm->field); \
} while (0)

Definition at line 524 of file bsd_queue.h.

#define TAILQ_INSERT_HEAD (   head,
  elm,
  field 
)
Value:
do { \
QMD_TAILQ_CHECK_HEAD(head, field); \
if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
TAILQ_FIRST((head))->field.tqe_prev = \
&TAILQ_NEXT((elm), field); \
else \
(head)->tqh_last = &TAILQ_NEXT((elm), field); \
TAILQ_FIRST((head)) = (elm); \
(elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
QMD_TRACE_HEAD(head); \
QMD_TRACE_ELEM(&(elm)->field); \
} while (0)

Definition at line 534 of file bsd_queue.h.

#define TAILQ_INSERT_TAIL (   head,
  elm,
  field 
)
Value:
do { \
QMD_TAILQ_CHECK_TAIL(head, field); \
TAILQ_NEXT((elm), field) = NULL; \
(elm)->field.tqe_prev = (head)->tqh_last; \
*(head)->tqh_last = (elm); \
(head)->tqh_last = &TAILQ_NEXT((elm), field); \
QMD_TRACE_HEAD(head); \
QMD_TRACE_ELEM(&(elm)->field); \
} while (0)

Definition at line 547 of file bsd_queue.h.

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

Definition at line 557 of file bsd_queue.h.

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

Definition at line 560 of file bsd_queue.h.

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

Definition at line 562 of file bsd_queue.h.

#define TAILQ_REMOVE (   head,
  elm,
  field 
)
Value:
do { \
QMD_TAILQ_CHECK_NEXT(elm, field); \
QMD_TAILQ_CHECK_PREV(elm, field); \
if ((TAILQ_NEXT((elm), field)) != NULL) \
TAILQ_NEXT((elm), field)->field.tqe_prev = \
(elm)->field.tqe_prev; \
else { \
(head)->tqh_last = (elm)->field.tqe_prev; \
QMD_TRACE_HEAD(head); \
} \
*(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
TRASHIT((elm)->field.tqe_next); \
TRASHIT((elm)->field.tqe_prev); \
QMD_TRACE_ELEM(&(elm)->field); \
} while (0)

Definition at line 565 of file bsd_queue.h.

#define TRACEBUF

Definition at line 133 of file bsd_queue.h.

#define TRASHIT (   x)

Definition at line 134 of file bsd_queue.h.