diff options
author | Nick Piggin <npiggin@kernel.dk> | 2011-01-07 01:49:49 -0500 |
---|---|---|
committer | Nick Piggin <npiggin@kernel.dk> | 2011-01-07 01:50:26 -0500 |
commit | fa0d7e3de6d6fc5004ad9dea0dd6b286af8f03e9 (patch) | |
tree | 203e0f73883e4c26b5597e36042386a1237dab35 /fs/nilfs2 | |
parent | 77812a1ef139d84270d27faacc0630c887411013 (diff) |
fs: icache RCU free inodes
RCU free the struct inode. This will allow:
- Subsequent store-free path walking patch. The inode must be consulted for
permissions when walking, so an RCU inode reference is a must.
- sb_inode_list_lock to be moved inside i_lock because sb list walkers who want
to take i_lock no longer need to take sb_inode_list_lock to walk the list in
the first place. This will simplify and optimize locking.
- Could remove some nested trylock loops in dcache code
- Could potentially simplify things a bit in VM land. Do not need to take the
page lock to follow page->mapping.
The downsides of this is the performance cost of using RCU. In a simple
creat/unlink microbenchmark, performance drops by about 10% due to inability to
reuse cache-hot slab objects. As iterations increase and RCU freeing starts
kicking over, this increases to about 20%.
In cases where inode lifetimes are longer (ie. many inodes may be allocated
during the average life span of a single inode), a lot of this cache reuse is
not applicable, so the regression caused by this patch is smaller.
The cache-hot regression could largely be avoided by using SLAB_DESTROY_BY_RCU,
however this adds some complexity to list walking and store-free path walking,
so I prefer to implement this at a later date, if it is shown to be a win in
real situations. I haven't found a regression in any non-micro benchmark so I
doubt it will be a problem.
Signed-off-by: Nick Piggin <npiggin@kernel.dk>
Diffstat (limited to 'fs/nilfs2')
-rw-r--r-- | fs/nilfs2/super.c | 10 |
1 files changed, 9 insertions, 1 deletions
diff --git a/fs/nilfs2/super.c b/fs/nilfs2/super.c index d36fc7ee615f..e2dcc9c733f7 100644 --- a/fs/nilfs2/super.c +++ b/fs/nilfs2/super.c | |||
@@ -162,10 +162,13 @@ struct inode *nilfs_alloc_inode(struct super_block *sb) | |||
162 | return &ii->vfs_inode; | 162 | return &ii->vfs_inode; |
163 | } | 163 | } |
164 | 164 | ||
165 | void nilfs_destroy_inode(struct inode *inode) | 165 | static void nilfs_i_callback(struct rcu_head *head) |
166 | { | 166 | { |
167 | struct inode *inode = container_of(head, struct inode, i_rcu); | ||
167 | struct nilfs_mdt_info *mdi = NILFS_MDT(inode); | 168 | struct nilfs_mdt_info *mdi = NILFS_MDT(inode); |
168 | 169 | ||
170 | INIT_LIST_HEAD(&inode->i_dentry); | ||
171 | |||
169 | if (mdi) { | 172 | if (mdi) { |
170 | kfree(mdi->mi_bgl); /* kfree(NULL) is safe */ | 173 | kfree(mdi->mi_bgl); /* kfree(NULL) is safe */ |
171 | kfree(mdi); | 174 | kfree(mdi); |
@@ -173,6 +176,11 @@ void nilfs_destroy_inode(struct inode *inode) | |||
173 | kmem_cache_free(nilfs_inode_cachep, NILFS_I(inode)); | 176 | kmem_cache_free(nilfs_inode_cachep, NILFS_I(inode)); |
174 | } | 177 | } |
175 | 178 | ||
179 | void nilfs_destroy_inode(struct inode *inode) | ||
180 | { | ||
181 | call_rcu(&inode->i_rcu, nilfs_i_callback); | ||
182 | } | ||
183 | |||
176 | static int nilfs_sync_super(struct nilfs_sb_info *sbi, int flag) | 184 | static int nilfs_sync_super(struct nilfs_sb_info *sbi, int flag) |
177 | { | 185 | { |
178 | struct the_nilfs *nilfs = sbi->s_nilfs; | 186 | struct the_nilfs *nilfs = sbi->s_nilfs; |