summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorEmilio G. Cota2018-12-07 01:04:07 +0100
committerAlex Bennée2019-10-28 16:12:38 +0100
commit050ec8cc18f020b3231db3311241cd3534e7a15f (patch)
tree093346889e18674b8b21e1c2ae8f1ff38dd93d45
parentplugin: add implementation of the api (diff)
downloadqemu-050ec8cc18f020b3231db3311241cd3534e7a15f.tar.gz
qemu-050ec8cc18f020b3231db3311241cd3534e7a15f.tar.xz
qemu-050ec8cc18f020b3231db3311241cd3534e7a15f.zip
queue: add QTAILQ_REMOVE_SEVERAL
This is faster than removing elements one by one. Will gain a user soon. Signed-off-by: Emilio G. Cota <cota@braap.org> Signed-off-by: Alex Bennée <alex.bennee@linaro.org> Reviewed-by: Richard Henderson <richard.henderson@linaro.org>
-rw-r--r--include/qemu/queue.h10
1 files changed, 10 insertions, 0 deletions
diff --git a/include/qemu/queue.h b/include/qemu/queue.h
index 73bf4a984d..4764d93ea3 100644
--- a/include/qemu/queue.h
+++ b/include/qemu/queue.h
@@ -420,6 +420,16 @@ union { \
(elm)->field.tqe_circ.tql_prev = NULL; \
} while (/*CONSTCOND*/0)
+/* remove @left, @right and all elements in between from @head */
+#define QTAILQ_REMOVE_SEVERAL(head, left, right, field) do { \
+ if (((right)->field.tqe_next) != NULL) \
+ (right)->field.tqe_next->field.tqe_circ.tql_prev = \
+ (left)->field.tqe_circ.tql_prev; \
+ else \
+ (head)->tqh_circ.tql_prev = (left)->field.tqe_circ.tql_prev; \
+ (left)->field.tqe_circ.tql_prev->tql_next = (right)->field.tqe_next; \
+ } while (/*CONSTCOND*/0)
+
#define QTAILQ_FOREACH(var, head, field) \
for ((var) = ((head)->tqh_first); \
(var); \