Lines Matching full:strong

831 	Strong fences, including smp_mb() and synchronize_rcu(), force
862 	Any store which propagates to C before a strong fence is
865 	the strong fence are executed on C.
867 The propagation ordering enforced by release fences and strong fences
871 strong fences are A-cumulative.  By contrast, smp_wmb() fences are not
883 The fences which affect propagation order (i.e., strong, release, and
894 	A strong fence event occurs between some X and F in program
1024 	A strong (smp_mb() or synchronize_rcu()) fence occurs between
1197 The LKMM requires that smp_rmb(), acquire fences, and strong fences
1201 case of a strong fence, the CPU first has to wait for all of its
1204 as of that time -- not just the stores received when the strong fence
1397 particular properties of strong fences, which we cover in the next
1405 features of strong fences.  It links two events E and F whenever some
1409 optional rfe link, a strong fence, and an arbitrary number of hb
1416 	E ->coe W ->cumul-fence* X ->rfe? Y ->strong-fence Z ->hb* F,
1422 before the strong fence executes.  Because this fence is strong, we
1440 A good example illustrating how pb works is the SB pattern with strong
1465 value read by P0), and a strong fence between P1's store and its load.
1543 to propagate to every CPU are fulfilled by placing strong fences at
1609 means that rcu-order links act kind of like strong fences.  In
1647 the strong-fence relation links events that are separated by an
1649 like strong fences).  Written symbolically, X ->rcu-fence Y means
1657 "super-strong" fence: Unlike the original strong fences (smp_mb() and
1664 relation was defined in terms of strong-fence.  We will omit the
2106 	Z is connected to Y by a strong-fence link followed by a
2125 	strong-fence memory barriers force stores that are po-before
2457 	strong-fence ; xb* ; {w and/or r}-pre-bounded
2559 annotations for them; they act as strong fences just like smp_mb()