| /linux-6.15/kernel/sched/ |
| H A D | pelt.c | 103 unsigned long load, unsigned long runnable, int running) in accumulate_sum() argument
143 if (runnable) in accumulate_sum()
144 sa->runnable_sum += runnable * contrib << SCHED_CAPACITY_SHIFT; in accumulate_sum()
181 unsigned long load, unsigned long runnable, int running) in ___update_load_sum() argument
217 runnable = running = 0; in ___update_load_sum()
226 if (!accumulate_sum(delta, sa, load, runnable, running)) in ___update_load_sum()
|
| /linux-6.15/tools/sched_ext/ |
| H A D | scx_flatcg.bpf.c | 416 static void update_active_weight_sums(struct cgroup *cgrp, bool runnable) in update_active_weight_sums() argument
433 if (runnable) { in update_active_weight_sums()
450 if (!runnable) in update_active_weight_sums()
476 if (runnable) { in update_active_weight_sums()
503 if (runnable) in update_active_weight_sums()
539 void BPF_STRUCT_OPS(fcg_stopping, struct task_struct *p, bool runnable) in BPF_STRUCT_OPS() argument
942 .runnable = (void *)fcg_runnable,
|
| H A D | scx_simple.bpf.c | 110 void BPF_STRUCT_OPS(simple_stopping, struct task_struct *p, bool runnable) in BPF_STRUCT_OPS() argument
|
| H A D | scx_central.bpf.c | 246 void BPF_STRUCT_OPS(central_stopping, struct task_struct *p, bool runnable) in BPF_STRUCT_OPS() argument
|
| /linux-6.15/Documentation/scheduler/ |
| H A D | schedutil.rst | 35 Using this we track 2 key metrics: 'running' and 'runnable'. 'Running'
36 reflects the time an entity spends on the CPU, while 'runnable' reflects the
40 while 'runnable' will increase to reflect the amount of contention.
83 The result is that the above 'running' and 'runnable' metrics become invariant
104 A further runqueue wide sum (of runnable tasks) is maintained of:
|
| H A D | sched-ext.rst | 18 a runnable task stalls, or on invoking the SysRq key sequence
63 detection of any internal error including stalled runnable tasks aborts the
209 from the global DSQ. If that doesn't yield a runnable task either,
278 * If the previous task is an SCX task and still runnable, keep executing
311 ops.runnable(); /* Task becomes ready to run */
313 while (task is runnable) {
|
| H A D | sched-design-CFS.rst | 48 up CPU time between runnable tasks as close to "ideal multitasking hardware" as
75 CFS maintains a time-ordered rbtree, where all runnable tasks are sorted by the
174 Called when a task enters a runnable state.
180 When a task is no longer runnable, this function is called to keep the
192 This function checks if a task that entered the runnable state should
|
| H A D | sched-eevdf.rst | 14 runnable tasks with the same priority. To do so, it assigns a virtual run
|
| H A D | sched-bwc.rst | 15 slices as threads in the cgroup become runnable. Once all quota has been
202 decide which application is chosen to run, as they will both be runnable and
|
| /linux-6.15/tools/testing/selftests/sched_ext/ |
| H A D | maximal.bpf.c | 42 void BPF_STRUCT_OPS(maximal_stopping, struct task_struct *p, bool runnable) in BPF_STRUCT_OPS() argument
140 .runnable = (void *) maximal_runnable,
|
| H A D | select_cpu_vtime.bpf.c | 67 bool runnable) in BPF_STRUCT_OPS() argument
|
| /linux-6.15/Documentation/timers/ |
| H A 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,
257 runnable task for a given CPU, even though there are a number
260 runnable high-priority SCHED_FIFO task and an arbitrary number
267 single runnable SCHED_FIFO task and multiple runnable SCHED_OTHER
270 And even when there are multiple runnable tasks on a given CPU,
|
| /linux-6.15/fs/bcachefs/ |
| H A D | alloc_types.h | 93 x(runnable) \
|
| /linux-6.15/drivers/gpu/drm/panthor/ |
| H A D | panthor_sched.c | 238 struct list_head runnable[PANTHOR_CSG_PRIORITY_COUNT]; member
2134 &sched->groups.runnable[group->priority]); in tick_ctx_cleanup()
2154 &sched->groups.runnable[group->priority]); in tick_ctx_cleanup()
2308 list_move_tail(&group->run_node, &sched->groups.runnable[prio]); in tick_ctx_apply()
2338 if (!list_empty(&sched->groups.runnable[ctx->min_priority])) { in tick_ctx_update_resched_target()
2393 &sched->groups.runnable[prio], in tick_work()
2515 &sched->groups.runnable[group->priority]); in sync_upd_work()
2634 &sched->groups.runnable[group->priority]); in panthor_group_start()
2810 for (i = 0; i < ARRAY_SIZE(sched->groups.runnable); i++) { in panthor_sched_pre_reset()
3854 drm_WARN_ON(ddev, !list_empty(&sched->groups.runnable[prio])); in panthor_sched_fini()
[all …]
|
| /linux-6.15/Documentation/tools/rv/ |
| H A D | rv-mon-sched.rst | 52 * snroc: set non runnable on its own context
|
| /linux-6.15/Documentation/accounting/ |
| H A 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)
|
| H A D | taskstats-struct.rst | 112 /* Delay waiting for cpu, while runnable
|
| /linux-6.15/Documentation/virt/ |
| H A D | guest-halt-polling.rst | 18 even with other runnable tasks in the host.
|
| /linux-6.15/Documentation/virt/kvm/ |
| H A D | halt-polling.rst | 18 interval or some other task on the runqueue is runnable the scheduler is
150 - Halt polling will only be conducted by the host when no other tasks are runnable on
|
| /linux-6.15/Documentation/trace/rv/ |
| H A D | monitor_sched.rst | 87 The set non runnable on its own context (snroc) monitor ensures changes in a
|
| /linux-6.15/Documentation/admin-guide/pm/ |
| H A 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
193 multiple runnable tasks assigned to one CPU at the same time, the only way to
216 not be shared between multiple runnable tasks, the primary reason for using the
|
| /linux-6.15/Documentation/core-api/ |
| H A D | workqueue.rst | 126 number of the currently runnable workers. Generally, work items are
129 stalling should be optimal. As long as there are one or more runnable
224 concurrency level. In other words, runnable CPU intensive
232 regulated by the concurrency management and runnable
|
| /linux-6.15/tools/perf/Documentation/ |
| H A D | perf-sched.txt | 67 task scheduling delay (time between runnable and actually running) and
|
| /linux-6.15/Documentation/arch/arm64/ |
| H A D | asymmetric-32bit.rst | 154 ``KVM_EXIT_FAIL_ENTRY`` and will remain non-runnable until successfully
|
| /linux-6.15/Documentation/arch/s390/ |
| H A D | vfio-ccw.rst | 331 space, and assemble a runnable kernel channel program by updating the
382 channel program, which becomes runnable for a real device.
|