Searched refs:pi_waiters (Results 1 – 8 of 8) sorted by relevance
67 return !RB_EMPTY_ROOT(&p->pi_waiters.rb_root); in task_has_pi_waiters()73 return rb_entry(p->pi_waiters.rb_leftmost, in task_top_pi_waiter()
62 DEBUG_LOCKS_WARN_ON(!RB_EMPTY_ROOT(&task->pi_waiters.rb_root)); in rt_mutex_debug_task_free()
307 struct rb_node **link = &task->pi_waiters.rb_root.rb_node; in rt_mutex_enqueue_pi()324 rb_insert_color_cached(&waiter->pi_tree_entry, &task->pi_waiters, leftmost); in rt_mutex_enqueue_pi()333 rb_erase_cached(&waiter->pi_tree_entry, &task->pi_waiters); in rt_mutex_dequeue_pi()
102 pi_waiters rbtree of a mutex owner task (described below).209 pi_waiters. It is protected by a spin lock also in the task structure,340 process must adjust its priority. With the help of the pi_waiters of a348 the pi_waiters of a task holds an order by priority of all the top waiters364 would decrease/unboost the priority of the task. That is because the pi_waiters399 in the pi_waiters and waiters trees that the task is blocked on. This function423 the task on the waiters tree of the mutex, and if need be, the pi_waiters449 pi_waiters tree.454 as the lock's owner's pi_waiters tree. This is described in the next468 previous top waiter process (if it exists) from the pi_waiters of the owner,[all …]
37 priority enqueueing is handled by "pi_waiters".
147 .pi_waiters = RB_ROOT_CACHED,
903 struct rb_root_cached pi_waiters; member
1564 p->pi_waiters = RB_ROOT_CACHED; in rt_mutex_init_task()
