Lines Matching defs:pse
417 is_same_group(struct sched_entity *se, struct sched_entity *pse)
419 if (se->cfs_rq == pse->cfs_rq)
431 find_matching_se(struct sched_entity **se, struct sched_entity **pse)
444 pse_depth = (*pse)->depth;
453 *pse = parent_entity(*pse);
456 while (!is_same_group(*se, *pse)) {
458 *pse = parent_entity(*pse);
506 find_matching_se(struct sched_entity **se, struct sched_entity **pse)
9711 struct sched_entity *pse, struct sched_entity *se)
9714 * Keep existing buddy if the deadline is sooner than pse.
9719 if (cfs_rq->next && entity_before(cfs_rq->next, pse))
9722 set_next_buddy(pse);
9733 struct sched_entity *pse, struct sched_entity *se)
9761 if (entity_before(pse, se) && delta >= threshold)
9774 struct sched_entity *nse, *se = &donor->se, *pse = &p->se;
9784 if (unlikely(se == pse))
9812 find_matching_se(&se, &pse);
9813 WARN_ON_ONCE(!pse);
9816 pse_is_idle = se_is_idle(pse);
9846 if (sched_feat(PREEMPT_SHORT) && (pse->slice < se->slice)) {
9857 if ((wake_flags & WF_FORK) || pse->sched_delayed)
9862 set_preempt_buddy(cfs_rq, wake_flags, pse, se)) {
9870 preempt_action = preempt_sync(rq, wake_flags, pse, se);
9887 if (nse == pse)