mirror of
git://git.kernel.org/pub/scm/linux/kernel/git/xiang/erofs.git
synced 2026-10-28 12:53:14 +01:00
Documentation/litmus-tests: Demonstrate unordered failing cmpxchg
This commit adds four litmus tests showing that a failing cmpxchg() operation is unordered unless followed by an smp_mb__after_atomic() operation. Suggested-by: Frederic Weisbecker <[email protected]> Signed-off-by: Paul E. McKenney <[email protected]> Cc: Alan Stern <[email protected]> Cc: Will Deacon <[email protected]> Cc: Peter Zijlstra <[email protected]> Cc: Boqun Feng <[email protected]> Cc: Nicholas Piggin <[email protected]> Cc: David Howells <[email protected]> Cc: Jade Alglave <[email protected]> Cc: Luc Maranget <[email protected]> Cc: "Paul E. McKenney" <[email protected]> Cc: Akira Yokosawa <[email protected]> Cc: Daniel Lustig <[email protected]> Cc: Joel Fernandes <[email protected]> Cc: Mark Rutland <[email protected]> Cc: Jonathan Corbet <[email protected]> Cc: <[email protected]> Cc: <[email protected]> Acked-by: Andrea Parri <[email protected]>
This commit is contained in:
1 parent
d2c470c491
commit
293f5bc271
5 files changed
+143
No files matched your search
@@ -21,6 +21,22 @@ Atomic-RMW-ops-are-atomic-WRT-atomic_set.litmus
|
||||
Test that atomic_set() cannot break the atomicity of atomic RMWs.
|
||||
NOTE: Require herd7 7.56 or later which supports "(void)expr".
|
||||
|
||||
cmpxchg-fail-ordered-1.litmus
|
||||
Demonstrate that a failing cmpxchg() operation acts as a full barrier
|
||||
when followed by smp_mb__after_atomic().
|
||||
|
||||
cmpxchg-fail-ordered-2.litmus
|
||||
Demonstrate that a failing cmpxchg() operation acts as an acquire
|
||||
operation when followed by smp_mb__after_atomic().
|
||||
|
||||
cmpxchg-fail-unordered-1.litmus
|
||||
Demonstrate that a failing cmpxchg() operation does not act as a
|
||||
full barrier.
|
||||
|
||||
cmpxchg-fail-unordered-2.litmus
|
||||
Demonstrate that a failing cmpxchg() operation does not act as an
|
||||
acquire operation.
|
||||
|
||||
|
||||
locking (/locking directory)
|
||||
----------------------------
|
||||
|
||||
@@ -0,0 +1,34 @@
|
||||
C cmpxchg-fail-ordered-1
|
||||
|
||||
(*
|
||||
* Result: Never
|
||||
*
|
||||
* Demonstrate that a failing cmpxchg() operation will act as a full
|
||||
* barrier when followed by smp_mb__after_atomic().
|
||||
*)
|
||||
|
||||
{}
|
||||
|
||||
P0(int *x, int *y, int *z)
|
||||
{
|
||||
int r0;
|
||||
int r1;
|
||||
|
||||
WRITE_ONCE(*x, 1);
|
||||
r1 = cmpxchg(z, 1, 0);
|
||||
smp_mb__after_atomic();
|
||||
r0 = READ_ONCE(*y);
|
||||
}
|
||||
|
||||
P1(int *x, int *y, int *z)
|
||||
{
|
||||
int r0;
|
||||
|
||||
WRITE_ONCE(*y, 1);
|
||||
r1 = cmpxchg(z, 1, 0);
|
||||
smp_mb__after_atomic();
|
||||
r0 = READ_ONCE(*x);
|
||||
}
|
||||
|
||||
locations[0:r1;1:r1]
|
||||
exists (0:r0=0 /\ 1:r0=0)
|
||||
@@ -0,0 +1,30 @@
|
||||
C cmpxchg-fail-ordered-2
|
||||
|
||||
(*
|
||||
* Result: Never
|
||||
*
|
||||
* Demonstrate use of smp_mb__after_atomic() to make a failing cmpxchg
|
||||
* operation have acquire ordering.
|
||||
*)
|
||||
|
||||
{}
|
||||
|
||||
P0(int *x, int *y)
|
||||
{
|
||||
int r0;
|
||||
int r1;
|
||||
|
||||
WRITE_ONCE(*x, 1);
|
||||
r1 = cmpxchg(y, 0, 1);
|
||||
}
|
||||
|
||||
P1(int *x, int *y)
|
||||
{
|
||||
int r0;
|
||||
|
||||
r1 = cmpxchg(y, 0, 1);
|
||||
smp_mb__after_atomic();
|
||||
r2 = READ_ONCE(*x);
|
||||
}
|
||||
|
||||
exists (0:r1=0 /\ 1:r1=1 /\ 1:r2=0)
|
||||
@@ -0,0 +1,33 @@
|
||||
C cmpxchg-fail-unordered-1
|
||||
|
||||
(*
|
||||
* Result: Sometimes
|
||||
*
|
||||
* Demonstrate that a failing cmpxchg() operation does not act as a
|
||||
* full barrier. (In contrast, a successful cmpxchg() does act as a
|
||||
* full barrier.)
|
||||
*)
|
||||
|
||||
{}
|
||||
|
||||
P0(int *x, int *y, int *z)
|
||||
{
|
||||
int r0;
|
||||
int r1;
|
||||
|
||||
WRITE_ONCE(*x, 1);
|
||||
r1 = cmpxchg(z, 1, 0);
|
||||
r0 = READ_ONCE(*y);
|
||||
}
|
||||
|
||||
P1(int *x, int *y, int *z)
|
||||
{
|
||||
int r0;
|
||||
|
||||
WRITE_ONCE(*y, 1);
|
||||
r1 = cmpxchg(z, 1, 0);
|
||||
r0 = READ_ONCE(*x);
|
||||
}
|
||||
|
||||
locations[0:r1;1:r1]
|
||||
exists (0:r0=0 /\ 1:r0=0)
|
||||
@@ -0,0 +1,30 @@
|
||||
C cmpxchg-fail-unordered-2
|
||||
|
||||
(*
|
||||
* Result: Sometimes
|
||||
*
|
||||
* Demonstrate that a failing cmpxchg() operation does not act as either
|
||||
* an acquire release operation. (In contrast, a successful cmpxchg()
|
||||
* does act as both an acquire and a release operation.)
|
||||
*)
|
||||
|
||||
{}
|
||||
|
||||
P0(int *x, int *y)
|
||||
{
|
||||
int r0;
|
||||
int r1;
|
||||
|
||||
WRITE_ONCE(*x, 1);
|
||||
r1 = cmpxchg(y, 0, 1);
|
||||
}
|
||||
|
||||
P1(int *x, int *y)
|
||||
{
|
||||
int r0;
|
||||
|
||||
r1 = cmpxchg(y, 0, 1);
|
||||
r2 = READ_ONCE(*x);
|
||||
}
|
||||
|
||||
exists (0:r1=0 /\ 1:r1=1 /\ 1:r2=0)
|
||||
Reference in new issue
Block a user