]>
Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 | 2 | /* |
391e43da | 3 | * kernel/sched/core.c |
1da177e4 | 4 | * |
d1ccc66d | 5 | * Core kernel scheduler code and related syscalls |
1da177e4 LT |
6 | * |
7 | * Copyright (C) 1991-2002 Linus Torvalds | |
1da177e4 | 8 | */ |
325ea10c | 9 | #include "sched.h" |
1da177e4 | 10 | |
7281c8de | 11 | #include <linux/nospec.h> |
85f1abe0 | 12 | |
0ed557aa MR |
13 | #include <linux/kcov.h> |
14 | ||
96f951ed | 15 | #include <asm/switch_to.h> |
5517d86b | 16 | #include <asm/tlb.h> |
1da177e4 | 17 | |
ea138446 | 18 | #include "../workqueue_internal.h" |
29d5e047 | 19 | #include "../smpboot.h" |
6e0534f2 | 20 | |
91c27493 VG |
21 | #include "pelt.h" |
22 | ||
a8d154b0 | 23 | #define CREATE_TRACE_POINTS |
ad8d75ff | 24 | #include <trace/events/sched.h> |
a8d154b0 | 25 | |
a056a5be QY |
26 | /* |
27 | * Export tracepoints that act as a bare tracehook (ie: have no trace event | |
28 | * associated with them) to allow external modules to probe them. | |
29 | */ | |
30 | EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_cfs_tp); | |
31 | EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_rt_tp); | |
32 | EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_dl_tp); | |
33 | EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_irq_tp); | |
34 | EXPORT_TRACEPOINT_SYMBOL_GPL(pelt_se_tp); | |
35 | EXPORT_TRACEPOINT_SYMBOL_GPL(sched_overutilized_tp); | |
36 | ||
029632fb | 37 | DEFINE_PER_CPU_SHARED_ALIGNED(struct rq, runqueues); |
dc61b1d6 | 38 | |
e9666d10 | 39 | #if defined(CONFIG_SCHED_DEBUG) && defined(CONFIG_JUMP_LABEL) |
bf5c91ba IM |
40 | /* |
41 | * Debugging: various feature bits | |
765cc3a4 PB |
42 | * |
43 | * If SCHED_DEBUG is disabled, each compilation unit has its own copy of | |
44 | * sysctl_sched_features, defined in sched.h, to allow constants propagation | |
45 | * at compile time and compiler optimization based on features default. | |
bf5c91ba | 46 | */ |
f00b45c1 PZ |
47 | #define SCHED_FEAT(name, enabled) \ |
48 | (1UL << __SCHED_FEAT_##name) * enabled | | |
bf5c91ba | 49 | const_debug unsigned int sysctl_sched_features = |
391e43da | 50 | #include "features.h" |
f00b45c1 | 51 | 0; |
f00b45c1 | 52 | #undef SCHED_FEAT |
765cc3a4 | 53 | #endif |
f00b45c1 | 54 | |
b82d9fdd PZ |
55 | /* |
56 | * Number of tasks to iterate in a single balance run. | |
57 | * Limited because this is done with IRQs disabled. | |
58 | */ | |
59 | const_debug unsigned int sysctl_sched_nr_migrate = 32; | |
60 | ||
fa85ae24 | 61 | /* |
d1ccc66d | 62 | * period over which we measure -rt task CPU usage in us. |
fa85ae24 PZ |
63 | * default: 1s |
64 | */ | |
9f0c1e56 | 65 | unsigned int sysctl_sched_rt_period = 1000000; |
fa85ae24 | 66 | |
029632fb | 67 | __read_mostly int scheduler_running; |
6892b75e | 68 | |
9f0c1e56 PZ |
69 | /* |
70 | * part of the period that we allow rt tasks to run in us. | |
71 | * default: 0.95s | |
72 | */ | |
73 | int sysctl_sched_rt_runtime = 950000; | |
fa85ae24 | 74 | |
3e71a462 PZ |
75 | /* |
76 | * __task_rq_lock - lock the rq @p resides on. | |
77 | */ | |
eb580751 | 78 | struct rq *__task_rq_lock(struct task_struct *p, struct rq_flags *rf) |
3e71a462 PZ |
79 | __acquires(rq->lock) |
80 | { | |
81 | struct rq *rq; | |
82 | ||
83 | lockdep_assert_held(&p->pi_lock); | |
84 | ||
85 | for (;;) { | |
86 | rq = task_rq(p); | |
87 | raw_spin_lock(&rq->lock); | |
88 | if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) { | |
d8ac8971 | 89 | rq_pin_lock(rq, rf); |
3e71a462 PZ |
90 | return rq; |
91 | } | |
92 | raw_spin_unlock(&rq->lock); | |
93 | ||
94 | while (unlikely(task_on_rq_migrating(p))) | |
95 | cpu_relax(); | |
96 | } | |
97 | } | |
98 | ||
99 | /* | |
100 | * task_rq_lock - lock p->pi_lock and lock the rq @p resides on. | |
101 | */ | |
eb580751 | 102 | struct rq *task_rq_lock(struct task_struct *p, struct rq_flags *rf) |
3e71a462 PZ |
103 | __acquires(p->pi_lock) |
104 | __acquires(rq->lock) | |
105 | { | |
106 | struct rq *rq; | |
107 | ||
108 | for (;;) { | |
eb580751 | 109 | raw_spin_lock_irqsave(&p->pi_lock, rf->flags); |
3e71a462 PZ |
110 | rq = task_rq(p); |
111 | raw_spin_lock(&rq->lock); | |
112 | /* | |
113 | * move_queued_task() task_rq_lock() | |
114 | * | |
115 | * ACQUIRE (rq->lock) | |
116 | * [S] ->on_rq = MIGRATING [L] rq = task_rq() | |
117 | * WMB (__set_task_cpu()) ACQUIRE (rq->lock); | |
118 | * [S] ->cpu = new_cpu [L] task_rq() | |
119 | * [L] ->on_rq | |
120 | * RELEASE (rq->lock) | |
121 | * | |
c546951d | 122 | * If we observe the old CPU in task_rq_lock(), the acquire of |
3e71a462 PZ |
123 | * the old rq->lock will fully serialize against the stores. |
124 | * | |
c546951d AP |
125 | * If we observe the new CPU in task_rq_lock(), the address |
126 | * dependency headed by '[L] rq = task_rq()' and the acquire | |
127 | * will pair with the WMB to ensure we then also see migrating. | |
3e71a462 PZ |
128 | */ |
129 | if (likely(rq == task_rq(p) && !task_on_rq_migrating(p))) { | |
d8ac8971 | 130 | rq_pin_lock(rq, rf); |
3e71a462 PZ |
131 | return rq; |
132 | } | |
133 | raw_spin_unlock(&rq->lock); | |
eb580751 | 134 | raw_spin_unlock_irqrestore(&p->pi_lock, rf->flags); |
3e71a462 PZ |
135 | |
136 | while (unlikely(task_on_rq_migrating(p))) | |
137 | cpu_relax(); | |
138 | } | |
139 | } | |
140 | ||
535b9552 IM |
141 | /* |
142 | * RQ-clock updating methods: | |
143 | */ | |
144 | ||
145 | static void update_rq_clock_task(struct rq *rq, s64 delta) | |
146 | { | |
147 | /* | |
148 | * In theory, the compile should just see 0 here, and optimize out the call | |
149 | * to sched_rt_avg_update. But I don't trust it... | |
150 | */ | |
11d4afd4 VG |
151 | s64 __maybe_unused steal = 0, irq_delta = 0; |
152 | ||
535b9552 IM |
153 | #ifdef CONFIG_IRQ_TIME_ACCOUNTING |
154 | irq_delta = irq_time_read(cpu_of(rq)) - rq->prev_irq_time; | |
155 | ||
156 | /* | |
157 | * Since irq_time is only updated on {soft,}irq_exit, we might run into | |
158 | * this case when a previous update_rq_clock() happened inside a | |
159 | * {soft,}irq region. | |
160 | * | |
161 | * When this happens, we stop ->clock_task and only update the | |
162 | * prev_irq_time stamp to account for the part that fit, so that a next | |
163 | * update will consume the rest. This ensures ->clock_task is | |
164 | * monotonic. | |
165 | * | |
166 | * It does however cause some slight miss-attribution of {soft,}irq | |
167 | * time, a more accurate solution would be to update the irq_time using | |
168 | * the current rq->clock timestamp, except that would require using | |
169 | * atomic ops. | |
170 | */ | |
171 | if (irq_delta > delta) | |
172 | irq_delta = delta; | |
173 | ||
174 | rq->prev_irq_time += irq_delta; | |
175 | delta -= irq_delta; | |
176 | #endif | |
177 | #ifdef CONFIG_PARAVIRT_TIME_ACCOUNTING | |
178 | if (static_key_false((¶virt_steal_rq_enabled))) { | |
179 | steal = paravirt_steal_clock(cpu_of(rq)); | |
180 | steal -= rq->prev_steal_time_rq; | |
181 | ||
182 | if (unlikely(steal > delta)) | |
183 | steal = delta; | |
184 | ||
185 | rq->prev_steal_time_rq += steal; | |
186 | delta -= steal; | |
187 | } | |
188 | #endif | |
189 | ||
190 | rq->clock_task += delta; | |
191 | ||
11d4afd4 | 192 | #ifdef CONFIG_HAVE_SCHED_AVG_IRQ |
535b9552 | 193 | if ((irq_delta + steal) && sched_feat(NONTASK_CAPACITY)) |
91c27493 | 194 | update_irq_load_avg(rq, irq_delta + steal); |
535b9552 | 195 | #endif |
23127296 | 196 | update_rq_clock_pelt(rq, delta); |
535b9552 IM |
197 | } |
198 | ||
199 | void update_rq_clock(struct rq *rq) | |
200 | { | |
201 | s64 delta; | |
202 | ||
203 | lockdep_assert_held(&rq->lock); | |
204 | ||
205 | if (rq->clock_update_flags & RQCF_ACT_SKIP) | |
206 | return; | |
207 | ||
208 | #ifdef CONFIG_SCHED_DEBUG | |
26ae58d2 PZ |
209 | if (sched_feat(WARN_DOUBLE_CLOCK)) |
210 | SCHED_WARN_ON(rq->clock_update_flags & RQCF_UPDATED); | |
535b9552 IM |
211 | rq->clock_update_flags |= RQCF_UPDATED; |
212 | #endif | |
26ae58d2 | 213 | |
535b9552 IM |
214 | delta = sched_clock_cpu(cpu_of(rq)) - rq->clock; |
215 | if (delta < 0) | |
216 | return; | |
217 | rq->clock += delta; | |
218 | update_rq_clock_task(rq, delta); | |
219 | } | |
220 | ||
221 | ||
8f4d37ec PZ |
222 | #ifdef CONFIG_SCHED_HRTICK |
223 | /* | |
224 | * Use HR-timers to deliver accurate preemption points. | |
8f4d37ec | 225 | */ |
8f4d37ec | 226 | |
8f4d37ec PZ |
227 | static void hrtick_clear(struct rq *rq) |
228 | { | |
229 | if (hrtimer_active(&rq->hrtick_timer)) | |
230 | hrtimer_cancel(&rq->hrtick_timer); | |
231 | } | |
232 | ||
8f4d37ec PZ |
233 | /* |
234 | * High-resolution timer tick. | |
235 | * Runs from hardirq context with interrupts disabled. | |
236 | */ | |
237 | static enum hrtimer_restart hrtick(struct hrtimer *timer) | |
238 | { | |
239 | struct rq *rq = container_of(timer, struct rq, hrtick_timer); | |
8a8c69c3 | 240 | struct rq_flags rf; |
8f4d37ec PZ |
241 | |
242 | WARN_ON_ONCE(cpu_of(rq) != smp_processor_id()); | |
243 | ||
8a8c69c3 | 244 | rq_lock(rq, &rf); |
3e51f33f | 245 | update_rq_clock(rq); |
8f4d37ec | 246 | rq->curr->sched_class->task_tick(rq, rq->curr, 1); |
8a8c69c3 | 247 | rq_unlock(rq, &rf); |
8f4d37ec PZ |
248 | |
249 | return HRTIMER_NORESTART; | |
250 | } | |
251 | ||
95e904c7 | 252 | #ifdef CONFIG_SMP |
971ee28c | 253 | |
4961b6e1 | 254 | static void __hrtick_restart(struct rq *rq) |
971ee28c PZ |
255 | { |
256 | struct hrtimer *timer = &rq->hrtick_timer; | |
971ee28c | 257 | |
4961b6e1 | 258 | hrtimer_start_expires(timer, HRTIMER_MODE_ABS_PINNED); |
971ee28c PZ |
259 | } |
260 | ||
31656519 PZ |
261 | /* |
262 | * called from hardirq (IPI) context | |
263 | */ | |
264 | static void __hrtick_start(void *arg) | |
b328ca18 | 265 | { |
31656519 | 266 | struct rq *rq = arg; |
8a8c69c3 | 267 | struct rq_flags rf; |
b328ca18 | 268 | |
8a8c69c3 | 269 | rq_lock(rq, &rf); |
971ee28c | 270 | __hrtick_restart(rq); |
31656519 | 271 | rq->hrtick_csd_pending = 0; |
8a8c69c3 | 272 | rq_unlock(rq, &rf); |
b328ca18 PZ |
273 | } |
274 | ||
31656519 PZ |
275 | /* |
276 | * Called to set the hrtick timer state. | |
277 | * | |
278 | * called with rq->lock held and irqs disabled | |
279 | */ | |
029632fb | 280 | void hrtick_start(struct rq *rq, u64 delay) |
b328ca18 | 281 | { |
31656519 | 282 | struct hrtimer *timer = &rq->hrtick_timer; |
177ef2a6 | 283 | ktime_t time; |
284 | s64 delta; | |
285 | ||
286 | /* | |
287 | * Don't schedule slices shorter than 10000ns, that just | |
288 | * doesn't make sense and can cause timer DoS. | |
289 | */ | |
290 | delta = max_t(s64, delay, 10000LL); | |
291 | time = ktime_add_ns(timer->base->get_time(), delta); | |
b328ca18 | 292 | |
cc584b21 | 293 | hrtimer_set_expires(timer, time); |
31656519 PZ |
294 | |
295 | if (rq == this_rq()) { | |
971ee28c | 296 | __hrtick_restart(rq); |
31656519 | 297 | } else if (!rq->hrtick_csd_pending) { |
c46fff2a | 298 | smp_call_function_single_async(cpu_of(rq), &rq->hrtick_csd); |
31656519 PZ |
299 | rq->hrtick_csd_pending = 1; |
300 | } | |
b328ca18 PZ |
301 | } |
302 | ||
31656519 PZ |
303 | #else |
304 | /* | |
305 | * Called to set the hrtick timer state. | |
306 | * | |
307 | * called with rq->lock held and irqs disabled | |
308 | */ | |
029632fb | 309 | void hrtick_start(struct rq *rq, u64 delay) |
31656519 | 310 | { |
86893335 WL |
311 | /* |
312 | * Don't schedule slices shorter than 10000ns, that just | |
313 | * doesn't make sense. Rely on vruntime for fairness. | |
314 | */ | |
315 | delay = max_t(u64, delay, 10000LL); | |
4961b6e1 TG |
316 | hrtimer_start(&rq->hrtick_timer, ns_to_ktime(delay), |
317 | HRTIMER_MODE_REL_PINNED); | |
31656519 | 318 | } |
31656519 | 319 | #endif /* CONFIG_SMP */ |
8f4d37ec | 320 | |
77a021be | 321 | static void hrtick_rq_init(struct rq *rq) |
8f4d37ec | 322 | { |
31656519 PZ |
323 | #ifdef CONFIG_SMP |
324 | rq->hrtick_csd_pending = 0; | |
8f4d37ec | 325 | |
31656519 PZ |
326 | rq->hrtick_csd.flags = 0; |
327 | rq->hrtick_csd.func = __hrtick_start; | |
328 | rq->hrtick_csd.info = rq; | |
329 | #endif | |
8f4d37ec | 330 | |
31656519 PZ |
331 | hrtimer_init(&rq->hrtick_timer, CLOCK_MONOTONIC, HRTIMER_MODE_REL); |
332 | rq->hrtick_timer.function = hrtick; | |
8f4d37ec | 333 | } |
006c75f1 | 334 | #else /* CONFIG_SCHED_HRTICK */ |
8f4d37ec PZ |
335 | static inline void hrtick_clear(struct rq *rq) |
336 | { | |
337 | } | |
338 | ||
77a021be | 339 | static inline void hrtick_rq_init(struct rq *rq) |
8f4d37ec PZ |
340 | { |
341 | } | |
006c75f1 | 342 | #endif /* CONFIG_SCHED_HRTICK */ |
8f4d37ec | 343 | |
5529578a FW |
344 | /* |
345 | * cmpxchg based fetch_or, macro so it works for different integer types | |
346 | */ | |
347 | #define fetch_or(ptr, mask) \ | |
348 | ({ \ | |
349 | typeof(ptr) _ptr = (ptr); \ | |
350 | typeof(mask) _mask = (mask); \ | |
351 | typeof(*_ptr) _old, _val = *_ptr; \ | |
352 | \ | |
353 | for (;;) { \ | |
354 | _old = cmpxchg(_ptr, _val, _val | _mask); \ | |
355 | if (_old == _val) \ | |
356 | break; \ | |
357 | _val = _old; \ | |
358 | } \ | |
359 | _old; \ | |
360 | }) | |
361 | ||
e3baac47 | 362 | #if defined(CONFIG_SMP) && defined(TIF_POLLING_NRFLAG) |
fd99f91a PZ |
363 | /* |
364 | * Atomically set TIF_NEED_RESCHED and test for TIF_POLLING_NRFLAG, | |
365 | * this avoids any races wrt polling state changes and thereby avoids | |
366 | * spurious IPIs. | |
367 | */ | |
368 | static bool set_nr_and_not_polling(struct task_struct *p) | |
369 | { | |
370 | struct thread_info *ti = task_thread_info(p); | |
371 | return !(fetch_or(&ti->flags, _TIF_NEED_RESCHED) & _TIF_POLLING_NRFLAG); | |
372 | } | |
e3baac47 PZ |
373 | |
374 | /* | |
375 | * Atomically set TIF_NEED_RESCHED if TIF_POLLING_NRFLAG is set. | |
376 | * | |
377 | * If this returns true, then the idle task promises to call | |
378 | * sched_ttwu_pending() and reschedule soon. | |
379 | */ | |
380 | static bool set_nr_if_polling(struct task_struct *p) | |
381 | { | |
382 | struct thread_info *ti = task_thread_info(p); | |
316c1608 | 383 | typeof(ti->flags) old, val = READ_ONCE(ti->flags); |
e3baac47 PZ |
384 | |
385 | for (;;) { | |
386 | if (!(val & _TIF_POLLING_NRFLAG)) | |
387 | return false; | |
388 | if (val & _TIF_NEED_RESCHED) | |
389 | return true; | |
390 | old = cmpxchg(&ti->flags, val, val | _TIF_NEED_RESCHED); | |
391 | if (old == val) | |
392 | break; | |
393 | val = old; | |
394 | } | |
395 | return true; | |
396 | } | |
397 | ||
fd99f91a PZ |
398 | #else |
399 | static bool set_nr_and_not_polling(struct task_struct *p) | |
400 | { | |
401 | set_tsk_need_resched(p); | |
402 | return true; | |
403 | } | |
e3baac47 PZ |
404 | |
405 | #ifdef CONFIG_SMP | |
406 | static bool set_nr_if_polling(struct task_struct *p) | |
407 | { | |
408 | return false; | |
409 | } | |
410 | #endif | |
fd99f91a PZ |
411 | #endif |
412 | ||
07879c6a | 413 | static bool __wake_q_add(struct wake_q_head *head, struct task_struct *task) |
76751049 PZ |
414 | { |
415 | struct wake_q_node *node = &task->wake_q; | |
416 | ||
417 | /* | |
418 | * Atomically grab the task, if ->wake_q is !nil already it means | |
419 | * its already queued (either by us or someone else) and will get the | |
420 | * wakeup due to that. | |
421 | * | |
4c4e3731 PZ |
422 | * In order to ensure that a pending wakeup will observe our pending |
423 | * state, even in the failed case, an explicit smp_mb() must be used. | |
76751049 | 424 | */ |
4c4e3731 | 425 | smp_mb__before_atomic(); |
87ff19cb | 426 | if (unlikely(cmpxchg_relaxed(&node->next, NULL, WAKE_Q_TAIL))) |
07879c6a | 427 | return false; |
76751049 PZ |
428 | |
429 | /* | |
430 | * The head is context local, there can be no concurrency. | |
431 | */ | |
432 | *head->lastp = node; | |
433 | head->lastp = &node->next; | |
07879c6a DB |
434 | return true; |
435 | } | |
436 | ||
437 | /** | |
438 | * wake_q_add() - queue a wakeup for 'later' waking. | |
439 | * @head: the wake_q_head to add @task to | |
440 | * @task: the task to queue for 'later' wakeup | |
441 | * | |
442 | * Queue a task for later wakeup, most likely by the wake_up_q() call in the | |
443 | * same context, _HOWEVER_ this is not guaranteed, the wakeup can come | |
444 | * instantly. | |
445 | * | |
446 | * This function must be used as-if it were wake_up_process(); IOW the task | |
447 | * must be ready to be woken at this location. | |
448 | */ | |
449 | void wake_q_add(struct wake_q_head *head, struct task_struct *task) | |
450 | { | |
451 | if (__wake_q_add(head, task)) | |
452 | get_task_struct(task); | |
453 | } | |
454 | ||
455 | /** | |
456 | * wake_q_add_safe() - safely queue a wakeup for 'later' waking. | |
457 | * @head: the wake_q_head to add @task to | |
458 | * @task: the task to queue for 'later' wakeup | |
459 | * | |
460 | * Queue a task for later wakeup, most likely by the wake_up_q() call in the | |
461 | * same context, _HOWEVER_ this is not guaranteed, the wakeup can come | |
462 | * instantly. | |
463 | * | |
464 | * This function must be used as-if it were wake_up_process(); IOW the task | |
465 | * must be ready to be woken at this location. | |
466 | * | |
467 | * This function is essentially a task-safe equivalent to wake_q_add(). Callers | |
468 | * that already hold reference to @task can call the 'safe' version and trust | |
469 | * wake_q to do the right thing depending whether or not the @task is already | |
470 | * queued for wakeup. | |
471 | */ | |
472 | void wake_q_add_safe(struct wake_q_head *head, struct task_struct *task) | |
473 | { | |
474 | if (!__wake_q_add(head, task)) | |
475 | put_task_struct(task); | |
76751049 PZ |
476 | } |
477 | ||
478 | void wake_up_q(struct wake_q_head *head) | |
479 | { | |
480 | struct wake_q_node *node = head->first; | |
481 | ||
482 | while (node != WAKE_Q_TAIL) { | |
483 | struct task_struct *task; | |
484 | ||
485 | task = container_of(node, struct task_struct, wake_q); | |
486 | BUG_ON(!task); | |
d1ccc66d | 487 | /* Task can safely be re-inserted now: */ |
76751049 PZ |
488 | node = node->next; |
489 | task->wake_q.next = NULL; | |
490 | ||
491 | /* | |
7696f991 AP |
492 | * wake_up_process() executes a full barrier, which pairs with |
493 | * the queueing in wake_q_add() so as not to miss wakeups. | |
76751049 PZ |
494 | */ |
495 | wake_up_process(task); | |
496 | put_task_struct(task); | |
497 | } | |
498 | } | |
499 | ||
c24d20db | 500 | /* |
8875125e | 501 | * resched_curr - mark rq's current task 'to be rescheduled now'. |
c24d20db IM |
502 | * |
503 | * On UP this means the setting of the need_resched flag, on SMP it | |
504 | * might also involve a cross-CPU call to trigger the scheduler on | |
505 | * the target CPU. | |
506 | */ | |
8875125e | 507 | void resched_curr(struct rq *rq) |
c24d20db | 508 | { |
8875125e | 509 | struct task_struct *curr = rq->curr; |
c24d20db IM |
510 | int cpu; |
511 | ||
8875125e | 512 | lockdep_assert_held(&rq->lock); |
c24d20db | 513 | |
8875125e | 514 | if (test_tsk_need_resched(curr)) |
c24d20db IM |
515 | return; |
516 | ||
8875125e | 517 | cpu = cpu_of(rq); |
fd99f91a | 518 | |
f27dde8d | 519 | if (cpu == smp_processor_id()) { |
8875125e | 520 | set_tsk_need_resched(curr); |
f27dde8d | 521 | set_preempt_need_resched(); |
c24d20db | 522 | return; |
f27dde8d | 523 | } |
c24d20db | 524 | |
8875125e | 525 | if (set_nr_and_not_polling(curr)) |
c24d20db | 526 | smp_send_reschedule(cpu); |
dfc68f29 AL |
527 | else |
528 | trace_sched_wake_idle_without_ipi(cpu); | |
c24d20db IM |
529 | } |
530 | ||
029632fb | 531 | void resched_cpu(int cpu) |
c24d20db IM |
532 | { |
533 | struct rq *rq = cpu_rq(cpu); | |
534 | unsigned long flags; | |
535 | ||
7c2102e5 | 536 | raw_spin_lock_irqsave(&rq->lock, flags); |
a0982dfa PM |
537 | if (cpu_online(cpu) || cpu == smp_processor_id()) |
538 | resched_curr(rq); | |
05fa785c | 539 | raw_spin_unlock_irqrestore(&rq->lock, flags); |
c24d20db | 540 | } |
06d8308c | 541 | |
b021fe3e | 542 | #ifdef CONFIG_SMP |
3451d024 | 543 | #ifdef CONFIG_NO_HZ_COMMON |
83cd4fe2 | 544 | /* |
d1ccc66d IM |
545 | * In the semi idle case, use the nearest busy CPU for migrating timers |
546 | * from an idle CPU. This is good for power-savings. | |
83cd4fe2 VP |
547 | * |
548 | * We don't do similar optimization for completely idle system, as | |
d1ccc66d IM |
549 | * selecting an idle CPU will add more delays to the timers than intended |
550 | * (as that CPU's timer base may not be uptodate wrt jiffies etc). | |
83cd4fe2 | 551 | */ |
bc7a34b8 | 552 | int get_nohz_timer_target(void) |
83cd4fe2 | 553 | { |
bc7a34b8 | 554 | int i, cpu = smp_processor_id(); |
83cd4fe2 VP |
555 | struct sched_domain *sd; |
556 | ||
de201559 | 557 | if (!idle_cpu(cpu) && housekeeping_cpu(cpu, HK_FLAG_TIMER)) |
6201b4d6 VK |
558 | return cpu; |
559 | ||
057f3fad | 560 | rcu_read_lock(); |
83cd4fe2 | 561 | for_each_domain(cpu, sd) { |
057f3fad | 562 | for_each_cpu(i, sched_domain_span(sd)) { |
44496922 WL |
563 | if (cpu == i) |
564 | continue; | |
565 | ||
de201559 | 566 | if (!idle_cpu(i) && housekeeping_cpu(i, HK_FLAG_TIMER)) { |
057f3fad PZ |
567 | cpu = i; |
568 | goto unlock; | |
569 | } | |
570 | } | |
83cd4fe2 | 571 | } |
9642d18e | 572 | |
de201559 FW |
573 | if (!housekeeping_cpu(cpu, HK_FLAG_TIMER)) |
574 | cpu = housekeeping_any_cpu(HK_FLAG_TIMER); | |
057f3fad PZ |
575 | unlock: |
576 | rcu_read_unlock(); | |
83cd4fe2 VP |
577 | return cpu; |
578 | } | |
d1ccc66d | 579 | |
06d8308c TG |
580 | /* |
581 | * When add_timer_on() enqueues a timer into the timer wheel of an | |
582 | * idle CPU then this timer might expire before the next timer event | |
583 | * which is scheduled to wake up that CPU. In case of a completely | |
584 | * idle system the next event might even be infinite time into the | |
585 | * future. wake_up_idle_cpu() ensures that the CPU is woken up and | |
586 | * leaves the inner idle loop so the newly added timer is taken into | |
587 | * account when the CPU goes back to idle and evaluates the timer | |
588 | * wheel for the next timer event. | |
589 | */ | |
1c20091e | 590 | static void wake_up_idle_cpu(int cpu) |
06d8308c TG |
591 | { |
592 | struct rq *rq = cpu_rq(cpu); | |
593 | ||
594 | if (cpu == smp_processor_id()) | |
595 | return; | |
596 | ||
67b9ca70 | 597 | if (set_nr_and_not_polling(rq->idle)) |
06d8308c | 598 | smp_send_reschedule(cpu); |
dfc68f29 AL |
599 | else |
600 | trace_sched_wake_idle_without_ipi(cpu); | |
45bf76df IM |
601 | } |
602 | ||
c5bfece2 | 603 | static bool wake_up_full_nohz_cpu(int cpu) |
1c20091e | 604 | { |
53c5fa16 FW |
605 | /* |
606 | * We just need the target to call irq_exit() and re-evaluate | |
607 | * the next tick. The nohz full kick at least implies that. | |
608 | * If needed we can still optimize that later with an | |
609 | * empty IRQ. | |
610 | */ | |
379d9ecb PM |
611 | if (cpu_is_offline(cpu)) |
612 | return true; /* Don't try to wake offline CPUs. */ | |
c5bfece2 | 613 | if (tick_nohz_full_cpu(cpu)) { |
1c20091e FW |
614 | if (cpu != smp_processor_id() || |
615 | tick_nohz_tick_stopped()) | |
53c5fa16 | 616 | tick_nohz_full_kick_cpu(cpu); |
1c20091e FW |
617 | return true; |
618 | } | |
619 | ||
620 | return false; | |
621 | } | |
622 | ||
379d9ecb PM |
623 | /* |
624 | * Wake up the specified CPU. If the CPU is going offline, it is the | |
625 | * caller's responsibility to deal with the lost wakeup, for example, | |
626 | * by hooking into the CPU_DEAD notifier like timers and hrtimers do. | |
627 | */ | |
1c20091e FW |
628 | void wake_up_nohz_cpu(int cpu) |
629 | { | |
c5bfece2 | 630 | if (!wake_up_full_nohz_cpu(cpu)) |
1c20091e FW |
631 | wake_up_idle_cpu(cpu); |
632 | } | |
633 | ||
ca38062e | 634 | static inline bool got_nohz_idle_kick(void) |
45bf76df | 635 | { |
1c792db7 | 636 | int cpu = smp_processor_id(); |
873b4c65 | 637 | |
b7031a02 | 638 | if (!(atomic_read(nohz_flags(cpu)) & NOHZ_KICK_MASK)) |
873b4c65 VG |
639 | return false; |
640 | ||
641 | if (idle_cpu(cpu) && !need_resched()) | |
642 | return true; | |
643 | ||
644 | /* | |
645 | * We can't run Idle Load Balance on this CPU for this time so we | |
646 | * cancel it and clear NOHZ_BALANCE_KICK | |
647 | */ | |
b7031a02 | 648 | atomic_andnot(NOHZ_KICK_MASK, nohz_flags(cpu)); |
873b4c65 | 649 | return false; |
45bf76df IM |
650 | } |
651 | ||
3451d024 | 652 | #else /* CONFIG_NO_HZ_COMMON */ |
45bf76df | 653 | |
ca38062e | 654 | static inline bool got_nohz_idle_kick(void) |
2069dd75 | 655 | { |
ca38062e | 656 | return false; |
2069dd75 PZ |
657 | } |
658 | ||
3451d024 | 659 | #endif /* CONFIG_NO_HZ_COMMON */ |
d842de87 | 660 | |
ce831b38 | 661 | #ifdef CONFIG_NO_HZ_FULL |
76d92ac3 | 662 | bool sched_can_stop_tick(struct rq *rq) |
ce831b38 | 663 | { |
76d92ac3 FW |
664 | int fifo_nr_running; |
665 | ||
666 | /* Deadline tasks, even if single, need the tick */ | |
667 | if (rq->dl.dl_nr_running) | |
668 | return false; | |
669 | ||
1e78cdbd | 670 | /* |
2548d546 PZ |
671 | * If there are more than one RR tasks, we need the tick to effect the |
672 | * actual RR behaviour. | |
1e78cdbd | 673 | */ |
76d92ac3 FW |
674 | if (rq->rt.rr_nr_running) { |
675 | if (rq->rt.rr_nr_running == 1) | |
676 | return true; | |
677 | else | |
678 | return false; | |
1e78cdbd RR |
679 | } |
680 | ||
2548d546 PZ |
681 | /* |
682 | * If there's no RR tasks, but FIFO tasks, we can skip the tick, no | |
683 | * forced preemption between FIFO tasks. | |
684 | */ | |
685 | fifo_nr_running = rq->rt.rt_nr_running - rq->rt.rr_nr_running; | |
686 | if (fifo_nr_running) | |
687 | return true; | |
688 | ||
689 | /* | |
690 | * If there are no DL,RR/FIFO tasks, there must only be CFS tasks left; | |
691 | * if there's more than one we need the tick for involuntary | |
692 | * preemption. | |
693 | */ | |
694 | if (rq->nr_running > 1) | |
541b8264 | 695 | return false; |
ce831b38 | 696 | |
541b8264 | 697 | return true; |
ce831b38 FW |
698 | } |
699 | #endif /* CONFIG_NO_HZ_FULL */ | |
6d6bc0ad | 700 | #endif /* CONFIG_SMP */ |
18d95a28 | 701 | |
a790de99 PT |
702 | #if defined(CONFIG_RT_GROUP_SCHED) || (defined(CONFIG_FAIR_GROUP_SCHED) && \ |
703 | (defined(CONFIG_SMP) || defined(CONFIG_CFS_BANDWIDTH))) | |
c09595f6 | 704 | /* |
8277434e PT |
705 | * Iterate task_group tree rooted at *from, calling @down when first entering a |
706 | * node and @up when leaving it for the final time. | |
707 | * | |
708 | * Caller must hold rcu_lock or sufficient equivalent. | |
c09595f6 | 709 | */ |
029632fb | 710 | int walk_tg_tree_from(struct task_group *from, |
8277434e | 711 | tg_visitor down, tg_visitor up, void *data) |
c09595f6 PZ |
712 | { |
713 | struct task_group *parent, *child; | |
eb755805 | 714 | int ret; |
c09595f6 | 715 | |
8277434e PT |
716 | parent = from; |
717 | ||
c09595f6 | 718 | down: |
eb755805 PZ |
719 | ret = (*down)(parent, data); |
720 | if (ret) | |
8277434e | 721 | goto out; |
c09595f6 PZ |
722 | list_for_each_entry_rcu(child, &parent->children, siblings) { |
723 | parent = child; | |
724 | goto down; | |
725 | ||
726 | up: | |
727 | continue; | |
728 | } | |
eb755805 | 729 | ret = (*up)(parent, data); |
8277434e PT |
730 | if (ret || parent == from) |
731 | goto out; | |
c09595f6 PZ |
732 | |
733 | child = parent; | |
734 | parent = parent->parent; | |
735 | if (parent) | |
736 | goto up; | |
8277434e | 737 | out: |
eb755805 | 738 | return ret; |
c09595f6 PZ |
739 | } |
740 | ||
029632fb | 741 | int tg_nop(struct task_group *tg, void *data) |
eb755805 | 742 | { |
e2b245f8 | 743 | return 0; |
eb755805 | 744 | } |
18d95a28 PZ |
745 | #endif |
746 | ||
9059393e | 747 | static void set_load_weight(struct task_struct *p, bool update_load) |
45bf76df | 748 | { |
f05998d4 NR |
749 | int prio = p->static_prio - MAX_RT_PRIO; |
750 | struct load_weight *load = &p->se.load; | |
751 | ||
dd41f596 IM |
752 | /* |
753 | * SCHED_IDLE tasks get minimal weight: | |
754 | */ | |
1da1843f | 755 | if (task_has_idle_policy(p)) { |
c8b28116 | 756 | load->weight = scale_load(WEIGHT_IDLEPRIO); |
f05998d4 | 757 | load->inv_weight = WMULT_IDLEPRIO; |
4a465e3e | 758 | p->se.runnable_weight = load->weight; |
dd41f596 IM |
759 | return; |
760 | } | |
71f8bd46 | 761 | |
9059393e VG |
762 | /* |
763 | * SCHED_OTHER tasks have to update their load when changing their | |
764 | * weight | |
765 | */ | |
766 | if (update_load && p->sched_class == &fair_sched_class) { | |
767 | reweight_task(p, prio); | |
768 | } else { | |
769 | load->weight = scale_load(sched_prio_to_weight[prio]); | |
770 | load->inv_weight = sched_prio_to_wmult[prio]; | |
4a465e3e | 771 | p->se.runnable_weight = load->weight; |
9059393e | 772 | } |
71f8bd46 IM |
773 | } |
774 | ||
69842cba | 775 | #ifdef CONFIG_UCLAMP_TASK |
2480c093 PB |
776 | /* |
777 | * Serializes updates of utilization clamp values | |
778 | * | |
779 | * The (slow-path) user-space triggers utilization clamp value updates which | |
780 | * can require updates on (fast-path) scheduler's data structures used to | |
781 | * support enqueue/dequeue operations. | |
782 | * While the per-CPU rq lock protects fast-path update operations, user-space | |
783 | * requests are serialized using a mutex to reduce the risk of conflicting | |
784 | * updates or API abuses. | |
785 | */ | |
786 | static DEFINE_MUTEX(uclamp_mutex); | |
787 | ||
e8f14172 PB |
788 | /* Max allowed minimum utilization */ |
789 | unsigned int sysctl_sched_uclamp_util_min = SCHED_CAPACITY_SCALE; | |
790 | ||
791 | /* Max allowed maximum utilization */ | |
792 | unsigned int sysctl_sched_uclamp_util_max = SCHED_CAPACITY_SCALE; | |
793 | ||
794 | /* All clamps are required to be less or equal than these values */ | |
795 | static struct uclamp_se uclamp_default[UCLAMP_CNT]; | |
69842cba PB |
796 | |
797 | /* Integer rounded range for each bucket */ | |
798 | #define UCLAMP_BUCKET_DELTA DIV_ROUND_CLOSEST(SCHED_CAPACITY_SCALE, UCLAMP_BUCKETS) | |
799 | ||
800 | #define for_each_clamp_id(clamp_id) \ | |
801 | for ((clamp_id) = 0; (clamp_id) < UCLAMP_CNT; (clamp_id)++) | |
802 | ||
803 | static inline unsigned int uclamp_bucket_id(unsigned int clamp_value) | |
804 | { | |
805 | return clamp_value / UCLAMP_BUCKET_DELTA; | |
806 | } | |
807 | ||
60daf9c1 PB |
808 | static inline unsigned int uclamp_bucket_base_value(unsigned int clamp_value) |
809 | { | |
810 | return UCLAMP_BUCKET_DELTA * uclamp_bucket_id(clamp_value); | |
811 | } | |
812 | ||
0413d7f3 | 813 | static inline enum uclamp_id uclamp_none(enum uclamp_id clamp_id) |
69842cba PB |
814 | { |
815 | if (clamp_id == UCLAMP_MIN) | |
816 | return 0; | |
817 | return SCHED_CAPACITY_SCALE; | |
818 | } | |
819 | ||
a509a7cd PB |
820 | static inline void uclamp_se_set(struct uclamp_se *uc_se, |
821 | unsigned int value, bool user_defined) | |
69842cba PB |
822 | { |
823 | uc_se->value = value; | |
824 | uc_se->bucket_id = uclamp_bucket_id(value); | |
a509a7cd | 825 | uc_se->user_defined = user_defined; |
69842cba PB |
826 | } |
827 | ||
e496187d | 828 | static inline unsigned int |
0413d7f3 | 829 | uclamp_idle_value(struct rq *rq, enum uclamp_id clamp_id, |
e496187d PB |
830 | unsigned int clamp_value) |
831 | { | |
832 | /* | |
833 | * Avoid blocked utilization pushing up the frequency when we go | |
834 | * idle (which drops the max-clamp) by retaining the last known | |
835 | * max-clamp. | |
836 | */ | |
837 | if (clamp_id == UCLAMP_MAX) { | |
838 | rq->uclamp_flags |= UCLAMP_FLAG_IDLE; | |
839 | return clamp_value; | |
840 | } | |
841 | ||
842 | return uclamp_none(UCLAMP_MIN); | |
843 | } | |
844 | ||
0413d7f3 | 845 | static inline void uclamp_idle_reset(struct rq *rq, enum uclamp_id clamp_id, |
e496187d PB |
846 | unsigned int clamp_value) |
847 | { | |
848 | /* Reset max-clamp retention only on idle exit */ | |
849 | if (!(rq->uclamp_flags & UCLAMP_FLAG_IDLE)) | |
850 | return; | |
851 | ||
852 | WRITE_ONCE(rq->uclamp[clamp_id].value, clamp_value); | |
853 | } | |
854 | ||
69842cba | 855 | static inline |
0413d7f3 PB |
856 | enum uclamp_id uclamp_rq_max_value(struct rq *rq, enum uclamp_id clamp_id, |
857 | unsigned int clamp_value) | |
69842cba PB |
858 | { |
859 | struct uclamp_bucket *bucket = rq->uclamp[clamp_id].bucket; | |
860 | int bucket_id = UCLAMP_BUCKETS - 1; | |
861 | ||
862 | /* | |
863 | * Since both min and max clamps are max aggregated, find the | |
864 | * top most bucket with tasks in. | |
865 | */ | |
866 | for ( ; bucket_id >= 0; bucket_id--) { | |
867 | if (!bucket[bucket_id].tasks) | |
868 | continue; | |
869 | return bucket[bucket_id].value; | |
870 | } | |
871 | ||
872 | /* No tasks -- default clamp values */ | |
e496187d | 873 | return uclamp_idle_value(rq, clamp_id, clamp_value); |
69842cba PB |
874 | } |
875 | ||
3eac870a | 876 | static inline struct uclamp_se |
0413d7f3 | 877 | uclamp_tg_restrict(struct task_struct *p, enum uclamp_id clamp_id) |
3eac870a PB |
878 | { |
879 | struct uclamp_se uc_req = p->uclamp_req[clamp_id]; | |
880 | #ifdef CONFIG_UCLAMP_TASK_GROUP | |
881 | struct uclamp_se uc_max; | |
882 | ||
883 | /* | |
884 | * Tasks in autogroups or root task group will be | |
885 | * restricted by system defaults. | |
886 | */ | |
887 | if (task_group_is_autogroup(task_group(p))) | |
888 | return uc_req; | |
889 | if (task_group(p) == &root_task_group) | |
890 | return uc_req; | |
891 | ||
892 | uc_max = task_group(p)->uclamp[clamp_id]; | |
893 | if (uc_req.value > uc_max.value || !uc_req.user_defined) | |
894 | return uc_max; | |
895 | #endif | |
896 | ||
897 | return uc_req; | |
898 | } | |
899 | ||
e8f14172 PB |
900 | /* |
901 | * The effective clamp bucket index of a task depends on, by increasing | |
902 | * priority: | |
903 | * - the task specific clamp value, when explicitly requested from userspace | |
3eac870a PB |
904 | * - the task group effective clamp value, for tasks not either in the root |
905 | * group or in an autogroup | |
e8f14172 PB |
906 | * - the system default clamp value, defined by the sysadmin |
907 | */ | |
908 | static inline struct uclamp_se | |
0413d7f3 | 909 | uclamp_eff_get(struct task_struct *p, enum uclamp_id clamp_id) |
e8f14172 | 910 | { |
3eac870a | 911 | struct uclamp_se uc_req = uclamp_tg_restrict(p, clamp_id); |
e8f14172 PB |
912 | struct uclamp_se uc_max = uclamp_default[clamp_id]; |
913 | ||
914 | /* System default restrictions always apply */ | |
915 | if (unlikely(uc_req.value > uc_max.value)) | |
916 | return uc_max; | |
917 | ||
918 | return uc_req; | |
919 | } | |
920 | ||
0413d7f3 | 921 | enum uclamp_id uclamp_eff_value(struct task_struct *p, enum uclamp_id clamp_id) |
9d20ad7d PB |
922 | { |
923 | struct uclamp_se uc_eff; | |
924 | ||
925 | /* Task currently refcounted: use back-annotated (effective) value */ | |
926 | if (p->uclamp[clamp_id].active) | |
927 | return p->uclamp[clamp_id].value; | |
928 | ||
929 | uc_eff = uclamp_eff_get(p, clamp_id); | |
930 | ||
931 | return uc_eff.value; | |
932 | } | |
933 | ||
69842cba PB |
934 | /* |
935 | * When a task is enqueued on a rq, the clamp bucket currently defined by the | |
936 | * task's uclamp::bucket_id is refcounted on that rq. This also immediately | |
937 | * updates the rq's clamp value if required. | |
60daf9c1 PB |
938 | * |
939 | * Tasks can have a task-specific value requested from user-space, track | |
940 | * within each bucket the maximum value for tasks refcounted in it. | |
941 | * This "local max aggregation" allows to track the exact "requested" value | |
942 | * for each bucket when all its RUNNABLE tasks require the same clamp. | |
69842cba PB |
943 | */ |
944 | static inline void uclamp_rq_inc_id(struct rq *rq, struct task_struct *p, | |
0413d7f3 | 945 | enum uclamp_id clamp_id) |
69842cba PB |
946 | { |
947 | struct uclamp_rq *uc_rq = &rq->uclamp[clamp_id]; | |
948 | struct uclamp_se *uc_se = &p->uclamp[clamp_id]; | |
949 | struct uclamp_bucket *bucket; | |
950 | ||
951 | lockdep_assert_held(&rq->lock); | |
952 | ||
e8f14172 PB |
953 | /* Update task effective clamp */ |
954 | p->uclamp[clamp_id] = uclamp_eff_get(p, clamp_id); | |
955 | ||
69842cba PB |
956 | bucket = &uc_rq->bucket[uc_se->bucket_id]; |
957 | bucket->tasks++; | |
e8f14172 | 958 | uc_se->active = true; |
69842cba | 959 | |
e496187d PB |
960 | uclamp_idle_reset(rq, clamp_id, uc_se->value); |
961 | ||
60daf9c1 PB |
962 | /* |
963 | * Local max aggregation: rq buckets always track the max | |
964 | * "requested" clamp value of its RUNNABLE tasks. | |
965 | */ | |
966 | if (bucket->tasks == 1 || uc_se->value > bucket->value) | |
967 | bucket->value = uc_se->value; | |
968 | ||
69842cba | 969 | if (uc_se->value > READ_ONCE(uc_rq->value)) |
60daf9c1 | 970 | WRITE_ONCE(uc_rq->value, uc_se->value); |
69842cba PB |
971 | } |
972 | ||
973 | /* | |
974 | * When a task is dequeued from a rq, the clamp bucket refcounted by the task | |
975 | * is released. If this is the last task reference counting the rq's max | |
976 | * active clamp value, then the rq's clamp value is updated. | |
977 | * | |
978 | * Both refcounted tasks and rq's cached clamp values are expected to be | |
979 | * always valid. If it's detected they are not, as defensive programming, | |
980 | * enforce the expected state and warn. | |
981 | */ | |
982 | static inline void uclamp_rq_dec_id(struct rq *rq, struct task_struct *p, | |
0413d7f3 | 983 | enum uclamp_id clamp_id) |
69842cba PB |
984 | { |
985 | struct uclamp_rq *uc_rq = &rq->uclamp[clamp_id]; | |
986 | struct uclamp_se *uc_se = &p->uclamp[clamp_id]; | |
987 | struct uclamp_bucket *bucket; | |
e496187d | 988 | unsigned int bkt_clamp; |
69842cba PB |
989 | unsigned int rq_clamp; |
990 | ||
991 | lockdep_assert_held(&rq->lock); | |
992 | ||
993 | bucket = &uc_rq->bucket[uc_se->bucket_id]; | |
994 | SCHED_WARN_ON(!bucket->tasks); | |
995 | if (likely(bucket->tasks)) | |
996 | bucket->tasks--; | |
e8f14172 | 997 | uc_se->active = false; |
69842cba | 998 | |
60daf9c1 PB |
999 | /* |
1000 | * Keep "local max aggregation" simple and accept to (possibly) | |
1001 | * overboost some RUNNABLE tasks in the same bucket. | |
1002 | * The rq clamp bucket value is reset to its base value whenever | |
1003 | * there are no more RUNNABLE tasks refcounting it. | |
1004 | */ | |
69842cba PB |
1005 | if (likely(bucket->tasks)) |
1006 | return; | |
1007 | ||
1008 | rq_clamp = READ_ONCE(uc_rq->value); | |
1009 | /* | |
1010 | * Defensive programming: this should never happen. If it happens, | |
1011 | * e.g. due to future modification, warn and fixup the expected value. | |
1012 | */ | |
1013 | SCHED_WARN_ON(bucket->value > rq_clamp); | |
e496187d PB |
1014 | if (bucket->value >= rq_clamp) { |
1015 | bkt_clamp = uclamp_rq_max_value(rq, clamp_id, uc_se->value); | |
1016 | WRITE_ONCE(uc_rq->value, bkt_clamp); | |
1017 | } | |
69842cba PB |
1018 | } |
1019 | ||
1020 | static inline void uclamp_rq_inc(struct rq *rq, struct task_struct *p) | |
1021 | { | |
0413d7f3 | 1022 | enum uclamp_id clamp_id; |
69842cba PB |
1023 | |
1024 | if (unlikely(!p->sched_class->uclamp_enabled)) | |
1025 | return; | |
1026 | ||
1027 | for_each_clamp_id(clamp_id) | |
1028 | uclamp_rq_inc_id(rq, p, clamp_id); | |
e496187d PB |
1029 | |
1030 | /* Reset clamp idle holding when there is one RUNNABLE task */ | |
1031 | if (rq->uclamp_flags & UCLAMP_FLAG_IDLE) | |
1032 | rq->uclamp_flags &= ~UCLAMP_FLAG_IDLE; | |
69842cba PB |
1033 | } |
1034 | ||
1035 | static inline void uclamp_rq_dec(struct rq *rq, struct task_struct *p) | |
1036 | { | |
0413d7f3 | 1037 | enum uclamp_id clamp_id; |
69842cba PB |
1038 | |
1039 | if (unlikely(!p->sched_class->uclamp_enabled)) | |
1040 | return; | |
1041 | ||
1042 | for_each_clamp_id(clamp_id) | |
1043 | uclamp_rq_dec_id(rq, p, clamp_id); | |
1044 | } | |
1045 | ||
babbe170 | 1046 | static inline void |
0413d7f3 | 1047 | uclamp_update_active(struct task_struct *p, enum uclamp_id clamp_id) |
babbe170 PB |
1048 | { |
1049 | struct rq_flags rf; | |
1050 | struct rq *rq; | |
1051 | ||
1052 | /* | |
1053 | * Lock the task and the rq where the task is (or was) queued. | |
1054 | * | |
1055 | * We might lock the (previous) rq of a !RUNNABLE task, but that's the | |
1056 | * price to pay to safely serialize util_{min,max} updates with | |
1057 | * enqueues, dequeues and migration operations. | |
1058 | * This is the same locking schema used by __set_cpus_allowed_ptr(). | |
1059 | */ | |
1060 | rq = task_rq_lock(p, &rf); | |
1061 | ||
1062 | /* | |
1063 | * Setting the clamp bucket is serialized by task_rq_lock(). | |
1064 | * If the task is not yet RUNNABLE and its task_struct is not | |
1065 | * affecting a valid clamp bucket, the next time it's enqueued, | |
1066 | * it will already see the updated clamp bucket value. | |
1067 | */ | |
1068 | if (!p->uclamp[clamp_id].active) { | |
1069 | uclamp_rq_dec_id(rq, p, clamp_id); | |
1070 | uclamp_rq_inc_id(rq, p, clamp_id); | |
1071 | } | |
1072 | ||
1073 | task_rq_unlock(rq, p, &rf); | |
1074 | } | |
1075 | ||
1076 | static inline void | |
1077 | uclamp_update_active_tasks(struct cgroup_subsys_state *css, | |
1078 | unsigned int clamps) | |
1079 | { | |
0413d7f3 | 1080 | enum uclamp_id clamp_id; |
babbe170 PB |
1081 | struct css_task_iter it; |
1082 | struct task_struct *p; | |
babbe170 PB |
1083 | |
1084 | css_task_iter_start(css, 0, &it); | |
1085 | while ((p = css_task_iter_next(&it))) { | |
1086 | for_each_clamp_id(clamp_id) { | |
1087 | if ((0x1 << clamp_id) & clamps) | |
1088 | uclamp_update_active(p, clamp_id); | |
1089 | } | |
1090 | } | |
1091 | css_task_iter_end(&it); | |
1092 | } | |
1093 | ||
7274a5c1 PB |
1094 | #ifdef CONFIG_UCLAMP_TASK_GROUP |
1095 | static void cpu_util_update_eff(struct cgroup_subsys_state *css); | |
1096 | static void uclamp_update_root_tg(void) | |
1097 | { | |
1098 | struct task_group *tg = &root_task_group; | |
1099 | ||
1100 | uclamp_se_set(&tg->uclamp_req[UCLAMP_MIN], | |
1101 | sysctl_sched_uclamp_util_min, false); | |
1102 | uclamp_se_set(&tg->uclamp_req[UCLAMP_MAX], | |
1103 | sysctl_sched_uclamp_util_max, false); | |
1104 | ||
1105 | rcu_read_lock(); | |
1106 | cpu_util_update_eff(&root_task_group.css); | |
1107 | rcu_read_unlock(); | |
1108 | } | |
1109 | #else | |
1110 | static void uclamp_update_root_tg(void) { } | |
1111 | #endif | |
1112 | ||
e8f14172 PB |
1113 | int sysctl_sched_uclamp_handler(struct ctl_table *table, int write, |
1114 | void __user *buffer, size_t *lenp, | |
1115 | loff_t *ppos) | |
1116 | { | |
7274a5c1 | 1117 | bool update_root_tg = false; |
e8f14172 | 1118 | int old_min, old_max; |
e8f14172 PB |
1119 | int result; |
1120 | ||
2480c093 | 1121 | mutex_lock(&uclamp_mutex); |
e8f14172 PB |
1122 | old_min = sysctl_sched_uclamp_util_min; |
1123 | old_max = sysctl_sched_uclamp_util_max; | |
1124 | ||
1125 | result = proc_dointvec(table, write, buffer, lenp, ppos); | |
1126 | if (result) | |
1127 | goto undo; | |
1128 | if (!write) | |
1129 | goto done; | |
1130 | ||
1131 | if (sysctl_sched_uclamp_util_min > sysctl_sched_uclamp_util_max || | |
1132 | sysctl_sched_uclamp_util_max > SCHED_CAPACITY_SCALE) { | |
1133 | result = -EINVAL; | |
1134 | goto undo; | |
1135 | } | |
1136 | ||
1137 | if (old_min != sysctl_sched_uclamp_util_min) { | |
1138 | uclamp_se_set(&uclamp_default[UCLAMP_MIN], | |
a509a7cd | 1139 | sysctl_sched_uclamp_util_min, false); |
7274a5c1 | 1140 | update_root_tg = true; |
e8f14172 PB |
1141 | } |
1142 | if (old_max != sysctl_sched_uclamp_util_max) { | |
1143 | uclamp_se_set(&uclamp_default[UCLAMP_MAX], | |
a509a7cd | 1144 | sysctl_sched_uclamp_util_max, false); |
7274a5c1 | 1145 | update_root_tg = true; |
e8f14172 PB |
1146 | } |
1147 | ||
7274a5c1 PB |
1148 | if (update_root_tg) |
1149 | uclamp_update_root_tg(); | |
1150 | ||
e8f14172 | 1151 | /* |
7274a5c1 PB |
1152 | * We update all RUNNABLE tasks only when task groups are in use. |
1153 | * Otherwise, keep it simple and do just a lazy update at each next | |
1154 | * task enqueue time. | |
e8f14172 | 1155 | */ |
7274a5c1 | 1156 | |
e8f14172 PB |
1157 | goto done; |
1158 | ||
1159 | undo: | |
1160 | sysctl_sched_uclamp_util_min = old_min; | |
1161 | sysctl_sched_uclamp_util_max = old_max; | |
1162 | done: | |
2480c093 | 1163 | mutex_unlock(&uclamp_mutex); |
e8f14172 PB |
1164 | |
1165 | return result; | |
1166 | } | |
1167 | ||
a509a7cd PB |
1168 | static int uclamp_validate(struct task_struct *p, |
1169 | const struct sched_attr *attr) | |
1170 | { | |
1171 | unsigned int lower_bound = p->uclamp_req[UCLAMP_MIN].value; | |
1172 | unsigned int upper_bound = p->uclamp_req[UCLAMP_MAX].value; | |
1173 | ||
1174 | if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MIN) | |
1175 | lower_bound = attr->sched_util_min; | |
1176 | if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MAX) | |
1177 | upper_bound = attr->sched_util_max; | |
1178 | ||
1179 | if (lower_bound > upper_bound) | |
1180 | return -EINVAL; | |
1181 | if (upper_bound > SCHED_CAPACITY_SCALE) | |
1182 | return -EINVAL; | |
1183 | ||
1184 | return 0; | |
1185 | } | |
1186 | ||
1187 | static void __setscheduler_uclamp(struct task_struct *p, | |
1188 | const struct sched_attr *attr) | |
1189 | { | |
0413d7f3 | 1190 | enum uclamp_id clamp_id; |
1a00d999 PB |
1191 | |
1192 | /* | |
1193 | * On scheduling class change, reset to default clamps for tasks | |
1194 | * without a task-specific value. | |
1195 | */ | |
1196 | for_each_clamp_id(clamp_id) { | |
1197 | struct uclamp_se *uc_se = &p->uclamp_req[clamp_id]; | |
1198 | unsigned int clamp_value = uclamp_none(clamp_id); | |
1199 | ||
1200 | /* Keep using defined clamps across class changes */ | |
1201 | if (uc_se->user_defined) | |
1202 | continue; | |
1203 | ||
1204 | /* By default, RT tasks always get 100% boost */ | |
1205 | if (unlikely(rt_task(p) && clamp_id == UCLAMP_MIN)) | |
1206 | clamp_value = uclamp_none(UCLAMP_MAX); | |
1207 | ||
1208 | uclamp_se_set(uc_se, clamp_value, false); | |
1209 | } | |
1210 | ||
a509a7cd PB |
1211 | if (likely(!(attr->sched_flags & SCHED_FLAG_UTIL_CLAMP))) |
1212 | return; | |
1213 | ||
1214 | if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MIN) { | |
1215 | uclamp_se_set(&p->uclamp_req[UCLAMP_MIN], | |
1216 | attr->sched_util_min, true); | |
1217 | } | |
1218 | ||
1219 | if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP_MAX) { | |
1220 | uclamp_se_set(&p->uclamp_req[UCLAMP_MAX], | |
1221 | attr->sched_util_max, true); | |
1222 | } | |
1223 | } | |
1224 | ||
e8f14172 PB |
1225 | static void uclamp_fork(struct task_struct *p) |
1226 | { | |
0413d7f3 | 1227 | enum uclamp_id clamp_id; |
e8f14172 PB |
1228 | |
1229 | for_each_clamp_id(clamp_id) | |
1230 | p->uclamp[clamp_id].active = false; | |
a87498ac PB |
1231 | |
1232 | if (likely(!p->sched_reset_on_fork)) | |
1233 | return; | |
1234 | ||
1235 | for_each_clamp_id(clamp_id) { | |
1a00d999 PB |
1236 | unsigned int clamp_value = uclamp_none(clamp_id); |
1237 | ||
1238 | /* By default, RT tasks always get 100% boost */ | |
1239 | if (unlikely(rt_task(p) && clamp_id == UCLAMP_MIN)) | |
1240 | clamp_value = uclamp_none(UCLAMP_MAX); | |
1241 | ||
1242 | uclamp_se_set(&p->uclamp_req[clamp_id], clamp_value, false); | |
a87498ac | 1243 | } |
e8f14172 PB |
1244 | } |
1245 | ||
69842cba PB |
1246 | static void __init init_uclamp(void) |
1247 | { | |
e8f14172 | 1248 | struct uclamp_se uc_max = {}; |
0413d7f3 | 1249 | enum uclamp_id clamp_id; |
69842cba PB |
1250 | int cpu; |
1251 | ||
2480c093 PB |
1252 | mutex_init(&uclamp_mutex); |
1253 | ||
e496187d | 1254 | for_each_possible_cpu(cpu) { |
69842cba | 1255 | memset(&cpu_rq(cpu)->uclamp, 0, sizeof(struct uclamp_rq)); |
e496187d PB |
1256 | cpu_rq(cpu)->uclamp_flags = 0; |
1257 | } | |
69842cba | 1258 | |
69842cba | 1259 | for_each_clamp_id(clamp_id) { |
e8f14172 | 1260 | uclamp_se_set(&init_task.uclamp_req[clamp_id], |
a509a7cd | 1261 | uclamp_none(clamp_id), false); |
69842cba | 1262 | } |
e8f14172 PB |
1263 | |
1264 | /* System defaults allow max clamp values for both indexes */ | |
a509a7cd | 1265 | uclamp_se_set(&uc_max, uclamp_none(UCLAMP_MAX), false); |
2480c093 | 1266 | for_each_clamp_id(clamp_id) { |
e8f14172 | 1267 | uclamp_default[clamp_id] = uc_max; |
2480c093 PB |
1268 | #ifdef CONFIG_UCLAMP_TASK_GROUP |
1269 | root_task_group.uclamp_req[clamp_id] = uc_max; | |
0b60ba2d | 1270 | root_task_group.uclamp[clamp_id] = uc_max; |
2480c093 PB |
1271 | #endif |
1272 | } | |
69842cba PB |
1273 | } |
1274 | ||
1275 | #else /* CONFIG_UCLAMP_TASK */ | |
1276 | static inline void uclamp_rq_inc(struct rq *rq, struct task_struct *p) { } | |
1277 | static inline void uclamp_rq_dec(struct rq *rq, struct task_struct *p) { } | |
a509a7cd PB |
1278 | static inline int uclamp_validate(struct task_struct *p, |
1279 | const struct sched_attr *attr) | |
1280 | { | |
1281 | return -EOPNOTSUPP; | |
1282 | } | |
1283 | static void __setscheduler_uclamp(struct task_struct *p, | |
1284 | const struct sched_attr *attr) { } | |
e8f14172 | 1285 | static inline void uclamp_fork(struct task_struct *p) { } |
69842cba PB |
1286 | static inline void init_uclamp(void) { } |
1287 | #endif /* CONFIG_UCLAMP_TASK */ | |
1288 | ||
1de64443 | 1289 | static inline void enqueue_task(struct rq *rq, struct task_struct *p, int flags) |
2087a1ad | 1290 | { |
0a67d1ee PZ |
1291 | if (!(flags & ENQUEUE_NOCLOCK)) |
1292 | update_rq_clock(rq); | |
1293 | ||
eb414681 | 1294 | if (!(flags & ENQUEUE_RESTORE)) { |
1de64443 | 1295 | sched_info_queued(rq, p); |
eb414681 JW |
1296 | psi_enqueue(p, flags & ENQUEUE_WAKEUP); |
1297 | } | |
0a67d1ee | 1298 | |
69842cba | 1299 | uclamp_rq_inc(rq, p); |
371fd7e7 | 1300 | p->sched_class->enqueue_task(rq, p, flags); |
71f8bd46 IM |
1301 | } |
1302 | ||
1de64443 | 1303 | static inline void dequeue_task(struct rq *rq, struct task_struct *p, int flags) |
71f8bd46 | 1304 | { |
0a67d1ee PZ |
1305 | if (!(flags & DEQUEUE_NOCLOCK)) |
1306 | update_rq_clock(rq); | |
1307 | ||
eb414681 | 1308 | if (!(flags & DEQUEUE_SAVE)) { |
1de64443 | 1309 | sched_info_dequeued(rq, p); |
eb414681 JW |
1310 | psi_dequeue(p, flags & DEQUEUE_SLEEP); |
1311 | } | |
0a67d1ee | 1312 | |
69842cba | 1313 | uclamp_rq_dec(rq, p); |
371fd7e7 | 1314 | p->sched_class->dequeue_task(rq, p, flags); |
71f8bd46 IM |
1315 | } |
1316 | ||
029632fb | 1317 | void activate_task(struct rq *rq, struct task_struct *p, int flags) |
1e3c88bd PZ |
1318 | { |
1319 | if (task_contributes_to_load(p)) | |
1320 | rq->nr_uninterruptible--; | |
1321 | ||
371fd7e7 | 1322 | enqueue_task(rq, p, flags); |
7dd77884 PZ |
1323 | |
1324 | p->on_rq = TASK_ON_RQ_QUEUED; | |
1e3c88bd PZ |
1325 | } |
1326 | ||
029632fb | 1327 | void deactivate_task(struct rq *rq, struct task_struct *p, int flags) |
1e3c88bd | 1328 | { |
7dd77884 PZ |
1329 | p->on_rq = (flags & DEQUEUE_SLEEP) ? 0 : TASK_ON_RQ_MIGRATING; |
1330 | ||
1e3c88bd PZ |
1331 | if (task_contributes_to_load(p)) |
1332 | rq->nr_uninterruptible++; | |
1333 | ||
371fd7e7 | 1334 | dequeue_task(rq, p, flags); |
1e3c88bd PZ |
1335 | } |
1336 | ||
14531189 | 1337 | /* |
dd41f596 | 1338 | * __normal_prio - return the priority that is based on the static prio |
14531189 | 1339 | */ |
14531189 IM |
1340 | static inline int __normal_prio(struct task_struct *p) |
1341 | { | |
dd41f596 | 1342 | return p->static_prio; |
14531189 IM |
1343 | } |
1344 | ||
b29739f9 IM |
1345 | /* |
1346 | * Calculate the expected normal priority: i.e. priority | |
1347 | * without taking RT-inheritance into account. Might be | |
1348 | * boosted by interactivity modifiers. Changes upon fork, | |
1349 | * setprio syscalls, and whenever the interactivity | |
1350 | * estimator recalculates. | |
1351 | */ | |
36c8b586 | 1352 | static inline int normal_prio(struct task_struct *p) |
b29739f9 IM |
1353 | { |
1354 | int prio; | |
1355 | ||
aab03e05 DF |
1356 | if (task_has_dl_policy(p)) |
1357 | prio = MAX_DL_PRIO-1; | |
1358 | else if (task_has_rt_policy(p)) | |
b29739f9 IM |
1359 | prio = MAX_RT_PRIO-1 - p->rt_priority; |
1360 | else | |
1361 | prio = __normal_prio(p); | |
1362 | return prio; | |
1363 | } | |
1364 | ||
1365 | /* | |
1366 | * Calculate the current priority, i.e. the priority | |
1367 | * taken into account by the scheduler. This value might | |
1368 | * be boosted by RT tasks, or might be boosted by | |
1369 | * interactivity modifiers. Will be RT if the task got | |
1370 | * RT-boosted. If not then it returns p->normal_prio. | |
1371 | */ | |
36c8b586 | 1372 | static int effective_prio(struct task_struct *p) |
b29739f9 IM |
1373 | { |
1374 | p->normal_prio = normal_prio(p); | |
1375 | /* | |
1376 | * If we are RT tasks or we were boosted to RT priority, | |
1377 | * keep the priority unchanged. Otherwise, update priority | |
1378 | * to the normal priority: | |
1379 | */ | |
1380 | if (!rt_prio(p->prio)) | |
1381 | return p->normal_prio; | |
1382 | return p->prio; | |
1383 | } | |
1384 | ||
1da177e4 LT |
1385 | /** |
1386 | * task_curr - is this task currently executing on a CPU? | |
1387 | * @p: the task in question. | |
e69f6186 YB |
1388 | * |
1389 | * Return: 1 if the task is currently executing. 0 otherwise. | |
1da177e4 | 1390 | */ |
36c8b586 | 1391 | inline int task_curr(const struct task_struct *p) |
1da177e4 LT |
1392 | { |
1393 | return cpu_curr(task_cpu(p)) == p; | |
1394 | } | |
1395 | ||
67dfa1b7 | 1396 | /* |
4c9a4bc8 PZ |
1397 | * switched_from, switched_to and prio_changed must _NOT_ drop rq->lock, |
1398 | * use the balance_callback list if you want balancing. | |
1399 | * | |
1400 | * this means any call to check_class_changed() must be followed by a call to | |
1401 | * balance_callback(). | |
67dfa1b7 | 1402 | */ |
cb469845 SR |
1403 | static inline void check_class_changed(struct rq *rq, struct task_struct *p, |
1404 | const struct sched_class *prev_class, | |
da7a735e | 1405 | int oldprio) |
cb469845 SR |
1406 | { |
1407 | if (prev_class != p->sched_class) { | |
1408 | if (prev_class->switched_from) | |
da7a735e | 1409 | prev_class->switched_from(rq, p); |
4c9a4bc8 | 1410 | |
da7a735e | 1411 | p->sched_class->switched_to(rq, p); |
2d3d891d | 1412 | } else if (oldprio != p->prio || dl_task(p)) |
da7a735e | 1413 | p->sched_class->prio_changed(rq, p, oldprio); |
cb469845 SR |
1414 | } |
1415 | ||
029632fb | 1416 | void check_preempt_curr(struct rq *rq, struct task_struct *p, int flags) |
1e5a7405 PZ |
1417 | { |
1418 | const struct sched_class *class; | |
1419 | ||
1420 | if (p->sched_class == rq->curr->sched_class) { | |
1421 | rq->curr->sched_class->check_preempt_curr(rq, p, flags); | |
1422 | } else { | |
1423 | for_each_class(class) { | |
1424 | if (class == rq->curr->sched_class) | |
1425 | break; | |
1426 | if (class == p->sched_class) { | |
8875125e | 1427 | resched_curr(rq); |
1e5a7405 PZ |
1428 | break; |
1429 | } | |
1430 | } | |
1431 | } | |
1432 | ||
1433 | /* | |
1434 | * A queue event has occurred, and we're going to schedule. In | |
1435 | * this case, we can save a useless back to back clock update. | |
1436 | */ | |
da0c1e65 | 1437 | if (task_on_rq_queued(rq->curr) && test_tsk_need_resched(rq->curr)) |
adcc8da8 | 1438 | rq_clock_skip_update(rq); |
1e5a7405 PZ |
1439 | } |
1440 | ||
1da177e4 | 1441 | #ifdef CONFIG_SMP |
175f0e25 PZ |
1442 | |
1443 | static inline bool is_per_cpu_kthread(struct task_struct *p) | |
1444 | { | |
1445 | if (!(p->flags & PF_KTHREAD)) | |
1446 | return false; | |
1447 | ||
1448 | if (p->nr_cpus_allowed != 1) | |
1449 | return false; | |
1450 | ||
1451 | return true; | |
1452 | } | |
1453 | ||
1454 | /* | |
bee98539 | 1455 | * Per-CPU kthreads are allowed to run on !active && online CPUs, see |
175f0e25 PZ |
1456 | * __set_cpus_allowed_ptr() and select_fallback_rq(). |
1457 | */ | |
1458 | static inline bool is_cpu_allowed(struct task_struct *p, int cpu) | |
1459 | { | |
3bd37062 | 1460 | if (!cpumask_test_cpu(cpu, p->cpus_ptr)) |
175f0e25 PZ |
1461 | return false; |
1462 | ||
1463 | if (is_per_cpu_kthread(p)) | |
1464 | return cpu_online(cpu); | |
1465 | ||
1466 | return cpu_active(cpu); | |
1467 | } | |
1468 | ||
5cc389bc PZ |
1469 | /* |
1470 | * This is how migration works: | |
1471 | * | |
1472 | * 1) we invoke migration_cpu_stop() on the target CPU using | |
1473 | * stop_one_cpu(). | |
1474 | * 2) stopper starts to run (implicitly forcing the migrated thread | |
1475 | * off the CPU) | |
1476 | * 3) it checks whether the migrated task is still in the wrong runqueue. | |
1477 | * 4) if it's in the wrong runqueue then the migration thread removes | |
1478 | * it and puts it into the right queue. | |
1479 | * 5) stopper completes and stop_one_cpu() returns and the migration | |
1480 | * is done. | |
1481 | */ | |
1482 | ||
1483 | /* | |
1484 | * move_queued_task - move a queued task to new rq. | |
1485 | * | |
1486 | * Returns (locked) new rq. Old rq's lock is released. | |
1487 | */ | |
8a8c69c3 PZ |
1488 | static struct rq *move_queued_task(struct rq *rq, struct rq_flags *rf, |
1489 | struct task_struct *p, int new_cpu) | |
5cc389bc | 1490 | { |
5cc389bc PZ |
1491 | lockdep_assert_held(&rq->lock); |
1492 | ||
c546951d | 1493 | WRITE_ONCE(p->on_rq, TASK_ON_RQ_MIGRATING); |
15ff991e | 1494 | dequeue_task(rq, p, DEQUEUE_NOCLOCK); |
5cc389bc | 1495 | set_task_cpu(p, new_cpu); |
8a8c69c3 | 1496 | rq_unlock(rq, rf); |
5cc389bc PZ |
1497 | |
1498 | rq = cpu_rq(new_cpu); | |
1499 | ||
8a8c69c3 | 1500 | rq_lock(rq, rf); |
5cc389bc | 1501 | BUG_ON(task_cpu(p) != new_cpu); |
5cc389bc | 1502 | enqueue_task(rq, p, 0); |
3ea94de1 | 1503 | p->on_rq = TASK_ON_RQ_QUEUED; |
5cc389bc PZ |
1504 | check_preempt_curr(rq, p, 0); |
1505 | ||
1506 | return rq; | |
1507 | } | |
1508 | ||
1509 | struct migration_arg { | |
1510 | struct task_struct *task; | |
1511 | int dest_cpu; | |
1512 | }; | |
1513 | ||
1514 | /* | |
d1ccc66d | 1515 | * Move (not current) task off this CPU, onto the destination CPU. We're doing |
5cc389bc PZ |
1516 | * this because either it can't run here any more (set_cpus_allowed() |
1517 | * away from this CPU, or CPU going down), or because we're | |
1518 | * attempting to rebalance this task on exec (sched_exec). | |
1519 | * | |
1520 | * So we race with normal scheduler movements, but that's OK, as long | |
1521 | * as the task is no longer on this CPU. | |
5cc389bc | 1522 | */ |
8a8c69c3 PZ |
1523 | static struct rq *__migrate_task(struct rq *rq, struct rq_flags *rf, |
1524 | struct task_struct *p, int dest_cpu) | |
5cc389bc | 1525 | { |
5cc389bc | 1526 | /* Affinity changed (again). */ |
175f0e25 | 1527 | if (!is_cpu_allowed(p, dest_cpu)) |
5e16bbc2 | 1528 | return rq; |
5cc389bc | 1529 | |
15ff991e | 1530 | update_rq_clock(rq); |
8a8c69c3 | 1531 | rq = move_queued_task(rq, rf, p, dest_cpu); |
5e16bbc2 PZ |
1532 | |
1533 | return rq; | |
5cc389bc PZ |
1534 | } |
1535 | ||
1536 | /* | |
1537 | * migration_cpu_stop - this will be executed by a highprio stopper thread | |
1538 | * and performs thread migration by bumping thread off CPU then | |
1539 | * 'pushing' onto another runqueue. | |
1540 | */ | |
1541 | static int migration_cpu_stop(void *data) | |
1542 | { | |
1543 | struct migration_arg *arg = data; | |
5e16bbc2 PZ |
1544 | struct task_struct *p = arg->task; |
1545 | struct rq *rq = this_rq(); | |
8a8c69c3 | 1546 | struct rq_flags rf; |
5cc389bc PZ |
1547 | |
1548 | /* | |
d1ccc66d IM |
1549 | * The original target CPU might have gone down and we might |
1550 | * be on another CPU but it doesn't matter. | |
5cc389bc PZ |
1551 | */ |
1552 | local_irq_disable(); | |
1553 | /* | |
1554 | * We need to explicitly wake pending tasks before running | |
3bd37062 | 1555 | * __migrate_task() such that we will not miss enforcing cpus_ptr |
5cc389bc PZ |
1556 | * during wakeups, see set_cpus_allowed_ptr()'s TASK_WAKING test. |
1557 | */ | |
1558 | sched_ttwu_pending(); | |
5e16bbc2 PZ |
1559 | |
1560 | raw_spin_lock(&p->pi_lock); | |
8a8c69c3 | 1561 | rq_lock(rq, &rf); |
5e16bbc2 PZ |
1562 | /* |
1563 | * If task_rq(p) != rq, it cannot be migrated here, because we're | |
1564 | * holding rq->lock, if p->on_rq == 0 it cannot get enqueued because | |
1565 | * we're holding p->pi_lock. | |
1566 | */ | |
bf89a304 CC |
1567 | if (task_rq(p) == rq) { |
1568 | if (task_on_rq_queued(p)) | |
8a8c69c3 | 1569 | rq = __migrate_task(rq, &rf, p, arg->dest_cpu); |
bf89a304 CC |
1570 | else |
1571 | p->wake_cpu = arg->dest_cpu; | |
1572 | } | |
8a8c69c3 | 1573 | rq_unlock(rq, &rf); |
5e16bbc2 PZ |
1574 | raw_spin_unlock(&p->pi_lock); |
1575 | ||
5cc389bc PZ |
1576 | local_irq_enable(); |
1577 | return 0; | |
1578 | } | |
1579 | ||
c5b28038 PZ |
1580 | /* |
1581 | * sched_class::set_cpus_allowed must do the below, but is not required to | |
1582 | * actually call this function. | |
1583 | */ | |
1584 | void set_cpus_allowed_common(struct task_struct *p, const struct cpumask *new_mask) | |
5cc389bc | 1585 | { |
3bd37062 | 1586 | cpumask_copy(&p->cpus_mask, new_mask); |
5cc389bc PZ |
1587 | p->nr_cpus_allowed = cpumask_weight(new_mask); |
1588 | } | |
1589 | ||
c5b28038 PZ |
1590 | void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask) |
1591 | { | |
6c37067e PZ |
1592 | struct rq *rq = task_rq(p); |
1593 | bool queued, running; | |
1594 | ||
c5b28038 | 1595 | lockdep_assert_held(&p->pi_lock); |
6c37067e PZ |
1596 | |
1597 | queued = task_on_rq_queued(p); | |
1598 | running = task_current(rq, p); | |
1599 | ||
1600 | if (queued) { | |
1601 | /* | |
1602 | * Because __kthread_bind() calls this on blocked tasks without | |
1603 | * holding rq->lock. | |
1604 | */ | |
1605 | lockdep_assert_held(&rq->lock); | |
7a57f32a | 1606 | dequeue_task(rq, p, DEQUEUE_SAVE | DEQUEUE_NOCLOCK); |
6c37067e PZ |
1607 | } |
1608 | if (running) | |
1609 | put_prev_task(rq, p); | |
1610 | ||
c5b28038 | 1611 | p->sched_class->set_cpus_allowed(p, new_mask); |
6c37067e | 1612 | |
6c37067e | 1613 | if (queued) |
7134b3e9 | 1614 | enqueue_task(rq, p, ENQUEUE_RESTORE | ENQUEUE_NOCLOCK); |
a399d233 | 1615 | if (running) |
03b7fad1 | 1616 | set_next_task(rq, p); |
c5b28038 PZ |
1617 | } |
1618 | ||
5cc389bc PZ |
1619 | /* |
1620 | * Change a given task's CPU affinity. Migrate the thread to a | |
1621 | * proper CPU and schedule it away if the CPU it's executing on | |
1622 | * is removed from the allowed bitmask. | |
1623 | * | |
1624 | * NOTE: the caller must have a valid reference to the task, the | |
1625 | * task must not exit() & deallocate itself prematurely. The | |
1626 | * call is not atomic; no spinlocks may be held. | |
1627 | */ | |
25834c73 PZ |
1628 | static int __set_cpus_allowed_ptr(struct task_struct *p, |
1629 | const struct cpumask *new_mask, bool check) | |
5cc389bc | 1630 | { |
e9d867a6 | 1631 | const struct cpumask *cpu_valid_mask = cpu_active_mask; |
5cc389bc | 1632 | unsigned int dest_cpu; |
eb580751 PZ |
1633 | struct rq_flags rf; |
1634 | struct rq *rq; | |
5cc389bc PZ |
1635 | int ret = 0; |
1636 | ||
eb580751 | 1637 | rq = task_rq_lock(p, &rf); |
a499c3ea | 1638 | update_rq_clock(rq); |
5cc389bc | 1639 | |
e9d867a6 PZI |
1640 | if (p->flags & PF_KTHREAD) { |
1641 | /* | |
1642 | * Kernel threads are allowed on online && !active CPUs | |
1643 | */ | |
1644 | cpu_valid_mask = cpu_online_mask; | |
1645 | } | |
1646 | ||
25834c73 PZ |
1647 | /* |
1648 | * Must re-check here, to close a race against __kthread_bind(), | |
1649 | * sched_setaffinity() is not guaranteed to observe the flag. | |
1650 | */ | |
1651 | if (check && (p->flags & PF_NO_SETAFFINITY)) { | |
1652 | ret = -EINVAL; | |
1653 | goto out; | |
1654 | } | |
1655 | ||
3bd37062 | 1656 | if (cpumask_equal(p->cpus_ptr, new_mask)) |
5cc389bc PZ |
1657 | goto out; |
1658 | ||
e9d867a6 | 1659 | if (!cpumask_intersects(new_mask, cpu_valid_mask)) { |
5cc389bc PZ |
1660 | ret = -EINVAL; |
1661 | goto out; | |
1662 | } | |
1663 | ||
1664 | do_set_cpus_allowed(p, new_mask); | |
1665 | ||
e9d867a6 PZI |
1666 | if (p->flags & PF_KTHREAD) { |
1667 | /* | |
1668 | * For kernel threads that do indeed end up on online && | |
d1ccc66d | 1669 | * !active we want to ensure they are strict per-CPU threads. |
e9d867a6 PZI |
1670 | */ |
1671 | WARN_ON(cpumask_intersects(new_mask, cpu_online_mask) && | |
1672 | !cpumask_intersects(new_mask, cpu_active_mask) && | |
1673 | p->nr_cpus_allowed != 1); | |
1674 | } | |
1675 | ||
5cc389bc PZ |
1676 | /* Can the task run on the task's current CPU? If so, we're done */ |
1677 | if (cpumask_test_cpu(task_cpu(p), new_mask)) | |
1678 | goto out; | |
1679 | ||
e9d867a6 | 1680 | dest_cpu = cpumask_any_and(cpu_valid_mask, new_mask); |
5cc389bc PZ |
1681 | if (task_running(rq, p) || p->state == TASK_WAKING) { |
1682 | struct migration_arg arg = { p, dest_cpu }; | |
1683 | /* Need help from migration thread: drop lock and wait. */ | |
eb580751 | 1684 | task_rq_unlock(rq, p, &rf); |
5cc389bc | 1685 | stop_one_cpu(cpu_of(rq), migration_cpu_stop, &arg); |
5cc389bc | 1686 | return 0; |
cbce1a68 PZ |
1687 | } else if (task_on_rq_queued(p)) { |
1688 | /* | |
1689 | * OK, since we're going to drop the lock immediately | |
1690 | * afterwards anyway. | |
1691 | */ | |
8a8c69c3 | 1692 | rq = move_queued_task(rq, &rf, p, dest_cpu); |
cbce1a68 | 1693 | } |
5cc389bc | 1694 | out: |
eb580751 | 1695 | task_rq_unlock(rq, p, &rf); |
5cc389bc PZ |
1696 | |
1697 | return ret; | |
1698 | } | |
25834c73 PZ |
1699 | |
1700 | int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask) | |
1701 | { | |
1702 | return __set_cpus_allowed_ptr(p, new_mask, false); | |
1703 | } | |
5cc389bc PZ |
1704 | EXPORT_SYMBOL_GPL(set_cpus_allowed_ptr); |
1705 | ||
dd41f596 | 1706 | void set_task_cpu(struct task_struct *p, unsigned int new_cpu) |
c65cc870 | 1707 | { |
e2912009 PZ |
1708 | #ifdef CONFIG_SCHED_DEBUG |
1709 | /* | |
1710 | * We should never call set_task_cpu() on a blocked task, | |
1711 | * ttwu() will sort out the placement. | |
1712 | */ | |
077614ee | 1713 | WARN_ON_ONCE(p->state != TASK_RUNNING && p->state != TASK_WAKING && |
e2336f6e | 1714 | !p->on_rq); |
0122ec5b | 1715 | |
3ea94de1 JP |
1716 | /* |
1717 | * Migrating fair class task must have p->on_rq = TASK_ON_RQ_MIGRATING, | |
1718 | * because schedstat_wait_{start,end} rebase migrating task's wait_start | |
1719 | * time relying on p->on_rq. | |
1720 | */ | |
1721 | WARN_ON_ONCE(p->state == TASK_RUNNING && | |
1722 | p->sched_class == &fair_sched_class && | |
1723 | (p->on_rq && !task_on_rq_migrating(p))); | |
1724 | ||
0122ec5b | 1725 | #ifdef CONFIG_LOCKDEP |
6c6c54e1 PZ |
1726 | /* |
1727 | * The caller should hold either p->pi_lock or rq->lock, when changing | |
1728 | * a task's CPU. ->pi_lock for waking tasks, rq->lock for runnable tasks. | |
1729 | * | |
1730 | * sched_move_task() holds both and thus holding either pins the cgroup, | |
8323f26c | 1731 | * see task_group(). |
6c6c54e1 PZ |
1732 | * |
1733 | * Furthermore, all task_rq users should acquire both locks, see | |
1734 | * task_rq_lock(). | |
1735 | */ | |
0122ec5b PZ |
1736 | WARN_ON_ONCE(debug_locks && !(lockdep_is_held(&p->pi_lock) || |
1737 | lockdep_is_held(&task_rq(p)->lock))); | |
1738 | #endif | |
4ff9083b PZ |
1739 | /* |
1740 | * Clearly, migrating tasks to offline CPUs is a fairly daft thing. | |
1741 | */ | |
1742 | WARN_ON_ONCE(!cpu_online(new_cpu)); | |
e2912009 PZ |
1743 | #endif |
1744 | ||
de1d7286 | 1745 | trace_sched_migrate_task(p, new_cpu); |
cbc34ed1 | 1746 | |
0c69774e | 1747 | if (task_cpu(p) != new_cpu) { |
0a74bef8 | 1748 | if (p->sched_class->migrate_task_rq) |
1327237a | 1749 | p->sched_class->migrate_task_rq(p, new_cpu); |
0c69774e | 1750 | p->se.nr_migrations++; |
d7822b1e | 1751 | rseq_migrate(p); |
ff303e66 | 1752 | perf_event_task_migrate(p); |
0c69774e | 1753 | } |
dd41f596 IM |
1754 | |
1755 | __set_task_cpu(p, new_cpu); | |
c65cc870 IM |
1756 | } |
1757 | ||
0ad4e3df | 1758 | #ifdef CONFIG_NUMA_BALANCING |
ac66f547 PZ |
1759 | static void __migrate_swap_task(struct task_struct *p, int cpu) |
1760 | { | |
da0c1e65 | 1761 | if (task_on_rq_queued(p)) { |
ac66f547 | 1762 | struct rq *src_rq, *dst_rq; |
8a8c69c3 | 1763 | struct rq_flags srf, drf; |
ac66f547 PZ |
1764 | |
1765 | src_rq = task_rq(p); | |
1766 | dst_rq = cpu_rq(cpu); | |
1767 | ||
8a8c69c3 PZ |
1768 | rq_pin_lock(src_rq, &srf); |
1769 | rq_pin_lock(dst_rq, &drf); | |
1770 | ||
ac66f547 PZ |
1771 | deactivate_task(src_rq, p, 0); |
1772 | set_task_cpu(p, cpu); | |
1773 | activate_task(dst_rq, p, 0); | |
1774 | check_preempt_curr(dst_rq, p, 0); | |
8a8c69c3 PZ |
1775 | |
1776 | rq_unpin_lock(dst_rq, &drf); | |
1777 | rq_unpin_lock(src_rq, &srf); | |
1778 | ||
ac66f547 PZ |
1779 | } else { |
1780 | /* | |
1781 | * Task isn't running anymore; make it appear like we migrated | |
1782 | * it before it went to sleep. This means on wakeup we make the | |
d1ccc66d | 1783 | * previous CPU our target instead of where it really is. |
ac66f547 PZ |
1784 | */ |
1785 | p->wake_cpu = cpu; | |
1786 | } | |
1787 | } | |
1788 | ||
1789 | struct migration_swap_arg { | |
1790 | struct task_struct *src_task, *dst_task; | |
1791 | int src_cpu, dst_cpu; | |
1792 | }; | |
1793 | ||
1794 | static int migrate_swap_stop(void *data) | |
1795 | { | |
1796 | struct migration_swap_arg *arg = data; | |
1797 | struct rq *src_rq, *dst_rq; | |
1798 | int ret = -EAGAIN; | |
1799 | ||
62694cd5 PZ |
1800 | if (!cpu_active(arg->src_cpu) || !cpu_active(arg->dst_cpu)) |
1801 | return -EAGAIN; | |
1802 | ||
ac66f547 PZ |
1803 | src_rq = cpu_rq(arg->src_cpu); |
1804 | dst_rq = cpu_rq(arg->dst_cpu); | |
1805 | ||
74602315 PZ |
1806 | double_raw_lock(&arg->src_task->pi_lock, |
1807 | &arg->dst_task->pi_lock); | |
ac66f547 | 1808 | double_rq_lock(src_rq, dst_rq); |
62694cd5 | 1809 | |
ac66f547 PZ |
1810 | if (task_cpu(arg->dst_task) != arg->dst_cpu) |
1811 | goto unlock; | |
1812 | ||
1813 | if (task_cpu(arg->src_task) != arg->src_cpu) | |
1814 | goto unlock; | |
1815 | ||
3bd37062 | 1816 | if (!cpumask_test_cpu(arg->dst_cpu, arg->src_task->cpus_ptr)) |
ac66f547 PZ |
1817 | goto unlock; |
1818 | ||
3bd37062 | 1819 | if (!cpumask_test_cpu(arg->src_cpu, arg->dst_task->cpus_ptr)) |
ac66f547 PZ |
1820 | goto unlock; |
1821 | ||
1822 | __migrate_swap_task(arg->src_task, arg->dst_cpu); | |
1823 | __migrate_swap_task(arg->dst_task, arg->src_cpu); | |
1824 | ||
1825 | ret = 0; | |
1826 | ||
1827 | unlock: | |
1828 | double_rq_unlock(src_rq, dst_rq); | |
74602315 PZ |
1829 | raw_spin_unlock(&arg->dst_task->pi_lock); |
1830 | raw_spin_unlock(&arg->src_task->pi_lock); | |
ac66f547 PZ |
1831 | |
1832 | return ret; | |
1833 | } | |
1834 | ||
1835 | /* | |
1836 | * Cross migrate two tasks | |
1837 | */ | |
0ad4e3df SD |
1838 | int migrate_swap(struct task_struct *cur, struct task_struct *p, |
1839 | int target_cpu, int curr_cpu) | |
ac66f547 PZ |
1840 | { |
1841 | struct migration_swap_arg arg; | |
1842 | int ret = -EINVAL; | |
1843 | ||
ac66f547 PZ |
1844 | arg = (struct migration_swap_arg){ |
1845 | .src_task = cur, | |
0ad4e3df | 1846 | .src_cpu = curr_cpu, |
ac66f547 | 1847 | .dst_task = p, |
0ad4e3df | 1848 | .dst_cpu = target_cpu, |
ac66f547 PZ |
1849 | }; |
1850 | ||
1851 | if (arg.src_cpu == arg.dst_cpu) | |
1852 | goto out; | |
1853 | ||
6acce3ef PZ |
1854 | /* |
1855 | * These three tests are all lockless; this is OK since all of them | |
1856 | * will be re-checked with proper locks held further down the line. | |
1857 | */ | |
ac66f547 PZ |
1858 | if (!cpu_active(arg.src_cpu) || !cpu_active(arg.dst_cpu)) |
1859 | goto out; | |
1860 | ||
3bd37062 | 1861 | if (!cpumask_test_cpu(arg.dst_cpu, arg.src_task->cpus_ptr)) |
ac66f547 PZ |
1862 | goto out; |
1863 | ||
3bd37062 | 1864 | if (!cpumask_test_cpu(arg.src_cpu, arg.dst_task->cpus_ptr)) |
ac66f547 PZ |
1865 | goto out; |
1866 | ||
286549dc | 1867 | trace_sched_swap_numa(cur, arg.src_cpu, p, arg.dst_cpu); |
ac66f547 PZ |
1868 | ret = stop_two_cpus(arg.dst_cpu, arg.src_cpu, migrate_swap_stop, &arg); |
1869 | ||
1870 | out: | |
ac66f547 PZ |
1871 | return ret; |
1872 | } | |
0ad4e3df | 1873 | #endif /* CONFIG_NUMA_BALANCING */ |
ac66f547 | 1874 | |
1da177e4 LT |
1875 | /* |
1876 | * wait_task_inactive - wait for a thread to unschedule. | |
1877 | * | |
85ba2d86 RM |
1878 | * If @match_state is nonzero, it's the @p->state value just checked and |
1879 | * not expected to change. If it changes, i.e. @p might have woken up, | |
1880 | * then return zero. When we succeed in waiting for @p to be off its CPU, | |
1881 | * we return a positive number (its total switch count). If a second call | |
1882 | * a short while later returns the same number, the caller can be sure that | |
1883 | * @p has remained unscheduled the whole time. | |
1884 | * | |
1da177e4 LT |
1885 | * The caller must ensure that the task *will* unschedule sometime soon, |
1886 | * else this function might spin for a *long* time. This function can't | |
1887 | * be called with interrupts off, or it may introduce deadlock with | |
1888 | * smp_call_function() if an IPI is sent by the same process we are | |
1889 | * waiting to become inactive. | |
1890 | */ | |
85ba2d86 | 1891 | unsigned long wait_task_inactive(struct task_struct *p, long match_state) |
1da177e4 | 1892 | { |
da0c1e65 | 1893 | int running, queued; |
eb580751 | 1894 | struct rq_flags rf; |
85ba2d86 | 1895 | unsigned long ncsw; |
70b97a7f | 1896 | struct rq *rq; |
1da177e4 | 1897 | |
3a5c359a AK |
1898 | for (;;) { |
1899 | /* | |
1900 | * We do the initial early heuristics without holding | |
1901 | * any task-queue locks at all. We'll only try to get | |
1902 | * the runqueue lock when things look like they will | |
1903 | * work out! | |
1904 | */ | |
1905 | rq = task_rq(p); | |
fa490cfd | 1906 | |
3a5c359a AK |
1907 | /* |
1908 | * If the task is actively running on another CPU | |
1909 | * still, just relax and busy-wait without holding | |
1910 | * any locks. | |
1911 | * | |
1912 | * NOTE! Since we don't hold any locks, it's not | |
1913 | * even sure that "rq" stays as the right runqueue! | |
1914 | * But we don't care, since "task_running()" will | |
1915 | * return false if the runqueue has changed and p | |
1916 | * is actually now running somewhere else! | |
1917 | */ | |
85ba2d86 RM |
1918 | while (task_running(rq, p)) { |
1919 | if (match_state && unlikely(p->state != match_state)) | |
1920 | return 0; | |
3a5c359a | 1921 | cpu_relax(); |
85ba2d86 | 1922 | } |
fa490cfd | 1923 | |
3a5c359a AK |
1924 | /* |
1925 | * Ok, time to look more closely! We need the rq | |
1926 | * lock now, to be *sure*. If we're wrong, we'll | |
1927 | * just go back and repeat. | |
1928 | */ | |
eb580751 | 1929 | rq = task_rq_lock(p, &rf); |
27a9da65 | 1930 | trace_sched_wait_task(p); |
3a5c359a | 1931 | running = task_running(rq, p); |
da0c1e65 | 1932 | queued = task_on_rq_queued(p); |
85ba2d86 | 1933 | ncsw = 0; |
f31e11d8 | 1934 | if (!match_state || p->state == match_state) |
93dcf55f | 1935 | ncsw = p->nvcsw | LONG_MIN; /* sets MSB */ |
eb580751 | 1936 | task_rq_unlock(rq, p, &rf); |
fa490cfd | 1937 | |
85ba2d86 RM |
1938 | /* |
1939 | * If it changed from the expected state, bail out now. | |
1940 | */ | |
1941 | if (unlikely(!ncsw)) | |
1942 | break; | |
1943 | ||
3a5c359a AK |
1944 | /* |
1945 | * Was it really running after all now that we | |
1946 | * checked with the proper locks actually held? | |
1947 | * | |
1948 | * Oops. Go back and try again.. | |
1949 | */ | |
1950 | if (unlikely(running)) { | |
1951 | cpu_relax(); | |
1952 | continue; | |
1953 | } | |
fa490cfd | 1954 | |
3a5c359a AK |
1955 | /* |
1956 | * It's not enough that it's not actively running, | |
1957 | * it must be off the runqueue _entirely_, and not | |
1958 | * preempted! | |
1959 | * | |
80dd99b3 | 1960 | * So if it was still runnable (but just not actively |
3a5c359a AK |
1961 | * running right now), it's preempted, and we should |
1962 | * yield - it could be a while. | |
1963 | */ | |
da0c1e65 | 1964 | if (unlikely(queued)) { |
8b0e1953 | 1965 | ktime_t to = NSEC_PER_SEC / HZ; |
8eb90c30 TG |
1966 | |
1967 | set_current_state(TASK_UNINTERRUPTIBLE); | |
1968 | schedule_hrtimeout(&to, HRTIMER_MODE_REL); | |
3a5c359a AK |
1969 | continue; |
1970 | } | |
fa490cfd | 1971 | |
3a5c359a AK |
1972 | /* |
1973 | * Ahh, all good. It wasn't running, and it wasn't | |
1974 | * runnable, which means that it will never become | |
1975 | * running in the future either. We're all done! | |
1976 | */ | |
1977 | break; | |
1978 | } | |
85ba2d86 RM |
1979 | |
1980 | return ncsw; | |
1da177e4 LT |
1981 | } |
1982 | ||
1983 | /*** | |
1984 | * kick_process - kick a running thread to enter/exit the kernel | |
1985 | * @p: the to-be-kicked thread | |
1986 | * | |
1987 | * Cause a process which is running on another CPU to enter | |
1988 | * kernel-mode, without any delay. (to get signals handled.) | |
1989 | * | |
25985edc | 1990 | * NOTE: this function doesn't have to take the runqueue lock, |
1da177e4 LT |
1991 | * because all it wants to ensure is that the remote task enters |
1992 | * the kernel. If the IPI races and the task has been migrated | |
1993 | * to another CPU then no harm is done and the purpose has been | |
1994 | * achieved as well. | |
1995 | */ | |
36c8b586 | 1996 | void kick_process(struct task_struct *p) |
1da177e4 LT |
1997 | { |
1998 | int cpu; | |
1999 | ||
2000 | preempt_disable(); | |
2001 | cpu = task_cpu(p); | |
2002 | if ((cpu != smp_processor_id()) && task_curr(p)) | |
2003 | smp_send_reschedule(cpu); | |
2004 | preempt_enable(); | |
2005 | } | |
b43e3521 | 2006 | EXPORT_SYMBOL_GPL(kick_process); |
1da177e4 | 2007 | |
30da688e | 2008 | /* |
3bd37062 | 2009 | * ->cpus_ptr is protected by both rq->lock and p->pi_lock |
e9d867a6 PZI |
2010 | * |
2011 | * A few notes on cpu_active vs cpu_online: | |
2012 | * | |
2013 | * - cpu_active must be a subset of cpu_online | |
2014 | * | |
97fb7a0a | 2015 | * - on CPU-up we allow per-CPU kthreads on the online && !active CPU, |
e9d867a6 | 2016 | * see __set_cpus_allowed_ptr(). At this point the newly online |
d1ccc66d | 2017 | * CPU isn't yet part of the sched domains, and balancing will not |
e9d867a6 PZI |
2018 | * see it. |
2019 | * | |
d1ccc66d | 2020 | * - on CPU-down we clear cpu_active() to mask the sched domains and |
e9d867a6 | 2021 | * avoid the load balancer to place new tasks on the to be removed |
d1ccc66d | 2022 | * CPU. Existing tasks will remain running there and will be taken |
e9d867a6 PZI |
2023 | * off. |
2024 | * | |
2025 | * This means that fallback selection must not select !active CPUs. | |
2026 | * And can assume that any active CPU must be online. Conversely | |
2027 | * select_task_rq() below may allow selection of !active CPUs in order | |
2028 | * to satisfy the above rules. | |
30da688e | 2029 | */ |
5da9a0fb PZ |
2030 | static int select_fallback_rq(int cpu, struct task_struct *p) |
2031 | { | |
aa00d89c TC |
2032 | int nid = cpu_to_node(cpu); |
2033 | const struct cpumask *nodemask = NULL; | |
2baab4e9 PZ |
2034 | enum { cpuset, possible, fail } state = cpuset; |
2035 | int dest_cpu; | |
5da9a0fb | 2036 | |
aa00d89c | 2037 | /* |
d1ccc66d IM |
2038 | * If the node that the CPU is on has been offlined, cpu_to_node() |
2039 | * will return -1. There is no CPU on the node, and we should | |
2040 | * select the CPU on the other node. | |
aa00d89c TC |
2041 | */ |
2042 | if (nid != -1) { | |
2043 | nodemask = cpumask_of_node(nid); | |
2044 | ||
2045 | /* Look for allowed, online CPU in same node. */ | |
2046 | for_each_cpu(dest_cpu, nodemask) { | |
aa00d89c TC |
2047 | if (!cpu_active(dest_cpu)) |
2048 | continue; | |
3bd37062 | 2049 | if (cpumask_test_cpu(dest_cpu, p->cpus_ptr)) |
aa00d89c TC |
2050 | return dest_cpu; |
2051 | } | |
2baab4e9 | 2052 | } |
5da9a0fb | 2053 | |
2baab4e9 PZ |
2054 | for (;;) { |
2055 | /* Any allowed, online CPU? */ | |
3bd37062 | 2056 | for_each_cpu(dest_cpu, p->cpus_ptr) { |
175f0e25 | 2057 | if (!is_cpu_allowed(p, dest_cpu)) |
2baab4e9 | 2058 | continue; |
175f0e25 | 2059 | |
2baab4e9 PZ |
2060 | goto out; |
2061 | } | |
5da9a0fb | 2062 | |
e73e85f0 | 2063 | /* No more Mr. Nice Guy. */ |
2baab4e9 PZ |
2064 | switch (state) { |
2065 | case cpuset: | |
e73e85f0 ON |
2066 | if (IS_ENABLED(CONFIG_CPUSETS)) { |
2067 | cpuset_cpus_allowed_fallback(p); | |
2068 | state = possible; | |
2069 | break; | |
2070 | } | |
d1ccc66d | 2071 | /* Fall-through */ |
2baab4e9 PZ |
2072 | case possible: |
2073 | do_set_cpus_allowed(p, cpu_possible_mask); | |
2074 | state = fail; | |
2075 | break; | |
2076 | ||
2077 | case fail: | |
2078 | BUG(); | |
2079 | break; | |
2080 | } | |
2081 | } | |
2082 | ||
2083 | out: | |
2084 | if (state != cpuset) { | |
2085 | /* | |
2086 | * Don't tell them about moving exiting tasks or | |
2087 | * kernel threads (both mm NULL), since they never | |
2088 | * leave kernel. | |
2089 | */ | |
2090 | if (p->mm && printk_ratelimit()) { | |
aac74dc4 | 2091 | printk_deferred("process %d (%s) no longer affine to cpu%d\n", |
2baab4e9 PZ |
2092 | task_pid_nr(p), p->comm, cpu); |
2093 | } | |
5da9a0fb PZ |
2094 | } |
2095 | ||
2096 | return dest_cpu; | |
2097 | } | |
2098 | ||
e2912009 | 2099 | /* |
3bd37062 | 2100 | * The caller (fork, wakeup) owns p->pi_lock, ->cpus_ptr is stable. |
e2912009 | 2101 | */ |
970b13ba | 2102 | static inline |
ac66f547 | 2103 | int select_task_rq(struct task_struct *p, int cpu, int sd_flags, int wake_flags) |
970b13ba | 2104 | { |
cbce1a68 PZ |
2105 | lockdep_assert_held(&p->pi_lock); |
2106 | ||
4b53a341 | 2107 | if (p->nr_cpus_allowed > 1) |
6c1d9410 | 2108 | cpu = p->sched_class->select_task_rq(p, cpu, sd_flags, wake_flags); |
e9d867a6 | 2109 | else |
3bd37062 | 2110 | cpu = cpumask_any(p->cpus_ptr); |
e2912009 PZ |
2111 | |
2112 | /* | |
2113 | * In order not to call set_task_cpu() on a blocking task we need | |
3bd37062 | 2114 | * to rely on ttwu() to place the task on a valid ->cpus_ptr |
d1ccc66d | 2115 | * CPU. |
e2912009 PZ |
2116 | * |
2117 | * Since this is common to all placement strategies, this lives here. | |
2118 | * | |
2119 | * [ this allows ->select_task() to simply return task_cpu(p) and | |
2120 | * not worry about this generic constraint ] | |
2121 | */ | |
7af443ee | 2122 | if (unlikely(!is_cpu_allowed(p, cpu))) |
5da9a0fb | 2123 | cpu = select_fallback_rq(task_cpu(p), p); |
e2912009 PZ |
2124 | |
2125 | return cpu; | |
970b13ba | 2126 | } |
09a40af5 MG |
2127 | |
2128 | static void update_avg(u64 *avg, u64 sample) | |
2129 | { | |
2130 | s64 diff = sample - *avg; | |
2131 | *avg += diff >> 3; | |
2132 | } | |
25834c73 | 2133 | |
f5832c19 NP |
2134 | void sched_set_stop_task(int cpu, struct task_struct *stop) |
2135 | { | |
2136 | struct sched_param param = { .sched_priority = MAX_RT_PRIO - 1 }; | |
2137 | struct task_struct *old_stop = cpu_rq(cpu)->stop; | |
2138 | ||
2139 | if (stop) { | |
2140 | /* | |
2141 | * Make it appear like a SCHED_FIFO task, its something | |
2142 | * userspace knows about and won't get confused about. | |
2143 | * | |
2144 | * Also, it will make PI more or less work without too | |
2145 | * much confusion -- but then, stop work should not | |
2146 | * rely on PI working anyway. | |
2147 | */ | |
2148 | sched_setscheduler_nocheck(stop, SCHED_FIFO, ¶m); | |
2149 | ||
2150 | stop->sched_class = &stop_sched_class; | |
2151 | } | |
2152 | ||
2153 | cpu_rq(cpu)->stop = stop; | |
2154 | ||
2155 | if (old_stop) { | |
2156 | /* | |
2157 | * Reset it back to a normal scheduling class so that | |
2158 | * it can die in pieces. | |
2159 | */ | |
2160 | old_stop->sched_class = &rt_sched_class; | |
2161 | } | |
2162 | } | |
2163 | ||
25834c73 PZ |
2164 | #else |
2165 | ||
2166 | static inline int __set_cpus_allowed_ptr(struct task_struct *p, | |
2167 | const struct cpumask *new_mask, bool check) | |
2168 | { | |
2169 | return set_cpus_allowed_ptr(p, new_mask); | |
2170 | } | |
2171 | ||
5cc389bc | 2172 | #endif /* CONFIG_SMP */ |
970b13ba | 2173 | |
d7c01d27 | 2174 | static void |
b84cb5df | 2175 | ttwu_stat(struct task_struct *p, int cpu, int wake_flags) |
9ed3811a | 2176 | { |
4fa8d299 | 2177 | struct rq *rq; |
b84cb5df | 2178 | |
4fa8d299 JP |
2179 | if (!schedstat_enabled()) |
2180 | return; | |
2181 | ||
2182 | rq = this_rq(); | |
d7c01d27 | 2183 | |
4fa8d299 JP |
2184 | #ifdef CONFIG_SMP |
2185 | if (cpu == rq->cpu) { | |
b85c8b71 PZ |
2186 | __schedstat_inc(rq->ttwu_local); |
2187 | __schedstat_inc(p->se.statistics.nr_wakeups_local); | |
d7c01d27 PZ |
2188 | } else { |
2189 | struct sched_domain *sd; | |
2190 | ||
b85c8b71 | 2191 | __schedstat_inc(p->se.statistics.nr_wakeups_remote); |
057f3fad | 2192 | rcu_read_lock(); |
4fa8d299 | 2193 | for_each_domain(rq->cpu, sd) { |
d7c01d27 | 2194 | if (cpumask_test_cpu(cpu, sched_domain_span(sd))) { |
b85c8b71 | 2195 | __schedstat_inc(sd->ttwu_wake_remote); |
d7c01d27 PZ |
2196 | break; |
2197 | } | |
2198 | } | |
057f3fad | 2199 | rcu_read_unlock(); |
d7c01d27 | 2200 | } |
f339b9dc PZ |
2201 | |
2202 | if (wake_flags & WF_MIGRATED) | |
b85c8b71 | 2203 | __schedstat_inc(p->se.statistics.nr_wakeups_migrate); |
d7c01d27 PZ |
2204 | #endif /* CONFIG_SMP */ |
2205 | ||
b85c8b71 PZ |
2206 | __schedstat_inc(rq->ttwu_count); |
2207 | __schedstat_inc(p->se.statistics.nr_wakeups); | |
d7c01d27 PZ |
2208 | |
2209 | if (wake_flags & WF_SYNC) | |
b85c8b71 | 2210 | __schedstat_inc(p->se.statistics.nr_wakeups_sync); |
d7c01d27 PZ |
2211 | } |
2212 | ||
23f41eeb PZ |
2213 | /* |
2214 | * Mark the task runnable and perform wakeup-preemption. | |
2215 | */ | |
e7904a28 | 2216 | static void ttwu_do_wakeup(struct rq *rq, struct task_struct *p, int wake_flags, |
d8ac8971 | 2217 | struct rq_flags *rf) |
9ed3811a | 2218 | { |
9ed3811a | 2219 | check_preempt_curr(rq, p, wake_flags); |
9ed3811a | 2220 | p->state = TASK_RUNNING; |
fbd705a0 PZ |
2221 | trace_sched_wakeup(p); |
2222 | ||
9ed3811a | 2223 | #ifdef CONFIG_SMP |
4c9a4bc8 PZ |
2224 | if (p->sched_class->task_woken) { |
2225 | /* | |
cbce1a68 PZ |
2226 | * Our task @p is fully woken up and running; so its safe to |
2227 | * drop the rq->lock, hereafter rq is only used for statistics. | |
4c9a4bc8 | 2228 | */ |
d8ac8971 | 2229 | rq_unpin_lock(rq, rf); |
9ed3811a | 2230 | p->sched_class->task_woken(rq, p); |
d8ac8971 | 2231 | rq_repin_lock(rq, rf); |
4c9a4bc8 | 2232 | } |
9ed3811a | 2233 | |
e69c6341 | 2234 | if (rq->idle_stamp) { |
78becc27 | 2235 | u64 delta = rq_clock(rq) - rq->idle_stamp; |
9bd721c5 | 2236 | u64 max = 2*rq->max_idle_balance_cost; |
9ed3811a | 2237 | |
abfafa54 JL |
2238 | update_avg(&rq->avg_idle, delta); |
2239 | ||
2240 | if (rq->avg_idle > max) | |
9ed3811a | 2241 | rq->avg_idle = max; |
abfafa54 | 2242 | |
9ed3811a TH |
2243 | rq->idle_stamp = 0; |
2244 | } | |
2245 | #endif | |
2246 | } | |
2247 | ||
c05fbafb | 2248 | static void |
e7904a28 | 2249 | ttwu_do_activate(struct rq *rq, struct task_struct *p, int wake_flags, |
d8ac8971 | 2250 | struct rq_flags *rf) |
c05fbafb | 2251 | { |
77558e4d | 2252 | int en_flags = ENQUEUE_WAKEUP | ENQUEUE_NOCLOCK; |
b5179ac7 | 2253 | |
cbce1a68 PZ |
2254 | lockdep_assert_held(&rq->lock); |
2255 | ||
c05fbafb PZ |
2256 | #ifdef CONFIG_SMP |
2257 | if (p->sched_contributes_to_load) | |
2258 | rq->nr_uninterruptible--; | |
b5179ac7 | 2259 | |
b5179ac7 | 2260 | if (wake_flags & WF_MIGRATED) |
59efa0ba | 2261 | en_flags |= ENQUEUE_MIGRATED; |
c05fbafb PZ |
2262 | #endif |
2263 | ||
1b174a2c | 2264 | activate_task(rq, p, en_flags); |
d8ac8971 | 2265 | ttwu_do_wakeup(rq, p, wake_flags, rf); |
c05fbafb PZ |
2266 | } |
2267 | ||
2268 | /* | |
2269 | * Called in case the task @p isn't fully descheduled from its runqueue, | |
2270 | * in this case we must do a remote wakeup. Its a 'light' wakeup though, | |
2271 | * since all we need to do is flip p->state to TASK_RUNNING, since | |
2272 | * the task is still ->on_rq. | |
2273 | */ | |
2274 | static int ttwu_remote(struct task_struct *p, int wake_flags) | |
2275 | { | |
eb580751 | 2276 | struct rq_flags rf; |
c05fbafb PZ |
2277 | struct rq *rq; |
2278 | int ret = 0; | |
2279 | ||
eb580751 | 2280 | rq = __task_rq_lock(p, &rf); |
da0c1e65 | 2281 | if (task_on_rq_queued(p)) { |
1ad4ec0d FW |
2282 | /* check_preempt_curr() may use rq clock */ |
2283 | update_rq_clock(rq); | |
d8ac8971 | 2284 | ttwu_do_wakeup(rq, p, wake_flags, &rf); |
c05fbafb PZ |
2285 | ret = 1; |
2286 | } | |
eb580751 | 2287 | __task_rq_unlock(rq, &rf); |
c05fbafb PZ |
2288 | |
2289 | return ret; | |
2290 | } | |
2291 | ||
317f3941 | 2292 | #ifdef CONFIG_SMP |
e3baac47 | 2293 | void sched_ttwu_pending(void) |
317f3941 PZ |
2294 | { |
2295 | struct rq *rq = this_rq(); | |
fa14ff4a | 2296 | struct llist_node *llist = llist_del_all(&rq->wake_list); |
73215849 | 2297 | struct task_struct *p, *t; |
d8ac8971 | 2298 | struct rq_flags rf; |
317f3941 | 2299 | |
e3baac47 PZ |
2300 | if (!llist) |
2301 | return; | |
2302 | ||
8a8c69c3 | 2303 | rq_lock_irqsave(rq, &rf); |
77558e4d | 2304 | update_rq_clock(rq); |
317f3941 | 2305 | |
73215849 BP |
2306 | llist_for_each_entry_safe(p, t, llist, wake_entry) |
2307 | ttwu_do_activate(rq, p, p->sched_remote_wakeup ? WF_MIGRATED : 0, &rf); | |
317f3941 | 2308 | |
8a8c69c3 | 2309 | rq_unlock_irqrestore(rq, &rf); |
317f3941 PZ |
2310 | } |
2311 | ||
2312 | void scheduler_ipi(void) | |
2313 | { | |
f27dde8d PZ |
2314 | /* |
2315 | * Fold TIF_NEED_RESCHED into the preempt_count; anybody setting | |
2316 | * TIF_NEED_RESCHED remotely (for the first time) will also send | |
2317 | * this IPI. | |
2318 | */ | |
8cb75e0c | 2319 | preempt_fold_need_resched(); |
f27dde8d | 2320 | |
fd2ac4f4 | 2321 | if (llist_empty(&this_rq()->wake_list) && !got_nohz_idle_kick()) |
c5d753a5 PZ |
2322 | return; |
2323 | ||
2324 | /* | |
2325 | * Not all reschedule IPI handlers call irq_enter/irq_exit, since | |
2326 | * traditionally all their work was done from the interrupt return | |
2327 | * path. Now that we actually do some work, we need to make sure | |
2328 | * we do call them. | |
2329 | * | |
2330 | * Some archs already do call them, luckily irq_enter/exit nest | |
2331 | * properly. | |
2332 | * | |
2333 | * Arguably we should visit all archs and update all handlers, | |
2334 | * however a fair share of IPIs are still resched only so this would | |
2335 | * somewhat pessimize the simple resched case. | |
2336 | */ | |
2337 | irq_enter(); | |
fa14ff4a | 2338 | sched_ttwu_pending(); |
ca38062e SS |
2339 | |
2340 | /* | |
2341 | * Check if someone kicked us for doing the nohz idle load balance. | |
2342 | */ | |
873b4c65 | 2343 | if (unlikely(got_nohz_idle_kick())) { |
6eb57e0d | 2344 | this_rq()->idle_balance = 1; |
ca38062e | 2345 | raise_softirq_irqoff(SCHED_SOFTIRQ); |
6eb57e0d | 2346 | } |
c5d753a5 | 2347 | irq_exit(); |
317f3941 PZ |
2348 | } |
2349 | ||
b7e7ade3 | 2350 | static void ttwu_queue_remote(struct task_struct *p, int cpu, int wake_flags) |
317f3941 | 2351 | { |
e3baac47 PZ |
2352 | struct rq *rq = cpu_rq(cpu); |
2353 | ||
b7e7ade3 PZ |
2354 | p->sched_remote_wakeup = !!(wake_flags & WF_MIGRATED); |
2355 | ||
e3baac47 PZ |
2356 | if (llist_add(&p->wake_entry, &cpu_rq(cpu)->wake_list)) { |
2357 | if (!set_nr_if_polling(rq->idle)) | |
2358 | smp_send_reschedule(cpu); | |
2359 | else | |
2360 | trace_sched_wake_idle_without_ipi(cpu); | |
2361 | } | |
317f3941 | 2362 | } |
d6aa8f85 | 2363 | |
f6be8af1 CL |
2364 | void wake_up_if_idle(int cpu) |
2365 | { | |
2366 | struct rq *rq = cpu_rq(cpu); | |
8a8c69c3 | 2367 | struct rq_flags rf; |
f6be8af1 | 2368 | |
fd7de1e8 AL |
2369 | rcu_read_lock(); |
2370 | ||
2371 | if (!is_idle_task(rcu_dereference(rq->curr))) | |
2372 | goto out; | |
f6be8af1 CL |
2373 | |
2374 | if (set_nr_if_polling(rq->idle)) { | |
2375 | trace_sched_wake_idle_without_ipi(cpu); | |
2376 | } else { | |
8a8c69c3 | 2377 | rq_lock_irqsave(rq, &rf); |
f6be8af1 CL |
2378 | if (is_idle_task(rq->curr)) |
2379 | smp_send_reschedule(cpu); | |
d1ccc66d | 2380 | /* Else CPU is not idle, do nothing here: */ |
8a8c69c3 | 2381 | rq_unlock_irqrestore(rq, &rf); |
f6be8af1 | 2382 | } |
fd7de1e8 AL |
2383 | |
2384 | out: | |
2385 | rcu_read_unlock(); | |
f6be8af1 CL |
2386 | } |
2387 | ||
39be3501 | 2388 | bool cpus_share_cache(int this_cpu, int that_cpu) |
518cd623 PZ |
2389 | { |
2390 | return per_cpu(sd_llc_id, this_cpu) == per_cpu(sd_llc_id, that_cpu); | |
2391 | } | |
d6aa8f85 | 2392 | #endif /* CONFIG_SMP */ |
317f3941 | 2393 | |
b5179ac7 | 2394 | static void ttwu_queue(struct task_struct *p, int cpu, int wake_flags) |
c05fbafb PZ |
2395 | { |
2396 | struct rq *rq = cpu_rq(cpu); | |
d8ac8971 | 2397 | struct rq_flags rf; |
c05fbafb | 2398 | |
17d9f311 | 2399 | #if defined(CONFIG_SMP) |
39be3501 | 2400 | if (sched_feat(TTWU_QUEUE) && !cpus_share_cache(smp_processor_id(), cpu)) { |
d1ccc66d | 2401 | sched_clock_cpu(cpu); /* Sync clocks across CPUs */ |
b7e7ade3 | 2402 | ttwu_queue_remote(p, cpu, wake_flags); |
317f3941 PZ |
2403 | return; |
2404 | } | |
2405 | #endif | |
2406 | ||
8a8c69c3 | 2407 | rq_lock(rq, &rf); |
77558e4d | 2408 | update_rq_clock(rq); |
d8ac8971 | 2409 | ttwu_do_activate(rq, p, wake_flags, &rf); |
8a8c69c3 | 2410 | rq_unlock(rq, &rf); |
9ed3811a TH |
2411 | } |
2412 | ||
8643cda5 PZ |
2413 | /* |
2414 | * Notes on Program-Order guarantees on SMP systems. | |
2415 | * | |
2416 | * MIGRATION | |
2417 | * | |
2418 | * The basic program-order guarantee on SMP systems is that when a task [t] | |
d1ccc66d IM |
2419 | * migrates, all its activity on its old CPU [c0] happens-before any subsequent |
2420 | * execution on its new CPU [c1]. | |
8643cda5 PZ |
2421 | * |
2422 | * For migration (of runnable tasks) this is provided by the following means: | |
2423 | * | |
2424 | * A) UNLOCK of the rq(c0)->lock scheduling out task t | |
2425 | * B) migration for t is required to synchronize *both* rq(c0)->lock and | |
2426 | * rq(c1)->lock (if not at the same time, then in that order). | |
2427 | * C) LOCK of the rq(c1)->lock scheduling in task | |
2428 | * | |
7696f991 | 2429 | * Release/acquire chaining guarantees that B happens after A and C after B. |
d1ccc66d | 2430 | * Note: the CPU doing B need not be c0 or c1 |
8643cda5 PZ |
2431 | * |
2432 | * Example: | |
2433 | * | |
2434 | * CPU0 CPU1 CPU2 | |
2435 | * | |
2436 | * LOCK rq(0)->lock | |
2437 | * sched-out X | |
2438 | * sched-in Y | |
2439 | * UNLOCK rq(0)->lock | |
2440 | * | |
2441 | * LOCK rq(0)->lock // orders against CPU0 | |
2442 | * dequeue X | |
2443 | * UNLOCK rq(0)->lock | |
2444 | * | |
2445 | * LOCK rq(1)->lock | |
2446 | * enqueue X | |
2447 | * UNLOCK rq(1)->lock | |
2448 | * | |
2449 | * LOCK rq(1)->lock // orders against CPU2 | |
2450 | * sched-out Z | |
2451 | * sched-in X | |
2452 | * UNLOCK rq(1)->lock | |
2453 | * | |
2454 | * | |
2455 | * BLOCKING -- aka. SLEEP + WAKEUP | |
2456 | * | |
2457 | * For blocking we (obviously) need to provide the same guarantee as for | |
2458 | * migration. However the means are completely different as there is no lock | |
2459 | * chain to provide order. Instead we do: | |
2460 | * | |
2461 | * 1) smp_store_release(X->on_cpu, 0) | |
1f03e8d2 | 2462 | * 2) smp_cond_load_acquire(!X->on_cpu) |
8643cda5 PZ |
2463 | * |
2464 | * Example: | |
2465 | * | |
2466 | * CPU0 (schedule) CPU1 (try_to_wake_up) CPU2 (schedule) | |
2467 | * | |
2468 | * LOCK rq(0)->lock LOCK X->pi_lock | |
2469 | * dequeue X | |
2470 | * sched-out X | |
2471 | * smp_store_release(X->on_cpu, 0); | |
2472 | * | |
1f03e8d2 | 2473 | * smp_cond_load_acquire(&X->on_cpu, !VAL); |
8643cda5 PZ |
2474 | * X->state = WAKING |
2475 | * set_task_cpu(X,2) | |
2476 | * | |
2477 | * LOCK rq(2)->lock | |
2478 | * enqueue X | |
2479 | * X->state = RUNNING | |
2480 | * UNLOCK rq(2)->lock | |
2481 | * | |
2482 | * LOCK rq(2)->lock // orders against CPU1 | |
2483 | * sched-out Z | |
2484 | * sched-in X | |
2485 | * UNLOCK rq(2)->lock | |
2486 | * | |
2487 | * UNLOCK X->pi_lock | |
2488 | * UNLOCK rq(0)->lock | |
2489 | * | |
2490 | * | |
7696f991 AP |
2491 | * However, for wakeups there is a second guarantee we must provide, namely we |
2492 | * must ensure that CONDITION=1 done by the caller can not be reordered with | |
2493 | * accesses to the task state; see try_to_wake_up() and set_current_state(). | |
8643cda5 PZ |
2494 | */ |
2495 | ||
9ed3811a | 2496 | /** |
1da177e4 | 2497 | * try_to_wake_up - wake up a thread |
9ed3811a | 2498 | * @p: the thread to be awakened |
1da177e4 | 2499 | * @state: the mask of task states that can be woken |
9ed3811a | 2500 | * @wake_flags: wake modifier flags (WF_*) |
1da177e4 | 2501 | * |
a2250238 | 2502 | * If (@state & @p->state) @p->state = TASK_RUNNING. |
1da177e4 | 2503 | * |
a2250238 PZ |
2504 | * If the task was not queued/runnable, also place it back on a runqueue. |
2505 | * | |
2506 | * Atomic against schedule() which would dequeue a task, also see | |
2507 | * set_current_state(). | |
2508 | * | |
7696f991 AP |
2509 | * This function executes a full memory barrier before accessing the task |
2510 | * state; see set_current_state(). | |
2511 | * | |
a2250238 PZ |
2512 | * Return: %true if @p->state changes (an actual wakeup was done), |
2513 | * %false otherwise. | |
1da177e4 | 2514 | */ |
e4a52bcb PZ |
2515 | static int |
2516 | try_to_wake_up(struct task_struct *p, unsigned int state, int wake_flags) | |
1da177e4 | 2517 | { |
1da177e4 | 2518 | unsigned long flags; |
c05fbafb | 2519 | int cpu, success = 0; |
2398f2c6 | 2520 | |
e3d85487 | 2521 | preempt_disable(); |
aacedf26 PZ |
2522 | if (p == current) { |
2523 | /* | |
2524 | * We're waking current, this means 'p->on_rq' and 'task_cpu(p) | |
2525 | * == smp_processor_id()'. Together this means we can special | |
2526 | * case the whole 'p->on_rq && ttwu_remote()' case below | |
2527 | * without taking any locks. | |
2528 | * | |
2529 | * In particular: | |
2530 | * - we rely on Program-Order guarantees for all the ordering, | |
2531 | * - we're serialized against set_special_state() by virtue of | |
2532 | * it disabling IRQs (this allows not taking ->pi_lock). | |
2533 | */ | |
2534 | if (!(p->state & state)) | |
e3d85487 | 2535 | goto out; |
aacedf26 PZ |
2536 | |
2537 | success = 1; | |
2538 | cpu = task_cpu(p); | |
2539 | trace_sched_waking(p); | |
2540 | p->state = TASK_RUNNING; | |
2541 | trace_sched_wakeup(p); | |
2542 | goto out; | |
2543 | } | |
2544 | ||
e0acd0a6 ON |
2545 | /* |
2546 | * If we are going to wake up a thread waiting for CONDITION we | |
2547 | * need to ensure that CONDITION=1 done by the caller can not be | |
2548 | * reordered with p->state check below. This pairs with mb() in | |
2549 | * set_current_state() the waiting thread does. | |
2550 | */ | |
013fdb80 | 2551 | raw_spin_lock_irqsave(&p->pi_lock, flags); |
d89e588c | 2552 | smp_mb__after_spinlock(); |
e9c84311 | 2553 | if (!(p->state & state)) |
aacedf26 | 2554 | goto unlock; |
1da177e4 | 2555 | |
fbd705a0 PZ |
2556 | trace_sched_waking(p); |
2557 | ||
d1ccc66d IM |
2558 | /* We're going to change ->state: */ |
2559 | success = 1; | |
1da177e4 | 2560 | cpu = task_cpu(p); |
1da177e4 | 2561 | |
135e8c92 BS |
2562 | /* |
2563 | * Ensure we load p->on_rq _after_ p->state, otherwise it would | |
2564 | * be possible to, falsely, observe p->on_rq == 0 and get stuck | |
2565 | * in smp_cond_load_acquire() below. | |
2566 | * | |
3d85b270 AP |
2567 | * sched_ttwu_pending() try_to_wake_up() |
2568 | * STORE p->on_rq = 1 LOAD p->state | |
2569 | * UNLOCK rq->lock | |
2570 | * | |
2571 | * __schedule() (switch to task 'p') | |
2572 | * LOCK rq->lock smp_rmb(); | |
2573 | * smp_mb__after_spinlock(); | |
2574 | * UNLOCK rq->lock | |
135e8c92 BS |
2575 | * |
2576 | * [task p] | |
3d85b270 | 2577 | * STORE p->state = UNINTERRUPTIBLE LOAD p->on_rq |
135e8c92 | 2578 | * |
3d85b270 AP |
2579 | * Pairs with the LOCK+smp_mb__after_spinlock() on rq->lock in |
2580 | * __schedule(). See the comment for smp_mb__after_spinlock(). | |
135e8c92 BS |
2581 | */ |
2582 | smp_rmb(); | |
c05fbafb | 2583 | if (p->on_rq && ttwu_remote(p, wake_flags)) |
aacedf26 | 2584 | goto unlock; |
1da177e4 | 2585 | |
1da177e4 | 2586 | #ifdef CONFIG_SMP |
ecf7d01c PZ |
2587 | /* |
2588 | * Ensure we load p->on_cpu _after_ p->on_rq, otherwise it would be | |
2589 | * possible to, falsely, observe p->on_cpu == 0. | |
2590 | * | |
2591 | * One must be running (->on_cpu == 1) in order to remove oneself | |
2592 | * from the runqueue. | |
2593 | * | |
3d85b270 AP |
2594 | * __schedule() (switch to task 'p') try_to_wake_up() |
2595 | * STORE p->on_cpu = 1 LOAD p->on_rq | |
2596 | * UNLOCK rq->lock | |
2597 | * | |
2598 | * __schedule() (put 'p' to sleep) | |
2599 | * LOCK rq->lock smp_rmb(); | |
2600 | * smp_mb__after_spinlock(); | |
2601 | * STORE p->on_rq = 0 LOAD p->on_cpu | |
ecf7d01c | 2602 | * |
3d85b270 AP |
2603 | * Pairs with the LOCK+smp_mb__after_spinlock() on rq->lock in |
2604 | * __schedule(). See the comment for smp_mb__after_spinlock(). | |
ecf7d01c PZ |
2605 | */ |
2606 | smp_rmb(); | |
2607 | ||
e9c84311 | 2608 | /* |
d1ccc66d | 2609 | * If the owning (remote) CPU is still in the middle of schedule() with |
c05fbafb | 2610 | * this task as prev, wait until its done referencing the task. |
b75a2253 | 2611 | * |
31cb1bc0 | 2612 | * Pairs with the smp_store_release() in finish_task(). |
b75a2253 PZ |
2613 | * |
2614 | * This ensures that tasks getting woken will be fully ordered against | |
2615 | * their previous state and preserve Program Order. | |
0970d299 | 2616 | */ |
1f03e8d2 | 2617 | smp_cond_load_acquire(&p->on_cpu, !VAL); |
1da177e4 | 2618 | |
a8e4f2ea | 2619 | p->sched_contributes_to_load = !!task_contributes_to_load(p); |
e9c84311 | 2620 | p->state = TASK_WAKING; |
e7693a36 | 2621 | |
e33a9bba | 2622 | if (p->in_iowait) { |
c96f5471 | 2623 | delayacct_blkio_end(p); |
e33a9bba TH |
2624 | atomic_dec(&task_rq(p)->nr_iowait); |
2625 | } | |
2626 | ||
ac66f547 | 2627 | cpu = select_task_rq(p, p->wake_cpu, SD_BALANCE_WAKE, wake_flags); |
f339b9dc PZ |
2628 | if (task_cpu(p) != cpu) { |
2629 | wake_flags |= WF_MIGRATED; | |
eb414681 | 2630 | psi_ttwu_dequeue(p); |
e4a52bcb | 2631 | set_task_cpu(p, cpu); |
f339b9dc | 2632 | } |
e33a9bba TH |
2633 | |
2634 | #else /* CONFIG_SMP */ | |
2635 | ||
2636 | if (p->in_iowait) { | |
c96f5471 | 2637 | delayacct_blkio_end(p); |
e33a9bba TH |
2638 | atomic_dec(&task_rq(p)->nr_iowait); |
2639 | } | |
2640 | ||
1da177e4 | 2641 | #endif /* CONFIG_SMP */ |
1da177e4 | 2642 | |
b5179ac7 | 2643 | ttwu_queue(p, cpu, wake_flags); |
aacedf26 | 2644 | unlock: |
013fdb80 | 2645 | raw_spin_unlock_irqrestore(&p->pi_lock, flags); |
aacedf26 PZ |
2646 | out: |
2647 | if (success) | |
2648 | ttwu_stat(p, cpu, wake_flags); | |
e3d85487 | 2649 | preempt_enable(); |
1da177e4 LT |
2650 | |
2651 | return success; | |
2652 | } | |
2653 | ||
50fa610a DH |
2654 | /** |
2655 | * wake_up_process - Wake up a specific process | |
2656 | * @p: The process to be woken up. | |
2657 | * | |
2658 | * Attempt to wake up the nominated process and move it to the set of runnable | |
e69f6186 YB |
2659 | * processes. |
2660 | * | |
2661 | * Return: 1 if the process was woken up, 0 if it was already running. | |
50fa610a | 2662 | * |
7696f991 | 2663 | * This function executes a full memory barrier before accessing the task state. |
50fa610a | 2664 | */ |
7ad5b3a5 | 2665 | int wake_up_process(struct task_struct *p) |
1da177e4 | 2666 | { |
9067ac85 | 2667 | return try_to_wake_up(p, TASK_NORMAL, 0); |
1da177e4 | 2668 | } |
1da177e4 LT |
2669 | EXPORT_SYMBOL(wake_up_process); |
2670 | ||
7ad5b3a5 | 2671 | int wake_up_state(struct task_struct *p, unsigned int state) |
1da177e4 LT |
2672 | { |
2673 | return try_to_wake_up(p, state, 0); | |
2674 | } | |
2675 | ||
1da177e4 LT |
2676 | /* |
2677 | * Perform scheduler related setup for a newly forked process p. | |
2678 | * p is forked by current. | |
dd41f596 IM |
2679 | * |
2680 | * __sched_fork() is basic setup used by init_idle() too: | |
2681 | */ | |
5e1576ed | 2682 | static void __sched_fork(unsigned long clone_flags, struct task_struct *p) |
dd41f596 | 2683 | { |
fd2f4419 PZ |
2684 | p->on_rq = 0; |
2685 | ||
2686 | p->se.on_rq = 0; | |
dd41f596 IM |
2687 | p->se.exec_start = 0; |
2688 | p->se.sum_exec_runtime = 0; | |
f6cf891c | 2689 | p->se.prev_sum_exec_runtime = 0; |
6c594c21 | 2690 | p->se.nr_migrations = 0; |
da7a735e | 2691 | p->se.vruntime = 0; |
fd2f4419 | 2692 | INIT_LIST_HEAD(&p->se.group_node); |
6cfb0d5d | 2693 | |
ad936d86 BP |
2694 | #ifdef CONFIG_FAIR_GROUP_SCHED |
2695 | p->se.cfs_rq = NULL; | |
2696 | #endif | |
2697 | ||
6cfb0d5d | 2698 | #ifdef CONFIG_SCHEDSTATS |
cb251765 | 2699 | /* Even if schedstat is disabled, there should not be garbage */ |
41acab88 | 2700 | memset(&p->se.statistics, 0, sizeof(p->se.statistics)); |
6cfb0d5d | 2701 | #endif |
476d139c | 2702 | |
aab03e05 | 2703 | RB_CLEAR_NODE(&p->dl.rb_node); |
40767b0d | 2704 | init_dl_task_timer(&p->dl); |
209a0cbd | 2705 | init_dl_inactive_task_timer(&p->dl); |
a5e7be3b | 2706 | __dl_clear_params(p); |
aab03e05 | 2707 | |
fa717060 | 2708 | INIT_LIST_HEAD(&p->rt.run_list); |
ff77e468 PZ |
2709 | p->rt.timeout = 0; |
2710 | p->rt.time_slice = sched_rr_timeslice; | |
2711 | p->rt.on_rq = 0; | |
2712 | p->rt.on_list = 0; | |
476d139c | 2713 | |
e107be36 AK |
2714 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
2715 | INIT_HLIST_HEAD(&p->preempt_notifiers); | |
2716 | #endif | |
cbee9f88 | 2717 | |
5e1f0f09 MG |
2718 | #ifdef CONFIG_COMPACTION |
2719 | p->capture_control = NULL; | |
2720 | #endif | |
13784475 | 2721 | init_numa_balancing(clone_flags, p); |
dd41f596 IM |
2722 | } |
2723 | ||
2a595721 SD |
2724 | DEFINE_STATIC_KEY_FALSE(sched_numa_balancing); |
2725 | ||
1a687c2e | 2726 | #ifdef CONFIG_NUMA_BALANCING |
c3b9bc5b | 2727 | |
1a687c2e MG |
2728 | void set_numabalancing_state(bool enabled) |
2729 | { | |
2730 | if (enabled) | |
2a595721 | 2731 | static_branch_enable(&sched_numa_balancing); |
1a687c2e | 2732 | else |
2a595721 | 2733 | static_branch_disable(&sched_numa_balancing); |
1a687c2e | 2734 | } |
54a43d54 AK |
2735 | |
2736 | #ifdef CONFIG_PROC_SYSCTL | |
2737 | int sysctl_numa_balancing(struct ctl_table *table, int write, | |
2738 | void __user *buffer, size_t *lenp, loff_t *ppos) | |
2739 | { | |
2740 | struct ctl_table t; | |
2741 | int err; | |
2a595721 | 2742 | int state = static_branch_likely(&sched_numa_balancing); |
54a43d54 AK |
2743 | |
2744 | if (write && !capable(CAP_SYS_ADMIN)) | |
2745 | return -EPERM; | |
2746 | ||
2747 | t = *table; | |
2748 | t.data = &state; | |
2749 | err = proc_dointvec_minmax(&t, write, buffer, lenp, ppos); | |
2750 | if (err < 0) | |
2751 | return err; | |
2752 | if (write) | |
2753 | set_numabalancing_state(state); | |
2754 | return err; | |
2755 | } | |
2756 | #endif | |
2757 | #endif | |
dd41f596 | 2758 | |
4698f88c JP |
2759 | #ifdef CONFIG_SCHEDSTATS |
2760 | ||
cb251765 | 2761 | DEFINE_STATIC_KEY_FALSE(sched_schedstats); |
4698f88c | 2762 | static bool __initdata __sched_schedstats = false; |
cb251765 | 2763 | |
cb251765 MG |
2764 | static void set_schedstats(bool enabled) |
2765 | { | |
2766 | if (enabled) | |
2767 | static_branch_enable(&sched_schedstats); | |
2768 | else | |
2769 | static_branch_disable(&sched_schedstats); | |
2770 | } | |
2771 | ||
2772 | void force_schedstat_enabled(void) | |
2773 | { | |
2774 | if (!schedstat_enabled()) { | |
2775 | pr_info("kernel profiling enabled schedstats, disable via kernel.sched_schedstats.\n"); | |
2776 | static_branch_enable(&sched_schedstats); | |
2777 | } | |
2778 | } | |
2779 | ||
2780 | static int __init setup_schedstats(char *str) | |
2781 | { | |
2782 | int ret = 0; | |
2783 | if (!str) | |
2784 | goto out; | |
2785 | ||
4698f88c JP |
2786 | /* |
2787 | * This code is called before jump labels have been set up, so we can't | |
2788 | * change the static branch directly just yet. Instead set a temporary | |
2789 | * variable so init_schedstats() can do it later. | |
2790 | */ | |
cb251765 | 2791 | if (!strcmp(str, "enable")) { |
4698f88c | 2792 | __sched_schedstats = true; |
cb251765 MG |
2793 | ret = 1; |
2794 | } else if (!strcmp(str, "disable")) { | |
4698f88c | 2795 | __sched_schedstats = false; |
cb251765 MG |
2796 | ret = 1; |
2797 | } | |
2798 | out: | |
2799 | if (!ret) | |
2800 | pr_warn("Unable to parse schedstats=\n"); | |
2801 | ||
2802 | return ret; | |
2803 | } | |
2804 | __setup("schedstats=", setup_schedstats); | |
2805 | ||
4698f88c JP |
2806 | static void __init init_schedstats(void) |
2807 | { | |
2808 | set_schedstats(__sched_schedstats); | |
2809 | } | |
2810 | ||
cb251765 MG |
2811 | #ifdef CONFIG_PROC_SYSCTL |
2812 | int sysctl_schedstats(struct ctl_table *table, int write, | |
2813 | void __user *buffer, size_t *lenp, loff_t *ppos) | |
2814 | { | |
2815 | struct ctl_table t; | |
2816 | int err; | |
2817 | int state = static_branch_likely(&sched_schedstats); | |
2818 | ||
2819 | if (write && !capable(CAP_SYS_ADMIN)) | |
2820 | return -EPERM; | |
2821 | ||
2822 | t = *table; | |
2823 | t.data = &state; | |
2824 | err = proc_dointvec_minmax(&t, write, buffer, lenp, ppos); | |
2825 | if (err < 0) | |
2826 | return err; | |
2827 | if (write) | |
2828 | set_schedstats(state); | |
2829 | return err; | |
2830 | } | |
4698f88c JP |
2831 | #endif /* CONFIG_PROC_SYSCTL */ |
2832 | #else /* !CONFIG_SCHEDSTATS */ | |
2833 | static inline void init_schedstats(void) {} | |
2834 | #endif /* CONFIG_SCHEDSTATS */ | |
dd41f596 IM |
2835 | |
2836 | /* | |
2837 | * fork()/clone()-time setup: | |
2838 | */ | |
aab03e05 | 2839 | int sched_fork(unsigned long clone_flags, struct task_struct *p) |
dd41f596 | 2840 | { |
0122ec5b | 2841 | unsigned long flags; |
dd41f596 | 2842 | |
5e1576ed | 2843 | __sched_fork(clone_flags, p); |
06b83b5f | 2844 | /* |
7dc603c9 | 2845 | * We mark the process as NEW here. This guarantees that |
06b83b5f PZ |
2846 | * nobody will actually run it, and a signal or other external |
2847 | * event cannot wake it up and insert it on the runqueue either. | |
2848 | */ | |
7dc603c9 | 2849 | p->state = TASK_NEW; |
dd41f596 | 2850 | |
c350a04e MG |
2851 | /* |
2852 | * Make sure we do not leak PI boosting priority to the child. | |
2853 | */ | |
2854 | p->prio = current->normal_prio; | |
2855 | ||
e8f14172 PB |
2856 | uclamp_fork(p); |
2857 | ||
b9dc29e7 MG |
2858 | /* |
2859 | * Revert to default priority/policy on fork if requested. | |
2860 | */ | |
2861 | if (unlikely(p->sched_reset_on_fork)) { | |
aab03e05 | 2862 | if (task_has_dl_policy(p) || task_has_rt_policy(p)) { |
b9dc29e7 | 2863 | p->policy = SCHED_NORMAL; |
6c697bdf | 2864 | p->static_prio = NICE_TO_PRIO(0); |
c350a04e MG |
2865 | p->rt_priority = 0; |
2866 | } else if (PRIO_TO_NICE(p->static_prio) < 0) | |
2867 | p->static_prio = NICE_TO_PRIO(0); | |
2868 | ||
2869 | p->prio = p->normal_prio = __normal_prio(p); | |
9059393e | 2870 | set_load_weight(p, false); |
6c697bdf | 2871 | |
b9dc29e7 MG |
2872 | /* |
2873 | * We don't need the reset flag anymore after the fork. It has | |
2874 | * fulfilled its duty: | |
2875 | */ | |
2876 | p->sched_reset_on_fork = 0; | |
2877 | } | |
ca94c442 | 2878 | |
af0fffd9 | 2879 | if (dl_prio(p->prio)) |
aab03e05 | 2880 | return -EAGAIN; |
af0fffd9 | 2881 | else if (rt_prio(p->prio)) |
aab03e05 | 2882 | p->sched_class = &rt_sched_class; |
af0fffd9 | 2883 | else |
2ddbf952 | 2884 | p->sched_class = &fair_sched_class; |
b29739f9 | 2885 | |
7dc603c9 | 2886 | init_entity_runnable_average(&p->se); |
cd29fe6f | 2887 | |
86951599 PZ |
2888 | /* |
2889 | * The child is not yet in the pid-hash so no cgroup attach races, | |
2890 | * and the cgroup is pinned to this child due to cgroup_fork() | |
2891 | * is ran before sched_fork(). | |
2892 | * | |
2893 | * Silence PROVE_RCU. | |
2894 | */ | |
0122ec5b | 2895 | raw_spin_lock_irqsave(&p->pi_lock, flags); |
e210bffd | 2896 | /* |
d1ccc66d | 2897 | * We're setting the CPU for the first time, we don't migrate, |
e210bffd PZ |
2898 | * so use __set_task_cpu(). |
2899 | */ | |
af0fffd9 | 2900 | __set_task_cpu(p, smp_processor_id()); |
e210bffd PZ |
2901 | if (p->sched_class->task_fork) |
2902 | p->sched_class->task_fork(p); | |
0122ec5b | 2903 | raw_spin_unlock_irqrestore(&p->pi_lock, flags); |
5f3edc1b | 2904 | |
f6db8347 | 2905 | #ifdef CONFIG_SCHED_INFO |
dd41f596 | 2906 | if (likely(sched_info_on())) |
52f17b6c | 2907 | memset(&p->sched_info, 0, sizeof(p->sched_info)); |
1da177e4 | 2908 | #endif |
3ca7a440 PZ |
2909 | #if defined(CONFIG_SMP) |
2910 | p->on_cpu = 0; | |
4866cde0 | 2911 | #endif |
01028747 | 2912 | init_task_preempt_count(p); |
806c09a7 | 2913 | #ifdef CONFIG_SMP |
917b627d | 2914 | plist_node_init(&p->pushable_tasks, MAX_PRIO); |
1baca4ce | 2915 | RB_CLEAR_NODE(&p->pushable_dl_tasks); |
806c09a7 | 2916 | #endif |
aab03e05 | 2917 | return 0; |
1da177e4 LT |
2918 | } |
2919 | ||
332ac17e DF |
2920 | unsigned long to_ratio(u64 period, u64 runtime) |
2921 | { | |
2922 | if (runtime == RUNTIME_INF) | |
c52f14d3 | 2923 | return BW_UNIT; |
332ac17e DF |
2924 | |
2925 | /* | |
2926 | * Doing this here saves a lot of checks in all | |
2927 | * the calling paths, and returning zero seems | |
2928 | * safe for them anyway. | |
2929 | */ | |
2930 | if (period == 0) | |
2931 | return 0; | |
2932 | ||
c52f14d3 | 2933 | return div64_u64(runtime << BW_SHIFT, period); |
332ac17e DF |
2934 | } |
2935 | ||
1da177e4 LT |
2936 | /* |
2937 | * wake_up_new_task - wake up a newly created task for the first time. | |
2938 | * | |
2939 | * This function will do some initial scheduler statistics housekeeping | |
2940 | * that must be done for every newly created context, then puts the task | |
2941 | * on the runqueue and wakes it. | |
2942 | */ | |
3e51e3ed | 2943 | void wake_up_new_task(struct task_struct *p) |
1da177e4 | 2944 | { |
eb580751 | 2945 | struct rq_flags rf; |
dd41f596 | 2946 | struct rq *rq; |
fabf318e | 2947 | |
eb580751 | 2948 | raw_spin_lock_irqsave(&p->pi_lock, rf.flags); |
7dc603c9 | 2949 | p->state = TASK_RUNNING; |
fabf318e PZ |
2950 | #ifdef CONFIG_SMP |
2951 | /* | |
2952 | * Fork balancing, do it here and not earlier because: | |
3bd37062 | 2953 | * - cpus_ptr can change in the fork path |
d1ccc66d | 2954 | * - any previously selected CPU might disappear through hotplug |
e210bffd PZ |
2955 | * |
2956 | * Use __set_task_cpu() to avoid calling sched_class::migrate_task_rq, | |
2957 | * as we're not fully set-up yet. | |
fabf318e | 2958 | */ |
32e839dd | 2959 | p->recent_used_cpu = task_cpu(p); |
e210bffd | 2960 | __set_task_cpu(p, select_task_rq(p, task_cpu(p), SD_BALANCE_FORK, 0)); |
0017d735 | 2961 | #endif |
b7fa30c9 | 2962 | rq = __task_rq_lock(p, &rf); |
4126bad6 | 2963 | update_rq_clock(rq); |
d0fe0b9c | 2964 | post_init_entity_util_avg(p); |
0017d735 | 2965 | |
7a57f32a | 2966 | activate_task(rq, p, ENQUEUE_NOCLOCK); |
fbd705a0 | 2967 | trace_sched_wakeup_new(p); |
a7558e01 | 2968 | check_preempt_curr(rq, p, WF_FORK); |
9a897c5a | 2969 | #ifdef CONFIG_SMP |
0aaafaab PZ |
2970 | if (p->sched_class->task_woken) { |
2971 | /* | |
2972 | * Nothing relies on rq->lock after this, so its fine to | |
2973 | * drop it. | |
2974 | */ | |
d8ac8971 | 2975 | rq_unpin_lock(rq, &rf); |
efbbd05a | 2976 | p->sched_class->task_woken(rq, p); |
d8ac8971 | 2977 | rq_repin_lock(rq, &rf); |
0aaafaab | 2978 | } |
9a897c5a | 2979 | #endif |
eb580751 | 2980 | task_rq_unlock(rq, p, &rf); |
1da177e4 LT |
2981 | } |
2982 | ||
e107be36 AK |
2983 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
2984 | ||
b7203428 | 2985 | static DEFINE_STATIC_KEY_FALSE(preempt_notifier_key); |
1cde2930 | 2986 | |
2ecd9d29 PZ |
2987 | void preempt_notifier_inc(void) |
2988 | { | |
b7203428 | 2989 | static_branch_inc(&preempt_notifier_key); |
2ecd9d29 PZ |
2990 | } |
2991 | EXPORT_SYMBOL_GPL(preempt_notifier_inc); | |
2992 | ||
2993 | void preempt_notifier_dec(void) | |
2994 | { | |
b7203428 | 2995 | static_branch_dec(&preempt_notifier_key); |
2ecd9d29 PZ |
2996 | } |
2997 | EXPORT_SYMBOL_GPL(preempt_notifier_dec); | |
2998 | ||
e107be36 | 2999 | /** |
80dd99b3 | 3000 | * preempt_notifier_register - tell me when current is being preempted & rescheduled |
421cee29 | 3001 | * @notifier: notifier struct to register |
e107be36 AK |
3002 | */ |
3003 | void preempt_notifier_register(struct preempt_notifier *notifier) | |
3004 | { | |
b7203428 | 3005 | if (!static_branch_unlikely(&preempt_notifier_key)) |
2ecd9d29 PZ |
3006 | WARN(1, "registering preempt_notifier while notifiers disabled\n"); |
3007 | ||
e107be36 AK |
3008 | hlist_add_head(¬ifier->link, ¤t->preempt_notifiers); |
3009 | } | |
3010 | EXPORT_SYMBOL_GPL(preempt_notifier_register); | |
3011 | ||
3012 | /** | |
3013 | * preempt_notifier_unregister - no longer interested in preemption notifications | |
421cee29 | 3014 | * @notifier: notifier struct to unregister |
e107be36 | 3015 | * |
d84525a8 | 3016 | * This is *not* safe to call from within a preemption notifier. |
e107be36 AK |
3017 | */ |
3018 | void preempt_notifier_unregister(struct preempt_notifier *notifier) | |
3019 | { | |
3020 | hlist_del(¬ifier->link); | |
3021 | } | |
3022 | EXPORT_SYMBOL_GPL(preempt_notifier_unregister); | |
3023 | ||
1cde2930 | 3024 | static void __fire_sched_in_preempt_notifiers(struct task_struct *curr) |
e107be36 AK |
3025 | { |
3026 | struct preempt_notifier *notifier; | |
e107be36 | 3027 | |
b67bfe0d | 3028 | hlist_for_each_entry(notifier, &curr->preempt_notifiers, link) |
e107be36 AK |
3029 | notifier->ops->sched_in(notifier, raw_smp_processor_id()); |
3030 | } | |
3031 | ||
1cde2930 PZ |
3032 | static __always_inline void fire_sched_in_preempt_notifiers(struct task_struct *curr) |
3033 | { | |
b7203428 | 3034 | if (static_branch_unlikely(&preempt_notifier_key)) |
1cde2930 PZ |
3035 | __fire_sched_in_preempt_notifiers(curr); |
3036 | } | |
3037 | ||
e107be36 | 3038 | static void |
1cde2930 PZ |
3039 | __fire_sched_out_preempt_notifiers(struct task_struct *curr, |
3040 | struct task_struct *next) | |
e107be36 AK |
3041 | { |
3042 | struct preempt_notifier *notifier; | |
e107be36 | 3043 | |
b67bfe0d | 3044 | hlist_for_each_entry(notifier, &curr->preempt_notifiers, link) |
e107be36 AK |
3045 | notifier->ops->sched_out(notifier, next); |
3046 | } | |
3047 | ||
1cde2930 PZ |
3048 | static __always_inline void |
3049 | fire_sched_out_preempt_notifiers(struct task_struct *curr, | |
3050 | struct task_struct *next) | |
3051 | { | |
b7203428 | 3052 | if (static_branch_unlikely(&preempt_notifier_key)) |
1cde2930 PZ |
3053 | __fire_sched_out_preempt_notifiers(curr, next); |
3054 | } | |
3055 | ||
6d6bc0ad | 3056 | #else /* !CONFIG_PREEMPT_NOTIFIERS */ |
e107be36 | 3057 | |
1cde2930 | 3058 | static inline void fire_sched_in_preempt_notifiers(struct task_struct *curr) |
e107be36 AK |
3059 | { |
3060 | } | |
3061 | ||
1cde2930 | 3062 | static inline void |
e107be36 AK |
3063 | fire_sched_out_preempt_notifiers(struct task_struct *curr, |
3064 | struct task_struct *next) | |
3065 | { | |
3066 | } | |
3067 | ||
6d6bc0ad | 3068 | #endif /* CONFIG_PREEMPT_NOTIFIERS */ |
e107be36 | 3069 | |
31cb1bc0 | 3070 | static inline void prepare_task(struct task_struct *next) |
3071 | { | |
3072 | #ifdef CONFIG_SMP | |
3073 | /* | |
3074 | * Claim the task as running, we do this before switching to it | |
3075 | * such that any running task will have this set. | |
3076 | */ | |
3077 | next->on_cpu = 1; | |
3078 | #endif | |
3079 | } | |
3080 | ||
3081 | static inline void finish_task(struct task_struct *prev) | |
3082 | { | |
3083 | #ifdef CONFIG_SMP | |
3084 | /* | |
3085 | * After ->on_cpu is cleared, the task can be moved to a different CPU. | |
3086 | * We must ensure this doesn't happen until the switch is completely | |
3087 | * finished. | |
3088 | * | |
3089 | * In particular, the load of prev->state in finish_task_switch() must | |
3090 | * happen before this. | |
3091 | * | |
3092 | * Pairs with the smp_cond_load_acquire() in try_to_wake_up(). | |
3093 | */ | |
3094 | smp_store_release(&prev->on_cpu, 0); | |
3095 | #endif | |
3096 | } | |
3097 | ||
269d5992 PZ |
3098 | static inline void |
3099 | prepare_lock_switch(struct rq *rq, struct task_struct *next, struct rq_flags *rf) | |
31cb1bc0 | 3100 | { |
269d5992 PZ |
3101 | /* |
3102 | * Since the runqueue lock will be released by the next | |
3103 | * task (which is an invalid locking op but in the case | |
3104 | * of the scheduler it's an obvious special-case), so we | |
3105 | * do an early lockdep release here: | |
3106 | */ | |
3107 | rq_unpin_lock(rq, rf); | |
3108 | spin_release(&rq->lock.dep_map, 1, _THIS_IP_); | |
31cb1bc0 | 3109 | #ifdef CONFIG_DEBUG_SPINLOCK |
3110 | /* this is a valid case when another task releases the spinlock */ | |
269d5992 | 3111 | rq->lock.owner = next; |
31cb1bc0 | 3112 | #endif |
269d5992 PZ |
3113 | } |
3114 | ||
3115 | static inline void finish_lock_switch(struct rq *rq) | |
3116 | { | |
31cb1bc0 | 3117 | /* |
3118 | * If we are tracking spinlock dependencies then we have to | |
3119 | * fix up the runqueue lock - which gets 'carried over' from | |
3120 | * prev into current: | |
3121 | */ | |
3122 | spin_acquire(&rq->lock.dep_map, 0, 0, _THIS_IP_); | |
31cb1bc0 | 3123 | raw_spin_unlock_irq(&rq->lock); |
3124 | } | |
3125 | ||
325ea10c IM |
3126 | /* |
3127 | * NOP if the arch has not defined these: | |
3128 | */ | |
3129 | ||
3130 | #ifndef prepare_arch_switch | |
3131 | # define prepare_arch_switch(next) do { } while (0) | |
3132 | #endif | |
3133 | ||
3134 | #ifndef finish_arch_post_lock_switch | |
3135 | # define finish_arch_post_lock_switch() do { } while (0) | |
3136 | #endif | |
3137 | ||
4866cde0 NP |
3138 | /** |
3139 | * prepare_task_switch - prepare to switch tasks | |
3140 | * @rq: the runqueue preparing to switch | |
421cee29 | 3141 | * @prev: the current task that is being switched out |
4866cde0 NP |
3142 | * @next: the task we are going to switch to. |
3143 | * | |
3144 | * This is called with the rq lock held and interrupts off. It must | |
3145 | * be paired with a subsequent finish_task_switch after the context | |
3146 | * switch. | |
3147 | * | |
3148 | * prepare_task_switch sets up locking and calls architecture specific | |
3149 | * hooks. | |
3150 | */ | |
e107be36 AK |
3151 | static inline void |
3152 | prepare_task_switch(struct rq *rq, struct task_struct *prev, | |
3153 | struct task_struct *next) | |
4866cde0 | 3154 | { |
0ed557aa | 3155 | kcov_prepare_switch(prev); |
43148951 | 3156 | sched_info_switch(rq, prev, next); |
fe4b04fa | 3157 | perf_event_task_sched_out(prev, next); |
d7822b1e | 3158 | rseq_preempt(prev); |
e107be36 | 3159 | fire_sched_out_preempt_notifiers(prev, next); |
31cb1bc0 | 3160 | prepare_task(next); |
4866cde0 NP |
3161 | prepare_arch_switch(next); |
3162 | } | |
3163 | ||
1da177e4 LT |
3164 | /** |
3165 | * finish_task_switch - clean up after a task-switch | |
3166 | * @prev: the thread we just switched away from. | |
3167 | * | |
4866cde0 NP |
3168 | * finish_task_switch must be called after the context switch, paired |
3169 | * with a prepare_task_switch call before the context switch. | |
3170 | * finish_task_switch will reconcile locking set up by prepare_task_switch, | |
3171 | * and do any other architecture-specific cleanup actions. | |
1da177e4 LT |
3172 | * |
3173 | * Note that we may have delayed dropping an mm in context_switch(). If | |
41a2d6cf | 3174 | * so, we finish that here outside of the runqueue lock. (Doing it |
1da177e4 LT |
3175 | * with the lock held can cause deadlocks; see schedule() for |
3176 | * details.) | |
dfa50b60 ON |
3177 | * |
3178 | * The context switch have flipped the stack from under us and restored the | |
3179 | * local variables which were saved when this task called schedule() in the | |
3180 | * past. prev == current is still correct but we need to recalculate this_rq | |
3181 | * because prev may have moved to another CPU. | |
1da177e4 | 3182 | */ |
dfa50b60 | 3183 | static struct rq *finish_task_switch(struct task_struct *prev) |
1da177e4 LT |
3184 | __releases(rq->lock) |
3185 | { | |
dfa50b60 | 3186 | struct rq *rq = this_rq(); |
1da177e4 | 3187 | struct mm_struct *mm = rq->prev_mm; |
55a101f8 | 3188 | long prev_state; |
1da177e4 | 3189 | |
609ca066 PZ |
3190 | /* |
3191 | * The previous task will have left us with a preempt_count of 2 | |
3192 | * because it left us after: | |
3193 | * | |
3194 | * schedule() | |
3195 | * preempt_disable(); // 1 | |
3196 | * __schedule() | |
3197 | * raw_spin_lock_irq(&rq->lock) // 2 | |
3198 | * | |
3199 | * Also, see FORK_PREEMPT_COUNT. | |
3200 | */ | |
e2bf1c4b PZ |
3201 | if (WARN_ONCE(preempt_count() != 2*PREEMPT_DISABLE_OFFSET, |
3202 | "corrupted preempt_count: %s/%d/0x%x\n", | |
3203 | current->comm, current->pid, preempt_count())) | |
3204 | preempt_count_set(FORK_PREEMPT_COUNT); | |
609ca066 | 3205 | |
1da177e4 LT |
3206 | rq->prev_mm = NULL; |
3207 | ||
3208 | /* | |
3209 | * A task struct has one reference for the use as "current". | |
c394cc9f | 3210 | * If a task dies, then it sets TASK_DEAD in tsk->state and calls |
55a101f8 ON |
3211 | * schedule one last time. The schedule call will never return, and |
3212 | * the scheduled task must drop that reference. | |
95913d97 PZ |
3213 | * |
3214 | * We must observe prev->state before clearing prev->on_cpu (in | |
31cb1bc0 | 3215 | * finish_task), otherwise a concurrent wakeup can get prev |
95913d97 PZ |
3216 | * running on another CPU and we could rave with its RUNNING -> DEAD |
3217 | * transition, resulting in a double drop. | |
1da177e4 | 3218 | */ |
55a101f8 | 3219 | prev_state = prev->state; |
bf9fae9f | 3220 | vtime_task_switch(prev); |
a8d757ef | 3221 | perf_event_task_sched_in(prev, current); |
31cb1bc0 | 3222 | finish_task(prev); |
3223 | finish_lock_switch(rq); | |
01f23e16 | 3224 | finish_arch_post_lock_switch(); |
0ed557aa | 3225 | kcov_finish_switch(current); |
e8fa1362 | 3226 | |
e107be36 | 3227 | fire_sched_in_preempt_notifiers(current); |
306e0604 | 3228 | /* |
70216e18 MD |
3229 | * When switching through a kernel thread, the loop in |
3230 | * membarrier_{private,global}_expedited() may have observed that | |
3231 | * kernel thread and not issued an IPI. It is therefore possible to | |
3232 | * schedule between user->kernel->user threads without passing though | |
3233 | * switch_mm(). Membarrier requires a barrier after storing to | |
3234 | * rq->curr, before returning to userspace, so provide them here: | |
3235 | * | |
3236 | * - a full memory barrier for {PRIVATE,GLOBAL}_EXPEDITED, implicitly | |
3237 | * provided by mmdrop(), | |
3238 | * - a sync_core for SYNC_CORE. | |
306e0604 | 3239 | */ |
70216e18 MD |
3240 | if (mm) { |
3241 | membarrier_mm_sync_core_before_usermode(mm); | |
1da177e4 | 3242 | mmdrop(mm); |
70216e18 | 3243 | } |
1cef1150 PZ |
3244 | if (unlikely(prev_state == TASK_DEAD)) { |
3245 | if (prev->sched_class->task_dead) | |
3246 | prev->sched_class->task_dead(prev); | |
68f24b08 | 3247 | |
1cef1150 PZ |
3248 | /* |
3249 | * Remove function-return probe instances associated with this | |
3250 | * task and put them back on the free list. | |
3251 | */ | |
3252 | kprobe_flush_task(prev); | |
3253 | ||
3254 | /* Task is done with its stack. */ | |
3255 | put_task_stack(prev); | |
3256 | ||
0ff7b2cf | 3257 | put_task_struct_rcu_user(prev); |
c6fd91f0 | 3258 | } |
99e5ada9 | 3259 | |
de734f89 | 3260 | tick_nohz_task_switch(); |
dfa50b60 | 3261 | return rq; |
1da177e4 LT |
3262 | } |
3263 | ||
3f029d3c GH |
3264 | #ifdef CONFIG_SMP |
3265 | ||
3f029d3c | 3266 | /* rq->lock is NOT held, but preemption is disabled */ |
e3fca9e7 | 3267 | static void __balance_callback(struct rq *rq) |
3f029d3c | 3268 | { |
e3fca9e7 PZ |
3269 | struct callback_head *head, *next; |
3270 | void (*func)(struct rq *rq); | |
3271 | unsigned long flags; | |
3f029d3c | 3272 | |
e3fca9e7 PZ |
3273 | raw_spin_lock_irqsave(&rq->lock, flags); |
3274 | head = rq->balance_callback; | |
3275 | rq->balance_callback = NULL; | |
3276 | while (head) { | |
3277 | func = (void (*)(struct rq *))head->func; | |
3278 | next = head->next; | |
3279 | head->next = NULL; | |
3280 | head = next; | |
3f029d3c | 3281 | |
e3fca9e7 | 3282 | func(rq); |
3f029d3c | 3283 | } |
e3fca9e7 PZ |
3284 | raw_spin_unlock_irqrestore(&rq->lock, flags); |
3285 | } | |
3286 | ||
3287 | static inline void balance_callback(struct rq *rq) | |
3288 | { | |
3289 | if (unlikely(rq->balance_callback)) | |
3290 | __balance_callback(rq); | |
3f029d3c GH |
3291 | } |
3292 | ||
3293 | #else | |
da19ab51 | 3294 | |
e3fca9e7 | 3295 | static inline void balance_callback(struct rq *rq) |
3f029d3c | 3296 | { |
1da177e4 LT |
3297 | } |
3298 | ||
3f029d3c GH |
3299 | #endif |
3300 | ||
1da177e4 LT |
3301 | /** |
3302 | * schedule_tail - first thing a freshly forked thread must call. | |
3303 | * @prev: the thread we just switched away from. | |
3304 | */ | |
722a9f92 | 3305 | asmlinkage __visible void schedule_tail(struct task_struct *prev) |
1da177e4 LT |
3306 | __releases(rq->lock) |
3307 | { | |
1a43a14a | 3308 | struct rq *rq; |
da19ab51 | 3309 | |
609ca066 PZ |
3310 | /* |
3311 | * New tasks start with FORK_PREEMPT_COUNT, see there and | |
3312 | * finish_task_switch() for details. | |
3313 | * | |
3314 | * finish_task_switch() will drop rq->lock() and lower preempt_count | |
3315 | * and the preempt_enable() will end up enabling preemption (on | |
3316 | * PREEMPT_COUNT kernels). | |
3317 | */ | |
3318 | ||
dfa50b60 | 3319 | rq = finish_task_switch(prev); |
e3fca9e7 | 3320 | balance_callback(rq); |
1a43a14a | 3321 | preempt_enable(); |
70b97a7f | 3322 | |
1da177e4 | 3323 | if (current->set_child_tid) |
b488893a | 3324 | put_user(task_pid_vnr(current), current->set_child_tid); |
088fe47c EB |
3325 | |
3326 | calculate_sigpending(); | |
1da177e4 LT |
3327 | } |
3328 | ||
3329 | /* | |
dfa50b60 | 3330 | * context_switch - switch to the new MM and the new thread's register state. |
1da177e4 | 3331 | */ |
04936948 | 3332 | static __always_inline struct rq * |
70b97a7f | 3333 | context_switch(struct rq *rq, struct task_struct *prev, |
d8ac8971 | 3334 | struct task_struct *next, struct rq_flags *rf) |
1da177e4 | 3335 | { |
e107be36 | 3336 | prepare_task_switch(rq, prev, next); |
fe4b04fa | 3337 | |
9226d125 ZA |
3338 | /* |
3339 | * For paravirt, this is coupled with an exit in switch_to to | |
3340 | * combine the page table reload and the switch backend into | |
3341 | * one hypercall. | |
3342 | */ | |
224101ed | 3343 | arch_start_context_switch(prev); |
9226d125 | 3344 | |
306e0604 | 3345 | /* |
139d025c PZ |
3346 | * kernel -> kernel lazy + transfer active |
3347 | * user -> kernel lazy + mmgrab() active | |
3348 | * | |
3349 | * kernel -> user switch + mmdrop() active | |
3350 | * user -> user switch | |
306e0604 | 3351 | */ |
139d025c PZ |
3352 | if (!next->mm) { // to kernel |
3353 | enter_lazy_tlb(prev->active_mm, next); | |
3354 | ||
3355 | next->active_mm = prev->active_mm; | |
3356 | if (prev->mm) // from user | |
3357 | mmgrab(prev->active_mm); | |
3358 | else | |
3359 | prev->active_mm = NULL; | |
3360 | } else { // to user | |
3361 | /* | |
3362 | * sys_membarrier() requires an smp_mb() between setting | |
3363 | * rq->curr and returning to userspace. | |
3364 | * | |
3365 | * The below provides this either through switch_mm(), or in | |
3366 | * case 'prev->active_mm == next->mm' through | |
3367 | * finish_task_switch()'s mmdrop(). | |
3368 | */ | |
3369 | ||
3370 | switch_mm_irqs_off(prev->active_mm, next->mm, next); | |
1da177e4 | 3371 | |
139d025c PZ |
3372 | if (!prev->mm) { // from kernel |
3373 | /* will mmdrop() in finish_task_switch(). */ | |
3374 | rq->prev_mm = prev->active_mm; | |
3375 | prev->active_mm = NULL; | |
3376 | } | |
1da177e4 | 3377 | } |
92509b73 | 3378 | |
cb42c9a3 | 3379 | rq->clock_update_flags &= ~(RQCF_ACT_SKIP|RQCF_REQ_SKIP); |
92509b73 | 3380 | |
269d5992 | 3381 | prepare_lock_switch(rq, next, rf); |
1da177e4 LT |
3382 | |
3383 | /* Here we just switch the register state and the stack. */ | |
3384 | switch_to(prev, next, prev); | |
dd41f596 | 3385 | barrier(); |
dfa50b60 ON |
3386 | |
3387 | return finish_task_switch(prev); | |
1da177e4 LT |
3388 | } |
3389 | ||
3390 | /* | |
1c3e8264 | 3391 | * nr_running and nr_context_switches: |
1da177e4 LT |
3392 | * |
3393 | * externally visible scheduler statistics: current number of runnable | |
1c3e8264 | 3394 | * threads, total number of context switches performed since bootup. |
1da177e4 LT |
3395 | */ |
3396 | unsigned long nr_running(void) | |
3397 | { | |
3398 | unsigned long i, sum = 0; | |
3399 | ||
3400 | for_each_online_cpu(i) | |
3401 | sum += cpu_rq(i)->nr_running; | |
3402 | ||
3403 | return sum; | |
f711f609 | 3404 | } |
1da177e4 | 3405 | |
2ee507c4 | 3406 | /* |
d1ccc66d | 3407 | * Check if only the current task is running on the CPU. |
00cc1633 DD |
3408 | * |
3409 | * Caution: this function does not check that the caller has disabled | |
3410 | * preemption, thus the result might have a time-of-check-to-time-of-use | |
3411 | * race. The caller is responsible to use it correctly, for example: | |
3412 | * | |
dfcb245e | 3413 | * - from a non-preemptible section (of course) |
00cc1633 DD |
3414 | * |
3415 | * - from a thread that is bound to a single CPU | |
3416 | * | |
3417 | * - in a loop with very short iterations (e.g. a polling loop) | |
2ee507c4 TC |
3418 | */ |
3419 | bool single_task_running(void) | |
3420 | { | |
00cc1633 | 3421 | return raw_rq()->nr_running == 1; |
2ee507c4 TC |
3422 | } |
3423 | EXPORT_SYMBOL(single_task_running); | |
3424 | ||
1da177e4 | 3425 | unsigned long long nr_context_switches(void) |
46cb4b7c | 3426 | { |
cc94abfc SR |
3427 | int i; |
3428 | unsigned long long sum = 0; | |
46cb4b7c | 3429 | |
0a945022 | 3430 | for_each_possible_cpu(i) |
1da177e4 | 3431 | sum += cpu_rq(i)->nr_switches; |
46cb4b7c | 3432 | |
1da177e4 LT |
3433 | return sum; |
3434 | } | |
483b4ee6 | 3435 | |
145d952a DL |
3436 | /* |
3437 | * Consumers of these two interfaces, like for example the cpuidle menu | |
3438 | * governor, are using nonsensical data. Preferring shallow idle state selection | |
3439 | * for a CPU that has IO-wait which might not even end up running the task when | |
3440 | * it does become runnable. | |
3441 | */ | |
3442 | ||
3443 | unsigned long nr_iowait_cpu(int cpu) | |
3444 | { | |
3445 | return atomic_read(&cpu_rq(cpu)->nr_iowait); | |
3446 | } | |
3447 | ||
e33a9bba TH |
3448 | /* |
3449 | * IO-wait accounting, and how its mostly bollocks (on SMP). | |
3450 | * | |
3451 | * The idea behind IO-wait account is to account the idle time that we could | |
3452 | * have spend running if it were not for IO. That is, if we were to improve the | |
3453 | * storage performance, we'd have a proportional reduction in IO-wait time. | |
3454 | * | |
3455 | * This all works nicely on UP, where, when a task blocks on IO, we account | |
3456 | * idle time as IO-wait, because if the storage were faster, it could've been | |
3457 | * running and we'd not be idle. | |
3458 | * | |
3459 | * This has been extended to SMP, by doing the same for each CPU. This however | |
3460 | * is broken. | |
3461 | * | |
3462 | * Imagine for instance the case where two tasks block on one CPU, only the one | |
3463 | * CPU will have IO-wait accounted, while the other has regular idle. Even | |
3464 | * though, if the storage were faster, both could've ran at the same time, | |
3465 | * utilising both CPUs. | |
3466 | * | |
3467 | * This means, that when looking globally, the current IO-wait accounting on | |
3468 | * SMP is a lower bound, by reason of under accounting. | |
3469 | * | |
3470 | * Worse, since the numbers are provided per CPU, they are sometimes | |
3471 | * interpreted per CPU, and that is nonsensical. A blocked task isn't strictly | |
3472 | * associated with any one particular CPU, it can wake to another CPU than it | |
3473 | * blocked on. This means the per CPU IO-wait number is meaningless. | |
3474 | * | |
3475 | * Task CPU affinities can make all that even more 'interesting'. | |
3476 | */ | |
3477 | ||
1da177e4 LT |
3478 | unsigned long nr_iowait(void) |
3479 | { | |
3480 | unsigned long i, sum = 0; | |
483b4ee6 | 3481 | |
0a945022 | 3482 | for_each_possible_cpu(i) |
145d952a | 3483 | sum += nr_iowait_cpu(i); |
46cb4b7c | 3484 | |
1da177e4 LT |
3485 | return sum; |
3486 | } | |
483b4ee6 | 3487 | |
dd41f596 | 3488 | #ifdef CONFIG_SMP |
8a0be9ef | 3489 | |
46cb4b7c | 3490 | /* |
38022906 PZ |
3491 | * sched_exec - execve() is a valuable balancing opportunity, because at |
3492 | * this point the task has the smallest effective memory and cache footprint. | |
46cb4b7c | 3493 | */ |
38022906 | 3494 | void sched_exec(void) |
46cb4b7c | 3495 | { |
38022906 | 3496 | struct task_struct *p = current; |
1da177e4 | 3497 | unsigned long flags; |
0017d735 | 3498 | int dest_cpu; |
46cb4b7c | 3499 | |
8f42ced9 | 3500 | raw_spin_lock_irqsave(&p->pi_lock, flags); |
ac66f547 | 3501 | dest_cpu = p->sched_class->select_task_rq(p, task_cpu(p), SD_BALANCE_EXEC, 0); |
0017d735 PZ |
3502 | if (dest_cpu == smp_processor_id()) |
3503 | goto unlock; | |
38022906 | 3504 | |
8f42ced9 | 3505 | if (likely(cpu_active(dest_cpu))) { |
969c7921 | 3506 | struct migration_arg arg = { p, dest_cpu }; |
46cb4b7c | 3507 | |
8f42ced9 PZ |
3508 | raw_spin_unlock_irqrestore(&p->pi_lock, flags); |
3509 | stop_one_cpu(task_cpu(p), migration_cpu_stop, &arg); | |
1da177e4 LT |
3510 | return; |
3511 | } | |
0017d735 | 3512 | unlock: |
8f42ced9 | 3513 | raw_spin_unlock_irqrestore(&p->pi_lock, flags); |
1da177e4 | 3514 | } |
dd41f596 | 3515 | |
1da177e4 LT |
3516 | #endif |
3517 | ||
1da177e4 | 3518 | DEFINE_PER_CPU(struct kernel_stat, kstat); |
3292beb3 | 3519 | DEFINE_PER_CPU(struct kernel_cpustat, kernel_cpustat); |
1da177e4 LT |
3520 | |
3521 | EXPORT_PER_CPU_SYMBOL(kstat); | |
3292beb3 | 3522 | EXPORT_PER_CPU_SYMBOL(kernel_cpustat); |
1da177e4 | 3523 | |
6075620b GG |
3524 | /* |
3525 | * The function fair_sched_class.update_curr accesses the struct curr | |
3526 | * and its field curr->exec_start; when called from task_sched_runtime(), | |
3527 | * we observe a high rate of cache misses in practice. | |
3528 | * Prefetching this data results in improved performance. | |
3529 | */ | |
3530 | static inline void prefetch_curr_exec_start(struct task_struct *p) | |
3531 | { | |
3532 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
3533 | struct sched_entity *curr = (&p->se)->cfs_rq->curr; | |
3534 | #else | |
3535 | struct sched_entity *curr = (&task_rq(p)->cfs)->curr; | |
3536 | #endif | |
3537 | prefetch(curr); | |
3538 | prefetch(&curr->exec_start); | |
3539 | } | |
3540 | ||
c5f8d995 HS |
3541 | /* |
3542 | * Return accounted runtime for the task. | |
3543 | * In case the task is currently running, return the runtime plus current's | |
3544 | * pending runtime that have not been accounted yet. | |
3545 | */ | |
3546 | unsigned long long task_sched_runtime(struct task_struct *p) | |
3547 | { | |
eb580751 | 3548 | struct rq_flags rf; |
c5f8d995 | 3549 | struct rq *rq; |
6e998916 | 3550 | u64 ns; |
c5f8d995 | 3551 | |
911b2898 PZ |
3552 | #if defined(CONFIG_64BIT) && defined(CONFIG_SMP) |
3553 | /* | |
97fb7a0a | 3554 | * 64-bit doesn't need locks to atomically read a 64-bit value. |
911b2898 PZ |
3555 | * So we have a optimization chance when the task's delta_exec is 0. |
3556 | * Reading ->on_cpu is racy, but this is ok. | |
3557 | * | |
d1ccc66d IM |
3558 | * If we race with it leaving CPU, we'll take a lock. So we're correct. |
3559 | * If we race with it entering CPU, unaccounted time is 0. This is | |
911b2898 | 3560 | * indistinguishable from the read occurring a few cycles earlier. |
4036ac15 MG |
3561 | * If we see ->on_cpu without ->on_rq, the task is leaving, and has |
3562 | * been accounted, so we're correct here as well. | |
911b2898 | 3563 | */ |
da0c1e65 | 3564 | if (!p->on_cpu || !task_on_rq_queued(p)) |
911b2898 PZ |
3565 | return p->se.sum_exec_runtime; |
3566 | #endif | |
3567 | ||
eb580751 | 3568 | rq = task_rq_lock(p, &rf); |
6e998916 SG |
3569 | /* |
3570 | * Must be ->curr _and_ ->on_rq. If dequeued, we would | |
3571 | * project cycles that may never be accounted to this | |
3572 | * thread, breaking clock_gettime(). | |
3573 | */ | |
3574 | if (task_current(rq, p) && task_on_rq_queued(p)) { | |
6075620b | 3575 | prefetch_curr_exec_start(p); |
6e998916 SG |
3576 | update_rq_clock(rq); |
3577 | p->sched_class->update_curr(rq); | |
3578 | } | |
3579 | ns = p->se.sum_exec_runtime; | |
eb580751 | 3580 | task_rq_unlock(rq, p, &rf); |
c5f8d995 HS |
3581 | |
3582 | return ns; | |
3583 | } | |
48f24c4d | 3584 | |
7835b98b CL |
3585 | /* |
3586 | * This function gets called by the timer code, with HZ frequency. | |
3587 | * We call it with interrupts disabled. | |
7835b98b CL |
3588 | */ |
3589 | void scheduler_tick(void) | |
3590 | { | |
7835b98b CL |
3591 | int cpu = smp_processor_id(); |
3592 | struct rq *rq = cpu_rq(cpu); | |
dd41f596 | 3593 | struct task_struct *curr = rq->curr; |
8a8c69c3 | 3594 | struct rq_flags rf; |
3e51f33f PZ |
3595 | |
3596 | sched_clock_tick(); | |
dd41f596 | 3597 | |
8a8c69c3 PZ |
3598 | rq_lock(rq, &rf); |
3599 | ||
3e51f33f | 3600 | update_rq_clock(rq); |
fa85ae24 | 3601 | curr->sched_class->task_tick(rq, curr, 0); |
3289bdb4 | 3602 | calc_global_load_tick(rq); |
eb414681 | 3603 | psi_task_tick(rq); |
8a8c69c3 PZ |
3604 | |
3605 | rq_unlock(rq, &rf); | |
7835b98b | 3606 | |
e9d2b064 | 3607 | perf_event_task_tick(); |
e220d2dc | 3608 | |
e418e1c2 | 3609 | #ifdef CONFIG_SMP |
6eb57e0d | 3610 | rq->idle_balance = idle_cpu(cpu); |
7caff66f | 3611 | trigger_load_balance(rq); |
e418e1c2 | 3612 | #endif |
1da177e4 LT |
3613 | } |
3614 | ||
265f22a9 | 3615 | #ifdef CONFIG_NO_HZ_FULL |
d84b3131 FW |
3616 | |
3617 | struct tick_work { | |
3618 | int cpu; | |
b55bd585 | 3619 | atomic_t state; |
d84b3131 FW |
3620 | struct delayed_work work; |
3621 | }; | |
b55bd585 PM |
3622 | /* Values for ->state, see diagram below. */ |
3623 | #define TICK_SCHED_REMOTE_OFFLINE 0 | |
3624 | #define TICK_SCHED_REMOTE_OFFLINING 1 | |
3625 | #define TICK_SCHED_REMOTE_RUNNING 2 | |
3626 | ||
3627 | /* | |
3628 | * State diagram for ->state: | |
3629 | * | |
3630 | * | |
3631 | * TICK_SCHED_REMOTE_OFFLINE | |
3632 | * | ^ | |
3633 | * | | | |
3634 | * | | sched_tick_remote() | |
3635 | * | | | |
3636 | * | | | |
3637 | * +--TICK_SCHED_REMOTE_OFFLINING | |
3638 | * | ^ | |
3639 | * | | | |
3640 | * sched_tick_start() | | sched_tick_stop() | |
3641 | * | | | |
3642 | * V | | |
3643 | * TICK_SCHED_REMOTE_RUNNING | |
3644 | * | |
3645 | * | |
3646 | * Other transitions get WARN_ON_ONCE(), except that sched_tick_remote() | |
3647 | * and sched_tick_start() are happy to leave the state in RUNNING. | |
3648 | */ | |
d84b3131 FW |
3649 | |
3650 | static struct tick_work __percpu *tick_work_cpu; | |
3651 | ||
3652 | static void sched_tick_remote(struct work_struct *work) | |
3653 | { | |
3654 | struct delayed_work *dwork = to_delayed_work(work); | |
3655 | struct tick_work *twork = container_of(dwork, struct tick_work, work); | |
3656 | int cpu = twork->cpu; | |
3657 | struct rq *rq = cpu_rq(cpu); | |
d9c0ffca | 3658 | struct task_struct *curr; |
d84b3131 | 3659 | struct rq_flags rf; |
d9c0ffca | 3660 | u64 delta; |
b55bd585 | 3661 | int os; |
d84b3131 FW |
3662 | |
3663 | /* | |
3664 | * Handle the tick only if it appears the remote CPU is running in full | |
3665 | * dynticks mode. The check is racy by nature, but missing a tick or | |
3666 | * having one too much is no big deal because the scheduler tick updates | |
3667 | * statistics and checks timeslices in a time-independent way, regardless | |
3668 | * of when exactly it is running. | |
3669 | */ | |
d9c0ffca FW |
3670 | if (idle_cpu(cpu) || !tick_nohz_tick_stopped_cpu(cpu)) |
3671 | goto out_requeue; | |
d84b3131 | 3672 | |
d9c0ffca FW |
3673 | rq_lock_irq(rq, &rf); |
3674 | curr = rq->curr; | |
b55bd585 | 3675 | if (is_idle_task(curr) || cpu_is_offline(cpu)) |
d9c0ffca | 3676 | goto out_unlock; |
d84b3131 | 3677 | |
d9c0ffca FW |
3678 | update_rq_clock(rq); |
3679 | delta = rq_clock_task(rq) - curr->se.exec_start; | |
3680 | ||
3681 | /* | |
3682 | * Make sure the next tick runs within a reasonable | |
3683 | * amount of time. | |
3684 | */ | |
3685 | WARN_ON_ONCE(delta > (u64)NSEC_PER_SEC * 3); | |
3686 | curr->sched_class->task_tick(rq, curr, 0); | |
3687 | ||
3688 | out_unlock: | |
3689 | rq_unlock_irq(rq, &rf); | |
d84b3131 | 3690 | |
d9c0ffca | 3691 | out_requeue: |
d84b3131 FW |
3692 | /* |
3693 | * Run the remote tick once per second (1Hz). This arbitrary | |
3694 | * frequency is large enough to avoid overload but short enough | |
b55bd585 PM |
3695 | * to keep scheduler internal stats reasonably up to date. But |
3696 | * first update state to reflect hotplug activity if required. | |
d84b3131 | 3697 | */ |
b55bd585 PM |
3698 | os = atomic_fetch_add_unless(&twork->state, -1, TICK_SCHED_REMOTE_RUNNING); |
3699 | WARN_ON_ONCE(os == TICK_SCHED_REMOTE_OFFLINE); | |
3700 | if (os == TICK_SCHED_REMOTE_RUNNING) | |
3701 | queue_delayed_work(system_unbound_wq, dwork, HZ); | |
d84b3131 FW |
3702 | } |
3703 | ||
3704 | static void sched_tick_start(int cpu) | |
3705 | { | |
b55bd585 | 3706 | int os; |
d84b3131 FW |
3707 | struct tick_work *twork; |
3708 | ||
3709 | if (housekeeping_cpu(cpu, HK_FLAG_TICK)) | |
3710 | return; | |
3711 | ||
3712 | WARN_ON_ONCE(!tick_work_cpu); | |
3713 | ||
3714 | twork = per_cpu_ptr(tick_work_cpu, cpu); | |
b55bd585 PM |
3715 | os = atomic_xchg(&twork->state, TICK_SCHED_REMOTE_RUNNING); |
3716 | WARN_ON_ONCE(os == TICK_SCHED_REMOTE_RUNNING); | |
3717 | if (os == TICK_SCHED_REMOTE_OFFLINE) { | |
3718 | twork->cpu = cpu; | |
3719 | INIT_DELAYED_WORK(&twork->work, sched_tick_remote); | |
3720 | queue_delayed_work(system_unbound_wq, &twork->work, HZ); | |
3721 | } | |
d84b3131 FW |
3722 | } |
3723 | ||
3724 | #ifdef CONFIG_HOTPLUG_CPU | |
3725 | static void sched_tick_stop(int cpu) | |
3726 | { | |
3727 | struct tick_work *twork; | |
b55bd585 | 3728 | int os; |
d84b3131 FW |
3729 | |
3730 | if (housekeeping_cpu(cpu, HK_FLAG_TICK)) | |
3731 | return; | |
3732 | ||
3733 | WARN_ON_ONCE(!tick_work_cpu); | |
3734 | ||
3735 | twork = per_cpu_ptr(tick_work_cpu, cpu); | |
b55bd585 PM |
3736 | /* There cannot be competing actions, but don't rely on stop-machine. */ |
3737 | os = atomic_xchg(&twork->state, TICK_SCHED_REMOTE_OFFLINING); | |
3738 | WARN_ON_ONCE(os != TICK_SCHED_REMOTE_RUNNING); | |
3739 | /* Don't cancel, as this would mess up the state machine. */ | |
d84b3131 FW |
3740 | } |
3741 | #endif /* CONFIG_HOTPLUG_CPU */ | |
3742 | ||
3743 | int __init sched_tick_offload_init(void) | |
3744 | { | |
3745 | tick_work_cpu = alloc_percpu(struct tick_work); | |
3746 | BUG_ON(!tick_work_cpu); | |
d84b3131 FW |
3747 | return 0; |
3748 | } | |
3749 | ||
3750 | #else /* !CONFIG_NO_HZ_FULL */ | |
3751 | static inline void sched_tick_start(int cpu) { } | |
3752 | static inline void sched_tick_stop(int cpu) { } | |
265f22a9 | 3753 | #endif |
1da177e4 | 3754 | |
c1a280b6 | 3755 | #if defined(CONFIG_PREEMPTION) && (defined(CONFIG_DEBUG_PREEMPT) || \ |
c3bc8fd6 | 3756 | defined(CONFIG_TRACE_PREEMPT_TOGGLE)) |
47252cfb SR |
3757 | /* |
3758 | * If the value passed in is equal to the current preempt count | |
3759 | * then we just disabled preemption. Start timing the latency. | |
3760 | */ | |
3761 | static inline void preempt_latency_start(int val) | |
3762 | { | |
3763 | if (preempt_count() == val) { | |
3764 | unsigned long ip = get_lock_parent_ip(); | |
3765 | #ifdef CONFIG_DEBUG_PREEMPT | |
3766 | current->preempt_disable_ip = ip; | |
3767 | #endif | |
3768 | trace_preempt_off(CALLER_ADDR0, ip); | |
3769 | } | |
3770 | } | |
7e49fcce | 3771 | |
edafe3a5 | 3772 | void preempt_count_add(int val) |
1da177e4 | 3773 | { |
6cd8a4bb | 3774 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
3775 | /* |
3776 | * Underflow? | |
3777 | */ | |
9a11b49a IM |
3778 | if (DEBUG_LOCKS_WARN_ON((preempt_count() < 0))) |
3779 | return; | |
6cd8a4bb | 3780 | #endif |
bdb43806 | 3781 | __preempt_count_add(val); |
6cd8a4bb | 3782 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
3783 | /* |
3784 | * Spinlock count overflowing soon? | |
3785 | */ | |
33859f7f MOS |
3786 | DEBUG_LOCKS_WARN_ON((preempt_count() & PREEMPT_MASK) >= |
3787 | PREEMPT_MASK - 10); | |
6cd8a4bb | 3788 | #endif |
47252cfb | 3789 | preempt_latency_start(val); |
1da177e4 | 3790 | } |
bdb43806 | 3791 | EXPORT_SYMBOL(preempt_count_add); |
edafe3a5 | 3792 | NOKPROBE_SYMBOL(preempt_count_add); |
1da177e4 | 3793 | |
47252cfb SR |
3794 | /* |
3795 | * If the value passed in equals to the current preempt count | |
3796 | * then we just enabled preemption. Stop timing the latency. | |
3797 | */ | |
3798 | static inline void preempt_latency_stop(int val) | |
3799 | { | |
3800 | if (preempt_count() == val) | |
3801 | trace_preempt_on(CALLER_ADDR0, get_lock_parent_ip()); | |
3802 | } | |
3803 | ||
edafe3a5 | 3804 | void preempt_count_sub(int val) |
1da177e4 | 3805 | { |
6cd8a4bb | 3806 | #ifdef CONFIG_DEBUG_PREEMPT |
1da177e4 LT |
3807 | /* |
3808 | * Underflow? | |
3809 | */ | |
01e3eb82 | 3810 | if (DEBUG_LOCKS_WARN_ON(val > preempt_count())) |
9a11b49a | 3811 | return; |
1da177e4 LT |
3812 | /* |
3813 | * Is the spinlock portion underflowing? | |
3814 | */ | |
9a11b49a IM |
3815 | if (DEBUG_LOCKS_WARN_ON((val < PREEMPT_MASK) && |
3816 | !(preempt_count() & PREEMPT_MASK))) | |
3817 | return; | |
6cd8a4bb | 3818 | #endif |
9a11b49a | 3819 | |
47252cfb | 3820 | preempt_latency_stop(val); |
bdb43806 | 3821 | __preempt_count_sub(val); |
1da177e4 | 3822 | } |
bdb43806 | 3823 | EXPORT_SYMBOL(preempt_count_sub); |
edafe3a5 | 3824 | NOKPROBE_SYMBOL(preempt_count_sub); |
1da177e4 | 3825 | |
47252cfb SR |
3826 | #else |
3827 | static inline void preempt_latency_start(int val) { } | |
3828 | static inline void preempt_latency_stop(int val) { } | |
1da177e4 LT |
3829 | #endif |
3830 | ||
59ddbcb2 IM |
3831 | static inline unsigned long get_preempt_disable_ip(struct task_struct *p) |
3832 | { | |
3833 | #ifdef CONFIG_DEBUG_PREEMPT | |
3834 | return p->preempt_disable_ip; | |
3835 | #else | |
3836 | return 0; | |
3837 | #endif | |
3838 | } | |
3839 | ||
1da177e4 | 3840 | /* |
dd41f596 | 3841 | * Print scheduling while atomic bug: |
1da177e4 | 3842 | */ |
dd41f596 | 3843 | static noinline void __schedule_bug(struct task_struct *prev) |
1da177e4 | 3844 | { |
d1c6d149 VN |
3845 | /* Save this before calling printk(), since that will clobber it */ |
3846 | unsigned long preempt_disable_ip = get_preempt_disable_ip(current); | |
3847 | ||
664dfa65 DJ |
3848 | if (oops_in_progress) |
3849 | return; | |
3850 | ||
3df0fc5b PZ |
3851 | printk(KERN_ERR "BUG: scheduling while atomic: %s/%d/0x%08x\n", |
3852 | prev->comm, prev->pid, preempt_count()); | |
838225b4 | 3853 | |
dd41f596 | 3854 | debug_show_held_locks(prev); |
e21f5b15 | 3855 | print_modules(); |
dd41f596 IM |
3856 | if (irqs_disabled()) |
3857 | print_irqtrace_events(prev); | |
d1c6d149 VN |
3858 | if (IS_ENABLED(CONFIG_DEBUG_PREEMPT) |
3859 | && in_atomic_preempt_off()) { | |
8f47b187 | 3860 | pr_err("Preemption disabled at:"); |
d1c6d149 | 3861 | print_ip_sym(preempt_disable_ip); |
8f47b187 TG |
3862 | pr_cont("\n"); |
3863 | } | |
748c7201 DBO |
3864 | if (panic_on_warn) |
3865 | panic("scheduling while atomic\n"); | |
3866 | ||
6135fc1e | 3867 | dump_stack(); |
373d4d09 | 3868 | add_taint(TAINT_WARN, LOCKDEP_STILL_OK); |
dd41f596 | 3869 | } |
1da177e4 | 3870 | |
dd41f596 IM |
3871 | /* |
3872 | * Various schedule()-time debugging checks and statistics: | |
3873 | */ | |
3874 | static inline void schedule_debug(struct task_struct *prev) | |
3875 | { | |
0d9e2632 | 3876 | #ifdef CONFIG_SCHED_STACK_END_CHECK |
29d64551 JH |
3877 | if (task_stack_end_corrupted(prev)) |
3878 | panic("corrupted stack end detected inside scheduler\n"); | |
0d9e2632 | 3879 | #endif |
b99def8b | 3880 | |
1dc0fffc | 3881 | if (unlikely(in_atomic_preempt_off())) { |
dd41f596 | 3882 | __schedule_bug(prev); |
1dc0fffc PZ |
3883 | preempt_count_set(PREEMPT_DISABLED); |
3884 | } | |
b3fbab05 | 3885 | rcu_sleep_check(); |
dd41f596 | 3886 | |
1da177e4 LT |
3887 | profile_hit(SCHED_PROFILING, __builtin_return_address(0)); |
3888 | ||
ae92882e | 3889 | schedstat_inc(this_rq()->sched_count); |
dd41f596 IM |
3890 | } |
3891 | ||
3892 | /* | |
3893 | * Pick up the highest-prio task: | |
3894 | */ | |
3895 | static inline struct task_struct * | |
d8ac8971 | 3896 | pick_next_task(struct rq *rq, struct task_struct *prev, struct rq_flags *rf) |
dd41f596 | 3897 | { |
49ee5768 | 3898 | const struct sched_class *class; |
dd41f596 | 3899 | struct task_struct *p; |
1da177e4 LT |
3900 | |
3901 | /* | |
0ba87bb2 PZ |
3902 | * Optimization: we know that if all tasks are in the fair class we can |
3903 | * call that function directly, but only if the @prev task wasn't of a | |
3904 | * higher scheduling class, because otherwise those loose the | |
3905 | * opportunity to pull in more work from other CPUs. | |
1da177e4 | 3906 | */ |
0ba87bb2 PZ |
3907 | if (likely((prev->sched_class == &idle_sched_class || |
3908 | prev->sched_class == &fair_sched_class) && | |
3909 | rq->nr_running == rq->cfs.h_nr_running)) { | |
3910 | ||
d8ac8971 | 3911 | p = fair_sched_class.pick_next_task(rq, prev, rf); |
6ccdc84b | 3912 | if (unlikely(p == RETRY_TASK)) |
67692435 | 3913 | goto restart; |
6ccdc84b | 3914 | |
d1ccc66d | 3915 | /* Assumes fair_sched_class->next == idle_sched_class */ |
6ccdc84b | 3916 | if (unlikely(!p)) |
d8ac8971 | 3917 | p = idle_sched_class.pick_next_task(rq, prev, rf); |
6ccdc84b PZ |
3918 | |
3919 | return p; | |
1da177e4 LT |
3920 | } |
3921 | ||
67692435 PZ |
3922 | restart: |
3923 | /* | |
3924 | * Ensure that we put DL/RT tasks before the pick loop, such that they | |
3925 | * can PULL higher prio tasks when we lower the RQ 'priority'. | |
3926 | */ | |
3927 | prev->sched_class->put_prev_task(rq, prev, rf); | |
3928 | if (!rq->nr_running) | |
3929 | newidle_balance(rq, rf); | |
3930 | ||
34f971f6 | 3931 | for_each_class(class) { |
67692435 PZ |
3932 | p = class->pick_next_task(rq, NULL, NULL); |
3933 | if (p) | |
dd41f596 | 3934 | return p; |
dd41f596 | 3935 | } |
34f971f6 | 3936 | |
d1ccc66d IM |
3937 | /* The idle class should always have a runnable task: */ |
3938 | BUG(); | |
dd41f596 | 3939 | } |
1da177e4 | 3940 | |
dd41f596 | 3941 | /* |
c259e01a | 3942 | * __schedule() is the main scheduler function. |
edde96ea PE |
3943 | * |
3944 | * The main means of driving the scheduler and thus entering this function are: | |
3945 | * | |
3946 | * 1. Explicit blocking: mutex, semaphore, waitqueue, etc. | |
3947 | * | |
3948 | * 2. TIF_NEED_RESCHED flag is checked on interrupt and userspace return | |
3949 | * paths. For example, see arch/x86/entry_64.S. | |
3950 | * | |
3951 | * To drive preemption between tasks, the scheduler sets the flag in timer | |
3952 | * interrupt handler scheduler_tick(). | |
3953 | * | |
3954 | * 3. Wakeups don't really cause entry into schedule(). They add a | |
3955 | * task to the run-queue and that's it. | |
3956 | * | |
3957 | * Now, if the new task added to the run-queue preempts the current | |
3958 | * task, then the wakeup sets TIF_NEED_RESCHED and schedule() gets | |
3959 | * called on the nearest possible occasion: | |
3960 | * | |
c1a280b6 | 3961 | * - If the kernel is preemptible (CONFIG_PREEMPTION=y): |
edde96ea PE |
3962 | * |
3963 | * - in syscall or exception context, at the next outmost | |
3964 | * preempt_enable(). (this might be as soon as the wake_up()'s | |
3965 | * spin_unlock()!) | |
3966 | * | |
3967 | * - in IRQ context, return from interrupt-handler to | |
3968 | * preemptible context | |
3969 | * | |
c1a280b6 | 3970 | * - If the kernel is not preemptible (CONFIG_PREEMPTION is not set) |
edde96ea PE |
3971 | * then at the next: |
3972 | * | |
3973 | * - cond_resched() call | |
3974 | * - explicit schedule() call | |
3975 | * - return from syscall or exception to user-space | |
3976 | * - return from interrupt-handler to user-space | |
bfd9b2b5 | 3977 | * |
b30f0e3f | 3978 | * WARNING: must be called with preemption disabled! |
dd41f596 | 3979 | */ |
499d7955 | 3980 | static void __sched notrace __schedule(bool preempt) |
dd41f596 IM |
3981 | { |
3982 | struct task_struct *prev, *next; | |
67ca7bde | 3983 | unsigned long *switch_count; |
d8ac8971 | 3984 | struct rq_flags rf; |
dd41f596 | 3985 | struct rq *rq; |
31656519 | 3986 | int cpu; |
dd41f596 | 3987 | |
dd41f596 IM |
3988 | cpu = smp_processor_id(); |
3989 | rq = cpu_rq(cpu); | |
dd41f596 | 3990 | prev = rq->curr; |
dd41f596 | 3991 | |
dd41f596 | 3992 | schedule_debug(prev); |
1da177e4 | 3993 | |
31656519 | 3994 | if (sched_feat(HRTICK)) |
f333fdc9 | 3995 | hrtick_clear(rq); |
8f4d37ec | 3996 | |
46a5d164 | 3997 | local_irq_disable(); |
bcbfdd01 | 3998 | rcu_note_context_switch(preempt); |
46a5d164 | 3999 | |
e0acd0a6 ON |
4000 | /* |
4001 | * Make sure that signal_pending_state()->signal_pending() below | |
4002 | * can't be reordered with __set_current_state(TASK_INTERRUPTIBLE) | |
4003 | * done by the caller to avoid the race with signal_wake_up(). | |
306e0604 MD |
4004 | * |
4005 | * The membarrier system call requires a full memory barrier | |
4006 | * after coming from user-space, before storing to rq->curr. | |
e0acd0a6 | 4007 | */ |
8a8c69c3 | 4008 | rq_lock(rq, &rf); |
d89e588c | 4009 | smp_mb__after_spinlock(); |
1da177e4 | 4010 | |
d1ccc66d IM |
4011 | /* Promote REQ to ACT */ |
4012 | rq->clock_update_flags <<= 1; | |
bce4dc80 | 4013 | update_rq_clock(rq); |
9edfbfed | 4014 | |
246d86b5 | 4015 | switch_count = &prev->nivcsw; |
fc13aeba | 4016 | if (!preempt && prev->state) { |
34ec35ad | 4017 | if (signal_pending_state(prev->state, prev)) { |
1da177e4 | 4018 | prev->state = TASK_RUNNING; |
21aa9af0 | 4019 | } else { |
bce4dc80 | 4020 | deactivate_task(rq, prev, DEQUEUE_SLEEP | DEQUEUE_NOCLOCK); |
2acca55e | 4021 | |
e33a9bba TH |
4022 | if (prev->in_iowait) { |
4023 | atomic_inc(&rq->nr_iowait); | |
4024 | delayacct_blkio_start(); | |
4025 | } | |
21aa9af0 | 4026 | } |
dd41f596 | 4027 | switch_count = &prev->nvcsw; |
1da177e4 LT |
4028 | } |
4029 | ||
d8ac8971 | 4030 | next = pick_next_task(rq, prev, &rf); |
f26f9aff | 4031 | clear_tsk_need_resched(prev); |
f27dde8d | 4032 | clear_preempt_need_resched(); |
1da177e4 | 4033 | |
1da177e4 | 4034 | if (likely(prev != next)) { |
1da177e4 | 4035 | rq->nr_switches++; |
5311a98f EB |
4036 | /* |
4037 | * RCU users of rcu_dereference(rq->curr) may not see | |
4038 | * changes to task_struct made by pick_next_task(). | |
4039 | */ | |
4040 | RCU_INIT_POINTER(rq->curr, next); | |
22e4ebb9 MD |
4041 | /* |
4042 | * The membarrier system call requires each architecture | |
4043 | * to have a full memory barrier after updating | |
306e0604 MD |
4044 | * rq->curr, before returning to user-space. |
4045 | * | |
4046 | * Here are the schemes providing that barrier on the | |
4047 | * various architectures: | |
4048 | * - mm ? switch_mm() : mmdrop() for x86, s390, sparc, PowerPC. | |
4049 | * switch_mm() rely on membarrier_arch_switch_mm() on PowerPC. | |
4050 | * - finish_lock_switch() for weakly-ordered | |
4051 | * architectures where spin_unlock is a full barrier, | |
4052 | * - switch_to() for arm64 (weakly-ordered, spin_unlock | |
4053 | * is a RELEASE barrier), | |
22e4ebb9 | 4054 | */ |
1da177e4 LT |
4055 | ++*switch_count; |
4056 | ||
c73464b1 | 4057 | trace_sched_switch(preempt, prev, next); |
d1ccc66d IM |
4058 | |
4059 | /* Also unlocks the rq: */ | |
4060 | rq = context_switch(rq, prev, next, &rf); | |
cbce1a68 | 4061 | } else { |
cb42c9a3 | 4062 | rq->clock_update_flags &= ~(RQCF_ACT_SKIP|RQCF_REQ_SKIP); |
8a8c69c3 | 4063 | rq_unlock_irq(rq, &rf); |
cbce1a68 | 4064 | } |
1da177e4 | 4065 | |
e3fca9e7 | 4066 | balance_callback(rq); |
1da177e4 | 4067 | } |
c259e01a | 4068 | |
9af6528e PZ |
4069 | void __noreturn do_task_dead(void) |
4070 | { | |
d1ccc66d | 4071 | /* Causes final put_task_struct in finish_task_switch(): */ |
b5bf9a90 | 4072 | set_special_state(TASK_DEAD); |
d1ccc66d IM |
4073 | |
4074 | /* Tell freezer to ignore us: */ | |
4075 | current->flags |= PF_NOFREEZE; | |
4076 | ||
9af6528e PZ |
4077 | __schedule(false); |
4078 | BUG(); | |
d1ccc66d IM |
4079 | |
4080 | /* Avoid "noreturn function does return" - but don't continue if BUG() is a NOP: */ | |
9af6528e | 4081 | for (;;) |
d1ccc66d | 4082 | cpu_relax(); |
9af6528e PZ |
4083 | } |
4084 | ||
9c40cef2 TG |
4085 | static inline void sched_submit_work(struct task_struct *tsk) |
4086 | { | |
b0fdc013 | 4087 | if (!tsk->state) |
9c40cef2 | 4088 | return; |
6d25be57 TG |
4089 | |
4090 | /* | |
4091 | * If a worker went to sleep, notify and ask workqueue whether | |
4092 | * it wants to wake up a task to maintain concurrency. | |
4093 | * As this function is called inside the schedule() context, | |
4094 | * we disable preemption to avoid it calling schedule() again | |
4095 | * in the possible wakeup of a kworker. | |
4096 | */ | |
4097 | if (tsk->flags & PF_WQ_WORKER) { | |
4098 | preempt_disable(); | |
4099 | wq_worker_sleeping(tsk); | |
4100 | preempt_enable_no_resched(); | |
4101 | } | |
4102 | ||
b0fdc013 SAS |
4103 | if (tsk_is_pi_blocked(tsk)) |
4104 | return; | |
4105 | ||
9c40cef2 TG |
4106 | /* |
4107 | * If we are going to sleep and we have plugged IO queued, | |
4108 | * make sure to submit it to avoid deadlocks. | |
4109 | */ | |
4110 | if (blk_needs_flush_plug(tsk)) | |
4111 | blk_schedule_flush_plug(tsk); | |
4112 | } | |
4113 | ||
6d25be57 TG |
4114 | static void sched_update_worker(struct task_struct *tsk) |
4115 | { | |
4116 | if (tsk->flags & PF_WQ_WORKER) | |
4117 | wq_worker_running(tsk); | |
4118 | } | |
4119 | ||
722a9f92 | 4120 | asmlinkage __visible void __sched schedule(void) |
c259e01a | 4121 | { |
9c40cef2 TG |
4122 | struct task_struct *tsk = current; |
4123 | ||
4124 | sched_submit_work(tsk); | |
bfd9b2b5 | 4125 | do { |
b30f0e3f | 4126 | preempt_disable(); |
fc13aeba | 4127 | __schedule(false); |
b30f0e3f | 4128 | sched_preempt_enable_no_resched(); |
bfd9b2b5 | 4129 | } while (need_resched()); |
6d25be57 | 4130 | sched_update_worker(tsk); |
c259e01a | 4131 | } |
1da177e4 LT |
4132 | EXPORT_SYMBOL(schedule); |
4133 | ||
8663effb SRV |
4134 | /* |
4135 | * synchronize_rcu_tasks() makes sure that no task is stuck in preempted | |
4136 | * state (have scheduled out non-voluntarily) by making sure that all | |
4137 | * tasks have either left the run queue or have gone into user space. | |
4138 | * As idle tasks do not do either, they must not ever be preempted | |
4139 | * (schedule out non-voluntarily). | |
4140 | * | |
4141 | * schedule_idle() is similar to schedule_preempt_disable() except that it | |
4142 | * never enables preemption because it does not call sched_submit_work(). | |
4143 | */ | |
4144 | void __sched schedule_idle(void) | |
4145 | { | |
4146 | /* | |
4147 | * As this skips calling sched_submit_work(), which the idle task does | |
4148 | * regardless because that function is a nop when the task is in a | |
4149 | * TASK_RUNNING state, make sure this isn't used someplace that the | |
4150 | * current task can be in any other state. Note, idle is always in the | |
4151 | * TASK_RUNNING state. | |
4152 | */ | |
4153 | WARN_ON_ONCE(current->state); | |
4154 | do { | |
4155 | __schedule(false); | |
4156 | } while (need_resched()); | |
4157 | } | |
4158 | ||
91d1aa43 | 4159 | #ifdef CONFIG_CONTEXT_TRACKING |
722a9f92 | 4160 | asmlinkage __visible void __sched schedule_user(void) |
20ab65e3 FW |
4161 | { |
4162 | /* | |
4163 | * If we come here after a random call to set_need_resched(), | |
4164 | * or we have been woken up remotely but the IPI has not yet arrived, | |
4165 | * we haven't yet exited the RCU idle mode. Do it here manually until | |
4166 | * we find a better solution. | |
7cc78f8f AL |
4167 | * |
4168 | * NB: There are buggy callers of this function. Ideally we | |
c467ea76 | 4169 | * should warn if prev_state != CONTEXT_USER, but that will trigger |
7cc78f8f | 4170 | * too frequently to make sense yet. |
20ab65e3 | 4171 | */ |
7cc78f8f | 4172 | enum ctx_state prev_state = exception_enter(); |
20ab65e3 | 4173 | schedule(); |
7cc78f8f | 4174 | exception_exit(prev_state); |
20ab65e3 FW |
4175 | } |
4176 | #endif | |
4177 | ||
c5491ea7 TG |
4178 | /** |
4179 | * schedule_preempt_disabled - called with preemption disabled | |
4180 | * | |
4181 | * Returns with preemption disabled. Note: preempt_count must be 1 | |
4182 | */ | |
4183 | void __sched schedule_preempt_disabled(void) | |
4184 | { | |
ba74c144 | 4185 | sched_preempt_enable_no_resched(); |
c5491ea7 TG |
4186 | schedule(); |
4187 | preempt_disable(); | |
4188 | } | |
4189 | ||
06b1f808 | 4190 | static void __sched notrace preempt_schedule_common(void) |
a18b5d01 FW |
4191 | { |
4192 | do { | |
47252cfb SR |
4193 | /* |
4194 | * Because the function tracer can trace preempt_count_sub() | |
4195 | * and it also uses preempt_enable/disable_notrace(), if | |
4196 | * NEED_RESCHED is set, the preempt_enable_notrace() called | |
4197 | * by the function tracer will call this function again and | |
4198 | * cause infinite recursion. | |
4199 | * | |
4200 | * Preemption must be disabled here before the function | |
4201 | * tracer can trace. Break up preempt_disable() into two | |
4202 | * calls. One to disable preemption without fear of being | |
4203 | * traced. The other to still record the preemption latency, | |
4204 | * which can also be traced by the function tracer. | |
4205 | */ | |
499d7955 | 4206 | preempt_disable_notrace(); |
47252cfb | 4207 | preempt_latency_start(1); |
fc13aeba | 4208 | __schedule(true); |
47252cfb | 4209 | preempt_latency_stop(1); |
499d7955 | 4210 | preempt_enable_no_resched_notrace(); |
a18b5d01 FW |
4211 | |
4212 | /* | |
4213 | * Check again in case we missed a preemption opportunity | |
4214 | * between schedule and now. | |
4215 | */ | |
a18b5d01 FW |
4216 | } while (need_resched()); |
4217 | } | |
4218 | ||
c1a280b6 | 4219 | #ifdef CONFIG_PREEMPTION |
1da177e4 | 4220 | /* |
2ed6e34f | 4221 | * this is the entry point to schedule() from in-kernel preemption |
41a2d6cf | 4222 | * off of preempt_enable. Kernel preemptions off return from interrupt |
1da177e4 LT |
4223 | * occur there and call schedule directly. |
4224 | */ | |
722a9f92 | 4225 | asmlinkage __visible void __sched notrace preempt_schedule(void) |
1da177e4 | 4226 | { |
1da177e4 LT |
4227 | /* |
4228 | * If there is a non-zero preempt_count or interrupts are disabled, | |
41a2d6cf | 4229 | * we do not want to preempt the current task. Just return.. |
1da177e4 | 4230 | */ |
fbb00b56 | 4231 | if (likely(!preemptible())) |
1da177e4 LT |
4232 | return; |
4233 | ||
a18b5d01 | 4234 | preempt_schedule_common(); |
1da177e4 | 4235 | } |
376e2424 | 4236 | NOKPROBE_SYMBOL(preempt_schedule); |
1da177e4 | 4237 | EXPORT_SYMBOL(preempt_schedule); |
009f60e2 | 4238 | |
009f60e2 | 4239 | /** |
4eaca0a8 | 4240 | * preempt_schedule_notrace - preempt_schedule called by tracing |
009f60e2 ON |
4241 | * |
4242 | * The tracing infrastructure uses preempt_enable_notrace to prevent | |
4243 | * recursion and tracing preempt enabling caused by the tracing | |
4244 | * infrastructure itself. But as tracing can happen in areas coming | |
4245 | * from userspace or just about to enter userspace, a preempt enable | |
4246 | * can occur before user_exit() is called. This will cause the scheduler | |
4247 | * to be called when the system is still in usermode. | |
4248 | * | |
4249 | * To prevent this, the preempt_enable_notrace will use this function | |
4250 | * instead of preempt_schedule() to exit user context if needed before | |
4251 | * calling the scheduler. | |
4252 | */ | |
4eaca0a8 | 4253 | asmlinkage __visible void __sched notrace preempt_schedule_notrace(void) |
009f60e2 ON |
4254 | { |
4255 | enum ctx_state prev_ctx; | |
4256 | ||
4257 | if (likely(!preemptible())) | |
4258 | return; | |
4259 | ||
4260 | do { | |
47252cfb SR |
4261 | /* |
4262 | * Because the function tracer can trace preempt_count_sub() | |
4263 | * and it also uses preempt_enable/disable_notrace(), if | |
4264 | * NEED_RESCHED is set, the preempt_enable_notrace() called | |
4265 | * by the function tracer will call this function again and | |
4266 | * cause infinite recursion. | |
4267 | * | |
4268 | * Preemption must be disabled here before the function | |
4269 | * tracer can trace. Break up preempt_disable() into two | |
4270 | * calls. One to disable preemption without fear of being | |
4271 | * traced. The other to still record the preemption latency, | |
4272 | * which can also be traced by the function tracer. | |
4273 | */ | |
3d8f74dd | 4274 | preempt_disable_notrace(); |
47252cfb | 4275 | preempt_latency_start(1); |
009f60e2 ON |
4276 | /* |
4277 | * Needs preempt disabled in case user_exit() is traced | |
4278 | * and the tracer calls preempt_enable_notrace() causing | |
4279 | * an infinite recursion. | |
4280 | */ | |
4281 | prev_ctx = exception_enter(); | |
fc13aeba | 4282 | __schedule(true); |
009f60e2 ON |
4283 | exception_exit(prev_ctx); |
4284 | ||
47252cfb | 4285 | preempt_latency_stop(1); |
3d8f74dd | 4286 | preempt_enable_no_resched_notrace(); |
009f60e2 ON |
4287 | } while (need_resched()); |
4288 | } | |
4eaca0a8 | 4289 | EXPORT_SYMBOL_GPL(preempt_schedule_notrace); |
009f60e2 | 4290 | |
c1a280b6 | 4291 | #endif /* CONFIG_PREEMPTION */ |
1da177e4 LT |
4292 | |
4293 | /* | |
2ed6e34f | 4294 | * this is the entry point to schedule() from kernel preemption |
1da177e4 LT |
4295 | * off of irq context. |
4296 | * Note, that this is called and return with irqs disabled. This will | |
4297 | * protect us against recursive calling from irq. | |
4298 | */ | |
722a9f92 | 4299 | asmlinkage __visible void __sched preempt_schedule_irq(void) |
1da177e4 | 4300 | { |
b22366cd | 4301 | enum ctx_state prev_state; |
6478d880 | 4302 | |
2ed6e34f | 4303 | /* Catch callers which need to be fixed */ |
f27dde8d | 4304 | BUG_ON(preempt_count() || !irqs_disabled()); |
1da177e4 | 4305 | |
b22366cd FW |
4306 | prev_state = exception_enter(); |
4307 | ||
3a5c359a | 4308 | do { |
3d8f74dd | 4309 | preempt_disable(); |
3a5c359a | 4310 | local_irq_enable(); |
fc13aeba | 4311 | __schedule(true); |
3a5c359a | 4312 | local_irq_disable(); |
3d8f74dd | 4313 | sched_preempt_enable_no_resched(); |
5ed0cec0 | 4314 | } while (need_resched()); |
b22366cd FW |
4315 | |
4316 | exception_exit(prev_state); | |
1da177e4 LT |
4317 | } |
4318 | ||
ac6424b9 | 4319 | int default_wake_function(wait_queue_entry_t *curr, unsigned mode, int wake_flags, |
95cdf3b7 | 4320 | void *key) |
1da177e4 | 4321 | { |
63859d4f | 4322 | return try_to_wake_up(curr->private, mode, wake_flags); |
1da177e4 | 4323 | } |
1da177e4 LT |
4324 | EXPORT_SYMBOL(default_wake_function); |
4325 | ||
b29739f9 IM |
4326 | #ifdef CONFIG_RT_MUTEXES |
4327 | ||
acd58620 PZ |
4328 | static inline int __rt_effective_prio(struct task_struct *pi_task, int prio) |
4329 | { | |
4330 | if (pi_task) | |
4331 | prio = min(prio, pi_task->prio); | |
4332 | ||
4333 | return prio; | |
4334 | } | |
4335 | ||
4336 | static inline int rt_effective_prio(struct task_struct *p, int prio) | |
4337 | { | |
4338 | struct task_struct *pi_task = rt_mutex_get_top_task(p); | |
4339 | ||
4340 | return __rt_effective_prio(pi_task, prio); | |
4341 | } | |
4342 | ||
b29739f9 IM |
4343 | /* |
4344 | * rt_mutex_setprio - set the current priority of a task | |
acd58620 PZ |
4345 | * @p: task to boost |
4346 | * @pi_task: donor task | |
b29739f9 IM |
4347 | * |
4348 | * This function changes the 'effective' priority of a task. It does | |
4349 | * not touch ->normal_prio like __setscheduler(). | |
4350 | * | |
c365c292 TG |
4351 | * Used by the rt_mutex code to implement priority inheritance |
4352 | * logic. Call site only calls if the priority of the task changed. | |
b29739f9 | 4353 | */ |
acd58620 | 4354 | void rt_mutex_setprio(struct task_struct *p, struct task_struct *pi_task) |
b29739f9 | 4355 | { |
acd58620 | 4356 | int prio, oldprio, queued, running, queue_flag = |
7a57f32a | 4357 | DEQUEUE_SAVE | DEQUEUE_MOVE | DEQUEUE_NOCLOCK; |
83ab0aa0 | 4358 | const struct sched_class *prev_class; |
eb580751 PZ |
4359 | struct rq_flags rf; |
4360 | struct rq *rq; | |
b29739f9 | 4361 | |
acd58620 PZ |
4362 | /* XXX used to be waiter->prio, not waiter->task->prio */ |
4363 | prio = __rt_effective_prio(pi_task, p->normal_prio); | |
4364 | ||
4365 | /* | |
4366 | * If nothing changed; bail early. | |
4367 | */ | |
4368 | if (p->pi_top_task == pi_task && prio == p->prio && !dl_prio(prio)) | |
4369 | return; | |
b29739f9 | 4370 | |
eb580751 | 4371 | rq = __task_rq_lock(p, &rf); |
80f5c1b8 | 4372 | update_rq_clock(rq); |
acd58620 PZ |
4373 | /* |
4374 | * Set under pi_lock && rq->lock, such that the value can be used under | |
4375 | * either lock. | |
4376 | * | |
4377 | * Note that there is loads of tricky to make this pointer cache work | |
4378 | * right. rt_mutex_slowunlock()+rt_mutex_postunlock() work together to | |
4379 | * ensure a task is de-boosted (pi_task is set to NULL) before the | |
4380 | * task is allowed to run again (and can exit). This ensures the pointer | |
4381 | * points to a blocked task -- which guaratees the task is present. | |
4382 | */ | |
4383 | p->pi_top_task = pi_task; | |
4384 | ||
4385 | /* | |
4386 | * For FIFO/RR we only need to set prio, if that matches we're done. | |
4387 | */ | |
4388 | if (prio == p->prio && !dl_prio(prio)) | |
4389 | goto out_unlock; | |
b29739f9 | 4390 | |
1c4dd99b TG |
4391 | /* |
4392 | * Idle task boosting is a nono in general. There is one | |
4393 | * exception, when PREEMPT_RT and NOHZ is active: | |
4394 | * | |
4395 | * The idle task calls get_next_timer_interrupt() and holds | |
4396 | * the timer wheel base->lock on the CPU and another CPU wants | |
4397 | * to access the timer (probably to cancel it). We can safely | |
4398 | * ignore the boosting request, as the idle CPU runs this code | |
4399 | * with interrupts disabled and will complete the lock | |
4400 | * protected section without being interrupted. So there is no | |
4401 | * real need to boost. | |
4402 | */ | |
4403 | if (unlikely(p == rq->idle)) { | |
4404 | WARN_ON(p != rq->curr); | |
4405 | WARN_ON(p->pi_blocked_on); | |
4406 | goto out_unlock; | |
4407 | } | |
4408 | ||
b91473ff | 4409 | trace_sched_pi_setprio(p, pi_task); |
d5f9f942 | 4410 | oldprio = p->prio; |
ff77e468 PZ |
4411 | |
4412 | if (oldprio == prio) | |
4413 | queue_flag &= ~DEQUEUE_MOVE; | |
4414 | ||
83ab0aa0 | 4415 | prev_class = p->sched_class; |
da0c1e65 | 4416 | queued = task_on_rq_queued(p); |
051a1d1a | 4417 | running = task_current(rq, p); |
da0c1e65 | 4418 | if (queued) |
ff77e468 | 4419 | dequeue_task(rq, p, queue_flag); |
0e1f3483 | 4420 | if (running) |
f3cd1c4e | 4421 | put_prev_task(rq, p); |
dd41f596 | 4422 | |
2d3d891d DF |
4423 | /* |
4424 | * Boosting condition are: | |
4425 | * 1. -rt task is running and holds mutex A | |
4426 | * --> -dl task blocks on mutex A | |
4427 | * | |
4428 | * 2. -dl task is running and holds mutex A | |
4429 | * --> -dl task blocks on mutex A and could preempt the | |
4430 | * running task | |
4431 | */ | |
4432 | if (dl_prio(prio)) { | |
466af29b ON |
4433 | if (!dl_prio(p->normal_prio) || |
4434 | (pi_task && dl_entity_preempt(&pi_task->dl, &p->dl))) { | |
2d3d891d | 4435 | p->dl.dl_boosted = 1; |
ff77e468 | 4436 | queue_flag |= ENQUEUE_REPLENISH; |
2d3d891d DF |
4437 | } else |
4438 | p->dl.dl_boosted = 0; | |
aab03e05 | 4439 | p->sched_class = &dl_sched_class; |
2d3d891d DF |
4440 | } else if (rt_prio(prio)) { |
4441 | if (dl_prio(oldprio)) | |
4442 | p->dl.dl_boosted = 0; | |
4443 | if (oldprio < prio) | |
ff77e468 | 4444 | queue_flag |= ENQUEUE_HEAD; |
dd41f596 | 4445 | p->sched_class = &rt_sched_class; |
2d3d891d DF |
4446 | } else { |
4447 | if (dl_prio(oldprio)) | |
4448 | p->dl.dl_boosted = 0; | |
746db944 BS |
4449 | if (rt_prio(oldprio)) |
4450 | p->rt.timeout = 0; | |
dd41f596 | 4451 | p->sched_class = &fair_sched_class; |
2d3d891d | 4452 | } |
dd41f596 | 4453 | |
b29739f9 IM |
4454 | p->prio = prio; |
4455 | ||
da0c1e65 | 4456 | if (queued) |
ff77e468 | 4457 | enqueue_task(rq, p, queue_flag); |
a399d233 | 4458 | if (running) |
03b7fad1 | 4459 | set_next_task(rq, p); |
cb469845 | 4460 | |
da7a735e | 4461 | check_class_changed(rq, p, prev_class, oldprio); |
1c4dd99b | 4462 | out_unlock: |
d1ccc66d IM |
4463 | /* Avoid rq from going away on us: */ |
4464 | preempt_disable(); | |
eb580751 | 4465 | __task_rq_unlock(rq, &rf); |
4c9a4bc8 PZ |
4466 | |
4467 | balance_callback(rq); | |
4468 | preempt_enable(); | |
b29739f9 | 4469 | } |
acd58620 PZ |
4470 | #else |
4471 | static inline int rt_effective_prio(struct task_struct *p, int prio) | |
4472 | { | |
4473 | return prio; | |
4474 | } | |
b29739f9 | 4475 | #endif |
d50dde5a | 4476 | |
36c8b586 | 4477 | void set_user_nice(struct task_struct *p, long nice) |
1da177e4 | 4478 | { |
49bd21ef PZ |
4479 | bool queued, running; |
4480 | int old_prio, delta; | |
eb580751 | 4481 | struct rq_flags rf; |
70b97a7f | 4482 | struct rq *rq; |
1da177e4 | 4483 | |
75e45d51 | 4484 | if (task_nice(p) == nice || nice < MIN_NICE || nice > MAX_NICE) |
1da177e4 LT |
4485 | return; |
4486 | /* | |
4487 | * We have to be careful, if called from sys_setpriority(), | |
4488 | * the task might be in the middle of scheduling on another CPU. | |
4489 | */ | |
eb580751 | 4490 | rq = task_rq_lock(p, &rf); |
2fb8d367 PZ |
4491 | update_rq_clock(rq); |
4492 | ||
1da177e4 LT |
4493 | /* |
4494 | * The RT priorities are set via sched_setscheduler(), but we still | |
4495 | * allow the 'normal' nice value to be set - but as expected | |
4496 | * it wont have any effect on scheduling until the task is | |
aab03e05 | 4497 | * SCHED_DEADLINE, SCHED_FIFO or SCHED_RR: |
1da177e4 | 4498 | */ |
aab03e05 | 4499 | if (task_has_dl_policy(p) || task_has_rt_policy(p)) { |
1da177e4 LT |
4500 | p->static_prio = NICE_TO_PRIO(nice); |
4501 | goto out_unlock; | |
4502 | } | |
da0c1e65 | 4503 | queued = task_on_rq_queued(p); |
49bd21ef | 4504 | running = task_current(rq, p); |
da0c1e65 | 4505 | if (queued) |
7a57f32a | 4506 | dequeue_task(rq, p, DEQUEUE_SAVE | DEQUEUE_NOCLOCK); |
49bd21ef PZ |
4507 | if (running) |
4508 | put_prev_task(rq, p); | |
1da177e4 | 4509 | |
1da177e4 | 4510 | p->static_prio = NICE_TO_PRIO(nice); |
9059393e | 4511 | set_load_weight(p, true); |
b29739f9 IM |
4512 | old_prio = p->prio; |
4513 | p->prio = effective_prio(p); | |
4514 | delta = p->prio - old_prio; | |
1da177e4 | 4515 | |
da0c1e65 | 4516 | if (queued) { |
7134b3e9 | 4517 | enqueue_task(rq, p, ENQUEUE_RESTORE | ENQUEUE_NOCLOCK); |
1da177e4 | 4518 | /* |
d5f9f942 AM |
4519 | * If the task increased its priority or is running and |
4520 | * lowered its priority, then reschedule its CPU: | |
1da177e4 | 4521 | */ |
d5f9f942 | 4522 | if (delta < 0 || (delta > 0 && task_running(rq, p))) |
8875125e | 4523 | resched_curr(rq); |
1da177e4 | 4524 | } |
49bd21ef | 4525 | if (running) |
03b7fad1 | 4526 | set_next_task(rq, p); |
1da177e4 | 4527 | out_unlock: |
eb580751 | 4528 | task_rq_unlock(rq, p, &rf); |
1da177e4 | 4529 | } |
1da177e4 LT |
4530 | EXPORT_SYMBOL(set_user_nice); |
4531 | ||
e43379f1 MM |
4532 | /* |
4533 | * can_nice - check if a task can reduce its nice value | |
4534 | * @p: task | |
4535 | * @nice: nice value | |
4536 | */ | |
36c8b586 | 4537 | int can_nice(const struct task_struct *p, const int nice) |
e43379f1 | 4538 | { |
d1ccc66d | 4539 | /* Convert nice value [19,-20] to rlimit style value [1,40]: */ |
7aa2c016 | 4540 | int nice_rlim = nice_to_rlimit(nice); |
48f24c4d | 4541 | |
78d7d407 | 4542 | return (nice_rlim <= task_rlimit(p, RLIMIT_NICE) || |
e43379f1 MM |
4543 | capable(CAP_SYS_NICE)); |
4544 | } | |
4545 | ||
1da177e4 LT |
4546 | #ifdef __ARCH_WANT_SYS_NICE |
4547 | ||
4548 | /* | |
4549 | * sys_nice - change the priority of the current process. | |
4550 | * @increment: priority increment | |
4551 | * | |
4552 | * sys_setpriority is a more generic, but much slower function that | |
4553 | * does similar things. | |
4554 | */ | |
5add95d4 | 4555 | SYSCALL_DEFINE1(nice, int, increment) |
1da177e4 | 4556 | { |
48f24c4d | 4557 | long nice, retval; |
1da177e4 LT |
4558 | |
4559 | /* | |
4560 | * Setpriority might change our priority at the same moment. | |
4561 | * We don't have to worry. Conceptually one call occurs first | |
4562 | * and we have a single winner. | |
4563 | */ | |
a9467fa3 | 4564 | increment = clamp(increment, -NICE_WIDTH, NICE_WIDTH); |
d0ea0268 | 4565 | nice = task_nice(current) + increment; |
1da177e4 | 4566 | |
a9467fa3 | 4567 | nice = clamp_val(nice, MIN_NICE, MAX_NICE); |
e43379f1 MM |
4568 | if (increment < 0 && !can_nice(current, nice)) |
4569 | return -EPERM; | |
4570 | ||
1da177e4 LT |
4571 | retval = security_task_setnice(current, nice); |
4572 | if (retval) | |
4573 | return retval; | |
4574 | ||
4575 | set_user_nice(current, nice); | |
4576 | return 0; | |
4577 | } | |
4578 | ||
4579 | #endif | |
4580 | ||
4581 | /** | |
4582 | * task_prio - return the priority value of a given task. | |
4583 | * @p: the task in question. | |
4584 | * | |
e69f6186 | 4585 | * Return: The priority value as seen by users in /proc. |
1da177e4 LT |
4586 | * RT tasks are offset by -200. Normal tasks are centered |
4587 | * around 0, value goes from -16 to +15. | |
4588 | */ | |
36c8b586 | 4589 | int task_prio(const struct task_struct *p) |
1da177e4 LT |
4590 | { |
4591 | return p->prio - MAX_RT_PRIO; | |
4592 | } | |
4593 | ||
1da177e4 | 4594 | /** |
d1ccc66d | 4595 | * idle_cpu - is a given CPU idle currently? |
1da177e4 | 4596 | * @cpu: the processor in question. |
e69f6186 YB |
4597 | * |
4598 | * Return: 1 if the CPU is currently idle. 0 otherwise. | |
1da177e4 LT |
4599 | */ |
4600 | int idle_cpu(int cpu) | |
4601 | { | |
908a3283 TG |
4602 | struct rq *rq = cpu_rq(cpu); |
4603 | ||
4604 | if (rq->curr != rq->idle) | |
4605 | return 0; | |
4606 | ||
4607 | if (rq->nr_running) | |
4608 | return 0; | |
4609 | ||
4610 | #ifdef CONFIG_SMP | |
4611 | if (!llist_empty(&rq->wake_list)) | |
4612 | return 0; | |
4613 | #endif | |
4614 | ||
4615 | return 1; | |
1da177e4 LT |
4616 | } |
4617 | ||
943d355d RJ |
4618 | /** |
4619 | * available_idle_cpu - is a given CPU idle for enqueuing work. | |
4620 | * @cpu: the CPU in question. | |
4621 | * | |
4622 | * Return: 1 if the CPU is currently idle. 0 otherwise. | |
4623 | */ | |
4624 | int available_idle_cpu(int cpu) | |
4625 | { | |
4626 | if (!idle_cpu(cpu)) | |
4627 | return 0; | |
4628 | ||
247f2f6f RJ |
4629 | if (vcpu_is_preempted(cpu)) |
4630 | return 0; | |
4631 | ||
908a3283 | 4632 | return 1; |
1da177e4 LT |
4633 | } |
4634 | ||
1da177e4 | 4635 | /** |
d1ccc66d | 4636 | * idle_task - return the idle task for a given CPU. |
1da177e4 | 4637 | * @cpu: the processor in question. |
e69f6186 | 4638 | * |
d1ccc66d | 4639 | * Return: The idle task for the CPU @cpu. |
1da177e4 | 4640 | */ |
36c8b586 | 4641 | struct task_struct *idle_task(int cpu) |
1da177e4 LT |
4642 | { |
4643 | return cpu_rq(cpu)->idle; | |
4644 | } | |
4645 | ||
4646 | /** | |
4647 | * find_process_by_pid - find a process with a matching PID value. | |
4648 | * @pid: the pid in question. | |
e69f6186 YB |
4649 | * |
4650 | * The task of @pid, if found. %NULL otherwise. | |
1da177e4 | 4651 | */ |
a9957449 | 4652 | static struct task_struct *find_process_by_pid(pid_t pid) |
1da177e4 | 4653 | { |
228ebcbe | 4654 | return pid ? find_task_by_vpid(pid) : current; |
1da177e4 LT |
4655 | } |
4656 | ||
c13db6b1 SR |
4657 | /* |
4658 | * sched_setparam() passes in -1 for its policy, to let the functions | |
4659 | * it calls know not to change it. | |
4660 | */ | |
4661 | #define SETPARAM_POLICY -1 | |
4662 | ||
c365c292 TG |
4663 | static void __setscheduler_params(struct task_struct *p, |
4664 | const struct sched_attr *attr) | |
1da177e4 | 4665 | { |
d50dde5a DF |
4666 | int policy = attr->sched_policy; |
4667 | ||
c13db6b1 | 4668 | if (policy == SETPARAM_POLICY) |
39fd8fd2 PZ |
4669 | policy = p->policy; |
4670 | ||
1da177e4 | 4671 | p->policy = policy; |
d50dde5a | 4672 | |
aab03e05 DF |
4673 | if (dl_policy(policy)) |
4674 | __setparam_dl(p, attr); | |
39fd8fd2 | 4675 | else if (fair_policy(policy)) |
d50dde5a DF |
4676 | p->static_prio = NICE_TO_PRIO(attr->sched_nice); |
4677 | ||
39fd8fd2 PZ |
4678 | /* |
4679 | * __sched_setscheduler() ensures attr->sched_priority == 0 when | |
4680 | * !rt_policy. Always setting this ensures that things like | |
4681 | * getparam()/getattr() don't report silly values for !rt tasks. | |
4682 | */ | |
4683 | p->rt_priority = attr->sched_priority; | |
383afd09 | 4684 | p->normal_prio = normal_prio(p); |
9059393e | 4685 | set_load_weight(p, true); |
c365c292 | 4686 | } |
39fd8fd2 | 4687 | |
c365c292 TG |
4688 | /* Actually do priority change: must hold pi & rq lock. */ |
4689 | static void __setscheduler(struct rq *rq, struct task_struct *p, | |
0782e63b | 4690 | const struct sched_attr *attr, bool keep_boost) |
c365c292 | 4691 | { |
a509a7cd PB |
4692 | /* |
4693 | * If params can't change scheduling class changes aren't allowed | |
4694 | * either. | |
4695 | */ | |
4696 | if (attr->sched_flags & SCHED_FLAG_KEEP_PARAMS) | |
4697 | return; | |
4698 | ||
c365c292 | 4699 | __setscheduler_params(p, attr); |
d50dde5a | 4700 | |
383afd09 | 4701 | /* |
0782e63b TG |
4702 | * Keep a potential priority boosting if called from |
4703 | * sched_setscheduler(). | |
383afd09 | 4704 | */ |
acd58620 | 4705 | p->prio = normal_prio(p); |
0782e63b | 4706 | if (keep_boost) |
acd58620 | 4707 | p->prio = rt_effective_prio(p, p->prio); |
383afd09 | 4708 | |
aab03e05 DF |
4709 | if (dl_prio(p->prio)) |
4710 | p->sched_class = &dl_sched_class; | |
4711 | else if (rt_prio(p->prio)) | |
ffd44db5 PZ |
4712 | p->sched_class = &rt_sched_class; |
4713 | else | |
4714 | p->sched_class = &fair_sched_class; | |
1da177e4 | 4715 | } |
aab03e05 | 4716 | |
c69e8d9c | 4717 | /* |
d1ccc66d | 4718 | * Check the target process has a UID that matches the current process's: |
c69e8d9c DH |
4719 | */ |
4720 | static bool check_same_owner(struct task_struct *p) | |
4721 | { | |
4722 | const struct cred *cred = current_cred(), *pcred; | |
4723 | bool match; | |
4724 | ||
4725 | rcu_read_lock(); | |
4726 | pcred = __task_cred(p); | |
9c806aa0 EB |
4727 | match = (uid_eq(cred->euid, pcred->euid) || |
4728 | uid_eq(cred->euid, pcred->uid)); | |
c69e8d9c DH |
4729 | rcu_read_unlock(); |
4730 | return match; | |
4731 | } | |
4732 | ||
d50dde5a DF |
4733 | static int __sched_setscheduler(struct task_struct *p, |
4734 | const struct sched_attr *attr, | |
dbc7f069 | 4735 | bool user, bool pi) |
1da177e4 | 4736 | { |
383afd09 SR |
4737 | int newprio = dl_policy(attr->sched_policy) ? MAX_DL_PRIO - 1 : |
4738 | MAX_RT_PRIO - 1 - attr->sched_priority; | |
da0c1e65 | 4739 | int retval, oldprio, oldpolicy = -1, queued, running; |
0782e63b | 4740 | int new_effective_prio, policy = attr->sched_policy; |
83ab0aa0 | 4741 | const struct sched_class *prev_class; |
eb580751 | 4742 | struct rq_flags rf; |
ca94c442 | 4743 | int reset_on_fork; |
7a57f32a | 4744 | int queue_flags = DEQUEUE_SAVE | DEQUEUE_MOVE | DEQUEUE_NOCLOCK; |
eb580751 | 4745 | struct rq *rq; |
1da177e4 | 4746 | |
896bbb25 SRV |
4747 | /* The pi code expects interrupts enabled */ |
4748 | BUG_ON(pi && in_interrupt()); | |
1da177e4 | 4749 | recheck: |
d1ccc66d | 4750 | /* Double check policy once rq lock held: */ |
ca94c442 LP |
4751 | if (policy < 0) { |
4752 | reset_on_fork = p->sched_reset_on_fork; | |
1da177e4 | 4753 | policy = oldpolicy = p->policy; |
ca94c442 | 4754 | } else { |
7479f3c9 | 4755 | reset_on_fork = !!(attr->sched_flags & SCHED_FLAG_RESET_ON_FORK); |
ca94c442 | 4756 | |
20f9cd2a | 4757 | if (!valid_policy(policy)) |
ca94c442 LP |
4758 | return -EINVAL; |
4759 | } | |
4760 | ||
794a56eb | 4761 | if (attr->sched_flags & ~(SCHED_FLAG_ALL | SCHED_FLAG_SUGOV)) |
7479f3c9 PZ |
4762 | return -EINVAL; |
4763 | ||
1da177e4 LT |
4764 | /* |
4765 | * Valid priorities for SCHED_FIFO and SCHED_RR are | |
dd41f596 IM |
4766 | * 1..MAX_USER_RT_PRIO-1, valid priority for SCHED_NORMAL, |
4767 | * SCHED_BATCH and SCHED_IDLE is 0. | |
1da177e4 | 4768 | */ |
0bb040a4 | 4769 | if ((p->mm && attr->sched_priority > MAX_USER_RT_PRIO-1) || |
d50dde5a | 4770 | (!p->mm && attr->sched_priority > MAX_RT_PRIO-1)) |
1da177e4 | 4771 | return -EINVAL; |
aab03e05 DF |
4772 | if ((dl_policy(policy) && !__checkparam_dl(attr)) || |
4773 | (rt_policy(policy) != (attr->sched_priority != 0))) | |
1da177e4 LT |
4774 | return -EINVAL; |
4775 | ||
37e4ab3f OC |
4776 | /* |
4777 | * Allow unprivileged RT tasks to decrease priority: | |
4778 | */ | |
961ccddd | 4779 | if (user && !capable(CAP_SYS_NICE)) { |
d50dde5a | 4780 | if (fair_policy(policy)) { |
d0ea0268 | 4781 | if (attr->sched_nice < task_nice(p) && |
eaad4513 | 4782 | !can_nice(p, attr->sched_nice)) |
d50dde5a DF |
4783 | return -EPERM; |
4784 | } | |
4785 | ||
e05606d3 | 4786 | if (rt_policy(policy)) { |
a44702e8 ON |
4787 | unsigned long rlim_rtprio = |
4788 | task_rlimit(p, RLIMIT_RTPRIO); | |
8dc3e909 | 4789 | |
d1ccc66d | 4790 | /* Can't set/change the rt policy: */ |
8dc3e909 ON |
4791 | if (policy != p->policy && !rlim_rtprio) |
4792 | return -EPERM; | |
4793 | ||
d1ccc66d | 4794 | /* Can't increase priority: */ |
d50dde5a DF |
4795 | if (attr->sched_priority > p->rt_priority && |
4796 | attr->sched_priority > rlim_rtprio) | |
8dc3e909 ON |
4797 | return -EPERM; |
4798 | } | |
c02aa73b | 4799 | |
d44753b8 JL |
4800 | /* |
4801 | * Can't set/change SCHED_DEADLINE policy at all for now | |
4802 | * (safest behavior); in the future we would like to allow | |
4803 | * unprivileged DL tasks to increase their relative deadline | |
4804 | * or reduce their runtime (both ways reducing utilization) | |
4805 | */ | |
4806 | if (dl_policy(policy)) | |
4807 | return -EPERM; | |
4808 | ||
dd41f596 | 4809 | /* |
c02aa73b DH |
4810 | * Treat SCHED_IDLE as nice 20. Only allow a switch to |
4811 | * SCHED_NORMAL if the RLIMIT_NICE would normally permit it. | |
dd41f596 | 4812 | */ |
1da1843f | 4813 | if (task_has_idle_policy(p) && !idle_policy(policy)) { |
d0ea0268 | 4814 | if (!can_nice(p, task_nice(p))) |
c02aa73b DH |
4815 | return -EPERM; |
4816 | } | |
5fe1d75f | 4817 | |
d1ccc66d | 4818 | /* Can't change other user's priorities: */ |
c69e8d9c | 4819 | if (!check_same_owner(p)) |
37e4ab3f | 4820 | return -EPERM; |
ca94c442 | 4821 | |
d1ccc66d | 4822 | /* Normal users shall not reset the sched_reset_on_fork flag: */ |
ca94c442 LP |
4823 | if (p->sched_reset_on_fork && !reset_on_fork) |
4824 | return -EPERM; | |
37e4ab3f | 4825 | } |
1da177e4 | 4826 | |
725aad24 | 4827 | if (user) { |
794a56eb JL |
4828 | if (attr->sched_flags & SCHED_FLAG_SUGOV) |
4829 | return -EINVAL; | |
4830 | ||
b0ae1981 | 4831 | retval = security_task_setscheduler(p); |
725aad24 JF |
4832 | if (retval) |
4833 | return retval; | |
4834 | } | |
4835 | ||
a509a7cd PB |
4836 | /* Update task specific "requested" clamps */ |
4837 | if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP) { | |
4838 | retval = uclamp_validate(p, attr); | |
4839 | if (retval) | |
4840 | return retval; | |
4841 | } | |
4842 | ||
710da3c8 JL |
4843 | if (pi) |
4844 | cpuset_read_lock(); | |
4845 | ||
b29739f9 | 4846 | /* |
d1ccc66d | 4847 | * Make sure no PI-waiters arrive (or leave) while we are |
b29739f9 | 4848 | * changing the priority of the task: |
0122ec5b | 4849 | * |
25985edc | 4850 | * To be able to change p->policy safely, the appropriate |
1da177e4 LT |
4851 | * runqueue lock must be held. |
4852 | */ | |
eb580751 | 4853 | rq = task_rq_lock(p, &rf); |
80f5c1b8 | 4854 | update_rq_clock(rq); |
dc61b1d6 | 4855 | |
34f971f6 | 4856 | /* |
d1ccc66d | 4857 | * Changing the policy of the stop threads its a very bad idea: |
34f971f6 PZ |
4858 | */ |
4859 | if (p == rq->stop) { | |
4b211f2b MP |
4860 | retval = -EINVAL; |
4861 | goto unlock; | |
34f971f6 PZ |
4862 | } |
4863 | ||
a51e9198 | 4864 | /* |
d6b1e911 TG |
4865 | * If not changing anything there's no need to proceed further, |
4866 | * but store a possible modification of reset_on_fork. | |
a51e9198 | 4867 | */ |
d50dde5a | 4868 | if (unlikely(policy == p->policy)) { |
d0ea0268 | 4869 | if (fair_policy(policy) && attr->sched_nice != task_nice(p)) |
d50dde5a DF |
4870 | goto change; |
4871 | if (rt_policy(policy) && attr->sched_priority != p->rt_priority) | |
4872 | goto change; | |
75381608 | 4873 | if (dl_policy(policy) && dl_param_changed(p, attr)) |
aab03e05 | 4874 | goto change; |
a509a7cd PB |
4875 | if (attr->sched_flags & SCHED_FLAG_UTIL_CLAMP) |
4876 | goto change; | |
d50dde5a | 4877 | |
d6b1e911 | 4878 | p->sched_reset_on_fork = reset_on_fork; |
4b211f2b MP |
4879 | retval = 0; |
4880 | goto unlock; | |
a51e9198 | 4881 | } |
d50dde5a | 4882 | change: |
a51e9198 | 4883 | |
dc61b1d6 | 4884 | if (user) { |
332ac17e | 4885 | #ifdef CONFIG_RT_GROUP_SCHED |
dc61b1d6 PZ |
4886 | /* |
4887 | * Do not allow realtime tasks into groups that have no runtime | |
4888 | * assigned. | |
4889 | */ | |
4890 | if (rt_bandwidth_enabled() && rt_policy(policy) && | |
f4493771 MG |
4891 | task_group(p)->rt_bandwidth.rt_runtime == 0 && |
4892 | !task_group_is_autogroup(task_group(p))) { | |
4b211f2b MP |
4893 | retval = -EPERM; |
4894 | goto unlock; | |
dc61b1d6 | 4895 | } |
dc61b1d6 | 4896 | #endif |
332ac17e | 4897 | #ifdef CONFIG_SMP |
794a56eb JL |
4898 | if (dl_bandwidth_enabled() && dl_policy(policy) && |
4899 | !(attr->sched_flags & SCHED_FLAG_SUGOV)) { | |
332ac17e | 4900 | cpumask_t *span = rq->rd->span; |
332ac17e DF |
4901 | |
4902 | /* | |
4903 | * Don't allow tasks with an affinity mask smaller than | |
4904 | * the entire root_domain to become SCHED_DEADLINE. We | |
4905 | * will also fail if there's no bandwidth available. | |
4906 | */ | |
3bd37062 | 4907 | if (!cpumask_subset(span, p->cpus_ptr) || |
e4099a5e | 4908 | rq->rd->dl_bw.bw == 0) { |
4b211f2b MP |
4909 | retval = -EPERM; |
4910 | goto unlock; | |
332ac17e DF |
4911 | } |
4912 | } | |
4913 | #endif | |
4914 | } | |
dc61b1d6 | 4915 | |
d1ccc66d | 4916 | /* Re-check policy now with rq lock held: */ |
1da177e4 LT |
4917 | if (unlikely(oldpolicy != -1 && oldpolicy != p->policy)) { |
4918 | policy = oldpolicy = -1; | |
eb580751 | 4919 | task_rq_unlock(rq, p, &rf); |
710da3c8 JL |
4920 | if (pi) |
4921 | cpuset_read_unlock(); | |
1da177e4 LT |
4922 | goto recheck; |
4923 | } | |
332ac17e DF |
4924 | |
4925 | /* | |
4926 | * If setscheduling to SCHED_DEADLINE (or changing the parameters | |
4927 | * of a SCHED_DEADLINE task) we need to check if enough bandwidth | |
4928 | * is available. | |
4929 | */ | |
06a76fe0 | 4930 | if ((dl_policy(policy) || dl_task(p)) && sched_dl_overflow(p, policy, attr)) { |
4b211f2b MP |
4931 | retval = -EBUSY; |
4932 | goto unlock; | |
332ac17e DF |
4933 | } |
4934 | ||
c365c292 TG |
4935 | p->sched_reset_on_fork = reset_on_fork; |
4936 | oldprio = p->prio; | |
4937 | ||
dbc7f069 PZ |
4938 | if (pi) { |
4939 | /* | |
4940 | * Take priority boosted tasks into account. If the new | |
4941 | * effective priority is unchanged, we just store the new | |
4942 | * normal parameters and do not touch the scheduler class and | |
4943 | * the runqueue. This will be done when the task deboost | |
4944 | * itself. | |
4945 | */ | |
acd58620 | 4946 | new_effective_prio = rt_effective_prio(p, newprio); |
ff77e468 PZ |
4947 | if (new_effective_prio == oldprio) |
4948 | queue_flags &= ~DEQUEUE_MOVE; | |
c365c292 TG |
4949 | } |
4950 | ||
da0c1e65 | 4951 | queued = task_on_rq_queued(p); |
051a1d1a | 4952 | running = task_current(rq, p); |
da0c1e65 | 4953 | if (queued) |
ff77e468 | 4954 | dequeue_task(rq, p, queue_flags); |
0e1f3483 | 4955 | if (running) |
f3cd1c4e | 4956 | put_prev_task(rq, p); |
f6b53205 | 4957 | |
83ab0aa0 | 4958 | prev_class = p->sched_class; |
a509a7cd | 4959 | |
dbc7f069 | 4960 | __setscheduler(rq, p, attr, pi); |
a509a7cd | 4961 | __setscheduler_uclamp(p, attr); |
f6b53205 | 4962 | |
da0c1e65 | 4963 | if (queued) { |
81a44c54 TG |
4964 | /* |
4965 | * We enqueue to tail when the priority of a task is | |
4966 | * increased (user space view). | |
4967 | */ | |
ff77e468 PZ |
4968 | if (oldprio < p->prio) |
4969 | queue_flags |= ENQUEUE_HEAD; | |
1de64443 | 4970 | |
ff77e468 | 4971 | enqueue_task(rq, p, queue_flags); |
81a44c54 | 4972 | } |
a399d233 | 4973 | if (running) |
03b7fad1 | 4974 | set_next_task(rq, p); |
cb469845 | 4975 | |
da7a735e | 4976 | check_class_changed(rq, p, prev_class, oldprio); |
d1ccc66d IM |
4977 | |
4978 | /* Avoid rq from going away on us: */ | |
4979 | preempt_disable(); | |
eb580751 | 4980 | task_rq_unlock(rq, p, &rf); |
b29739f9 | 4981 | |
710da3c8 JL |
4982 | if (pi) { |
4983 | cpuset_read_unlock(); | |
dbc7f069 | 4984 | rt_mutex_adjust_pi(p); |
710da3c8 | 4985 | } |
95e02ca9 | 4986 | |
d1ccc66d | 4987 | /* Run balance callbacks after we've adjusted the PI chain: */ |
4c9a4bc8 PZ |
4988 | balance_callback(rq); |
4989 | preempt_enable(); | |
95e02ca9 | 4990 | |
1da177e4 | 4991 | return 0; |
4b211f2b MP |
4992 | |
4993 | unlock: | |
4994 | task_rq_unlock(rq, p, &rf); | |
710da3c8 JL |
4995 | if (pi) |
4996 | cpuset_read_unlock(); | |
4b211f2b | 4997 | return retval; |
1da177e4 | 4998 | } |
961ccddd | 4999 | |
7479f3c9 PZ |
5000 | static int _sched_setscheduler(struct task_struct *p, int policy, |
5001 | const struct sched_param *param, bool check) | |
5002 | { | |
5003 | struct sched_attr attr = { | |
5004 | .sched_policy = policy, | |
5005 | .sched_priority = param->sched_priority, | |
5006 | .sched_nice = PRIO_TO_NICE(p->static_prio), | |
5007 | }; | |
5008 | ||
c13db6b1 SR |
5009 | /* Fixup the legacy SCHED_RESET_ON_FORK hack. */ |
5010 | if ((policy != SETPARAM_POLICY) && (policy & SCHED_RESET_ON_FORK)) { | |
7479f3c9 PZ |
5011 | attr.sched_flags |= SCHED_FLAG_RESET_ON_FORK; |
5012 | policy &= ~SCHED_RESET_ON_FORK; | |
5013 | attr.sched_policy = policy; | |
5014 | } | |
5015 | ||
dbc7f069 | 5016 | return __sched_setscheduler(p, &attr, check, true); |
7479f3c9 | 5017 | } |
961ccddd RR |
5018 | /** |
5019 | * sched_setscheduler - change the scheduling policy and/or RT priority of a thread. | |
5020 | * @p: the task in question. | |
5021 | * @policy: new policy. | |
5022 | * @param: structure containing the new RT priority. | |
5023 | * | |
e69f6186 YB |
5024 | * Return: 0 on success. An error code otherwise. |
5025 | * | |
961ccddd RR |
5026 | * NOTE that the task may be already dead. |
5027 | */ | |
5028 | int sched_setscheduler(struct task_struct *p, int policy, | |
fe7de49f | 5029 | const struct sched_param *param) |
961ccddd | 5030 | { |
7479f3c9 | 5031 | return _sched_setscheduler(p, policy, param, true); |
961ccddd | 5032 | } |
1da177e4 LT |
5033 | EXPORT_SYMBOL_GPL(sched_setscheduler); |
5034 | ||
d50dde5a DF |
5035 | int sched_setattr(struct task_struct *p, const struct sched_attr *attr) |
5036 | { | |
dbc7f069 | 5037 | return __sched_setscheduler(p, attr, true, true); |
d50dde5a DF |
5038 | } |
5039 | EXPORT_SYMBOL_GPL(sched_setattr); | |
5040 | ||
794a56eb JL |
5041 | int sched_setattr_nocheck(struct task_struct *p, const struct sched_attr *attr) |
5042 | { | |
5043 | return __sched_setscheduler(p, attr, false, true); | |
5044 | } | |
5045 | ||
961ccddd RR |
5046 | /** |
5047 | * sched_setscheduler_nocheck - change the scheduling policy and/or RT priority of a thread from kernelspace. | |
5048 | * @p: the task in question. | |
5049 | * @policy: new policy. | |
5050 | * @param: structure containing the new RT priority. | |
5051 | * | |
5052 | * Just like sched_setscheduler, only don't bother checking if the | |
5053 | * current context has permission. For example, this is needed in | |
5054 | * stop_machine(): we create temporary high priority worker threads, | |
5055 | * but our caller might not have that capability. | |
e69f6186 YB |
5056 | * |
5057 | * Return: 0 on success. An error code otherwise. | |
961ccddd RR |
5058 | */ |
5059 | int sched_setscheduler_nocheck(struct task_struct *p, int policy, | |
fe7de49f | 5060 | const struct sched_param *param) |
961ccddd | 5061 | { |
7479f3c9 | 5062 | return _sched_setscheduler(p, policy, param, false); |
961ccddd | 5063 | } |
84778472 | 5064 | EXPORT_SYMBOL_GPL(sched_setscheduler_nocheck); |
961ccddd | 5065 | |
95cdf3b7 IM |
5066 | static int |
5067 | do_sched_setscheduler(pid_t pid, int policy, struct sched_param __user *param) | |
1da177e4 | 5068 | { |
1da177e4 LT |
5069 | struct sched_param lparam; |
5070 | struct task_struct *p; | |
36c8b586 | 5071 | int retval; |
1da177e4 LT |
5072 | |
5073 | if (!param || pid < 0) | |
5074 | return -EINVAL; | |
5075 | if (copy_from_user(&lparam, param, sizeof(struct sched_param))) | |
5076 | return -EFAULT; | |
5fe1d75f ON |
5077 | |
5078 | rcu_read_lock(); | |
5079 | retval = -ESRCH; | |
1da177e4 | 5080 | p = find_process_by_pid(pid); |
710da3c8 JL |
5081 | if (likely(p)) |
5082 | get_task_struct(p); | |
5fe1d75f | 5083 | rcu_read_unlock(); |
36c8b586 | 5084 | |
710da3c8 JL |
5085 | if (likely(p)) { |
5086 | retval = sched_setscheduler(p, policy, &lparam); | |
5087 | put_task_struct(p); | |
5088 | } | |
5089 | ||
1da177e4 LT |
5090 | return retval; |
5091 | } | |
5092 | ||
d50dde5a DF |
5093 | /* |
5094 | * Mimics kernel/events/core.c perf_copy_attr(). | |
5095 | */ | |
d1ccc66d | 5096 | static int sched_copy_attr(struct sched_attr __user *uattr, struct sched_attr *attr) |
d50dde5a DF |
5097 | { |
5098 | u32 size; | |
5099 | int ret; | |
5100 | ||
96d4f267 | 5101 | if (!access_ok(uattr, SCHED_ATTR_SIZE_VER0)) |
d50dde5a DF |
5102 | return -EFAULT; |
5103 | ||
d1ccc66d | 5104 | /* Zero the full structure, so that a short copy will be nice: */ |
d50dde5a DF |
5105 | memset(attr, 0, sizeof(*attr)); |
5106 | ||
5107 | ret = get_user(size, &uattr->size); | |
5108 | if (ret) | |
5109 | return ret; | |
5110 | ||
d1ccc66d IM |
5111 | /* Bail out on silly large: */ |
5112 | if (size > PAGE_SIZE) | |
d50dde5a DF |
5113 | goto err_size; |
5114 | ||
d1ccc66d IM |
5115 | /* ABI compatibility quirk: */ |
5116 | if (!size) | |
d50dde5a DF |
5117 | size = SCHED_ATTR_SIZE_VER0; |
5118 | ||
5119 | if (size < SCHED_ATTR_SIZE_VER0) | |
5120 | goto err_size; | |
5121 | ||
5122 | /* | |
5123 | * If we're handed a bigger struct than we know of, | |
5124 | * ensure all the unknown bits are 0 - i.e. new | |
5125 | * user-space does not rely on any kernel feature | |
5126 | * extensions we dont know about yet. | |
5127 | */ | |
5128 | if (size > sizeof(*attr)) { | |
5129 | unsigned char __user *addr; | |
5130 | unsigned char __user *end; | |
5131 | unsigned char val; | |
5132 | ||
5133 | addr = (void __user *)uattr + sizeof(*attr); | |
5134 | end = (void __user *)uattr + size; | |
5135 | ||
5136 | for (; addr < end; addr++) { | |
5137 | ret = get_user(val, addr); | |
5138 | if (ret) | |
5139 | return ret; | |
5140 | if (val) | |
5141 | goto err_size; | |
5142 | } | |
5143 | size = sizeof(*attr); | |
5144 | } | |
5145 | ||
5146 | ret = copy_from_user(attr, uattr, size); | |
5147 | if (ret) | |
5148 | return -EFAULT; | |
5149 | ||
a509a7cd PB |
5150 | if ((attr->sched_flags & SCHED_FLAG_UTIL_CLAMP) && |
5151 | size < SCHED_ATTR_SIZE_VER1) | |
5152 | return -EINVAL; | |
5153 | ||
d50dde5a | 5154 | /* |
d1ccc66d | 5155 | * XXX: Do we want to be lenient like existing syscalls; or do we want |
d50dde5a DF |
5156 | * to be strict and return an error on out-of-bounds values? |
5157 | */ | |
75e45d51 | 5158 | attr->sched_nice = clamp(attr->sched_nice, MIN_NICE, MAX_NICE); |
d50dde5a | 5159 | |
e78c7bca | 5160 | return 0; |
d50dde5a DF |
5161 | |
5162 | err_size: | |
5163 | put_user(sizeof(*attr), &uattr->size); | |
e78c7bca | 5164 | return -E2BIG; |
d50dde5a DF |
5165 | } |
5166 | ||
1da177e4 LT |
5167 | /** |
5168 | * sys_sched_setscheduler - set/change the scheduler policy and RT priority | |
5169 | * @pid: the pid in question. | |
5170 | * @policy: new policy. | |
5171 | * @param: structure containing the new RT priority. | |
e69f6186 YB |
5172 | * |
5173 | * Return: 0 on success. An error code otherwise. | |
1da177e4 | 5174 | */ |
d1ccc66d | 5175 | SYSCALL_DEFINE3(sched_setscheduler, pid_t, pid, int, policy, struct sched_param __user *, param) |
1da177e4 | 5176 | { |
c21761f1 JB |
5177 | if (policy < 0) |
5178 | return -EINVAL; | |
5179 | ||
1da177e4 LT |
5180 | return do_sched_setscheduler(pid, policy, param); |
5181 | } | |
5182 | ||
5183 | /** | |
5184 | * sys_sched_setparam - set/change the RT priority of a thread | |
5185 | * @pid: the pid in question. | |
5186 | * @param: structure containing the new RT priority. | |
e69f6186 YB |
5187 | * |
5188 | * Return: 0 on success. An error code otherwise. | |
1da177e4 | 5189 | */ |
5add95d4 | 5190 | SYSCALL_DEFINE2(sched_setparam, pid_t, pid, struct sched_param __user *, param) |
1da177e4 | 5191 | { |
c13db6b1 | 5192 | return do_sched_setscheduler(pid, SETPARAM_POLICY, param); |
1da177e4 LT |
5193 | } |
5194 | ||
d50dde5a DF |
5195 | /** |
5196 | * sys_sched_setattr - same as above, but with extended sched_attr | |
5197 | * @pid: the pid in question. | |
5778fccf | 5198 | * @uattr: structure containing the extended parameters. |
db66d756 | 5199 | * @flags: for future extension. |
d50dde5a | 5200 | */ |
6d35ab48 PZ |
5201 | SYSCALL_DEFINE3(sched_setattr, pid_t, pid, struct sched_attr __user *, uattr, |
5202 | unsigned int, flags) | |
d50dde5a DF |
5203 | { |
5204 | struct sched_attr attr; | |
5205 | struct task_struct *p; | |
5206 | int retval; | |
5207 | ||
6d35ab48 | 5208 | if (!uattr || pid < 0 || flags) |
d50dde5a DF |
5209 | return -EINVAL; |
5210 | ||
143cf23d MK |
5211 | retval = sched_copy_attr(uattr, &attr); |
5212 | if (retval) | |
5213 | return retval; | |
d50dde5a | 5214 | |
b14ed2c2 | 5215 | if ((int)attr.sched_policy < 0) |
dbdb2275 | 5216 | return -EINVAL; |
1d6362fa PB |
5217 | if (attr.sched_flags & SCHED_FLAG_KEEP_POLICY) |
5218 | attr.sched_policy = SETPARAM_POLICY; | |
d50dde5a DF |
5219 | |
5220 | rcu_read_lock(); | |
5221 | retval = -ESRCH; | |
5222 | p = find_process_by_pid(pid); | |
a509a7cd PB |
5223 | if (likely(p)) |
5224 | get_task_struct(p); | |
d50dde5a DF |
5225 | rcu_read_unlock(); |
5226 | ||
a509a7cd PB |
5227 | if (likely(p)) { |
5228 | retval = sched_setattr(p, &attr); | |
5229 | put_task_struct(p); | |
5230 | } | |
5231 | ||
d50dde5a DF |
5232 | return retval; |
5233 | } | |
5234 | ||
1da177e4 LT |
5235 | /** |
5236 | * sys_sched_getscheduler - get the policy (scheduling class) of a thread | |
5237 | * @pid: the pid in question. | |
e69f6186 YB |
5238 | * |
5239 | * Return: On success, the policy of the thread. Otherwise, a negative error | |
5240 | * code. | |
1da177e4 | 5241 | */ |
5add95d4 | 5242 | SYSCALL_DEFINE1(sched_getscheduler, pid_t, pid) |
1da177e4 | 5243 | { |
36c8b586 | 5244 | struct task_struct *p; |
3a5c359a | 5245 | int retval; |
1da177e4 LT |
5246 | |
5247 | if (pid < 0) | |
3a5c359a | 5248 | return -EINVAL; |
1da177e4 LT |
5249 | |
5250 | retval = -ESRCH; | |
5fe85be0 | 5251 | rcu_read_lock(); |
1da177e4 LT |
5252 | p = find_process_by_pid(pid); |
5253 | if (p) { | |
5254 | retval = security_task_getscheduler(p); | |
5255 | if (!retval) | |
ca94c442 LP |
5256 | retval = p->policy |
5257 | | (p->sched_reset_on_fork ? SCHED_RESET_ON_FORK : 0); | |
1da177e4 | 5258 | } |
5fe85be0 | 5259 | rcu_read_unlock(); |
1da177e4 LT |
5260 | return retval; |
5261 | } | |
5262 | ||
5263 | /** | |
ca94c442 | 5264 | * sys_sched_getparam - get the RT priority of a thread |
1da177e4 LT |
5265 | * @pid: the pid in question. |
5266 | * @param: structure containing the RT priority. | |
e69f6186 YB |
5267 | * |
5268 | * Return: On success, 0 and the RT priority is in @param. Otherwise, an error | |
5269 | * code. | |
1da177e4 | 5270 | */ |
5add95d4 | 5271 | SYSCALL_DEFINE2(sched_getparam, pid_t, pid, struct sched_param __user *, param) |
1da177e4 | 5272 | { |
ce5f7f82 | 5273 | struct sched_param lp = { .sched_priority = 0 }; |
36c8b586 | 5274 | struct task_struct *p; |
3a5c359a | 5275 | int retval; |
1da177e4 LT |
5276 | |
5277 | if (!param || pid < 0) | |
3a5c359a | 5278 | return -EINVAL; |
1da177e4 | 5279 | |
5fe85be0 | 5280 | rcu_read_lock(); |
1da177e4 LT |
5281 | p = find_process_by_pid(pid); |
5282 | retval = -ESRCH; | |
5283 | if (!p) | |
5284 | goto out_unlock; | |
5285 | ||
5286 | retval = security_task_getscheduler(p); | |
5287 | if (retval) | |
5288 | goto out_unlock; | |
5289 | ||
ce5f7f82 PZ |
5290 | if (task_has_rt_policy(p)) |
5291 | lp.sched_priority = p->rt_priority; | |
5fe85be0 | 5292 | rcu_read_unlock(); |
1da177e4 LT |
5293 | |
5294 | /* | |
5295 | * This one might sleep, we cannot do it with a spinlock held ... | |
5296 | */ | |
5297 | retval = copy_to_user(param, &lp, sizeof(*param)) ? -EFAULT : 0; | |
5298 | ||
1da177e4 LT |
5299 | return retval; |
5300 | ||
5301 | out_unlock: | |
5fe85be0 | 5302 | rcu_read_unlock(); |
1da177e4 LT |
5303 | return retval; |
5304 | } | |
5305 | ||
1251201c IM |
5306 | /* |
5307 | * Copy the kernel size attribute structure (which might be larger | |
5308 | * than what user-space knows about) to user-space. | |
5309 | * | |
5310 | * Note that all cases are valid: user-space buffer can be larger or | |
5311 | * smaller than the kernel-space buffer. The usual case is that both | |
5312 | * have the same size. | |
5313 | */ | |
5314 | static int | |
5315 | sched_attr_copy_to_user(struct sched_attr __user *uattr, | |
5316 | struct sched_attr *kattr, | |
5317 | unsigned int usize) | |
d50dde5a | 5318 | { |
1251201c | 5319 | unsigned int ksize = sizeof(*kattr); |
d50dde5a | 5320 | |
96d4f267 | 5321 | if (!access_ok(uattr, usize)) |
d50dde5a DF |
5322 | return -EFAULT; |
5323 | ||
5324 | /* | |
1251201c IM |
5325 | * sched_getattr() ABI forwards and backwards compatibility: |
5326 | * | |
5327 | * If usize == ksize then we just copy everything to user-space and all is good. | |
5328 | * | |
5329 | * If usize < ksize then we only copy as much as user-space has space for, | |
5330 | * this keeps ABI compatibility as well. We skip the rest. | |
5331 | * | |
5332 | * If usize > ksize then user-space is using a newer version of the ABI, | |
5333 | * which part the kernel doesn't know about. Just ignore it - tooling can | |
5334 | * detect the kernel's knowledge of attributes from the attr->size value | |
5335 | * which is set to ksize in this case. | |
d50dde5a | 5336 | */ |
1251201c | 5337 | kattr->size = min(usize, ksize); |
d50dde5a | 5338 | |
1251201c | 5339 | if (copy_to_user(uattr, kattr, kattr->size)) |
d50dde5a DF |
5340 | return -EFAULT; |
5341 | ||
22400674 | 5342 | return 0; |
d50dde5a DF |
5343 | } |
5344 | ||
5345 | /** | |
aab03e05 | 5346 | * sys_sched_getattr - similar to sched_getparam, but with sched_attr |
d50dde5a | 5347 | * @pid: the pid in question. |
5778fccf | 5348 | * @uattr: structure containing the extended parameters. |
1251201c | 5349 | * @usize: sizeof(attr) that user-space knows about, for forwards and backwards compatibility. |
db66d756 | 5350 | * @flags: for future extension. |
d50dde5a | 5351 | */ |
6d35ab48 | 5352 | SYSCALL_DEFINE4(sched_getattr, pid_t, pid, struct sched_attr __user *, uattr, |
1251201c | 5353 | unsigned int, usize, unsigned int, flags) |
d50dde5a | 5354 | { |
1251201c | 5355 | struct sched_attr kattr = { }; |
d50dde5a DF |
5356 | struct task_struct *p; |
5357 | int retval; | |
5358 | ||
1251201c IM |
5359 | if (!uattr || pid < 0 || usize > PAGE_SIZE || |
5360 | usize < SCHED_ATTR_SIZE_VER0 || flags) | |
d50dde5a DF |
5361 | return -EINVAL; |
5362 | ||
5363 | rcu_read_lock(); | |
5364 | p = find_process_by_pid(pid); | |
5365 | retval = -ESRCH; | |
5366 | if (!p) | |
5367 | goto out_unlock; | |
5368 | ||
5369 | retval = security_task_getscheduler(p); | |
5370 | if (retval) | |
5371 | goto out_unlock; | |
5372 | ||
1251201c | 5373 | kattr.sched_policy = p->policy; |
7479f3c9 | 5374 | if (p->sched_reset_on_fork) |
1251201c | 5375 | kattr.sched_flags |= SCHED_FLAG_RESET_ON_FORK; |
aab03e05 | 5376 | if (task_has_dl_policy(p)) |
1251201c | 5377 | __getparam_dl(p, &kattr); |
aab03e05 | 5378 | else if (task_has_rt_policy(p)) |
1251201c | 5379 | kattr.sched_priority = p->rt_priority; |
d50dde5a | 5380 | else |
1251201c | 5381 | kattr.sched_nice = task_nice(p); |
d50dde5a | 5382 | |
a509a7cd | 5383 | #ifdef CONFIG_UCLAMP_TASK |
1251201c IM |
5384 | kattr.sched_util_min = p->uclamp_req[UCLAMP_MIN].value; |
5385 | kattr.sched_util_max = p->uclamp_req[UCLAMP_MAX].value; | |
a509a7cd PB |
5386 | #endif |
5387 | ||
d50dde5a DF |
5388 | rcu_read_unlock(); |
5389 | ||
1251201c | 5390 | return sched_attr_copy_to_user(uattr, &kattr, usize); |
d50dde5a DF |
5391 | |
5392 | out_unlock: | |
5393 | rcu_read_unlock(); | |
5394 | return retval; | |
5395 | } | |
5396 | ||
96f874e2 | 5397 | long sched_setaffinity(pid_t pid, const struct cpumask *in_mask) |
1da177e4 | 5398 | { |
5a16f3d3 | 5399 | cpumask_var_t cpus_allowed, new_mask; |
36c8b586 IM |
5400 | struct task_struct *p; |
5401 | int retval; | |
1da177e4 | 5402 | |
23f5d142 | 5403 | rcu_read_lock(); |
1da177e4 LT |
5404 | |
5405 | p = find_process_by_pid(pid); | |
5406 | if (!p) { | |
23f5d142 | 5407 | rcu_read_unlock(); |
1da177e4 LT |
5408 | return -ESRCH; |
5409 | } | |
5410 | ||
23f5d142 | 5411 | /* Prevent p going away */ |
1da177e4 | 5412 | get_task_struct(p); |
23f5d142 | 5413 | rcu_read_unlock(); |
1da177e4 | 5414 | |
14a40ffc TH |
5415 | if (p->flags & PF_NO_SETAFFINITY) { |
5416 | retval = -EINVAL; | |
5417 | goto out_put_task; | |
5418 | } | |
5a16f3d3 RR |
5419 | if (!alloc_cpumask_var(&cpus_allowed, GFP_KERNEL)) { |
5420 | retval = -ENOMEM; | |
5421 | goto out_put_task; | |
5422 | } | |
5423 | if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) { | |
5424 | retval = -ENOMEM; | |
5425 | goto out_free_cpus_allowed; | |
5426 | } | |
1da177e4 | 5427 | retval = -EPERM; |
4c44aaaf EB |
5428 | if (!check_same_owner(p)) { |
5429 | rcu_read_lock(); | |
5430 | if (!ns_capable(__task_cred(p)->user_ns, CAP_SYS_NICE)) { | |
5431 | rcu_read_unlock(); | |
16303ab2 | 5432 | goto out_free_new_mask; |
4c44aaaf EB |
5433 | } |
5434 | rcu_read_unlock(); | |
5435 | } | |
1da177e4 | 5436 | |
b0ae1981 | 5437 | retval = security_task_setscheduler(p); |
e7834f8f | 5438 | if (retval) |
16303ab2 | 5439 | goto out_free_new_mask; |
e7834f8f | 5440 | |
e4099a5e PZ |
5441 | |
5442 | cpuset_cpus_allowed(p, cpus_allowed); | |
5443 | cpumask_and(new_mask, in_mask, cpus_allowed); | |
5444 | ||
332ac17e DF |
5445 | /* |
5446 | * Since bandwidth control happens on root_domain basis, | |
5447 | * if admission test is enabled, we only admit -deadline | |
5448 | * tasks allowed to run on all the CPUs in the task's | |
5449 | * root_domain. | |
5450 | */ | |
5451 | #ifdef CONFIG_SMP | |
f1e3a093 KT |
5452 | if (task_has_dl_policy(p) && dl_bandwidth_enabled()) { |
5453 | rcu_read_lock(); | |
5454 | if (!cpumask_subset(task_rq(p)->rd->span, new_mask)) { | |
332ac17e | 5455 | retval = -EBUSY; |
f1e3a093 | 5456 | rcu_read_unlock(); |
16303ab2 | 5457 | goto out_free_new_mask; |
332ac17e | 5458 | } |
f1e3a093 | 5459 | rcu_read_unlock(); |
332ac17e DF |
5460 | } |
5461 | #endif | |
49246274 | 5462 | again: |
25834c73 | 5463 | retval = __set_cpus_allowed_ptr(p, new_mask, true); |
1da177e4 | 5464 | |
8707d8b8 | 5465 | if (!retval) { |
5a16f3d3 RR |
5466 | cpuset_cpus_allowed(p, cpus_allowed); |
5467 | if (!cpumask_subset(new_mask, cpus_allowed)) { | |
8707d8b8 PM |
5468 | /* |
5469 | * We must have raced with a concurrent cpuset | |
5470 | * update. Just reset the cpus_allowed to the | |
5471 | * cpuset's cpus_allowed | |
5472 | */ | |
5a16f3d3 | 5473 | cpumask_copy(new_mask, cpus_allowed); |
8707d8b8 PM |
5474 | goto again; |
5475 | } | |
5476 | } | |
16303ab2 | 5477 | out_free_new_mask: |
5a16f3d3 RR |
5478 | free_cpumask_var(new_mask); |
5479 | out_free_cpus_allowed: | |
5480 | free_cpumask_var(cpus_allowed); | |
5481 | out_put_task: | |
1da177e4 | 5482 | put_task_struct(p); |
1da177e4 LT |
5483 | return retval; |
5484 | } | |
5485 | ||
5486 | static int get_user_cpu_mask(unsigned long __user *user_mask_ptr, unsigned len, | |
96f874e2 | 5487 | struct cpumask *new_mask) |
1da177e4 | 5488 | { |
96f874e2 RR |
5489 | if (len < cpumask_size()) |
5490 | cpumask_clear(new_mask); | |
5491 | else if (len > cpumask_size()) | |
5492 | len = cpumask_size(); | |
5493 | ||
1da177e4 LT |
5494 | return copy_from_user(new_mask, user_mask_ptr, len) ? -EFAULT : 0; |
5495 | } | |
5496 | ||
5497 | /** | |
d1ccc66d | 5498 | * sys_sched_setaffinity - set the CPU affinity of a process |
1da177e4 LT |
5499 | * @pid: pid of the process |
5500 | * @len: length in bytes of the bitmask pointed to by user_mask_ptr | |
d1ccc66d | 5501 | * @user_mask_ptr: user-space pointer to the new CPU mask |
e69f6186 YB |
5502 | * |
5503 | * Return: 0 on success. An error code otherwise. | |
1da177e4 | 5504 | */ |
5add95d4 HC |
5505 | SYSCALL_DEFINE3(sched_setaffinity, pid_t, pid, unsigned int, len, |
5506 | unsigned long __user *, user_mask_ptr) | |
1da177e4 | 5507 | { |
5a16f3d3 | 5508 | cpumask_var_t new_mask; |
1da177e4 LT |
5509 | int retval; |
5510 | ||
5a16f3d3 RR |
5511 | if (!alloc_cpumask_var(&new_mask, GFP_KERNEL)) |
5512 | return -ENOMEM; | |
1da177e4 | 5513 | |
5a16f3d3 RR |
5514 | retval = get_user_cpu_mask(user_mask_ptr, len, new_mask); |
5515 | if (retval == 0) | |
5516 | retval = sched_setaffinity(pid, new_mask); | |
5517 | free_cpumask_var(new_mask); | |
5518 | return retval; | |
1da177e4 LT |
5519 | } |
5520 | ||
96f874e2 | 5521 | long sched_getaffinity(pid_t pid, struct cpumask *mask) |
1da177e4 | 5522 | { |
36c8b586 | 5523 | struct task_struct *p; |
31605683 | 5524 | unsigned long flags; |
1da177e4 | 5525 | int retval; |
1da177e4 | 5526 | |
23f5d142 | 5527 | rcu_read_lock(); |
1da177e4 LT |
5528 | |
5529 | retval = -ESRCH; | |
5530 | p = find_process_by_pid(pid); | |
5531 | if (!p) | |
5532 | goto out_unlock; | |
5533 | ||
e7834f8f DQ |
5534 | retval = security_task_getscheduler(p); |
5535 | if (retval) | |
5536 | goto out_unlock; | |
5537 | ||
013fdb80 | 5538 | raw_spin_lock_irqsave(&p->pi_lock, flags); |
3bd37062 | 5539 | cpumask_and(mask, &p->cpus_mask, cpu_active_mask); |
013fdb80 | 5540 | raw_spin_unlock_irqrestore(&p->pi_lock, flags); |
1da177e4 LT |
5541 | |
5542 | out_unlock: | |
23f5d142 | 5543 | rcu_read_unlock(); |
1da177e4 | 5544 | |
9531b62f | 5545 | return retval; |
1da177e4 LT |
5546 | } |
5547 | ||
5548 | /** | |
d1ccc66d | 5549 | * sys_sched_getaffinity - get the CPU affinity of a process |
1da177e4 LT |
5550 | * @pid: pid of the process |
5551 | * @len: length in bytes of the bitmask pointed to by user_mask_ptr | |
d1ccc66d | 5552 | * @user_mask_ptr: user-space pointer to hold the current CPU mask |
e69f6186 | 5553 | * |
599b4840 ZW |
5554 | * Return: size of CPU mask copied to user_mask_ptr on success. An |
5555 | * error code otherwise. | |
1da177e4 | 5556 | */ |
5add95d4 HC |
5557 | SYSCALL_DEFINE3(sched_getaffinity, pid_t, pid, unsigned int, len, |
5558 | unsigned long __user *, user_mask_ptr) | |
1da177e4 LT |
5559 | { |
5560 | int ret; | |
f17c8607 | 5561 | cpumask_var_t mask; |
1da177e4 | 5562 | |
84fba5ec | 5563 | if ((len * BITS_PER_BYTE) < nr_cpu_ids) |
cd3d8031 KM |
5564 | return -EINVAL; |
5565 | if (len & (sizeof(unsigned long)-1)) | |
1da177e4 LT |
5566 | return -EINVAL; |
5567 | ||
f17c8607 RR |
5568 | if (!alloc_cpumask_var(&mask, GFP_KERNEL)) |
5569 | return -ENOMEM; | |
1da177e4 | 5570 | |
f17c8607 RR |
5571 | ret = sched_getaffinity(pid, mask); |
5572 | if (ret == 0) { | |
4de373a1 | 5573 | unsigned int retlen = min(len, cpumask_size()); |
cd3d8031 KM |
5574 | |
5575 | if (copy_to_user(user_mask_ptr, mask, retlen)) | |
f17c8607 RR |
5576 | ret = -EFAULT; |
5577 | else | |
cd3d8031 | 5578 | ret = retlen; |
f17c8607 RR |
5579 | } |
5580 | free_cpumask_var(mask); | |
1da177e4 | 5581 | |
f17c8607 | 5582 | return ret; |
1da177e4 LT |
5583 | } |
5584 | ||
5585 | /** | |
5586 | * sys_sched_yield - yield the current processor to other threads. | |
5587 | * | |
dd41f596 IM |
5588 | * This function yields the current CPU to other tasks. If there are no |
5589 | * other threads running on this CPU then this function will return. | |
e69f6186 YB |
5590 | * |
5591 | * Return: 0. | |
1da177e4 | 5592 | */ |
7d4dd4f1 | 5593 | static void do_sched_yield(void) |
1da177e4 | 5594 | { |
8a8c69c3 PZ |
5595 | struct rq_flags rf; |
5596 | struct rq *rq; | |
5597 | ||
246b3b33 | 5598 | rq = this_rq_lock_irq(&rf); |
1da177e4 | 5599 | |
ae92882e | 5600 | schedstat_inc(rq->yld_count); |
4530d7ab | 5601 | current->sched_class->yield_task(rq); |
1da177e4 LT |
5602 | |
5603 | /* | |
5604 | * Since we are going to call schedule() anyway, there's | |
5605 | * no need to preempt or enable interrupts: | |
5606 | */ | |
8a8c69c3 PZ |
5607 | preempt_disable(); |
5608 | rq_unlock(rq, &rf); | |
ba74c144 | 5609 | sched_preempt_enable_no_resched(); |
1da177e4 LT |
5610 | |
5611 | schedule(); | |
7d4dd4f1 | 5612 | } |
1da177e4 | 5613 | |
7d4dd4f1 DB |
5614 | SYSCALL_DEFINE0(sched_yield) |
5615 | { | |
5616 | do_sched_yield(); | |
1da177e4 LT |
5617 | return 0; |
5618 | } | |
5619 | ||
c1a280b6 | 5620 | #ifndef CONFIG_PREEMPTION |
02b67cc3 | 5621 | int __sched _cond_resched(void) |
1da177e4 | 5622 | { |
fe32d3cd | 5623 | if (should_resched(0)) { |
a18b5d01 | 5624 | preempt_schedule_common(); |
1da177e4 LT |
5625 | return 1; |
5626 | } | |
f79c3ad6 | 5627 | rcu_all_qs(); |
1da177e4 LT |
5628 | return 0; |
5629 | } | |
02b67cc3 | 5630 | EXPORT_SYMBOL(_cond_resched); |
35a773a0 | 5631 | #endif |
1da177e4 LT |
5632 | |
5633 | /* | |
613afbf8 | 5634 | * __cond_resched_lock() - if a reschedule is pending, drop the given lock, |
1da177e4 LT |
5635 | * call schedule, and on return reacquire the lock. |
5636 | * | |
c1a280b6 | 5637 | * This works OK both with and without CONFIG_PREEMPTION. We do strange low-level |
1da177e4 LT |
5638 | * operations here to prevent schedule() from being called twice (once via |
5639 | * spin_unlock(), once by hand). | |
5640 | */ | |
613afbf8 | 5641 | int __cond_resched_lock(spinlock_t *lock) |
1da177e4 | 5642 | { |
fe32d3cd | 5643 | int resched = should_resched(PREEMPT_LOCK_OFFSET); |
6df3cecb JK |
5644 | int ret = 0; |
5645 | ||
f607c668 PZ |
5646 | lockdep_assert_held(lock); |
5647 | ||
4a81e832 | 5648 | if (spin_needbreak(lock) || resched) { |
1da177e4 | 5649 | spin_unlock(lock); |
d86ee480 | 5650 | if (resched) |
a18b5d01 | 5651 | preempt_schedule_common(); |
95c354fe NP |
5652 | else |
5653 | cpu_relax(); | |
6df3cecb | 5654 | ret = 1; |
1da177e4 | 5655 | spin_lock(lock); |
1da177e4 | 5656 | } |
6df3cecb | 5657 | return ret; |
1da177e4 | 5658 | } |
613afbf8 | 5659 | EXPORT_SYMBOL(__cond_resched_lock); |
1da177e4 | 5660 | |
1da177e4 LT |
5661 | /** |
5662 | * yield - yield the current processor to other threads. | |
5663 | * | |
8e3fabfd PZ |
5664 | * Do not ever use this function, there's a 99% chance you're doing it wrong. |
5665 | * | |
5666 | * The scheduler is at all times free to pick the calling task as the most | |
5667 | * eligible task to run, if removing the yield() call from your code breaks | |
5668 | * it, its already broken. | |
5669 | * | |
5670 | * Typical broken usage is: | |
5671 | * | |
5672 | * while (!event) | |
d1ccc66d | 5673 | * yield(); |
8e3fabfd PZ |
5674 | * |
5675 | * where one assumes that yield() will let 'the other' process run that will | |
5676 | * make event true. If the current task is a SCHED_FIFO task that will never | |
5677 | * happen. Never use yield() as a progress guarantee!! | |
5678 | * | |
5679 | * If you want to use yield() to wait for something, use wait_event(). | |
5680 | * If you want to use yield() to be 'nice' for others, use cond_resched(). | |
5681 | * If you still want to use yield(), do not! | |
1da177e4 LT |
5682 | */ |
5683 | void __sched yield(void) | |
5684 | { | |
5685 | set_current_state(TASK_RUNNING); | |
7d4dd4f1 | 5686 | do_sched_yield(); |
1da177e4 | 5687 | } |
1da177e4 LT |
5688 | EXPORT_SYMBOL(yield); |
5689 | ||
d95f4122 MG |
5690 | /** |
5691 | * yield_to - yield the current processor to another thread in | |
5692 | * your thread group, or accelerate that thread toward the | |
5693 | * processor it's on. | |
16addf95 RD |
5694 | * @p: target task |
5695 | * @preempt: whether task preemption is allowed or not | |
d95f4122 MG |
5696 | * |
5697 | * It's the caller's job to ensure that the target task struct | |
5698 | * can't go away on us before we can do any checks. | |
5699 | * | |
e69f6186 | 5700 | * Return: |
7b270f60 PZ |
5701 | * true (>0) if we indeed boosted the target task. |
5702 | * false (0) if we failed to boost the target. | |
5703 | * -ESRCH if there's no task to yield to. | |
d95f4122 | 5704 | */ |
fa93384f | 5705 | int __sched yield_to(struct task_struct *p, bool preempt) |
d95f4122 MG |
5706 | { |
5707 | struct task_struct *curr = current; | |
5708 | struct rq *rq, *p_rq; | |
5709 | unsigned long flags; | |
c3c18640 | 5710 | int yielded = 0; |
d95f4122 MG |
5711 | |
5712 | local_irq_save(flags); | |
5713 | rq = this_rq(); | |
5714 | ||
5715 | again: | |
5716 | p_rq = task_rq(p); | |
7b270f60 PZ |
5717 | /* |
5718 | * If we're the only runnable task on the rq and target rq also | |
5719 | * has only one task, there's absolutely no point in yielding. | |
5720 | */ | |
5721 | if (rq->nr_running == 1 && p_rq->nr_running == 1) { | |
5722 | yielded = -ESRCH; | |
5723 | goto out_irq; | |
5724 | } | |
5725 | ||
d95f4122 | 5726 | double_rq_lock(rq, p_rq); |
39e24d8f | 5727 | if (task_rq(p) != p_rq) { |
d95f4122 MG |
5728 | double_rq_unlock(rq, p_rq); |
5729 | goto again; | |
5730 | } | |
5731 | ||
5732 | if (!curr->sched_class->yield_to_task) | |
7b270f60 | 5733 | goto out_unlock; |
d95f4122 MG |
5734 | |
5735 | if (curr->sched_class != p->sched_class) | |
7b270f60 | 5736 | goto out_unlock; |
d95f4122 MG |
5737 | |
5738 | if (task_running(p_rq, p) || p->state) | |
7b270f60 | 5739 | goto out_unlock; |
d95f4122 MG |
5740 | |
5741 | yielded = curr->sched_class->yield_to_task(rq, p, preempt); | |
6d1cafd8 | 5742 | if (yielded) { |
ae92882e | 5743 | schedstat_inc(rq->yld_count); |
6d1cafd8 VP |
5744 | /* |
5745 | * Make p's CPU reschedule; pick_next_entity takes care of | |
5746 | * fairness. | |
5747 | */ | |
5748 | if (preempt && rq != p_rq) | |
8875125e | 5749 | resched_curr(p_rq); |
6d1cafd8 | 5750 | } |
d95f4122 | 5751 | |
7b270f60 | 5752 | out_unlock: |
d95f4122 | 5753 | double_rq_unlock(rq, p_rq); |
7b270f60 | 5754 | out_irq: |
d95f4122 MG |
5755 | local_irq_restore(flags); |
5756 | ||
7b270f60 | 5757 | if (yielded > 0) |
d95f4122 MG |
5758 | schedule(); |
5759 | ||
5760 | return yielded; | |
5761 | } | |
5762 | EXPORT_SYMBOL_GPL(yield_to); | |
5763 | ||
10ab5643 TH |
5764 | int io_schedule_prepare(void) |
5765 | { | |
5766 | int old_iowait = current->in_iowait; | |
5767 | ||
5768 | current->in_iowait = 1; | |
5769 | blk_schedule_flush_plug(current); | |
5770 | ||
5771 | return old_iowait; | |
5772 | } | |
5773 | ||
5774 | void io_schedule_finish(int token) | |
5775 | { | |
5776 | current->in_iowait = token; | |
5777 | } | |
5778 | ||
1da177e4 | 5779 | /* |
41a2d6cf | 5780 | * This task is about to go to sleep on IO. Increment rq->nr_iowait so |
1da177e4 | 5781 | * that process accounting knows that this is a task in IO wait state. |
1da177e4 | 5782 | */ |
1da177e4 LT |
5783 | long __sched io_schedule_timeout(long timeout) |
5784 | { | |
10ab5643 | 5785 | int token; |
1da177e4 LT |
5786 | long ret; |
5787 | ||
10ab5643 | 5788 | token = io_schedule_prepare(); |
1da177e4 | 5789 | ret = schedule_timeout(timeout); |
10ab5643 | 5790 | io_schedule_finish(token); |
9cff8ade | 5791 | |
1da177e4 LT |
5792 | return ret; |
5793 | } | |
9cff8ade | 5794 | EXPORT_SYMBOL(io_schedule_timeout); |
1da177e4 | 5795 | |
e3b929b0 | 5796 | void __sched io_schedule(void) |
10ab5643 TH |
5797 | { |
5798 | int token; | |
5799 | ||
5800 | token = io_schedule_prepare(); | |
5801 | schedule(); | |
5802 | io_schedule_finish(token); | |
5803 | } | |
5804 | EXPORT_SYMBOL(io_schedule); | |
5805 | ||
1da177e4 LT |
5806 | /** |
5807 | * sys_sched_get_priority_max - return maximum RT priority. | |
5808 | * @policy: scheduling class. | |
5809 | * | |
e69f6186 YB |
5810 | * Return: On success, this syscall returns the maximum |
5811 | * rt_priority that can be used by a given scheduling class. | |
5812 | * On failure, a negative error code is returned. | |
1da177e4 | 5813 | */ |
5add95d4 | 5814 | SYSCALL_DEFINE1(sched_get_priority_max, int, policy) |
1da177e4 LT |
5815 | { |
5816 | int ret = -EINVAL; | |
5817 | ||
5818 | switch (policy) { | |
5819 | case SCHED_FIFO: | |
5820 | case SCHED_RR: | |
5821 | ret = MAX_USER_RT_PRIO-1; | |
5822 | break; | |
aab03e05 | 5823 | case SCHED_DEADLINE: |
1da177e4 | 5824 | case SCHED_NORMAL: |
b0a9499c | 5825 | case SCHED_BATCH: |
dd41f596 | 5826 | case SCHED_IDLE: |
1da177e4 LT |
5827 | ret = 0; |
5828 | break; | |
5829 | } | |
5830 | return ret; | |
5831 | } | |
5832 | ||
5833 | /** | |
5834 | * sys_sched_get_priority_min - return minimum RT priority. | |
5835 | * @policy: scheduling class. | |
5836 | * | |
e69f6186 YB |
5837 | * Return: On success, this syscall returns the minimum |
5838 | * rt_priority that can be used by a given scheduling class. | |
5839 | * On failure, a negative error code is returned. | |
1da177e4 | 5840 | */ |
5add95d4 | 5841 | SYSCALL_DEFINE1(sched_get_priority_min, int, policy) |
1da177e4 LT |
5842 | { |
5843 | int ret = -EINVAL; | |
5844 | ||
5845 | switch (policy) { | |
5846 | case SCHED_FIFO: | |
5847 | case SCHED_RR: | |
5848 | ret = 1; | |
5849 | break; | |
aab03e05 | 5850 | case SCHED_DEADLINE: |
1da177e4 | 5851 | case SCHED_NORMAL: |
b0a9499c | 5852 | case SCHED_BATCH: |
dd41f596 | 5853 | case SCHED_IDLE: |
1da177e4 LT |
5854 | ret = 0; |
5855 | } | |
5856 | return ret; | |
5857 | } | |
5858 | ||
abca5fc5 | 5859 | static int sched_rr_get_interval(pid_t pid, struct timespec64 *t) |
1da177e4 | 5860 | { |
36c8b586 | 5861 | struct task_struct *p; |
a4ec24b4 | 5862 | unsigned int time_slice; |
eb580751 | 5863 | struct rq_flags rf; |
dba091b9 | 5864 | struct rq *rq; |
3a5c359a | 5865 | int retval; |
1da177e4 LT |
5866 | |
5867 | if (pid < 0) | |
3a5c359a | 5868 | return -EINVAL; |
1da177e4 LT |
5869 | |
5870 | retval = -ESRCH; | |
1a551ae7 | 5871 | rcu_read_lock(); |
1da177e4 LT |
5872 | p = find_process_by_pid(pid); |
5873 | if (!p) | |
5874 | goto out_unlock; | |
5875 | ||
5876 | retval = security_task_getscheduler(p); | |
5877 | if (retval) | |
5878 | goto out_unlock; | |
5879 | ||
eb580751 | 5880 | rq = task_rq_lock(p, &rf); |
a57beec5 PZ |
5881 | time_slice = 0; |
5882 | if (p->sched_class->get_rr_interval) | |
5883 | time_slice = p->sched_class->get_rr_interval(rq, p); | |
eb580751 | 5884 | task_rq_unlock(rq, p, &rf); |
a4ec24b4 | 5885 | |
1a551ae7 | 5886 | rcu_read_unlock(); |
abca5fc5 AV |
5887 | jiffies_to_timespec64(time_slice, t); |
5888 | return 0; | |
3a5c359a | 5889 | |
1da177e4 | 5890 | out_unlock: |
1a551ae7 | 5891 | rcu_read_unlock(); |
1da177e4 LT |
5892 | return retval; |
5893 | } | |
5894 | ||
2064a5ab RD |
5895 | /** |
5896 | * sys_sched_rr_get_interval - return the default timeslice of a process. | |
5897 | * @pid: pid of the process. | |
5898 | * @interval: userspace pointer to the timeslice value. | |
5899 | * | |
5900 | * this syscall writes the default timeslice value of a given process | |
5901 | * into the user-space timespec buffer. A value of '0' means infinity. | |
5902 | * | |
5903 | * Return: On success, 0 and the timeslice is in @interval. Otherwise, | |
5904 | * an error code. | |
5905 | */ | |
abca5fc5 | 5906 | SYSCALL_DEFINE2(sched_rr_get_interval, pid_t, pid, |
474b9c77 | 5907 | struct __kernel_timespec __user *, interval) |
abca5fc5 AV |
5908 | { |
5909 | struct timespec64 t; | |
5910 | int retval = sched_rr_get_interval(pid, &t); | |
5911 | ||
5912 | if (retval == 0) | |
5913 | retval = put_timespec64(&t, interval); | |
5914 | ||
5915 | return retval; | |
5916 | } | |
5917 | ||
474b9c77 | 5918 | #ifdef CONFIG_COMPAT_32BIT_TIME |
8dabe724 AB |
5919 | SYSCALL_DEFINE2(sched_rr_get_interval_time32, pid_t, pid, |
5920 | struct old_timespec32 __user *, interval) | |
abca5fc5 AV |
5921 | { |
5922 | struct timespec64 t; | |
5923 | int retval = sched_rr_get_interval(pid, &t); | |
5924 | ||
5925 | if (retval == 0) | |
9afc5eee | 5926 | retval = put_old_timespec32(&t, interval); |
abca5fc5 AV |
5927 | return retval; |
5928 | } | |
5929 | #endif | |
5930 | ||
82a1fcb9 | 5931 | void sched_show_task(struct task_struct *p) |
1da177e4 | 5932 | { |
1da177e4 | 5933 | unsigned long free = 0; |
4e79752c | 5934 | int ppid; |
c930b2c0 | 5935 | |
38200502 TH |
5936 | if (!try_get_task_stack(p)) |
5937 | return; | |
20435d84 XX |
5938 | |
5939 | printk(KERN_INFO "%-15.15s %c", p->comm, task_state_to_char(p)); | |
5940 | ||
5941 | if (p->state == TASK_RUNNING) | |
3df0fc5b | 5942 | printk(KERN_CONT " running task "); |
1da177e4 | 5943 | #ifdef CONFIG_DEBUG_STACK_USAGE |
7c9f8861 | 5944 | free = stack_not_used(p); |
1da177e4 | 5945 | #endif |
a90e984c | 5946 | ppid = 0; |
4e79752c | 5947 | rcu_read_lock(); |
a90e984c ON |
5948 | if (pid_alive(p)) |
5949 | ppid = task_pid_nr(rcu_dereference(p->real_parent)); | |
4e79752c | 5950 | rcu_read_unlock(); |
3df0fc5b | 5951 | printk(KERN_CONT "%5lu %5d %6d 0x%08lx\n", free, |
4e79752c | 5952 | task_pid_nr(p), ppid, |
aa47b7e0 | 5953 | (unsigned long)task_thread_info(p)->flags); |
1da177e4 | 5954 | |
3d1cb205 | 5955 | print_worker_info(KERN_INFO, p); |
5fb5e6de | 5956 | show_stack(p, NULL); |
38200502 | 5957 | put_task_stack(p); |
1da177e4 | 5958 | } |
0032f4e8 | 5959 | EXPORT_SYMBOL_GPL(sched_show_task); |
1da177e4 | 5960 | |
5d68cc95 PZ |
5961 | static inline bool |
5962 | state_filter_match(unsigned long state_filter, struct task_struct *p) | |
5963 | { | |
5964 | /* no filter, everything matches */ | |
5965 | if (!state_filter) | |
5966 | return true; | |
5967 | ||
5968 | /* filter, but doesn't match */ | |
5969 | if (!(p->state & state_filter)) | |
5970 | return false; | |
5971 | ||
5972 | /* | |
5973 | * When looking for TASK_UNINTERRUPTIBLE skip TASK_IDLE (allows | |
5974 | * TASK_KILLABLE). | |
5975 | */ | |
5976 | if (state_filter == TASK_UNINTERRUPTIBLE && p->state == TASK_IDLE) | |
5977 | return false; | |
5978 | ||
5979 | return true; | |
5980 | } | |
5981 | ||
5982 | ||
e59e2ae2 | 5983 | void show_state_filter(unsigned long state_filter) |
1da177e4 | 5984 | { |
36c8b586 | 5985 | struct task_struct *g, *p; |
1da177e4 | 5986 | |
4bd77321 | 5987 | #if BITS_PER_LONG == 32 |
3df0fc5b PZ |
5988 | printk(KERN_INFO |
5989 | " task PC stack pid father\n"); | |
1da177e4 | 5990 | #else |
3df0fc5b PZ |
5991 | printk(KERN_INFO |
5992 | " task PC stack pid father\n"); | |
1da177e4 | 5993 | #endif |
510f5acc | 5994 | rcu_read_lock(); |
5d07f420 | 5995 | for_each_process_thread(g, p) { |
1da177e4 LT |
5996 | /* |
5997 | * reset the NMI-timeout, listing all files on a slow | |
25985edc | 5998 | * console might take a lot of time: |
57675cb9 AR |
5999 | * Also, reset softlockup watchdogs on all CPUs, because |
6000 | * another CPU might be blocked waiting for us to process | |
6001 | * an IPI. | |
1da177e4 LT |
6002 | */ |
6003 | touch_nmi_watchdog(); | |
57675cb9 | 6004 | touch_all_softlockup_watchdogs(); |
5d68cc95 | 6005 | if (state_filter_match(state_filter, p)) |
82a1fcb9 | 6006 | sched_show_task(p); |
5d07f420 | 6007 | } |
1da177e4 | 6008 | |
dd41f596 | 6009 | #ifdef CONFIG_SCHED_DEBUG |
fb90a6e9 RV |
6010 | if (!state_filter) |
6011 | sysrq_sched_debug_show(); | |
dd41f596 | 6012 | #endif |
510f5acc | 6013 | rcu_read_unlock(); |
e59e2ae2 IM |
6014 | /* |
6015 | * Only show locks if all tasks are dumped: | |
6016 | */ | |
93335a21 | 6017 | if (!state_filter) |
e59e2ae2 | 6018 | debug_show_all_locks(); |
1da177e4 LT |
6019 | } |
6020 | ||
f340c0d1 IM |
6021 | /** |
6022 | * init_idle - set up an idle thread for a given CPU | |
6023 | * @idle: task in question | |
d1ccc66d | 6024 | * @cpu: CPU the idle task belongs to |
f340c0d1 IM |
6025 | * |
6026 | * NOTE: this function does not set the idle thread's NEED_RESCHED | |
6027 | * flag, to make booting more robust. | |
6028 | */ | |
0db0628d | 6029 | void init_idle(struct task_struct *idle, int cpu) |
1da177e4 | 6030 | { |
70b97a7f | 6031 | struct rq *rq = cpu_rq(cpu); |
1da177e4 LT |
6032 | unsigned long flags; |
6033 | ||
25834c73 PZ |
6034 | raw_spin_lock_irqsave(&idle->pi_lock, flags); |
6035 | raw_spin_lock(&rq->lock); | |
5cbd54ef | 6036 | |
5e1576ed | 6037 | __sched_fork(0, idle); |
06b83b5f | 6038 | idle->state = TASK_RUNNING; |
dd41f596 | 6039 | idle->se.exec_start = sched_clock(); |
c1de45ca | 6040 | idle->flags |= PF_IDLE; |
dd41f596 | 6041 | |
e1b77c92 MR |
6042 | kasan_unpoison_task_stack(idle); |
6043 | ||
de9b8f5d PZ |
6044 | #ifdef CONFIG_SMP |
6045 | /* | |
6046 | * Its possible that init_idle() gets called multiple times on a task, | |
6047 | * in that case do_set_cpus_allowed() will not do the right thing. | |
6048 | * | |
6049 | * And since this is boot we can forgo the serialization. | |
6050 | */ | |
6051 | set_cpus_allowed_common(idle, cpumask_of(cpu)); | |
6052 | #endif | |
6506cf6c PZ |
6053 | /* |
6054 | * We're having a chicken and egg problem, even though we are | |
d1ccc66d | 6055 | * holding rq->lock, the CPU isn't yet set to this CPU so the |
6506cf6c PZ |
6056 | * lockdep check in task_group() will fail. |
6057 | * | |
6058 | * Similar case to sched_fork(). / Alternatively we could | |
6059 | * use task_rq_lock() here and obtain the other rq->lock. | |
6060 | * | |
6061 | * Silence PROVE_RCU | |
6062 | */ | |
6063 | rcu_read_lock(); | |
dd41f596 | 6064 | __set_task_cpu(idle, cpu); |
6506cf6c | 6065 | rcu_read_unlock(); |
1da177e4 | 6066 | |
5311a98f EB |
6067 | rq->idle = idle; |
6068 | rcu_assign_pointer(rq->curr, idle); | |
da0c1e65 | 6069 | idle->on_rq = TASK_ON_RQ_QUEUED; |
de9b8f5d | 6070 | #ifdef CONFIG_SMP |
3ca7a440 | 6071 | idle->on_cpu = 1; |
4866cde0 | 6072 | #endif |
25834c73 PZ |
6073 | raw_spin_unlock(&rq->lock); |
6074 | raw_spin_unlock_irqrestore(&idle->pi_lock, flags); | |
1da177e4 LT |
6075 | |
6076 | /* Set the preempt count _outside_ the spinlocks! */ | |
01028747 | 6077 | init_idle_preempt_count(idle, cpu); |
55cd5340 | 6078 | |
dd41f596 IM |
6079 | /* |
6080 | * The idle tasks have their own, simple scheduling class: | |
6081 | */ | |
6082 | idle->sched_class = &idle_sched_class; | |
868baf07 | 6083 | ftrace_graph_init_idle_task(idle, cpu); |
45eacc69 | 6084 | vtime_init_idle(idle, cpu); |
de9b8f5d | 6085 | #ifdef CONFIG_SMP |
f1c6f1a7 CE |
6086 | sprintf(idle->comm, "%s/%d", INIT_TASK_COMM, cpu); |
6087 | #endif | |
19978ca6 IM |
6088 | } |
6089 | ||
e1d4eeec NP |
6090 | #ifdef CONFIG_SMP |
6091 | ||
f82f8042 JL |
6092 | int cpuset_cpumask_can_shrink(const struct cpumask *cur, |
6093 | const struct cpumask *trial) | |
6094 | { | |
06a76fe0 | 6095 | int ret = 1; |
f82f8042 | 6096 | |
bb2bc55a MG |
6097 | if (!cpumask_weight(cur)) |
6098 | return ret; | |
6099 | ||
06a76fe0 | 6100 | ret = dl_cpuset_cpumask_can_shrink(cur, trial); |
f82f8042 JL |
6101 | |
6102 | return ret; | |
6103 | } | |
6104 | ||
7f51412a JL |
6105 | int task_can_attach(struct task_struct *p, |
6106 | const struct cpumask *cs_cpus_allowed) | |
6107 | { | |
6108 | int ret = 0; | |
6109 | ||
6110 | /* | |
6111 | * Kthreads which disallow setaffinity shouldn't be moved | |
d1ccc66d | 6112 | * to a new cpuset; we don't want to change their CPU |
7f51412a JL |
6113 | * affinity and isolating such threads by their set of |
6114 | * allowed nodes is unnecessary. Thus, cpusets are not | |
6115 | * applicable for such threads. This prevents checking for | |
6116 | * success of set_cpus_allowed_ptr() on all attached tasks | |
3bd37062 | 6117 | * before cpus_mask may be changed. |
7f51412a JL |
6118 | */ |
6119 | if (p->flags & PF_NO_SETAFFINITY) { | |
6120 | ret = -EINVAL; | |
6121 | goto out; | |
6122 | } | |
6123 | ||
7f51412a | 6124 | if (dl_task(p) && !cpumask_intersects(task_rq(p)->rd->span, |
06a76fe0 NP |
6125 | cs_cpus_allowed)) |
6126 | ret = dl_task_can_attach(p, cs_cpus_allowed); | |
7f51412a | 6127 | |
7f51412a JL |
6128 | out: |
6129 | return ret; | |
6130 | } | |
6131 | ||
f2cb1360 | 6132 | bool sched_smp_initialized __read_mostly; |
e26fbffd | 6133 | |
e6628d5b MG |
6134 | #ifdef CONFIG_NUMA_BALANCING |
6135 | /* Migrate current task p to target_cpu */ | |
6136 | int migrate_task_to(struct task_struct *p, int target_cpu) | |
6137 | { | |
6138 | struct migration_arg arg = { p, target_cpu }; | |
6139 | int curr_cpu = task_cpu(p); | |
6140 | ||
6141 | if (curr_cpu == target_cpu) | |
6142 | return 0; | |
6143 | ||
3bd37062 | 6144 | if (!cpumask_test_cpu(target_cpu, p->cpus_ptr)) |
e6628d5b MG |
6145 | return -EINVAL; |
6146 | ||
6147 | /* TODO: This is not properly updating schedstats */ | |
6148 | ||
286549dc | 6149 | trace_sched_move_numa(p, curr_cpu, target_cpu); |
e6628d5b MG |
6150 | return stop_one_cpu(curr_cpu, migration_cpu_stop, &arg); |
6151 | } | |
0ec8aa00 PZ |
6152 | |
6153 | /* | |
6154 | * Requeue a task on a given node and accurately track the number of NUMA | |
6155 | * tasks on the runqueues | |
6156 | */ | |
6157 | void sched_setnuma(struct task_struct *p, int nid) | |
6158 | { | |
da0c1e65 | 6159 | bool queued, running; |
eb580751 PZ |
6160 | struct rq_flags rf; |
6161 | struct rq *rq; | |
0ec8aa00 | 6162 | |
eb580751 | 6163 | rq = task_rq_lock(p, &rf); |
da0c1e65 | 6164 | queued = task_on_rq_queued(p); |
0ec8aa00 PZ |
6165 | running = task_current(rq, p); |
6166 | ||
da0c1e65 | 6167 | if (queued) |
1de64443 | 6168 | dequeue_task(rq, p, DEQUEUE_SAVE); |
0ec8aa00 | 6169 | if (running) |
f3cd1c4e | 6170 | put_prev_task(rq, p); |
0ec8aa00 PZ |
6171 | |
6172 | p->numa_preferred_nid = nid; | |
0ec8aa00 | 6173 | |
da0c1e65 | 6174 | if (queued) |
7134b3e9 | 6175 | enqueue_task(rq, p, ENQUEUE_RESTORE | ENQUEUE_NOCLOCK); |
a399d233 | 6176 | if (running) |
03b7fad1 | 6177 | set_next_task(rq, p); |
eb580751 | 6178 | task_rq_unlock(rq, p, &rf); |
0ec8aa00 | 6179 | } |
5cc389bc | 6180 | #endif /* CONFIG_NUMA_BALANCING */ |
f7b4cddc | 6181 | |
1da177e4 | 6182 | #ifdef CONFIG_HOTPLUG_CPU |
054b9108 | 6183 | /* |
d1ccc66d | 6184 | * Ensure that the idle task is using init_mm right before its CPU goes |
48c5ccae | 6185 | * offline. |
054b9108 | 6186 | */ |
48c5ccae | 6187 | void idle_task_exit(void) |
1da177e4 | 6188 | { |
48c5ccae | 6189 | struct mm_struct *mm = current->active_mm; |
e76bd8d9 | 6190 | |
48c5ccae | 6191 | BUG_ON(cpu_online(smp_processor_id())); |
e76bd8d9 | 6192 | |
a53efe5f | 6193 | if (mm != &init_mm) { |
252d2a41 | 6194 | switch_mm(mm, &init_mm, current); |
3eda69c9 | 6195 | current->active_mm = &init_mm; |
a53efe5f MS |
6196 | finish_arch_post_lock_switch(); |
6197 | } | |
48c5ccae | 6198 | mmdrop(mm); |
1da177e4 LT |
6199 | } |
6200 | ||
6201 | /* | |
5d180232 PZ |
6202 | * Since this CPU is going 'away' for a while, fold any nr_active delta |
6203 | * we might have. Assumes we're called after migrate_tasks() so that the | |
d60585c5 TG |
6204 | * nr_active count is stable. We need to take the teardown thread which |
6205 | * is calling this into account, so we hand in adjust = 1 to the load | |
6206 | * calculation. | |
5d180232 PZ |
6207 | * |
6208 | * Also see the comment "Global load-average calculations". | |
1da177e4 | 6209 | */ |
5d180232 | 6210 | static void calc_load_migrate(struct rq *rq) |
1da177e4 | 6211 | { |
d60585c5 | 6212 | long delta = calc_load_fold_active(rq, 1); |
5d180232 PZ |
6213 | if (delta) |
6214 | atomic_long_add(delta, &calc_load_tasks); | |
1da177e4 LT |
6215 | } |
6216 | ||
10e7071b | 6217 | static struct task_struct *__pick_migrate_task(struct rq *rq) |
3f1d2a31 | 6218 | { |
10e7071b PZ |
6219 | const struct sched_class *class; |
6220 | struct task_struct *next; | |
3f1d2a31 | 6221 | |
10e7071b PZ |
6222 | for_each_class(class) { |
6223 | next = class->pick_next_task(rq, NULL, NULL); | |
6224 | if (next) { | |
5f2a45fc | 6225 | next->sched_class->put_prev_task(rq, next, NULL); |
10e7071b PZ |
6226 | return next; |
6227 | } | |
6228 | } | |
3f1d2a31 | 6229 | |
10e7071b PZ |
6230 | /* The idle class should always have a runnable task */ |
6231 | BUG(); | |
6232 | } | |
3f1d2a31 | 6233 | |
48f24c4d | 6234 | /* |
48c5ccae PZ |
6235 | * Migrate all tasks from the rq, sleeping tasks will be migrated by |
6236 | * try_to_wake_up()->select_task_rq(). | |
6237 | * | |
6238 | * Called with rq->lock held even though we'er in stop_machine() and | |
6239 | * there's no concurrency possible, we hold the required locks anyway | |
6240 | * because of lock validation efforts. | |
1da177e4 | 6241 | */ |
8a8c69c3 | 6242 | static void migrate_tasks(struct rq *dead_rq, struct rq_flags *rf) |
1da177e4 | 6243 | { |
5e16bbc2 | 6244 | struct rq *rq = dead_rq; |
48c5ccae | 6245 | struct task_struct *next, *stop = rq->stop; |
8a8c69c3 | 6246 | struct rq_flags orf = *rf; |
48c5ccae | 6247 | int dest_cpu; |
1da177e4 LT |
6248 | |
6249 | /* | |
48c5ccae PZ |
6250 | * Fudge the rq selection such that the below task selection loop |
6251 | * doesn't get stuck on the currently eligible stop task. | |
6252 | * | |
6253 | * We're currently inside stop_machine() and the rq is either stuck | |
6254 | * in the stop_machine_cpu_stop() loop, or we're executing this code, | |
6255 | * either way we should never end up calling schedule() until we're | |
6256 | * done here. | |
1da177e4 | 6257 | */ |
48c5ccae | 6258 | rq->stop = NULL; |
48f24c4d | 6259 | |
77bd3970 FW |
6260 | /* |
6261 | * put_prev_task() and pick_next_task() sched | |
6262 | * class method both need to have an up-to-date | |
6263 | * value of rq->clock[_task] | |
6264 | */ | |
6265 | update_rq_clock(rq); | |
6266 | ||
5e16bbc2 | 6267 | for (;;) { |
48c5ccae PZ |
6268 | /* |
6269 | * There's this thread running, bail when that's the only | |
d1ccc66d | 6270 | * remaining thread: |
48c5ccae PZ |
6271 | */ |
6272 | if (rq->nr_running == 1) | |
dd41f596 | 6273 | break; |
48c5ccae | 6274 | |
10e7071b | 6275 | next = __pick_migrate_task(rq); |
e692ab53 | 6276 | |
5473e0cc | 6277 | /* |
3bd37062 | 6278 | * Rules for changing task_struct::cpus_mask are holding |
5473e0cc WL |
6279 | * both pi_lock and rq->lock, such that holding either |
6280 | * stabilizes the mask. | |
6281 | * | |
6282 | * Drop rq->lock is not quite as disastrous as it usually is | |
6283 | * because !cpu_active at this point, which means load-balance | |
6284 | * will not interfere. Also, stop-machine. | |
6285 | */ | |
8a8c69c3 | 6286 | rq_unlock(rq, rf); |
5473e0cc | 6287 | raw_spin_lock(&next->pi_lock); |
8a8c69c3 | 6288 | rq_relock(rq, rf); |
5473e0cc WL |
6289 | |
6290 | /* | |
6291 | * Since we're inside stop-machine, _nothing_ should have | |
6292 | * changed the task, WARN if weird stuff happened, because in | |
6293 | * that case the above rq->lock drop is a fail too. | |
6294 | */ | |
6295 | if (WARN_ON(task_rq(next) != rq || !task_on_rq_queued(next))) { | |
6296 | raw_spin_unlock(&next->pi_lock); | |
6297 | continue; | |
6298 | } | |
6299 | ||
48c5ccae | 6300 | /* Find suitable destination for @next, with force if needed. */ |
5e16bbc2 | 6301 | dest_cpu = select_fallback_rq(dead_rq->cpu, next); |
8a8c69c3 | 6302 | rq = __migrate_task(rq, rf, next, dest_cpu); |
5e16bbc2 | 6303 | if (rq != dead_rq) { |
8a8c69c3 | 6304 | rq_unlock(rq, rf); |
5e16bbc2 | 6305 | rq = dead_rq; |
8a8c69c3 PZ |
6306 | *rf = orf; |
6307 | rq_relock(rq, rf); | |
5e16bbc2 | 6308 | } |
5473e0cc | 6309 | raw_spin_unlock(&next->pi_lock); |
1da177e4 | 6310 | } |
dce48a84 | 6311 | |
48c5ccae | 6312 | rq->stop = stop; |
dce48a84 | 6313 | } |
1da177e4 LT |
6314 | #endif /* CONFIG_HOTPLUG_CPU */ |
6315 | ||
f2cb1360 | 6316 | void set_rq_online(struct rq *rq) |
1f11eb6a GH |
6317 | { |
6318 | if (!rq->online) { | |
6319 | const struct sched_class *class; | |
6320 | ||
c6c4927b | 6321 | cpumask_set_cpu(rq->cpu, rq->rd->online); |
1f11eb6a GH |
6322 | rq->online = 1; |
6323 | ||
6324 | for_each_class(class) { | |
6325 | if (class->rq_online) | |
6326 | class->rq_online(rq); | |
6327 | } | |
6328 | } | |
6329 | } | |
6330 | ||
f2cb1360 | 6331 | void set_rq_offline(struct rq *rq) |
1f11eb6a GH |
6332 | { |
6333 | if (rq->online) { | |
6334 | const struct sched_class *class; | |
6335 | ||
6336 | for_each_class(class) { | |
6337 | if (class->rq_offline) | |
6338 | class->rq_offline(rq); | |
6339 | } | |
6340 | ||
c6c4927b | 6341 | cpumask_clear_cpu(rq->cpu, rq->rd->online); |
1f11eb6a GH |
6342 | rq->online = 0; |
6343 | } | |
6344 | } | |
6345 | ||
d1ccc66d IM |
6346 | /* |
6347 | * used to mark begin/end of suspend/resume: | |
6348 | */ | |
6349 | static int num_cpus_frozen; | |
d35be8ba | 6350 | |
1da177e4 | 6351 | /* |
3a101d05 TH |
6352 | * Update cpusets according to cpu_active mask. If cpusets are |
6353 | * disabled, cpuset_update_active_cpus() becomes a simple wrapper | |
6354 | * around partition_sched_domains(). | |
d35be8ba SB |
6355 | * |
6356 | * If we come here as part of a suspend/resume, don't touch cpusets because we | |
6357 | * want to restore it back to its original state upon resume anyway. | |
1da177e4 | 6358 | */ |
40190a78 | 6359 | static void cpuset_cpu_active(void) |
e761b772 | 6360 | { |
40190a78 | 6361 | if (cpuhp_tasks_frozen) { |
d35be8ba SB |
6362 | /* |
6363 | * num_cpus_frozen tracks how many CPUs are involved in suspend | |
6364 | * resume sequence. As long as this is not the last online | |
6365 | * operation in the resume sequence, just build a single sched | |
6366 | * domain, ignoring cpusets. | |
6367 | */ | |
50e76632 PZ |
6368 | partition_sched_domains(1, NULL, NULL); |
6369 | if (--num_cpus_frozen) | |
135fb3e1 | 6370 | return; |
d35be8ba SB |
6371 | /* |
6372 | * This is the last CPU online operation. So fall through and | |
6373 | * restore the original sched domains by considering the | |
6374 | * cpuset configurations. | |
6375 | */ | |
50e76632 | 6376 | cpuset_force_rebuild(); |
3a101d05 | 6377 | } |
30e03acd | 6378 | cpuset_update_active_cpus(); |
3a101d05 | 6379 | } |
e761b772 | 6380 | |
40190a78 | 6381 | static int cpuset_cpu_inactive(unsigned int cpu) |
3a101d05 | 6382 | { |
40190a78 | 6383 | if (!cpuhp_tasks_frozen) { |
06a76fe0 | 6384 | if (dl_cpu_busy(cpu)) |
135fb3e1 | 6385 | return -EBUSY; |
30e03acd | 6386 | cpuset_update_active_cpus(); |
135fb3e1 | 6387 | } else { |
d35be8ba SB |
6388 | num_cpus_frozen++; |
6389 | partition_sched_domains(1, NULL, NULL); | |
e761b772 | 6390 | } |
135fb3e1 | 6391 | return 0; |
e761b772 | 6392 | } |
e761b772 | 6393 | |
40190a78 | 6394 | int sched_cpu_activate(unsigned int cpu) |
135fb3e1 | 6395 | { |
7d976699 | 6396 | struct rq *rq = cpu_rq(cpu); |
8a8c69c3 | 6397 | struct rq_flags rf; |
7d976699 | 6398 | |
ba2591a5 PZ |
6399 | #ifdef CONFIG_SCHED_SMT |
6400 | /* | |
c5511d03 | 6401 | * When going up, increment the number of cores with SMT present. |
ba2591a5 | 6402 | */ |
c5511d03 PZI |
6403 | if (cpumask_weight(cpu_smt_mask(cpu)) == 2) |
6404 | static_branch_inc_cpuslocked(&sched_smt_present); | |
ba2591a5 | 6405 | #endif |
40190a78 | 6406 | set_cpu_active(cpu, true); |
135fb3e1 | 6407 | |
40190a78 | 6408 | if (sched_smp_initialized) { |
135fb3e1 | 6409 | sched_domains_numa_masks_set(cpu); |
40190a78 | 6410 | cpuset_cpu_active(); |
e761b772 | 6411 | } |
7d976699 TG |
6412 | |
6413 | /* | |
6414 | * Put the rq online, if not already. This happens: | |
6415 | * | |
6416 | * 1) In the early boot process, because we build the real domains | |
d1ccc66d | 6417 | * after all CPUs have been brought up. |
7d976699 TG |
6418 | * |
6419 | * 2) At runtime, if cpuset_cpu_active() fails to rebuild the | |
6420 | * domains. | |
6421 | */ | |
8a8c69c3 | 6422 | rq_lock_irqsave(rq, &rf); |
7d976699 TG |
6423 | if (rq->rd) { |
6424 | BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span)); | |
6425 | set_rq_online(rq); | |
6426 | } | |
8a8c69c3 | 6427 | rq_unlock_irqrestore(rq, &rf); |
7d976699 TG |
6428 | |
6429 | update_max_interval(); | |
6430 | ||
40190a78 | 6431 | return 0; |
135fb3e1 TG |
6432 | } |
6433 | ||
40190a78 | 6434 | int sched_cpu_deactivate(unsigned int cpu) |
135fb3e1 | 6435 | { |
135fb3e1 TG |
6436 | int ret; |
6437 | ||
40190a78 | 6438 | set_cpu_active(cpu, false); |
b2454caa PZ |
6439 | /* |
6440 | * We've cleared cpu_active_mask, wait for all preempt-disabled and RCU | |
6441 | * users of this state to go away such that all new such users will | |
6442 | * observe it. | |
6443 | * | |
b2454caa PZ |
6444 | * Do sync before park smpboot threads to take care the rcu boost case. |
6445 | */ | |
309ba859 | 6446 | synchronize_rcu(); |
40190a78 | 6447 | |
c5511d03 PZI |
6448 | #ifdef CONFIG_SCHED_SMT |
6449 | /* | |
6450 | * When going down, decrement the number of cores with SMT present. | |
6451 | */ | |
6452 | if (cpumask_weight(cpu_smt_mask(cpu)) == 2) | |
6453 | static_branch_dec_cpuslocked(&sched_smt_present); | |
6454 | #endif | |
6455 | ||
40190a78 TG |
6456 | if (!sched_smp_initialized) |
6457 | return 0; | |
6458 | ||
6459 | ret = cpuset_cpu_inactive(cpu); | |
6460 | if (ret) { | |
6461 | set_cpu_active(cpu, true); | |
6462 | return ret; | |
135fb3e1 | 6463 | } |
40190a78 TG |
6464 | sched_domains_numa_masks_clear(cpu); |
6465 | return 0; | |
135fb3e1 TG |
6466 | } |
6467 | ||
94baf7a5 TG |
6468 | static void sched_rq_cpu_starting(unsigned int cpu) |
6469 | { | |
6470 | struct rq *rq = cpu_rq(cpu); | |
6471 | ||
6472 | rq->calc_load_update = calc_load_update; | |
94baf7a5 TG |
6473 | update_max_interval(); |
6474 | } | |
6475 | ||
135fb3e1 TG |
6476 | int sched_cpu_starting(unsigned int cpu) |
6477 | { | |
94baf7a5 | 6478 | sched_rq_cpu_starting(cpu); |
d84b3131 | 6479 | sched_tick_start(cpu); |
135fb3e1 | 6480 | return 0; |
e761b772 | 6481 | } |
e761b772 | 6482 | |
f2785ddb TG |
6483 | #ifdef CONFIG_HOTPLUG_CPU |
6484 | int sched_cpu_dying(unsigned int cpu) | |
6485 | { | |
6486 | struct rq *rq = cpu_rq(cpu); | |
8a8c69c3 | 6487 | struct rq_flags rf; |
f2785ddb TG |
6488 | |
6489 | /* Handle pending wakeups and then migrate everything off */ | |
6490 | sched_ttwu_pending(); | |
d84b3131 | 6491 | sched_tick_stop(cpu); |
8a8c69c3 PZ |
6492 | |
6493 | rq_lock_irqsave(rq, &rf); | |
f2785ddb TG |
6494 | if (rq->rd) { |
6495 | BUG_ON(!cpumask_test_cpu(cpu, rq->rd->span)); | |
6496 | set_rq_offline(rq); | |
6497 | } | |
8a8c69c3 | 6498 | migrate_tasks(rq, &rf); |
f2785ddb | 6499 | BUG_ON(rq->nr_running != 1); |
8a8c69c3 PZ |
6500 | rq_unlock_irqrestore(rq, &rf); |
6501 | ||
f2785ddb TG |
6502 | calc_load_migrate(rq); |
6503 | update_max_interval(); | |
00357f5e | 6504 | nohz_balance_exit_idle(rq); |
e5ef27d0 | 6505 | hrtick_clear(rq); |
f2785ddb TG |
6506 | return 0; |
6507 | } | |
6508 | #endif | |
6509 | ||
1da177e4 LT |
6510 | void __init sched_init_smp(void) |
6511 | { | |
cb83b629 PZ |
6512 | sched_init_numa(); |
6513 | ||
6acce3ef PZ |
6514 | /* |
6515 | * There's no userspace yet to cause hotplug operations; hence all the | |
d1ccc66d | 6516 | * CPU masks are stable and all blatant races in the below code cannot |
b5a4e2bb | 6517 | * happen. |
6acce3ef | 6518 | */ |
712555ee | 6519 | mutex_lock(&sched_domains_mutex); |
8d5dc512 | 6520 | sched_init_domains(cpu_active_mask); |
712555ee | 6521 | mutex_unlock(&sched_domains_mutex); |
e761b772 | 6522 | |
5c1e1767 | 6523 | /* Move init over to a non-isolated CPU */ |
edb93821 | 6524 | if (set_cpus_allowed_ptr(current, housekeeping_cpumask(HK_FLAG_DOMAIN)) < 0) |
5c1e1767 | 6525 | BUG(); |
19978ca6 | 6526 | sched_init_granularity(); |
4212823f | 6527 | |
0e3900e6 | 6528 | init_sched_rt_class(); |
1baca4ce | 6529 | init_sched_dl_class(); |
1b568f0a | 6530 | |
e26fbffd | 6531 | sched_smp_initialized = true; |
1da177e4 | 6532 | } |
e26fbffd TG |
6533 | |
6534 | static int __init migration_init(void) | |
6535 | { | |
77a5352b | 6536 | sched_cpu_starting(smp_processor_id()); |
e26fbffd | 6537 | return 0; |
1da177e4 | 6538 | } |
e26fbffd TG |
6539 | early_initcall(migration_init); |
6540 | ||
1da177e4 LT |
6541 | #else |
6542 | void __init sched_init_smp(void) | |
6543 | { | |
19978ca6 | 6544 | sched_init_granularity(); |
1da177e4 LT |
6545 | } |
6546 | #endif /* CONFIG_SMP */ | |
6547 | ||
6548 | int in_sched_functions(unsigned long addr) | |
6549 | { | |
1da177e4 LT |
6550 | return in_lock_functions(addr) || |
6551 | (addr >= (unsigned long)__sched_text_start | |
6552 | && addr < (unsigned long)__sched_text_end); | |
6553 | } | |
6554 | ||
029632fb | 6555 | #ifdef CONFIG_CGROUP_SCHED |
27b4b931 LZ |
6556 | /* |
6557 | * Default task group. | |
6558 | * Every task in system belongs to this group at bootup. | |
6559 | */ | |
029632fb | 6560 | struct task_group root_task_group; |
35cf4e50 | 6561 | LIST_HEAD(task_groups); |
b0367629 WL |
6562 | |
6563 | /* Cacheline aligned slab cache for task_group */ | |
6564 | static struct kmem_cache *task_group_cache __read_mostly; | |
052f1dc7 | 6565 | #endif |
6f505b16 | 6566 | |
e6252c3e | 6567 | DECLARE_PER_CPU(cpumask_var_t, load_balance_mask); |
10e2f1ac | 6568 | DECLARE_PER_CPU(cpumask_var_t, select_idle_mask); |
6f505b16 | 6569 | |
1da177e4 LT |
6570 | void __init sched_init(void) |
6571 | { | |
a1dc0446 | 6572 | unsigned long ptr = 0; |
55627e3c | 6573 | int i; |
434d53b0 | 6574 | |
5822a454 | 6575 | wait_bit_init(); |
9dcb8b68 | 6576 | |
434d53b0 | 6577 | #ifdef CONFIG_FAIR_GROUP_SCHED |
a1dc0446 | 6578 | ptr += 2 * nr_cpu_ids * sizeof(void **); |
434d53b0 MT |
6579 | #endif |
6580 | #ifdef CONFIG_RT_GROUP_SCHED | |
a1dc0446 | 6581 | ptr += 2 * nr_cpu_ids * sizeof(void **); |
434d53b0 | 6582 | #endif |
a1dc0446 QC |
6583 | if (ptr) { |
6584 | ptr = (unsigned long)kzalloc(ptr, GFP_NOWAIT); | |
434d53b0 MT |
6585 | |
6586 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
07e06b01 | 6587 | root_task_group.se = (struct sched_entity **)ptr; |
434d53b0 MT |
6588 | ptr += nr_cpu_ids * sizeof(void **); |
6589 | ||
07e06b01 | 6590 | root_task_group.cfs_rq = (struct cfs_rq **)ptr; |
434d53b0 | 6591 | ptr += nr_cpu_ids * sizeof(void **); |
eff766a6 | 6592 | |
6d6bc0ad | 6593 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
434d53b0 | 6594 | #ifdef CONFIG_RT_GROUP_SCHED |
07e06b01 | 6595 | root_task_group.rt_se = (struct sched_rt_entity **)ptr; |
434d53b0 MT |
6596 | ptr += nr_cpu_ids * sizeof(void **); |
6597 | ||
07e06b01 | 6598 | root_task_group.rt_rq = (struct rt_rq **)ptr; |
eff766a6 PZ |
6599 | ptr += nr_cpu_ids * sizeof(void **); |
6600 | ||
6d6bc0ad | 6601 | #endif /* CONFIG_RT_GROUP_SCHED */ |
b74e6278 | 6602 | } |
df7c8e84 | 6603 | #ifdef CONFIG_CPUMASK_OFFSTACK |
b74e6278 AT |
6604 | for_each_possible_cpu(i) { |
6605 | per_cpu(load_balance_mask, i) = (cpumask_var_t)kzalloc_node( | |
6606 | cpumask_size(), GFP_KERNEL, cpu_to_node(i)); | |
10e2f1ac PZ |
6607 | per_cpu(select_idle_mask, i) = (cpumask_var_t)kzalloc_node( |
6608 | cpumask_size(), GFP_KERNEL, cpu_to_node(i)); | |
434d53b0 | 6609 | } |
b74e6278 | 6610 | #endif /* CONFIG_CPUMASK_OFFSTACK */ |
dd41f596 | 6611 | |
d1ccc66d IM |
6612 | init_rt_bandwidth(&def_rt_bandwidth, global_rt_period(), global_rt_runtime()); |
6613 | init_dl_bandwidth(&def_dl_bandwidth, global_rt_period(), global_rt_runtime()); | |
332ac17e | 6614 | |
57d885fe GH |
6615 | #ifdef CONFIG_SMP |
6616 | init_defrootdomain(); | |
6617 | #endif | |
6618 | ||
d0b27fa7 | 6619 | #ifdef CONFIG_RT_GROUP_SCHED |
07e06b01 | 6620 | init_rt_bandwidth(&root_task_group.rt_bandwidth, |
d0b27fa7 | 6621 | global_rt_period(), global_rt_runtime()); |
6d6bc0ad | 6622 | #endif /* CONFIG_RT_GROUP_SCHED */ |
d0b27fa7 | 6623 | |
7c941438 | 6624 | #ifdef CONFIG_CGROUP_SCHED |
b0367629 WL |
6625 | task_group_cache = KMEM_CACHE(task_group, 0); |
6626 | ||
07e06b01 YZ |
6627 | list_add(&root_task_group.list, &task_groups); |
6628 | INIT_LIST_HEAD(&root_task_group.children); | |
f4d6f6c2 | 6629 | INIT_LIST_HEAD(&root_task_group.siblings); |
5091faa4 | 6630 | autogroup_init(&init_task); |
7c941438 | 6631 | #endif /* CONFIG_CGROUP_SCHED */ |
6f505b16 | 6632 | |
0a945022 | 6633 | for_each_possible_cpu(i) { |
70b97a7f | 6634 | struct rq *rq; |
1da177e4 LT |
6635 | |
6636 | rq = cpu_rq(i); | |
05fa785c | 6637 | raw_spin_lock_init(&rq->lock); |
7897986b | 6638 | rq->nr_running = 0; |
dce48a84 TG |
6639 | rq->calc_load_active = 0; |
6640 | rq->calc_load_update = jiffies + LOAD_FREQ; | |
acb5a9ba | 6641 | init_cfs_rq(&rq->cfs); |
07c54f7a AV |
6642 | init_rt_rq(&rq->rt); |
6643 | init_dl_rq(&rq->dl); | |
dd41f596 | 6644 | #ifdef CONFIG_FAIR_GROUP_SCHED |
029632fb | 6645 | root_task_group.shares = ROOT_TASK_GROUP_LOAD; |
6f505b16 | 6646 | INIT_LIST_HEAD(&rq->leaf_cfs_rq_list); |
9c2791f9 | 6647 | rq->tmp_alone_branch = &rq->leaf_cfs_rq_list; |
354d60c2 | 6648 | /* |
d1ccc66d | 6649 | * How much CPU bandwidth does root_task_group get? |
354d60c2 DG |
6650 | * |
6651 | * In case of task-groups formed thr' the cgroup filesystem, it | |
d1ccc66d IM |
6652 | * gets 100% of the CPU resources in the system. This overall |
6653 | * system CPU resource is divided among the tasks of | |
07e06b01 | 6654 | * root_task_group and its child task-groups in a fair manner, |
354d60c2 DG |
6655 | * based on each entity's (task or task-group's) weight |
6656 | * (se->load.weight). | |
6657 | * | |
07e06b01 | 6658 | * In other words, if root_task_group has 10 tasks of weight |
354d60c2 | 6659 | * 1024) and two child groups A0 and A1 (of weight 1024 each), |
d1ccc66d | 6660 | * then A0's share of the CPU resource is: |
354d60c2 | 6661 | * |
0d905bca | 6662 | * A0's bandwidth = 1024 / (10*1024 + 1024 + 1024) = 8.33% |
354d60c2 | 6663 | * |
07e06b01 YZ |
6664 | * We achieve this by letting root_task_group's tasks sit |
6665 | * directly in rq->cfs (i.e root_task_group->se[] = NULL). | |
354d60c2 | 6666 | */ |
ab84d31e | 6667 | init_cfs_bandwidth(&root_task_group.cfs_bandwidth); |
07e06b01 | 6668 | init_tg_cfs_entry(&root_task_group, &rq->cfs, NULL, i, NULL); |
354d60c2 DG |
6669 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
6670 | ||
6671 | rq->rt.rt_runtime = def_rt_bandwidth.rt_runtime; | |
052f1dc7 | 6672 | #ifdef CONFIG_RT_GROUP_SCHED |
07e06b01 | 6673 | init_tg_rt_entry(&root_task_group, &rq->rt, NULL, i, NULL); |
dd41f596 | 6674 | #endif |
1da177e4 | 6675 | #ifdef CONFIG_SMP |
41c7ce9a | 6676 | rq->sd = NULL; |
57d885fe | 6677 | rq->rd = NULL; |
ca6d75e6 | 6678 | rq->cpu_capacity = rq->cpu_capacity_orig = SCHED_CAPACITY_SCALE; |
e3fca9e7 | 6679 | rq->balance_callback = NULL; |
1da177e4 | 6680 | rq->active_balance = 0; |
dd41f596 | 6681 | rq->next_balance = jiffies; |
1da177e4 | 6682 | rq->push_cpu = 0; |
0a2966b4 | 6683 | rq->cpu = i; |
1f11eb6a | 6684 | rq->online = 0; |
eae0c9df MG |
6685 | rq->idle_stamp = 0; |
6686 | rq->avg_idle = 2*sysctl_sched_migration_cost; | |
9bd721c5 | 6687 | rq->max_idle_balance_cost = sysctl_sched_migration_cost; |
367456c7 PZ |
6688 | |
6689 | INIT_LIST_HEAD(&rq->cfs_tasks); | |
6690 | ||
dc938520 | 6691 | rq_attach_root(rq, &def_root_domain); |
3451d024 | 6692 | #ifdef CONFIG_NO_HZ_COMMON |
9fd81dd5 | 6693 | rq->last_load_update_tick = jiffies; |
e022e0d3 | 6694 | rq->last_blocked_load_update_tick = jiffies; |
a22e47a4 | 6695 | atomic_set(&rq->nohz_flags, 0); |
83cd4fe2 | 6696 | #endif |
9fd81dd5 | 6697 | #endif /* CONFIG_SMP */ |
77a021be | 6698 | hrtick_rq_init(rq); |
1da177e4 | 6699 | atomic_set(&rq->nr_iowait, 0); |
1da177e4 LT |
6700 | } |
6701 | ||
9059393e | 6702 | set_load_weight(&init_task, false); |
b50f60ce | 6703 | |
1da177e4 LT |
6704 | /* |
6705 | * The boot idle thread does lazy MMU switching as well: | |
6706 | */ | |
f1f10076 | 6707 | mmgrab(&init_mm); |
1da177e4 LT |
6708 | enter_lazy_tlb(&init_mm, current); |
6709 | ||
6710 | /* | |
6711 | * Make us the idle thread. Technically, schedule() should not be | |
6712 | * called from this thread, however somewhere below it might be, | |
6713 | * but because we are the idle thread, we just pick up running again | |
6714 | * when this runqueue becomes "idle". | |
6715 | */ | |
6716 | init_idle(current, smp_processor_id()); | |
dce48a84 TG |
6717 | |
6718 | calc_load_update = jiffies + LOAD_FREQ; | |
6719 | ||
bf4d83f6 | 6720 | #ifdef CONFIG_SMP |
29d5e047 | 6721 | idle_thread_set_boot_cpu(); |
029632fb PZ |
6722 | #endif |
6723 | init_sched_fair_class(); | |
6a7b3dc3 | 6724 | |
4698f88c JP |
6725 | init_schedstats(); |
6726 | ||
eb414681 JW |
6727 | psi_init(); |
6728 | ||
69842cba PB |
6729 | init_uclamp(); |
6730 | ||
6892b75e | 6731 | scheduler_running = 1; |
1da177e4 LT |
6732 | } |
6733 | ||
d902db1e | 6734 | #ifdef CONFIG_DEBUG_ATOMIC_SLEEP |
e4aafea2 FW |
6735 | static inline int preempt_count_equals(int preempt_offset) |
6736 | { | |
da7142e2 | 6737 | int nested = preempt_count() + rcu_preempt_depth(); |
e4aafea2 | 6738 | |
4ba8216c | 6739 | return (nested == preempt_offset); |
e4aafea2 FW |
6740 | } |
6741 | ||
d894837f | 6742 | void __might_sleep(const char *file, int line, int preempt_offset) |
1da177e4 | 6743 | { |
8eb23b9f PZ |
6744 | /* |
6745 | * Blocking primitives will set (and therefore destroy) current->state, | |
6746 | * since we will exit with TASK_RUNNING make sure we enter with it, | |
6747 | * otherwise we will destroy state. | |
6748 | */ | |
00845eb9 | 6749 | WARN_ONCE(current->state != TASK_RUNNING && current->task_state_change, |
8eb23b9f PZ |
6750 | "do not call blocking ops when !TASK_RUNNING; " |
6751 | "state=%lx set at [<%p>] %pS\n", | |
6752 | current->state, | |
6753 | (void *)current->task_state_change, | |
00845eb9 | 6754 | (void *)current->task_state_change); |
8eb23b9f | 6755 | |
3427445a PZ |
6756 | ___might_sleep(file, line, preempt_offset); |
6757 | } | |
6758 | EXPORT_SYMBOL(__might_sleep); | |
6759 | ||
6760 | void ___might_sleep(const char *file, int line, int preempt_offset) | |
1da177e4 | 6761 | { |
d1ccc66d IM |
6762 | /* Ratelimiting timestamp: */ |
6763 | static unsigned long prev_jiffy; | |
6764 | ||
d1c6d149 | 6765 | unsigned long preempt_disable_ip; |
1da177e4 | 6766 | |
d1ccc66d IM |
6767 | /* WARN_ON_ONCE() by default, no rate limit required: */ |
6768 | rcu_sleep_check(); | |
6769 | ||
db273be2 TG |
6770 | if ((preempt_count_equals(preempt_offset) && !irqs_disabled() && |
6771 | !is_idle_task(current)) || | |
1c3c5eab TG |
6772 | system_state == SYSTEM_BOOTING || system_state > SYSTEM_RUNNING || |
6773 | oops_in_progress) | |
aef745fc | 6774 | return; |
1c3c5eab | 6775 | |
aef745fc IM |
6776 | if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy) |
6777 | return; | |
6778 | prev_jiffy = jiffies; | |
6779 | ||
d1ccc66d | 6780 | /* Save this before calling printk(), since that will clobber it: */ |
d1c6d149 VN |
6781 | preempt_disable_ip = get_preempt_disable_ip(current); |
6782 | ||
3df0fc5b PZ |
6783 | printk(KERN_ERR |
6784 | "BUG: sleeping function called from invalid context at %s:%d\n", | |
6785 | file, line); | |
6786 | printk(KERN_ERR | |
6787 | "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n", | |
6788 | in_atomic(), irqs_disabled(), | |
6789 | current->pid, current->comm); | |
aef745fc | 6790 | |
a8b686b3 ES |
6791 | if (task_stack_end_corrupted(current)) |
6792 | printk(KERN_EMERG "Thread overran stack, or stack corrupted\n"); | |
6793 | ||
aef745fc IM |
6794 | debug_show_held_locks(current); |
6795 | if (irqs_disabled()) | |
6796 | print_irqtrace_events(current); | |
d1c6d149 VN |
6797 | if (IS_ENABLED(CONFIG_DEBUG_PREEMPT) |
6798 | && !preempt_count_equals(preempt_offset)) { | |
8f47b187 | 6799 | pr_err("Preemption disabled at:"); |
d1c6d149 | 6800 | print_ip_sym(preempt_disable_ip); |
8f47b187 TG |
6801 | pr_cont("\n"); |
6802 | } | |
aef745fc | 6803 | dump_stack(); |
f0b22e39 | 6804 | add_taint(TAINT_WARN, LOCKDEP_STILL_OK); |
1da177e4 | 6805 | } |
3427445a | 6806 | EXPORT_SYMBOL(___might_sleep); |
568f1967 PZ |
6807 | |
6808 | void __cant_sleep(const char *file, int line, int preempt_offset) | |
6809 | { | |
6810 | static unsigned long prev_jiffy; | |
6811 | ||
6812 | if (irqs_disabled()) | |
6813 | return; | |
6814 | ||
6815 | if (!IS_ENABLED(CONFIG_PREEMPT_COUNT)) | |
6816 | return; | |
6817 | ||
6818 | if (preempt_count() > preempt_offset) | |
6819 | return; | |
6820 | ||
6821 | if (time_before(jiffies, prev_jiffy + HZ) && prev_jiffy) | |
6822 | return; | |
6823 | prev_jiffy = jiffies; | |
6824 | ||
6825 | printk(KERN_ERR "BUG: assuming atomic context at %s:%d\n", file, line); | |
6826 | printk(KERN_ERR "in_atomic(): %d, irqs_disabled(): %d, pid: %d, name: %s\n", | |
6827 | in_atomic(), irqs_disabled(), | |
6828 | current->pid, current->comm); | |
6829 | ||
6830 | debug_show_held_locks(current); | |
6831 | dump_stack(); | |
6832 | add_taint(TAINT_WARN, LOCKDEP_STILL_OK); | |
6833 | } | |
6834 | EXPORT_SYMBOL_GPL(__cant_sleep); | |
1da177e4 LT |
6835 | #endif |
6836 | ||
6837 | #ifdef CONFIG_MAGIC_SYSRQ | |
dbc7f069 | 6838 | void normalize_rt_tasks(void) |
3a5e4dc1 | 6839 | { |
dbc7f069 | 6840 | struct task_struct *g, *p; |
d50dde5a DF |
6841 | struct sched_attr attr = { |
6842 | .sched_policy = SCHED_NORMAL, | |
6843 | }; | |
1da177e4 | 6844 | |
3472eaa1 | 6845 | read_lock(&tasklist_lock); |
5d07f420 | 6846 | for_each_process_thread(g, p) { |
178be793 IM |
6847 | /* |
6848 | * Only normalize user tasks: | |
6849 | */ | |
3472eaa1 | 6850 | if (p->flags & PF_KTHREAD) |
178be793 IM |
6851 | continue; |
6852 | ||
4fa8d299 JP |
6853 | p->se.exec_start = 0; |
6854 | schedstat_set(p->se.statistics.wait_start, 0); | |
6855 | schedstat_set(p->se.statistics.sleep_start, 0); | |
6856 | schedstat_set(p->se.statistics.block_start, 0); | |
dd41f596 | 6857 | |
aab03e05 | 6858 | if (!dl_task(p) && !rt_task(p)) { |
dd41f596 IM |
6859 | /* |
6860 | * Renice negative nice level userspace | |
6861 | * tasks back to 0: | |
6862 | */ | |
3472eaa1 | 6863 | if (task_nice(p) < 0) |
dd41f596 | 6864 | set_user_nice(p, 0); |
1da177e4 | 6865 | continue; |
dd41f596 | 6866 | } |
1da177e4 | 6867 | |
dbc7f069 | 6868 | __sched_setscheduler(p, &attr, false, false); |
5d07f420 | 6869 | } |
3472eaa1 | 6870 | read_unlock(&tasklist_lock); |
1da177e4 LT |
6871 | } |
6872 | ||
6873 | #endif /* CONFIG_MAGIC_SYSRQ */ | |
1df5c10a | 6874 | |
67fc4e0c | 6875 | #if defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) |
1df5c10a | 6876 | /* |
67fc4e0c | 6877 | * These functions are only useful for the IA64 MCA handling, or kdb. |
1df5c10a LT |
6878 | * |
6879 | * They can only be called when the whole system has been | |
6880 | * stopped - every CPU needs to be quiescent, and no scheduling | |
6881 | * activity can take place. Using them for anything else would | |
6882 | * be a serious bug, and as a result, they aren't even visible | |
6883 | * under any other configuration. | |
6884 | */ | |
6885 | ||
6886 | /** | |
d1ccc66d | 6887 | * curr_task - return the current task for a given CPU. |
1df5c10a LT |
6888 | * @cpu: the processor in question. |
6889 | * | |
6890 | * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED! | |
e69f6186 YB |
6891 | * |
6892 | * Return: The current task for @cpu. | |
1df5c10a | 6893 | */ |
36c8b586 | 6894 | struct task_struct *curr_task(int cpu) |
1df5c10a LT |
6895 | { |
6896 | return cpu_curr(cpu); | |
6897 | } | |
6898 | ||
67fc4e0c JW |
6899 | #endif /* defined(CONFIG_IA64) || defined(CONFIG_KGDB_KDB) */ |
6900 | ||
6901 | #ifdef CONFIG_IA64 | |
1df5c10a | 6902 | /** |
5feeb783 | 6903 | * ia64_set_curr_task - set the current task for a given CPU. |
1df5c10a LT |
6904 | * @cpu: the processor in question. |
6905 | * @p: the task pointer to set. | |
6906 | * | |
6907 | * Description: This function must only be used when non-maskable interrupts | |
41a2d6cf | 6908 | * are serviced on a separate stack. It allows the architecture to switch the |
d1ccc66d | 6909 | * notion of the current task on a CPU in a non-blocking manner. This function |
1df5c10a LT |
6910 | * must be called with all CPU's synchronized, and interrupts disabled, the |
6911 | * and caller must save the original value of the current task (see | |
6912 | * curr_task() above) and restore that value before reenabling interrupts and | |
6913 | * re-starting the system. | |
6914 | * | |
6915 | * ONLY VALID WHEN THE WHOLE SYSTEM IS STOPPED! | |
6916 | */ | |
a458ae2e | 6917 | void ia64_set_curr_task(int cpu, struct task_struct *p) |
1df5c10a LT |
6918 | { |
6919 | cpu_curr(cpu) = p; | |
6920 | } | |
6921 | ||
6922 | #endif | |
29f59db3 | 6923 | |
7c941438 | 6924 | #ifdef CONFIG_CGROUP_SCHED |
029632fb PZ |
6925 | /* task_group_lock serializes the addition/removal of task groups */ |
6926 | static DEFINE_SPINLOCK(task_group_lock); | |
6927 | ||
2480c093 PB |
6928 | static inline void alloc_uclamp_sched_group(struct task_group *tg, |
6929 | struct task_group *parent) | |
6930 | { | |
6931 | #ifdef CONFIG_UCLAMP_TASK_GROUP | |
0413d7f3 | 6932 | enum uclamp_id clamp_id; |
2480c093 PB |
6933 | |
6934 | for_each_clamp_id(clamp_id) { | |
6935 | uclamp_se_set(&tg->uclamp_req[clamp_id], | |
6936 | uclamp_none(clamp_id), false); | |
0b60ba2d | 6937 | tg->uclamp[clamp_id] = parent->uclamp[clamp_id]; |
2480c093 PB |
6938 | } |
6939 | #endif | |
6940 | } | |
6941 | ||
2f5177f0 | 6942 | static void sched_free_group(struct task_group *tg) |
bccbe08a PZ |
6943 | { |
6944 | free_fair_sched_group(tg); | |
6945 | free_rt_sched_group(tg); | |
e9aa1dd1 | 6946 | autogroup_free(tg); |
b0367629 | 6947 | kmem_cache_free(task_group_cache, tg); |
bccbe08a PZ |
6948 | } |
6949 | ||
6950 | /* allocate runqueue etc for a new task group */ | |
ec7dc8ac | 6951 | struct task_group *sched_create_group(struct task_group *parent) |
bccbe08a PZ |
6952 | { |
6953 | struct task_group *tg; | |
bccbe08a | 6954 | |
b0367629 | 6955 | tg = kmem_cache_alloc(task_group_cache, GFP_KERNEL | __GFP_ZERO); |
bccbe08a PZ |
6956 | if (!tg) |
6957 | return ERR_PTR(-ENOMEM); | |
6958 | ||
ec7dc8ac | 6959 | if (!alloc_fair_sched_group(tg, parent)) |
bccbe08a PZ |
6960 | goto err; |
6961 | ||
ec7dc8ac | 6962 | if (!alloc_rt_sched_group(tg, parent)) |
bccbe08a PZ |
6963 | goto err; |
6964 | ||
2480c093 PB |
6965 | alloc_uclamp_sched_group(tg, parent); |
6966 | ||
ace783b9 LZ |
6967 | return tg; |
6968 | ||
6969 | err: | |
2f5177f0 | 6970 | sched_free_group(tg); |
ace783b9 LZ |
6971 | return ERR_PTR(-ENOMEM); |
6972 | } | |
6973 | ||
6974 | void sched_online_group(struct task_group *tg, struct task_group *parent) | |
6975 | { | |
6976 | unsigned long flags; | |
6977 | ||
8ed36996 | 6978 | spin_lock_irqsave(&task_group_lock, flags); |
6f505b16 | 6979 | list_add_rcu(&tg->list, &task_groups); |
f473aa5e | 6980 | |
d1ccc66d IM |
6981 | /* Root should already exist: */ |
6982 | WARN_ON(!parent); | |
f473aa5e PZ |
6983 | |
6984 | tg->parent = parent; | |
f473aa5e | 6985 | INIT_LIST_HEAD(&tg->children); |
09f2724a | 6986 | list_add_rcu(&tg->siblings, &parent->children); |
8ed36996 | 6987 | spin_unlock_irqrestore(&task_group_lock, flags); |
8663e24d PZ |
6988 | |
6989 | online_fair_sched_group(tg); | |
29f59db3 SV |
6990 | } |
6991 | ||
9b5b7751 | 6992 | /* rcu callback to free various structures associated with a task group */ |
2f5177f0 | 6993 | static void sched_free_group_rcu(struct rcu_head *rhp) |
29f59db3 | 6994 | { |
d1ccc66d | 6995 | /* Now it should be safe to free those cfs_rqs: */ |
2f5177f0 | 6996 | sched_free_group(container_of(rhp, struct task_group, rcu)); |
29f59db3 SV |
6997 | } |
6998 | ||
4cf86d77 | 6999 | void sched_destroy_group(struct task_group *tg) |
ace783b9 | 7000 | { |
d1ccc66d | 7001 | /* Wait for possible concurrent references to cfs_rqs complete: */ |
2f5177f0 | 7002 | call_rcu(&tg->rcu, sched_free_group_rcu); |
ace783b9 LZ |
7003 | } |
7004 | ||
7005 | void sched_offline_group(struct task_group *tg) | |
29f59db3 | 7006 | { |
8ed36996 | 7007 | unsigned long flags; |
29f59db3 | 7008 | |
d1ccc66d | 7009 | /* End participation in shares distribution: */ |
6fe1f348 | 7010 | unregister_fair_sched_group(tg); |
3d4b47b4 PZ |
7011 | |
7012 | spin_lock_irqsave(&task_group_lock, flags); | |
6f505b16 | 7013 | list_del_rcu(&tg->list); |
f473aa5e | 7014 | list_del_rcu(&tg->siblings); |
8ed36996 | 7015 | spin_unlock_irqrestore(&task_group_lock, flags); |
29f59db3 SV |
7016 | } |
7017 | ||
ea86cb4b | 7018 | static void sched_change_group(struct task_struct *tsk, int type) |
29f59db3 | 7019 | { |
8323f26c | 7020 | struct task_group *tg; |
29f59db3 | 7021 | |
f7b8a47d KT |
7022 | /* |
7023 | * All callers are synchronized by task_rq_lock(); we do not use RCU | |
7024 | * which is pointless here. Thus, we pass "true" to task_css_check() | |
7025 | * to prevent lockdep warnings. | |
7026 | */ | |
7027 | tg = container_of(task_css_check(tsk, cpu_cgrp_id, true), | |
8323f26c PZ |
7028 | struct task_group, css); |
7029 | tg = autogroup_task_group(tsk, tg); | |
7030 | tsk->sched_task_group = tg; | |
7031 | ||
810b3817 | 7032 | #ifdef CONFIG_FAIR_GROUP_SCHED |
ea86cb4b VG |
7033 | if (tsk->sched_class->task_change_group) |
7034 | tsk->sched_class->task_change_group(tsk, type); | |
b2b5ce02 | 7035 | else |
810b3817 | 7036 | #endif |
b2b5ce02 | 7037 | set_task_rq(tsk, task_cpu(tsk)); |
ea86cb4b VG |
7038 | } |
7039 | ||
7040 | /* | |
7041 | * Change task's runqueue when it moves between groups. | |
7042 | * | |
7043 | * The caller of this function should have put the task in its new group by | |
7044 | * now. This function just updates tsk->se.cfs_rq and tsk->se.parent to reflect | |
7045 | * its new group. | |
7046 | */ | |
7047 | void sched_move_task(struct task_struct *tsk) | |
7048 | { | |
7a57f32a PZ |
7049 | int queued, running, queue_flags = |
7050 | DEQUEUE_SAVE | DEQUEUE_MOVE | DEQUEUE_NOCLOCK; | |
ea86cb4b VG |
7051 | struct rq_flags rf; |
7052 | struct rq *rq; | |
7053 | ||
7054 | rq = task_rq_lock(tsk, &rf); | |
1b1d6225 | 7055 | update_rq_clock(rq); |
ea86cb4b VG |
7056 | |
7057 | running = task_current(rq, tsk); | |
7058 | queued = task_on_rq_queued(tsk); | |
7059 | ||
7060 | if (queued) | |
7a57f32a | 7061 | dequeue_task(rq, tsk, queue_flags); |
bb3bac2c | 7062 | if (running) |
ea86cb4b VG |
7063 | put_prev_task(rq, tsk); |
7064 | ||
7065 | sched_change_group(tsk, TASK_MOVE_GROUP); | |
810b3817 | 7066 | |
da0c1e65 | 7067 | if (queued) |
7a57f32a | 7068 | enqueue_task(rq, tsk, queue_flags); |
bb3bac2c | 7069 | if (running) |
03b7fad1 | 7070 | set_next_task(rq, tsk); |
29f59db3 | 7071 | |
eb580751 | 7072 | task_rq_unlock(rq, tsk, &rf); |
29f59db3 | 7073 | } |
68318b8e | 7074 | |
a7c6d554 | 7075 | static inline struct task_group *css_tg(struct cgroup_subsys_state *css) |
68318b8e | 7076 | { |
a7c6d554 | 7077 | return css ? container_of(css, struct task_group, css) : NULL; |
68318b8e SV |
7078 | } |
7079 | ||
eb95419b TH |
7080 | static struct cgroup_subsys_state * |
7081 | cpu_cgroup_css_alloc(struct cgroup_subsys_state *parent_css) | |
68318b8e | 7082 | { |
eb95419b TH |
7083 | struct task_group *parent = css_tg(parent_css); |
7084 | struct task_group *tg; | |
68318b8e | 7085 | |
eb95419b | 7086 | if (!parent) { |
68318b8e | 7087 | /* This is early initialization for the top cgroup */ |
07e06b01 | 7088 | return &root_task_group.css; |
68318b8e SV |
7089 | } |
7090 | ||
ec7dc8ac | 7091 | tg = sched_create_group(parent); |
68318b8e SV |
7092 | if (IS_ERR(tg)) |
7093 | return ERR_PTR(-ENOMEM); | |
7094 | ||
68318b8e SV |
7095 | return &tg->css; |
7096 | } | |
7097 | ||
96b77745 KK |
7098 | /* Expose task group only after completing cgroup initialization */ |
7099 | static int cpu_cgroup_css_online(struct cgroup_subsys_state *css) | |
7100 | { | |
7101 | struct task_group *tg = css_tg(css); | |
7102 | struct task_group *parent = css_tg(css->parent); | |
7103 | ||
7104 | if (parent) | |
7105 | sched_online_group(tg, parent); | |
7106 | return 0; | |
7107 | } | |
7108 | ||
2f5177f0 | 7109 | static void cpu_cgroup_css_released(struct cgroup_subsys_state *css) |
ace783b9 | 7110 | { |
eb95419b | 7111 | struct task_group *tg = css_tg(css); |
ace783b9 | 7112 | |
2f5177f0 | 7113 | sched_offline_group(tg); |
ace783b9 LZ |
7114 | } |
7115 | ||
eb95419b | 7116 | static void cpu_cgroup_css_free(struct cgroup_subsys_state *css) |
68318b8e | 7117 | { |
eb95419b | 7118 | struct task_group *tg = css_tg(css); |
68318b8e | 7119 | |
2f5177f0 PZ |
7120 | /* |
7121 | * Relies on the RCU grace period between css_released() and this. | |
7122 | */ | |
7123 | sched_free_group(tg); | |
ace783b9 LZ |
7124 | } |
7125 | ||
ea86cb4b VG |
7126 | /* |
7127 | * This is called before wake_up_new_task(), therefore we really only | |
7128 | * have to set its group bits, all the other stuff does not apply. | |
7129 | */ | |
b53202e6 | 7130 | static void cpu_cgroup_fork(struct task_struct *task) |
eeb61e53 | 7131 | { |
ea86cb4b VG |
7132 | struct rq_flags rf; |
7133 | struct rq *rq; | |
7134 | ||
7135 | rq = task_rq_lock(task, &rf); | |
7136 | ||
80f5c1b8 | 7137 | update_rq_clock(rq); |
ea86cb4b VG |
7138 | sched_change_group(task, TASK_SET_GROUP); |
7139 | ||
7140 | task_rq_unlock(rq, task, &rf); | |
eeb61e53 KT |
7141 | } |
7142 | ||
1f7dd3e5 | 7143 | static int cpu_cgroup_can_attach(struct cgroup_taskset *tset) |
68318b8e | 7144 | { |
bb9d97b6 | 7145 | struct task_struct *task; |
1f7dd3e5 | 7146 | struct cgroup_subsys_state *css; |
7dc603c9 | 7147 | int ret = 0; |
bb9d97b6 | 7148 | |
1f7dd3e5 | 7149 | cgroup_taskset_for_each(task, css, tset) { |
b68aa230 | 7150 | #ifdef CONFIG_RT_GROUP_SCHED |
eb95419b | 7151 | if (!sched_rt_can_attach(css_tg(css), task)) |
bb9d97b6 | 7152 | return -EINVAL; |
b68aa230 | 7153 | #endif |
7dc603c9 PZ |
7154 | /* |
7155 | * Serialize against wake_up_new_task() such that if its | |
7156 | * running, we're sure to observe its full state. | |
7157 | */ | |
7158 | raw_spin_lock_irq(&task->pi_lock); | |
7159 | /* | |
7160 | * Avoid calling sched_move_task() before wake_up_new_task() | |
7161 | * has happened. This would lead to problems with PELT, due to | |
7162 | * move wanting to detach+attach while we're not attached yet. | |
7163 | */ | |
7164 | if (task->state == TASK_NEW) | |
7165 | ret = -EINVAL; | |
7166 | raw_spin_unlock_irq(&task->pi_lock); | |
7167 | ||
7168 | if (ret) | |
7169 | break; | |
bb9d97b6 | 7170 | } |
7dc603c9 | 7171 | return ret; |
be367d09 | 7172 | } |
68318b8e | 7173 | |
1f7dd3e5 | 7174 | static void cpu_cgroup_attach(struct cgroup_taskset *tset) |
68318b8e | 7175 | { |
bb9d97b6 | 7176 | struct task_struct *task; |
1f7dd3e5 | 7177 | struct cgroup_subsys_state *css; |
bb9d97b6 | 7178 | |
1f7dd3e5 | 7179 | cgroup_taskset_for_each(task, css, tset) |
bb9d97b6 | 7180 | sched_move_task(task); |
68318b8e SV |
7181 | } |
7182 | ||
2480c093 | 7183 | #ifdef CONFIG_UCLAMP_TASK_GROUP |
0b60ba2d PB |
7184 | static void cpu_util_update_eff(struct cgroup_subsys_state *css) |
7185 | { | |
7186 | struct cgroup_subsys_state *top_css = css; | |
7187 | struct uclamp_se *uc_parent = NULL; | |
7188 | struct uclamp_se *uc_se = NULL; | |
7189 | unsigned int eff[UCLAMP_CNT]; | |
0413d7f3 | 7190 | enum uclamp_id clamp_id; |
0b60ba2d PB |
7191 | unsigned int clamps; |
7192 | ||
7193 | css_for_each_descendant_pre(css, top_css) { | |
7194 | uc_parent = css_tg(css)->parent | |
7195 | ? css_tg(css)->parent->uclamp : NULL; | |
7196 | ||
7197 | for_each_clamp_id(clamp_id) { | |
7198 | /* Assume effective clamps matches requested clamps */ | |
7199 | eff[clamp_id] = css_tg(css)->uclamp_req[clamp_id].value; | |
7200 | /* Cap effective clamps with parent's effective clamps */ | |
7201 | if (uc_parent && | |
7202 | eff[clamp_id] > uc_parent[clamp_id].value) { | |
7203 | eff[clamp_id] = uc_parent[clamp_id].value; | |
7204 | } | |
7205 | } | |
7206 | /* Ensure protection is always capped by limit */ | |
7207 | eff[UCLAMP_MIN] = min(eff[UCLAMP_MIN], eff[UCLAMP_MAX]); | |
7208 | ||
7209 | /* Propagate most restrictive effective clamps */ | |
7210 | clamps = 0x0; | |
7211 | uc_se = css_tg(css)->uclamp; | |
7212 | for_each_clamp_id(clamp_id) { | |
7213 | if (eff[clamp_id] == uc_se[clamp_id].value) | |
7214 | continue; | |
7215 | uc_se[clamp_id].value = eff[clamp_id]; | |
7216 | uc_se[clamp_id].bucket_id = uclamp_bucket_id(eff[clamp_id]); | |
7217 | clamps |= (0x1 << clamp_id); | |
7218 | } | |
babbe170 | 7219 | if (!clamps) { |
0b60ba2d | 7220 | css = css_rightmost_descendant(css); |
babbe170 PB |
7221 | continue; |
7222 | } | |
7223 | ||
7224 | /* Immediately update descendants RUNNABLE tasks */ | |
7225 | uclamp_update_active_tasks(css, clamps); | |
0b60ba2d PB |
7226 | } |
7227 | } | |
2480c093 PB |
7228 | |
7229 | /* | |
7230 | * Integer 10^N with a given N exponent by casting to integer the literal "1eN" | |
7231 | * C expression. Since there is no way to convert a macro argument (N) into a | |
7232 | * character constant, use two levels of macros. | |
7233 | */ | |
7234 | #define _POW10(exp) ((unsigned int)1e##exp) | |
7235 | #define POW10(exp) _POW10(exp) | |
7236 | ||
7237 | struct uclamp_request { | |
7238 | #define UCLAMP_PERCENT_SHIFT 2 | |
7239 | #define UCLAMP_PERCENT_SCALE (100 * POW10(UCLAMP_PERCENT_SHIFT)) | |
7240 | s64 percent; | |
7241 | u64 util; | |
7242 | int ret; | |
7243 | }; | |
7244 | ||
7245 | static inline struct uclamp_request | |
7246 | capacity_from_percent(char *buf) | |
7247 | { | |
7248 | struct uclamp_request req = { | |
7249 | .percent = UCLAMP_PERCENT_SCALE, | |
7250 | .util = SCHED_CAPACITY_SCALE, | |
7251 | .ret = 0, | |
7252 | }; | |
7253 | ||
7254 | buf = strim(buf); | |
7255 | if (strcmp(buf, "max")) { | |
7256 | req.ret = cgroup_parse_float(buf, UCLAMP_PERCENT_SHIFT, | |
7257 | &req.percent); | |
7258 | if (req.ret) | |
7259 | return req; | |
7260 | if (req.percent > UCLAMP_PERCENT_SCALE) { | |
7261 | req.ret = -ERANGE; | |
7262 | return req; | |
7263 | } | |
7264 | ||
7265 | req.util = req.percent << SCHED_CAPACITY_SHIFT; | |
7266 | req.util = DIV_ROUND_CLOSEST_ULL(req.util, UCLAMP_PERCENT_SCALE); | |
7267 | } | |
7268 | ||
7269 | return req; | |
7270 | } | |
7271 | ||
7272 | static ssize_t cpu_uclamp_write(struct kernfs_open_file *of, char *buf, | |
7273 | size_t nbytes, loff_t off, | |
7274 | enum uclamp_id clamp_id) | |
7275 | { | |
7276 | struct uclamp_request req; | |
7277 | struct task_group *tg; | |
7278 | ||
7279 | req = capacity_from_percent(buf); | |
7280 | if (req.ret) | |
7281 | return req.ret; | |
7282 | ||
7283 | mutex_lock(&uclamp_mutex); | |
7284 | rcu_read_lock(); | |
7285 | ||
7286 | tg = css_tg(of_css(of)); | |
7287 | if (tg->uclamp_req[clamp_id].value != req.util) | |
7288 | uclamp_se_set(&tg->uclamp_req[clamp_id], req.util, false); | |
7289 | ||
7290 | /* | |
7291 | * Because of not recoverable conversion rounding we keep track of the | |
7292 | * exact requested value | |
7293 | */ | |
7294 | tg->uclamp_pct[clamp_id] = req.percent; | |
7295 | ||
0b60ba2d PB |
7296 | /* Update effective clamps to track the most restrictive value */ |
7297 | cpu_util_update_eff(of_css(of)); | |
7298 | ||
2480c093 PB |
7299 | rcu_read_unlock(); |
7300 | mutex_unlock(&uclamp_mutex); | |
7301 | ||
7302 | return nbytes; | |
7303 | } | |
7304 | ||
7305 | static ssize_t cpu_uclamp_min_write(struct kernfs_open_file *of, | |
7306 | char *buf, size_t nbytes, | |
7307 | loff_t off) | |
7308 | { | |
7309 | return cpu_uclamp_write(of, buf, nbytes, off, UCLAMP_MIN); | |
7310 | } | |
7311 | ||
7312 | static ssize_t cpu_uclamp_max_write(struct kernfs_open_file *of, | |
7313 | char *buf, size_t nbytes, | |
7314 | loff_t off) | |
7315 | { | |
7316 | return cpu_uclamp_write(of, buf, nbytes, off, UCLAMP_MAX); | |
7317 | } | |
7318 | ||
7319 | static inline void cpu_uclamp_print(struct seq_file *sf, | |
7320 | enum uclamp_id clamp_id) | |
7321 | { | |
7322 | struct task_group *tg; | |
7323 | u64 util_clamp; | |
7324 | u64 percent; | |
7325 | u32 rem; | |
7326 | ||
7327 | rcu_read_lock(); | |
7328 | tg = css_tg(seq_css(sf)); | |
7329 | util_clamp = tg->uclamp_req[clamp_id].value; | |
7330 | rcu_read_unlock(); | |
7331 | ||
7332 | if (util_clamp == SCHED_CAPACITY_SCALE) { | |
7333 | seq_puts(sf, "max\n"); | |
7334 | return; | |
7335 | } | |
7336 | ||
7337 | percent = tg->uclamp_pct[clamp_id]; | |
7338 | percent = div_u64_rem(percent, POW10(UCLAMP_PERCENT_SHIFT), &rem); | |
7339 | seq_printf(sf, "%llu.%0*u\n", percent, UCLAMP_PERCENT_SHIFT, rem); | |
7340 | } | |
7341 | ||
7342 | static int cpu_uclamp_min_show(struct seq_file *sf, void *v) | |
7343 | { | |
7344 | cpu_uclamp_print(sf, UCLAMP_MIN); | |
7345 | return 0; | |
7346 | } | |
7347 | ||
7348 | static int cpu_uclamp_max_show(struct seq_file *sf, void *v) | |
7349 | { | |
7350 | cpu_uclamp_print(sf, UCLAMP_MAX); | |
7351 | return 0; | |
7352 | } | |
7353 | #endif /* CONFIG_UCLAMP_TASK_GROUP */ | |
7354 | ||
052f1dc7 | 7355 | #ifdef CONFIG_FAIR_GROUP_SCHED |
182446d0 TH |
7356 | static int cpu_shares_write_u64(struct cgroup_subsys_state *css, |
7357 | struct cftype *cftype, u64 shareval) | |
68318b8e | 7358 | { |
5b61d50a KK |
7359 | if (shareval > scale_load_down(ULONG_MAX)) |
7360 | shareval = MAX_SHARES; | |
182446d0 | 7361 | return sched_group_set_shares(css_tg(css), scale_load(shareval)); |
68318b8e SV |
7362 | } |
7363 | ||
182446d0 TH |
7364 | static u64 cpu_shares_read_u64(struct cgroup_subsys_state *css, |
7365 | struct cftype *cft) | |
68318b8e | 7366 | { |
182446d0 | 7367 | struct task_group *tg = css_tg(css); |
68318b8e | 7368 | |
c8b28116 | 7369 | return (u64) scale_load_down(tg->shares); |
68318b8e | 7370 | } |
ab84d31e PT |
7371 | |
7372 | #ifdef CONFIG_CFS_BANDWIDTH | |
a790de99 PT |
7373 | static DEFINE_MUTEX(cfs_constraints_mutex); |
7374 | ||
ab84d31e | 7375 | const u64 max_cfs_quota_period = 1 * NSEC_PER_SEC; /* 1s */ |
b1546edc | 7376 | static const u64 min_cfs_quota_period = 1 * NSEC_PER_MSEC; /* 1ms */ |
ab84d31e | 7377 | |
a790de99 PT |
7378 | static int __cfs_schedulable(struct task_group *tg, u64 period, u64 runtime); |
7379 | ||
ab84d31e PT |
7380 | static int tg_set_cfs_bandwidth(struct task_group *tg, u64 period, u64 quota) |
7381 | { | |
56f570e5 | 7382 | int i, ret = 0, runtime_enabled, runtime_was_enabled; |
029632fb | 7383 | struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth; |
ab84d31e PT |
7384 | |
7385 | if (tg == &root_task_group) | |
7386 | return -EINVAL; | |
7387 | ||
7388 | /* | |
7389 | * Ensure we have at some amount of bandwidth every period. This is | |
7390 | * to prevent reaching a state of large arrears when throttled via | |
7391 | * entity_tick() resulting in prolonged exit starvation. | |
7392 | */ | |
7393 | if (quota < min_cfs_quota_period || period < min_cfs_quota_period) | |
7394 | return -EINVAL; | |
7395 | ||
7396 | /* | |
7397 | * Likewise, bound things on the otherside by preventing insane quota | |
7398 | * periods. This also allows us to normalize in computing quota | |
7399 | * feasibility. | |
7400 | */ | |
7401 | if (period > max_cfs_quota_period) | |
7402 | return -EINVAL; | |
7403 | ||
0e59bdae KT |
7404 | /* |
7405 | * Prevent race between setting of cfs_rq->runtime_enabled and | |
7406 | * unthrottle_offline_cfs_rqs(). | |
7407 | */ | |
7408 | get_online_cpus(); | |
a790de99 PT |
7409 | mutex_lock(&cfs_constraints_mutex); |
7410 | ret = __cfs_schedulable(tg, period, quota); | |
7411 | if (ret) | |
7412 | goto out_unlock; | |
7413 | ||
58088ad0 | 7414 | runtime_enabled = quota != RUNTIME_INF; |
56f570e5 | 7415 | runtime_was_enabled = cfs_b->quota != RUNTIME_INF; |
1ee14e6c BS |
7416 | /* |
7417 | * If we need to toggle cfs_bandwidth_used, off->on must occur | |
7418 | * before making related changes, and on->off must occur afterwards | |
7419 | */ | |
7420 | if (runtime_enabled && !runtime_was_enabled) | |
7421 | cfs_bandwidth_usage_inc(); | |
ab84d31e PT |
7422 | raw_spin_lock_irq(&cfs_b->lock); |
7423 | cfs_b->period = ns_to_ktime(period); | |
7424 | cfs_b->quota = quota; | |
58088ad0 | 7425 | |
a9cf55b2 | 7426 | __refill_cfs_bandwidth_runtime(cfs_b); |
d1ccc66d IM |
7427 | |
7428 | /* Restart the period timer (if active) to handle new period expiry: */ | |
77a4d1a1 PZ |
7429 | if (runtime_enabled) |
7430 | start_cfs_bandwidth(cfs_b); | |
d1ccc66d | 7431 | |
ab84d31e PT |
7432 | raw_spin_unlock_irq(&cfs_b->lock); |
7433 | ||
0e59bdae | 7434 | for_each_online_cpu(i) { |
ab84d31e | 7435 | struct cfs_rq *cfs_rq = tg->cfs_rq[i]; |
029632fb | 7436 | struct rq *rq = cfs_rq->rq; |
8a8c69c3 | 7437 | struct rq_flags rf; |
ab84d31e | 7438 | |
8a8c69c3 | 7439 | rq_lock_irq(rq, &rf); |
58088ad0 | 7440 | cfs_rq->runtime_enabled = runtime_enabled; |
ab84d31e | 7441 | cfs_rq->runtime_remaining = 0; |
671fd9da | 7442 | |
029632fb | 7443 | if (cfs_rq->throttled) |
671fd9da | 7444 | unthrottle_cfs_rq(cfs_rq); |
8a8c69c3 | 7445 | rq_unlock_irq(rq, &rf); |
ab84d31e | 7446 | } |
1ee14e6c BS |
7447 | if (runtime_was_enabled && !runtime_enabled) |
7448 | cfs_bandwidth_usage_dec(); | |
a790de99 PT |
7449 | out_unlock: |
7450 | mutex_unlock(&cfs_constraints_mutex); | |
0e59bdae | 7451 | put_online_cpus(); |
ab84d31e | 7452 | |
a790de99 | 7453 | return ret; |
ab84d31e PT |
7454 | } |
7455 | ||
b1546edc | 7456 | static int tg_set_cfs_quota(struct task_group *tg, long cfs_quota_us) |
ab84d31e PT |
7457 | { |
7458 | u64 quota, period; | |
7459 | ||
029632fb | 7460 | period = ktime_to_ns(tg->cfs_bandwidth.period); |
ab84d31e PT |
7461 | if (cfs_quota_us < 0) |
7462 | quota = RUNTIME_INF; | |
1a8b4540 | 7463 | else if ((u64)cfs_quota_us <= U64_MAX / NSEC_PER_USEC) |
ab84d31e | 7464 | quota = (u64)cfs_quota_us * NSEC_PER_USEC; |
1a8b4540 KK |
7465 | else |
7466 | return -EINVAL; | |
ab84d31e PT |
7467 | |
7468 | return tg_set_cfs_bandwidth(tg, period, quota); | |
7469 | } | |
7470 | ||
b1546edc | 7471 | static long tg_get_cfs_quota(struct task_group *tg) |
ab84d31e PT |
7472 | { |
7473 | u64 quota_us; | |
7474 | ||
029632fb | 7475 | if (tg->cfs_bandwidth.quota == RUNTIME_INF) |
ab84d31e PT |
7476 | return -1; |
7477 | ||
029632fb | 7478 | quota_us = tg->cfs_bandwidth.quota; |
ab84d31e PT |
7479 | do_div(quota_us, NSEC_PER_USEC); |
7480 | ||
7481 | return quota_us; | |
7482 | } | |
7483 | ||
b1546edc | 7484 | static int tg_set_cfs_period(struct task_group *tg, long cfs_period_us) |
ab84d31e PT |
7485 | { |
7486 | u64 quota, period; | |
7487 | ||
1a8b4540 KK |
7488 | if ((u64)cfs_period_us > U64_MAX / NSEC_PER_USEC) |
7489 | return -EINVAL; | |
7490 | ||
ab84d31e | 7491 | period = (u64)cfs_period_us * NSEC_PER_USEC; |
029632fb | 7492 | quota = tg->cfs_bandwidth.quota; |
ab84d31e | 7493 | |
ab84d31e PT |
7494 | return tg_set_cfs_bandwidth(tg, period, quota); |
7495 | } | |
7496 | ||
b1546edc | 7497 | static long tg_get_cfs_period(struct task_group *tg) |
ab84d31e PT |
7498 | { |
7499 | u64 cfs_period_us; | |
7500 | ||
029632fb | 7501 | cfs_period_us = ktime_to_ns(tg->cfs_bandwidth.period); |
ab84d31e PT |
7502 | do_div(cfs_period_us, NSEC_PER_USEC); |
7503 | ||
7504 | return cfs_period_us; | |
7505 | } | |
7506 | ||
182446d0 TH |
7507 | static s64 cpu_cfs_quota_read_s64(struct cgroup_subsys_state *css, |
7508 | struct cftype *cft) | |
ab84d31e | 7509 | { |
182446d0 | 7510 | return tg_get_cfs_quota(css_tg(css)); |
ab84d31e PT |
7511 | } |
7512 | ||
182446d0 TH |
7513 | static int cpu_cfs_quota_write_s64(struct cgroup_subsys_state *css, |
7514 | struct cftype *cftype, s64 cfs_quota_us) | |
ab84d31e | 7515 | { |
182446d0 | 7516 | return tg_set_cfs_quota(css_tg(css), cfs_quota_us); |
ab84d31e PT |
7517 | } |
7518 | ||
182446d0 TH |
7519 | static u64 cpu_cfs_period_read_u64(struct cgroup_subsys_state *css, |
7520 | struct cftype *cft) | |
ab84d31e | 7521 | { |
182446d0 | 7522 | return tg_get_cfs_period(css_tg(css)); |
ab84d31e PT |
7523 | } |
7524 | ||
182446d0 TH |
7525 | static int cpu_cfs_period_write_u64(struct cgroup_subsys_state *css, |
7526 | struct cftype *cftype, u64 cfs_period_us) | |
ab84d31e | 7527 | { |
182446d0 | 7528 | return tg_set_cfs_period(css_tg(css), cfs_period_us); |
ab84d31e PT |
7529 | } |
7530 | ||
a790de99 PT |
7531 | struct cfs_schedulable_data { |
7532 | struct task_group *tg; | |
7533 | u64 period, quota; | |
7534 | }; | |
7535 | ||
7536 | /* | |
7537 | * normalize group quota/period to be quota/max_period | |
7538 | * note: units are usecs | |
7539 | */ | |
7540 | static u64 normalize_cfs_quota(struct task_group *tg, | |
7541 | struct cfs_schedulable_data *d) | |
7542 | { | |
7543 | u64 quota, period; | |
7544 | ||
7545 | if (tg == d->tg) { | |
7546 | period = d->period; | |
7547 | quota = d->quota; | |
7548 | } else { | |
7549 | period = tg_get_cfs_period(tg); | |
7550 | quota = tg_get_cfs_quota(tg); | |
7551 | } | |
7552 | ||
7553 | /* note: these should typically be equivalent */ | |
7554 | if (quota == RUNTIME_INF || quota == -1) | |
7555 | return RUNTIME_INF; | |
7556 | ||
7557 | return to_ratio(period, quota); | |
7558 | } | |
7559 | ||
7560 | static int tg_cfs_schedulable_down(struct task_group *tg, void *data) | |
7561 | { | |
7562 | struct cfs_schedulable_data *d = data; | |
029632fb | 7563 | struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth; |
a790de99 PT |
7564 | s64 quota = 0, parent_quota = -1; |
7565 | ||
7566 | if (!tg->parent) { | |
7567 | quota = RUNTIME_INF; | |
7568 | } else { | |
029632fb | 7569 | struct cfs_bandwidth *parent_b = &tg->parent->cfs_bandwidth; |
a790de99 PT |
7570 | |
7571 | quota = normalize_cfs_quota(tg, d); | |
9c58c79a | 7572 | parent_quota = parent_b->hierarchical_quota; |
a790de99 PT |
7573 | |
7574 | /* | |
c53593e5 TH |
7575 | * Ensure max(child_quota) <= parent_quota. On cgroup2, |
7576 | * always take the min. On cgroup1, only inherit when no | |
d1ccc66d | 7577 | * limit is set: |
a790de99 | 7578 | */ |
c53593e5 TH |
7579 | if (cgroup_subsys_on_dfl(cpu_cgrp_subsys)) { |
7580 | quota = min(quota, parent_quota); | |
7581 | } else { | |
7582 | if (quota == RUNTIME_INF) | |
7583 | quota = parent_quota; | |
7584 | else if (parent_quota != RUNTIME_INF && quota > parent_quota) | |
7585 | return -EINVAL; | |
7586 | } | |
a790de99 | 7587 | } |
9c58c79a | 7588 | cfs_b->hierarchical_quota = quota; |
a790de99 PT |
7589 | |
7590 | return 0; | |
7591 | } | |
7592 | ||
7593 | static int __cfs_schedulable(struct task_group *tg, u64 period, u64 quota) | |
7594 | { | |
8277434e | 7595 | int ret; |
a790de99 PT |
7596 | struct cfs_schedulable_data data = { |
7597 | .tg = tg, | |
7598 | .period = period, | |
7599 | .quota = quota, | |
7600 | }; | |
7601 | ||
7602 | if (quota != RUNTIME_INF) { | |
7603 | do_div(data.period, NSEC_PER_USEC); | |
7604 | do_div(data.quota, NSEC_PER_USEC); | |
7605 | } | |
7606 | ||
8277434e PT |
7607 | rcu_read_lock(); |
7608 | ret = walk_tg_tree(tg_cfs_schedulable_down, tg_nop, &data); | |
7609 | rcu_read_unlock(); | |
7610 | ||
7611 | return ret; | |
a790de99 | 7612 | } |
e8da1b18 | 7613 | |
a1f7164c | 7614 | static int cpu_cfs_stat_show(struct seq_file *sf, void *v) |
e8da1b18 | 7615 | { |
2da8ca82 | 7616 | struct task_group *tg = css_tg(seq_css(sf)); |
029632fb | 7617 | struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth; |
e8da1b18 | 7618 | |
44ffc75b TH |
7619 | seq_printf(sf, "nr_periods %d\n", cfs_b->nr_periods); |
7620 | seq_printf(sf, "nr_throttled %d\n", cfs_b->nr_throttled); | |
7621 | seq_printf(sf, "throttled_time %llu\n", cfs_b->throttled_time); | |
e8da1b18 | 7622 | |
3d6c50c2 YW |
7623 | if (schedstat_enabled() && tg != &root_task_group) { |
7624 | u64 ws = 0; | |
7625 | int i; | |
7626 | ||
7627 | for_each_possible_cpu(i) | |
7628 | ws += schedstat_val(tg->se[i]->statistics.wait_sum); | |
7629 | ||
7630 | seq_printf(sf, "wait_sum %llu\n", ws); | |
7631 | } | |
7632 | ||
e8da1b18 NR |
7633 | return 0; |
7634 | } | |
ab84d31e | 7635 | #endif /* CONFIG_CFS_BANDWIDTH */ |
6d6bc0ad | 7636 | #endif /* CONFIG_FAIR_GROUP_SCHED */ |
68318b8e | 7637 | |
052f1dc7 | 7638 | #ifdef CONFIG_RT_GROUP_SCHED |
182446d0 TH |
7639 | static int cpu_rt_runtime_write(struct cgroup_subsys_state *css, |
7640 | struct cftype *cft, s64 val) | |
6f505b16 | 7641 | { |
182446d0 | 7642 | return sched_group_set_rt_runtime(css_tg(css), val); |
6f505b16 PZ |
7643 | } |
7644 | ||
182446d0 TH |
7645 | static s64 cpu_rt_runtime_read(struct cgroup_subsys_state *css, |
7646 | struct cftype *cft) | |
6f505b16 | 7647 | { |
182446d0 | 7648 | return sched_group_rt_runtime(css_tg(css)); |
6f505b16 | 7649 | } |
d0b27fa7 | 7650 | |
182446d0 TH |
7651 | static int cpu_rt_period_write_uint(struct cgroup_subsys_state *css, |
7652 | struct cftype *cftype, u64 rt_period_us) | |
d0b27fa7 | 7653 | { |
182446d0 | 7654 | return sched_group_set_rt_period(css_tg(css), rt_period_us); |
d0b27fa7 PZ |
7655 | } |
7656 | ||
182446d0 TH |
7657 | static u64 cpu_rt_period_read_uint(struct cgroup_subsys_state *css, |
7658 | struct cftype *cft) | |
d0b27fa7 | 7659 | { |
182446d0 | 7660 | return sched_group_rt_period(css_tg(css)); |
d0b27fa7 | 7661 | } |
6d6bc0ad | 7662 | #endif /* CONFIG_RT_GROUP_SCHED */ |
6f505b16 | 7663 | |
a1f7164c | 7664 | static struct cftype cpu_legacy_files[] = { |
052f1dc7 | 7665 | #ifdef CONFIG_FAIR_GROUP_SCHED |
fe5c7cc2 PM |
7666 | { |
7667 | .name = "shares", | |
f4c753b7 PM |
7668 | .read_u64 = cpu_shares_read_u64, |
7669 | .write_u64 = cpu_shares_write_u64, | |
fe5c7cc2 | 7670 | }, |
052f1dc7 | 7671 | #endif |
ab84d31e PT |
7672 | #ifdef CONFIG_CFS_BANDWIDTH |
7673 | { | |
7674 | .name = "cfs_quota_us", | |
7675 | .read_s64 = cpu_cfs_quota_read_s64, | |
7676 | .write_s64 = cpu_cfs_quota_write_s64, | |
7677 | }, | |
7678 | { | |
7679 | .name = "cfs_period_us", | |
7680 | .read_u64 = cpu_cfs_period_read_u64, | |
7681 | .write_u64 = cpu_cfs_period_write_u64, | |
7682 | }, | |
e8da1b18 NR |
7683 | { |
7684 | .name = "stat", | |
a1f7164c | 7685 | .seq_show = cpu_cfs_stat_show, |
e8da1b18 | 7686 | }, |
ab84d31e | 7687 | #endif |
052f1dc7 | 7688 | #ifdef CONFIG_RT_GROUP_SCHED |
6f505b16 | 7689 | { |
9f0c1e56 | 7690 | .name = "rt_runtime_us", |
06ecb27c PM |
7691 | .read_s64 = cpu_rt_runtime_read, |
7692 | .write_s64 = cpu_rt_runtime_write, | |
6f505b16 | 7693 | }, |
d0b27fa7 PZ |
7694 | { |
7695 | .name = "rt_period_us", | |
f4c753b7 PM |
7696 | .read_u64 = cpu_rt_period_read_uint, |
7697 | .write_u64 = cpu_rt_period_write_uint, | |
d0b27fa7 | 7698 | }, |
2480c093 PB |
7699 | #endif |
7700 | #ifdef CONFIG_UCLAMP_TASK_GROUP | |
7701 | { | |
7702 | .name = "uclamp.min", | |
7703 | .flags = CFTYPE_NOT_ON_ROOT, | |
7704 | .seq_show = cpu_uclamp_min_show, | |
7705 | .write = cpu_uclamp_min_write, | |
7706 | }, | |
7707 | { | |
7708 | .name = "uclamp.max", | |
7709 | .flags = CFTYPE_NOT_ON_ROOT, | |
7710 | .seq_show = cpu_uclamp_max_show, | |
7711 | .write = cpu_uclamp_max_write, | |
7712 | }, | |
052f1dc7 | 7713 | #endif |
d1ccc66d | 7714 | { } /* Terminate */ |
68318b8e SV |
7715 | }; |
7716 | ||
d41bf8c9 TH |
7717 | static int cpu_extra_stat_show(struct seq_file *sf, |
7718 | struct cgroup_subsys_state *css) | |
0d593634 | 7719 | { |
0d593634 TH |
7720 | #ifdef CONFIG_CFS_BANDWIDTH |
7721 | { | |
d41bf8c9 | 7722 | struct task_group *tg = css_tg(css); |
0d593634 TH |
7723 | struct cfs_bandwidth *cfs_b = &tg->cfs_bandwidth; |
7724 | u64 throttled_usec; | |
7725 | ||
7726 | throttled_usec = cfs_b->throttled_time; | |
7727 | do_div(throttled_usec, NSEC_PER_USEC); | |
7728 | ||
7729 | seq_printf(sf, "nr_periods %d\n" | |
7730 | "nr_throttled %d\n" | |
7731 | "throttled_usec %llu\n", | |
7732 | cfs_b->nr_periods, cfs_b->nr_throttled, | |
7733 | throttled_usec); | |
7734 | } | |
7735 | #endif | |
7736 | return 0; | |
7737 | } | |
7738 | ||
7739 | #ifdef CONFIG_FAIR_GROUP_SCHED | |
7740 | static u64 cpu_weight_read_u64(struct cgroup_subsys_state *css, | |
7741 | struct cftype *cft) | |
7742 | { | |
7743 | struct task_group *tg = css_tg(css); | |
7744 | u64 weight = scale_load_down(tg->shares); | |
7745 | ||
7746 | return DIV_ROUND_CLOSEST_ULL(weight * CGROUP_WEIGHT_DFL, 1024); | |
7747 | } | |
7748 | ||
7749 | static int cpu_weight_write_u64(struct cgroup_subsys_state *css, | |
7750 | struct cftype *cft, u64 weight) | |
7751 | { | |
7752 | /* | |
7753 | * cgroup weight knobs should use the common MIN, DFL and MAX | |
7754 | * values which are 1, 100 and 10000 respectively. While it loses | |
7755 | * a bit of range on both ends, it maps pretty well onto the shares | |
7756 | * value used by scheduler and the round-trip conversions preserve | |
7757 | * the original value over the entire range. | |
7758 | */ | |
7759 | if (weight < CGROUP_WEIGHT_MIN || weight > CGROUP_WEIGHT_MAX) | |
7760 | return -ERANGE; | |
7761 | ||
7762 | weight = DIV_ROUND_CLOSEST_ULL(weight * 1024, CGROUP_WEIGHT_DFL); | |
7763 | ||
7764 | return sched_group_set_shares(css_tg(css), scale_load(weight)); | |
7765 | } | |
7766 | ||
7767 | static s64 cpu_weight_nice_read_s64(struct cgroup_subsys_state *css, | |
7768 | struct cftype *cft) | |
7769 | { | |
7770 | unsigned long weight = scale_load_down(css_tg(css)->shares); | |
7771 | int last_delta = INT_MAX; | |
7772 | int prio, delta; | |
7773 | ||
7774 | /* find the closest nice value to the current weight */ | |
7775 | for (prio = 0; prio < ARRAY_SIZE(sched_prio_to_weight); prio++) { | |
7776 | delta = abs(sched_prio_to_weight[prio] - weight); | |
7777 | if (delta >= last_delta) | |
7778 | break; | |
7779 | last_delta = delta; | |
7780 | } | |
7781 | ||
7782 | return PRIO_TO_NICE(prio - 1 + MAX_RT_PRIO); | |
7783 | } | |
7784 | ||
7785 | static int cpu_weight_nice_write_s64(struct cgroup_subsys_state *css, | |
7786 | struct cftype *cft, s64 nice) | |
7787 | { | |
7788 | unsigned long weight; | |
7281c8de | 7789 | int idx; |
0d593634 TH |
7790 | |
7791 | if (nice < MIN_NICE || nice > MAX_NICE) | |
7792 | return -ERANGE; | |
7793 | ||
7281c8de PZ |
7794 | idx = NICE_TO_PRIO(nice) - MAX_RT_PRIO; |
7795 | idx = array_index_nospec(idx, 40); | |
7796 | weight = sched_prio_to_weight[idx]; | |
7797 | ||
0d593634 TH |
7798 | return sched_group_set_shares(css_tg(css), scale_load(weight)); |
7799 | } | |
7800 | #endif | |
7801 | ||
7802 | static void __maybe_unused cpu_period_quota_print(struct seq_file *sf, | |
7803 | long period, long quota) | |
7804 | { | |
7805 | if (quota < 0) | |
7806 | seq_puts(sf, "max"); | |
7807 | else | |
7808 | seq_printf(sf, "%ld", quota); | |
7809 | ||
7810 | seq_printf(sf, " %ld\n", period); | |
7811 | } | |
7812 | ||
7813 | /* caller should put the current value in *@periodp before calling */ | |
7814 | static int __maybe_unused cpu_period_quota_parse(char *buf, | |
7815 | u64 *periodp, u64 *quotap) | |
7816 | { | |
7817 | char tok[21]; /* U64_MAX */ | |
7818 | ||
4c47acd8 | 7819 | if (sscanf(buf, "%20s %llu", tok, periodp) < 1) |
0d593634 TH |
7820 | return -EINVAL; |
7821 | ||
7822 | *periodp *= NSEC_PER_USEC; | |
7823 | ||
7824 | if (sscanf(tok, "%llu", quotap)) | |
7825 | *quotap *= NSEC_PER_USEC; | |
7826 | else if (!strcmp(tok, "max")) | |
7827 | *quotap = RUNTIME_INF; | |
7828 | else | |
7829 | return -EINVAL; | |
7830 | ||
7831 | return 0; | |
7832 | } | |
7833 | ||
7834 | #ifdef CONFIG_CFS_BANDWIDTH | |
7835 | static int cpu_max_show(struct seq_file *sf, void *v) | |
7836 | { | |
7837 | struct task_group *tg = css_tg(seq_css(sf)); | |
7838 | ||
7839 | cpu_period_quota_print(sf, tg_get_cfs_period(tg), tg_get_cfs_quota(tg)); | |
7840 | return 0; | |
7841 | } | |
7842 | ||
7843 | static ssize_t cpu_max_write(struct kernfs_open_file *of, | |
7844 | char *buf, size_t nbytes, loff_t off) | |
7845 | { | |
7846 | struct task_group *tg = css_tg(of_css(of)); | |
7847 | u64 period = tg_get_cfs_period(tg); | |
7848 | u64 quota; | |
7849 | int ret; | |
7850 | ||
7851 | ret = cpu_period_quota_parse(buf, &period, "a); | |
7852 | if (!ret) | |
7853 | ret = tg_set_cfs_bandwidth(tg, period, quota); | |
7854 | return ret ?: nbytes; | |
7855 | } | |
7856 | #endif | |
7857 | ||
7858 | static struct cftype cpu_files[] = { | |
0d593634 TH |
7859 | #ifdef CONFIG_FAIR_GROUP_SCHED |
7860 | { | |
7861 | .name = "weight", | |
7862 | .flags = CFTYPE_NOT_ON_ROOT, | |
7863 | .read_u64 = cpu_weight_read_u64, | |
7864 | .write_u64 = cpu_weight_write_u64, | |
7865 | }, | |
7866 | { | |
7867 | .name = "weight.nice", | |
7868 | .flags = CFTYPE_NOT_ON_ROOT, | |
7869 | .read_s64 = cpu_weight_nice_read_s64, | |
7870 | .write_s64 = cpu_weight_nice_write_s64, | |
7871 | }, | |
7872 | #endif | |
7873 | #ifdef CONFIG_CFS_BANDWIDTH | |
7874 | { | |
7875 | .name = "max", | |
7876 | .flags = CFTYPE_NOT_ON_ROOT, | |
7877 | .seq_show = cpu_max_show, | |
7878 | .write = cpu_max_write, | |
7879 | }, | |
2480c093 PB |
7880 | #endif |
7881 | #ifdef CONFIG_UCLAMP_TASK_GROUP | |
7882 | { | |
7883 | .name = "uclamp.min", | |
7884 | .flags = CFTYPE_NOT_ON_ROOT, | |
7885 | .seq_show = cpu_uclamp_min_show, | |
7886 | .write = cpu_uclamp_min_write, | |
7887 | }, | |
7888 | { | |
7889 | .name = "uclamp.max", | |
7890 | .flags = CFTYPE_NOT_ON_ROOT, | |
7891 | .seq_show = cpu_uclamp_max_show, | |
7892 | .write = cpu_uclamp_max_write, | |
7893 | }, | |
0d593634 TH |
7894 | #endif |
7895 | { } /* terminate */ | |
7896 | }; | |
7897 | ||
073219e9 | 7898 | struct cgroup_subsys cpu_cgrp_subsys = { |
92fb9748 | 7899 | .css_alloc = cpu_cgroup_css_alloc, |
96b77745 | 7900 | .css_online = cpu_cgroup_css_online, |
2f5177f0 | 7901 | .css_released = cpu_cgroup_css_released, |
92fb9748 | 7902 | .css_free = cpu_cgroup_css_free, |
d41bf8c9 | 7903 | .css_extra_stat_show = cpu_extra_stat_show, |
eeb61e53 | 7904 | .fork = cpu_cgroup_fork, |
bb9d97b6 TH |
7905 | .can_attach = cpu_cgroup_can_attach, |
7906 | .attach = cpu_cgroup_attach, | |
a1f7164c | 7907 | .legacy_cftypes = cpu_legacy_files, |
0d593634 | 7908 | .dfl_cftypes = cpu_files, |
b38e42e9 | 7909 | .early_init = true, |
0d593634 | 7910 | .threaded = true, |
68318b8e SV |
7911 | }; |
7912 | ||
052f1dc7 | 7913 | #endif /* CONFIG_CGROUP_SCHED */ |
d842de87 | 7914 | |
b637a328 PM |
7915 | void dump_cpu_task(int cpu) |
7916 | { | |
7917 | pr_info("Task dump for CPU %d:\n", cpu); | |
7918 | sched_show_task(cpu_curr(cpu)); | |
7919 | } | |
ed82b8a1 AK |
7920 | |
7921 | /* | |
7922 | * Nice levels are multiplicative, with a gentle 10% change for every | |
7923 | * nice level changed. I.e. when a CPU-bound task goes from nice 0 to | |
7924 | * nice 1, it will get ~10% less CPU time than another CPU-bound task | |
7925 | * that remained on nice 0. | |
7926 | * | |
7927 | * The "10% effect" is relative and cumulative: from _any_ nice level, | |
7928 | * if you go up 1 level, it's -10% CPU usage, if you go down 1 level | |
7929 | * it's +10% CPU usage. (to achieve that we use a multiplier of 1.25. | |
7930 | * If a task goes up by ~10% and another task goes down by ~10% then | |
7931 | * the relative distance between them is ~25%.) | |
7932 | */ | |
7933 | const int sched_prio_to_weight[40] = { | |
7934 | /* -20 */ 88761, 71755, 56483, 46273, 36291, | |
7935 | /* -15 */ 29154, 23254, 18705, 14949, 11916, | |
7936 | /* -10 */ 9548, 7620, 6100, 4904, 3906, | |
7937 | /* -5 */ 3121, 2501, 1991, 1586, 1277, | |
7938 | /* 0 */ 1024, 820, 655, 526, 423, | |
7939 | /* 5 */ 335, 272, 215, 172, 137, | |
7940 | /* 10 */ 110, 87, 70, 56, 45, | |
7941 | /* 15 */ 36, 29, 23, 18, 15, | |
7942 | }; | |
7943 | ||
7944 | /* | |
7945 | * Inverse (2^32/x) values of the sched_prio_to_weight[] array, precalculated. | |
7946 | * | |
7947 | * In cases where the weight does not change often, we can use the | |
7948 | * precalculated inverse to speed up arithmetics by turning divisions | |
7949 | * into multiplications: | |
7950 | */ | |
7951 | const u32 sched_prio_to_wmult[40] = { | |
7952 | /* -20 */ 48388, 59856, 76040, 92818, 118348, | |
7953 | /* -15 */ 147320, 184698, 229616, 287308, 360437, | |
7954 | /* -10 */ 449829, 563644, 704093, 875809, 1099582, | |
7955 | /* -5 */ 1376151, 1717300, 2157191, 2708050, 3363326, | |
7956 | /* 0 */ 4194304, 5237765, 6557202, 8165337, 10153587, | |
7957 | /* 5 */ 12820798, 15790321, 19976592, 24970740, 31350126, | |
7958 | /* 10 */ 39045157, 49367440, 61356676, 76695844, 95443717, | |
7959 | /* 15 */ 119304647, 148102320, 186737708, 238609294, 286331153, | |
7960 | }; | |
14a7405b IM |
7961 | |
7962 | #undef CREATE_TRACE_POINTS |