1/*
 2 * Only give sleepers 50% of their service deficit. This allows
 3 * them to run sooner, but does not allow tons of sleepers to
 4 * rip the spread apart.
 5 */
 6SCHED_FEAT(GENTLE_FAIR_SLEEPERS, true)
 7
 8/*
 9 * Place new tasks ahead so that they do not starve already running
10 * tasks
11 */
12SCHED_FEAT(START_DEBIT, true)
 
 
13
14/*
15 * Prefer to schedule the task we woke last (assuming it failed
16 * wakeup-preemption), since its likely going to consume data we
17 * touched, increases cache locality.
18 */
19SCHED_FEAT(NEXT_BUDDY, false)
20
21/*
22 * Prefer to schedule the task that ran last (when we did
23 * wake-preempt) as that likely will touch the same data, increases
24 * cache locality.
25 */
26SCHED_FEAT(LAST_BUDDY, true)
27
28/*
29 * Consider buddies to be cache hot, decreases the likelyness of a
30 * cache buddy being migrated away, increases cache locality.
31 */
32SCHED_FEAT(CACHE_HOT_BUDDY, true)
33
34/*
35 * Allow wakeup-time preemption of the current task:
36 */
37SCHED_FEAT(WAKEUP_PREEMPTION, true)
38
39/*
40 * Use arch dependent cpu power functions
41 */
42SCHED_FEAT(ARCH_POWER, true)
43
44SCHED_FEAT(HRTICK, false)
 
45SCHED_FEAT(DOUBLE_TICK, false)
46SCHED_FEAT(LB_BIAS, true)
47
48/*
49 * Decrement CPU power based on time not spent running tasks
50 */
51SCHED_FEAT(NONTASK_POWER, true)
 
 
 
 
52
53/*
54 * Queue remote wakeups on the target CPU and process them
55 * using the scheduler IPI. Reduces rq->lock contention/bounces.
56 */
57SCHED_FEAT(TTWU_QUEUE, true)
58
59SCHED_FEAT(FORCE_SD_OVERLAP, false)
60SCHED_FEAT(RT_RUNTIME_SHARE, true)
61SCHED_FEAT(LB_MIN, false)
62
63/*
64 * Apply the automatic NUMA scheduling policy. Enabled automatically
65 * at runtime if running on a NUMA machine. Can be controlled via
66 * numa_balancing=
67 */
68#ifdef CONFIG_NUMA_BALANCING
69SCHED_FEAT(NUMA,	false)
70
71/*
72 * NUMA_FAVOUR_HIGHER will favor moving tasks towards nodes where a
73 * higher number of hinting faults are recorded during active load
74 * balancing.
75 */
76SCHED_FEAT(NUMA_FAVOUR_HIGHER, true)
77
 
78/*
79 * NUMA_RESIST_LOWER will resist moving tasks towards nodes where a
80 * lower number of hinting faults have been recorded. As this has
81 * the potential to prevent a task ever migrating to a new node
82 * due to CPU overload it is disabled by default.
 
 
 
83 */
84SCHED_FEAT(NUMA_RESIST_LOWER, false)
85#endif

 1/* SPDX-License-Identifier: GPL-2.0 */
 
 
 
 
 
 2
 3/*
 4 * Using the avg_vruntime, do the right thing and preserve lag across
 5 * sleep+wake cycles. EEVDF placement strategy #1, #2 if disabled.
 6 */
 7SCHED_FEAT(PLACE_LAG, true)
 8SCHED_FEAT(PLACE_DEADLINE_INITIAL, true)
 9SCHED_FEAT(RUN_TO_PARITY, true)
10
11/*
12 * Prefer to schedule the task we woke last (assuming it failed
13 * wakeup-preemption), since its likely going to consume data we
14 * touched, increases cache locality.
15 */
16SCHED_FEAT(NEXT_BUDDY, false)
17
18/*
19 * Consider buddies to be cache hot, decreases the likeliness of a
 
 
 
 
 
 
 
20 * cache buddy being migrated away, increases cache locality.
21 */
22SCHED_FEAT(CACHE_HOT_BUDDY, true)
23
24/*
25 * Allow wakeup-time preemption of the current task:
26 */
27SCHED_FEAT(WAKEUP_PREEMPTION, true)
28
 
 
 
 
 
29SCHED_FEAT(HRTICK, false)
30SCHED_FEAT(HRTICK_DL, false)
31SCHED_FEAT(DOUBLE_TICK, false)
 
32
33/*
34 * Decrement CPU capacity based on time not spent running tasks
35 */
36SCHED_FEAT(NONTASK_CAPACITY, true)
37
38#ifdef CONFIG_PREEMPT_RT
39SCHED_FEAT(TTWU_QUEUE, false)
40#else
41
42/*
43 * Queue remote wakeups on the target CPU and process them
44 * using the scheduler IPI. Reduces rq->lock contention/bounces.
45 */
46SCHED_FEAT(TTWU_QUEUE, true)
47#endif
 
 
 
48
49/*
50 * When doing wakeups, attempt to limit superfluous scans of the LLC domain.
 
 
51 */
52SCHED_FEAT(SIS_UTIL, true)
 
53
54/*
55 * Issue a WARN when we do multiple update_rq_clock() calls
56 * in a single rq->lock section. Default disabled because the
57 * annotations are not complete.
58 */
59SCHED_FEAT(WARN_DOUBLE_CLOCK, false)
60
61#ifdef HAVE_RT_PUSH_IPI
62/*
63 * In order to avoid a thundering herd attack of CPUs that are
64 * lowering their priorities at the same time, and there being
65 * a single CPU that has an RT task that can migrate and is waiting
66 * to run, where the other CPUs will try to take that CPUs
67 * rq lock and possibly create a large contention, sending an
68 * IPI to that CPU and let that CPU push the RT task to where
69 * it should go may be a better scenario.
70 */
71SCHED_FEAT(RT_PUSH_IPI, true)
72#endif
73
74SCHED_FEAT(RT_RUNTIME_SHARE, false)
75SCHED_FEAT(LB_MIN, false)
76SCHED_FEAT(ATTACH_AGE_LOAD, true)
77
78SCHED_FEAT(WA_IDLE, true)
79SCHED_FEAT(WA_WEIGHT, true)
80SCHED_FEAT(WA_BIAS, true)
81
82/*
83 * UtilEstimation. Use estimated CPU utilization.
84 */
85SCHED_FEAT(UTIL_EST, true)
86
87SCHED_FEAT(LATENCY_WARN, false)
88
89SCHED_FEAT(HZ_BW, true)