Lines Matching full:relation
15 7. THE PROGRAM ORDER RELATION: po AND po-loc
18 10. THE READS-FROM RELATION: rf, rfi, and rfe
19 11. CACHE COHERENCE AND THE COHERENCE ORDER RELATION: co, coi, and coe
20 12. THE FROM-READS RELATION: fr, fri, and fre
22 14. PROPAGATION ORDER RELATION: cumul-fence
26 18. THE PRESERVED PROGRAM ORDER RELATION: ppo
28 20. THE HAPPENS-BEFORE RELATION: hb
29 21. THE PROPAGATES-BEFORE RELATION: pb
53 through 12 (THE FROM_READS RELATION) describe the fundamental
325 THE PROGRAM ORDER RELATION: po AND po-loc
328 The most important relation between events is program order (po). You
336 This is inherently a single-CPU relation; two instructions executing
340 po-loc is a sub-relation of po. It links two memory accesses when the
425 memory model cannot assume there is a fixed program order relation
433 We say that two events are linked by a dependency relation when the
493 THE READS-FROM RELATION: rf, rfi, and rfe
496 The reads-from relation (rf) links a write event to a read event when
508 Usage of the rf relation implicitly assumes that loads will always
559 CACHE COHERENCE AND THE COHERENCE ORDER RELATION: co, coi, and coe
674 Just like the po relation, co is inherently an ordering -- it is not
676 just like with the rf relation, we distinguish between stores that
686 THE FROM-READS RELATION: fr, fri, and fre
689 The from-reads relation (fr) can be a little difficult for people to
714 As with rf, rfi, and rfe, we subdivide the fr relation into fri (when
718 Note that the fr relation is determined entirely by the rf and co
833 PROPAGATION ORDER RELATION: cumul-fence
838 though smp_wmb() isn't A-cumulative. The cumul-fence relation is
955 where the rmw relation links the read and write events making up each
959 THE PRESERVED PROGRAM ORDER RELATION: ppo
964 "preserved program order") relation, which links the po-earlier
965 instruction to the po-later instruction and is thus a sub-relation of
1019 includes address dependencies to loads in the ppo relation.
1184 THE HAPPENS-BEFORE RELATION: hb
1187 The happens-before relation (hb) links memory accesses that have to
1188 execute in a certain order. hb includes the ppo relation and two
1214 The third relation included in hb is like ppo, in that it only links
1217 cache coherence. The relation is called prop, and it links two events
1314 would generate a cycle in the hb relation: The fence would create a ppo
1316 prop relation would give an hb link from the second load to the first.
1321 The formal definition of the prop relation involves a coe or fre link,
1364 In summary, the fact that the hb relation links memory access events
1368 The LKMM defines yet another relation connected to times of
1374 THE PROPAGATES-BEFORE RELATION: pb
1377 The propagates-before (pb) relation capitalizes on the special
1449 In summary, the fact that the pb relation links events in the order
1527 rcu-link relation. rcu-link encompasses a very general notion of
1534 The formal definition of the rcu-link relation is more than a little
1536 relation, and the details don't matter unless you want to comb through
1555 If we think of the rcu-link relation as standing for an extended
1565 The LKMM goes on to define the rcu-fence relation as a sequence of gp
1580 The rcu-fence relation is important because the Grace Period Guarantee
1612 Finally, the LKMM defines the RCU-before (rb) relation in terms of
1614 relation was defined in terms of strong-fence. We will omit the
1619 Guarantee by requiring that the rb relation does not contain a cycle.
1641 relation, and F is po-before the grace period S:
1655 discussion of the rcu-link relation earlier) that X and Z are related
1777 definition of the prop relation makes the initial coe or fre part
1778 optional, and it doesn't require the events linked by the relation to