forked from Minki/linux
bb7e5ce7dd
This commit provides text and diagrams showing how Tree RCU implements its grace-period memory ordering guarantees. Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com> Cc: Jonathan Corbet <corbet@lwn.net> Cc: Linus Torvalds <torvalds@linux-foundation.org> |
||
---|---|---|
.. | ||
Data-Structures | ||
Expedited-Grace-Periods | ||
Memory-Ordering | ||
Requirements |