Home
last modified time | relevance | path

Searched refs:pi_waiters (Results 1 – 8 of 8) sorted by relevance

/linux/kernel/locking/
A Drtmutex_common.h125 return !RB_EMPTY_ROOT(&p->pi_waiters.rb_root); in task_has_pi_waiters()
130 return rb_entry(p->pi_waiters.rb_leftmost, struct rt_mutex_waiter, in task_top_pi_waiter()
A Drtmutex.c423 rb_add_cached(&waiter->pi_tree_entry, &task->pi_waiters, __pi_waiter_less); in rt_mutex_enqueue_pi()
432 rb_erase_cached(&waiter->pi_tree_entry, &task->pi_waiters); in rt_mutex_dequeue_pi()
A Drtmutex_api.c465 DEBUG_LOCKS_WARN_ON(!RB_EMPTY_ROOT(&task->pi_waiters.rb_root)); in rt_mutex_debug_task_free()
/linux/Documentation/locking/
A Drt-mutex-design.rst108 pi_waiters rbtree of a mutex owner task (described below).
219 pi_waiters. It is protected by a spin lock also in the task structure,
350 process must adjust its priority. With the help of the pi_waiters of a
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
461 pi_waiters tree.
466 as the lock's owner's pi_waiters tree. This is described in the next
480 previous top waiter process (if it exists) from the pi_waiters of the owner,
485 If the owner is also blocked on a lock, and had its pi_waiters changed
[all …]
A Drt-mutex.rst38 priority enqueueing is handled by "pi_waiters".
/linux/init/
A Dinit_task.c166 .pi_waiters = RB_ROOT_CACHED,
/linux/include/linux/
A Dsched.h1115 struct rb_root_cached pi_waiters; member
/linux/kernel/
A Dfork.c1729 p->pi_waiters = RB_ROOT_CACHED; in rt_mutex_init_task()

Completed in 20 milliseconds