Re: [patch 6/7 v2] MD: raid5 trim support

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



On Mon, 13 Aug 2012 13:43:47 +0800 Shaohua Li <shli@xxxxxxxxxx> wrote:

> On Mon, Aug 13, 2012 at 01:58:31PM +1000, NeilBrown wrote:
> > On Mon, 13 Aug 2012 10:04:54 +0800 Shaohua Li <shli@xxxxxxxxxx> wrote:
> > 
> > > On Mon, Aug 13, 2012 at 11:50:51AM +1000, NeilBrown wrote:
> > > > On Fri, 10 Aug 2012 10:51:19 +0800 Shaohua Li <shli@xxxxxxxxxxxx> wrote:
> > > > 
> > > > > @@ -4094,6 +4159,19 @@ static void make_request(struct mddev *m
> > > > >  	bi->bi_next = NULL;
> > > > >  	bi->bi_phys_segments = 1;	/* over-loaded to count active stripes */
> > > > >  
> > > > > +	/* block layer doesn't correctly do alignment even we set correct alignment */
> > > > > +	if (unlikely(bi->bi_rw & REQ_DISCARD)) {
> > > > > +		int stripe_sectors = conf->chunk_sectors *
> > > > > +			(conf->raid_disks - conf->max_degraded);
> > > > 
> > > > This isn't right when an array is being reshaped.
> > > > I suspect that during a reshape we should only attempt DISCARD on the part of
> > > > the array which has already been reshaped.  On the other section we can
> > > > either fail the discard (is that a good idea?) or write zeros.
> > > 
> > > I had a check in below for-loop for reshape, is it enough? If not, I'd like
> > > just ignore discard request for reshape. We force discard_zero_data to be 0, so
> > > should be ok.
> > 
> > Yes, you are right - that is sufficient.  I hadn't read it properly.
> > 
> > > 
> > > I'll fix other two issues. Will repost the raid5 discard patches later.
> 
> Here is the updated version. Last patch can still be applied cleanly.
> 
> 
> Subject: MD: raid5 trim support
> 
> Discard for raid4/5/6 has limitation. If discard request size is small, we do
> discard for one disk, but we need calculate parity and write parity disk.  To
> correctly calculate parity, zero_after_discard must be guaranteed. Even it's
> true, we need do discard for one disk but write another disks, which makes the
> parity disks wear out fast. This doesn't make sense. So an efficient discard
> for raid4/5/6 should discard all data disks and parity disks, which requires
> the write pattern to be (A, A+chunk_size, A+chunk_size*2...). If A's size is
> smaller than chunk_size, such pattern is almost impossible in practice. So in
> this patch, I only handle the case that A's size equals to chunk_size. That is
> discard request should be aligned to stripe size and its size is multiple of
> stripe size.
> 
> Since we can only handle request with specific alignment and size (or part of
> the request fitting stripes), we can't guarantee zero_after_discard even
> zero_after_discard is true in low level drives.
> 
> The block layer doesn't send down correctly aligned requests even correct
> discard alignment is set, so I must filter out.
> 
> For raid4/5/6 parity calculation, if data is 0, parity is 0. So if
> zero_after_discard is true for all disks, data is consistent after discard.
> Otherwise, data might be lost. Let's consider a scenario: discard a stripe,
> write data to one disk and write parity disk. The stripe could be still
> inconsistent till then depending on using data from other data disks or parity
> disks to calculate new parity. If the disk is broken, we can't restore it. So
> in this patch, we only enable discard support if all disks have
> zero_after_discard.
> 
> If discard fails in one disk, we face the similar inconsistent issue above. The
> patch will make discard follow the same path as normal write request. If
> discard fails, a resync will be scheduled to make the data consistent. This
> isn't good to have extra writes, but data consistency is important.
> 
> If a subsequent read/write request hits raid5 cache of a discarded stripe, the
> discarded dev page should have zero filled, so the data is consistent. This
> patch will always zero dev page for discarded request stripe. This isn't
> optimal because discard request doesn't need such payload. Next patch will
> avoid it.
> 
> Signed-off-by: Shaohua Li <shli@xxxxxxxxxxxx>
> ---
>  drivers/md/raid5.c |  135 +++++++++++++++++++++++++++++++++++++++++++++++++++--
>  drivers/md/raid5.h |    1 
>  2 files changed, 132 insertions(+), 4 deletions(-)
> 
> Index: linux/drivers/md/raid5.c
> ===================================================================
> --- linux.orig/drivers/md/raid5.c	2012-08-13 10:25:22.325095834 +0800
> +++ linux/drivers/md/raid5.c	2012-08-13 12:01:28.628603083 +0800
> @@ -547,6 +547,8 @@ static void ops_run_io(struct stripe_hea
>  				rw = WRITE_FUA;
>  			else
>  				rw = WRITE;
> +			if (test_and_clear_bit(R5_Discard, &sh->dev[i].flags))
> +				rw |= REQ_DISCARD;
>  		} else if (test_and_clear_bit(R5_Wantread, &sh->dev[i].flags))
>  			rw = READ;
>  		else if (test_and_clear_bit(R5_WantReplace,
> @@ -1170,8 +1172,13 @@ ops_run_biodrain(struct stripe_head *sh,
>  					set_bit(R5_WantFUA, &dev->flags);
>  				if (wbi->bi_rw & REQ_SYNC)
>  					set_bit(R5_SyncIO, &dev->flags);
> -				tx = async_copy_data(1, wbi, dev->page,
> -					dev->sector, tx);
> +				if (wbi->bi_rw & REQ_DISCARD) {
> +					memset(page_address(dev->page), 0,
> +						STRIPE_SECTORS << 9);
> +					set_bit(R5_Discard, &dev->flags);
> +				} else
> +					tx = async_copy_data(1, wbi, dev->page,
> +						dev->sector, tx);
>  				wbi = r5_next_bio(wbi, dev->sector);
>  			}
>  		}
> @@ -1237,6 +1244,20 @@ ops_run_reconstruct5(struct stripe_head
>  	pr_debug("%s: stripe %llu\n", __func__,
>  		(unsigned long long)sh->sector);
>  
> +	for (i = 0; i < sh->disks; i++) {
> +		if (pd_idx == i)
> +			continue;
> +		if (!test_bit(R5_Discard, &sh->dev[i].flags))
> +			break;
> +	}
> +	if (i >= sh->disks) {
> +		atomic_inc(&sh->count);
> +		memset(page_address(sh->dev[pd_idx].page), 0,
> +			STRIPE_SECTORS << 9);
> +		set_bit(R5_Discard, &sh->dev[pd_idx].flags);
> +		ops_complete_reconstruct(sh);
> +		return;
> +	}
>  	/* check if prexor is active which means only process blocks
>  	 * that are part of a read-modify-write (written)
>  	 */
> @@ -1281,10 +1302,28 @@ ops_run_reconstruct6(struct stripe_head
>  {
>  	struct async_submit_ctl submit;
>  	struct page **blocks = percpu->scribble;
> -	int count;
> +	int count, i;
>  
>  	pr_debug("%s: stripe %llu\n", __func__, (unsigned long long)sh->sector);
>  
> +	for (i = 0; i < sh->disks; i++) {
> +		if (sh->pd_idx == i || sh->qd_idx == i)
> +			continue;
> +		if (!test_bit(R5_Discard, &sh->dev[i].flags))
> +			break;
> +	}
> +	if (i >= sh->disks) {
> +		atomic_inc(&sh->count);
> +		memset(page_address(sh->dev[sh->pd_idx].page), 0,
> +			STRIPE_SECTORS << 9);
> +		memset(page_address(sh->dev[sh->qd_idx].page), 0,
> +			STRIPE_SECTORS << 9);
> +		set_bit(R5_Discard, &sh->dev[sh->pd_idx].flags);
> +		set_bit(R5_Discard, &sh->dev[sh->qd_idx].flags);
> +		ops_complete_reconstruct(sh);
> +		return;
> +	}
> +
>  	count = set_syndrome_sources(blocks, sh);
>  
>  	atomic_inc(&sh->count);
> @@ -2353,7 +2392,7 @@ schedule_reconstruction(struct stripe_he
>   */
>  static int add_stripe_bio(struct stripe_head *sh, struct bio *bi, int dd_idx, int forwrite)
>  {
> -	struct bio **bip;
> +	struct bio **bip, *orig_bi = bi;
>  	struct r5conf *conf = sh->raid_conf;
>  	int firstwrite=0;
>  
> @@ -2370,6 +2409,23 @@ static int add_stripe_bio(struct stripe_
>  	 * protect it.
>  	 */
>  	spin_lock_irq(&sh->stripe_lock);
> +
> +	if (bi->bi_rw & REQ_DISCARD) {
> +		int i;
> +		dd_idx = -1;
> +		for (i = 0; i < sh->disks; i++) {
> +			if (i == sh->pd_idx || i == sh->qd_idx)
> +				continue;
> +			if (dd_idx == -1)
> +				dd_idx = i;
> +			if (sh->dev[i].towrite) {
> +				dd_idx = i;
> +				goto overlap;
> +			}
> +		}
> +	}
> +
> +again:
>  	if (forwrite) {
>  		bip = &sh->dev[dd_idx].towrite;
>  		if (*bip == NULL)
> @@ -2403,6 +2459,15 @@ static int add_stripe_bio(struct stripe_
>  		if (sector >= sh->dev[dd_idx].sector + STRIPE_SECTORS)
>  			set_bit(R5_OVERWRITE, &sh->dev[dd_idx].flags);
>  	}
> +
> +	bi = orig_bi;
> +	if (bi->bi_rw & REQ_DISCARD) {
> +		dd_idx++;
> +		while (dd_idx == sh->pd_idx || dd_idx == sh->qd_idx)
> +			dd_idx++;
> +		if (dd_idx < sh->disks)
> +			goto again;
> +	}

I'm afraid there there is something else here that I can't make my self happy
with.

You added a new "goto again" loop inside add_stripe_bio, and to compensate
the increase logical_sector in make_request so that it doesn't call
add_stripe_bio so many times.
This means that to control flow between make_request and add_stripe_bio is
very different depending on whether it is a discard or not.  That make the
code harder to understand and easier to break later.

I think it would to create a completely separate "make_trim_request()" which
handles the trim/discard case, and leave the current code as it is.

If/when you do send a patch to do that, please also resend the other raid5
patch which comes after this one.  I tend not to keep patches once I've
devices not to apply them immediately.  It also reduces the chance of
confusion if you just send whatever you want me to apply.

Thanks,
NeilBrown

Attachment: signature.asc
Description: PGP signature


[Index of Archives]     [Linux RAID Wiki]     [ATA RAID]     [Linux SCSI Target Infrastructure]     [Linux Block]     [Linux IDE]     [Linux SCSI]     [Linux Hams]     [Device Mapper]     [Device Mapper Cryptographics]     [Kernel]     [Linux Admin]     [Linux Net]     [GFS]     [RPM]     [git]     [Yosemite Forum]


  Powered by Linux