diff options
| author | Pranith Kumar <bobby.prani@gmail.com> | 2014-09-02 23:34:29 -0400 |
|---|---|---|
| committer | Paul E. McKenney <paulmck@linux.vnet.ibm.com> | 2014-11-13 13:34:55 -0500 |
| commit | 8ab8b3e1837fc580b30263ed3c44dc34798714d9 (patch) | |
| tree | 022a2c06647baed2a353c56399d84a62caa0f648 | |
| parent | 1f7870dd8729c64b8472b42440811e7ff94d16a4 (diff) | |
documentation: memory-barriers.txt: Correct example for reorderings
Correct the example of memory orderings in memory-barriers.txt
Commit 615cc2c9cf95 "Documentation/memory-barriers.txt: fix important typo re
memory barriers" changed the assignment to x and y. Change the rest of the
example to match this change.
Reported-by: Ganesh Rapolu <ganesh.rapolu@hotmail.com>
Signed-off-by: Pranith Kumar <bobby.prani@gmail.com>
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
| -rw-r--r-- | Documentation/memory-barriers.txt | 22 |
1 files changed, 11 insertions, 11 deletions
diff --git a/Documentation/memory-barriers.txt b/Documentation/memory-barriers.txt index 1073e019ef06..f7fa63508aba 100644 --- a/Documentation/memory-barriers.txt +++ b/Documentation/memory-barriers.txt | |||
| @@ -121,22 +121,22 @@ For example, consider the following sequence of events: | |||
| 121 | The set of accesses as seen by the memory system in the middle can be arranged | 121 | The set of accesses as seen by the memory system in the middle can be arranged |
| 122 | in 24 different combinations: | 122 | in 24 different combinations: |
| 123 | 123 | ||
| 124 | STORE A=3, STORE B=4, x=LOAD A->3, y=LOAD B->4 | 124 | STORE A=3, STORE B=4, y=LOAD A->3, x=LOAD B->4 |
| 125 | STORE A=3, STORE B=4, y=LOAD B->4, x=LOAD A->3 | 125 | STORE A=3, STORE B=4, x=LOAD B->4, y=LOAD A->3 |
| 126 | STORE A=3, x=LOAD A->3, STORE B=4, y=LOAD B->4 | 126 | STORE A=3, y=LOAD A->3, STORE B=4, x=LOAD B->4 |
| 127 | STORE A=3, x=LOAD A->3, y=LOAD B->2, STORE B=4 | 127 | STORE A=3, y=LOAD A->3, x=LOAD B->2, STORE B=4 |
| 128 | STORE A=3, y=LOAD B->2, STORE B=4, x=LOAD A->3 | 128 | STORE A=3, x=LOAD B->2, STORE B=4, y=LOAD A->3 |
| 129 | STORE A=3, y=LOAD B->2, x=LOAD A->3, STORE B=4 | 129 | STORE A=3, x=LOAD B->2, y=LOAD A->3, STORE B=4 |
| 130 | STORE B=4, STORE A=3, x=LOAD A->3, y=LOAD B->4 | 130 | STORE B=4, STORE A=3, y=LOAD A->3, x=LOAD B->4 |
| 131 | STORE B=4, ... | 131 | STORE B=4, ... |
| 132 | ... | 132 | ... |
| 133 | 133 | ||
| 134 | and can thus result in four different combinations of values: | 134 | and can thus result in four different combinations of values: |
| 135 | 135 | ||
| 136 | x == 1, y == 2 | 136 | x == 2, y == 1 |
| 137 | x == 1, y == 4 | 137 | x == 2, y == 3 |
| 138 | x == 3, y == 2 | 138 | x == 4, y == 1 |
| 139 | x == 3, y == 4 | 139 | x == 4, y == 3 |
| 140 | 140 | ||
| 141 | 141 | ||
| 142 | Furthermore, the stores committed by a CPU to the memory system may not be | 142 | Furthermore, the stores committed by a CPU to the memory system may not be |