Lines Matching defs:elem
50 #define SLIST_NEXT(elem, field) ((elem)->field.next)
90 #define SLIST_INSERT_AFTER(slistelem, elem, field) \
92 SLIST_NEXT(elem, field) = SLIST_NEXT(slistelem, field); \
93 SLIST_NEXT(slistelem, field) = (elem); \
96 #define SLIST_INSERT_HEAD(head, elem, field) \
98 SLIST_NEXT(elem, field) = SLIST_FIRST(head); \
99 SLIST_FIRST(head) = (elem); \
102 #define SLIST_REMOVE(head, elem, type, field) \
104 if (SLIST_FIRST(head) == (elem)) { \
108 while (SLIST_NEXT(cur, field) != (elem)) \
114 #define SLIST_REMOVE_AFTER(elem, field) \
116 SLIST_NEXT(elem, field) = SLIST_NEXT(SLIST_NEXT(elem, field), field); \
166 #define STAILQ_NEXT(elem, field) ((elem)->field.next)
202 #define STAILQ_INSERT_AFTER(head, listelem, elem, field) \
204 if ((STAILQ_NEXT(elem, field) = STAILQ_NEXT(listelem, field)) == NULL) \
205 (head)->stqh_last = &STAILQ_NEXT(elem, field); \
206 STAILQ_NEXT(listelem, field) = (elem); \
209 #define STAILQ_INSERT_HEAD(head, elem, field) \
211 if ((STAILQ_NEXT(elem, field) = STAILQ_FIRST(head)) == NULL) \
212 (head)->stqh_last = &STAILQ_NEXT(elem, field); \
213 STAILQ_FIRST(head) = (elem); \
216 #define STAILQ_INSERT_TAIL(head, elem, field) \
218 STAILQ_NEXT(elem, field) = NULL; \
219 *(head)->stqh_last = (elem); \
220 (head)->stqh_last = &STAILQ_NEXT(elem, field); \
223 #define STAILQ_REMOVE(head, elem, type, field) \
225 if (STAILQ_FIRST(head) == (elem)) { \
229 while (STAILQ_NEXT(cur, field) != (elem)) \
235 #define STAILQ_REMOVE_AFTER(head, elem, field) \
237 if ((STAILQ_NEXT(elem, field) = \
238 STAILQ_NEXT(STAILQ_NEXT(elem, field), field)) == NULL) \
239 (head)->stqh_last = &STAILQ_NEXT(elem, field); \