Rewrite the final sentence of data dependency memory barrier to express
the 'after' relationship in simpler words.
Signed-off-by: Nikolay Borisov <nbori...@suse.com>
---
Documentation/memory-barriers.txt | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/Documentation/memory-barriers.txt
b/Documentation/memory-barriers.txt
index a863009849a3..d7bc0132ef5a 100644
--- a/Documentation/memory-barriers.txt
+++ b/Documentation/memory-barriers.txt
@@ -399,8 +399,8 @@ VARIETIES OF MEMORY BARRIER
where two loads are performed such that the second depends on the result
of the first (eg: the first load retrieves the address to which the second
load will be directed), a data dependency barrier would be required to
- make sure that the target of the second load is updated before the address
- obtained by the first load is accessed.
+ make sure that the target of the second load is updated to the value
+ obtained by the first load.
A data dependency barrier is a partial ordering on interdependent loads
only; it is not required to have any effect on stores, independent loads
--
2.7.4
