Am 18.08.2023 um 18:26 hat Eric Blake geschrieben:
> On Fri, Aug 18, 2023 at 11:24:00AM -0500, Eric Blake wrote:
> > > +++ b/block/graph-lock.c
> > > @@ -163,17 +163,26 @@ void bdrv_graph_wrlock(BlockDriverState *bs)
> > > void bdrv_graph_wrunlock(void)
> > > {
> > > GLOBAL_STATE_CODE();
> > > - QEMU_LOCK_GUARD(&aio_context_list_lock);
> > > assert(qatomic_read(&has_writer));
> > >
> > > + WITH_QEMU_LOCK_GUARD(&aio_context_list_lock) {
> > > + /*
> > > + * No need for memory barriers, this works in pair with
> > > + * the slow path of rdlock() and both take the lock.
> > > + */
> > > + qatomic_store_release(&has_writer, 0);
> > > +
> > > + /* Wake up all coroutine that are waiting to read the graph */
> > > + qemu_co_enter_all(&reader_queue, &aio_context_list_lock);
> >
> > So if I understand coroutines correctly, this says all pending
> > coroutines are now scheduled to run (or maybe they do try to run here,
> > but then immediately return control back to this coroutine to await
> > the right lock conditions since we are still in the block guarded by
> > list_lock)...
> >
> > > + }
> > > +
> > > /*
> > > - * No need for memory barriers, this works in pair with
> > > - * the slow path of rdlock() and both take the lock.
> > > + * Run any BHs that were scheduled during the wrlock section and that
> > > + * callers might expect to have finished (e.g. bdrv_unref() calls).
> > > Do this
> > > + * only after restarting coroutines so that nested event loops in
> > > BHs don't
> > > + * deadlock if their condition relies on the coroutine making
> > > progress.
> > > */
> > > - qatomic_store_release(&has_writer, 0);
> > > -
> > > - /* Wake up all coroutine that are waiting to read the graph */
> > > - qemu_co_enter_all(&reader_queue, &aio_context_list_lock);
> > > + aio_bh_poll(qemu_get_aio_context());
> >
> > ...and as long as the other coroutines sharing this thread don't
> > actually get to make progress until the next point at which the
> > current coroutine yields, and as long as our aio_bh_poll() doesn't
> > also include a yield point, then we are ensured that the BH has
> > completed before the next yield point in our caller.
> >
> > There are times (like today) where I'm still trying to wrap my mind
> > about the subtle differences between true multi-threading
> > vs. cooperative coroutines sharing a single thread via the use of
> > yield points. coroutines are cool when they can get rid of some of
> > the races that you have to worry about in true multi-threading.
>
> That said, once we introduce multi-queue, can we ever have a scenario
> where a different iothread might be trying to access the graph and
> perform a reopen in the time while this thread has not completed the
> BH close? Or is that protected by some other mutual exclusion (where
> the only one we have to worry about is reopen by a coroutine in the
> same thread, because all other threads are locked out of graph
> modifications)?
We don't have to worry about that one because reopen (and taking the
writer lock in general) only happen in the main thread, which is exactly
the thread that this code runs in.
The thing that we need to take into consideration is that aio_bh_poll()
could call something that wants to take the writer lock and modify the
graph again. It's not really a problem, though, because we're already
done at that point. Any readers that we resumed above will just
synchronise with the writer in the usual way and one of them will have
to wait. But there is nothing that is still waiting to be resumed and
could deadlock.
Kevin
