usr.bin/csup/queue.h

39 #define	__offsetof(type, field)	((size_t)(&((type *)0)->field))
68 #define	STAILQ_FOREACH(var, head, field)				\
71 	   (var) = STAILQ_NEXT((var), field))
74 #define	STAILQ_FOREACH_SAFE(var, head, field, tvar)			\
76 	    (var) && ((tvar) = STAILQ_NEXT((var), field), 1);		\
86 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\
87 	if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
88 		(head)->stqh_last = &STAILQ_NEXT((elm), field);		\
89 	STAILQ_NEXT((tqelm), field) = (elm);				\
93 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\
94 	if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL)	\
95 		(head)->stqh_last = &STAILQ_NEXT((elm), field);		\
100 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\
101 	STAILQ_NEXT((elm), field) = NULL;				\
103 	(head)->stqh_last = &STAILQ_NEXT((elm), field);			\
107 #define	STAILQ_LAST(head, type, field)					\
111 		((char *)((head)->stqh_last) - __offsetof(struct type, field))))
114 #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)
117 #define	STAILQ_REMOVE(head, elm, type, field) do {			\
119 		STAILQ_REMOVE_HEAD((head), field);			\
123 		while (STAILQ_NEXT(curelm, field) != (elm))		\
124 			curelm = STAILQ_NEXT(curelm, field);		\
125 		if ((STAILQ_NEXT(curelm, field) =			\
126 		     STAILQ_NEXT(STAILQ_NEXT(curelm, field), field)) == NULL)\
127 			(head)->stqh_last = &STAILQ_NEXT((curelm), field);\
132 #define	STAILQ_REMOVE_HEAD(head, field) do {				\
134 	     STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL)		\
139 #define	STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {			\
140 	if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL)	\
175 #define	LIST_FOREACH(var, head, field)					\
178 	    (var) = LIST_NEXT((var), field))
181 #define	LIST_FOREACH_SAFE(var, head, field, tvar)			\
183 	    (var) && ((tvar) = LIST_NEXT((var), field), 1);		\
192 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\
193 	if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
194 		LIST_NEXT((listelm), field)->field.le_prev =		\
195 		    &LIST_NEXT((elm), field);				\
196 	LIST_NEXT((listelm), field) = (elm);				\
197 	(elm)->field.le_prev = &LIST_NEXT((listelm), field);		\
201 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\
202 	(elm)->field.le_prev = (listelm)->field.le_prev;		\
203 	LIST_NEXT((elm), field) = (listelm);				\
204 	*(listelm)->field.le_prev = (elm);				\
205 	(listelm)->field.le_prev = &LIST_NEXT((elm), field);		\
209 #define	LIST_INSERT_HEAD(head, elm, field) do {				\
210 	if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL)	\
211 		LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
213 	(elm)->field.le_prev = &LIST_FIRST((head));			\
217 #define	LIST_NEXT(elm, field)	((elm)->field.le_next)
220 #define	LIST_REMOVE(elm, field) do {					\
221 	if (LIST_NEXT((elm), field) != NULL)				\
222 		LIST_NEXT((elm), field)->field.le_prev = 		\
223 		    (elm)->field.le_prev;				\
224 	*(elm)->field.le_prev = LIST_NEXT((elm), field);		\