Lines Matching refs:strong

815 	Any store which propagates to C before a strong fence is
818 	the strong fence are executed on C.
820 The propagation ordering enforced by release fences and strong fences
824 strong fences are A-cumulative.  By contrast, smp_wmb() fences are not
836 The fences which affect propagation order (i.e., strong, release, and
847 	A strong fence event occurs between some X and F in program
973 	A strong (smp_mb() or synchronize_rcu()) fence occurs between
1170 The LKMM requires that smp_rmb(), acquire fences, and strong fences
1174 the local cache.  In the case of a strong fence, the CPU first has to
1178 when the strong fence began.
1370 particular properties of strong fences, which we cover in the next
1378 features of strong fences.  It links two events E and F whenever some
1382 optional rfe link, a strong fence, and an arbitrary number of hb
1389 	E ->coe W ->cumul-fence* X ->rfe? Y ->strong-fence Z ->hb* F,
1395 before the strong fence executes.  Because this fence is strong, we
1413 A good example illustrating how pb works is the SB pattern with strong
1438 value read by P0), and a strong fence between P1's store and its load.
1513 to propagate to every CPU are fulfilled by placing strong fences at
1581 means that rcu-fence acts kind of like a strong fence.  In particular,
1614 relation was defined in terms of strong-fence.  We will omit the
1819 annotations for them; they act as strong fences just like smp_mb()