Commit | Line | Data |
---|---|---|
64db4cff PM |
1 | /* |
2 | * Read-Copy Update mechanism for mutual exclusion | |
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 | * Authors: Dipankar Sarma <dipankar@in.ibm.com> | |
21 | * Manfred Spraul <manfred@colorfullife.com> | |
22 | * Paul E. McKenney <paulmck@linux.vnet.ibm.com> Hierarchical version | |
23 | * | |
24 | * Based on the original work by Paul McKenney <paulmck@us.ibm.com> | |
25 | * and inputs from Rusty Russell, Andrea Arcangeli and Andi Kleen. | |
26 | * | |
27 | * For detailed explanation of Read-Copy Update mechanism see - | |
a71fca58 | 28 | * Documentation/RCU |
64db4cff PM |
29 | */ |
30 | #include <linux/types.h> | |
31 | #include <linux/kernel.h> | |
32 | #include <linux/init.h> | |
33 | #include <linux/spinlock.h> | |
34 | #include <linux/smp.h> | |
35 | #include <linux/rcupdate.h> | |
36 | #include <linux/interrupt.h> | |
37 | #include <linux/sched.h> | |
c1dc0b9c | 38 | #include <linux/nmi.h> |
8826f3b0 | 39 | #include <linux/atomic.h> |
64db4cff | 40 | #include <linux/bitops.h> |
9984de1a | 41 | #include <linux/export.h> |
64db4cff PM |
42 | #include <linux/completion.h> |
43 | #include <linux/moduleparam.h> | |
44 | #include <linux/percpu.h> | |
45 | #include <linux/notifier.h> | |
46 | #include <linux/cpu.h> | |
47 | #include <linux/mutex.h> | |
48 | #include <linux/time.h> | |
bbad9379 | 49 | #include <linux/kernel_stat.h> |
a26ac245 PM |
50 | #include <linux/wait.h> |
51 | #include <linux/kthread.h> | |
268bb0ce | 52 | #include <linux/prefetch.h> |
3d3b7db0 PM |
53 | #include <linux/delay.h> |
54 | #include <linux/stop_machine.h> | |
64db4cff | 55 | |
9f77da9f | 56 | #include "rcutree.h" |
29c00b4a PM |
57 | #include <trace/events/rcu.h> |
58 | ||
59 | #include "rcu.h" | |
9f77da9f | 60 | |
64db4cff PM |
61 | /* Data structures. */ |
62 | ||
b668c9cf | 63 | static struct lock_class_key rcu_node_class[NUM_RCU_LVLS]; |
88b91c7c | 64 | |
4300aa64 | 65 | #define RCU_STATE_INITIALIZER(structname) { \ |
e99033c5 | 66 | .level = { &structname##_state.node[0] }, \ |
64db4cff PM |
67 | .levelcnt = { \ |
68 | NUM_RCU_LVL_0, /* root of hierarchy. */ \ | |
69 | NUM_RCU_LVL_1, \ | |
70 | NUM_RCU_LVL_2, \ | |
cf244dc0 PM |
71 | NUM_RCU_LVL_3, \ |
72 | NUM_RCU_LVL_4, /* == MAX_RCU_LVLS */ \ | |
64db4cff | 73 | }, \ |
af446b70 | 74 | .fqs_state = RCU_GP_IDLE, \ |
64db4cff PM |
75 | .gpnum = -300, \ |
76 | .completed = -300, \ | |
e99033c5 PM |
77 | .onofflock = __RAW_SPIN_LOCK_UNLOCKED(&structname##_state.onofflock), \ |
78 | .fqslock = __RAW_SPIN_LOCK_UNLOCKED(&structname##_state.fqslock), \ | |
64db4cff PM |
79 | .n_force_qs = 0, \ |
80 | .n_force_qs_ngp = 0, \ | |
4300aa64 | 81 | .name = #structname, \ |
64db4cff PM |
82 | } |
83 | ||
e99033c5 | 84 | struct rcu_state rcu_sched_state = RCU_STATE_INITIALIZER(rcu_sched); |
d6714c22 | 85 | DEFINE_PER_CPU(struct rcu_data, rcu_sched_data); |
64db4cff | 86 | |
e99033c5 | 87 | struct rcu_state rcu_bh_state = RCU_STATE_INITIALIZER(rcu_bh); |
6258c4fb | 88 | DEFINE_PER_CPU(struct rcu_data, rcu_bh_data); |
b1f77b05 | 89 | |
27f4d280 PM |
90 | static struct rcu_state *rcu_state; |
91 | ||
b0d30417 PM |
92 | /* |
93 | * The rcu_scheduler_active variable transitions from zero to one just | |
94 | * before the first task is spawned. So when this variable is zero, RCU | |
95 | * can assume that there is but one task, allowing RCU to (for example) | |
96 | * optimized synchronize_sched() to a simple barrier(). When this variable | |
97 | * is one, RCU must actually do all the hard work required to detect real | |
98 | * grace periods. This variable is also used to suppress boot-time false | |
99 | * positives from lockdep-RCU error checking. | |
100 | */ | |
bbad9379 PM |
101 | int rcu_scheduler_active __read_mostly; |
102 | EXPORT_SYMBOL_GPL(rcu_scheduler_active); | |
103 | ||
b0d30417 PM |
104 | /* |
105 | * The rcu_scheduler_fully_active variable transitions from zero to one | |
106 | * during the early_initcall() processing, which is after the scheduler | |
107 | * is capable of creating new tasks. So RCU processing (for example, | |
108 | * creating tasks for RCU priority boosting) must be delayed until after | |
109 | * rcu_scheduler_fully_active transitions from zero to one. We also | |
110 | * currently delay invocation of any RCU callbacks until after this point. | |
111 | * | |
112 | * It might later prove better for people registering RCU callbacks during | |
113 | * early boot to take responsibility for these callbacks, but one step at | |
114 | * a time. | |
115 | */ | |
116 | static int rcu_scheduler_fully_active __read_mostly; | |
117 | ||
a46e0899 PM |
118 | #ifdef CONFIG_RCU_BOOST |
119 | ||
a26ac245 PM |
120 | /* |
121 | * Control variables for per-CPU and per-rcu_node kthreads. These | |
122 | * handle all flavors of RCU. | |
123 | */ | |
124 | static DEFINE_PER_CPU(struct task_struct *, rcu_cpu_kthread_task); | |
d71df90e | 125 | DEFINE_PER_CPU(unsigned int, rcu_cpu_kthread_status); |
15ba0ba8 | 126 | DEFINE_PER_CPU(int, rcu_cpu_kthread_cpu); |
5ece5bab | 127 | DEFINE_PER_CPU(unsigned int, rcu_cpu_kthread_loops); |
d71df90e | 128 | DEFINE_PER_CPU(char, rcu_cpu_has_work); |
a26ac245 | 129 | |
a46e0899 PM |
130 | #endif /* #ifdef CONFIG_RCU_BOOST */ |
131 | ||
0f962a5e | 132 | static void rcu_node_kthread_setaffinity(struct rcu_node *rnp, int outgoingcpu); |
a46e0899 PM |
133 | static void invoke_rcu_core(void); |
134 | static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp); | |
a26ac245 | 135 | |
4a298656 PM |
136 | /* |
137 | * Track the rcutorture test sequence number and the update version | |
138 | * number within a given test. The rcutorture_testseq is incremented | |
139 | * on every rcutorture module load and unload, so has an odd value | |
140 | * when a test is running. The rcutorture_vernum is set to zero | |
141 | * when rcutorture starts and is incremented on each rcutorture update. | |
142 | * These variables enable correlating rcutorture output with the | |
143 | * RCU tracing information. | |
144 | */ | |
145 | unsigned long rcutorture_testseq; | |
146 | unsigned long rcutorture_vernum; | |
147 | ||
fc2219d4 PM |
148 | /* |
149 | * Return true if an RCU grace period is in progress. The ACCESS_ONCE()s | |
150 | * permit this function to be invoked without holding the root rcu_node | |
151 | * structure's ->lock, but of course results can be subject to change. | |
152 | */ | |
153 | static int rcu_gp_in_progress(struct rcu_state *rsp) | |
154 | { | |
155 | return ACCESS_ONCE(rsp->completed) != ACCESS_ONCE(rsp->gpnum); | |
156 | } | |
157 | ||
b1f77b05 | 158 | /* |
d6714c22 | 159 | * Note a quiescent state. Because we do not need to know |
b1f77b05 | 160 | * how many quiescent states passed, just if there was at least |
d6714c22 | 161 | * one since the start of the grace period, this just sets a flag. |
e4cc1f22 | 162 | * The caller must have disabled preemption. |
b1f77b05 | 163 | */ |
d6714c22 | 164 | void rcu_sched_qs(int cpu) |
b1f77b05 | 165 | { |
25502a6c | 166 | struct rcu_data *rdp = &per_cpu(rcu_sched_data, cpu); |
f41d911f | 167 | |
e4cc1f22 | 168 | rdp->passed_quiesce_gpnum = rdp->gpnum; |
c3422bea | 169 | barrier(); |
e4cc1f22 | 170 | if (rdp->passed_quiesce == 0) |
d4c08f2a | 171 | trace_rcu_grace_period("rcu_sched", rdp->gpnum, "cpuqs"); |
e4cc1f22 | 172 | rdp->passed_quiesce = 1; |
b1f77b05 IM |
173 | } |
174 | ||
d6714c22 | 175 | void rcu_bh_qs(int cpu) |
b1f77b05 | 176 | { |
25502a6c | 177 | struct rcu_data *rdp = &per_cpu(rcu_bh_data, cpu); |
f41d911f | 178 | |
e4cc1f22 | 179 | rdp->passed_quiesce_gpnum = rdp->gpnum; |
c3422bea | 180 | barrier(); |
e4cc1f22 | 181 | if (rdp->passed_quiesce == 0) |
d4c08f2a | 182 | trace_rcu_grace_period("rcu_bh", rdp->gpnum, "cpuqs"); |
e4cc1f22 | 183 | rdp->passed_quiesce = 1; |
b1f77b05 | 184 | } |
64db4cff | 185 | |
25502a6c PM |
186 | /* |
187 | * Note a context switch. This is a quiescent state for RCU-sched, | |
188 | * and requires special handling for preemptible RCU. | |
e4cc1f22 | 189 | * The caller must have disabled preemption. |
25502a6c PM |
190 | */ |
191 | void rcu_note_context_switch(int cpu) | |
192 | { | |
300df91c | 193 | trace_rcu_utilization("Start context switch"); |
25502a6c PM |
194 | rcu_sched_qs(cpu); |
195 | rcu_preempt_note_context_switch(cpu); | |
300df91c | 196 | trace_rcu_utilization("End context switch"); |
25502a6c | 197 | } |
29ce8310 | 198 | EXPORT_SYMBOL_GPL(rcu_note_context_switch); |
25502a6c | 199 | |
90a4d2c0 | 200 | DEFINE_PER_CPU(struct rcu_dynticks, rcu_dynticks) = { |
29e37d81 | 201 | .dynticks_nesting = DYNTICK_TASK_EXIT_IDLE, |
23b5c8fa | 202 | .dynticks = ATOMIC_INIT(1), |
90a4d2c0 | 203 | }; |
64db4cff | 204 | |
e0f23060 | 205 | static int blimit = 10; /* Maximum callbacks per rcu_do_batch. */ |
64db4cff PM |
206 | static int qhimark = 10000; /* If this many pending, ignore blimit. */ |
207 | static int qlowmark = 100; /* Once only this many pending, use blimit. */ | |
208 | ||
3d76c082 PM |
209 | module_param(blimit, int, 0); |
210 | module_param(qhimark, int, 0); | |
211 | module_param(qlowmark, int, 0); | |
212 | ||
13cfcca0 PM |
213 | int rcu_cpu_stall_suppress __read_mostly; /* 1 = suppress stall warnings. */ |
214 | int rcu_cpu_stall_timeout __read_mostly = CONFIG_RCU_CPU_STALL_TIMEOUT; | |
215 | ||
f2e0dd70 | 216 | module_param(rcu_cpu_stall_suppress, int, 0644); |
13cfcca0 | 217 | module_param(rcu_cpu_stall_timeout, int, 0644); |
742734ee | 218 | |
64db4cff | 219 | static void force_quiescent_state(struct rcu_state *rsp, int relaxed); |
a157229c | 220 | static int rcu_pending(int cpu); |
64db4cff PM |
221 | |
222 | /* | |
d6714c22 | 223 | * Return the number of RCU-sched batches processed thus far for debug & stats. |
64db4cff | 224 | */ |
d6714c22 | 225 | long rcu_batches_completed_sched(void) |
64db4cff | 226 | { |
d6714c22 | 227 | return rcu_sched_state.completed; |
64db4cff | 228 | } |
d6714c22 | 229 | EXPORT_SYMBOL_GPL(rcu_batches_completed_sched); |
64db4cff PM |
230 | |
231 | /* | |
232 | * Return the number of RCU BH batches processed thus far for debug & stats. | |
233 | */ | |
234 | long rcu_batches_completed_bh(void) | |
235 | { | |
236 | return rcu_bh_state.completed; | |
237 | } | |
238 | EXPORT_SYMBOL_GPL(rcu_batches_completed_bh); | |
239 | ||
bf66f18e PM |
240 | /* |
241 | * Force a quiescent state for RCU BH. | |
242 | */ | |
243 | void rcu_bh_force_quiescent_state(void) | |
244 | { | |
245 | force_quiescent_state(&rcu_bh_state, 0); | |
246 | } | |
247 | EXPORT_SYMBOL_GPL(rcu_bh_force_quiescent_state); | |
248 | ||
4a298656 PM |
249 | /* |
250 | * Record the number of times rcutorture tests have been initiated and | |
251 | * terminated. This information allows the debugfs tracing stats to be | |
252 | * correlated to the rcutorture messages, even when the rcutorture module | |
253 | * is being repeatedly loaded and unloaded. In other words, we cannot | |
254 | * store this state in rcutorture itself. | |
255 | */ | |
256 | void rcutorture_record_test_transition(void) | |
257 | { | |
258 | rcutorture_testseq++; | |
259 | rcutorture_vernum = 0; | |
260 | } | |
261 | EXPORT_SYMBOL_GPL(rcutorture_record_test_transition); | |
262 | ||
263 | /* | |
264 | * Record the number of writer passes through the current rcutorture test. | |
265 | * This is also used to correlate debugfs tracing stats with the rcutorture | |
266 | * messages. | |
267 | */ | |
268 | void rcutorture_record_progress(unsigned long vernum) | |
269 | { | |
270 | rcutorture_vernum++; | |
271 | } | |
272 | EXPORT_SYMBOL_GPL(rcutorture_record_progress); | |
273 | ||
bf66f18e PM |
274 | /* |
275 | * Force a quiescent state for RCU-sched. | |
276 | */ | |
277 | void rcu_sched_force_quiescent_state(void) | |
278 | { | |
279 | force_quiescent_state(&rcu_sched_state, 0); | |
280 | } | |
281 | EXPORT_SYMBOL_GPL(rcu_sched_force_quiescent_state); | |
282 | ||
64db4cff PM |
283 | /* |
284 | * Does the CPU have callbacks ready to be invoked? | |
285 | */ | |
286 | static int | |
287 | cpu_has_callbacks_ready_to_invoke(struct rcu_data *rdp) | |
288 | { | |
289 | return &rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL]; | |
290 | } | |
291 | ||
292 | /* | |
293 | * Does the current CPU require a yet-as-unscheduled grace period? | |
294 | */ | |
295 | static int | |
296 | cpu_needs_another_gp(struct rcu_state *rsp, struct rcu_data *rdp) | |
297 | { | |
fc2219d4 | 298 | return *rdp->nxttail[RCU_DONE_TAIL] && !rcu_gp_in_progress(rsp); |
64db4cff PM |
299 | } |
300 | ||
301 | /* | |
302 | * Return the root node of the specified rcu_state structure. | |
303 | */ | |
304 | static struct rcu_node *rcu_get_root(struct rcu_state *rsp) | |
305 | { | |
306 | return &rsp->node[0]; | |
307 | } | |
308 | ||
64db4cff PM |
309 | /* |
310 | * If the specified CPU is offline, tell the caller that it is in | |
311 | * a quiescent state. Otherwise, whack it with a reschedule IPI. | |
312 | * Grace periods can end up waiting on an offline CPU when that | |
313 | * CPU is in the process of coming online -- it will be added to the | |
314 | * rcu_node bitmasks before it actually makes it online. The same thing | |
315 | * can happen while a CPU is in the process of coming online. Because this | |
316 | * race is quite rare, we check for it after detecting that the grace | |
317 | * period has been delayed rather than checking each and every CPU | |
318 | * each and every time we start a new grace period. | |
319 | */ | |
320 | static int rcu_implicit_offline_qs(struct rcu_data *rdp) | |
321 | { | |
322 | /* | |
2036d94a PM |
323 | * If the CPU is offline for more than a jiffy, it is in a quiescent |
324 | * state. We can trust its state not to change because interrupts | |
325 | * are disabled. The reason for the jiffy's worth of slack is to | |
326 | * handle CPUs initializing on the way up and finding their way | |
327 | * to the idle loop on the way down. | |
64db4cff | 328 | */ |
2036d94a PM |
329 | if (cpu_is_offline(rdp->cpu) && |
330 | ULONG_CMP_LT(rdp->rsp->gp_start + 2, jiffies)) { | |
d4c08f2a | 331 | trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, "ofl"); |
64db4cff PM |
332 | rdp->offline_fqs++; |
333 | return 1; | |
334 | } | |
64db4cff PM |
335 | return 0; |
336 | } | |
337 | ||
9b2e4f18 PM |
338 | /* |
339 | * rcu_idle_enter_common - inform RCU that current CPU is moving towards idle | |
340 | * | |
341 | * If the new value of the ->dynticks_nesting counter now is zero, | |
342 | * we really have entered idle, and must do the appropriate accounting. | |
343 | * The caller must have disabled interrupts. | |
344 | */ | |
4145fa7f | 345 | static void rcu_idle_enter_common(struct rcu_dynticks *rdtp, long long oldval) |
9b2e4f18 | 346 | { |
facc4e15 | 347 | trace_rcu_dyntick("Start", oldval, 0); |
99745b6a | 348 | if (!is_idle_task(current)) { |
0989cb46 PM |
349 | struct task_struct *idle = idle_task(smp_processor_id()); |
350 | ||
facc4e15 | 351 | trace_rcu_dyntick("Error on entry: not idle task", oldval, 0); |
9b2e4f18 | 352 | ftrace_dump(DUMP_ALL); |
0989cb46 PM |
353 | WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s", |
354 | current->pid, current->comm, | |
355 | idle->pid, idle->comm); /* must be idle task! */ | |
9b2e4f18 | 356 | } |
aea1b35e | 357 | rcu_prepare_for_idle(smp_processor_id()); |
9b2e4f18 PM |
358 | /* CPUs seeing atomic_inc() must see prior RCU read-side crit sects */ |
359 | smp_mb__before_atomic_inc(); /* See above. */ | |
360 | atomic_inc(&rdtp->dynticks); | |
361 | smp_mb__after_atomic_inc(); /* Force ordering with next sojourn. */ | |
362 | WARN_ON_ONCE(atomic_read(&rdtp->dynticks) & 0x1); | |
c44e2cdd PM |
363 | |
364 | /* | |
365 | * The idle task is not permitted to enter the idle loop while | |
366 | * in an RCU read-side critical section. | |
367 | */ | |
368 | rcu_lockdep_assert(!lock_is_held(&rcu_lock_map), | |
369 | "Illegal idle entry in RCU read-side critical section."); | |
370 | rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map), | |
371 | "Illegal idle entry in RCU-bh read-side critical section."); | |
372 | rcu_lockdep_assert(!lock_is_held(&rcu_sched_lock_map), | |
373 | "Illegal idle entry in RCU-sched read-side critical section."); | |
9b2e4f18 | 374 | } |
64db4cff PM |
375 | |
376 | /** | |
9b2e4f18 | 377 | * rcu_idle_enter - inform RCU that current CPU is entering idle |
64db4cff | 378 | * |
9b2e4f18 | 379 | * Enter idle mode, in other words, -leave- the mode in which RCU |
64db4cff | 380 | * read-side critical sections can occur. (Though RCU read-side |
9b2e4f18 PM |
381 | * critical sections can occur in irq handlers in idle, a possibility |
382 | * handled by irq_enter() and irq_exit().) | |
383 | * | |
384 | * We crowbar the ->dynticks_nesting field to zero to allow for | |
385 | * the possibility of usermode upcalls having messed up our count | |
386 | * of interrupt nesting level during the prior busy period. | |
64db4cff | 387 | */ |
9b2e4f18 | 388 | void rcu_idle_enter(void) |
64db4cff PM |
389 | { |
390 | unsigned long flags; | |
4145fa7f | 391 | long long oldval; |
64db4cff PM |
392 | struct rcu_dynticks *rdtp; |
393 | ||
64db4cff PM |
394 | local_irq_save(flags); |
395 | rdtp = &__get_cpu_var(rcu_dynticks); | |
4145fa7f | 396 | oldval = rdtp->dynticks_nesting; |
29e37d81 PM |
397 | WARN_ON_ONCE((oldval & DYNTICK_TASK_NEST_MASK) == 0); |
398 | if ((oldval & DYNTICK_TASK_NEST_MASK) == DYNTICK_TASK_NEST_VALUE) | |
399 | rdtp->dynticks_nesting = 0; | |
400 | else | |
401 | rdtp->dynticks_nesting -= DYNTICK_TASK_NEST_VALUE; | |
4145fa7f | 402 | rcu_idle_enter_common(rdtp, oldval); |
64db4cff PM |
403 | local_irq_restore(flags); |
404 | } | |
8a2ecf47 | 405 | EXPORT_SYMBOL_GPL(rcu_idle_enter); |
64db4cff | 406 | |
9b2e4f18 PM |
407 | /** |
408 | * rcu_irq_exit - inform RCU that current CPU is exiting irq towards idle | |
409 | * | |
410 | * Exit from an interrupt handler, which might possibly result in entering | |
411 | * idle mode, in other words, leaving the mode in which read-side critical | |
412 | * sections can occur. | |
64db4cff | 413 | * |
9b2e4f18 PM |
414 | * This code assumes that the idle loop never does anything that might |
415 | * result in unbalanced calls to irq_enter() and irq_exit(). If your | |
416 | * architecture violates this assumption, RCU will give you what you | |
417 | * deserve, good and hard. But very infrequently and irreproducibly. | |
418 | * | |
419 | * Use things like work queues to work around this limitation. | |
420 | * | |
421 | * You have been warned. | |
64db4cff | 422 | */ |
9b2e4f18 | 423 | void rcu_irq_exit(void) |
64db4cff PM |
424 | { |
425 | unsigned long flags; | |
4145fa7f | 426 | long long oldval; |
64db4cff PM |
427 | struct rcu_dynticks *rdtp; |
428 | ||
429 | local_irq_save(flags); | |
430 | rdtp = &__get_cpu_var(rcu_dynticks); | |
4145fa7f | 431 | oldval = rdtp->dynticks_nesting; |
9b2e4f18 PM |
432 | rdtp->dynticks_nesting--; |
433 | WARN_ON_ONCE(rdtp->dynticks_nesting < 0); | |
b6fc6020 FW |
434 | if (rdtp->dynticks_nesting) |
435 | trace_rcu_dyntick("--=", oldval, rdtp->dynticks_nesting); | |
436 | else | |
437 | rcu_idle_enter_common(rdtp, oldval); | |
9b2e4f18 PM |
438 | local_irq_restore(flags); |
439 | } | |
440 | ||
441 | /* | |
442 | * rcu_idle_exit_common - inform RCU that current CPU is moving away from idle | |
443 | * | |
444 | * If the new value of the ->dynticks_nesting counter was previously zero, | |
445 | * we really have exited idle, and must do the appropriate accounting. | |
446 | * The caller must have disabled interrupts. | |
447 | */ | |
448 | static void rcu_idle_exit_common(struct rcu_dynticks *rdtp, long long oldval) | |
449 | { | |
23b5c8fa PM |
450 | smp_mb__before_atomic_inc(); /* Force ordering w/previous sojourn. */ |
451 | atomic_inc(&rdtp->dynticks); | |
452 | /* CPUs seeing atomic_inc() must see later RCU read-side crit sects */ | |
453 | smp_mb__after_atomic_inc(); /* See above. */ | |
454 | WARN_ON_ONCE(!(atomic_read(&rdtp->dynticks) & 0x1)); | |
7cb92499 | 455 | rcu_cleanup_after_idle(smp_processor_id()); |
4145fa7f | 456 | trace_rcu_dyntick("End", oldval, rdtp->dynticks_nesting); |
99745b6a | 457 | if (!is_idle_task(current)) { |
0989cb46 PM |
458 | struct task_struct *idle = idle_task(smp_processor_id()); |
459 | ||
4145fa7f PM |
460 | trace_rcu_dyntick("Error on exit: not idle task", |
461 | oldval, rdtp->dynticks_nesting); | |
9b2e4f18 | 462 | ftrace_dump(DUMP_ALL); |
0989cb46 PM |
463 | WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s", |
464 | current->pid, current->comm, | |
465 | idle->pid, idle->comm); /* must be idle task! */ | |
9b2e4f18 PM |
466 | } |
467 | } | |
468 | ||
469 | /** | |
470 | * rcu_idle_exit - inform RCU that current CPU is leaving idle | |
471 | * | |
472 | * Exit idle mode, in other words, -enter- the mode in which RCU | |
473 | * read-side critical sections can occur. | |
474 | * | |
29e37d81 | 475 | * We crowbar the ->dynticks_nesting field to DYNTICK_TASK_NEST to |
4145fa7f | 476 | * allow for the possibility of usermode upcalls messing up our count |
9b2e4f18 PM |
477 | * of interrupt nesting level during the busy period that is just |
478 | * now starting. | |
479 | */ | |
480 | void rcu_idle_exit(void) | |
481 | { | |
482 | unsigned long flags; | |
483 | struct rcu_dynticks *rdtp; | |
484 | long long oldval; | |
485 | ||
486 | local_irq_save(flags); | |
487 | rdtp = &__get_cpu_var(rcu_dynticks); | |
488 | oldval = rdtp->dynticks_nesting; | |
29e37d81 PM |
489 | WARN_ON_ONCE(oldval < 0); |
490 | if (oldval & DYNTICK_TASK_NEST_MASK) | |
491 | rdtp->dynticks_nesting += DYNTICK_TASK_NEST_VALUE; | |
492 | else | |
493 | rdtp->dynticks_nesting = DYNTICK_TASK_EXIT_IDLE; | |
9b2e4f18 PM |
494 | rcu_idle_exit_common(rdtp, oldval); |
495 | local_irq_restore(flags); | |
496 | } | |
8a2ecf47 | 497 | EXPORT_SYMBOL_GPL(rcu_idle_exit); |
9b2e4f18 PM |
498 | |
499 | /** | |
500 | * rcu_irq_enter - inform RCU that current CPU is entering irq away from idle | |
501 | * | |
502 | * Enter an interrupt handler, which might possibly result in exiting | |
503 | * idle mode, in other words, entering the mode in which read-side critical | |
504 | * sections can occur. | |
505 | * | |
506 | * Note that the Linux kernel is fully capable of entering an interrupt | |
507 | * handler that it never exits, for example when doing upcalls to | |
508 | * user mode! This code assumes that the idle loop never does upcalls to | |
509 | * user mode. If your architecture does do upcalls from the idle loop (or | |
510 | * does anything else that results in unbalanced calls to the irq_enter() | |
511 | * and irq_exit() functions), RCU will give you what you deserve, good | |
512 | * and hard. But very infrequently and irreproducibly. | |
513 | * | |
514 | * Use things like work queues to work around this limitation. | |
515 | * | |
516 | * You have been warned. | |
517 | */ | |
518 | void rcu_irq_enter(void) | |
519 | { | |
520 | unsigned long flags; | |
521 | struct rcu_dynticks *rdtp; | |
522 | long long oldval; | |
523 | ||
524 | local_irq_save(flags); | |
525 | rdtp = &__get_cpu_var(rcu_dynticks); | |
526 | oldval = rdtp->dynticks_nesting; | |
527 | rdtp->dynticks_nesting++; | |
528 | WARN_ON_ONCE(rdtp->dynticks_nesting == 0); | |
b6fc6020 FW |
529 | if (oldval) |
530 | trace_rcu_dyntick("++=", oldval, rdtp->dynticks_nesting); | |
531 | else | |
532 | rcu_idle_exit_common(rdtp, oldval); | |
64db4cff | 533 | local_irq_restore(flags); |
64db4cff PM |
534 | } |
535 | ||
536 | /** | |
537 | * rcu_nmi_enter - inform RCU of entry to NMI context | |
538 | * | |
539 | * If the CPU was idle with dynamic ticks active, and there is no | |
540 | * irq handler running, this updates rdtp->dynticks_nmi to let the | |
541 | * RCU grace-period handling know that the CPU is active. | |
542 | */ | |
543 | void rcu_nmi_enter(void) | |
544 | { | |
545 | struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks); | |
546 | ||
23b5c8fa PM |
547 | if (rdtp->dynticks_nmi_nesting == 0 && |
548 | (atomic_read(&rdtp->dynticks) & 0x1)) | |
64db4cff | 549 | return; |
23b5c8fa PM |
550 | rdtp->dynticks_nmi_nesting++; |
551 | smp_mb__before_atomic_inc(); /* Force delay from prior write. */ | |
552 | atomic_inc(&rdtp->dynticks); | |
553 | /* CPUs seeing atomic_inc() must see later RCU read-side crit sects */ | |
554 | smp_mb__after_atomic_inc(); /* See above. */ | |
555 | WARN_ON_ONCE(!(atomic_read(&rdtp->dynticks) & 0x1)); | |
64db4cff PM |
556 | } |
557 | ||
558 | /** | |
559 | * rcu_nmi_exit - inform RCU of exit from NMI context | |
560 | * | |
561 | * If the CPU was idle with dynamic ticks active, and there is no | |
562 | * irq handler running, this updates rdtp->dynticks_nmi to let the | |
563 | * RCU grace-period handling know that the CPU is no longer active. | |
564 | */ | |
565 | void rcu_nmi_exit(void) | |
566 | { | |
567 | struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks); | |
568 | ||
23b5c8fa PM |
569 | if (rdtp->dynticks_nmi_nesting == 0 || |
570 | --rdtp->dynticks_nmi_nesting != 0) | |
64db4cff | 571 | return; |
23b5c8fa PM |
572 | /* CPUs seeing atomic_inc() must see prior RCU read-side crit sects */ |
573 | smp_mb__before_atomic_inc(); /* See above. */ | |
574 | atomic_inc(&rdtp->dynticks); | |
575 | smp_mb__after_atomic_inc(); /* Force delay to next write. */ | |
576 | WARN_ON_ONCE(atomic_read(&rdtp->dynticks) & 0x1); | |
64db4cff PM |
577 | } |
578 | ||
9b2e4f18 PM |
579 | #ifdef CONFIG_PROVE_RCU |
580 | ||
64db4cff | 581 | /** |
9b2e4f18 | 582 | * rcu_is_cpu_idle - see if RCU thinks that the current CPU is idle |
64db4cff | 583 | * |
9b2e4f18 | 584 | * If the current CPU is in its idle loop and is neither in an interrupt |
34240697 | 585 | * or NMI handler, return true. |
64db4cff | 586 | */ |
9b2e4f18 | 587 | int rcu_is_cpu_idle(void) |
64db4cff | 588 | { |
34240697 PM |
589 | int ret; |
590 | ||
591 | preempt_disable(); | |
592 | ret = (atomic_read(&__get_cpu_var(rcu_dynticks).dynticks) & 0x1) == 0; | |
593 | preempt_enable(); | |
594 | return ret; | |
64db4cff | 595 | } |
e6b80a3b | 596 | EXPORT_SYMBOL(rcu_is_cpu_idle); |
64db4cff | 597 | |
c0d6d01b PM |
598 | #ifdef CONFIG_HOTPLUG_CPU |
599 | ||
600 | /* | |
601 | * Is the current CPU online? Disable preemption to avoid false positives | |
602 | * that could otherwise happen due to the current CPU number being sampled, | |
603 | * this task being preempted, its old CPU being taken offline, resuming | |
604 | * on some other CPU, then determining that its old CPU is now offline. | |
605 | * It is OK to use RCU on an offline processor during initial boot, hence | |
2036d94a PM |
606 | * the check for rcu_scheduler_fully_active. Note also that it is OK |
607 | * for a CPU coming online to use RCU for one jiffy prior to marking itself | |
608 | * online in the cpu_online_mask. Similarly, it is OK for a CPU going | |
609 | * offline to continue to use RCU for one jiffy after marking itself | |
610 | * offline in the cpu_online_mask. This leniency is necessary given the | |
611 | * non-atomic nature of the online and offline processing, for example, | |
612 | * the fact that a CPU enters the scheduler after completing the CPU_DYING | |
613 | * notifiers. | |
614 | * | |
615 | * This is also why RCU internally marks CPUs online during the | |
616 | * CPU_UP_PREPARE phase and offline during the CPU_DEAD phase. | |
c0d6d01b PM |
617 | * |
618 | * Disable checking if in an NMI handler because we cannot safely report | |
619 | * errors from NMI handlers anyway. | |
620 | */ | |
621 | bool rcu_lockdep_current_cpu_online(void) | |
622 | { | |
2036d94a PM |
623 | struct rcu_data *rdp; |
624 | struct rcu_node *rnp; | |
c0d6d01b PM |
625 | bool ret; |
626 | ||
627 | if (in_nmi()) | |
628 | return 1; | |
629 | preempt_disable(); | |
2036d94a PM |
630 | rdp = &__get_cpu_var(rcu_sched_data); |
631 | rnp = rdp->mynode; | |
632 | ret = (rdp->grpmask & rnp->qsmaskinit) || | |
c0d6d01b PM |
633 | !rcu_scheduler_fully_active; |
634 | preempt_enable(); | |
635 | return ret; | |
636 | } | |
637 | EXPORT_SYMBOL_GPL(rcu_lockdep_current_cpu_online); | |
638 | ||
639 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ | |
640 | ||
9b2e4f18 PM |
641 | #endif /* #ifdef CONFIG_PROVE_RCU */ |
642 | ||
64db4cff | 643 | /** |
9b2e4f18 | 644 | * rcu_is_cpu_rrupt_from_idle - see if idle or immediately interrupted from idle |
64db4cff | 645 | * |
9b2e4f18 PM |
646 | * If the current CPU is idle or running at a first-level (not nested) |
647 | * interrupt from idle, return true. The caller must have at least | |
648 | * disabled preemption. | |
64db4cff | 649 | */ |
9b2e4f18 | 650 | int rcu_is_cpu_rrupt_from_idle(void) |
64db4cff | 651 | { |
9b2e4f18 | 652 | return __get_cpu_var(rcu_dynticks).dynticks_nesting <= 1; |
64db4cff PM |
653 | } |
654 | ||
64db4cff PM |
655 | /* |
656 | * Snapshot the specified CPU's dynticks counter so that we can later | |
657 | * credit them with an implicit quiescent state. Return 1 if this CPU | |
1eba8f84 | 658 | * is in dynticks idle mode, which is an extended quiescent state. |
64db4cff PM |
659 | */ |
660 | static int dyntick_save_progress_counter(struct rcu_data *rdp) | |
661 | { | |
23b5c8fa | 662 | rdp->dynticks_snap = atomic_add_return(0, &rdp->dynticks->dynticks); |
f0e7c19d | 663 | return (rdp->dynticks_snap & 0x1) == 0; |
64db4cff PM |
664 | } |
665 | ||
666 | /* | |
667 | * Return true if the specified CPU has passed through a quiescent | |
668 | * state by virtue of being in or having passed through an dynticks | |
669 | * idle state since the last call to dyntick_save_progress_counter() | |
670 | * for this same CPU. | |
671 | */ | |
672 | static int rcu_implicit_dynticks_qs(struct rcu_data *rdp) | |
673 | { | |
7eb4f455 PM |
674 | unsigned int curr; |
675 | unsigned int snap; | |
64db4cff | 676 | |
7eb4f455 PM |
677 | curr = (unsigned int)atomic_add_return(0, &rdp->dynticks->dynticks); |
678 | snap = (unsigned int)rdp->dynticks_snap; | |
64db4cff PM |
679 | |
680 | /* | |
681 | * If the CPU passed through or entered a dynticks idle phase with | |
682 | * no active irq/NMI handlers, then we can safely pretend that the CPU | |
683 | * already acknowledged the request to pass through a quiescent | |
684 | * state. Either way, that CPU cannot possibly be in an RCU | |
685 | * read-side critical section that started before the beginning | |
686 | * of the current RCU grace period. | |
687 | */ | |
7eb4f455 | 688 | if ((curr & 0x1) == 0 || UINT_CMP_GE(curr, snap + 2)) { |
d4c08f2a | 689 | trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, "dti"); |
64db4cff PM |
690 | rdp->dynticks_fqs++; |
691 | return 1; | |
692 | } | |
693 | ||
694 | /* Go check for the CPU being offline. */ | |
695 | return rcu_implicit_offline_qs(rdp); | |
696 | } | |
697 | ||
13cfcca0 PM |
698 | static int jiffies_till_stall_check(void) |
699 | { | |
700 | int till_stall_check = ACCESS_ONCE(rcu_cpu_stall_timeout); | |
701 | ||
702 | /* | |
703 | * Limit check must be consistent with the Kconfig limits | |
704 | * for CONFIG_RCU_CPU_STALL_TIMEOUT. | |
705 | */ | |
706 | if (till_stall_check < 3) { | |
707 | ACCESS_ONCE(rcu_cpu_stall_timeout) = 3; | |
708 | till_stall_check = 3; | |
709 | } else if (till_stall_check > 300) { | |
710 | ACCESS_ONCE(rcu_cpu_stall_timeout) = 300; | |
711 | till_stall_check = 300; | |
712 | } | |
713 | return till_stall_check * HZ + RCU_STALL_DELAY_DELTA; | |
714 | } | |
715 | ||
64db4cff PM |
716 | static void record_gp_stall_check_time(struct rcu_state *rsp) |
717 | { | |
718 | rsp->gp_start = jiffies; | |
13cfcca0 | 719 | rsp->jiffies_stall = jiffies + jiffies_till_stall_check(); |
64db4cff PM |
720 | } |
721 | ||
722 | static void print_other_cpu_stall(struct rcu_state *rsp) | |
723 | { | |
724 | int cpu; | |
725 | long delta; | |
726 | unsigned long flags; | |
9bc8b558 | 727 | int ndetected; |
64db4cff | 728 | struct rcu_node *rnp = rcu_get_root(rsp); |
64db4cff PM |
729 | |
730 | /* Only let one CPU complain about others per time interval. */ | |
731 | ||
1304afb2 | 732 | raw_spin_lock_irqsave(&rnp->lock, flags); |
64db4cff | 733 | delta = jiffies - rsp->jiffies_stall; |
fc2219d4 | 734 | if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) { |
1304afb2 | 735 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
736 | return; |
737 | } | |
13cfcca0 | 738 | rsp->jiffies_stall = jiffies + 3 * jiffies_till_stall_check() + 3; |
1304afb2 | 739 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff | 740 | |
8cdd32a9 PM |
741 | /* |
742 | * OK, time to rat on our buddy... | |
743 | * See Documentation/RCU/stallwarn.txt for info on how to debug | |
744 | * RCU CPU stall warnings. | |
745 | */ | |
a858af28 | 746 | printk(KERN_ERR "INFO: %s detected stalls on CPUs/tasks:", |
4300aa64 | 747 | rsp->name); |
a858af28 | 748 | print_cpu_stall_info_begin(); |
a0b6c9a7 | 749 | rcu_for_each_leaf_node(rsp, rnp) { |
3acd9eb3 | 750 | raw_spin_lock_irqsave(&rnp->lock, flags); |
9bc8b558 | 751 | ndetected += rcu_print_task_stall(rnp); |
3acd9eb3 | 752 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
a0b6c9a7 | 753 | if (rnp->qsmask == 0) |
64db4cff | 754 | continue; |
a0b6c9a7 | 755 | for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++) |
9bc8b558 | 756 | if (rnp->qsmask & (1UL << cpu)) { |
a858af28 | 757 | print_cpu_stall_info(rsp, rnp->grplo + cpu); |
9bc8b558 PM |
758 | ndetected++; |
759 | } | |
64db4cff | 760 | } |
a858af28 PM |
761 | |
762 | /* | |
763 | * Now rat on any tasks that got kicked up to the root rcu_node | |
764 | * due to CPU offlining. | |
765 | */ | |
766 | rnp = rcu_get_root(rsp); | |
767 | raw_spin_lock_irqsave(&rnp->lock, flags); | |
768 | ndetected = rcu_print_task_stall(rnp); | |
769 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | |
770 | ||
771 | print_cpu_stall_info_end(); | |
772 | printk(KERN_CONT "(detected by %d, t=%ld jiffies)\n", | |
64db4cff | 773 | smp_processor_id(), (long)(jiffies - rsp->gp_start)); |
9bc8b558 PM |
774 | if (ndetected == 0) |
775 | printk(KERN_ERR "INFO: Stall ended before state dump start\n"); | |
776 | else if (!trigger_all_cpu_backtrace()) | |
4627e240 | 777 | dump_stack(); |
c1dc0b9c | 778 | |
1ed509a2 PM |
779 | /* If so configured, complain about tasks blocking the grace period. */ |
780 | ||
781 | rcu_print_detail_task_stall(rsp); | |
782 | ||
64db4cff PM |
783 | force_quiescent_state(rsp, 0); /* Kick them all. */ |
784 | } | |
785 | ||
786 | static void print_cpu_stall(struct rcu_state *rsp) | |
787 | { | |
788 | unsigned long flags; | |
789 | struct rcu_node *rnp = rcu_get_root(rsp); | |
790 | ||
8cdd32a9 PM |
791 | /* |
792 | * OK, time to rat on ourselves... | |
793 | * See Documentation/RCU/stallwarn.txt for info on how to debug | |
794 | * RCU CPU stall warnings. | |
795 | */ | |
a858af28 PM |
796 | printk(KERN_ERR "INFO: %s self-detected stall on CPU", rsp->name); |
797 | print_cpu_stall_info_begin(); | |
798 | print_cpu_stall_info(rsp, smp_processor_id()); | |
799 | print_cpu_stall_info_end(); | |
800 | printk(KERN_CONT " (t=%lu jiffies)\n", jiffies - rsp->gp_start); | |
4627e240 PM |
801 | if (!trigger_all_cpu_backtrace()) |
802 | dump_stack(); | |
c1dc0b9c | 803 | |
1304afb2 | 804 | raw_spin_lock_irqsave(&rnp->lock, flags); |
20133cfc | 805 | if (ULONG_CMP_GE(jiffies, rsp->jiffies_stall)) |
13cfcca0 PM |
806 | rsp->jiffies_stall = jiffies + |
807 | 3 * jiffies_till_stall_check() + 3; | |
1304afb2 | 808 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
c1dc0b9c | 809 | |
64db4cff PM |
810 | set_need_resched(); /* kick ourselves to get things going. */ |
811 | } | |
812 | ||
813 | static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp) | |
814 | { | |
bad6e139 PM |
815 | unsigned long j; |
816 | unsigned long js; | |
64db4cff PM |
817 | struct rcu_node *rnp; |
818 | ||
742734ee | 819 | if (rcu_cpu_stall_suppress) |
c68de209 | 820 | return; |
bad6e139 PM |
821 | j = ACCESS_ONCE(jiffies); |
822 | js = ACCESS_ONCE(rsp->jiffies_stall); | |
64db4cff | 823 | rnp = rdp->mynode; |
bad6e139 | 824 | if ((ACCESS_ONCE(rnp->qsmask) & rdp->grpmask) && ULONG_CMP_GE(j, js)) { |
64db4cff PM |
825 | |
826 | /* We haven't checked in, so go dump stack. */ | |
827 | print_cpu_stall(rsp); | |
828 | ||
bad6e139 PM |
829 | } else if (rcu_gp_in_progress(rsp) && |
830 | ULONG_CMP_GE(j, js + RCU_STALL_RAT_DELAY)) { | |
64db4cff | 831 | |
bad6e139 | 832 | /* They had a few time units to dump stack, so complain. */ |
64db4cff PM |
833 | print_other_cpu_stall(rsp); |
834 | } | |
835 | } | |
836 | ||
c68de209 PM |
837 | static int rcu_panic(struct notifier_block *this, unsigned long ev, void *ptr) |
838 | { | |
742734ee | 839 | rcu_cpu_stall_suppress = 1; |
c68de209 PM |
840 | return NOTIFY_DONE; |
841 | } | |
842 | ||
53d84e00 PM |
843 | /** |
844 | * rcu_cpu_stall_reset - prevent further stall warnings in current grace period | |
845 | * | |
846 | * Set the stall-warning timeout way off into the future, thus preventing | |
847 | * any RCU CPU stall-warning messages from appearing in the current set of | |
848 | * RCU grace periods. | |
849 | * | |
850 | * The caller must disable hard irqs. | |
851 | */ | |
852 | void rcu_cpu_stall_reset(void) | |
853 | { | |
854 | rcu_sched_state.jiffies_stall = jiffies + ULONG_MAX / 2; | |
855 | rcu_bh_state.jiffies_stall = jiffies + ULONG_MAX / 2; | |
856 | rcu_preempt_stall_reset(); | |
857 | } | |
858 | ||
c68de209 PM |
859 | static struct notifier_block rcu_panic_block = { |
860 | .notifier_call = rcu_panic, | |
861 | }; | |
862 | ||
863 | static void __init check_cpu_stall_init(void) | |
864 | { | |
865 | atomic_notifier_chain_register(&panic_notifier_list, &rcu_panic_block); | |
866 | } | |
867 | ||
64db4cff PM |
868 | /* |
869 | * Update CPU-local rcu_data state to record the newly noticed grace period. | |
870 | * This is used both when we started the grace period and when we notice | |
9160306e PM |
871 | * that someone else started the grace period. The caller must hold the |
872 | * ->lock of the leaf rcu_node structure corresponding to the current CPU, | |
873 | * and must have irqs disabled. | |
64db4cff | 874 | */ |
9160306e PM |
875 | static void __note_new_gpnum(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp) |
876 | { | |
877 | if (rdp->gpnum != rnp->gpnum) { | |
121dfc4b PM |
878 | /* |
879 | * If the current grace period is waiting for this CPU, | |
880 | * set up to detect a quiescent state, otherwise don't | |
881 | * go looking for one. | |
882 | */ | |
9160306e | 883 | rdp->gpnum = rnp->gpnum; |
d4c08f2a | 884 | trace_rcu_grace_period(rsp->name, rdp->gpnum, "cpustart"); |
121dfc4b PM |
885 | if (rnp->qsmask & rdp->grpmask) { |
886 | rdp->qs_pending = 1; | |
e4cc1f22 | 887 | rdp->passed_quiesce = 0; |
121dfc4b PM |
888 | } else |
889 | rdp->qs_pending = 0; | |
a858af28 | 890 | zero_cpu_stall_ticks(rdp); |
9160306e PM |
891 | } |
892 | } | |
893 | ||
64db4cff PM |
894 | static void note_new_gpnum(struct rcu_state *rsp, struct rcu_data *rdp) |
895 | { | |
9160306e PM |
896 | unsigned long flags; |
897 | struct rcu_node *rnp; | |
898 | ||
899 | local_irq_save(flags); | |
900 | rnp = rdp->mynode; | |
901 | if (rdp->gpnum == ACCESS_ONCE(rnp->gpnum) || /* outside lock. */ | |
1304afb2 | 902 | !raw_spin_trylock(&rnp->lock)) { /* irqs already off, so later. */ |
9160306e PM |
903 | local_irq_restore(flags); |
904 | return; | |
905 | } | |
906 | __note_new_gpnum(rsp, rnp, rdp); | |
1304afb2 | 907 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
908 | } |
909 | ||
910 | /* | |
911 | * Did someone else start a new RCU grace period start since we last | |
912 | * checked? Update local state appropriately if so. Must be called | |
913 | * on the CPU corresponding to rdp. | |
914 | */ | |
915 | static int | |
916 | check_for_new_grace_period(struct rcu_state *rsp, struct rcu_data *rdp) | |
917 | { | |
918 | unsigned long flags; | |
919 | int ret = 0; | |
920 | ||
921 | local_irq_save(flags); | |
922 | if (rdp->gpnum != rsp->gpnum) { | |
923 | note_new_gpnum(rsp, rdp); | |
924 | ret = 1; | |
925 | } | |
926 | local_irq_restore(flags); | |
927 | return ret; | |
928 | } | |
929 | ||
d09b62df PM |
930 | /* |
931 | * Advance this CPU's callbacks, but only if the current grace period | |
932 | * has ended. This may be called only from the CPU to whom the rdp | |
933 | * belongs. In addition, the corresponding leaf rcu_node structure's | |
934 | * ->lock must be held by the caller, with irqs disabled. | |
935 | */ | |
936 | static void | |
937 | __rcu_process_gp_end(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp) | |
938 | { | |
939 | /* Did another grace period end? */ | |
940 | if (rdp->completed != rnp->completed) { | |
941 | ||
942 | /* Advance callbacks. No harm if list empty. */ | |
943 | rdp->nxttail[RCU_DONE_TAIL] = rdp->nxttail[RCU_WAIT_TAIL]; | |
944 | rdp->nxttail[RCU_WAIT_TAIL] = rdp->nxttail[RCU_NEXT_READY_TAIL]; | |
945 | rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; | |
946 | ||
947 | /* Remember that we saw this grace-period completion. */ | |
948 | rdp->completed = rnp->completed; | |
d4c08f2a | 949 | trace_rcu_grace_period(rsp->name, rdp->gpnum, "cpuend"); |
20377f32 | 950 | |
5ff8e6f0 FW |
951 | /* |
952 | * If we were in an extended quiescent state, we may have | |
121dfc4b | 953 | * missed some grace periods that others CPUs handled on |
5ff8e6f0 | 954 | * our behalf. Catch up with this state to avoid noting |
121dfc4b PM |
955 | * spurious new grace periods. If another grace period |
956 | * has started, then rnp->gpnum will have advanced, so | |
957 | * we will detect this later on. | |
5ff8e6f0 | 958 | */ |
121dfc4b | 959 | if (ULONG_CMP_LT(rdp->gpnum, rdp->completed)) |
5ff8e6f0 FW |
960 | rdp->gpnum = rdp->completed; |
961 | ||
20377f32 | 962 | /* |
121dfc4b PM |
963 | * If RCU does not need a quiescent state from this CPU, |
964 | * then make sure that this CPU doesn't go looking for one. | |
20377f32 | 965 | */ |
121dfc4b | 966 | if ((rnp->qsmask & rdp->grpmask) == 0) |
20377f32 | 967 | rdp->qs_pending = 0; |
d09b62df PM |
968 | } |
969 | } | |
970 | ||
971 | /* | |
972 | * Advance this CPU's callbacks, but only if the current grace period | |
973 | * has ended. This may be called only from the CPU to whom the rdp | |
974 | * belongs. | |
975 | */ | |
976 | static void | |
977 | rcu_process_gp_end(struct rcu_state *rsp, struct rcu_data *rdp) | |
978 | { | |
979 | unsigned long flags; | |
980 | struct rcu_node *rnp; | |
981 | ||
982 | local_irq_save(flags); | |
983 | rnp = rdp->mynode; | |
984 | if (rdp->completed == ACCESS_ONCE(rnp->completed) || /* outside lock. */ | |
1304afb2 | 985 | !raw_spin_trylock(&rnp->lock)) { /* irqs already off, so later. */ |
d09b62df PM |
986 | local_irq_restore(flags); |
987 | return; | |
988 | } | |
989 | __rcu_process_gp_end(rsp, rnp, rdp); | |
1304afb2 | 990 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
d09b62df PM |
991 | } |
992 | ||
993 | /* | |
994 | * Do per-CPU grace-period initialization for running CPU. The caller | |
995 | * must hold the lock of the leaf rcu_node structure corresponding to | |
996 | * this CPU. | |
997 | */ | |
998 | static void | |
999 | rcu_start_gp_per_cpu(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp) | |
1000 | { | |
1001 | /* Prior grace period ended, so advance callbacks for current CPU. */ | |
1002 | __rcu_process_gp_end(rsp, rnp, rdp); | |
1003 | ||
1004 | /* | |
1005 | * Because this CPU just now started the new grace period, we know | |
1006 | * that all of its callbacks will be covered by this upcoming grace | |
1007 | * period, even the ones that were registered arbitrarily recently. | |
1008 | * Therefore, advance all outstanding callbacks to RCU_WAIT_TAIL. | |
1009 | * | |
1010 | * Other CPUs cannot be sure exactly when the grace period started. | |
1011 | * Therefore, their recently registered callbacks must pass through | |
1012 | * an additional RCU_NEXT_READY stage, so that they will be handled | |
1013 | * by the next RCU grace period. | |
1014 | */ | |
1015 | rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; | |
1016 | rdp->nxttail[RCU_WAIT_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; | |
9160306e PM |
1017 | |
1018 | /* Set state so that this CPU will detect the next quiescent state. */ | |
1019 | __note_new_gpnum(rsp, rnp, rdp); | |
d09b62df PM |
1020 | } |
1021 | ||
64db4cff PM |
1022 | /* |
1023 | * Start a new RCU grace period if warranted, re-initializing the hierarchy | |
1024 | * in preparation for detecting the next grace period. The caller must hold | |
1025 | * the root node's ->lock, which is released before return. Hard irqs must | |
1026 | * be disabled. | |
e5601400 PM |
1027 | * |
1028 | * Note that it is legal for a dying CPU (which is marked as offline) to | |
1029 | * invoke this function. This can happen when the dying CPU reports its | |
1030 | * quiescent state. | |
64db4cff PM |
1031 | */ |
1032 | static void | |
1033 | rcu_start_gp(struct rcu_state *rsp, unsigned long flags) | |
1034 | __releases(rcu_get_root(rsp)->lock) | |
1035 | { | |
394f99a9 | 1036 | struct rcu_data *rdp = this_cpu_ptr(rsp->rda); |
64db4cff | 1037 | struct rcu_node *rnp = rcu_get_root(rsp); |
64db4cff | 1038 | |
037067a1 | 1039 | if (!rcu_scheduler_fully_active || |
afe24b12 PM |
1040 | !cpu_needs_another_gp(rsp, rdp)) { |
1041 | /* | |
1042 | * Either the scheduler hasn't yet spawned the first | |
1043 | * non-idle task or this CPU does not need another | |
1044 | * grace period. Either way, don't start a new grace | |
1045 | * period. | |
1046 | */ | |
1047 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | |
1048 | return; | |
1049 | } | |
b32e9eb6 | 1050 | |
afe24b12 | 1051 | if (rsp->fqs_active) { |
b32e9eb6 | 1052 | /* |
afe24b12 PM |
1053 | * This CPU needs a grace period, but force_quiescent_state() |
1054 | * is running. Tell it to start one on this CPU's behalf. | |
b32e9eb6 | 1055 | */ |
afe24b12 PM |
1056 | rsp->fqs_need_gp = 1; |
1057 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | |
64db4cff PM |
1058 | return; |
1059 | } | |
1060 | ||
1061 | /* Advance to a new grace period and initialize state. */ | |
1062 | rsp->gpnum++; | |
d4c08f2a | 1063 | trace_rcu_grace_period(rsp->name, rsp->gpnum, "start"); |
af446b70 PM |
1064 | WARN_ON_ONCE(rsp->fqs_state == RCU_GP_INIT); |
1065 | rsp->fqs_state = RCU_GP_INIT; /* Hold off force_quiescent_state. */ | |
64db4cff | 1066 | rsp->jiffies_force_qs = jiffies + RCU_JIFFIES_TILL_FORCE_QS; |
64db4cff | 1067 | record_gp_stall_check_time(rsp); |
1304afb2 | 1068 | raw_spin_unlock(&rnp->lock); /* leave irqs disabled. */ |
64db4cff | 1069 | |
64db4cff | 1070 | /* Exclude any concurrent CPU-hotplug operations. */ |
1304afb2 | 1071 | raw_spin_lock(&rsp->onofflock); /* irqs already disabled. */ |
64db4cff PM |
1072 | |
1073 | /* | |
b835db1f PM |
1074 | * Set the quiescent-state-needed bits in all the rcu_node |
1075 | * structures for all currently online CPUs in breadth-first | |
1076 | * order, starting from the root rcu_node structure. This | |
1077 | * operation relies on the layout of the hierarchy within the | |
1078 | * rsp->node[] array. Note that other CPUs will access only | |
1079 | * the leaves of the hierarchy, which still indicate that no | |
1080 | * grace period is in progress, at least until the corresponding | |
1081 | * leaf node has been initialized. In addition, we have excluded | |
1082 | * CPU-hotplug operations. | |
64db4cff PM |
1083 | * |
1084 | * Note that the grace period cannot complete until we finish | |
1085 | * the initialization process, as there will be at least one | |
1086 | * qsmask bit set in the root node until that time, namely the | |
b835db1f PM |
1087 | * one corresponding to this CPU, due to the fact that we have |
1088 | * irqs disabled. | |
64db4cff | 1089 | */ |
a0b6c9a7 | 1090 | rcu_for_each_node_breadth_first(rsp, rnp) { |
1304afb2 | 1091 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
b0e165c0 | 1092 | rcu_preempt_check_blocked_tasks(rnp); |
49e29126 | 1093 | rnp->qsmask = rnp->qsmaskinit; |
de078d87 | 1094 | rnp->gpnum = rsp->gpnum; |
d09b62df PM |
1095 | rnp->completed = rsp->completed; |
1096 | if (rnp == rdp->mynode) | |
1097 | rcu_start_gp_per_cpu(rsp, rnp, rdp); | |
27f4d280 | 1098 | rcu_preempt_boost_start_gp(rnp); |
d4c08f2a PM |
1099 | trace_rcu_grace_period_init(rsp->name, rnp->gpnum, |
1100 | rnp->level, rnp->grplo, | |
1101 | rnp->grphi, rnp->qsmask); | |
1304afb2 | 1102 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
64db4cff PM |
1103 | } |
1104 | ||
83f5b01f | 1105 | rnp = rcu_get_root(rsp); |
1304afb2 | 1106 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
af446b70 | 1107 | rsp->fqs_state = RCU_SIGNAL_INIT; /* force_quiescent_state now OK. */ |
1304afb2 PM |
1108 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
1109 | raw_spin_unlock_irqrestore(&rsp->onofflock, flags); | |
64db4cff PM |
1110 | } |
1111 | ||
f41d911f | 1112 | /* |
d3f6bad3 PM |
1113 | * Report a full set of quiescent states to the specified rcu_state |
1114 | * data structure. This involves cleaning up after the prior grace | |
1115 | * period and letting rcu_start_gp() start up the next grace period | |
1116 | * if one is needed. Note that the caller must hold rnp->lock, as | |
1117 | * required by rcu_start_gp(), which will release it. | |
f41d911f | 1118 | */ |
d3f6bad3 | 1119 | static void rcu_report_qs_rsp(struct rcu_state *rsp, unsigned long flags) |
fc2219d4 | 1120 | __releases(rcu_get_root(rsp)->lock) |
f41d911f | 1121 | { |
15ba0ba8 | 1122 | unsigned long gp_duration; |
afe24b12 PM |
1123 | struct rcu_node *rnp = rcu_get_root(rsp); |
1124 | struct rcu_data *rdp = this_cpu_ptr(rsp->rda); | |
15ba0ba8 | 1125 | |
fc2219d4 | 1126 | WARN_ON_ONCE(!rcu_gp_in_progress(rsp)); |
0bbcc529 PM |
1127 | |
1128 | /* | |
1129 | * Ensure that all grace-period and pre-grace-period activity | |
1130 | * is seen before the assignment to rsp->completed. | |
1131 | */ | |
1132 | smp_mb(); /* See above block comment. */ | |
15ba0ba8 PM |
1133 | gp_duration = jiffies - rsp->gp_start; |
1134 | if (gp_duration > rsp->gp_max) | |
1135 | rsp->gp_max = gp_duration; | |
afe24b12 PM |
1136 | |
1137 | /* | |
1138 | * We know the grace period is complete, but to everyone else | |
1139 | * it appears to still be ongoing. But it is also the case | |
1140 | * that to everyone else it looks like there is nothing that | |
1141 | * they can do to advance the grace period. It is therefore | |
1142 | * safe for us to drop the lock in order to mark the grace | |
1143 | * period as completed in all of the rcu_node structures. | |
1144 | * | |
1145 | * But if this CPU needs another grace period, it will take | |
1146 | * care of this while initializing the next grace period. | |
1147 | * We use RCU_WAIT_TAIL instead of the usual RCU_DONE_TAIL | |
1148 | * because the callbacks have not yet been advanced: Those | |
1149 | * callbacks are waiting on the grace period that just now | |
1150 | * completed. | |
1151 | */ | |
1152 | if (*rdp->nxttail[RCU_WAIT_TAIL] == NULL) { | |
1153 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ | |
1154 | ||
1155 | /* | |
1156 | * Propagate new ->completed value to rcu_node structures | |
1157 | * so that other CPUs don't have to wait until the start | |
1158 | * of the next grace period to process their callbacks. | |
1159 | */ | |
1160 | rcu_for_each_node_breadth_first(rsp, rnp) { | |
1161 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ | |
1162 | rnp->completed = rsp->gpnum; | |
1163 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ | |
1164 | } | |
1165 | rnp = rcu_get_root(rsp); | |
1166 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ | |
1167 | } | |
1168 | ||
1169 | rsp->completed = rsp->gpnum; /* Declare the grace period complete. */ | |
d4c08f2a | 1170 | trace_rcu_grace_period(rsp->name, rsp->completed, "end"); |
af446b70 | 1171 | rsp->fqs_state = RCU_GP_IDLE; |
f41d911f PM |
1172 | rcu_start_gp(rsp, flags); /* releases root node's rnp->lock. */ |
1173 | } | |
1174 | ||
64db4cff | 1175 | /* |
d3f6bad3 PM |
1176 | * Similar to rcu_report_qs_rdp(), for which it is a helper function. |
1177 | * Allows quiescent states for a group of CPUs to be reported at one go | |
1178 | * to the specified rcu_node structure, though all the CPUs in the group | |
1179 | * must be represented by the same rcu_node structure (which need not be | |
1180 | * a leaf rcu_node structure, though it often will be). That structure's | |
1181 | * lock must be held upon entry, and it is released before return. | |
64db4cff PM |
1182 | */ |
1183 | static void | |
d3f6bad3 PM |
1184 | rcu_report_qs_rnp(unsigned long mask, struct rcu_state *rsp, |
1185 | struct rcu_node *rnp, unsigned long flags) | |
64db4cff PM |
1186 | __releases(rnp->lock) |
1187 | { | |
28ecd580 PM |
1188 | struct rcu_node *rnp_c; |
1189 | ||
64db4cff PM |
1190 | /* Walk up the rcu_node hierarchy. */ |
1191 | for (;;) { | |
1192 | if (!(rnp->qsmask & mask)) { | |
1193 | ||
1194 | /* Our bit has already been cleared, so done. */ | |
1304afb2 | 1195 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
1196 | return; |
1197 | } | |
1198 | rnp->qsmask &= ~mask; | |
d4c08f2a PM |
1199 | trace_rcu_quiescent_state_report(rsp->name, rnp->gpnum, |
1200 | mask, rnp->qsmask, rnp->level, | |
1201 | rnp->grplo, rnp->grphi, | |
1202 | !!rnp->gp_tasks); | |
27f4d280 | 1203 | if (rnp->qsmask != 0 || rcu_preempt_blocked_readers_cgp(rnp)) { |
64db4cff PM |
1204 | |
1205 | /* Other bits still set at this level, so done. */ | |
1304afb2 | 1206 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
1207 | return; |
1208 | } | |
1209 | mask = rnp->grpmask; | |
1210 | if (rnp->parent == NULL) { | |
1211 | ||
1212 | /* No more levels. Exit loop holding root lock. */ | |
1213 | ||
1214 | break; | |
1215 | } | |
1304afb2 | 1216 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
28ecd580 | 1217 | rnp_c = rnp; |
64db4cff | 1218 | rnp = rnp->parent; |
1304afb2 | 1219 | raw_spin_lock_irqsave(&rnp->lock, flags); |
28ecd580 | 1220 | WARN_ON_ONCE(rnp_c->qsmask); |
64db4cff PM |
1221 | } |
1222 | ||
1223 | /* | |
1224 | * Get here if we are the last CPU to pass through a quiescent | |
d3f6bad3 | 1225 | * state for this grace period. Invoke rcu_report_qs_rsp() |
f41d911f | 1226 | * to clean up and start the next grace period if one is needed. |
64db4cff | 1227 | */ |
d3f6bad3 | 1228 | rcu_report_qs_rsp(rsp, flags); /* releases rnp->lock. */ |
64db4cff PM |
1229 | } |
1230 | ||
1231 | /* | |
d3f6bad3 PM |
1232 | * Record a quiescent state for the specified CPU to that CPU's rcu_data |
1233 | * structure. This must be either called from the specified CPU, or | |
1234 | * called when the specified CPU is known to be offline (and when it is | |
1235 | * also known that no other CPU is concurrently trying to help the offline | |
1236 | * CPU). The lastcomp argument is used to make sure we are still in the | |
1237 | * grace period of interest. We don't want to end the current grace period | |
1238 | * based on quiescent states detected in an earlier grace period! | |
64db4cff PM |
1239 | */ |
1240 | static void | |
e4cc1f22 | 1241 | rcu_report_qs_rdp(int cpu, struct rcu_state *rsp, struct rcu_data *rdp, long lastgp) |
64db4cff PM |
1242 | { |
1243 | unsigned long flags; | |
1244 | unsigned long mask; | |
1245 | struct rcu_node *rnp; | |
1246 | ||
1247 | rnp = rdp->mynode; | |
1304afb2 | 1248 | raw_spin_lock_irqsave(&rnp->lock, flags); |
e4cc1f22 | 1249 | if (lastgp != rnp->gpnum || rnp->completed == rnp->gpnum) { |
64db4cff PM |
1250 | |
1251 | /* | |
e4cc1f22 PM |
1252 | * The grace period in which this quiescent state was |
1253 | * recorded has ended, so don't report it upwards. | |
1254 | * We will instead need a new quiescent state that lies | |
1255 | * within the current grace period. | |
64db4cff | 1256 | */ |
e4cc1f22 | 1257 | rdp->passed_quiesce = 0; /* need qs for new gp. */ |
1304afb2 | 1258 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
1259 | return; |
1260 | } | |
1261 | mask = rdp->grpmask; | |
1262 | if ((rnp->qsmask & mask) == 0) { | |
1304afb2 | 1263 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
1264 | } else { |
1265 | rdp->qs_pending = 0; | |
1266 | ||
1267 | /* | |
1268 | * This GP can't end until cpu checks in, so all of our | |
1269 | * callbacks can be processed during the next GP. | |
1270 | */ | |
64db4cff PM |
1271 | rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; |
1272 | ||
d3f6bad3 | 1273 | rcu_report_qs_rnp(mask, rsp, rnp, flags); /* rlses rnp->lock */ |
64db4cff PM |
1274 | } |
1275 | } | |
1276 | ||
1277 | /* | |
1278 | * Check to see if there is a new grace period of which this CPU | |
1279 | * is not yet aware, and if so, set up local rcu_data state for it. | |
1280 | * Otherwise, see if this CPU has just passed through its first | |
1281 | * quiescent state for this grace period, and record that fact if so. | |
1282 | */ | |
1283 | static void | |
1284 | rcu_check_quiescent_state(struct rcu_state *rsp, struct rcu_data *rdp) | |
1285 | { | |
1286 | /* If there is now a new grace period, record and return. */ | |
1287 | if (check_for_new_grace_period(rsp, rdp)) | |
1288 | return; | |
1289 | ||
1290 | /* | |
1291 | * Does this CPU still need to do its part for current grace period? | |
1292 | * If no, return and let the other CPUs do their part as well. | |
1293 | */ | |
1294 | if (!rdp->qs_pending) | |
1295 | return; | |
1296 | ||
1297 | /* | |
1298 | * Was there a quiescent state since the beginning of the grace | |
1299 | * period? If no, then exit and wait for the next call. | |
1300 | */ | |
e4cc1f22 | 1301 | if (!rdp->passed_quiesce) |
64db4cff PM |
1302 | return; |
1303 | ||
d3f6bad3 PM |
1304 | /* |
1305 | * Tell RCU we are done (but rcu_report_qs_rdp() will be the | |
1306 | * judge of that). | |
1307 | */ | |
e4cc1f22 | 1308 | rcu_report_qs_rdp(rdp->cpu, rsp, rdp, rdp->passed_quiesce_gpnum); |
64db4cff PM |
1309 | } |
1310 | ||
1311 | #ifdef CONFIG_HOTPLUG_CPU | |
1312 | ||
e74f4c45 | 1313 | /* |
29494be7 | 1314 | * Move a dying CPU's RCU callbacks to online CPU's callback list. |
e5601400 PM |
1315 | * Also record a quiescent state for this CPU for the current grace period. |
1316 | * Synchronization and interrupt disabling are not required because | |
1317 | * this function executes in stop_machine() context. Therefore, cleanup | |
1318 | * operations that might block must be done later from the CPU_DEAD | |
1319 | * notifier. | |
1320 | * | |
1321 | * Note that the outgoing CPU's bit has already been cleared in the | |
1322 | * cpu_online_mask. This allows us to randomly pick a callback | |
1323 | * destination from the bits set in that mask. | |
e74f4c45 | 1324 | */ |
e5601400 | 1325 | static void rcu_cleanup_dying_cpu(struct rcu_state *rsp) |
e74f4c45 PM |
1326 | { |
1327 | int i; | |
e5601400 | 1328 | unsigned long mask; |
29494be7 | 1329 | int receive_cpu = cpumask_any(cpu_online_mask); |
394f99a9 | 1330 | struct rcu_data *rdp = this_cpu_ptr(rsp->rda); |
29494be7 | 1331 | struct rcu_data *receive_rdp = per_cpu_ptr(rsp->rda, receive_cpu); |
2036d94a | 1332 | RCU_TRACE(struct rcu_node *rnp = rdp->mynode); /* For dying CPU. */ |
e5601400 | 1333 | |
a50c3af9 PM |
1334 | /* First, adjust the counts. */ |
1335 | if (rdp->nxtlist != NULL) { | |
1336 | receive_rdp->qlen_lazy += rdp->qlen_lazy; | |
1337 | receive_rdp->qlen += rdp->qlen; | |
1338 | rdp->qlen_lazy = 0; | |
1339 | rdp->qlen = 0; | |
1340 | } | |
1341 | ||
1342 | /* | |
1343 | * Next, move ready-to-invoke callbacks to be invoked on some | |
1344 | * other CPU. These will not be required to pass through another | |
1345 | * grace period: They are done, regardless of CPU. | |
1346 | */ | |
1347 | if (rdp->nxtlist != NULL && | |
1348 | rdp->nxttail[RCU_DONE_TAIL] != &rdp->nxtlist) { | |
1349 | struct rcu_head *oldhead; | |
1350 | struct rcu_head **oldtail; | |
1351 | struct rcu_head **newtail; | |
1352 | ||
1353 | oldhead = rdp->nxtlist; | |
1354 | oldtail = receive_rdp->nxttail[RCU_DONE_TAIL]; | |
1355 | rdp->nxtlist = *rdp->nxttail[RCU_DONE_TAIL]; | |
1356 | *rdp->nxttail[RCU_DONE_TAIL] = *oldtail; | |
1357 | *receive_rdp->nxttail[RCU_DONE_TAIL] = oldhead; | |
1358 | newtail = rdp->nxttail[RCU_DONE_TAIL]; | |
1359 | for (i = RCU_DONE_TAIL; i < RCU_NEXT_SIZE; i++) { | |
1360 | if (receive_rdp->nxttail[i] == oldtail) | |
1361 | receive_rdp->nxttail[i] = newtail; | |
1362 | if (rdp->nxttail[i] == newtail) | |
1363 | rdp->nxttail[i] = &rdp->nxtlist; | |
1364 | } | |
1365 | } | |
1366 | ||
1367 | /* | |
1368 | * Finally, put the rest of the callbacks at the end of the list. | |
1369 | * The ones that made it partway through get to start over: We | |
1370 | * cannot assume that grace periods are synchronized across CPUs. | |
1371 | * (We could splice RCU_WAIT_TAIL into RCU_NEXT_READY_TAIL, but | |
1372 | * this does not seem compelling. Not yet, anyway.) | |
1373 | */ | |
e5601400 PM |
1374 | if (rdp->nxtlist != NULL) { |
1375 | *receive_rdp->nxttail[RCU_NEXT_TAIL] = rdp->nxtlist; | |
1376 | receive_rdp->nxttail[RCU_NEXT_TAIL] = | |
1377 | rdp->nxttail[RCU_NEXT_TAIL]; | |
e5601400 PM |
1378 | receive_rdp->n_cbs_adopted += rdp->qlen; |
1379 | rdp->n_cbs_orphaned += rdp->qlen; | |
1380 | ||
1381 | rdp->nxtlist = NULL; | |
1382 | for (i = 0; i < RCU_NEXT_SIZE; i++) | |
1383 | rdp->nxttail[i] = &rdp->nxtlist; | |
e5601400 | 1384 | } |
e74f4c45 | 1385 | |
a50c3af9 PM |
1386 | /* |
1387 | * Record a quiescent state for the dying CPU. This is safe | |
1388 | * only because we have already cleared out the callbacks. | |
1389 | * (Otherwise, the RCU core might try to schedule the invocation | |
1390 | * of callbacks on this now-offline CPU, which would be bad.) | |
1391 | */ | |
64db4cff | 1392 | mask = rdp->grpmask; /* rnp->grplo is constant. */ |
e5601400 PM |
1393 | trace_rcu_grace_period(rsp->name, |
1394 | rnp->gpnum + 1 - !!(rnp->qsmask & mask), | |
1395 | "cpuofl"); | |
1396 | rcu_report_qs_rdp(smp_processor_id(), rsp, rdp, rsp->gpnum); | |
1397 | /* Note that rcu_report_qs_rdp() might call trace_rcu_grace_period(). */ | |
64db4cff PM |
1398 | } |
1399 | ||
1400 | /* | |
e5601400 PM |
1401 | * The CPU has been completely removed, and some other CPU is reporting |
1402 | * this fact from process context. Do the remainder of the cleanup. | |
1403 | * There can only be one CPU hotplug operation at a time, so no other | |
1404 | * CPU can be attempting to update rcu_cpu_kthread_task. | |
64db4cff | 1405 | */ |
e5601400 | 1406 | static void rcu_cleanup_dead_cpu(int cpu, struct rcu_state *rsp) |
64db4cff | 1407 | { |
2036d94a PM |
1408 | unsigned long flags; |
1409 | unsigned long mask; | |
1410 | int need_report = 0; | |
e5601400 | 1411 | struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu); |
2036d94a | 1412 | struct rcu_node *rnp = rdp->mynode; /* Outgoing CPU's rnp. */ |
e5601400 | 1413 | |
2036d94a | 1414 | /* Adjust any no-longer-needed kthreads. */ |
e5601400 PM |
1415 | rcu_stop_cpu_kthread(cpu); |
1416 | rcu_node_kthread_setaffinity(rnp, -1); | |
2036d94a PM |
1417 | |
1418 | /* Remove the dying CPU from the bitmasks in the rcu_node hierarchy. */ | |
1419 | ||
1420 | /* Exclude any attempts to start a new grace period. */ | |
1421 | raw_spin_lock_irqsave(&rsp->onofflock, flags); | |
1422 | ||
1423 | /* Remove the outgoing CPU from the masks in the rcu_node hierarchy. */ | |
1424 | mask = rdp->grpmask; /* rnp->grplo is constant. */ | |
1425 | do { | |
1426 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ | |
1427 | rnp->qsmaskinit &= ~mask; | |
1428 | if (rnp->qsmaskinit != 0) { | |
1429 | if (rnp != rdp->mynode) | |
1430 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ | |
1431 | break; | |
1432 | } | |
1433 | if (rnp == rdp->mynode) | |
1434 | need_report = rcu_preempt_offline_tasks(rsp, rnp, rdp); | |
1435 | else | |
1436 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ | |
1437 | mask = rnp->grpmask; | |
1438 | rnp = rnp->parent; | |
1439 | } while (rnp != NULL); | |
1440 | ||
1441 | /* | |
1442 | * We still hold the leaf rcu_node structure lock here, and | |
1443 | * irqs are still disabled. The reason for this subterfuge is | |
1444 | * because invoking rcu_report_unblock_qs_rnp() with ->onofflock | |
1445 | * held leads to deadlock. | |
1446 | */ | |
1447 | raw_spin_unlock(&rsp->onofflock); /* irqs remain disabled. */ | |
1448 | rnp = rdp->mynode; | |
1449 | if (need_report & RCU_OFL_TASKS_NORM_GP) | |
1450 | rcu_report_unblock_qs_rnp(rnp, flags); | |
1451 | else | |
1452 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | |
1453 | if (need_report & RCU_OFL_TASKS_EXP_GP) | |
1454 | rcu_report_exp_rnp(rsp, rnp, true); | |
64db4cff PM |
1455 | } |
1456 | ||
1457 | #else /* #ifdef CONFIG_HOTPLUG_CPU */ | |
1458 | ||
e5601400 | 1459 | static void rcu_cleanup_dying_cpu(struct rcu_state *rsp) |
e74f4c45 PM |
1460 | { |
1461 | } | |
1462 | ||
e5601400 | 1463 | static void rcu_cleanup_dead_cpu(int cpu, struct rcu_state *rsp) |
64db4cff PM |
1464 | { |
1465 | } | |
1466 | ||
1467 | #endif /* #else #ifdef CONFIG_HOTPLUG_CPU */ | |
1468 | ||
1469 | /* | |
1470 | * Invoke any RCU callbacks that have made it to the end of their grace | |
1471 | * period. Thottle as specified by rdp->blimit. | |
1472 | */ | |
37c72e56 | 1473 | static void rcu_do_batch(struct rcu_state *rsp, struct rcu_data *rdp) |
64db4cff PM |
1474 | { |
1475 | unsigned long flags; | |
1476 | struct rcu_head *next, *list, **tail; | |
486e2593 | 1477 | int bl, count, count_lazy; |
64db4cff PM |
1478 | |
1479 | /* If no callbacks are ready, just return.*/ | |
29c00b4a | 1480 | if (!cpu_has_callbacks_ready_to_invoke(rdp)) { |
486e2593 | 1481 | trace_rcu_batch_start(rsp->name, rdp->qlen_lazy, rdp->qlen, 0); |
4968c300 PM |
1482 | trace_rcu_batch_end(rsp->name, 0, !!ACCESS_ONCE(rdp->nxtlist), |
1483 | need_resched(), is_idle_task(current), | |
1484 | rcu_is_callbacks_kthread()); | |
64db4cff | 1485 | return; |
29c00b4a | 1486 | } |
64db4cff PM |
1487 | |
1488 | /* | |
1489 | * Extract the list of ready callbacks, disabling to prevent | |
1490 | * races with call_rcu() from interrupt handlers. | |
1491 | */ | |
1492 | local_irq_save(flags); | |
8146c4e2 | 1493 | WARN_ON_ONCE(cpu_is_offline(smp_processor_id())); |
29c00b4a | 1494 | bl = rdp->blimit; |
486e2593 | 1495 | trace_rcu_batch_start(rsp->name, rdp->qlen_lazy, rdp->qlen, bl); |
64db4cff PM |
1496 | list = rdp->nxtlist; |
1497 | rdp->nxtlist = *rdp->nxttail[RCU_DONE_TAIL]; | |
1498 | *rdp->nxttail[RCU_DONE_TAIL] = NULL; | |
1499 | tail = rdp->nxttail[RCU_DONE_TAIL]; | |
1500 | for (count = RCU_NEXT_SIZE - 1; count >= 0; count--) | |
1501 | if (rdp->nxttail[count] == rdp->nxttail[RCU_DONE_TAIL]) | |
1502 | rdp->nxttail[count] = &rdp->nxtlist; | |
1503 | local_irq_restore(flags); | |
1504 | ||
1505 | /* Invoke callbacks. */ | |
486e2593 | 1506 | count = count_lazy = 0; |
64db4cff PM |
1507 | while (list) { |
1508 | next = list->next; | |
1509 | prefetch(next); | |
551d55a9 | 1510 | debug_rcu_head_unqueue(list); |
486e2593 PM |
1511 | if (__rcu_reclaim(rsp->name, list)) |
1512 | count_lazy++; | |
64db4cff | 1513 | list = next; |
dff1672d PM |
1514 | /* Stop only if limit reached and CPU has something to do. */ |
1515 | if (++count >= bl && | |
1516 | (need_resched() || | |
1517 | (!is_idle_task(current) && !rcu_is_callbacks_kthread()))) | |
64db4cff PM |
1518 | break; |
1519 | } | |
1520 | ||
1521 | local_irq_save(flags); | |
4968c300 PM |
1522 | trace_rcu_batch_end(rsp->name, count, !!list, need_resched(), |
1523 | is_idle_task(current), | |
1524 | rcu_is_callbacks_kthread()); | |
64db4cff PM |
1525 | |
1526 | /* Update count, and requeue any remaining callbacks. */ | |
486e2593 | 1527 | rdp->qlen_lazy -= count_lazy; |
64db4cff | 1528 | rdp->qlen -= count; |
269dcc1c | 1529 | rdp->n_cbs_invoked += count; |
64db4cff PM |
1530 | if (list != NULL) { |
1531 | *tail = rdp->nxtlist; | |
1532 | rdp->nxtlist = list; | |
1533 | for (count = 0; count < RCU_NEXT_SIZE; count++) | |
1534 | if (&rdp->nxtlist == rdp->nxttail[count]) | |
1535 | rdp->nxttail[count] = tail; | |
1536 | else | |
1537 | break; | |
1538 | } | |
1539 | ||
1540 | /* Reinstate batch limit if we have worked down the excess. */ | |
1541 | if (rdp->blimit == LONG_MAX && rdp->qlen <= qlowmark) | |
1542 | rdp->blimit = blimit; | |
1543 | ||
37c72e56 PM |
1544 | /* Reset ->qlen_last_fqs_check trigger if enough CBs have drained. */ |
1545 | if (rdp->qlen == 0 && rdp->qlen_last_fqs_check != 0) { | |
1546 | rdp->qlen_last_fqs_check = 0; | |
1547 | rdp->n_force_qs_snap = rsp->n_force_qs; | |
1548 | } else if (rdp->qlen < rdp->qlen_last_fqs_check - qhimark) | |
1549 | rdp->qlen_last_fqs_check = rdp->qlen; | |
1550 | ||
64db4cff PM |
1551 | local_irq_restore(flags); |
1552 | ||
e0f23060 | 1553 | /* Re-invoke RCU core processing if there are callbacks remaining. */ |
64db4cff | 1554 | if (cpu_has_callbacks_ready_to_invoke(rdp)) |
a46e0899 | 1555 | invoke_rcu_core(); |
64db4cff PM |
1556 | } |
1557 | ||
1558 | /* | |
1559 | * Check to see if this CPU is in a non-context-switch quiescent state | |
1560 | * (user mode or idle loop for rcu, non-softirq execution for rcu_bh). | |
e0f23060 | 1561 | * Also schedule RCU core processing. |
64db4cff | 1562 | * |
9b2e4f18 | 1563 | * This function must be called from hardirq context. It is normally |
64db4cff PM |
1564 | * invoked from the scheduling-clock interrupt. If rcu_pending returns |
1565 | * false, there is no point in invoking rcu_check_callbacks(). | |
1566 | */ | |
1567 | void rcu_check_callbacks(int cpu, int user) | |
1568 | { | |
300df91c | 1569 | trace_rcu_utilization("Start scheduler-tick"); |
a858af28 | 1570 | increment_cpu_stall_ticks(); |
9b2e4f18 | 1571 | if (user || rcu_is_cpu_rrupt_from_idle()) { |
64db4cff PM |
1572 | |
1573 | /* | |
1574 | * Get here if this CPU took its interrupt from user | |
1575 | * mode or from the idle loop, and if this is not a | |
1576 | * nested interrupt. In this case, the CPU is in | |
d6714c22 | 1577 | * a quiescent state, so note it. |
64db4cff PM |
1578 | * |
1579 | * No memory barrier is required here because both | |
d6714c22 PM |
1580 | * rcu_sched_qs() and rcu_bh_qs() reference only CPU-local |
1581 | * variables that other CPUs neither access nor modify, | |
1582 | * at least not while the corresponding CPU is online. | |
64db4cff PM |
1583 | */ |
1584 | ||
d6714c22 PM |
1585 | rcu_sched_qs(cpu); |
1586 | rcu_bh_qs(cpu); | |
64db4cff PM |
1587 | |
1588 | } else if (!in_softirq()) { | |
1589 | ||
1590 | /* | |
1591 | * Get here if this CPU did not take its interrupt from | |
1592 | * softirq, in other words, if it is not interrupting | |
1593 | * a rcu_bh read-side critical section. This is an _bh | |
d6714c22 | 1594 | * critical section, so note it. |
64db4cff PM |
1595 | */ |
1596 | ||
d6714c22 | 1597 | rcu_bh_qs(cpu); |
64db4cff | 1598 | } |
f41d911f | 1599 | rcu_preempt_check_callbacks(cpu); |
d21670ac | 1600 | if (rcu_pending(cpu)) |
a46e0899 | 1601 | invoke_rcu_core(); |
300df91c | 1602 | trace_rcu_utilization("End scheduler-tick"); |
64db4cff PM |
1603 | } |
1604 | ||
64db4cff PM |
1605 | /* |
1606 | * Scan the leaf rcu_node structures, processing dyntick state for any that | |
1607 | * have not yet encountered a quiescent state, using the function specified. | |
27f4d280 PM |
1608 | * Also initiate boosting for any threads blocked on the root rcu_node. |
1609 | * | |
ee47eb9f | 1610 | * The caller must have suppressed start of new grace periods. |
64db4cff | 1611 | */ |
45f014c5 | 1612 | static void force_qs_rnp(struct rcu_state *rsp, int (*f)(struct rcu_data *)) |
64db4cff PM |
1613 | { |
1614 | unsigned long bit; | |
1615 | int cpu; | |
1616 | unsigned long flags; | |
1617 | unsigned long mask; | |
a0b6c9a7 | 1618 | struct rcu_node *rnp; |
64db4cff | 1619 | |
a0b6c9a7 | 1620 | rcu_for_each_leaf_node(rsp, rnp) { |
64db4cff | 1621 | mask = 0; |
1304afb2 | 1622 | raw_spin_lock_irqsave(&rnp->lock, flags); |
ee47eb9f | 1623 | if (!rcu_gp_in_progress(rsp)) { |
1304afb2 | 1624 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
0f10dc82 | 1625 | return; |
64db4cff | 1626 | } |
a0b6c9a7 | 1627 | if (rnp->qsmask == 0) { |
1217ed1b | 1628 | rcu_initiate_boost(rnp, flags); /* releases rnp->lock */ |
64db4cff PM |
1629 | continue; |
1630 | } | |
a0b6c9a7 | 1631 | cpu = rnp->grplo; |
64db4cff | 1632 | bit = 1; |
a0b6c9a7 | 1633 | for (; cpu <= rnp->grphi; cpu++, bit <<= 1) { |
394f99a9 LJ |
1634 | if ((rnp->qsmask & bit) != 0 && |
1635 | f(per_cpu_ptr(rsp->rda, cpu))) | |
64db4cff PM |
1636 | mask |= bit; |
1637 | } | |
45f014c5 | 1638 | if (mask != 0) { |
64db4cff | 1639 | |
d3f6bad3 PM |
1640 | /* rcu_report_qs_rnp() releases rnp->lock. */ |
1641 | rcu_report_qs_rnp(mask, rsp, rnp, flags); | |
64db4cff PM |
1642 | continue; |
1643 | } | |
1304afb2 | 1644 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff | 1645 | } |
27f4d280 | 1646 | rnp = rcu_get_root(rsp); |
1217ed1b PM |
1647 | if (rnp->qsmask == 0) { |
1648 | raw_spin_lock_irqsave(&rnp->lock, flags); | |
1649 | rcu_initiate_boost(rnp, flags); /* releases rnp->lock. */ | |
1650 | } | |
64db4cff PM |
1651 | } |
1652 | ||
1653 | /* | |
1654 | * Force quiescent states on reluctant CPUs, and also detect which | |
1655 | * CPUs are in dyntick-idle mode. | |
1656 | */ | |
1657 | static void force_quiescent_state(struct rcu_state *rsp, int relaxed) | |
1658 | { | |
1659 | unsigned long flags; | |
64db4cff | 1660 | struct rcu_node *rnp = rcu_get_root(rsp); |
64db4cff | 1661 | |
300df91c PM |
1662 | trace_rcu_utilization("Start fqs"); |
1663 | if (!rcu_gp_in_progress(rsp)) { | |
1664 | trace_rcu_utilization("End fqs"); | |
64db4cff | 1665 | return; /* No grace period in progress, nothing to force. */ |
300df91c | 1666 | } |
1304afb2 | 1667 | if (!raw_spin_trylock_irqsave(&rsp->fqslock, flags)) { |
64db4cff | 1668 | rsp->n_force_qs_lh++; /* Inexact, can lose counts. Tough! */ |
300df91c | 1669 | trace_rcu_utilization("End fqs"); |
64db4cff PM |
1670 | return; /* Someone else is already on the job. */ |
1671 | } | |
20133cfc | 1672 | if (relaxed && ULONG_CMP_GE(rsp->jiffies_force_qs, jiffies)) |
f96e9232 | 1673 | goto unlock_fqs_ret; /* no emergency and done recently. */ |
64db4cff | 1674 | rsp->n_force_qs++; |
1304afb2 | 1675 | raw_spin_lock(&rnp->lock); /* irqs already disabled */ |
64db4cff | 1676 | rsp->jiffies_force_qs = jiffies + RCU_JIFFIES_TILL_FORCE_QS; |
560d4bc0 | 1677 | if(!rcu_gp_in_progress(rsp)) { |
64db4cff | 1678 | rsp->n_force_qs_ngp++; |
1304afb2 | 1679 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ |
f96e9232 | 1680 | goto unlock_fqs_ret; /* no GP in progress, time updated. */ |
64db4cff | 1681 | } |
07079d53 | 1682 | rsp->fqs_active = 1; |
af446b70 | 1683 | switch (rsp->fqs_state) { |
83f5b01f | 1684 | case RCU_GP_IDLE: |
64db4cff PM |
1685 | case RCU_GP_INIT: |
1686 | ||
83f5b01f | 1687 | break; /* grace period idle or initializing, ignore. */ |
64db4cff PM |
1688 | |
1689 | case RCU_SAVE_DYNTICK: | |
64db4cff PM |
1690 | if (RCU_SIGNAL_INIT != RCU_SAVE_DYNTICK) |
1691 | break; /* So gcc recognizes the dead code. */ | |
1692 | ||
f261414f LJ |
1693 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ |
1694 | ||
64db4cff | 1695 | /* Record dyntick-idle state. */ |
45f014c5 | 1696 | force_qs_rnp(rsp, dyntick_save_progress_counter); |
1304afb2 | 1697 | raw_spin_lock(&rnp->lock); /* irqs already disabled */ |
ee47eb9f | 1698 | if (rcu_gp_in_progress(rsp)) |
af446b70 | 1699 | rsp->fqs_state = RCU_FORCE_QS; |
ee47eb9f | 1700 | break; |
64db4cff PM |
1701 | |
1702 | case RCU_FORCE_QS: | |
1703 | ||
1704 | /* Check dyntick-idle state, send IPI to laggarts. */ | |
1304afb2 | 1705 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ |
45f014c5 | 1706 | force_qs_rnp(rsp, rcu_implicit_dynticks_qs); |
64db4cff PM |
1707 | |
1708 | /* Leave state in case more forcing is required. */ | |
1709 | ||
1304afb2 | 1710 | raw_spin_lock(&rnp->lock); /* irqs already disabled */ |
f96e9232 | 1711 | break; |
64db4cff | 1712 | } |
07079d53 | 1713 | rsp->fqs_active = 0; |
46a1e34e | 1714 | if (rsp->fqs_need_gp) { |
1304afb2 | 1715 | raw_spin_unlock(&rsp->fqslock); /* irqs remain disabled */ |
46a1e34e PM |
1716 | rsp->fqs_need_gp = 0; |
1717 | rcu_start_gp(rsp, flags); /* releases rnp->lock */ | |
300df91c | 1718 | trace_rcu_utilization("End fqs"); |
46a1e34e PM |
1719 | return; |
1720 | } | |
1304afb2 | 1721 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled */ |
f96e9232 | 1722 | unlock_fqs_ret: |
1304afb2 | 1723 | raw_spin_unlock_irqrestore(&rsp->fqslock, flags); |
300df91c | 1724 | trace_rcu_utilization("End fqs"); |
64db4cff PM |
1725 | } |
1726 | ||
64db4cff | 1727 | /* |
e0f23060 PM |
1728 | * This does the RCU core processing work for the specified rcu_state |
1729 | * and rcu_data structures. This may be called only from the CPU to | |
1730 | * whom the rdp belongs. | |
64db4cff PM |
1731 | */ |
1732 | static void | |
1733 | __rcu_process_callbacks(struct rcu_state *rsp, struct rcu_data *rdp) | |
1734 | { | |
1735 | unsigned long flags; | |
1736 | ||
2e597558 PM |
1737 | WARN_ON_ONCE(rdp->beenonline == 0); |
1738 | ||
64db4cff PM |
1739 | /* |
1740 | * If an RCU GP has gone long enough, go check for dyntick | |
1741 | * idle CPUs and, if needed, send resched IPIs. | |
1742 | */ | |
20133cfc | 1743 | if (ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies)) |
64db4cff PM |
1744 | force_quiescent_state(rsp, 1); |
1745 | ||
1746 | /* | |
1747 | * Advance callbacks in response to end of earlier grace | |
1748 | * period that some other CPU ended. | |
1749 | */ | |
1750 | rcu_process_gp_end(rsp, rdp); | |
1751 | ||
1752 | /* Update RCU state based on any recent quiescent states. */ | |
1753 | rcu_check_quiescent_state(rsp, rdp); | |
1754 | ||
1755 | /* Does this CPU require a not-yet-started grace period? */ | |
1756 | if (cpu_needs_another_gp(rsp, rdp)) { | |
1304afb2 | 1757 | raw_spin_lock_irqsave(&rcu_get_root(rsp)->lock, flags); |
64db4cff PM |
1758 | rcu_start_gp(rsp, flags); /* releases above lock */ |
1759 | } | |
1760 | ||
1761 | /* If there are callbacks ready, invoke them. */ | |
09223371 | 1762 | if (cpu_has_callbacks_ready_to_invoke(rdp)) |
a46e0899 | 1763 | invoke_rcu_callbacks(rsp, rdp); |
09223371 SL |
1764 | } |
1765 | ||
64db4cff | 1766 | /* |
e0f23060 | 1767 | * Do RCU core processing for the current CPU. |
64db4cff | 1768 | */ |
09223371 | 1769 | static void rcu_process_callbacks(struct softirq_action *unused) |
64db4cff | 1770 | { |
300df91c | 1771 | trace_rcu_utilization("Start RCU core"); |
d6714c22 PM |
1772 | __rcu_process_callbacks(&rcu_sched_state, |
1773 | &__get_cpu_var(rcu_sched_data)); | |
64db4cff | 1774 | __rcu_process_callbacks(&rcu_bh_state, &__get_cpu_var(rcu_bh_data)); |
f41d911f | 1775 | rcu_preempt_process_callbacks(); |
300df91c | 1776 | trace_rcu_utilization("End RCU core"); |
64db4cff PM |
1777 | } |
1778 | ||
a26ac245 | 1779 | /* |
e0f23060 PM |
1780 | * Schedule RCU callback invocation. If the specified type of RCU |
1781 | * does not support RCU priority boosting, just do a direct call, | |
1782 | * otherwise wake up the per-CPU kernel kthread. Note that because we | |
1783 | * are running on the current CPU with interrupts disabled, the | |
1784 | * rcu_cpu_kthread_task cannot disappear out from under us. | |
a26ac245 | 1785 | */ |
a46e0899 | 1786 | static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp) |
a26ac245 | 1787 | { |
b0d30417 PM |
1788 | if (unlikely(!ACCESS_ONCE(rcu_scheduler_fully_active))) |
1789 | return; | |
a46e0899 PM |
1790 | if (likely(!rsp->boost)) { |
1791 | rcu_do_batch(rsp, rdp); | |
a26ac245 PM |
1792 | return; |
1793 | } | |
a46e0899 | 1794 | invoke_rcu_callbacks_kthread(); |
a26ac245 PM |
1795 | } |
1796 | ||
a46e0899 | 1797 | static void invoke_rcu_core(void) |
09223371 SL |
1798 | { |
1799 | raise_softirq(RCU_SOFTIRQ); | |
1800 | } | |
1801 | ||
64db4cff PM |
1802 | static void |
1803 | __call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu), | |
486e2593 | 1804 | struct rcu_state *rsp, bool lazy) |
64db4cff PM |
1805 | { |
1806 | unsigned long flags; | |
1807 | struct rcu_data *rdp; | |
1808 | ||
0bb7b59d | 1809 | WARN_ON_ONCE((unsigned long)head & 0x3); /* Misaligned rcu_head! */ |
551d55a9 | 1810 | debug_rcu_head_queue(head); |
64db4cff PM |
1811 | head->func = func; |
1812 | head->next = NULL; | |
1813 | ||
1814 | smp_mb(); /* Ensure RCU update seen before callback registry. */ | |
1815 | ||
1816 | /* | |
1817 | * Opportunistically note grace-period endings and beginnings. | |
1818 | * Note that we might see a beginning right after we see an | |
1819 | * end, but never vice versa, since this CPU has to pass through | |
1820 | * a quiescent state betweentimes. | |
1821 | */ | |
1822 | local_irq_save(flags); | |
e5601400 | 1823 | WARN_ON_ONCE(cpu_is_offline(smp_processor_id())); |
394f99a9 | 1824 | rdp = this_cpu_ptr(rsp->rda); |
64db4cff PM |
1825 | |
1826 | /* Add the callback to our list. */ | |
1827 | *rdp->nxttail[RCU_NEXT_TAIL] = head; | |
1828 | rdp->nxttail[RCU_NEXT_TAIL] = &head->next; | |
2655d57e | 1829 | rdp->qlen++; |
486e2593 PM |
1830 | if (lazy) |
1831 | rdp->qlen_lazy++; | |
2655d57e | 1832 | |
d4c08f2a PM |
1833 | if (__is_kfree_rcu_offset((unsigned long)func)) |
1834 | trace_rcu_kfree_callback(rsp->name, head, (unsigned long)func, | |
486e2593 | 1835 | rdp->qlen_lazy, rdp->qlen); |
d4c08f2a | 1836 | else |
486e2593 | 1837 | trace_rcu_callback(rsp->name, head, rdp->qlen_lazy, rdp->qlen); |
d4c08f2a | 1838 | |
2655d57e PM |
1839 | /* If interrupts were disabled, don't dive into RCU core. */ |
1840 | if (irqs_disabled_flags(flags)) { | |
1841 | local_irq_restore(flags); | |
1842 | return; | |
1843 | } | |
64db4cff | 1844 | |
37c72e56 PM |
1845 | /* |
1846 | * Force the grace period if too many callbacks or too long waiting. | |
1847 | * Enforce hysteresis, and don't invoke force_quiescent_state() | |
1848 | * if some other CPU has recently done so. Also, don't bother | |
1849 | * invoking force_quiescent_state() if the newly enqueued callback | |
1850 | * is the only one waiting for a grace period to complete. | |
1851 | */ | |
2655d57e | 1852 | if (unlikely(rdp->qlen > rdp->qlen_last_fqs_check + qhimark)) { |
b52573d2 PM |
1853 | |
1854 | /* Are we ignoring a completed grace period? */ | |
1855 | rcu_process_gp_end(rsp, rdp); | |
1856 | check_for_new_grace_period(rsp, rdp); | |
1857 | ||
1858 | /* Start a new grace period if one not already started. */ | |
1859 | if (!rcu_gp_in_progress(rsp)) { | |
1860 | unsigned long nestflag; | |
1861 | struct rcu_node *rnp_root = rcu_get_root(rsp); | |
1862 | ||
1863 | raw_spin_lock_irqsave(&rnp_root->lock, nestflag); | |
1864 | rcu_start_gp(rsp, nestflag); /* rlses rnp_root->lock */ | |
1865 | } else { | |
1866 | /* Give the grace period a kick. */ | |
1867 | rdp->blimit = LONG_MAX; | |
1868 | if (rsp->n_force_qs == rdp->n_force_qs_snap && | |
1869 | *rdp->nxttail[RCU_DONE_TAIL] != head) | |
1870 | force_quiescent_state(rsp, 0); | |
1871 | rdp->n_force_qs_snap = rsp->n_force_qs; | |
1872 | rdp->qlen_last_fqs_check = rdp->qlen; | |
1873 | } | |
20133cfc | 1874 | } else if (ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies)) |
64db4cff PM |
1875 | force_quiescent_state(rsp, 1); |
1876 | local_irq_restore(flags); | |
1877 | } | |
1878 | ||
1879 | /* | |
d6714c22 | 1880 | * Queue an RCU-sched callback for invocation after a grace period. |
64db4cff | 1881 | */ |
d6714c22 | 1882 | void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu)) |
64db4cff | 1883 | { |
486e2593 | 1884 | __call_rcu(head, func, &rcu_sched_state, 0); |
64db4cff | 1885 | } |
d6714c22 | 1886 | EXPORT_SYMBOL_GPL(call_rcu_sched); |
64db4cff PM |
1887 | |
1888 | /* | |
486e2593 | 1889 | * Queue an RCU callback for invocation after a quicker grace period. |
64db4cff PM |
1890 | */ |
1891 | void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu)) | |
1892 | { | |
486e2593 | 1893 | __call_rcu(head, func, &rcu_bh_state, 0); |
64db4cff PM |
1894 | } |
1895 | EXPORT_SYMBOL_GPL(call_rcu_bh); | |
1896 | ||
6ebb237b PM |
1897 | /** |
1898 | * synchronize_sched - wait until an rcu-sched grace period has elapsed. | |
1899 | * | |
1900 | * Control will return to the caller some time after a full rcu-sched | |
1901 | * grace period has elapsed, in other words after all currently executing | |
1902 | * rcu-sched read-side critical sections have completed. These read-side | |
1903 | * critical sections are delimited by rcu_read_lock_sched() and | |
1904 | * rcu_read_unlock_sched(), and may be nested. Note that preempt_disable(), | |
1905 | * local_irq_disable(), and so on may be used in place of | |
1906 | * rcu_read_lock_sched(). | |
1907 | * | |
1908 | * This means that all preempt_disable code sequences, including NMI and | |
1909 | * hardware-interrupt handlers, in progress on entry will have completed | |
1910 | * before this primitive returns. However, this does not guarantee that | |
1911 | * softirq handlers will have completed, since in some kernels, these | |
1912 | * handlers can run in process context, and can block. | |
1913 | * | |
1914 | * This primitive provides the guarantees made by the (now removed) | |
1915 | * synchronize_kernel() API. In contrast, synchronize_rcu() only | |
1916 | * guarantees that rcu_read_lock() sections will have completed. | |
1917 | * In "classic RCU", these two guarantees happen to be one and | |
1918 | * the same, but can differ in realtime RCU implementations. | |
1919 | */ | |
1920 | void synchronize_sched(void) | |
1921 | { | |
fe15d706 PM |
1922 | rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) && |
1923 | !lock_is_held(&rcu_lock_map) && | |
1924 | !lock_is_held(&rcu_sched_lock_map), | |
1925 | "Illegal synchronize_sched() in RCU-sched read-side critical section"); | |
6ebb237b PM |
1926 | if (rcu_blocking_is_gp()) |
1927 | return; | |
2c42818e | 1928 | wait_rcu_gp(call_rcu_sched); |
6ebb237b PM |
1929 | } |
1930 | EXPORT_SYMBOL_GPL(synchronize_sched); | |
1931 | ||
1932 | /** | |
1933 | * synchronize_rcu_bh - wait until an rcu_bh grace period has elapsed. | |
1934 | * | |
1935 | * Control will return to the caller some time after a full rcu_bh grace | |
1936 | * period has elapsed, in other words after all currently executing rcu_bh | |
1937 | * read-side critical sections have completed. RCU read-side critical | |
1938 | * sections are delimited by rcu_read_lock_bh() and rcu_read_unlock_bh(), | |
1939 | * and may be nested. | |
1940 | */ | |
1941 | void synchronize_rcu_bh(void) | |
1942 | { | |
fe15d706 PM |
1943 | rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) && |
1944 | !lock_is_held(&rcu_lock_map) && | |
1945 | !lock_is_held(&rcu_sched_lock_map), | |
1946 | "Illegal synchronize_rcu_bh() in RCU-bh read-side critical section"); | |
6ebb237b PM |
1947 | if (rcu_blocking_is_gp()) |
1948 | return; | |
2c42818e | 1949 | wait_rcu_gp(call_rcu_bh); |
6ebb237b PM |
1950 | } |
1951 | EXPORT_SYMBOL_GPL(synchronize_rcu_bh); | |
1952 | ||
3d3b7db0 PM |
1953 | static atomic_t sync_sched_expedited_started = ATOMIC_INIT(0); |
1954 | static atomic_t sync_sched_expedited_done = ATOMIC_INIT(0); | |
1955 | ||
1956 | static int synchronize_sched_expedited_cpu_stop(void *data) | |
1957 | { | |
1958 | /* | |
1959 | * There must be a full memory barrier on each affected CPU | |
1960 | * between the time that try_stop_cpus() is called and the | |
1961 | * time that it returns. | |
1962 | * | |
1963 | * In the current initial implementation of cpu_stop, the | |
1964 | * above condition is already met when the control reaches | |
1965 | * this point and the following smp_mb() is not strictly | |
1966 | * necessary. Do smp_mb() anyway for documentation and | |
1967 | * robustness against future implementation changes. | |
1968 | */ | |
1969 | smp_mb(); /* See above comment block. */ | |
1970 | return 0; | |
1971 | } | |
1972 | ||
236fefaf PM |
1973 | /** |
1974 | * synchronize_sched_expedited - Brute-force RCU-sched grace period | |
1975 | * | |
1976 | * Wait for an RCU-sched grace period to elapse, but use a "big hammer" | |
1977 | * approach to force the grace period to end quickly. This consumes | |
1978 | * significant time on all CPUs and is unfriendly to real-time workloads, | |
1979 | * so is thus not recommended for any sort of common-case code. In fact, | |
1980 | * if you are using synchronize_sched_expedited() in a loop, please | |
1981 | * restructure your code to batch your updates, and then use a single | |
1982 | * synchronize_sched() instead. | |
3d3b7db0 | 1983 | * |
236fefaf PM |
1984 | * Note that it is illegal to call this function while holding any lock |
1985 | * that is acquired by a CPU-hotplug notifier. And yes, it is also illegal | |
1986 | * to call this function from a CPU-hotplug notifier. Failing to observe | |
1987 | * these restriction will result in deadlock. | |
3d3b7db0 PM |
1988 | * |
1989 | * This implementation can be thought of as an application of ticket | |
1990 | * locking to RCU, with sync_sched_expedited_started and | |
1991 | * sync_sched_expedited_done taking on the roles of the halves | |
1992 | * of the ticket-lock word. Each task atomically increments | |
1993 | * sync_sched_expedited_started upon entry, snapshotting the old value, | |
1994 | * then attempts to stop all the CPUs. If this succeeds, then each | |
1995 | * CPU will have executed a context switch, resulting in an RCU-sched | |
1996 | * grace period. We are then done, so we use atomic_cmpxchg() to | |
1997 | * update sync_sched_expedited_done to match our snapshot -- but | |
1998 | * only if someone else has not already advanced past our snapshot. | |
1999 | * | |
2000 | * On the other hand, if try_stop_cpus() fails, we check the value | |
2001 | * of sync_sched_expedited_done. If it has advanced past our | |
2002 | * initial snapshot, then someone else must have forced a grace period | |
2003 | * some time after we took our snapshot. In this case, our work is | |
2004 | * done for us, and we can simply return. Otherwise, we try again, | |
2005 | * but keep our initial snapshot for purposes of checking for someone | |
2006 | * doing our work for us. | |
2007 | * | |
2008 | * If we fail too many times in a row, we fall back to synchronize_sched(). | |
2009 | */ | |
2010 | void synchronize_sched_expedited(void) | |
2011 | { | |
2012 | int firstsnap, s, snap, trycount = 0; | |
2013 | ||
2014 | /* Note that atomic_inc_return() implies full memory barrier. */ | |
2015 | firstsnap = snap = atomic_inc_return(&sync_sched_expedited_started); | |
2016 | get_online_cpus(); | |
1cc85961 | 2017 | WARN_ON_ONCE(cpu_is_offline(raw_smp_processor_id())); |
3d3b7db0 PM |
2018 | |
2019 | /* | |
2020 | * Each pass through the following loop attempts to force a | |
2021 | * context switch on each CPU. | |
2022 | */ | |
2023 | while (try_stop_cpus(cpu_online_mask, | |
2024 | synchronize_sched_expedited_cpu_stop, | |
2025 | NULL) == -EAGAIN) { | |
2026 | put_online_cpus(); | |
2027 | ||
2028 | /* No joy, try again later. Or just synchronize_sched(). */ | |
2029 | if (trycount++ < 10) | |
2030 | udelay(trycount * num_online_cpus()); | |
2031 | else { | |
2032 | synchronize_sched(); | |
2033 | return; | |
2034 | } | |
2035 | ||
2036 | /* Check to see if someone else did our work for us. */ | |
2037 | s = atomic_read(&sync_sched_expedited_done); | |
2038 | if (UINT_CMP_GE((unsigned)s, (unsigned)firstsnap)) { | |
2039 | smp_mb(); /* ensure test happens before caller kfree */ | |
2040 | return; | |
2041 | } | |
2042 | ||
2043 | /* | |
2044 | * Refetching sync_sched_expedited_started allows later | |
2045 | * callers to piggyback on our grace period. We subtract | |
2046 | * 1 to get the same token that the last incrementer got. | |
2047 | * We retry after they started, so our grace period works | |
2048 | * for them, and they started after our first try, so their | |
2049 | * grace period works for us. | |
2050 | */ | |
2051 | get_online_cpus(); | |
2052 | snap = atomic_read(&sync_sched_expedited_started); | |
2053 | smp_mb(); /* ensure read is before try_stop_cpus(). */ | |
2054 | } | |
2055 | ||
2056 | /* | |
2057 | * Everyone up to our most recent fetch is covered by our grace | |
2058 | * period. Update the counter, but only if our work is still | |
2059 | * relevant -- which it won't be if someone who started later | |
2060 | * than we did beat us to the punch. | |
2061 | */ | |
2062 | do { | |
2063 | s = atomic_read(&sync_sched_expedited_done); | |
2064 | if (UINT_CMP_GE((unsigned)s, (unsigned)snap)) { | |
2065 | smp_mb(); /* ensure test happens before caller kfree */ | |
2066 | break; | |
2067 | } | |
2068 | } while (atomic_cmpxchg(&sync_sched_expedited_done, s, snap) != s); | |
2069 | ||
2070 | put_online_cpus(); | |
2071 | } | |
2072 | EXPORT_SYMBOL_GPL(synchronize_sched_expedited); | |
2073 | ||
64db4cff PM |
2074 | /* |
2075 | * Check to see if there is any immediate RCU-related work to be done | |
2076 | * by the current CPU, for the specified type of RCU, returning 1 if so. | |
2077 | * The checks are in order of increasing expense: checks that can be | |
2078 | * carried out against CPU-local state are performed first. However, | |
2079 | * we must check for CPU stalls first, else we might not get a chance. | |
2080 | */ | |
2081 | static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp) | |
2082 | { | |
2f51f988 PM |
2083 | struct rcu_node *rnp = rdp->mynode; |
2084 | ||
64db4cff PM |
2085 | rdp->n_rcu_pending++; |
2086 | ||
2087 | /* Check for CPU stalls, if enabled. */ | |
2088 | check_cpu_stall(rsp, rdp); | |
2089 | ||
2090 | /* Is the RCU core waiting for a quiescent state from this CPU? */ | |
5c51dd73 PM |
2091 | if (rcu_scheduler_fully_active && |
2092 | rdp->qs_pending && !rdp->passed_quiesce) { | |
d25eb944 PM |
2093 | |
2094 | /* | |
2095 | * If force_quiescent_state() coming soon and this CPU | |
2096 | * needs a quiescent state, and this is either RCU-sched | |
2097 | * or RCU-bh, force a local reschedule. | |
2098 | */ | |
d21670ac | 2099 | rdp->n_rp_qs_pending++; |
6cc68793 | 2100 | if (!rdp->preemptible && |
d25eb944 PM |
2101 | ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs) - 1, |
2102 | jiffies)) | |
2103 | set_need_resched(); | |
e4cc1f22 | 2104 | } else if (rdp->qs_pending && rdp->passed_quiesce) { |
d21670ac | 2105 | rdp->n_rp_report_qs++; |
64db4cff | 2106 | return 1; |
7ba5c840 | 2107 | } |
64db4cff PM |
2108 | |
2109 | /* Does this CPU have callbacks ready to invoke? */ | |
7ba5c840 PM |
2110 | if (cpu_has_callbacks_ready_to_invoke(rdp)) { |
2111 | rdp->n_rp_cb_ready++; | |
64db4cff | 2112 | return 1; |
7ba5c840 | 2113 | } |
64db4cff PM |
2114 | |
2115 | /* Has RCU gone idle with this CPU needing another grace period? */ | |
7ba5c840 PM |
2116 | if (cpu_needs_another_gp(rsp, rdp)) { |
2117 | rdp->n_rp_cpu_needs_gp++; | |
64db4cff | 2118 | return 1; |
7ba5c840 | 2119 | } |
64db4cff PM |
2120 | |
2121 | /* Has another RCU grace period completed? */ | |
2f51f988 | 2122 | if (ACCESS_ONCE(rnp->completed) != rdp->completed) { /* outside lock */ |
7ba5c840 | 2123 | rdp->n_rp_gp_completed++; |
64db4cff | 2124 | return 1; |
7ba5c840 | 2125 | } |
64db4cff PM |
2126 | |
2127 | /* Has a new RCU grace period started? */ | |
2f51f988 | 2128 | if (ACCESS_ONCE(rnp->gpnum) != rdp->gpnum) { /* outside lock */ |
7ba5c840 | 2129 | rdp->n_rp_gp_started++; |
64db4cff | 2130 | return 1; |
7ba5c840 | 2131 | } |
64db4cff PM |
2132 | |
2133 | /* Has an RCU GP gone long enough to send resched IPIs &c? */ | |
fc2219d4 | 2134 | if (rcu_gp_in_progress(rsp) && |
20133cfc | 2135 | ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies)) { |
7ba5c840 | 2136 | rdp->n_rp_need_fqs++; |
64db4cff | 2137 | return 1; |
7ba5c840 | 2138 | } |
64db4cff PM |
2139 | |
2140 | /* nothing to do */ | |
7ba5c840 | 2141 | rdp->n_rp_need_nothing++; |
64db4cff PM |
2142 | return 0; |
2143 | } | |
2144 | ||
2145 | /* | |
2146 | * Check to see if there is any immediate RCU-related work to be done | |
2147 | * by the current CPU, returning 1 if so. This function is part of the | |
2148 | * RCU implementation; it is -not- an exported member of the RCU API. | |
2149 | */ | |
a157229c | 2150 | static int rcu_pending(int cpu) |
64db4cff | 2151 | { |
d6714c22 | 2152 | return __rcu_pending(&rcu_sched_state, &per_cpu(rcu_sched_data, cpu)) || |
f41d911f PM |
2153 | __rcu_pending(&rcu_bh_state, &per_cpu(rcu_bh_data, cpu)) || |
2154 | rcu_preempt_pending(cpu); | |
64db4cff PM |
2155 | } |
2156 | ||
2157 | /* | |
2158 | * Check to see if any future RCU-related work will need to be done | |
2159 | * by the current CPU, even if none need be done immediately, returning | |
8bd93a2c | 2160 | * 1 if so. |
64db4cff | 2161 | */ |
aea1b35e | 2162 | static int rcu_cpu_has_callbacks(int cpu) |
64db4cff PM |
2163 | { |
2164 | /* RCU callbacks either ready or pending? */ | |
d6714c22 | 2165 | return per_cpu(rcu_sched_data, cpu).nxtlist || |
f41d911f | 2166 | per_cpu(rcu_bh_data, cpu).nxtlist || |
30fbcc90 | 2167 | rcu_preempt_cpu_has_callbacks(cpu); |
64db4cff PM |
2168 | } |
2169 | ||
d0ec774c PM |
2170 | static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL}; |
2171 | static atomic_t rcu_barrier_cpu_count; | |
2172 | static DEFINE_MUTEX(rcu_barrier_mutex); | |
2173 | static struct completion rcu_barrier_completion; | |
d0ec774c PM |
2174 | |
2175 | static void rcu_barrier_callback(struct rcu_head *notused) | |
2176 | { | |
2177 | if (atomic_dec_and_test(&rcu_barrier_cpu_count)) | |
2178 | complete(&rcu_barrier_completion); | |
2179 | } | |
2180 | ||
2181 | /* | |
2182 | * Called with preemption disabled, and from cross-cpu IRQ context. | |
2183 | */ | |
2184 | static void rcu_barrier_func(void *type) | |
2185 | { | |
2186 | int cpu = smp_processor_id(); | |
2187 | struct rcu_head *head = &per_cpu(rcu_barrier_head, cpu); | |
2188 | void (*call_rcu_func)(struct rcu_head *head, | |
2189 | void (*func)(struct rcu_head *head)); | |
2190 | ||
2191 | atomic_inc(&rcu_barrier_cpu_count); | |
2192 | call_rcu_func = type; | |
2193 | call_rcu_func(head, rcu_barrier_callback); | |
2194 | } | |
2195 | ||
d0ec774c PM |
2196 | /* |
2197 | * Orchestrate the specified type of RCU barrier, waiting for all | |
2198 | * RCU callbacks of the specified type to complete. | |
2199 | */ | |
e74f4c45 PM |
2200 | static void _rcu_barrier(struct rcu_state *rsp, |
2201 | void (*call_rcu_func)(struct rcu_head *head, | |
d0ec774c PM |
2202 | void (*func)(struct rcu_head *head))) |
2203 | { | |
2204 | BUG_ON(in_interrupt()); | |
e74f4c45 | 2205 | /* Take mutex to serialize concurrent rcu_barrier() requests. */ |
d0ec774c PM |
2206 | mutex_lock(&rcu_barrier_mutex); |
2207 | init_completion(&rcu_barrier_completion); | |
2208 | /* | |
2209 | * Initialize rcu_barrier_cpu_count to 1, then invoke | |
2210 | * rcu_barrier_func() on each CPU, so that each CPU also has | |
2211 | * incremented rcu_barrier_cpu_count. Only then is it safe to | |
2212 | * decrement rcu_barrier_cpu_count -- otherwise the first CPU | |
2213 | * might complete its grace period before all of the other CPUs | |
2214 | * did their increment, causing this function to return too | |
2d999e03 PM |
2215 | * early. Note that on_each_cpu() disables irqs, which prevents |
2216 | * any CPUs from coming online or going offline until each online | |
2217 | * CPU has queued its RCU-barrier callback. | |
d0ec774c PM |
2218 | */ |
2219 | atomic_set(&rcu_barrier_cpu_count, 1); | |
2220 | on_each_cpu(rcu_barrier_func, (void *)call_rcu_func, 1); | |
2221 | if (atomic_dec_and_test(&rcu_barrier_cpu_count)) | |
2222 | complete(&rcu_barrier_completion); | |
2223 | wait_for_completion(&rcu_barrier_completion); | |
2224 | mutex_unlock(&rcu_barrier_mutex); | |
d0ec774c | 2225 | } |
d0ec774c PM |
2226 | |
2227 | /** | |
2228 | * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete. | |
2229 | */ | |
2230 | void rcu_barrier_bh(void) | |
2231 | { | |
e74f4c45 | 2232 | _rcu_barrier(&rcu_bh_state, call_rcu_bh); |
d0ec774c PM |
2233 | } |
2234 | EXPORT_SYMBOL_GPL(rcu_barrier_bh); | |
2235 | ||
2236 | /** | |
2237 | * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks. | |
2238 | */ | |
2239 | void rcu_barrier_sched(void) | |
2240 | { | |
e74f4c45 | 2241 | _rcu_barrier(&rcu_sched_state, call_rcu_sched); |
d0ec774c PM |
2242 | } |
2243 | EXPORT_SYMBOL_GPL(rcu_barrier_sched); | |
2244 | ||
64db4cff | 2245 | /* |
27569620 | 2246 | * Do boot-time initialization of a CPU's per-CPU RCU data. |
64db4cff | 2247 | */ |
27569620 PM |
2248 | static void __init |
2249 | rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp) | |
64db4cff PM |
2250 | { |
2251 | unsigned long flags; | |
2252 | int i; | |
394f99a9 | 2253 | struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu); |
27569620 PM |
2254 | struct rcu_node *rnp = rcu_get_root(rsp); |
2255 | ||
2256 | /* Set up local state, ensuring consistent view of global state. */ | |
1304afb2 | 2257 | raw_spin_lock_irqsave(&rnp->lock, flags); |
27569620 PM |
2258 | rdp->grpmask = 1UL << (cpu - rdp->mynode->grplo); |
2259 | rdp->nxtlist = NULL; | |
2260 | for (i = 0; i < RCU_NEXT_SIZE; i++) | |
2261 | rdp->nxttail[i] = &rdp->nxtlist; | |
486e2593 | 2262 | rdp->qlen_lazy = 0; |
27569620 | 2263 | rdp->qlen = 0; |
27569620 | 2264 | rdp->dynticks = &per_cpu(rcu_dynticks, cpu); |
29e37d81 | 2265 | WARN_ON_ONCE(rdp->dynticks->dynticks_nesting != DYNTICK_TASK_EXIT_IDLE); |
9b2e4f18 | 2266 | WARN_ON_ONCE(atomic_read(&rdp->dynticks->dynticks) != 1); |
27569620 | 2267 | rdp->cpu = cpu; |
d4c08f2a | 2268 | rdp->rsp = rsp; |
1304afb2 | 2269 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
27569620 PM |
2270 | } |
2271 | ||
2272 | /* | |
2273 | * Initialize a CPU's per-CPU RCU data. Note that only one online or | |
2274 | * offline event can be happening at a given time. Note also that we | |
2275 | * can accept some slop in the rsp->completed access due to the fact | |
2276 | * that this CPU cannot possibly have any RCU callbacks in flight yet. | |
64db4cff | 2277 | */ |
e4fa4c97 | 2278 | static void __cpuinit |
6cc68793 | 2279 | rcu_init_percpu_data(int cpu, struct rcu_state *rsp, int preemptible) |
64db4cff PM |
2280 | { |
2281 | unsigned long flags; | |
64db4cff | 2282 | unsigned long mask; |
394f99a9 | 2283 | struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu); |
64db4cff PM |
2284 | struct rcu_node *rnp = rcu_get_root(rsp); |
2285 | ||
2286 | /* Set up local state, ensuring consistent view of global state. */ | |
1304afb2 | 2287 | raw_spin_lock_irqsave(&rnp->lock, flags); |
64db4cff | 2288 | rdp->beenonline = 1; /* We have now been online. */ |
6cc68793 | 2289 | rdp->preemptible = preemptible; |
37c72e56 PM |
2290 | rdp->qlen_last_fqs_check = 0; |
2291 | rdp->n_force_qs_snap = rsp->n_force_qs; | |
64db4cff | 2292 | rdp->blimit = blimit; |
29e37d81 | 2293 | rdp->dynticks->dynticks_nesting = DYNTICK_TASK_EXIT_IDLE; |
c92b131b PM |
2294 | atomic_set(&rdp->dynticks->dynticks, |
2295 | (atomic_read(&rdp->dynticks->dynticks) & ~0x1) + 1); | |
7cb92499 | 2296 | rcu_prepare_for_idle_init(cpu); |
1304afb2 | 2297 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
64db4cff PM |
2298 | |
2299 | /* | |
2300 | * A new grace period might start here. If so, we won't be part | |
2301 | * of it, but that is OK, as we are currently in a quiescent state. | |
2302 | */ | |
2303 | ||
2304 | /* Exclude any attempts to start a new GP on large systems. */ | |
1304afb2 | 2305 | raw_spin_lock(&rsp->onofflock); /* irqs already disabled. */ |
64db4cff PM |
2306 | |
2307 | /* Add CPU to rcu_node bitmasks. */ | |
2308 | rnp = rdp->mynode; | |
2309 | mask = rdp->grpmask; | |
2310 | do { | |
2311 | /* Exclude any attempts to start a new GP on small systems. */ | |
1304afb2 | 2312 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
64db4cff PM |
2313 | rnp->qsmaskinit |= mask; |
2314 | mask = rnp->grpmask; | |
d09b62df | 2315 | if (rnp == rdp->mynode) { |
06ae115a PM |
2316 | /* |
2317 | * If there is a grace period in progress, we will | |
2318 | * set up to wait for it next time we run the | |
2319 | * RCU core code. | |
2320 | */ | |
2321 | rdp->gpnum = rnp->completed; | |
d09b62df | 2322 | rdp->completed = rnp->completed; |
06ae115a PM |
2323 | rdp->passed_quiesce = 0; |
2324 | rdp->qs_pending = 0; | |
e4cc1f22 | 2325 | rdp->passed_quiesce_gpnum = rnp->gpnum - 1; |
d4c08f2a | 2326 | trace_rcu_grace_period(rsp->name, rdp->gpnum, "cpuonl"); |
d09b62df | 2327 | } |
1304afb2 | 2328 | raw_spin_unlock(&rnp->lock); /* irqs already disabled. */ |
64db4cff PM |
2329 | rnp = rnp->parent; |
2330 | } while (rnp != NULL && !(rnp->qsmaskinit & mask)); | |
2331 | ||
1304afb2 | 2332 | raw_spin_unlock_irqrestore(&rsp->onofflock, flags); |
64db4cff PM |
2333 | } |
2334 | ||
d72bce0e | 2335 | static void __cpuinit rcu_prepare_cpu(int cpu) |
64db4cff | 2336 | { |
f41d911f PM |
2337 | rcu_init_percpu_data(cpu, &rcu_sched_state, 0); |
2338 | rcu_init_percpu_data(cpu, &rcu_bh_state, 0); | |
2339 | rcu_preempt_init_percpu_data(cpu); | |
64db4cff PM |
2340 | } |
2341 | ||
2342 | /* | |
f41d911f | 2343 | * Handle CPU online/offline notification events. |
64db4cff | 2344 | */ |
9f680ab4 PM |
2345 | static int __cpuinit rcu_cpu_notify(struct notifier_block *self, |
2346 | unsigned long action, void *hcpu) | |
64db4cff PM |
2347 | { |
2348 | long cpu = (long)hcpu; | |
27f4d280 | 2349 | struct rcu_data *rdp = per_cpu_ptr(rcu_state->rda, cpu); |
a26ac245 | 2350 | struct rcu_node *rnp = rdp->mynode; |
64db4cff | 2351 | |
300df91c | 2352 | trace_rcu_utilization("Start CPU hotplug"); |
64db4cff PM |
2353 | switch (action) { |
2354 | case CPU_UP_PREPARE: | |
2355 | case CPU_UP_PREPARE_FROZEN: | |
d72bce0e PZ |
2356 | rcu_prepare_cpu(cpu); |
2357 | rcu_prepare_kthreads(cpu); | |
a26ac245 PM |
2358 | break; |
2359 | case CPU_ONLINE: | |
0f962a5e PM |
2360 | case CPU_DOWN_FAILED: |
2361 | rcu_node_kthread_setaffinity(rnp, -1); | |
e3995a25 | 2362 | rcu_cpu_kthread_setrt(cpu, 1); |
0f962a5e PM |
2363 | break; |
2364 | case CPU_DOWN_PREPARE: | |
2365 | rcu_node_kthread_setaffinity(rnp, cpu); | |
e3995a25 | 2366 | rcu_cpu_kthread_setrt(cpu, 0); |
64db4cff | 2367 | break; |
d0ec774c PM |
2368 | case CPU_DYING: |
2369 | case CPU_DYING_FROZEN: | |
2370 | /* | |
2d999e03 PM |
2371 | * The whole machine is "stopped" except this CPU, so we can |
2372 | * touch any data without introducing corruption. We send the | |
2373 | * dying CPU's callbacks to an arbitrarily chosen online CPU. | |
d0ec774c | 2374 | */ |
e5601400 PM |
2375 | rcu_cleanup_dying_cpu(&rcu_bh_state); |
2376 | rcu_cleanup_dying_cpu(&rcu_sched_state); | |
2377 | rcu_preempt_cleanup_dying_cpu(); | |
7cb92499 | 2378 | rcu_cleanup_after_idle(cpu); |
d0ec774c | 2379 | break; |
64db4cff PM |
2380 | case CPU_DEAD: |
2381 | case CPU_DEAD_FROZEN: | |
2382 | case CPU_UP_CANCELED: | |
2383 | case CPU_UP_CANCELED_FROZEN: | |
e5601400 PM |
2384 | rcu_cleanup_dead_cpu(cpu, &rcu_bh_state); |
2385 | rcu_cleanup_dead_cpu(cpu, &rcu_sched_state); | |
2386 | rcu_preempt_cleanup_dead_cpu(cpu); | |
64db4cff PM |
2387 | break; |
2388 | default: | |
2389 | break; | |
2390 | } | |
300df91c | 2391 | trace_rcu_utilization("End CPU hotplug"); |
64db4cff PM |
2392 | return NOTIFY_OK; |
2393 | } | |
2394 | ||
bbad9379 PM |
2395 | /* |
2396 | * This function is invoked towards the end of the scheduler's initialization | |
2397 | * process. Before this is called, the idle task might contain | |
2398 | * RCU read-side critical sections (during which time, this idle | |
2399 | * task is booting the system). After this function is called, the | |
2400 | * idle tasks are prohibited from containing RCU read-side critical | |
2401 | * sections. This function also enables RCU lockdep checking. | |
2402 | */ | |
2403 | void rcu_scheduler_starting(void) | |
2404 | { | |
2405 | WARN_ON(num_online_cpus() != 1); | |
2406 | WARN_ON(nr_context_switches() > 0); | |
2407 | rcu_scheduler_active = 1; | |
2408 | } | |
2409 | ||
64db4cff PM |
2410 | /* |
2411 | * Compute the per-level fanout, either using the exact fanout specified | |
2412 | * or balancing the tree, depending on CONFIG_RCU_FANOUT_EXACT. | |
2413 | */ | |
2414 | #ifdef CONFIG_RCU_FANOUT_EXACT | |
2415 | static void __init rcu_init_levelspread(struct rcu_state *rsp) | |
2416 | { | |
2417 | int i; | |
2418 | ||
0209f649 | 2419 | for (i = NUM_RCU_LVLS - 1; i > 0; i--) |
64db4cff | 2420 | rsp->levelspread[i] = CONFIG_RCU_FANOUT; |
0209f649 | 2421 | rsp->levelspread[0] = RCU_FANOUT_LEAF; |
64db4cff PM |
2422 | } |
2423 | #else /* #ifdef CONFIG_RCU_FANOUT_EXACT */ | |
2424 | static void __init rcu_init_levelspread(struct rcu_state *rsp) | |
2425 | { | |
2426 | int ccur; | |
2427 | int cprv; | |
2428 | int i; | |
2429 | ||
2430 | cprv = NR_CPUS; | |
2431 | for (i = NUM_RCU_LVLS - 1; i >= 0; i--) { | |
2432 | ccur = rsp->levelcnt[i]; | |
2433 | rsp->levelspread[i] = (cprv + ccur - 1) / ccur; | |
2434 | cprv = ccur; | |
2435 | } | |
2436 | } | |
2437 | #endif /* #else #ifdef CONFIG_RCU_FANOUT_EXACT */ | |
2438 | ||
2439 | /* | |
2440 | * Helper function for rcu_init() that initializes one rcu_state structure. | |
2441 | */ | |
394f99a9 LJ |
2442 | static void __init rcu_init_one(struct rcu_state *rsp, |
2443 | struct rcu_data __percpu *rda) | |
64db4cff | 2444 | { |
b6407e86 PM |
2445 | static char *buf[] = { "rcu_node_level_0", |
2446 | "rcu_node_level_1", | |
2447 | "rcu_node_level_2", | |
2448 | "rcu_node_level_3" }; /* Match MAX_RCU_LVLS */ | |
64db4cff PM |
2449 | int cpustride = 1; |
2450 | int i; | |
2451 | int j; | |
2452 | struct rcu_node *rnp; | |
2453 | ||
b6407e86 PM |
2454 | BUILD_BUG_ON(MAX_RCU_LVLS > ARRAY_SIZE(buf)); /* Fix buf[] init! */ |
2455 | ||
64db4cff PM |
2456 | /* Initialize the level-tracking arrays. */ |
2457 | ||
2458 | for (i = 1; i < NUM_RCU_LVLS; i++) | |
2459 | rsp->level[i] = rsp->level[i - 1] + rsp->levelcnt[i - 1]; | |
2460 | rcu_init_levelspread(rsp); | |
2461 | ||
2462 | /* Initialize the elements themselves, starting from the leaves. */ | |
2463 | ||
2464 | for (i = NUM_RCU_LVLS - 1; i >= 0; i--) { | |
2465 | cpustride *= rsp->levelspread[i]; | |
2466 | rnp = rsp->level[i]; | |
2467 | for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) { | |
1304afb2 | 2468 | raw_spin_lock_init(&rnp->lock); |
b6407e86 PM |
2469 | lockdep_set_class_and_name(&rnp->lock, |
2470 | &rcu_node_class[i], buf[i]); | |
f41d911f | 2471 | rnp->gpnum = 0; |
64db4cff PM |
2472 | rnp->qsmask = 0; |
2473 | rnp->qsmaskinit = 0; | |
2474 | rnp->grplo = j * cpustride; | |
2475 | rnp->grphi = (j + 1) * cpustride - 1; | |
2476 | if (rnp->grphi >= NR_CPUS) | |
2477 | rnp->grphi = NR_CPUS - 1; | |
2478 | if (i == 0) { | |
2479 | rnp->grpnum = 0; | |
2480 | rnp->grpmask = 0; | |
2481 | rnp->parent = NULL; | |
2482 | } else { | |
2483 | rnp->grpnum = j % rsp->levelspread[i - 1]; | |
2484 | rnp->grpmask = 1UL << rnp->grpnum; | |
2485 | rnp->parent = rsp->level[i - 1] + | |
2486 | j / rsp->levelspread[i - 1]; | |
2487 | } | |
2488 | rnp->level = i; | |
12f5f524 | 2489 | INIT_LIST_HEAD(&rnp->blkd_tasks); |
64db4cff PM |
2490 | } |
2491 | } | |
0c34029a | 2492 | |
394f99a9 | 2493 | rsp->rda = rda; |
0c34029a LJ |
2494 | rnp = rsp->level[NUM_RCU_LVLS - 1]; |
2495 | for_each_possible_cpu(i) { | |
4a90a068 | 2496 | while (i > rnp->grphi) |
0c34029a | 2497 | rnp++; |
394f99a9 | 2498 | per_cpu_ptr(rsp->rda, i)->mynode = rnp; |
0c34029a LJ |
2499 | rcu_boot_init_percpu_data(i, rsp); |
2500 | } | |
64db4cff PM |
2501 | } |
2502 | ||
9f680ab4 | 2503 | void __init rcu_init(void) |
64db4cff | 2504 | { |
017c4261 | 2505 | int cpu; |
9f680ab4 | 2506 | |
f41d911f | 2507 | rcu_bootup_announce(); |
394f99a9 LJ |
2508 | rcu_init_one(&rcu_sched_state, &rcu_sched_data); |
2509 | rcu_init_one(&rcu_bh_state, &rcu_bh_data); | |
f41d911f | 2510 | __rcu_init_preempt(); |
09223371 | 2511 | open_softirq(RCU_SOFTIRQ, rcu_process_callbacks); |
9f680ab4 PM |
2512 | |
2513 | /* | |
2514 | * We don't need protection against CPU-hotplug here because | |
2515 | * this is called early in boot, before either interrupts | |
2516 | * or the scheduler are operational. | |
2517 | */ | |
2518 | cpu_notifier(rcu_cpu_notify, 0); | |
017c4261 PM |
2519 | for_each_online_cpu(cpu) |
2520 | rcu_cpu_notify(NULL, CPU_UP_PREPARE, (void *)(long)cpu); | |
c68de209 | 2521 | check_cpu_stall_init(); |
64db4cff PM |
2522 | } |
2523 | ||
1eba8f84 | 2524 | #include "rcutree_plugin.h" |