Home
last modified time | relevance | path

Searched refs:waiters (Results 1 – 25 of 51) sorted by relevance

123

/openbmc/linux/drivers/gpu/drm/radeon/
H A Dradeon_semaphore.c50 (*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()
H A Dradeon_trace.h176 __field(signed, waiters)
182 __entry->waiters = sem->waiters;
187 __entry->waiters, __entry->gpu_addr)
/openbmc/linux/Documentation/translations/zh_CN/userspace-api/
H A Dfutex2.rst30 futex_waitv(struct futex_waitv *waiters, unsigned int nr_futexes,
43 ``waiters`` 传递。如果 ``waiters`` 或任何的 ``uaddr`` 地址无效，将返回 ``-EFAULT`` 。
52 对于每个 ``waiters`` 数组中的项，在 ``uaddr`` 的当前值会和 ``val`` 比较。如果
/openbmc/linux/kernel/locking/
H A Dpercpu-rwsem.c23 init_waitqueue_head(&sem->waiters); in __percpu_init_rwsem()
146 spin_lock_irq(&sem->waiters.lock); in percpu_rwsem_wait()
154 __add_wait_queue_entry_tail(&sem->waiters, &wq_entry); in percpu_rwsem_wait()
156 spin_unlock_irq(&sem->waiters.lock); in percpu_rwsem_wait()
273 __wake_up(&sem->waiters, TASK_NORMAL, 1, sem); in percpu_up_write()
H A Drtmutex_common.h112 return !RB_EMPTY_ROOT(&lock->waiters.rb_root); in rt_mutex_has_waiters()
123 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_waiter_is_top_waiter()
130 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_top_waiter()
182 lock->waiters = RB_ROOT_CACHED; in __rt_mutex_base_init()
H A Dww_mutex.h96 struct rb_node *n = rb_first(&lock->rtmutex.waiters.rb_root); in __ww_waiter_first()
123 struct rb_node *n = rb_last(&lock->rtmutex.waiters.rb_root); in __ww_waiter_last()
/openbmc/linux/Documentation/locking/
H A Drt-mutex.rst32 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.
H A Drt-mutex-design.rst107 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 …]
H A Dfutex-requeue-pi.rst7 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
/openbmc/linux/drivers/md/persistent-data/
H A Ddm-block-manager.c47 struct list_head waiters; member
155 list_for_each_entry_safe(w, tmp, &lock->waiters, list) { in __wake_many()
181 INIT_LIST_HEAD(&lock->waiters); in bl_init()
190 list_empty(&lock->waiters); in __available_for_read()
216 list_add_tail(&w.list, &lock->waiters); in bl_down_read()
251 if (!list_empty(&lock->waiters)) in bl_up_read()
268 if (lock->count == 0 && list_empty(&lock->waiters)) { in bl_down_write()
283 list_add(&w.list, &lock->waiters); in bl_down_write()
297 if (!list_empty(&lock->waiters)) in bl_up_write()
/openbmc/linux/tools/testing/selftests/futex/include/
H A Dfutex2test.h18 static inline int futex_waitv(volatile struct futex_waitv *waiters, unsigned long nr_waiters, in futex_waitv() argument
21 return syscall(__NR_futex_waitv, waiters, nr_waiters, flags, timo, clockid); in futex_waitv()
/openbmc/qemu/util/
H A Dqemu-coroutine-lock.c240 int waiters, i; in qemu_co_mutex_lock() local
251 waiters = qatomic_cmpxchg(&mutex->locked, 0, 1); in qemu_co_mutex_lock()
252 if (waiters != 0) { in qemu_co_mutex_lock()
253 while (waiters == 1 && ++i < 1000) { in qemu_co_mutex_lock()
262 waiters = qatomic_fetch_inc(&mutex->locked); in qemu_co_mutex_lock()
265 if (waiters == 0) { in qemu_co_mutex_lock()
/openbmc/linux/include/linux/
H A Dpercpu-rwsem.h16 wait_queue_head_t waiters; member
35 .waiters = __WAIT_QUEUE_HEAD_INITIALIZER(name.waiters), \
H A Drtmutex.h25 struct rb_root_cached waiters; member
32 .waiters = RB_ROOT_CACHED, \
/openbmc/linux/kernel/futex/
H A Dfutex.h46 atomic_t waiters; member
187 atomic_inc(&hb->waiters); in futex_hb_waiters_inc()
202 atomic_dec(&hb->waiters); in futex_hb_waiters_dec()
213 return atomic_read(&hb->waiters); in futex_hb_waiters_pending()
H A Dsyscalls.c246 SYSCALL_DEFINE5(futex_waitv, struct futex_waitv __user *, waiters, in SYSCALL_DEFINE5() argument
260 if (!nr_futexes || nr_futexes > FUTEX_WAITV_MAX || !waiters) in SYSCALL_DEFINE5()
294 ret = futex_parse_waitv(futexv, waiters, nr_futexes); in SYSCALL_DEFINE5()
/openbmc/linux/drivers/gpu/host1x/
H A Ddebug.c94 unsigned int waiters = 0; in show_syncpts() local
98 waiters++; in show_syncpts()
104 if (!show_all && !min && !max && !waiters) in show_syncpts()
109 i, m->syncpt[i].name, min, max, waiters); in show_syncpts()
/openbmc/linux/Documentation/userspace-api/
H A Dfutex2.rst25 futex_waitv(struct futex_waitv *waiters, unsigned int nr_futexes,
39 pointer for the first item of the array is passed as ``waiters``. An invalid
40 address for ``waiters`` or for any ``uaddr`` returns ``-EFAULT``.
52 For each entry in ``waiters`` array, the current value at ``uaddr`` is compared
/openbmc/linux/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_events.c915 static void free_waiters(uint32_t num_events, struct kfd_event_waiter *waiters, in free_waiters() argument
921 if (waiters[i].event) { in free_waiters()
922 spin_lock(&waiters[i].event->lock); in free_waiters()
923 remove_wait_queue(&waiters[i].event->wq, in free_waiters()
924 &waiters[i].wait); in free_waiters()
925 if (undo_auto_reset && waiters[i].activated && in free_waiters()
926 waiters[i].event && waiters[i].event->auto_reset) in free_waiters()
927 set_event(waiters[i].event); in free_waiters()
928 spin_unlock(&waiters[i].event->lock); in free_waiters()
931 kfree(waiters); in free_waiters()
/openbmc/linux/drivers/greybus/
H A Dgreybus_trace.h102 __field(int, waiters)
112 __entry->waiters = atomic_read(&operation->waiters);
118 __entry->active, __entry->waiters, __entry->errno)
H A Doperation.c90 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()
/openbmc/qemu/docs/spin/
H A Daio_notify_bug.promela116 * If event stayed always true, the waiters would be busy looping.
117 * If event stayed always false, the waiters would be sleeping
H A Daio_notify_accept.promela128 * If event stayed always true, the waiters would be busy looping.
129 * If event stayed always false, the waiters would be sleeping
/openbmc/linux/drivers/tee/optee/
H A Dcall.c62 list_add_tail(&w->list_node, &cq->waiters); in optee_cq_wait_init()
77 list_add_tail(&w->list_node, &cq->waiters); in optee_cq_wait_for_completion()
86 list_for_each_entry(w, &cq->waiters, list_node) { in optee_cq_complete_one()
/openbmc/linux/Documentation/scheduler/
H A Dcompletion.rst247 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::

123