Searched refs:tree_entry (Results 1 – 2 of 2) sorted by relevance
28 struct rb_node tree_entry; member59 w = rb_entry(leftmost, struct rt_mutex_waiter, tree_entry); in rt_mutex_top_waiter()
282 entry = rb_entry(parent, struct rt_mutex_waiter, tree_entry); in rt_mutex_enqueue()291 rb_link_node(&waiter->tree_entry, parent, link); in rt_mutex_enqueue()292 rb_insert_color_cached(&waiter->tree_entry, &lock->waiters, leftmost); in rt_mutex_enqueue()298 if (RB_EMPTY_NODE(&waiter->tree_entry)) in rt_mutex_dequeue()301 rb_erase_cached(&waiter->tree_entry, &lock->waiters); in rt_mutex_dequeue()302 RB_CLEAR_NODE(&waiter->tree_entry); in rt_mutex_dequeue()1152 RB_CLEAR_NODE(&waiter->tree_entry); in rt_mutex_init_waiter()