[v5,10/55] queue: add QTAILQ_REMOVE_SEVERAL

Commit Message

Alex Bennée Oct. 14, 2019, 10:49 a.m. UTC

From: "Emilio G. Cota" <[e-mail]>

This is faster than removing elements one by one.

Will gain a user soon.

Signed-off-by: Emilio G. Cota <[e-mail]>
Signed-off-by: Alex Bennée <[e-mail]>
Reviewed-by: Richard Henderson <[e-mail]>
---
 include/qemu/queue.h | 10 ++++++++++
 1 file changed, 10 insertions(+)

Patch

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);                                                  \