Searched refs:runnable (Results 1 – 13 of 13) sorted by relevance
/Linux-v4.19/kernel/sched/ |
D | pelt.c | 110 unsigned long load, unsigned long runnable, int running) in accumulate_sum() argument 143 if (runnable) in accumulate_sum() 144 sa->runnable_load_sum += runnable * contrib; in accumulate_sum() 181 unsigned long load, unsigned long runnable, int running) in ___update_load_sum() argument 215 runnable = running = 0; in ___update_load_sum() 224 if (!accumulate_sum(delta, cpu, sa, load, runnable, running)) in ___update_load_sum() 231 ___update_load_avg(struct sched_avg *sa, unsigned long load, unsigned long runnable) in ___update_load_avg() argument 239 sa->runnable_load_avg = div_u64(runnable * sa->runnable_load_sum, divider); in ___update_load_avg()
|
D | fair.c | 2804 unsigned long weight, unsigned long runnable) in reweight_entity() argument 2815 se->runnable_weight = runnable; in reweight_entity() 2984 long runnable, load_avg; in calc_group_runnable() local 2989 runnable = max(cfs_rq->avg.runnable_load_avg, in calc_group_runnable() 2992 runnable *= shares; in calc_group_runnable() 2994 runnable /= load_avg; in calc_group_runnable() 2996 return clamp_t(long, runnable, MIN_SHARES, shares); in calc_group_runnable() 3009 long shares, runnable; in update_cfs_group() local 3018 runnable = shares = READ_ONCE(gcfs_rq->tg->shares); in update_cfs_group() 3024 runnable = calc_group_runnable(gcfs_rq, shares); in update_cfs_group() [all …]
|
/Linux-v4.19/Documentation/timers/ |
D | NO_HZ.txt | 22 have only one runnable task (CONFIG_NO_HZ_FULL=y). Unless you 41 will frequently be multiple runnable tasks per CPU. In these cases, 102 If a CPU has only one runnable task, there is little point in sending it 104 Note that omitting scheduling-clock ticks for CPUs with only one runnable 108 sending scheduling-clock interrupts to CPUs with a single runnable task, 258 runnable task for a given CPU, even though there are a number 261 runnable high-priority SCHED_FIFO task and an arbitrary number 268 single runnable SCHED_FIFO task and multiple runnable SCHED_OTHER 271 And even when there are multiple runnable tasks on a given CPU,
|
/Linux-v4.19/Documentation/scheduler/ |
D | sched-design-CFS.txt | 42 up CPU time between runnable tasks as close to "ideal multitasking hardware" as 68 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the 161 Called when a task enters a runnable state. 167 When a task is no longer runnable, this function is called to keep the 179 This function checks if a task that entered the runnable state should
|
/Linux-v4.19/Documentation/accounting/ |
D | delay-accounting.txt | 6 runnable task may wait for a free CPU to run on. 11 a) waiting for a CPU (while being runnable)
|
D | taskstats-struct.txt | 100 /* Delay waiting for cpu, while runnable
|
/Linux-v4.19/Documentation/virtual/kvm/ |
D | halt-polling.txt | 15 interval or some other task on the runqueue is runnable the scheduler is 125 runnable on that cpu, otherwise the polling will cease immediately and
|
/Linux-v4.19/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-v4.19/Documentation/s390/ |
D | vfio-ccw.txt | 211 space, and assemble a runnable kernel channel program by updating the 251 channel program, which becomes runnable for a real device.
|
/Linux-v4.19/Documentation/process/ |
D | license-rules.rst | 305 with this exception. This is required for creating runnable executables
|
/Linux-v4.19/Documentation/ |
D | kernel-per-CPU-kthreads.txt | 159 for example, ensure that at most one runnable kthread is present
|
/Linux-v4.19/Documentation/locking/ |
D | rt-mutex-design.txt | 68 of A. So now if B becomes runnable, it would not preempt C, since C now has
|
/Linux-v4.19/Documentation/filesystems/ |
D | proc.txt | 1360 running or ready to run (i.e., the total number of runnable threads).
|