Home
last modified time | relevance | path

Searched full:primitive (Results 1 – 25 of 167) sorted by relevance

1234567

/linux/net/llc/
H A Dllc_s_ac.c69 * 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/Documentation/filesystems/iomap/
H A Ddesign.rst130 * **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/include/linux/
H A Drculist_nulls.h28 * 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().
H A Drslib.h26 * @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 Drculist_bl.h40 * 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().
H A Dprocessor.h15 * cpu_relax, or any "spin" or sleep type of primitive including nested uses
43 * for the uncontended case before using this primitive.
H A Dintel_rapl.h79 /* below are not raw primitive data */
146 * @rpi: internal pointer to interface primitive info
/linux/net/sctp/
H A Ddebug.c126 /* 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 Dprimitive.c8 * 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 Dreed_solomon.c63 * @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 Dkdf_sp800108.h49 * 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/Documentation/RCU/
H A DUP.rst6 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/include/crypto/internal/
H A Dkpp.h155 * 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 Daltera_sgdma.c442 * 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/Documentation/translations/it_IT/locking/
H A Dlocktypes.rst14 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
H A Dlocktorture.rst13 modulo kernel che esegue delle verifiche che *torturano* le primitive di
157 nell'implementazione delle primitive di sincronizzazione. Altrimenti un
/linux/include/net/sctp/
H A Dconstants.h96 /* 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/arch/alpha/kernel/
H A Dtime.c85 * 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 Dmpi_log_fc.h42 …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 Dcompletion.rs11 /// 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 Dordering.txt142 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 Datomic_t.txt184 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/Documentation/locking/
H A Dlocktorture.rst138 primitive a second "Reads" statistics line is printed.
145 -only- be positive if there is a bug in the locking primitive's
/linux/include/math-emu/
H A Dop-1.h136 /* Given a 1W * 1W => 2W primitive, do the extended multiplication. */
199 /* GCC's longlong.h defines a 2W / 1W => (1W,1W) primitive udiv_qrnnd
200 that may be useful in this situation. This first is for a primitive
/linux/Documentation/networking/
H A Datm.rst7 In order to use anything but the most primitive functions of ATM,

1234567