| /Linux-v5.4/kernel/sched/ |
| D | pelt.c | 111 unsigned long load, unsigned long runnable, int running) in accumulate_sum() argument
139 if (runnable) in accumulate_sum()
140 sa->runnable_load_sum += runnable * contrib; in accumulate_sum()
177 unsigned long load, unsigned long runnable, int running) in ___update_load_sum() argument
211 runnable = running = 0; in ___update_load_sum()
220 if (!accumulate_sum(delta, sa, load, runnable, running)) in ___update_load_sum()
227 ___update_load_avg(struct sched_avg *sa, unsigned long load, unsigned long runnable) in ___update_load_avg() argument
235 sa->runnable_load_avg = div_u64(runnable * sa->runnable_load_sum, divider); in ___update_load_avg()
|
| D | fair.c | 2877 unsigned long weight, unsigned long runnable) in reweight_entity() argument
2888 se->runnable_weight = runnable; in reweight_entity()
3057 long runnable, load_avg; in calc_group_runnable() local
3062 runnable = max(cfs_rq->avg.runnable_load_avg, in calc_group_runnable()
3065 runnable *= shares; in calc_group_runnable()
3067 runnable /= load_avg; in calc_group_runnable()
3069 return clamp_t(long, runnable, MIN_SHARES, shares); in calc_group_runnable()
3082 long shares, runnable; in update_cfs_group() local
3091 runnable = shares = READ_ONCE(gcfs_rq->tg->shares); in update_cfs_group()
3097 runnable = calc_group_runnable(gcfs_rq, shares); in update_cfs_group()
[all …]
|
| /Linux-v5.4/Documentation/timers/ |
| D | no_hz.rst | 24 have only one runnable task (CONFIG_NO_HZ_FULL=y). Unless you
44 will frequently be multiple runnable tasks per CPU. In these cases,
107 If a CPU has only one runnable task, there is little point in sending it
109 Note that omitting scheduling-clock ticks for CPUs with only one runnable
113 sending scheduling-clock interrupts to CPUs with a single runnable task,
266 runnable task for a given CPU, even though there are a number
269 runnable high-priority SCHED_FIFO task and an arbitrary number
276 single runnable SCHED_FIFO task and multiple runnable SCHED_OTHER
279 And even when there are multiple runnable tasks on a given CPU,
|
| /Linux-v5.4/Documentation/scheduler/ |
| D | sched-design-CFS.rst | 44 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
71 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
167 Called when a task enters a runnable state.
173 When a task is no longer runnable, this function is called to keep the
185 This function checks if a task that entered the runnable state should
|
| D | sched-bwc.rst | 14 slices as threads in the cgroup become runnable. Once all quota has been
142 decide which application is chosen to run, as they will both be runnable and
|
| /Linux-v5.4/Documentation/accounting/ |
| D | delay-accounting.rst | 7 runnable task may wait for a free CPU to run on.
12 a) waiting for a CPU (while being runnable)
|
| D | taskstats-struct.rst | 112 /* Delay waiting for cpu, while runnable
|
| /Linux-v5.4/Documentation/virtual/ |
| D | guest-halt-polling.txt | 16 even with other runnable tasks in the host.
|
| /Linux-v5.4/Documentation/virt/kvm/ |
| D | halt-polling.txt | 15 interval or some other task on the runqueue is runnable the scheduler is
134 runnable on that cpu, otherwise the polling will cease immediately and
|
| /Linux-v5.4/Documentation/core-api/ |
| D | workqueue.rst | 118 number of the currently runnable workers. Generally, work items are
121 stalling should be optimal. As long as there are one or more runnable
205 concurrency level. In other words, runnable CPU intensive
213 regulated by the concurrency management and runnable
|
| /Linux-v5.4/Documentation/admin-guide/pm/ |
| D | cpuidle.rst | 90 Tasks can be in various states. In particular, they are *runnable* if there are
93 events to occur or similar). When a task becomes runnable, the CPU scheduler
94 assigns it to one of the available CPUs to run and if there are no more runnable
97 another CPU). [If there are multiple runnable tasks assigned to one CPU
101 The special "idle" task becomes runnable if there are no other runnable tasks
195 multiple runnable tasks assigned to one CPU at the same time, the only way to
218 not be shared between multiple runnable tasks, the primary reason for using the
358 the same CPU when they become runnable again) and the pattern detection code in
|
| /Linux-v5.4/Documentation/s390/ |
| D | vfio-ccw.rst | 244 space, and assemble a runnable kernel channel program by updating the
295 channel program, which becomes runnable for a real device.
|
| /Linux-v5.4/Documentation/admin-guide/ |
| D | kernel-per-CPU-kthreads.rst | 159 for example, ensure that at most one runnable kthread is present
|
| /Linux-v5.4/Documentation/process/ |
| D | license-rules.rst | 356 with this exception. This is required for creating runnable executables
|
| /Linux-v5.4/Documentation/locking/ |
| D | rt-mutex-design.rst | 69 of A. So now if B becomes runnable, it would not preempt C, since C now has
|
| /Linux-v5.4/Documentation/filesystems/ |
| D | proc.txt | 1405 running or ready to run (i.e., the total number of runnable threads).
1996 out. With CPU isolation and a single runnable task this can take
|
