Blame SOURCES/kvm-block-Drain-recursively-with-a-single-BDRV_POLL_WHIL.patch

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