LISA auto/LB-GRR+R-Oc+R-Oc+R-Oc
(*
* Result: Sometimes
* P0 GRR: Never->Maybe: Should rel-acq provide any global transitivity?
* P0-P1 rf R-Oc: Note lack of C11 guarantee, control dependency
* P1 Oc,R: Note lack of C11 guarantee
* P1-P2 rf R-Oc: Note lack of C11 guarantee, control dependency
* P2 Oc,R: Note lack of C11 guarantee
* P2-P3 rf R-Oc: Note lack of C11 guarantee, control dependency
* P3 Oc,GRR: Maybe->Sometimes: Control dependencies do not order trailing reads
*)
{
1:r4=1; 2:r4=1; 3:r4=1;
}
P0 | P1 | P2 | P3 | P4 ;
r[once] r1 u0 | r[once] r1 x1 | r[once] r1 x2 | r[once] r1 x3 | w[once] v0 1 ;
w[release] x1 1 | mov r4 (neq r1 r4) | mov r4 (neq r1 r4) | mov r4 (neq r1 r4) | f[mb] ;
| b[] r4 CTRL1 | b[] r4 CTRL2 | b[] r4 CTRL3 | w[once] u0 1 ;
| w[release] x2 1 | w[release] x3 1 | r[once] r2 v0 | ;
| CTRL1: | CTRL2: | CTRL3: | ;
Observed
3:r2=0; 3:r1=1; 2:r1=1; 1:r1=1; 0:r1=1;