Lines Matching refs:loads
78 for the loads, the model will predict whether it is possible for the
79 code to run in such a way that the loads will indeed obtain the
141 shared memory locations and another CPU loads from those locations in
153 A memory model will predict what values P1 might obtain for its loads
196 Since r1 = 1, P0 must store 1 to flag before P1 loads 1 from
197 it, as loads can obtain values only from earlier stores.
199 P1 loads from flag before loading from buf, since CPUs execute
222 each CPU stores to its own shared location and then loads from the
271 X: P1 loads 1 from flag executes before
272 Y: P1 loads 0 from buf executes before
277 and a certain outcome for the loads in a piece of code can happen only
292 Read events correspond to loads from shared memory, such as
504 Usage of the rf relation implicitly assumes that loads will always
596 loads, then either they read from the same store or else the
663 (As a minor curiosity, if this code had used normal loads instead of
733 only internal operations. However, loads, stores, and fences involve
759 to satisfy one of the CPU's loads until it has been processed. On
784 smp_rmb() forces the CPU to execute all po-earlier loads
785 before any po-later loads;
897 inserting the loads from that location into this ordering, by placing
899 store. This leaves the relative positions of loads that read from the
933 CPU 0 loads x obtaining 13;
934 CPU 1 loads x obtaining 13;
979 X and Y are both loads and an smp_rmb() fence occurs between
989 X and Y are both loads, X ->addr Y (i.e., there is an address
1009 we consider address dependencies to loads.
1012 loads in program order if there is an address dependency between them.
1016 that looks as if the loads were executed out of order (see the next
1018 problem when the loads come from READ_ONCE(), and therefore the LKMM
1019 includes address dependencies to loads in the ppo relation.
1022 two loads. This happens when there is a dependency from a load to a
1075 not appear to respect address dependencies to loads. This means that
1115 final effect is that even though the two loads really are executed in
1123 between P1's two loads when the kernel is compiled for the Alpha
1148 instructions (or po-later loads in the case of smp_rmb()) until all
1224 An equally simple case involves two loads of the same location that
1275 similar to the previous examples: The value P1 loads from buf gets
1288 But what if we put an smp_rmb() fence between P1's loads? The fence
1289 would force the two loads to be executed in program order, and it
1762 This requires P0 and P2 to execute their loads and stores out of
2200 therefore any loads among those instructions will execute
2219 This distinction is needed because some fences affect only loads
2227 allowed to put plain loads of the same location into the object code.
2252 a concurrent load from that location. Two concurrent loads don't