Message ID | 20190731160719.11396-17-alex.bennee@linaro.org |
---|---|
State | Superseded |
Headers | show |
Series | plugins for TCG | expand |
On 7/31/19 9:06 AM, Alex Bennée wrote: > From: "Emilio G. Cota" <cota@braap.org> > > 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> > --- > include/qemu/queue.h | 10 ++++++++++ > 1 file changed, 10 insertions(+)
On 7/31/19 9:06 AM, Alex Bennée wrote: > From: "Emilio G. Cota" <cota@braap.org> > > 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> > --- > include/qemu/queue.h | 10 ++++++++++ > 1 file changed, 10 insertions(+) Reviewed-by: Richard Henderson <richard.henderson@linaro.org> r~
diff --git a/include/qemu/queue.h b/include/qemu/queue.h index 0379bd8fdbb..66e834dad11 100644 --- a/include/qemu/queue.h +++ b/include/qemu/queue.h @@ -422,6 +422,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); \