Searched refs:pi_tree_entry (Results 1 – 3 of 3) sorted by relevance
215 entry = rb_entry(parent, struct rt_mutex_waiter, pi_tree_entry); in rt_mutex_enqueue_pi()225 task->pi_waiters_leftmost = &waiter->pi_tree_entry; in rt_mutex_enqueue_pi()227 rb_link_node(&waiter->pi_tree_entry, parent, link); in rt_mutex_enqueue_pi()228 rb_insert_color(&waiter->pi_tree_entry, &task->pi_waiters); in rt_mutex_enqueue_pi()234 if (RB_EMPTY_NODE(&waiter->pi_tree_entry)) in rt_mutex_dequeue_pi()237 if (task->pi_waiters_leftmost == &waiter->pi_tree_entry) in rt_mutex_dequeue_pi()238 task->pi_waiters_leftmost = rb_next(&waiter->pi_tree_entry); in rt_mutex_dequeue_pi()240 rb_erase(&waiter->pi_tree_entry, &task->pi_waiters); in rt_mutex_dequeue_pi()241 RB_CLEAR_NODE(&waiter->pi_tree_entry); in rt_mutex_dequeue_pi()1171 RB_CLEAR_NODE(&waiter.pi_tree_entry); in rt_mutex_slowlock()
49 struct rb_node pi_tree_entry; member89 pi_tree_entry); in task_top_pi_waiter()
2597 RB_CLEAR_NODE(&rt_waiter.pi_tree_entry); in futex_wait_requeue_pi()