Lines Matching full:these

15 2.	Ordered memory accesses.  These operations order themselves
23 	some of these "unordered" operations provide limited ordering
46 Note well that many of these primitives generate absolutely no code
82 Second, some RMW atomic operations provide full ordering.  These
113 Finally, RCU's grace-period primitives provide full ordering.  These
115 synchronize_srcu() and so on.  However, these primitives have orders
132 full ordering for these primitives.  One way to obtain full ordering on
263 end in _release.  These operations order their own store against all
321 and value-returning RMW operations whose names end in _acquire.   These
441 Each of these two categories of unordered accesses has a section below:
452 However, if a group of CPUs apply these operations to a single variable,
457 These operations come in three categories:
459 o	Marked writes, such as WRITE_ONCE() and atomic_set().  These
465 	operations, unless these operations are to the same variable.
467 o	Marked reads, such as READ_ONCE() and atomic_read().  These
473 	operations, unless these operations are to the same variable.
475 o	Unordered RMW atomic operations.  These are non-value-returning
479 	and atomic64_fetch_xor_relaxed().  These operations do carry
483 	However, many CPUs will happily reorder these operations with
490 In short, these operations can be freely reordered unless they are all
500 C11 atomic variables.  These operations provide no ordering guarantees,
545 understand the compilers.  One place to start is these two LWN