summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorSeongJae Park <sj38.park@gmail.com>2023-09-23 09:32:02 -0700
committerPaul E. McKenney <paulmck@kernel.org>2023-09-24 07:44:25 -0700
commit4e32aa641b3487085de6df4d87e2b48658442da2 (patch)
tree48763fe6e842424ca0b9b1ee82a4b404c657919e
parent159fe74434371f60e922382f7ab709481b59994f (diff)
downloadperfbook-4e32aa641b3487085de6df4d87e2b48658442da2.tar.gz
memorder: Remove a redundant sentence for memory barrier strength
A sentence in memorder.tex explains the strength of smp_mb() and its cost. Then, a quick quiz having very same answer follows. Remove the sentence to reduce the redundancy. Signed-off-by: SeongJae Park <sj38.park@gmail.com> Signed-off-by: Paul E. McKenney <paulmck@kernel.org>
-rw-r--r--memorder/memorder.tex2
1 files changed, 0 insertions, 2 deletions
diff --git a/memorder/memorder.tex b/memorder/memorder.tex
index 5ded6988..bd24b14c 100644
--- a/memorder/memorder.tex
+++ b/memorder/memorder.tex
@@ -1346,8 +1346,6 @@ illustrates this for memory barriers.
Assuming that both memory barriers are strong enough, if CPU~1's access
Y1 happens after CPU~0's access Y0, then CPU~1's access X1 is guaranteed
to happen after CPU~0's access X0.
-When in doubt as to which memory barriers are strong enough, \co{smp_mb()}
-will always do the job, albeit at a price.
\QuickQuiz{
How can you tell which memory barriers are strong enough for