| commit | 1f466a47e8a3a3e3b527b3285c7b9c8a837fb7ec | |
| author | Bob Peterson <rpeterso@redhat.com> | |
| Mon, 10 Mar 2008 23:17:47 +0000 (10 18:17 -0500) | ||
| committer | Steven Whitehouse <swhiteho@redhat.com> | |
| Mon, 31 Mar 2008 09:41:39 +0000 (31 10:41 +0100) | ||
| tree | 355f6084118d4ee9a986e07e5154eaa0e25b834a | treesnapshot (tar.gz zip) |
| parent | d82661d96993ac4efc1d54259ea85ffcd9b8bec6 | commitdiff |
[GFS2] Faster gfs2_bitfit algorithm
This version of the gfs2_bitfit algorithm includes the latest
suggestions from Steve Whitehouse. It is typically eight to
ten times faster than the version we're using today. If there
is a lot of metadata mixed in (lots of small files) the
algorithm is often 15 times faster, and given the right
conditions, I've seen peaks of 20 times faster.
Signed-off-by: Bob Peterson <rpeterso@redhat.com>
Signed-off-by: Steven Whitehouse <swhiteho@redhat.com>
This version of the gfs2_bitfit algorithm includes the latest
suggestions from Steve Whitehouse. It is typically eight to
ten times faster than the version we're using today. If there
is a lot of metadata mixed in (lots of small files) the
algorithm is often 15 times faster, and given the right
conditions, I've seen peaks of 20 times faster.
Signed-off-by: Bob Peterson <rpeterso@redhat.com>
Signed-off-by: Steven Whitehouse <swhiteho@redhat.com>
| fs/gfs2/rgrp.c | diffblobblamehistory |