Lines Matching refs:is
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()
27 the order of a pair of writes, where each write is to a different
28 variable by a different process? This litmus test is forbidden
33 between each pairs of reads. In other words, is anything at all
35 order of a pair of writes, where each write is to a different
40 litmus test is visible to an external process whose accesses are
42 S is otherwise known as ISA2.
105 the flag and then the data. (This is similar to the ISA2 tests,
109 This is the fully ordered (via smp_mb()) version of one of
117 This is the fully ordered (again, via smp_mb() version of store
125 This litmus test demonstrates that LKMM is not fully multicopy
126 atomic. (Neither is it other multicopy atomic.) This litmus test
143 class in which the first write is moved to a separate process.
144 The second is forbidden because smp_store_release() is
175 The structure of a litmus-test name is the litmus-test class, a plus
177 The end of the name is ".litmus".
184 litmus-test class is "MP" (message passing), which may be found on the
188 complex due to a desire to have short(er) names. Thus, there is a tool to
212 The next step is to construct a space-separated list of descriptors,
216 P0()'s WRITE_ONCE() is read by its first READ_ONCE(), which is a
217 reads-from link (rf) and internal to the P0() process. This is
218 "rfi", which is an abbreviation for "reads-from internal". Because
220 characters separating processes, the first character is capitalized,
223 P0()'s second access is a READ_ONCE(), as opposed to (for example)
224 smp_load_acquire(), so next is "Once". Thus far, we have "Rfi Once".
226 P0()'s third access is also a READ_ONCE(), but to y rather than x.
227 This is related to P0()'s second access by program order ("po"),
229 The resulting descriptor is "PodRR". Because P0()'s third access is
233 access, and the resulting descriptor is "Fre". P1()'s first access is
235 thus far is thus "Rfi Once PodRR Once Fre Once".
237 The remainder of P1() is similar to P0(), which means we add
239 P0()'s first access, which is WRITE_ONCE(), so we add "Fre Once".
240 The full string is thus: