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/ntfs/inode.c | |
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/ntfs/inode.c')
-rw-r--r-- | fs/ntfs/inode.c | 9 |
1 files changed, 8 insertions, 1 deletions
diff --git a/fs/ntfs/inode.c b/fs/ntfs/inode.c index 93622b175fc7..a627ed82c0a3 100644 --- a/fs/ntfs/inode.c +++ b/fs/ntfs/inode.c | |||
@@ -332,6 +332,13 @@ struct inode *ntfs_alloc_big_inode(struct super_block *sb) | |||
332 | return NULL; | 332 | return NULL; |
333 | } | 333 | } |
334 | 334 | ||
335 | static void ntfs_i_callback(struct rcu_head *head) | ||
336 | { | ||
337 | struct inode *inode = container_of(head, struct inode, i_rcu); | ||
338 | INIT_LIST_HEAD(&inode->i_dentry); | ||
339 | kmem_cache_free(ntfs_big_inode_cache, NTFS_I(inode)); | ||
340 | } | ||
341 | |||
335 | void ntfs_destroy_big_inode(struct inode *inode) | 342 | void ntfs_destroy_big_inode(struct inode *inode) |
336 | { | 343 | { |
337 | ntfs_inode *ni = NTFS_I(inode); | 344 | ntfs_inode *ni = NTFS_I(inode); |
@@ -340,7 +347,7 @@ void ntfs_destroy_big_inode(struct inode *inode) | |||
340 | BUG_ON(ni->page); | 347 | BUG_ON(ni->page); |
341 | if (!atomic_dec_and_test(&ni->count)) | 348 | if (!atomic_dec_and_test(&ni->count)) |
342 | BUG(); | 349 | BUG(); |
343 | kmem_cache_free(ntfs_big_inode_cache, NTFS_I(inode)); | 350 | call_rcu(&inode->i_rcu, ntfs_i_callback); |
344 | } | 351 | } |
345 | 352 | ||
346 | static inline ntfs_inode *ntfs_alloc_extent_inode(void) | 353 | static inline ntfs_inode *ntfs_alloc_extent_inode(void) |