Searched refs:runnable (Results 1 – 14 of 14) sorted by relevance
| /linux-4.1.27/arch/x86/xen/ |
| D | time.c | 119 s64 runnable, offline, stolen; in do_stolen_accounting() local
129 runnable = state.time[RUNSTATE_runnable] - snap->time[RUNSTATE_runnable]; in do_stolen_accounting()
136 stolen = runnable + offline + __this_cpu_read(xen_residual_stolen); in do_stolen_accounting()
|
| /linux-4.1.27/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,
288 runnable task for a given CPU, even though there are a number
291 runnable high-priority SCHED_FIFO task and an arbitrary number
298 single runnable SCHED_FIFO task and multiple runnable SCHED_OTHER
301 And even when there are multiple runnable tasks on a given CPU,
|
| /linux-4.1.27/include/linux/ |
| D | torture.h | 78 bool torture_init_begin(char *ttype, bool v, int *runnable);
|
| /linux-4.1.27/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-4.1.27/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-4.1.27/kernel/ |
| D | torture.c | 600 bool torture_init_begin(char *ttype, bool v, int *runnable) in torture_init_begin() argument
611 torture_runnable = runnable; in torture_init_begin()
|
| /linux-4.1.27/Documentation/ |
| D | workqueue.txt | 123 number of the currently runnable workers. Generally, work items are
126 stalling should be optimal. As long as there are one or more runnable
212 concurrency level. In other words, runnable CPU intensive
220 regulated by the concurrency management and runnable
|
| D | kernel-per-CPU-kthreads.txt | 108 for example, ensure that at most one runnable kthread is present
|
| /linux-4.1.27/kernel/sched/ |
| D | fair.c | 2523 int runnable, in __update_entity_runnable_avg() argument
2562 if (runnable) in __update_entity_runnable_avg()
2584 if (runnable) in __update_entity_runnable_avg()
2593 if (runnable) in __update_entity_runnable_avg()
2703 static inline void update_rq_runnable_avg(struct rq *rq, int runnable) in update_rq_runnable_avg() argument
2706 runnable, runnable); in update_rq_runnable_avg()
2715 static inline void update_rq_runnable_avg(struct rq *rq, int runnable) {} in update_rq_runnable_avg() argument
2938 static inline void update_rq_runnable_avg(struct rq *rq, int runnable) {} in update_rq_runnable_avg() argument
|
| /linux-4.1.27/Documentation/filesystems/nfs/ |
| D | knfsd-stats.txt | 99 runnable nfsd threads. The ideal rate of change for this counter
|
| /linux-4.1.27/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-4.1.27/lib/ |
| D | Kconfig.debug | 1248 bool "torture tests for RCU runnable by default"
|
| /linux-4.1.27/Documentation/filesystems/ |
| D | proc.txt | 1307 running or ready to run (i.e., the total number of runnable threads).
|