#ifndef _SYS_SHQUEUE_H_
#define _SYS_SHQUEUE_H_
#if defined(__cplusplus)
extern "C" {
#endif
#define SH_LIST_HEAD(name) \
struct name { \
ssize_t slh_first; \
}
#define SH_LIST_HEAD_INITIALIZER(head) \
{ -1 }
#define SH_LIST_ENTRY \
struct { \
ssize_t sle_next; \
ssize_t sle_prev; \
}
#define SH_LIST_EMPTY(head) \
((head)->slh_first == -1)
#define SH_LIST_FIRSTP(head, type) \
((struct type *)(((u_int8_t *)(head)) + (head)->slh_first))
#define SH_LIST_FIRST(head, type) \
(SH_LIST_EMPTY(head) ? NULL : \
((struct type *)(((u_int8_t *)(head)) + (head)->slh_first)))
#define SH_LIST_NEXTP(elm, field, type) \
((struct type *)(((u_int8_t *)(elm)) + (elm)->field.sle_next))
#define SH_LIST_NEXT(elm, field, type) \
((elm)->field.sle_next == -1 ? NULL : \
((struct type *)(((u_int8_t *)(elm)) + (elm)->field.sle_next)))
#define __SH_LIST_PREV_OFF(elm, field) \
((ssize_t *)(((u_int8_t *)(elm)) + (elm)->field.sle_prev))
#define SH_LIST_PREV(elm, field, type) \
(struct type *)((ssize_t)elm - (*__SH_LIST_PREV_OFF(elm, field)))
#define SH_LIST_FOREACH(var, head, field, type) \
for ((var) = SH_LIST_FIRST((head), type); \
(var); \
(var) = SH_LIST_NEXT((var), field, type))
#define SH_PTR_TO_OFF(src, dest) \
((ssize_t)(((u_int8_t *)(dest)) - ((u_int8_t *)(src))))
#define SH_LIST_NEXT_TO_PREV(elm, field) \
(((elm)->field.sle_next == -1 ? 0 : -(elm)->field.sle_next) + \
SH_PTR_TO_OFF(elm, &(elm)->field.sle_next))
#define SH_LIST_INIT(head) (head)->slh_first = -1
#define SH_LIST_INSERT_BEFORE(head, listelm, elm, field, type) do { \
if (listelm == SH_LIST_FIRST(head, type)) { \
SH_LIST_INSERT_HEAD(head, elm, field, type); \
} else { \
(elm)->field.sle_next = SH_PTR_TO_OFF(elm, listelm); \
(elm)->field.sle_prev = SH_LIST_NEXT_TO_PREV( \
SH_LIST_PREV((listelm), field, type), field) + \
(elm)->field.sle_next; \
(SH_LIST_PREV(listelm, field, type))->field.sle_next = \
(SH_PTR_TO_OFF((SH_LIST_PREV(listelm, field, \
type)), elm)); \
(listelm)->field.sle_prev = SH_LIST_NEXT_TO_PREV(elm, field); \
} \
} while (0)
#define SH_LIST_INSERT_AFTER(listelm, elm, field, type) do { \
if ((listelm)->field.sle_next != -1) { \
(elm)->field.sle_next = SH_PTR_TO_OFF(elm, \
SH_LIST_NEXTP(listelm, field, type)); \
SH_LIST_NEXTP(listelm, field, type)->field.sle_prev = \
SH_LIST_NEXT_TO_PREV(elm, field); \
} else \
(elm)->field.sle_next = -1; \
(listelm)->field.sle_next = SH_PTR_TO_OFF(listelm, elm); \
(elm)->field.sle_prev = SH_LIST_NEXT_TO_PREV(listelm, field); \
} while (0)
#define SH_LIST_INSERT_HEAD(head, elm, field, type) do { \
if ((head)->slh_first != -1) { \
(elm)->field.sle_next = \
(head)->slh_first - SH_PTR_TO_OFF(head, elm); \
SH_LIST_FIRSTP(head, type)->field.sle_prev = \
SH_LIST_NEXT_TO_PREV(elm, field); \
} else \
(elm)->field.sle_next = -1; \
(head)->slh_first = SH_PTR_TO_OFF(head, elm); \
(elm)->field.sle_prev = SH_PTR_TO_OFF(elm, &(head)->slh_first); \
} while (0)
#define SH_LIST_REMOVE(elm, field, type) do { \
if ((elm)->field.sle_next != -1) { \
SH_LIST_NEXTP(elm, field, type)->field.sle_prev = \
(elm)->field.sle_prev - (elm)->field.sle_next; \
*__SH_LIST_PREV_OFF(elm, field) += (elm)->field.sle_next;\
} else \
*__SH_LIST_PREV_OFF(elm, field) = -1; \
} while (0)
#define SH_LIST_REMOVE_HEAD(head, field, type) do { \
if (!SH_LIST_EMPTY(head)) { \
SH_LIST_REMOVE(SH_LIST_FIRSTP(head, type), field, type);\
} \
} while (0)
#define SH_TAILQ_HEAD(name) \
struct name { \
ssize_t stqh_first; \
ssize_t stqh_last; \
}
#define SH_TAILQ_HEAD_INITIALIZER(head) \
{ -1, 0 }
#define SH_TAILQ_ENTRY \
struct { \
ssize_t stqe_next; \
ssize_t stqe_prev; \
}
#define SH_TAILQ_EMPTY(head) \
((head)->stqh_first == -1)
#define SH_TAILQ_FIRSTP(head, type) \
((struct type *)((u_int8_t *)(head) + (head)->stqh_first))
#define SH_TAILQ_FIRST(head, type) \
(SH_TAILQ_EMPTY(head) ? NULL : SH_TAILQ_FIRSTP(head, type))
#define SH_TAILQ_NEXTP(elm, field, type) \
((struct type *)((u_int8_t *)(elm) + (elm)->field.stqe_next))
#define SH_TAILQ_NEXT(elm, field, type) \
((elm)->field.stqe_next == -1 ? NULL : \
((struct type *)((u_int8_t *)(elm) + (elm)->field.stqe_next)))
#define __SH_TAILQ_PREV_OFF(elm, field) \
((ssize_t *)(((u_int8_t *)(elm)) + (elm)->field.stqe_prev))
#define SH_TAILQ_PREVP(elm, field, type) \
(struct type *)((ssize_t)elm - (*__SH_TAILQ_PREV_OFF(elm, field)))
#define SH_TAILQ_PREV(head, elm, field, type) \
(((elm) == SH_TAILQ_FIRST(head, type)) ? NULL : \
(struct type *)((ssize_t)elm - (*__SH_TAILQ_PREV_OFF(elm, field))))
#define __SH_TAILQ_LAST_OFF(head) \
((ssize_t *)(((u_int8_t *)(head)) + (head)->stqh_last))
#define SH_TAILQ_LAST(head, field, type) \
(SH_TAILQ_EMPTY(head) ? NULL : \
(struct type *)((ssize_t)(head) + \
((ssize_t)((head)->stqh_last) - \
((ssize_t)SH_PTR_TO_OFF(SH_TAILQ_FIRST(head, type), \
&(SH_TAILQ_FIRST(head, type)->field.stqe_next))))))
#define SH_TAILQ_NEXT_TO_PREV(elm, field) \
(((elm)->field.stqe_next == -1 ? 0 : \
(-(elm)->field.stqe_next) + \
SH_PTR_TO_OFF(elm, &(elm)->field.stqe_next)))
#define SH_TAILQ_FOREACH(var, head, field, type) \
for ((var) = SH_TAILQ_FIRST((head), type); \
(var); \
(var) = SH_TAILQ_NEXT((var), field, type))
#define SH_TAILQ_FOREACH_REVERSE(var, head, field, type) \
for ((var) = SH_TAILQ_LAST((head), field, type); \
(var); \
(var) = SH_TAILQ_PREV((head), (var), field, type))
#define SH_TAILQ_INIT(head) { \
(head)->stqh_first = -1; \
(head)->stqh_last = SH_PTR_TO_OFF(head, &(head)->stqh_first); \
}
#define SH_TAILQ_INSERT_HEAD(head, elm, field, type) do { \
if ((head)->stqh_first != -1) { \
(elm)->field.stqe_next = \
(head)->stqh_first - SH_PTR_TO_OFF(head, elm); \
SH_TAILQ_FIRSTP(head, type)->field.stqe_prev = \
SH_TAILQ_NEXT_TO_PREV(elm, field); \
} else { \
(head)->stqh_last = \
SH_PTR_TO_OFF(head, &(elm)->field.stqe_next); \
(elm)->field.stqe_next = -1; \
} \
(head)->stqh_first = SH_PTR_TO_OFF(head, elm); \
(elm)->field.stqe_prev = \
SH_PTR_TO_OFF(elm, &(head)->stqh_first); \
} while (0)
#define SH_TAILQ_INSERT_TAIL(head, elm, field) 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_OFF(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)
#define SH_TAILQ_INSERT_BEFORE(head, listelm, elm, field, type) do { \
if (listelm == SH_TAILQ_FIRST(head, type)) { \
SH_TAILQ_INSERT_HEAD(head, elm, field, type); \
} else { \
(elm)->field.stqe_next = SH_PTR_TO_OFF(elm, listelm); \
(elm)->field.stqe_prev = SH_TAILQ_NEXT_TO_PREV( \
SH_TAILQ_PREVP((listelm), field, type), field) + \
(elm)->field.stqe_next; \
(SH_TAILQ_PREVP(listelm, field, type))->field.stqe_next =\
(SH_PTR_TO_OFF((SH_TAILQ_PREVP(listelm, field, type)), \
elm)); \
(listelm)->field.stqe_prev = \
SH_TAILQ_NEXT_TO_PREV(elm, field); \
} \
} while (0)
#define SH_TAILQ_INSERT_AFTER(head, listelm, elm, field, type) do { \
if ((listelm)->field.stqe_next != -1) { \
(elm)->field.stqe_next = (listelm)->field.stqe_next - \
SH_PTR_TO_OFF(listelm, elm); \
SH_TAILQ_NEXTP(listelm, field, type)->field.stqe_prev = \
SH_TAILQ_NEXT_TO_PREV(elm, field); \
} else { \
(elm)->field.stqe_next = -1; \
(head)->stqh_last = \
SH_PTR_TO_OFF(head, &elm->field.stqe_next); \
} \
(listelm)->field.stqe_next = SH_PTR_TO_OFF(listelm, elm); \
(elm)->field.stqe_prev = SH_TAILQ_NEXT_TO_PREV(listelm, field); \
} while (0)
#define SH_TAILQ_REMOVE(head, elm, field, type) do { \
if ((elm)->field.stqe_next != -1) { \
SH_TAILQ_NEXTP(elm, field, type)->field.stqe_prev = \
(elm)->field.stqe_prev + \
SH_PTR_TO_OFF(SH_TAILQ_NEXTP(elm, \
field, type), elm); \
*__SH_TAILQ_PREV_OFF(elm, field) += elm->field.stqe_next;\
} else { \
(head)->stqh_last = (elm)->field.stqe_prev + \
SH_PTR_TO_OFF(head, elm); \
*__SH_TAILQ_PREV_OFF(elm, field) = -1; \
} \
} while (0)
#if defined(__cplusplus)
}
#endif
#endif