Home
last modified time | relevance | path

Searched refs:primitive (Results 1 – 25 of 62) sorted by relevance

123

/linux-6.15/net/sctp/
H A Ddebug.c129 if (id.primitive <= SCTP_EVENT_PRIMITIVE_MAX) in sctp_pname()
130 return sctp_primitive_tbl[id.primitive]; in sctp_pname()
H A DMakefile13 tsnmap.o bind_addr.o socket.o primitive.o \
/linux-6.15/Documentation/filesystems/iomap/
H A Ddesign.rst130 * **filesystem mapping lock**: This synchronization primitive is
404 * The **upper** level primitive is provided by the filesystem to
406 The exact primitive is specific to the filesystem and operation,
414 * The **lower** level primitive is taken by the filesystem in the
418 this primitive.
419 The upper level synchronization primitive, if any, remains held
420 while acquiring the lower level synchronization primitive.
426 * The **operation** primitive is taken by an iomap operation to
429 while acquiring this primitive.
430 The lower level primitive is not held while acquiring this
[all …]
/linux-6.15/include/net/sctp/
H A Dconstants.h120 enum sctp_event_primitive primitive; member
131 SCTP_SUBTYPE_CONSTRUCTOR(PRIMITIVE, enum sctp_event_primitive, primitive)
/linux-6.15/Documentation/RCU/
H A Dchecklist.rst140 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.
287 primitive will correspondingly delay updates. In contrast,
[all …]
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.
H A Drcubarrier.rst9 a grace period to elapse. This primitive takes a pointer to an rcu_head
54 This situation can be handled by the rcu_barrier() primitive. Rather
284 The rcu_barrier() primitive is used relatively infrequently, since most
/linux-6.15/Documentation/networking/
H A Datm.rst7 In order to use anything but the most primitive functions of ATM,
/linux-6.15/Documentation/devicetree/bindings/devfreq/event/
H A Dsamsung,exynos-nocp.yaml15 NoC provides the primitive values to get the performance data. The packets
H A Dsamsung,exynos-ppmu.yaml15 each IP. PPMU provides the primitive values to get performance data. These
/linux-6.15/tools/memory-model/scripts/
H A Dcmplitmushist.sh124 echo "!!!" Unknown primitive: $badmacnam 1>&2
H A DREADME110 to LKMM introduces a new primitive for which litmus tests already existed.
/linux-6.15/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-6.15/Documentation/ABI/removed/
H A Dsysfs-selinux-disable16 easier for systems with primitive bootloaders that did not allow for
/linux-6.15/Documentation/devicetree/bindings/clock/
H A Dxlnx,clocking-wizard.yaml46 runtime reconfguration of the clocking primitive MMCM/PLL.
/linux-6.15/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
H A Dmutex-design.rst12 In the Linux kernel, mutexes refer to a particular locking primitive
170 locking primitive.
/linux-6.15/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-6.15/Documentation/staging/
H A Dspeculation.rst64 arbitrary read primitive.
/linux-6.15/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-6.15/drivers/dma-buf/
H A DKconfig27 synchronization. Useful when there is no hardware primitive backing
/linux-6.15/Documentation/arch/x86/x86_64/
H A Dfake-numa-for-cpusets.rst23 For the purposes of this introduction, we'll assume a very primitive NUMA
/linux-6.15/drivers/scsi/isci/
H A Dscu_task_context.h430 struct primitive_task_context primitive; member
/linux-6.15/Documentation/scsi/
H A Dlibsas.rst113 received. See sas.h. Grab the lock, set the primitive,
322 - on receiving a primitive
331 - Hard Reset primitive received.

123