diff options
author | SeongJae Park <[email protected]> | 2016-08-11 11:17:42 -0700 |
---|---|---|
committer | Ingo Molnar <[email protected]> | 2016-08-12 08:24:13 +0200 |
commit | 8b9e771555745a029557a0a481e760fb84376a35 (patch) | |
tree | b8ad479d046682b8e1fb6e1ef91670856438ebdb | |
parent | d7cab36db83be458e8987ae352902958977e7925 (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 <[email protected]>
Signed-off-by: Paul E. McKenney <[email protected]>
Cc: Linus Torvalds <[email protected]>
Cc: Peter Zijlstra <[email protected]>
Cc: Thomas Gleixner <[email protected]>
Cc: [email protected]
Cc: [email protected]
Cc: [email protected]
Link: http://lkml.kernel.org/r/[email protected]
Signed-off-by: Ingo Molnar <[email protected]>
-rw-r--r-- | Documentation/memory-barriers.txt | 2 |
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 |