Searched full:primitives (Results 1 – 25 of 304) sorted by relevance
12345678910>>...13
28 read-side primitives is critically important.60 rcu_read_lock() and friends? These primitives are needed91 primitives to add, remove, and replace elements on108 appear atomic, as will individual atomic primitives.111 of multiple atomic primitives. One alternative is to156 various "_rcu()" list-traversal primitives, such160 primitives. This is particularly useful in code that167 list-traversal primitives can substitute for a good171 and list_add_rcu() primitives must be used in order183 The list_replace_rcu() and hlist_replace_rcu() primitives[all …]
14 In addition, RCU provides the following primitives that check lockdep's30 checking of rcu_dereference() primitives:107 traversal primitives check for being called from within an RCU read-side110 traversal primitives will complain only if the lockdep expression is
46 Note well that many of these primitives generate absolutely no code50 ordering primitives provided for that purpose. For example, instead of58 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 their113 Finally, RCU's grace-period primitives provide full ordering. These114 primitives include synchronize_rcu(), synchronize_rcu_expedited(),115 synchronize_srcu() and so on. However, these primitives have orders117 Furthermore, RCU's grace-period primitives can only be invoked in118 sleepable contexts. Therefore, RCU's grace-period primitives are[all …]
52 Please use the standard locking primitives provided by the kernel rather53 than rolling your own. For one thing, the standard primitives interact54 properly with lockdep. For another thing, these primitives have been131 Packaged primitives: Sequence locking148 primitives. (LKMM does not yet know about sequence locking, so it is153 Packaged primitives: RCU168 Packaged primitives: Atomic operations194 Reading code using these primitives is often also quite helpful.222 Unordered primitives such as atomic_read(), atomic_set(), READ_ONCE(), and223 WRITE_ONCE() can safely be used in some cases. These primitives provide[all …]
15 like an overview of the types of low-level concurrency primitives20 o You are familiar with the Linux-kernel concurrency primitives66 primitives by category.
1 Key-agreement Protocol Primitives (KPP) Cipher Algorithm Definitions7 Key-agreement Protocol Primitives (KPP) Cipher API11 :doc: Generic Key-agreement Protocol Primitives API16 Key-agreement Protocol Primitives (KPP) Cipher Request Handle
39 * only if list_del() and similar primitives are not also used on the101 * the _rcu list-traversal primitives, such as122 * the _rcu list-traversal primitives, such as147 * the _rcu list-traversal primitives, such as179 * 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 …]
2 /* Misc low level processor primitives */16 * of these primitives. It should not lock or take any other resource.46 * primitives, above.
31 * primitives, such as hlist_nulls_for_each_entry_rcu().71 * the _rcu list-traversal primitives, such as94 * the _rcu list-traversal primitives, such as125 * the _rcu list-traversal primitives, such as
43 * the _rcu list-traversal primitives, such as66 * the _rcu list-traversal primitives, such as
... /primitives/boolean.py mesonbuild/interpreter/primitives/dict.py mesonbuild/interpreter/primitives/ ...
45 * OSL Initialization and shutdown primitives82 * Spinlock primitives101 * RAW spinlock primitives. If the OS does not provide them, fallback to102 * spinlock primitives122 * Semaphore primitives144 * Mutex primitives. May be configured to use semaphores instead via
1 NVIDIA Tegra Hardware Synchronization Primitives (HSP)4 together. It provides a set of hardware synchronization primitives for6 protocols can use hardware synchronization primitives, when operating between
19 /* Primitives for a Win32 event */25 /* Basic sanity checking: test the Win32 event primitives */31 * primitives. SET/RESET/WAIT have exactly the same semantics as
7 title: NVIDIA Tegra Hardware Synchronization Primitives (HSP)16 primitives for interprocessor communication. So the interprocessor18 primitives, when operating between two processors not in an SMP
277 * primitives received.283 * primitives transmitted.295 * primitives received.301 * primitives transmitted.307 * primitives received.
44 For those specific cases, USB has primitives to allocate less expensive55 Most drivers should **NOT** be using these primitives; they don't need135 calls (where the underlying DMA primitives have changed), most of them can
3 * MTD primitives for XIP support68 #warning "missing IRQ and timer primitives for XIP MTD support"
121 primitives referenced by the assigned chip descriptor structure.183 The helper functions call the chip primitives and are used by the279 The simple flow handler does not call any handler/chip primitives.367 These primitives are strictly intended to mean what they say: ack means386 chip primitives. The per-irq structure is protected via desc->lock, by
12 The kernel provides a variety of locking primitives which can be divided34 versions of these primitives. In short, don't acquire sleeping locks from59 preemption and interrupt disabling primitives. Contrary to other locking165 interrupt disabling and enabling primitives:177 primitives:180 of the protection scope while the regular primitives are scopeless and
61 OpenBMC supports a BLOB protocol that provides primitives. These primitives62 allow a variety of different "handlers" to exist that implement those primitives258 ### Blob Primitives260 The update mechanism will implement the Blob primitives as follows.488 piece. Mapping it into blobs primitives allows for easier future modification
83 * Unordered I/O memory access primitives. These are even more relaxed than101 * Relaxed I/O memory access primitives. These follow the Device memory128 * I/O memory access primitives. Reads are ordered relative to any following
18 from cryptography.hazmat.primitives.asymmetric import ec19 from cryptography.hazmat.primitives.serialization import Encoding, \
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 …]
3 * Key-agreement Protocol Primitives (KPP)173 MODULE_DESCRIPTION("Key-agreement Protocol Primitives");