Lines Matching full:accesses

15 2.	Ordered memory accesses.  These operations order themselves
16 	against some or all of the CPU's prior accesses or some or all
17 	of the CPU's subsequent accesses, depending on the subcategory
20 3.	Unordered accesses, as the name indicates, have no ordering
48 a device driver, which must correctly order accesses to a physical
68 accesses against all subsequent accesses from the viewpoint of all CPUs.
89 CPU's accesses into three groups:
242 Ordered Memory Accesses
245 The Linux kernel provides a wide variety of ordered memory accesses:
264 of the CPU's prior memory accesses.  Release operations often provide
323 memory accesses.  Acquire operations often provide improved performance
391 of the CPU's subsequent memory accesses whose address has been calculated
438 Unordered Accesses
441 Each of these two categories of unordered accesses has a section below:
445 b.	Unmarked C-language accesses.
454 of unordered marked accesses can also be constrained using the mechanisms
495 Unmarked C-Language Accesses
498 Unmarked C-language accesses are normal variable accesses to normal
507 Unmarked C-language accesses are unordered, and are also subject to
509 concurrent code.  It is possible to used unmarked C-language accesses for
514 C-language accesses requires careful attention to not just your code,
520 But there are some ways of using unmarked C-language accesses for shared
523 o	Guard all accesses to a given variable by a particular lock,
524 	so that there are never concurrent conflicting accesses to
525 	that variable.	(There are "conflicting accesses" when
526 	(1) at least one of the concurrent accesses to a variable is an
528 	accesses is a write, whether marked or not.)
533 o	Use locking or other means to ensure that all concurrent accesses
553 Used properly, unmarked C-language accesses can reduce overhead on