aboutsummaryrefslogtreecommitdiffstats
path: root/fs/gfs2/incore.h
diff options
context:
space:
mode:
authorSteven Whitehouse <swhiteho@redhat.com>2006-09-12 10:10:01 -0400
committerSteven Whitehouse <swhiteho@redhat.com>2006-09-12 10:10:01 -0400
commitb6397893a5ed81970e803d61ee2f1a0e79f87438 (patch)
tree88b1f9fe213b70f0c4d96583bb40601d9cfc446d /fs/gfs2/incore.h
parent[GFS2] Rewrite of examine_bucket() (diff)
downloadlinux-dev-b6397893a5ed81970e803d61ee2f1a0e79f87438.tar.xz
linux-dev-b6397893a5ed81970e803d61ee2f1a0e79f87438.zip
[GFS2] Use hlist for glock hash chains
This results in smaller list heads, so that we can have more chains in the same amount of memory (twice as many). I've multiplied the size of the table by four though - this is because we are saving memory by not having one lock per chain any more. So we land up using about the same amount of memory for the hash table as we did before I started these changes, the difference being that we now have four times as many hash chains. The reason that I say "about the same amount of memory" is that the actual amount now depends upon the NR_CPUS and some of the config variables, so that its not exact and in some cases we do use more memory. Eventually we might want to scale the hash table size according to the size of physical ram as measured on module load. Signed-off-by: Steven Whitehouse <swhiteho@redhat.com>
Diffstat (limited to 'fs/gfs2/incore.h')
-rw-r--r--fs/gfs2/incore.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/fs/gfs2/incore.h b/fs/gfs2/incore.h
index 1fed8d1abae5..c68d39271ede 100644
--- a/fs/gfs2/incore.h
+++ b/fs/gfs2/incore.h
@@ -161,7 +161,7 @@ enum {
};
struct gfs2_glock {
- struct list_head gl_list;
+ struct hlist_node gl_list;
unsigned long gl_flags; /* GLF_... */
struct lm_lockname gl_name;
struct kref gl_ref;