| /linux-5.19.10/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 \
|
| D | sm_statetable.c | 81 return DO_LOOKUP(SCTP_EVENT_PRIMITIVE_MAX, primitive, in sctp_sm_lookup_event()
|
| /linux-5.19.10/Documentation/RCU/ |
| D | checklist.rst | 10 result in the same sorts of problems that leaving out a locking primitive
129 accesses. The rcu_dereference() primitive ensures that
134 The rcu_dereference() primitive is also an excellent
139 just that. The rcu_dereference() primitive therefore also
145 The rcu_dereference() primitive is used by the
165 hlist_add_head_rcu() primitive is required.
168 primitive must be used to keep list_del()'s pointer
171 the hlist_del_rcu() primitive is required.
182 publicized. Use the rcu_assign_pointer() primitive
207 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
117 elsewhere using an _bh variant of the spinlock primitive.
133 the kfree() primitive.
|
| D | rcubarrier.rst | 24 presence? There is a synchronize_rcu() primitive that blocks until all
34 primitive must be used instead. This primitive takes a pointer to an
78 We instead need the rcu_barrier() primitive. Rather than waiting for
290 The rcu_barrier() primitive has seen relatively little use, since most
|
| D | whatisRCU.rst | 473 This primitive protects concurrent readers from the updater,
555 The container_of() primitive is a macro that, given a pointer into a
654 The rcu_read_lock() and rcu_read_unlock() primitive read-acquire
656 primitive write-acquires this same lock, then releases it. This means
710 CPU in turn. The run_on() primitive can be implemented straightforwardly
711 in terms of the sched_setaffinity() primitive. Of course, a somewhat less
1188 a synchronization primitive is a bit unexpected. ;-)
|
| /linux-5.19.10/include/net/sctp/ |
| D | constants.h | 120 enum sctp_event_primitive primitive; member
131 SCTP_SUBTYPE_CONSTRUCTOR(PRIMITIVE, enum sctp_event_primitive, primitive)
|
| /linux-5.19.10/Documentation/networking/ |
| D | atm.rst | 7 In order to use anything but the most primitive functions of ATM,
|
| /linux-5.19.10/Documentation/devicetree/bindings/devfreq/event/ |
| D | samsung,exynos-nocp.yaml | 15 NoC provides the primitive values to get the performance data. The packets
|
| D | samsung,exynos-ppmu.yaml | 15 each IP. PPMU provides the primitive values to get performance data. These
|
| /linux-5.19.10/Documentation/ABI/obsolete/ |
| D | sysfs-selinux-disable | 13 easier for systems with primitive bootloaders that did not allow for
|
| /linux-5.19.10/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
152 locking primitive.
|
| /linux-5.19.10/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-5.19.10/Documentation/vm/damon/ |
| D | faq.rst | 21 Idle page tracking is a low level primitive for access check of the physical
|
| /linux-5.19.10/Documentation/staging/ |
| D | speculation.rst | 64 arbitrary read primitive.
|
| /linux-5.19.10/drivers/dma-buf/ |
| D | Kconfig | 27 synchronization. Useful when there is no hardware primitive backing
|
| /linux-5.19.10/Documentation/x86/x86_64/ |
| D | fake-numa-for-cpusets.rst | 23 For the purposes of this introduction, we'll assume a very primitive NUMA
|
| /linux-5.19.10/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-5.19.10/drivers/scsi/isci/ |
| D | scu_task_context.h | 430 struct primitive_task_context primitive; member
|
| /linux-5.19.10/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-5.19.10/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-5.19.10/drivers/scsi/mpi3mr/mpi/ |
| D | mpi30_ioc.h | 429 u8 primitive; member
444 u8 primitive; member
|
| /linux-5.19.10/Documentation/core-api/ |
| D | librs.rst | 47 * primitive element to generate roots = 1
|