Home
last modified time | relevance | path

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

/linux-6.6.21/kernel/locking/
Drtmutex_common.h144 return !RB_EMPTY_ROOT(&p->pi_waiters.rb_root); in task_has_pi_waiters()
151 return rb_entry(p->pi_waiters.rb_leftmost, struct rt_mutex_waiter, in task_top_pi_waiter()
Drtmutex_api.c487 DEBUG_LOCKS_WARN_ON(!RB_EMPTY_ROOT(&task->pi_waiters.rb_root)); in rt_mutex_debug_task_free()
Drtmutex.c489 rb_add_cached(&waiter->pi_tree.entry, &task->pi_waiters, __pi_waiter_less); in rt_mutex_enqueue_pi()
500 rb_erase_cached(&waiter->pi_tree.entry, &task->pi_waiters); in rt_mutex_dequeue_pi()
/linux-6.6.21/Documentation/locking/
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
375 would decrease/unboost the priority of the task. That is because the pi_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,
[all …]
Drt-mutex.rst38 priority enqueueing is handled by "pi_waiters".
/linux-6.6.21/init/
Dinit_task.c167 .pi_waiters = RB_ROOT_CACHED,
/linux-6.6.21/include/linux/
Dsched.h1141 struct rb_root_cached pi_waiters; member
/linux-6.6.21/kernel/
Dfork.c1944 p->pi_waiters = RB_ROOT_CACHED; in rt_mutex_init_task()