Re: [PATCH] : struct dentry : place d_hash close to d_parent and d_name to speedup lookups

2005-09-01 Thread Eric Dumazet
Dipankar Sarma a écrit : On Thu, Sep 01, 2005 at 05:48:28PM +0200, Eric Dumazet wrote: dentry cache uses sophisticated RCU technology (and prefetching if available) but touches 2 cache lines per dentry during hlist lookup. This patch moves d_hash in the same cache line than d_parent and d_nam

Re: [PATCH] : struct dentry : place d_hash close to d_parent and d_name to speedup lookups

2005-09-01 Thread Dipankar Sarma
On Thu, Sep 01, 2005 at 05:48:28PM +0200, Eric Dumazet wrote: > dentry cache uses sophisticated RCU technology (and prefetching if > available) but touches 2 cache lines per dentry during hlist lookup. > > This patch moves d_hash in the same cache line than d_parent and d_name > fields so that :

[PATCH] : struct dentry : place d_hash close to d_parent and d_name to speedup lookups

2005-09-01 Thread Eric Dumazet
dentry cache uses sophisticated RCU technology (and prefetching if available) but touches 2 cache lines per dentry during hlist lookup. This patch moves d_hash in the same cache line than d_parent and d_name fields so that : 1) One cache line is needed instead of two. 2) the hlist_for_each_rc

[PATCH] : struct dentry : place d_hash close to d_parent and d_name to speedup lookups

2005-09-01 Thread Eric Dumazet
dentry cache uses sophisticated RCU technology (and prefetching if available) but touches 2 cache lines per dentry during hlist lookup. This patch moves d_hash in the same cache line than d_parent and d_name fields so that : 1) One cache line is needed instead of two. 2) the hlist_for_each_