aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/tools/memory-model/litmus-tests/MP+porevlocks.litmus
blob: b9599141160e62742cc10b99f35801be7b6a70f1 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
C MP+porevlocks

(*
 * Result: Never
 *
 * This litmus test demonstrates how lock acquisitions and releases can
 * stand in for smp_load_acquire() and smp_store_release(), respectively.
 * In other words, when holding a given lock (or indeed after releasing a
 * given lock), a CPU is not only guaranteed to see the accesses that other
 * CPUs made while previously holding that lock, it is also guaranteed to
 * see all prior accesses by those other CPUs.
 *)

{}

P0(int *buf, int *flag, spinlock_t *mylock) // Consumer
{
	int r0;
	int r1;

	r0 = READ_ONCE(*flag);
	spin_lock(mylock);
	r1 = READ_ONCE(*buf);
	spin_unlock(mylock);
}

P1(int *buf, int *flag, spinlock_t *mylock) // Producer
{
	spin_lock(mylock);
	WRITE_ONCE(*buf, 1);
	spin_unlock(mylock);
	WRITE_ONCE(*flag, 1);
}

exists (0:r0=1 /\ 0:r1=0) (* Bad outcome. *)