rcu: Add more information to the wrong-idle-task complaint
[deliverable/linux.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
4145fa7f 56static long long rcu_dynticks_nesting = DYNTICK_TASK_NESTING;
9b1d82fa 57
9b2e4f18 58/* Common code for rcu_idle_enter() and rcu_irq_exit(), see kernel/rcutree.c. */
4145fa7f 59static void rcu_idle_enter_common(long long oldval)
9b2e4f18
PM
60{
61 if (rcu_dynticks_nesting) {
4145fa7f
PM
62 RCU_TRACE(trace_rcu_dyntick("--=",
63 oldval, rcu_dynticks_nesting));
9b2e4f18
PM
64 return;
65 }
4145fa7f 66 RCU_TRACE(trace_rcu_dyntick("Start", oldval, rcu_dynticks_nesting));
9b2e4f18 67 if (!idle_cpu(smp_processor_id())) {
0989cb46
PM
68 struct task_struct *idle = idle_task(smp_processor_id());
69
9b2e4f18 70 RCU_TRACE(trace_rcu_dyntick("Error on entry: not idle task",
4145fa7f 71 oldval, rcu_dynticks_nesting));
9b2e4f18 72 ftrace_dump(DUMP_ALL);
0989cb46
PM
73 WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s",
74 current->pid, current->comm,
75 idle->pid, idle->comm); /* must be idle task! */
9b2e4f18
PM
76 }
77 rcu_sched_qs(0); /* implies rcu_bh_qsctr_inc(0) */
78}
79
80/*
81 * Enter idle, which is an extended quiescent state if we have fully
82 * entered that mode (i.e., if the new value of dynticks_nesting is zero).
83 */
84void rcu_idle_enter(void)
85{
86 unsigned long flags;
4145fa7f 87 long long oldval;
9b2e4f18
PM
88
89 local_irq_save(flags);
4145fa7f 90 oldval = rcu_dynticks_nesting;
9b2e4f18 91 rcu_dynticks_nesting = 0;
4145fa7f 92 rcu_idle_enter_common(oldval);
9b2e4f18
PM
93 local_irq_restore(flags);
94}
95
96/*
97 * Exit an interrupt handler towards idle.
98 */
99void rcu_irq_exit(void)
100{
101 unsigned long flags;
4145fa7f 102 long long oldval;
9b2e4f18
PM
103
104 local_irq_save(flags);
4145fa7f 105 oldval = rcu_dynticks_nesting;
9b2e4f18
PM
106 rcu_dynticks_nesting--;
107 WARN_ON_ONCE(rcu_dynticks_nesting < 0);
4145fa7f 108 rcu_idle_enter_common(oldval);
9b2e4f18
PM
109 local_irq_restore(flags);
110}
111
112/* Common code for rcu_idle_exit() and rcu_irq_enter(), see kernel/rcutree.c. */
113static void rcu_idle_exit_common(long long oldval)
114{
115 if (oldval) {
4145fa7f
PM
116 RCU_TRACE(trace_rcu_dyntick("++=",
117 oldval, rcu_dynticks_nesting));
9b2e4f18
PM
118 return;
119 }
4145fa7f 120 RCU_TRACE(trace_rcu_dyntick("End", oldval, rcu_dynticks_nesting));
9b2e4f18 121 if (!idle_cpu(smp_processor_id())) {
0989cb46
PM
122 struct task_struct *idle = idle_task(smp_processor_id());
123
9b2e4f18 124 RCU_TRACE(trace_rcu_dyntick("Error on exit: not idle task",
4145fa7f 125 oldval, rcu_dynticks_nesting));
9b2e4f18 126 ftrace_dump(DUMP_ALL);
0989cb46
PM
127 WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s",
128 current->pid, current->comm,
129 idle->pid, idle->comm); /* must be idle task! */
9b2e4f18
PM
130 }
131}
9b1d82fa
PM
132
133/*
9b2e4f18 134 * Exit idle, so that we are no longer in an extended quiescent state.
9b1d82fa 135 */
9b2e4f18 136void rcu_idle_exit(void)
9b1d82fa 137{
9b2e4f18
PM
138 unsigned long flags;
139 long long oldval;
140
141 local_irq_save(flags);
142 oldval = rcu_dynticks_nesting;
143 WARN_ON_ONCE(oldval != 0);
4145fa7f 144 rcu_dynticks_nesting = DYNTICK_TASK_NESTING;
9b2e4f18
PM
145 rcu_idle_exit_common(oldval);
146 local_irq_restore(flags);
9b1d82fa
PM
147}
148
149/*
9b2e4f18 150 * Enter an interrupt handler, moving away from idle.
9b1d82fa 151 */
9b2e4f18 152void rcu_irq_enter(void)
9b1d82fa 153{
9b2e4f18
PM
154 unsigned long flags;
155 long long oldval;
156
157 local_irq_save(flags);
158 oldval = rcu_dynticks_nesting;
9b1d82fa 159 rcu_dynticks_nesting++;
9b2e4f18
PM
160 WARN_ON_ONCE(rcu_dynticks_nesting == 0);
161 rcu_idle_exit_common(oldval);
162 local_irq_restore(flags);
9b1d82fa
PM
163}
164
9b2e4f18
PM
165#ifdef CONFIG_PROVE_RCU
166
167/*
168 * Test whether RCU thinks that the current CPU is idle.
169 */
170int rcu_is_cpu_idle(void)
171{
172 return !rcu_dynticks_nesting;
173}
e6b80a3b 174EXPORT_SYMBOL(rcu_is_cpu_idle);
9b2e4f18
PM
175
176#endif /* #ifdef CONFIG_PROVE_RCU */
177
178/*
179 * Test whether the current CPU was interrupted from idle. Nested
180 * interrupts don't count, we must be running at the first interrupt
181 * level.
182 */
183int rcu_is_cpu_rrupt_from_idle(void)
184{
185 return rcu_dynticks_nesting <= 0;
186}
9b1d82fa
PM
187
188/*
b554d7de
ED
189 * Helper function for rcu_sched_qs() and rcu_bh_qs().
190 * Also irqs are disabled to avoid confusion due to interrupt handlers
4ce5b903 191 * invoking call_rcu().
9b1d82fa
PM
192 */
193static int rcu_qsctr_help(struct rcu_ctrlblk *rcp)
194{
9b1d82fa
PM
195 if (rcp->rcucblist != NULL &&
196 rcp->donetail != rcp->curtail) {
197 rcp->donetail = rcp->curtail;
9b1d82fa
PM
198 return 1;
199 }
4ce5b903 200
9b1d82fa
PM
201 return 0;
202}
203
204/*
205 * Record an rcu quiescent state. And an rcu_bh quiescent state while we
206 * are at it, given that any rcu quiescent state is also an rcu_bh
207 * quiescent state. Use "+" instead of "||" to defeat short circuiting.
208 */
209void rcu_sched_qs(int cpu)
210{
b554d7de
ED
211 unsigned long flags;
212
213 local_irq_save(flags);
99652b54
PM
214 if (rcu_qsctr_help(&rcu_sched_ctrlblk) +
215 rcu_qsctr_help(&rcu_bh_ctrlblk))
965a002b 216 invoke_rcu_callbacks();
b554d7de 217 local_irq_restore(flags);
9b1d82fa
PM
218}
219
220/*
221 * Record an rcu_bh quiescent state.
222 */
223void rcu_bh_qs(int cpu)
224{
b554d7de
ED
225 unsigned long flags;
226
227 local_irq_save(flags);
9b1d82fa 228 if (rcu_qsctr_help(&rcu_bh_ctrlblk))
965a002b 229 invoke_rcu_callbacks();
b554d7de 230 local_irq_restore(flags);
9b1d82fa
PM
231}
232
233/*
234 * Check to see if the scheduling-clock interrupt came from an extended
9b2e4f18
PM
235 * quiescent state, and, if so, tell RCU about it. This function must
236 * be called from hardirq context. It is normally called from the
237 * scheduling-clock interrupt.
9b1d82fa
PM
238 */
239void rcu_check_callbacks(int cpu, int user)
240{
9b2e4f18 241 if (user || rcu_is_cpu_rrupt_from_idle())
9b1d82fa
PM
242 rcu_sched_qs(cpu);
243 else if (!in_softirq())
244 rcu_bh_qs(cpu);
a57eb940 245 rcu_preempt_check_callbacks();
9b1d82fa
PM
246}
247
248/*
b2c0710c
PM
249 * Invoke the RCU callbacks on the specified rcu_ctrlkblk structure
250 * whose grace period has elapsed.
9b1d82fa 251 */
965a002b 252static void __rcu_process_callbacks(struct rcu_ctrlblk *rcp)
9b1d82fa 253{
d4c08f2a 254 char *rn = NULL;
9b1d82fa 255 struct rcu_head *next, *list;
4ce5b903 256 unsigned long flags;
9e571a82 257 RCU_TRACE(int cb_count = 0);
9b1d82fa
PM
258
259 /* If no RCU callbacks ready to invoke, just return. */
29c00b4a 260 if (&rcp->rcucblist == rcp->donetail) {
72fe701b
PM
261 RCU_TRACE(trace_rcu_batch_start(rcp->name, 0, -1));
262 RCU_TRACE(trace_rcu_batch_end(rcp->name, 0));
9b1d82fa 263 return;
29c00b4a 264 }
9b1d82fa
PM
265
266 /* Move the ready-to-invoke callbacks to a local list. */
267 local_irq_save(flags);
72fe701b 268 RCU_TRACE(trace_rcu_batch_start(rcp->name, 0, -1));
9b1d82fa
PM
269 list = rcp->rcucblist;
270 rcp->rcucblist = *rcp->donetail;
271 *rcp->donetail = NULL;
272 if (rcp->curtail == rcp->donetail)
273 rcp->curtail = &rcp->rcucblist;
a57eb940 274 rcu_preempt_remove_callbacks(rcp);
9b1d82fa
PM
275 rcp->donetail = &rcp->rcucblist;
276 local_irq_restore(flags);
277
278 /* Invoke the callbacks on the local list. */
d4c08f2a 279 RCU_TRACE(rn = rcp->name);
9b1d82fa
PM
280 while (list) {
281 next = list->next;
282 prefetch(next);
551d55a9 283 debug_rcu_head_unqueue(list);
b2c0710c 284 local_bh_disable();
d4c08f2a 285 __rcu_reclaim(rn, list);
b2c0710c 286 local_bh_enable();
9b1d82fa 287 list = next;
9e571a82 288 RCU_TRACE(cb_count++);
9b1d82fa 289 }
9e571a82 290 RCU_TRACE(rcu_trace_sub_qlen(rcp, cb_count));
72fe701b 291 RCU_TRACE(trace_rcu_batch_end(rcp->name, cb_count));
9b1d82fa
PM
292}
293
965a002b 294static void rcu_process_callbacks(struct softirq_action *unused)
b2c0710c 295{
965a002b
PM
296 __rcu_process_callbacks(&rcu_sched_ctrlblk);
297 __rcu_process_callbacks(&rcu_bh_ctrlblk);
298 rcu_preempt_process_callbacks();
b2c0710c
PM
299}
300
9b1d82fa
PM
301/*
302 * Wait for a grace period to elapse. But it is illegal to invoke
303 * synchronize_sched() from within an RCU read-side critical section.
304 * Therefore, any legal call to synchronize_sched() is a quiescent
305 * state, and so on a UP system, synchronize_sched() need do nothing.
306 * Ditto for synchronize_rcu_bh(). (But Lai Jiangshan points out the
307 * benefits of doing might_sleep() to reduce latency.)
308 *
309 * Cool, huh? (Due to Josh Triplett.)
310 *
da848c47
PM
311 * But we want to make this a static inline later. The cond_resched()
312 * currently makes this problematic.
9b1d82fa
PM
313 */
314void synchronize_sched(void)
315{
316 cond_resched();
317}
318EXPORT_SYMBOL_GPL(synchronize_sched);
319
9b1d82fa
PM
320/*
321 * Helper function for call_rcu() and call_rcu_bh().
322 */
323static void __call_rcu(struct rcu_head *head,
324 void (*func)(struct rcu_head *rcu),
325 struct rcu_ctrlblk *rcp)
326{
327 unsigned long flags;
328
551d55a9 329 debug_rcu_head_queue(head);
9b1d82fa
PM
330 head->func = func;
331 head->next = NULL;
4ce5b903 332
9b1d82fa
PM
333 local_irq_save(flags);
334 *rcp->curtail = head;
335 rcp->curtail = &head->next;
9e571a82 336 RCU_TRACE(rcp->qlen++);
9b1d82fa
PM
337 local_irq_restore(flags);
338}
339
340/*
a57eb940 341 * Post an RCU callback to be invoked after the end of an RCU-sched grace
9b1d82fa
PM
342 * period. But since we have but one CPU, that would be after any
343 * quiescent state.
344 */
a57eb940 345void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
9b1d82fa 346{
99652b54 347 __call_rcu(head, func, &rcu_sched_ctrlblk);
9b1d82fa 348}
a57eb940 349EXPORT_SYMBOL_GPL(call_rcu_sched);
9b1d82fa
PM
350
351/*
352 * Post an RCU bottom-half callback to be invoked after any subsequent
353 * quiescent state.
354 */
4ce5b903 355void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
9b1d82fa
PM
356{
357 __call_rcu(head, func, &rcu_bh_ctrlblk);
358}
359EXPORT_SYMBOL_GPL(call_rcu_bh);
This page took 0.164232 seconds and 5 git commands to generate.