login
Header Space

 
 

Re: [PATCH] A deadlock free and best try version of drop_caches()

Score:
Previous message: [thread] [date] [author]
Next message: [thread] [date] [author]
To: Fengguang Wu <wfg@...>
Cc: David Chinner <dgc@...>, lkml <linux-kernel@...>, linux-fsdevel <linux-fsdevel@...>
Date: Wednesday, March 19, 2008 - 6:03 pm

On Wed, Mar 19, 2008 at 07:27:29PM +0800, Fengguang Wu wrote:
......

So you walk the inode hash to find inodes? Seems like a nice idea on
the surface.... Won't it need to hold the iprune_mutex to prevent
races with prune_icache() and invalidate_list()?

Hmmmm - what about unhashed inodes? We'll never see them with this
method of traversal. I ask because I'm working on some prototype
patches for XFS that avoid using the inode hash altogether and drive
inode lookup from the multitude of radix trees we have per filesystem
(for parallelised and lockless inode lookup).

The above scanning method would not work at all with that sort of
filesystem structure. Perhaps combining the bulk get/put with Jan's
get/put method for walking the sb inode list would be sufficient?

Cheers,

Dave.
-- 
Dave Chinner
Principal Engineer
SGI Australian Software Group
--
Previous message: [thread] [date] [author]
Next message: [thread] [date] [author]

Messages in current thread:
Re: [PATCH] A deadlock free and best try version of drop_cac..., David Chinner, (Wed Mar 19, 6:03 pm)
speck-geostationary