rt_waiter_node
&(struct rt_waiter_node){ .prio = __waiter_prio(p), .deadline = (p)->dl.deadline }
static __always_inline int rt_waiter_node_less(struct rt_waiter_node *left,
struct rt_waiter_node *right)
static __always_inline int rt_waiter_node_equal(struct rt_waiter_node *left,
struct rt_waiter_node *right)
rb_entry((node), struct rt_waiter_node, entry)
struct rt_waiter_node tree;
struct rt_waiter_node pi_tree;