Lines Matching refs:P0
113 P0()
129 Here the P0() function represents the interrupt handler running on one
132 Thus, P0 stores the data in buf and then sets flag. Meanwhile, P1
160 instance, P1 might run entirely before P0 begins, in which case r1 and
161 r2 will both be 0 at the end. Or P0 might run entirely before P1
165 routines run concurrently. One possibility is that P1 runs after P0's
194 Since r1 = 1, P0 must store 1 to flag before P1 loads 1 from
200 P1 must load 0 from buf before P0 stores 1 to it; otherwise r2
204 P0 stores 1 to buf before storing 1 to flag, since it executes
225 P0()
268 W: P0 stores 1 to flag executes before
271 Z: P0 stores 1 to buf executes before
272 W: P0 stores 1 to flag.
370 usage, we can be certain that in the MP example, P0's write event to
516 P0()
529 from the value stored by P0).
539 P0()
553 from both of P0's stores. It is possible to handle mixed-size and
618 P0()
632 P0()
648 P0()
661 If r1 = 5 (reading from P0's store) and r2 = 0 (reading from the
700 P0()
1104 P0()
1125 smp_wmb() forces P0's store to x to propagate to P1 before the store
1227 P0()
1240 If r1 = 8 at the end then P0's accesses must have executed in program
1241 order. We can deduce this from the operational model; if P0's load
1244 8. In this case there is a prop link from P0's write event to its read
1245 event, because P1's store came after P0's store in x's coherence
1246 order, and P1's store propagated to P0 before P0's load executed.
1253 P0()
1266 If r1 = 0 and r2 = 9 at the end then P0's accesses must have executed
1268 then the x = 9 store must have been propagated to P0 before the first
1270 case there is a prop link from P0's first read event to its second,
1271 because P1's store overwrote the value read by P0's first load, and
1272 P1's store propagated to P0 before P0's second load executed.
1280 P0()
1300 overwritten by P0's store to buf, the fence guarantees that the store
1331 P0()
1355 link from P0's store to its load. This is because P0's store gets
1360 guarantees that the stores to x and y both propagate to P0 before the
1361 store to z does (the second fence), and P0's load executes after the
1362 store to z has propagated to P0 (an rfe link).
1418 P0()
1436 If r0 = 0 at the end then there is a pb link from P0's load to P1's
1437 load: an fre link from P0's load to P1's store (which overwrites the
1438 value read by P0), and a strong fence between P1's store and its load.
1444 to P0's. This means that if both r1 and r2 were 0 there would be a
1486 P0()
1505 means that P0's store to x propagated to P1 before P1 called
1506 synchronize_rcu(), so P0's critical section must have started before
1507 P1's grace period. On the other hand, r2 = 0 means that P0's store to
1675 P0()
1693 If r2 = 0 at the end then P0's store at X overwrites the value that
1698 If r1 = 1 at the end then P1's load at Y reads from P0's store at W,
1710 P0()
1746 P0 P1 P2
1761 This requires P0 and P2 to execute their loads and stores out of
1764 section in P0 both starts before P1's grace period does and ends
1876 P0()