Greg Kroah-Hartman
598cf27219
Link: https://lore.kernel.org/r/20260217200002.683975158@linuxfoundation.org Tested-by: Florian Fainelli <florian.fainelli@broadcom.com> Tested-by: Takeshi Ogasawara <takeshi.ogasawara@futuring-girl.com> Tested-by: Peter Schneider <pschneider1968@googlemail.com> Tested-by: Jon Hunter <jonathanh@nvidia.com> Tested-by: Salvatore Bonaccorso <carnil@debian.org> Tested-by: Brett A C Sheffield <bacs@librecast.net> Tested-by: Mark Brown <broonie@kernel.org> Tested-by: Luna Jernberg <droidbittin@gmail.com> Tested-by: Ronald Warsow <rwarsow@gmx.de> Tested-by: Justin M. Forbes <jforbes@fedoraproject.org> Tested-by: Ron Economos <re@w6rz.net> Tested-by: Miguel Ojeda <ojeda@kernel.org> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
36 lines
825 B
Plaintext
36 lines
825 B
Plaintext
C MP+polocks
|
|
|
|
(*
|
|
* 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) // Producer
|
|
{
|
|
WRITE_ONCE(*buf, 1);
|
|
spin_lock(mylock);
|
|
WRITE_ONCE(*flag, 1);
|
|
spin_unlock(mylock);
|
|
}
|
|
|
|
P1(int *buf, int *flag, spinlock_t *mylock) // Consumer
|
|
{
|
|
int r0;
|
|
int r1;
|
|
|
|
spin_lock(mylock);
|
|
r0 = READ_ONCE(*flag);
|
|
spin_unlock(mylock);
|
|
r1 = READ_ONCE(*buf);
|
|
}
|
|
|
|
exists (1:r0=1 /\ 1:r1=0) (* Bad outcome. *)
|