Searched full:primitive (Results 1 – 25 of 224) sorted by relevance
123456789
| /linux-6.14.4/net/llc/ |
| 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-6.14.4/include/linux/ |
| D | rculist.h | 109 * with another list-mutation primitive, such as list_add_rcu()
130 * with another list-mutation primitive, such as list_add_tail_rcu()
155 * with another list-mutation primitive, such as list_del_rcu()
187 * primitive, such as list_bidir_del_rcu() or list_add_rcu(), running on
220 * list-mutation primitive, such as hlist_add_head_rcu() or
350 * This primitive may safely run concurrently with the _rcu list-mutation
394 * This primitive may safely run concurrently with the _rcu list-mutation
413 * This primitive may safely run concurrently with the _rcu list-mutation
432 * This list-traversal primitive may safely run concurrently with
449 * This list-traversal primitive may safely run concurrently with
[all …]
|
| D | rculist_nulls.h | 28 * list-mutation primitive, such as hlist_nulls_add_head_rcu() or
68 * with another list-mutation primitive, such as hlist_nulls_add_head_rcu()
91 * with another list-mutation primitive, such as hlist_nulls_add_head_rcu()
97 * list-traversal primitive must be guarded by rcu_read_lock().
122 * with another list-mutation primitive, such as hlist_nulls_add_head_rcu()
128 * list-traversal primitive must be guarded by rcu_read_lock().
|
| 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
|
| D | rculist_bl.h | 40 * with another list-mutation primitive, such as hlist_bl_add_head_rcu()
63 * with another list-mutation primitive, such as hlist_bl_add_head_rcu()
69 * list-traversal primitive must be guarded by rcu_read_lock().
|
| 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.
|
| D | intel_rapl.h | 79 /* below are not raw primitive data */
146 * @rpi: internal pointer to interface primitive info
|
| /linux-6.14.4/Documentation/filesystems/iomap/ |
| D | design.rst | 130 * **filesystem mapping lock**: This synchronization primitive is
395 * The **upper** level primitive is provided by the filesystem to
397 The exact primitive is specific to the filesystem and operation,
405 * The **lower** level primitive is taken by the filesystem in the
409 this primitive.
410 The upper level synchronization primitive, if any, remains held
411 while acquiring the lower level synchronization primitive.
417 * The **operation** primitive is taken by an iomap operation to
419 The upper level synchronization primitive, if any, remains held
420 while acquiring this primitive.
[all …]
|
| /linux-6.14.4/Documentation/RCU/ |
| D | checklist.rst | 10 result in the same sorts of problems that leaving out a locking primitive
140 accesses. The rcu_dereference() primitive ensures that
145 The rcu_dereference() primitive is also an excellent
150 just that. The rcu_dereference() primitive therefore also
156 The rcu_dereference() primitive is used by the
176 hlist_add_head_rcu() primitive is required.
179 primitive must be used to keep list_del()'s pointer
182 the hlist_del_rcu() primitive is required.
193 publicized. Use the rcu_assign_pointer() primitive
223 a single non-expedited primitive to cover the entire batch.
[all …]
|
| 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-6.14.4/drivers/gpu/drm/amd/display/include/ |
| D | dal_asic_id.h | 74 /* KV1 with Spectre GFX core, 8-8-1-2 (CU-Pix-Primitive-RB) */
78 * 3-4-1-1 (CU-Pix-Primitive-RB) */
81 /* KB with Kalindi GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */
84 /* KB with Kalindi GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */
87 /* BV with Kalindi GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */
90 /* ML with Godavari GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */
93 /* ML with Godavari GFX core, 2-4-1-1 (CU-Pix-Primitive-RB) */
|
| /linux-6.14.4/include/kunit/ |
| D | test.h | 959 * @left: an arbitrary expression that evaluates to a primitive C type.
960 * @right: an arbitrary expression that evaluates to a primitive C type.
1001 * @left: an arbitrary expression that evaluates to a primitive C type.
1002 * @right: an arbitrary expression that evaluates to a primitive C type.
1043 * @left: an arbitrary expression that evaluates to a primitive C type.
1044 * @right: an arbitrary expression that evaluates to a primitive C type.
1064 * @left: an arbitrary expression that evaluates to a primitive C type.
1065 * @right: an arbitrary expression that evaluates to a primitive C type.
1085 * @left: an arbitrary expression that evaluates to a primitive C type.
1086 * @right: an arbitrary expression that evaluates to a primitive C type.
[all …]
|
| /linux-6.14.4/net/sctp/ |
| 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()
|
| 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-6.14.4/lib/reed_solomon/ |
| 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-6.14.4/include/crypto/ |
| 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-6.14.4/include/crypto/internal/ |
| 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-6.14.4/drivers/net/ethernet/altera/ |
| 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-6.14.4/Documentation/translations/it_IT/locking/ |
| 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-6.14.4/include/net/sctp/ |
| D | constants.h | 96 /* These are primitive requests from the ULP. */
120 enum sctp_event_primitive primitive; member
131 SCTP_SUBTYPE_CONSTRUCTOR(PRIMITIVE, enum sctp_event_primitive, primitive)
|
| /linux-6.14.4/arch/alpha/kernel/ |
| 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-6.14.4/drivers/message/fusion/lsi/ |
| 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-6.14.4/Documentation/ |
| 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).
|
| /linux-6.14.4/tools/memory-model/Documentation/ |
| 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-6.14.4/Documentation/networking/ |
| D | atm.rst | 7 In order to use anything but the most primitive functions of ATM,
|
123456789