Searched refs:pi_tree (Results 1 – 2 of 2) sorted by relevance
43 * @pi_tree: node to enqueue into the mutex owner waiters tree50 * @pi_tree is ordered by rt_mutex_owner(@lock)->pi_lock54 struct rt_waiter_node pi_tree; member 153 pi_tree.entry); in task_top_pi_waiter() 215 RB_CLEAR_NODE(&waiter->pi_tree.entry); in rt_mutex_init_waiter()
373 * Update the waiter->pi_tree copy of the sort keys (from the tree copy).380 lockdep_assert(RB_EMPTY_NODE(&waiter->pi_tree.entry)); in waiter_clone_prio() 382 waiter->pi_tree.prio = waiter->tree.prio; in waiter_clone_prio() 383 waiter->pi_tree.deadline = waiter->tree.deadline; in waiter_clone_prio() 512 rb_add_cached(&waiter->pi_tree.entry, &task->pi_waiters, __pi_waiter_less); in rt_mutex_enqueue_pi() 520 if (RB_EMPTY_NODE(&waiter->pi_tree.entry)) in rt_mutex_dequeue_pi() 523 rb_erase_cached(&waiter->pi_tree.entry, &task->pi_waiters); in rt_mutex_dequeue_pi() 524 RB_CLEAR_NODE(&waiter->pi_tree.entry); in rt_mutex_dequeue_pi()