Home
last modified time | relevance | path

Searched refs:elm2 (Results 1 – 3 of 3) sorted by relevance

/external/libevent/
Dutil-internal.h152 struct type *elm1, *elm2, **nextp; \
159 elm2 = LIST_NEXT(elm1, field); \
160 while (elm1 && elm2) { \
161 EVUTIL_ASSERT(elm1 != elm2); \
163 elm2 = LIST_NEXT(elm2, field); \
164 if (!elm2) \
166 EVUTIL_ASSERT(elm1 != elm2); \
167 elm2 = LIST_NEXT(elm2, field); \
188 struct type *elm1, *elm2, **nextp; \
195 elm2 = TAILQ_NEXT(elm1, field); \
[all …]
/external/libevent/compat/sys/
Dqueue.h203 #define LIST_REPLACE(elm, elm2, field) do { \ argument
204 if (((elm2)->field.le_next = (elm)->field.le_next) != NULL) \
205 (elm2)->field.le_next->field.le_prev = \
206 &(elm2)->field.le_next; \
207 (elm2)->field.le_prev = (elm)->field.le_prev; \
208 *(elm2)->field.le_prev = (elm2); \
365 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
366 if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != NULL) \
367 (elm2)->field.tqe_next->field.tqe_prev = \
368 &(elm2)->field.tqe_next; \
[all …]
/external/dhcpcd-6.8.2/compat/
Dqueue.h140 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
141 if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != \
143 (elm2)->field.tqe_next->field.tqe_prev = \
144 &(elm2)->field.tqe_next; \
146 (head)->tqh_last = &(elm2)->field.tqe_next; \
147 (elm2)->field.tqe_prev = (elm)->field.tqe_prev; \
148 *(elm2)->field.tqe_prev = (elm2); \