diff options
author | Nikita Danilov <nikita@clusterfs.com> | 2005-06-25 17:59:20 -0400 |
---|---|---|
committer | Linus Torvalds <torvalds@ppc970.osdl.org> | 2005-06-25 19:25:07 -0400 |
commit | dfa1a55335a0e822b36607d25c980c4e2a8e5e87 (patch) | |
tree | 025dd9517b07cc2c52ef5109c3289ed01620323a /drivers/block | |
parent | 672c3fd9069e5a138f9d4afc9aeb5aa34aacce32 (diff) |
[PATCH] ll_merge_requests_fn() cleanup
ll_merge_requests_fn() assigns total_{phys,hw}_segments twice. Fix this
and a typo.
Signed-off-by: Nikita Danilov <nikita@clusterfs.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Diffstat (limited to 'drivers/block')
-rw-r--r-- | drivers/block/ll_rw_blk.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/drivers/block/ll_rw_blk.c b/drivers/block/ll_rw_blk.c index fc86d53fe783..60e64091de1b 100644 --- a/drivers/block/ll_rw_blk.c +++ b/drivers/block/ll_rw_blk.c | |||
@@ -1344,8 +1344,8 @@ static int ll_front_merge_fn(request_queue_t *q, struct request *req, | |||
1344 | static int ll_merge_requests_fn(request_queue_t *q, struct request *req, | 1344 | static int ll_merge_requests_fn(request_queue_t *q, struct request *req, |
1345 | struct request *next) | 1345 | struct request *next) |
1346 | { | 1346 | { |
1347 | int total_phys_segments = req->nr_phys_segments +next->nr_phys_segments; | 1347 | int total_phys_segments; |
1348 | int total_hw_segments = req->nr_hw_segments + next->nr_hw_segments; | 1348 | int total_hw_segments; |
1349 | 1349 | ||
1350 | /* | 1350 | /* |
1351 | * First check if the either of the requests are re-queued | 1351 | * First check if the either of the requests are re-queued |
@@ -1355,7 +1355,7 @@ static int ll_merge_requests_fn(request_queue_t *q, struct request *req, | |||
1355 | return 0; | 1355 | return 0; |
1356 | 1356 | ||
1357 | /* | 1357 | /* |
1358 | * Will it become to large? | 1358 | * Will it become too large? |
1359 | */ | 1359 | */ |
1360 | if ((req->nr_sectors + next->nr_sectors) > q->max_sectors) | 1360 | if ((req->nr_sectors + next->nr_sectors) > q->max_sectors) |
1361 | return 0; | 1361 | return 0; |