431 is_same_group(struct sched_entity *se, struct sched_entity *pse)  in is_same_group()  argument
433 	if (se->cfs_rq == pse->cfs_rq)  in is_same_group()
445 find_matching_se(struct sched_entity **se, struct sched_entity **pse)  in find_matching_se()  argument
458 	pse_depth = (*pse)->depth;  in find_matching_se()
467 		*pse = parent_entity(*pse);  in find_matching_se()
470 	while (!is_same_group(*se, *pse)) {  in find_matching_se()
472 		*pse = parent_entity(*pse);  in find_matching_se()
520 find_matching_se(struct sched_entity **se, struct sched_entity **pse)  in find_matching_se()  argument
8289 	struct sched_entity *se = &curr->se, *pse = &p->se;  in check_preempt_wakeup_fair()  local
8294 	if (unlikely(se == pse))  in check_preempt_wakeup_fair()
8303 	if (unlikely(throttled_hierarchy(cfs_rq_of(pse))))  in check_preempt_wakeup_fair()
8307 		set_next_buddy(pse);  in check_preempt_wakeup_fair()
8327 	find_matching_se(&se, &pse);  in check_preempt_wakeup_fair()
8328 	WARN_ON_ONCE(!pse);  in check_preempt_wakeup_fair()
8331 	pse_is_idle = se_is_idle(pse);  in check_preempt_wakeup_fair()
8353 	if (pick_eevdf(cfs_rq) == pse)  in check_preempt_wakeup_fair()
8462 		struct sched_entity *pse = &prev->se;  in pick_next_task_fair()  local
8464 		while (!(cfs_rq = is_same_group(se, pse))) {  in pick_next_task_fair()
8466 			int pse_depth = pse->depth;  in pick_next_task_fair()
8469 				put_prev_entity(cfs_rq_of(pse), pse);  in pick_next_task_fair()
8470 				pse = parent_entity(pse);  in pick_next_task_fair()
8478 		put_prev_entity(cfs_rq, pse);  in pick_next_task_fair()