diff options
| author | Jeff Mahoney <jeffm@suse.com> | 2006-09-30 23:28:45 -0700 |
|---|---|---|
| committer | Linus Torvalds <torvalds@g5.osdl.org> | 2006-10-01 00:39:28 -0700 |
| commit | 9ea0f9499d15c49df23e7aac4332d830c40e12d0 (patch) | |
| tree | e6a68575b3aa3a6ee0db0acf1c6469c0308bf0a7 /net/compat.c | |
| parent | 5a2618e6a972f305496daa257a56a09dd3acca29 (diff) | |
| download | kernel_samsung_espresso10-9ea0f9499d15c49df23e7aac4332d830c40e12d0.zip kernel_samsung_espresso10-9ea0f9499d15c49df23e7aac4332d830c40e12d0.tar.gz kernel_samsung_espresso10-9ea0f9499d15c49df23e7aac4332d830c40e12d0.tar.bz2 | |
[PATCH] reiserfs: eliminate minimum window size for bitmap searching
When a file system becomes fragmented (using MythTV, for example), the
bigalloc window searching ends up causing huge performance problems. In a
file system presented by a user experiencing this bug, the file system was
90% free, but no 32-block free windows existed on the entire file system.
This causes the allocator to scan the entire file system for each 128k
write before backing down to searching for individual blocks.
In the end, finding a contiguous window for all the blocks in a write is an
advantageous special case, but one that can be found naturally when such a
window exists anyway.
This patch removes the bigalloc window searching, and has been proven to
fix the test case described above.
Signed-off-by: Jeff Mahoney <jeffm@suse.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Diffstat (limited to 'net/compat.c')
0 files changed, 0 insertions, 0 deletions