Home
last modified time | relevance | path

Searched refs:primitives (Results 1 – 25 of 65) sorted by relevance

123

/linux/mm/damon/
A DKconfig28 bool "Data access monitoring primitives for virtual address spaces"
32 This builds the default data access monitoring primitives for DAMON
36 bool "Data access monitoring primitives for the physical address space"
40 This builds the default data access monitoring primitives for DAMON
44 bool "Test for DAMON primitives" if !KUNIT_ALL_TESTS
48 This builds the DAMON virtual addresses primitives Kunit test suite.
/linux/Documentation/RCU/
A Dchecklist.rst28 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
312 9. All RCU list-traversal primitives, which include
[all …]
A Dlockdep.rst14 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
A Drcu_dereference.rst7 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
A DwhatisRCU.rst245 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
A DlistRCU.rst123 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
/linux/tools/memory-model/Documentation/
A Dordering.txt46 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 Dsimple.txt52 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 DREADME15 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/Documentation/vm/damon/
A Ddesign.rst12 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 implementations of the primitives for the physical
45 This is only for the virtual address space primitives implementation. That for
/linux/Documentation/devicetree/bindings/mailbox/
A Dnvidia,tegra186-hsp.txt4 together. It provides a set of hardware synchronization primitives for
6 protocols can use hardware synchronization primitives, when operating between
/linux/drivers/staging/clocking-wizard/
A DTODO5 refactoring of the clk primitives:
/linux/Documentation/core-api/
A Dgenericirq.rst121 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 Dindex.rst47 Concurrency primitives
/linux/Documentation/locking/
A Dlocktypes.rst12 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/Documentation/driver-api/usb/
A Ddma.rst44 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/tools/testing/selftests/powerpc/
A DMakefile25 primitives \
/linux/include/linux/
A Dintel_rapl.h67 u64 primitives[NR_RAPL_PRIMITIVES]; member
/linux/Documentation/devicetree/bindings/firmware/
A Dnvidia,tegra210-bpmp.txt16 - reg: physical base address and length for HW synchornization primitives
/linux/Documentation/
A Datomic_t.txt183 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/Documentation/process/
A Dvolatile-considered-harmful.rst21 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/Documentation/driver-api/
A Di2c.rst35 operations, either using I2C primitives or by issuing SMBus commands to
/linux/tools/testing/selftests/futex/
A DREADME11 primitives. These can be used as is in user applications or can serve as
/linux/Documentation/staging/
A Dspeculation.rst73 primitives.
/linux/drivers/crypto/caam/
A DKconfig142 Supported cryptographic primitives: encryption, decryption,

Completed in 35 milliseconds

123