[PATCH memory-barriers.txt 3/4] Doc/memory-barriers: Fix a typo of example result
From: Paul E. McKenney <hidden>
Date: 2016-08-11 22:28:38
Also in:
lkml
Subsystem:
documentation, linux kernel memory consistency model (lkmm), the rest · Maintainers:
Jonathan Corbet, Alan Stern, Andrea Parri, Will Deacon, Peter Zijlstra, Boqun Feng, Nicholas Piggin, David Howells, Jade Alglave, Luc Maranget, "Paul E. McKenney", Linus Torvalds
From: SeongJae Park <redacted> An example result for data dependent write has a typo. This commit fixes the wrong typo. Signed-off-by: SeongJae Park <redacted> Signed-off-by: Paul E. McKenney <redacted> --- Documentation/memory-barriers.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/Documentation/memory-barriers.txt b/Documentation/memory-barriers.txt
index 19c8eb6f246e..ba818ecce6f9 100644
--- a/Documentation/memory-barriers.txt
+++ b/Documentation/memory-barriers.txt@@ -609,7 +609,7 @@ A data-dependency barrier must also order against dependent writes: The data-dependency barrier must order the read into Q with the store into *Q. This prohibits this outcome: - (Q == B) && (B == 4) + (Q == &B) && (B == 4) Please note that this pattern should be rare. After all, the whole point of dependency ordering is to -prevent- writes to the data structure, along
--
2.5.2