71b7ff5ebc
norm7 produces the 'normalized' name of a litmus test, when the test can be generated from a single cycle that passes through each process exactly once. The commit renames such tests in order to comply to the naming scheme implemented by this tool. Signed-off-by: Andrea Parri <andrea.parri@amarulasolutions.com> Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com> Acked-by: Alan Stern <stern@rowland.harvard.edu> Cc: Akira Yokosawa <akiyks@gmail.com> Cc: Boqun Feng <boqun.feng@gmail.com> Cc: David Howells <dhowells@redhat.com> Cc: Jade Alglave <j.alglave@ucl.ac.uk> Cc: Linus Torvalds <torvalds@linux-foundation.org> Cc: Luc Maranget <luc.maranget@inria.fr> Cc: Nicholas Piggin <npiggin@gmail.com> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: Will Deacon <will.deacon@arm.com> Cc: linux-arch@vger.kernel.org Cc: parri.andrea@gmail.com Link: http://lkml.kernel.org/r/20180716180605.16115-14-paulmck@linux.vnet.ibm.com Signed-off-by: Ingo Molnar <mingo@kernel.org>
45 lines
731 B
Text
45 lines
731 B
Text
C IRIW+fencembonceonces+OnceOnce
|
|
|
|
(*
|
|
* Result: Never
|
|
*
|
|
* Test of independent reads from independent writes with smp_mb()
|
|
* between each pairs of reads. In other words, is smp_mb() sufficient to
|
|
* cause two different reading processes to agree on the order of a pair
|
|
* of writes, where each write is to a different variable by a different
|
|
* process? This litmus test exercises LKMM's "propagation" rule.
|
|
*)
|
|
|
|
{}
|
|
|
|
P0(int *x)
|
|
{
|
|
WRITE_ONCE(*x, 1);
|
|
}
|
|
|
|
P1(int *x, int *y)
|
|
{
|
|
int r0;
|
|
int r1;
|
|
|
|
r0 = READ_ONCE(*x);
|
|
smp_mb();
|
|
r1 = READ_ONCE(*y);
|
|
}
|
|
|
|
P2(int *y)
|
|
{
|
|
WRITE_ONCE(*y, 1);
|
|
}
|
|
|
|
P3(int *x, int *y)
|
|
{
|
|
int r0;
|
|
int r1;
|
|
|
|
r0 = READ_ONCE(*y);
|
|
smp_mb();
|
|
r1 = READ_ONCE(*x);
|
|
}
|
|
|
|
exists (1:r0=1 /\ 1:r1=0 /\ 3:r0=1 /\ 3:r1=0)
|