File: MP%2Bpolockonce%2Bpoacquiresilsil.litmus

package info (click to toggle)
linux 6.16.9-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 1,724,628 kB
  • sloc: ansic: 26,562,645; asm: 271,329; sh: 144,039; python: 72,469; makefile: 57,135; perl: 36,821; xml: 19,553; cpp: 5,820; yacc: 4,915; lex: 2,955; awk: 1,667; sed: 28; ruby: 25
file content (33 lines) | stat: -rw-r--r-- 681 bytes parent folder | download | duplicates (32)
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
C MP+polockonce+poacquiresilsil

(*
 * Result: Sometimes
 *
 * Do spinlocks provide order to outside observers using spin_is_locked()
 * to sense the lock-held state, ordered by acquire?  Note that when the
 * first spin_is_locked() returns false and the second true, we know that
 * the smp_load_acquire() executed before the lock was acquired (loosely
 * speaking).
 *)

{}

P0(spinlock_t *lo, int *x) // Producer
{
	spin_lock(lo);
	WRITE_ONCE(*x, 1);
	spin_unlock(lo);
}

P1(spinlock_t *lo, int *x) // Consumer
{
	int r1;
	int r2;
	int r3;

	r1 = smp_load_acquire(x);
	r2 = spin_is_locked(lo);
	r3 = spin_is_locked(lo);
}

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