| /linux-6.3-rc2/Documentation/RCU/ |
| A D | checklist.rst | 28 read-side primitives is critically important.
91 primitives to add, remove, and replace elements on
108 appear atomic, as will individual atomic primitives.
111 of multiple atomic primitives. One alternative is to
156 various "_rcu()" list-traversal primitives, such
160 primitives. This is particularly useful in code that
167 list-traversal primitives can substitute for a good
171 and list_add_rcu() primitives must be used in order
228 primitives such as call_rcu().
334 9. All RCU list-traversal primitives, which include
[all …]
|
| A D | lockdep.rst | 14 In addition, RCU provides the following primitives that check lockdep's
30 checking of rcu_dereference() primitives:
107 traversal primitives check for being called from within an RCU read-side
110 traversal primitives will complain only if the lockdep expression is
|
| A D | whatisRCU.rst | 179 This temporal primitives is used by a reader to inform the
258 the _rcu list-manipulation primitives such as list_add_rcu().
321 primitives, such as list_for_each_entry_rcu() [2]_.
380 synchronize_rcu() and call_rcu() primitives used are the same for all three
381 flavors. However for protection (on the reader side), the primitives used vary
410 their assorted primitives.
493 rcu_assign_pointer() primitives from interfering with each other.
616 in terms of familiar locking primitives, and another that more closely
632 familiar locking primitives. Its overhead makes it a non-starter for
1155 update primitives.
[all …]
|
| A D | rcu_dereference.rst | 7 the similar primitives without worries. Dereferencing (prefix "*"),
14 - You must use one of the rcu_dereference() family of primitives
18 Without one of the rcu_dereference() primitives, compilers
164 kernel's wide array of primitives that cause code to
|
| A D | rcu.rst | 59 "synchronize_srcu", and the other RCU primitives. Or grab one
|
| A D | listRCU.rst | 137 primitives add READ_ONCE() and diagnostic checks for incorrect use
212 The list_del(), list_add(), and list_add_tail() primitives have been
214 The **_rcu()** list-manipulation primitives add memory barriers that are
|
| /linux-6.3-rc2/tools/memory-model/Documentation/ |
| A D | ordering.txt | 46 Note well that many of these primitives generate absolutely no code
58 The Linux-kernel primitives that provide full ordering include:
65 o RCU's grace-period primitives.
113 Finally, RCU's grace-period primitives provide full ordering. These
114 primitives include synchronize_rcu(), synchronize_rcu_expedited(),
117 Furthermore, RCU's grace-period primitives can only be invoked in
118 sleepable contexts. Therefore, RCU's grace-period primitives are
378 Compared to locking primitives and RMW atomic operations, markers
460 primitives required the compiler to emit the corresponding store
468 primitives required the compiler to emit the corresponding load
[all …]
|
| A D | simple.txt | 52 Please use the standard locking primitives provided by the kernel rather
53 than rolling your own. For one thing, the standard primitives interact
54 properly with lockdep. For another thing, these primitives have been
131 Packaged primitives: Sequence locking
148 primitives. (LKMM does not yet know about sequence locking, so it is
153 Packaged primitives: RCU
168 Packaged primitives: Atomic operations
194 Reading code using these primitives is often also quite helpful.
223 WRITE_ONCE() can safely be used in some cases. These primitives provide
226 One example use for these primitives is statistics, such as per-CPU
[all …]
|
| A D | README | 15 like an overview of the types of low-level concurrency primitives
20 o You are familiar with the Linux-kernel concurrency primitives
66 primitives by category.
|
| /linux-6.3-rc2/Documentation/mm/damon/ |
| A D | design.rst | 12 primitives that dependent on and optimized for the target address space. On
16 primitives implementations configurable with the core logic. We call the low
17 level primitives implementations monitoring operations.
27 primitives, those will be easily configurable.
|
| /linux-6.3-rc2/Documentation/devicetree/bindings/mailbox/ |
| A D | nvidia,tegra186-hsp.yaml | 16 primitives for interprocessor communication. So the interprocessor
18 primitives, when operating between two processors not in an SMP
|
| /linux-6.3-rc2/tools/testing/selftests/powerpc/ |
| A D | Makefile | 25 primitives \
|
| /linux-6.3-rc2/Documentation/core-api/ |
| A D | genericirq.rst | 121 primitives referenced by the assigned chip descriptor structure.
183 The helper functions call the chip primitives and are used by the
279 The simple flow handler does not call any handler/chip primitives.
367 These primitives are strictly intended to mean what they say: ack means
386 chip primitives. The per-irq structure is protected via desc->lock, by
|
| A D | index.rst | 60 Concurrency primitives
|
| /linux-6.3-rc2/include/linux/ |
| A D | intel_rapl.h | 73 u64 primitives[NR_RAPL_PRIMITIVES]; member
|
| /linux-6.3-rc2/Documentation/driver-api/usb/ |
| A D | dma.rst | 44 For those specific cases, USB has primitives to allocate less expensive
55 Most drivers should **NOT** be using these primitives; they don't need
135 calls (where the underlying DMA primitives have changed), most of them can
|
| /linux-6.3-rc2/Documentation/locking/ |
| A D | locktypes.rst | 12 The kernel provides a variety of locking primitives which can be divided
34 versions of these primitives. In short, don't acquire sleeping locks from
59 preemption and interrupt disabling primitives. Contrary to other locking
165 interrupt disabling and enabling primitives:
177 primitives:
180 of the protection scope while the regular primitives are scopeless and
|
| /linux-6.3-rc2/Documentation/devicetree/bindings/firmware/ |
| A D | nvidia,tegra210-bpmp.txt | 16 - reg: physical base address and length for HW synchornization primitives
|
| /linux-6.3-rc2/Documentation/ |
| A D | atomic_t.txt | 183 Fully ordered primitives are ordered against everything prior and everything
202 ordering on their SMP atomic primitives. For example our TSO architectures
367 their locking primitives.
|
| /linux-6.3-rc2/Documentation/process/ |
| A D | volatile-considered-harmful.rst | 21 Like volatile, the kernel primitives which make concurrent access to data
38 primitives act as memory barriers - they are explicitly written to do so -
|
| /linux-6.3-rc2/Documentation/driver-api/ |
| A D | i2c.rst | 35 operations, either using I2C primitives or by issuing SMBus commands to
|
| /linux-6.3-rc2/tools/testing/selftests/futex/ |
| A D | README | 11 primitives. These can be used as is in user applications or can serve as
|
| /linux-6.3-rc2/Documentation/staging/ |
| A D | speculation.rst | 73 primitives.
|
| /linux-6.3-rc2/drivers/firmware/arm_scmi/ |
| A D | Kconfig | 126 primitives all over instead. If unsure say N.
167 primitives all over instead. If unsure say N.
|
| /linux-6.3-rc2/drivers/crypto/caam/ |
| A D | Kconfig | 142 Supported cryptographic primitives: encryption, decryption,
|