> >This implements a writeback cache in kernel data structures so that you
> >can race to throw away cached blocks that haven't been flushed. How is
> >that meaningfully different than using an actual writeback caching dm
> >target and racing to invalidate it?
>
> I didn't think of the dm-cache target, but do we want to add data loss
> testing code to something people actually use in production? I feel like
> that's a recipe for disaster. I suppose it could work, but my target adds
> some specific scenarios like blow up after FUA/FLUSH to test for specific
> races.
I don't know if we'd even need code changes. Can't you forcibly fiddle
with the target tables to remove the caching target at any point? No
hablo dm.
> >Using real caching dm target configurations would let you reuse their
> >testing and corner case handling that is, presumably, already slightly
> >more advanced than printk() swearing.
> >
>
> Well that's just an unfair jab, I missed _one_ debug printk.
And it was a hilarious printk :).
> >If we were to justify developing a specific power failure target, I'd
> >like to see something that tracks write history and can replay the
> >history to offer a resonably exhaustive set of possible write results.
> >Verify *those* and you have much more confidence that the file system
> >can handle reading the results of its interrupted writes.
>
> This sounds like a pretty cool idea, it would be weird trying to order
> everything out though to catch problems where we don't properly wait on IO
> to complete before we do flushing. You'd probably have to keep track of
> when things were submitted and when they completed in the log in order to
> replay them in a way to expose problems with the flushing. But you're right
> it would allow us to more exhaustively test all different scenarios.
Well, I think it'd be more about tracking write submission and flush
completion to maintain sets of writes that could have become persistent
in any order. Then you provide an interface for iterating over devices
that represent possible persistent outcomes.
Say you have a tree of flush events and each flush has a tree of blocks
that were dirty at the time of the flush. After the flush you can walk
the blocks and record their tree position (or maintain them with the
_augmented callbacks.)
Then each device full of possible outcomes can be described by the flush
event and a giant bitmap with a few bits { .written, .corrupt } for each
block version in the flush. Satisfy reads of a block by walking back
through the flushes. Blocks in the current flush look up their tree
position in the device state bitmap to find their fate. The most
recent dirty block in completed flushes is used, otherwise the backing
device is used if you're building from an existing known state.
Iterate over possible device states of write outcomes by adding bits
with carry in the giant bitmap. (complexity++ for using the bitmaps to
represent which of multiple versions of one block should be used..)
Something like that, anyway. Email is easy :).
It'd be interesting to see how far a simple prototype could go that
keeps everything in memory and has sane static limits on how much
history it tracks.
- z
--
dm-devel mailing list
dm-devel@xxxxxxxxxx
https://www.redhat.com/mailman/listinfo/dm-devel
