Lines Matching +full:in +full:- +full:between
6 Test of read-read coherence, that is, whether or not two
10 Test of read-write coherence, that is, whether or not a read
15 Test of write-read coherence, that is, whether or not a write
20 Test of write-write coherence, that is, whether or not two
25 between each pairs of reads. In other words, is smp_mb()
33 between each pairs of reads. In other words, is anything at all
39 Tests whether the ordering provided by a lock-protected S
45 As below, but with store-release replaced with WRITE_ONCE()
46 and load-acquire replaced with READ_ONCE().
49 Can a release-acquire chain order a prior store against
54 load-buffering litmus test, where each process reads from one
58 Does a release-acquire pair suffice for the load-buffering
63 As above, but with store-release replaced with WRITE_ONCE()
64 and load-acquire replaced with READ_ONCE().
67 Does a unlock+lock pair provides ordering guarantee between a
75 in one process, and use an acquire load followed by a pair of
76 spin_is_locked() calls in the other process.
79 Protect the access with a lock in one process, and use an
81 in the other process.
91 As below, but with a release-acquire chain.
98 Does a unlock+lock pair provides ordering guarantee between a
102 Does a smp_wmb() (between the stores) and an smp_rmb() (between
103 the loads) suffice for the message-passing litmus test, where one
118 buffering, which forms the core of Dekker's mutual-exclusion
124 SB+rfionceonce-poonceonces.litmus
128 additional registers and locations to be printed out in the dump
129 of final states in the herd7 output. Without the "locations"
130 statement, only those registers and locations mentioned in the
142 These two are members of an extension of the MP litmus-test
143 class in which the first write is moved to a separate process.
145 A-cumulative in LKMM.
157 Is the ordering provided by a release-acquire chain sufficient
159 not participate in that release-acquire chain?
173 are named on an ad-hoc basis.
175 The structure of a litmus-test name is the litmus-test class, a plus
179 The litmus-test classes may be found in the infamous test6.pdf:
180 https://www.cl.cam.ac.uk/~pes20/ppc-supplemental/test6.pdf
184 litmus-test class is "MP" (message passing), which may be found on the
185 left-hand end of the second row of tests on page one of test6.pdf.
190 consider the processes from SB+rfionceonce-poonceonces.litmus:
212 The next step is to construct a space-separated list of descriptors,
213 interleaving descriptions of the relation between a pair of consecutive
214 accesses with descriptions of the second access in the pair.
217 reads-from link (rf) and internal to the P0() process. This is
218 "rfi", which is an abbreviation for "reads-from internal". Because
221 resulting in "Rfi".
232 A from-read ("fre") relation links P0()'s third to P1()'s first
247 $ norm7 -bell linux-kernel.bell \
249 sed -e 's/:.*//g'
250 SB+rfionceonce-poonceonces
252 Adding the ".litmus" suffix: SB+rfionceonce-poonceonces.litmus
254 The descriptors that describe connections between consecutive accesses
256 tool (Rfi, Po, Fre, and so on) or by the linux-kernel.bell file (Once,
261 $ diyone7 -bell linux-kernel.bell -show edges