forked from Minki/linux
8f32543b61
This commit adds comments to the litmus tests summarizing what these tests are intended to demonstrate. [ paulmck: Apply Andrea's and Alan's feedback. ] Suggested-by: Ingo Molnar <mingo@kernel.org> Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com> Acked-by: Peter Zijlstra <peterz@infradead.org> Cc: Linus Torvalds <torvalds@linux-foundation.org> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: akiyks@gmail.com Cc: boqun.feng@gmail.com Cc: dhowells@redhat.com Cc: j.alglave@ucl.ac.uk Cc: linux-arch@vger.kernel.org Cc: luc.maranget@inria.fr Cc: nborisov@suse.com Cc: npiggin@gmail.com Cc: parri.andrea@gmail.com Cc: stern@rowland.harvard.edu Cc: will.deacon@arm.com Link: http://lkml.kernel.org/r/1519169112-20593-4-git-send-email-paulmck@linux.vnet.ibm.com Signed-off-by: Ingo Molnar <mingo@kernel.org>
41 lines
658 B
Plaintext
41 lines
658 B
Plaintext
C Z6.0+pooncelock+pooncelock+pombonce
|
|
|
|
(*
|
|
* Result: Sometimes
|
|
*
|
|
* This example demonstrates that a pair of accesses made by different
|
|
* processes each while holding a given lock will not necessarily be
|
|
* seen as ordered by a third process not holding that lock.
|
|
*)
|
|
|
|
{}
|
|
|
|
P0(int *x, int *y, spinlock_t *mylock)
|
|
{
|
|
spin_lock(mylock);
|
|
WRITE_ONCE(*x, 1);
|
|
WRITE_ONCE(*y, 1);
|
|
spin_unlock(mylock);
|
|
}
|
|
|
|
P1(int *y, int *z, spinlock_t *mylock)
|
|
{
|
|
int r0;
|
|
|
|
spin_lock(mylock);
|
|
r0 = READ_ONCE(*y);
|
|
WRITE_ONCE(*z, 1);
|
|
spin_unlock(mylock);
|
|
}
|
|
|
|
P2(int *x, int *z)
|
|
{
|
|
int r1;
|
|
|
|
WRITE_ONCE(*z, 2);
|
|
smp_mb();
|
|
r1 = READ_ONCE(*x);
|
|
}
|
|
|
|
exists (1:r0=1 /\ z=2 /\ 2:r1=0)
|