davidlt/kernel-ark
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

locking/Documentation: Fix a typo of example result

Browse Source 
An example result for data dependent write has a typo.  This commit
fixes the wrong typo.

Signed-off-by: SeongJae Park <sj38.park@gmail.com>
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: dhowells@redhat.com
Cc: linux-arch@vger.kernel.org
Cc: will.deacon@arm.com
Link: http://lkml.kernel.org/r/1470939463-31950-3-git-send-email-paulmck@linux.vnet.ibm.com
Signed-off-by: Ingo Molnar <mingo@kernel.org>
This commit is contained in:
SeongJae Park 2016-08-11 11:17:42 -07:00 committed by Ingo Molnar
parent d7cab36db8
commit 8b9e771555
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Documentation/memory-barriers.txt
View File

@ -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 The data-dependency barrier must order the read into Q with the store
into *Q. This prohibits this outcome: 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 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 of dependency ordering is to -prevent- writes to the data structure, along