| /linux/net/llc/ |
| H A D | llc_s_ac.c | 69 * primitive from the network layer. Verifies event is a primitive type of
70 * event. Verify the primitive is a UNITDATA REQUEST.
89 * primitive from the network layer. Verify event is a primitive type
90 * event. Verify the primitive is a XID REQUEST.
140 * primitive from the network layer. Verify event is a primitive type
141 * event; verify the primitive is a TEST REQUEST.
202 * primitive.
216 * primitive. Verify our event is a PDU type event.
|
| /linux/include/linux/ |
| H A D | rculist.h | 119 * with another list-mutation primitive, such as list_add_rcu()
140 * with another list-mutation primitive, such as list_add_tail_rcu()
165 * with another list-mutation primitive, such as list_del_rcu()
197 * primitive, such as list_bidir_del_rcu() or list_add_rcu(), running on
230 * list-mutation primitive, such as hlist_add_head_rcu() or
389 * This primitive may safely run concurrently with the _rcu list-mutation
433 * This primitive may safely run concurrently with the _rcu list-mutation
452 * This primitive may safely run concurrently with the _rcu list-mutation
471 * This list-traversal primitive may safely run concurrently with
488 * This list-traversal primitive may safely run concurrently with
[all …]
|
| H A D | rslib.h | 26 * @prim: Primitive element, index form
28 * @gfpoly: The primitive generator polynominal
89 * must be primitive;
92 * @prim: primitive element to generate polynomial roots
|
| H A D | processor.h | 15 * cpu_relax, or any "spin" or sleep type of primitive including nested uses
43 * for the uncontended case before using this primitive.
|
| /linux/Documentation/filesystems/iomap/ |
| H A D | design.rst | 130 * **filesystem mapping lock**: This synchronization primitive is
413 * The **upper** level primitive is provided by the filesystem to
415 The exact primitive is specific to the filesystem and operation,
423 * The **lower** level primitive is taken by the filesystem in the
427 this primitive.
428 The upper level synchronization primitive, if any, remains held
429 while acquiring the lower level synchronization primitive.
435 * The **operation** primitive is taken by an iomap operation to
437 The upper level synchronization primitive, if any, remains held
438 while acquiring this primitive.
[all …]
|
| /linux/Documentation/RCU/ |
| H A D | checklist.rst | 10 result in the same sorts of problems that leaving out a locking primitive
146 accesses. The rcu_dereference() primitive ensures that
151 The rcu_dereference() primitive is also an excellent
156 just that. The rcu_dereference() primitive therefore also
162 The rcu_dereference() primitive is used by the
182 hlist_add_head_rcu() primitive is required.
185 primitive must be used to keep list_del()'s pointer
188 the hlist_del_rcu() primitive is required.
199 publicized. Use the rcu_assign_pointer() primitive
229 a single non-expedited primitive to cover the entire batch.
[all …]
|
| H A D | UP.rst | 6 A common misconception is that, on UP systems, the call_rcu() primitive
126 elsewhere using an _bh variant of the spinlock primitive.
142 the kfree() primitive.
|
| /linux/rust/kernel/ |
| H A D | slice.rs | |
| H A D | num.rs | 10 /// Designates unsigned primitive types.
13 /// Designates signed primitive types.
|
| H A D | io.rs | 186 /// (for primitive types like [`u32`]) and typed ones (like those generated by the [`register!`]
196 /// with its bitfields, and `IoType` = its backing primitive (e.g. `u32`).
222 // Provide the ability to read any primitive type from a [`usize`].
411 /// Read a primitive type from an I/O address:
445 /// Write a primitive type to an I/O address:
565 /// Read a primitive type from an I/O address:
597 /// Write a primitive type to an I/O address:
|
| /linux/include/kunit/ |
| H A D | test.h | 1025 * @left: an arbitrary expression that evaluates to a primitive C type.
1026 * @right: an arbitrary expression that evaluates to a primitive C type.
1067 * @left: an arbitrary expression that evaluates to a primitive C type.
1068 * @right: an arbitrary expression that evaluates to a primitive C type.
1109 * @left: an arbitrary expression that evaluates to a primitive C type.
1110 * @right: an arbitrary expression that evaluates to a primitive C type.
1130 * @left: an arbitrary expression that evaluates to a primitive C type.
1131 * @right: an arbitrary expression that evaluates to a primitive C type.
1151 * @left: an arbitrary expression that evaluates to a primitive C type.
1152 * @right: an arbitrary expression that evaluates to a primitive C type.
[all …]
|
| /linux/net/sctp/ |
| H A D | debug.c | 126 /* Lookup primitive debug name. */
129 if (id.primitive <= SCTP_EVENT_PRIMITIVE_MAX) in sctp_pname()
130 return sctp_primitive_tbl[id.primitive]; in sctp_pname()
|
| H A D | primitive.c | 8 * These functions implement the SCTP primitive functions from Section 10.
63 * This primitive allows the upper layer to initiate an association to a
139 * send primitive) within the life time variable. However, the
|
| /linux/lib/reed_solomon/ |
| H A D | reed_solomon.c | 63 * @prim: primitive element to generate polynomial roots
124 /* If it's not primitive, exit */ in codec_init()
203 * must be primitive;
209 * @prim: primitive element to generate polynomial roots
281 * must be primitive;
284 * @prim: primitive element to generate polynomial roots
304 * @prim: primitive element to generate polynomial roots
|
| /linux/include/crypto/ |
| H A D | kdf_sp800108.h | 49 * SP800-108 allows the use of either a HMAC or a hash primitive. When
50 * the caller intends to use a hash primitive, the call to
|
| /linux/rust/syn/ |
| H A D | export.rs | 30 pub type bool = std::primitive::bool;
32 pub type str = std::primitive::str;
|
| /linux/include/crypto/internal/ |
| H A D | kpp.h | 155 * Function registers an implementation of a key-agreement protocol primitive
165 * crypto_unregister_kpp() -- Unregister key-agreement protocol primitive
168 * Function unregisters an implementation of a key-agreement protocol primitive
|
| /linux/drivers/net/ethernet/altera/ |
| H A D | altera_sgdma.c | 442 * primitive to avoid simultaneous pushes/pops to the list.
453 * primitive to avoid simultaneous pushes/pops to the list.
464 * primitive to avoid simultaneous pushes/pops to the list.
477 * primitive to avoid simultaneous pushes/pops to the list.
490 * primitive to avoid simultaneous pushes/pops to the list while the
|
| /linux/rust/kernel/num/ |
| H A D | bounded.rs | 160 /// Infallible conversions from a primitive integer to a large-enough [`Bounded`] are supported.
186 /// Infallible conversions from a [`Bounded`] to a primitive integer are also supported, and
214 /// Fallible conversions from any primitive integer to any [`Bounded`] are also supported using the
933 /// Implementations for infallibly converting a primitive type into a [`Bounded`] that can contain
968 /// Generates `From` implementations from a primitive type into a [`Bounded`] with
1003 /// Local trait expressing the fact that a given [`Bounded`] fits into a primitive type of `N` bits,
1007 /// Implementations for infallibly converting a [`Bounded`] into a primitive type that can contain
1015 // Number of bits that fit into a 8-bits primitive.
1020 // Other number of bits that fit into a 16-bits primitive.
1025 // Other number of bits that fit into a 32-bits primitive
[all...] |
| /linux/Documentation/translations/it_IT/locking/ |
| H A D | locktypes.rst | 14 Il kernel fornisce un certo numero di primitive di blocco che possiamo dividere
36 di queste primitive. Insomma, non usate i blocchi ad attesa con sospensioni in
60 Su kernel non-PREEMPT_RT, le funzioni local_lock gestiscono le primitive di
179 Gli ambiti di visibilità con nome hanno due vantaggi rispetto alle primitive di
184 classiche primitive in quanto sono opache e senza alcun ambito di
191 questo, lockdep_assert_held(&llock) funziona come tutte le altre primitive
|
| /linux/arch/alpha/kernel/ |
| H A D | time.c | 85 * The RTC as a clock_event_device primitive.
134 * The QEMU clock as a clocksource primitive.
154 * The QEMU alarm as a clock_event_device primitive.
251 * The RPCC as a clocksource primitive.
|
| /linux/drivers/message/fusion/lsi/ |
| H A D | mpi_log_fc.h | 42 …NFO_FC_INIT_ERROR_BAD_START_OF_FRAME = 0x20000002, /* Bad Rx Frame, bad start of frame primitive */
43 …GINFO_FC_INIT_ERROR_BAD_END_OF_FRAME = 0x20000003, /* Bad Rx Frame, bad end of frame primitive */
|
| /linux/rust/kernel/sync/ |
| H A D | completion.rs | 11 /// Synchronization primitive to signal when a certain task has been completed.
13 /// The [`Completion`] synchronization primitive signals when a certain task has been completed by
|
| /linux/tools/memory-model/Documentation/ |
| H A D | ordering.txt | 142 The smp_mb__after_atomic() primitive can be used instead:
149 The smp_mb__after_atomic() primitive emits code only on CPUs whose
167 It is bad practice to place code between the smp__*() primitive and the
222 The Linux kernel's compiler barrier is barrier(). This primitive
512 primitive can be helpful, as can the various ordering primitives discussed
|
| /linux/Documentation/ |
| H A D | atomic_t.txt | 184 subsequent. Therefore a fully ordered primitive is like having an smp_mb()
185 before and an smp_mb() after the primitive.
362 primitive (See Sparc64 for an example).
|