53 #define SH_LIST_FIRSTP(head, type)					\  argument
56 #define SH_LIST_FIRST(head, type)					\  argument
73 #define	SH_LIST_END(head)			NULL  argument
83 #define	SH_LIST_INIT(head) (head)->slh_first = -1  argument
97 #define SH_LIST_INSERT_HEAD(head, elm, field, type) do {		\  argument
136 #define SH_TAILQ_FIRSTP(head, type)					\  argument
139 #define SH_TAILQ_FIRST(head, type)					\  argument
151 #define SH_TAILQ_LAST(head)						\  argument
157 #define SH_TAILQ_END(head)		NULL  argument
159 #define	SH_TAILQ_INIT(head) {						\  argument
164 #define SH_TAILQ_INSERT_HEAD(head, elm, field, type) do {		\  argument
180 #define SH_TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
195 #define SH_TAILQ_INSERT_AFTER(head, listelm, elm, field, type) do {	\  argument
210 #define SH_TAILQ_REMOVE(head, elm, field, type) do {			\  argument
242 #define SH_CIRCLEQ_FIRSTP(head, type)					\  argument
245 #define SH_CIRCLEQ_FIRST(head, type)					\  argument
249 #define SH_CIRCLEQ_LASTP(head, type)					\  argument
252 #define SH_CIRCLEQ_LAST(head, type)					\  argument
258 #define SH_CIRCLEQ_NEXT(head, elm, field, type)				\  argument
265 #define SH_CIRCLEQ_PREV(head, elm, field, type)				\  argument
269 #define	SH_CIRCLEQ_END(head)		((void *)(head))  argument
271 #define	SH_CIRCLEQ_INIT(head) {						\  argument
276 #define SH_CIRCLEQ_INSERT_AFTER(head, listelm, elm, field, type) do {	\  argument
290 #define SH_CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field, type) do {	\  argument
304 #define SH_CIRCLEQ_INSERT_HEAD(head, elm, field, type) do {		\  argument
316 #define SH_CIRCLEQ_INSERT_TAIL(head, elm, field, type) do {		\  argument
328 #define	SH_CIRCLEQ_REMOVE(head, elm, field, type) do {			\  argument