lkml.org 
[lkml]   [2011]   [Apr]   [13]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
SubjectRe: Strange block/scsi/workqueue issue
From
Date
On Wed, 2011-04-13 at 14:11 +0900, Tejun Heo wrote:
> > > Hmmm... maybe but at least I prefer doing explicit shutdown/draining
> > > on destruction even if the base data structure is refcounted. Things
> > > become much more predictable that way.
> >
> > It is pretty much instantaneous. Unless we're executing, we cancel the
> > work. If the work is already running, we just let it complete instead
> > of waiting for it.
> >
> > Synchronous waits are dangerous because they cause entanglement.
>
> There are two different types of dangers involved. One is of getting
> trapped into deadlock by recursing and ending up waiting for oneself.
> The other of continuing operation on objects which could be in dubious
> state. I guess my point is that I prefer the former by a large
> margin.
>
> The deadlocks are more reliable in reproducibility. Lockdep and soft
> hang check can detect them easily and a single stack dump will point
> us right to where the problem is. The latter is much trickier.

I agree, but this is a bit of a false dichotomy. The hang will only
detect the thread waiting on itself. Even in the flush model, we still
have to detect inappropriate object use because others may still have
references.

So, in the sync model, on blk_cleanup_queue() you flush the pending
requests and destroy the elevator. However, because the queue is
refcounted, you still have to cope with the case where one of the
reference holders submits more I/O or does anything else with the queue.
This is what I don't like about the sync then shut down various bits
before the refcount goes to zero. Now we don't have a fully functional
queue so we need state guards on all the entry points to detect this and
error out (that's some of the QUEUE_FLAG_DEAD checks we put in in the
patch).

In the async model, you can either do as above (state guards on the
entry points) and impose a shutting down state, or you can delay
destruction until final put. The former is an identical solution to the
synchronous one, except that you don't have the flush. The latter loses
the state guard on entry points requirements (because the queue is
always fully functional until final put.

> The
> problem is more difficult to trigger and even when it triggers the
> effect often wouldn't be obvious. Auditing for correctness is more
> difficult too - which fields are safe to access post-mortem?

But in a refcounted model you always have to expect postmortem
operations ... you just have to make sure they're properly rejected.
This is true for both sync or async if you impose a dying or dead state
on the model.

> Is there
> any chance that the ongoing operation might reach out to hardware
> which is already gone or claimed by another software entity?

Yes ... in fact SCSI fully expects this ... that's why they dead queue
check in the SCSI request function using a NULL ->queuedata signal
(another thing that wasn't working quite right).

We tear down the device in scsi_remove_device() including destroying the
queue. If we go with the sync model for block, I'd actually move
blk_cleanup_queue() into that function. There's no real point delaying
queue destruction to final put of the SCSI object, since we won't accept
I/O after scsi_remove_device() returns.

> In this particular case, IMHO it's reasonable for block layer to
> require that the destruction function not to be called directly from
> request queue path although it definitely could have used better
> documentation.

I think we've both stated our cases, so it's time for Jens to decide
what he wants to do. Given that block already has a state model which
includes some QUEUE_FLAG_DEAD state guard checks, it probably makes
sense to enhance that, rather than to delay all destruction until final
put.

James




\
 
 \ /
  Last update: 2011-04-13 16:17    [W:0.058 / U:24.120 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site