23 static inline struct task_struct *dl_task_of(struct sched_dl_entity *dl_se)  in dl_task_of()
33 static inline struct dl_rq *dl_rq_of_se(struct sched_dl_entity *dl_se)  in dl_rq_of_se()
41 static inline int on_dl_rq(struct sched_dl_entity *dl_se)  in on_dl_rq()
48 	struct sched_dl_entity *dl_se = &p->dl;  in is_leftmost()
133 static void inc_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq)  in inc_dl_migration()
143 static void dec_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq)  in dec_dl_migration()
299 void inc_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq)  in inc_dl_migration()
304 void dec_dl_migration(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq)  in dec_dl_migration()
343 static inline void setup_new_dl_entity(struct sched_dl_entity *dl_se,  in setup_new_dl_entity()
344 				       struct sched_dl_entity *pi_se)  in setup_new_dl_entity()
379 static void replenish_dl_entity(struct sched_dl_entity *dl_se,  in replenish_dl_entity()
380 				struct sched_dl_entity *pi_se)  in replenish_dl_entity()
452 static bool dl_entity_overflow(struct sched_dl_entity *dl_se,  in dl_entity_overflow()
453 			       struct sched_dl_entity *pi_se, u64 t)  in dl_entity_overflow()
491 static void update_dl_entity(struct sched_dl_entity *dl_se,  in update_dl_entity()
492 			     struct sched_dl_entity *pi_se)  in update_dl_entity()
525 	struct sched_dl_entity *dl_se = &p->dl;  in start_dl_timer()
583 	struct sched_dl_entity *dl_se = container_of(timer,  in dl_task_timer()
584 						     struct sched_dl_entity,  in dl_task_timer()
694 void init_dl_task_timer(struct sched_dl_entity *dl_se)  in init_dl_task_timer()
703 int dl_runtime_exceeded(struct sched_dl_entity *dl_se)  in dl_runtime_exceeded()
717 	struct sched_dl_entity *dl_se = &curr->dl;  in update_curr_dl()
838 		struct sched_dl_entity *entry;  in dec_dl_deadline()
840 		entry = rb_entry(leftmost, struct sched_dl_entity, rb_node);  in dec_dl_deadline()
855 void inc_dl_tasks(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq)  in inc_dl_tasks()
869 void dec_dl_tasks(struct sched_dl_entity *dl_se, struct dl_rq *dl_rq)  in dec_dl_tasks()
882 static void __enqueue_dl_entity(struct sched_dl_entity *dl_se)  in __enqueue_dl_entity()
887 	struct sched_dl_entity *entry;  in __enqueue_dl_entity()
894 		entry = rb_entry(parent, struct sched_dl_entity, rb_node);  in __enqueue_dl_entity()
912 static void __dequeue_dl_entity(struct sched_dl_entity *dl_se)  in __dequeue_dl_entity()
933 enqueue_dl_entity(struct sched_dl_entity *dl_se,  in enqueue_dl_entity()
934 		  struct sched_dl_entity *pi_se, int flags)  in enqueue_dl_entity()
951 static void dequeue_dl_entity(struct sched_dl_entity *dl_se)  in dequeue_dl_entity()
959 	struct sched_dl_entity *pi_se = &p->dl;  in enqueue_task_dl()
1144 static struct sched_dl_entity *pick_next_dl_entity(struct rq *rq,  in pick_next_dl_entity()
1152 	return rb_entry(left, struct sched_dl_entity, rb_node);  in pick_next_dl_entity()
1157 	struct sched_dl_entity *dl_se;  in pick_next_task_dl()
1281 	struct sched_dl_entity *dl_se;  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()