Lines Matching refs:pse
322 is_same_group(struct sched_entity *se, struct sched_entity *pse) in is_same_group() argument
324 if (se->cfs_rq == pse->cfs_rq) in is_same_group()
336 find_matching_se(struct sched_entity **se, struct sched_entity **pse) in find_matching_se() argument
349 pse_depth = (*pse)->depth; in find_matching_se()
358 *pse = parent_entity(*pse); in find_matching_se()
361 while (!is_same_group(*se, *pse)) { in find_matching_se()
363 *pse = parent_entity(*pse); in find_matching_se()
420 find_matching_se(struct sched_entity **se, struct sched_entity **pse) in find_matching_se() argument
5117 struct sched_entity *se = &curr->se, *pse = &p->se; in check_preempt_wakeup() local
5122 if (unlikely(se == pse)) in check_preempt_wakeup()
5131 if (unlikely(throttled_hierarchy(cfs_rq_of(pse)))) in check_preempt_wakeup()
5135 set_next_buddy(pse); in check_preempt_wakeup()
5164 find_matching_se(&se, &pse); in check_preempt_wakeup()
5166 BUG_ON(!pse); in check_preempt_wakeup()
5167 if (wakeup_preempt_entity(se, pse) == 1) { in check_preempt_wakeup()
5173 set_next_buddy(pse); in check_preempt_wakeup()
5258 struct sched_entity *pse = &prev->se; in pick_next_task_fair() local
5260 while (!(cfs_rq = is_same_group(se, pse))) { in pick_next_task_fair()
5262 int pse_depth = pse->depth; in pick_next_task_fair()
5265 put_prev_entity(cfs_rq_of(pse), pse); in pick_next_task_fair()
5266 pse = parent_entity(pse); in pick_next_task_fair()
5274 put_prev_entity(cfs_rq, pse); in pick_next_task_fair()