Home
last modified time | relevance | path

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

/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算力
/linux/Documentation/scheduler/
H A Dsched-capacity.rst141 task_util(p) = duty_cycle(p)
342 task_util(p) < capacity(task_cpu(p))
351 clamp task_util() in the previous criterion.
361 clamp(task_util(p), task_uclamp_min(p), task_uclamp_max(p)) < capacity(cpu)
405 then it might become CPU-bound, IOW ``task_util(p) > capacity(task_cpu(p))``;
/linux/kernel/sched/
H A Dfair.c5035 static inline unsigned long task_util(struct task_struct *p) in util_fits_cpu()
5052 return max(task_util(p), _task_util_est(p)); in util_fits_cpu()
5116 dequeued = task_util(p); in task_fits_cpu()
5150 * ewma(t) = w * task_util(p) + (1-w) * ewma(t-1) in __setparam_fair()
5151 * = w * task_util(p) + ewma(t-1) - w * ewma(t-1) in __setparam_fair()
5152 * = w * (task_util(p) - ewma(t-1)) + ewma(t-1) in __setparam_fair()
8000 unsigned long task_util, util_min, util_max, best_cap = 0;
8008 task_util = task_util_est(p); in cpu_util()
8018 fits = util_fits_cpu(task_util, util_min, util_max, cpu); in cpu_util()
8067 unsigned long task_util, util_mi in cpu_util()
4848 static inline unsigned long task_util(struct task_struct *p) task_util() function
7773 unsigned long task_util, util_min, util_max, best_cap = 0; select_idle_capacity() local
7840 unsigned long task_util, util_min, util_max; select_idle_sibling() local
[all...]