Searched full:primitives (Results 1 – 25 of 236) sorted by relevance
12345678910
| /Linux-v6.6/Documentation/RCU/ |
| D | checklist.rst | 28 read-side primitives is critically important.
60 rcu_read_lock() and friends? These primitives are needed
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
183 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
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
|
| 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
1154 update primitives.
[all …]
|
| /Linux-v6.6/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-v6.6/Documentation/crypto/ |
| D | api-kpp.rst | 1 Key-agreement Protocol Primitives (KPP) Cipher Algorithm Definitions
7 Key-agreement Protocol Primitives (KPP) Cipher API
11 :doc: Generic Key-agreement Protocol Primitives API
16 Key-agreement Protocol Primitives (KPP) Cipher Request Handle
|
| /Linux-v6.6/include/linux/ |
| D | rculist.h | 39 * only if list_del() and similar primitives are not also used on the
101 * the _rcu list-traversal primitives, such as
122 * the _rcu list-traversal primitives, such as
147 * the _rcu list-traversal primitives, such as
179 * primitives, such as hlist_for_each_entry_rcu().
304 * primitives such as list_add_rcu() as long as it's guarded by rcu_read_lock().
348 * primitives such as list_add_rcu() as long as it's guarded by rcu_read_lock().
367 * primitives such as list_add_rcu() as long as it's guarded by rcu_read_lock().
386 * the _rcu list-mutation primitives such as list_add_rcu()
403 * the _rcu list-mutation primitives such as list_add_rcu()
[all …]
|
| D | processor.h | 2 /* Misc low level processor primitives */
16 * of these primitives. It should not lock or take any other resource.
46 * primitives, above.
|
| D | rculist_nulls.h | 31 * primitives, such as hlist_nulls_for_each_entry_rcu().
71 * the _rcu list-traversal primitives, such as
94 * the _rcu list-traversal primitives, such as
125 * the _rcu list-traversal primitives, such as
|
| D | rculist_bl.h | 43 * the _rcu list-traversal primitives, such as
66 * the _rcu list-traversal primitives, such as
|
| /Linux-v6.6/include/acpi/ |
| D | acpiosxf.h | 45 * OSL Initialization and shutdown primitives
82 * Spinlock primitives
101 * RAW spinlock primitives. If the OS does not provide them, fallback to
102 * spinlock primitives
122 * Semaphore primitives
144 * Mutex primitives. May be configured to use semaphores instead via
|
| /Linux-v6.6/Documentation/devicetree/bindings/mailbox/ |
| D | nvidia,tegra186-hsp.yaml | 7 title: NVIDIA Tegra Hardware Synchronization Primitives (HSP)
16 primitives for interprocessor communication. So the interprocessor
18 primitives, when operating between two processors not in an SMP
|
| /Linux-v6.6/drivers/scsi/isci/ |
| D | phy.h | 277 * primitives received.
283 * primitives transmitted.
295 * primitives received.
301 * primitives transmitted.
307 * primitives received.
|
| /Linux-v6.6/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-v6.6/include/linux/mtd/ |
| D | xip.h | 3 * MTD primitives for XIP support
68 #warning "missing IRQ and timer primitives for XIP MTD support"
|
| /Linux-v6.6/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
|
| /Linux-v6.6/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-v6.6/arch/riscv/include/asm/ |
| D | mmio.h | 83 * Unordered I/O memory access primitives. These are even more relaxed than
101 * Relaxed I/O memory access primitives. These follow the Device memory
128 * I/O memory access primitives. Reads are ordered relative to any following
|
| /Linux-v6.6/kernel/rcu/ |
| D | rcutorture.c | 85 torture_param(bool, gp_cond, false, "Use conditional/async GP wait primitives");
86 torture_param(bool, gp_cond_exp, false, "Use conditional/async expedited GP wait primitives");
87 torture_param(bool, gp_cond_full, false, "Use conditional/async full-state GP wait primitives");
89 "Use conditional/async full-stateexpedited GP wait primitives");
90 torture_param(bool, gp_exp, false, "Use expedited GP wait primitives");
91 torture_param(bool, gp_normal, false, "Use normal (non-expedited) GP wait primitives");
92 torture_param(bool, gp_poll, false, "Use polling GP wait primitives");
93 torture_param(bool, gp_poll_exp, false, "Use polling expedited GP wait primitives");
94 torture_param(bool, gp_poll_full, false, "Use polling full-state GP wait primitives");
95 torture_param(bool, gp_poll_exp_full, false, "Use polling full-state expedited GP wait primitives");
[all …]
|
| /Linux-v6.6/crypto/ |
| D | kpp.c | 3 * Key-agreement Protocol Primitives (KPP)
173 MODULE_DESCRIPTION("Key-agreement Protocol Primitives");
|
| /Linux-v6.6/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-v6.6/drivers/firmware/arm_scmi/ |
| D | Kconfig | 126 primitives all over instead. If unsure say N.
167 primitives all over instead. If unsure say N.
|
| /Linux-v6.6/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-v6.6/include/crypto/ |
| D | kpp.h | 3 * Key-agreement Protocol Primitives (KPP)
69 * struct kpp_alg - generic key-agreement protocol primitives
111 * DOC: Generic Key-agreement Protocol Primitives API
|
12345678910
