Home
last modified time | relevance | path

Searched refs:task_util (Results 1 – 3 of 3) sorted by relevance

/openbmc/linux/Documentation/translations/zh_CN/scheduler/
H A Dsched-capacity.rst132 task_util(p) = duty_cycle(p)
302 task_util(p) < capacity(task_cpu(p))
309 可以被用在前一条准则中限制task_util()。
318 clamp(task_util(p), task_uclamp_min(p), task_uclamp_max(p)) < capacity(cpu)
358 则任务可能变为CPU受限的,也就是说 ``task_util(p) > capacity(task_cpu(p))`` ;CPU算力
/openbmc/linux/Documentation/scheduler/
H A Dsched-capacity.rst140 task_util(p) = duty_cycle(p)
341 task_util(p) < capacity(task_cpu(p))
350 clamp task_util() in the previous criterion.
360 clamp(task_util(p), task_uclamp_min(p), task_uclamp_max(p)) < capacity(cpu)
404 then it might become CPU-bound, IOW ``task_util(p) > capacity(task_cpu(p))``;
/openbmc/linux/kernel/sched/
H A Dfair.c4832 static inline unsigned long task_util(struct task_struct *p) in task_util() function
4846 return max(task_util(p), _task_util_est(p)); in task_util_est()
4927 ue.enqueued = task_util(p); in util_est_update()
4952 if (task_util(p) > capacity_orig_of(cpu_of(rq_of(cfs_rq)))) in util_est_update()
4963 * ewma(t) = w * task_util(p) + (1-w) * ewma(t-1) in util_est_update()
4964 * = w * task_util(p) + ewma(t-1) - w * ewma(t-1) in util_est_update()
4965 * = w * (task_util(p) - ewma(t-1)) + ewma(t-1) in util_est_update()
7488 unsigned long task_util, util_min, util_max, best_cap = 0; in select_idle_capacity() local
7496 task_util = task_util_est(p); in select_idle_capacity()
7506 fits = util_fits_cpu(task_util, util_mi in select_idle_capacity()
7555 unsigned long task_util, util_min, util_max; select_idle_sibling() local
[all...]