2010-04-28 13:55:08 +00:00
|
|
|
/*
|
|
|
|
* Functions related to generic helpers functions
|
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/bio.h>
|
|
|
|
#include <linux/blkdev.h>
|
|
|
|
#include <linux/scatterlist.h>
|
|
|
|
|
|
|
|
#include "blk.h"
|
|
|
|
|
2011-05-07 01:26:27 +00:00
|
|
|
struct bio_batch {
|
|
|
|
atomic_t done;
|
|
|
|
unsigned long flags;
|
|
|
|
struct completion *wait;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void bio_batch_end_io(struct bio *bio, int err)
|
2010-04-28 13:55:08 +00:00
|
|
|
{
|
2011-05-07 01:26:27 +00:00
|
|
|
struct bio_batch *bb = bio->bi_private;
|
|
|
|
|
2011-05-07 01:30:01 +00:00
|
|
|
if (err && (err != -EOPNOTSUPP))
|
2011-05-07 01:26:27 +00:00
|
|
|
clear_bit(BIO_UPTODATE, &bb->flags);
|
|
|
|
if (atomic_dec_and_test(&bb->done))
|
|
|
|
complete(bb->wait);
|
2010-04-28 13:55:08 +00:00
|
|
|
bio_put(bio);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* blkdev_issue_discard - queue a discard
|
|
|
|
* @bdev: blockdev to issue discard for
|
|
|
|
* @sector: start sector
|
|
|
|
* @nr_sects: number of sectors to discard
|
|
|
|
* @gfp_mask: memory allocation flags (for bio_alloc)
|
|
|
|
* @flags: BLKDEV_IFL_* flags to control behaviour
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Issue a discard request for the sectors in question.
|
|
|
|
*/
|
|
|
|
int blkdev_issue_discard(struct block_device *bdev, sector_t sector,
|
|
|
|
sector_t nr_sects, gfp_t gfp_mask, unsigned long flags)
|
|
|
|
{
|
|
|
|
DECLARE_COMPLETION_ONSTACK(wait);
|
|
|
|
struct request_queue *q = bdev_get_queue(bdev);
|
2010-08-18 09:29:22 +00:00
|
|
|
int type = REQ_WRITE | REQ_DISCARD;
|
2010-07-15 16:49:31 +00:00
|
|
|
unsigned int max_discard_sectors;
|
block: split discard into aligned requests
When a disk has large discard_granularity and small max_discard_sectors,
discards are not split with optimal alignment. In the limit case of
discard_granularity == max_discard_sectors, no request could be aligned
correctly, so in fact you might end up with no discarded logical blocks
at all.
Another example that helps showing the condition in the patch is with
discard_granularity == 64, max_discard_sectors == 128. A request that is
submitted for 256 sectors 2..257 will be split in two: 2..129, 130..257.
However, only 2 aligned blocks out of 3 are included in the request;
128..191 may be left intact and not discarded. With this patch, the
first request will be truncated to ensure good alignment of what's left,
and the split will be 2..127, 128..255, 256..257. The patch will also
take into account the discard_alignment.
At most one extra request will be introduced, because the first request
will be reduced by at most granularity-1 sectors, and granularity
must be less than max_discard_sectors. Subsequent requests will run
on round_down(max_discard_sectors, granularity) sectors, as in the
current code.
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
Acked-by: Vivek Goyal <vgoyal@redhat.com>
Tested-by: Mike Snitzer <snitzer@redhat.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2012-08-02 07:48:50 +00:00
|
|
|
unsigned int granularity, alignment, mask;
|
2011-05-07 01:26:27 +00:00
|
|
|
struct bio_batch bb;
|
2010-04-28 13:55:08 +00:00
|
|
|
struct bio *bio;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (!q)
|
|
|
|
return -ENXIO;
|
|
|
|
|
|
|
|
if (!blk_queue_discard(q))
|
|
|
|
return -EOPNOTSUPP;
|
|
|
|
|
2012-08-02 07:48:49 +00:00
|
|
|
/* Zero-sector (unknown) and one-sector granularities are the same. */
|
|
|
|
granularity = max(q->limits.discard_granularity >> 9, 1U);
|
block: split discard into aligned requests
When a disk has large discard_granularity and small max_discard_sectors,
discards are not split with optimal alignment. In the limit case of
discard_granularity == max_discard_sectors, no request could be aligned
correctly, so in fact you might end up with no discarded logical blocks
at all.
Another example that helps showing the condition in the patch is with
discard_granularity == 64, max_discard_sectors == 128. A request that is
submitted for 256 sectors 2..257 will be split in two: 2..129, 130..257.
However, only 2 aligned blocks out of 3 are included in the request;
128..191 may be left intact and not discarded. With this patch, the
first request will be truncated to ensure good alignment of what's left,
and the split will be 2..127, 128..255, 256..257. The patch will also
take into account the discard_alignment.
At most one extra request will be introduced, because the first request
will be reduced by at most granularity-1 sectors, and granularity
must be less than max_discard_sectors. Subsequent requests will run
on round_down(max_discard_sectors, granularity) sectors, as in the
current code.
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
Acked-by: Vivek Goyal <vgoyal@redhat.com>
Tested-by: Mike Snitzer <snitzer@redhat.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2012-08-02 07:48:50 +00:00
|
|
|
mask = granularity - 1;
|
|
|
|
alignment = (bdev_discard_alignment(bdev) >> 9) & mask;
|
2012-08-02 07:48:49 +00:00
|
|
|
|
2010-07-15 16:49:31 +00:00
|
|
|
/*
|
|
|
|
* Ensure that max_discard_sectors is of the proper
|
block: split discard into aligned requests
When a disk has large discard_granularity and small max_discard_sectors,
discards are not split with optimal alignment. In the limit case of
discard_granularity == max_discard_sectors, no request could be aligned
correctly, so in fact you might end up with no discarded logical blocks
at all.
Another example that helps showing the condition in the patch is with
discard_granularity == 64, max_discard_sectors == 128. A request that is
submitted for 256 sectors 2..257 will be split in two: 2..129, 130..257.
However, only 2 aligned blocks out of 3 are included in the request;
128..191 may be left intact and not discarded. With this patch, the
first request will be truncated to ensure good alignment of what's left,
and the split will be 2..127, 128..255, 256..257. The patch will also
take into account the discard_alignment.
At most one extra request will be introduced, because the first request
will be reduced by at most granularity-1 sectors, and granularity
must be less than max_discard_sectors. Subsequent requests will run
on round_down(max_discard_sectors, granularity) sectors, as in the
current code.
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
Acked-by: Vivek Goyal <vgoyal@redhat.com>
Tested-by: Mike Snitzer <snitzer@redhat.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2012-08-02 07:48:50 +00:00
|
|
|
* granularity, so that requests stay aligned after a split.
|
2010-07-15 16:49:31 +00:00
|
|
|
*/
|
|
|
|
max_discard_sectors = min(q->limits.max_discard_sectors, UINT_MAX >> 9);
|
2012-08-02 07:48:49 +00:00
|
|
|
max_discard_sectors = round_down(max_discard_sectors, granularity);
|
2011-07-23 18:34:59 +00:00
|
|
|
if (unlikely(!max_discard_sectors)) {
|
2011-07-06 19:30:50 +00:00
|
|
|
/* Avoid infinite loop below. Being cautious never hurts. */
|
|
|
|
return -EOPNOTSUPP;
|
2010-07-15 16:49:31 +00:00
|
|
|
}
|
2010-04-28 13:55:08 +00:00
|
|
|
|
2010-09-16 18:51:46 +00:00
|
|
|
if (flags & BLKDEV_DISCARD_SECURE) {
|
2010-08-11 21:17:49 +00:00
|
|
|
if (!blk_queue_secdiscard(q))
|
|
|
|
return -EOPNOTSUPP;
|
2010-08-18 09:29:22 +00:00
|
|
|
type |= REQ_SECURE;
|
2010-08-11 21:17:49 +00:00
|
|
|
}
|
|
|
|
|
2011-05-07 01:26:27 +00:00
|
|
|
atomic_set(&bb.done, 1);
|
|
|
|
bb.flags = 1 << BIO_UPTODATE;
|
|
|
|
bb.wait = &wait;
|
|
|
|
|
|
|
|
while (nr_sects) {
|
block: split discard into aligned requests
When a disk has large discard_granularity and small max_discard_sectors,
discards are not split with optimal alignment. In the limit case of
discard_granularity == max_discard_sectors, no request could be aligned
correctly, so in fact you might end up with no discarded logical blocks
at all.
Another example that helps showing the condition in the patch is with
discard_granularity == 64, max_discard_sectors == 128. A request that is
submitted for 256 sectors 2..257 will be split in two: 2..129, 130..257.
However, only 2 aligned blocks out of 3 are included in the request;
128..191 may be left intact and not discarded. With this patch, the
first request will be truncated to ensure good alignment of what's left,
and the split will be 2..127, 128..255, 256..257. The patch will also
take into account the discard_alignment.
At most one extra request will be introduced, because the first request
will be reduced by at most granularity-1 sectors, and granularity
must be less than max_discard_sectors. Subsequent requests will run
on round_down(max_discard_sectors, granularity) sectors, as in the
current code.
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
Acked-by: Vivek Goyal <vgoyal@redhat.com>
Tested-by: Mike Snitzer <snitzer@redhat.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2012-08-02 07:48:50 +00:00
|
|
|
unsigned int req_sects;
|
|
|
|
sector_t end_sect;
|
|
|
|
|
2010-04-28 13:55:08 +00:00
|
|
|
bio = bio_alloc(gfp_mask, 1);
|
2010-06-18 14:59:42 +00:00
|
|
|
if (!bio) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
block: split discard into aligned requests
When a disk has large discard_granularity and small max_discard_sectors,
discards are not split with optimal alignment. In the limit case of
discard_granularity == max_discard_sectors, no request could be aligned
correctly, so in fact you might end up with no discarded logical blocks
at all.
Another example that helps showing the condition in the patch is with
discard_granularity == 64, max_discard_sectors == 128. A request that is
submitted for 256 sectors 2..257 will be split in two: 2..129, 130..257.
However, only 2 aligned blocks out of 3 are included in the request;
128..191 may be left intact and not discarded. With this patch, the
first request will be truncated to ensure good alignment of what's left,
and the split will be 2..127, 128..255, 256..257. The patch will also
take into account the discard_alignment.
At most one extra request will be introduced, because the first request
will be reduced by at most granularity-1 sectors, and granularity
must be less than max_discard_sectors. Subsequent requests will run
on round_down(max_discard_sectors, granularity) sectors, as in the
current code.
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
Acked-by: Vivek Goyal <vgoyal@redhat.com>
Tested-by: Mike Snitzer <snitzer@redhat.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2012-08-02 07:48:50 +00:00
|
|
|
req_sects = min_t(sector_t, nr_sects, max_discard_sectors);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If splitting a request, and the next starting sector would be
|
|
|
|
* misaligned, stop the discard at the previous aligned sector.
|
|
|
|
*/
|
|
|
|
end_sect = sector + req_sects;
|
|
|
|
if (req_sects < nr_sects && (end_sect & mask) != alignment) {
|
|
|
|
end_sect =
|
|
|
|
round_down(end_sect - alignment, granularity)
|
|
|
|
+ alignment;
|
|
|
|
req_sects = end_sect - sector;
|
|
|
|
}
|
|
|
|
|
2010-04-28 13:55:08 +00:00
|
|
|
bio->bi_sector = sector;
|
2011-05-07 01:26:27 +00:00
|
|
|
bio->bi_end_io = bio_batch_end_io;
|
2010-04-28 13:55:08 +00:00
|
|
|
bio->bi_bdev = bdev;
|
2011-05-07 01:26:27 +00:00
|
|
|
bio->bi_private = &bb;
|
2010-04-28 13:55:08 +00:00
|
|
|
|
block: split discard into aligned requests
When a disk has large discard_granularity and small max_discard_sectors,
discards are not split with optimal alignment. In the limit case of
discard_granularity == max_discard_sectors, no request could be aligned
correctly, so in fact you might end up with no discarded logical blocks
at all.
Another example that helps showing the condition in the patch is with
discard_granularity == 64, max_discard_sectors == 128. A request that is
submitted for 256 sectors 2..257 will be split in two: 2..129, 130..257.
However, only 2 aligned blocks out of 3 are included in the request;
128..191 may be left intact and not discarded. With this patch, the
first request will be truncated to ensure good alignment of what's left,
and the split will be 2..127, 128..255, 256..257. The patch will also
take into account the discard_alignment.
At most one extra request will be introduced, because the first request
will be reduced by at most granularity-1 sectors, and granularity
must be less than max_discard_sectors. Subsequent requests will run
on round_down(max_discard_sectors, granularity) sectors, as in the
current code.
Signed-off-by: Paolo Bonzini <pbonzini@redhat.com>
Acked-by: Vivek Goyal <vgoyal@redhat.com>
Tested-by: Mike Snitzer <snitzer@redhat.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2012-08-02 07:48:50 +00:00
|
|
|
bio->bi_size = req_sects << 9;
|
|
|
|
nr_sects -= req_sects;
|
|
|
|
sector = end_sect;
|
2010-04-28 13:55:08 +00:00
|
|
|
|
2011-05-07 01:26:27 +00:00
|
|
|
atomic_inc(&bb.done);
|
2010-04-28 13:55:08 +00:00
|
|
|
submit_bio(type, bio);
|
2011-05-07 01:26:27 +00:00
|
|
|
}
|
2010-04-28 13:55:08 +00:00
|
|
|
|
2011-05-07 01:26:27 +00:00
|
|
|
/* Wait for bios in-flight */
|
|
|
|
if (!atomic_dec_and_test(&bb.done))
|
2010-09-16 18:51:46 +00:00
|
|
|
wait_for_completion(&wait);
|
2010-04-28 13:55:08 +00:00
|
|
|
|
2011-05-07 01:30:01 +00:00
|
|
|
if (!test_bit(BIO_UPTODATE, &bb.flags))
|
2011-05-07 01:26:27 +00:00
|
|
|
ret = -EIO;
|
2010-06-18 14:59:42 +00:00
|
|
|
|
2010-04-28 13:55:08 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blkdev_issue_discard);
|
2010-04-28 13:55:09 +00:00
|
|
|
|
2012-09-18 16:19:27 +00:00
|
|
|
/**
|
|
|
|
* blkdev_issue_write_same - queue a write same operation
|
|
|
|
* @bdev: target blockdev
|
|
|
|
* @sector: start sector
|
|
|
|
* @nr_sects: number of sectors to write
|
|
|
|
* @gfp_mask: memory allocation flags (for bio_alloc)
|
|
|
|
* @page: page containing data to write
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Issue a write same request for the sectors in question.
|
|
|
|
*/
|
|
|
|
int blkdev_issue_write_same(struct block_device *bdev, sector_t sector,
|
|
|
|
sector_t nr_sects, gfp_t gfp_mask,
|
|
|
|
struct page *page)
|
|
|
|
{
|
|
|
|
DECLARE_COMPLETION_ONSTACK(wait);
|
|
|
|
struct request_queue *q = bdev_get_queue(bdev);
|
|
|
|
unsigned int max_write_same_sectors;
|
|
|
|
struct bio_batch bb;
|
|
|
|
struct bio *bio;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (!q)
|
|
|
|
return -ENXIO;
|
|
|
|
|
|
|
|
max_write_same_sectors = q->limits.max_write_same_sectors;
|
|
|
|
|
|
|
|
if (max_write_same_sectors == 0)
|
|
|
|
return -EOPNOTSUPP;
|
|
|
|
|
|
|
|
atomic_set(&bb.done, 1);
|
|
|
|
bb.flags = 1 << BIO_UPTODATE;
|
|
|
|
bb.wait = &wait;
|
|
|
|
|
|
|
|
while (nr_sects) {
|
|
|
|
bio = bio_alloc(gfp_mask, 1);
|
|
|
|
if (!bio) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
bio->bi_sector = sector;
|
|
|
|
bio->bi_end_io = bio_batch_end_io;
|
|
|
|
bio->bi_bdev = bdev;
|
|
|
|
bio->bi_private = &bb;
|
|
|
|
bio->bi_vcnt = 1;
|
|
|
|
bio->bi_io_vec->bv_page = page;
|
|
|
|
bio->bi_io_vec->bv_offset = 0;
|
|
|
|
bio->bi_io_vec->bv_len = bdev_logical_block_size(bdev);
|
|
|
|
|
|
|
|
if (nr_sects > max_write_same_sectors) {
|
|
|
|
bio->bi_size = max_write_same_sectors << 9;
|
|
|
|
nr_sects -= max_write_same_sectors;
|
|
|
|
sector += max_write_same_sectors;
|
|
|
|
} else {
|
|
|
|
bio->bi_size = nr_sects << 9;
|
|
|
|
nr_sects = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
atomic_inc(&bb.done);
|
|
|
|
submit_bio(REQ_WRITE | REQ_WRITE_SAME, bio);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Wait for bios in-flight */
|
|
|
|
if (!atomic_dec_and_test(&bb.done))
|
|
|
|
wait_for_completion(&wait);
|
|
|
|
|
|
|
|
if (!test_bit(BIO_UPTODATE, &bb.flags))
|
|
|
|
ret = -ENOTSUPP;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blkdev_issue_write_same);
|
|
|
|
|
2010-04-28 13:55:09 +00:00
|
|
|
/**
|
2011-03-01 18:45:24 +00:00
|
|
|
* blkdev_issue_zeroout - generate number of zero filed write bios
|
2010-04-28 13:55:09 +00:00
|
|
|
* @bdev: blockdev to issue
|
|
|
|
* @sector: start sector
|
|
|
|
* @nr_sects: number of sectors to write
|
|
|
|
* @gfp_mask: memory allocation flags (for bio_alloc)
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Generate and issue number of bios with zerofiled pages.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int blkdev_issue_zeroout(struct block_device *bdev, sector_t sector,
|
2010-09-16 18:51:46 +00:00
|
|
|
sector_t nr_sects, gfp_t gfp_mask)
|
2010-04-28 13:55:09 +00:00
|
|
|
{
|
2010-08-06 11:23:25 +00:00
|
|
|
int ret;
|
2010-04-28 13:55:09 +00:00
|
|
|
struct bio *bio;
|
|
|
|
struct bio_batch bb;
|
2011-03-11 09:23:53 +00:00
|
|
|
unsigned int sz;
|
2010-04-28 13:55:09 +00:00
|
|
|
DECLARE_COMPLETION_ONSTACK(wait);
|
|
|
|
|
2011-03-11 09:23:53 +00:00
|
|
|
atomic_set(&bb.done, 1);
|
2010-04-28 13:55:09 +00:00
|
|
|
bb.flags = 1 << BIO_UPTODATE;
|
|
|
|
bb.wait = &wait;
|
|
|
|
|
2010-08-06 11:23:25 +00:00
|
|
|
ret = 0;
|
2010-04-28 13:55:09 +00:00
|
|
|
while (nr_sects != 0) {
|
|
|
|
bio = bio_alloc(gfp_mask,
|
|
|
|
min(nr_sects, (sector_t)BIO_MAX_PAGES));
|
2010-08-06 11:23:25 +00:00
|
|
|
if (!bio) {
|
|
|
|
ret = -ENOMEM;
|
2010-04-28 13:55:09 +00:00
|
|
|
break;
|
2010-08-06 11:23:25 +00:00
|
|
|
}
|
2010-04-28 13:55:09 +00:00
|
|
|
|
|
|
|
bio->bi_sector = sector;
|
|
|
|
bio->bi_bdev = bdev;
|
|
|
|
bio->bi_end_io = bio_batch_end_io;
|
2010-09-16 18:51:46 +00:00
|
|
|
bio->bi_private = &bb;
|
2010-04-28 13:55:09 +00:00
|
|
|
|
2010-04-29 07:28:21 +00:00
|
|
|
while (nr_sects != 0) {
|
|
|
|
sz = min((sector_t) PAGE_SIZE >> 9 , nr_sects);
|
2010-04-28 13:55:09 +00:00
|
|
|
ret = bio_add_page(bio, ZERO_PAGE(0), sz << 9, 0);
|
|
|
|
nr_sects -= ret >> 9;
|
|
|
|
sector += ret >> 9;
|
|
|
|
if (ret < (sz << 9))
|
|
|
|
break;
|
|
|
|
}
|
2010-08-06 11:23:25 +00:00
|
|
|
ret = 0;
|
2011-03-11 09:23:53 +00:00
|
|
|
atomic_inc(&bb.done);
|
2010-04-28 13:55:09 +00:00
|
|
|
submit_bio(WRITE, bio);
|
|
|
|
}
|
|
|
|
|
2010-09-16 18:51:46 +00:00
|
|
|
/* Wait for bios in-flight */
|
2011-03-11 09:23:53 +00:00
|
|
|
if (!atomic_dec_and_test(&bb.done))
|
2010-09-16 18:51:46 +00:00
|
|
|
wait_for_completion(&wait);
|
2010-04-28 13:55:09 +00:00
|
|
|
|
|
|
|
if (!test_bit(BIO_UPTODATE, &bb.flags))
|
|
|
|
/* One of bios in the batch was completed with error.*/
|
|
|
|
ret = -EIO;
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(blkdev_issue_zeroout);
|