Lines Matching full:race

2231 program executes, there will not be any data races.  A "data race"
2247 are "race candidates" if they satisfy 1 - 4.  Thus, whether or not two
2248 race candidates actually do race in a given execution depends on
2251 The LKMM tries to determine whether a program contains race candidates
2253 a potential data race and makes no predictions about the program's
2256 Determining whether two accesses are race candidates is easy; you can
2366 limitations.  For one, it is not allowed to introduce a data race into
2368 race (if it could, memory models would be useless and no multithreaded
2423 This program does not contain a data race.  Although the U and V
2424 accesses are race candidates, the LKMM can prove they are not
2439 	race with U.)
2449 data race between them.
2497 constitute a race (they can't interfere with each other), but a store
2498 does race with a concurrent load.  Thus adding a store might create a
2499 data race where one was not already present in the source code,
2502 data race unless one already existed.
2550 (thus avoiding a race) is the assumption about address dependencies.
2580 race-candidate access by a fence.  At first glance this may seem
2581 impossible.  After all, to be race candidates the two accesses must
2602 Do the plain stores to y race?  Clearly not if P1 reads a non-zero
2615 concurrent and there is no race, even though P1's plain store to y
2619 race-candidate stores W and W', where W ->co W', the LKMM says the
2620 stores don't race if W can be linked to W' by a
2632 sequence.  For race-candidate load R and store W, the LKMM says the
2633 two accesses don't race if R can be linked to W by an
2648 of the appropriate sort exists, the LKMM says that the accesses race.
2665 	If R and W are race candidates and it is possible to link R to
2670 	If W and R are race candidates and it is possible to link W to
2675 	If W and W' are race candidates and it is possible to link W