Searched refs:primitives (Results 1 – 25 of 64) sorted by relevance
123
| /Linux-v5.15/mm/damon/ |
| D | Kconfig | 28 bool "Data access monitoring primitives for virtual address spaces"
32 This builds the default data access monitoring primitives for DAMON
36 bool "Test for DAMON primitives" if !KUNIT_ALL_TESTS
40 This builds the DAMON virtual addresses primitives Kunit test suite.
|
| /Linux-v5.15/Documentation/RCU/ |
| D | checklist.rst | 28 read-side primitives is critically important.
60 rcu_read_lock() and friends? These primitives are needed
86 primitives to add, remove, and replace elements on
103 appear atomic, as will individual atomic primitives.
106 of multiple atomic primitives.
147 various "_rcu()" list-traversal primitives, such
151 primitives. This is particularly useful in code that
158 list-traversal primitives can substitute for a good
162 and list_add_rcu() primitives must be used in order
174 The list_replace_rcu() and hlist_replace_rcu() primitives
[all …]
|
| D | lockdep.rst | 14 In addition, RCU provides the following primitives that check lockdep's
28 checking of rcu_dereference() primitives:
104 traversal primitives check for being called from within an RCU read-side
107 traversal primitives will complain only if the lockdep expression is
|
| 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
157 kernel's wide array of primitives that cause code to
|
| D | listRCU.rst | 123 become list_for_each_entry_rcu(). The **_rcu()** list-traversal primitives
197 The list_del(), list_add(), and list_add_tail() primitives have been
199 The **_rcu()** list-manipulation primitives add memory barriers that are needed on
|
| D | whatisRCU.rst | 245 the _rcu list-manipulation primitives such as list_add_rcu().
307 primitives, such as list_for_each_entry_rcu() [2]_.
363 synchronize_rcu() and call_rcu() primitives used are the same for all three
364 flavors. However for protection (on the reader side), the primitives used vary
475 rcu_assign_pointer() primitives from interfering with each other.
591 in terms of familiar locking primitives, and another that more closely
607 familiar locking primitives. Its overhead makes it a non-starter for
|
| /Linux-v5.15/tools/memory-model/Documentation/ |
| D | ordering.txt | 46 Note well that many of these primitives generate absolutely no code
50 ordering primitives provided for that purpose. For example, instead of
58 The Linux-kernel primitives that provide full ordering include:
65 o RCU's grace-period primitives.
79 memory-ordering primitives. It is surprisingly hard to remember their
113 Finally, RCU's grace-period primitives provide full ordering. These
114 primitives include synchronize_rcu(), synchronize_rcu_expedited(),
115 synchronize_srcu() and so on. However, these primitives have orders
117 Furthermore, RCU's grace-period primitives can only be invoked in
118 sleepable contexts. Therefore, RCU's grace-period primitives are
[all …]
|
| 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.
222 Unordered primitives such as atomic_read(), atomic_set(), READ_ONCE(), and
223 WRITE_ONCE() can safely be used in some cases. These primitives provide
[all …]
|
| 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-v5.15/Documentation/vm/damon/ |
| D | design.rst | 12 primitives that dependent on and optimized for the target address space. On
16 primitives implementations configurable with the core logic.
21 implement the primitives on their own.
26 primitives, those will be easily configurable.
32 The low level primitives for the fundamental access monitoring are defined in
38 DAMON currently provides the implementation of the primitives for only the
|
| /Linux-v5.15/drivers/staging/clocking-wizard/ |
| D | TODO | 5 refactoring of the clk primitives:
|
| /Linux-v5.15/Documentation/devicetree/bindings/mailbox/ |
| D | nvidia,tegra186-hsp.txt | 4 together. It provides a set of hardware synchronization primitives for
6 protocols can use hardware synchronization primitives, when operating between
|
| /Linux-v5.15/tools/testing/selftests/powerpc/ |
| D | Makefile | 25 primitives \
|
| /Linux-v5.15/Documentation/core-api/ |
| 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
|
| D | index.rst | 47 Concurrency primitives
|
| /Linux-v5.15/include/linux/ |
| D | intel_rapl.h | 67 u64 primitives[NR_RAPL_PRIMITIVES]; member
|
| /Linux-v5.15/Documentation/driver-api/usb/ |
| 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-v5.15/Documentation/locking/ |
| 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-v5.15/Documentation/devicetree/bindings/firmware/ |
| D | nvidia,tegra210-bpmp.txt | 16 - reg: physical base address and length for HW synchornization primitives
|
| /Linux-v5.15/Documentation/ |
| 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-v5.15/Documentation/process/ |
| 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-v5.15/Documentation/driver-api/ |
| D | i2c.rst | 35 operations, either using I2C primitives or by issuing SMBus commands to
|
| /Linux-v5.15/tools/testing/selftests/futex/ |
| D | README | 11 primitives. These can be used as is in user applications or can serve as
|
| /Linux-v5.15/Documentation/staging/ |
| D | speculation.rst | 73 primitives.
|
| /Linux-v5.15/kernel/ |
| D | Kconfig.preempt | 65 various locking primitives (spinlocks, rwlocks, etc.) with
|
123
