| /linux/tools/verification/models/sched/ |
| H A D | sssw.dot | 5 {node [shape = doublecircle] "runnable"}; 6 {node [shape = circle] "runnable"}; 10 "__init_runnable" -> "runnable"; 11 "runnable" [label = "runnable", color = green3]; 12 …"runnable" -> "runnable" [ label = "sched_set_state_runnable\nsched_wakeup\nsched_switch_in\nsched… 13 "runnable" -> "sleepable" [ label = "sched_set_state_sleepable" ]; 14 "runnable" -> "sleeping" [ label = "sched_switch_blocking" ]; 16 "signal_wakeup" -> "runnable" [ label = "signal_deliver" ]; 20 "sleepable" -> "runnable" [ label = "sched_set_state_runnable\nsched_wakeup" ]; 25 "sleeping" -> "runnable" [ label = "sched_wakeup" ]; [all …]
|
| /linux/kernel/sched/ |
| H A D | pelt.c | 104 unsigned long load, unsigned long runnable, int running) in accumulate_sum() argument 144 if (runnable) in accumulate_sum() 145 sa->runnable_sum += runnable * contrib << SCHED_CAPACITY_SHIFT; in accumulate_sum() 182 unsigned long load, unsigned long runnable, int running) in ___update_load_sum() argument 218 runnable = running = 0; in ___update_load_sum() 227 if (!accumulate_sum(delta, sa, load, runnable, running)) in ___update_load_sum()
|
| H A D | ext_internal.h | 409 void (*runnable)(struct task_struct *p, u64 enq_flags); member 446 void (*stopping)(struct task_struct *p, bool runnable);
|
| H A D | fair.c | 2233 unsigned long runnable; member 2269 ((ns->compute_capacity * imbalance_pct) < (ns->runnable * 100)))) in numa_classify() 2274 ((ns->compute_capacity * imbalance_pct) > (ns->runnable * 100)))) in numa_classify() 2325 ns->runnable += cpu_runnable(rq); in update_numa_stats() 4598 __update_sa(&cfs_rq->avg, runnable, delta_avg, delta_sum); in update_tg_cfs_runnable() 4867 __update_sa(sa, runnable, -r, -r*divider); in update_cfs_rq_load_avg() 4953 __update_sa(&cfs_rq->avg, runnable, -se->avg.runnable_avg, -se->avg.runnable_sum); in detach_entity_load_avg() 7517 unsigned int runnable; in cpu_runnable_without() local 7524 runnable = READ_ONCE(cfs_rq->avg.runnable_avg); in cpu_runnable_without() 7527 lsub_positive(&runnable, p->se.avg.runnable_avg); in cpu_runnable_without() [all …]
|
| /linux/tools/sched_ext/ |
| H A D | scx_flatcg.bpf.c | 13 * Let's say all three have runnable tasks. The total share that each of these 26 * and keep updating the eventual shares as the cgroups' runnable states change. 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() 444 * If @cgrp is becoming runnable, its hweight should be refreshed after 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 954 .runnable [all...] |
| H A D | scx_central.bpf.c | 285 void BPF_STRUCT_OPS(central_stopping, struct task_struct *p, bool runnable) in central_timerfn() 246 BPF_STRUCT_OPS(central_stopping,struct task_struct * p,bool runnable) BPF_STRUCT_OPS() argument
|
| /linux/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 | 20 a runnable task stalls, or on invoking the SysRq key sequence 64 detection of any internal error including stalled runnable tasks aborts the 259 from the global DSQ. If that doesn't yield a runnable task either, 390 * If the previous task is an SCX task and still runnable, keep executing 423 ops.runnable(); /* Task becomes ready to run */ 436 ops.runnable(); 479 ``ops.runnable()`` -> ``ops.running()``. 482 class, in which case it will exit the tick-dispatch loop even though it is runnable
|
| 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-capacity.rst | 243 accurately be predicted the moment a task first becomes runnable. The CFS class
|
| /linux/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 143 .runnable = (void *) maximal_runnable,
|
| H A D | select_cpu_vtime.bpf.c | 67 bool runnable) in BPF_STRUCT_OPS() argument
|
| /linux/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/Documentation/tools/rv/ |
| H A D | rv-mon-sched.rst | 52 * snroc: set non runnable on its own context
|
| /linux/drivers/gpu/drm/panthor/ |
| H A D | panthor_sched.c | 231 struct list_head runnable[PANTHOR_CSG_PRIORITY_COUNT]; member 2241 &sched->groups.runnable[group->priority]); in tick_ctx_cleanup() 2261 &sched->groups.runnable[group->priority]); in tick_ctx_cleanup() 2415 list_move_tail(&group->run_node, &sched->groups.runnable[prio]); in tick_ctx_apply() 2494 &sched->groups.runnable[prio], in tick_work() 2516 tick_ctx_pick_groups_from_list(sched, &ctx, &sched->groups.runnable[prio], in tick_work() 2636 &sched->groups.runnable[group->priority]); in sync_upd_work() 2676 struct list_head *queue = &sched->groups.runnable[group->priority]; in group_schedule_locked() 2770 &sched->groups.runnable[group->priority]); in panthor_group_start() 2962 for (i = 0; i < ARRAY_SIZE(sched->groups.runnable); i++) { in panthor_sched_pre_reset() [all …]
|
| /linux/Documentation/virt/ |
| H A D | guest-halt-polling.rst | 18 even with other runnable tasks in the host.
|
| /linux/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
|
| H A D | api.rst | 1594 whether the vcpu is runnable. 1619 whether the vcpu is runnable. 5763 KVM automatically accounts running and runnable time but blocked 6965 marking the exiting vCPU as runnable, or deny it and call KVM_RUN again.
|
| /linux/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.
|
| /linux/Documentation/admin-guide/hw-vuln/ |
| H A D | core-scheduling.rst | 108 highest priority task with the same cookie is selected if there is one runnable
|
| /linux/tools/perf/Documentation/ |
| H A D | perf-sched.txt | 67 task scheduling delay (time between runnable and actually running) and
|
| /linux/Documentation/process/ |
| H A D | license-rules.rst | 359 with this exception. This is required for creating runnable executables
|
| /linux/Documentation/locking/ |
| H A D | rt-mutex-design.rst | 69 of A. So now if B becomes runnable, it would not preempt C, since C now has
|