| /Linux-v5.10/drivers/gpu/drm/radeon/ |
| D | radeon_semaphore.c | 50 (*semaphore)->waiters = 0; in radeon_semaphore_create()
66 --semaphore->waiters; in radeon_semaphore_emit_signal()
83 ++semaphore->waiters; in radeon_semaphore_emit_wait()
99 if ((*semaphore)->waiters > 0) { in radeon_semaphore_free()
|
| D | radeon_trace.h | 176 __field(signed, waiters)
182 __entry->waiters = sem->waiters;
187 __entry->waiters, __entry->gpu_addr)
|
| /Linux-v5.10/kernel/locking/ |
| D | percpu-rwsem.c | 21 init_waitqueue_head(&sem->waiters); in __percpu_init_rwsem()
144 spin_lock_irq(&sem->waiters.lock); in percpu_rwsem_wait()
152 __add_wait_queue_entry_tail(&sem->waiters, &wq_entry); in percpu_rwsem_wait()
154 spin_unlock_irq(&sem->waiters.lock); in percpu_rwsem_wait()
261 __wake_up(&sem->waiters, TASK_NORMAL, 1, sem); in percpu_up_write()
|
| D | rtmutex_common.h | 49 return !RB_EMPTY_ROOT(&lock->waiters.rb_root); in rt_mutex_has_waiters()
55 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_top_waiter()
|
| D | rtmutex.c | 273 struct rb_node **link = &lock->waiters.rb_root.rb_node; in rt_mutex_enqueue()
290 rb_insert_color_cached(&waiter->tree_entry, &lock->waiters, leftmost); in rt_mutex_enqueue()
299 rb_erase_cached(&waiter->tree_entry, &lock->waiters); in rt_mutex_dequeue()
1678 lock->waiters = RB_ROOT_CACHED; in __rt_mutex_init()
|
| /Linux-v5.10/Documentation/locking/ |
| D | rt-mutex.rst | 32 The enqueueing of the waiters into the rtmutex waiter tree is done in
35 priority waiters tree. This tree too queues in priority order. Whenever
42 without waiters. The optimized fastpath operations require cmpxchg
50 keep track of the "lock has waiters" state:
56 NULL 1 lock is free and has waiters and the top waiter
59 taskpointer 1 lock is held and has waiters [2]_
71 waiters. This can happen when grabbing the lock in the slow path.
|
| D | rt-mutex-design.rst | 107 place the task in the waiters rbtree of a mutex as well as the
113 waiters
199 Every mutex keeps track of all the waiters that are blocked on itself. The
200 mutex has a rbtree to store these waiters by priority. This tree is protected
209 a tree of all top waiters of the mutexes that are owned by the process.
210 Note that this tree only holds the top waiters and not all waiters that are
309 flag. It's set whenever there are waiters on a mutex.
358 the pi_waiters of a task holds an order by priority of all the top waiters
410 in the pi_waiters and waiters trees that the task is blocked on. This function
434 the task on the waiters tree of the mutex, and if need be, the pi_waiters
[all …]
|
| D | futex-requeue-pi.rst | 7 left without an owner if it has waiters; doing so would break the PI
48 has waiters. Note that pthread_cond_wait() attempts to lock the
50 underlying rt_mutex with waiters, and no owner, breaking the
89 In order to ensure the rt_mutex has an owner if it has waiters, it
|
| D | ww-mutex-design.rst | 344 (1) Waiters with an acquire context are sorted by stamp order; waiters
346 (2) For Wait-Die, among waiters with contexts, only the first one can have
348 may come after other waiters without contexts in the list.
|
| D | robust-futexes.rst | 24 sys_futex(FUTEX_WAKE) syscall to wake them up. Once all waiters have
33 pthread_mutex_t, or yum is kill -9-ed), then waiters for that lock need
|
| /Linux-v5.10/drivers/md/persistent-data/ |
| D | dm-block-manager.c | 46 struct list_head waiters; member
153 list_for_each_entry_safe(w, tmp, &lock->waiters, list) { in __wake_many()
179 INIT_LIST_HEAD(&lock->waiters); in bl_init()
188 list_empty(&lock->waiters); in __available_for_read()
214 list_add_tail(&w.list, &lock->waiters); in bl_down_read()
249 if (!list_empty(&lock->waiters)) in bl_up_read()
266 if (lock->count == 0 && list_empty(&lock->waiters)) { in bl_down_write()
281 list_add(&w.list, &lock->waiters); in bl_down_write()
295 if (!list_empty(&lock->waiters)) in bl_up_write()
|
| /Linux-v5.10/include/linux/ |
| D | percpu-rwsem.h | 16 wait_queue_head_t waiters; member
35 .waiters = __WAIT_QUEUE_HEAD_INITIALIZER(name.waiters), \
|
| D | rtmutex.h | 32 struct rb_root_cached waiters; member
87 , .waiters = RB_ROOT_CACHED \
|
| D | page-flags.h | 330 PAGEFLAG(Waiters, waiters, PF_ONLY_HEAD) __CLEARPAGEFLAG(Waiters, waiters, PF_ONLY_HEAD)
|
| /Linux-v5.10/drivers/greybus/ |
| D | greybus_trace.h | 102 __field(int, waiters)
112 __entry->waiters = atomic_read(&operation->waiters);
118 __entry->active, __entry->waiters, __entry->errno)
|
| D | operation.c | 90 if (atomic_read(&operation->waiters)) in gb_operation_put_active()
554 atomic_set(&operation->waiters, 0); in gb_operation_create_common()
1082 atomic_inc(&operation->waiters); in gb_operation_cancel()
1085 atomic_dec(&operation->waiters); in gb_operation_cancel()
1109 atomic_inc(&operation->waiters); in gb_operation_cancel_incoming()
1112 atomic_dec(&operation->waiters); in gb_operation_cancel_incoming()
|
| /Linux-v5.10/drivers/gpu/drm/amd/amdkfd/ |
| D | kfd_events.c | 652 static void free_waiters(uint32_t num_events, struct kfd_event_waiter *waiters) in free_waiters() argument
657 if (waiters[i].event) in free_waiters()
658 remove_wait_queue(&waiters[i].event->wq, in free_waiters()
659 &waiters[i].wait); in free_waiters()
661 kfree(waiters); in free_waiters()
|
| /Linux-v5.10/Documentation/scheduler/ |
| D | completion.rst | 247 achieved calls complete() to signal exactly one of the waiters that it can
252 ... or calls complete_all() to signal all current and future waiters::
262 of waiters to continue - each call to complete() will simply increment the
287 completions that were not yet consumed by waiters (implying that there are
288 waiters) and true otherwise::
|
| /Linux-v5.10/drivers/tee/optee/ |
| D | call.c | 42 list_add_tail(&w->list_node, &cq->waiters); in optee_cq_wait_init()
57 list_add_tail(&w->list_node, &cq->waiters); in optee_cq_wait_for_completion()
66 list_for_each_entry(w, &cq->waiters, list_node) { in optee_cq_complete_one()
|
| D | optee_private.h | 35 struct list_head waiters; member
|
| /Linux-v5.10/include/linux/greybus/ |
| D | operation.h | 108 atomic_t waiters; member
|
| /Linux-v5.10/tools/testing/selftests/filesystems/epoll/ |
| D | epoll_wakeup_test.c | 3147 int waiters; member
3177 __atomic_fetch_add(&ctx->waiters, 1, __ATOMIC_ACQUIRE); in epoll60_wait_thread()
3191 __atomic_fetch_sub(&ctx->waiters, 1, __ATOMIC_RELEASE); in epoll60_wait_thread()
3211 return __atomic_load_n(&ctx->waiters, __ATOMIC_ACQUIRE); in count_waiters()
3217 pthread_t waiters[ARRAY_SIZE(ctx.evfd)]; in TEST() local
3237 for (i = 0; i < ARRAY_SIZE(waiters); i++) in TEST()
3238 ASSERT_EQ(pthread_create(&waiters[i], NULL, in TEST()
3275 for (i = 0; i < ARRAY_SIZE(waiters); i++) in TEST()
3276 ret = pthread_kill(waiters[i], SIGUSR1); in TEST()
3277 for (i = 0; i < ARRAY_SIZE(waiters); i++) in TEST()
[all …]
|
| /Linux-v5.10/fs/xfs/ |
| D | xfs_log_priv.h | 374 struct list_head waiters; member
|
| D | xfs_log.c | 154 INIT_LIST_HEAD(&head->waiters); in xlog_grant_head_init()
165 list_for_each_entry(tic, &head->waiters, t_queue) in xlog_grant_head_wake_all()
197 list_for_each_entry(tic, &head->waiters, t_queue) { in xlog_grant_head_wake()
244 list_add_tail(&tic->t_queue, &head->waiters); in xlog_grant_head_wait()
309 if (!list_empty_careful(&head->waiters)) { in xlog_grant_head_check()
1004 if (!list_empty_careful(&log->l_write_head.waiters)) { in xfs_log_space_wake()
1013 if (!list_empty_careful(&log->l_reserve_head.waiters)) { in xfs_log_space_wake()
|
| /Linux-v5.10/kernel/ |
| D | futex.c | 237 atomic_t waiters; member
323 atomic_inc(&hb->waiters); in hb_waiters_inc()
338 atomic_dec(&hb->waiters); in hb_waiters_dec()
349 return atomic_read(&hb->waiters); in hb_waiters_pending()
4063 atomic_set(&futex_queues[i].waiters, 0); in futex_init()
|
