Home
last modified time | relevance | path

Searched refs:runnable (Results 1 – 25 of 25) sorted by relevance

/linux/tools/verification/models/sched/
H A Dsssw.dot5 {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/tools/sched_ext/
H A Dscx_flatcg.bpf.c416 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
966 .runnable = (void *)fcg_runnable,
H A Dscx_central.bpf.c289 void BPF_STRUCT_OPS(central_stopping, struct task_struct *p, bool runnable) in BPF_STRUCT_OPS() argument
/linux/Documentation/scheduler/
H A Dschedutil.rst35 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 Dsched-ext.rst20 a runnable task stalls, or on invoking the SysRq key sequence
64 detection of any internal error including stalled runnable tasks aborts the
275 from the global DSQ. If that doesn't yield a runnable task either,
411 * If the previous task is an SCX task and still runnable, keep executing
444 ops.runnable(); /* Task becomes ready to run */
457 ops.runnable();
500 ``ops.runnable()`` -> ``ops.running()``.
503 class, in which case it will exit the tick-dispatch loop even though it is runnable
H A Dsched-eevdf.rst14 runnable tasks with the same priority. To do so, it assigns a virtual run
H A Dsched-capacity.rst243 accurately be predicted the moment a task first becomes runnable. The CFS class
/linux/tools/testing/selftests/sched_ext/
H A Dmaximal.bpf.c42 void BPF_STRUCT_OPS(maximal_stopping, struct task_struct *p, bool runnable) in BPF_STRUCT_OPS() argument
143 .runnable = (void *) maximal_runnable,
H A Dselect_cpu_vtime.bpf.c67 bool runnable) in BPF_STRUCT_OPS() argument
H A Denable_cmask.bpf.c213 .runnable = (void *)enable_cmask_runnable,
/linux/Documentation/timers/
H A Dno_hz.rst24 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 Drv-mon-sched.rst52 * snroc: set non runnable on its own context
/linux/kernel/sched/ext/
H A Dinternal.h58 SCX_EXIT_ERROR_STALL, /* watchdog detected stalled runnable tasks */
422 * @prev is still runnable as indicated by set %SCX_TASK_QUEUED in
441 * @runnable: A task is becoming runnable on its associated CPU
442 * @p: task becoming runnable
446 * execution state transitions. A task becomes ->runnable() on a CPU,
451 * @p is becoming runnable on the CPU because it's
465 void (*runnable)(struct task_struct *p, u64 enq_flags); member
480 * See ->runnable() for explanation on the task state notifiers.
487 * @runnable
1084 void (*runnable)(struct task_struct *p, u64 enq_flags); global() member
[all...]
H A Dext.c333 * Whenever a sched starts bypassing, all runnable tasks in its subtree in bypass_enq_target_dsq()
2142 * Record the rq @p is runnable on, maintained under the rq lock so it in clr_task_runnable()
2202 if (SCX_HAS_OP(sch, runnable) && !task_on_rq_migrating(p)) in enqueue_task_scx()
2203 SCX_CALL_OP_TASK(sch, runnable, rq, p, enq_flags);
2317 * to be contained within runnable <-> quiescent transitions, trigger in dequeue_task_scx()
2984 * If @prev is runnable & has slice left, it has priority and in dispatch_one()
3227 * If @p is runnable but we're about to enter a lower in put_prev_task_scx()
3233 * locally runnable and can legitimately go idle with @p still in kick_sync_wait_bal_cb()
3234 * runnable (see do_pick_task_scx()). in kick_sync_wait_bal_cb()
3430 * If any higher-priority sched class enqueued a runnable tas in do_pick_task_scx()
8315 sched_ext_ops__stopping(struct task_struct * p,bool runnable) sched_ext_ops__stopping() argument
[all...]
/linux/drivers/gpu/drm/panthor/
H A Dpanthor_sched.c225 * @groups.runnable: Runnable group lists.
232 struct list_head runnable[PANTHOR_CSG_PRIORITY_COUNT]; member
280 * This will force a tick, so other runnable groups can be scheduled if one
698 * panthor_group::groups::{runnable,idle} and
1317 /* Other reasons are not blocking. Consider the queue as runnable in cs_slot_sync_queue_state_locked()
2243 &sched->groups.runnable[group->priority]); in tick_ctx_cleanup()
2263 &sched->groups.runnable[group->priority]); in tick_ctx_cleanup()
2423 list_move_tail(&group->run_node, &sched->groups.runnable[prio]); in tick_ctx_apply()
2502 &sched->groups.runnable[prio], in tick_work()
2523 /* Fill the remaining slots with runnable group in tick_work()
[all...]
/linux/Documentation/virt/
H A Dguest-halt-polling.rst18 even with other runnable tasks in the host.
/linux/Documentation/virt/kvm/
H A Dhalt-polling.rst18 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/kernel/sched/
H A Dfair.c1172 * EEVDF selects the best runnable task from two criteria:
1320 /* Give new sched_entity start runnable values to heavy its load in infant time */
1551 * LLC (pref_llc_queued) and runnable (!sched_delayed), keeping the counter in in account_llc_enqueue()
1552 * the runnable domain so alb_break_llc() can compare it with h_nr_runnable. in account_llc_enqueue()
3050 unsigned long runnable;
3086 ((ns->compute_capacity * imbalance_pct) < (ns->runnable * 100)))) in task_numa_compare()
3091 ((ns->compute_capacity * imbalance_pct) > (ns->runnable * 100)))) in task_numa_compare()
3135 ns->runnable += cpu_runnable(rq); in task_numa_compare()
5124 * on an 8-core system with 8 tasks each runnable on one CPU shares has in cfs_rq_last_update_time()
5126 * case no task is runnable o
2859 unsigned long runnable; global() member
8278 unsigned int runnable; cpu_runnable_without() local
9132 unsigned long runnable; cpu_util() local
[all...]
/linux/Documentation/core-api/
H A Dworkqueue.rst126 number of the currently runnable workers. Generally, work items are
129 stalling should be optimal. As long as there are one or more runnable
230 concurrency level. In other words, runnable CPU intensive
238 regulated by the concurrency management and runnable
/linux/Documentation/arch/s390/
H A Dvfio-ccw.rst331 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 Dcore-scheduling.rst108 highest priority task with the same cookie is selected if there is one runnable
/linux/tools/perf/Documentation/
H A Dperf-sched.txt73 task scheduling delay (time between runnable and actually running) and
/linux/Documentation/process/
H A Dlicense-rules.rst359 with this exception. This is required for creating runnable executables
/linux/Documentation/locking/
H A Drt-mutex-design.rst69 of A. So now if B becomes runnable, it would not preempt C, since C now has
/linux/Documentation/ABI/testing/
H A Dsysfs-fs-f2fs971 0x00000004 Simulate runnable time