Home
last modified time | relevance | path

Searched refs:listelm (Results 1 – 4 of 4) sorted by relevance

/openbmc/linux/drivers/scsi/aic7xxx/
H A Dqueue.h280 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
281 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
282 LIST_NEXT((listelm), field)->field.le_prev = \
284 LIST_NEXT((listelm), field) = (elm); \
285 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
288 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
289 (elm)->field.le_prev = (listelm)->field.le_prev; \
290 LIST_NEXT((elm), field) = (listelm); \
291 *(listelm)->field.le_prev = (elm); \
292 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
[all …]
/openbmc/qemu/include/qemu/
H A Drcu_queue.h61 #define QLIST_INSERT_AFTER_RCU(listelm, elm, field) do { \ argument
62 (elm)->field.le_next = (listelm)->field.le_next; \
63 (elm)->field.le_prev = &(listelm)->field.le_next; \
64 qatomic_rcu_set(&(listelm)->field.le_next, (elm)); \
77 #define QLIST_INSERT_BEFORE_RCU(listelm, elm, field) do { \ argument
78 (elm)->field.le_prev = (listelm)->field.le_prev; \
79 (elm)->field.le_next = (listelm); \
80 qatomic_rcu_set((listelm)->field.le_prev, (elm)); \
81 (listelm)->field.le_prev = &(elm)->field.le_next; \
151 #define QSIMPLEQ_INSERT_AFTER_RCU(head, listelm, elm, field) do { \ argument
[all …]
H A Dqueue.h118 #define QLIST_INSERT_AFTER(listelm, elm, field) do { \ argument
119 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
120 (listelm)->field.le_next->field.le_prev = \
122 (listelm)->field.le_next = (elm); \
123 (elm)->field.le_prev = &(listelm)->field.le_next; \
126 #define QLIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
127 (elm)->field.le_prev = (listelm)->field.le_prev; \
128 (elm)->field.le_next = (listelm); \
129 *(listelm)->field.le_prev = (elm); \
130 (listelm)->field.le_prev = &(elm)->field.le_next; \
[all …]
/openbmc/openbmc/poky/meta/recipes-core/musl/bsd-headers/
H A Dsys-queue.h253 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
254 QUEUEDEBUG_LIST_OP((listelm), field) \
255 if (((elm)->field.le_next = (listelm)->field.le_next) != \
257 (listelm)->field.le_next->field.le_prev = \
259 (listelm)->field.le_next = (elm); \
260 (elm)->field.le_prev = &(listelm)->field.le_next; \
263 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
264 QUEUEDEBUG_LIST_OP((listelm), field) \
265 (elm)->field.le_prev = (listelm)->field.le_prev; \
266 (elm)->field.le_next = (listelm); \
[all …]