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