summaryrefslogtreecommitdiff
path: root/include/linux/list_nulls.h
diff options
context:
space:
mode:
authorPatrick Marlier <patrick.marlier@gmail.com>2015-09-12 01:50:35 +0300
committerPaul E. McKenney <paulmck@linux.vnet.ibm.com>2015-10-06 21:16:18 +0300
commit8db70b132dd57696cfc7560203a72e90c51bfdda (patch)
treea51cb391fd45ca2a640742343906181822890c7d /include/linux/list_nulls.h
parentc3ac7cf1847a4e68c909984f60d36adef2088e35 (diff)
downloadlinux-8db70b132dd57696cfc7560203a72e90c51bfdda.tar.xz
rculist: Make list_entry_rcu() use lockless_dereference()
The current list_entry_rcu() implementation copies the pointer to a stack variable, then invokes rcu_dereference_raw() on it. This results in an additional store-load pair. Now, most compilers will emit normal store and load instructions, which might seem to be of negligible overhead, but this results in a load-hit-store situation that can cause surprisingly long pipeline stalls, even on modern microprocessors. The problem is that it takes time for the store to get the store buffer updated, which can delay the subsequent load, which immediately follows. This commit therefore switches to the lockless_dereference() primitive, which does not expect the __rcu annotations (that are anyway not present in the list_head structure) and which, like rcu_dereference_raw(), does not check for an enclosing RCU read-side critical section. Most importantly, it does not copy the pointer, thus avoiding the load-hit-store overhead. Signed-off-by: Patrick Marlier <patrick.marlier@gmail.com> [ paulmck: Switched to lockless_dereference() to suppress sparse warnings. ] Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com> Reviewed-by: Josh Triplett <josh@joshtriplett.org>
Diffstat (limited to 'include/linux/list_nulls.h')
0 files changed, 0 insertions, 0 deletions