2 * Read-Copy Update mechanism for mutual exclusion
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.
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.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, you can access it online at
16 * http://www.gnu.org/licenses/gpl-2.0.html.
18 * Copyright IBM Corporation, 2008
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
24 * Based on the original work by Paul McKenney <paulmck@us.ibm.com>
25 * and inputs from Rusty Russell, Andrea Arcangeli and Andi Kleen.
27 * For detailed explanation of Read-Copy Update mechanism see -
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_wait.h>
36 #include <linux/interrupt.h>
37 #include <linux/sched.h>
38 #include <linux/sched/debug.h>
39 #include <linux/nmi.h>
40 #include <linux/atomic.h>
41 #include <linux/bitops.h>
42 #include <linux/export.h>
43 #include <linux/completion.h>
44 #include <linux/moduleparam.h>
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>
50 #include <linux/kernel_stat.h>
51 #include <linux/wait.h>
52 #include <linux/kthread.h>
53 #include <uapi/linux/sched/types.h>
54 #include <linux/prefetch.h>
55 #include <linux/delay.h>
56 #include <linux/stop_machine.h>
57 #include <linux/random.h>
58 #include <linux/trace_events.h>
59 #include <linux/suspend.h>
60 #include <linux/ftrace.h>
65 #ifdef MODULE_PARAM_PREFIX
66 #undef MODULE_PARAM_PREFIX
68 #define MODULE_PARAM_PREFIX "rcutree."
70 /* Data structures. */
73 * In order to export the rcu_state name to the tracing tools, it
74 * needs to be added in the __tracepoint_string section.
75 * This requires defining a separate variable tp_<sname>_varname
76 * that points to the string being used, and this will allow
77 * the tracing userspace tools to be able to decipher the string
78 * address to the matching string.
81 # define DEFINE_RCU_TPS(sname) \
82 static char sname##_varname[] = #sname; \
83 static const char *tp_##sname##_varname __used __tracepoint_string = sname##_varname;
84 # define RCU_STATE_NAME(sname) sname##_varname
86 # define DEFINE_RCU_TPS(sname)
87 # define RCU_STATE_NAME(sname) __stringify(sname)
90 #define RCU_STATE_INITIALIZER(sname, sabbr, cr) \
91 DEFINE_RCU_TPS(sname) \
92 static DEFINE_PER_CPU_SHARED_ALIGNED(struct rcu_data, sname##_data); \
93 struct rcu_state sname##_state = { \
94 .level = { &sname##_state.node[0] }, \
95 .rda = &sname##_data, \
97 .gp_state = RCU_GP_IDLE, \
98 .gpnum = 0UL - 300UL, \
99 .completed = 0UL - 300UL, \
100 .gp_seq = (0UL - 300UL) << RCU_SEQ_CTR_SHIFT, \
101 .barrier_mutex = __MUTEX_INITIALIZER(sname##_state.barrier_mutex), \
102 .name = RCU_STATE_NAME(sname), \
104 .exp_mutex = __MUTEX_INITIALIZER(sname##_state.exp_mutex), \
105 .exp_wake_mutex = __MUTEX_INITIALIZER(sname##_state.exp_wake_mutex), \
108 RCU_STATE_INITIALIZER(rcu_sched, 's', call_rcu_sched);
109 RCU_STATE_INITIALIZER(rcu_bh, 'b', call_rcu_bh);
111 static struct rcu_state *const rcu_state_p;
112 LIST_HEAD(rcu_struct_flavors);
114 /* Dump rcu_node combining tree at boot to verify correct setup. */
115 static bool dump_tree;
116 module_param(dump_tree, bool, 0444);
117 /* Control rcu_node-tree auto-balancing at boot time. */
118 static bool rcu_fanout_exact;
119 module_param(rcu_fanout_exact, bool, 0444);
120 /* Increase (but not decrease) the RCU_FANOUT_LEAF at boot time. */
121 static int rcu_fanout_leaf = RCU_FANOUT_LEAF;
122 module_param(rcu_fanout_leaf, int, 0444);
123 int rcu_num_lvls __read_mostly = RCU_NUM_LVLS;
124 /* Number of rcu_nodes at specified level. */
125 int num_rcu_lvl[] = NUM_RCU_LVL_INIT;
126 int rcu_num_nodes __read_mostly = NUM_RCU_NODES; /* Total # rcu_nodes in use. */
127 /* panic() on RCU Stall sysctl. */
128 int sysctl_panic_on_rcu_stall __read_mostly;
131 * The rcu_scheduler_active variable is initialized to the value
132 * RCU_SCHEDULER_INACTIVE and transitions RCU_SCHEDULER_INIT just before the
133 * first task is spawned. So when this variable is RCU_SCHEDULER_INACTIVE,
134 * RCU can assume that there is but one task, allowing RCU to (for example)
135 * optimize synchronize_rcu() to a simple barrier(). When this variable
136 * is RCU_SCHEDULER_INIT, RCU must actually do all the hard work required
137 * to detect real grace periods. This variable is also used to suppress
138 * boot-time false positives from lockdep-RCU error checking. Finally, it
139 * transitions from RCU_SCHEDULER_INIT to RCU_SCHEDULER_RUNNING after RCU
140 * is fully initialized, including all of its kthreads having been spawned.
142 int rcu_scheduler_active __read_mostly;
143 EXPORT_SYMBOL_GPL(rcu_scheduler_active);
146 * The rcu_scheduler_fully_active variable transitions from zero to one
147 * during the early_initcall() processing, which is after the scheduler
148 * is capable of creating new tasks. So RCU processing (for example,
149 * creating tasks for RCU priority boosting) must be delayed until after
150 * rcu_scheduler_fully_active transitions from zero to one. We also
151 * currently delay invocation of any RCU callbacks until after this point.
153 * It might later prove better for people registering RCU callbacks during
154 * early boot to take responsibility for these callbacks, but one step at
157 static int rcu_scheduler_fully_active __read_mostly;
159 static void rcu_init_new_rnp(struct rcu_node *rnp_leaf);
160 static void rcu_cleanup_dead_rnp(struct rcu_node *rnp_leaf);
161 static void rcu_boost_kthread_setaffinity(struct rcu_node *rnp, int outgoingcpu);
162 static void invoke_rcu_core(void);
163 static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp);
164 static void rcu_report_exp_rdp(struct rcu_state *rsp,
165 struct rcu_data *rdp, bool wake);
166 static void sync_sched_exp_online_cleanup(int cpu);
168 /* rcuc/rcub kthread realtime priority */
169 static int kthread_prio = IS_ENABLED(CONFIG_RCU_BOOST) ? 1 : 0;
170 module_param(kthread_prio, int, 0644);
172 /* Delay in jiffies for grace-period initialization delays, debug only. */
174 static int gp_preinit_delay;
175 module_param(gp_preinit_delay, int, 0444);
176 static int gp_init_delay;
177 module_param(gp_init_delay, int, 0444);
178 static int gp_cleanup_delay;
179 module_param(gp_cleanup_delay, int, 0444);
182 * Number of grace periods between delays, normalized by the duration of
183 * the delay. The longer the delay, the more the grace periods between
184 * each delay. The reason for this normalization is that it means that,
185 * for non-zero delays, the overall slowdown of grace periods is constant
186 * regardless of the duration of the delay. This arrangement balances
187 * the need for long delays to increase some race probabilities with the
188 * need for fast grace periods to increase other race probabilities.
190 #define PER_RCU_NODE_PERIOD 3 /* Number of grace periods between delays. */
193 * Track the rcutorture test sequence number and the update version
194 * number within a given test. The rcutorture_testseq is incremented
195 * on every rcutorture module load and unload, so has an odd value
196 * when a test is running. The rcutorture_vernum is set to zero
197 * when rcutorture starts and is incremented on each rcutorture update.
198 * These variables enable correlating rcutorture output with the
199 * RCU tracing information.
201 unsigned long rcutorture_testseq;
202 unsigned long rcutorture_vernum;
205 * Compute the mask of online CPUs for the specified rcu_node structure.
206 * This will not be stable unless the rcu_node structure's ->lock is
207 * held, but the bit corresponding to the current CPU will be stable
210 unsigned long rcu_rnp_online_cpus(struct rcu_node *rnp)
212 return READ_ONCE(rnp->qsmaskinitnext);
216 * Return true if an RCU grace period is in progress. The READ_ONCE()s
217 * permit this function to be invoked without holding the root rcu_node
218 * structure's ->lock, but of course results can be subject to change.
220 static int rcu_gp_in_progress(struct rcu_state *rsp)
222 return rcu_seq_state(rcu_seq_current(&rsp->gp_seq));
226 * Note a quiescent state. Because we do not need to know
227 * how many quiescent states passed, just if there was at least
228 * one since the start of the grace period, this just sets a flag.
229 * The caller must have disabled preemption.
231 void rcu_sched_qs(void)
233 RCU_LOCKDEP_WARN(preemptible(), "rcu_sched_qs() invoked with preemption enabled!!!");
234 if (!__this_cpu_read(rcu_sched_data.cpu_no_qs.s))
236 trace_rcu_grace_period(TPS("rcu_sched"),
237 __this_cpu_read(rcu_sched_data.gpnum),
239 __this_cpu_write(rcu_sched_data.cpu_no_qs.b.norm, false);
240 if (!__this_cpu_read(rcu_sched_data.cpu_no_qs.b.exp))
242 __this_cpu_write(rcu_sched_data.cpu_no_qs.b.exp, false);
243 rcu_report_exp_rdp(&rcu_sched_state,
244 this_cpu_ptr(&rcu_sched_data), true);
249 RCU_LOCKDEP_WARN(preemptible(), "rcu_bh_qs() invoked with preemption enabled!!!");
250 if (__this_cpu_read(rcu_bh_data.cpu_no_qs.s)) {
251 trace_rcu_grace_period(TPS("rcu_bh"),
252 __this_cpu_read(rcu_bh_data.gpnum),
254 __this_cpu_write(rcu_bh_data.cpu_no_qs.b.norm, false);
259 * Steal a bit from the bottom of ->dynticks for idle entry/exit
260 * control. Initially this is for TLB flushing.
262 #define RCU_DYNTICK_CTRL_MASK 0x1
263 #define RCU_DYNTICK_CTRL_CTR (RCU_DYNTICK_CTRL_MASK + 1)
264 #ifndef rcu_eqs_special_exit
265 #define rcu_eqs_special_exit() do { } while (0)
268 static DEFINE_PER_CPU(struct rcu_dynticks, rcu_dynticks) = {
269 .dynticks_nesting = 1,
270 .dynticks_nmi_nesting = DYNTICK_IRQ_NONIDLE,
271 .dynticks = ATOMIC_INIT(RCU_DYNTICK_CTRL_CTR),
275 * Record entry into an extended quiescent state. This is only to be
276 * called when not already in an extended quiescent state.
278 static void rcu_dynticks_eqs_enter(void)
280 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
284 * CPUs seeing atomic_add_return() must see prior RCU read-side
285 * critical sections, and we also must force ordering with the
288 seq = atomic_add_return(RCU_DYNTICK_CTRL_CTR, &rdtp->dynticks);
289 /* Better be in an extended quiescent state! */
290 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
291 (seq & RCU_DYNTICK_CTRL_CTR));
292 /* Better not have special action (TLB flush) pending! */
293 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
294 (seq & RCU_DYNTICK_CTRL_MASK));
298 * Record exit from an extended quiescent state. This is only to be
299 * called from an extended quiescent state.
301 static void rcu_dynticks_eqs_exit(void)
303 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
307 * CPUs seeing atomic_add_return() must see prior idle sojourns,
308 * and we also must force ordering with the next RCU read-side
311 seq = atomic_add_return(RCU_DYNTICK_CTRL_CTR, &rdtp->dynticks);
312 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
313 !(seq & RCU_DYNTICK_CTRL_CTR));
314 if (seq & RCU_DYNTICK_CTRL_MASK) {
315 atomic_andnot(RCU_DYNTICK_CTRL_MASK, &rdtp->dynticks);
316 smp_mb__after_atomic(); /* _exit after clearing mask. */
317 /* Prefer duplicate flushes to losing a flush. */
318 rcu_eqs_special_exit();
323 * Reset the current CPU's ->dynticks counter to indicate that the
324 * newly onlined CPU is no longer in an extended quiescent state.
325 * This will either leave the counter unchanged, or increment it
326 * to the next non-quiescent value.
328 * The non-atomic test/increment sequence works because the upper bits
329 * of the ->dynticks counter are manipulated only by the corresponding CPU,
330 * or when the corresponding CPU is offline.
332 static void rcu_dynticks_eqs_online(void)
334 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
336 if (atomic_read(&rdtp->dynticks) & RCU_DYNTICK_CTRL_CTR)
338 atomic_add(RCU_DYNTICK_CTRL_CTR, &rdtp->dynticks);
342 * Is the current CPU in an extended quiescent state?
344 * No ordering, as we are sampling CPU-local information.
346 bool rcu_dynticks_curr_cpu_in_eqs(void)
348 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
350 return !(atomic_read(&rdtp->dynticks) & RCU_DYNTICK_CTRL_CTR);
354 * Snapshot the ->dynticks counter with full ordering so as to allow
355 * stable comparison of this counter with past and future snapshots.
357 int rcu_dynticks_snap(struct rcu_dynticks *rdtp)
359 int snap = atomic_add_return(0, &rdtp->dynticks);
361 return snap & ~RCU_DYNTICK_CTRL_MASK;
365 * Return true if the snapshot returned from rcu_dynticks_snap()
366 * indicates that RCU is in an extended quiescent state.
368 static bool rcu_dynticks_in_eqs(int snap)
370 return !(snap & RCU_DYNTICK_CTRL_CTR);
374 * Return true if the CPU corresponding to the specified rcu_dynticks
375 * structure has spent some time in an extended quiescent state since
376 * rcu_dynticks_snap() returned the specified snapshot.
378 static bool rcu_dynticks_in_eqs_since(struct rcu_dynticks *rdtp, int snap)
380 return snap != rcu_dynticks_snap(rdtp);
384 * Do a double-increment of the ->dynticks counter to emulate a
385 * momentary idle-CPU quiescent state.
387 static void rcu_dynticks_momentary_idle(void)
389 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
390 int special = atomic_add_return(2 * RCU_DYNTICK_CTRL_CTR,
393 /* It is illegal to call this from idle state. */
394 WARN_ON_ONCE(!(special & RCU_DYNTICK_CTRL_CTR));
398 * Set the special (bottom) bit of the specified CPU so that it
399 * will take special action (such as flushing its TLB) on the
400 * next exit from an extended quiescent state. Returns true if
401 * the bit was successfully set, or false if the CPU was not in
402 * an extended quiescent state.
404 bool rcu_eqs_special_set(int cpu)
408 struct rcu_dynticks *rdtp = &per_cpu(rcu_dynticks, cpu);
411 old = atomic_read(&rdtp->dynticks);
412 if (old & RCU_DYNTICK_CTRL_CTR)
414 new = old | RCU_DYNTICK_CTRL_MASK;
415 } while (atomic_cmpxchg(&rdtp->dynticks, old, new) != old);
420 * Let the RCU core know that this CPU has gone through the scheduler,
421 * which is a quiescent state. This is called when the need for a
422 * quiescent state is urgent, so we burn an atomic operation and full
423 * memory barriers to let the RCU core know about it, regardless of what
424 * this CPU might (or might not) do in the near future.
426 * We inform the RCU core by emulating a zero-duration dyntick-idle period.
428 * The caller must have disabled interrupts.
430 static void rcu_momentary_dyntick_idle(void)
432 raw_cpu_write(rcu_dynticks.rcu_need_heavy_qs, false);
433 rcu_dynticks_momentary_idle();
437 * Note a context switch. This is a quiescent state for RCU-sched,
438 * and requires special handling for preemptible RCU.
439 * The caller must have disabled interrupts.
441 void rcu_note_context_switch(bool preempt)
443 barrier(); /* Avoid RCU read-side critical sections leaking down. */
444 trace_rcu_utilization(TPS("Start context switch"));
446 rcu_preempt_note_context_switch(preempt);
447 /* Load rcu_urgent_qs before other flags. */
448 if (!smp_load_acquire(this_cpu_ptr(&rcu_dynticks.rcu_urgent_qs)))
450 this_cpu_write(rcu_dynticks.rcu_urgent_qs, false);
451 if (unlikely(raw_cpu_read(rcu_dynticks.rcu_need_heavy_qs)))
452 rcu_momentary_dyntick_idle();
453 this_cpu_inc(rcu_dynticks.rcu_qs_ctr);
455 rcu_note_voluntary_context_switch_lite(current);
457 trace_rcu_utilization(TPS("End context switch"));
458 barrier(); /* Avoid RCU read-side critical sections leaking up. */
460 EXPORT_SYMBOL_GPL(rcu_note_context_switch);
463 * Register a quiescent state for all RCU flavors. If there is an
464 * emergency, invoke rcu_momentary_dyntick_idle() to do a heavy-weight
465 * dyntick-idle quiescent state visible to other CPUs (but only for those
466 * RCU flavors in desperate need of a quiescent state, which will normally
467 * be none of them). Either way, do a lightweight quiescent state for
470 * The barrier() calls are redundant in the common case when this is
471 * called externally, but just in case this is called from within this
475 void rcu_all_qs(void)
479 if (!raw_cpu_read(rcu_dynticks.rcu_urgent_qs))
482 /* Load rcu_urgent_qs before other flags. */
483 if (!smp_load_acquire(this_cpu_ptr(&rcu_dynticks.rcu_urgent_qs))) {
487 this_cpu_write(rcu_dynticks.rcu_urgent_qs, false);
488 barrier(); /* Avoid RCU read-side critical sections leaking down. */
489 if (unlikely(raw_cpu_read(rcu_dynticks.rcu_need_heavy_qs))) {
490 local_irq_save(flags);
491 rcu_momentary_dyntick_idle();
492 local_irq_restore(flags);
494 if (unlikely(raw_cpu_read(rcu_sched_data.cpu_no_qs.b.exp)))
496 this_cpu_inc(rcu_dynticks.rcu_qs_ctr);
497 barrier(); /* Avoid RCU read-side critical sections leaking up. */
500 EXPORT_SYMBOL_GPL(rcu_all_qs);
502 #define DEFAULT_RCU_BLIMIT 10 /* Maximum callbacks per rcu_do_batch. */
503 static long blimit = DEFAULT_RCU_BLIMIT;
504 #define DEFAULT_RCU_QHIMARK 10000 /* If this many pending, ignore blimit. */
505 static long qhimark = DEFAULT_RCU_QHIMARK;
506 #define DEFAULT_RCU_QLOMARK 100 /* Once only this many pending, use blimit. */
507 static long qlowmark = DEFAULT_RCU_QLOMARK;
509 module_param(blimit, long, 0444);
510 module_param(qhimark, long, 0444);
511 module_param(qlowmark, long, 0444);
513 static ulong jiffies_till_first_fqs = ULONG_MAX;
514 static ulong jiffies_till_next_fqs = ULONG_MAX;
515 static bool rcu_kick_kthreads;
517 module_param(jiffies_till_first_fqs, ulong, 0644);
518 module_param(jiffies_till_next_fqs, ulong, 0644);
519 module_param(rcu_kick_kthreads, bool, 0644);
522 * How long the grace period must be before we start recruiting
523 * quiescent-state help from rcu_note_context_switch().
525 static ulong jiffies_till_sched_qs = HZ / 10;
526 module_param(jiffies_till_sched_qs, ulong, 0444);
528 static void force_qs_rnp(struct rcu_state *rsp, int (*f)(struct rcu_data *rsp));
529 static void force_quiescent_state(struct rcu_state *rsp);
530 static int rcu_pending(void);
533 * Return the number of RCU GPs completed thus far for debug & stats.
535 unsigned long rcu_get_gp_seq(void)
537 return rcu_seq_ctr(READ_ONCE(rcu_state_p->gp_seq));
539 EXPORT_SYMBOL_GPL(rcu_get_gp_seq);
542 * Return the number of RCU-sched GPs completed thus far for debug & stats.
544 unsigned long rcu_sched_get_gp_seq(void)
546 return rcu_seq_ctr(READ_ONCE(rcu_sched_state.gp_seq));
548 EXPORT_SYMBOL_GPL(rcu_sched_get_gp_seq);
551 * Return the number of RCU-bh GPs completed thus far for debug & stats.
553 unsigned long rcu_bh_get_gp_seq(void)
555 return rcu_seq_ctr(READ_ONCE(rcu_bh_state.gp_seq));
557 EXPORT_SYMBOL_GPL(rcu_bh_get_gp_seq);
560 * Return the number of RCU expedited batches completed thus far for
561 * debug & stats. Odd numbers mean that a batch is in progress, even
562 * numbers mean idle. The value returned will thus be roughly double
563 * the cumulative batches since boot.
565 unsigned long rcu_exp_batches_completed(void)
567 return rcu_state_p->expedited_sequence;
569 EXPORT_SYMBOL_GPL(rcu_exp_batches_completed);
572 * Return the number of RCU-sched expedited batches completed thus far
573 * for debug & stats. Similar to rcu_exp_batches_completed().
575 unsigned long rcu_exp_batches_completed_sched(void)
577 return rcu_sched_state.expedited_sequence;
579 EXPORT_SYMBOL_GPL(rcu_exp_batches_completed_sched);
582 * Force a quiescent state.
584 void rcu_force_quiescent_state(void)
586 force_quiescent_state(rcu_state_p);
588 EXPORT_SYMBOL_GPL(rcu_force_quiescent_state);
591 * Force a quiescent state for RCU BH.
593 void rcu_bh_force_quiescent_state(void)
595 force_quiescent_state(&rcu_bh_state);
597 EXPORT_SYMBOL_GPL(rcu_bh_force_quiescent_state);
600 * Force a quiescent state for RCU-sched.
602 void rcu_sched_force_quiescent_state(void)
604 force_quiescent_state(&rcu_sched_state);
606 EXPORT_SYMBOL_GPL(rcu_sched_force_quiescent_state);
609 * Show the state of the grace-period kthreads.
611 void show_rcu_gp_kthreads(void)
613 struct rcu_state *rsp;
615 for_each_rcu_flavor(rsp) {
616 pr_info("%s: wait state: %d ->state: %#lx\n",
617 rsp->name, rsp->gp_state, rsp->gp_kthread->state);
618 /* sched_show_task(rsp->gp_kthread); */
621 EXPORT_SYMBOL_GPL(show_rcu_gp_kthreads);
624 * Record the number of times rcutorture tests have been initiated and
625 * terminated. This information allows the debugfs tracing stats to be
626 * correlated to the rcutorture messages, even when the rcutorture module
627 * is being repeatedly loaded and unloaded. In other words, we cannot
628 * store this state in rcutorture itself.
630 void rcutorture_record_test_transition(void)
632 rcutorture_testseq++;
633 rcutorture_vernum = 0;
635 EXPORT_SYMBOL_GPL(rcutorture_record_test_transition);
638 * Send along grace-period-related data for rcutorture diagnostics.
640 void rcutorture_get_gp_data(enum rcutorture_type test_type, int *flags,
641 unsigned long *gpnum, unsigned long *completed)
643 struct rcu_state *rsp = NULL;
652 case RCU_SCHED_FLAVOR:
653 rsp = &rcu_sched_state;
660 *flags = READ_ONCE(rsp->gp_flags);
661 *gpnum = READ_ONCE(rsp->gpnum);
662 *completed = READ_ONCE(rsp->completed);
664 EXPORT_SYMBOL_GPL(rcutorture_get_gp_data);
667 * Record the number of writer passes through the current rcutorture test.
668 * This is also used to correlate debugfs tracing stats with the rcutorture
671 void rcutorture_record_progress(unsigned long vernum)
675 EXPORT_SYMBOL_GPL(rcutorture_record_progress);
678 * Return the root node of the specified rcu_state structure.
680 static struct rcu_node *rcu_get_root(struct rcu_state *rsp)
682 return &rsp->node[0];
686 * Enter an RCU extended quiescent state, which can be either the
687 * idle loop or adaptive-tickless usermode execution.
689 * We crowbar the ->dynticks_nmi_nesting field to zero to allow for
690 * the possibility of usermode upcalls having messed up our count
691 * of interrupt nesting level during the prior busy period.
693 static void rcu_eqs_enter(bool user)
695 struct rcu_state *rsp;
696 struct rcu_data *rdp;
697 struct rcu_dynticks *rdtp;
699 rdtp = this_cpu_ptr(&rcu_dynticks);
700 WRITE_ONCE(rdtp->dynticks_nmi_nesting, 0);
701 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
702 rdtp->dynticks_nesting == 0);
703 if (rdtp->dynticks_nesting != 1) {
704 rdtp->dynticks_nesting--;
708 lockdep_assert_irqs_disabled();
709 trace_rcu_dyntick(TPS("Start"), rdtp->dynticks_nesting, 0, rdtp->dynticks);
710 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) && !user && !is_idle_task(current));
711 for_each_rcu_flavor(rsp) {
712 rdp = this_cpu_ptr(rsp->rda);
713 do_nocb_deferred_wakeup(rdp);
715 rcu_prepare_for_idle();
716 WRITE_ONCE(rdtp->dynticks_nesting, 0); /* Avoid irq-access tearing. */
717 rcu_dynticks_eqs_enter();
718 rcu_dynticks_task_enter();
722 * rcu_idle_enter - inform RCU that current CPU is entering idle
724 * Enter idle mode, in other words, -leave- the mode in which RCU
725 * read-side critical sections can occur. (Though RCU read-side
726 * critical sections can occur in irq handlers in idle, a possibility
727 * handled by irq_enter() and irq_exit().)
729 * If you add or remove a call to rcu_idle_enter(), be sure to test with
730 * CONFIG_RCU_EQS_DEBUG=y.
732 void rcu_idle_enter(void)
734 lockdep_assert_irqs_disabled();
735 rcu_eqs_enter(false);
738 #ifdef CONFIG_NO_HZ_FULL
740 * rcu_user_enter - inform RCU that we are resuming userspace.
742 * Enter RCU idle mode right before resuming userspace. No use of RCU
743 * is permitted between this call and rcu_user_exit(). This way the
744 * CPU doesn't need to maintain the tick for RCU maintenance purposes
745 * when the CPU runs in userspace.
747 * If you add or remove a call to rcu_user_enter(), be sure to test with
748 * CONFIG_RCU_EQS_DEBUG=y.
750 void rcu_user_enter(void)
752 lockdep_assert_irqs_disabled();
755 #endif /* CONFIG_NO_HZ_FULL */
758 * rcu_nmi_exit - inform RCU of exit from NMI context
760 * If we are returning from the outermost NMI handler that interrupted an
761 * RCU-idle period, update rdtp->dynticks and rdtp->dynticks_nmi_nesting
762 * to let the RCU grace-period handling know that the CPU is back to
765 * If you add or remove a call to rcu_nmi_exit(), be sure to test
766 * with CONFIG_RCU_EQS_DEBUG=y.
768 void rcu_nmi_exit(void)
770 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
773 * Check for ->dynticks_nmi_nesting underflow and bad ->dynticks.
774 * (We are exiting an NMI handler, so RCU better be paying attention
777 WARN_ON_ONCE(rdtp->dynticks_nmi_nesting <= 0);
778 WARN_ON_ONCE(rcu_dynticks_curr_cpu_in_eqs());
781 * If the nesting level is not 1, the CPU wasn't RCU-idle, so
782 * leave it in non-RCU-idle state.
784 if (rdtp->dynticks_nmi_nesting != 1) {
785 trace_rcu_dyntick(TPS("--="), rdtp->dynticks_nmi_nesting, rdtp->dynticks_nmi_nesting - 2, rdtp->dynticks);
786 WRITE_ONCE(rdtp->dynticks_nmi_nesting, /* No store tearing. */
787 rdtp->dynticks_nmi_nesting - 2);
791 /* This NMI interrupted an RCU-idle CPU, restore RCU-idleness. */
792 trace_rcu_dyntick(TPS("Startirq"), rdtp->dynticks_nmi_nesting, 0, rdtp->dynticks);
793 WRITE_ONCE(rdtp->dynticks_nmi_nesting, 0); /* Avoid store tearing. */
794 rcu_dynticks_eqs_enter();
798 * rcu_irq_exit - inform RCU that current CPU is exiting irq towards idle
800 * Exit from an interrupt handler, which might possibly result in entering
801 * idle mode, in other words, leaving the mode in which read-side critical
802 * sections can occur. The caller must have disabled interrupts.
804 * This code assumes that the idle loop never does anything that might
805 * result in unbalanced calls to irq_enter() and irq_exit(). If your
806 * architecture's idle loop violates this assumption, RCU will give you what
807 * you deserve, good and hard. But very infrequently and irreproducibly.
809 * Use things like work queues to work around this limitation.
811 * You have been warned.
813 * If you add or remove a call to rcu_irq_exit(), be sure to test with
814 * CONFIG_RCU_EQS_DEBUG=y.
816 void rcu_irq_exit(void)
818 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
820 lockdep_assert_irqs_disabled();
821 if (rdtp->dynticks_nmi_nesting == 1)
822 rcu_prepare_for_idle();
824 if (rdtp->dynticks_nmi_nesting == 0)
825 rcu_dynticks_task_enter();
829 * Wrapper for rcu_irq_exit() where interrupts are enabled.
831 * If you add or remove a call to rcu_irq_exit_irqson(), be sure to test
832 * with CONFIG_RCU_EQS_DEBUG=y.
834 void rcu_irq_exit_irqson(void)
838 local_irq_save(flags);
840 local_irq_restore(flags);
844 * Exit an RCU extended quiescent state, which can be either the
845 * idle loop or adaptive-tickless usermode execution.
847 * We crowbar the ->dynticks_nmi_nesting field to DYNTICK_IRQ_NONIDLE to
848 * allow for the possibility of usermode upcalls messing up our count of
849 * interrupt nesting level during the busy period that is just now starting.
851 static void rcu_eqs_exit(bool user)
853 struct rcu_dynticks *rdtp;
856 lockdep_assert_irqs_disabled();
857 rdtp = this_cpu_ptr(&rcu_dynticks);
858 oldval = rdtp->dynticks_nesting;
859 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) && oldval < 0);
861 rdtp->dynticks_nesting++;
864 rcu_dynticks_task_exit();
865 rcu_dynticks_eqs_exit();
866 rcu_cleanup_after_idle();
867 trace_rcu_dyntick(TPS("End"), rdtp->dynticks_nesting, 1, rdtp->dynticks);
868 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) && !user && !is_idle_task(current));
869 WRITE_ONCE(rdtp->dynticks_nesting, 1);
870 WRITE_ONCE(rdtp->dynticks_nmi_nesting, DYNTICK_IRQ_NONIDLE);
874 * rcu_idle_exit - inform RCU that current CPU is leaving idle
876 * Exit idle mode, in other words, -enter- the mode in which RCU
877 * read-side critical sections can occur.
879 * If you add or remove a call to rcu_idle_exit(), be sure to test with
880 * CONFIG_RCU_EQS_DEBUG=y.
882 void rcu_idle_exit(void)
886 local_irq_save(flags);
888 local_irq_restore(flags);
891 #ifdef CONFIG_NO_HZ_FULL
893 * rcu_user_exit - inform RCU that we are exiting userspace.
895 * Exit RCU idle mode while entering the kernel because it can
896 * run a RCU read side critical section anytime.
898 * If you add or remove a call to rcu_user_exit(), be sure to test with
899 * CONFIG_RCU_EQS_DEBUG=y.
901 void rcu_user_exit(void)
905 #endif /* CONFIG_NO_HZ_FULL */
908 * rcu_nmi_enter - inform RCU of entry to NMI context
910 * If the CPU was idle from RCU's viewpoint, update rdtp->dynticks and
911 * rdtp->dynticks_nmi_nesting to let the RCU grace-period handling know
912 * that the CPU is active. This implementation permits nested NMIs, as
913 * long as the nesting level does not overflow an int. (You will probably
914 * run out of stack space first.)
916 * If you add or remove a call to rcu_nmi_enter(), be sure to test
917 * with CONFIG_RCU_EQS_DEBUG=y.
919 void rcu_nmi_enter(void)
921 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
924 /* Complain about underflow. */
925 WARN_ON_ONCE(rdtp->dynticks_nmi_nesting < 0);
928 * If idle from RCU viewpoint, atomically increment ->dynticks
929 * to mark non-idle and increment ->dynticks_nmi_nesting by one.
930 * Otherwise, increment ->dynticks_nmi_nesting by two. This means
931 * if ->dynticks_nmi_nesting is equal to one, we are guaranteed
932 * to be in the outermost NMI handler that interrupted an RCU-idle
933 * period (observation due to Andy Lutomirski).
935 if (rcu_dynticks_curr_cpu_in_eqs()) {
936 rcu_dynticks_eqs_exit();
939 trace_rcu_dyntick(incby == 1 ? TPS("Endirq") : TPS("++="),
940 rdtp->dynticks_nmi_nesting,
941 rdtp->dynticks_nmi_nesting + incby, rdtp->dynticks);
942 WRITE_ONCE(rdtp->dynticks_nmi_nesting, /* Prevent store tearing. */
943 rdtp->dynticks_nmi_nesting + incby);
948 * rcu_irq_enter - inform RCU that current CPU is entering irq away from idle
950 * Enter an interrupt handler, which might possibly result in exiting
951 * idle mode, in other words, entering the mode in which read-side critical
952 * sections can occur. The caller must have disabled interrupts.
954 * Note that the Linux kernel is fully capable of entering an interrupt
955 * handler that it never exits, for example when doing upcalls to user mode!
956 * This code assumes that the idle loop never does upcalls to user mode.
957 * If your architecture's idle loop does do upcalls to user mode (or does
958 * anything else that results in unbalanced calls to the irq_enter() and
959 * irq_exit() functions), RCU will give you what you deserve, good and hard.
960 * But very infrequently and irreproducibly.
962 * Use things like work queues to work around this limitation.
964 * You have been warned.
966 * If you add or remove a call to rcu_irq_enter(), be sure to test with
967 * CONFIG_RCU_EQS_DEBUG=y.
969 void rcu_irq_enter(void)
971 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
973 lockdep_assert_irqs_disabled();
974 if (rdtp->dynticks_nmi_nesting == 0)
975 rcu_dynticks_task_exit();
977 if (rdtp->dynticks_nmi_nesting == 1)
978 rcu_cleanup_after_idle();
982 * Wrapper for rcu_irq_enter() where interrupts are enabled.
984 * If you add or remove a call to rcu_irq_enter_irqson(), be sure to test
985 * with CONFIG_RCU_EQS_DEBUG=y.
987 void rcu_irq_enter_irqson(void)
991 local_irq_save(flags);
993 local_irq_restore(flags);
997 * rcu_is_watching - see if RCU thinks that the current CPU is idle
999 * Return true if RCU is watching the running CPU, which means that this
1000 * CPU can safely enter RCU read-side critical sections. In other words,
1001 * if the current CPU is in its idle loop and is neither in an interrupt
1002 * or NMI handler, return true.
1004 bool notrace rcu_is_watching(void)
1008 preempt_disable_notrace();
1009 ret = !rcu_dynticks_curr_cpu_in_eqs();
1010 preempt_enable_notrace();
1013 EXPORT_SYMBOL_GPL(rcu_is_watching);
1016 * If a holdout task is actually running, request an urgent quiescent
1017 * state from its CPU. This is unsynchronized, so migrations can cause
1018 * the request to go to the wrong CPU. Which is OK, all that will happen
1019 * is that the CPU's next context switch will be a bit slower and next
1020 * time around this task will generate another request.
1022 void rcu_request_urgent_qs_task(struct task_struct *t)
1029 return; /* This task is not running on that CPU. */
1030 smp_store_release(per_cpu_ptr(&rcu_dynticks.rcu_urgent_qs, cpu), true);
1033 #if defined(CONFIG_PROVE_RCU) && defined(CONFIG_HOTPLUG_CPU)
1036 * Is the current CPU online? Disable preemption to avoid false positives
1037 * that could otherwise happen due to the current CPU number being sampled,
1038 * this task being preempted, its old CPU being taken offline, resuming
1039 * on some other CPU, then determining that its old CPU is now offline.
1040 * It is OK to use RCU on an offline processor during initial boot, hence
1041 * the check for rcu_scheduler_fully_active. Note also that it is OK
1042 * for a CPU coming online to use RCU for one jiffy prior to marking itself
1043 * online in the cpu_online_mask. Similarly, it is OK for a CPU going
1044 * offline to continue to use RCU for one jiffy after marking itself
1045 * offline in the cpu_online_mask. This leniency is necessary given the
1046 * non-atomic nature of the online and offline processing, for example,
1047 * the fact that a CPU enters the scheduler after completing the teardown
1050 * This is also why RCU internally marks CPUs online during in the
1051 * preparation phase and offline after the CPU has been taken down.
1053 * Disable checking if in an NMI handler because we cannot safely report
1054 * errors from NMI handlers anyway.
1056 bool rcu_lockdep_current_cpu_online(void)
1058 struct rcu_data *rdp;
1059 struct rcu_node *rnp;
1065 rdp = this_cpu_ptr(&rcu_sched_data);
1067 ret = (rdp->grpmask & rcu_rnp_online_cpus(rnp)) ||
1068 !rcu_scheduler_fully_active;
1072 EXPORT_SYMBOL_GPL(rcu_lockdep_current_cpu_online);
1074 #endif /* #if defined(CONFIG_PROVE_RCU) && defined(CONFIG_HOTPLUG_CPU) */
1077 * rcu_is_cpu_rrupt_from_idle - see if idle or immediately interrupted from idle
1079 * If the current CPU is idle or running at a first-level (not nested)
1080 * interrupt from idle, return true. The caller must have at least
1081 * disabled preemption.
1083 static int rcu_is_cpu_rrupt_from_idle(void)
1085 return __this_cpu_read(rcu_dynticks.dynticks_nesting) <= 0 &&
1086 __this_cpu_read(rcu_dynticks.dynticks_nmi_nesting) <= 1;
1090 * We are reporting a quiescent state on behalf of some other CPU, so
1091 * it is our responsibility to check for and handle potential overflow
1092 * of the rcu_node ->gp_seq counter with respect to the rcu_data counters.
1093 * After all, the CPU might be in deep idle state, and thus executing no
1096 static void rcu_gpnum_ovf(struct rcu_node *rnp, struct rcu_data *rdp)
1098 raw_lockdep_assert_held_rcu_node(rnp);
1099 if (ULONG_CMP_LT(rcu_seq_current(&rdp->gp_seq) + ULONG_MAX / 4,
1101 WRITE_ONCE(rdp->gpwrap, true);
1102 if (ULONG_CMP_LT(rdp->rcu_iw_gp_seq + ULONG_MAX / 4, rnp->gp_seq))
1103 rdp->rcu_iw_gp_seq = rnp->gp_seq + ULONG_MAX / 4;
1107 * Snapshot the specified CPU's dynticks counter so that we can later
1108 * credit them with an implicit quiescent state. Return 1 if this CPU
1109 * is in dynticks idle mode, which is an extended quiescent state.
1111 static int dyntick_save_progress_counter(struct rcu_data *rdp)
1113 rdp->dynticks_snap = rcu_dynticks_snap(rdp->dynticks);
1114 if (rcu_dynticks_in_eqs(rdp->dynticks_snap)) {
1115 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("dti"));
1116 rcu_gpnum_ovf(rdp->mynode, rdp);
1123 * Handler for the irq_work request posted when a grace period has
1124 * gone on for too long, but not yet long enough for an RCU CPU
1125 * stall warning. Set state appropriately, but just complain if
1126 * there is unexpected state on entry.
1128 static void rcu_iw_handler(struct irq_work *iwp)
1130 struct rcu_data *rdp;
1131 struct rcu_node *rnp;
1133 rdp = container_of(iwp, struct rcu_data, rcu_iw);
1135 raw_spin_lock_rcu_node(rnp);
1136 if (!WARN_ON_ONCE(!rdp->rcu_iw_pending)) {
1137 rdp->rcu_iw_gp_seq = rnp->gp_seq;
1138 rdp->rcu_iw_pending = false;
1140 raw_spin_unlock_rcu_node(rnp);
1144 * Return true if the specified CPU has passed through a quiescent
1145 * state by virtue of being in or having passed through an dynticks
1146 * idle state since the last call to dyntick_save_progress_counter()
1147 * for this same CPU, or by virtue of having been offline.
1149 static int rcu_implicit_dynticks_qs(struct rcu_data *rdp)
1154 struct rcu_node *rnp = rdp->mynode;
1157 * If the CPU passed through or entered a dynticks idle phase with
1158 * no active irq/NMI handlers, then we can safely pretend that the CPU
1159 * already acknowledged the request to pass through a quiescent
1160 * state. Either way, that CPU cannot possibly be in an RCU
1161 * read-side critical section that started before the beginning
1162 * of the current RCU grace period.
1164 if (rcu_dynticks_in_eqs_since(rdp->dynticks, rdp->dynticks_snap)) {
1165 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("dti"));
1166 rdp->dynticks_fqs++;
1167 rcu_gpnum_ovf(rnp, rdp);
1172 * Has this CPU encountered a cond_resched() since the beginning
1173 * of the grace period? For this to be the case, the CPU has to
1174 * have noticed the current grace period. This might not be the
1175 * case for nohz_full CPUs looping in the kernel.
1177 jtsq = jiffies_till_sched_qs;
1178 ruqp = per_cpu_ptr(&rcu_dynticks.rcu_urgent_qs, rdp->cpu);
1179 if (time_after(jiffies, rdp->rsp->gp_start + jtsq) &&
1180 READ_ONCE(rdp->rcu_qs_ctr_snap) != per_cpu(rcu_dynticks.rcu_qs_ctr, rdp->cpu) &&
1181 rcu_seq_current(&rdp->gp_seq) == rnp->gp_seq && !rdp->gpwrap) {
1182 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("rqc"));
1183 rcu_gpnum_ovf(rnp, rdp);
1185 } else if (time_after(jiffies, rdp->rsp->gp_start + jtsq)) {
1186 /* Load rcu_qs_ctr before store to rcu_urgent_qs. */
1187 smp_store_release(ruqp, true);
1190 /* Check for the CPU being offline. */
1191 if (!(rdp->grpmask & rcu_rnp_online_cpus(rnp))) {
1192 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("ofl"));
1194 rcu_gpnum_ovf(rnp, rdp);
1199 * A CPU running for an extended time within the kernel can
1200 * delay RCU grace periods. When the CPU is in NO_HZ_FULL mode,
1201 * even context-switching back and forth between a pair of
1202 * in-kernel CPU-bound tasks cannot advance grace periods.
1203 * So if the grace period is old enough, make the CPU pay attention.
1204 * Note that the unsynchronized assignments to the per-CPU
1205 * rcu_need_heavy_qs variable are safe. Yes, setting of
1206 * bits can be lost, but they will be set again on the next
1207 * force-quiescent-state pass. So lost bit sets do not result
1208 * in incorrect behavior, merely in a grace period lasting
1209 * a few jiffies longer than it might otherwise. Because
1210 * there are at most four threads involved, and because the
1211 * updates are only once every few jiffies, the probability of
1212 * lossage (and thus of slight grace-period extension) is
1215 rnhqp = &per_cpu(rcu_dynticks.rcu_need_heavy_qs, rdp->cpu);
1216 if (!READ_ONCE(*rnhqp) &&
1217 (time_after(jiffies, rdp->rsp->gp_start + jtsq) ||
1218 time_after(jiffies, rdp->rsp->jiffies_resched))) {
1219 WRITE_ONCE(*rnhqp, true);
1220 /* Store rcu_need_heavy_qs before rcu_urgent_qs. */
1221 smp_store_release(ruqp, true);
1222 rdp->rsp->jiffies_resched += jtsq; /* Re-enable beating. */
1226 * If more than halfway to RCU CPU stall-warning time, do a
1227 * resched_cpu() to try to loosen things up a bit. Also check to
1228 * see if the CPU is getting hammered with interrupts, but only
1229 * once per grace period, just to keep the IPIs down to a dull roar.
1231 if (jiffies - rdp->rsp->gp_start > rcu_jiffies_till_stall_check() / 2) {
1232 resched_cpu(rdp->cpu);
1233 if (IS_ENABLED(CONFIG_IRQ_WORK) &&
1234 !rdp->rcu_iw_pending && rdp->rcu_iw_gp_seq != rnp->gp_seq &&
1235 (rnp->ffmask & rdp->grpmask)) {
1236 init_irq_work(&rdp->rcu_iw, rcu_iw_handler);
1237 rdp->rcu_iw_pending = true;
1238 rdp->rcu_iw_gp_seq = rnp->gp_seq;
1239 irq_work_queue_on(&rdp->rcu_iw, rdp->cpu);
1246 static void record_gp_stall_check_time(struct rcu_state *rsp)
1248 unsigned long j = jiffies;
1252 smp_wmb(); /* Record start time before stall time. */
1253 j1 = rcu_jiffies_till_stall_check();
1254 WRITE_ONCE(rsp->jiffies_stall, j + j1);
1255 rsp->jiffies_resched = j + j1 / 2;
1256 rsp->n_force_qs_gpstart = READ_ONCE(rsp->n_force_qs);
1260 * Convert a ->gp_state value to a character string.
1262 static const char *gp_state_getname(short gs)
1264 if (gs < 0 || gs >= ARRAY_SIZE(gp_state_names))
1266 return gp_state_names[gs];
1270 * Complain about starvation of grace-period kthread.
1272 static void rcu_check_gp_kthread_starvation(struct rcu_state *rsp)
1278 gpa = READ_ONCE(rsp->gp_activity);
1279 if (j - gpa > 2 * HZ) {
1280 pr_err("%s kthread starved for %ld jiffies! g%ld f%#x %s(%d) ->state=%#lx ->cpu=%d\n",
1282 (long)rcu_seq_current(&rsp->gp_seq),
1284 gp_state_getname(rsp->gp_state), rsp->gp_state,
1285 rsp->gp_kthread ? rsp->gp_kthread->state : ~0,
1286 rsp->gp_kthread ? task_cpu(rsp->gp_kthread) : -1);
1287 if (rsp->gp_kthread) {
1288 pr_err("RCU grace-period kthread stack dump:\n");
1289 sched_show_task(rsp->gp_kthread);
1290 wake_up_process(rsp->gp_kthread);
1296 * Dump stacks of all tasks running on stalled CPUs. First try using
1297 * NMIs, but fall back to manual remote stack tracing on architectures
1298 * that don't support NMI-based stack dumps. The NMI-triggered stack
1299 * traces are more accurate because they are printed by the target CPU.
1301 static void rcu_dump_cpu_stacks(struct rcu_state *rsp)
1304 unsigned long flags;
1305 struct rcu_node *rnp;
1307 rcu_for_each_leaf_node(rsp, rnp) {
1308 raw_spin_lock_irqsave_rcu_node(rnp, flags);
1309 for_each_leaf_node_possible_cpu(rnp, cpu)
1310 if (rnp->qsmask & leaf_node_cpu_bit(rnp, cpu))
1311 if (!trigger_single_cpu_backtrace(cpu))
1313 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1318 * If too much time has passed in the current grace period, and if
1319 * so configured, go kick the relevant kthreads.
1321 static void rcu_stall_kick_kthreads(struct rcu_state *rsp)
1325 if (!rcu_kick_kthreads)
1327 j = READ_ONCE(rsp->jiffies_kick_kthreads);
1328 if (time_after(jiffies, j) && rsp->gp_kthread &&
1329 (rcu_gp_in_progress(rsp) || READ_ONCE(rsp->gp_flags))) {
1330 WARN_ONCE(1, "Kicking %s grace-period kthread\n", rsp->name);
1331 rcu_ftrace_dump(DUMP_ALL);
1332 wake_up_process(rsp->gp_kthread);
1333 WRITE_ONCE(rsp->jiffies_kick_kthreads, j + HZ);
1337 static inline void panic_on_rcu_stall(void)
1339 if (sysctl_panic_on_rcu_stall)
1340 panic("RCU Stall\n");
1343 static void print_other_cpu_stall(struct rcu_state *rsp, unsigned long gpnum)
1346 unsigned long flags;
1350 struct rcu_node *rnp = rcu_get_root(rsp);
1353 /* Kick and suppress, if so configured. */
1354 rcu_stall_kick_kthreads(rsp);
1355 if (rcu_cpu_stall_suppress)
1359 * OK, time to rat on our buddy...
1360 * See Documentation/RCU/stallwarn.txt for info on how to debug
1361 * RCU CPU stall warnings.
1363 pr_err("INFO: %s detected stalls on CPUs/tasks:",
1365 print_cpu_stall_info_begin();
1366 rcu_for_each_leaf_node(rsp, rnp) {
1367 raw_spin_lock_irqsave_rcu_node(rnp, flags);
1368 ndetected += rcu_print_task_stall(rnp);
1369 if (rnp->qsmask != 0) {
1370 for_each_leaf_node_possible_cpu(rnp, cpu)
1371 if (rnp->qsmask & leaf_node_cpu_bit(rnp, cpu)) {
1372 print_cpu_stall_info(rsp, cpu);
1376 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1379 print_cpu_stall_info_end();
1380 for_each_possible_cpu(cpu)
1381 totqlen += rcu_segcblist_n_cbs(&per_cpu_ptr(rsp->rda,
1383 pr_cont("(detected by %d, t=%ld jiffies, g=%ld, c=%ld, q=%lu)\n",
1384 smp_processor_id(), (long)(jiffies - rsp->gp_start),
1385 (long)rsp->gpnum, (long)rsp->completed, totqlen);
1387 rcu_dump_cpu_stacks(rsp);
1389 /* Complain about tasks blocking the grace period. */
1390 rcu_print_detail_task_stall(rsp);
1392 if (READ_ONCE(rsp->gpnum) != gpnum ||
1393 READ_ONCE(rsp->completed) == gpnum) {
1394 pr_err("INFO: Stall ended before state dump start\n");
1397 gpa = READ_ONCE(rsp->gp_activity);
1398 pr_err("All QSes seen, last %s kthread activity %ld (%ld-%ld), jiffies_till_next_fqs=%ld, root ->qsmask %#lx\n",
1399 rsp->name, j - gpa, j, gpa,
1400 jiffies_till_next_fqs,
1401 rcu_get_root(rsp)->qsmask);
1402 /* In this case, the current CPU might be at fault. */
1403 sched_show_task(current);
1406 /* Rewrite if needed in case of slow consoles. */
1407 if (ULONG_CMP_GE(jiffies, READ_ONCE(rsp->jiffies_stall)))
1408 WRITE_ONCE(rsp->jiffies_stall,
1409 jiffies + 3 * rcu_jiffies_till_stall_check() + 3);
1411 rcu_check_gp_kthread_starvation(rsp);
1413 panic_on_rcu_stall();
1415 force_quiescent_state(rsp); /* Kick them all. */
1418 static void print_cpu_stall(struct rcu_state *rsp)
1421 unsigned long flags;
1422 struct rcu_data *rdp = this_cpu_ptr(rsp->rda);
1423 struct rcu_node *rnp = rcu_get_root(rsp);
1426 /* Kick and suppress, if so configured. */
1427 rcu_stall_kick_kthreads(rsp);
1428 if (rcu_cpu_stall_suppress)
1432 * OK, time to rat on ourselves...
1433 * See Documentation/RCU/stallwarn.txt for info on how to debug
1434 * RCU CPU stall warnings.
1436 pr_err("INFO: %s self-detected stall on CPU", rsp->name);
1437 print_cpu_stall_info_begin();
1438 raw_spin_lock_irqsave_rcu_node(rdp->mynode, flags);
1439 print_cpu_stall_info(rsp, smp_processor_id());
1440 raw_spin_unlock_irqrestore_rcu_node(rdp->mynode, flags);
1441 print_cpu_stall_info_end();
1442 for_each_possible_cpu(cpu)
1443 totqlen += rcu_segcblist_n_cbs(&per_cpu_ptr(rsp->rda,
1445 pr_cont(" (t=%lu jiffies g=%ld c=%ld q=%lu)\n",
1446 jiffies - rsp->gp_start,
1447 (long)rsp->gpnum, (long)rsp->completed, totqlen);
1449 rcu_check_gp_kthread_starvation(rsp);
1451 rcu_dump_cpu_stacks(rsp);
1453 raw_spin_lock_irqsave_rcu_node(rnp, flags);
1454 /* Rewrite if needed in case of slow consoles. */
1455 if (ULONG_CMP_GE(jiffies, READ_ONCE(rsp->jiffies_stall)))
1456 WRITE_ONCE(rsp->jiffies_stall,
1457 jiffies + 3 * rcu_jiffies_till_stall_check() + 3);
1458 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1460 panic_on_rcu_stall();
1463 * Attempt to revive the RCU machinery by forcing a context switch.
1465 * A context switch would normally allow the RCU state machine to make
1466 * progress and it could be we're stuck in kernel space without context
1467 * switches for an entirely unreasonable amount of time.
1469 resched_cpu(smp_processor_id());
1472 static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp)
1474 unsigned long completed;
1475 unsigned long gpnum;
1480 struct rcu_node *rnp;
1482 if ((rcu_cpu_stall_suppress && !rcu_kick_kthreads) ||
1483 !rcu_gp_in_progress(rsp))
1485 rcu_stall_kick_kthreads(rsp);
1489 * Lots of memory barriers to reject false positives.
1491 * The idea is to pick up rsp->gpnum, then rsp->jiffies_stall,
1492 * then rsp->gp_start, and finally rsp->completed. These values
1493 * are updated in the opposite order with memory barriers (or
1494 * equivalent) during grace-period initialization and cleanup.
1495 * Now, a false positive can occur if we get an new value of
1496 * rsp->gp_start and a old value of rsp->jiffies_stall. But given
1497 * the memory barriers, the only way that this can happen is if one
1498 * grace period ends and another starts between these two fetches.
1499 * Detect this by comparing rsp->completed with the previous fetch
1502 * Given this check, comparisons of jiffies, rsp->jiffies_stall,
1503 * and rsp->gp_start suffice to forestall false positives.
1505 gpnum = READ_ONCE(rsp->gpnum);
1506 smp_rmb(); /* Pick up ->gpnum first... */
1507 js = READ_ONCE(rsp->jiffies_stall);
1508 smp_rmb(); /* ...then ->jiffies_stall before the rest... */
1509 gps = READ_ONCE(rsp->gp_start);
1510 smp_rmb(); /* ...and finally ->gp_start before ->completed. */
1511 completed = READ_ONCE(rsp->completed);
1512 if (ULONG_CMP_GE(completed, gpnum) ||
1513 ULONG_CMP_LT(j, js) ||
1514 ULONG_CMP_GE(gps, js))
1515 return; /* No stall or GP completed since entering function. */
1517 jn = jiffies + 3 * rcu_jiffies_till_stall_check() + 3;
1518 if (rcu_gp_in_progress(rsp) &&
1519 (READ_ONCE(rnp->qsmask) & rdp->grpmask) &&
1520 cmpxchg(&rsp->jiffies_stall, js, jn) == js) {
1522 /* We haven't checked in, so go dump stack. */
1523 print_cpu_stall(rsp);
1525 } else if (rcu_gp_in_progress(rsp) &&
1526 ULONG_CMP_GE(j, js + RCU_STALL_RAT_DELAY) &&
1527 cmpxchg(&rsp->jiffies_stall, js, jn) == js) {
1529 /* They had a few time units to dump stack, so complain. */
1530 print_other_cpu_stall(rsp, gpnum);
1535 * rcu_cpu_stall_reset - prevent further stall warnings in current grace period
1537 * Set the stall-warning timeout way off into the future, thus preventing
1538 * any RCU CPU stall-warning messages from appearing in the current set of
1539 * RCU grace periods.
1541 * The caller must disable hard irqs.
1543 void rcu_cpu_stall_reset(void)
1545 struct rcu_state *rsp;
1547 for_each_rcu_flavor(rsp)
1548 WRITE_ONCE(rsp->jiffies_stall, jiffies + ULONG_MAX / 2);
1552 * Determine the value that ->completed will have at the end of the
1553 * next subsequent grace period. This is used to tag callbacks so that
1554 * a CPU can invoke callbacks in a timely fashion even if that CPU has
1555 * been dyntick-idle for an extended period with callbacks under the
1556 * influence of RCU_FAST_NO_HZ.
1558 * The caller must hold rnp->lock with interrupts disabled.
1560 static unsigned long rcu_cbs_completed(struct rcu_state *rsp,
1561 struct rcu_node *rnp)
1563 raw_lockdep_assert_held_rcu_node(rnp);
1566 * If RCU is idle, we just wait for the next grace period.
1567 * But we can only be sure that RCU is idle if we are looking
1568 * at the root rcu_node structure -- otherwise, a new grace
1569 * period might have started, but just not yet gotten around
1570 * to initializing the current non-root rcu_node structure.
1572 if (rcu_get_root(rsp) == rnp && rnp->gpnum == rnp->completed)
1573 return rnp->completed + 1;
1576 * If the current rcu_node structure believes that RCU is
1577 * idle, and if the rcu_state structure does not yet reflect
1578 * the start of a new grace period, then the next grace period
1579 * will suffice. The memory barrier is needed to accurately
1580 * sample the rsp->gpnum, and pairs with the second lock
1581 * acquisition in rcu_gp_init(), which is augmented with
1582 * smp_mb__after_unlock_lock() for this purpose.
1584 if (rnp->gpnum == rnp->completed) {
1585 smp_mb(); /* See above block comment. */
1586 if (READ_ONCE(rsp->gpnum) == rnp->completed)
1587 return rnp->completed + 1;
1591 * Otherwise, wait for a possible partial grace period and
1592 * then the subsequent full grace period.
1594 return rnp->completed + 2;
1597 /* Trace-event wrapper function for trace_rcu_future_grace_period. */
1598 static void trace_rcu_this_gp(struct rcu_node *rnp, struct rcu_data *rdp,
1599 unsigned long c, const char *s)
1601 trace_rcu_future_grace_period(rdp->rsp->name, rnp->gpnum,
1602 rnp->completed, c, rnp->level,
1603 rnp->grplo, rnp->grphi, s);
1607 * Start the specified grace period, as needed to handle newly arrived
1608 * callbacks. The required future grace periods are recorded in each
1609 * rcu_node structure's ->need_future_gp[] field. Returns true if there
1610 * is reason to awaken the grace-period kthread.
1612 * The caller must hold the specified rcu_node structure's ->lock, which
1613 * is why the caller is responsible for waking the grace-period kthread.
1615 static bool rcu_start_this_gp(struct rcu_node *rnp, struct rcu_data *rdp,
1619 struct rcu_state *rsp = rdp->rsp;
1620 struct rcu_node *rnp_root;
1623 * Use funnel locking to either acquire the root rcu_node
1624 * structure's lock or bail out if the need for this grace period
1625 * has already been recorded -- or has already started. If there
1626 * is already a grace period in progress in a non-leaf node, no
1627 * recording is needed because the end of the grace period will
1628 * scan the leaf rcu_node structures. Note that rnp->lock must
1631 raw_lockdep_assert_held_rcu_node(rnp);
1632 trace_rcu_this_gp(rnp, rdp, c, TPS("Startleaf"));
1633 for (rnp_root = rnp; 1; rnp_root = rnp_root->parent) {
1634 if (rnp_root != rnp)
1635 raw_spin_lock_rcu_node(rnp_root);
1636 WARN_ON_ONCE(ULONG_CMP_LT(rnp_root->gpnum +
1637 need_future_gp_mask(), c));
1638 if (need_future_gp_element(rnp_root, c) ||
1639 ULONG_CMP_GE(rnp_root->gpnum, c) ||
1641 rnp_root->gpnum != rnp_root->completed)) {
1642 trace_rcu_this_gp(rnp_root, rdp, c, TPS("Prestarted"));
1645 need_future_gp_element(rnp_root, c) = true;
1646 if (rnp_root != rnp && rnp_root->parent != NULL)
1647 raw_spin_unlock_rcu_node(rnp_root);
1648 if (!rnp_root->parent)
1649 break; /* At root, and perhaps also leaf. */
1652 /* If GP already in progress, just leave, otherwise start one. */
1653 if (rnp_root->gpnum != rnp_root->completed) {
1654 trace_rcu_this_gp(rnp_root, rdp, c, TPS("Startedleafroot"));
1657 trace_rcu_this_gp(rnp_root, rdp, c, TPS("Startedroot"));
1658 WRITE_ONCE(rsp->gp_flags, rsp->gp_flags | RCU_GP_FLAG_INIT);
1659 rsp->gp_req_activity = jiffies;
1660 if (!rsp->gp_kthread) {
1661 trace_rcu_this_gp(rnp_root, rdp, c, TPS("NoGPkthread"));
1664 trace_rcu_grace_period(rsp->name, READ_ONCE(rsp->gpnum), TPS("newreq"));
1665 ret = true; /* Caller must wake GP kthread. */
1667 if (rnp != rnp_root)
1668 raw_spin_unlock_rcu_node(rnp_root);
1673 * Clean up any old requests for the just-ended grace period. Also return
1674 * whether any additional grace periods have been requested.
1676 static bool rcu_future_gp_cleanup(struct rcu_state *rsp, struct rcu_node *rnp)
1678 unsigned long c = rnp->completed;
1680 struct rcu_data *rdp = this_cpu_ptr(rsp->rda);
1682 need_future_gp_element(rnp, c) = false;
1683 needmore = need_any_future_gp(rnp);
1684 trace_rcu_this_gp(rnp, rdp, c,
1685 needmore ? TPS("CleanupMore") : TPS("Cleanup"));
1690 * Awaken the grace-period kthread for the specified flavor of RCU.
1691 * Don't do a self-awaken, and don't bother awakening when there is
1692 * nothing for the grace-period kthread to do (as in several CPUs
1693 * raced to awaken, and we lost), and finally don't try to awaken
1694 * a kthread that has not yet been created.
1696 static void rcu_gp_kthread_wake(struct rcu_state *rsp)
1698 if (current == rsp->gp_kthread ||
1699 !READ_ONCE(rsp->gp_flags) ||
1702 swake_up(&rsp->gp_wq);
1706 * If there is room, assign a ->completed number to any callbacks on
1707 * this CPU that have not already been assigned. Also accelerate any
1708 * callbacks that were previously assigned a ->completed number that has
1709 * since proven to be too conservative, which can happen if callbacks get
1710 * assigned a ->completed number while RCU is idle, but with reference to
1711 * a non-root rcu_node structure. This function is idempotent, so it does
1712 * not hurt to call it repeatedly. Returns an flag saying that we should
1713 * awaken the RCU grace-period kthread.
1715 * The caller must hold rnp->lock with interrupts disabled.
1717 static bool rcu_accelerate_cbs(struct rcu_state *rsp, struct rcu_node *rnp,
1718 struct rcu_data *rdp)
1723 raw_lockdep_assert_held_rcu_node(rnp);
1725 /* If no pending (not yet ready to invoke) callbacks, nothing to do. */
1726 if (!rcu_segcblist_pend_cbs(&rdp->cblist))
1730 * Callbacks are often registered with incomplete grace-period
1731 * information. Something about the fact that getting exact
1732 * information requires acquiring a global lock... RCU therefore
1733 * makes a conservative estimate of the grace period number at which
1734 * a given callback will become ready to invoke. The following
1735 * code checks this estimate and improves it when possible, thus
1736 * accelerating callback invocation to an earlier grace-period
1739 c = rcu_cbs_completed(rsp, rnp);
1740 if (rcu_segcblist_accelerate(&rdp->cblist, c))
1741 ret = rcu_start_this_gp(rnp, rdp, c);
1743 /* Trace depending on how much we were able to accelerate. */
1744 if (rcu_segcblist_restempty(&rdp->cblist, RCU_WAIT_TAIL))
1745 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("AccWaitCB"));
1747 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("AccReadyCB"));
1752 * Move any callbacks whose grace period has completed to the
1753 * RCU_DONE_TAIL sublist, then compact the remaining sublists and
1754 * assign ->completed numbers to any callbacks in the RCU_NEXT_TAIL
1755 * sublist. This function is idempotent, so it does not hurt to
1756 * invoke it repeatedly. As long as it is not invoked -too- often...
1757 * Returns true if the RCU grace-period kthread needs to be awakened.
1759 * The caller must hold rnp->lock with interrupts disabled.
1761 static bool rcu_advance_cbs(struct rcu_state *rsp, struct rcu_node *rnp,
1762 struct rcu_data *rdp)
1764 raw_lockdep_assert_held_rcu_node(rnp);
1766 /* If no pending (not yet ready to invoke) callbacks, nothing to do. */
1767 if (!rcu_segcblist_pend_cbs(&rdp->cblist))
1771 * Find all callbacks whose ->completed numbers indicate that they
1772 * are ready to invoke, and put them into the RCU_DONE_TAIL sublist.
1774 rcu_segcblist_advance(&rdp->cblist, rnp->completed);
1776 /* Classify any remaining callbacks. */
1777 return rcu_accelerate_cbs(rsp, rnp, rdp);
1781 * Update CPU-local rcu_data state to record the beginnings and ends of
1782 * grace periods. The caller must hold the ->lock of the leaf rcu_node
1783 * structure corresponding to the current CPU, and must have irqs disabled.
1784 * Returns true if the grace-period kthread needs to be awakened.
1786 static bool __note_gp_changes(struct rcu_state *rsp, struct rcu_node *rnp,
1787 struct rcu_data *rdp)
1792 raw_lockdep_assert_held_rcu_node(rnp);
1794 if (rdp->gp_seq == rnp->gp_seq)
1795 return false; /* Nothing to do. */
1797 /* Handle the ends of any preceding grace periods first. */
1798 if (rcu_seq_completed_gp(rdp->gp_seq, rnp->gp_seq) ||
1799 unlikely(READ_ONCE(rdp->gpwrap))) {
1800 ret = rcu_advance_cbs(rsp, rnp, rdp); /* Advance callbacks. */
1801 /* Remember that we saw this grace-period completion. */
1802 rdp->completed = rnp->completed;
1803 trace_rcu_grace_period(rsp->name, rdp->gp_seq, TPS("cpuend"));
1805 ret = rcu_accelerate_cbs(rsp, rnp, rdp); /* Recent callbacks. */
1808 /* Now handle the beginnings of any new-to-this-CPU grace periods. */
1809 if (rcu_seq_new_gp(rdp->gp_seq, rnp->gp_seq) ||
1810 unlikely(READ_ONCE(rdp->gpwrap))) {
1812 * If the current grace period is waiting for this CPU,
1813 * set up to detect a quiescent state, otherwise don't
1814 * go looking for one.
1816 rdp->gpnum = rnp->gpnum;
1817 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpustart"));
1818 need_gp = !!(rnp->qsmask & rdp->grpmask);
1819 rdp->cpu_no_qs.b.norm = need_gp;
1820 rdp->rcu_qs_ctr_snap = __this_cpu_read(rcu_dynticks.rcu_qs_ctr);
1821 rdp->core_needs_qs = need_gp;
1822 zero_cpu_stall_ticks(rdp);
1823 WRITE_ONCE(rdp->gpwrap, false);
1824 rcu_gpnum_ovf(rnp, rdp);
1826 rdp->gp_seq = rnp->gp_seq; /* Remember new grace-period state. */
1830 static void note_gp_changes(struct rcu_state *rsp, struct rcu_data *rdp)
1832 unsigned long flags;
1834 struct rcu_node *rnp;
1836 local_irq_save(flags);
1838 if ((rdp->gp_seq == rcu_seq_current(&rnp->gp_seq) &&
1839 !unlikely(READ_ONCE(rdp->gpwrap))) || /* w/out lock. */
1840 !raw_spin_trylock_rcu_node(rnp)) { /* irqs already off, so later. */
1841 local_irq_restore(flags);
1844 needwake = __note_gp_changes(rsp, rnp, rdp);
1845 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1847 rcu_gp_kthread_wake(rsp);
1850 static void rcu_gp_slow(struct rcu_state *rsp, int delay)
1853 !(rcu_seq_ctr(rsp->gp_seq) %
1854 (rcu_num_nodes * PER_RCU_NODE_PERIOD * delay)))
1855 schedule_timeout_uninterruptible(delay);
1859 * Initialize a new grace period. Return false if no grace period required.
1861 static bool rcu_gp_init(struct rcu_state *rsp)
1863 unsigned long oldmask;
1864 struct rcu_data *rdp;
1865 struct rcu_node *rnp = rcu_get_root(rsp);
1867 WRITE_ONCE(rsp->gp_activity, jiffies);
1868 raw_spin_lock_irq_rcu_node(rnp);
1869 if (!READ_ONCE(rsp->gp_flags)) {
1870 /* Spurious wakeup, tell caller to go back to sleep. */
1871 raw_spin_unlock_irq_rcu_node(rnp);
1874 WRITE_ONCE(rsp->gp_flags, 0); /* Clear all flags: New grace period. */
1876 if (WARN_ON_ONCE(rcu_gp_in_progress(rsp))) {
1878 * Grace period already in progress, don't start another.
1879 * Not supposed to be able to happen.
1881 raw_spin_unlock_irq_rcu_node(rnp);
1885 /* Advance to a new grace period and initialize state. */
1886 record_gp_stall_check_time(rsp);
1887 /* Record GP times before starting GP, hence smp_store_release(). */
1888 WARN_ON_ONCE(rsp->gpnum << RCU_SEQ_CTR_SHIFT != rsp->gp_seq);
1889 smp_store_release(&rsp->gpnum, rsp->gpnum + 1);
1890 smp_mb(); /* Pairs with barriers in stall-warning code. */
1891 rcu_seq_start(&rsp->gp_seq);
1892 trace_rcu_grace_period(rsp->name, rsp->gpnum, TPS("start"));
1893 raw_spin_unlock_irq_rcu_node(rnp);
1896 * Apply per-leaf buffered online and offline operations to the
1897 * rcu_node tree. Note that this new grace period need not wait
1898 * for subsequent online CPUs, and that quiescent-state forcing
1899 * will handle subsequent offline CPUs.
1901 rcu_for_each_leaf_node(rsp, rnp) {
1902 rcu_gp_slow(rsp, gp_preinit_delay);
1903 raw_spin_lock_irq_rcu_node(rnp);
1904 if (rnp->qsmaskinit == rnp->qsmaskinitnext &&
1905 !rnp->wait_blkd_tasks) {
1906 /* Nothing to do on this leaf rcu_node structure. */
1907 raw_spin_unlock_irq_rcu_node(rnp);
1911 /* Record old state, apply changes to ->qsmaskinit field. */
1912 oldmask = rnp->qsmaskinit;
1913 rnp->qsmaskinit = rnp->qsmaskinitnext;
1915 /* If zero-ness of ->qsmaskinit changed, propagate up tree. */
1916 if (!oldmask != !rnp->qsmaskinit) {
1917 if (!oldmask) /* First online CPU for this rcu_node. */
1918 rcu_init_new_rnp(rnp);
1919 else if (rcu_preempt_has_tasks(rnp)) /* blocked tasks */
1920 rnp->wait_blkd_tasks = true;
1921 else /* Last offline CPU and can propagate. */
1922 rcu_cleanup_dead_rnp(rnp);
1926 * If all waited-on tasks from prior grace period are
1927 * done, and if all this rcu_node structure's CPUs are
1928 * still offline, propagate up the rcu_node tree and
1929 * clear ->wait_blkd_tasks. Otherwise, if one of this
1930 * rcu_node structure's CPUs has since come back online,
1931 * simply clear ->wait_blkd_tasks (but rcu_cleanup_dead_rnp()
1932 * checks for this, so just call it unconditionally).
1934 if (rnp->wait_blkd_tasks &&
1935 (!rcu_preempt_has_tasks(rnp) ||
1937 rnp->wait_blkd_tasks = false;
1938 rcu_cleanup_dead_rnp(rnp);
1941 raw_spin_unlock_irq_rcu_node(rnp);
1945 * Set the quiescent-state-needed bits in all the rcu_node
1946 * structures for all currently online CPUs in breadth-first order,
1947 * starting from the root rcu_node structure, relying on the layout
1948 * of the tree within the rsp->node[] array. Note that other CPUs
1949 * will access only the leaves of the hierarchy, thus seeing that no
1950 * grace period is in progress, at least until the corresponding
1951 * leaf node has been initialized.
1953 * The grace period cannot complete until the initialization
1954 * process finishes, because this kthread handles both.
1956 rcu_for_each_node_breadth_first(rsp, rnp) {
1957 rcu_gp_slow(rsp, gp_init_delay);
1958 raw_spin_lock_irq_rcu_node(rnp);
1959 rdp = this_cpu_ptr(rsp->rda);
1960 rcu_preempt_check_blocked_tasks(rnp);
1961 rnp->qsmask = rnp->qsmaskinit;
1962 WRITE_ONCE(rnp->gpnum, rsp->gpnum);
1963 if (WARN_ON_ONCE(rnp->completed != rsp->completed))
1964 WRITE_ONCE(rnp->completed, rsp->completed);
1965 WRITE_ONCE(rnp->gp_seq, rsp->gp_seq);
1966 if (rnp == rdp->mynode)
1967 (void)__note_gp_changes(rsp, rnp, rdp);
1968 rcu_preempt_boost_start_gp(rnp);
1969 trace_rcu_grace_period_init(rsp->name, rnp->gpnum,
1970 rnp->level, rnp->grplo,
1971 rnp->grphi, rnp->qsmask);
1972 raw_spin_unlock_irq_rcu_node(rnp);
1973 cond_resched_tasks_rcu_qs();
1974 WRITE_ONCE(rsp->gp_activity, jiffies);
1981 * Helper function for swait_event_idle() wakeup at force-quiescent-state
1984 static bool rcu_gp_fqs_check_wake(struct rcu_state *rsp, int *gfp)
1986 struct rcu_node *rnp = rcu_get_root(rsp);
1988 /* Someone like call_rcu() requested a force-quiescent-state scan. */
1989 *gfp = READ_ONCE(rsp->gp_flags);
1990 if (*gfp & RCU_GP_FLAG_FQS)
1993 /* The current grace period has completed. */
1994 if (!READ_ONCE(rnp->qsmask) && !rcu_preempt_blocked_readers_cgp(rnp))
2001 * Do one round of quiescent-state forcing.
2003 static void rcu_gp_fqs(struct rcu_state *rsp, bool first_time)
2005 struct rcu_node *rnp = rcu_get_root(rsp);
2007 WRITE_ONCE(rsp->gp_activity, jiffies);
2010 /* Collect dyntick-idle snapshots. */
2011 force_qs_rnp(rsp, dyntick_save_progress_counter);
2013 /* Handle dyntick-idle and offline CPUs. */
2014 force_qs_rnp(rsp, rcu_implicit_dynticks_qs);
2016 /* Clear flag to prevent immediate re-entry. */
2017 if (READ_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) {
2018 raw_spin_lock_irq_rcu_node(rnp);
2019 WRITE_ONCE(rsp->gp_flags,
2020 READ_ONCE(rsp->gp_flags) & ~RCU_GP_FLAG_FQS);
2021 raw_spin_unlock_irq_rcu_node(rnp);
2026 * Clean up after the old grace period.
2028 static void rcu_gp_cleanup(struct rcu_state *rsp)
2030 unsigned long gp_duration;
2031 bool needgp = false;
2032 unsigned long new_gp_seq;
2033 struct rcu_data *rdp;
2034 struct rcu_node *rnp = rcu_get_root(rsp);
2035 struct swait_queue_head *sq;
2037 WRITE_ONCE(rsp->gp_activity, jiffies);
2038 raw_spin_lock_irq_rcu_node(rnp);
2039 gp_duration = jiffies - rsp->gp_start;
2040 if (gp_duration > rsp->gp_max)
2041 rsp->gp_max = gp_duration;
2044 * We know the grace period is complete, but to everyone else
2045 * it appears to still be ongoing. But it is also the case
2046 * that to everyone else it looks like there is nothing that
2047 * they can do to advance the grace period. It is therefore
2048 * safe for us to drop the lock in order to mark the grace
2049 * period as completed in all of the rcu_node structures.
2051 raw_spin_unlock_irq_rcu_node(rnp);
2054 * Propagate new ->completed value to rcu_node structures so
2055 * that other CPUs don't have to wait until the start of the next
2056 * grace period to process their callbacks. This also avoids
2057 * some nasty RCU grace-period initialization races by forcing
2058 * the end of the current grace period to be completely recorded in
2059 * all of the rcu_node structures before the beginning of the next
2060 * grace period is recorded in any of the rcu_node structures.
2062 new_gp_seq = rsp->gp_seq;
2063 rcu_seq_end(&new_gp_seq);
2064 rcu_for_each_node_breadth_first(rsp, rnp) {
2065 raw_spin_lock_irq_rcu_node(rnp);
2066 if (WARN_ON_ONCE(rcu_preempt_blocked_readers_cgp(rnp)))
2067 dump_blkd_tasks(rnp, 10);
2068 WARN_ON_ONCE(rnp->qsmask);
2069 WRITE_ONCE(rnp->completed, rsp->gpnum);
2070 WRITE_ONCE(rnp->gp_seq, new_gp_seq);
2071 rdp = this_cpu_ptr(rsp->rda);
2072 if (rnp == rdp->mynode)
2073 needgp = __note_gp_changes(rsp, rnp, rdp) || needgp;
2074 /* smp_mb() provided by prior unlock-lock pair. */
2075 needgp = rcu_future_gp_cleanup(rsp, rnp) || needgp;
2076 sq = rcu_nocb_gp_get(rnp);
2077 raw_spin_unlock_irq_rcu_node(rnp);
2078 rcu_nocb_gp_cleanup(sq);
2079 cond_resched_tasks_rcu_qs();
2080 WRITE_ONCE(rsp->gp_activity, jiffies);
2081 rcu_gp_slow(rsp, gp_cleanup_delay);
2083 rnp = rcu_get_root(rsp);
2084 raw_spin_lock_irq_rcu_node(rnp); /* GP before rsp->gp_seq update. */
2086 /* Declare grace period done. */
2087 WRITE_ONCE(rsp->completed, rsp->gpnum);
2088 rcu_seq_end(&rsp->gp_seq);
2089 trace_rcu_grace_period(rsp->name, rsp->completed, TPS("end"));
2090 rsp->gp_state = RCU_GP_IDLE;
2091 /* Check for GP requests since above loop. */
2092 rdp = this_cpu_ptr(rsp->rda);
2093 if (need_any_future_gp(rnp)) {
2094 trace_rcu_this_gp(rnp, rdp, rsp->completed - 1,
2095 TPS("CleanupMore"));
2098 /* Advance CBs to reduce false positives below. */
2099 if (!rcu_accelerate_cbs(rsp, rnp, rdp) && needgp) {
2100 WRITE_ONCE(rsp->gp_flags, RCU_GP_FLAG_INIT);
2101 rsp->gp_req_activity = jiffies;
2102 trace_rcu_grace_period(rsp->name, READ_ONCE(rsp->gpnum),
2105 WRITE_ONCE(rsp->gp_flags, rsp->gp_flags & RCU_GP_FLAG_INIT);
2107 raw_spin_unlock_irq_rcu_node(rnp);
2111 * Body of kthread that handles grace periods.
2113 static int __noreturn rcu_gp_kthread(void *arg)
2119 struct rcu_state *rsp = arg;
2120 struct rcu_node *rnp = rcu_get_root(rsp);
2122 rcu_bind_gp_kthread();
2125 /* Handle grace-period start. */
2127 trace_rcu_grace_period(rsp->name,
2128 READ_ONCE(rsp->gpnum),
2130 rsp->gp_state = RCU_GP_WAIT_GPS;
2131 swait_event_idle(rsp->gp_wq, READ_ONCE(rsp->gp_flags) &
2133 rsp->gp_state = RCU_GP_DONE_GPS;
2134 /* Locking provides needed memory barrier. */
2135 if (rcu_gp_init(rsp))
2137 cond_resched_tasks_rcu_qs();
2138 WRITE_ONCE(rsp->gp_activity, jiffies);
2139 WARN_ON(signal_pending(current));
2140 trace_rcu_grace_period(rsp->name,
2141 READ_ONCE(rsp->gpnum),
2145 /* Handle quiescent-state forcing. */
2146 first_gp_fqs = true;
2147 j = jiffies_till_first_fqs;
2150 jiffies_till_first_fqs = HZ;
2155 rsp->jiffies_force_qs = jiffies + j;
2156 WRITE_ONCE(rsp->jiffies_kick_kthreads,
2159 trace_rcu_grace_period(rsp->name,
2160 READ_ONCE(rsp->gpnum),
2162 rsp->gp_state = RCU_GP_WAIT_FQS;
2163 ret = swait_event_idle_timeout(rsp->gp_wq,
2164 rcu_gp_fqs_check_wake(rsp, &gf), j);
2165 rsp->gp_state = RCU_GP_DOING_FQS;
2166 /* Locking provides needed memory barriers. */
2167 /* If grace period done, leave loop. */
2168 if (!READ_ONCE(rnp->qsmask) &&
2169 !rcu_preempt_blocked_readers_cgp(rnp))
2171 /* If time for quiescent-state forcing, do it. */
2172 if (ULONG_CMP_GE(jiffies, rsp->jiffies_force_qs) ||
2173 (gf & RCU_GP_FLAG_FQS)) {
2174 trace_rcu_grace_period(rsp->name,
2175 READ_ONCE(rsp->gpnum),
2177 rcu_gp_fqs(rsp, first_gp_fqs);
2178 first_gp_fqs = false;
2179 trace_rcu_grace_period(rsp->name,
2180 READ_ONCE(rsp->gpnum),
2182 cond_resched_tasks_rcu_qs();
2183 WRITE_ONCE(rsp->gp_activity, jiffies);
2184 ret = 0; /* Force full wait till next FQS. */
2185 j = jiffies_till_next_fqs;
2188 jiffies_till_next_fqs = HZ;
2191 jiffies_till_next_fqs = 1;
2194 /* Deal with stray signal. */
2195 cond_resched_tasks_rcu_qs();
2196 WRITE_ONCE(rsp->gp_activity, jiffies);
2197 WARN_ON(signal_pending(current));
2198 trace_rcu_grace_period(rsp->name,
2199 READ_ONCE(rsp->gpnum),
2201 ret = 1; /* Keep old FQS timing. */
2203 if (time_after(jiffies, rsp->jiffies_force_qs))
2206 j = rsp->jiffies_force_qs - j;
2210 /* Handle grace-period end. */
2211 rsp->gp_state = RCU_GP_CLEANUP;
2212 rcu_gp_cleanup(rsp);
2213 rsp->gp_state = RCU_GP_CLEANED;
2218 * Report a full set of quiescent states to the specified rcu_state data
2219 * structure. Invoke rcu_gp_kthread_wake() to awaken the grace-period
2220 * kthread if another grace period is required. Whether we wake
2221 * the grace-period kthread or it awakens itself for the next round
2222 * of quiescent-state forcing, that kthread will clean up after the
2223 * just-completed grace period. Note that the caller must hold rnp->lock,
2224 * which is released before return.
2226 static void rcu_report_qs_rsp(struct rcu_state *rsp, unsigned long flags)
2227 __releases(rcu_get_root(rsp)->lock)
2229 raw_lockdep_assert_held_rcu_node(rcu_get_root(rsp));
2230 WARN_ON_ONCE(!rcu_gp_in_progress(rsp));
2231 WRITE_ONCE(rsp->gp_flags, READ_ONCE(rsp->gp_flags) | RCU_GP_FLAG_FQS);
2232 raw_spin_unlock_irqrestore_rcu_node(rcu_get_root(rsp), flags);
2233 rcu_gp_kthread_wake(rsp);
2237 * Similar to rcu_report_qs_rdp(), for which it is a helper function.
2238 * Allows quiescent states for a group of CPUs to be reported at one go
2239 * to the specified rcu_node structure, though all the CPUs in the group
2240 * must be represented by the same rcu_node structure (which need not be a
2241 * leaf rcu_node structure, though it often will be). The gps parameter
2242 * is the grace-period snapshot, which means that the quiescent states
2243 * are valid only if rnp->gp_seq is equal to gps. That structure's lock
2244 * must be held upon entry, and it is released before return.
2247 rcu_report_qs_rnp(unsigned long mask, struct rcu_state *rsp,
2248 struct rcu_node *rnp, unsigned long gps, unsigned long flags)
2249 __releases(rnp->lock)
2251 unsigned long oldmask = 0;
2252 struct rcu_node *rnp_c;
2254 raw_lockdep_assert_held_rcu_node(rnp);
2256 /* Walk up the rcu_node hierarchy. */
2258 if (!(rnp->qsmask & mask) || rnp->gp_seq != gps) {
2261 * Our bit has already been cleared, or the
2262 * relevant grace period is already over, so done.
2264 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2267 WARN_ON_ONCE(oldmask); /* Any child must be all zeroed! */
2268 WARN_ON_ONCE(!rcu_is_leaf_node(rnp) &&
2269 rcu_preempt_blocked_readers_cgp(rnp));
2270 rnp->qsmask &= ~mask;
2271 trace_rcu_quiescent_state_report(rsp->name, rnp->gpnum,
2272 mask, rnp->qsmask, rnp->level,
2273 rnp->grplo, rnp->grphi,
2275 if (rnp->qsmask != 0 || rcu_preempt_blocked_readers_cgp(rnp)) {
2277 /* Other bits still set at this level, so done. */
2278 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2281 rnp->completedqs = rnp->gpnum;
2282 mask = rnp->grpmask;
2283 if (rnp->parent == NULL) {
2285 /* No more levels. Exit loop holding root lock. */
2289 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2292 raw_spin_lock_irqsave_rcu_node(rnp, flags);
2293 oldmask = rnp_c->qsmask;
2297 * Get here if we are the last CPU to pass through a quiescent
2298 * state for this grace period. Invoke rcu_report_qs_rsp()
2299 * to clean up and start the next grace period if one is needed.
2301 rcu_report_qs_rsp(rsp, flags); /* releases rnp->lock. */
2305 * Record a quiescent state for all tasks that were previously queued
2306 * on the specified rcu_node structure and that were blocking the current
2307 * RCU grace period. The caller must hold the specified rnp->lock with
2308 * irqs disabled, and this lock is released upon return, but irqs remain
2311 static void rcu_report_unblock_qs_rnp(struct rcu_state *rsp,
2312 struct rcu_node *rnp, unsigned long flags)
2313 __releases(rnp->lock)
2317 struct rcu_node *rnp_p;
2319 raw_lockdep_assert_held_rcu_node(rnp);
2320 if (rcu_state_p == &rcu_sched_state || rsp != rcu_state_p ||
2321 rnp->qsmask != 0 || rcu_preempt_blocked_readers_cgp(rnp)) {
2322 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2323 return; /* Still need more quiescent states! */
2326 rnp_p = rnp->parent;
2327 if (rnp_p == NULL) {
2329 * Only one rcu_node structure in the tree, so don't
2330 * try to report up to its nonexistent parent!
2332 rcu_report_qs_rsp(rsp, flags);
2336 /* Report up the rest of the hierarchy, tracking current ->gp_seq. */
2338 mask = rnp->grpmask;
2339 raw_spin_unlock_rcu_node(rnp); /* irqs remain disabled. */
2340 raw_spin_lock_rcu_node(rnp_p); /* irqs already disabled. */
2341 rcu_report_qs_rnp(mask, rsp, rnp_p, gps, flags);
2345 * Record a quiescent state for the specified CPU to that CPU's rcu_data
2346 * structure. This must be called from the specified CPU.
2349 rcu_report_qs_rdp(int cpu, struct rcu_state *rsp, struct rcu_data *rdp)
2351 unsigned long flags;
2354 struct rcu_node *rnp;
2357 raw_spin_lock_irqsave_rcu_node(rnp, flags);
2358 if (rdp->cpu_no_qs.b.norm || rdp->gp_seq != rnp->gp_seq ||
2362 * The grace period in which this quiescent state was
2363 * recorded has ended, so don't report it upwards.
2364 * We will instead need a new quiescent state that lies
2365 * within the current grace period.
2367 rdp->cpu_no_qs.b.norm = true; /* need qs for new gp. */
2368 rdp->rcu_qs_ctr_snap = __this_cpu_read(rcu_dynticks.rcu_qs_ctr);
2369 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2372 mask = rdp->grpmask;
2373 if ((rnp->qsmask & mask) == 0) {
2374 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2376 rdp->core_needs_qs = false;
2379 * This GP can't end until cpu checks in, so all of our
2380 * callbacks can be processed during the next GP.
2382 needwake = rcu_accelerate_cbs(rsp, rnp, rdp);
2384 rcu_report_qs_rnp(mask, rsp, rnp, rnp->gp_seq, flags);
2385 /* ^^^ Released rnp->lock */
2387 rcu_gp_kthread_wake(rsp);
2392 * Check to see if there is a new grace period of which this CPU
2393 * is not yet aware, and if so, set up local rcu_data state for it.
2394 * Otherwise, see if this CPU has just passed through its first
2395 * quiescent state for this grace period, and record that fact if so.
2398 rcu_check_quiescent_state(struct rcu_state *rsp, struct rcu_data *rdp)
2400 /* Check for grace-period ends and beginnings. */
2401 note_gp_changes(rsp, rdp);
2404 * Does this CPU still need to do its part for current grace period?
2405 * If no, return and let the other CPUs do their part as well.
2407 if (!rdp->core_needs_qs)
2411 * Was there a quiescent state since the beginning of the grace
2412 * period? If no, then exit and wait for the next call.
2414 if (rdp->cpu_no_qs.b.norm)
2418 * Tell RCU we are done (but rcu_report_qs_rdp() will be the
2421 rcu_report_qs_rdp(rdp->cpu, rsp, rdp);
2425 * Trace the fact that this CPU is going offline.
2427 static void rcu_cleanup_dying_cpu(struct rcu_state *rsp)
2429 RCU_TRACE(unsigned long mask;)
2430 RCU_TRACE(struct rcu_data *rdp = this_cpu_ptr(rsp->rda);)
2431 RCU_TRACE(struct rcu_node *rnp = rdp->mynode;)
2433 if (!IS_ENABLED(CONFIG_HOTPLUG_CPU))
2436 RCU_TRACE(mask = rdp->grpmask;)
2437 trace_rcu_grace_period(rsp->name,
2438 rnp->gpnum + 1 - !!(rnp->qsmask & mask),
2443 * All CPUs for the specified rcu_node structure have gone offline,
2444 * and all tasks that were preempted within an RCU read-side critical
2445 * section while running on one of those CPUs have since exited their RCU
2446 * read-side critical section. Some other CPU is reporting this fact with
2447 * the specified rcu_node structure's ->lock held and interrupts disabled.
2448 * This function therefore goes up the tree of rcu_node structures,
2449 * clearing the corresponding bits in the ->qsmaskinit fields. Note that
2450 * the leaf rcu_node structure's ->qsmaskinit field has already been
2453 * This function does check that the specified rcu_node structure has
2454 * all CPUs offline and no blocked tasks, so it is OK to invoke it
2455 * prematurely. That said, invoking it after the fact will cost you
2456 * a needless lock acquisition. So once it has done its work, don't
2459 static void rcu_cleanup_dead_rnp(struct rcu_node *rnp_leaf)
2462 struct rcu_node *rnp = rnp_leaf;
2464 raw_lockdep_assert_held_rcu_node(rnp);
2465 if (!IS_ENABLED(CONFIG_HOTPLUG_CPU) ||
2466 rnp->qsmaskinit || rcu_preempt_has_tasks(rnp))
2469 mask = rnp->grpmask;
2473 raw_spin_lock_rcu_node(rnp); /* irqs already disabled. */
2474 rnp->qsmaskinit &= ~mask;
2475 rnp->qsmask &= ~mask;
2476 if (rnp->qsmaskinit) {
2477 raw_spin_unlock_rcu_node(rnp);
2478 /* irqs remain disabled. */
2481 raw_spin_unlock_rcu_node(rnp); /* irqs remain disabled. */
2486 * The CPU has been completely removed, and some other CPU is reporting
2487 * this fact from process context. Do the remainder of the cleanup.
2488 * There can only be one CPU hotplug operation at a time, so no need for
2491 static void rcu_cleanup_dead_cpu(int cpu, struct rcu_state *rsp)
2493 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
2494 struct rcu_node *rnp = rdp->mynode; /* Outgoing CPU's rdp & rnp. */
2496 if (!IS_ENABLED(CONFIG_HOTPLUG_CPU))
2499 /* Adjust any no-longer-needed kthreads. */
2500 rcu_boost_kthread_setaffinity(rnp, -1);
2504 * Invoke any RCU callbacks that have made it to the end of their grace
2505 * period. Thottle as specified by rdp->blimit.
2507 static void rcu_do_batch(struct rcu_state *rsp, struct rcu_data *rdp)
2509 unsigned long flags;
2510 struct rcu_head *rhp;
2511 struct rcu_cblist rcl = RCU_CBLIST_INITIALIZER(rcl);
2514 /* If no callbacks are ready, just return. */
2515 if (!rcu_segcblist_ready_cbs(&rdp->cblist)) {
2516 trace_rcu_batch_start(rsp->name,
2517 rcu_segcblist_n_lazy_cbs(&rdp->cblist),
2518 rcu_segcblist_n_cbs(&rdp->cblist), 0);
2519 trace_rcu_batch_end(rsp->name, 0,
2520 !rcu_segcblist_empty(&rdp->cblist),
2521 need_resched(), is_idle_task(current),
2522 rcu_is_callbacks_kthread());
2527 * Extract the list of ready callbacks, disabling to prevent
2528 * races with call_rcu() from interrupt handlers. Leave the
2529 * callback counts, as rcu_barrier() needs to be conservative.
2531 local_irq_save(flags);
2532 WARN_ON_ONCE(cpu_is_offline(smp_processor_id()));
2534 trace_rcu_batch_start(rsp->name, rcu_segcblist_n_lazy_cbs(&rdp->cblist),
2535 rcu_segcblist_n_cbs(&rdp->cblist), bl);
2536 rcu_segcblist_extract_done_cbs(&rdp->cblist, &rcl);
2537 local_irq_restore(flags);
2539 /* Invoke callbacks. */
2540 rhp = rcu_cblist_dequeue(&rcl);
2541 for (; rhp; rhp = rcu_cblist_dequeue(&rcl)) {
2542 debug_rcu_head_unqueue(rhp);
2543 if (__rcu_reclaim(rsp->name, rhp))
2544 rcu_cblist_dequeued_lazy(&rcl);
2546 * Stop only if limit reached and CPU has something to do.
2547 * Note: The rcl structure counts down from zero.
2549 if (-rcl.len >= bl &&
2551 (!is_idle_task(current) && !rcu_is_callbacks_kthread())))
2555 local_irq_save(flags);
2557 trace_rcu_batch_end(rsp->name, count, !!rcl.head, need_resched(),
2558 is_idle_task(current), rcu_is_callbacks_kthread());
2560 /* Update counts and requeue any remaining callbacks. */
2561 rcu_segcblist_insert_done_cbs(&rdp->cblist, &rcl);
2562 smp_mb(); /* List handling before counting for rcu_barrier(). */
2563 rcu_segcblist_insert_count(&rdp->cblist, &rcl);
2565 /* Reinstate batch limit if we have worked down the excess. */
2566 count = rcu_segcblist_n_cbs(&rdp->cblist);
2567 if (rdp->blimit == LONG_MAX && count <= qlowmark)
2568 rdp->blimit = blimit;
2570 /* Reset ->qlen_last_fqs_check trigger if enough CBs have drained. */
2571 if (count == 0 && rdp->qlen_last_fqs_check != 0) {
2572 rdp->qlen_last_fqs_check = 0;
2573 rdp->n_force_qs_snap = rsp->n_force_qs;
2574 } else if (count < rdp->qlen_last_fqs_check - qhimark)
2575 rdp->qlen_last_fqs_check = count;
2578 * The following usually indicates a double call_rcu(). To track
2579 * this down, try building with CONFIG_DEBUG_OBJECTS_RCU_HEAD=y.
2581 WARN_ON_ONCE(rcu_segcblist_empty(&rdp->cblist) != (count == 0));
2583 local_irq_restore(flags);
2585 /* Re-invoke RCU core processing if there are callbacks remaining. */
2586 if (rcu_segcblist_ready_cbs(&rdp->cblist))
2591 * Check to see if this CPU is in a non-context-switch quiescent state
2592 * (user mode or idle loop for rcu, non-softirq execution for rcu_bh).
2593 * Also schedule RCU core processing.
2595 * This function must be called from hardirq context. It is normally
2596 * invoked from the scheduling-clock interrupt.
2598 void rcu_check_callbacks(int user)
2600 trace_rcu_utilization(TPS("Start scheduler-tick"));
2601 increment_cpu_stall_ticks();
2602 if (user || rcu_is_cpu_rrupt_from_idle()) {
2605 * Get here if this CPU took its interrupt from user
2606 * mode or from the idle loop, and if this is not a
2607 * nested interrupt. In this case, the CPU is in
2608 * a quiescent state, so note it.
2610 * No memory barrier is required here because both
2611 * rcu_sched_qs() and rcu_bh_qs() reference only CPU-local
2612 * variables that other CPUs neither access nor modify,
2613 * at least not while the corresponding CPU is online.
2619 } else if (!in_softirq()) {
2622 * Get here if this CPU did not take its interrupt from
2623 * softirq, in other words, if it is not interrupting
2624 * a rcu_bh read-side critical section. This is an _bh
2625 * critical section, so note it.
2630 rcu_preempt_check_callbacks();
2634 rcu_note_voluntary_context_switch(current);
2635 trace_rcu_utilization(TPS("End scheduler-tick"));
2639 * Scan the leaf rcu_node structures, processing dyntick state for any that
2640 * have not yet encountered a quiescent state, using the function specified.
2641 * Also initiate boosting for any threads blocked on the root rcu_node.
2643 * The caller must have suppressed start of new grace periods.
2645 static void force_qs_rnp(struct rcu_state *rsp, int (*f)(struct rcu_data *rsp))
2648 unsigned long flags;
2650 struct rcu_node *rnp;
2652 rcu_for_each_leaf_node(rsp, rnp) {
2653 cond_resched_tasks_rcu_qs();
2655 raw_spin_lock_irqsave_rcu_node(rnp, flags);
2656 if (rnp->qsmask == 0) {
2657 if (rcu_state_p == &rcu_sched_state ||
2658 rsp != rcu_state_p ||
2659 rcu_preempt_blocked_readers_cgp(rnp)) {
2661 * No point in scanning bits because they
2662 * are all zero. But we might need to
2663 * priority-boost blocked readers.
2665 rcu_initiate_boost(rnp, flags);
2666 /* rcu_initiate_boost() releases rnp->lock */
2670 (rnp->parent->qsmask & rnp->grpmask)) {
2672 * Race between grace-period
2673 * initialization and task exiting RCU
2674 * read-side critical section: Report.
2676 rcu_report_unblock_qs_rnp(rsp, rnp, flags);
2677 /* rcu_report_unblock_qs_rnp() rlses ->lock */
2681 for_each_leaf_node_possible_cpu(rnp, cpu) {
2682 unsigned long bit = leaf_node_cpu_bit(rnp, cpu);
2683 if ((rnp->qsmask & bit) != 0) {
2684 if (f(per_cpu_ptr(rsp->rda, cpu)))
2689 /* Idle/offline CPUs, report (releases rnp->lock). */
2690 rcu_report_qs_rnp(mask, rsp, rnp, rnp->gp_seq, flags);
2692 /* Nothing to do here, so just drop the lock. */
2693 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2699 * Force quiescent states on reluctant CPUs, and also detect which
2700 * CPUs are in dyntick-idle mode.
2702 static void force_quiescent_state(struct rcu_state *rsp)
2704 unsigned long flags;
2706 struct rcu_node *rnp;
2707 struct rcu_node *rnp_old = NULL;
2709 /* Funnel through hierarchy to reduce memory contention. */
2710 rnp = __this_cpu_read(rsp->rda->mynode);
2711 for (; rnp != NULL; rnp = rnp->parent) {
2712 ret = (READ_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) ||
2713 !raw_spin_trylock(&rnp->fqslock);
2714 if (rnp_old != NULL)
2715 raw_spin_unlock(&rnp_old->fqslock);
2720 /* rnp_old == rcu_get_root(rsp), rnp == NULL. */
2722 /* Reached the root of the rcu_node tree, acquire lock. */
2723 raw_spin_lock_irqsave_rcu_node(rnp_old, flags);
2724 raw_spin_unlock(&rnp_old->fqslock);
2725 if (READ_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) {
2726 raw_spin_unlock_irqrestore_rcu_node(rnp_old, flags);
2727 return; /* Someone beat us to it. */
2729 WRITE_ONCE(rsp->gp_flags, READ_ONCE(rsp->gp_flags) | RCU_GP_FLAG_FQS);
2730 raw_spin_unlock_irqrestore_rcu_node(rnp_old, flags);
2731 rcu_gp_kthread_wake(rsp);
2735 * This function checks for grace-period requests that fail to motivate
2736 * RCU to come out of its idle mode.
2739 rcu_check_gp_start_stall(struct rcu_state *rsp, struct rcu_node *rnp,
2740 struct rcu_data *rdp)
2742 unsigned long flags;
2744 struct rcu_node *rnp_root = rcu_get_root(rsp);
2745 static atomic_t warned = ATOMIC_INIT(0);
2747 if (!IS_ENABLED(CONFIG_PROVE_RCU) ||
2748 rcu_gp_in_progress(rsp) || !need_any_future_gp(rcu_get_root(rsp)))
2750 j = jiffies; /* Expensive access, and in common case don't get here. */
2751 if (time_before(j, READ_ONCE(rsp->gp_req_activity) + HZ) ||
2752 time_before(j, READ_ONCE(rsp->gp_activity) + HZ) ||
2753 atomic_read(&warned))
2756 raw_spin_lock_irqsave_rcu_node(rnp, flags);
2758 if (rcu_gp_in_progress(rsp) || !need_any_future_gp(rcu_get_root(rsp)) ||
2759 time_before(j, READ_ONCE(rsp->gp_req_activity) + HZ) ||
2760 time_before(j, READ_ONCE(rsp->gp_activity) + HZ) ||
2761 atomic_read(&warned)) {
2762 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2765 /* Hold onto the leaf lock to make others see warned==1. */
2767 if (rnp_root != rnp)
2768 raw_spin_lock_rcu_node(rnp_root); /* irqs already disabled. */
2770 if (rcu_gp_in_progress(rsp) || !need_any_future_gp(rcu_get_root(rsp)) ||
2771 time_before(j, rsp->gp_req_activity + HZ) ||
2772 time_before(j, rsp->gp_activity + HZ) ||
2773 atomic_xchg(&warned, 1)) {
2774 raw_spin_unlock_rcu_node(rnp_root); /* irqs remain disabled. */
2775 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2778 pr_alert("%s: g%lu %d%d%d%d gar:%lu ga:%lu f%#x %s->state:%#lx\n",
2779 __func__, READ_ONCE(rsp->gpnum),
2780 need_future_gp_element(rcu_get_root(rsp), 0),
2781 need_future_gp_element(rcu_get_root(rsp), 1),
2782 need_future_gp_element(rcu_get_root(rsp), 2),
2783 need_future_gp_element(rcu_get_root(rsp), 3),
2784 j - rsp->gp_req_activity, j - rsp->gp_activity,
2785 rsp->gp_flags, rsp->name,
2786 rsp->gp_kthread ? rsp->gp_kthread->state : 0x1ffffL);
2788 if (rnp_root != rnp)
2789 raw_spin_unlock_rcu_node(rnp_root);
2790 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2794 * This does the RCU core processing work for the specified rcu_state
2795 * and rcu_data structures. This may be called only from the CPU to
2796 * whom the rdp belongs.
2799 __rcu_process_callbacks(struct rcu_state *rsp)
2801 unsigned long flags;
2803 struct rcu_data *rdp = raw_cpu_ptr(rsp->rda);
2804 struct rcu_node *rnp = rdp->mynode;
2806 WARN_ON_ONCE(!rdp->beenonline);
2808 /* Update RCU state based on any recent quiescent states. */
2809 rcu_check_quiescent_state(rsp, rdp);
2811 /* No grace period and unregistered callbacks? */
2812 if (!rcu_gp_in_progress(rsp) &&
2813 rcu_segcblist_is_enabled(&rdp->cblist)) {
2814 local_irq_save(flags);
2815 if (rcu_segcblist_restempty(&rdp->cblist, RCU_NEXT_READY_TAIL)) {
2816 local_irq_restore(flags);
2818 raw_spin_lock_rcu_node(rnp); /* irqs disabled. */
2819 needwake = rcu_accelerate_cbs(rsp, rnp, rdp);
2820 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2822 rcu_gp_kthread_wake(rsp);
2826 rcu_check_gp_start_stall(rsp, rnp, rdp);
2828 /* If there are callbacks ready, invoke them. */
2829 if (rcu_segcblist_ready_cbs(&rdp->cblist))
2830 invoke_rcu_callbacks(rsp, rdp);
2832 /* Do any needed deferred wakeups of rcuo kthreads. */
2833 do_nocb_deferred_wakeup(rdp);
2837 * Do RCU core processing for the current CPU.
2839 static __latent_entropy void rcu_process_callbacks(struct softirq_action *unused)
2841 struct rcu_state *rsp;
2843 if (cpu_is_offline(smp_processor_id()))
2845 trace_rcu_utilization(TPS("Start RCU core"));
2846 for_each_rcu_flavor(rsp)
2847 __rcu_process_callbacks(rsp);
2848 trace_rcu_utilization(TPS("End RCU core"));
2852 * Schedule RCU callback invocation. If the specified type of RCU
2853 * does not support RCU priority boosting, just do a direct call,
2854 * otherwise wake up the per-CPU kernel kthread. Note that because we
2855 * are running on the current CPU with softirqs disabled, the
2856 * rcu_cpu_kthread_task cannot disappear out from under us.
2858 static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp)
2860 if (unlikely(!READ_ONCE(rcu_scheduler_fully_active)))
2862 if (likely(!rsp->boost)) {
2863 rcu_do_batch(rsp, rdp);
2866 invoke_rcu_callbacks_kthread();
2869 static void invoke_rcu_core(void)
2871 if (cpu_online(smp_processor_id()))
2872 raise_softirq(RCU_SOFTIRQ);
2876 * Handle any core-RCU processing required by a call_rcu() invocation.
2878 static void __call_rcu_core(struct rcu_state *rsp, struct rcu_data *rdp,
2879 struct rcu_head *head, unsigned long flags)
2884 * If called from an extended quiescent state, invoke the RCU
2885 * core in order to force a re-evaluation of RCU's idleness.
2887 if (!rcu_is_watching())
2890 /* If interrupts were disabled or CPU offline, don't invoke RCU core. */
2891 if (irqs_disabled_flags(flags) || cpu_is_offline(smp_processor_id()))
2895 * Force the grace period if too many callbacks or too long waiting.
2896 * Enforce hysteresis, and don't invoke force_quiescent_state()
2897 * if some other CPU has recently done so. Also, don't bother
2898 * invoking force_quiescent_state() if the newly enqueued callback
2899 * is the only one waiting for a grace period to complete.
2901 if (unlikely(rcu_segcblist_n_cbs(&rdp->cblist) >
2902 rdp->qlen_last_fqs_check + qhimark)) {
2904 /* Are we ignoring a completed grace period? */
2905 note_gp_changes(rsp, rdp);
2907 /* Start a new grace period if one not already started. */
2908 if (!rcu_gp_in_progress(rsp)) {
2909 struct rcu_node *rnp = rdp->mynode;
2911 raw_spin_lock_rcu_node(rnp);
2912 needwake = rcu_accelerate_cbs(rsp, rnp, rdp);
2913 raw_spin_unlock_rcu_node(rnp);
2915 rcu_gp_kthread_wake(rsp);
2917 /* Give the grace period a kick. */
2918 rdp->blimit = LONG_MAX;
2919 if (rsp->n_force_qs == rdp->n_force_qs_snap &&
2920 rcu_segcblist_first_pend_cb(&rdp->cblist) != head)
2921 force_quiescent_state(rsp);
2922 rdp->n_force_qs_snap = rsp->n_force_qs;
2923 rdp->qlen_last_fqs_check = rcu_segcblist_n_cbs(&rdp->cblist);
2929 * RCU callback function to leak a callback.
2931 static void rcu_leak_callback(struct rcu_head *rhp)
2936 * Helper function for call_rcu() and friends. The cpu argument will
2937 * normally be -1, indicating "currently running CPU". It may specify
2938 * a CPU only if that CPU is a no-CBs CPU. Currently, only _rcu_barrier()
2939 * is expected to specify a CPU.
2942 __call_rcu(struct rcu_head *head, rcu_callback_t func,
2943 struct rcu_state *rsp, int cpu, bool lazy)
2945 unsigned long flags;
2946 struct rcu_data *rdp;
2948 /* Misaligned rcu_head! */
2949 WARN_ON_ONCE((unsigned long)head & (sizeof(void *) - 1));
2951 if (debug_rcu_head_queue(head)) {
2953 * Probable double call_rcu(), so leak the callback.
2954 * Use rcu:rcu_callback trace event to find the previous
2955 * time callback was passed to __call_rcu().
2957 WARN_ONCE(1, "__call_rcu(): Double-freed CB %p->%pF()!!!\n",
2959 WRITE_ONCE(head->func, rcu_leak_callback);
2964 local_irq_save(flags);
2965 rdp = this_cpu_ptr(rsp->rda);
2967 /* Add the callback to our list. */
2968 if (unlikely(!rcu_segcblist_is_enabled(&rdp->cblist)) || cpu != -1) {
2972 rdp = per_cpu_ptr(rsp->rda, cpu);
2973 if (likely(rdp->mynode)) {
2974 /* Post-boot, so this should be for a no-CBs CPU. */
2975 offline = !__call_rcu_nocb(rdp, head, lazy, flags);
2976 WARN_ON_ONCE(offline);
2977 /* Offline CPU, _call_rcu() illegal, leak callback. */
2978 local_irq_restore(flags);
2982 * Very early boot, before rcu_init(). Initialize if needed
2983 * and then drop through to queue the callback.
2986 WARN_ON_ONCE(!rcu_is_watching());
2987 if (rcu_segcblist_empty(&rdp->cblist))
2988 rcu_segcblist_init(&rdp->cblist);
2990 rcu_segcblist_enqueue(&rdp->cblist, head, lazy);
2992 rcu_idle_count_callbacks_posted();
2994 if (__is_kfree_rcu_offset((unsigned long)func))
2995 trace_rcu_kfree_callback(rsp->name, head, (unsigned long)func,
2996 rcu_segcblist_n_lazy_cbs(&rdp->cblist),
2997 rcu_segcblist_n_cbs(&rdp->cblist));
2999 trace_rcu_callback(rsp->name, head,
3000 rcu_segcblist_n_lazy_cbs(&rdp->cblist),
3001 rcu_segcblist_n_cbs(&rdp->cblist));
3003 /* Go handle any RCU core processing required. */
3004 __call_rcu_core(rsp, rdp, head, flags);
3005 local_irq_restore(flags);
3009 * call_rcu_sched() - Queue an RCU for invocation after sched grace period.
3010 * @head: structure to be used for queueing the RCU updates.
3011 * @func: actual callback function to be invoked after the grace period
3013 * The callback function will be invoked some time after a full grace
3014 * period elapses, in other words after all currently executing RCU
3015 * read-side critical sections have completed. call_rcu_sched() assumes
3016 * that the read-side critical sections end on enabling of preemption
3017 * or on voluntary preemption.
3018 * RCU read-side critical sections are delimited by:
3020 * - rcu_read_lock_sched() and rcu_read_unlock_sched(), OR
3021 * - anything that disables preemption.
3023 * These may be nested.
3025 * See the description of call_rcu() for more detailed information on
3026 * memory ordering guarantees.
3028 void call_rcu_sched(struct rcu_head *head, rcu_callback_t func)
3030 __call_rcu(head, func, &rcu_sched_state, -1, 0);
3032 EXPORT_SYMBOL_GPL(call_rcu_sched);
3035 * call_rcu_bh() - Queue an RCU for invocation after a quicker grace period.
3036 * @head: structure to be used for queueing the RCU updates.
3037 * @func: actual callback function to be invoked after the grace period
3039 * The callback function will be invoked some time after a full grace
3040 * period elapses, in other words after all currently executing RCU
3041 * read-side critical sections have completed. call_rcu_bh() assumes
3042 * that the read-side critical sections end on completion of a softirq
3043 * handler. This means that read-side critical sections in process
3044 * context must not be interrupted by softirqs. This interface is to be
3045 * used when most of the read-side critical sections are in softirq context.
3046 * RCU read-side critical sections are delimited by:
3048 * - rcu_read_lock() and rcu_read_unlock(), if in interrupt context, OR
3049 * - rcu_read_lock_bh() and rcu_read_unlock_bh(), if in process context.
3051 * These may be nested.
3053 * See the description of call_rcu() for more detailed information on
3054 * memory ordering guarantees.
3056 void call_rcu_bh(struct rcu_head *head, rcu_callback_t func)
3058 __call_rcu(head, func, &rcu_bh_state, -1, 0);
3060 EXPORT_SYMBOL_GPL(call_rcu_bh);
3063 * Queue an RCU callback for lazy invocation after a grace period.
3064 * This will likely be later named something like "call_rcu_lazy()",
3065 * but this change will require some way of tagging the lazy RCU
3066 * callbacks in the list of pending callbacks. Until then, this
3067 * function may only be called from __kfree_rcu().
3069 void kfree_call_rcu(struct rcu_head *head,
3070 rcu_callback_t func)
3072 __call_rcu(head, func, rcu_state_p, -1, 1);
3074 EXPORT_SYMBOL_GPL(kfree_call_rcu);
3077 * Because a context switch is a grace period for RCU-sched and RCU-bh,
3078 * any blocking grace-period wait automatically implies a grace period
3079 * if there is only one CPU online at any point time during execution
3080 * of either synchronize_sched() or synchronize_rcu_bh(). It is OK to
3081 * occasionally incorrectly indicate that there are multiple CPUs online
3082 * when there was in fact only one the whole time, as this just adds
3083 * some overhead: RCU still operates correctly.
3085 static inline int rcu_blocking_is_gp(void)
3089 might_sleep(); /* Check for RCU read-side critical section. */
3091 ret = num_online_cpus() <= 1;
3097 * synchronize_sched - wait until an rcu-sched grace period has elapsed.
3099 * Control will return to the caller some time after a full rcu-sched
3100 * grace period has elapsed, in other words after all currently executing
3101 * rcu-sched read-side critical sections have completed. These read-side
3102 * critical sections are delimited by rcu_read_lock_sched() and
3103 * rcu_read_unlock_sched(), and may be nested. Note that preempt_disable(),
3104 * local_irq_disable(), and so on may be used in place of
3105 * rcu_read_lock_sched().
3107 * This means that all preempt_disable code sequences, including NMI and
3108 * non-threaded hardware-interrupt handlers, in progress on entry will
3109 * have completed before this primitive returns. However, this does not
3110 * guarantee that softirq handlers will have completed, since in some
3111 * kernels, these handlers can run in process context, and can block.
3113 * Note that this guarantee implies further memory-ordering guarantees.
3114 * On systems with more than one CPU, when synchronize_sched() returns,
3115 * each CPU is guaranteed to have executed a full memory barrier since the
3116 * end of its last RCU-sched read-side critical section whose beginning
3117 * preceded the call to synchronize_sched(). In addition, each CPU having
3118 * an RCU read-side critical section that extends beyond the return from
3119 * synchronize_sched() is guaranteed to have executed a full memory barrier
3120 * after the beginning of synchronize_sched() and before the beginning of
3121 * that RCU read-side critical section. Note that these guarantees include
3122 * CPUs that are offline, idle, or executing in user mode, as well as CPUs
3123 * that are executing in the kernel.
3125 * Furthermore, if CPU A invoked synchronize_sched(), which returned
3126 * to its caller on CPU B, then both CPU A and CPU B are guaranteed
3127 * to have executed a full memory barrier during the execution of
3128 * synchronize_sched() -- even if CPU A and CPU B are the same CPU (but
3129 * again only if the system has more than one CPU).
3131 void synchronize_sched(void)
3133 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map) ||
3134 lock_is_held(&rcu_lock_map) ||
3135 lock_is_held(&rcu_sched_lock_map),
3136 "Illegal synchronize_sched() in RCU-sched read-side critical section");
3137 if (rcu_blocking_is_gp())
3139 if (rcu_gp_is_expedited())
3140 synchronize_sched_expedited();
3142 wait_rcu_gp(call_rcu_sched);
3144 EXPORT_SYMBOL_GPL(synchronize_sched);
3147 * synchronize_rcu_bh - wait until an rcu_bh grace period has elapsed.
3149 * Control will return to the caller some time after a full rcu_bh grace
3150 * period has elapsed, in other words after all currently executing rcu_bh
3151 * read-side critical sections have completed. RCU read-side critical
3152 * sections are delimited by rcu_read_lock_bh() and rcu_read_unlock_bh(),
3153 * and may be nested.
3155 * See the description of synchronize_sched() for more detailed information
3156 * on memory ordering guarantees.
3158 void synchronize_rcu_bh(void)
3160 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map) ||
3161 lock_is_held(&rcu_lock_map) ||
3162 lock_is_held(&rcu_sched_lock_map),
3163 "Illegal synchronize_rcu_bh() in RCU-bh read-side critical section");
3164 if (rcu_blocking_is_gp())
3166 if (rcu_gp_is_expedited())
3167 synchronize_rcu_bh_expedited();
3169 wait_rcu_gp(call_rcu_bh);
3171 EXPORT_SYMBOL_GPL(synchronize_rcu_bh);
3174 * get_state_synchronize_rcu - Snapshot current RCU state
3176 * Returns a cookie that is used by a later call to cond_synchronize_rcu()
3177 * to determine whether or not a full grace period has elapsed in the
3180 unsigned long get_state_synchronize_rcu(void)
3183 * Any prior manipulation of RCU-protected data must happen
3184 * before the load from ->gp_seq.
3187 return rcu_seq_snap(&rcu_state_p->gp_seq);
3189 EXPORT_SYMBOL_GPL(get_state_synchronize_rcu);
3192 * cond_synchronize_rcu - Conditionally wait for an RCU grace period
3194 * @oldstate: return value from earlier call to get_state_synchronize_rcu()
3196 * If a full RCU grace period has elapsed since the earlier call to
3197 * get_state_synchronize_rcu(), just return. Otherwise, invoke
3198 * synchronize_rcu() to wait for a full grace period.
3200 * Yes, this function does not take counter wrap into account. But
3201 * counter wrap is harmless. If the counter wraps, we have waited for
3202 * more than 2 billion grace periods (and way more on a 64-bit system!),
3203 * so waiting for one additional grace period should be just fine.
3205 void cond_synchronize_rcu(unsigned long oldstate)
3207 if (!rcu_seq_done(&rcu_state_p->gp_seq, oldstate))
3210 smp_mb(); /* Ensure GP ends before subsequent accesses. */
3212 EXPORT_SYMBOL_GPL(cond_synchronize_rcu);
3215 * get_state_synchronize_sched - Snapshot current RCU-sched state
3217 * Returns a cookie that is used by a later call to cond_synchronize_sched()
3218 * to determine whether or not a full grace period has elapsed in the
3221 unsigned long get_state_synchronize_sched(void)
3224 * Any prior manipulation of RCU-protected data must happen
3225 * before the load from ->gp_seq.
3228 return rcu_seq_snap(&rcu_sched_state.gp_seq);
3230 EXPORT_SYMBOL_GPL(get_state_synchronize_sched);
3233 * cond_synchronize_sched - Conditionally wait for an RCU-sched grace period
3235 * @oldstate: return value from earlier call to get_state_synchronize_sched()
3237 * If a full RCU-sched grace period has elapsed since the earlier call to
3238 * get_state_synchronize_sched(), just return. Otherwise, invoke
3239 * synchronize_sched() to wait for a full grace period.
3241 * Yes, this function does not take counter wrap into account. But
3242 * counter wrap is harmless. If the counter wraps, we have waited for
3243 * more than 2 billion grace periods (and way more on a 64-bit system!),
3244 * so waiting for one additional grace period should be just fine.
3246 void cond_synchronize_sched(unsigned long oldstate)
3248 if (!rcu_seq_done(&rcu_sched_state.gp_seq, oldstate))
3249 synchronize_sched();
3251 smp_mb(); /* Ensure GP ends before subsequent accesses. */
3253 EXPORT_SYMBOL_GPL(cond_synchronize_sched);
3256 * Check to see if there is any immediate RCU-related work to be done
3257 * by the current CPU, for the specified type of RCU, returning 1 if so.
3258 * The checks are in order of increasing expense: checks that can be
3259 * carried out against CPU-local state are performed first. However,
3260 * we must check for CPU stalls first, else we might not get a chance.
3262 static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp)
3264 struct rcu_node *rnp = rdp->mynode;
3266 /* Check for CPU stalls, if enabled. */
3267 check_cpu_stall(rsp, rdp);
3269 /* Is this CPU a NO_HZ_FULL CPU that should ignore RCU? */
3270 if (rcu_nohz_full_cpu(rsp))
3273 /* Is the RCU core waiting for a quiescent state from this CPU? */
3274 if (rdp->core_needs_qs && !rdp->cpu_no_qs.b.norm)
3277 /* Does this CPU have callbacks ready to invoke? */
3278 if (rcu_segcblist_ready_cbs(&rdp->cblist))
3281 /* Has RCU gone idle with this CPU needing another grace period? */
3282 if (!rcu_gp_in_progress(rsp) &&
3283 rcu_segcblist_is_enabled(&rdp->cblist) &&
3284 !rcu_segcblist_restempty(&rdp->cblist, RCU_NEXT_READY_TAIL))
3287 /* Have RCU grace period completed or started? */
3288 if (rcu_seq_current(&rnp->gp_seq) != rdp->gp_seq ||
3289 unlikely(READ_ONCE(rdp->gpwrap))) /* outside lock */
3292 /* Does this CPU need a deferred NOCB wakeup? */
3293 if (rcu_nocb_need_deferred_wakeup(rdp))
3301 * Check to see if there is any immediate RCU-related work to be done
3302 * by the current CPU, returning 1 if so. This function is part of the
3303 * RCU implementation; it is -not- an exported member of the RCU API.
3305 static int rcu_pending(void)
3307 struct rcu_state *rsp;
3309 for_each_rcu_flavor(rsp)
3310 if (__rcu_pending(rsp, this_cpu_ptr(rsp->rda)))
3316 * Return true if the specified CPU has any callback. If all_lazy is
3317 * non-NULL, store an indication of whether all callbacks are lazy.
3318 * (If there are no callbacks, all of them are deemed to be lazy.)
3320 static bool __maybe_unused rcu_cpu_has_callbacks(bool *all_lazy)
3324 struct rcu_data *rdp;
3325 struct rcu_state *rsp;
3327 for_each_rcu_flavor(rsp) {
3328 rdp = this_cpu_ptr(rsp->rda);
3329 if (rcu_segcblist_empty(&rdp->cblist))
3332 if (rcu_segcblist_n_nonlazy_cbs(&rdp->cblist) || !all_lazy) {
3343 * Helper function for _rcu_barrier() tracing. If tracing is disabled,
3344 * the compiler is expected to optimize this away.
3346 static void _rcu_barrier_trace(struct rcu_state *rsp, const char *s,
3347 int cpu, unsigned long done)
3349 trace_rcu_barrier(rsp->name, s, cpu,
3350 atomic_read(&rsp->barrier_cpu_count), done);
3354 * RCU callback function for _rcu_barrier(). If we are last, wake
3355 * up the task executing _rcu_barrier().
3357 static void rcu_barrier_callback(struct rcu_head *rhp)
3359 struct rcu_data *rdp = container_of(rhp, struct rcu_data, barrier_head);
3360 struct rcu_state *rsp = rdp->rsp;
3362 if (atomic_dec_and_test(&rsp->barrier_cpu_count)) {
3363 _rcu_barrier_trace(rsp, TPS("LastCB"), -1,
3364 rsp->barrier_sequence);
3365 complete(&rsp->barrier_completion);
3367 _rcu_barrier_trace(rsp, TPS("CB"), -1, rsp->barrier_sequence);
3372 * Called with preemption disabled, and from cross-cpu IRQ context.
3374 static void rcu_barrier_func(void *type)
3376 struct rcu_state *rsp = type;
3377 struct rcu_data *rdp = raw_cpu_ptr(rsp->rda);
3379 _rcu_barrier_trace(rsp, TPS("IRQ"), -1, rsp->barrier_sequence);
3380 rdp->barrier_head.func = rcu_barrier_callback;
3381 debug_rcu_head_queue(&rdp->barrier_head);
3382 if (rcu_segcblist_entrain(&rdp->cblist, &rdp->barrier_head, 0)) {
3383 atomic_inc(&rsp->barrier_cpu_count);
3385 debug_rcu_head_unqueue(&rdp->barrier_head);
3386 _rcu_barrier_trace(rsp, TPS("IRQNQ"), -1,
3387 rsp->barrier_sequence);
3392 * Orchestrate the specified type of RCU barrier, waiting for all
3393 * RCU callbacks of the specified type to complete.
3395 static void _rcu_barrier(struct rcu_state *rsp)
3398 struct rcu_data *rdp;
3399 unsigned long s = rcu_seq_snap(&rsp->barrier_sequence);
3401 _rcu_barrier_trace(rsp, TPS("Begin"), -1, s);
3403 /* Take mutex to serialize concurrent rcu_barrier() requests. */
3404 mutex_lock(&rsp->barrier_mutex);
3406 /* Did someone else do our work for us? */
3407 if (rcu_seq_done(&rsp->barrier_sequence, s)) {
3408 _rcu_barrier_trace(rsp, TPS("EarlyExit"), -1,
3409 rsp->barrier_sequence);
3410 smp_mb(); /* caller's subsequent code after above check. */
3411 mutex_unlock(&rsp->barrier_mutex);
3415 /* Mark the start of the barrier operation. */
3416 rcu_seq_start(&rsp->barrier_sequence);
3417 _rcu_barrier_trace(rsp, TPS("Inc1"), -1, rsp->barrier_sequence);
3420 * Initialize the count to one rather than to zero in order to
3421 * avoid a too-soon return to zero in case of a short grace period
3422 * (or preemption of this task). Exclude CPU-hotplug operations
3423 * to ensure that no offline CPU has callbacks queued.
3425 init_completion(&rsp->barrier_completion);
3426 atomic_set(&rsp->barrier_cpu_count, 1);
3430 * Force each CPU with callbacks to register a new callback.
3431 * When that callback is invoked, we will know that all of the
3432 * corresponding CPU's preceding callbacks have been invoked.
3434 for_each_possible_cpu(cpu) {
3435 if (!cpu_online(cpu) && !rcu_is_nocb_cpu(cpu))
3437 rdp = per_cpu_ptr(rsp->rda, cpu);
3438 if (rcu_is_nocb_cpu(cpu)) {
3439 if (!rcu_nocb_cpu_needs_barrier(rsp, cpu)) {
3440 _rcu_barrier_trace(rsp, TPS("OfflineNoCB"), cpu,
3441 rsp->barrier_sequence);
3443 _rcu_barrier_trace(rsp, TPS("OnlineNoCB"), cpu,
3444 rsp->barrier_sequence);
3445 smp_mb__before_atomic();
3446 atomic_inc(&rsp->barrier_cpu_count);
3447 __call_rcu(&rdp->barrier_head,
3448 rcu_barrier_callback, rsp, cpu, 0);
3450 } else if (rcu_segcblist_n_cbs(&rdp->cblist)) {
3451 _rcu_barrier_trace(rsp, TPS("OnlineQ"), cpu,
3452 rsp->barrier_sequence);
3453 smp_call_function_single(cpu, rcu_barrier_func, rsp, 1);
3455 _rcu_barrier_trace(rsp, TPS("OnlineNQ"), cpu,
3456 rsp->barrier_sequence);
3462 * Now that we have an rcu_barrier_callback() callback on each
3463 * CPU, and thus each counted, remove the initial count.
3465 if (atomic_dec_and_test(&rsp->barrier_cpu_count))
3466 complete(&rsp->barrier_completion);
3468 /* Wait for all rcu_barrier_callback() callbacks to be invoked. */
3469 wait_for_completion(&rsp->barrier_completion);
3471 /* Mark the end of the barrier operation. */
3472 _rcu_barrier_trace(rsp, TPS("Inc2"), -1, rsp->barrier_sequence);
3473 rcu_seq_end(&rsp->barrier_sequence);
3475 /* Other rcu_barrier() invocations can now safely proceed. */
3476 mutex_unlock(&rsp->barrier_mutex);
3480 * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete.
3482 void rcu_barrier_bh(void)
3484 _rcu_barrier(&rcu_bh_state);
3486 EXPORT_SYMBOL_GPL(rcu_barrier_bh);
3489 * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks.
3491 void rcu_barrier_sched(void)
3493 _rcu_barrier(&rcu_sched_state);
3495 EXPORT_SYMBOL_GPL(rcu_barrier_sched);
3498 * Propagate ->qsinitmask bits up the rcu_node tree to account for the
3499 * first CPU in a given leaf rcu_node structure coming online. The caller
3500 * must hold the corresponding leaf rcu_node ->lock with interrrupts
3503 static void rcu_init_new_rnp(struct rcu_node *rnp_leaf)
3506 struct rcu_node *rnp = rnp_leaf;
3508 raw_lockdep_assert_held_rcu_node(rnp);
3510 mask = rnp->grpmask;
3514 raw_spin_lock_rcu_node(rnp); /* Interrupts already disabled. */
3515 rnp->qsmaskinit |= mask;
3516 raw_spin_unlock_rcu_node(rnp); /* Interrupts remain disabled. */
3521 * Do boot-time initialization of a CPU's per-CPU RCU data.
3524 rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp)
3526 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3528 /* Set up local state, ensuring consistent view of global state. */
3529 rdp->grpmask = leaf_node_cpu_bit(rdp->mynode, cpu);
3530 rdp->dynticks = &per_cpu(rcu_dynticks, cpu);
3531 WARN_ON_ONCE(rdp->dynticks->dynticks_nesting != 1);
3532 WARN_ON_ONCE(rcu_dynticks_in_eqs(rcu_dynticks_snap(rdp->dynticks)));
3535 rcu_boot_init_nocb_percpu_data(rdp);
3539 * Initialize a CPU's per-CPU RCU data. Note that only one online or
3540 * offline event can be happening at a given time. Note also that we
3541 * can accept some slop in the rsp->completed access due to the fact
3542 * that this CPU cannot possibly have any RCU callbacks in flight yet.
3545 rcu_init_percpu_data(int cpu, struct rcu_state *rsp)
3547 unsigned long flags;
3548 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3549 struct rcu_node *rnp = rcu_get_root(rsp);
3551 /* Set up local state, ensuring consistent view of global state. */
3552 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3553 rdp->qlen_last_fqs_check = 0;
3554 rdp->n_force_qs_snap = rsp->n_force_qs;
3555 rdp->blimit = blimit;
3556 if (rcu_segcblist_empty(&rdp->cblist) && /* No early-boot CBs? */
3557 !init_nocb_callback_list(rdp))
3558 rcu_segcblist_init(&rdp->cblist); /* Re-enable callbacks. */
3559 rdp->dynticks->dynticks_nesting = 1; /* CPU not up, no tearing. */
3560 rcu_dynticks_eqs_online();
3561 raw_spin_unlock_rcu_node(rnp); /* irqs remain disabled. */
3564 * Add CPU to leaf rcu_node pending-online bitmask. Any needed
3565 * propagation up the rcu_node tree will happen at the beginning
3566 * of the next grace period.
3569 raw_spin_lock_rcu_node(rnp); /* irqs already disabled. */
3570 rdp->beenonline = true; /* We have now been online. */
3571 rdp->gpnum = rnp->completed; /* Make CPU later note any new GP. */
3572 rdp->completed = rnp->completed;
3573 rdp->gp_seq = rnp->gp_seq;
3574 rdp->cpu_no_qs.b.norm = true;
3575 rdp->rcu_qs_ctr_snap = per_cpu(rcu_dynticks.rcu_qs_ctr, cpu);
3576 rdp->core_needs_qs = false;
3577 rdp->rcu_iw_pending = false;
3578 rdp->rcu_iw_gp_seq = rnp->gp_seq - 1;
3579 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpuonl"));
3580 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3584 * Invoked early in the CPU-online process, when pretty much all
3585 * services are available. The incoming CPU is not present.
3587 int rcutree_prepare_cpu(unsigned int cpu)
3589 struct rcu_state *rsp;
3591 for_each_rcu_flavor(rsp)
3592 rcu_init_percpu_data(cpu, rsp);
3594 rcu_prepare_kthreads(cpu);
3595 rcu_spawn_all_nocb_kthreads(cpu);
3601 * Update RCU priority boot kthread affinity for CPU-hotplug changes.
3603 static void rcutree_affinity_setting(unsigned int cpu, int outgoing)
3605 struct rcu_data *rdp = per_cpu_ptr(rcu_state_p->rda, cpu);
3607 rcu_boost_kthread_setaffinity(rdp->mynode, outgoing);
3611 * Near the end of the CPU-online process. Pretty much all services
3612 * enabled, and the CPU is now very much alive.
3614 int rcutree_online_cpu(unsigned int cpu)
3616 unsigned long flags;
3617 struct rcu_data *rdp;
3618 struct rcu_node *rnp;
3619 struct rcu_state *rsp;
3621 for_each_rcu_flavor(rsp) {
3622 rdp = per_cpu_ptr(rsp->rda, cpu);
3624 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3625 rnp->ffmask |= rdp->grpmask;
3626 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3628 if (IS_ENABLED(CONFIG_TREE_SRCU))
3629 srcu_online_cpu(cpu);
3630 if (rcu_scheduler_active == RCU_SCHEDULER_INACTIVE)
3631 return 0; /* Too early in boot for scheduler work. */
3632 sync_sched_exp_online_cleanup(cpu);
3633 rcutree_affinity_setting(cpu, -1);
3638 * Near the beginning of the process. The CPU is still very much alive
3639 * with pretty much all services enabled.
3641 int rcutree_offline_cpu(unsigned int cpu)
3643 unsigned long flags;
3644 struct rcu_data *rdp;
3645 struct rcu_node *rnp;
3646 struct rcu_state *rsp;
3648 for_each_rcu_flavor(rsp) {
3649 rdp = per_cpu_ptr(rsp->rda, cpu);
3651 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3652 rnp->ffmask &= ~rdp->grpmask;
3653 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3656 rcutree_affinity_setting(cpu, cpu);
3657 if (IS_ENABLED(CONFIG_TREE_SRCU))
3658 srcu_offline_cpu(cpu);
3663 * Near the end of the offline process. We do only tracing here.
3665 int rcutree_dying_cpu(unsigned int cpu)
3667 struct rcu_state *rsp;
3669 for_each_rcu_flavor(rsp)
3670 rcu_cleanup_dying_cpu(rsp);
3675 * The outgoing CPU is gone and we are running elsewhere.
3677 int rcutree_dead_cpu(unsigned int cpu)
3679 struct rcu_state *rsp;
3681 for_each_rcu_flavor(rsp) {
3682 rcu_cleanup_dead_cpu(cpu, rsp);
3683 do_nocb_deferred_wakeup(per_cpu_ptr(rsp->rda, cpu));
3688 static DEFINE_PER_CPU(int, rcu_cpu_started);
3691 * Mark the specified CPU as being online so that subsequent grace periods
3692 * (both expedited and normal) will wait on it. Note that this means that
3693 * incoming CPUs are not allowed to use RCU read-side critical sections
3694 * until this function is called. Failing to observe this restriction
3695 * will result in lockdep splats.
3697 * Note that this function is special in that it is invoked directly
3698 * from the incoming CPU rather than from the cpuhp_step mechanism.
3699 * This is because this function must be invoked at a precise location.
3701 void rcu_cpu_starting(unsigned int cpu)
3703 unsigned long flags;
3706 unsigned long oldmask;
3707 struct rcu_data *rdp;
3708 struct rcu_node *rnp;
3709 struct rcu_state *rsp;
3711 if (per_cpu(rcu_cpu_started, cpu))
3714 per_cpu(rcu_cpu_started, cpu) = 1;
3716 for_each_rcu_flavor(rsp) {
3717 rdp = per_cpu_ptr(rsp->rda, cpu);
3719 mask = rdp->grpmask;
3720 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3721 rnp->qsmaskinitnext |= mask;
3722 oldmask = rnp->expmaskinitnext;
3723 rnp->expmaskinitnext |= mask;
3724 oldmask ^= rnp->expmaskinitnext;
3725 nbits = bitmap_weight(&oldmask, BITS_PER_LONG);
3726 /* Allow lockless access for expedited grace periods. */
3727 smp_store_release(&rsp->ncpus, rsp->ncpus + nbits); /* ^^^ */
3728 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3730 smp_mb(); /* Ensure RCU read-side usage follows above initialization. */
3733 #ifdef CONFIG_HOTPLUG_CPU
3735 * The CPU is exiting the idle loop into the arch_cpu_idle_dead()
3736 * function. We now remove it from the rcu_node tree's ->qsmaskinit
3739 static void rcu_cleanup_dying_idle_cpu(int cpu, struct rcu_state *rsp)
3741 unsigned long flags;
3743 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3744 struct rcu_node *rnp = rdp->mynode; /* Outgoing CPU's rdp & rnp. */
3746 /* Remove outgoing CPU from mask in the leaf rcu_node structure. */
3747 mask = rdp->grpmask;
3748 raw_spin_lock_irqsave_rcu_node(rnp, flags); /* Enforce GP memory-order guarantee. */
3749 rnp->qsmaskinitnext &= ~mask;
3750 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3754 * The outgoing function has no further need of RCU, so remove it from
3755 * the list of CPUs that RCU must track.
3757 * Note that this function is special in that it is invoked directly
3758 * from the outgoing CPU rather than from the cpuhp_step mechanism.
3759 * This is because this function must be invoked at a precise location.
3761 void rcu_report_dead(unsigned int cpu)
3763 struct rcu_state *rsp;
3765 /* QS for any half-done expedited RCU-sched GP. */
3767 rcu_report_exp_rdp(&rcu_sched_state,
3768 this_cpu_ptr(rcu_sched_state.rda), true);
3770 for_each_rcu_flavor(rsp)
3771 rcu_cleanup_dying_idle_cpu(cpu, rsp);
3773 per_cpu(rcu_cpu_started, cpu) = 0;
3776 /* Migrate the dead CPU's callbacks to the current CPU. */
3777 static void rcu_migrate_callbacks(int cpu, struct rcu_state *rsp)
3779 unsigned long flags;
3780 struct rcu_data *my_rdp;
3781 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3782 struct rcu_node *rnp_root = rcu_get_root(rdp->rsp);
3785 if (rcu_is_nocb_cpu(cpu) || rcu_segcblist_empty(&rdp->cblist))
3786 return; /* No callbacks to migrate. */
3788 local_irq_save(flags);
3789 my_rdp = this_cpu_ptr(rsp->rda);
3790 if (rcu_nocb_adopt_orphan_cbs(my_rdp, rdp, flags)) {
3791 local_irq_restore(flags);
3794 raw_spin_lock_rcu_node(rnp_root); /* irqs already disabled. */
3795 /* Leverage recent GPs and set GP for new callbacks. */
3796 needwake = rcu_advance_cbs(rsp, rnp_root, rdp) ||
3797 rcu_advance_cbs(rsp, rnp_root, my_rdp);
3798 rcu_segcblist_merge(&my_rdp->cblist, &rdp->cblist);
3799 WARN_ON_ONCE(rcu_segcblist_empty(&my_rdp->cblist) !=
3800 !rcu_segcblist_n_cbs(&my_rdp->cblist));
3801 raw_spin_unlock_irqrestore_rcu_node(rnp_root, flags);
3803 rcu_gp_kthread_wake(rsp);
3804 WARN_ONCE(rcu_segcblist_n_cbs(&rdp->cblist) != 0 ||
3805 !rcu_segcblist_empty(&rdp->cblist),
3806 "rcu_cleanup_dead_cpu: Callbacks on offline CPU %d: qlen=%lu, 1stCB=%p\n",
3807 cpu, rcu_segcblist_n_cbs(&rdp->cblist),
3808 rcu_segcblist_first_cb(&rdp->cblist));
3812 * The outgoing CPU has just passed through the dying-idle state,
3813 * and we are being invoked from the CPU that was IPIed to continue the
3814 * offline operation. We need to migrate the outgoing CPU's callbacks.
3816 void rcutree_migrate_callbacks(int cpu)
3818 struct rcu_state *rsp;
3820 for_each_rcu_flavor(rsp)
3821 rcu_migrate_callbacks(cpu, rsp);
3826 * On non-huge systems, use expedited RCU grace periods to make suspend
3827 * and hibernation run faster.
3829 static int rcu_pm_notify(struct notifier_block *self,
3830 unsigned long action, void *hcpu)
3833 case PM_HIBERNATION_PREPARE:
3834 case PM_SUSPEND_PREPARE:
3835 if (nr_cpu_ids <= 256) /* Expediting bad for large systems. */
3838 case PM_POST_HIBERNATION:
3839 case PM_POST_SUSPEND:
3840 if (nr_cpu_ids <= 256) /* Expediting bad for large systems. */
3841 rcu_unexpedite_gp();
3850 * Spawn the kthreads that handle each RCU flavor's grace periods.
3852 static int __init rcu_spawn_gp_kthread(void)
3854 unsigned long flags;
3855 int kthread_prio_in = kthread_prio;
3856 struct rcu_node *rnp;
3857 struct rcu_state *rsp;
3858 struct sched_param sp;
3859 struct task_struct *t;
3861 /* Force priority into range. */
3862 if (IS_ENABLED(CONFIG_RCU_BOOST) && kthread_prio < 1)
3864 else if (kthread_prio < 0)
3866 else if (kthread_prio > 99)
3868 if (kthread_prio != kthread_prio_in)
3869 pr_alert("rcu_spawn_gp_kthread(): Limited prio to %d from %d\n",
3870 kthread_prio, kthread_prio_in);
3872 rcu_scheduler_fully_active = 1;
3873 for_each_rcu_flavor(rsp) {
3874 t = kthread_create(rcu_gp_kthread, rsp, "%s", rsp->name);
3876 rnp = rcu_get_root(rsp);
3877 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3878 rsp->gp_kthread = t;
3880 sp.sched_priority = kthread_prio;
3881 sched_setscheduler_nocheck(t, SCHED_FIFO, &sp);
3883 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3886 rcu_spawn_nocb_kthreads();
3887 rcu_spawn_boost_kthreads();
3890 early_initcall(rcu_spawn_gp_kthread);
3893 * This function is invoked towards the end of the scheduler's
3894 * initialization process. Before this is called, the idle task might
3895 * contain synchronous grace-period primitives (during which time, this idle
3896 * task is booting the system, and such primitives are no-ops). After this
3897 * function is called, any synchronous grace-period primitives are run as
3898 * expedited, with the requesting task driving the grace period forward.
3899 * A later core_initcall() rcu_set_runtime_mode() will switch to full
3900 * runtime RCU functionality.
3902 void rcu_scheduler_starting(void)
3904 WARN_ON(num_online_cpus() != 1);
3905 WARN_ON(nr_context_switches() > 0);
3906 rcu_test_sync_prims();
3907 rcu_scheduler_active = RCU_SCHEDULER_INIT;
3908 rcu_test_sync_prims();
3912 * Helper function for rcu_init() that initializes one rcu_state structure.
3914 static void __init rcu_init_one(struct rcu_state *rsp)
3916 static const char * const buf[] = RCU_NODE_NAME_INIT;
3917 static const char * const fqs[] = RCU_FQS_NAME_INIT;
3918 static struct lock_class_key rcu_node_class[RCU_NUM_LVLS];
3919 static struct lock_class_key rcu_fqs_class[RCU_NUM_LVLS];
3921 int levelspread[RCU_NUM_LVLS]; /* kids/node in each level. */
3925 struct rcu_node *rnp;
3927 BUILD_BUG_ON(RCU_NUM_LVLS > ARRAY_SIZE(buf)); /* Fix buf[] init! */
3929 /* Silence gcc 4.8 false positive about array index out of range. */
3930 if (rcu_num_lvls <= 0 || rcu_num_lvls > RCU_NUM_LVLS)
3931 panic("rcu_init_one: rcu_num_lvls out of range");
3933 /* Initialize the level-tracking arrays. */
3935 for (i = 1; i < rcu_num_lvls; i++)
3936 rsp->level[i] = rsp->level[i - 1] + num_rcu_lvl[i - 1];
3937 rcu_init_levelspread(levelspread, num_rcu_lvl);
3939 /* Initialize the elements themselves, starting from the leaves. */
3941 for (i = rcu_num_lvls - 1; i >= 0; i--) {
3942 cpustride *= levelspread[i];
3943 rnp = rsp->level[i];
3944 for (j = 0; j < num_rcu_lvl[i]; j++, rnp++) {
3945 raw_spin_lock_init(&ACCESS_PRIVATE(rnp, lock));
3946 lockdep_set_class_and_name(&ACCESS_PRIVATE(rnp, lock),
3947 &rcu_node_class[i], buf[i]);
3948 raw_spin_lock_init(&rnp->fqslock);
3949 lockdep_set_class_and_name(&rnp->fqslock,
3950 &rcu_fqs_class[i], fqs[i]);
3951 rnp->gpnum = rsp->gpnum;
3952 rnp->completed = rsp->completed;
3953 rnp->gp_seq = rsp->gp_seq;
3954 rnp->completedqs = rsp->completed;
3956 rnp->qsmaskinit = 0;
3957 rnp->grplo = j * cpustride;
3958 rnp->grphi = (j + 1) * cpustride - 1;
3959 if (rnp->grphi >= nr_cpu_ids)
3960 rnp->grphi = nr_cpu_ids - 1;
3966 rnp->grpnum = j % levelspread[i - 1];
3967 rnp->grpmask = 1UL << rnp->grpnum;
3968 rnp->parent = rsp->level[i - 1] +
3969 j / levelspread[i - 1];
3972 INIT_LIST_HEAD(&rnp->blkd_tasks);
3973 rcu_init_one_nocb(rnp);
3974 init_waitqueue_head(&rnp->exp_wq[0]);
3975 init_waitqueue_head(&rnp->exp_wq[1]);
3976 init_waitqueue_head(&rnp->exp_wq[2]);
3977 init_waitqueue_head(&rnp->exp_wq[3]);
3978 spin_lock_init(&rnp->exp_lock);
3982 init_swait_queue_head(&rsp->gp_wq);
3983 init_swait_queue_head(&rsp->expedited_wq);
3984 rnp = rcu_first_leaf_node(rsp);
3985 for_each_possible_cpu(i) {
3986 while (i > rnp->grphi)
3988 per_cpu_ptr(rsp->rda, i)->mynode = rnp;
3989 rcu_boot_init_percpu_data(i, rsp);
3991 list_add(&rsp->flavors, &rcu_struct_flavors);
3995 * Compute the rcu_node tree geometry from kernel parameters. This cannot
3996 * replace the definitions in tree.h because those are needed to size
3997 * the ->node array in the rcu_state structure.
3999 static void __init rcu_init_geometry(void)
4003 int rcu_capacity[RCU_NUM_LVLS];
4006 * Initialize any unspecified boot parameters.
4007 * The default values of jiffies_till_first_fqs and
4008 * jiffies_till_next_fqs are set to the RCU_JIFFIES_TILL_FORCE_QS
4009 * value, which is a function of HZ, then adding one for each
4010 * RCU_JIFFIES_FQS_DIV CPUs that might be on the system.
4012 d = RCU_JIFFIES_TILL_FORCE_QS + nr_cpu_ids / RCU_JIFFIES_FQS_DIV;
4013 if (jiffies_till_first_fqs == ULONG_MAX)
4014 jiffies_till_first_fqs = d;
4015 if (jiffies_till_next_fqs == ULONG_MAX)
4016 jiffies_till_next_fqs = d;
4018 /* If the compile-time values are accurate, just leave. */
4019 if (rcu_fanout_leaf == RCU_FANOUT_LEAF &&
4020 nr_cpu_ids == NR_CPUS)
4022 pr_info("RCU: Adjusting geometry for rcu_fanout_leaf=%d, nr_cpu_ids=%u\n",
4023 rcu_fanout_leaf, nr_cpu_ids);
4026 * The boot-time rcu_fanout_leaf parameter must be at least two
4027 * and cannot exceed the number of bits in the rcu_node masks.
4028 * Complain and fall back to the compile-time values if this
4029 * limit is exceeded.
4031 if (rcu_fanout_leaf < 2 ||
4032 rcu_fanout_leaf > sizeof(unsigned long) * 8) {
4033 rcu_fanout_leaf = RCU_FANOUT_LEAF;
4039 * Compute number of nodes that can be handled an rcu_node tree
4040 * with the given number of levels.
4042 rcu_capacity[0] = rcu_fanout_leaf;
4043 for (i = 1; i < RCU_NUM_LVLS; i++)
4044 rcu_capacity[i] = rcu_capacity[i - 1] * RCU_FANOUT;
4047 * The tree must be able to accommodate the configured number of CPUs.
4048 * If this limit is exceeded, fall back to the compile-time values.
4050 if (nr_cpu_ids > rcu_capacity[RCU_NUM_LVLS - 1]) {
4051 rcu_fanout_leaf = RCU_FANOUT_LEAF;
4056 /* Calculate the number of levels in the tree. */
4057 for (i = 0; nr_cpu_ids > rcu_capacity[i]; i++) {
4059 rcu_num_lvls = i + 1;
4061 /* Calculate the number of rcu_nodes at each level of the tree. */
4062 for (i = 0; i < rcu_num_lvls; i++) {
4063 int cap = rcu_capacity[(rcu_num_lvls - 1) - i];
4064 num_rcu_lvl[i] = DIV_ROUND_UP(nr_cpu_ids, cap);
4067 /* Calculate the total number of rcu_node structures. */
4069 for (i = 0; i < rcu_num_lvls; i++)
4070 rcu_num_nodes += num_rcu_lvl[i];
4074 * Dump out the structure of the rcu_node combining tree associated
4075 * with the rcu_state structure referenced by rsp.
4077 static void __init rcu_dump_rcu_node_tree(struct rcu_state *rsp)
4080 struct rcu_node *rnp;
4082 pr_info("rcu_node tree layout dump\n");
4084 rcu_for_each_node_breadth_first(rsp, rnp) {
4085 if (rnp->level != level) {
4090 pr_cont("%d:%d ^%d ", rnp->grplo, rnp->grphi, rnp->grpnum);
4095 struct workqueue_struct *rcu_gp_wq;
4096 struct workqueue_struct *rcu_par_gp_wq;
4098 void __init rcu_init(void)
4102 rcu_early_boot_tests();
4104 rcu_bootup_announce();
4105 rcu_init_geometry();
4106 rcu_init_one(&rcu_bh_state);
4107 rcu_init_one(&rcu_sched_state);
4109 rcu_dump_rcu_node_tree(&rcu_sched_state);
4110 __rcu_init_preempt();
4111 open_softirq(RCU_SOFTIRQ, rcu_process_callbacks);
4114 * We don't need protection against CPU-hotplug here because
4115 * this is called early in boot, before either interrupts
4116 * or the scheduler are operational.
4118 pm_notifier(rcu_pm_notify, 0);
4119 for_each_online_cpu(cpu) {
4120 rcutree_prepare_cpu(cpu);
4121 rcu_cpu_starting(cpu);
4122 rcutree_online_cpu(cpu);
4125 /* Create workqueue for expedited GPs and for Tree SRCU. */
4126 rcu_gp_wq = alloc_workqueue("rcu_gp", WQ_MEM_RECLAIM, 0);
4127 WARN_ON(!rcu_gp_wq);
4128 rcu_par_gp_wq = alloc_workqueue("rcu_par_gp", WQ_MEM_RECLAIM, 0);
4129 WARN_ON(!rcu_par_gp_wq);
4132 #include "tree_exp.h"
4133 #include "tree_plugin.h"