| /linux-6.14.4/include/linux/ |
| D | kcsan-checks.h | 340 * ASSERT_EXCLUSIVE_WRITER - assert no concurrent writes to @var
342 * Assert that there are no concurrent writes to @var; other readers are
343 * allowed. This assertion can be used to specify properties of concurrent code,
346 * For example, if we only have a single writer, but multiple concurrent
348 * concurrent marked writes racing with the single writer are bugs.
366 * checking if a clear scope where no concurrent writes are expected exists.
388 * ASSERT_EXCLUSIVE_WRITER_SCOPED - assert no concurrent writes to @var in scope
392 * Assert that there are no concurrent writes to @var for the duration of the
423 * ASSERT_EXCLUSIVE_ACCESS - assert no concurrent accesses to @var
425 * Assert that there are no concurrent accesses to @var (no readers nor
[all …]
|
| D | kfifo.h | 225 * from the reader thread and there is only one concurrent reader. Otherwise
413 * Note that with only one concurrent reader and one concurrent
450 * Note that with only one concurrent reader and one concurrent
489 * Note that with only one concurrent reader and one concurrent
527 * Note that with only one concurrent reader and one concurrent
595 * Note that with only one concurrent reader and one concurrent
670 * Note that with only one concurrent reader and one concurrent
698 * Note that with only one concurrent reader and one concurrent
727 * Note that with only one concurrent reader and one concurrent
755 * Note that with only one concurrent reader and one concurrent
[all …]
|
| D | rcuref.h | 110 * the last reference and the slowpath races against a concurrent get() and
119 * with a concurrent get()/put() pair. Caller is not allowed to
145 * with a concurrent get()/put() pair. Caller is not allowed to
|
| /linux-6.14.4/tools/memory-model/Documentation/ |
| D | access-marking.txt | 4 This document provides guidelines for marking intentionally concurrent
189 5. Any other loads for which there is not supposed to be a concurrent
192 6. Any other stores for which there should be neither concurrent
193 loads nor concurrent stores to that same variable.
244 concurrent access to variable foo by any other CPU is an error, even
245 if that concurrent access is marked with READ_ONCE(). In addition,
247 to be concurrent reads from foo from other CPUs, it is an error for some
248 other CPU to be concurrently writing to foo, even if that concurrent
261 your concurrent algorithm, to help the human reader, and to inform
368 concurrent write, whether marked or not.
[all …]
|
| D | ordering.txt | 273 different pieces of the concurrent algorithm. The variable stored to
275 an acquire operation in other parts of the concurrent algorithm.
331 the different pieces of the concurrent algorithm by looking for the
481 concurrent atomic_inc() operations applied to a given variable
509 concurrent code. It is possible to used unmarked C-language accesses for
510 shared variables that are subject to concurrent access, but great care
524 so that there are never concurrent conflicting accesses to
526 (1) at least one of the concurrent accesses to a variable is an
533 o Use locking or other means to ensure that all concurrent accesses
|
| D | README | 36 o You would like to mark concurrent normal accesses to shared
62 Guidelines for marking intentionally concurrent accesses to
|
| /linux-6.14.4/drivers/net/ethernet/microchip/ |
| D | lan743x_ptp.h | 30 /* gpio_lock: used to prevent concurrent access to gpio settings */
75 /* command_lock: used to prevent concurrent ptp commands */
90 /* tx_ts_lock: used to prevent concurrent access to timestamp arrays */
|
| /linux-6.14.4/rust/kernel/ |
| D | revocable.rs | 18 /// Once access is revoked and all concurrent users complete (i.e., all existing instances of
128 /// Callers must ensure that there are no more concurrent users of the revocable object.
145 /// expecting that there are no concurrent users of the object.
149 /// Callers must ensure that there are no more concurrent users of the revocable object.
161 /// If there are concurrent users of the object (i.e., ones that called
163 /// function waits for the concurrent access to complete before dropping the wrapped object.
|
| /linux-6.14.4/drivers/ptp/ |
| D | ptp_private.h | 47 spinlock_t tsevqs_lock; /* protects tsevqs from concurrent access */
48 struct mutex pincfg_mux; /* protect concurrent info->pin_config access */
61 struct mutex n_vclocks_mux; /* protect concurrent n_vclocks access */
|
| /linux-6.14.4/lib/ |
| D | rcuref.c | 28 * O(N^2) behaviour under contention with N concurrent operations.
65 * concurrent rcuref_get() can acquire the reference count and bring it
68 * If the cmpxchg() succeeds then a concurrent rcuref_get() will result in
234 * with a concurrent get()/put() pair. Caller is not allowed to
244 * This can fail if a concurrent get() operation has in rcuref_put_slowpath()
|
| /linux-6.14.4/drivers/usb/gadget/function/ |
| D | g_zero.h | 43 * This is to protect the data from concurrent access by read/write
58 * This is to protect the data from concurrent access by read/write
|
| /linux-6.14.4/drivers/clk/sifive/ |
| D | sifive-prci.c | 310 * Context: Any context. Caller must prevent concurrent changes to the
331 * Context: Any context. Caller must prevent concurrent changes to the
353 * Context: Any context. Caller must prevent concurrent changes to the
374 * Context: Any context. Caller must prevent concurrent changes to the
395 * Context: Any context. Caller must prevent concurrent changes to the
416 * Context: Any context. Caller must prevent concurrent changes to the
437 * Context: Any context. Caller must prevent concurrent changes to the
|
| /linux-6.14.4/fs/xfs/ |
| D | xfs_aops.c | 218 * because concurrent changes could have invalidated the extent. Check in xfs_imap_valid()
219 * the COW fork because concurrent changes since the last time we in xfs_imap_valid()
270 * we've indirectly protected against concurrent updates: writeback has in xfs_map_blocks()
271 * the page locked, which prevents concurrent invalidations by reflink in xfs_map_blocks()
272 * and directio and prevents concurrent buffered writes to the same in xfs_map_blocks()
274 * against concurrent updates and provides a memory barrier on the way in xfs_map_blocks()
540 * Swap file activation can race against concurrent shared extent in xfs_vm_swap_activate()
|
| /linux-6.14.4/include/uapi/asm-generic/ |
| D | fcntl.h | 187 #define LOCK_READ 64 /* which allows concurrent read operations */
188 #define LOCK_WRITE 128 /* which allows concurrent write operations */
189 #define LOCK_RW 192 /* which allows concurrent read & write ops */
|
| /linux-6.14.4/arch/arc/mm/ |
| D | highmem.c | 26 * means the total number of concurrent fixmaps will be limited to max
42 * - pkmap being preemptible, in theory could do with more than 256 concurrent
|
| /linux-6.14.4/drivers/gpu/drm/ |
| D | drm_vma_manager.c | 81 * against concurrent access. However, node allocation and destruction is left
308 * This is locked against concurrent access internally.
333 * This is locked against concurrent access internally.
353 * This is locked against concurrent access internally.
393 * This is locked against concurrent access internally.
|
| /linux-6.14.4/security/landlock/ |
| D | object.h | 34 * in a safe way. This implies to handle concurrent use and modification.
50 * @lock: Protects against concurrent modifications. This lock must be
|
| /linux-6.14.4/kernel/locking/ |
| D | osq_lock.c | 73 * leave it in, a concurrent unlock()/unqueue() from in osq_wait_next()
77 * If the concurrent unlock()/unqueue() wins the race, we'll in osq_wait_next()
179 * Or we race against a concurrent unqueue()'s step-B, in which in osq_lock()
|
| /linux-6.14.4/include/sound/ |
| D | seq_kernel.h | 18 /* max number of concurrent clients */
21 /* max number of concurrent ports */
|
| /linux-6.14.4/Documentation/filesystems/ |
| D | path-lookup.txt | 85 concurrent updates (insertion, deletion from the hash). This is a standard RCU
114 new list before waiting for a grace period, this can result in a concurrent RCU
144 pointers intact, so a concurrent list walker that is currently looking at
161 Because we didn't wait for a grace period, there may be a concurrent lookup
214 serialise concurrent modifications to the dentry and take a reference count on
357 specifically has concurrent renames/mkdir/rmdir/ creat/unlink/etc to exercise
|
| /linux-6.14.4/drivers/s390/cio/ |
| D | device_status.c | 90 /* Copy concurrent sense / model dependent information. */ in ccw_device_accumulate_ecw()
184 /* Copy concurrent sense bit. */ in ccw_device_accumulate_esw()
293 * concurrent sense facility installed for the subchannel. in ccw_device_accumulate_irb()
299 * operand exception for virtual devices without concurrent in ccw_device_accumulate_irb()
301 * concurrent sense facility. in ccw_device_accumulate_irb()
|
| /linux-6.14.4/Documentation/trace/ |
| D | ring-buffer-map.rst | 43 Concurrent readers (either another application mapping that ring-buffer or the
45 the ring-buffer and the output is unpredictable, just like concurrent readers on
|
| /linux-6.14.4/arch/arm/mach-omap1/ |
| D | clock.c | 309 /* protect ARM_CKCTL register from concurrent access via clk_enable/disable() */ in omap1_clk_set_rate_ckctl_arm()
392 /* protect MOD_CONF_CTRL_0 register from concurrent access via clk_enable/disable() */ in omap1_set_uart_rate()
419 /* protect SWD_CLK_DIV_CTRL_SEL register from concurrent access via clk_enable/disable() */ in omap1_set_ext_clk_rate()
463 /* protect MOD_CONF_CTRL_1 register from concurrent access via clk_enable/disable() */ in omap1_set_sossi_rate()
540 /* protect clk->enable_reg from concurrent access via clk_set_rate() */ in omap1_clk_enable_generic()
585 /* protect clk->enable_reg from concurrent access via clk_set_rate() */ in omap1_clk_disable_generic()
|
| /linux-6.14.4/drivers/net/ethernet/mscc/ |
| D | ocelot_fdma.h | 87 * @xmit_lock: lock for concurrent xmit access
95 /* Protect concurrent xmit calls */
|
| /linux-6.14.4/Documentation/process/ |
| D | volatile-considered-harmful.rst | 17 unwanted concurrent access, which is very much a different task. The
21 Like volatile, the kernel primitives which make concurrent access to data
|