]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - kernel/rcutiny.c
rcu: Properly initialize ->boost_tasks on CPU offline
[mirror_ubuntu-bionic-kernel.git] / kernel / rcutiny.c
CommitLineData
9b1d82fa
PM
1/*
2 * Read-Copy Update mechanism for mutual exclusion, the Bloatwatch edition.
3 *
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
17 *
18 * Copyright IBM Corporation, 2008
19 *
20 * Author: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
21 *
22 * For detailed explanation of Read-Copy Update mechanism see -
4ce5b903 23 * Documentation/RCU
9b1d82fa 24 */
4ce5b903
IM
25#include <linux/completion.h>
26#include <linux/interrupt.h>
9b1d82fa 27#include <linux/notifier.h>
4ce5b903
IM
28#include <linux/rcupdate.h>
29#include <linux/kernel.h>
9984de1a 30#include <linux/export.h>
9b1d82fa 31#include <linux/mutex.h>
4ce5b903
IM
32#include <linux/sched.h>
33#include <linux/types.h>
34#include <linux/init.h>
9b1d82fa 35#include <linux/time.h>
4ce5b903 36#include <linux/cpu.h>
268bb0ce 37#include <linux/prefetch.h>
9b1d82fa 38
29c00b4a 39#ifdef CONFIG_RCU_TRACE
29c00b4a 40#include <trace/events/rcu.h>
29c00b4a
PM
41#endif /* #else #ifdef CONFIG_RCU_TRACE */
42
43#include "rcu.h"
44
a57eb940 45/* Forward declarations for rcutiny_plugin.h. */
24278d14 46struct rcu_ctrlblk;
965a002b
PM
47static void invoke_rcu_callbacks(void);
48static void __rcu_process_callbacks(struct rcu_ctrlblk *rcp);
49static void rcu_process_callbacks(struct softirq_action *unused);
a57eb940
PM
50static void __call_rcu(struct rcu_head *head,
51 void (*func)(struct rcu_head *rcu),
52 struct rcu_ctrlblk *rcp);
53
54#include "rcutiny_plugin.h"
55
29e37d81 56static long long rcu_dynticks_nesting = DYNTICK_TASK_EXIT_IDLE;
9b1d82fa 57
9b2e4f18 58/* Common code for rcu_idle_enter() and rcu_irq_exit(), see kernel/rcutree.c. */
818615c4 59static void rcu_idle_enter_common(long long newval)
9b2e4f18 60{
818615c4 61 if (newval) {
4145fa7f 62 RCU_TRACE(trace_rcu_dyntick("--=",
818615c4
PM
63 rcu_dynticks_nesting, newval));
64 rcu_dynticks_nesting = newval;
9b2e4f18
PM
65 return;
66 }
818615c4 67 RCU_TRACE(trace_rcu_dyntick("Start", rcu_dynticks_nesting, newval));
99745b6a 68 if (!is_idle_task(current)) {
0989cb46
PM
69 struct task_struct *idle = idle_task(smp_processor_id());
70
9b2e4f18 71 RCU_TRACE(trace_rcu_dyntick("Error on entry: not idle task",
818615c4 72 rcu_dynticks_nesting, newval));
9b2e4f18 73 ftrace_dump(DUMP_ALL);
0989cb46
PM
74 WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s",
75 current->pid, current->comm,
76 idle->pid, idle->comm); /* must be idle task! */
9b2e4f18 77 }
818615c4
PM
78 barrier();
79 rcu_dynticks_nesting = newval;
9b2e4f18
PM
80 rcu_sched_qs(0); /* implies rcu_bh_qsctr_inc(0) */
81}
82
83/*
84 * Enter idle, which is an extended quiescent state if we have fully
85 * entered that mode (i.e., if the new value of dynticks_nesting is zero).
86 */
87void rcu_idle_enter(void)
88{
89 unsigned long flags;
818615c4 90 long long newval;
9b2e4f18
PM
91
92 local_irq_save(flags);
29e37d81
PM
93 WARN_ON_ONCE((rcu_dynticks_nesting & DYNTICK_TASK_NEST_MASK) == 0);
94 if ((rcu_dynticks_nesting & DYNTICK_TASK_NEST_MASK) ==
95 DYNTICK_TASK_NEST_VALUE)
818615c4 96 newval = 0;
29e37d81 97 else
818615c4
PM
98 newval = rcu_dynticks_nesting - DYNTICK_TASK_NEST_VALUE;
99 rcu_idle_enter_common(newval);
9b2e4f18
PM
100 local_irq_restore(flags);
101}
8a2ecf47 102EXPORT_SYMBOL_GPL(rcu_idle_enter);
9b2e4f18
PM
103
104/*
105 * Exit an interrupt handler towards idle.
106 */
107void rcu_irq_exit(void)
108{
109 unsigned long flags;
818615c4 110 long long newval;
9b2e4f18
PM
111
112 local_irq_save(flags);
818615c4
PM
113 newval = rcu_dynticks_nesting - 1;
114 WARN_ON_ONCE(newval < 0);
115 rcu_idle_enter_common(newval);
9b2e4f18
PM
116 local_irq_restore(flags);
117}
118
119/* Common code for rcu_idle_exit() and rcu_irq_enter(), see kernel/rcutree.c. */
120static void rcu_idle_exit_common(long long oldval)
121{
122 if (oldval) {
4145fa7f
PM
123 RCU_TRACE(trace_rcu_dyntick("++=",
124 oldval, rcu_dynticks_nesting));
9b2e4f18
PM
125 return;
126 }
4145fa7f 127 RCU_TRACE(trace_rcu_dyntick("End", oldval, rcu_dynticks_nesting));
99745b6a 128 if (!is_idle_task(current)) {
0989cb46
PM
129 struct task_struct *idle = idle_task(smp_processor_id());
130
9b2e4f18 131 RCU_TRACE(trace_rcu_dyntick("Error on exit: not idle task",
4145fa7f 132 oldval, rcu_dynticks_nesting));
9b2e4f18 133 ftrace_dump(DUMP_ALL);
0989cb46
PM
134 WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s",
135 current->pid, current->comm,
136 idle->pid, idle->comm); /* must be idle task! */
9b2e4f18
PM
137 }
138}
9b1d82fa
PM
139
140/*
9b2e4f18 141 * Exit idle, so that we are no longer in an extended quiescent state.
9b1d82fa 142 */
9b2e4f18 143void rcu_idle_exit(void)
9b1d82fa 144{
9b2e4f18
PM
145 unsigned long flags;
146 long long oldval;
147
148 local_irq_save(flags);
149 oldval = rcu_dynticks_nesting;
29e37d81
PM
150 WARN_ON_ONCE(rcu_dynticks_nesting < 0);
151 if (rcu_dynticks_nesting & DYNTICK_TASK_NEST_MASK)
152 rcu_dynticks_nesting += DYNTICK_TASK_NEST_VALUE;
153 else
154 rcu_dynticks_nesting = DYNTICK_TASK_EXIT_IDLE;
9b2e4f18
PM
155 rcu_idle_exit_common(oldval);
156 local_irq_restore(flags);
9b1d82fa 157}
8a2ecf47 158EXPORT_SYMBOL_GPL(rcu_idle_exit);
9b1d82fa
PM
159
160/*
9b2e4f18 161 * Enter an interrupt handler, moving away from idle.
9b1d82fa 162 */
9b2e4f18 163void rcu_irq_enter(void)
9b1d82fa 164{
9b2e4f18
PM
165 unsigned long flags;
166 long long oldval;
167
168 local_irq_save(flags);
169 oldval = rcu_dynticks_nesting;
9b1d82fa 170 rcu_dynticks_nesting++;
9b2e4f18
PM
171 WARN_ON_ONCE(rcu_dynticks_nesting == 0);
172 rcu_idle_exit_common(oldval);
173 local_irq_restore(flags);
9b1d82fa
PM
174}
175
d7118175 176#ifdef CONFIG_DEBUG_LOCK_ALLOC
9b2e4f18
PM
177
178/*
179 * Test whether RCU thinks that the current CPU is idle.
180 */
181int rcu_is_cpu_idle(void)
182{
183 return !rcu_dynticks_nesting;
184}
e6b80a3b 185EXPORT_SYMBOL(rcu_is_cpu_idle);
9b2e4f18 186
d7118175 187#endif /* #ifdef CONFIG_DEBUG_LOCK_ALLOC */
9b2e4f18
PM
188
189/*
190 * Test whether the current CPU was interrupted from idle. Nested
191 * interrupts don't count, we must be running at the first interrupt
192 * level.
193 */
194int rcu_is_cpu_rrupt_from_idle(void)
195{
196 return rcu_dynticks_nesting <= 0;
197}
9b1d82fa
PM
198
199/*
b554d7de
ED
200 * Helper function for rcu_sched_qs() and rcu_bh_qs().
201 * Also irqs are disabled to avoid confusion due to interrupt handlers
4ce5b903 202 * invoking call_rcu().
9b1d82fa
PM
203 */
204static int rcu_qsctr_help(struct rcu_ctrlblk *rcp)
205{
9b1d82fa
PM
206 if (rcp->rcucblist != NULL &&
207 rcp->donetail != rcp->curtail) {
208 rcp->donetail = rcp->curtail;
9b1d82fa
PM
209 return 1;
210 }
4ce5b903 211
9b1d82fa
PM
212 return 0;
213}
214
215/*
216 * Record an rcu quiescent state. And an rcu_bh quiescent state while we
217 * are at it, given that any rcu quiescent state is also an rcu_bh
218 * quiescent state. Use "+" instead of "||" to defeat short circuiting.
219 */
220void rcu_sched_qs(int cpu)
221{
b554d7de
ED
222 unsigned long flags;
223
224 local_irq_save(flags);
99652b54
PM
225 if (rcu_qsctr_help(&rcu_sched_ctrlblk) +
226 rcu_qsctr_help(&rcu_bh_ctrlblk))
965a002b 227 invoke_rcu_callbacks();
b554d7de 228 local_irq_restore(flags);
9b1d82fa
PM
229}
230
231/*
232 * Record an rcu_bh quiescent state.
233 */
234void rcu_bh_qs(int cpu)
235{
b554d7de
ED
236 unsigned long flags;
237
238 local_irq_save(flags);
9b1d82fa 239 if (rcu_qsctr_help(&rcu_bh_ctrlblk))
965a002b 240 invoke_rcu_callbacks();
b554d7de 241 local_irq_restore(flags);
9b1d82fa
PM
242}
243
244/*
245 * Check to see if the scheduling-clock interrupt came from an extended
9b2e4f18
PM
246 * quiescent state, and, if so, tell RCU about it. This function must
247 * be called from hardirq context. It is normally called from the
248 * scheduling-clock interrupt.
9b1d82fa
PM
249 */
250void rcu_check_callbacks(int cpu, int user)
251{
9b2e4f18 252 if (user || rcu_is_cpu_rrupt_from_idle())
9b1d82fa
PM
253 rcu_sched_qs(cpu);
254 else if (!in_softirq())
255 rcu_bh_qs(cpu);
a57eb940 256 rcu_preempt_check_callbacks();
9b1d82fa
PM
257}
258
259/*
b2c0710c
PM
260 * Invoke the RCU callbacks on the specified rcu_ctrlkblk structure
261 * whose grace period has elapsed.
9b1d82fa 262 */
965a002b 263static void __rcu_process_callbacks(struct rcu_ctrlblk *rcp)
9b1d82fa 264{
d4c08f2a 265 char *rn = NULL;
9b1d82fa 266 struct rcu_head *next, *list;
4ce5b903 267 unsigned long flags;
9e571a82 268 RCU_TRACE(int cb_count = 0);
9b1d82fa
PM
269
270 /* If no RCU callbacks ready to invoke, just return. */
29c00b4a 271 if (&rcp->rcucblist == rcp->donetail) {
486e2593 272 RCU_TRACE(trace_rcu_batch_start(rcp->name, 0, 0, -1));
4968c300
PM
273 RCU_TRACE(trace_rcu_batch_end(rcp->name, 0,
274 ACCESS_ONCE(rcp->rcucblist),
275 need_resched(),
276 is_idle_task(current),
277 rcu_is_callbacks_kthread()));
9b1d82fa 278 return;
29c00b4a 279 }
9b1d82fa
PM
280
281 /* Move the ready-to-invoke callbacks to a local list. */
282 local_irq_save(flags);
486e2593 283 RCU_TRACE(trace_rcu_batch_start(rcp->name, 0, rcp->qlen, -1));
9b1d82fa
PM
284 list = rcp->rcucblist;
285 rcp->rcucblist = *rcp->donetail;
286 *rcp->donetail = NULL;
287 if (rcp->curtail == rcp->donetail)
288 rcp->curtail = &rcp->rcucblist;
a57eb940 289 rcu_preempt_remove_callbacks(rcp);
9b1d82fa
PM
290 rcp->donetail = &rcp->rcucblist;
291 local_irq_restore(flags);
292
293 /* Invoke the callbacks on the local list. */
d4c08f2a 294 RCU_TRACE(rn = rcp->name);
9b1d82fa
PM
295 while (list) {
296 next = list->next;
297 prefetch(next);
551d55a9 298 debug_rcu_head_unqueue(list);
b2c0710c 299 local_bh_disable();
d4c08f2a 300 __rcu_reclaim(rn, list);
b2c0710c 301 local_bh_enable();
9b1d82fa 302 list = next;
9e571a82 303 RCU_TRACE(cb_count++);
9b1d82fa 304 }
9e571a82 305 RCU_TRACE(rcu_trace_sub_qlen(rcp, cb_count));
4968c300
PM
306 RCU_TRACE(trace_rcu_batch_end(rcp->name, cb_count, 0, need_resched(),
307 is_idle_task(current),
308 rcu_is_callbacks_kthread()));
9b1d82fa
PM
309}
310
965a002b 311static void rcu_process_callbacks(struct softirq_action *unused)
b2c0710c 312{
965a002b
PM
313 __rcu_process_callbacks(&rcu_sched_ctrlblk);
314 __rcu_process_callbacks(&rcu_bh_ctrlblk);
315 rcu_preempt_process_callbacks();
b2c0710c
PM
316}
317
9b1d82fa
PM
318/*
319 * Wait for a grace period to elapse. But it is illegal to invoke
320 * synchronize_sched() from within an RCU read-side critical section.
321 * Therefore, any legal call to synchronize_sched() is a quiescent
322 * state, and so on a UP system, synchronize_sched() need do nothing.
323 * Ditto for synchronize_rcu_bh(). (But Lai Jiangshan points out the
324 * benefits of doing might_sleep() to reduce latency.)
325 *
326 * Cool, huh? (Due to Josh Triplett.)
327 *
da848c47
PM
328 * But we want to make this a static inline later. The cond_resched()
329 * currently makes this problematic.
9b1d82fa
PM
330 */
331void synchronize_sched(void)
332{
fe15d706
PM
333 rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) &&
334 !lock_is_held(&rcu_lock_map) &&
335 !lock_is_held(&rcu_sched_lock_map),
336 "Illegal synchronize_sched() in RCU read-side critical section");
9b1d82fa
PM
337 cond_resched();
338}
339EXPORT_SYMBOL_GPL(synchronize_sched);
340
9b1d82fa
PM
341/*
342 * Helper function for call_rcu() and call_rcu_bh().
343 */
344static void __call_rcu(struct rcu_head *head,
345 void (*func)(struct rcu_head *rcu),
346 struct rcu_ctrlblk *rcp)
347{
348 unsigned long flags;
349
551d55a9 350 debug_rcu_head_queue(head);
9b1d82fa
PM
351 head->func = func;
352 head->next = NULL;
4ce5b903 353
9b1d82fa
PM
354 local_irq_save(flags);
355 *rcp->curtail = head;
356 rcp->curtail = &head->next;
9e571a82 357 RCU_TRACE(rcp->qlen++);
9b1d82fa
PM
358 local_irq_restore(flags);
359}
360
361/*
a57eb940 362 * Post an RCU callback to be invoked after the end of an RCU-sched grace
9b1d82fa
PM
363 * period. But since we have but one CPU, that would be after any
364 * quiescent state.
365 */
a57eb940 366void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
9b1d82fa 367{
99652b54 368 __call_rcu(head, func, &rcu_sched_ctrlblk);
9b1d82fa 369}
a57eb940 370EXPORT_SYMBOL_GPL(call_rcu_sched);
9b1d82fa
PM
371
372/*
373 * Post an RCU bottom-half callback to be invoked after any subsequent
374 * quiescent state.
375 */
4ce5b903 376void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
9b1d82fa
PM
377{
378 __call_rcu(head, func, &rcu_bh_ctrlblk);
379}
380EXPORT_SYMBOL_GPL(call_rcu_bh);