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 | |
87de1cfd PM |
15 | * along with this program; if not, you can access it online at |
16 | * http://www.gnu.org/licenses/gpl-2.0.html. | |
64db4cff PM |
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> | |
4102adab | 44 | #include <linux/module.h> |
64db4cff PM |
45 | #include <linux/percpu.h> |
46 | #include <linux/notifier.h> | |
47 | #include <linux/cpu.h> | |
48 | #include <linux/mutex.h> | |
49 | #include <linux/time.h> | |
bbad9379 | 50 | #include <linux/kernel_stat.h> |
a26ac245 PM |
51 | #include <linux/wait.h> |
52 | #include <linux/kthread.h> | |
268bb0ce | 53 | #include <linux/prefetch.h> |
3d3b7db0 PM |
54 | #include <linux/delay.h> |
55 | #include <linux/stop_machine.h> | |
661a85dc | 56 | #include <linux/random.h> |
f7f7bac9 | 57 | #include <linux/ftrace_event.h> |
d1d74d14 | 58 | #include <linux/suspend.h> |
64db4cff | 59 | |
4102adab | 60 | #include "tree.h" |
29c00b4a | 61 | #include "rcu.h" |
9f77da9f | 62 | |
4102adab PM |
63 | MODULE_ALIAS("rcutree"); |
64 | #ifdef MODULE_PARAM_PREFIX | |
65 | #undef MODULE_PARAM_PREFIX | |
66 | #endif | |
67 | #define MODULE_PARAM_PREFIX "rcutree." | |
68 | ||
64db4cff PM |
69 | /* Data structures. */ |
70 | ||
f885b7f2 | 71 | static struct lock_class_key rcu_node_class[RCU_NUM_LVLS]; |
394f2769 | 72 | static struct lock_class_key rcu_fqs_class[RCU_NUM_LVLS]; |
88b91c7c | 73 | |
f7f7bac9 SRRH |
74 | /* |
75 | * In order to export the rcu_state name to the tracing tools, it | |
76 | * needs to be added in the __tracepoint_string section. | |
77 | * This requires defining a separate variable tp_<sname>_varname | |
78 | * that points to the string being used, and this will allow | |
79 | * the tracing userspace tools to be able to decipher the string | |
80 | * address to the matching string. | |
81 | */ | |
a8a29b3b AB |
82 | #ifdef CONFIG_TRACING |
83 | # define DEFINE_RCU_TPS(sname) \ | |
f7f7bac9 | 84 | static char sname##_varname[] = #sname; \ |
a8a29b3b AB |
85 | static const char *tp_##sname##_varname __used __tracepoint_string = sname##_varname; |
86 | # define RCU_STATE_NAME(sname) sname##_varname | |
87 | #else | |
88 | # define DEFINE_RCU_TPS(sname) | |
89 | # define RCU_STATE_NAME(sname) __stringify(sname) | |
90 | #endif | |
91 | ||
92 | #define RCU_STATE_INITIALIZER(sname, sabbr, cr) \ | |
93 | DEFINE_RCU_TPS(sname) \ | |
a41bfeb2 | 94 | struct rcu_state sname##_state = { \ |
6c90cc7b | 95 | .level = { &sname##_state.node[0] }, \ |
037b64ed | 96 | .call = cr, \ |
af446b70 | 97 | .fqs_state = RCU_GP_IDLE, \ |
42c3533e PM |
98 | .gpnum = 0UL - 300UL, \ |
99 | .completed = 0UL - 300UL, \ | |
7b2e6011 | 100 | .orphan_lock = __RAW_SPIN_LOCK_UNLOCKED(&sname##_state.orphan_lock), \ |
6c90cc7b PM |
101 | .orphan_nxttail = &sname##_state.orphan_nxtlist, \ |
102 | .orphan_donetail = &sname##_state.orphan_donelist, \ | |
7be7f0be | 103 | .barrier_mutex = __MUTEX_INITIALIZER(sname##_state.barrier_mutex), \ |
a4fbe35a | 104 | .onoff_mutex = __MUTEX_INITIALIZER(sname##_state.onoff_mutex), \ |
a8a29b3b | 105 | .name = RCU_STATE_NAME(sname), \ |
a4889858 | 106 | .abbr = sabbr, \ |
a41bfeb2 | 107 | }; \ |
11bbb235 | 108 | DEFINE_PER_CPU_SHARED_ALIGNED(struct rcu_data, sname##_data) |
64db4cff | 109 | |
a41bfeb2 SRRH |
110 | RCU_STATE_INITIALIZER(rcu_sched, 's', call_rcu_sched); |
111 | RCU_STATE_INITIALIZER(rcu_bh, 'b', call_rcu_bh); | |
b1f77b05 | 112 | |
e534165b | 113 | static struct rcu_state *rcu_state_p; |
6ce75a23 | 114 | LIST_HEAD(rcu_struct_flavors); |
27f4d280 | 115 | |
f885b7f2 PM |
116 | /* Increase (but not decrease) the CONFIG_RCU_FANOUT_LEAF at boot time. */ |
117 | static int rcu_fanout_leaf = CONFIG_RCU_FANOUT_LEAF; | |
7e5c2dfb | 118 | module_param(rcu_fanout_leaf, int, 0444); |
f885b7f2 PM |
119 | int rcu_num_lvls __read_mostly = RCU_NUM_LVLS; |
120 | static int num_rcu_lvl[] = { /* Number of rcu_nodes at specified level. */ | |
121 | NUM_RCU_LVL_0, | |
122 | NUM_RCU_LVL_1, | |
123 | NUM_RCU_LVL_2, | |
124 | NUM_RCU_LVL_3, | |
125 | NUM_RCU_LVL_4, | |
126 | }; | |
127 | int rcu_num_nodes __read_mostly = NUM_RCU_NODES; /* Total # rcu_nodes in use. */ | |
128 | ||
b0d30417 PM |
129 | /* |
130 | * The rcu_scheduler_active variable transitions from zero to one just | |
131 | * before the first task is spawned. So when this variable is zero, RCU | |
132 | * can assume that there is but one task, allowing RCU to (for example) | |
b44f6656 | 133 | * optimize synchronize_sched() to a simple barrier(). When this variable |
b0d30417 PM |
134 | * is one, RCU must actually do all the hard work required to detect real |
135 | * grace periods. This variable is also used to suppress boot-time false | |
136 | * positives from lockdep-RCU error checking. | |
137 | */ | |
bbad9379 PM |
138 | int rcu_scheduler_active __read_mostly; |
139 | EXPORT_SYMBOL_GPL(rcu_scheduler_active); | |
140 | ||
b0d30417 PM |
141 | /* |
142 | * The rcu_scheduler_fully_active variable transitions from zero to one | |
143 | * during the early_initcall() processing, which is after the scheduler | |
144 | * is capable of creating new tasks. So RCU processing (for example, | |
145 | * creating tasks for RCU priority boosting) must be delayed until after | |
146 | * rcu_scheduler_fully_active transitions from zero to one. We also | |
147 | * currently delay invocation of any RCU callbacks until after this point. | |
148 | * | |
149 | * It might later prove better for people registering RCU callbacks during | |
150 | * early boot to take responsibility for these callbacks, but one step at | |
151 | * a time. | |
152 | */ | |
153 | static int rcu_scheduler_fully_active __read_mostly; | |
154 | ||
5d01bbd1 | 155 | static void rcu_boost_kthread_setaffinity(struct rcu_node *rnp, int outgoingcpu); |
a46e0899 PM |
156 | static void invoke_rcu_core(void); |
157 | static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp); | |
a26ac245 | 158 | |
4a298656 PM |
159 | /* |
160 | * Track the rcutorture test sequence number and the update version | |
161 | * number within a given test. The rcutorture_testseq is incremented | |
162 | * on every rcutorture module load and unload, so has an odd value | |
163 | * when a test is running. The rcutorture_vernum is set to zero | |
164 | * when rcutorture starts and is incremented on each rcutorture update. | |
165 | * These variables enable correlating rcutorture output with the | |
166 | * RCU tracing information. | |
167 | */ | |
168 | unsigned long rcutorture_testseq; | |
169 | unsigned long rcutorture_vernum; | |
170 | ||
fc2219d4 PM |
171 | /* |
172 | * Return true if an RCU grace period is in progress. The ACCESS_ONCE()s | |
173 | * permit this function to be invoked without holding the root rcu_node | |
174 | * structure's ->lock, but of course results can be subject to change. | |
175 | */ | |
176 | static int rcu_gp_in_progress(struct rcu_state *rsp) | |
177 | { | |
178 | return ACCESS_ONCE(rsp->completed) != ACCESS_ONCE(rsp->gpnum); | |
179 | } | |
180 | ||
b1f77b05 | 181 | /* |
d6714c22 | 182 | * Note a quiescent state. Because we do not need to know |
b1f77b05 | 183 | * how many quiescent states passed, just if there was at least |
d6714c22 | 184 | * one since the start of the grace period, this just sets a flag. |
e4cc1f22 | 185 | * The caller must have disabled preemption. |
b1f77b05 | 186 | */ |
284a8c93 | 187 | void rcu_sched_qs(void) |
b1f77b05 | 188 | { |
284a8c93 PM |
189 | if (!__this_cpu_read(rcu_sched_data.passed_quiesce)) { |
190 | trace_rcu_grace_period(TPS("rcu_sched"), | |
191 | __this_cpu_read(rcu_sched_data.gpnum), | |
192 | TPS("cpuqs")); | |
193 | __this_cpu_write(rcu_sched_data.passed_quiesce, 1); | |
194 | } | |
b1f77b05 IM |
195 | } |
196 | ||
284a8c93 | 197 | void rcu_bh_qs(void) |
b1f77b05 | 198 | { |
284a8c93 PM |
199 | if (!__this_cpu_read(rcu_bh_data.passed_quiesce)) { |
200 | trace_rcu_grace_period(TPS("rcu_bh"), | |
201 | __this_cpu_read(rcu_bh_data.gpnum), | |
202 | TPS("cpuqs")); | |
203 | __this_cpu_write(rcu_bh_data.passed_quiesce, 1); | |
204 | } | |
b1f77b05 | 205 | } |
64db4cff | 206 | |
4a81e832 PM |
207 | static DEFINE_PER_CPU(int, rcu_sched_qs_mask); |
208 | ||
209 | static DEFINE_PER_CPU(struct rcu_dynticks, rcu_dynticks) = { | |
210 | .dynticks_nesting = DYNTICK_TASK_EXIT_IDLE, | |
211 | .dynticks = ATOMIC_INIT(1), | |
212 | #ifdef CONFIG_NO_HZ_FULL_SYSIDLE | |
213 | .dynticks_idle_nesting = DYNTICK_TASK_NEST_VALUE, | |
214 | .dynticks_idle = ATOMIC_INIT(1), | |
215 | #endif /* #ifdef CONFIG_NO_HZ_FULL_SYSIDLE */ | |
216 | }; | |
217 | ||
218 | /* | |
219 | * Let the RCU core know that this CPU has gone through the scheduler, | |
220 | * which is a quiescent state. This is called when the need for a | |
221 | * quiescent state is urgent, so we burn an atomic operation and full | |
222 | * memory barriers to let the RCU core know about it, regardless of what | |
223 | * this CPU might (or might not) do in the near future. | |
224 | * | |
225 | * We inform the RCU core by emulating a zero-duration dyntick-idle | |
226 | * period, which we in turn do by incrementing the ->dynticks counter | |
227 | * by two. | |
228 | */ | |
229 | static void rcu_momentary_dyntick_idle(void) | |
230 | { | |
231 | unsigned long flags; | |
232 | struct rcu_data *rdp; | |
233 | struct rcu_dynticks *rdtp; | |
234 | int resched_mask; | |
235 | struct rcu_state *rsp; | |
236 | ||
237 | local_irq_save(flags); | |
238 | ||
239 | /* | |
240 | * Yes, we can lose flag-setting operations. This is OK, because | |
241 | * the flag will be set again after some delay. | |
242 | */ | |
243 | resched_mask = raw_cpu_read(rcu_sched_qs_mask); | |
244 | raw_cpu_write(rcu_sched_qs_mask, 0); | |
245 | ||
246 | /* Find the flavor that needs a quiescent state. */ | |
247 | for_each_rcu_flavor(rsp) { | |
248 | rdp = raw_cpu_ptr(rsp->rda); | |
249 | if (!(resched_mask & rsp->flavor_mask)) | |
250 | continue; | |
251 | smp_mb(); /* rcu_sched_qs_mask before cond_resched_completed. */ | |
252 | if (ACCESS_ONCE(rdp->mynode->completed) != | |
253 | ACCESS_ONCE(rdp->cond_resched_completed)) | |
254 | continue; | |
255 | ||
256 | /* | |
257 | * Pretend to be momentarily idle for the quiescent state. | |
258 | * This allows the grace-period kthread to record the | |
259 | * quiescent state, with no need for this CPU to do anything | |
260 | * further. | |
261 | */ | |
262 | rdtp = this_cpu_ptr(&rcu_dynticks); | |
263 | smp_mb__before_atomic(); /* Earlier stuff before QS. */ | |
264 | atomic_add(2, &rdtp->dynticks); /* QS. */ | |
265 | smp_mb__after_atomic(); /* Later stuff after QS. */ | |
266 | break; | |
267 | } | |
268 | local_irq_restore(flags); | |
269 | } | |
270 | ||
25502a6c PM |
271 | /* |
272 | * Note a context switch. This is a quiescent state for RCU-sched, | |
273 | * and requires special handling for preemptible RCU. | |
e4cc1f22 | 274 | * The caller must have disabled preemption. |
25502a6c | 275 | */ |
38200cf2 | 276 | void rcu_note_context_switch(void) |
25502a6c | 277 | { |
f7f7bac9 | 278 | trace_rcu_utilization(TPS("Start context switch")); |
284a8c93 | 279 | rcu_sched_qs(); |
38200cf2 | 280 | rcu_preempt_note_context_switch(); |
4a81e832 PM |
281 | if (unlikely(raw_cpu_read(rcu_sched_qs_mask))) |
282 | rcu_momentary_dyntick_idle(); | |
f7f7bac9 | 283 | trace_rcu_utilization(TPS("End context switch")); |
25502a6c | 284 | } |
29ce8310 | 285 | EXPORT_SYMBOL_GPL(rcu_note_context_switch); |
25502a6c | 286 | |
878d7439 ED |
287 | static long blimit = 10; /* Maximum callbacks per rcu_do_batch. */ |
288 | static long qhimark = 10000; /* If this many pending, ignore blimit. */ | |
289 | static long qlowmark = 100; /* Once only this many pending, use blimit. */ | |
64db4cff | 290 | |
878d7439 ED |
291 | module_param(blimit, long, 0444); |
292 | module_param(qhimark, long, 0444); | |
293 | module_param(qlowmark, long, 0444); | |
3d76c082 | 294 | |
026ad283 PM |
295 | static ulong jiffies_till_first_fqs = ULONG_MAX; |
296 | static ulong jiffies_till_next_fqs = ULONG_MAX; | |
d40011f6 PM |
297 | |
298 | module_param(jiffies_till_first_fqs, ulong, 0644); | |
299 | module_param(jiffies_till_next_fqs, ulong, 0644); | |
300 | ||
4a81e832 PM |
301 | /* |
302 | * How long the grace period must be before we start recruiting | |
303 | * quiescent-state help from rcu_note_context_switch(). | |
304 | */ | |
305 | static ulong jiffies_till_sched_qs = HZ / 20; | |
306 | module_param(jiffies_till_sched_qs, ulong, 0644); | |
307 | ||
48a7639c | 308 | static bool rcu_start_gp_advanced(struct rcu_state *rsp, struct rcu_node *rnp, |
910ee45d | 309 | struct rcu_data *rdp); |
217af2a2 PM |
310 | static void force_qs_rnp(struct rcu_state *rsp, |
311 | int (*f)(struct rcu_data *rsp, bool *isidle, | |
312 | unsigned long *maxj), | |
313 | bool *isidle, unsigned long *maxj); | |
4cdfc175 | 314 | static void force_quiescent_state(struct rcu_state *rsp); |
e3950ecd | 315 | static int rcu_pending(void); |
64db4cff PM |
316 | |
317 | /* | |
d6714c22 | 318 | * Return the number of RCU-sched batches processed thus far for debug & stats. |
64db4cff | 319 | */ |
d6714c22 | 320 | long rcu_batches_completed_sched(void) |
64db4cff | 321 | { |
d6714c22 | 322 | return rcu_sched_state.completed; |
64db4cff | 323 | } |
d6714c22 | 324 | EXPORT_SYMBOL_GPL(rcu_batches_completed_sched); |
64db4cff PM |
325 | |
326 | /* | |
327 | * Return the number of RCU BH batches processed thus far for debug & stats. | |
328 | */ | |
329 | long rcu_batches_completed_bh(void) | |
330 | { | |
331 | return rcu_bh_state.completed; | |
332 | } | |
333 | EXPORT_SYMBOL_GPL(rcu_batches_completed_bh); | |
334 | ||
a381d757 ACB |
335 | /* |
336 | * Force a quiescent state. | |
337 | */ | |
338 | void rcu_force_quiescent_state(void) | |
339 | { | |
e534165b | 340 | force_quiescent_state(rcu_state_p); |
a381d757 ACB |
341 | } |
342 | EXPORT_SYMBOL_GPL(rcu_force_quiescent_state); | |
343 | ||
bf66f18e PM |
344 | /* |
345 | * Force a quiescent state for RCU BH. | |
346 | */ | |
347 | void rcu_bh_force_quiescent_state(void) | |
348 | { | |
4cdfc175 | 349 | force_quiescent_state(&rcu_bh_state); |
bf66f18e PM |
350 | } |
351 | EXPORT_SYMBOL_GPL(rcu_bh_force_quiescent_state); | |
352 | ||
afea227f PM |
353 | /* |
354 | * Show the state of the grace-period kthreads. | |
355 | */ | |
356 | void show_rcu_gp_kthreads(void) | |
357 | { | |
358 | struct rcu_state *rsp; | |
359 | ||
360 | for_each_rcu_flavor(rsp) { | |
361 | pr_info("%s: wait state: %d ->state: %#lx\n", | |
362 | rsp->name, rsp->gp_state, rsp->gp_kthread->state); | |
363 | /* sched_show_task(rsp->gp_kthread); */ | |
364 | } | |
365 | } | |
366 | EXPORT_SYMBOL_GPL(show_rcu_gp_kthreads); | |
367 | ||
4a298656 PM |
368 | /* |
369 | * Record the number of times rcutorture tests have been initiated and | |
370 | * terminated. This information allows the debugfs tracing stats to be | |
371 | * correlated to the rcutorture messages, even when the rcutorture module | |
372 | * is being repeatedly loaded and unloaded. In other words, we cannot | |
373 | * store this state in rcutorture itself. | |
374 | */ | |
375 | void rcutorture_record_test_transition(void) | |
376 | { | |
377 | rcutorture_testseq++; | |
378 | rcutorture_vernum = 0; | |
379 | } | |
380 | EXPORT_SYMBOL_GPL(rcutorture_record_test_transition); | |
381 | ||
ad0dc7f9 PM |
382 | /* |
383 | * Send along grace-period-related data for rcutorture diagnostics. | |
384 | */ | |
385 | void rcutorture_get_gp_data(enum rcutorture_type test_type, int *flags, | |
386 | unsigned long *gpnum, unsigned long *completed) | |
387 | { | |
388 | struct rcu_state *rsp = NULL; | |
389 | ||
390 | switch (test_type) { | |
391 | case RCU_FLAVOR: | |
e534165b | 392 | rsp = rcu_state_p; |
ad0dc7f9 PM |
393 | break; |
394 | case RCU_BH_FLAVOR: | |
395 | rsp = &rcu_bh_state; | |
396 | break; | |
397 | case RCU_SCHED_FLAVOR: | |
398 | rsp = &rcu_sched_state; | |
399 | break; | |
400 | default: | |
401 | break; | |
402 | } | |
403 | if (rsp != NULL) { | |
404 | *flags = ACCESS_ONCE(rsp->gp_flags); | |
405 | *gpnum = ACCESS_ONCE(rsp->gpnum); | |
406 | *completed = ACCESS_ONCE(rsp->completed); | |
407 | return; | |
408 | } | |
409 | *flags = 0; | |
410 | *gpnum = 0; | |
411 | *completed = 0; | |
412 | } | |
413 | EXPORT_SYMBOL_GPL(rcutorture_get_gp_data); | |
414 | ||
4a298656 PM |
415 | /* |
416 | * Record the number of writer passes through the current rcutorture test. | |
417 | * This is also used to correlate debugfs tracing stats with the rcutorture | |
418 | * messages. | |
419 | */ | |
420 | void rcutorture_record_progress(unsigned long vernum) | |
421 | { | |
422 | rcutorture_vernum++; | |
423 | } | |
424 | EXPORT_SYMBOL_GPL(rcutorture_record_progress); | |
425 | ||
bf66f18e PM |
426 | /* |
427 | * Force a quiescent state for RCU-sched. | |
428 | */ | |
429 | void rcu_sched_force_quiescent_state(void) | |
430 | { | |
4cdfc175 | 431 | force_quiescent_state(&rcu_sched_state); |
bf66f18e PM |
432 | } |
433 | EXPORT_SYMBOL_GPL(rcu_sched_force_quiescent_state); | |
434 | ||
64db4cff PM |
435 | /* |
436 | * Does the CPU have callbacks ready to be invoked? | |
437 | */ | |
438 | static int | |
439 | cpu_has_callbacks_ready_to_invoke(struct rcu_data *rdp) | |
440 | { | |
3fbfbf7a PM |
441 | return &rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL] && |
442 | rdp->nxttail[RCU_DONE_TAIL] != NULL; | |
64db4cff PM |
443 | } |
444 | ||
365187fb PM |
445 | /* |
446 | * Return the root node of the specified rcu_state structure. | |
447 | */ | |
448 | static struct rcu_node *rcu_get_root(struct rcu_state *rsp) | |
449 | { | |
450 | return &rsp->node[0]; | |
451 | } | |
452 | ||
453 | /* | |
454 | * Is there any need for future grace periods? | |
455 | * Interrupts must be disabled. If the caller does not hold the root | |
456 | * rnp_node structure's ->lock, the results are advisory only. | |
457 | */ | |
458 | static int rcu_future_needs_gp(struct rcu_state *rsp) | |
459 | { | |
460 | struct rcu_node *rnp = rcu_get_root(rsp); | |
461 | int idx = (ACCESS_ONCE(rnp->completed) + 1) & 0x1; | |
462 | int *fp = &rnp->need_future_gp[idx]; | |
463 | ||
464 | return ACCESS_ONCE(*fp); | |
465 | } | |
466 | ||
64db4cff | 467 | /* |
dc35c893 PM |
468 | * Does the current CPU require a not-yet-started grace period? |
469 | * The caller must have disabled interrupts to prevent races with | |
470 | * normal callback registry. | |
64db4cff PM |
471 | */ |
472 | static int | |
473 | cpu_needs_another_gp(struct rcu_state *rsp, struct rcu_data *rdp) | |
474 | { | |
dc35c893 | 475 | int i; |
3fbfbf7a | 476 | |
dc35c893 PM |
477 | if (rcu_gp_in_progress(rsp)) |
478 | return 0; /* No, a grace period is already in progress. */ | |
365187fb | 479 | if (rcu_future_needs_gp(rsp)) |
34ed6246 | 480 | return 1; /* Yes, a no-CBs CPU needs one. */ |
dc35c893 PM |
481 | if (!rdp->nxttail[RCU_NEXT_TAIL]) |
482 | return 0; /* No, this is a no-CBs (or offline) CPU. */ | |
483 | if (*rdp->nxttail[RCU_NEXT_READY_TAIL]) | |
484 | return 1; /* Yes, this CPU has newly registered callbacks. */ | |
485 | for (i = RCU_WAIT_TAIL; i < RCU_NEXT_TAIL; i++) | |
486 | if (rdp->nxttail[i - 1] != rdp->nxttail[i] && | |
487 | ULONG_CMP_LT(ACCESS_ONCE(rsp->completed), | |
488 | rdp->nxtcompleted[i])) | |
489 | return 1; /* Yes, CBs for future grace period. */ | |
490 | return 0; /* No grace period needed. */ | |
64db4cff PM |
491 | } |
492 | ||
9b2e4f18 | 493 | /* |
adf5091e | 494 | * rcu_eqs_enter_common - current CPU is moving towards extended quiescent state |
9b2e4f18 PM |
495 | * |
496 | * If the new value of the ->dynticks_nesting counter now is zero, | |
497 | * we really have entered idle, and must do the appropriate accounting. | |
498 | * The caller must have disabled interrupts. | |
499 | */ | |
28ced795 | 500 | static void rcu_eqs_enter_common(long long oldval, bool user) |
9b2e4f18 | 501 | { |
96d3fd0d PM |
502 | struct rcu_state *rsp; |
503 | struct rcu_data *rdp; | |
28ced795 | 504 | struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks); |
96d3fd0d | 505 | |
f7f7bac9 | 506 | trace_rcu_dyntick(TPS("Start"), oldval, rdtp->dynticks_nesting); |
cb349ca9 | 507 | if (!user && !is_idle_task(current)) { |
289828e6 PM |
508 | struct task_struct *idle __maybe_unused = |
509 | idle_task(smp_processor_id()); | |
0989cb46 | 510 | |
f7f7bac9 | 511 | trace_rcu_dyntick(TPS("Error on entry: not idle task"), oldval, 0); |
bf1304e9 | 512 | ftrace_dump(DUMP_ORIG); |
0989cb46 PM |
513 | WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s", |
514 | current->pid, current->comm, | |
515 | idle->pid, idle->comm); /* must be idle task! */ | |
9b2e4f18 | 516 | } |
96d3fd0d PM |
517 | for_each_rcu_flavor(rsp) { |
518 | rdp = this_cpu_ptr(rsp->rda); | |
519 | do_nocb_deferred_wakeup(rdp); | |
520 | } | |
198bbf81 | 521 | rcu_prepare_for_idle(); |
9b2e4f18 | 522 | /* CPUs seeing atomic_inc() must see prior RCU read-side crit sects */ |
4e857c58 | 523 | smp_mb__before_atomic(); /* See above. */ |
9b2e4f18 | 524 | atomic_inc(&rdtp->dynticks); |
4e857c58 | 525 | smp_mb__after_atomic(); /* Force ordering with next sojourn. */ |
9b2e4f18 | 526 | WARN_ON_ONCE(atomic_read(&rdtp->dynticks) & 0x1); |
176f8f7a | 527 | rcu_dynticks_task_enter(); |
c44e2cdd PM |
528 | |
529 | /* | |
adf5091e | 530 | * It is illegal to enter an extended quiescent state while |
c44e2cdd PM |
531 | * in an RCU read-side critical section. |
532 | */ | |
533 | rcu_lockdep_assert(!lock_is_held(&rcu_lock_map), | |
534 | "Illegal idle entry in RCU read-side critical section."); | |
535 | rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map), | |
536 | "Illegal idle entry in RCU-bh read-side critical section."); | |
537 | rcu_lockdep_assert(!lock_is_held(&rcu_sched_lock_map), | |
538 | "Illegal idle entry in RCU-sched read-side critical section."); | |
9b2e4f18 | 539 | } |
64db4cff | 540 | |
adf5091e FW |
541 | /* |
542 | * Enter an RCU extended quiescent state, which can be either the | |
543 | * idle loop or adaptive-tickless usermode execution. | |
64db4cff | 544 | */ |
adf5091e | 545 | static void rcu_eqs_enter(bool user) |
64db4cff | 546 | { |
4145fa7f | 547 | long long oldval; |
64db4cff PM |
548 | struct rcu_dynticks *rdtp; |
549 | ||
c9d4b0af | 550 | rdtp = this_cpu_ptr(&rcu_dynticks); |
4145fa7f | 551 | oldval = rdtp->dynticks_nesting; |
29e37d81 | 552 | WARN_ON_ONCE((oldval & DYNTICK_TASK_NEST_MASK) == 0); |
3a592405 | 553 | if ((oldval & DYNTICK_TASK_NEST_MASK) == DYNTICK_TASK_NEST_VALUE) { |
29e37d81 | 554 | rdtp->dynticks_nesting = 0; |
28ced795 | 555 | rcu_eqs_enter_common(oldval, user); |
3a592405 | 556 | } else { |
29e37d81 | 557 | rdtp->dynticks_nesting -= DYNTICK_TASK_NEST_VALUE; |
3a592405 | 558 | } |
64db4cff | 559 | } |
adf5091e FW |
560 | |
561 | /** | |
562 | * rcu_idle_enter - inform RCU that current CPU is entering idle | |
563 | * | |
564 | * Enter idle mode, in other words, -leave- the mode in which RCU | |
565 | * read-side critical sections can occur. (Though RCU read-side | |
566 | * critical sections can occur in irq handlers in idle, a possibility | |
567 | * handled by irq_enter() and irq_exit().) | |
568 | * | |
569 | * We crowbar the ->dynticks_nesting field to zero to allow for | |
570 | * the possibility of usermode upcalls having messed up our count | |
571 | * of interrupt nesting level during the prior busy period. | |
572 | */ | |
573 | void rcu_idle_enter(void) | |
574 | { | |
c5d900bf FW |
575 | unsigned long flags; |
576 | ||
577 | local_irq_save(flags); | |
cb349ca9 | 578 | rcu_eqs_enter(false); |
28ced795 | 579 | rcu_sysidle_enter(0); |
c5d900bf | 580 | local_irq_restore(flags); |
adf5091e | 581 | } |
8a2ecf47 | 582 | EXPORT_SYMBOL_GPL(rcu_idle_enter); |
64db4cff | 583 | |
2b1d5024 | 584 | #ifdef CONFIG_RCU_USER_QS |
adf5091e FW |
585 | /** |
586 | * rcu_user_enter - inform RCU that we are resuming userspace. | |
587 | * | |
588 | * Enter RCU idle mode right before resuming userspace. No use of RCU | |
589 | * is permitted between this call and rcu_user_exit(). This way the | |
590 | * CPU doesn't need to maintain the tick for RCU maintenance purposes | |
591 | * when the CPU runs in userspace. | |
592 | */ | |
593 | void rcu_user_enter(void) | |
594 | { | |
91d1aa43 | 595 | rcu_eqs_enter(1); |
adf5091e | 596 | } |
2b1d5024 | 597 | #endif /* CONFIG_RCU_USER_QS */ |
19dd1591 | 598 | |
9b2e4f18 PM |
599 | /** |
600 | * rcu_irq_exit - inform RCU that current CPU is exiting irq towards idle | |
601 | * | |
602 | * Exit from an interrupt handler, which might possibly result in entering | |
603 | * idle mode, in other words, leaving the mode in which read-side critical | |
604 | * sections can occur. | |
64db4cff | 605 | * |
9b2e4f18 PM |
606 | * This code assumes that the idle loop never does anything that might |
607 | * result in unbalanced calls to irq_enter() and irq_exit(). If your | |
608 | * architecture violates this assumption, RCU will give you what you | |
609 | * deserve, good and hard. But very infrequently and irreproducibly. | |
610 | * | |
611 | * Use things like work queues to work around this limitation. | |
612 | * | |
613 | * You have been warned. | |
64db4cff | 614 | */ |
9b2e4f18 | 615 | void rcu_irq_exit(void) |
64db4cff PM |
616 | { |
617 | unsigned long flags; | |
4145fa7f | 618 | long long oldval; |
64db4cff PM |
619 | struct rcu_dynticks *rdtp; |
620 | ||
621 | local_irq_save(flags); | |
c9d4b0af | 622 | rdtp = this_cpu_ptr(&rcu_dynticks); |
4145fa7f | 623 | oldval = rdtp->dynticks_nesting; |
9b2e4f18 PM |
624 | rdtp->dynticks_nesting--; |
625 | WARN_ON_ONCE(rdtp->dynticks_nesting < 0); | |
b6fc6020 | 626 | if (rdtp->dynticks_nesting) |
f7f7bac9 | 627 | trace_rcu_dyntick(TPS("--="), oldval, rdtp->dynticks_nesting); |
b6fc6020 | 628 | else |
28ced795 CL |
629 | rcu_eqs_enter_common(oldval, true); |
630 | rcu_sysidle_enter(1); | |
9b2e4f18 PM |
631 | local_irq_restore(flags); |
632 | } | |
633 | ||
634 | /* | |
adf5091e | 635 | * rcu_eqs_exit_common - current CPU moving away from extended quiescent state |
9b2e4f18 PM |
636 | * |
637 | * If the new value of the ->dynticks_nesting counter was previously zero, | |
638 | * we really have exited idle, and must do the appropriate accounting. | |
639 | * The caller must have disabled interrupts. | |
640 | */ | |
28ced795 | 641 | static void rcu_eqs_exit_common(long long oldval, int user) |
9b2e4f18 | 642 | { |
28ced795 CL |
643 | struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks); |
644 | ||
176f8f7a | 645 | rcu_dynticks_task_exit(); |
4e857c58 | 646 | smp_mb__before_atomic(); /* Force ordering w/previous sojourn. */ |
23b5c8fa PM |
647 | atomic_inc(&rdtp->dynticks); |
648 | /* CPUs seeing atomic_inc() must see later RCU read-side crit sects */ | |
4e857c58 | 649 | smp_mb__after_atomic(); /* See above. */ |
23b5c8fa | 650 | WARN_ON_ONCE(!(atomic_read(&rdtp->dynticks) & 0x1)); |
8fa7845d | 651 | rcu_cleanup_after_idle(); |
f7f7bac9 | 652 | trace_rcu_dyntick(TPS("End"), oldval, rdtp->dynticks_nesting); |
cb349ca9 | 653 | if (!user && !is_idle_task(current)) { |
289828e6 PM |
654 | struct task_struct *idle __maybe_unused = |
655 | idle_task(smp_processor_id()); | |
0989cb46 | 656 | |
f7f7bac9 | 657 | trace_rcu_dyntick(TPS("Error on exit: not idle task"), |
4145fa7f | 658 | oldval, rdtp->dynticks_nesting); |
bf1304e9 | 659 | ftrace_dump(DUMP_ORIG); |
0989cb46 PM |
660 | WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s", |
661 | current->pid, current->comm, | |
662 | idle->pid, idle->comm); /* must be idle task! */ | |
9b2e4f18 PM |
663 | } |
664 | } | |
665 | ||
adf5091e FW |
666 | /* |
667 | * Exit an RCU extended quiescent state, which can be either the | |
668 | * idle loop or adaptive-tickless usermode execution. | |
9b2e4f18 | 669 | */ |
adf5091e | 670 | static void rcu_eqs_exit(bool user) |
9b2e4f18 | 671 | { |
9b2e4f18 PM |
672 | struct rcu_dynticks *rdtp; |
673 | long long oldval; | |
674 | ||
c9d4b0af | 675 | rdtp = this_cpu_ptr(&rcu_dynticks); |
9b2e4f18 | 676 | oldval = rdtp->dynticks_nesting; |
29e37d81 | 677 | WARN_ON_ONCE(oldval < 0); |
3a592405 | 678 | if (oldval & DYNTICK_TASK_NEST_MASK) { |
29e37d81 | 679 | rdtp->dynticks_nesting += DYNTICK_TASK_NEST_VALUE; |
3a592405 | 680 | } else { |
29e37d81 | 681 | rdtp->dynticks_nesting = DYNTICK_TASK_EXIT_IDLE; |
28ced795 | 682 | rcu_eqs_exit_common(oldval, user); |
3a592405 | 683 | } |
9b2e4f18 | 684 | } |
adf5091e FW |
685 | |
686 | /** | |
687 | * rcu_idle_exit - inform RCU that current CPU is leaving idle | |
688 | * | |
689 | * Exit idle mode, in other words, -enter- the mode in which RCU | |
690 | * read-side critical sections can occur. | |
691 | * | |
692 | * We crowbar the ->dynticks_nesting field to DYNTICK_TASK_NEST to | |
693 | * allow for the possibility of usermode upcalls messing up our count | |
694 | * of interrupt nesting level during the busy period that is just | |
695 | * now starting. | |
696 | */ | |
697 | void rcu_idle_exit(void) | |
698 | { | |
c5d900bf FW |
699 | unsigned long flags; |
700 | ||
701 | local_irq_save(flags); | |
cb349ca9 | 702 | rcu_eqs_exit(false); |
28ced795 | 703 | rcu_sysidle_exit(0); |
c5d900bf | 704 | local_irq_restore(flags); |
adf5091e | 705 | } |
8a2ecf47 | 706 | EXPORT_SYMBOL_GPL(rcu_idle_exit); |
9b2e4f18 | 707 | |
2b1d5024 | 708 | #ifdef CONFIG_RCU_USER_QS |
adf5091e FW |
709 | /** |
710 | * rcu_user_exit - inform RCU that we are exiting userspace. | |
711 | * | |
712 | * Exit RCU idle mode while entering the kernel because it can | |
713 | * run a RCU read side critical section anytime. | |
714 | */ | |
715 | void rcu_user_exit(void) | |
716 | { | |
91d1aa43 | 717 | rcu_eqs_exit(1); |
adf5091e | 718 | } |
2b1d5024 | 719 | #endif /* CONFIG_RCU_USER_QS */ |
19dd1591 | 720 | |
9b2e4f18 PM |
721 | /** |
722 | * rcu_irq_enter - inform RCU that current CPU is entering irq away from idle | |
723 | * | |
724 | * Enter an interrupt handler, which might possibly result in exiting | |
725 | * idle mode, in other words, entering the mode in which read-side critical | |
726 | * sections can occur. | |
727 | * | |
728 | * Note that the Linux kernel is fully capable of entering an interrupt | |
729 | * handler that it never exits, for example when doing upcalls to | |
730 | * user mode! This code assumes that the idle loop never does upcalls to | |
731 | * user mode. If your architecture does do upcalls from the idle loop (or | |
732 | * does anything else that results in unbalanced calls to the irq_enter() | |
733 | * and irq_exit() functions), RCU will give you what you deserve, good | |
734 | * and hard. But very infrequently and irreproducibly. | |
735 | * | |
736 | * Use things like work queues to work around this limitation. | |
737 | * | |
738 | * You have been warned. | |
739 | */ | |
740 | void rcu_irq_enter(void) | |
741 | { | |
742 | unsigned long flags; | |
743 | struct rcu_dynticks *rdtp; | |
744 | long long oldval; | |
745 | ||
746 | local_irq_save(flags); | |
c9d4b0af | 747 | rdtp = this_cpu_ptr(&rcu_dynticks); |
9b2e4f18 PM |
748 | oldval = rdtp->dynticks_nesting; |
749 | rdtp->dynticks_nesting++; | |
750 | WARN_ON_ONCE(rdtp->dynticks_nesting == 0); | |
b6fc6020 | 751 | if (oldval) |
f7f7bac9 | 752 | trace_rcu_dyntick(TPS("++="), oldval, rdtp->dynticks_nesting); |
b6fc6020 | 753 | else |
28ced795 CL |
754 | rcu_eqs_exit_common(oldval, true); |
755 | rcu_sysidle_exit(1); | |
64db4cff | 756 | local_irq_restore(flags); |
64db4cff PM |
757 | } |
758 | ||
759 | /** | |
760 | * rcu_nmi_enter - inform RCU of entry to NMI context | |
761 | * | |
734d1680 PM |
762 | * If the CPU was idle from RCU's viewpoint, update rdtp->dynticks and |
763 | * rdtp->dynticks_nmi_nesting to let the RCU grace-period handling know | |
764 | * that the CPU is active. This implementation permits nested NMIs, as | |
765 | * long as the nesting level does not overflow an int. (You will probably | |
766 | * run out of stack space first.) | |
64db4cff PM |
767 | */ |
768 | void rcu_nmi_enter(void) | |
769 | { | |
c9d4b0af | 770 | struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks); |
734d1680 | 771 | int incby = 2; |
64db4cff | 772 | |
734d1680 PM |
773 | /* Complain about underflow. */ |
774 | WARN_ON_ONCE(rdtp->dynticks_nmi_nesting < 0); | |
775 | ||
776 | /* | |
777 | * If idle from RCU viewpoint, atomically increment ->dynticks | |
778 | * to mark non-idle and increment ->dynticks_nmi_nesting by one. | |
779 | * Otherwise, increment ->dynticks_nmi_nesting by two. This means | |
780 | * if ->dynticks_nmi_nesting is equal to one, we are guaranteed | |
781 | * to be in the outermost NMI handler that interrupted an RCU-idle | |
782 | * period (observation due to Andy Lutomirski). | |
783 | */ | |
784 | if (!(atomic_read(&rdtp->dynticks) & 0x1)) { | |
785 | smp_mb__before_atomic(); /* Force delay from prior write. */ | |
786 | atomic_inc(&rdtp->dynticks); | |
787 | /* atomic_inc() before later RCU read-side crit sects */ | |
788 | smp_mb__after_atomic(); /* See above. */ | |
789 | WARN_ON_ONCE(!(atomic_read(&rdtp->dynticks) & 0x1)); | |
790 | incby = 1; | |
791 | } | |
792 | rdtp->dynticks_nmi_nesting += incby; | |
793 | barrier(); | |
64db4cff PM |
794 | } |
795 | ||
796 | /** | |
797 | * rcu_nmi_exit - inform RCU of exit from NMI context | |
798 | * | |
734d1680 PM |
799 | * If we are returning from the outermost NMI handler that interrupted an |
800 | * RCU-idle period, update rdtp->dynticks and rdtp->dynticks_nmi_nesting | |
801 | * to let the RCU grace-period handling know that the CPU is back to | |
802 | * being RCU-idle. | |
64db4cff PM |
803 | */ |
804 | void rcu_nmi_exit(void) | |
805 | { | |
c9d4b0af | 806 | struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks); |
64db4cff | 807 | |
734d1680 PM |
808 | /* |
809 | * Check for ->dynticks_nmi_nesting underflow and bad ->dynticks. | |
810 | * (We are exiting an NMI handler, so RCU better be paying attention | |
811 | * to us!) | |
812 | */ | |
813 | WARN_ON_ONCE(rdtp->dynticks_nmi_nesting <= 0); | |
814 | WARN_ON_ONCE(!(atomic_read(&rdtp->dynticks) & 0x1)); | |
815 | ||
816 | /* | |
817 | * If the nesting level is not 1, the CPU wasn't RCU-idle, so | |
818 | * leave it in non-RCU-idle state. | |
819 | */ | |
820 | if (rdtp->dynticks_nmi_nesting != 1) { | |
821 | rdtp->dynticks_nmi_nesting -= 2; | |
64db4cff | 822 | return; |
734d1680 PM |
823 | } |
824 | ||
825 | /* This NMI interrupted an RCU-idle CPU, restore RCU-idleness. */ | |
826 | rdtp->dynticks_nmi_nesting = 0; | |
23b5c8fa | 827 | /* CPUs seeing atomic_inc() must see prior RCU read-side crit sects */ |
4e857c58 | 828 | smp_mb__before_atomic(); /* See above. */ |
23b5c8fa | 829 | atomic_inc(&rdtp->dynticks); |
4e857c58 | 830 | smp_mb__after_atomic(); /* Force delay to next write. */ |
23b5c8fa | 831 | WARN_ON_ONCE(atomic_read(&rdtp->dynticks) & 0x1); |
64db4cff PM |
832 | } |
833 | ||
834 | /** | |
5c173eb8 PM |
835 | * __rcu_is_watching - are RCU read-side critical sections safe? |
836 | * | |
837 | * Return true if RCU is watching the running CPU, which means that | |
838 | * this CPU can safely enter RCU read-side critical sections. Unlike | |
839 | * rcu_is_watching(), the caller of __rcu_is_watching() must have at | |
840 | * least disabled preemption. | |
841 | */ | |
9418fb20 | 842 | bool notrace __rcu_is_watching(void) |
5c173eb8 PM |
843 | { |
844 | return atomic_read(this_cpu_ptr(&rcu_dynticks.dynticks)) & 0x1; | |
845 | } | |
846 | ||
847 | /** | |
848 | * rcu_is_watching - see if RCU thinks that the current CPU is idle | |
64db4cff | 849 | * |
9b2e4f18 | 850 | * If the current CPU is in its idle loop and is neither in an interrupt |
34240697 | 851 | * or NMI handler, return true. |
64db4cff | 852 | */ |
9418fb20 | 853 | bool notrace rcu_is_watching(void) |
64db4cff | 854 | { |
f534ed1f | 855 | bool ret; |
34240697 PM |
856 | |
857 | preempt_disable(); | |
5c173eb8 | 858 | ret = __rcu_is_watching(); |
34240697 PM |
859 | preempt_enable(); |
860 | return ret; | |
64db4cff | 861 | } |
5c173eb8 | 862 | EXPORT_SYMBOL_GPL(rcu_is_watching); |
64db4cff | 863 | |
62fde6ed | 864 | #if defined(CONFIG_PROVE_RCU) && defined(CONFIG_HOTPLUG_CPU) |
c0d6d01b PM |
865 | |
866 | /* | |
867 | * Is the current CPU online? Disable preemption to avoid false positives | |
868 | * that could otherwise happen due to the current CPU number being sampled, | |
869 | * this task being preempted, its old CPU being taken offline, resuming | |
870 | * on some other CPU, then determining that its old CPU is now offline. | |
871 | * It is OK to use RCU on an offline processor during initial boot, hence | |
2036d94a PM |
872 | * the check for rcu_scheduler_fully_active. Note also that it is OK |
873 | * for a CPU coming online to use RCU for one jiffy prior to marking itself | |
874 | * online in the cpu_online_mask. Similarly, it is OK for a CPU going | |
875 | * offline to continue to use RCU for one jiffy after marking itself | |
876 | * offline in the cpu_online_mask. This leniency is necessary given the | |
877 | * non-atomic nature of the online and offline processing, for example, | |
878 | * the fact that a CPU enters the scheduler after completing the CPU_DYING | |
879 | * notifiers. | |
880 | * | |
881 | * This is also why RCU internally marks CPUs online during the | |
882 | * CPU_UP_PREPARE phase and offline during the CPU_DEAD phase. | |
c0d6d01b PM |
883 | * |
884 | * Disable checking if in an NMI handler because we cannot safely report | |
885 | * errors from NMI handlers anyway. | |
886 | */ | |
887 | bool rcu_lockdep_current_cpu_online(void) | |
888 | { | |
2036d94a PM |
889 | struct rcu_data *rdp; |
890 | struct rcu_node *rnp; | |
c0d6d01b PM |
891 | bool ret; |
892 | ||
893 | if (in_nmi()) | |
f6f7ee9a | 894 | return true; |
c0d6d01b | 895 | preempt_disable(); |
c9d4b0af | 896 | rdp = this_cpu_ptr(&rcu_sched_data); |
2036d94a PM |
897 | rnp = rdp->mynode; |
898 | ret = (rdp->grpmask & rnp->qsmaskinit) || | |
c0d6d01b PM |
899 | !rcu_scheduler_fully_active; |
900 | preempt_enable(); | |
901 | return ret; | |
902 | } | |
903 | EXPORT_SYMBOL_GPL(rcu_lockdep_current_cpu_online); | |
904 | ||
62fde6ed | 905 | #endif /* #if defined(CONFIG_PROVE_RCU) && defined(CONFIG_HOTPLUG_CPU) */ |
9b2e4f18 | 906 | |
64db4cff | 907 | /** |
9b2e4f18 | 908 | * rcu_is_cpu_rrupt_from_idle - see if idle or immediately interrupted from idle |
64db4cff | 909 | * |
9b2e4f18 PM |
910 | * If the current CPU is idle or running at a first-level (not nested) |
911 | * interrupt from idle, return true. The caller must have at least | |
912 | * disabled preemption. | |
64db4cff | 913 | */ |
62e3cb14 | 914 | static int rcu_is_cpu_rrupt_from_idle(void) |
64db4cff | 915 | { |
c9d4b0af | 916 | return __this_cpu_read(rcu_dynticks.dynticks_nesting) <= 1; |
64db4cff PM |
917 | } |
918 | ||
64db4cff PM |
919 | /* |
920 | * Snapshot the specified CPU's dynticks counter so that we can later | |
921 | * credit them with an implicit quiescent state. Return 1 if this CPU | |
1eba8f84 | 922 | * is in dynticks idle mode, which is an extended quiescent state. |
64db4cff | 923 | */ |
217af2a2 PM |
924 | static int dyntick_save_progress_counter(struct rcu_data *rdp, |
925 | bool *isidle, unsigned long *maxj) | |
64db4cff | 926 | { |
23b5c8fa | 927 | rdp->dynticks_snap = atomic_add_return(0, &rdp->dynticks->dynticks); |
0edd1b17 | 928 | rcu_sysidle_check_cpu(rdp, isidle, maxj); |
7941dbde ACB |
929 | if ((rdp->dynticks_snap & 0x1) == 0) { |
930 | trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("dti")); | |
931 | return 1; | |
932 | } else { | |
933 | return 0; | |
934 | } | |
64db4cff PM |
935 | } |
936 | ||
6193c76a PM |
937 | /* |
938 | * This function really isn't for public consumption, but RCU is special in | |
939 | * that context switches can allow the state machine to make progress. | |
940 | */ | |
941 | extern void resched_cpu(int cpu); | |
942 | ||
64db4cff PM |
943 | /* |
944 | * Return true if the specified CPU has passed through a quiescent | |
945 | * state by virtue of being in or having passed through an dynticks | |
946 | * idle state since the last call to dyntick_save_progress_counter() | |
a82dcc76 | 947 | * for this same CPU, or by virtue of having been offline. |
64db4cff | 948 | */ |
217af2a2 PM |
949 | static int rcu_implicit_dynticks_qs(struct rcu_data *rdp, |
950 | bool *isidle, unsigned long *maxj) | |
64db4cff | 951 | { |
7eb4f455 | 952 | unsigned int curr; |
4a81e832 | 953 | int *rcrmp; |
7eb4f455 | 954 | unsigned int snap; |
64db4cff | 955 | |
7eb4f455 PM |
956 | curr = (unsigned int)atomic_add_return(0, &rdp->dynticks->dynticks); |
957 | snap = (unsigned int)rdp->dynticks_snap; | |
64db4cff PM |
958 | |
959 | /* | |
960 | * If the CPU passed through or entered a dynticks idle phase with | |
961 | * no active irq/NMI handlers, then we can safely pretend that the CPU | |
962 | * already acknowledged the request to pass through a quiescent | |
963 | * state. Either way, that CPU cannot possibly be in an RCU | |
964 | * read-side critical section that started before the beginning | |
965 | * of the current RCU grace period. | |
966 | */ | |
7eb4f455 | 967 | if ((curr & 0x1) == 0 || UINT_CMP_GE(curr, snap + 2)) { |
f7f7bac9 | 968 | trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("dti")); |
64db4cff PM |
969 | rdp->dynticks_fqs++; |
970 | return 1; | |
971 | } | |
972 | ||
a82dcc76 PM |
973 | /* |
974 | * Check for the CPU being offline, but only if the grace period | |
975 | * is old enough. We don't need to worry about the CPU changing | |
976 | * state: If we see it offline even once, it has been through a | |
977 | * quiescent state. | |
978 | * | |
979 | * The reason for insisting that the grace period be at least | |
980 | * one jiffy old is that CPUs that are not quite online and that | |
981 | * have just gone offline can still execute RCU read-side critical | |
982 | * sections. | |
983 | */ | |
984 | if (ULONG_CMP_GE(rdp->rsp->gp_start + 2, jiffies)) | |
985 | return 0; /* Grace period is not old enough. */ | |
986 | barrier(); | |
987 | if (cpu_is_offline(rdp->cpu)) { | |
f7f7bac9 | 988 | trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("ofl")); |
a82dcc76 PM |
989 | rdp->offline_fqs++; |
990 | return 1; | |
991 | } | |
65d798f0 PM |
992 | |
993 | /* | |
4a81e832 PM |
994 | * A CPU running for an extended time within the kernel can |
995 | * delay RCU grace periods. When the CPU is in NO_HZ_FULL mode, | |
996 | * even context-switching back and forth between a pair of | |
997 | * in-kernel CPU-bound tasks cannot advance grace periods. | |
998 | * So if the grace period is old enough, make the CPU pay attention. | |
999 | * Note that the unsynchronized assignments to the per-CPU | |
1000 | * rcu_sched_qs_mask variable are safe. Yes, setting of | |
1001 | * bits can be lost, but they will be set again on the next | |
1002 | * force-quiescent-state pass. So lost bit sets do not result | |
1003 | * in incorrect behavior, merely in a grace period lasting | |
1004 | * a few jiffies longer than it might otherwise. Because | |
1005 | * there are at most four threads involved, and because the | |
1006 | * updates are only once every few jiffies, the probability of | |
1007 | * lossage (and thus of slight grace-period extension) is | |
1008 | * quite low. | |
1009 | * | |
1010 | * Note that if the jiffies_till_sched_qs boot/sysfs parameter | |
1011 | * is set too high, we override with half of the RCU CPU stall | |
1012 | * warning delay. | |
6193c76a | 1013 | */ |
4a81e832 PM |
1014 | rcrmp = &per_cpu(rcu_sched_qs_mask, rdp->cpu); |
1015 | if (ULONG_CMP_GE(jiffies, | |
1016 | rdp->rsp->gp_start + jiffies_till_sched_qs) || | |
cb1e78cf | 1017 | ULONG_CMP_GE(jiffies, rdp->rsp->jiffies_resched)) { |
4a81e832 PM |
1018 | if (!(ACCESS_ONCE(*rcrmp) & rdp->rsp->flavor_mask)) { |
1019 | ACCESS_ONCE(rdp->cond_resched_completed) = | |
1020 | ACCESS_ONCE(rdp->mynode->completed); | |
1021 | smp_mb(); /* ->cond_resched_completed before *rcrmp. */ | |
1022 | ACCESS_ONCE(*rcrmp) = | |
1023 | ACCESS_ONCE(*rcrmp) + rdp->rsp->flavor_mask; | |
1024 | resched_cpu(rdp->cpu); /* Force CPU into scheduler. */ | |
1025 | rdp->rsp->jiffies_resched += 5; /* Enable beating. */ | |
1026 | } else if (ULONG_CMP_GE(jiffies, rdp->rsp->jiffies_resched)) { | |
1027 | /* Time to beat on that CPU again! */ | |
1028 | resched_cpu(rdp->cpu); /* Force CPU into scheduler. */ | |
1029 | rdp->rsp->jiffies_resched += 5; /* Re-enable beating. */ | |
1030 | } | |
6193c76a PM |
1031 | } |
1032 | ||
a82dcc76 | 1033 | return 0; |
64db4cff PM |
1034 | } |
1035 | ||
64db4cff PM |
1036 | static void record_gp_stall_check_time(struct rcu_state *rsp) |
1037 | { | |
cb1e78cf | 1038 | unsigned long j = jiffies; |
6193c76a | 1039 | unsigned long j1; |
26cdfedf PM |
1040 | |
1041 | rsp->gp_start = j; | |
1042 | smp_wmb(); /* Record start time before stall time. */ | |
6193c76a | 1043 | j1 = rcu_jiffies_till_stall_check(); |
4fc5b755 | 1044 | ACCESS_ONCE(rsp->jiffies_stall) = j + j1; |
6193c76a | 1045 | rsp->jiffies_resched = j + j1 / 2; |
64db4cff PM |
1046 | } |
1047 | ||
b637a328 | 1048 | /* |
bc1dce51 | 1049 | * Dump stacks of all tasks running on stalled CPUs. |
b637a328 PM |
1050 | */ |
1051 | static void rcu_dump_cpu_stacks(struct rcu_state *rsp) | |
1052 | { | |
1053 | int cpu; | |
1054 | unsigned long flags; | |
1055 | struct rcu_node *rnp; | |
1056 | ||
1057 | rcu_for_each_leaf_node(rsp, rnp) { | |
1058 | raw_spin_lock_irqsave(&rnp->lock, flags); | |
1059 | if (rnp->qsmask != 0) { | |
1060 | for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++) | |
1061 | if (rnp->qsmask & (1UL << cpu)) | |
1062 | dump_cpu_task(rnp->grplo + cpu); | |
1063 | } | |
1064 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | |
1065 | } | |
1066 | } | |
1067 | ||
64db4cff PM |
1068 | static void print_other_cpu_stall(struct rcu_state *rsp) |
1069 | { | |
1070 | int cpu; | |
1071 | long delta; | |
1072 | unsigned long flags; | |
285fe294 | 1073 | int ndetected = 0; |
64db4cff | 1074 | struct rcu_node *rnp = rcu_get_root(rsp); |
53bb857c | 1075 | long totqlen = 0; |
64db4cff PM |
1076 | |
1077 | /* Only let one CPU complain about others per time interval. */ | |
1078 | ||
1304afb2 | 1079 | raw_spin_lock_irqsave(&rnp->lock, flags); |
4fc5b755 | 1080 | delta = jiffies - ACCESS_ONCE(rsp->jiffies_stall); |
fc2219d4 | 1081 | if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) { |
1304afb2 | 1082 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
1083 | return; |
1084 | } | |
4fc5b755 | 1085 | ACCESS_ONCE(rsp->jiffies_stall) = jiffies + 3 * rcu_jiffies_till_stall_check() + 3; |
1304afb2 | 1086 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff | 1087 | |
8cdd32a9 PM |
1088 | /* |
1089 | * OK, time to rat on our buddy... | |
1090 | * See Documentation/RCU/stallwarn.txt for info on how to debug | |
1091 | * RCU CPU stall warnings. | |
1092 | */ | |
d7f3e207 | 1093 | pr_err("INFO: %s detected stalls on CPUs/tasks:", |
4300aa64 | 1094 | rsp->name); |
a858af28 | 1095 | print_cpu_stall_info_begin(); |
a0b6c9a7 | 1096 | rcu_for_each_leaf_node(rsp, rnp) { |
3acd9eb3 | 1097 | raw_spin_lock_irqsave(&rnp->lock, flags); |
9bc8b558 | 1098 | ndetected += rcu_print_task_stall(rnp); |
c8020a67 PM |
1099 | if (rnp->qsmask != 0) { |
1100 | for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++) | |
1101 | if (rnp->qsmask & (1UL << cpu)) { | |
1102 | print_cpu_stall_info(rsp, | |
1103 | rnp->grplo + cpu); | |
1104 | ndetected++; | |
1105 | } | |
1106 | } | |
3acd9eb3 | 1107 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff | 1108 | } |
a858af28 PM |
1109 | |
1110 | /* | |
1111 | * Now rat on any tasks that got kicked up to the root rcu_node | |
1112 | * due to CPU offlining. | |
1113 | */ | |
1114 | rnp = rcu_get_root(rsp); | |
1115 | raw_spin_lock_irqsave(&rnp->lock, flags); | |
285fe294 | 1116 | ndetected += rcu_print_task_stall(rnp); |
a858af28 PM |
1117 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
1118 | ||
1119 | print_cpu_stall_info_end(); | |
53bb857c PM |
1120 | for_each_possible_cpu(cpu) |
1121 | totqlen += per_cpu_ptr(rsp->rda, cpu)->qlen; | |
83ebe63e | 1122 | pr_cont("(detected by %d, t=%ld jiffies, g=%ld, c=%ld, q=%lu)\n", |
eee05882 | 1123 | smp_processor_id(), (long)(jiffies - rsp->gp_start), |
83ebe63e | 1124 | (long)rsp->gpnum, (long)rsp->completed, totqlen); |
9bc8b558 | 1125 | if (ndetected == 0) |
d7f3e207 | 1126 | pr_err("INFO: Stall ended before state dump start\n"); |
bc1dce51 | 1127 | else |
b637a328 | 1128 | rcu_dump_cpu_stacks(rsp); |
c1dc0b9c | 1129 | |
4cdfc175 | 1130 | /* Complain about tasks blocking the grace period. */ |
1ed509a2 PM |
1131 | |
1132 | rcu_print_detail_task_stall(rsp); | |
1133 | ||
4cdfc175 | 1134 | force_quiescent_state(rsp); /* Kick them all. */ |
64db4cff PM |
1135 | } |
1136 | ||
1137 | static void print_cpu_stall(struct rcu_state *rsp) | |
1138 | { | |
53bb857c | 1139 | int cpu; |
64db4cff PM |
1140 | unsigned long flags; |
1141 | struct rcu_node *rnp = rcu_get_root(rsp); | |
53bb857c | 1142 | long totqlen = 0; |
64db4cff | 1143 | |
8cdd32a9 PM |
1144 | /* |
1145 | * OK, time to rat on ourselves... | |
1146 | * See Documentation/RCU/stallwarn.txt for info on how to debug | |
1147 | * RCU CPU stall warnings. | |
1148 | */ | |
d7f3e207 | 1149 | pr_err("INFO: %s self-detected stall on CPU", rsp->name); |
a858af28 PM |
1150 | print_cpu_stall_info_begin(); |
1151 | print_cpu_stall_info(rsp, smp_processor_id()); | |
1152 | print_cpu_stall_info_end(); | |
53bb857c PM |
1153 | for_each_possible_cpu(cpu) |
1154 | totqlen += per_cpu_ptr(rsp->rda, cpu)->qlen; | |
83ebe63e PM |
1155 | pr_cont(" (t=%lu jiffies g=%ld c=%ld q=%lu)\n", |
1156 | jiffies - rsp->gp_start, | |
1157 | (long)rsp->gpnum, (long)rsp->completed, totqlen); | |
bc1dce51 | 1158 | rcu_dump_cpu_stacks(rsp); |
c1dc0b9c | 1159 | |
1304afb2 | 1160 | raw_spin_lock_irqsave(&rnp->lock, flags); |
4fc5b755 IM |
1161 | if (ULONG_CMP_GE(jiffies, ACCESS_ONCE(rsp->jiffies_stall))) |
1162 | ACCESS_ONCE(rsp->jiffies_stall) = jiffies + | |
6bfc09e2 | 1163 | 3 * rcu_jiffies_till_stall_check() + 3; |
1304afb2 | 1164 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
c1dc0b9c | 1165 | |
b021fe3e PZ |
1166 | /* |
1167 | * Attempt to revive the RCU machinery by forcing a context switch. | |
1168 | * | |
1169 | * A context switch would normally allow the RCU state machine to make | |
1170 | * progress and it could be we're stuck in kernel space without context | |
1171 | * switches for an entirely unreasonable amount of time. | |
1172 | */ | |
1173 | resched_cpu(smp_processor_id()); | |
64db4cff PM |
1174 | } |
1175 | ||
1176 | static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp) | |
1177 | { | |
26cdfedf PM |
1178 | unsigned long completed; |
1179 | unsigned long gpnum; | |
1180 | unsigned long gps; | |
bad6e139 PM |
1181 | unsigned long j; |
1182 | unsigned long js; | |
64db4cff PM |
1183 | struct rcu_node *rnp; |
1184 | ||
26cdfedf | 1185 | if (rcu_cpu_stall_suppress || !rcu_gp_in_progress(rsp)) |
c68de209 | 1186 | return; |
cb1e78cf | 1187 | j = jiffies; |
26cdfedf PM |
1188 | |
1189 | /* | |
1190 | * Lots of memory barriers to reject false positives. | |
1191 | * | |
1192 | * The idea is to pick up rsp->gpnum, then rsp->jiffies_stall, | |
1193 | * then rsp->gp_start, and finally rsp->completed. These values | |
1194 | * are updated in the opposite order with memory barriers (or | |
1195 | * equivalent) during grace-period initialization and cleanup. | |
1196 | * Now, a false positive can occur if we get an new value of | |
1197 | * rsp->gp_start and a old value of rsp->jiffies_stall. But given | |
1198 | * the memory barriers, the only way that this can happen is if one | |
1199 | * grace period ends and another starts between these two fetches. | |
1200 | * Detect this by comparing rsp->completed with the previous fetch | |
1201 | * from rsp->gpnum. | |
1202 | * | |
1203 | * Given this check, comparisons of jiffies, rsp->jiffies_stall, | |
1204 | * and rsp->gp_start suffice to forestall false positives. | |
1205 | */ | |
1206 | gpnum = ACCESS_ONCE(rsp->gpnum); | |
1207 | smp_rmb(); /* Pick up ->gpnum first... */ | |
bad6e139 | 1208 | js = ACCESS_ONCE(rsp->jiffies_stall); |
26cdfedf PM |
1209 | smp_rmb(); /* ...then ->jiffies_stall before the rest... */ |
1210 | gps = ACCESS_ONCE(rsp->gp_start); | |
1211 | smp_rmb(); /* ...and finally ->gp_start before ->completed. */ | |
1212 | completed = ACCESS_ONCE(rsp->completed); | |
1213 | if (ULONG_CMP_GE(completed, gpnum) || | |
1214 | ULONG_CMP_LT(j, js) || | |
1215 | ULONG_CMP_GE(gps, js)) | |
1216 | return; /* No stall or GP completed since entering function. */ | |
64db4cff | 1217 | rnp = rdp->mynode; |
c96ea7cf | 1218 | if (rcu_gp_in_progress(rsp) && |
26cdfedf | 1219 | (ACCESS_ONCE(rnp->qsmask) & rdp->grpmask)) { |
64db4cff PM |
1220 | |
1221 | /* We haven't checked in, so go dump stack. */ | |
1222 | print_cpu_stall(rsp); | |
1223 | ||
bad6e139 PM |
1224 | } else if (rcu_gp_in_progress(rsp) && |
1225 | ULONG_CMP_GE(j, js + RCU_STALL_RAT_DELAY)) { | |
64db4cff | 1226 | |
bad6e139 | 1227 | /* They had a few time units to dump stack, so complain. */ |
64db4cff PM |
1228 | print_other_cpu_stall(rsp); |
1229 | } | |
1230 | } | |
1231 | ||
53d84e00 PM |
1232 | /** |
1233 | * rcu_cpu_stall_reset - prevent further stall warnings in current grace period | |
1234 | * | |
1235 | * Set the stall-warning timeout way off into the future, thus preventing | |
1236 | * any RCU CPU stall-warning messages from appearing in the current set of | |
1237 | * RCU grace periods. | |
1238 | * | |
1239 | * The caller must disable hard irqs. | |
1240 | */ | |
1241 | void rcu_cpu_stall_reset(void) | |
1242 | { | |
6ce75a23 PM |
1243 | struct rcu_state *rsp; |
1244 | ||
1245 | for_each_rcu_flavor(rsp) | |
4fc5b755 | 1246 | ACCESS_ONCE(rsp->jiffies_stall) = jiffies + ULONG_MAX / 2; |
53d84e00 PM |
1247 | } |
1248 | ||
3f5d3ea6 PM |
1249 | /* |
1250 | * Initialize the specified rcu_data structure's callback list to empty. | |
1251 | */ | |
1252 | static void init_callback_list(struct rcu_data *rdp) | |
1253 | { | |
1254 | int i; | |
1255 | ||
34ed6246 PM |
1256 | if (init_nocb_callback_list(rdp)) |
1257 | return; | |
3f5d3ea6 PM |
1258 | rdp->nxtlist = NULL; |
1259 | for (i = 0; i < RCU_NEXT_SIZE; i++) | |
1260 | rdp->nxttail[i] = &rdp->nxtlist; | |
1261 | } | |
1262 | ||
dc35c893 PM |
1263 | /* |
1264 | * Determine the value that ->completed will have at the end of the | |
1265 | * next subsequent grace period. This is used to tag callbacks so that | |
1266 | * a CPU can invoke callbacks in a timely fashion even if that CPU has | |
1267 | * been dyntick-idle for an extended period with callbacks under the | |
1268 | * influence of RCU_FAST_NO_HZ. | |
1269 | * | |
1270 | * The caller must hold rnp->lock with interrupts disabled. | |
1271 | */ | |
1272 | static unsigned long rcu_cbs_completed(struct rcu_state *rsp, | |
1273 | struct rcu_node *rnp) | |
1274 | { | |
1275 | /* | |
1276 | * If RCU is idle, we just wait for the next grace period. | |
1277 | * But we can only be sure that RCU is idle if we are looking | |
1278 | * at the root rcu_node structure -- otherwise, a new grace | |
1279 | * period might have started, but just not yet gotten around | |
1280 | * to initializing the current non-root rcu_node structure. | |
1281 | */ | |
1282 | if (rcu_get_root(rsp) == rnp && rnp->gpnum == rnp->completed) | |
1283 | return rnp->completed + 1; | |
1284 | ||
1285 | /* | |
1286 | * Otherwise, wait for a possible partial grace period and | |
1287 | * then the subsequent full grace period. | |
1288 | */ | |
1289 | return rnp->completed + 2; | |
1290 | } | |
1291 | ||
0446be48 PM |
1292 | /* |
1293 | * Trace-event helper function for rcu_start_future_gp() and | |
1294 | * rcu_nocb_wait_gp(). | |
1295 | */ | |
1296 | static void trace_rcu_future_gp(struct rcu_node *rnp, struct rcu_data *rdp, | |
e66c33d5 | 1297 | unsigned long c, const char *s) |
0446be48 PM |
1298 | { |
1299 | trace_rcu_future_grace_period(rdp->rsp->name, rnp->gpnum, | |
1300 | rnp->completed, c, rnp->level, | |
1301 | rnp->grplo, rnp->grphi, s); | |
1302 | } | |
1303 | ||
1304 | /* | |
1305 | * Start some future grace period, as needed to handle newly arrived | |
1306 | * callbacks. The required future grace periods are recorded in each | |
48a7639c PM |
1307 | * rcu_node structure's ->need_future_gp field. Returns true if there |
1308 | * is reason to awaken the grace-period kthread. | |
0446be48 PM |
1309 | * |
1310 | * The caller must hold the specified rcu_node structure's ->lock. | |
1311 | */ | |
48a7639c PM |
1312 | static bool __maybe_unused |
1313 | rcu_start_future_gp(struct rcu_node *rnp, struct rcu_data *rdp, | |
1314 | unsigned long *c_out) | |
0446be48 PM |
1315 | { |
1316 | unsigned long c; | |
1317 | int i; | |
48a7639c | 1318 | bool ret = false; |
0446be48 PM |
1319 | struct rcu_node *rnp_root = rcu_get_root(rdp->rsp); |
1320 | ||
1321 | /* | |
1322 | * Pick up grace-period number for new callbacks. If this | |
1323 | * grace period is already marked as needed, return to the caller. | |
1324 | */ | |
1325 | c = rcu_cbs_completed(rdp->rsp, rnp); | |
f7f7bac9 | 1326 | trace_rcu_future_gp(rnp, rdp, c, TPS("Startleaf")); |
0446be48 | 1327 | if (rnp->need_future_gp[c & 0x1]) { |
f7f7bac9 | 1328 | trace_rcu_future_gp(rnp, rdp, c, TPS("Prestartleaf")); |
48a7639c | 1329 | goto out; |
0446be48 PM |
1330 | } |
1331 | ||
1332 | /* | |
1333 | * If either this rcu_node structure or the root rcu_node structure | |
1334 | * believe that a grace period is in progress, then we must wait | |
1335 | * for the one following, which is in "c". Because our request | |
1336 | * will be noticed at the end of the current grace period, we don't | |
48bd8e9b PK |
1337 | * need to explicitly start one. We only do the lockless check |
1338 | * of rnp_root's fields if the current rcu_node structure thinks | |
1339 | * there is no grace period in flight, and because we hold rnp->lock, | |
1340 | * the only possible change is when rnp_root's two fields are | |
1341 | * equal, in which case rnp_root->gpnum might be concurrently | |
1342 | * incremented. But that is OK, as it will just result in our | |
1343 | * doing some extra useless work. | |
0446be48 PM |
1344 | */ |
1345 | if (rnp->gpnum != rnp->completed || | |
48bd8e9b | 1346 | ACCESS_ONCE(rnp_root->gpnum) != ACCESS_ONCE(rnp_root->completed)) { |
0446be48 | 1347 | rnp->need_future_gp[c & 0x1]++; |
f7f7bac9 | 1348 | trace_rcu_future_gp(rnp, rdp, c, TPS("Startedleaf")); |
48a7639c | 1349 | goto out; |
0446be48 PM |
1350 | } |
1351 | ||
1352 | /* | |
1353 | * There might be no grace period in progress. If we don't already | |
1354 | * hold it, acquire the root rcu_node structure's lock in order to | |
1355 | * start one (if needed). | |
1356 | */ | |
6303b9c8 | 1357 | if (rnp != rnp_root) { |
0446be48 | 1358 | raw_spin_lock(&rnp_root->lock); |
6303b9c8 PM |
1359 | smp_mb__after_unlock_lock(); |
1360 | } | |
0446be48 PM |
1361 | |
1362 | /* | |
1363 | * Get a new grace-period number. If there really is no grace | |
1364 | * period in progress, it will be smaller than the one we obtained | |
1365 | * earlier. Adjust callbacks as needed. Note that even no-CBs | |
1366 | * CPUs have a ->nxtcompleted[] array, so no no-CBs checks needed. | |
1367 | */ | |
1368 | c = rcu_cbs_completed(rdp->rsp, rnp_root); | |
1369 | for (i = RCU_DONE_TAIL; i < RCU_NEXT_TAIL; i++) | |
1370 | if (ULONG_CMP_LT(c, rdp->nxtcompleted[i])) | |
1371 | rdp->nxtcompleted[i] = c; | |
1372 | ||
1373 | /* | |
1374 | * If the needed for the required grace period is already | |
1375 | * recorded, trace and leave. | |
1376 | */ | |
1377 | if (rnp_root->need_future_gp[c & 0x1]) { | |
f7f7bac9 | 1378 | trace_rcu_future_gp(rnp, rdp, c, TPS("Prestartedroot")); |
0446be48 PM |
1379 | goto unlock_out; |
1380 | } | |
1381 | ||
1382 | /* Record the need for the future grace period. */ | |
1383 | rnp_root->need_future_gp[c & 0x1]++; | |
1384 | ||
1385 | /* If a grace period is not already in progress, start one. */ | |
1386 | if (rnp_root->gpnum != rnp_root->completed) { | |
f7f7bac9 | 1387 | trace_rcu_future_gp(rnp, rdp, c, TPS("Startedleafroot")); |
0446be48 | 1388 | } else { |
f7f7bac9 | 1389 | trace_rcu_future_gp(rnp, rdp, c, TPS("Startedroot")); |
48a7639c | 1390 | ret = rcu_start_gp_advanced(rdp->rsp, rnp_root, rdp); |
0446be48 PM |
1391 | } |
1392 | unlock_out: | |
1393 | if (rnp != rnp_root) | |
1394 | raw_spin_unlock(&rnp_root->lock); | |
48a7639c PM |
1395 | out: |
1396 | if (c_out != NULL) | |
1397 | *c_out = c; | |
1398 | return ret; | |
0446be48 PM |
1399 | } |
1400 | ||
1401 | /* | |
1402 | * Clean up any old requests for the just-ended grace period. Also return | |
1403 | * whether any additional grace periods have been requested. Also invoke | |
1404 | * rcu_nocb_gp_cleanup() in order to wake up any no-callbacks kthreads | |
1405 | * waiting for this grace period to complete. | |
1406 | */ | |
1407 | static int rcu_future_gp_cleanup(struct rcu_state *rsp, struct rcu_node *rnp) | |
1408 | { | |
1409 | int c = rnp->completed; | |
1410 | int needmore; | |
1411 | struct rcu_data *rdp = this_cpu_ptr(rsp->rda); | |
1412 | ||
1413 | rcu_nocb_gp_cleanup(rsp, rnp); | |
1414 | rnp->need_future_gp[c & 0x1] = 0; | |
1415 | needmore = rnp->need_future_gp[(c + 1) & 0x1]; | |
f7f7bac9 SRRH |
1416 | trace_rcu_future_gp(rnp, rdp, c, |
1417 | needmore ? TPS("CleanupMore") : TPS("Cleanup")); | |
0446be48 PM |
1418 | return needmore; |
1419 | } | |
1420 | ||
48a7639c PM |
1421 | /* |
1422 | * Awaken the grace-period kthread for the specified flavor of RCU. | |
1423 | * Don't do a self-awaken, and don't bother awakening when there is | |
1424 | * nothing for the grace-period kthread to do (as in several CPUs | |
1425 | * raced to awaken, and we lost), and finally don't try to awaken | |
1426 | * a kthread that has not yet been created. | |
1427 | */ | |
1428 | static void rcu_gp_kthread_wake(struct rcu_state *rsp) | |
1429 | { | |
1430 | if (current == rsp->gp_kthread || | |
1431 | !ACCESS_ONCE(rsp->gp_flags) || | |
1432 | !rsp->gp_kthread) | |
1433 | return; | |
1434 | wake_up(&rsp->gp_wq); | |
1435 | } | |
1436 | ||
dc35c893 PM |
1437 | /* |
1438 | * If there is room, assign a ->completed number to any callbacks on | |
1439 | * this CPU that have not already been assigned. Also accelerate any | |
1440 | * callbacks that were previously assigned a ->completed number that has | |
1441 | * since proven to be too conservative, which can happen if callbacks get | |
1442 | * assigned a ->completed number while RCU is idle, but with reference to | |
1443 | * a non-root rcu_node structure. This function is idempotent, so it does | |
48a7639c PM |
1444 | * not hurt to call it repeatedly. Returns an flag saying that we should |
1445 | * awaken the RCU grace-period kthread. | |
dc35c893 PM |
1446 | * |
1447 | * The caller must hold rnp->lock with interrupts disabled. | |
1448 | */ | |
48a7639c | 1449 | static bool rcu_accelerate_cbs(struct rcu_state *rsp, struct rcu_node *rnp, |
dc35c893 PM |
1450 | struct rcu_data *rdp) |
1451 | { | |
1452 | unsigned long c; | |
1453 | int i; | |
48a7639c | 1454 | bool ret; |
dc35c893 PM |
1455 | |
1456 | /* If the CPU has no callbacks, nothing to do. */ | |
1457 | if (!rdp->nxttail[RCU_NEXT_TAIL] || !*rdp->nxttail[RCU_DONE_TAIL]) | |
48a7639c | 1458 | return false; |
dc35c893 PM |
1459 | |
1460 | /* | |
1461 | * Starting from the sublist containing the callbacks most | |
1462 | * recently assigned a ->completed number and working down, find the | |
1463 | * first sublist that is not assignable to an upcoming grace period. | |
1464 | * Such a sublist has something in it (first two tests) and has | |
1465 | * a ->completed number assigned that will complete sooner than | |
1466 | * the ->completed number for newly arrived callbacks (last test). | |
1467 | * | |
1468 | * The key point is that any later sublist can be assigned the | |
1469 | * same ->completed number as the newly arrived callbacks, which | |
1470 | * means that the callbacks in any of these later sublist can be | |
1471 | * grouped into a single sublist, whether or not they have already | |
1472 | * been assigned a ->completed number. | |
1473 | */ | |
1474 | c = rcu_cbs_completed(rsp, rnp); | |
1475 | for (i = RCU_NEXT_TAIL - 1; i > RCU_DONE_TAIL; i--) | |
1476 | if (rdp->nxttail[i] != rdp->nxttail[i - 1] && | |
1477 | !ULONG_CMP_GE(rdp->nxtcompleted[i], c)) | |
1478 | break; | |
1479 | ||
1480 | /* | |
1481 | * If there are no sublist for unassigned callbacks, leave. | |
1482 | * At the same time, advance "i" one sublist, so that "i" will | |
1483 | * index into the sublist where all the remaining callbacks should | |
1484 | * be grouped into. | |
1485 | */ | |
1486 | if (++i >= RCU_NEXT_TAIL) | |
48a7639c | 1487 | return false; |
dc35c893 PM |
1488 | |
1489 | /* | |
1490 | * Assign all subsequent callbacks' ->completed number to the next | |
1491 | * full grace period and group them all in the sublist initially | |
1492 | * indexed by "i". | |
1493 | */ | |
1494 | for (; i <= RCU_NEXT_TAIL; i++) { | |
1495 | rdp->nxttail[i] = rdp->nxttail[RCU_NEXT_TAIL]; | |
1496 | rdp->nxtcompleted[i] = c; | |
1497 | } | |
910ee45d | 1498 | /* Record any needed additional grace periods. */ |
48a7639c | 1499 | ret = rcu_start_future_gp(rnp, rdp, NULL); |
6d4b418c PM |
1500 | |
1501 | /* Trace depending on how much we were able to accelerate. */ | |
1502 | if (!*rdp->nxttail[RCU_WAIT_TAIL]) | |
f7f7bac9 | 1503 | trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("AccWaitCB")); |
6d4b418c | 1504 | else |
f7f7bac9 | 1505 | trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("AccReadyCB")); |
48a7639c | 1506 | return ret; |
dc35c893 PM |
1507 | } |
1508 | ||
1509 | /* | |
1510 | * Move any callbacks whose grace period has completed to the | |
1511 | * RCU_DONE_TAIL sublist, then compact the remaining sublists and | |
1512 | * assign ->completed numbers to any callbacks in the RCU_NEXT_TAIL | |
1513 | * sublist. This function is idempotent, so it does not hurt to | |
1514 | * invoke it repeatedly. As long as it is not invoked -too- often... | |
48a7639c | 1515 | * Returns true if the RCU grace-period kthread needs to be awakened. |
dc35c893 PM |
1516 | * |
1517 | * The caller must hold rnp->lock with interrupts disabled. | |
1518 | */ | |
48a7639c | 1519 | static bool rcu_advance_cbs(struct rcu_state *rsp, struct rcu_node *rnp, |
dc35c893 PM |
1520 | struct rcu_data *rdp) |
1521 | { | |
1522 | int i, j; | |
1523 | ||
1524 | /* If the CPU has no callbacks, nothing to do. */ | |
1525 | if (!rdp->nxttail[RCU_NEXT_TAIL] || !*rdp->nxttail[RCU_DONE_TAIL]) | |
48a7639c | 1526 | return false; |
dc35c893 PM |
1527 | |
1528 | /* | |
1529 | * Find all callbacks whose ->completed numbers indicate that they | |
1530 | * are ready to invoke, and put them into the RCU_DONE_TAIL sublist. | |
1531 | */ | |
1532 | for (i = RCU_WAIT_TAIL; i < RCU_NEXT_TAIL; i++) { | |
1533 | if (ULONG_CMP_LT(rnp->completed, rdp->nxtcompleted[i])) | |
1534 | break; | |
1535 | rdp->nxttail[RCU_DONE_TAIL] = rdp->nxttail[i]; | |
1536 | } | |
1537 | /* Clean up any sublist tail pointers that were misordered above. */ | |
1538 | for (j = RCU_WAIT_TAIL; j < i; j++) | |
1539 | rdp->nxttail[j] = rdp->nxttail[RCU_DONE_TAIL]; | |
1540 | ||
1541 | /* Copy down callbacks to fill in empty sublists. */ | |
1542 | for (j = RCU_WAIT_TAIL; i < RCU_NEXT_TAIL; i++, j++) { | |
1543 | if (rdp->nxttail[j] == rdp->nxttail[RCU_NEXT_TAIL]) | |
1544 | break; | |
1545 | rdp->nxttail[j] = rdp->nxttail[i]; | |
1546 | rdp->nxtcompleted[j] = rdp->nxtcompleted[i]; | |
1547 | } | |
1548 | ||
1549 | /* Classify any remaining callbacks. */ | |
48a7639c | 1550 | return rcu_accelerate_cbs(rsp, rnp, rdp); |
dc35c893 PM |
1551 | } |
1552 | ||
d09b62df | 1553 | /* |
ba9fbe95 PM |
1554 | * Update CPU-local rcu_data state to record the beginnings and ends of |
1555 | * grace periods. The caller must hold the ->lock of the leaf rcu_node | |
1556 | * structure corresponding to the current CPU, and must have irqs disabled. | |
48a7639c | 1557 | * Returns true if the grace-period kthread needs to be awakened. |
d09b62df | 1558 | */ |
48a7639c PM |
1559 | static bool __note_gp_changes(struct rcu_state *rsp, struct rcu_node *rnp, |
1560 | struct rcu_data *rdp) | |
d09b62df | 1561 | { |
48a7639c PM |
1562 | bool ret; |
1563 | ||
ba9fbe95 | 1564 | /* Handle the ends of any preceding grace periods first. */ |
dc35c893 | 1565 | if (rdp->completed == rnp->completed) { |
d09b62df | 1566 | |
ba9fbe95 | 1567 | /* No grace period end, so just accelerate recent callbacks. */ |
48a7639c | 1568 | ret = rcu_accelerate_cbs(rsp, rnp, rdp); |
d09b62df | 1569 | |
dc35c893 PM |
1570 | } else { |
1571 | ||
1572 | /* Advance callbacks. */ | |
48a7639c | 1573 | ret = rcu_advance_cbs(rsp, rnp, rdp); |
d09b62df PM |
1574 | |
1575 | /* Remember that we saw this grace-period completion. */ | |
1576 | rdp->completed = rnp->completed; | |
f7f7bac9 | 1577 | trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpuend")); |
d09b62df | 1578 | } |
398ebe60 | 1579 | |
6eaef633 PM |
1580 | if (rdp->gpnum != rnp->gpnum) { |
1581 | /* | |
1582 | * If the current grace period is waiting for this CPU, | |
1583 | * set up to detect a quiescent state, otherwise don't | |
1584 | * go looking for one. | |
1585 | */ | |
1586 | rdp->gpnum = rnp->gpnum; | |
f7f7bac9 | 1587 | trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpustart")); |
6eaef633 PM |
1588 | rdp->passed_quiesce = 0; |
1589 | rdp->qs_pending = !!(rnp->qsmask & rdp->grpmask); | |
1590 | zero_cpu_stall_ticks(rdp); | |
1591 | } | |
48a7639c | 1592 | return ret; |
6eaef633 PM |
1593 | } |
1594 | ||
d34ea322 | 1595 | static void note_gp_changes(struct rcu_state *rsp, struct rcu_data *rdp) |
6eaef633 PM |
1596 | { |
1597 | unsigned long flags; | |
48a7639c | 1598 | bool needwake; |
6eaef633 PM |
1599 | struct rcu_node *rnp; |
1600 | ||
1601 | local_irq_save(flags); | |
1602 | rnp = rdp->mynode; | |
d34ea322 PM |
1603 | if ((rdp->gpnum == ACCESS_ONCE(rnp->gpnum) && |
1604 | rdp->completed == ACCESS_ONCE(rnp->completed)) || /* w/out lock. */ | |
6eaef633 PM |
1605 | !raw_spin_trylock(&rnp->lock)) { /* irqs already off, so later. */ |
1606 | local_irq_restore(flags); | |
1607 | return; | |
1608 | } | |
6303b9c8 | 1609 | smp_mb__after_unlock_lock(); |
48a7639c | 1610 | needwake = __note_gp_changes(rsp, rnp, rdp); |
6eaef633 | 1611 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
48a7639c PM |
1612 | if (needwake) |
1613 | rcu_gp_kthread_wake(rsp); | |
6eaef633 PM |
1614 | } |
1615 | ||
b3dbec76 | 1616 | /* |
f7be8209 | 1617 | * Initialize a new grace period. Return 0 if no grace period required. |
b3dbec76 | 1618 | */ |
7fdefc10 | 1619 | static int rcu_gp_init(struct rcu_state *rsp) |
b3dbec76 PM |
1620 | { |
1621 | struct rcu_data *rdp; | |
7fdefc10 | 1622 | struct rcu_node *rnp = rcu_get_root(rsp); |
b3dbec76 | 1623 | |
eb75767b | 1624 | rcu_bind_gp_kthread(); |
7fdefc10 | 1625 | raw_spin_lock_irq(&rnp->lock); |
6303b9c8 | 1626 | smp_mb__after_unlock_lock(); |
91dc9542 | 1627 | if (!ACCESS_ONCE(rsp->gp_flags)) { |
f7be8209 PM |
1628 | /* Spurious wakeup, tell caller to go back to sleep. */ |
1629 | raw_spin_unlock_irq(&rnp->lock); | |
1630 | return 0; | |
1631 | } | |
91dc9542 | 1632 | ACCESS_ONCE(rsp->gp_flags) = 0; /* Clear all flags: New grace period. */ |
b3dbec76 | 1633 | |
f7be8209 PM |
1634 | if (WARN_ON_ONCE(rcu_gp_in_progress(rsp))) { |
1635 | /* | |
1636 | * Grace period already in progress, don't start another. | |
1637 | * Not supposed to be able to happen. | |
1638 | */ | |
7fdefc10 PM |
1639 | raw_spin_unlock_irq(&rnp->lock); |
1640 | return 0; | |
1641 | } | |
1642 | ||
7fdefc10 | 1643 | /* Advance to a new grace period and initialize state. */ |
26cdfedf | 1644 | record_gp_stall_check_time(rsp); |
765a3f4f PM |
1645 | /* Record GP times before starting GP, hence smp_store_release(). */ |
1646 | smp_store_release(&rsp->gpnum, rsp->gpnum + 1); | |
f7f7bac9 | 1647 | trace_rcu_grace_period(rsp->name, rsp->gpnum, TPS("start")); |
7fdefc10 PM |
1648 | raw_spin_unlock_irq(&rnp->lock); |
1649 | ||
1650 | /* Exclude any concurrent CPU-hotplug operations. */ | |
a4fbe35a | 1651 | mutex_lock(&rsp->onoff_mutex); |
765a3f4f | 1652 | smp_mb__after_unlock_lock(); /* ->gpnum increment before GP! */ |
7fdefc10 PM |
1653 | |
1654 | /* | |
1655 | * Set the quiescent-state-needed bits in all the rcu_node | |
1656 | * structures for all currently online CPUs in breadth-first order, | |
1657 | * starting from the root rcu_node structure, relying on the layout | |
1658 | * of the tree within the rsp->node[] array. Note that other CPUs | |
1659 | * will access only the leaves of the hierarchy, thus seeing that no | |
1660 | * grace period is in progress, at least until the corresponding | |
1661 | * leaf node has been initialized. In addition, we have excluded | |
1662 | * CPU-hotplug operations. | |
1663 | * | |
1664 | * The grace period cannot complete until the initialization | |
1665 | * process finishes, because this kthread handles both. | |
1666 | */ | |
1667 | rcu_for_each_node_breadth_first(rsp, rnp) { | |
b3dbec76 | 1668 | raw_spin_lock_irq(&rnp->lock); |
6303b9c8 | 1669 | smp_mb__after_unlock_lock(); |
b3dbec76 | 1670 | rdp = this_cpu_ptr(rsp->rda); |
7fdefc10 PM |
1671 | rcu_preempt_check_blocked_tasks(rnp); |
1672 | rnp->qsmask = rnp->qsmaskinit; | |
0446be48 | 1673 | ACCESS_ONCE(rnp->gpnum) = rsp->gpnum; |
25d30cf4 | 1674 | WARN_ON_ONCE(rnp->completed != rsp->completed); |
0446be48 | 1675 | ACCESS_ONCE(rnp->completed) = rsp->completed; |
7fdefc10 | 1676 | if (rnp == rdp->mynode) |
48a7639c | 1677 | (void)__note_gp_changes(rsp, rnp, rdp); |
7fdefc10 PM |
1678 | rcu_preempt_boost_start_gp(rnp); |
1679 | trace_rcu_grace_period_init(rsp->name, rnp->gpnum, | |
1680 | rnp->level, rnp->grplo, | |
1681 | rnp->grphi, rnp->qsmask); | |
1682 | raw_spin_unlock_irq(&rnp->lock); | |
bde6c3aa | 1683 | cond_resched_rcu_qs(); |
7fdefc10 | 1684 | } |
b3dbec76 | 1685 | |
a4fbe35a | 1686 | mutex_unlock(&rsp->onoff_mutex); |
7fdefc10 PM |
1687 | return 1; |
1688 | } | |
b3dbec76 | 1689 | |
4cdfc175 PM |
1690 | /* |
1691 | * Do one round of quiescent-state forcing. | |
1692 | */ | |
01896f7e | 1693 | static int rcu_gp_fqs(struct rcu_state *rsp, int fqs_state_in) |
4cdfc175 PM |
1694 | { |
1695 | int fqs_state = fqs_state_in; | |
217af2a2 PM |
1696 | bool isidle = false; |
1697 | unsigned long maxj; | |
4cdfc175 PM |
1698 | struct rcu_node *rnp = rcu_get_root(rsp); |
1699 | ||
1700 | rsp->n_force_qs++; | |
1701 | if (fqs_state == RCU_SAVE_DYNTICK) { | |
1702 | /* Collect dyntick-idle snapshots. */ | |
0edd1b17 | 1703 | if (is_sysidle_rcu_state(rsp)) { |
e02b2edf | 1704 | isidle = true; |
0edd1b17 PM |
1705 | maxj = jiffies - ULONG_MAX / 4; |
1706 | } | |
217af2a2 PM |
1707 | force_qs_rnp(rsp, dyntick_save_progress_counter, |
1708 | &isidle, &maxj); | |
0edd1b17 | 1709 | rcu_sysidle_report_gp(rsp, isidle, maxj); |
4cdfc175 PM |
1710 | fqs_state = RCU_FORCE_QS; |
1711 | } else { | |
1712 | /* Handle dyntick-idle and offline CPUs. */ | |
e02b2edf | 1713 | isidle = false; |
217af2a2 | 1714 | force_qs_rnp(rsp, rcu_implicit_dynticks_qs, &isidle, &maxj); |
4cdfc175 PM |
1715 | } |
1716 | /* Clear flag to prevent immediate re-entry. */ | |
1717 | if (ACCESS_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) { | |
1718 | raw_spin_lock_irq(&rnp->lock); | |
6303b9c8 | 1719 | smp_mb__after_unlock_lock(); |
4de376a1 PK |
1720 | ACCESS_ONCE(rsp->gp_flags) = |
1721 | ACCESS_ONCE(rsp->gp_flags) & ~RCU_GP_FLAG_FQS; | |
4cdfc175 PM |
1722 | raw_spin_unlock_irq(&rnp->lock); |
1723 | } | |
1724 | return fqs_state; | |
1725 | } | |
1726 | ||
7fdefc10 PM |
1727 | /* |
1728 | * Clean up after the old grace period. | |
1729 | */ | |
4cdfc175 | 1730 | static void rcu_gp_cleanup(struct rcu_state *rsp) |
7fdefc10 PM |
1731 | { |
1732 | unsigned long gp_duration; | |
48a7639c | 1733 | bool needgp = false; |
dae6e64d | 1734 | int nocb = 0; |
7fdefc10 PM |
1735 | struct rcu_data *rdp; |
1736 | struct rcu_node *rnp = rcu_get_root(rsp); | |
b3dbec76 | 1737 | |
7fdefc10 | 1738 | raw_spin_lock_irq(&rnp->lock); |
6303b9c8 | 1739 | smp_mb__after_unlock_lock(); |
7fdefc10 PM |
1740 | gp_duration = jiffies - rsp->gp_start; |
1741 | if (gp_duration > rsp->gp_max) | |
1742 | rsp->gp_max = gp_duration; | |
b3dbec76 | 1743 | |
7fdefc10 PM |
1744 | /* |
1745 | * We know the grace period is complete, but to everyone else | |
1746 | * it appears to still be ongoing. But it is also the case | |
1747 | * that to everyone else it looks like there is nothing that | |
1748 | * they can do to advance the grace period. It is therefore | |
1749 | * safe for us to drop the lock in order to mark the grace | |
1750 | * period as completed in all of the rcu_node structures. | |
7fdefc10 | 1751 | */ |
5d4b8659 | 1752 | raw_spin_unlock_irq(&rnp->lock); |
b3dbec76 | 1753 | |
5d4b8659 PM |
1754 | /* |
1755 | * Propagate new ->completed value to rcu_node structures so | |
1756 | * that other CPUs don't have to wait until the start of the next | |
1757 | * grace period to process their callbacks. This also avoids | |
1758 | * some nasty RCU grace-period initialization races by forcing | |
1759 | * the end of the current grace period to be completely recorded in | |
1760 | * all of the rcu_node structures before the beginning of the next | |
1761 | * grace period is recorded in any of the rcu_node structures. | |
1762 | */ | |
1763 | rcu_for_each_node_breadth_first(rsp, rnp) { | |
755609a9 | 1764 | raw_spin_lock_irq(&rnp->lock); |
6303b9c8 | 1765 | smp_mb__after_unlock_lock(); |
0446be48 | 1766 | ACCESS_ONCE(rnp->completed) = rsp->gpnum; |
b11cc576 PM |
1767 | rdp = this_cpu_ptr(rsp->rda); |
1768 | if (rnp == rdp->mynode) | |
48a7639c | 1769 | needgp = __note_gp_changes(rsp, rnp, rdp) || needgp; |
78e4bc34 | 1770 | /* smp_mb() provided by prior unlock-lock pair. */ |
0446be48 | 1771 | nocb += rcu_future_gp_cleanup(rsp, rnp); |
5d4b8659 | 1772 | raw_spin_unlock_irq(&rnp->lock); |
bde6c3aa | 1773 | cond_resched_rcu_qs(); |
7fdefc10 | 1774 | } |
5d4b8659 PM |
1775 | rnp = rcu_get_root(rsp); |
1776 | raw_spin_lock_irq(&rnp->lock); | |
765a3f4f | 1777 | smp_mb__after_unlock_lock(); /* Order GP before ->completed update. */ |
dae6e64d | 1778 | rcu_nocb_gp_set(rnp, nocb); |
7fdefc10 | 1779 | |
765a3f4f PM |
1780 | /* Declare grace period done. */ |
1781 | ACCESS_ONCE(rsp->completed) = rsp->gpnum; | |
f7f7bac9 | 1782 | trace_rcu_grace_period(rsp->name, rsp->completed, TPS("end")); |
7fdefc10 | 1783 | rsp->fqs_state = RCU_GP_IDLE; |
5d4b8659 | 1784 | rdp = this_cpu_ptr(rsp->rda); |
48a7639c PM |
1785 | /* Advance CBs to reduce false positives below. */ |
1786 | needgp = rcu_advance_cbs(rsp, rnp, rdp) || needgp; | |
1787 | if (needgp || cpu_needs_another_gp(rsp, rdp)) { | |
91dc9542 | 1788 | ACCESS_ONCE(rsp->gp_flags) = RCU_GP_FLAG_INIT; |
bb311ecc PM |
1789 | trace_rcu_grace_period(rsp->name, |
1790 | ACCESS_ONCE(rsp->gpnum), | |
1791 | TPS("newreq")); | |
1792 | } | |
7fdefc10 | 1793 | raw_spin_unlock_irq(&rnp->lock); |
7fdefc10 PM |
1794 | } |
1795 | ||
1796 | /* | |
1797 | * Body of kthread that handles grace periods. | |
1798 | */ | |
1799 | static int __noreturn rcu_gp_kthread(void *arg) | |
1800 | { | |
4cdfc175 | 1801 | int fqs_state; |
88d6df61 | 1802 | int gf; |
d40011f6 | 1803 | unsigned long j; |
4cdfc175 | 1804 | int ret; |
7fdefc10 PM |
1805 | struct rcu_state *rsp = arg; |
1806 | struct rcu_node *rnp = rcu_get_root(rsp); | |
1807 | ||
1808 | for (;;) { | |
1809 | ||
1810 | /* Handle grace-period start. */ | |
1811 | for (;;) { | |
63c4db78 PM |
1812 | trace_rcu_grace_period(rsp->name, |
1813 | ACCESS_ONCE(rsp->gpnum), | |
1814 | TPS("reqwait")); | |
afea227f | 1815 | rsp->gp_state = RCU_GP_WAIT_GPS; |
4cdfc175 | 1816 | wait_event_interruptible(rsp->gp_wq, |
591c6d17 | 1817 | ACCESS_ONCE(rsp->gp_flags) & |
4cdfc175 | 1818 | RCU_GP_FLAG_INIT); |
78e4bc34 | 1819 | /* Locking provides needed memory barrier. */ |
f7be8209 | 1820 | if (rcu_gp_init(rsp)) |
7fdefc10 | 1821 | break; |
bde6c3aa | 1822 | cond_resched_rcu_qs(); |
73a860cd | 1823 | WARN_ON(signal_pending(current)); |
63c4db78 PM |
1824 | trace_rcu_grace_period(rsp->name, |
1825 | ACCESS_ONCE(rsp->gpnum), | |
1826 | TPS("reqwaitsig")); | |
7fdefc10 | 1827 | } |
cabc49c1 | 1828 | |
4cdfc175 PM |
1829 | /* Handle quiescent-state forcing. */ |
1830 | fqs_state = RCU_SAVE_DYNTICK; | |
d40011f6 PM |
1831 | j = jiffies_till_first_fqs; |
1832 | if (j > HZ) { | |
1833 | j = HZ; | |
1834 | jiffies_till_first_fqs = HZ; | |
1835 | } | |
88d6df61 | 1836 | ret = 0; |
cabc49c1 | 1837 | for (;;) { |
88d6df61 PM |
1838 | if (!ret) |
1839 | rsp->jiffies_force_qs = jiffies + j; | |
63c4db78 PM |
1840 | trace_rcu_grace_period(rsp->name, |
1841 | ACCESS_ONCE(rsp->gpnum), | |
1842 | TPS("fqswait")); | |
afea227f | 1843 | rsp->gp_state = RCU_GP_WAIT_FQS; |
4cdfc175 | 1844 | ret = wait_event_interruptible_timeout(rsp->gp_wq, |
88d6df61 PM |
1845 | ((gf = ACCESS_ONCE(rsp->gp_flags)) & |
1846 | RCU_GP_FLAG_FQS) || | |
4cdfc175 PM |
1847 | (!ACCESS_ONCE(rnp->qsmask) && |
1848 | !rcu_preempt_blocked_readers_cgp(rnp)), | |
d40011f6 | 1849 | j); |
78e4bc34 | 1850 | /* Locking provides needed memory barriers. */ |
4cdfc175 | 1851 | /* If grace period done, leave loop. */ |
cabc49c1 | 1852 | if (!ACCESS_ONCE(rnp->qsmask) && |
4cdfc175 | 1853 | !rcu_preempt_blocked_readers_cgp(rnp)) |
cabc49c1 | 1854 | break; |
4cdfc175 | 1855 | /* If time for quiescent-state forcing, do it. */ |
88d6df61 PM |
1856 | if (ULONG_CMP_GE(jiffies, rsp->jiffies_force_qs) || |
1857 | (gf & RCU_GP_FLAG_FQS)) { | |
63c4db78 PM |
1858 | trace_rcu_grace_period(rsp->name, |
1859 | ACCESS_ONCE(rsp->gpnum), | |
1860 | TPS("fqsstart")); | |
4cdfc175 | 1861 | fqs_state = rcu_gp_fqs(rsp, fqs_state); |
63c4db78 PM |
1862 | trace_rcu_grace_period(rsp->name, |
1863 | ACCESS_ONCE(rsp->gpnum), | |
1864 | TPS("fqsend")); | |
bde6c3aa | 1865 | cond_resched_rcu_qs(); |
4cdfc175 PM |
1866 | } else { |
1867 | /* Deal with stray signal. */ | |
bde6c3aa | 1868 | cond_resched_rcu_qs(); |
73a860cd | 1869 | WARN_ON(signal_pending(current)); |
63c4db78 PM |
1870 | trace_rcu_grace_period(rsp->name, |
1871 | ACCESS_ONCE(rsp->gpnum), | |
1872 | TPS("fqswaitsig")); | |
4cdfc175 | 1873 | } |
d40011f6 PM |
1874 | j = jiffies_till_next_fqs; |
1875 | if (j > HZ) { | |
1876 | j = HZ; | |
1877 | jiffies_till_next_fqs = HZ; | |
1878 | } else if (j < 1) { | |
1879 | j = 1; | |
1880 | jiffies_till_next_fqs = 1; | |
1881 | } | |
cabc49c1 | 1882 | } |
4cdfc175 PM |
1883 | |
1884 | /* Handle grace-period end. */ | |
1885 | rcu_gp_cleanup(rsp); | |
b3dbec76 | 1886 | } |
b3dbec76 PM |
1887 | } |
1888 | ||
64db4cff PM |
1889 | /* |
1890 | * Start a new RCU grace period if warranted, re-initializing the hierarchy | |
1891 | * in preparation for detecting the next grace period. The caller must hold | |
b8462084 | 1892 | * the root node's ->lock and hard irqs must be disabled. |
e5601400 PM |
1893 | * |
1894 | * Note that it is legal for a dying CPU (which is marked as offline) to | |
1895 | * invoke this function. This can happen when the dying CPU reports its | |
1896 | * quiescent state. | |
48a7639c PM |
1897 | * |
1898 | * Returns true if the grace-period kthread must be awakened. | |
64db4cff | 1899 | */ |
48a7639c | 1900 | static bool |
910ee45d PM |
1901 | rcu_start_gp_advanced(struct rcu_state *rsp, struct rcu_node *rnp, |
1902 | struct rcu_data *rdp) | |
64db4cff | 1903 | { |
b8462084 | 1904 | if (!rsp->gp_kthread || !cpu_needs_another_gp(rsp, rdp)) { |
afe24b12 | 1905 | /* |
b3dbec76 | 1906 | * Either we have not yet spawned the grace-period |
62da1921 PM |
1907 | * task, this CPU does not need another grace period, |
1908 | * or a grace period is already in progress. | |
b3dbec76 | 1909 | * Either way, don't start a new grace period. |
afe24b12 | 1910 | */ |
48a7639c | 1911 | return false; |
afe24b12 | 1912 | } |
91dc9542 | 1913 | ACCESS_ONCE(rsp->gp_flags) = RCU_GP_FLAG_INIT; |
bb311ecc PM |
1914 | trace_rcu_grace_period(rsp->name, ACCESS_ONCE(rsp->gpnum), |
1915 | TPS("newreq")); | |
62da1921 | 1916 | |
016a8d5b SR |
1917 | /* |
1918 | * We can't do wakeups while holding the rnp->lock, as that | |
1eafd31c | 1919 | * could cause possible deadlocks with the rq->lock. Defer |
48a7639c | 1920 | * the wakeup to our caller. |
016a8d5b | 1921 | */ |
48a7639c | 1922 | return true; |
64db4cff PM |
1923 | } |
1924 | ||
910ee45d PM |
1925 | /* |
1926 | * Similar to rcu_start_gp_advanced(), but also advance the calling CPU's | |
1927 | * callbacks. Note that rcu_start_gp_advanced() cannot do this because it | |
1928 | * is invoked indirectly from rcu_advance_cbs(), which would result in | |
1929 | * endless recursion -- or would do so if it wasn't for the self-deadlock | |
1930 | * that is encountered beforehand. | |
48a7639c PM |
1931 | * |
1932 | * Returns true if the grace-period kthread needs to be awakened. | |
910ee45d | 1933 | */ |
48a7639c | 1934 | static bool rcu_start_gp(struct rcu_state *rsp) |
910ee45d PM |
1935 | { |
1936 | struct rcu_data *rdp = this_cpu_ptr(rsp->rda); | |
1937 | struct rcu_node *rnp = rcu_get_root(rsp); | |
48a7639c | 1938 | bool ret = false; |
910ee45d PM |
1939 | |
1940 | /* | |
1941 | * If there is no grace period in progress right now, any | |
1942 | * callbacks we have up to this point will be satisfied by the | |
1943 | * next grace period. Also, advancing the callbacks reduces the | |
1944 | * probability of false positives from cpu_needs_another_gp() | |
1945 | * resulting in pointless grace periods. So, advance callbacks | |
1946 | * then start the grace period! | |
1947 | */ | |
48a7639c PM |
1948 | ret = rcu_advance_cbs(rsp, rnp, rdp) || ret; |
1949 | ret = rcu_start_gp_advanced(rsp, rnp, rdp) || ret; | |
1950 | return ret; | |
910ee45d PM |
1951 | } |
1952 | ||
f41d911f | 1953 | /* |
d3f6bad3 PM |
1954 | * Report a full set of quiescent states to the specified rcu_state |
1955 | * data structure. This involves cleaning up after the prior grace | |
1956 | * period and letting rcu_start_gp() start up the next grace period | |
b8462084 PM |
1957 | * if one is needed. Note that the caller must hold rnp->lock, which |
1958 | * is released before return. | |
f41d911f | 1959 | */ |
d3f6bad3 | 1960 | static void rcu_report_qs_rsp(struct rcu_state *rsp, unsigned long flags) |
fc2219d4 | 1961 | __releases(rcu_get_root(rsp)->lock) |
f41d911f | 1962 | { |
fc2219d4 | 1963 | WARN_ON_ONCE(!rcu_gp_in_progress(rsp)); |
cabc49c1 | 1964 | raw_spin_unlock_irqrestore(&rcu_get_root(rsp)->lock, flags); |
2aa792e6 | 1965 | rcu_gp_kthread_wake(rsp); |
f41d911f PM |
1966 | } |
1967 | ||
64db4cff | 1968 | /* |
d3f6bad3 PM |
1969 | * Similar to rcu_report_qs_rdp(), for which it is a helper function. |
1970 | * Allows quiescent states for a group of CPUs to be reported at one go | |
1971 | * to the specified rcu_node structure, though all the CPUs in the group | |
1972 | * must be represented by the same rcu_node structure (which need not be | |
1973 | * a leaf rcu_node structure, though it often will be). That structure's | |
1974 | * lock must be held upon entry, and it is released before return. | |
64db4cff PM |
1975 | */ |
1976 | static void | |
d3f6bad3 PM |
1977 | rcu_report_qs_rnp(unsigned long mask, struct rcu_state *rsp, |
1978 | struct rcu_node *rnp, unsigned long flags) | |
64db4cff PM |
1979 | __releases(rnp->lock) |
1980 | { | |
28ecd580 PM |
1981 | struct rcu_node *rnp_c; |
1982 | ||
64db4cff PM |
1983 | /* Walk up the rcu_node hierarchy. */ |
1984 | for (;;) { | |
1985 | if (!(rnp->qsmask & mask)) { | |
1986 | ||
1987 | /* Our bit has already been cleared, so done. */ | |
1304afb2 | 1988 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
1989 | return; |
1990 | } | |
1991 | rnp->qsmask &= ~mask; | |
d4c08f2a PM |
1992 | trace_rcu_quiescent_state_report(rsp->name, rnp->gpnum, |
1993 | mask, rnp->qsmask, rnp->level, | |
1994 | rnp->grplo, rnp->grphi, | |
1995 | !!rnp->gp_tasks); | |
27f4d280 | 1996 | if (rnp->qsmask != 0 || rcu_preempt_blocked_readers_cgp(rnp)) { |
64db4cff PM |
1997 | |
1998 | /* Other bits still set at this level, so done. */ | |
1304afb2 | 1999 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
2000 | return; |
2001 | } | |
2002 | mask = rnp->grpmask; | |
2003 | if (rnp->parent == NULL) { | |
2004 | ||
2005 | /* No more levels. Exit loop holding root lock. */ | |
2006 | ||
2007 | break; | |
2008 | } | |
1304afb2 | 2009 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
28ecd580 | 2010 | rnp_c = rnp; |
64db4cff | 2011 | rnp = rnp->parent; |
1304afb2 | 2012 | raw_spin_lock_irqsave(&rnp->lock, flags); |
6303b9c8 | 2013 | smp_mb__after_unlock_lock(); |
28ecd580 | 2014 | WARN_ON_ONCE(rnp_c->qsmask); |
64db4cff PM |
2015 | } |
2016 | ||
2017 | /* | |
2018 | * Get here if we are the last CPU to pass through a quiescent | |
d3f6bad3 | 2019 | * state for this grace period. Invoke rcu_report_qs_rsp() |
f41d911f | 2020 | * to clean up and start the next grace period if one is needed. |
64db4cff | 2021 | */ |
d3f6bad3 | 2022 | rcu_report_qs_rsp(rsp, flags); /* releases rnp->lock. */ |
64db4cff PM |
2023 | } |
2024 | ||
2025 | /* | |
d3f6bad3 PM |
2026 | * Record a quiescent state for the specified CPU to that CPU's rcu_data |
2027 | * structure. This must be either called from the specified CPU, or | |
2028 | * called when the specified CPU is known to be offline (and when it is | |
2029 | * also known that no other CPU is concurrently trying to help the offline | |
2030 | * CPU). The lastcomp argument is used to make sure we are still in the | |
2031 | * grace period of interest. We don't want to end the current grace period | |
2032 | * based on quiescent states detected in an earlier grace period! | |
64db4cff PM |
2033 | */ |
2034 | static void | |
d7d6a11e | 2035 | rcu_report_qs_rdp(int cpu, struct rcu_state *rsp, struct rcu_data *rdp) |
64db4cff PM |
2036 | { |
2037 | unsigned long flags; | |
2038 | unsigned long mask; | |
48a7639c | 2039 | bool needwake; |
64db4cff PM |
2040 | struct rcu_node *rnp; |
2041 | ||
2042 | rnp = rdp->mynode; | |
1304afb2 | 2043 | raw_spin_lock_irqsave(&rnp->lock, flags); |
6303b9c8 | 2044 | smp_mb__after_unlock_lock(); |
d7d6a11e PM |
2045 | if (rdp->passed_quiesce == 0 || rdp->gpnum != rnp->gpnum || |
2046 | rnp->completed == rnp->gpnum) { | |
64db4cff PM |
2047 | |
2048 | /* | |
e4cc1f22 PM |
2049 | * The grace period in which this quiescent state was |
2050 | * recorded has ended, so don't report it upwards. | |
2051 | * We will instead need a new quiescent state that lies | |
2052 | * within the current grace period. | |
64db4cff | 2053 | */ |
e4cc1f22 | 2054 | rdp->passed_quiesce = 0; /* need qs for new gp. */ |
1304afb2 | 2055 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
2056 | return; |
2057 | } | |
2058 | mask = rdp->grpmask; | |
2059 | if ((rnp->qsmask & mask) == 0) { | |
1304afb2 | 2060 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff PM |
2061 | } else { |
2062 | rdp->qs_pending = 0; | |
2063 | ||
2064 | /* | |
2065 | * This GP can't end until cpu checks in, so all of our | |
2066 | * callbacks can be processed during the next GP. | |
2067 | */ | |
48a7639c | 2068 | needwake = rcu_accelerate_cbs(rsp, rnp, rdp); |
64db4cff | 2069 | |
d3f6bad3 | 2070 | rcu_report_qs_rnp(mask, rsp, rnp, flags); /* rlses rnp->lock */ |
48a7639c PM |
2071 | if (needwake) |
2072 | rcu_gp_kthread_wake(rsp); | |
64db4cff PM |
2073 | } |
2074 | } | |
2075 | ||
2076 | /* | |
2077 | * Check to see if there is a new grace period of which this CPU | |
2078 | * is not yet aware, and if so, set up local rcu_data state for it. | |
2079 | * Otherwise, see if this CPU has just passed through its first | |
2080 | * quiescent state for this grace period, and record that fact if so. | |
2081 | */ | |
2082 | static void | |
2083 | rcu_check_quiescent_state(struct rcu_state *rsp, struct rcu_data *rdp) | |
2084 | { | |
05eb552b PM |
2085 | /* Check for grace-period ends and beginnings. */ |
2086 | note_gp_changes(rsp, rdp); | |
64db4cff PM |
2087 | |
2088 | /* | |
2089 | * Does this CPU still need to do its part for current grace period? | |
2090 | * If no, return and let the other CPUs do their part as well. | |
2091 | */ | |
2092 | if (!rdp->qs_pending) | |
2093 | return; | |
2094 | ||
2095 | /* | |
2096 | * Was there a quiescent state since the beginning of the grace | |
2097 | * period? If no, then exit and wait for the next call. | |
2098 | */ | |
e4cc1f22 | 2099 | if (!rdp->passed_quiesce) |
64db4cff PM |
2100 | return; |
2101 | ||
d3f6bad3 PM |
2102 | /* |
2103 | * Tell RCU we are done (but rcu_report_qs_rdp() will be the | |
2104 | * judge of that). | |
2105 | */ | |
d7d6a11e | 2106 | rcu_report_qs_rdp(rdp->cpu, rsp, rdp); |
64db4cff PM |
2107 | } |
2108 | ||
2109 | #ifdef CONFIG_HOTPLUG_CPU | |
2110 | ||
e74f4c45 | 2111 | /* |
b1420f1c PM |
2112 | * Send the specified CPU's RCU callbacks to the orphanage. The |
2113 | * specified CPU must be offline, and the caller must hold the | |
7b2e6011 | 2114 | * ->orphan_lock. |
e74f4c45 | 2115 | */ |
b1420f1c PM |
2116 | static void |
2117 | rcu_send_cbs_to_orphanage(int cpu, struct rcu_state *rsp, | |
2118 | struct rcu_node *rnp, struct rcu_data *rdp) | |
e74f4c45 | 2119 | { |
3fbfbf7a | 2120 | /* No-CBs CPUs do not have orphanable callbacks. */ |
d1e43fa5 | 2121 | if (rcu_is_nocb_cpu(rdp->cpu)) |
3fbfbf7a PM |
2122 | return; |
2123 | ||
b1420f1c PM |
2124 | /* |
2125 | * Orphan the callbacks. First adjust the counts. This is safe | |
abfd6e58 PM |
2126 | * because _rcu_barrier() excludes CPU-hotplug operations, so it |
2127 | * cannot be running now. Thus no memory barrier is required. | |
b1420f1c | 2128 | */ |
a50c3af9 | 2129 | if (rdp->nxtlist != NULL) { |
b1420f1c PM |
2130 | rsp->qlen_lazy += rdp->qlen_lazy; |
2131 | rsp->qlen += rdp->qlen; | |
2132 | rdp->n_cbs_orphaned += rdp->qlen; | |
a50c3af9 | 2133 | rdp->qlen_lazy = 0; |
1d1fb395 | 2134 | ACCESS_ONCE(rdp->qlen) = 0; |
a50c3af9 PM |
2135 | } |
2136 | ||
2137 | /* | |
b1420f1c PM |
2138 | * Next, move those callbacks still needing a grace period to |
2139 | * the orphanage, where some other CPU will pick them up. | |
2140 | * Some of the callbacks might have gone partway through a grace | |
2141 | * period, but that is too bad. They get to start over because we | |
2142 | * cannot assume that grace periods are synchronized across CPUs. | |
2143 | * We don't bother updating the ->nxttail[] array yet, instead | |
2144 | * we just reset the whole thing later on. | |
a50c3af9 | 2145 | */ |
b1420f1c PM |
2146 | if (*rdp->nxttail[RCU_DONE_TAIL] != NULL) { |
2147 | *rsp->orphan_nxttail = *rdp->nxttail[RCU_DONE_TAIL]; | |
2148 | rsp->orphan_nxttail = rdp->nxttail[RCU_NEXT_TAIL]; | |
2149 | *rdp->nxttail[RCU_DONE_TAIL] = NULL; | |
a50c3af9 PM |
2150 | } |
2151 | ||
2152 | /* | |
b1420f1c PM |
2153 | * Then move the ready-to-invoke callbacks to the orphanage, |
2154 | * where some other CPU will pick them up. These will not be | |
2155 | * required to pass though another grace period: They are done. | |
a50c3af9 | 2156 | */ |
e5601400 | 2157 | if (rdp->nxtlist != NULL) { |
b1420f1c PM |
2158 | *rsp->orphan_donetail = rdp->nxtlist; |
2159 | rsp->orphan_donetail = rdp->nxttail[RCU_DONE_TAIL]; | |
e5601400 | 2160 | } |
e74f4c45 | 2161 | |
b1420f1c | 2162 | /* Finally, initialize the rcu_data structure's list to empty. */ |
3f5d3ea6 | 2163 | init_callback_list(rdp); |
b1420f1c PM |
2164 | } |
2165 | ||
2166 | /* | |
2167 | * Adopt the RCU callbacks from the specified rcu_state structure's | |
7b2e6011 | 2168 | * orphanage. The caller must hold the ->orphan_lock. |
b1420f1c | 2169 | */ |
96d3fd0d | 2170 | static void rcu_adopt_orphan_cbs(struct rcu_state *rsp, unsigned long flags) |
b1420f1c PM |
2171 | { |
2172 | int i; | |
fa07a58f | 2173 | struct rcu_data *rdp = raw_cpu_ptr(rsp->rda); |
b1420f1c | 2174 | |
3fbfbf7a | 2175 | /* No-CBs CPUs are handled specially. */ |
96d3fd0d | 2176 | if (rcu_nocb_adopt_orphan_cbs(rsp, rdp, flags)) |
3fbfbf7a PM |
2177 | return; |
2178 | ||
b1420f1c PM |
2179 | /* Do the accounting first. */ |
2180 | rdp->qlen_lazy += rsp->qlen_lazy; | |
2181 | rdp->qlen += rsp->qlen; | |
2182 | rdp->n_cbs_adopted += rsp->qlen; | |
8f5af6f1 PM |
2183 | if (rsp->qlen_lazy != rsp->qlen) |
2184 | rcu_idle_count_callbacks_posted(); | |
b1420f1c PM |
2185 | rsp->qlen_lazy = 0; |
2186 | rsp->qlen = 0; | |
2187 | ||
2188 | /* | |
2189 | * We do not need a memory barrier here because the only way we | |
2190 | * can get here if there is an rcu_barrier() in flight is if | |
2191 | * we are the task doing the rcu_barrier(). | |
2192 | */ | |
2193 | ||
2194 | /* First adopt the ready-to-invoke callbacks. */ | |
2195 | if (rsp->orphan_donelist != NULL) { | |
2196 | *rsp->orphan_donetail = *rdp->nxttail[RCU_DONE_TAIL]; | |
2197 | *rdp->nxttail[RCU_DONE_TAIL] = rsp->orphan_donelist; | |
2198 | for (i = RCU_NEXT_SIZE - 1; i >= RCU_DONE_TAIL; i--) | |
2199 | if (rdp->nxttail[i] == rdp->nxttail[RCU_DONE_TAIL]) | |
2200 | rdp->nxttail[i] = rsp->orphan_donetail; | |
2201 | rsp->orphan_donelist = NULL; | |
2202 | rsp->orphan_donetail = &rsp->orphan_donelist; | |
2203 | } | |
2204 | ||
2205 | /* And then adopt the callbacks that still need a grace period. */ | |
2206 | if (rsp->orphan_nxtlist != NULL) { | |
2207 | *rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_nxtlist; | |
2208 | rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_nxttail; | |
2209 | rsp->orphan_nxtlist = NULL; | |
2210 | rsp->orphan_nxttail = &rsp->orphan_nxtlist; | |
2211 | } | |
2212 | } | |
2213 | ||
2214 | /* | |
2215 | * Trace the fact that this CPU is going offline. | |
2216 | */ | |
2217 | static void rcu_cleanup_dying_cpu(struct rcu_state *rsp) | |
2218 | { | |
2219 | RCU_TRACE(unsigned long mask); | |
2220 | RCU_TRACE(struct rcu_data *rdp = this_cpu_ptr(rsp->rda)); | |
2221 | RCU_TRACE(struct rcu_node *rnp = rdp->mynode); | |
2222 | ||
2223 | RCU_TRACE(mask = rdp->grpmask); | |
e5601400 PM |
2224 | trace_rcu_grace_period(rsp->name, |
2225 | rnp->gpnum + 1 - !!(rnp->qsmask & mask), | |
f7f7bac9 | 2226 | TPS("cpuofl")); |
64db4cff PM |
2227 | } |
2228 | ||
8af3a5e7 PM |
2229 | /* |
2230 | * All CPUs for the specified rcu_node structure have gone offline, | |
2231 | * and all tasks that were preempted within an RCU read-side critical | |
2232 | * section while running on one of those CPUs have since exited their RCU | |
2233 | * read-side critical section. Some other CPU is reporting this fact with | |
2234 | * the specified rcu_node structure's ->lock held and interrupts disabled. | |
2235 | * This function therefore goes up the tree of rcu_node structures, | |
2236 | * clearing the corresponding bits in the ->qsmaskinit fields. Note that | |
2237 | * the leaf rcu_node structure's ->qsmaskinit field has already been | |
2238 | * updated | |
2239 | * | |
2240 | * This function does check that the specified rcu_node structure has | |
2241 | * all CPUs offline and no blocked tasks, so it is OK to invoke it | |
2242 | * prematurely. That said, invoking it after the fact will cost you | |
2243 | * a needless lock acquisition. So once it has done its work, don't | |
2244 | * invoke it again. | |
2245 | */ | |
2246 | static void rcu_cleanup_dead_rnp(struct rcu_node *rnp_leaf) | |
2247 | { | |
2248 | long mask; | |
2249 | struct rcu_node *rnp = rnp_leaf; | |
2250 | ||
2251 | if (rnp->qsmaskinit || rcu_preempt_has_tasks(rnp)) | |
2252 | return; | |
2253 | for (;;) { | |
2254 | mask = rnp->grpmask; | |
2255 | rnp = rnp->parent; | |
2256 | if (!rnp) | |
2257 | break; | |
2258 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ | |
2259 | smp_mb__after_unlock_lock(); /* GP memory ordering. */ | |
2260 | rnp->qsmaskinit &= ~mask; | |
2261 | if (rnp->qsmaskinit) { | |
2262 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ | |
2263 | return; | |
2264 | } | |
2265 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ | |
2266 | } | |
2267 | } | |
2268 | ||
64db4cff | 2269 | /* |
e5601400 | 2270 | * The CPU has been completely removed, and some other CPU is reporting |
b1420f1c PM |
2271 | * this fact from process context. Do the remainder of the cleanup, |
2272 | * including orphaning the outgoing CPU's RCU callbacks, and also | |
1331e7a1 PM |
2273 | * adopting them. There can only be one CPU hotplug operation at a time, |
2274 | * so no other CPU can be attempting to update rcu_cpu_kthread_task. | |
64db4cff | 2275 | */ |
e5601400 | 2276 | static void rcu_cleanup_dead_cpu(int cpu, struct rcu_state *rsp) |
64db4cff | 2277 | { |
2036d94a | 2278 | unsigned long flags; |
2036d94a | 2279 | int need_report = 0; |
e5601400 | 2280 | struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu); |
b1420f1c | 2281 | struct rcu_node *rnp = rdp->mynode; /* Outgoing CPU's rdp & rnp. */ |
e5601400 | 2282 | |
2036d94a | 2283 | /* Adjust any no-longer-needed kthreads. */ |
5d01bbd1 | 2284 | rcu_boost_kthread_setaffinity(rnp, -1); |
2036d94a | 2285 | |
2036d94a | 2286 | /* Exclude any attempts to start a new grace period. */ |
a4fbe35a | 2287 | mutex_lock(&rsp->onoff_mutex); |
7b2e6011 | 2288 | raw_spin_lock_irqsave(&rsp->orphan_lock, flags); |
2036d94a | 2289 | |
b1420f1c PM |
2290 | /* Orphan the dead CPU's callbacks, and adopt them if appropriate. */ |
2291 | rcu_send_cbs_to_orphanage(cpu, rsp, rnp, rdp); | |
96d3fd0d | 2292 | rcu_adopt_orphan_cbs(rsp, flags); |
b1420f1c | 2293 | |
8af3a5e7 PM |
2294 | /* Remove outgoing CPU from mask in the leaf rcu_node structure. */ |
2295 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ | |
2296 | smp_mb__after_unlock_lock(); /* Enforce GP memory-order guarantee. */ | |
2297 | rnp->qsmaskinit &= ~rdp->grpmask; | |
2298 | if (rnp->qsmaskinit == 0) { | |
2299 | need_report = rcu_preempt_offline_tasks(rsp, rnp, rdp); | |
2300 | rcu_cleanup_dead_rnp(rnp); | |
2301 | } | |
2036d94a PM |
2302 | |
2303 | /* | |
2304 | * We still hold the leaf rcu_node structure lock here, and | |
2305 | * irqs are still disabled. The reason for this subterfuge is | |
7b2e6011 | 2306 | * because invoking rcu_report_unblock_qs_rnp() with ->orphan_lock |
2036d94a PM |
2307 | * held leads to deadlock. |
2308 | */ | |
7b2e6011 | 2309 | raw_spin_unlock(&rsp->orphan_lock); /* irqs remain disabled. */ |
2036d94a PM |
2310 | rnp = rdp->mynode; |
2311 | if (need_report & RCU_OFL_TASKS_NORM_GP) | |
2312 | rcu_report_unblock_qs_rnp(rnp, flags); | |
2313 | else | |
2314 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | |
2315 | if (need_report & RCU_OFL_TASKS_EXP_GP) | |
2316 | rcu_report_exp_rnp(rsp, rnp, true); | |
cf01537e PM |
2317 | WARN_ONCE(rdp->qlen != 0 || rdp->nxtlist != NULL, |
2318 | "rcu_cleanup_dead_cpu: Callbacks on offline CPU %d: qlen=%lu, nxtlist=%p\n", | |
2319 | cpu, rdp->qlen, rdp->nxtlist); | |
0d8ee37e PM |
2320 | init_callback_list(rdp); |
2321 | /* Disallow further callbacks on this CPU. */ | |
2322 | rdp->nxttail[RCU_NEXT_TAIL] = NULL; | |
a4fbe35a | 2323 | mutex_unlock(&rsp->onoff_mutex); |
64db4cff PM |
2324 | } |
2325 | ||
2326 | #else /* #ifdef CONFIG_HOTPLUG_CPU */ | |
2327 | ||
e5601400 | 2328 | static void rcu_cleanup_dying_cpu(struct rcu_state *rsp) |
e74f4c45 PM |
2329 | { |
2330 | } | |
2331 | ||
b6a932d1 PM |
2332 | static void __maybe_unused rcu_cleanup_dead_rnp(struct rcu_node *rnp_leaf) |
2333 | { | |
2334 | } | |
2335 | ||
e5601400 | 2336 | static void rcu_cleanup_dead_cpu(int cpu, struct rcu_state *rsp) |
64db4cff PM |
2337 | { |
2338 | } | |
2339 | ||
2340 | #endif /* #else #ifdef CONFIG_HOTPLUG_CPU */ | |
2341 | ||
2342 | /* | |
2343 | * Invoke any RCU callbacks that have made it to the end of their grace | |
2344 | * period. Thottle as specified by rdp->blimit. | |
2345 | */ | |
37c72e56 | 2346 | static void rcu_do_batch(struct rcu_state *rsp, struct rcu_data *rdp) |
64db4cff PM |
2347 | { |
2348 | unsigned long flags; | |
2349 | struct rcu_head *next, *list, **tail; | |
878d7439 ED |
2350 | long bl, count, count_lazy; |
2351 | int i; | |
64db4cff | 2352 | |
dc35c893 | 2353 | /* If no callbacks are ready, just return. */ |
29c00b4a | 2354 | if (!cpu_has_callbacks_ready_to_invoke(rdp)) { |
486e2593 | 2355 | trace_rcu_batch_start(rsp->name, rdp->qlen_lazy, rdp->qlen, 0); |
4968c300 PM |
2356 | trace_rcu_batch_end(rsp->name, 0, !!ACCESS_ONCE(rdp->nxtlist), |
2357 | need_resched(), is_idle_task(current), | |
2358 | rcu_is_callbacks_kthread()); | |
64db4cff | 2359 | return; |
29c00b4a | 2360 | } |
64db4cff PM |
2361 | |
2362 | /* | |
2363 | * Extract the list of ready callbacks, disabling to prevent | |
2364 | * races with call_rcu() from interrupt handlers. | |
2365 | */ | |
2366 | local_irq_save(flags); | |
8146c4e2 | 2367 | WARN_ON_ONCE(cpu_is_offline(smp_processor_id())); |
29c00b4a | 2368 | bl = rdp->blimit; |
486e2593 | 2369 | trace_rcu_batch_start(rsp->name, rdp->qlen_lazy, rdp->qlen, bl); |
64db4cff PM |
2370 | list = rdp->nxtlist; |
2371 | rdp->nxtlist = *rdp->nxttail[RCU_DONE_TAIL]; | |
2372 | *rdp->nxttail[RCU_DONE_TAIL] = NULL; | |
2373 | tail = rdp->nxttail[RCU_DONE_TAIL]; | |
b41772ab PM |
2374 | for (i = RCU_NEXT_SIZE - 1; i >= 0; i--) |
2375 | if (rdp->nxttail[i] == rdp->nxttail[RCU_DONE_TAIL]) | |
2376 | rdp->nxttail[i] = &rdp->nxtlist; | |
64db4cff PM |
2377 | local_irq_restore(flags); |
2378 | ||
2379 | /* Invoke callbacks. */ | |
486e2593 | 2380 | count = count_lazy = 0; |
64db4cff PM |
2381 | while (list) { |
2382 | next = list->next; | |
2383 | prefetch(next); | |
551d55a9 | 2384 | debug_rcu_head_unqueue(list); |
486e2593 PM |
2385 | if (__rcu_reclaim(rsp->name, list)) |
2386 | count_lazy++; | |
64db4cff | 2387 | list = next; |
dff1672d PM |
2388 | /* Stop only if limit reached and CPU has something to do. */ |
2389 | if (++count >= bl && | |
2390 | (need_resched() || | |
2391 | (!is_idle_task(current) && !rcu_is_callbacks_kthread()))) | |
64db4cff PM |
2392 | break; |
2393 | } | |
2394 | ||
2395 | local_irq_save(flags); | |
4968c300 PM |
2396 | trace_rcu_batch_end(rsp->name, count, !!list, need_resched(), |
2397 | is_idle_task(current), | |
2398 | rcu_is_callbacks_kthread()); | |
64db4cff PM |
2399 | |
2400 | /* Update count, and requeue any remaining callbacks. */ | |
64db4cff PM |
2401 | if (list != NULL) { |
2402 | *tail = rdp->nxtlist; | |
2403 | rdp->nxtlist = list; | |
b41772ab PM |
2404 | for (i = 0; i < RCU_NEXT_SIZE; i++) |
2405 | if (&rdp->nxtlist == rdp->nxttail[i]) | |
2406 | rdp->nxttail[i] = tail; | |
64db4cff PM |
2407 | else |
2408 | break; | |
2409 | } | |
b1420f1c PM |
2410 | smp_mb(); /* List handling before counting for rcu_barrier(). */ |
2411 | rdp->qlen_lazy -= count_lazy; | |
a792563b | 2412 | ACCESS_ONCE(rdp->qlen) = rdp->qlen - count; |
b1420f1c | 2413 | rdp->n_cbs_invoked += count; |
64db4cff PM |
2414 | |
2415 | /* Reinstate batch limit if we have worked down the excess. */ | |
2416 | if (rdp->blimit == LONG_MAX && rdp->qlen <= qlowmark) | |
2417 | rdp->blimit = blimit; | |
2418 | ||
37c72e56 PM |
2419 | /* Reset ->qlen_last_fqs_check trigger if enough CBs have drained. */ |
2420 | if (rdp->qlen == 0 && rdp->qlen_last_fqs_check != 0) { | |
2421 | rdp->qlen_last_fqs_check = 0; | |
2422 | rdp->n_force_qs_snap = rsp->n_force_qs; | |
2423 | } else if (rdp->qlen < rdp->qlen_last_fqs_check - qhimark) | |
2424 | rdp->qlen_last_fqs_check = rdp->qlen; | |
cfca9279 | 2425 | WARN_ON_ONCE((rdp->nxtlist == NULL) != (rdp->qlen == 0)); |
37c72e56 | 2426 | |
64db4cff PM |
2427 | local_irq_restore(flags); |
2428 | ||
e0f23060 | 2429 | /* Re-invoke RCU core processing if there are callbacks remaining. */ |
64db4cff | 2430 | if (cpu_has_callbacks_ready_to_invoke(rdp)) |
a46e0899 | 2431 | invoke_rcu_core(); |
64db4cff PM |
2432 | } |
2433 | ||
2434 | /* | |
2435 | * Check to see if this CPU is in a non-context-switch quiescent state | |
2436 | * (user mode or idle loop for rcu, non-softirq execution for rcu_bh). | |
e0f23060 | 2437 | * Also schedule RCU core processing. |
64db4cff | 2438 | * |
9b2e4f18 | 2439 | * This function must be called from hardirq context. It is normally |
64db4cff PM |
2440 | * invoked from the scheduling-clock interrupt. If rcu_pending returns |
2441 | * false, there is no point in invoking rcu_check_callbacks(). | |
2442 | */ | |
c3377c2d | 2443 | void rcu_check_callbacks(int user) |
64db4cff | 2444 | { |
f7f7bac9 | 2445 | trace_rcu_utilization(TPS("Start scheduler-tick")); |
a858af28 | 2446 | increment_cpu_stall_ticks(); |
9b2e4f18 | 2447 | if (user || rcu_is_cpu_rrupt_from_idle()) { |
64db4cff PM |
2448 | |
2449 | /* | |
2450 | * Get here if this CPU took its interrupt from user | |
2451 | * mode or from the idle loop, and if this is not a | |
2452 | * nested interrupt. In this case, the CPU is in | |
d6714c22 | 2453 | * a quiescent state, so note it. |
64db4cff PM |
2454 | * |
2455 | * No memory barrier is required here because both | |
d6714c22 PM |
2456 | * rcu_sched_qs() and rcu_bh_qs() reference only CPU-local |
2457 | * variables that other CPUs neither access nor modify, | |
2458 | * at least not while the corresponding CPU is online. | |
64db4cff PM |
2459 | */ |
2460 | ||
284a8c93 PM |
2461 | rcu_sched_qs(); |
2462 | rcu_bh_qs(); | |
64db4cff PM |
2463 | |
2464 | } else if (!in_softirq()) { | |
2465 | ||
2466 | /* | |
2467 | * Get here if this CPU did not take its interrupt from | |
2468 | * softirq, in other words, if it is not interrupting | |
2469 | * a rcu_bh read-side critical section. This is an _bh | |
d6714c22 | 2470 | * critical section, so note it. |
64db4cff PM |
2471 | */ |
2472 | ||
284a8c93 | 2473 | rcu_bh_qs(); |
64db4cff | 2474 | } |
86aea0e6 | 2475 | rcu_preempt_check_callbacks(); |
e3950ecd | 2476 | if (rcu_pending()) |
a46e0899 | 2477 | invoke_rcu_core(); |
8315f422 PM |
2478 | if (user) |
2479 | rcu_note_voluntary_context_switch(current); | |
f7f7bac9 | 2480 | trace_rcu_utilization(TPS("End scheduler-tick")); |
64db4cff PM |
2481 | } |
2482 | ||
64db4cff PM |
2483 | /* |
2484 | * Scan the leaf rcu_node structures, processing dyntick state for any that | |
2485 | * have not yet encountered a quiescent state, using the function specified. | |
27f4d280 PM |
2486 | * Also initiate boosting for any threads blocked on the root rcu_node. |
2487 | * | |
ee47eb9f | 2488 | * The caller must have suppressed start of new grace periods. |
64db4cff | 2489 | */ |
217af2a2 PM |
2490 | static void force_qs_rnp(struct rcu_state *rsp, |
2491 | int (*f)(struct rcu_data *rsp, bool *isidle, | |
2492 | unsigned long *maxj), | |
2493 | bool *isidle, unsigned long *maxj) | |
64db4cff PM |
2494 | { |
2495 | unsigned long bit; | |
2496 | int cpu; | |
2497 | unsigned long flags; | |
2498 | unsigned long mask; | |
a0b6c9a7 | 2499 | struct rcu_node *rnp; |
64db4cff | 2500 | |
a0b6c9a7 | 2501 | rcu_for_each_leaf_node(rsp, rnp) { |
bde6c3aa | 2502 | cond_resched_rcu_qs(); |
64db4cff | 2503 | mask = 0; |
1304afb2 | 2504 | raw_spin_lock_irqsave(&rnp->lock, flags); |
6303b9c8 | 2505 | smp_mb__after_unlock_lock(); |
ee47eb9f | 2506 | if (!rcu_gp_in_progress(rsp)) { |
1304afb2 | 2507 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
0f10dc82 | 2508 | return; |
64db4cff | 2509 | } |
a0b6c9a7 | 2510 | if (rnp->qsmask == 0) { |
1217ed1b | 2511 | rcu_initiate_boost(rnp, flags); /* releases rnp->lock */ |
64db4cff PM |
2512 | continue; |
2513 | } | |
a0b6c9a7 | 2514 | cpu = rnp->grplo; |
64db4cff | 2515 | bit = 1; |
a0b6c9a7 | 2516 | for (; cpu <= rnp->grphi; cpu++, bit <<= 1) { |
0edd1b17 PM |
2517 | if ((rnp->qsmask & bit) != 0) { |
2518 | if ((rnp->qsmaskinit & bit) != 0) | |
e02b2edf | 2519 | *isidle = false; |
0edd1b17 PM |
2520 | if (f(per_cpu_ptr(rsp->rda, cpu), isidle, maxj)) |
2521 | mask |= bit; | |
2522 | } | |
64db4cff | 2523 | } |
45f014c5 | 2524 | if (mask != 0) { |
64db4cff | 2525 | |
d3f6bad3 PM |
2526 | /* rcu_report_qs_rnp() releases rnp->lock. */ |
2527 | rcu_report_qs_rnp(mask, rsp, rnp, flags); | |
64db4cff PM |
2528 | continue; |
2529 | } | |
1304afb2 | 2530 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
64db4cff | 2531 | } |
27f4d280 | 2532 | rnp = rcu_get_root(rsp); |
1217ed1b PM |
2533 | if (rnp->qsmask == 0) { |
2534 | raw_spin_lock_irqsave(&rnp->lock, flags); | |
6303b9c8 | 2535 | smp_mb__after_unlock_lock(); |
1217ed1b PM |
2536 | rcu_initiate_boost(rnp, flags); /* releases rnp->lock. */ |
2537 | } | |
64db4cff PM |
2538 | } |
2539 | ||
2540 | /* | |
2541 | * Force quiescent states on reluctant CPUs, and also detect which | |
2542 | * CPUs are in dyntick-idle mode. | |
2543 | */ | |
4cdfc175 | 2544 | static void force_quiescent_state(struct rcu_state *rsp) |
64db4cff PM |
2545 | { |
2546 | unsigned long flags; | |
394f2769 PM |
2547 | bool ret; |
2548 | struct rcu_node *rnp; | |
2549 | struct rcu_node *rnp_old = NULL; | |
2550 | ||
2551 | /* Funnel through hierarchy to reduce memory contention. */ | |
d860d403 | 2552 | rnp = __this_cpu_read(rsp->rda->mynode); |
394f2769 PM |
2553 | for (; rnp != NULL; rnp = rnp->parent) { |
2554 | ret = (ACCESS_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) || | |
2555 | !raw_spin_trylock(&rnp->fqslock); | |
2556 | if (rnp_old != NULL) | |
2557 | raw_spin_unlock(&rnp_old->fqslock); | |
2558 | if (ret) { | |
a792563b | 2559 | rsp->n_force_qs_lh++; |
394f2769 PM |
2560 | return; |
2561 | } | |
2562 | rnp_old = rnp; | |
2563 | } | |
2564 | /* rnp_old == rcu_get_root(rsp), rnp == NULL. */ | |
64db4cff | 2565 | |
394f2769 PM |
2566 | /* Reached the root of the rcu_node tree, acquire lock. */ |
2567 | raw_spin_lock_irqsave(&rnp_old->lock, flags); | |
6303b9c8 | 2568 | smp_mb__after_unlock_lock(); |
394f2769 PM |
2569 | raw_spin_unlock(&rnp_old->fqslock); |
2570 | if (ACCESS_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) { | |
a792563b | 2571 | rsp->n_force_qs_lh++; |
394f2769 | 2572 | raw_spin_unlock_irqrestore(&rnp_old->lock, flags); |
4cdfc175 | 2573 | return; /* Someone beat us to it. */ |
46a1e34e | 2574 | } |
4de376a1 PK |
2575 | ACCESS_ONCE(rsp->gp_flags) = |
2576 | ACCESS_ONCE(rsp->gp_flags) | RCU_GP_FLAG_FQS; | |
394f2769 | 2577 | raw_spin_unlock_irqrestore(&rnp_old->lock, flags); |
2aa792e6 | 2578 | rcu_gp_kthread_wake(rsp); |
64db4cff PM |
2579 | } |
2580 | ||
64db4cff | 2581 | /* |
e0f23060 PM |
2582 | * This does the RCU core processing work for the specified rcu_state |
2583 | * and rcu_data structures. This may be called only from the CPU to | |
2584 | * whom the rdp belongs. | |
64db4cff PM |
2585 | */ |
2586 | static void | |
1bca8cf1 | 2587 | __rcu_process_callbacks(struct rcu_state *rsp) |
64db4cff PM |
2588 | { |
2589 | unsigned long flags; | |
48a7639c | 2590 | bool needwake; |
fa07a58f | 2591 | struct rcu_data *rdp = raw_cpu_ptr(rsp->rda); |
64db4cff | 2592 | |
2e597558 PM |
2593 | WARN_ON_ONCE(rdp->beenonline == 0); |
2594 | ||
64db4cff PM |
2595 | /* Update RCU state based on any recent quiescent states. */ |
2596 | rcu_check_quiescent_state(rsp, rdp); | |
2597 | ||
2598 | /* Does this CPU require a not-yet-started grace period? */ | |
dc35c893 | 2599 | local_irq_save(flags); |
64db4cff | 2600 | if (cpu_needs_another_gp(rsp, rdp)) { |
dc35c893 | 2601 | raw_spin_lock(&rcu_get_root(rsp)->lock); /* irqs disabled. */ |
48a7639c | 2602 | needwake = rcu_start_gp(rsp); |
b8462084 | 2603 | raw_spin_unlock_irqrestore(&rcu_get_root(rsp)->lock, flags); |
48a7639c PM |
2604 | if (needwake) |
2605 | rcu_gp_kthread_wake(rsp); | |
dc35c893 PM |
2606 | } else { |
2607 | local_irq_restore(flags); | |
64db4cff PM |
2608 | } |
2609 | ||
2610 | /* If there are callbacks ready, invoke them. */ | |
09223371 | 2611 | if (cpu_has_callbacks_ready_to_invoke(rdp)) |
a46e0899 | 2612 | invoke_rcu_callbacks(rsp, rdp); |
96d3fd0d PM |
2613 | |
2614 | /* Do any needed deferred wakeups of rcuo kthreads. */ | |
2615 | do_nocb_deferred_wakeup(rdp); | |
09223371 SL |
2616 | } |
2617 | ||
64db4cff | 2618 | /* |
e0f23060 | 2619 | * Do RCU core processing for the current CPU. |
64db4cff | 2620 | */ |
09223371 | 2621 | static void rcu_process_callbacks(struct softirq_action *unused) |
64db4cff | 2622 | { |
6ce75a23 PM |
2623 | struct rcu_state *rsp; |
2624 | ||
bfa00b4c PM |
2625 | if (cpu_is_offline(smp_processor_id())) |
2626 | return; | |
f7f7bac9 | 2627 | trace_rcu_utilization(TPS("Start RCU core")); |
6ce75a23 PM |
2628 | for_each_rcu_flavor(rsp) |
2629 | __rcu_process_callbacks(rsp); | |
f7f7bac9 | 2630 | trace_rcu_utilization(TPS("End RCU core")); |
64db4cff PM |
2631 | } |
2632 | ||
a26ac245 | 2633 | /* |
e0f23060 PM |
2634 | * Schedule RCU callback invocation. If the specified type of RCU |
2635 | * does not support RCU priority boosting, just do a direct call, | |
2636 | * otherwise wake up the per-CPU kernel kthread. Note that because we | |
2637 | * are running on the current CPU with interrupts disabled, the | |
2638 | * rcu_cpu_kthread_task cannot disappear out from under us. | |
a26ac245 | 2639 | */ |
a46e0899 | 2640 | static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp) |
a26ac245 | 2641 | { |
b0d30417 PM |
2642 | if (unlikely(!ACCESS_ONCE(rcu_scheduler_fully_active))) |
2643 | return; | |
a46e0899 PM |
2644 | if (likely(!rsp->boost)) { |
2645 | rcu_do_batch(rsp, rdp); | |
a26ac245 PM |
2646 | return; |
2647 | } | |
a46e0899 | 2648 | invoke_rcu_callbacks_kthread(); |
a26ac245 PM |
2649 | } |
2650 | ||
a46e0899 | 2651 | static void invoke_rcu_core(void) |
09223371 | 2652 | { |
b0f74036 PM |
2653 | if (cpu_online(smp_processor_id())) |
2654 | raise_softirq(RCU_SOFTIRQ); | |
09223371 SL |
2655 | } |
2656 | ||
29154c57 PM |
2657 | /* |
2658 | * Handle any core-RCU processing required by a call_rcu() invocation. | |
2659 | */ | |
2660 | static void __call_rcu_core(struct rcu_state *rsp, struct rcu_data *rdp, | |
2661 | struct rcu_head *head, unsigned long flags) | |
64db4cff | 2662 | { |
48a7639c PM |
2663 | bool needwake; |
2664 | ||
62fde6ed PM |
2665 | /* |
2666 | * If called from an extended quiescent state, invoke the RCU | |
2667 | * core in order to force a re-evaluation of RCU's idleness. | |
2668 | */ | |
5c173eb8 | 2669 | if (!rcu_is_watching() && cpu_online(smp_processor_id())) |
62fde6ed PM |
2670 | invoke_rcu_core(); |
2671 | ||
a16b7a69 | 2672 | /* If interrupts were disabled or CPU offline, don't invoke RCU core. */ |
29154c57 | 2673 | if (irqs_disabled_flags(flags) || cpu_is_offline(smp_processor_id())) |
2655d57e | 2674 | return; |
64db4cff | 2675 | |
37c72e56 PM |
2676 | /* |
2677 | * Force the grace period if too many callbacks or too long waiting. | |
2678 | * Enforce hysteresis, and don't invoke force_quiescent_state() | |
2679 | * if some other CPU has recently done so. Also, don't bother | |
2680 | * invoking force_quiescent_state() if the newly enqueued callback | |
2681 | * is the only one waiting for a grace period to complete. | |
2682 | */ | |
2655d57e | 2683 | if (unlikely(rdp->qlen > rdp->qlen_last_fqs_check + qhimark)) { |
b52573d2 PM |
2684 | |
2685 | /* Are we ignoring a completed grace period? */ | |
470716fc | 2686 | note_gp_changes(rsp, rdp); |
b52573d2 PM |
2687 | |
2688 | /* Start a new grace period if one not already started. */ | |
2689 | if (!rcu_gp_in_progress(rsp)) { | |
b52573d2 PM |
2690 | struct rcu_node *rnp_root = rcu_get_root(rsp); |
2691 | ||
b8462084 | 2692 | raw_spin_lock(&rnp_root->lock); |
6303b9c8 | 2693 | smp_mb__after_unlock_lock(); |
48a7639c | 2694 | needwake = rcu_start_gp(rsp); |
b8462084 | 2695 | raw_spin_unlock(&rnp_root->lock); |
48a7639c PM |
2696 | if (needwake) |
2697 | rcu_gp_kthread_wake(rsp); | |
b52573d2 PM |
2698 | } else { |
2699 | /* Give the grace period a kick. */ | |
2700 | rdp->blimit = LONG_MAX; | |
2701 | if (rsp->n_force_qs == rdp->n_force_qs_snap && | |
2702 | *rdp->nxttail[RCU_DONE_TAIL] != head) | |
4cdfc175 | 2703 | force_quiescent_state(rsp); |
b52573d2 PM |
2704 | rdp->n_force_qs_snap = rsp->n_force_qs; |
2705 | rdp->qlen_last_fqs_check = rdp->qlen; | |
2706 | } | |
4cdfc175 | 2707 | } |
29154c57 PM |
2708 | } |
2709 | ||
ae150184 PM |
2710 | /* |
2711 | * RCU callback function to leak a callback. | |
2712 | */ | |
2713 | static void rcu_leak_callback(struct rcu_head *rhp) | |
2714 | { | |
2715 | } | |
2716 | ||
3fbfbf7a PM |
2717 | /* |
2718 | * Helper function for call_rcu() and friends. The cpu argument will | |
2719 | * normally be -1, indicating "currently running CPU". It may specify | |
2720 | * a CPU only if that CPU is a no-CBs CPU. Currently, only _rcu_barrier() | |
2721 | * is expected to specify a CPU. | |
2722 | */ | |
64db4cff PM |
2723 | static void |
2724 | __call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu), | |
3fbfbf7a | 2725 | struct rcu_state *rsp, int cpu, bool lazy) |
64db4cff PM |
2726 | { |
2727 | unsigned long flags; | |
2728 | struct rcu_data *rdp; | |
2729 | ||
1146edcb | 2730 | WARN_ON_ONCE((unsigned long)head & 0x1); /* Misaligned rcu_head! */ |
ae150184 PM |
2731 | if (debug_rcu_head_queue(head)) { |
2732 | /* Probable double call_rcu(), so leak the callback. */ | |
2733 | ACCESS_ONCE(head->func) = rcu_leak_callback; | |
2734 | WARN_ONCE(1, "__call_rcu(): Leaked duplicate callback\n"); | |
2735 | return; | |
2736 | } | |
64db4cff PM |
2737 | head->func = func; |
2738 | head->next = NULL; | |
2739 | ||
64db4cff PM |
2740 | /* |
2741 | * Opportunistically note grace-period endings and beginnings. | |
2742 | * Note that we might see a beginning right after we see an | |
2743 | * end, but never vice versa, since this CPU has to pass through | |
2744 | * a quiescent state betweentimes. | |
2745 | */ | |
2746 | local_irq_save(flags); | |
394f99a9 | 2747 | rdp = this_cpu_ptr(rsp->rda); |
64db4cff PM |
2748 | |
2749 | /* Add the callback to our list. */ | |
3fbfbf7a PM |
2750 | if (unlikely(rdp->nxttail[RCU_NEXT_TAIL] == NULL) || cpu != -1) { |
2751 | int offline; | |
2752 | ||
2753 | if (cpu != -1) | |
2754 | rdp = per_cpu_ptr(rsp->rda, cpu); | |
96d3fd0d | 2755 | offline = !__call_rcu_nocb(rdp, head, lazy, flags); |
3fbfbf7a | 2756 | WARN_ON_ONCE(offline); |
0d8ee37e | 2757 | /* _call_rcu() is illegal on offline CPU; leak the callback. */ |
0d8ee37e PM |
2758 | local_irq_restore(flags); |
2759 | return; | |
2760 | } | |
a792563b | 2761 | ACCESS_ONCE(rdp->qlen) = rdp->qlen + 1; |
486e2593 PM |
2762 | if (lazy) |
2763 | rdp->qlen_lazy++; | |
c57afe80 PM |
2764 | else |
2765 | rcu_idle_count_callbacks_posted(); | |
b1420f1c PM |
2766 | smp_mb(); /* Count before adding callback for rcu_barrier(). */ |
2767 | *rdp->nxttail[RCU_NEXT_TAIL] = head; | |
2768 | rdp->nxttail[RCU_NEXT_TAIL] = &head->next; | |
2655d57e | 2769 | |
d4c08f2a PM |
2770 | if (__is_kfree_rcu_offset((unsigned long)func)) |
2771 | trace_rcu_kfree_callback(rsp->name, head, (unsigned long)func, | |
486e2593 | 2772 | rdp->qlen_lazy, rdp->qlen); |
d4c08f2a | 2773 | else |
486e2593 | 2774 | trace_rcu_callback(rsp->name, head, rdp->qlen_lazy, rdp->qlen); |
d4c08f2a | 2775 | |
29154c57 PM |
2776 | /* Go handle any RCU core processing required. */ |
2777 | __call_rcu_core(rsp, rdp, head, flags); | |
64db4cff PM |
2778 | local_irq_restore(flags); |
2779 | } | |
2780 | ||
2781 | /* | |
d6714c22 | 2782 | * Queue an RCU-sched callback for invocation after a grace period. |
64db4cff | 2783 | */ |
d6714c22 | 2784 | void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu)) |
64db4cff | 2785 | { |
3fbfbf7a | 2786 | __call_rcu(head, func, &rcu_sched_state, -1, 0); |
64db4cff | 2787 | } |
d6714c22 | 2788 | EXPORT_SYMBOL_GPL(call_rcu_sched); |
64db4cff PM |
2789 | |
2790 | /* | |
486e2593 | 2791 | * Queue an RCU callback for invocation after a quicker grace period. |
64db4cff PM |
2792 | */ |
2793 | void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu)) | |
2794 | { | |
3fbfbf7a | 2795 | __call_rcu(head, func, &rcu_bh_state, -1, 0); |
64db4cff PM |
2796 | } |
2797 | EXPORT_SYMBOL_GPL(call_rcu_bh); | |
2798 | ||
495aa969 ACB |
2799 | /* |
2800 | * Queue an RCU callback for lazy invocation after a grace period. | |
2801 | * This will likely be later named something like "call_rcu_lazy()", | |
2802 | * but this change will require some way of tagging the lazy RCU | |
2803 | * callbacks in the list of pending callbacks. Until then, this | |
2804 | * function may only be called from __kfree_rcu(). | |
2805 | */ | |
2806 | void kfree_call_rcu(struct rcu_head *head, | |
2807 | void (*func)(struct rcu_head *rcu)) | |
2808 | { | |
e534165b | 2809 | __call_rcu(head, func, rcu_state_p, -1, 1); |
495aa969 ACB |
2810 | } |
2811 | EXPORT_SYMBOL_GPL(kfree_call_rcu); | |
2812 | ||
6d813391 PM |
2813 | /* |
2814 | * Because a context switch is a grace period for RCU-sched and RCU-bh, | |
2815 | * any blocking grace-period wait automatically implies a grace period | |
2816 | * if there is only one CPU online at any point time during execution | |
2817 | * of either synchronize_sched() or synchronize_rcu_bh(). It is OK to | |
2818 | * occasionally incorrectly indicate that there are multiple CPUs online | |
2819 | * when there was in fact only one the whole time, as this just adds | |
2820 | * some overhead: RCU still operates correctly. | |
6d813391 PM |
2821 | */ |
2822 | static inline int rcu_blocking_is_gp(void) | |
2823 | { | |
95f0c1de PM |
2824 | int ret; |
2825 | ||
6d813391 | 2826 | might_sleep(); /* Check for RCU read-side critical section. */ |
95f0c1de PM |
2827 | preempt_disable(); |
2828 | ret = num_online_cpus() <= 1; | |
2829 | preempt_enable(); | |
2830 | return ret; | |
6d813391 PM |
2831 | } |
2832 | ||
6ebb237b PM |
2833 | /** |
2834 | * synchronize_sched - wait until an rcu-sched grace period has elapsed. | |
2835 | * | |
2836 | * Control will return to the caller some time after a full rcu-sched | |
2837 | * grace period has elapsed, in other words after all currently executing | |
2838 | * rcu-sched read-side critical sections have completed. These read-side | |
2839 | * critical sections are delimited by rcu_read_lock_sched() and | |
2840 | * rcu_read_unlock_sched(), and may be nested. Note that preempt_disable(), | |
2841 | * local_irq_disable(), and so on may be used in place of | |
2842 | * rcu_read_lock_sched(). | |
2843 | * | |
2844 | * This means that all preempt_disable code sequences, including NMI and | |
f0a0e6f2 PM |
2845 | * non-threaded hardware-interrupt handlers, in progress on entry will |
2846 | * have completed before this primitive returns. However, this does not | |
2847 | * guarantee that softirq handlers will have completed, since in some | |
2848 | * kernels, these handlers can run in process context, and can block. | |
2849 | * | |
2850 | * Note that this guarantee implies further memory-ordering guarantees. | |
2851 | * On systems with more than one CPU, when synchronize_sched() returns, | |
2852 | * each CPU is guaranteed to have executed a full memory barrier since the | |
2853 | * end of its last RCU-sched read-side critical section whose beginning | |
2854 | * preceded the call to synchronize_sched(). In addition, each CPU having | |
2855 | * an RCU read-side critical section that extends beyond the return from | |
2856 | * synchronize_sched() is guaranteed to have executed a full memory barrier | |
2857 | * after the beginning of synchronize_sched() and before the beginning of | |
2858 | * that RCU read-side critical section. Note that these guarantees include | |
2859 | * CPUs that are offline, idle, or executing in user mode, as well as CPUs | |
2860 | * that are executing in the kernel. | |
2861 | * | |
2862 | * Furthermore, if CPU A invoked synchronize_sched(), which returned | |
2863 | * to its caller on CPU B, then both CPU A and CPU B are guaranteed | |
2864 | * to have executed a full memory barrier during the execution of | |
2865 | * synchronize_sched() -- even if CPU A and CPU B are the same CPU (but | |
2866 | * again only if the system has more than one CPU). | |
6ebb237b PM |
2867 | * |
2868 | * This primitive provides the guarantees made by the (now removed) | |
2869 | * synchronize_kernel() API. In contrast, synchronize_rcu() only | |
2870 | * guarantees that rcu_read_lock() sections will have completed. | |
2871 | * In "classic RCU", these two guarantees happen to be one and | |
2872 | * the same, but can differ in realtime RCU implementations. | |
2873 | */ | |
2874 | void synchronize_sched(void) | |
2875 | { | |
fe15d706 PM |
2876 | rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) && |
2877 | !lock_is_held(&rcu_lock_map) && | |
2878 | !lock_is_held(&rcu_sched_lock_map), | |
2879 | "Illegal synchronize_sched() in RCU-sched read-side critical section"); | |
6ebb237b PM |
2880 | if (rcu_blocking_is_gp()) |
2881 | return; | |
3705b88d AM |
2882 | if (rcu_expedited) |
2883 | synchronize_sched_expedited(); | |
2884 | else | |
2885 | wait_rcu_gp(call_rcu_sched); | |
6ebb237b PM |
2886 | } |
2887 | EXPORT_SYMBOL_GPL(synchronize_sched); | |
2888 | ||
2889 | /** | |
2890 | * synchronize_rcu_bh - wait until an rcu_bh grace period has elapsed. | |
2891 | * | |
2892 | * Control will return to the caller some time after a full rcu_bh grace | |
2893 | * period has elapsed, in other words after all currently executing rcu_bh | |
2894 | * read-side critical sections have completed. RCU read-side critical | |
2895 | * sections are delimited by rcu_read_lock_bh() and rcu_read_unlock_bh(), | |
2896 | * and may be nested. | |
f0a0e6f2 PM |
2897 | * |
2898 | * See the description of synchronize_sched() for more detailed information | |
2899 | * on memory ordering guarantees. | |
6ebb237b PM |
2900 | */ |
2901 | void synchronize_rcu_bh(void) | |
2902 | { | |
fe15d706 PM |
2903 | rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) && |
2904 | !lock_is_held(&rcu_lock_map) && | |
2905 | !lock_is_held(&rcu_sched_lock_map), | |
2906 | "Illegal synchronize_rcu_bh() in RCU-bh read-side critical section"); | |
6ebb237b PM |
2907 | if (rcu_blocking_is_gp()) |
2908 | return; | |
3705b88d AM |
2909 | if (rcu_expedited) |
2910 | synchronize_rcu_bh_expedited(); | |
2911 | else | |
2912 | wait_rcu_gp(call_rcu_bh); | |
6ebb237b PM |
2913 | } |
2914 | EXPORT_SYMBOL_GPL(synchronize_rcu_bh); | |
2915 | ||
765a3f4f PM |
2916 | /** |
2917 | * get_state_synchronize_rcu - Snapshot current RCU state | |
2918 | * | |
2919 | * Returns a cookie that is used by a later call to cond_synchronize_rcu() | |
2920 | * to determine whether or not a full grace period has elapsed in the | |
2921 | * meantime. | |
2922 | */ | |
2923 | unsigned long get_state_synchronize_rcu(void) | |
2924 | { | |
2925 | /* | |
2926 | * Any prior manipulation of RCU-protected data must happen | |
2927 | * before the load from ->gpnum. | |
2928 | */ | |
2929 | smp_mb(); /* ^^^ */ | |
2930 | ||
2931 | /* | |
2932 | * Make sure this load happens before the purportedly | |
2933 | * time-consuming work between get_state_synchronize_rcu() | |
2934 | * and cond_synchronize_rcu(). | |
2935 | */ | |
e534165b | 2936 | return smp_load_acquire(&rcu_state_p->gpnum); |
765a3f4f PM |
2937 | } |
2938 | EXPORT_SYMBOL_GPL(get_state_synchronize_rcu); | |
2939 | ||
2940 | /** | |
2941 | * cond_synchronize_rcu - Conditionally wait for an RCU grace period | |
2942 | * | |
2943 | * @oldstate: return value from earlier call to get_state_synchronize_rcu() | |
2944 | * | |
2945 | * If a full RCU grace period has elapsed since the earlier call to | |
2946 | * get_state_synchronize_rcu(), just return. Otherwise, invoke | |
2947 | * synchronize_rcu() to wait for a full grace period. | |
2948 | * | |
2949 | * Yes, this function does not take counter wrap into account. But | |
2950 | * counter wrap is harmless. If the counter wraps, we have waited for | |
2951 | * more than 2 billion grace periods (and way more on a 64-bit system!), | |
2952 | * so waiting for one additional grace period should be just fine. | |
2953 | */ | |
2954 | void cond_synchronize_rcu(unsigned long oldstate) | |
2955 | { | |
2956 | unsigned long newstate; | |
2957 | ||
2958 | /* | |
2959 | * Ensure that this load happens before any RCU-destructive | |
2960 | * actions the caller might carry out after we return. | |
2961 | */ | |
e534165b | 2962 | newstate = smp_load_acquire(&rcu_state_p->completed); |
765a3f4f PM |
2963 | if (ULONG_CMP_GE(oldstate, newstate)) |
2964 | synchronize_rcu(); | |
2965 | } | |
2966 | EXPORT_SYMBOL_GPL(cond_synchronize_rcu); | |
2967 | ||
3d3b7db0 PM |
2968 | static int synchronize_sched_expedited_cpu_stop(void *data) |
2969 | { | |
2970 | /* | |
2971 | * There must be a full memory barrier on each affected CPU | |
2972 | * between the time that try_stop_cpus() is called and the | |
2973 | * time that it returns. | |
2974 | * | |
2975 | * In the current initial implementation of cpu_stop, the | |
2976 | * above condition is already met when the control reaches | |
2977 | * this point and the following smp_mb() is not strictly | |
2978 | * necessary. Do smp_mb() anyway for documentation and | |
2979 | * robustness against future implementation changes. | |
2980 | */ | |
2981 | smp_mb(); /* See above comment block. */ | |
2982 | return 0; | |
2983 | } | |
2984 | ||
236fefaf PM |
2985 | /** |
2986 | * synchronize_sched_expedited - Brute-force RCU-sched grace period | |
2987 | * | |
2988 | * Wait for an RCU-sched grace period to elapse, but use a "big hammer" | |
2989 | * approach to force the grace period to end quickly. This consumes | |
2990 | * significant time on all CPUs and is unfriendly to real-time workloads, | |
2991 | * so is thus not recommended for any sort of common-case code. In fact, | |
2992 | * if you are using synchronize_sched_expedited() in a loop, please | |
2993 | * restructure your code to batch your updates, and then use a single | |
2994 | * synchronize_sched() instead. | |
3d3b7db0 | 2995 | * |
3d3b7db0 PM |
2996 | * This implementation can be thought of as an application of ticket |
2997 | * locking to RCU, with sync_sched_expedited_started and | |
2998 | * sync_sched_expedited_done taking on the roles of the halves | |
2999 | * of the ticket-lock word. Each task atomically increments | |
3000 | * sync_sched_expedited_started upon entry, snapshotting the old value, | |
3001 | * then attempts to stop all the CPUs. If this succeeds, then each | |
3002 | * CPU will have executed a context switch, resulting in an RCU-sched | |
3003 | * grace period. We are then done, so we use atomic_cmpxchg() to | |
3004 | * update sync_sched_expedited_done to match our snapshot -- but | |
3005 | * only if someone else has not already advanced past our snapshot. | |
3006 | * | |
3007 | * On the other hand, if try_stop_cpus() fails, we check the value | |
3008 | * of sync_sched_expedited_done. If it has advanced past our | |
3009 | * initial snapshot, then someone else must have forced a grace period | |
3010 | * some time after we took our snapshot. In this case, our work is | |
3011 | * done for us, and we can simply return. Otherwise, we try again, | |
3012 | * but keep our initial snapshot for purposes of checking for someone | |
3013 | * doing our work for us. | |
3014 | * | |
3015 | * If we fail too many times in a row, we fall back to synchronize_sched(). | |
3016 | */ | |
3017 | void synchronize_sched_expedited(void) | |
3018 | { | |
e0775cef PM |
3019 | cpumask_var_t cm; |
3020 | bool cma = false; | |
3021 | int cpu; | |
1924bcb0 PM |
3022 | long firstsnap, s, snap; |
3023 | int trycount = 0; | |
40694d66 | 3024 | struct rcu_state *rsp = &rcu_sched_state; |
3d3b7db0 | 3025 | |
1924bcb0 PM |
3026 | /* |
3027 | * If we are in danger of counter wrap, just do synchronize_sched(). | |
3028 | * By allowing sync_sched_expedited_started to advance no more than | |
3029 | * ULONG_MAX/8 ahead of sync_sched_expedited_done, we are ensuring | |
3030 | * that more than 3.5 billion CPUs would be required to force a | |
3031 | * counter wrap on a 32-bit system. Quite a few more CPUs would of | |
3032 | * course be required on a 64-bit system. | |
3033 | */ | |
40694d66 PM |
3034 | if (ULONG_CMP_GE((ulong)atomic_long_read(&rsp->expedited_start), |
3035 | (ulong)atomic_long_read(&rsp->expedited_done) + | |
1924bcb0 PM |
3036 | ULONG_MAX / 8)) { |
3037 | synchronize_sched(); | |
a30489c5 | 3038 | atomic_long_inc(&rsp->expedited_wrap); |
1924bcb0 PM |
3039 | return; |
3040 | } | |
3d3b7db0 | 3041 | |
1924bcb0 PM |
3042 | /* |
3043 | * Take a ticket. Note that atomic_inc_return() implies a | |
3044 | * full memory barrier. | |
3045 | */ | |
40694d66 | 3046 | snap = atomic_long_inc_return(&rsp->expedited_start); |
1924bcb0 | 3047 | firstsnap = snap; |
dd56af42 PM |
3048 | if (!try_get_online_cpus()) { |
3049 | /* CPU hotplug operation in flight, fall back to normal GP. */ | |
3050 | wait_rcu_gp(call_rcu_sched); | |
3051 | atomic_long_inc(&rsp->expedited_normal); | |
3052 | return; | |
3053 | } | |
1cc85961 | 3054 | WARN_ON_ONCE(cpu_is_offline(raw_smp_processor_id())); |
3d3b7db0 | 3055 | |
e0775cef PM |
3056 | /* Offline CPUs, idle CPUs, and any CPU we run on are quiescent. */ |
3057 | cma = zalloc_cpumask_var(&cm, GFP_KERNEL); | |
3058 | if (cma) { | |
3059 | cpumask_copy(cm, cpu_online_mask); | |
3060 | cpumask_clear_cpu(raw_smp_processor_id(), cm); | |
3061 | for_each_cpu(cpu, cm) { | |
3062 | struct rcu_dynticks *rdtp = &per_cpu(rcu_dynticks, cpu); | |
3063 | ||
3064 | if (!(atomic_add_return(0, &rdtp->dynticks) & 0x1)) | |
3065 | cpumask_clear_cpu(cpu, cm); | |
3066 | } | |
3067 | if (cpumask_weight(cm) == 0) | |
3068 | goto all_cpus_idle; | |
3069 | } | |
3070 | ||
3d3b7db0 PM |
3071 | /* |
3072 | * Each pass through the following loop attempts to force a | |
3073 | * context switch on each CPU. | |
3074 | */ | |
e0775cef | 3075 | while (try_stop_cpus(cma ? cm : cpu_online_mask, |
3d3b7db0 PM |
3076 | synchronize_sched_expedited_cpu_stop, |
3077 | NULL) == -EAGAIN) { | |
3078 | put_online_cpus(); | |
a30489c5 | 3079 | atomic_long_inc(&rsp->expedited_tryfail); |
3d3b7db0 | 3080 | |
1924bcb0 | 3081 | /* Check to see if someone else did our work for us. */ |
40694d66 | 3082 | s = atomic_long_read(&rsp->expedited_done); |
1924bcb0 | 3083 | if (ULONG_CMP_GE((ulong)s, (ulong)firstsnap)) { |
a30489c5 | 3084 | /* ensure test happens before caller kfree */ |
4e857c58 | 3085 | smp_mb__before_atomic(); /* ^^^ */ |
a30489c5 | 3086 | atomic_long_inc(&rsp->expedited_workdone1); |
e0775cef | 3087 | free_cpumask_var(cm); |
1924bcb0 PM |
3088 | return; |
3089 | } | |
3d3b7db0 PM |
3090 | |
3091 | /* No joy, try again later. Or just synchronize_sched(). */ | |
c701d5d9 | 3092 | if (trycount++ < 10) { |
3d3b7db0 | 3093 | udelay(trycount * num_online_cpus()); |
c701d5d9 | 3094 | } else { |
3705b88d | 3095 | wait_rcu_gp(call_rcu_sched); |
a30489c5 | 3096 | atomic_long_inc(&rsp->expedited_normal); |
e0775cef | 3097 | free_cpumask_var(cm); |
3d3b7db0 PM |
3098 | return; |
3099 | } | |
3100 | ||
1924bcb0 | 3101 | /* Recheck to see if someone else did our work for us. */ |
40694d66 | 3102 | s = atomic_long_read(&rsp->expedited_done); |
1924bcb0 | 3103 | if (ULONG_CMP_GE((ulong)s, (ulong)firstsnap)) { |
a30489c5 | 3104 | /* ensure test happens before caller kfree */ |
4e857c58 | 3105 | smp_mb__before_atomic(); /* ^^^ */ |
a30489c5 | 3106 | atomic_long_inc(&rsp->expedited_workdone2); |
e0775cef | 3107 | free_cpumask_var(cm); |
3d3b7db0 PM |
3108 | return; |
3109 | } | |
3110 | ||
3111 | /* | |
3112 | * Refetching sync_sched_expedited_started allows later | |
1924bcb0 PM |
3113 | * callers to piggyback on our grace period. We retry |
3114 | * after they started, so our grace period works for them, | |
3115 | * and they started after our first try, so their grace | |
3116 | * period works for us. | |
3d3b7db0 | 3117 | */ |
dd56af42 PM |
3118 | if (!try_get_online_cpus()) { |
3119 | /* CPU hotplug operation in flight, use normal GP. */ | |
3120 | wait_rcu_gp(call_rcu_sched); | |
3121 | atomic_long_inc(&rsp->expedited_normal); | |
e0775cef | 3122 | free_cpumask_var(cm); |
dd56af42 PM |
3123 | return; |
3124 | } | |
40694d66 | 3125 | snap = atomic_long_read(&rsp->expedited_start); |
3d3b7db0 PM |
3126 | smp_mb(); /* ensure read is before try_stop_cpus(). */ |
3127 | } | |
a30489c5 | 3128 | atomic_long_inc(&rsp->expedited_stoppedcpus); |
3d3b7db0 | 3129 | |
e0775cef PM |
3130 | all_cpus_idle: |
3131 | free_cpumask_var(cm); | |
3132 | ||
3d3b7db0 PM |
3133 | /* |
3134 | * Everyone up to our most recent fetch is covered by our grace | |
3135 | * period. Update the counter, but only if our work is still | |
3136 | * relevant -- which it won't be if someone who started later | |
1924bcb0 | 3137 | * than we did already did their update. |
3d3b7db0 PM |
3138 | */ |
3139 | do { | |
a30489c5 | 3140 | atomic_long_inc(&rsp->expedited_done_tries); |
40694d66 | 3141 | s = atomic_long_read(&rsp->expedited_done); |
1924bcb0 | 3142 | if (ULONG_CMP_GE((ulong)s, (ulong)snap)) { |
a30489c5 | 3143 | /* ensure test happens before caller kfree */ |
4e857c58 | 3144 | smp_mb__before_atomic(); /* ^^^ */ |
a30489c5 | 3145 | atomic_long_inc(&rsp->expedited_done_lost); |
3d3b7db0 PM |
3146 | break; |
3147 | } | |
40694d66 | 3148 | } while (atomic_long_cmpxchg(&rsp->expedited_done, s, snap) != s); |
a30489c5 | 3149 | atomic_long_inc(&rsp->expedited_done_exit); |
3d3b7db0 PM |
3150 | |
3151 | put_online_cpus(); | |
3152 | } | |
3153 | EXPORT_SYMBOL_GPL(synchronize_sched_expedited); | |
3154 | ||
64db4cff PM |
3155 | /* |
3156 | * Check to see if there is any immediate RCU-related work to be done | |
3157 | * by the current CPU, for the specified type of RCU, returning 1 if so. | |
3158 | * The checks are in order of increasing expense: checks that can be | |
3159 | * carried out against CPU-local state are performed first. However, | |
3160 | * we must check for CPU stalls first, else we might not get a chance. | |
3161 | */ | |
3162 | static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp) | |
3163 | { | |
2f51f988 PM |
3164 | struct rcu_node *rnp = rdp->mynode; |
3165 | ||
64db4cff PM |
3166 | rdp->n_rcu_pending++; |
3167 | ||
3168 | /* Check for CPU stalls, if enabled. */ | |
3169 | check_cpu_stall(rsp, rdp); | |
3170 | ||
a096932f PM |
3171 | /* Is this CPU a NO_HZ_FULL CPU that should ignore RCU? */ |
3172 | if (rcu_nohz_full_cpu(rsp)) | |
3173 | return 0; | |
3174 | ||
64db4cff | 3175 | /* Is the RCU core waiting for a quiescent state from this CPU? */ |
5c51dd73 PM |
3176 | if (rcu_scheduler_fully_active && |
3177 | rdp->qs_pending && !rdp->passed_quiesce) { | |
d21670ac | 3178 | rdp->n_rp_qs_pending++; |
e4cc1f22 | 3179 | } else if (rdp->qs_pending && rdp->passed_quiesce) { |
d21670ac | 3180 | rdp->n_rp_report_qs++; |
64db4cff | 3181 | return 1; |
7ba5c840 | 3182 | } |
64db4cff PM |
3183 | |
3184 | /* Does this CPU have callbacks ready to invoke? */ | |
7ba5c840 PM |
3185 | if (cpu_has_callbacks_ready_to_invoke(rdp)) { |
3186 | rdp->n_rp_cb_ready++; | |
64db4cff | 3187 | return 1; |
7ba5c840 | 3188 | } |
64db4cff PM |
3189 | |
3190 | /* Has RCU gone idle with this CPU needing another grace period? */ | |
7ba5c840 PM |
3191 | if (cpu_needs_another_gp(rsp, rdp)) { |
3192 | rdp->n_rp_cpu_needs_gp++; | |
64db4cff | 3193 | return 1; |
7ba5c840 | 3194 | } |
64db4cff PM |
3195 | |
3196 | /* Has another RCU grace period completed? */ | |
2f51f988 | 3197 | if (ACCESS_ONCE(rnp->completed) != rdp->completed) { /* outside lock */ |
7ba5c840 | 3198 | rdp->n_rp_gp_completed++; |
64db4cff | 3199 | return 1; |
7ba5c840 | 3200 | } |
64db4cff PM |
3201 | |
3202 | /* Has a new RCU grace period started? */ | |
2f51f988 | 3203 | if (ACCESS_ONCE(rnp->gpnum) != rdp->gpnum) { /* outside lock */ |
7ba5c840 | 3204 | rdp->n_rp_gp_started++; |
64db4cff | 3205 | return 1; |
7ba5c840 | 3206 | } |
64db4cff | 3207 | |
96d3fd0d PM |
3208 | /* Does this CPU need a deferred NOCB wakeup? */ |
3209 | if (rcu_nocb_need_deferred_wakeup(rdp)) { | |
3210 | rdp->n_rp_nocb_defer_wakeup++; | |
3211 | return 1; | |
3212 | } | |
3213 | ||
64db4cff | 3214 | /* nothing to do */ |
7ba5c840 | 3215 | rdp->n_rp_need_nothing++; |
64db4cff PM |
3216 | return 0; |
3217 | } | |
3218 | ||
3219 | /* | |
3220 | * Check to see if there is any immediate RCU-related work to be done | |
3221 | * by the current CPU, returning 1 if so. This function is part of the | |
3222 | * RCU implementation; it is -not- an exported member of the RCU API. | |
3223 | */ | |
e3950ecd | 3224 | static int rcu_pending(void) |
64db4cff | 3225 | { |
6ce75a23 PM |
3226 | struct rcu_state *rsp; |
3227 | ||
3228 | for_each_rcu_flavor(rsp) | |
e3950ecd | 3229 | if (__rcu_pending(rsp, this_cpu_ptr(rsp->rda))) |
6ce75a23 PM |
3230 | return 1; |
3231 | return 0; | |
64db4cff PM |
3232 | } |
3233 | ||
3234 | /* | |
c0f4dfd4 PM |
3235 | * Return true if the specified CPU has any callback. If all_lazy is |
3236 | * non-NULL, store an indication of whether all callbacks are lazy. | |
3237 | * (If there are no callbacks, all of them are deemed to be lazy.) | |
64db4cff | 3238 | */ |
aa6da514 | 3239 | static int __maybe_unused rcu_cpu_has_callbacks(bool *all_lazy) |
64db4cff | 3240 | { |
c0f4dfd4 PM |
3241 | bool al = true; |
3242 | bool hc = false; | |
3243 | struct rcu_data *rdp; | |
6ce75a23 PM |
3244 | struct rcu_state *rsp; |
3245 | ||
c0f4dfd4 | 3246 | for_each_rcu_flavor(rsp) { |
aa6da514 | 3247 | rdp = this_cpu_ptr(rsp->rda); |
69c8d28c PM |
3248 | if (!rdp->nxtlist) |
3249 | continue; | |
3250 | hc = true; | |
3251 | if (rdp->qlen != rdp->qlen_lazy || !all_lazy) { | |
c0f4dfd4 | 3252 | al = false; |
69c8d28c PM |
3253 | break; |
3254 | } | |
c0f4dfd4 PM |
3255 | } |
3256 | if (all_lazy) | |
3257 | *all_lazy = al; | |
3258 | return hc; | |
64db4cff PM |
3259 | } |
3260 | ||
a83eff0a PM |
3261 | /* |
3262 | * Helper function for _rcu_barrier() tracing. If tracing is disabled, | |
3263 | * the compiler is expected to optimize this away. | |
3264 | */ | |
e66c33d5 | 3265 | static void _rcu_barrier_trace(struct rcu_state *rsp, const char *s, |
a83eff0a PM |
3266 | int cpu, unsigned long done) |
3267 | { | |
3268 | trace_rcu_barrier(rsp->name, s, cpu, | |
3269 | atomic_read(&rsp->barrier_cpu_count), done); | |
3270 | } | |
3271 | ||
b1420f1c PM |
3272 | /* |
3273 | * RCU callback function for _rcu_barrier(). If we are last, wake | |
3274 | * up the task executing _rcu_barrier(). | |
3275 | */ | |
24ebbca8 | 3276 | static void rcu_barrier_callback(struct rcu_head *rhp) |
d0ec774c | 3277 | { |
24ebbca8 PM |
3278 | struct rcu_data *rdp = container_of(rhp, struct rcu_data, barrier_head); |
3279 | struct rcu_state *rsp = rdp->rsp; | |
3280 | ||
a83eff0a PM |
3281 | if (atomic_dec_and_test(&rsp->barrier_cpu_count)) { |
3282 | _rcu_barrier_trace(rsp, "LastCB", -1, rsp->n_barrier_done); | |
7db74df8 | 3283 | complete(&rsp->barrier_completion); |
a83eff0a PM |
3284 | } else { |
3285 | _rcu_barrier_trace(rsp, "CB", -1, rsp->n_barrier_done); | |
3286 | } | |
d0ec774c PM |
3287 | } |
3288 | ||
3289 | /* | |
3290 | * Called with preemption disabled, and from cross-cpu IRQ context. | |
3291 | */ | |
3292 | static void rcu_barrier_func(void *type) | |
3293 | { | |
037b64ed | 3294 | struct rcu_state *rsp = type; |
fa07a58f | 3295 | struct rcu_data *rdp = raw_cpu_ptr(rsp->rda); |
d0ec774c | 3296 | |
a83eff0a | 3297 | _rcu_barrier_trace(rsp, "IRQ", -1, rsp->n_barrier_done); |
24ebbca8 | 3298 | atomic_inc(&rsp->barrier_cpu_count); |
06668efa | 3299 | rsp->call(&rdp->barrier_head, rcu_barrier_callback); |
d0ec774c PM |
3300 | } |
3301 | ||
d0ec774c PM |
3302 | /* |
3303 | * Orchestrate the specified type of RCU barrier, waiting for all | |
3304 | * RCU callbacks of the specified type to complete. | |
3305 | */ | |
037b64ed | 3306 | static void _rcu_barrier(struct rcu_state *rsp) |
d0ec774c | 3307 | { |
b1420f1c | 3308 | int cpu; |
b1420f1c | 3309 | struct rcu_data *rdp; |
cf3a9c48 PM |
3310 | unsigned long snap = ACCESS_ONCE(rsp->n_barrier_done); |
3311 | unsigned long snap_done; | |
b1420f1c | 3312 | |
a83eff0a | 3313 | _rcu_barrier_trace(rsp, "Begin", -1, snap); |
b1420f1c | 3314 | |
e74f4c45 | 3315 | /* Take mutex to serialize concurrent rcu_barrier() requests. */ |
7be7f0be | 3316 | mutex_lock(&rsp->barrier_mutex); |
b1420f1c | 3317 | |
cf3a9c48 PM |
3318 | /* |
3319 | * Ensure that all prior references, including to ->n_barrier_done, | |
3320 | * are ordered before the _rcu_barrier() machinery. | |
3321 | */ | |
3322 | smp_mb(); /* See above block comment. */ | |
3323 | ||
3324 | /* | |
3325 | * Recheck ->n_barrier_done to see if others did our work for us. | |
3326 | * This means checking ->n_barrier_done for an even-to-odd-to-even | |
3327 | * transition. The "if" expression below therefore rounds the old | |
3328 | * value up to the next even number and adds two before comparing. | |
3329 | */ | |
458fb381 | 3330 | snap_done = rsp->n_barrier_done; |
a83eff0a | 3331 | _rcu_barrier_trace(rsp, "Check", -1, snap_done); |
458fb381 PM |
3332 | |
3333 | /* | |
3334 | * If the value in snap is odd, we needed to wait for the current | |
3335 | * rcu_barrier() to complete, then wait for the next one, in other | |
3336 | * words, we need the value of snap_done to be three larger than | |
3337 | * the value of snap. On the other hand, if the value in snap is | |
3338 | * even, we only had to wait for the next rcu_barrier() to complete, | |
3339 | * in other words, we need the value of snap_done to be only two | |
3340 | * greater than the value of snap. The "(snap + 3) & ~0x1" computes | |
3341 | * this for us (thank you, Linus!). | |
3342 | */ | |
3343 | if (ULONG_CMP_GE(snap_done, (snap + 3) & ~0x1)) { | |
a83eff0a | 3344 | _rcu_barrier_trace(rsp, "EarlyExit", -1, snap_done); |
cf3a9c48 PM |
3345 | smp_mb(); /* caller's subsequent code after above check. */ |
3346 | mutex_unlock(&rsp->barrier_mutex); | |
3347 | return; | |
3348 | } | |
3349 | ||
3350 | /* | |
3351 | * Increment ->n_barrier_done to avoid duplicate work. Use | |
3352 | * ACCESS_ONCE() to prevent the compiler from speculating | |
3353 | * the increment to precede the early-exit check. | |
3354 | */ | |
a792563b | 3355 | ACCESS_ONCE(rsp->n_barrier_done) = rsp->n_barrier_done + 1; |
cf3a9c48 | 3356 | WARN_ON_ONCE((rsp->n_barrier_done & 0x1) != 1); |
a83eff0a | 3357 | _rcu_barrier_trace(rsp, "Inc1", -1, rsp->n_barrier_done); |
cf3a9c48 | 3358 | smp_mb(); /* Order ->n_barrier_done increment with below mechanism. */ |
b1420f1c | 3359 | |
d0ec774c | 3360 | /* |
b1420f1c PM |
3361 | * Initialize the count to one rather than to zero in order to |
3362 | * avoid a too-soon return to zero in case of a short grace period | |
1331e7a1 PM |
3363 | * (or preemption of this task). Exclude CPU-hotplug operations |
3364 | * to ensure that no offline CPU has callbacks queued. | |
d0ec774c | 3365 | */ |
7db74df8 | 3366 | init_completion(&rsp->barrier_completion); |
24ebbca8 | 3367 | atomic_set(&rsp->barrier_cpu_count, 1); |
1331e7a1 | 3368 | get_online_cpus(); |
b1420f1c PM |
3369 | |
3370 | /* | |
1331e7a1 PM |
3371 | * Force each CPU with callbacks to register a new callback. |
3372 | * When that callback is invoked, we will know that all of the | |
3373 | * corresponding CPU's preceding callbacks have been invoked. | |
b1420f1c | 3374 | */ |
3fbfbf7a | 3375 | for_each_possible_cpu(cpu) { |
d1e43fa5 | 3376 | if (!cpu_online(cpu) && !rcu_is_nocb_cpu(cpu)) |
3fbfbf7a | 3377 | continue; |
b1420f1c | 3378 | rdp = per_cpu_ptr(rsp->rda, cpu); |
d1e43fa5 | 3379 | if (rcu_is_nocb_cpu(cpu)) { |
d7e29933 PM |
3380 | if (!rcu_nocb_cpu_needs_barrier(rsp, cpu)) { |
3381 | _rcu_barrier_trace(rsp, "OfflineNoCB", cpu, | |
3382 | rsp->n_barrier_done); | |
3383 | } else { | |
3384 | _rcu_barrier_trace(rsp, "OnlineNoCB", cpu, | |
3385 | rsp->n_barrier_done); | |
3386 | atomic_inc(&rsp->barrier_cpu_count); | |
3387 | __call_rcu(&rdp->barrier_head, | |
3388 | rcu_barrier_callback, rsp, cpu, 0); | |
3389 | } | |
3fbfbf7a | 3390 | } else if (ACCESS_ONCE(rdp->qlen)) { |
a83eff0a PM |
3391 | _rcu_barrier_trace(rsp, "OnlineQ", cpu, |
3392 | rsp->n_barrier_done); | |
037b64ed | 3393 | smp_call_function_single(cpu, rcu_barrier_func, rsp, 1); |
b1420f1c | 3394 | } else { |
a83eff0a PM |
3395 | _rcu_barrier_trace(rsp, "OnlineNQ", cpu, |
3396 | rsp->n_barrier_done); | |
b1420f1c PM |
3397 | } |
3398 | } | |
1331e7a1 | 3399 | put_online_cpus(); |
b1420f1c PM |
3400 | |
3401 | /* | |
3402 | * Now that we have an rcu_barrier_callback() callback on each | |
3403 | * CPU, and thus each counted, remove the initial count. | |
3404 | */ | |
24ebbca8 | 3405 | if (atomic_dec_and_test(&rsp->barrier_cpu_count)) |
7db74df8 | 3406 | complete(&rsp->barrier_completion); |
b1420f1c | 3407 | |
cf3a9c48 PM |
3408 | /* Increment ->n_barrier_done to prevent duplicate work. */ |
3409 | smp_mb(); /* Keep increment after above mechanism. */ | |
a792563b | 3410 | ACCESS_ONCE(rsp->n_barrier_done) = rsp->n_barrier_done + 1; |
cf3a9c48 | 3411 | WARN_ON_ONCE((rsp->n_barrier_done & 0x1) != 0); |
a83eff0a | 3412 | _rcu_barrier_trace(rsp, "Inc2", -1, rsp->n_barrier_done); |
cf3a9c48 PM |
3413 | smp_mb(); /* Keep increment before caller's subsequent code. */ |
3414 | ||
b1420f1c | 3415 | /* Wait for all rcu_barrier_callback() callbacks to be invoked. */ |
7db74df8 | 3416 | wait_for_completion(&rsp->barrier_completion); |
b1420f1c PM |
3417 | |
3418 | /* Other rcu_barrier() invocations can now safely proceed. */ | |
7be7f0be | 3419 | mutex_unlock(&rsp->barrier_mutex); |
d0ec774c | 3420 | } |
d0ec774c PM |
3421 | |
3422 | /** | |
3423 | * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete. | |
3424 | */ | |
3425 | void rcu_barrier_bh(void) | |
3426 | { | |
037b64ed | 3427 | _rcu_barrier(&rcu_bh_state); |
d0ec774c PM |
3428 | } |
3429 | EXPORT_SYMBOL_GPL(rcu_barrier_bh); | |
3430 | ||
3431 | /** | |
3432 | * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks. | |
3433 | */ | |
3434 | void rcu_barrier_sched(void) | |
3435 | { | |
037b64ed | 3436 | _rcu_barrier(&rcu_sched_state); |
d0ec774c PM |
3437 | } |
3438 | EXPORT_SYMBOL_GPL(rcu_barrier_sched); | |
3439 | ||
64db4cff | 3440 | /* |
27569620 | 3441 | * Do boot-time initialization of a CPU's per-CPU RCU data. |
64db4cff | 3442 | */ |
27569620 PM |
3443 | static void __init |
3444 | rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp) | |
64db4cff PM |
3445 | { |
3446 | unsigned long flags; | |
394f99a9 | 3447 | struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu); |
27569620 PM |
3448 | struct rcu_node *rnp = rcu_get_root(rsp); |
3449 | ||
3450 | /* Set up local state, ensuring consistent view of global state. */ | |
1304afb2 | 3451 | raw_spin_lock_irqsave(&rnp->lock, flags); |
27569620 | 3452 | rdp->grpmask = 1UL << (cpu - rdp->mynode->grplo); |
3f5d3ea6 | 3453 | init_callback_list(rdp); |
486e2593 | 3454 | rdp->qlen_lazy = 0; |
1d1fb395 | 3455 | ACCESS_ONCE(rdp->qlen) = 0; |
27569620 | 3456 | rdp->dynticks = &per_cpu(rcu_dynticks, cpu); |
29e37d81 | 3457 | WARN_ON_ONCE(rdp->dynticks->dynticks_nesting != DYNTICK_TASK_EXIT_IDLE); |
9b2e4f18 | 3458 | WARN_ON_ONCE(atomic_read(&rdp->dynticks->dynticks) != 1); |
27569620 | 3459 | rdp->cpu = cpu; |
d4c08f2a | 3460 | rdp->rsp = rsp; |
3fbfbf7a | 3461 | rcu_boot_init_nocb_percpu_data(rdp); |
1304afb2 | 3462 | raw_spin_unlock_irqrestore(&rnp->lock, flags); |
27569620 PM |
3463 | } |
3464 | ||
3465 | /* | |
3466 | * Initialize a CPU's per-CPU RCU data. Note that only one online or | |
3467 | * offline event can be happening at a given time. Note also that we | |
3468 | * can accept some slop in the rsp->completed access due to the fact | |
3469 | * that this CPU cannot possibly have any RCU callbacks in flight yet. | |
64db4cff | 3470 | */ |
49fb4c62 | 3471 | static void |
9b67122a | 3472 | rcu_init_percpu_data(int cpu, struct rcu_state *rsp) |
64db4cff PM |
3473 | { |
3474 | unsigned long flags; | |
64db4cff | 3475 | unsigned long mask; |
394f99a9 | 3476 | struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu); |
64db4cff PM |
3477 | struct rcu_node *rnp = rcu_get_root(rsp); |
3478 | ||
a4fbe35a PM |
3479 | /* Exclude new grace periods. */ |
3480 | mutex_lock(&rsp->onoff_mutex); | |
3481 | ||
64db4cff | 3482 | /* Set up local state, ensuring consistent view of global state. */ |
1304afb2 | 3483 | raw_spin_lock_irqsave(&rnp->lock, flags); |
64db4cff | 3484 | rdp->beenonline = 1; /* We have now been online. */ |
37c72e56 PM |
3485 | rdp->qlen_last_fqs_check = 0; |
3486 | rdp->n_force_qs_snap = rsp->n_force_qs; | |
64db4cff | 3487 | rdp->blimit = blimit; |
0d8ee37e | 3488 | init_callback_list(rdp); /* Re-enable callbacks on this CPU. */ |
29e37d81 | 3489 | rdp->dynticks->dynticks_nesting = DYNTICK_TASK_EXIT_IDLE; |
2333210b | 3490 | rcu_sysidle_init_percpu_data(rdp->dynticks); |
c92b131b PM |
3491 | atomic_set(&rdp->dynticks->dynticks, |
3492 | (atomic_read(&rdp->dynticks->dynticks) & ~0x1) + 1); | |
1304afb2 | 3493 | raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
64db4cff | 3494 | |
64db4cff PM |
3495 | /* Add CPU to rcu_node bitmasks. */ |
3496 | rnp = rdp->mynode; | |
3497 | mask = rdp->grpmask; | |
3498 | do { | |
3499 | /* Exclude any attempts to start a new GP on small systems. */ | |
1304afb2 | 3500 | raw_spin_lock(&rnp->lock); /* irqs already disabled. */ |
64db4cff PM |
3501 | rnp->qsmaskinit |= mask; |
3502 | mask = rnp->grpmask; | |
d09b62df | 3503 | if (rnp == rdp->mynode) { |
06ae115a PM |
3504 | /* |
3505 | * If there is a grace period in progress, we will | |
3506 | * set up to wait for it next time we run the | |
3507 | * RCU core code. | |
3508 | */ | |
3509 | rdp->gpnum = rnp->completed; | |
d09b62df | 3510 | rdp->completed = rnp->completed; |
06ae115a PM |
3511 | rdp->passed_quiesce = 0; |
3512 | rdp->qs_pending = 0; | |
f7f7bac9 | 3513 | trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpuonl")); |
d09b62df | 3514 | } |
1304afb2 | 3515 | raw_spin_unlock(&rnp->lock); /* irqs already disabled. */ |
64db4cff PM |
3516 | rnp = rnp->parent; |
3517 | } while (rnp != NULL && !(rnp->qsmaskinit & mask)); | |
a4fbe35a | 3518 | local_irq_restore(flags); |
64db4cff | 3519 | |
a4fbe35a | 3520 | mutex_unlock(&rsp->onoff_mutex); |
64db4cff PM |
3521 | } |
3522 | ||
49fb4c62 | 3523 | static void rcu_prepare_cpu(int cpu) |
64db4cff | 3524 | { |
6ce75a23 PM |
3525 | struct rcu_state *rsp; |
3526 | ||
3527 | for_each_rcu_flavor(rsp) | |
9b67122a | 3528 | rcu_init_percpu_data(cpu, rsp); |
64db4cff PM |
3529 | } |
3530 | ||
3531 | /* | |
f41d911f | 3532 | * Handle CPU online/offline notification events. |
64db4cff | 3533 | */ |
49fb4c62 | 3534 | static int rcu_cpu_notify(struct notifier_block *self, |
9f680ab4 | 3535 | unsigned long action, void *hcpu) |
64db4cff PM |
3536 | { |
3537 | long cpu = (long)hcpu; | |
e534165b | 3538 | struct rcu_data *rdp = per_cpu_ptr(rcu_state_p->rda, cpu); |
a26ac245 | 3539 | struct rcu_node *rnp = rdp->mynode; |
6ce75a23 | 3540 | struct rcu_state *rsp; |
64db4cff | 3541 | |
f7f7bac9 | 3542 | trace_rcu_utilization(TPS("Start CPU hotplug")); |
64db4cff PM |
3543 | switch (action) { |
3544 | case CPU_UP_PREPARE: | |
3545 | case CPU_UP_PREPARE_FROZEN: | |
d72bce0e PZ |
3546 | rcu_prepare_cpu(cpu); |
3547 | rcu_prepare_kthreads(cpu); | |
35ce7f29 | 3548 | rcu_spawn_all_nocb_kthreads(cpu); |
a26ac245 PM |
3549 | break; |
3550 | case CPU_ONLINE: | |
0f962a5e | 3551 | case CPU_DOWN_FAILED: |
5d01bbd1 | 3552 | rcu_boost_kthread_setaffinity(rnp, -1); |
0f962a5e PM |
3553 | break; |
3554 | case CPU_DOWN_PREPARE: | |
34ed6246 | 3555 | rcu_boost_kthread_setaffinity(rnp, cpu); |
64db4cff | 3556 | break; |
d0ec774c PM |
3557 | case CPU_DYING: |
3558 | case CPU_DYING_FROZEN: | |
6ce75a23 PM |
3559 | for_each_rcu_flavor(rsp) |
3560 | rcu_cleanup_dying_cpu(rsp); | |
d0ec774c | 3561 | break; |
64db4cff PM |
3562 | case CPU_DEAD: |
3563 | case CPU_DEAD_FROZEN: | |
3564 | case CPU_UP_CANCELED: | |
3565 | case CPU_UP_CANCELED_FROZEN: | |
776d6807 | 3566 | for_each_rcu_flavor(rsp) { |
6ce75a23 | 3567 | rcu_cleanup_dead_cpu(cpu, rsp); |
776d6807 PM |
3568 | do_nocb_deferred_wakeup(per_cpu_ptr(rsp->rda, cpu)); |
3569 | } | |
64db4cff PM |
3570 | break; |
3571 | default: | |
3572 | break; | |
3573 | } | |
f7f7bac9 | 3574 | trace_rcu_utilization(TPS("End CPU hotplug")); |
34ed6246 | 3575 | return NOTIFY_OK; |
64db4cff PM |
3576 | } |
3577 | ||
d1d74d14 BP |
3578 | static int rcu_pm_notify(struct notifier_block *self, |
3579 | unsigned long action, void *hcpu) | |
3580 | { | |
3581 | switch (action) { | |
3582 | case PM_HIBERNATION_PREPARE: | |
3583 | case PM_SUSPEND_PREPARE: | |
3584 | if (nr_cpu_ids <= 256) /* Expediting bad for large systems. */ | |
3585 | rcu_expedited = 1; | |
3586 | break; | |
3587 | case PM_POST_HIBERNATION: | |
3588 | case PM_POST_SUSPEND: | |
3589 | rcu_expedited = 0; | |
3590 | break; | |
3591 | default: | |
3592 | break; | |
3593 | } | |
3594 | return NOTIFY_OK; | |
3595 | } | |
3596 | ||
b3dbec76 | 3597 | /* |
9386c0b7 | 3598 | * Spawn the kthreads that handle each RCU flavor's grace periods. |
b3dbec76 PM |
3599 | */ |
3600 | static int __init rcu_spawn_gp_kthread(void) | |
3601 | { | |
3602 | unsigned long flags; | |
3603 | struct rcu_node *rnp; | |
3604 | struct rcu_state *rsp; | |
3605 | struct task_struct *t; | |
3606 | ||
9386c0b7 | 3607 | rcu_scheduler_fully_active = 1; |
b3dbec76 | 3608 | for_each_rcu_flavor(rsp) { |
f170168b | 3609 | t = kthread_run(rcu_gp_kthread, rsp, "%s", rsp->name); |
b3dbec76 PM |
3610 | BUG_ON(IS_ERR(t)); |
3611 | rnp = rcu_get_root(rsp); | |
3612 | raw_spin_lock_irqsave(&rnp->lock, flags); | |
3613 | rsp->gp_kthread = t; | |
3614 | raw_spin_unlock_irqrestore(&rnp->lock, flags); | |
3615 | } | |
35ce7f29 | 3616 | rcu_spawn_nocb_kthreads(); |
9386c0b7 | 3617 | rcu_spawn_boost_kthreads(); |
b3dbec76 PM |
3618 | return 0; |
3619 | } | |
3620 | early_initcall(rcu_spawn_gp_kthread); | |
3621 | ||
bbad9379 PM |
3622 | /* |
3623 | * This function is invoked towards the end of the scheduler's initialization | |
3624 | * process. Before this is called, the idle task might contain | |
3625 | * RCU read-side critical sections (during which time, this idle | |
3626 | * task is booting the system). After this function is called, the | |
3627 | * idle tasks are prohibited from containing RCU read-side critical | |
3628 | * sections. This function also enables RCU lockdep checking. | |
3629 | */ | |
3630 | void rcu_scheduler_starting(void) | |
3631 | { | |
3632 | WARN_ON(num_online_cpus() != 1); | |
3633 | WARN_ON(nr_context_switches() > 0); | |
3634 | rcu_scheduler_active = 1; | |
3635 | } | |
3636 | ||
64db4cff PM |
3637 | /* |
3638 | * Compute the per-level fanout, either using the exact fanout specified | |
3639 | * or balancing the tree, depending on CONFIG_RCU_FANOUT_EXACT. | |
3640 | */ | |
3641 | #ifdef CONFIG_RCU_FANOUT_EXACT | |
3642 | static void __init rcu_init_levelspread(struct rcu_state *rsp) | |
3643 | { | |
3644 | int i; | |
3645 | ||
04f34650 PM |
3646 | rsp->levelspread[rcu_num_lvls - 1] = rcu_fanout_leaf; |
3647 | for (i = rcu_num_lvls - 2; i >= 0; i--) | |
64db4cff PM |
3648 | rsp->levelspread[i] = CONFIG_RCU_FANOUT; |
3649 | } | |
3650 | #else /* #ifdef CONFIG_RCU_FANOUT_EXACT */ | |
3651 | static void __init rcu_init_levelspread(struct rcu_state *rsp) | |
3652 | { | |
3653 | int ccur; | |
3654 | int cprv; | |
3655 | int i; | |
3656 | ||
4dbd6bb3 | 3657 | cprv = nr_cpu_ids; |
f885b7f2 | 3658 | for (i = rcu_num_lvls - 1; i >= 0; i--) { |
64db4cff PM |
3659 | ccur = rsp->levelcnt[i]; |
3660 | rsp->levelspread[i] = (cprv + ccur - 1) / ccur; | |
3661 | cprv = ccur; | |
3662 | } | |
3663 | } | |
3664 | #endif /* #else #ifdef CONFIG_RCU_FANOUT_EXACT */ | |
3665 | ||
3666 | /* | |
3667 | * Helper function for rcu_init() that initializes one rcu_state structure. | |
3668 | */ | |
394f99a9 LJ |
3669 | static void __init rcu_init_one(struct rcu_state *rsp, |
3670 | struct rcu_data __percpu *rda) | |
64db4cff | 3671 | { |
b4426b49 FF |
3672 | static const char * const buf[] = { |
3673 | "rcu_node_0", | |
3674 | "rcu_node_1", | |
3675 | "rcu_node_2", | |
3676 | "rcu_node_3" }; /* Match MAX_RCU_LVLS */ | |
3677 | static const char * const fqs[] = { | |
3678 | "rcu_node_fqs_0", | |
3679 | "rcu_node_fqs_1", | |
3680 | "rcu_node_fqs_2", | |
3681 | "rcu_node_fqs_3" }; /* Match MAX_RCU_LVLS */ | |
4a81e832 | 3682 | static u8 fl_mask = 0x1; |
64db4cff PM |
3683 | int cpustride = 1; |
3684 | int i; | |
3685 | int j; | |
3686 | struct rcu_node *rnp; | |
3687 | ||
b6407e86 PM |
3688 | BUILD_BUG_ON(MAX_RCU_LVLS > ARRAY_SIZE(buf)); /* Fix buf[] init! */ |
3689 | ||
4930521a PM |
3690 | /* Silence gcc 4.8 warning about array index out of range. */ |
3691 | if (rcu_num_lvls > RCU_NUM_LVLS) | |
3692 | panic("rcu_init_one: rcu_num_lvls overflow"); | |
3693 | ||
64db4cff PM |
3694 | /* Initialize the level-tracking arrays. */ |
3695 | ||
f885b7f2 PM |
3696 | for (i = 0; i < rcu_num_lvls; i++) |
3697 | rsp->levelcnt[i] = num_rcu_lvl[i]; | |
3698 | for (i = 1; i < rcu_num_lvls; i++) | |
64db4cff PM |
3699 | rsp->level[i] = rsp->level[i - 1] + rsp->levelcnt[i - 1]; |
3700 | rcu_init_levelspread(rsp); | |
4a81e832 PM |
3701 | rsp->flavor_mask = fl_mask; |
3702 | fl_mask <<= 1; | |
64db4cff PM |
3703 | |
3704 | /* Initialize the elements themselves, starting from the leaves. */ | |
3705 | ||
f885b7f2 | 3706 | for (i = rcu_num_lvls - 1; i >= 0; i--) { |
64db4cff PM |
3707 | cpustride *= rsp->levelspread[i]; |
3708 | rnp = rsp->level[i]; | |
3709 | for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) { | |
1304afb2 | 3710 | raw_spin_lock_init(&rnp->lock); |
b6407e86 PM |
3711 | lockdep_set_class_and_name(&rnp->lock, |
3712 | &rcu_node_class[i], buf[i]); | |
394f2769 PM |
3713 | raw_spin_lock_init(&rnp->fqslock); |
3714 | lockdep_set_class_and_name(&rnp->fqslock, | |
3715 | &rcu_fqs_class[i], fqs[i]); | |
25d30cf4 PM |
3716 | rnp->gpnum = rsp->gpnum; |
3717 | rnp->completed = rsp->completed; | |
64db4cff PM |
3718 | rnp->qsmask = 0; |
3719 | rnp->qsmaskinit = 0; | |
3720 | rnp->grplo = j * cpustride; | |
3721 | rnp->grphi = (j + 1) * cpustride - 1; | |
595f3900 HS |
3722 | if (rnp->grphi >= nr_cpu_ids) |
3723 | rnp->grphi = nr_cpu_ids - 1; | |
64db4cff PM |
3724 | if (i == 0) { |
3725 | rnp->grpnum = 0; | |
3726 | rnp->grpmask = 0; | |
3727 | rnp->parent = NULL; | |
3728 | } else { | |
3729 | rnp->grpnum = j % rsp->levelspread[i - 1]; | |
3730 | rnp->grpmask = 1UL << rnp->grpnum; | |
3731 | rnp->parent = rsp->level[i - 1] + | |
3732 | j / rsp->levelspread[i - 1]; | |
3733 | } | |
3734 | rnp->level = i; | |
12f5f524 | 3735 | INIT_LIST_HEAD(&rnp->blkd_tasks); |
dae6e64d | 3736 | rcu_init_one_nocb(rnp); |
64db4cff PM |
3737 | } |
3738 | } | |
0c34029a | 3739 | |
394f99a9 | 3740 | rsp->rda = rda; |
b3dbec76 | 3741 | init_waitqueue_head(&rsp->gp_wq); |
f885b7f2 | 3742 | rnp = rsp->level[rcu_num_lvls - 1]; |
0c34029a | 3743 | for_each_possible_cpu(i) { |
4a90a068 | 3744 | while (i > rnp->grphi) |
0c34029a | 3745 | rnp++; |
394f99a9 | 3746 | per_cpu_ptr(rsp->rda, i)->mynode = rnp; |
0c34029a LJ |
3747 | rcu_boot_init_percpu_data(i, rsp); |
3748 | } | |
6ce75a23 | 3749 | list_add(&rsp->flavors, &rcu_struct_flavors); |
64db4cff PM |
3750 | } |
3751 | ||
f885b7f2 PM |
3752 | /* |
3753 | * Compute the rcu_node tree geometry from kernel parameters. This cannot | |
4102adab | 3754 | * replace the definitions in tree.h because those are needed to size |
f885b7f2 PM |
3755 | * the ->node array in the rcu_state structure. |
3756 | */ | |
3757 | static void __init rcu_init_geometry(void) | |
3758 | { | |
026ad283 | 3759 | ulong d; |
f885b7f2 PM |
3760 | int i; |
3761 | int j; | |
cca6f393 | 3762 | int n = nr_cpu_ids; |
f885b7f2 PM |
3763 | int rcu_capacity[MAX_RCU_LVLS + 1]; |
3764 | ||
026ad283 PM |
3765 | /* |
3766 | * Initialize any unspecified boot parameters. | |
3767 | * The default values of jiffies_till_first_fqs and | |
3768 | * jiffies_till_next_fqs are set to the RCU_JIFFIES_TILL_FORCE_QS | |
3769 | * value, which is a function of HZ, then adding one for each | |
3770 | * RCU_JIFFIES_FQS_DIV CPUs that might be on the system. | |
3771 | */ | |
3772 | d = RCU_JIFFIES_TILL_FORCE_QS + nr_cpu_ids / RCU_JIFFIES_FQS_DIV; | |
3773 | if (jiffies_till_first_fqs == ULONG_MAX) | |
3774 | jiffies_till_first_fqs = d; | |
3775 | if (jiffies_till_next_fqs == ULONG_MAX) | |
3776 | jiffies_till_next_fqs = d; | |
3777 | ||
f885b7f2 | 3778 | /* If the compile-time values are accurate, just leave. */ |
b17c7035 PM |
3779 | if (rcu_fanout_leaf == CONFIG_RCU_FANOUT_LEAF && |
3780 | nr_cpu_ids == NR_CPUS) | |
f885b7f2 | 3781 | return; |
39479098 PM |
3782 | pr_info("RCU: Adjusting geometry for rcu_fanout_leaf=%d, nr_cpu_ids=%d\n", |
3783 | rcu_fanout_leaf, nr_cpu_ids); | |
f885b7f2 PM |
3784 | |
3785 | /* | |
3786 | * Compute number of nodes that can be handled an rcu_node tree | |
3787 | * with the given number of levels. Setting rcu_capacity[0] makes | |
3788 | * some of the arithmetic easier. | |
3789 | */ | |
3790 | rcu_capacity[0] = 1; | |
3791 | rcu_capacity[1] = rcu_fanout_leaf; | |
3792 | for (i = 2; i <= MAX_RCU_LVLS; i++) | |
3793 | rcu_capacity[i] = rcu_capacity[i - 1] * CONFIG_RCU_FANOUT; | |
3794 | ||
3795 | /* | |
3796 | * The boot-time rcu_fanout_leaf parameter is only permitted | |
3797 | * to increase the leaf-level fanout, not decrease it. Of course, | |
3798 | * the leaf-level fanout cannot exceed the number of bits in | |
3799 | * the rcu_node masks. Finally, the tree must be able to accommodate | |
3800 | * the configured number of CPUs. Complain and fall back to the | |
3801 | * compile-time values if these limits are exceeded. | |
3802 | */ | |
3803 | if (rcu_fanout_leaf < CONFIG_RCU_FANOUT_LEAF || | |
3804 | rcu_fanout_leaf > sizeof(unsigned long) * 8 || | |
3805 | n > rcu_capacity[MAX_RCU_LVLS]) { | |
3806 | WARN_ON(1); | |
3807 | return; | |
3808 | } | |
3809 | ||
3810 | /* Calculate the number of rcu_nodes at each level of the tree. */ | |
3811 | for (i = 1; i <= MAX_RCU_LVLS; i++) | |
3812 | if (n <= rcu_capacity[i]) { | |
3813 | for (j = 0; j <= i; j++) | |
3814 | num_rcu_lvl[j] = | |
3815 | DIV_ROUND_UP(n, rcu_capacity[i - j]); | |
3816 | rcu_num_lvls = i; | |
3817 | for (j = i + 1; j <= MAX_RCU_LVLS; j++) | |
3818 | num_rcu_lvl[j] = 0; | |
3819 | break; | |
3820 | } | |
3821 | ||
3822 | /* Calculate the total number of rcu_node structures. */ | |
3823 | rcu_num_nodes = 0; | |
3824 | for (i = 0; i <= MAX_RCU_LVLS; i++) | |
3825 | rcu_num_nodes += num_rcu_lvl[i]; | |
3826 | rcu_num_nodes -= n; | |
3827 | } | |
3828 | ||
9f680ab4 | 3829 | void __init rcu_init(void) |
64db4cff | 3830 | { |
017c4261 | 3831 | int cpu; |
9f680ab4 | 3832 | |
f41d911f | 3833 | rcu_bootup_announce(); |
f885b7f2 | 3834 | rcu_init_geometry(); |
394f99a9 | 3835 | rcu_init_one(&rcu_bh_state, &rcu_bh_data); |
69c8d28c | 3836 | rcu_init_one(&rcu_sched_state, &rcu_sched_data); |
f41d911f | 3837 | __rcu_init_preempt(); |
b5b39360 | 3838 | open_softirq(RCU_SOFTIRQ, rcu_process_callbacks); |
9f680ab4 PM |
3839 | |
3840 | /* | |
3841 | * We don't need protection against CPU-hotplug here because | |
3842 | * this is called early in boot, before either interrupts | |
3843 | * or the scheduler are operational. | |
3844 | */ | |
3845 | cpu_notifier(rcu_cpu_notify, 0); | |
d1d74d14 | 3846 | pm_notifier(rcu_pm_notify, 0); |
017c4261 PM |
3847 | for_each_online_cpu(cpu) |
3848 | rcu_cpu_notify(NULL, CPU_UP_PREPARE, (void *)(long)cpu); | |
aa23c6fb PK |
3849 | |
3850 | rcu_early_boot_tests(); | |
64db4cff PM |
3851 | } |
3852 | ||
4102adab | 3853 | #include "tree_plugin.h" |