448 is_same_group(struct sched_entity *se, struct sched_entity *pse)  in is_same_group()  argument
450 	if (se->cfs_rq == pse->cfs_rq)  in is_same_group()
462 find_matching_se(struct sched_entity **se, struct sched_entity **pse)  in find_matching_se()  argument
475 	pse_depth = (*pse)->depth;  in find_matching_se()
484 		*pse = parent_entity(*pse);  in find_matching_se()
487 	while (!is_same_group(*se, *pse)) {  in find_matching_se()
489 		*pse = parent_entity(*pse);  in find_matching_se()
537 find_matching_se(struct sched_entity **se, struct sched_entity **pse)  in find_matching_se()  argument
7556 	struct sched_entity *se = &curr->se, *pse = &p->se;  in check_preempt_wakeup()  local
7562 	if (unlikely(se == pse))  in check_preempt_wakeup()
7571 	if (unlikely(throttled_hierarchy(cfs_rq_of(pse))))  in check_preempt_wakeup()
7575 		set_next_buddy(pse);  in check_preempt_wakeup()
7604 	find_matching_se(&se, &pse);  in check_preempt_wakeup()
7605 	WARN_ON_ONCE(!pse);  in check_preempt_wakeup()
7608 	pse_is_idle = se_is_idle(pse);  in check_preempt_wakeup()
7620 	if (wakeup_preempt_entity(se, pse) == 1) {  in check_preempt_wakeup()
7626 			set_next_buddy(pse);  in check_preempt_wakeup()
7750 		struct sched_entity *pse = &prev->se;  in pick_next_task_fair()  local
7752 		while (!(cfs_rq = is_same_group(se, pse))) {  in pick_next_task_fair()
7754 			int pse_depth = pse->depth;  in pick_next_task_fair()
7757 				put_prev_entity(cfs_rq_of(pse), pse);  in pick_next_task_fair()
7758 				pse = parent_entity(pse);  in pick_next_task_fair()
7766 		put_prev_entity(cfs_rq, pse);  in pick_next_task_fair()