From: SeongJae Park <sj38.p...@gmail.com> An example result for data dependent write has a typo. This commit fixes the wrong typo.
Signed-off-by: SeongJae Park <sj38.p...@gmail.com> Signed-off-by: Paul E. McKenney <paul...@linux.vnet.ibm.com> --- 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
