|
|
26ba25 |
From 013989ed30ff32eedbb1a6767f0c38c85150f951 Mon Sep 17 00:00:00 2001
|
|
|
26ba25 |
From: Kevin Wolf <kwolf@redhat.com>
|
|
|
26ba25 |
Date: Wed, 10 Oct 2018 20:21:39 +0100
|
|
|
26ba25 |
Subject: [PATCH 13/49] block: Drain recursively with a single
|
|
|
26ba25 |
BDRV_POLL_WHILE()
|
|
|
26ba25 |
|
|
|
26ba25 |
RH-Author: Kevin Wolf <kwolf@redhat.com>
|
|
|
26ba25 |
Message-id: <20181010202213.7372-1-kwolf@redhat.com>
|
|
|
26ba25 |
Patchwork-id: 82590
|
|
|
26ba25 |
O-Subject: [RHEL-8 qemu-kvm PATCH 10/44] block: Drain recursively with a single BDRV_POLL_WHILE()
|
|
|
26ba25 |
Bugzilla: 1637976
|
|
|
26ba25 |
RH-Acked-by: Max Reitz <mreitz@redhat.com>
|
|
|
26ba25 |
RH-Acked-by: John Snow <jsnow@redhat.com>
|
|
|
26ba25 |
RH-Acked-by: Thomas Huth <thuth@redhat.com>
|
|
|
26ba25 |
|
|
|
26ba25 |
Anything can happen inside BDRV_POLL_WHILE(), including graph
|
|
|
26ba25 |
changes that may interfere with its callers (e.g. child list iteration
|
|
|
26ba25 |
in recursive callers of bdrv_do_drained_begin).
|
|
|
26ba25 |
|
|
|
26ba25 |
Switch to a single BDRV_POLL_WHILE() call for the whole subtree at the
|
|
|
26ba25 |
end of bdrv_do_drained_begin() to avoid such effects. The recursion
|
|
|
26ba25 |
happens now inside the loop condition. As the graph can only change
|
|
|
26ba25 |
between bdrv_drain_poll() calls, but not inside of it, doing the
|
|
|
26ba25 |
recursion here is safe.
|
|
|
26ba25 |
|
|
|
26ba25 |
Signed-off-by: Kevin Wolf <kwolf@redhat.com>
|
|
|
26ba25 |
(cherry picked from commit fe4f0614ef9e361dae12012d3c400657444836cf)
|
|
|
26ba25 |
Signed-off-by: Kevin Wolf <kwolf@redhat.com>
|
|
|
26ba25 |
Signed-off-by: Danilo C. L. de Paula <ddepaula@redhat.com>
|
|
|
26ba25 |
---
|
|
|
26ba25 |
block.c | 2 +-
|
|
|
26ba25 |
block/io.c | 63 ++++++++++++++++++++++++++++++++++++---------------
|
|
|
26ba25 |
include/block/block.h | 9 +++++---
|
|
|
26ba25 |
3 files changed, 52 insertions(+), 22 deletions(-)
|
|
|
26ba25 |
|
|
|
26ba25 |
diff --git a/block.c b/block.c
|
|
|
26ba25 |
index 0d9698a..9afaf26 100644
|
|
|
26ba25 |
--- a/block.c
|
|
|
26ba25 |
+++ b/block.c
|
|
|
26ba25 |
@@ -824,7 +824,7 @@ static void bdrv_child_cb_drained_begin(BdrvChild *child)
|
|
|
26ba25 |
static bool bdrv_child_cb_drained_poll(BdrvChild *child)
|
|
|
26ba25 |
{
|
|
|
26ba25 |
BlockDriverState *bs = child->opaque;
|
|
|
26ba25 |
- return bdrv_drain_poll(bs, NULL);
|
|
|
26ba25 |
+ return bdrv_drain_poll(bs, false, NULL);
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
static void bdrv_child_cb_drained_end(BdrvChild *child)
|
|
|
26ba25 |
diff --git a/block/io.c b/block/io.c
|
|
|
26ba25 |
index a0e3461..442ded1 100644
|
|
|
26ba25 |
--- a/block/io.c
|
|
|
26ba25 |
+++ b/block/io.c
|
|
|
26ba25 |
@@ -164,6 +164,7 @@ typedef struct {
|
|
|
26ba25 |
bool done;
|
|
|
26ba25 |
bool begin;
|
|
|
26ba25 |
bool recursive;
|
|
|
26ba25 |
+ bool poll;
|
|
|
26ba25 |
BdrvChild *parent;
|
|
|
26ba25 |
} BdrvCoDrainData;
|
|
|
26ba25 |
|
|
|
26ba25 |
@@ -199,27 +200,42 @@ static void bdrv_drain_invoke(BlockDriverState *bs, bool begin)
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
/* Returns true if BDRV_POLL_WHILE() should go into a blocking aio_poll() */
|
|
|
26ba25 |
-bool bdrv_drain_poll(BlockDriverState *bs, BdrvChild *ignore_parent)
|
|
|
26ba25 |
+bool bdrv_drain_poll(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
+ BdrvChild *ignore_parent)
|
|
|
26ba25 |
{
|
|
|
26ba25 |
+ BdrvChild *child, *next;
|
|
|
26ba25 |
+
|
|
|
26ba25 |
if (bdrv_parent_drained_poll(bs, ignore_parent)) {
|
|
|
26ba25 |
return true;
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
- return atomic_read(&bs->in_flight);
|
|
|
26ba25 |
+ if (atomic_read(&bs->in_flight)) {
|
|
|
26ba25 |
+ return true;
|
|
|
26ba25 |
+ }
|
|
|
26ba25 |
+
|
|
|
26ba25 |
+ if (recursive) {
|
|
|
26ba25 |
+ QLIST_FOREACH_SAFE(child, &bs->children, next, next) {
|
|
|
26ba25 |
+ if (bdrv_drain_poll(child->bs, recursive, child)) {
|
|
|
26ba25 |
+ return true;
|
|
|
26ba25 |
+ }
|
|
|
26ba25 |
+ }
|
|
|
26ba25 |
+ }
|
|
|
26ba25 |
+
|
|
|
26ba25 |
+ return false;
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
-static bool bdrv_drain_poll_top_level(BlockDriverState *bs,
|
|
|
26ba25 |
+static bool bdrv_drain_poll_top_level(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
BdrvChild *ignore_parent)
|
|
|
26ba25 |
{
|
|
|
26ba25 |
/* Execute pending BHs first and check everything else only after the BHs
|
|
|
26ba25 |
* have executed. */
|
|
|
26ba25 |
while (aio_poll(bs->aio_context, false));
|
|
|
26ba25 |
|
|
|
26ba25 |
- return bdrv_drain_poll(bs, ignore_parent);
|
|
|
26ba25 |
+ return bdrv_drain_poll(bs, recursive, ignore_parent);
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
static void bdrv_do_drained_begin(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
- BdrvChild *parent);
|
|
|
26ba25 |
+ BdrvChild *parent, bool poll);
|
|
|
26ba25 |
static void bdrv_do_drained_end(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
BdrvChild *parent);
|
|
|
26ba25 |
|
|
|
26ba25 |
@@ -231,7 +247,7 @@ static void bdrv_co_drain_bh_cb(void *opaque)
|
|
|
26ba25 |
|
|
|
26ba25 |
bdrv_dec_in_flight(bs);
|
|
|
26ba25 |
if (data->begin) {
|
|
|
26ba25 |
- bdrv_do_drained_begin(bs, data->recursive, data->parent);
|
|
|
26ba25 |
+ bdrv_do_drained_begin(bs, data->recursive, data->parent, data->poll);
|
|
|
26ba25 |
} else {
|
|
|
26ba25 |
bdrv_do_drained_end(bs, data->recursive, data->parent);
|
|
|
26ba25 |
}
|
|
|
26ba25 |
@@ -242,7 +258,7 @@ static void bdrv_co_drain_bh_cb(void *opaque)
|
|
|
26ba25 |
|
|
|
26ba25 |
static void coroutine_fn bdrv_co_yield_to_drain(BlockDriverState *bs,
|
|
|
26ba25 |
bool begin, bool recursive,
|
|
|
26ba25 |
- BdrvChild *parent)
|
|
|
26ba25 |
+ BdrvChild *parent, bool poll)
|
|
|
26ba25 |
{
|
|
|
26ba25 |
BdrvCoDrainData data;
|
|
|
26ba25 |
|
|
|
26ba25 |
@@ -257,6 +273,7 @@ static void coroutine_fn bdrv_co_yield_to_drain(BlockDriverState *bs,
|
|
|
26ba25 |
.begin = begin,
|
|
|
26ba25 |
.recursive = recursive,
|
|
|
26ba25 |
.parent = parent,
|
|
|
26ba25 |
+ .poll = poll,
|
|
|
26ba25 |
};
|
|
|
26ba25 |
bdrv_inc_in_flight(bs);
|
|
|
26ba25 |
aio_bh_schedule_oneshot(bdrv_get_aio_context(bs),
|
|
|
26ba25 |
@@ -269,12 +286,12 @@ static void coroutine_fn bdrv_co_yield_to_drain(BlockDriverState *bs,
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
void bdrv_do_drained_begin(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
- BdrvChild *parent)
|
|
|
26ba25 |
+ BdrvChild *parent, bool poll)
|
|
|
26ba25 |
{
|
|
|
26ba25 |
BdrvChild *child, *next;
|
|
|
26ba25 |
|
|
|
26ba25 |
if (qemu_in_coroutine()) {
|
|
|
26ba25 |
- bdrv_co_yield_to_drain(bs, true, recursive, parent);
|
|
|
26ba25 |
+ bdrv_co_yield_to_drain(bs, true, recursive, parent, poll);
|
|
|
26ba25 |
return;
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
@@ -286,25 +303,35 @@ void bdrv_do_drained_begin(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
bdrv_parent_drained_begin(bs, parent);
|
|
|
26ba25 |
bdrv_drain_invoke(bs, true);
|
|
|
26ba25 |
|
|
|
26ba25 |
- /* Wait for drained requests to finish */
|
|
|
26ba25 |
- BDRV_POLL_WHILE(bs, bdrv_drain_poll_top_level(bs, parent));
|
|
|
26ba25 |
-
|
|
|
26ba25 |
if (recursive) {
|
|
|
26ba25 |
bs->recursive_quiesce_counter++;
|
|
|
26ba25 |
QLIST_FOREACH_SAFE(child, &bs->children, next, next) {
|
|
|
26ba25 |
- bdrv_do_drained_begin(child->bs, true, child);
|
|
|
26ba25 |
+ bdrv_do_drained_begin(child->bs, true, child, false);
|
|
|
26ba25 |
}
|
|
|
26ba25 |
}
|
|
|
26ba25 |
+
|
|
|
26ba25 |
+ /*
|
|
|
26ba25 |
+ * Wait for drained requests to finish.
|
|
|
26ba25 |
+ *
|
|
|
26ba25 |
+ * Calling BDRV_POLL_WHILE() only once for the top-level node is okay: The
|
|
|
26ba25 |
+ * call is needed so things in this AioContext can make progress even
|
|
|
26ba25 |
+ * though we don't return to the main AioContext loop - this automatically
|
|
|
26ba25 |
+ * includes other nodes in the same AioContext and therefore all child
|
|
|
26ba25 |
+ * nodes.
|
|
|
26ba25 |
+ */
|
|
|
26ba25 |
+ if (poll) {
|
|
|
26ba25 |
+ BDRV_POLL_WHILE(bs, bdrv_drain_poll_top_level(bs, recursive, parent));
|
|
|
26ba25 |
+ }
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
void bdrv_drained_begin(BlockDriverState *bs)
|
|
|
26ba25 |
{
|
|
|
26ba25 |
- bdrv_do_drained_begin(bs, false, NULL);
|
|
|
26ba25 |
+ bdrv_do_drained_begin(bs, false, NULL, true);
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
void bdrv_subtree_drained_begin(BlockDriverState *bs)
|
|
|
26ba25 |
{
|
|
|
26ba25 |
- bdrv_do_drained_begin(bs, true, NULL);
|
|
|
26ba25 |
+ bdrv_do_drained_begin(bs, true, NULL, true);
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
void bdrv_do_drained_end(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
@@ -314,7 +341,7 @@ void bdrv_do_drained_end(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
int old_quiesce_counter;
|
|
|
26ba25 |
|
|
|
26ba25 |
if (qemu_in_coroutine()) {
|
|
|
26ba25 |
- bdrv_co_yield_to_drain(bs, false, recursive, parent);
|
|
|
26ba25 |
+ bdrv_co_yield_to_drain(bs, false, recursive, parent, false);
|
|
|
26ba25 |
return;
|
|
|
26ba25 |
}
|
|
|
26ba25 |
assert(bs->quiesce_counter > 0);
|
|
|
26ba25 |
@@ -350,7 +377,7 @@ void bdrv_apply_subtree_drain(BdrvChild *child, BlockDriverState *new_parent)
|
|
|
26ba25 |
int i;
|
|
|
26ba25 |
|
|
|
26ba25 |
for (i = 0; i < new_parent->recursive_quiesce_counter; i++) {
|
|
|
26ba25 |
- bdrv_do_drained_begin(child->bs, true, child);
|
|
|
26ba25 |
+ bdrv_do_drained_begin(child->bs, true, child, true);
|
|
|
26ba25 |
}
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
@@ -420,7 +447,7 @@ void bdrv_drain_all_begin(void)
|
|
|
26ba25 |
AioContext *aio_context = bdrv_get_aio_context(bs);
|
|
|
26ba25 |
|
|
|
26ba25 |
aio_context_acquire(aio_context);
|
|
|
26ba25 |
- bdrv_do_drained_begin(bs, true, NULL);
|
|
|
26ba25 |
+ bdrv_do_drained_begin(bs, true, NULL, true);
|
|
|
26ba25 |
aio_context_release(aio_context);
|
|
|
26ba25 |
}
|
|
|
26ba25 |
|
|
|
26ba25 |
diff --git a/include/block/block.h b/include/block/block.h
|
|
|
26ba25 |
index 8c91d4c..2bbea7c 100644
|
|
|
26ba25 |
--- a/include/block/block.h
|
|
|
26ba25 |
+++ b/include/block/block.h
|
|
|
26ba25 |
@@ -598,10 +598,13 @@ void bdrv_parent_drained_end(BlockDriverState *bs, BdrvChild *ignore);
|
|
|
26ba25 |
/**
|
|
|
26ba25 |
* bdrv_drain_poll:
|
|
|
26ba25 |
*
|
|
|
26ba25 |
- * Poll for pending requests in @bs and its parents (except for
|
|
|
26ba25 |
- * @ignore_parent). This is part of bdrv_drained_begin.
|
|
|
26ba25 |
+ * Poll for pending requests in @bs, its parents (except for @ignore_parent),
|
|
|
26ba25 |
+ * and if @recursive is true its children as well.
|
|
|
26ba25 |
+ *
|
|
|
26ba25 |
+ * This is part of bdrv_drained_begin.
|
|
|
26ba25 |
*/
|
|
|
26ba25 |
-bool bdrv_drain_poll(BlockDriverState *bs, BdrvChild *ignore_parent);
|
|
|
26ba25 |
+bool bdrv_drain_poll(BlockDriverState *bs, bool recursive,
|
|
|
26ba25 |
+ BdrvChild *ignore_parent);
|
|
|
26ba25 |
|
|
|
26ba25 |
/**
|
|
|
26ba25 |
* bdrv_drained_begin:
|
|
|
26ba25 |
--
|
|
|
26ba25 |
1.8.3.1
|
|
|
26ba25 |
|