Lines Matching full:se
296 static inline u64 calc_delta_fair(u64 delta, struct sched_entity *se) in calc_delta_fair() argument
298 if (unlikely(se->load.weight != NICE_0_LOAD)) in calc_delta_fair()
299 delta = __calc_delta(delta, NICE_0_LOAD, &se->load); in calc_delta_fair()
313 #define for_each_sched_entity(se) \ argument
314 for (; se; se = se->parent)
416 is_same_group(struct sched_entity *se, struct sched_entity *pse) in is_same_group() argument
418 if (se->cfs_rq == pse->cfs_rq) in is_same_group()
419 return se->cfs_rq; in is_same_group()
424 static inline struct sched_entity *parent_entity(const struct sched_entity *se) in parent_entity() argument
426 return se->parent; in parent_entity()
430 find_matching_se(struct sched_entity **se, struct sched_entity **pse) in find_matching_se() argument
442 se_depth = (*se)->depth; in find_matching_se()
447 *se = parent_entity(*se); in find_matching_se()
455 while (!is_same_group(*se, *pse)) { in find_matching_se()
456 *se = parent_entity(*se); in find_matching_se()
471 static int se_is_idle(struct sched_entity *se) in se_is_idle() argument
473 if (entity_is_task(se)) in se_is_idle()
474 return task_has_idle_policy(task_of(se)); in se_is_idle()
475 return cfs_rq_is_idle(group_cfs_rq(se)); in se_is_idle()
480 #define for_each_sched_entity(se) \ argument
481 for (; se; se = NULL)
499 static inline struct sched_entity *parent_entity(struct sched_entity *se) in parent_entity() argument
505 find_matching_se(struct sched_entity **se, struct sched_entity **pse) in find_matching_se() argument
519 static int se_is_idle(struct sched_entity *se) in se_is_idle() argument
561 static inline s64 entity_key(struct cfs_rq *cfs_rq, struct sched_entity *se) in entity_key() argument
563 return (s64)(se->vruntime - cfs_rq->min_vruntime); in entity_key()
588 * se->vruntime):
628 avg_vruntime_add(struct cfs_rq *cfs_rq, struct sched_entity *se) in avg_vruntime_add() argument
630 unsigned long weight = scale_load_down(se->load.weight); in avg_vruntime_add()
631 s64 key = entity_key(cfs_rq, se); in avg_vruntime_add()
638 avg_vruntime_sub(struct cfs_rq *cfs_rq, struct sched_entity *se) in avg_vruntime_sub() argument
640 unsigned long weight = scale_load_down(se->load.weight); in avg_vruntime_sub()
641 s64 key = entity_key(cfs_rq, se); in avg_vruntime_sub()
699 static void update_entity_lag(struct cfs_rq *cfs_rq, struct sched_entity *se) in update_entity_lag() argument
703 SCHED_WARN_ON(!se->on_rq); in update_entity_lag()
704 lag = avg_vruntime(cfs_rq) - se->vruntime; in update_entity_lag()
706 limit = calc_delta_fair(max_t(u64, 2*se->slice, TICK_NSEC), se); in update_entity_lag()
707 se->vlag = clamp(lag, -limit, limit); in update_entity_lag()
724 * Note: using 'avg_vruntime() > se->vruntime' is inacurate due
743 int entity_eligible(struct cfs_rq *cfs_rq, struct sched_entity *se) in entity_eligible() argument
745 return vruntime_eligible(cfs_rq, se->vruntime); in entity_eligible()
764 struct sched_entity *se = __pick_root_entity(cfs_rq); in update_min_vruntime() local
775 if (se) { in update_min_vruntime()
777 vruntime = se->min_vruntime; in update_min_vruntime()
779 vruntime = min_vruntime(vruntime, se->min_vruntime); in update_min_vruntime()
794 static inline void __min_vruntime_update(struct sched_entity *se, struct rb_node *node) in __min_vruntime_update() argument
798 if (vruntime_gt(min_vruntime, se, rse)) in __min_vruntime_update()
799 se->min_vruntime = rse->min_vruntime; in __min_vruntime_update()
804 * se->min_vruntime = min(se->vruntime, {left,right}->min_vruntime)
806 static inline bool min_vruntime_update(struct sched_entity *se, bool exit) in min_vruntime_update() argument
808 u64 old_min_vruntime = se->min_vruntime; in min_vruntime_update()
809 struct rb_node *node = &se->run_node; in min_vruntime_update()
811 se->min_vruntime = se->vruntime; in min_vruntime_update()
812 __min_vruntime_update(se, node->rb_right); in min_vruntime_update()
813 __min_vruntime_update(se, node->rb_left); in min_vruntime_update()
815 return se->min_vruntime == old_min_vruntime; in min_vruntime_update()
824 static void __enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) in __enqueue_entity() argument
826 avg_vruntime_add(cfs_rq, se); in __enqueue_entity()
827 se->min_vruntime = se->vruntime; in __enqueue_entity()
828 rb_add_augmented_cached(&se->run_node, &cfs_rq->tasks_timeline, in __enqueue_entity()
832 static void __dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) in __dequeue_entity() argument
834 rb_erase_augmented_cached(&se->run_node, &cfs_rq->tasks_timeline, in __dequeue_entity()
836 avg_vruntime_sub(cfs_rq, se); in __dequeue_entity()
874 * se->min_vruntime = min(se->vruntime, se->{left,right}->min_vruntime)
881 struct sched_entity *se = __pick_first_entity(cfs_rq); in pick_eevdf() local
890 return curr && curr->on_rq ? curr : se; in pick_eevdf()
903 if (se && entity_eligible(cfs_rq, se)) { in pick_eevdf()
904 best = se; in pick_eevdf()
922 se = __node_2_se(node); in pick_eevdf()
929 if (entity_eligible(cfs_rq, se)) { in pick_eevdf()
930 best = se; in pick_eevdf()
972 static void clear_buddies(struct cfs_rq *cfs_rq, struct sched_entity *se);
978 static void update_deadline(struct cfs_rq *cfs_rq, struct sched_entity *se) in update_deadline() argument
980 if ((s64)(se->vruntime - se->deadline) < 0) in update_deadline()
988 se->slice = sysctl_sched_base_slice; in update_deadline()
993 se->deadline = se->vruntime + calc_delta_fair(se->slice, se); in update_deadline()
1000 clear_buddies(cfs_rq, se); in update_deadline()
1012 void init_entity_runnable_average(struct sched_entity *se) in init_entity_runnable_average() argument
1014 struct sched_avg *sa = &se->avg; in init_entity_runnable_average()
1024 if (entity_is_task(se)) in init_entity_runnable_average()
1025 sa->load_avg = scale_load_down(se->load.weight); in init_entity_runnable_average()
1034 * util_avg = cfs_rq->util_avg / (cfs_rq->load_avg + 1) * se.load.weight
1058 struct sched_entity *se = &p->se; in post_init_entity_util_avg() local
1059 struct cfs_rq *cfs_rq = cfs_rq_of(se); in post_init_entity_util_avg()
1060 struct sched_avg *sa = &se->avg; in post_init_entity_util_avg()
1069 attach_entity_load_avg(cfs_rq, se); in post_init_entity_util_avg()
1075 se->avg.last_update_time = cfs_rq_clock_pelt(cfs_rq); in post_init_entity_util_avg()
1081 sa->util_avg = cfs_rq->avg.util_avg * se->load.weight; in post_init_entity_util_avg()
1095 void init_entity_runnable_average(struct sched_entity *se) in init_entity_runnable_average() argument
1146 delta_exec = update_curr_se(rq, &curr->se); in update_curr_common()
1180 update_curr(cfs_rq_of(&rq->curr->se)); in update_curr_fair()
1184 update_stats_wait_start_fair(struct cfs_rq *cfs_rq, struct sched_entity *se) in update_stats_wait_start_fair() argument
1192 stats = __schedstats_from_se(se); in update_stats_wait_start_fair()
1194 if (entity_is_task(se)) in update_stats_wait_start_fair()
1195 p = task_of(se); in update_stats_wait_start_fair()
1201 update_stats_wait_end_fair(struct cfs_rq *cfs_rq, struct sched_entity *se) in update_stats_wait_end_fair() argument
1209 stats = __schedstats_from_se(se); in update_stats_wait_end_fair()
1212 * When the sched_schedstat changes from 0 to 1, some sched se in update_stats_wait_end_fair()
1213 * maybe already in the runqueue, the se->statistics.wait_start in update_stats_wait_end_fair()
1220 if (entity_is_task(se)) in update_stats_wait_end_fair()
1221 p = task_of(se); in update_stats_wait_end_fair()
1227 update_stats_enqueue_sleeper_fair(struct cfs_rq *cfs_rq, struct sched_entity *se) in update_stats_enqueue_sleeper_fair() argument
1235 stats = __schedstats_from_se(se); in update_stats_enqueue_sleeper_fair()
1237 if (entity_is_task(se)) in update_stats_enqueue_sleeper_fair()
1238 tsk = task_of(se); in update_stats_enqueue_sleeper_fair()
1247 update_stats_enqueue_fair(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags) in update_stats_enqueue_fair() argument
1256 if (se != cfs_rq->curr) in update_stats_enqueue_fair()
1257 update_stats_wait_start_fair(cfs_rq, se); in update_stats_enqueue_fair()
1260 update_stats_enqueue_sleeper_fair(cfs_rq, se); in update_stats_enqueue_fair()
1264 update_stats_dequeue_fair(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags) in update_stats_dequeue_fair() argument
1274 if (se != cfs_rq->curr) in update_stats_dequeue_fair()
1275 update_stats_wait_end_fair(cfs_rq, se); in update_stats_dequeue_fair()
1277 if ((flags & DEQUEUE_SLEEP) && entity_is_task(se)) { in update_stats_dequeue_fair()
1278 struct task_struct *tsk = task_of(se); in update_stats_dequeue_fair()
1296 update_stats_curr_start(struct cfs_rq *cfs_rq, struct sched_entity *se) in update_stats_curr_start() argument
1301 se->exec_start = rq_clock_task(rq_of(cfs_rq)); in update_stats_curr_start()
2684 now = p->se.exec_start; in numa_get_avg_runtime()
2685 runtime = p->se.sum_exec_runtime; in numa_get_avg_runtime()
2695 delta = p->se.avg.load_sum; in numa_get_avg_runtime()
3199 u64 runtime = p->se.sum_exec_runtime; in task_numa_work()
3430 if (unlikely(p->se.sum_exec_runtime != runtime)) { in task_numa_work()
3431 u64 diff = p->se.sum_exec_runtime - runtime; in task_numa_work()
3503 now = curr->se.sum_exec_runtime; in task_tick_numa()
3570 account_entity_enqueue(struct cfs_rq *cfs_rq, struct sched_entity *se) in account_entity_enqueue() argument
3572 update_load_add(&cfs_rq->load, se->load.weight); in account_entity_enqueue()
3574 if (entity_is_task(se)) { in account_entity_enqueue()
3577 account_numa_enqueue(rq, task_of(se)); in account_entity_enqueue()
3578 list_add(&se->group_node, &rq->cfs_tasks); in account_entity_enqueue()
3582 if (se_is_idle(se)) in account_entity_enqueue()
3587 account_entity_dequeue(struct cfs_rq *cfs_rq, struct sched_entity *se) in account_entity_dequeue() argument
3589 update_load_sub(&cfs_rq->load, se->load.weight); in account_entity_dequeue()
3591 if (entity_is_task(se)) { in account_entity_dequeue()
3592 account_numa_dequeue(rq_of(cfs_rq), task_of(se)); in account_entity_dequeue()
3593 list_del_init(&se->group_node); in account_entity_dequeue()
3597 if (se_is_idle(se)) in account_entity_dequeue()
3651 enqueue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) in enqueue_load_avg() argument
3653 cfs_rq->avg.load_avg += se->avg.load_avg; in enqueue_load_avg()
3654 cfs_rq->avg.load_sum += se_weight(se) * se->avg.load_sum; in enqueue_load_avg()
3658 dequeue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) in dequeue_load_avg() argument
3660 sub_positive(&cfs_rq->avg.load_avg, se->avg.load_avg); in dequeue_load_avg()
3661 sub_positive(&cfs_rq->avg.load_sum, se_weight(se) * se->avg.load_sum); in dequeue_load_avg()
3668 enqueue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) { } in enqueue_load_avg() argument
3670 dequeue_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) { } in dequeue_load_avg() argument
3673 static void reweight_eevdf(struct cfs_rq *cfs_rq, struct sched_entity *se, in reweight_eevdf() argument
3676 unsigned long old_weight = se->load.weight; in reweight_eevdf()
3757 if (avruntime != se->vruntime) { in reweight_eevdf()
3758 vlag = (s64)(avruntime - se->vruntime); in reweight_eevdf()
3760 se->vruntime = avruntime - vlag; in reweight_eevdf()
3775 vslice = (s64)(se->deadline - avruntime); in reweight_eevdf()
3777 se->deadline = avruntime + vslice; in reweight_eevdf()
3780 static void reweight_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, in reweight_entity() argument
3783 bool curr = cfs_rq->curr == se; in reweight_entity()
3785 if (se->on_rq) { in reweight_entity()
3790 __dequeue_entity(cfs_rq, se); in reweight_entity()
3791 update_load_sub(&cfs_rq->load, se->load.weight); in reweight_entity()
3793 dequeue_load_avg(cfs_rq, se); in reweight_entity()
3795 if (!se->on_rq) { in reweight_entity()
3797 * Because we keep se->vlag = V - v_i, while: lag_i = w_i*(V - v_i), in reweight_entity()
3798 * we need to scale se->vlag when w_i changes. in reweight_entity()
3800 se->vlag = div_s64(se->vlag * se->load.weight, weight); in reweight_entity()
3802 reweight_eevdf(cfs_rq, se, weight); in reweight_entity()
3805 update_load_set(&se->load, weight); in reweight_entity()
3809 u32 divider = get_pelt_divider(&se->avg); in reweight_entity()
3811 se->avg.load_avg = div_u64(se_weight(se) * se->avg.load_sum, divider); in reweight_entity()
3815 enqueue_load_avg(cfs_rq, se); in reweight_entity()
3816 if (se->on_rq) { in reweight_entity()
3817 update_load_add(&cfs_rq->load, se->load.weight); in reweight_entity()
3819 __enqueue_entity(cfs_rq, se); in reweight_entity()
3834 struct sched_entity *se = &p->se; in reweight_task() local
3835 struct cfs_rq *cfs_rq = cfs_rq_of(se); in reweight_task()
3836 struct load_weight *load = &se->load; in reweight_task()
3839 reweight_entity(cfs_rq, se, weight); in reweight_task()
3959 static void update_cfs_group(struct sched_entity *se) in update_cfs_group() argument
3961 struct cfs_rq *gcfs_rq = group_cfs_rq(se); in update_cfs_group()
3975 if (unlikely(se->load.weight != shares)) in update_cfs_group()
3976 reweight_entity(cfs_rq_of(se), se, shares); in update_cfs_group()
3980 static inline void update_cfs_group(struct sched_entity *se) in update_cfs_group() argument
4171 void set_task_rq_fair(struct sched_entity *se, in set_task_rq_fair() argument
4187 if (!(se->avg.last_update_time && prev)) in set_task_rq_fair()
4193 __update_load_avg_blocked_se(p_last_update_time, se); in set_task_rq_fair()
4194 se->avg.last_update_time = n_last_update_time; in set_task_rq_fair()
4265 update_tg_cfs_util(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq) in update_tg_cfs_util() argument
4267 long delta_sum, delta_avg = gcfs_rq->avg.util_avg - se->avg.util_avg; in update_tg_cfs_util()
4275 * cfs_rq->avg.period_contrib can be used for both cfs_rq and se. in update_tg_cfs_util()
4282 se->avg.util_avg = gcfs_rq->avg.util_avg; in update_tg_cfs_util()
4283 new_sum = se->avg.util_avg * divider; in update_tg_cfs_util()
4284 delta_sum = (long)new_sum - (long)se->avg.util_sum; in update_tg_cfs_util()
4285 se->avg.util_sum = new_sum; in update_tg_cfs_util()
4297 update_tg_cfs_runnable(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq) in update_tg_cfs_runnable() argument
4299 long delta_sum, delta_avg = gcfs_rq->avg.runnable_avg - se->avg.runnable_avg; in update_tg_cfs_runnable()
4307 * cfs_rq->avg.period_contrib can be used for both cfs_rq and se. in update_tg_cfs_runnable()
4313 se->avg.runnable_avg = gcfs_rq->avg.runnable_avg; in update_tg_cfs_runnable()
4314 new_sum = se->avg.runnable_avg * divider; in update_tg_cfs_runnable()
4315 delta_sum = (long)new_sum - (long)se->avg.runnable_sum; in update_tg_cfs_runnable()
4316 se->avg.runnable_sum = new_sum; in update_tg_cfs_runnable()
4327 update_tg_cfs_load(struct cfs_rq *cfs_rq, struct sched_entity *se, struct cfs_rq *gcfs_rq) in update_tg_cfs_load() argument
4341 * cfs_rq->avg.period_contrib can be used for both cfs_rq and se. in update_tg_cfs_load()
4351 runnable_sum += se->avg.load_sum; in update_tg_cfs_load()
4363 /* But make sure to not inflate se's runnable */ in update_tg_cfs_load()
4364 runnable_sum = min(se->avg.load_sum, load_sum); in update_tg_cfs_load()
4373 running_sum = se->avg.util_sum >> SCHED_CAPACITY_SHIFT; in update_tg_cfs_load()
4376 load_sum = se_weight(se) * runnable_sum; in update_tg_cfs_load()
4379 delta_avg = load_avg - se->avg.load_avg; in update_tg_cfs_load()
4383 delta_sum = load_sum - (s64)se_weight(se) * se->avg.load_sum; in update_tg_cfs_load()
4385 se->avg.load_sum = runnable_sum; in update_tg_cfs_load()
4386 se->avg.load_avg = load_avg; in update_tg_cfs_load()
4401 static inline int propagate_entity_load_avg(struct sched_entity *se) in propagate_entity_load_avg() argument
4405 if (entity_is_task(se)) in propagate_entity_load_avg()
4408 gcfs_rq = group_cfs_rq(se); in propagate_entity_load_avg()
4414 cfs_rq = cfs_rq_of(se); in propagate_entity_load_avg()
4418 update_tg_cfs_util(cfs_rq, se, gcfs_rq); in propagate_entity_load_avg()
4419 update_tg_cfs_runnable(cfs_rq, se, gcfs_rq); in propagate_entity_load_avg()
4420 update_tg_cfs_load(cfs_rq, se, gcfs_rq); in propagate_entity_load_avg()
4423 trace_pelt_se_tp(se); in propagate_entity_load_avg()
4432 static inline bool skip_blocked_update(struct sched_entity *se) in skip_blocked_update() argument
4434 struct cfs_rq *gcfs_rq = group_cfs_rq(se); in skip_blocked_update()
4440 if (se->avg.load_avg || se->avg.util_avg) in skip_blocked_update()
4464 static inline int propagate_entity_load_avg(struct sched_entity *se) in propagate_entity_load_avg() argument
4474 static inline void migrate_se_pelt_lag(struct sched_entity *se) in migrate_se_pelt_lag() argument
4481 if (load_avg_is_decayed(&se->avg)) in migrate_se_pelt_lag()
4484 cfs_rq = cfs_rq_of(se); in migrate_se_pelt_lag()
4550 __update_load_avg_blocked_se(now, se); in migrate_se_pelt_lag()
4553 static void migrate_se_pelt_lag(struct sched_entity *se) {} in migrate_se_pelt_lag() argument
4599 * Because of rounding, se->util_sum might ends up being +1 more than in update_cfs_rq_load_avg()
4638 * @se: sched_entity to attach
4643 static void attach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) in attach_entity_load_avg() argument
4646 * cfs_rq->avg.period_contrib can be used for both cfs_rq and se. in attach_entity_load_avg()
4652 * When we attach the @se to the @cfs_rq, we must align the decay in attach_entity_load_avg()
4658 se->avg.last_update_time = cfs_rq->avg.last_update_time; in attach_entity_load_avg()
4659 se->avg.period_contrib = cfs_rq->avg.period_contrib; in attach_entity_load_avg()
4667 se->avg.util_sum = se->avg.util_avg * divider; in attach_entity_load_avg()
4669 se->avg.runnable_sum = se->avg.runnable_avg * divider; in attach_entity_load_avg()
4671 se->avg.load_sum = se->avg.load_avg * divider; in attach_entity_load_avg()
4672 if (se_weight(se) < se->avg.load_sum) in attach_entity_load_avg()
4673 se->avg.load_sum = div_u64(se->avg.load_sum, se_weight(se)); in attach_entity_load_avg()
4675 se->avg.load_sum = 1; in attach_entity_load_avg()
4677 enqueue_load_avg(cfs_rq, se); in attach_entity_load_avg()
4678 cfs_rq->avg.util_avg += se->avg.util_avg; in attach_entity_load_avg()
4679 cfs_rq->avg.util_sum += se->avg.util_sum; in attach_entity_load_avg()
4680 cfs_rq->avg.runnable_avg += se->avg.runnable_avg; in attach_entity_load_avg()
4681 cfs_rq->avg.runnable_sum += se->avg.runnable_sum; in attach_entity_load_avg()
4683 add_tg_cfs_propagate(cfs_rq, se->avg.load_sum); in attach_entity_load_avg()
4693 * @se: sched_entity to detach
4698 static void detach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) in detach_entity_load_avg() argument
4700 dequeue_load_avg(cfs_rq, se); in detach_entity_load_avg()
4701 sub_positive(&cfs_rq->avg.util_avg, se->avg.util_avg); in detach_entity_load_avg()
4702 sub_positive(&cfs_rq->avg.util_sum, se->avg.util_sum); in detach_entity_load_avg()
4707 sub_positive(&cfs_rq->avg.runnable_avg, se->avg.runnable_avg); in detach_entity_load_avg()
4708 sub_positive(&cfs_rq->avg.runnable_sum, se->avg.runnable_sum); in detach_entity_load_avg()
4713 add_tg_cfs_propagate(cfs_rq, -se->avg.load_sum); in detach_entity_load_avg()
4729 static inline void update_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags) in update_load_avg() argument
4738 if (se->avg.last_update_time && !(flags & SKIP_AGE_LOAD)) in update_load_avg()
4739 __update_load_avg_se(now, cfs_rq, se); in update_load_avg()
4742 decayed |= propagate_entity_load_avg(se); in update_load_avg()
4744 if (!se->avg.last_update_time && (flags & DO_ATTACH)) { in update_load_avg()
4753 attach_entity_load_avg(cfs_rq, se); in update_load_avg()
4761 detach_entity_load_avg(cfs_rq, se); in update_load_avg()
4775 static void sync_entity_load_avg(struct sched_entity *se) in sync_entity_load_avg() argument
4777 struct cfs_rq *cfs_rq = cfs_rq_of(se); in sync_entity_load_avg()
4781 __update_load_avg_blocked_se(last_update_time, se); in sync_entity_load_avg()
4788 static void remove_entity_load_avg(struct sched_entity *se) in remove_entity_load_avg() argument
4790 struct cfs_rq *cfs_rq = cfs_rq_of(se); in remove_entity_load_avg()
4799 sync_entity_load_avg(se); in remove_entity_load_avg()
4803 cfs_rq->removed.util_avg += se->avg.util_avg; in remove_entity_load_avg()
4804 cfs_rq->removed.load_avg += se->avg.load_avg; in remove_entity_load_avg()
4805 cfs_rq->removed.runnable_avg += se->avg.runnable_avg; in remove_entity_load_avg()
4823 return READ_ONCE(p->se.avg.util_avg); in task_util()
4828 return READ_ONCE(p->se.avg.runnable_avg); in task_runnable()
4833 return READ_ONCE(p->se.avg.util_est) & ~UTIL_AVG_UNCHANGED; in _task_util_est()
4892 ewma = READ_ONCE(p->se.avg.util_est); in util_est_update()
4957 WRITE_ONCE(p->se.avg.util_est, ewma); in util_est_update()
4959 trace_sched_util_est_se_tp(&p->se); in util_est_update()
5127 static inline void update_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se, int not_used1) in update_load_avg() argument
5132 static inline void remove_entity_load_avg(struct sched_entity *se) {} in remove_entity_load_avg() argument
5135 attach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) {} in attach_entity_load_avg() argument
5137 detach_entity_load_avg(struct cfs_rq *cfs_rq, struct sched_entity *se) {} in detach_entity_load_avg() argument
5158 place_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags) in place_entity() argument
5163 se->slice = sysctl_sched_base_slice; in place_entity()
5164 vslice = calc_delta_fair(se->slice, se); in place_entity()
5178 lag = se->vlag; in place_entity()
5236 lag *= load + scale_load_down(se->load.weight); in place_entity()
5242 se->vruntime = vruntime - lag; in place_entity()
5255 se->deadline = se->vruntime + vslice; in place_entity()
5264 enqueue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags) in enqueue_entity() argument
5266 bool curr = cfs_rq->curr == se; in enqueue_entity()
5273 place_entity(cfs_rq, se, flags); in enqueue_entity()
5286 update_load_avg(cfs_rq, se, UPDATE_TG | DO_ATTACH); in enqueue_entity()
5287 se_update_runnable(se); in enqueue_entity()
5293 update_cfs_group(se); in enqueue_entity()
5300 place_entity(cfs_rq, se, flags); in enqueue_entity()
5302 account_entity_enqueue(cfs_rq, se); in enqueue_entity()
5306 se->exec_start = 0; in enqueue_entity()
5309 update_stats_enqueue_fair(cfs_rq, se, flags); in enqueue_entity()
5311 __enqueue_entity(cfs_rq, se); in enqueue_entity()
5312 se->on_rq = 1; in enqueue_entity()
5331 static void __clear_buddies_next(struct sched_entity *se) in __clear_buddies_next() argument
5333 for_each_sched_entity(se) { in __clear_buddies_next()
5334 struct cfs_rq *cfs_rq = cfs_rq_of(se); in __clear_buddies_next()
5335 if (cfs_rq->next != se) in __clear_buddies_next()
5342 static void clear_buddies(struct cfs_rq *cfs_rq, struct sched_entity *se) in clear_buddies() argument
5344 if (cfs_rq->next == se) in clear_buddies()
5345 __clear_buddies_next(se); in clear_buddies()
5351 dequeue_entity(struct cfs_rq *cfs_rq, struct sched_entity *se, int flags) in dequeue_entity() argument
5355 if (entity_is_task(se) && task_on_rq_migrating(task_of(se))) in dequeue_entity()
5372 update_load_avg(cfs_rq, se, action); in dequeue_entity()
5373 se_update_runnable(se); in dequeue_entity()
5375 update_stats_dequeue_fair(cfs_rq, se, flags); in dequeue_entity()
5377 clear_buddies(cfs_rq, se); in dequeue_entity()
5379 update_entity_lag(cfs_rq, se); in dequeue_entity()
5380 if (se != cfs_rq->curr) in dequeue_entity()
5381 __dequeue_entity(cfs_rq, se); in dequeue_entity()
5382 se->on_rq = 0; in dequeue_entity()
5383 account_entity_dequeue(cfs_rq, se); in dequeue_entity()
5388 update_cfs_group(se); in dequeue_entity()
5391 * Now advance min_vruntime if @se was the entity holding it back, in dequeue_entity()
5404 set_next_entity(struct cfs_rq *cfs_rq, struct sched_entity *se) in set_next_entity() argument
5406 clear_buddies(cfs_rq, se); in set_next_entity()
5409 if (se->on_rq) { in set_next_entity()
5415 update_stats_wait_end_fair(cfs_rq, se); in set_next_entity()
5416 __dequeue_entity(cfs_rq, se); in set_next_entity()
5417 update_load_avg(cfs_rq, se, UPDATE_TG); in set_next_entity()
5422 se->vlag = se->deadline; in set_next_entity()
5425 update_stats_curr_start(cfs_rq, se); in set_next_entity()
5426 cfs_rq->curr = se; in set_next_entity()
5434 rq_of(cfs_rq)->cfs.load.weight >= 2*se->load.weight) { in set_next_entity()
5437 stats = __schedstats_from_se(se); in set_next_entity()
5440 se->sum_exec_runtime - se->prev_sum_exec_runtime)); in set_next_entity()
5443 se->prev_sum_exec_runtime = se->sum_exec_runtime; in set_next_entity()
5748 struct sched_entity *se; in throttle_cfs_rq() local
5772 se = cfs_rq->tg->se[cpu_of(rq_of(cfs_rq))]; in throttle_cfs_rq()
5781 for_each_sched_entity(se) { in throttle_cfs_rq()
5782 struct cfs_rq *qcfs_rq = cfs_rq_of(se); in throttle_cfs_rq()
5784 if (!se->on_rq) in throttle_cfs_rq()
5787 dequeue_entity(qcfs_rq, se, DEQUEUE_SLEEP); in throttle_cfs_rq()
5789 if (cfs_rq_is_idle(group_cfs_rq(se))) in throttle_cfs_rq()
5797 se = parent_entity(se); in throttle_cfs_rq()
5802 for_each_sched_entity(se) { in throttle_cfs_rq()
5803 struct cfs_rq *qcfs_rq = cfs_rq_of(se); in throttle_cfs_rq()
5805 if (!se->on_rq) in throttle_cfs_rq()
5808 update_load_avg(qcfs_rq, se, 0); in throttle_cfs_rq()
5809 se_update_runnable(se); in throttle_cfs_rq()
5811 if (cfs_rq_is_idle(group_cfs_rq(se))) in throttle_cfs_rq()
5818 /* At this point se is NULL and we are at root level*/ in throttle_cfs_rq()
5837 struct sched_entity *se; in unthrottle_cfs_rq() local
5840 se = cfs_rq->tg->se[cpu_of(rq)]; in unthrottle_cfs_rq()
5864 for_each_sched_entity(se) { in unthrottle_cfs_rq()
5865 if (list_add_leaf_cfs_rq(cfs_rq_of(se))) in unthrottle_cfs_rq()
5873 for_each_sched_entity(se) { in unthrottle_cfs_rq()
5874 struct cfs_rq *qcfs_rq = cfs_rq_of(se); in unthrottle_cfs_rq()
5876 if (se->on_rq) in unthrottle_cfs_rq()
5878 enqueue_entity(qcfs_rq, se, ENQUEUE_WAKEUP); in unthrottle_cfs_rq()
5880 if (cfs_rq_is_idle(group_cfs_rq(se))) in unthrottle_cfs_rq()
5891 for_each_sched_entity(se) { in unthrottle_cfs_rq()
5892 struct cfs_rq *qcfs_rq = cfs_rq_of(se); in unthrottle_cfs_rq()
5894 update_load_avg(qcfs_rq, se, UPDATE_TG); in unthrottle_cfs_rq()
5895 se_update_runnable(se); in unthrottle_cfs_rq()
5897 if (cfs_rq_is_idle(group_cfs_rq(se))) in unthrottle_cfs_rq()
5908 /* At this point se is NULL and we are at root level*/ in unthrottle_cfs_rq()
6620 struct sched_entity *se = &p->se; in hrtick_start_fair() local
6625 u64 ran = se->sum_exec_runtime - se->prev_sum_exec_runtime; in hrtick_start_fair()
6626 u64 slice = se->slice; in hrtick_start_fair()
6707 struct sched_entity *se = &p->se; in enqueue_task_fair() local
6727 for_each_sched_entity(se) { in enqueue_task_fair()
6728 if (se->on_rq) in enqueue_task_fair()
6730 cfs_rq = cfs_rq_of(se); in enqueue_task_fair()
6731 enqueue_entity(cfs_rq, se, flags); in enqueue_task_fair()
6746 for_each_sched_entity(se) { in enqueue_task_fair()
6747 cfs_rq = cfs_rq_of(se); in enqueue_task_fair()
6749 update_load_avg(cfs_rq, se, UPDATE_TG); in enqueue_task_fair()
6750 se_update_runnable(se); in enqueue_task_fair()
6751 update_cfs_group(se); in enqueue_task_fair()
6764 /* At this point se is NULL and we are at root level*/ in enqueue_task_fair()
6790 static void set_next_buddy(struct sched_entity *se);
6800 struct sched_entity *se = &p->se; in dequeue_task_fair() local
6807 for_each_sched_entity(se) { in dequeue_task_fair()
6808 cfs_rq = cfs_rq_of(se); in dequeue_task_fair()
6809 dequeue_entity(cfs_rq, se, flags); in dequeue_task_fair()
6824 se = parent_entity(se); in dequeue_task_fair()
6829 if (task_sleep && se && !throttled_hierarchy(cfs_rq)) in dequeue_task_fair()
6830 set_next_buddy(se); in dequeue_task_fair()
6836 for_each_sched_entity(se) { in dequeue_task_fair()
6837 cfs_rq = cfs_rq_of(se); in dequeue_task_fair()
6839 update_load_avg(cfs_rq, se, UPDATE_TG); in dequeue_task_fair()
6840 se_update_runnable(se); in dequeue_task_fair()
6841 update_cfs_group(se); in dequeue_task_fair()
6855 /* At this point se is NULL and we are at root level*/ in dequeue_task_fair()
6911 if (cpu_of(rq) != task_cpu(p) || !READ_ONCE(p->se.avg.last_update_time)) in cpu_load_without()
6934 if (cpu_of(rq) != task_cpu(p) || !READ_ONCE(p->se.avg.last_update_time)) in cpu_runnable_without()
6941 lsub_positive(&runnable, p->se.avg.runnable_avg); in cpu_runnable_without()
7176 sync_entity_load_avg(&p->se); in find_idlest_cpu()
7503 sync_entity_load_avg(&p->se); in select_idle_sibling()
7750 if (cpu != task_cpu(p) || !READ_ONCE(p->se.avg.last_update_time)) in cpu_util_without()
7972 sync_entity_load_avg(&p->se); in find_energy_efficient_cpu()
8215 struct sched_entity *se = &p->se; in migrate_task_rq_fair() local
8218 remove_entity_load_avg(se); in migrate_task_rq_fair()
8230 migrate_se_pelt_lag(se); in migrate_task_rq_fair()
8234 se->avg.last_update_time = 0; in migrate_task_rq_fair()
8241 remove_entity_load_avg(&p->se); in task_dead_fair()
8254 static void set_next_buddy(struct sched_entity *se) in set_next_buddy() argument
8256 for_each_sched_entity(se) { in set_next_buddy()
8257 if (SCHED_WARN_ON(!se->on_rq)) in set_next_buddy()
8259 if (se_is_idle(se)) in set_next_buddy()
8261 cfs_rq_of(se)->next = se; in set_next_buddy()
8271 struct sched_entity *se = &curr->se, *pse = &p->se; in check_preempt_wakeup_fair() local
8275 if (unlikely(se == pse)) in check_preempt_wakeup_fair()
8316 find_matching_se(&se, &pse); in check_preempt_wakeup_fair()
8319 cse_is_idle = se_is_idle(se); in check_preempt_wakeup_fair()
8331 cfs_rq = cfs_rq_of(se); in check_preempt_wakeup_fair()
8335 * XXX pick_eevdf(cfs_rq) != se ? in check_preempt_wakeup_fair()
8349 struct sched_entity *se; in pick_task_fair() local
8371 se = pick_next_entity(cfs_rq); in pick_task_fair()
8372 cfs_rq = group_cfs_rq(se); in pick_task_fair()
8375 return task_of(se); in pick_task_fair()
8383 struct sched_entity *se; in pick_next_task_fair() local
8434 se = pick_next_entity(cfs_rq); in pick_next_task_fair()
8435 cfs_rq = group_cfs_rq(se); in pick_next_task_fair()
8438 p = task_of(se); in pick_next_task_fair()
8446 struct sched_entity *pse = &prev->se; in pick_next_task_fair()
8448 while (!(cfs_rq = is_same_group(se, pse))) { in pick_next_task_fair()
8449 int se_depth = se->depth; in pick_next_task_fair()
8457 set_next_entity(cfs_rq_of(se), se); in pick_next_task_fair()
8458 se = parent_entity(se); in pick_next_task_fair()
8463 set_next_entity(cfs_rq, se); in pick_next_task_fair()
8473 se = pick_next_entity(cfs_rq); in pick_next_task_fair()
8474 set_next_entity(cfs_rq, se); in pick_next_task_fair()
8475 cfs_rq = group_cfs_rq(se); in pick_next_task_fair()
8478 p = task_of(se); in pick_next_task_fair()
8487 list_move(&p->se.group_node, &rq->cfs_tasks); in pick_next_task_fair()
8534 struct sched_entity *se = &prev->se; in put_prev_task_fair() local
8537 for_each_sched_entity(se) { in put_prev_task_fair()
8538 cfs_rq = cfs_rq_of(se); in put_prev_task_fair()
8539 put_prev_entity(cfs_rq, se); in put_prev_task_fair()
8550 struct sched_entity *se = &curr->se; in yield_task_fair() local
8558 clear_buddies(cfs_rq, se); in yield_task_fair()
8572 se->deadline += calc_delta_fair(se->slice, se); in yield_task_fair()
8577 struct sched_entity *se = &p->se; in yield_to_task_fair() local
8580 if (!se->on_rq || throttled_hierarchy(cfs_rq_of(se))) in yield_to_task_fair()
8584 set_next_buddy(se); in yield_to_task_fair()
8820 (&p->se == cfs_rq_of(&p->se)->next)) in task_hot()
8836 delta = rq_clock_task(env->src_rq) - p->se.exec_start; in task_hot()
9017 &env->src_rq->cfs_tasks, se.group_node) { in detach_one_task()
9086 p = list_last_entry(tasks, struct task_struct, se.group_node); in detach_tasks()
9141 list_add(&p->se.group_node, &env->tasks); in detach_tasks()
9164 list_move(&p->se.group_node, tasks); in detach_tasks()
9217 p = list_first_entry(tasks, struct task_struct, se.group_node); in attach_tasks()
9218 list_del_init(&p->se.group_node); in attach_tasks()
9313 struct sched_entity *se; in __update_blocked_fair() local
9326 se = cfs_rq->tg->se[cpu]; in __update_blocked_fair()
9327 if (se && !skip_blocked_update(se)) in __update_blocked_fair()
9328 update_load_avg(cfs_rq_of(se), se, UPDATE_TG); in __update_blocked_fair()
9353 struct sched_entity *se = cfs_rq->tg->se[cpu_of(rq)]; in update_cfs_rq_h_load() local
9361 for_each_sched_entity(se) { in update_cfs_rq_h_load()
9362 cfs_rq = cfs_rq_of(se); in update_cfs_rq_h_load()
9363 WRITE_ONCE(cfs_rq->h_load_next, se); in update_cfs_rq_h_load()
9368 if (!se) { in update_cfs_rq_h_load()
9373 while ((se = READ_ONCE(cfs_rq->h_load_next)) != NULL) { in update_cfs_rq_h_load()
9375 load = div64_ul(load * se->avg.load_avg, in update_cfs_rq_h_load()
9377 cfs_rq = group_cfs_rq(se); in update_cfs_rq_h_load()
9388 return div64_ul(p->se.avg.load_avg * cfs_rq->h_load, in task_h_load()
9406 return p->se.avg.load_avg; in task_h_load()
10156 if (cpu != task_cpu(p) || !READ_ONCE(p->se.avg.last_update_time)) in task_running_on_cpu()
12483 __entity_slice_used(struct sched_entity *se, int min_nr_tasks) in __entity_slice_used() argument
12485 u64 rtime = se->sum_exec_runtime - se->prev_sum_exec_runtime; in __entity_slice_used()
12486 u64 slice = se->slice; in __entity_slice_used()
12512 __entity_slice_used(&curr->se, MIN_NR_TASKS_DURING_FORCEIDLE)) in task_tick_core()
12519 static void se_fi_update(const struct sched_entity *se, unsigned int fi_seq, in se_fi_update() argument
12522 for_each_sched_entity(se) { in se_fi_update()
12523 struct cfs_rq *cfs_rq = cfs_rq_of(se); in se_fi_update()
12537 struct sched_entity *se = &p->se; in task_vruntime_update() local
12542 se_fi_update(se, rq->core->core_forceidle_seq, in_fi); in task_vruntime_update()
12549 const struct sched_entity *sea = &a->se; in cfs_prio_less()
12550 const struct sched_entity *seb = &b->se; in cfs_prio_less()
12559 * Find an se in the hierarchy for tasks a and b, such that the se's in cfs_prio_less()
12583 * Find delta after normalizing se's vruntime with its cfs_rq's in cfs_prio_less()
12619 struct sched_entity *se = &curr->se; in task_tick_fair() local
12621 for_each_sched_entity(se) { in task_tick_fair()
12622 cfs_rq = cfs_rq_of(se); in task_tick_fair()
12623 entity_tick(cfs_rq, se, queued); in task_tick_fair()
12642 struct sched_entity *se = &p->se, *curr; in task_fork_fair() local
12654 place_entity(cfs_rq, se, ENQUEUE_INITIAL); in task_fork_fair()
12688 static void propagate_entity_cfs_rq(struct sched_entity *se) in propagate_entity_cfs_rq() argument
12690 struct cfs_rq *cfs_rq = cfs_rq_of(se); in propagate_entity_cfs_rq()
12699 se = se->parent; in propagate_entity_cfs_rq()
12701 for_each_sched_entity(se) { in propagate_entity_cfs_rq()
12702 cfs_rq = cfs_rq_of(se); in propagate_entity_cfs_rq()
12704 update_load_avg(cfs_rq, se, UPDATE_TG); in propagate_entity_cfs_rq()
12714 static void propagate_entity_cfs_rq(struct sched_entity *se) { } in propagate_entity_cfs_rq() argument
12717 static void detach_entity_cfs_rq(struct sched_entity *se) in detach_entity_cfs_rq() argument
12719 struct cfs_rq *cfs_rq = cfs_rq_of(se); in detach_entity_cfs_rq()
12728 if (!se->avg.last_update_time) in detach_entity_cfs_rq()
12733 update_load_avg(cfs_rq, se, 0); in detach_entity_cfs_rq()
12734 detach_entity_load_avg(cfs_rq, se); in detach_entity_cfs_rq()
12736 propagate_entity_cfs_rq(se); in detach_entity_cfs_rq()
12739 static void attach_entity_cfs_rq(struct sched_entity *se) in attach_entity_cfs_rq() argument
12741 struct cfs_rq *cfs_rq = cfs_rq_of(se); in attach_entity_cfs_rq()
12744 update_load_avg(cfs_rq, se, sched_feat(ATTACH_AGE_LOAD) ? 0 : SKIP_AGE_LOAD); in attach_entity_cfs_rq()
12745 attach_entity_load_avg(cfs_rq, se); in attach_entity_cfs_rq()
12747 propagate_entity_cfs_rq(se); in attach_entity_cfs_rq()
12752 struct sched_entity *se = &p->se; in detach_task_cfs_rq() local
12754 detach_entity_cfs_rq(se); in detach_task_cfs_rq()
12759 struct sched_entity *se = &p->se; in attach_task_cfs_rq() local
12761 attach_entity_cfs_rq(se); in attach_task_cfs_rq()
12793 struct sched_entity *se = &p->se; in set_next_task_fair() local
12801 list_move(&se->group_node, &rq->cfs_tasks); in set_next_task_fair()
12805 for_each_sched_entity(se) { in set_next_task_fair()
12806 struct cfs_rq *cfs_rq = cfs_rq_of(se); in set_next_task_fair()
12808 set_next_entity(cfs_rq, se); in set_next_task_fair()
12836 /* Tell se's cfs_rq has been changed -- migrated */ in task_change_group_fair()
12837 p->se.avg.last_update_time = 0; in task_change_group_fair()
12850 if (tg->se) in free_fair_sched_group()
12851 kfree(tg->se[i]); in free_fair_sched_group()
12855 kfree(tg->se); in free_fair_sched_group()
12860 struct sched_entity *se; in alloc_fair_sched_group() local
12867 tg->se = kcalloc(nr_cpu_ids, sizeof(se), GFP_KERNEL); in alloc_fair_sched_group()
12868 if (!tg->se) in alloc_fair_sched_group()
12881 se = kzalloc_node(sizeof(struct sched_entity_stats), in alloc_fair_sched_group()
12883 if (!se) in alloc_fair_sched_group()
12887 init_tg_cfs_entry(tg, cfs_rq, se, i, parent->se[i]); in alloc_fair_sched_group()
12888 init_entity_runnable_average(se); in alloc_fair_sched_group()
12901 struct sched_entity *se; in online_fair_sched_group() local
12908 se = tg->se[i]; in online_fair_sched_group()
12911 attach_entity_cfs_rq(se); in online_fair_sched_group()
12926 if (tg->se[cpu]) in unregister_fair_sched_group()
12927 remove_entity_load_avg(tg->se[cpu]); in unregister_fair_sched_group()
12945 struct sched_entity *se, int cpu, in init_tg_cfs_entry() argument
12955 tg->se[cpu] = se; in init_tg_cfs_entry()
12957 /* se could be NULL for root_task_group */ in init_tg_cfs_entry()
12958 if (!se) in init_tg_cfs_entry()
12962 se->cfs_rq = &rq->cfs; in init_tg_cfs_entry()
12963 se->depth = 0; in init_tg_cfs_entry()
12965 se->cfs_rq = parent->my_q; in init_tg_cfs_entry()
12966 se->depth = parent->depth + 1; in init_tg_cfs_entry()
12969 se->my_q = cfs_rq; in init_tg_cfs_entry()
12971 update_load_set(&se->load, NICE_0_LOAD); in init_tg_cfs_entry()
12972 se->parent = parent; in init_tg_cfs_entry()
12986 if (!tg->se[0]) in __sched_group_set_shares()
12997 struct sched_entity *se = tg->se[i]; in __sched_group_set_shares() local
13003 for_each_sched_entity(se) { in __sched_group_set_shares()
13004 update_load_avg(cfs_rq_of(se), se, UPDATE_TG); in __sched_group_set_shares()
13005 update_cfs_group(se); in __sched_group_set_shares()
13048 struct sched_entity *se = tg->se[i]; in sched_group_set_idle() local
13060 if (se->on_rq) { in sched_group_set_idle()
13061 parent_cfs_rq = cfs_rq_of(se); in sched_group_set_idle()
13073 for_each_sched_entity(se) { in sched_group_set_idle()
13074 struct cfs_rq *cfs_rq = cfs_rq_of(se); in sched_group_set_idle()
13076 if (!se->on_rq) in sched_group_set_idle()
13105 struct sched_entity *se = &task->se; in get_rr_interval_fair() local
13113 rr_interval = NS_TO_JIFFIES(se->slice); in get_rr_interval_fair()