diff options
author | Christoph Hellwig <hch@lst.de> | 2019-02-28 11:00:18 -0500 |
---|---|---|
committer | Jens Axboe <axboe@kernel.dk> | 2019-02-28 15:49:22 -0500 |
commit | 5b88a17cfdeba75e0092bab2c79aaf7d9e7db482 (patch) | |
tree | 9b4eb6248df2e42fa08c1138fa0c0ca49d48f35b | |
parent | 594b9a89af8e7629e95a4cd844d188361be32790 (diff) |
block: optimize bvec iteration in bvec_iter_advance
There is no need to only iterate in chunks of PAGE_SIZE or less in
bvec_iter_advance, given that the callers pass in the chunk length that
they are operating on - either that already is less than PAGE_SIZE
because they do classic page-based iteration, or it is larger because
the caller operates on multi-page bvecs.
This should help shaving off a few cycles of the I/O hot path.
Reviewed-by: Johannes Thumshirn <jthumshirn@suse.de>
Signed-off-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
-rw-r--r-- | include/linux/bvec.h | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/include/linux/bvec.h b/include/linux/bvec.h index 87e82e503a52..f6275c4da13a 100644 --- a/include/linux/bvec.h +++ b/include/linux/bvec.h | |||
@@ -112,14 +112,15 @@ static inline bool bvec_iter_advance(const struct bio_vec *bv, | |||
112 | } | 112 | } |
113 | 113 | ||
114 | while (bytes) { | 114 | while (bytes) { |
115 | unsigned iter_len = bvec_iter_len(bv, *iter); | 115 | const struct bio_vec *cur = bv + iter->bi_idx; |
116 | unsigned len = min(bytes, iter_len); | 116 | unsigned len = min3(bytes, iter->bi_size, |
117 | cur->bv_len - iter->bi_bvec_done); | ||
117 | 118 | ||
118 | bytes -= len; | 119 | bytes -= len; |
119 | iter->bi_size -= len; | 120 | iter->bi_size -= len; |
120 | iter->bi_bvec_done += len; | 121 | iter->bi_bvec_done += len; |
121 | 122 | ||
122 | if (iter->bi_bvec_done == __bvec_iter_bvec(bv, *iter)->bv_len) { | 123 | if (iter->bi_bvec_done == cur->bv_len) { |
123 | iter->bi_bvec_done = 0; | 124 | iter->bi_bvec_done = 0; |
124 | iter->bi_idx++; | 125 | iter->bi_idx++; |
125 | } | 126 | } |