queue.h

CIRCLEQ_END CIRCLEQ_ENTRY CIRCLEQ_FIRST CIRCLEQ_HEAD CIRCLEQ_INIT CIRCLEQ_INSERT_AFTER CIRCLEQ_INSERT_BEFORE CIRCLEQ_INSERT_HEAD CIRCLEQ_INSERT_TAIL CIRCLEQ_LAST CIRCLEQ_NEXT CIRCLEQ_PREV CIRCLEQ_REMOVE LIST_END LIST_ENTRY LIST_FIRST LIST_HEAD LIST_INIT LIST_INSERT_AFTER LIST_INSERT_BEFORE LIST_INSERT_HEAD LIST_NEXT LIST_REMOVE TAILQ_END TAILQ_ENTRY TAILQ_FIRST TAILQ_HEAD TAILQ_INIT TAILQ_INSERT_AFTER TAILQ_INSERT_BEFORE TAILQ_INSERT_HEAD TAILQ_INSERT_TAIL TAILQ_NEXT TAILQ_REMOVE

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