shqueue.h

SH_CIRCLEQ_END SH_CIRCLEQ_ENTRY SH_CIRCLEQ_FIRST SH_CIRCLEQ_FIRSTP SH_CIRCLEQ_HEAD SH_CIRCLEQ_INIT SH_CIRCLEQ_INSERT_AFTER SH_CIRCLEQ_INSERT_BEFORE SH_CIRCLEQ_INSERT_HEAD SH_CIRCLEQ_INSERT_TAIL SH_CIRCLEQ_LAST SH_CIRCLEQ_LASTP SH_CIRCLEQ_NEXT SH_CIRCLEQ_NEXTP SH_CIRCLEQ_PREV SH_CIRCLEQ_PREVP SH_CIRCLEQ_REMOVE SH_LIST_END SH_LIST_ENTRY SH_LIST_FIRST SH_LIST_FIRSTP SH_LIST_HEAD SH_LIST_INIT SH_LIST_INSERT_AFTER SH_LIST_INSERT_HEAD SH_LIST_NEXT SH_LIST_NEXT_TO_PREV SH_LIST_NEXTP SH_LIST_PREV SH_LIST_REMOVE SH_PTR_TO_OFF SH_TAILQ_END SH_TAILQ_ENTRY SH_TAILQ_FIRST SH_TAILQ_FIRSTP SH_TAILQ_HEAD SH_TAILQ_INIT SH_TAILQ_INSERT_AFTER SH_TAILQ_INSERT_HEAD SH_TAILQ_INSERT_TAIL SH_TAILQ_LAST SH_TAILQ_NEXT SH_TAILQ_NEXT_TO_PREV SH_TAILQ_NEXTP SH_TAILQ_PREVP SH_TAILQ_REMOVE

#define SH_TAILQ_INSERT_TAIL ( head, elm, field   )  Value: do { \ (elm)->field.stqe_next = -1; \ (elm)->field.stqe_prev = \ -SH_PTR_TO_OFF(head, elm) + (head)->stqh_last; \ if ((head)->stqh_last == \ SH_PTR_TO_OFF((head), &(head)->stqh_first)) \ (head)->stqh_first = SH_PTR_TO_OFF(head, elm); \ else \ *SH_TAILQ_LAST(head) = -(head)->stqh_last + \ SH_PTR_TO_OFF((elm), &(elm)->field.stqe_next) + \ SH_PTR_TO_OFF(head, elm); \ (head)->stqh_last = \ SH_PTR_TO_OFF(head, &((elm)->field.stqe_next)); \ } while (0) Definition at line 178 of file shqueue.h. Referenced by __lock_get_internal(), CDB___lock_promote(), CDB_memp_fget(), and CDB_memp_fput().