1/* SPDX-License-Identifier: GPL-2.0 */
  2/*
  3 * Only give sleepers 50% of their service deficit. This allows
  4 * them to run sooner, but does not allow tons of sleepers to
  5 * rip the spread apart.
  6 */
  7SCHED_FEAT(GENTLE_FAIR_SLEEPERS, true)
  8
  9/*
 10 * Place new tasks ahead so that they do not starve already running
 11 * tasks
 12 */
 13SCHED_FEAT(START_DEBIT, true)
 14
 15/*
 16 * Prefer to schedule the task we woke last (assuming it failed
 17 * wakeup-preemption), since its likely going to consume data we
 18 * touched, increases cache locality.
 19 */
 20SCHED_FEAT(NEXT_BUDDY, false)
 21
 22/*
 23 * Prefer to schedule the task that ran last (when we did
 24 * wake-preempt) as that likely will touch the same data, increases
 25 * cache locality.
 26 */
 27SCHED_FEAT(LAST_BUDDY, true)
 28
 29/*
 30 * Consider buddies to be cache hot, decreases the likeliness of a
 31 * cache buddy being migrated away, increases cache locality.
 32 */
 33SCHED_FEAT(CACHE_HOT_BUDDY, true)
 34
 35/*
 36 * Allow wakeup-time preemption of the current task:
 37 */
 38SCHED_FEAT(WAKEUP_PREEMPTION, true)
 39
 40SCHED_FEAT(HRTICK, false)
 41SCHED_FEAT(HRTICK_DL, false)
 42SCHED_FEAT(DOUBLE_TICK, false)
 
 43
 44/*
 45 * Decrement CPU capacity based on time not spent running tasks
 46 */
 47SCHED_FEAT(NONTASK_CAPACITY, true)
 48
 49#ifdef CONFIG_PREEMPT_RT
 50SCHED_FEAT(TTWU_QUEUE, false)
 51#else
 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#endif
 59
 60/*
 61 * When doing wakeups, attempt to limit superfluous scans of the LLC domain.
 62 */
 63SCHED_FEAT(SIS_PROP, false)
 64SCHED_FEAT(SIS_UTIL, true)
 65
 66/*
 67 * Issue a WARN when we do multiple update_rq_clock() calls
 68 * in a single rq->lock section. Default disabled because the
 69 * annotations are not complete.
 70 */
 71SCHED_FEAT(WARN_DOUBLE_CLOCK, false)
 72
 73#ifdef HAVE_RT_PUSH_IPI
 74/*
 75 * In order to avoid a thundering herd attack of CPUs that are
 76 * lowering their priorities at the same time, and there being
 77 * a single CPU that has an RT task that can migrate and is waiting
 78 * to run, where the other CPUs will try to take that CPUs
 79 * rq lock and possibly create a large contention, sending an
 80 * IPI to that CPU and let that CPU push the RT task to where
 81 * it should go may be a better scenario.
 82 */
 83SCHED_FEAT(RT_PUSH_IPI, true)
 84#endif
 85
 86SCHED_FEAT(RT_RUNTIME_SHARE, false)
 
 87SCHED_FEAT(LB_MIN, false)
 88SCHED_FEAT(ATTACH_AGE_LOAD, true)
 89
 90SCHED_FEAT(WA_IDLE, true)
 91SCHED_FEAT(WA_WEIGHT, true)
 92SCHED_FEAT(WA_BIAS, true)
 93
 94/*
 95 * UtilEstimation. Use estimated CPU utilization.
 96 */
 97SCHED_FEAT(UTIL_EST, true)
 98SCHED_FEAT(UTIL_EST_FASTUP, true)
 99
100SCHED_FEAT(LATENCY_WARN, false)
101
102SCHED_FEAT(ALT_PERIOD, true)
103SCHED_FEAT(BASE_SLICE, true)

 
 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
39SCHED_FEAT(HRTICK, false)
 
40SCHED_FEAT(DOUBLE_TICK, false)
41SCHED_FEAT(LB_BIAS, true)
42
43/*
44 * Decrement CPU capacity based on time not spent running tasks
45 */
46SCHED_FEAT(NONTASK_CAPACITY, true)
47
 
 
 
 
48/*
49 * Queue remote wakeups on the target CPU and process them
50 * using the scheduler IPI. Reduces rq->lock contention/bounces.
51 */
52SCHED_FEAT(TTWU_QUEUE, true)
 
 
 
 
 
 
 
 
 
 
 
 
 
 
53
54#ifdef HAVE_RT_PUSH_IPI
55/*
56 * In order to avoid a thundering herd attack of CPUs that are
57 * lowering their priorities at the same time, and there being
58 * a single CPU that has an RT task that can migrate and is waiting
59 * to run, where the other CPUs will try to take that CPUs
60 * rq lock and possibly create a large contention, sending an
61 * IPI to that CPU and let that CPU push the RT task to where
62 * it should go may be a better scenario.
63 */
64SCHED_FEAT(RT_PUSH_IPI, true)
65#endif
66
67SCHED_FEAT(FORCE_SD_OVERLAP, false)
68SCHED_FEAT(RT_RUNTIME_SHARE, true)
69SCHED_FEAT(LB_MIN, false)
70SCHED_FEAT(ATTACH_AGE_LOAD, true)
71