summaryrefslogtreecommitdiff
path: root/include
diff options
context:
space:
mode:
authorDipankar Sarma <dipankar@in.ibm.com>2004-10-18 18:14:01 -0700
committerLinus Torvalds <torvalds@ppc970.osdl.org>2004-10-18 18:14:01 -0700
commit61f969b4ed29ebd4882702b9550c242ff68e0c8a (patch)
treefa5b8d48f902a69b390abc46987d54474c22bc6a /include
parentc979aaea590dff9fc872b6f938c6cf045afdd2fc (diff)
[PATCH] Fix dcache lookup
__d_lookup() has leftover stuff from earlier code to protect it against rename. The smp_rmb() there was needed for the sequence counter logic. Original dcache_rcu had : + move_count = dentry->d_move_count; + smp_rmb(); + if (dentry->d_name.hash != hash) continue; if (dentry->d_parent != parent) continue; This was to make sure that comparisons didn't happen before before the sequence counter was snapshotted. This logic is now gone and memory barrier is not needed. Removing this should also improve performance. The other change is the leftover smp_read_barrier_depends(), later converted to rcu_dereference(). Originally, the name comparison was not protected against d_move() and there could have been a mismatch of allocation size of the name string and dentry->d_name.len. This was avoided by making the qstr update in dentry atomic using a d_qstr pointer. Now, we do ->d_compare() or memcmp() with the d_lock held and it is safe against d_move(). So, there is no need to rcu_dereference() anything. In fact, the current code is meaningless. Signed-off-by: Dipankar Sarma <dipankar@in.ibm.com> Signed-off-by: Andrew Morton <akpm@osdl.org> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Diffstat (limited to 'include')
0 files changed, 0 insertions, 0 deletions