| /linux-6.12.1/net/sctp/ |
| D | debug.c | 129 if (id.primitive <= SCTP_EVENT_PRIMITIVE_MAX) in sctp_pname()
130 return sctp_primitive_tbl[id.primitive]; in sctp_pname()
|
| D | Makefile | 13 tsnmap.o bind_addr.o socket.o primitive.o \
|
| /linux-6.12.1/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.12.1/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.
|
| D | rcubarrier.rst | 9 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
|
| D | whatisRCU.rst | 165 This temporal primitive is used by a reader to inform the
199 This temporal primitive marks the end of updater code and the
509 This primitive protects concurrent readers from the updater,
591 The container_of() primitive is a macro that, given a pointer into a
698 The rcu_read_lock() and rcu_read_unlock() primitive read-acquire
700 primitive write-acquires this same lock, then releases it. This means
754 CPU in turn. The run_on() primitive can be implemented straightforwardly
755 in terms of the sched_setaffinity() primitive. Of course, a somewhat less
1276 a synchronization primitive is a bit unexpected. ;-)
|
| /linux-6.12.1/include/net/sctp/ |
| D | constants.h | 120 enum sctp_event_primitive primitive; member
131 SCTP_SUBTYPE_CONSTRUCTOR(PRIMITIVE, enum sctp_event_primitive, primitive)
|
| /linux-6.12.1/Documentation/networking/ |
| D | atm.rst | 7 In order to use anything but the most primitive functions of ATM,
|
| /linux-6.12.1/tools/memory-model/scripts/ |
| D | cmplitmushist.sh | 124 echo "!!!" Unknown primitive: $badmacnam 1>&2
|
| D | README | 110 to LKMM introduces a new primitive for which litmus tests already existed.
|
| /linux-6.12.1/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
|
| D | locktorture.rst | 13 modulo kernel che esegue delle verifiche che *torturano* le primitive di
157 nell'implementazione delle primitive di sincronizzazione. Altrimenti un
|
| /linux-6.12.1/Documentation/ABI/removed/ |
| D | sysfs-selinux-disable | 16 easier for systems with primitive bootloaders that did not allow for
|
| /linux-6.12.1/Documentation/locking/ |
| D | locktorture.rst | 138 primitive a second "Reads" statistics line is printed.
145 -only- be positive if there is a bug in the locking primitive's
|
| D | mutex-design.rst | 12 In the Linux kernel, mutexes refer to a particular locking primitive
170 locking primitive.
|
| /linux-6.12.1/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.12.1/Documentation/staging/ |
| D | speculation.rst | 64 arbitrary read primitive.
|
| /linux-6.12.1/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.12.1/drivers/dma-buf/ |
| D | Kconfig | 27 synchronization. Useful when there is no hardware primitive backing
|
| /linux-6.12.1/Documentation/arch/x86/x86_64/ |
| D | fake-numa-for-cpusets.rst | 23 For the purposes of this introduction, we'll assume a very primitive NUMA
|
| /linux-6.12.1/drivers/scsi/isci/ |
| D | scu_task_context.h | 430 struct primitive_task_context primitive; member
|
| /linux-6.12.1/Documentation/scsi/ |
| D | libsas.rst | 113 received. See sas.h. Grab the lock, set the primitive,
322 - on receiving a primitive
331 - Hard Reset primitive received.
|
| /linux-6.12.1/Documentation/networking/devlink/ |
| D | devlink-dpipe.rst | 126 Matches are kept primitive and close to hardware operation. Match types like
142 Similar to match, the actions are kept primitive and close to hardware
|
| /linux-6.12.1/drivers/scsi/mpi3mr/mpi/ |
| D | mpi30_ioc.h | 442 u8 primitive; member
457 u8 primitive; member
|