Lines Matching refs:race
2044 program executes, there will not be any data races. A "data race"
2060 are "race candidates" if they satisfy 1 - 4. Thus, whether or not two
2061 race candidates actually do race in a given execution depends on
2064 The LKMM tries to determine whether a program contains race candidates
2066 a potential data race and makes no predictions about the program's
2069 Determining whether two accesses are race candidates is easy; you can
2179 limitations. For one, it is not allowed to introduce a data race into
2181 race (if it could, memory models would be useless and no multithreaded
2236 This program does not contain a data race. Although the U and V
2237 accesses are race candidates, the LKMM can prove they are not
2252 race with U.)
2262 data race between them.
2310 constitute a race (they can't interfere with each other), but a store
2311 does race with a concurrent load. Thus adding a store might create a
2312 data race where one was not already present in the source code,
2315 data race unless one already existed.
2363 (thus avoiding a race) is the assumption about address dependencies.
2393 race-candidate access by a fence. At first glance this may seem
2394 impossible. After all, to be race candidates the two accesses must
2415 Do the plain stores to y race? Clearly not if P1 reads a non-zero
2428 concurrent and there is no race, even though P1's plain store to y
2432 race-candidate stores W and W', where W ->co W', the LKMM says the
2433 stores don't race if W can be linked to W' by a
2445 sequence. For race-candidate load R and store W, the LKMM says the
2446 two accesses don't race if R can be linked to W by an
2461 of the appropriate sort exists, the LKMM says that the accesses race.
2478 If R and W are race candidates and it is possible to link R to
2483 If W and R are race candidates and it is possible to link W to
2488 If W and W' are race candidates and it is possible to link W