110 #define rt_entity_is_task(rt_se) (!(rt_se)->my_q)  argument
112 static inline struct task_struct *rt_task_of(struct sched_rt_entity *rt_se)  in rt_task_of()  argument
115 	WARN_ON_ONCE(!rt_entity_is_task(rt_se));  in rt_task_of()
117 	return container_of(rt_se, struct task_struct, rt);  in rt_task_of()
125 static inline struct rt_rq *rt_rq_of_se(struct sched_rt_entity *rt_se)  in rt_rq_of_se()  argument
127 	return rt_se->rt_rq;  in rt_rq_of_se()
130 static inline struct rq *rq_of_rt_se(struct sched_rt_entity *rt_se)  in rq_of_rt_se()  argument
132 	struct rt_rq *rt_rq = rt_se->rt_rq;  in rq_of_rt_se()
141 	if (tg->rt_se)  in free_rt_sched_group()
147 		if (tg->rt_se)  in free_rt_sched_group()
148 			kfree(tg->rt_se[i]);  in free_rt_sched_group()
152 	kfree(tg->rt_se);  in free_rt_sched_group()
156 		struct sched_rt_entity *rt_se, int cpu,  in init_tg_rt_entry()  argument
167 	tg->rt_se[cpu] = rt_se;  in init_tg_rt_entry()
169 	if (!rt_se)  in init_tg_rt_entry()
173 		rt_se->rt_rq = &rq->rt;  in init_tg_rt_entry()
175 		rt_se->rt_rq = parent->my_q;  in init_tg_rt_entry()
177 	rt_se->my_q = rt_rq;  in init_tg_rt_entry()
178 	rt_se->parent = parent;  in init_tg_rt_entry()
179 	INIT_LIST_HEAD(&rt_se->run_list);  in init_tg_rt_entry()
185 	struct sched_rt_entity *rt_se;  in alloc_rt_sched_group()  local
191 	tg->rt_se = kcalloc(nr_cpu_ids, sizeof(rt_se), GFP_KERNEL);  in alloc_rt_sched_group()
192 	if (!tg->rt_se)  in alloc_rt_sched_group()
204 		rt_se = kzalloc_node(sizeof(struct sched_rt_entity),  in alloc_rt_sched_group()
206 		if (!rt_se)  in alloc_rt_sched_group()
211 		init_tg_rt_entry(tg, rt_rq, rt_se, i, parent->rt_se[i]);  in alloc_rt_sched_group()
224 #define rt_entity_is_task(rt_se) (1)  argument
226 static inline struct task_struct *rt_task_of(struct sched_rt_entity *rt_se)  in rt_task_of()  argument
228 	return container_of(rt_se, struct task_struct, rt);  in rt_task_of()
236 static inline struct rq *rq_of_rt_se(struct sched_rt_entity *rt_se)  in rq_of_rt_se()  argument
238 	struct task_struct *p = rt_task_of(rt_se);  in rq_of_rt_se()
243 static inline struct rt_rq *rt_rq_of_se(struct sched_rt_entity *rt_se)  in rt_rq_of_se()  argument
245 	struct rq *rq = rq_of_rt_se(rt_se);  in rt_rq_of_se()
315 static void inc_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in inc_rt_migration()  argument
319 	if (!rt_entity_is_task(rt_se))  in inc_rt_migration()
322 	p = rt_task_of(rt_se);  in inc_rt_migration()
332 static void dec_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in dec_rt_migration()  argument
336 	if (!rt_entity_is_task(rt_se))  in dec_rt_migration()
339 	p = rt_task_of(rt_se);  in dec_rt_migration()
408 void inc_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in inc_rt_migration()  argument
413 void dec_rt_migration(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in dec_rt_migration()  argument
434 static inline int on_rt_rq(struct sched_rt_entity *rt_se)  in on_rt_rq()  argument
436 	return rt_se->on_rq;  in on_rt_rq()
474 #define for_each_sched_rt_entity(rt_se) \  argument
475 	for (; rt_se; rt_se = rt_se->parent)
477 static inline struct rt_rq *group_rt_rq(struct sched_rt_entity *rt_se)  in group_rt_rq()  argument
479 	return rt_se->my_q;  in group_rt_rq()
482 static void enqueue_rt_entity(struct sched_rt_entity *rt_se, unsigned int flags);
483 static void dequeue_rt_entity(struct sched_rt_entity *rt_se, unsigned int flags);
489 	struct sched_rt_entity *rt_se;  in sched_rt_rq_enqueue()  local
493 	rt_se = rt_rq->tg->rt_se[cpu];  in sched_rt_rq_enqueue()
496 		if (!rt_se)  in sched_rt_rq_enqueue()
498 		else if (!on_rt_rq(rt_se))  in sched_rt_rq_enqueue()
499 			enqueue_rt_entity(rt_se, 0);  in sched_rt_rq_enqueue()
508 	struct sched_rt_entity *rt_se;  in sched_rt_rq_dequeue()  local
511 	rt_se = rt_rq->tg->rt_se[cpu];  in sched_rt_rq_dequeue()
513 	if (!rt_se) {  in sched_rt_rq_dequeue()
518 	else if (on_rt_rq(rt_se))  in sched_rt_rq_dequeue()
519 		dequeue_rt_entity(rt_se, 0);  in sched_rt_rq_dequeue()
527 static int rt_se_boosted(struct sched_rt_entity *rt_se)  in rt_se_boosted()  argument
529 	struct rt_rq *rt_rq = group_rt_rq(rt_se);  in rt_se_boosted()
535 	p = rt_task_of(rt_se);  in rt_se_boosted()
579 #define for_each_sched_rt_entity(rt_se) \  argument
580 	for (; rt_se; rt_se = NULL)
582 static inline struct rt_rq *group_rt_rq(struct sched_rt_entity *rt_se)  in group_rt_rq()  argument
895 static inline int rt_se_prio(struct sched_rt_entity *rt_se)  in rt_se_prio()  argument
898 	struct rt_rq *rt_rq = group_rt_rq(rt_se);  in rt_se_prio()
904 	return rt_task_of(rt_se)->prio;  in rt_se_prio()
957 	struct sched_rt_entity *rt_se = &curr->rt;  in update_curr_rt()  local
981 	for_each_sched_rt_entity(rt_se) {  in update_curr_rt()
982 		struct rt_rq *rt_rq = rt_rq_of_se(rt_se);  in update_curr_rt()
1124 inc_rt_group(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in inc_rt_group()  argument
1126 	if (rt_se_boosted(rt_se))  in inc_rt_group()
1134 dec_rt_group(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in dec_rt_group()  argument
1136 	if (rt_se_boosted(rt_se))  in dec_rt_group()
1145 inc_rt_group(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in inc_rt_group()  argument
1151 void dec_rt_group(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq) {}  in dec_rt_group()  argument
1156 unsigned int rt_se_nr_running(struct sched_rt_entity *rt_se)  in rt_se_nr_running()  argument
1158 	struct rt_rq *group_rq = group_rt_rq(rt_se);  in rt_se_nr_running()
1167 unsigned int rt_se_rr_nr_running(struct sched_rt_entity *rt_se)  in rt_se_rr_nr_running()  argument
1169 	struct rt_rq *group_rq = group_rt_rq(rt_se);  in rt_se_rr_nr_running()
1175 	tsk = rt_task_of(rt_se);  in rt_se_rr_nr_running()
1181 void inc_rt_tasks(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in inc_rt_tasks()  argument
1183 	int prio = rt_se_prio(rt_se);  in inc_rt_tasks()
1186 	rt_rq->rt_nr_running += rt_se_nr_running(rt_se);  in inc_rt_tasks()
1187 	rt_rq->rr_nr_running += rt_se_rr_nr_running(rt_se);  in inc_rt_tasks()
1190 	inc_rt_migration(rt_se, rt_rq);  in inc_rt_tasks()
1191 	inc_rt_group(rt_se, rt_rq);  in inc_rt_tasks()
1195 void dec_rt_tasks(struct sched_rt_entity *rt_se, struct rt_rq *rt_rq)  in dec_rt_tasks()  argument
1197 	WARN_ON(!rt_prio(rt_se_prio(rt_se)));  in dec_rt_tasks()
1199 	rt_rq->rt_nr_running -= rt_se_nr_running(rt_se);  in dec_rt_tasks()
1200 	rt_rq->rr_nr_running -= rt_se_rr_nr_running(rt_se);  in dec_rt_tasks()
1202 	dec_rt_prio(rt_rq, rt_se_prio(rt_se));  in dec_rt_tasks()
1203 	dec_rt_migration(rt_se, rt_rq);  in dec_rt_tasks()
1204 	dec_rt_group(rt_se, rt_rq);  in dec_rt_tasks()
1220 static void __delist_rt_entity(struct sched_rt_entity *rt_se, struct rt_prio_array *array)  in __delist_rt_entity()  argument
1222 	list_del_init(&rt_se->run_list);  in __delist_rt_entity()
1224 	if (list_empty(array->queue + rt_se_prio(rt_se)))  in __delist_rt_entity()
1225 		__clear_bit(rt_se_prio(rt_se), array->bitmap);  in __delist_rt_entity()
1227 	rt_se->on_list = 0;  in __delist_rt_entity()
1230 static void __enqueue_rt_entity(struct sched_rt_entity *rt_se, unsigned int flags)  in __enqueue_rt_entity()  argument
1232 	struct rt_rq *rt_rq = rt_rq_of_se(rt_se);  in __enqueue_rt_entity()
1234 	struct rt_rq *group_rq = group_rt_rq(rt_se);  in __enqueue_rt_entity()
1235 	struct list_head *queue = array->queue + rt_se_prio(rt_se);  in __enqueue_rt_entity()
1244 		if (rt_se->on_list)  in __enqueue_rt_entity()
1245 			__delist_rt_entity(rt_se, array);  in __enqueue_rt_entity()
1250 		WARN_ON_ONCE(rt_se->on_list);  in __enqueue_rt_entity()
1252 			list_add(&rt_se->run_list, queue);  in __enqueue_rt_entity()
1254 			list_add_tail(&rt_se->run_list, queue);  in __enqueue_rt_entity()
1256 		__set_bit(rt_se_prio(rt_se), array->bitmap);  in __enqueue_rt_entity()
1257 		rt_se->on_list = 1;  in __enqueue_rt_entity()
1259 	rt_se->on_rq = 1;  in __enqueue_rt_entity()
1261 	inc_rt_tasks(rt_se, rt_rq);  in __enqueue_rt_entity()
1264 static void __dequeue_rt_entity(struct sched_rt_entity *rt_se, unsigned int flags)  in __dequeue_rt_entity()  argument
1266 	struct rt_rq *rt_rq = rt_rq_of_se(rt_se);  in __dequeue_rt_entity()
1270 		WARN_ON_ONCE(!rt_se->on_list);  in __dequeue_rt_entity()
1271 		__delist_rt_entity(rt_se, array);  in __dequeue_rt_entity()
1273 	rt_se->on_rq = 0;  in __dequeue_rt_entity()
1275 	dec_rt_tasks(rt_se, rt_rq);  in __dequeue_rt_entity()
1282 static void dequeue_rt_stack(struct sched_rt_entity *rt_se, unsigned int flags)  in dequeue_rt_stack()  argument
1286 	for_each_sched_rt_entity(rt_se) {  in dequeue_rt_stack()
1287 		rt_se->back = back;  in dequeue_rt_stack()
1288 		back = rt_se;  in dequeue_rt_stack()
1293 	for (rt_se = back; rt_se; rt_se = rt_se->back) {  in dequeue_rt_stack()
1294 		if (on_rt_rq(rt_se))  in dequeue_rt_stack()
1295 			__dequeue_rt_entity(rt_se, flags);  in dequeue_rt_stack()
1299 static void enqueue_rt_entity(struct sched_rt_entity *rt_se, unsigned int flags)  in enqueue_rt_entity()  argument
1301 	struct rq *rq = rq_of_rt_se(rt_se);  in enqueue_rt_entity()
1303 	dequeue_rt_stack(rt_se, flags);  in enqueue_rt_entity()
1304 	for_each_sched_rt_entity(rt_se)  in enqueue_rt_entity()
1305 		__enqueue_rt_entity(rt_se, flags);  in enqueue_rt_entity()
1309 static void dequeue_rt_entity(struct sched_rt_entity *rt_se, unsigned int flags)  in dequeue_rt_entity()  argument
1311 	struct rq *rq = rq_of_rt_se(rt_se);  in dequeue_rt_entity()
1313 	dequeue_rt_stack(rt_se, flags);  in dequeue_rt_entity()
1315 	for_each_sched_rt_entity(rt_se) {  in dequeue_rt_entity()
1316 		struct rt_rq *rt_rq = group_rt_rq(rt_se);  in dequeue_rt_entity()
1319 			__enqueue_rt_entity(rt_se, flags);  in dequeue_rt_entity()
1330 	struct sched_rt_entity *rt_se = &p->rt;  in enqueue_task_rt()  local
1333 		rt_se->timeout = 0;  in enqueue_task_rt()
1335 	enqueue_rt_entity(rt_se, flags);  in enqueue_task_rt()
1343 	struct sched_rt_entity *rt_se = &p->rt;  in dequeue_task_rt()  local
1346 	dequeue_rt_entity(rt_se, flags);  in dequeue_task_rt()
1356 requeue_rt_entity(struct rt_rq *rt_rq, struct sched_rt_entity *rt_se, int head)  in requeue_rt_entity()  argument
1358 	if (on_rt_rq(rt_se)) {  in requeue_rt_entity()
1360 		struct list_head *queue = array->queue + rt_se_prio(rt_se);  in requeue_rt_entity()
1363 			list_move(&rt_se->run_list, queue);  in requeue_rt_entity()
1365 			list_move_tail(&rt_se->run_list, queue);  in requeue_rt_entity()
1371 	struct sched_rt_entity *rt_se = &p->rt;  in requeue_task_rt()  local
1374 	for_each_sched_rt_entity(rt_se) {  in requeue_task_rt()
1375 		rt_rq = rt_rq_of_se(rt_se);  in requeue_task_rt()
1376 		requeue_rt_entity(rt_rq, rt_se, head);  in requeue_task_rt()
1520 	struct sched_rt_entity *rt_se;  in _pick_next_task_rt()  local
1525 		rt_se = pick_next_rt_entity(rq, rt_rq);  in _pick_next_task_rt()
1526 		BUG_ON(!rt_se);  in _pick_next_task_rt()
1527 		rt_rq = group_rt_rq(rt_se);  in _pick_next_task_rt()
1530 	p = rt_task_of(rt_se);  in _pick_next_task_rt()
2324 	struct sched_rt_entity *rt_se = &p->rt;  in task_tick_rt()  local
2347 	for_each_sched_rt_entity(rt_se) {  in task_tick_rt()
2348 		if (rt_se->run_list.prev != rt_se->run_list.next) {  in task_tick_rt()