Lines Matching refs:pse
412 is_same_group(struct sched_entity *se, struct sched_entity *pse) in is_same_group() argument
414 if (se->cfs_rq == pse->cfs_rq) in is_same_group()
426 find_matching_se(struct sched_entity **se, struct sched_entity **pse) in find_matching_se() argument
439 pse_depth = (*pse)->depth; in find_matching_se()
448 *pse = parent_entity(*pse); in find_matching_se()
451 while (!is_same_group(*se, *pse)) { in find_matching_se()
453 *pse = parent_entity(*pse); in find_matching_se()
501 find_matching_se(struct sched_entity **se, struct sched_entity **pse) in find_matching_se() argument
1188 struct sched_entity *pse, struct sched_entity *se) in do_preempt_short() argument
1193 if (pse->slice >= se->slice) in do_preempt_short()
1196 if (!entity_eligible(cfs_rq, pse)) in do_preempt_short()
1199 if (entity_before(pse, se)) in do_preempt_short()
8753 struct sched_entity *se = &donor->se, *pse = &p->se; in check_preempt_wakeup_fair() local
8757 if (unlikely(se == pse)) in check_preempt_wakeup_fair()
8766 if (unlikely(throttled_hierarchy(cfs_rq_of(pse)))) in check_preempt_wakeup_fair()
8769 if (sched_feat(NEXT_BUDDY) && !(wake_flags & WF_FORK) && !pse->sched_delayed) { in check_preempt_wakeup_fair()
8770 set_next_buddy(pse); in check_preempt_wakeup_fair()
8789 find_matching_se(&se, &pse); in check_preempt_wakeup_fair()
8790 WARN_ON_ONCE(!pse); in check_preempt_wakeup_fair()
8793 pse_is_idle = se_is_idle(pse); in check_preempt_wakeup_fair()
8826 if (do_preempt_short(cfs_rq, pse, se)) in check_preempt_wakeup_fair()
8832 if (pick_eevdf(cfs_rq) == pse) in check_preempt_wakeup_fair()
8902 struct sched_entity *pse = &prev->se; in pick_next_task_fair() local
8905 while (!(cfs_rq = is_same_group(se, pse))) { in pick_next_task_fair()
8907 int pse_depth = pse->depth; in pick_next_task_fair()
8910 put_prev_entity(cfs_rq_of(pse), pse); in pick_next_task_fair()
8911 pse = parent_entity(pse); in pick_next_task_fair()
8919 put_prev_entity(cfs_rq, pse); in pick_next_task_fair()