43 	return !RB_EMPTY_NODE(&dl_se->rb_node);  in on_dl_rq()
50 	return dl_rq->rb_leftmost == &dl_se->rb_node;  in is_leftmost()
160 	struct rb_node **link = &dl_rq->pushable_dl_tasks_root.rb_node;  in enqueue_pushable_dl_task()
161 	struct rb_node *parent = NULL;  in enqueue_pushable_dl_task()
194 		struct rb_node *next_node;  in dequeue_pushable_dl_task()
837 		struct rb_node *leftmost = dl_rq->rb_leftmost;  in dec_dl_deadline()
840 		entry = rb_entry(leftmost, struct sched_dl_entity, rb_node);  in dec_dl_deadline()
885 	struct rb_node **link = &dl_rq->rb_root.rb_node;  in __enqueue_dl_entity()
886 	struct rb_node *parent = NULL;  in __enqueue_dl_entity()
890 	BUG_ON(!RB_EMPTY_NODE(&dl_se->rb_node));  in __enqueue_dl_entity()
894 		entry = rb_entry(parent, struct sched_dl_entity, rb_node);  in __enqueue_dl_entity()
904 		dl_rq->rb_leftmost = &dl_se->rb_node;  in __enqueue_dl_entity()
906 	rb_link_node(&dl_se->rb_node, parent, link);  in __enqueue_dl_entity()
907 	rb_insert_color(&dl_se->rb_node, &dl_rq->rb_root);  in __enqueue_dl_entity()
916 	if (RB_EMPTY_NODE(&dl_se->rb_node))  in __dequeue_dl_entity()
919 	if (dl_rq->rb_leftmost == &dl_se->rb_node) {  in __dequeue_dl_entity()
920 		struct rb_node *next_node;  in __dequeue_dl_entity()
922 		next_node = rb_next(&dl_se->rb_node);  in __dequeue_dl_entity()
926 	rb_erase(&dl_se->rb_node, &dl_rq->rb_root);  in __dequeue_dl_entity()
927 	RB_CLEAR_NODE(&dl_se->rb_node);  in __dequeue_dl_entity()
1147 	struct rb_node *left = dl_rq->rb_leftmost;  in pick_next_dl_entity()
1152 	return rb_entry(left, struct sched_dl_entity, rb_node);  in pick_next_dl_entity()
1280 	struct rb_node *next_node = rq->dl.rb_leftmost;  in pick_next_earliest_dl_task()
1287 		dl_se = rb_entry(next_node, struct sched_dl_entity, rb_node);  in pick_next_earliest_dl_task()
1305 	struct rb_node *next_node = rq->dl.pushable_dl_tasks_leftmost;  in pick_earliest_pushable_dl_task()