Home
last modified time | relevance | path

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

/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 …]