diff options
author | Steven Whitehouse <swhiteho@redhat.com> | 2006-09-18 17:18:23 -0400 |
---|---|---|
committer | Steven Whitehouse <swhiteho@redhat.com> | 2006-09-18 17:18:23 -0400 |
commit | 7a6bbacbb8dec6fbd1242c959250388f907d429e (patch) | |
tree | 8e314f0b3fd6e54154562c0a9b20173d539470a2 /fs/gfs2/recovery.c | |
parent | 65952fb4e91c159d253bd28ceaf028a86dbb0b02 (diff) |
[GFS2] Map multiple blocks at once where possible
This is a tidy up of the GFS2 bmap code. The main change is that the
bh is passed to gfs2_block_map allowing the flags to be set directly
rather than having to repeat that code several times in ops_address.c.
At the same time, the extent mapping code from gfs2_extent_map has
been moved into gfs2_block_map. This allows all calls to gfs2_block_map
to map extents in the case that no allocation is taking place. As a
result reads and non-allocating writes should be faster. A quick test
with postmark appears to support this.
There is a limit on the number of blocks mapped in a single bmap
call in that it will only ever map blocks which are pointed to
from a single pointer block. So in other words, it will never try
to do additional i/o in order to satisfy read-ahead. The maximum
number of blocks is thus somewhat less than 512 (the GFS2 4k block
size minus the header divided by sizeof(u64)). I've further limited
the mapping of "normal" blocks to 32 blocks (to avoid extra work)
since readpages() will currently read a maximum of 32 blocks ahead (128k).
Some further work will probably be needed to set a suitable value
for DIO as well, but for now thats left at the maximum 512 (see
ops_address.c:gfs2_get_block_direct).
There is probably a lot more that can be done to improve bmap for GFS2,
but this is a good first step.
Signed-off-by: Steven Whitehouse <swhiteho@redhat.com>
Diffstat (limited to 'fs/gfs2/recovery.c')
-rw-r--r-- | fs/gfs2/recovery.c | 10 |
1 files changed, 4 insertions, 6 deletions
diff --git a/fs/gfs2/recovery.c b/fs/gfs2/recovery.c index a27569c5d85e..130e9fbf9692 100644 --- a/fs/gfs2/recovery.c +++ b/fs/gfs2/recovery.c | |||
@@ -369,25 +369,23 @@ static int clean_journal(struct gfs2_jdesc *jd, struct gfs2_log_header *head) | |||
369 | struct gfs2_inode *ip = GFS2_I(jd->jd_inode); | 369 | struct gfs2_inode *ip = GFS2_I(jd->jd_inode); |
370 | struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode); | 370 | struct gfs2_sbd *sdp = GFS2_SB(jd->jd_inode); |
371 | unsigned int lblock; | 371 | unsigned int lblock; |
372 | int new = 0; | ||
373 | u64 dblock; | ||
374 | struct gfs2_log_header *lh; | 372 | struct gfs2_log_header *lh; |
375 | u32 hash; | 373 | u32 hash; |
376 | struct buffer_head *bh; | 374 | struct buffer_head *bh; |
377 | int error; | 375 | int error; |
378 | int boundary; | 376 | struct buffer_head bh_map; |
379 | 377 | ||
380 | lblock = head->lh_blkno; | 378 | lblock = head->lh_blkno; |
381 | gfs2_replay_incr_blk(sdp, &lblock); | 379 | gfs2_replay_incr_blk(sdp, &lblock); |
382 | error = gfs2_block_map(&ip->i_inode, lblock, &new, &dblock, &boundary); | 380 | error = gfs2_block_map(&ip->i_inode, lblock, 0, &bh_map, 1); |
383 | if (error) | 381 | if (error) |
384 | return error; | 382 | return error; |
385 | if (!dblock) { | 383 | if (!bh_map.b_blocknr) { |
386 | gfs2_consist_inode(ip); | 384 | gfs2_consist_inode(ip); |
387 | return -EIO; | 385 | return -EIO; |
388 | } | 386 | } |
389 | 387 | ||
390 | bh = sb_getblk(sdp->sd_vfs, dblock); | 388 | bh = sb_getblk(sdp->sd_vfs, bh_map.b_blocknr); |
391 | lock_buffer(bh); | 389 | lock_buffer(bh); |
392 | memset(bh->b_data, 0, bh->b_size); | 390 | memset(bh->b_data, 0, bh->b_size); |
393 | set_buffer_uptodate(bh); | 391 | set_buffer_uptodate(bh); |