Lines Matching refs:operations

12      - Device operations.
47 - Atomic operations.
101 Each CPU executes a program that generates memory access operations. In the
103 perform the memory operations in any order it likes, provided program causality
108 So in the above diagram, the effects of the memory operations performed by a
109 CPU are perceived by the rest of the system as the operations cross the
199 the CPU will issue the following memory operations:
214 the CPU will only issue the following sequence of memory operations:
321 As can be seen above, independent memory operations are effectively performed
327 ordering over the memory operations on either side of the barrier.
331 deferral and combination of memory operations; speculative loads; speculative
344 A write memory barrier gives a guarantee that all the STORE operations
346 operations specified after the barrier with respect to the other
352 A CPU can be viewed as committing a sequence of store operations to the
399 LOAD operations specified before the barrier will appear to happen before
400 all the LOAD operations specified after the barrier with respect to the
416 operations specified before the barrier will appear to happen before all
417 the LOAD and STORE operations specified after the barrier with respect to
428 (5) ACQUIRE operations.
431 operations after the ACQUIRE operation will appear to happen after the
433 ACQUIRE operations include LOCK operations and smp_load_acquire()
434 operations.
436 Memory operations that occur before an ACQUIRE operation may appear to
443 (6) RELEASE operations.
446 memory operations before the RELEASE operation will appear to happen
448 system. RELEASE operations include UNLOCK operations and
449 smp_store_release() operations.
451 Memory operations that occur after a RELEASE operation may appear to
454 The use of ACQUIRE and RELEASE operations generally precludes the need
890 Firstly, write barriers act as partial orderings on store operations.
1667 memory operations appear to a device by prohibiting both the compiler and the
1701 operations" subsection for information on where to use these.
1795 In all cases there are variants on "ACQUIRE" operations and "RELEASE" operations
1796 for each construct. These operations all imply certain barriers:
1800 Memory operations issued after the ACQUIRE will be completed after the
1803 Memory operations issued before the ACQUIRE may be completed after
1811 Memory operations issued before the RELEASE will be completed before the
1814 Memory operations issued after the RELEASE may be completed before the
1819 All ACQUIRE operations issued before another ACQUIRE operation will be
1824 All ACQUIRE operations issued before a RELEASE operation will be
1880 that matter, the developer) switched the operations, deadlock
1883 But suppose the CPU reordered the operations. In this case,
1902 with interrupt disabling operations.
2209 (*) Atomic operations.
2224 operations that affect both CPUs may have to be carefully ordered to prevent
2321 operations are noted specially as some of them imply full memory barriers and
2328 explicit lock operations, described later). These include:
2350 operations and adjusting reference counters towards object destruction, and as
2354 The following operations are potential problems as they do _not_ imply memory
2356 operations:
2391 The following operations are special locking primitives:
2397 These implement ACQUIRE-class and RELEASE-class operations. These should be used in
2398 preference to other operations when implementing locking primitives, because
2447 form of locking), such that the critical operations are all contained within
2478 sections will include synchronous load operations on strictly ordered I/O
2548 ordering with respect to LOCK or UNLOCK operations. If the latter is
2594 The way cached memory operations are perceived across the system is affected to
2633 generate load and store operations which then go into the queue of memory
2696 (*) each cache has a queue of operations that need to be applied to that cache
2826 operations in exactly the order specified, so that if the CPU is, for example,
2837 operations as seen by external observers in the system: