path: root/Documentation/memory-barriers.txt
diff options
authorSeongJae Park <>2016-08-11 11:17:42 -0700
committerIngo Molnar <>2016-08-12 08:24:13 +0200
commit8b9e771555745a029557a0a481e760fb84376a35 (patch)
treeb8ad479d046682b8e1fb6e1ef91670856438ebdb /Documentation/memory-barriers.txt
parentd7cab36db83be458e8987ae352902958977e7925 (diff)
locking/Documentation: Fix a typo of example result
An example result for data dependent write has a typo. This commit fixes the wrong typo. Signed-off-by: SeongJae Park <> Signed-off-by: Paul E. McKenney <> Cc: Linus Torvalds <> Cc: Peter Zijlstra <> Cc: Thomas Gleixner <> Cc: Cc: Cc: Link: Signed-off-by: Ingo Molnar <>
Diffstat (limited to 'Documentation/memory-barriers.txt')
1 files changed, 1 insertions, 1 deletions
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