| /Linux-v5.15/kernel/locking/ |
| D | rwbase_rt.c | 61 for (r = atomic_read(&rwb->readers); r < 0;) { in rwbase_read_trylock()
63 if (likely(atomic_try_cmpxchg(&rwb->readers, &r, r + 1))) in rwbase_read_trylock()
80 if (atomic_read(&rwb->readers) != WRITER_BIAS) { in __rwbase_read_lock()
81 atomic_inc(&rwb->readers); in __rwbase_read_lock()
130 atomic_inc(&rwb->readers); in __rwbase_read_lock()
175 if (unlikely(atomic_dec_and_test(&rwb->readers))) in rwbase_read_unlock()
188 (void)atomic_add_return_release(READER_BIAS - bias, &rwb->readers); in __rwbase_write_unlock()
221 if (!atomic_read_acquire(&rwb->readers)) { in __rwbase_write_trylock()
222 atomic_set(&rwb->readers, WRITER_BIAS); in __rwbase_write_trylock()
240 atomic_sub(READER_BIAS, &rwb->readers); in rwbase_write_lock()
[all …]
|
| D | rwsem.c | 727 int readers = count >> RWSEM_READER_SHIFT; in rwsem_rspin_threshold() local
730 if (readers > 30) in rwsem_rspin_threshold()
731 readers = 30; in rwsem_rspin_threshold()
732 delta = (20 + readers) * NSEC_PER_USEC / 2; in rwsem_rspin_threshold()
1451 int count = atomic_read(&sem->rwbase.readers); in is_rwsem_reader_owned()
|
| /Linux-v5.15/include/linux/ |
| D | rwbase_rt.h | 12 atomic_t readers; member
18 .readers = ATOMIC_INIT(READER_BIAS), \
25 atomic_set(&(rwbase)->readers, READER_BIAS); \
31 return atomic_read(&rwb->readers) != READER_BIAS; in rw_base_is_locked()
36 return atomic_read(&rwb->readers) > 0; in rw_base_is_contended()
|
| D | rwlock_types.h | 59 atomic_t readers; member
|
| /Linux-v5.15/fs/btrfs/ |
| D | locking.c | 222 atomic_set(&lock->readers, 0); in btrfs_drew_lock_init()
237 if (atomic_read(&lock->readers)) in btrfs_drew_try_write_lock()
244 if (atomic_read(&lock->readers)) { in btrfs_drew_try_write_lock()
257 wait_event(lock->pending_writers, !atomic_read(&lock->readers)); in btrfs_drew_write_lock()
269 atomic_inc(&lock->readers); in btrfs_drew_read_lock()
289 if (atomic_dec_and_test(&lock->readers)) in btrfs_drew_read_unlock()
|
| D | subpage.c | 117 atomic_set(&(*ret)->readers, 0); in btrfs_alloc_subpage()
192 atomic_add(nbits, &subpage->readers); in btrfs_subpage_start_reader()
205 ASSERT(atomic_read(&subpage->readers) >= nbits); in btrfs_subpage_end_reader()
206 last = atomic_sub_and_test(nbits, &subpage->readers); in btrfs_subpage_end_reader()
238 ASSERT(atomic_read(&subpage->readers) == 0); in btrfs_subpage_start_writer()
|
| D | locking.h | 119 atomic_t readers; member
|
| /Linux-v5.15/drivers/misc/cardreader/ |
| D | Kconfig | 9 Alcor Micro card readers support access to many types of memory cards,
20 Realtek card readers support access to many types of memory cards,
29 Select this option to get support for Realtek USB 2.0 card readers
|
| /Linux-v5.15/Documentation/RCU/ |
| D | rcu.rst | 10 must be long enough that any readers accessing the item being deleted have
22 The advantage of RCU's two-part approach is that RCU readers need
27 in read-mostly situations. The fact that RCU readers need not
31 if the RCU readers give no indication when they are done?
33 Just as with spinlocks, RCU readers are not permitted to
43 same effect, but require that the readers manipulate CPU-local
|
| D | checklist.rst | 30 One final exception is where RCU readers are used to prevent
40 RCU does allow *readers* to run (almost) naked, but *writers* must
80 The whole point of RCU is to permit readers to run without
81 any locks or atomic operations. This means that readers will
94 locks (that are acquired by both readers and writers)
96 the readers refrain from accessing can be guarded by
101 c. Make updates appear atomic to readers. For example,
105 appear to be atomic to RCU readers, nor will sequences
111 readers see valid data at all phases of the update.
152 is common to readers and updaters. However, lockdep
[all …]
|
| D | whatisRCU.rst | 47 Section 1, though most readers will profit by reading this section at
70 new versions of these data items), and can run concurrently with readers.
72 readers is the semantics of modern CPUs guarantee that readers will see
76 removal phase. Because reclaiming data items can disrupt any readers
78 not start until readers no longer hold references to those data items.
82 reclamation phase until all readers active during the removal phase have
84 callback that is invoked after they finish. Only readers that are active
92 readers cannot gain a reference to it.
94 b. Wait for all previous readers to complete their RCU read-side
97 c. At this point, there cannot be any readers who hold references
[all …]
|
| D | lockdep.rst | 41 invoked by both RCU readers and updaters.
45 is invoked by both RCU-bh readers and updaters.
49 is invoked by both RCU-sched readers and updaters.
53 is invoked by both SRCU readers and updaters.
|
| D | rcubarrier.rst | 10 very low-overhead readers that are immune to deadlock, priority inversion,
16 readers, so that RCU updates to shared data must be undertaken quite
18 pre-existing readers have finished. These old versions are needed because
19 such readers might hold a reference to them. RCU updates can therefore be
22 How can an RCU writer possibly determine when all readers are finished,
23 given that readers might well leave absolutely no trace of their
25 pre-existing readers have completed. An updater wishing to delete an
|
| D | listRCU.rst | 52 with the ``tasklist_lock``. To prevent readers from noticing changes in the list
55 ensures that any readers traversing the list will see valid ``p->tasks.next``
58 memory until all existing readers finish.
195 need for writers to exclude readers.
202 readers to fail spectacularly.
204 So, when readers can tolerate stale data and when entries are either added or
|
| /Linux-v5.15/drivers/misc/ibmasm/ |
| D | event.c | 30 list_for_each_entry(reader, &sp->event_buffer->readers, node) in wake_up_event_readers()
123 list_add(&reader->node, &sp->event_buffer->readers); in ibmasm_event_reader_register()
153 INIT_LIST_HEAD(&buffer->readers); in ibmasm_event_buffer_init()
|
| /Linux-v5.15/Documentation/locking/ |
| D | lockdep-design.rst | 405 spin_lock() or write_lock()), non-recursive readers (i.e. shared lockers, like
406 down_read()) and recursive readers (recursive shared lockers, like rcu_read_lock()).
410 r: stands for non-recursive readers.
411 R: stands for recursive readers.
412 S: stands for all readers (non-recursive + recursive), as both are shared lockers.
413 N: stands for writers and non-recursive readers, as both are not recursive.
417 Recursive readers, as their name indicates, are the lockers allowed to acquire
421 While non-recursive readers will cause a self deadlock if trying to acquire inside
424 The difference between recursive readers and non-recursive readers is because:
425 recursive readers get blocked only by a write lock *holder*, while non-recursive
[all …]
|
| D | seqlock.rst | 9 lockless readers (read-only retry loops), and no writer starvation. They
23 is odd and indicates to the readers that an update is in progress. At
25 even again which lets readers make progress.
153 from interruption by readers. This is typically the case when the read
195 1. Normal Sequence readers which never block a writer but they must
206 2. Locking readers which will wait if a writer or another locking reader
218 according to a passed marker. This is used to avoid lockless readers
|
| D | locktypes.rst | 95 readers.
135 rw_semaphore is a multiple readers and single writer lock mechanism.
141 exist special-purpose interfaces that allow non-owner release for readers.
151 readers, a preempted low-priority reader will continue holding its lock,
152 thus starving even high-priority writers. In contrast, because readers
155 writer from starving readers.
302 rwlock_t is a multiple readers and single writer lock mechanism.
317 readers, a preempted low-priority reader will continue holding its lock,
318 thus starving even high-priority writers. In contrast, because readers
321 preventing that writer from starving readers.
|
| /Linux-v5.15/fs/ |
| D | pipe.c | 410 !READ_ONCE(pipe->readers); in pipe_writable()
431 if (!pipe->readers) { in pipe_write()
479 if (!pipe->readers) { in pipe_write()
690 if (!pipe->readers) in pipe_poll()
719 pipe->readers--; in pipe_release()
724 if (!pipe->readers != !pipe->writers) { in pipe_release()
883 pipe->readers = pipe->writers = 1; in get_pipe_inode()
1135 if (pipe->readers++ == 0) in fifo_open()
1157 if (!is_pipe && (filp->f_flags & O_NONBLOCK) && !pipe->readers) in fifo_open()
1164 if (!is_pipe && !pipe->readers) { in fifo_open()
[all …]
|
| D | splice.c | 194 if (unlikely(!pipe->readers)) { in splice_to_pipe()
237 if (unlikely(!pipe->readers)) { in add_to_pipe()
845 pipe->readers = 1; in splice_direct_to_actor()
990 if (unlikely(!pipe->readers)) { in wait_for_space()
1414 if (!pipe->readers) { in opipe_prep()
1473 if (!opipe->readers) { in splice_pipe_to_pipe()
1597 if (!opipe->readers) { in link_pipe()
|
| /Linux-v5.15/drivers/soc/aspeed/ |
| D | aspeed-p2a-ctrl.c | 65 u32 readers; member
192 ctrl->readers += 1; in aspeed_p2a_ioctl()
275 priv->parent->readers -= priv->read; in aspeed_p2a_release()
299 if (!open_regions && priv->parent->readers == 0) in aspeed_p2a_release()
|
| /Linux-v5.15/drivers/hid/ |
| D | hid-roccat.c | 47 struct list_head readers; member
191 list_add_tail(&reader->node, &device->readers); in roccat_open()
268 list_for_each_entry(reader, &device->readers, node) { in roccat_report_event()
335 INIT_LIST_HEAD(&device->readers); in roccat_connect()
|
| /Linux-v5.15/drivers/iio/ |
| D | TODO | 17 to state struct and using property handlers and readers.
|
| /Linux-v5.15/kernel/rcu/ |
| D | Kconfig | 102 these readers to appear in the idle loop as well as on the CPU
195 This option boosts the priority of preempted RCU readers that
211 readers blocking that grace period. Note that any RCU reader
245 bool "Tasks Trace RCU readers use memory barriers in user and idle"
|
| /Linux-v5.15/drivers/mtd/ubi/ |
| D | kapi.c | 162 vol->readers += 1; in ubi_open_volume()
172 if (vol->exclusive || vol->writers || vol->readers || in ubi_open_volume()
336 vol->readers -= 1; in ubi_close_volume()
|
