aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Makefile
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@linux-foundation.org>2013-09-02 11:38:06 -0700
committerLinus Torvalds <torvalds@linux-foundation.org>2013-09-02 11:38:06 -0700
commit15570086b590a69d59183b08a7770e316cca20a7 (patch)
tree12c1494a59a3786bc99674567aa9b77af40a3698 /lib/Makefile
parentvfs: use lockref_get_not_zero() for optimistic lockless dget_parent() (diff)
downloadlinux-dev-15570086b590a69d59183b08a7770e316cca20a7.tar.xz
linux-dev-15570086b590a69d59183b08a7770e316cca20a7.zip
vfs: reimplement d_rcu_to_refcount() using lockref_get_or_lock()
This moves __d_rcu_to_refcount() from <linux/dcache.h> into fs/namei.c and re-implements it using the lockref infrastructure instead. It also adds a lot of comments about what is actually going on, because turning a dentry that was looked up using RCU into a long-lived reference counted entry is one of the more subtle parts of the rcu walk. We also used to be _particularly_ subtle in unlazy_walk() where we re-validate both the dentry and its parent using the same sequence count. We used to do it by nesting the locks and then verifying the sequence count just once. That was silly, because nested locking is expensive, but the sequence count check is not. So this just re-validates the dentry and the parent separately, avoiding the nested locking, and making the lockref lookup possible. Acked-by: Waiman Long <waiman.long@hp.com> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'lib/Makefile')
0 files changed, 0 insertions, 0 deletions