projects / linux-2.6-block.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 92681ec) | patch
blk-merge: compute bio->bi_seg_front_size efficiently
authorMing Lei <ming.lei@redhat.com>
Mon, 18 Dec 2017 12:22:14 +0000 (20:22 +0800)
committerJens Axboe <axboe@kernel.dk>
Sat, 6 Jan 2018 16:18:00 +0000 (09:18 -0700)
commit6a501bf0807b5dc024fe52a4f956800a352c39ab
treecc869dfac6aaf6205896fd1e2adf9631f4d75b70tree | snapshot
parent92681eca6104d2ec2fdf9fc65f529deb226ab0a1commit | diff
blk-merge: compute bio->bi_seg_front_size efficiently

It is enough to check and compute bio->bi_seg_front_size just
after the 1st segment is found, but current code checks that
for each bvec, which is inefficient.

This patch follows the way in  __blk_recalc_rq_segments()
for computing bio->bi_seg_front_size, and it is more efficient
and code becomes more readable too.

Signed-off-by: Ming Lei <ming.lei@redhat.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
block/blk-merge.c diff | blob | blame | history
Linux 6.x block layer and io_uring tree(s)