55 #define SH_LIST_FIRSTP(head, type)					\  argument
58 #define SH_LIST_FIRST(head, type)					\  argument
75 #define	SH_LIST_END(head)			NULL  argument
85 #define	SH_LIST_INIT(head) (head)->slh_first = -1  argument
99 #define SH_LIST_INSERT_HEAD(head, elm, field, type) do {		\  argument
138 #define SH_TAILQ_FIRSTP(head, type)					\  argument
141 #define SH_TAILQ_FIRST(head, type)					\  argument
153 #define SH_TAILQ_LAST(head)						\  argument
159 #define SH_TAILQ_END(head)		NULL  argument
161 #define	SH_TAILQ_INIT(head) {						\  argument
166 #define SH_TAILQ_INSERT_HEAD(head, elm, field, type) do {		\  argument
182 #define SH_TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
197 #define SH_TAILQ_INSERT_AFTER(head, listelm, elm, field, type) do {	\  argument
212 #define SH_TAILQ_REMOVE(head, elm, field, type) do {			\  argument
244 #define SH_CIRCLEQ_FIRSTP(head, type)					\  argument
247 #define SH_CIRCLEQ_FIRST(head, type)					\  argument
251 #define SH_CIRCLEQ_LASTP(head, type)					\  argument
254 #define SH_CIRCLEQ_LAST(head, type)					\  argument
260 #define SH_CIRCLEQ_NEXT(head, elm, field, type)				\  argument
267 #define SH_CIRCLEQ_PREV(head, elm, field, type)				\  argument
271 #define	SH_CIRCLEQ_END(head)		((void *)(head))  argument
273 #define	SH_CIRCLEQ_INIT(head) {						\  argument
278 #define SH_CIRCLEQ_INSERT_AFTER(head, listelm, elm, field, type) do {	\  argument
292 #define SH_CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field, type) do {	\  argument
306 #define SH_CIRCLEQ_INSERT_HEAD(head, elm, field, type) do {		\  argument
318 #define SH_CIRCLEQ_INSERT_TAIL(head, elm, field, type) do {		\  argument
330 #define	SH_CIRCLEQ_REMOVE(head, elm, field, type) do {			\  argument