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 .barrier_mutex = __MUTEX_INITIALIZER(sname##_state.barrier_mutex), \
101 .name = RCU_STATE_NAME(sname), \
103 .exp_mutex = __MUTEX_INITIALIZER(sname##_state.exp_mutex), \
104 .exp_wake_mutex = __MUTEX_INITIALIZER(sname##_state.exp_wake_mutex), \
107 RCU_STATE_INITIALIZER(rcu_sched, 's', call_rcu_sched);
108 RCU_STATE_INITIALIZER(rcu_bh, 'b', call_rcu_bh);
110 static struct rcu_state *const rcu_state_p;
111 LIST_HEAD(rcu_struct_flavors);
113 /* Dump rcu_node combining tree at boot to verify correct setup. */
114 static bool dump_tree;
115 module_param(dump_tree, bool, 0444);
116 /* Control rcu_node-tree auto-balancing at boot time. */
117 static bool rcu_fanout_exact;
118 module_param(rcu_fanout_exact, bool, 0444);
119 /* Increase (but not decrease) the RCU_FANOUT_LEAF at boot time. */
120 static int rcu_fanout_leaf = RCU_FANOUT_LEAF;
121 module_param(rcu_fanout_leaf, int, 0444);
122 int rcu_num_lvls __read_mostly = RCU_NUM_LVLS;
123 /* Number of rcu_nodes at specified level. */
124 int num_rcu_lvl[] = NUM_RCU_LVL_INIT;
125 int rcu_num_nodes __read_mostly = NUM_RCU_NODES; /* Total # rcu_nodes in use. */
126 /* panic() on RCU Stall sysctl. */
127 int sysctl_panic_on_rcu_stall __read_mostly;
130 * The rcu_scheduler_active variable is initialized to the value
131 * RCU_SCHEDULER_INACTIVE and transitions RCU_SCHEDULER_INIT just before the
132 * first task is spawned. So when this variable is RCU_SCHEDULER_INACTIVE,
133 * RCU can assume that there is but one task, allowing RCU to (for example)
134 * optimize synchronize_rcu() to a simple barrier(). When this variable
135 * is RCU_SCHEDULER_INIT, RCU must actually do all the hard work required
136 * to detect real grace periods. This variable is also used to suppress
137 * boot-time false positives from lockdep-RCU error checking. Finally, it
138 * transitions from RCU_SCHEDULER_INIT to RCU_SCHEDULER_RUNNING after RCU
139 * is fully initialized, including all of its kthreads having been spawned.
141 int rcu_scheduler_active __read_mostly;
142 EXPORT_SYMBOL_GPL(rcu_scheduler_active);
145 * The rcu_scheduler_fully_active variable transitions from zero to one
146 * during the early_initcall() processing, which is after the scheduler
147 * is capable of creating new tasks. So RCU processing (for example,
148 * creating tasks for RCU priority boosting) must be delayed until after
149 * rcu_scheduler_fully_active transitions from zero to one. We also
150 * currently delay invocation of any RCU callbacks until after this point.
152 * It might later prove better for people registering RCU callbacks during
153 * early boot to take responsibility for these callbacks, but one step at
156 static int rcu_scheduler_fully_active __read_mostly;
158 static void rcu_init_new_rnp(struct rcu_node *rnp_leaf);
159 static void rcu_cleanup_dead_rnp(struct rcu_node *rnp_leaf);
160 static void rcu_boost_kthread_setaffinity(struct rcu_node *rnp, int outgoingcpu);
161 static void invoke_rcu_core(void);
162 static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp);
163 static void rcu_report_exp_rdp(struct rcu_state *rsp,
164 struct rcu_data *rdp, bool wake);
165 static void sync_sched_exp_online_cleanup(int cpu);
167 /* rcuc/rcub kthread realtime priority */
168 static int kthread_prio = IS_ENABLED(CONFIG_RCU_BOOST) ? 1 : 0;
169 module_param(kthread_prio, int, 0644);
171 /* Delay in jiffies for grace-period initialization delays, debug only. */
173 static int gp_preinit_delay;
174 module_param(gp_preinit_delay, int, 0444);
175 static int gp_init_delay;
176 module_param(gp_init_delay, int, 0444);
177 static int gp_cleanup_delay;
178 module_param(gp_cleanup_delay, int, 0444);
181 * Number of grace periods between delays, normalized by the duration of
182 * the delay. The longer the delay, the more the grace periods between
183 * each delay. The reason for this normalization is that it means that,
184 * for non-zero delays, the overall slowdown of grace periods is constant
185 * regardless of the duration of the delay. This arrangement balances
186 * the need for long delays to increase some race probabilities with the
187 * need for fast grace periods to increase other race probabilities.
189 #define PER_RCU_NODE_PERIOD 3 /* Number of grace periods between delays. */
192 * Track the rcutorture test sequence number and the update version
193 * number within a given test. The rcutorture_testseq is incremented
194 * on every rcutorture module load and unload, so has an odd value
195 * when a test is running. The rcutorture_vernum is set to zero
196 * when rcutorture starts and is incremented on each rcutorture update.
197 * These variables enable correlating rcutorture output with the
198 * RCU tracing information.
200 unsigned long rcutorture_testseq;
201 unsigned long rcutorture_vernum;
204 * Compute the mask of online CPUs for the specified rcu_node structure.
205 * This will not be stable unless the rcu_node structure's ->lock is
206 * held, but the bit corresponding to the current CPU will be stable
209 unsigned long rcu_rnp_online_cpus(struct rcu_node *rnp)
211 return READ_ONCE(rnp->qsmaskinitnext);
215 * Return true if an RCU grace period is in progress. The READ_ONCE()s
216 * permit this function to be invoked without holding the root rcu_node
217 * structure's ->lock, but of course results can be subject to change.
219 static int rcu_gp_in_progress(struct rcu_state *rsp)
221 return READ_ONCE(rsp->completed) != READ_ONCE(rsp->gpnum);
225 * Note a quiescent state. Because we do not need to know
226 * how many quiescent states passed, just if there was at least
227 * one since the start of the grace period, this just sets a flag.
228 * The caller must have disabled preemption.
230 void rcu_sched_qs(void)
232 RCU_LOCKDEP_WARN(preemptible(), "rcu_sched_qs() invoked with preemption enabled!!!");
233 if (!__this_cpu_read(rcu_sched_data.cpu_no_qs.s))
235 trace_rcu_grace_period(TPS("rcu_sched"),
236 __this_cpu_read(rcu_sched_data.gpnum),
238 __this_cpu_write(rcu_sched_data.cpu_no_qs.b.norm, false);
239 if (!__this_cpu_read(rcu_sched_data.cpu_no_qs.b.exp))
241 __this_cpu_write(rcu_sched_data.cpu_no_qs.b.exp, false);
242 rcu_report_exp_rdp(&rcu_sched_state,
243 this_cpu_ptr(&rcu_sched_data), true);
248 RCU_LOCKDEP_WARN(preemptible(), "rcu_bh_qs() invoked with preemption enabled!!!");
249 if (__this_cpu_read(rcu_bh_data.cpu_no_qs.s)) {
250 trace_rcu_grace_period(TPS("rcu_bh"),
251 __this_cpu_read(rcu_bh_data.gpnum),
253 __this_cpu_write(rcu_bh_data.cpu_no_qs.b.norm, false);
258 * Steal a bit from the bottom of ->dynticks for idle entry/exit
259 * control. Initially this is for TLB flushing.
261 #define RCU_DYNTICK_CTRL_MASK 0x1
262 #define RCU_DYNTICK_CTRL_CTR (RCU_DYNTICK_CTRL_MASK + 1)
263 #ifndef rcu_eqs_special_exit
264 #define rcu_eqs_special_exit() do { } while (0)
267 static DEFINE_PER_CPU(struct rcu_dynticks, rcu_dynticks) = {
268 .dynticks_nesting = 1,
269 .dynticks_nmi_nesting = DYNTICK_IRQ_NONIDLE,
270 .dynticks = ATOMIC_INIT(RCU_DYNTICK_CTRL_CTR),
274 * Record entry into an extended quiescent state. This is only to be
275 * called when not already in an extended quiescent state.
277 static void rcu_dynticks_eqs_enter(void)
279 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
283 * CPUs seeing atomic_add_return() must see prior RCU read-side
284 * critical sections, and we also must force ordering with the
287 seq = atomic_add_return(RCU_DYNTICK_CTRL_CTR, &rdtp->dynticks);
288 /* Better be in an extended quiescent state! */
289 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
290 (seq & RCU_DYNTICK_CTRL_CTR));
291 /* Better not have special action (TLB flush) pending! */
292 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
293 (seq & RCU_DYNTICK_CTRL_MASK));
297 * Record exit from an extended quiescent state. This is only to be
298 * called from an extended quiescent state.
300 static void rcu_dynticks_eqs_exit(void)
302 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
306 * CPUs seeing atomic_add_return() must see prior idle sojourns,
307 * and we also must force ordering with the next RCU read-side
310 seq = atomic_add_return(RCU_DYNTICK_CTRL_CTR, &rdtp->dynticks);
311 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
312 !(seq & RCU_DYNTICK_CTRL_CTR));
313 if (seq & RCU_DYNTICK_CTRL_MASK) {
314 atomic_andnot(RCU_DYNTICK_CTRL_MASK, &rdtp->dynticks);
315 smp_mb__after_atomic(); /* _exit after clearing mask. */
316 /* Prefer duplicate flushes to losing a flush. */
317 rcu_eqs_special_exit();
322 * Reset the current CPU's ->dynticks counter to indicate that the
323 * newly onlined CPU is no longer in an extended quiescent state.
324 * This will either leave the counter unchanged, or increment it
325 * to the next non-quiescent value.
327 * The non-atomic test/increment sequence works because the upper bits
328 * of the ->dynticks counter are manipulated only by the corresponding CPU,
329 * or when the corresponding CPU is offline.
331 static void rcu_dynticks_eqs_online(void)
333 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
335 if (atomic_read(&rdtp->dynticks) & RCU_DYNTICK_CTRL_CTR)
337 atomic_add(RCU_DYNTICK_CTRL_CTR, &rdtp->dynticks);
341 * Is the current CPU in an extended quiescent state?
343 * No ordering, as we are sampling CPU-local information.
345 bool rcu_dynticks_curr_cpu_in_eqs(void)
347 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
349 return !(atomic_read(&rdtp->dynticks) & RCU_DYNTICK_CTRL_CTR);
353 * Snapshot the ->dynticks counter with full ordering so as to allow
354 * stable comparison of this counter with past and future snapshots.
356 int rcu_dynticks_snap(struct rcu_dynticks *rdtp)
358 int snap = atomic_add_return(0, &rdtp->dynticks);
360 return snap & ~RCU_DYNTICK_CTRL_MASK;
364 * Return true if the snapshot returned from rcu_dynticks_snap()
365 * indicates that RCU is in an extended quiescent state.
367 static bool rcu_dynticks_in_eqs(int snap)
369 return !(snap & RCU_DYNTICK_CTRL_CTR);
373 * Return true if the CPU corresponding to the specified rcu_dynticks
374 * structure has spent some time in an extended quiescent state since
375 * rcu_dynticks_snap() returned the specified snapshot.
377 static bool rcu_dynticks_in_eqs_since(struct rcu_dynticks *rdtp, int snap)
379 return snap != rcu_dynticks_snap(rdtp);
383 * Do a double-increment of the ->dynticks counter to emulate a
384 * momentary idle-CPU quiescent state.
386 static void rcu_dynticks_momentary_idle(void)
388 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
389 int special = atomic_add_return(2 * RCU_DYNTICK_CTRL_CTR,
392 /* It is illegal to call this from idle state. */
393 WARN_ON_ONCE(!(special & RCU_DYNTICK_CTRL_CTR));
397 * Set the special (bottom) bit of the specified CPU so that it
398 * will take special action (such as flushing its TLB) on the
399 * next exit from an extended quiescent state. Returns true if
400 * the bit was successfully set, or false if the CPU was not in
401 * an extended quiescent state.
403 bool rcu_eqs_special_set(int cpu)
407 struct rcu_dynticks *rdtp = &per_cpu(rcu_dynticks, cpu);
410 old = atomic_read(&rdtp->dynticks);
411 if (old & RCU_DYNTICK_CTRL_CTR)
413 new = old | RCU_DYNTICK_CTRL_MASK;
414 } while (atomic_cmpxchg(&rdtp->dynticks, old, new) != old);
419 * Let the RCU core know that this CPU has gone through the scheduler,
420 * which is a quiescent state. This is called when the need for a
421 * quiescent state is urgent, so we burn an atomic operation and full
422 * memory barriers to let the RCU core know about it, regardless of what
423 * this CPU might (or might not) do in the near future.
425 * We inform the RCU core by emulating a zero-duration dyntick-idle period.
427 * The caller must have disabled interrupts.
429 static void rcu_momentary_dyntick_idle(void)
431 raw_cpu_write(rcu_dynticks.rcu_need_heavy_qs, false);
432 rcu_dynticks_momentary_idle();
436 * Note a context switch. This is a quiescent state for RCU-sched,
437 * and requires special handling for preemptible RCU.
438 * The caller must have disabled interrupts.
440 void rcu_note_context_switch(bool preempt)
442 barrier(); /* Avoid RCU read-side critical sections leaking down. */
443 trace_rcu_utilization(TPS("Start context switch"));
445 rcu_preempt_note_context_switch(preempt);
446 /* Load rcu_urgent_qs before other flags. */
447 if (!smp_load_acquire(this_cpu_ptr(&rcu_dynticks.rcu_urgent_qs)))
449 this_cpu_write(rcu_dynticks.rcu_urgent_qs, false);
450 if (unlikely(raw_cpu_read(rcu_dynticks.rcu_need_heavy_qs)))
451 rcu_momentary_dyntick_idle();
452 this_cpu_inc(rcu_dynticks.rcu_qs_ctr);
454 rcu_note_voluntary_context_switch_lite(current);
456 trace_rcu_utilization(TPS("End context switch"));
457 barrier(); /* Avoid RCU read-side critical sections leaking up. */
459 EXPORT_SYMBOL_GPL(rcu_note_context_switch);
462 * Register a quiescent state for all RCU flavors. If there is an
463 * emergency, invoke rcu_momentary_dyntick_idle() to do a heavy-weight
464 * dyntick-idle quiescent state visible to other CPUs (but only for those
465 * RCU flavors in desperate need of a quiescent state, which will normally
466 * be none of them). Either way, do a lightweight quiescent state for
469 * The barrier() calls are redundant in the common case when this is
470 * called externally, but just in case this is called from within this
474 void rcu_all_qs(void)
478 if (!raw_cpu_read(rcu_dynticks.rcu_urgent_qs))
481 /* Load rcu_urgent_qs before other flags. */
482 if (!smp_load_acquire(this_cpu_ptr(&rcu_dynticks.rcu_urgent_qs))) {
486 this_cpu_write(rcu_dynticks.rcu_urgent_qs, false);
487 barrier(); /* Avoid RCU read-side critical sections leaking down. */
488 if (unlikely(raw_cpu_read(rcu_dynticks.rcu_need_heavy_qs))) {
489 local_irq_save(flags);
490 rcu_momentary_dyntick_idle();
491 local_irq_restore(flags);
493 if (unlikely(raw_cpu_read(rcu_sched_data.cpu_no_qs.b.exp)))
495 this_cpu_inc(rcu_dynticks.rcu_qs_ctr);
496 barrier(); /* Avoid RCU read-side critical sections leaking up. */
499 EXPORT_SYMBOL_GPL(rcu_all_qs);
501 #define DEFAULT_RCU_BLIMIT 10 /* Maximum callbacks per rcu_do_batch. */
502 static long blimit = DEFAULT_RCU_BLIMIT;
503 #define DEFAULT_RCU_QHIMARK 10000 /* If this many pending, ignore blimit. */
504 static long qhimark = DEFAULT_RCU_QHIMARK;
505 #define DEFAULT_RCU_QLOMARK 100 /* Once only this many pending, use blimit. */
506 static long qlowmark = DEFAULT_RCU_QLOMARK;
508 module_param(blimit, long, 0444);
509 module_param(qhimark, long, 0444);
510 module_param(qlowmark, long, 0444);
512 static ulong jiffies_till_first_fqs = ULONG_MAX;
513 static ulong jiffies_till_next_fqs = ULONG_MAX;
514 static bool rcu_kick_kthreads;
516 module_param(jiffies_till_first_fqs, ulong, 0644);
517 module_param(jiffies_till_next_fqs, ulong, 0644);
518 module_param(rcu_kick_kthreads, bool, 0644);
521 * How long the grace period must be before we start recruiting
522 * quiescent-state help from rcu_note_context_switch().
524 static ulong jiffies_till_sched_qs = HZ / 10;
525 module_param(jiffies_till_sched_qs, ulong, 0444);
527 static bool rcu_start_gp_advanced(struct rcu_state *rsp, struct rcu_node *rnp,
528 struct rcu_data *rdp);
529 static void force_qs_rnp(struct rcu_state *rsp, int (*f)(struct rcu_data *rsp));
530 static void force_quiescent_state(struct rcu_state *rsp);
531 static int rcu_pending(void);
534 * Return the number of RCU batches started thus far for debug & stats.
536 unsigned long rcu_batches_started(void)
538 return rcu_state_p->gpnum;
540 EXPORT_SYMBOL_GPL(rcu_batches_started);
543 * Return the number of RCU-sched batches started thus far for debug & stats.
545 unsigned long rcu_batches_started_sched(void)
547 return rcu_sched_state.gpnum;
549 EXPORT_SYMBOL_GPL(rcu_batches_started_sched);
552 * Return the number of RCU BH batches started thus far for debug & stats.
554 unsigned long rcu_batches_started_bh(void)
556 return rcu_bh_state.gpnum;
558 EXPORT_SYMBOL_GPL(rcu_batches_started_bh);
561 * Return the number of RCU batches completed thus far for debug & stats.
563 unsigned long rcu_batches_completed(void)
565 return rcu_state_p->completed;
567 EXPORT_SYMBOL_GPL(rcu_batches_completed);
570 * Return the number of RCU-sched batches completed thus far for debug & stats.
572 unsigned long rcu_batches_completed_sched(void)
574 return rcu_sched_state.completed;
576 EXPORT_SYMBOL_GPL(rcu_batches_completed_sched);
579 * Return the number of RCU BH batches completed thus far for debug & stats.
581 unsigned long rcu_batches_completed_bh(void)
583 return rcu_bh_state.completed;
585 EXPORT_SYMBOL_GPL(rcu_batches_completed_bh);
588 * Return the number of RCU expedited batches completed thus far for
589 * debug & stats. Odd numbers mean that a batch is in progress, even
590 * numbers mean idle. The value returned will thus be roughly double
591 * the cumulative batches since boot.
593 unsigned long rcu_exp_batches_completed(void)
595 return rcu_state_p->expedited_sequence;
597 EXPORT_SYMBOL_GPL(rcu_exp_batches_completed);
600 * Return the number of RCU-sched expedited batches completed thus far
601 * for debug & stats. Similar to rcu_exp_batches_completed().
603 unsigned long rcu_exp_batches_completed_sched(void)
605 return rcu_sched_state.expedited_sequence;
607 EXPORT_SYMBOL_GPL(rcu_exp_batches_completed_sched);
610 * Force a quiescent state.
612 void rcu_force_quiescent_state(void)
614 force_quiescent_state(rcu_state_p);
616 EXPORT_SYMBOL_GPL(rcu_force_quiescent_state);
619 * Force a quiescent state for RCU BH.
621 void rcu_bh_force_quiescent_state(void)
623 force_quiescent_state(&rcu_bh_state);
625 EXPORT_SYMBOL_GPL(rcu_bh_force_quiescent_state);
628 * Force a quiescent state for RCU-sched.
630 void rcu_sched_force_quiescent_state(void)
632 force_quiescent_state(&rcu_sched_state);
634 EXPORT_SYMBOL_GPL(rcu_sched_force_quiescent_state);
637 * Show the state of the grace-period kthreads.
639 void show_rcu_gp_kthreads(void)
641 struct rcu_state *rsp;
643 for_each_rcu_flavor(rsp) {
644 pr_info("%s: wait state: %d ->state: %#lx\n",
645 rsp->name, rsp->gp_state, rsp->gp_kthread->state);
646 /* sched_show_task(rsp->gp_kthread); */
649 EXPORT_SYMBOL_GPL(show_rcu_gp_kthreads);
652 * Record the number of times rcutorture tests have been initiated and
653 * terminated. This information allows the debugfs tracing stats to be
654 * correlated to the rcutorture messages, even when the rcutorture module
655 * is being repeatedly loaded and unloaded. In other words, we cannot
656 * store this state in rcutorture itself.
658 void rcutorture_record_test_transition(void)
660 rcutorture_testseq++;
661 rcutorture_vernum = 0;
663 EXPORT_SYMBOL_GPL(rcutorture_record_test_transition);
666 * Send along grace-period-related data for rcutorture diagnostics.
668 void rcutorture_get_gp_data(enum rcutorture_type test_type, int *flags,
669 unsigned long *gpnum, unsigned long *completed)
671 struct rcu_state *rsp = NULL;
680 case RCU_SCHED_FLAVOR:
681 rsp = &rcu_sched_state;
688 *flags = READ_ONCE(rsp->gp_flags);
689 *gpnum = READ_ONCE(rsp->gpnum);
690 *completed = READ_ONCE(rsp->completed);
692 EXPORT_SYMBOL_GPL(rcutorture_get_gp_data);
695 * Record the number of writer passes through the current rcutorture test.
696 * This is also used to correlate debugfs tracing stats with the rcutorture
699 void rcutorture_record_progress(unsigned long vernum)
703 EXPORT_SYMBOL_GPL(rcutorture_record_progress);
706 * Return the root node of the specified rcu_state structure.
708 static struct rcu_node *rcu_get_root(struct rcu_state *rsp)
710 return &rsp->node[0];
714 * Is there any need for future grace periods?
715 * Interrupts must be disabled. If the caller does not hold the root
716 * rnp_node structure's ->lock, the results are advisory only.
718 static int rcu_future_needs_gp(struct rcu_state *rsp)
720 struct rcu_node *rnp = rcu_get_root(rsp);
721 int idx = (READ_ONCE(rnp->completed) + 1) & 0x1;
722 int *fp = &rnp->need_future_gp[idx];
724 lockdep_assert_irqs_disabled();
725 return READ_ONCE(*fp);
729 * Does the current CPU require a not-yet-started grace period?
730 * The caller must have disabled interrupts to prevent races with
731 * normal callback registry.
734 cpu_needs_another_gp(struct rcu_state *rsp, struct rcu_data *rdp)
736 lockdep_assert_irqs_disabled();
737 if (rcu_gp_in_progress(rsp))
738 return false; /* No, a grace period is already in progress. */
739 if (rcu_future_needs_gp(rsp))
740 return true; /* Yes, a no-CBs CPU needs one. */
741 if (!rcu_segcblist_is_enabled(&rdp->cblist))
742 return false; /* No, this is a no-CBs (or offline) CPU. */
743 if (!rcu_segcblist_restempty(&rdp->cblist, RCU_NEXT_READY_TAIL))
744 return true; /* Yes, CPU has newly registered callbacks. */
745 if (rcu_segcblist_future_gp_needed(&rdp->cblist,
746 READ_ONCE(rsp->completed)))
747 return true; /* Yes, CBs for future grace period. */
748 return false; /* No grace period needed. */
752 * rcu_eqs_enter_common - current CPU is entering an extended quiescent state
754 * Enter idle, doing appropriate accounting. The caller must have
755 * disabled interrupts.
757 static void rcu_eqs_enter_common(bool user)
759 struct rcu_state *rsp;
760 struct rcu_data *rdp;
761 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
763 lockdep_assert_irqs_disabled();
764 trace_rcu_dyntick(TPS("Start"), rdtp->dynticks_nesting, 0, rdtp->dynticks);
765 if (IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
766 !user && !is_idle_task(current)) {
767 struct task_struct *idle __maybe_unused =
768 idle_task(smp_processor_id());
770 trace_rcu_dyntick(TPS("Error on entry: not idle task"), rdtp->dynticks_nesting, 0, rdtp->dynticks);
771 rcu_ftrace_dump(DUMP_ORIG);
772 WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s",
773 current->pid, current->comm,
774 idle->pid, idle->comm); /* must be idle task! */
776 for_each_rcu_flavor(rsp) {
777 rdp = this_cpu_ptr(rsp->rda);
778 do_nocb_deferred_wakeup(rdp);
780 rcu_prepare_for_idle();
781 rdtp->dynticks_nesting = 0;
782 rcu_dynticks_eqs_enter();
783 rcu_dynticks_task_enter();
786 * It is illegal to enter an extended quiescent state while
787 * in an RCU read-side critical section.
789 RCU_LOCKDEP_WARN(lock_is_held(&rcu_lock_map),
790 "Illegal idle entry in RCU read-side critical section.");
791 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map),
792 "Illegal idle entry in RCU-bh read-side critical section.");
793 RCU_LOCKDEP_WARN(lock_is_held(&rcu_sched_lock_map),
794 "Illegal idle entry in RCU-sched read-side critical section.");
798 * Enter an RCU extended quiescent state, which can be either the
799 * idle loop or adaptive-tickless usermode execution.
801 * We crowbar the ->dynticks_nmi_nesting field to zero to allow for
802 * the possibility of usermode upcalls having messed up our count
803 * of interrupt nesting level during the prior busy period.
805 static void rcu_eqs_enter(bool user)
807 struct rcu_dynticks *rdtp;
809 rdtp = this_cpu_ptr(&rcu_dynticks);
810 WRITE_ONCE(rdtp->dynticks_nmi_nesting, 0);
811 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
812 rdtp->dynticks_nesting == 0);
813 if (rdtp->dynticks_nesting == 1)
814 rcu_eqs_enter_common(user);
816 rdtp->dynticks_nesting--;
820 * rcu_idle_enter - inform RCU that current CPU is entering idle
822 * Enter idle mode, in other words, -leave- the mode in which RCU
823 * read-side critical sections can occur. (Though RCU read-side
824 * critical sections can occur in irq handlers in idle, a possibility
825 * handled by irq_enter() and irq_exit().)
827 * If you add or remove a call to rcu_idle_enter(), be sure to test with
828 * CONFIG_RCU_EQS_DEBUG=y.
830 void rcu_idle_enter(void)
832 lockdep_assert_irqs_disabled();
833 rcu_eqs_enter(false);
836 #ifdef CONFIG_NO_HZ_FULL
838 * rcu_user_enter - inform RCU that we are resuming userspace.
840 * Enter RCU idle mode right before resuming userspace. No use of RCU
841 * is permitted between this call and rcu_user_exit(). This way the
842 * CPU doesn't need to maintain the tick for RCU maintenance purposes
843 * when the CPU runs in userspace.
845 * If you add or remove a call to rcu_user_enter(), be sure to test with
846 * CONFIG_RCU_EQS_DEBUG=y.
848 void rcu_user_enter(void)
850 lockdep_assert_irqs_disabled();
853 #endif /* CONFIG_NO_HZ_FULL */
856 * rcu_nmi_exit - inform RCU of exit from NMI context
858 * If we are returning from the outermost NMI handler that interrupted an
859 * RCU-idle period, update rdtp->dynticks and rdtp->dynticks_nmi_nesting
860 * to let the RCU grace-period handling know that the CPU is back to
863 * If you add or remove a call to rcu_nmi_exit(), be sure to test
864 * with CONFIG_RCU_EQS_DEBUG=y.
866 void rcu_nmi_exit(void)
868 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
871 * Check for ->dynticks_nmi_nesting underflow and bad ->dynticks.
872 * (We are exiting an NMI handler, so RCU better be paying attention
875 WARN_ON_ONCE(rdtp->dynticks_nmi_nesting <= 0);
876 WARN_ON_ONCE(rcu_dynticks_curr_cpu_in_eqs());
879 * If the nesting level is not 1, the CPU wasn't RCU-idle, so
880 * leave it in non-RCU-idle state.
882 if (rdtp->dynticks_nmi_nesting != 1) {
883 trace_rcu_dyntick(TPS("--="), rdtp->dynticks_nmi_nesting, rdtp->dynticks_nmi_nesting - 2, rdtp->dynticks);
884 WRITE_ONCE(rdtp->dynticks_nmi_nesting, /* No store tearing. */
885 rdtp->dynticks_nmi_nesting - 2);
889 /* This NMI interrupted an RCU-idle CPU, restore RCU-idleness. */
890 trace_rcu_dyntick(TPS("Startirq"), rdtp->dynticks_nmi_nesting, 0, rdtp->dynticks);
891 WRITE_ONCE(rdtp->dynticks_nmi_nesting, 0); /* Avoid store tearing. */
892 rcu_dynticks_eqs_enter();
896 * rcu_irq_exit - inform RCU that current CPU is exiting irq towards idle
898 * Exit from an interrupt handler, which might possibly result in entering
899 * idle mode, in other words, leaving the mode in which read-side critical
900 * sections can occur. The caller must have disabled interrupts.
902 * This code assumes that the idle loop never does anything that might
903 * result in unbalanced calls to irq_enter() and irq_exit(). If your
904 * architecture's idle loop violates this assumption, RCU will give you what
905 * you deserve, good and hard. But very infrequently and irreproducibly.
907 * Use things like work queues to work around this limitation.
909 * You have been warned.
911 * If you add or remove a call to rcu_irq_exit(), be sure to test with
912 * CONFIG_RCU_EQS_DEBUG=y.
914 void rcu_irq_exit(void)
916 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
918 lockdep_assert_irqs_disabled();
919 if (rdtp->dynticks_nmi_nesting == 1)
920 rcu_prepare_for_idle();
922 if (rdtp->dynticks_nmi_nesting == 0)
923 rcu_dynticks_task_enter();
927 * Wrapper for rcu_irq_exit() where interrupts are enabled.
929 * If you add or remove a call to rcu_irq_exit_irqson(), be sure to test
930 * with CONFIG_RCU_EQS_DEBUG=y.
932 void rcu_irq_exit_irqson(void)
936 local_irq_save(flags);
938 local_irq_restore(flags);
942 * rcu_eqs_exit_common - current CPU moving away from extended quiescent state
944 * If the new value of the ->dynticks_nesting counter was previously zero,
945 * we really have exited idle, and must do the appropriate accounting.
946 * The caller must have disabled interrupts.
948 static void rcu_eqs_exit_common(long newval, int user)
950 RCU_TRACE(struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);)
952 rcu_dynticks_task_exit();
953 rcu_dynticks_eqs_exit();
954 rcu_cleanup_after_idle();
955 trace_rcu_dyntick(TPS("End"), rdtp->dynticks_nesting, newval, rdtp->dynticks);
956 if (IS_ENABLED(CONFIG_RCU_EQS_DEBUG) &&
957 !user && !is_idle_task(current)) {
958 struct task_struct *idle __maybe_unused =
959 idle_task(smp_processor_id());
961 trace_rcu_dyntick(TPS("Error on exit: not idle task"), rdtp->dynticks_nesting, newval, rdtp->dynticks);
962 rcu_ftrace_dump(DUMP_ORIG);
963 WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s",
964 current->pid, current->comm,
965 idle->pid, idle->comm); /* must be idle task! */
970 * Exit an RCU extended quiescent state, which can be either the
971 * idle loop or adaptive-tickless usermode execution.
973 * We crowbar the ->dynticks_nmi_nesting field to DYNTICK_IRQ_NONIDLE to
974 * allow for the possibility of usermode upcalls messing up our count of
975 * interrupt nesting level during the busy period that is just now starting.
977 static void rcu_eqs_exit(bool user)
979 struct rcu_dynticks *rdtp;
982 lockdep_assert_irqs_disabled();
983 rdtp = this_cpu_ptr(&rcu_dynticks);
984 oldval = rdtp->dynticks_nesting;
985 WARN_ON_ONCE(IS_ENABLED(CONFIG_RCU_EQS_DEBUG) && oldval < 0);
987 rdtp->dynticks_nesting++;
989 rcu_eqs_exit_common(1, user);
990 rdtp->dynticks_nesting = 1;
991 WRITE_ONCE(rdtp->dynticks_nmi_nesting, DYNTICK_IRQ_NONIDLE);
996 * rcu_idle_exit - inform RCU that current CPU is leaving idle
998 * Exit idle mode, in other words, -enter- the mode in which RCU
999 * read-side critical sections can occur.
1001 * If you add or remove a call to rcu_idle_exit(), be sure to test with
1002 * CONFIG_RCU_EQS_DEBUG=y.
1004 void rcu_idle_exit(void)
1006 unsigned long flags;
1008 local_irq_save(flags);
1009 rcu_eqs_exit(false);
1010 local_irq_restore(flags);
1013 #ifdef CONFIG_NO_HZ_FULL
1015 * rcu_user_exit - inform RCU that we are exiting userspace.
1017 * Exit RCU idle mode while entering the kernel because it can
1018 * run a RCU read side critical section anytime.
1020 * If you add or remove a call to rcu_user_exit(), be sure to test with
1021 * CONFIG_RCU_EQS_DEBUG=y.
1023 void rcu_user_exit(void)
1027 #endif /* CONFIG_NO_HZ_FULL */
1030 * rcu_nmi_enter - inform RCU of entry to NMI context
1032 * If the CPU was idle from RCU's viewpoint, update rdtp->dynticks and
1033 * rdtp->dynticks_nmi_nesting to let the RCU grace-period handling know
1034 * that the CPU is active. This implementation permits nested NMIs, as
1035 * long as the nesting level does not overflow an int. (You will probably
1036 * run out of stack space first.)
1038 * If you add or remove a call to rcu_nmi_enter(), be sure to test
1039 * with CONFIG_RCU_EQS_DEBUG=y.
1041 void rcu_nmi_enter(void)
1043 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
1046 /* Complain about underflow. */
1047 WARN_ON_ONCE(rdtp->dynticks_nmi_nesting < 0);
1050 * If idle from RCU viewpoint, atomically increment ->dynticks
1051 * to mark non-idle and increment ->dynticks_nmi_nesting by one.
1052 * Otherwise, increment ->dynticks_nmi_nesting by two. This means
1053 * if ->dynticks_nmi_nesting is equal to one, we are guaranteed
1054 * to be in the outermost NMI handler that interrupted an RCU-idle
1055 * period (observation due to Andy Lutomirski).
1057 if (rcu_dynticks_curr_cpu_in_eqs()) {
1058 rcu_dynticks_eqs_exit();
1061 trace_rcu_dyntick(incby == 1 ? TPS("Endirq") : TPS("++="),
1062 rdtp->dynticks_nmi_nesting,
1063 rdtp->dynticks_nmi_nesting + incby, rdtp->dynticks);
1064 WRITE_ONCE(rdtp->dynticks_nmi_nesting, /* Prevent store tearing. */
1065 rdtp->dynticks_nmi_nesting + incby);
1070 * rcu_irq_enter - inform RCU that current CPU is entering irq away from idle
1072 * Enter an interrupt handler, which might possibly result in exiting
1073 * idle mode, in other words, entering the mode in which read-side critical
1074 * sections can occur. The caller must have disabled interrupts.
1076 * Note that the Linux kernel is fully capable of entering an interrupt
1077 * handler that it never exits, for example when doing upcalls to user mode!
1078 * This code assumes that the idle loop never does upcalls to user mode.
1079 * If your architecture's idle loop does do upcalls to user mode (or does
1080 * anything else that results in unbalanced calls to the irq_enter() and
1081 * irq_exit() functions), RCU will give you what you deserve, good and hard.
1082 * But very infrequently and irreproducibly.
1084 * Use things like work queues to work around this limitation.
1086 * You have been warned.
1088 * If you add or remove a call to rcu_irq_enter(), be sure to test with
1089 * CONFIG_RCU_EQS_DEBUG=y.
1091 void rcu_irq_enter(void)
1093 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
1095 lockdep_assert_irqs_disabled();
1096 if (rdtp->dynticks_nmi_nesting == 0)
1097 rcu_dynticks_task_exit();
1099 if (rdtp->dynticks_nmi_nesting == 1)
1100 rcu_cleanup_after_idle();
1104 * Wrapper for rcu_irq_enter() where interrupts are enabled.
1106 * If you add or remove a call to rcu_irq_enter_irqson(), be sure to test
1107 * with CONFIG_RCU_EQS_DEBUG=y.
1109 void rcu_irq_enter_irqson(void)
1111 unsigned long flags;
1113 local_irq_save(flags);
1115 local_irq_restore(flags);
1119 * rcu_is_watching - see if RCU thinks that the current CPU is idle
1121 * Return true if RCU is watching the running CPU, which means that this
1122 * CPU can safely enter RCU read-side critical sections. In other words,
1123 * if the current CPU is in its idle loop and is neither in an interrupt
1124 * or NMI handler, return true.
1126 bool notrace rcu_is_watching(void)
1130 preempt_disable_notrace();
1131 ret = !rcu_dynticks_curr_cpu_in_eqs();
1132 preempt_enable_notrace();
1135 EXPORT_SYMBOL_GPL(rcu_is_watching);
1138 * If a holdout task is actually running, request an urgent quiescent
1139 * state from its CPU. This is unsynchronized, so migrations can cause
1140 * the request to go to the wrong CPU. Which is OK, all that will happen
1141 * is that the CPU's next context switch will be a bit slower and next
1142 * time around this task will generate another request.
1144 void rcu_request_urgent_qs_task(struct task_struct *t)
1151 return; /* This task is not running on that CPU. */
1152 smp_store_release(per_cpu_ptr(&rcu_dynticks.rcu_urgent_qs, cpu), true);
1155 #if defined(CONFIG_PROVE_RCU) && defined(CONFIG_HOTPLUG_CPU)
1158 * Is the current CPU online? Disable preemption to avoid false positives
1159 * that could otherwise happen due to the current CPU number being sampled,
1160 * this task being preempted, its old CPU being taken offline, resuming
1161 * on some other CPU, then determining that its old CPU is now offline.
1162 * It is OK to use RCU on an offline processor during initial boot, hence
1163 * the check for rcu_scheduler_fully_active. Note also that it is OK
1164 * for a CPU coming online to use RCU for one jiffy prior to marking itself
1165 * online in the cpu_online_mask. Similarly, it is OK for a CPU going
1166 * offline to continue to use RCU for one jiffy after marking itself
1167 * offline in the cpu_online_mask. This leniency is necessary given the
1168 * non-atomic nature of the online and offline processing, for example,
1169 * the fact that a CPU enters the scheduler after completing the teardown
1172 * This is also why RCU internally marks CPUs online during in the
1173 * preparation phase and offline after the CPU has been taken down.
1175 * Disable checking if in an NMI handler because we cannot safely report
1176 * errors from NMI handlers anyway.
1178 bool rcu_lockdep_current_cpu_online(void)
1180 struct rcu_data *rdp;
1181 struct rcu_node *rnp;
1187 rdp = this_cpu_ptr(&rcu_sched_data);
1189 ret = (rdp->grpmask & rcu_rnp_online_cpus(rnp)) ||
1190 !rcu_scheduler_fully_active;
1194 EXPORT_SYMBOL_GPL(rcu_lockdep_current_cpu_online);
1196 #endif /* #if defined(CONFIG_PROVE_RCU) && defined(CONFIG_HOTPLUG_CPU) */
1199 * rcu_is_cpu_rrupt_from_idle - see if idle or immediately interrupted from idle
1201 * If the current CPU is idle or running at a first-level (not nested)
1202 * interrupt from idle, return true. The caller must have at least
1203 * disabled preemption.
1205 static int rcu_is_cpu_rrupt_from_idle(void)
1207 return __this_cpu_read(rcu_dynticks.dynticks_nesting) <= 0 &&
1208 __this_cpu_read(rcu_dynticks.dynticks_nmi_nesting) <= 1;
1212 * We are reporting a quiescent state on behalf of some other CPU, so
1213 * it is our responsibility to check for and handle potential overflow
1214 * of the rcu_node ->gpnum counter with respect to the rcu_data counters.
1215 * After all, the CPU might be in deep idle state, and thus executing no
1218 static void rcu_gpnum_ovf(struct rcu_node *rnp, struct rcu_data *rdp)
1220 lockdep_assert_held(&rnp->lock);
1221 if (ULONG_CMP_LT(READ_ONCE(rdp->gpnum) + ULONG_MAX / 4, rnp->gpnum))
1222 WRITE_ONCE(rdp->gpwrap, true);
1223 if (ULONG_CMP_LT(rdp->rcu_iw_gpnum + ULONG_MAX / 4, rnp->gpnum))
1224 rdp->rcu_iw_gpnum = rnp->gpnum + ULONG_MAX / 4;
1228 * Snapshot the specified CPU's dynticks counter so that we can later
1229 * credit them with an implicit quiescent state. Return 1 if this CPU
1230 * is in dynticks idle mode, which is an extended quiescent state.
1232 static int dyntick_save_progress_counter(struct rcu_data *rdp)
1234 rdp->dynticks_snap = rcu_dynticks_snap(rdp->dynticks);
1235 if (rcu_dynticks_in_eqs(rdp->dynticks_snap)) {
1236 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("dti"));
1237 rcu_gpnum_ovf(rdp->mynode, rdp);
1244 * Handler for the irq_work request posted when a grace period has
1245 * gone on for too long, but not yet long enough for an RCU CPU
1246 * stall warning. Set state appropriately, but just complain if
1247 * there is unexpected state on entry.
1249 static void rcu_iw_handler(struct irq_work *iwp)
1251 struct rcu_data *rdp;
1252 struct rcu_node *rnp;
1254 rdp = container_of(iwp, struct rcu_data, rcu_iw);
1256 raw_spin_lock_rcu_node(rnp);
1257 if (!WARN_ON_ONCE(!rdp->rcu_iw_pending)) {
1258 rdp->rcu_iw_gpnum = rnp->gpnum;
1259 rdp->rcu_iw_pending = false;
1261 raw_spin_unlock_rcu_node(rnp);
1265 * Return true if the specified CPU has passed through a quiescent
1266 * state by virtue of being in or having passed through an dynticks
1267 * idle state since the last call to dyntick_save_progress_counter()
1268 * for this same CPU, or by virtue of having been offline.
1270 static int rcu_implicit_dynticks_qs(struct rcu_data *rdp)
1275 struct rcu_node *rnp = rdp->mynode;
1278 * If the CPU passed through or entered a dynticks idle phase with
1279 * no active irq/NMI handlers, then we can safely pretend that the CPU
1280 * already acknowledged the request to pass through a quiescent
1281 * state. Either way, that CPU cannot possibly be in an RCU
1282 * read-side critical section that started before the beginning
1283 * of the current RCU grace period.
1285 if (rcu_dynticks_in_eqs_since(rdp->dynticks, rdp->dynticks_snap)) {
1286 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("dti"));
1287 rdp->dynticks_fqs++;
1288 rcu_gpnum_ovf(rnp, rdp);
1293 * Has this CPU encountered a cond_resched_rcu_qs() since the
1294 * beginning of the grace period? For this to be the case,
1295 * the CPU has to have noticed the current grace period. This
1296 * might not be the case for nohz_full CPUs looping in the kernel.
1298 jtsq = jiffies_till_sched_qs;
1299 ruqp = per_cpu_ptr(&rcu_dynticks.rcu_urgent_qs, rdp->cpu);
1300 if (time_after(jiffies, rdp->rsp->gp_start + jtsq) &&
1301 READ_ONCE(rdp->rcu_qs_ctr_snap) != per_cpu(rcu_dynticks.rcu_qs_ctr, rdp->cpu) &&
1302 READ_ONCE(rdp->gpnum) == rnp->gpnum && !rdp->gpwrap) {
1303 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("rqc"));
1304 rcu_gpnum_ovf(rnp, rdp);
1306 } else if (time_after(jiffies, rdp->rsp->gp_start + jtsq)) {
1307 /* Load rcu_qs_ctr before store to rcu_urgent_qs. */
1308 smp_store_release(ruqp, true);
1311 /* Check for the CPU being offline. */
1312 if (!(rdp->grpmask & rcu_rnp_online_cpus(rnp))) {
1313 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("ofl"));
1315 rcu_gpnum_ovf(rnp, rdp);
1320 * A CPU running for an extended time within the kernel can
1321 * delay RCU grace periods. When the CPU is in NO_HZ_FULL mode,
1322 * even context-switching back and forth between a pair of
1323 * in-kernel CPU-bound tasks cannot advance grace periods.
1324 * So if the grace period is old enough, make the CPU pay attention.
1325 * Note that the unsynchronized assignments to the per-CPU
1326 * rcu_need_heavy_qs variable are safe. Yes, setting of
1327 * bits can be lost, but they will be set again on the next
1328 * force-quiescent-state pass. So lost bit sets do not result
1329 * in incorrect behavior, merely in a grace period lasting
1330 * a few jiffies longer than it might otherwise. Because
1331 * there are at most four threads involved, and because the
1332 * updates are only once every few jiffies, the probability of
1333 * lossage (and thus of slight grace-period extension) is
1336 rnhqp = &per_cpu(rcu_dynticks.rcu_need_heavy_qs, rdp->cpu);
1337 if (!READ_ONCE(*rnhqp) &&
1338 (time_after(jiffies, rdp->rsp->gp_start + jtsq) ||
1339 time_after(jiffies, rdp->rsp->jiffies_resched))) {
1340 WRITE_ONCE(*rnhqp, true);
1341 /* Store rcu_need_heavy_qs before rcu_urgent_qs. */
1342 smp_store_release(ruqp, true);
1343 rdp->rsp->jiffies_resched += jtsq; /* Re-enable beating. */
1347 * If more than halfway to RCU CPU stall-warning time, do a
1348 * resched_cpu() to try to loosen things up a bit. Also check to
1349 * see if the CPU is getting hammered with interrupts, but only
1350 * once per grace period, just to keep the IPIs down to a dull roar.
1352 if (jiffies - rdp->rsp->gp_start > rcu_jiffies_till_stall_check() / 2) {
1353 resched_cpu(rdp->cpu);
1354 if (IS_ENABLED(CONFIG_IRQ_WORK) &&
1355 !rdp->rcu_iw_pending && rdp->rcu_iw_gpnum != rnp->gpnum &&
1356 (rnp->ffmask & rdp->grpmask)) {
1357 init_irq_work(&rdp->rcu_iw, rcu_iw_handler);
1358 rdp->rcu_iw_pending = true;
1359 rdp->rcu_iw_gpnum = rnp->gpnum;
1360 irq_work_queue_on(&rdp->rcu_iw, rdp->cpu);
1367 static void record_gp_stall_check_time(struct rcu_state *rsp)
1369 unsigned long j = jiffies;
1373 smp_wmb(); /* Record start time before stall time. */
1374 j1 = rcu_jiffies_till_stall_check();
1375 WRITE_ONCE(rsp->jiffies_stall, j + j1);
1376 rsp->jiffies_resched = j + j1 / 2;
1377 rsp->n_force_qs_gpstart = READ_ONCE(rsp->n_force_qs);
1381 * Convert a ->gp_state value to a character string.
1383 static const char *gp_state_getname(short gs)
1385 if (gs < 0 || gs >= ARRAY_SIZE(gp_state_names))
1387 return gp_state_names[gs];
1391 * Complain about starvation of grace-period kthread.
1393 static void rcu_check_gp_kthread_starvation(struct rcu_state *rsp)
1399 gpa = READ_ONCE(rsp->gp_activity);
1400 if (j - gpa > 2 * HZ) {
1401 pr_err("%s kthread starved for %ld jiffies! g%lu c%lu f%#x %s(%d) ->state=%#lx ->cpu=%d\n",
1403 rsp->gpnum, rsp->completed,
1405 gp_state_getname(rsp->gp_state), rsp->gp_state,
1406 rsp->gp_kthread ? rsp->gp_kthread->state : ~0,
1407 rsp->gp_kthread ? task_cpu(rsp->gp_kthread) : -1);
1408 if (rsp->gp_kthread) {
1409 sched_show_task(rsp->gp_kthread);
1410 wake_up_process(rsp->gp_kthread);
1416 * Dump stacks of all tasks running on stalled CPUs. First try using
1417 * NMIs, but fall back to manual remote stack tracing on architectures
1418 * that don't support NMI-based stack dumps. The NMI-triggered stack
1419 * traces are more accurate because they are printed by the target CPU.
1421 static void rcu_dump_cpu_stacks(struct rcu_state *rsp)
1424 unsigned long flags;
1425 struct rcu_node *rnp;
1427 rcu_for_each_leaf_node(rsp, rnp) {
1428 raw_spin_lock_irqsave_rcu_node(rnp, flags);
1429 for_each_leaf_node_possible_cpu(rnp, cpu)
1430 if (rnp->qsmask & leaf_node_cpu_bit(rnp, cpu))
1431 if (!trigger_single_cpu_backtrace(cpu))
1433 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1438 * If too much time has passed in the current grace period, and if
1439 * so configured, go kick the relevant kthreads.
1441 static void rcu_stall_kick_kthreads(struct rcu_state *rsp)
1445 if (!rcu_kick_kthreads)
1447 j = READ_ONCE(rsp->jiffies_kick_kthreads);
1448 if (time_after(jiffies, j) && rsp->gp_kthread &&
1449 (rcu_gp_in_progress(rsp) || READ_ONCE(rsp->gp_flags))) {
1450 WARN_ONCE(1, "Kicking %s grace-period kthread\n", rsp->name);
1451 rcu_ftrace_dump(DUMP_ALL);
1452 wake_up_process(rsp->gp_kthread);
1453 WRITE_ONCE(rsp->jiffies_kick_kthreads, j + HZ);
1457 static inline void panic_on_rcu_stall(void)
1459 if (sysctl_panic_on_rcu_stall)
1460 panic("RCU Stall\n");
1463 static void print_other_cpu_stall(struct rcu_state *rsp, unsigned long gpnum)
1467 unsigned long flags;
1471 struct rcu_node *rnp = rcu_get_root(rsp);
1474 /* Kick and suppress, if so configured. */
1475 rcu_stall_kick_kthreads(rsp);
1476 if (rcu_cpu_stall_suppress)
1479 /* Only let one CPU complain about others per time interval. */
1481 raw_spin_lock_irqsave_rcu_node(rnp, flags);
1482 delta = jiffies - READ_ONCE(rsp->jiffies_stall);
1483 if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) {
1484 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1487 WRITE_ONCE(rsp->jiffies_stall,
1488 jiffies + 3 * rcu_jiffies_till_stall_check() + 3);
1489 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1492 * OK, time to rat on our buddy...
1493 * See Documentation/RCU/stallwarn.txt for info on how to debug
1494 * RCU CPU stall warnings.
1496 pr_err("INFO: %s detected stalls on CPUs/tasks:",
1498 print_cpu_stall_info_begin();
1499 rcu_for_each_leaf_node(rsp, rnp) {
1500 raw_spin_lock_irqsave_rcu_node(rnp, flags);
1501 ndetected += rcu_print_task_stall(rnp);
1502 if (rnp->qsmask != 0) {
1503 for_each_leaf_node_possible_cpu(rnp, cpu)
1504 if (rnp->qsmask & leaf_node_cpu_bit(rnp, cpu)) {
1505 print_cpu_stall_info(rsp, cpu);
1509 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1512 print_cpu_stall_info_end();
1513 for_each_possible_cpu(cpu)
1514 totqlen += rcu_segcblist_n_cbs(&per_cpu_ptr(rsp->rda,
1516 pr_cont("(detected by %d, t=%ld jiffies, g=%ld, c=%ld, q=%lu)\n",
1517 smp_processor_id(), (long)(jiffies - rsp->gp_start),
1518 (long)rsp->gpnum, (long)rsp->completed, totqlen);
1520 rcu_dump_cpu_stacks(rsp);
1522 /* Complain about tasks blocking the grace period. */
1523 rcu_print_detail_task_stall(rsp);
1525 if (READ_ONCE(rsp->gpnum) != gpnum ||
1526 READ_ONCE(rsp->completed) == gpnum) {
1527 pr_err("INFO: Stall ended before state dump start\n");
1530 gpa = READ_ONCE(rsp->gp_activity);
1531 pr_err("All QSes seen, last %s kthread activity %ld (%ld-%ld), jiffies_till_next_fqs=%ld, root ->qsmask %#lx\n",
1532 rsp->name, j - gpa, j, gpa,
1533 jiffies_till_next_fqs,
1534 rcu_get_root(rsp)->qsmask);
1535 /* In this case, the current CPU might be at fault. */
1536 sched_show_task(current);
1540 rcu_check_gp_kthread_starvation(rsp);
1542 panic_on_rcu_stall();
1544 force_quiescent_state(rsp); /* Kick them all. */
1547 static void print_cpu_stall(struct rcu_state *rsp)
1550 unsigned long flags;
1551 struct rcu_data *rdp = this_cpu_ptr(rsp->rda);
1552 struct rcu_node *rnp = rcu_get_root(rsp);
1555 /* Kick and suppress, if so configured. */
1556 rcu_stall_kick_kthreads(rsp);
1557 if (rcu_cpu_stall_suppress)
1561 * OK, time to rat on ourselves...
1562 * See Documentation/RCU/stallwarn.txt for info on how to debug
1563 * RCU CPU stall warnings.
1565 pr_err("INFO: %s self-detected stall on CPU", rsp->name);
1566 print_cpu_stall_info_begin();
1567 raw_spin_lock_irqsave_rcu_node(rdp->mynode, flags);
1568 print_cpu_stall_info(rsp, smp_processor_id());
1569 raw_spin_unlock_irqrestore_rcu_node(rdp->mynode, flags);
1570 print_cpu_stall_info_end();
1571 for_each_possible_cpu(cpu)
1572 totqlen += rcu_segcblist_n_cbs(&per_cpu_ptr(rsp->rda,
1574 pr_cont(" (t=%lu jiffies g=%ld c=%ld q=%lu)\n",
1575 jiffies - rsp->gp_start,
1576 (long)rsp->gpnum, (long)rsp->completed, totqlen);
1578 rcu_check_gp_kthread_starvation(rsp);
1580 rcu_dump_cpu_stacks(rsp);
1582 raw_spin_lock_irqsave_rcu_node(rnp, flags);
1583 if (ULONG_CMP_GE(jiffies, READ_ONCE(rsp->jiffies_stall)))
1584 WRITE_ONCE(rsp->jiffies_stall,
1585 jiffies + 3 * rcu_jiffies_till_stall_check() + 3);
1586 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1588 panic_on_rcu_stall();
1591 * Attempt to revive the RCU machinery by forcing a context switch.
1593 * A context switch would normally allow the RCU state machine to make
1594 * progress and it could be we're stuck in kernel space without context
1595 * switches for an entirely unreasonable amount of time.
1597 resched_cpu(smp_processor_id());
1600 static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp)
1602 unsigned long completed;
1603 unsigned long gpnum;
1607 struct rcu_node *rnp;
1609 if ((rcu_cpu_stall_suppress && !rcu_kick_kthreads) ||
1610 !rcu_gp_in_progress(rsp))
1612 rcu_stall_kick_kthreads(rsp);
1616 * Lots of memory barriers to reject false positives.
1618 * The idea is to pick up rsp->gpnum, then rsp->jiffies_stall,
1619 * then rsp->gp_start, and finally rsp->completed. These values
1620 * are updated in the opposite order with memory barriers (or
1621 * equivalent) during grace-period initialization and cleanup.
1622 * Now, a false positive can occur if we get an new value of
1623 * rsp->gp_start and a old value of rsp->jiffies_stall. But given
1624 * the memory barriers, the only way that this can happen is if one
1625 * grace period ends and another starts between these two fetches.
1626 * Detect this by comparing rsp->completed with the previous fetch
1629 * Given this check, comparisons of jiffies, rsp->jiffies_stall,
1630 * and rsp->gp_start suffice to forestall false positives.
1632 gpnum = READ_ONCE(rsp->gpnum);
1633 smp_rmb(); /* Pick up ->gpnum first... */
1634 js = READ_ONCE(rsp->jiffies_stall);
1635 smp_rmb(); /* ...then ->jiffies_stall before the rest... */
1636 gps = READ_ONCE(rsp->gp_start);
1637 smp_rmb(); /* ...and finally ->gp_start before ->completed. */
1638 completed = READ_ONCE(rsp->completed);
1639 if (ULONG_CMP_GE(completed, gpnum) ||
1640 ULONG_CMP_LT(j, js) ||
1641 ULONG_CMP_GE(gps, js))
1642 return; /* No stall or GP completed since entering function. */
1644 if (rcu_gp_in_progress(rsp) &&
1645 (READ_ONCE(rnp->qsmask) & rdp->grpmask)) {
1647 /* We haven't checked in, so go dump stack. */
1648 print_cpu_stall(rsp);
1650 } else if (rcu_gp_in_progress(rsp) &&
1651 ULONG_CMP_GE(j, js + RCU_STALL_RAT_DELAY)) {
1653 /* They had a few time units to dump stack, so complain. */
1654 print_other_cpu_stall(rsp, gpnum);
1659 * rcu_cpu_stall_reset - prevent further stall warnings in current grace period
1661 * Set the stall-warning timeout way off into the future, thus preventing
1662 * any RCU CPU stall-warning messages from appearing in the current set of
1663 * RCU grace periods.
1665 * The caller must disable hard irqs.
1667 void rcu_cpu_stall_reset(void)
1669 struct rcu_state *rsp;
1671 for_each_rcu_flavor(rsp)
1672 WRITE_ONCE(rsp->jiffies_stall, jiffies + ULONG_MAX / 2);
1676 * Determine the value that ->completed will have at the end of the
1677 * next subsequent grace period. This is used to tag callbacks so that
1678 * a CPU can invoke callbacks in a timely fashion even if that CPU has
1679 * been dyntick-idle for an extended period with callbacks under the
1680 * influence of RCU_FAST_NO_HZ.
1682 * The caller must hold rnp->lock with interrupts disabled.
1684 static unsigned long rcu_cbs_completed(struct rcu_state *rsp,
1685 struct rcu_node *rnp)
1687 lockdep_assert_held(&rnp->lock);
1690 * If RCU is idle, we just wait for the next grace period.
1691 * But we can only be sure that RCU is idle if we are looking
1692 * at the root rcu_node structure -- otherwise, a new grace
1693 * period might have started, but just not yet gotten around
1694 * to initializing the current non-root rcu_node structure.
1696 if (rcu_get_root(rsp) == rnp && rnp->gpnum == rnp->completed)
1697 return rnp->completed + 1;
1700 * Otherwise, wait for a possible partial grace period and
1701 * then the subsequent full grace period.
1703 return rnp->completed + 2;
1707 * Trace-event helper function for rcu_start_future_gp() and
1708 * rcu_nocb_wait_gp().
1710 static void trace_rcu_future_gp(struct rcu_node *rnp, struct rcu_data *rdp,
1711 unsigned long c, const char *s)
1713 trace_rcu_future_grace_period(rdp->rsp->name, rnp->gpnum,
1714 rnp->completed, c, rnp->level,
1715 rnp->grplo, rnp->grphi, s);
1719 * Start some future grace period, as needed to handle newly arrived
1720 * callbacks. The required future grace periods are recorded in each
1721 * rcu_node structure's ->need_future_gp field. Returns true if there
1722 * is reason to awaken the grace-period kthread.
1724 * The caller must hold the specified rcu_node structure's ->lock.
1726 static bool __maybe_unused
1727 rcu_start_future_gp(struct rcu_node *rnp, struct rcu_data *rdp,
1728 unsigned long *c_out)
1732 struct rcu_node *rnp_root = rcu_get_root(rdp->rsp);
1734 lockdep_assert_held(&rnp->lock);
1737 * Pick up grace-period number for new callbacks. If this
1738 * grace period is already marked as needed, return to the caller.
1740 c = rcu_cbs_completed(rdp->rsp, rnp);
1741 trace_rcu_future_gp(rnp, rdp, c, TPS("Startleaf"));
1742 if (rnp->need_future_gp[c & 0x1]) {
1743 trace_rcu_future_gp(rnp, rdp, c, TPS("Prestartleaf"));
1748 * If either this rcu_node structure or the root rcu_node structure
1749 * believe that a grace period is in progress, then we must wait
1750 * for the one following, which is in "c". Because our request
1751 * will be noticed at the end of the current grace period, we don't
1752 * need to explicitly start one. We only do the lockless check
1753 * of rnp_root's fields if the current rcu_node structure thinks
1754 * there is no grace period in flight, and because we hold rnp->lock,
1755 * the only possible change is when rnp_root's two fields are
1756 * equal, in which case rnp_root->gpnum might be concurrently
1757 * incremented. But that is OK, as it will just result in our
1758 * doing some extra useless work.
1760 if (rnp->gpnum != rnp->completed ||
1761 READ_ONCE(rnp_root->gpnum) != READ_ONCE(rnp_root->completed)) {
1762 rnp->need_future_gp[c & 0x1]++;
1763 trace_rcu_future_gp(rnp, rdp, c, TPS("Startedleaf"));
1768 * There might be no grace period in progress. If we don't already
1769 * hold it, acquire the root rcu_node structure's lock in order to
1770 * start one (if needed).
1772 if (rnp != rnp_root)
1773 raw_spin_lock_rcu_node(rnp_root);
1776 * Get a new grace-period number. If there really is no grace
1777 * period in progress, it will be smaller than the one we obtained
1778 * earlier. Adjust callbacks as needed.
1780 c = rcu_cbs_completed(rdp->rsp, rnp_root);
1781 if (!rcu_is_nocb_cpu(rdp->cpu))
1782 (void)rcu_segcblist_accelerate(&rdp->cblist, c);
1785 * If the needed for the required grace period is already
1786 * recorded, trace and leave.
1788 if (rnp_root->need_future_gp[c & 0x1]) {
1789 trace_rcu_future_gp(rnp, rdp, c, TPS("Prestartedroot"));
1793 /* Record the need for the future grace period. */
1794 rnp_root->need_future_gp[c & 0x1]++;
1796 /* If a grace period is not already in progress, start one. */
1797 if (rnp_root->gpnum != rnp_root->completed) {
1798 trace_rcu_future_gp(rnp, rdp, c, TPS("Startedleafroot"));
1800 trace_rcu_future_gp(rnp, rdp, c, TPS("Startedroot"));
1801 ret = rcu_start_gp_advanced(rdp->rsp, rnp_root, rdp);
1804 if (rnp != rnp_root)
1805 raw_spin_unlock_rcu_node(rnp_root);
1813 * Clean up any old requests for the just-ended grace period. Also return
1814 * whether any additional grace periods have been requested.
1816 static int rcu_future_gp_cleanup(struct rcu_state *rsp, struct rcu_node *rnp)
1818 int c = rnp->completed;
1820 struct rcu_data *rdp = this_cpu_ptr(rsp->rda);
1822 rnp->need_future_gp[c & 0x1] = 0;
1823 needmore = rnp->need_future_gp[(c + 1) & 0x1];
1824 trace_rcu_future_gp(rnp, rdp, c,
1825 needmore ? TPS("CleanupMore") : TPS("Cleanup"));
1830 * Awaken the grace-period kthread for the specified flavor of RCU.
1831 * Don't do a self-awaken, and don't bother awakening when there is
1832 * nothing for the grace-period kthread to do (as in several CPUs
1833 * raced to awaken, and we lost), and finally don't try to awaken
1834 * a kthread that has not yet been created.
1836 static void rcu_gp_kthread_wake(struct rcu_state *rsp)
1838 if (current == rsp->gp_kthread ||
1839 !READ_ONCE(rsp->gp_flags) ||
1842 swake_up(&rsp->gp_wq);
1846 * If there is room, assign a ->completed number to any callbacks on
1847 * this CPU that have not already been assigned. Also accelerate any
1848 * callbacks that were previously assigned a ->completed number that has
1849 * since proven to be too conservative, which can happen if callbacks get
1850 * assigned a ->completed number while RCU is idle, but with reference to
1851 * a non-root rcu_node structure. This function is idempotent, so it does
1852 * not hurt to call it repeatedly. Returns an flag saying that we should
1853 * awaken the RCU grace-period kthread.
1855 * The caller must hold rnp->lock with interrupts disabled.
1857 static bool rcu_accelerate_cbs(struct rcu_state *rsp, struct rcu_node *rnp,
1858 struct rcu_data *rdp)
1862 lockdep_assert_held(&rnp->lock);
1864 /* If no pending (not yet ready to invoke) callbacks, nothing to do. */
1865 if (!rcu_segcblist_pend_cbs(&rdp->cblist))
1869 * Callbacks are often registered with incomplete grace-period
1870 * information. Something about the fact that getting exact
1871 * information requires acquiring a global lock... RCU therefore
1872 * makes a conservative estimate of the grace period number at which
1873 * a given callback will become ready to invoke. The following
1874 * code checks this estimate and improves it when possible, thus
1875 * accelerating callback invocation to an earlier grace-period
1878 if (rcu_segcblist_accelerate(&rdp->cblist, rcu_cbs_completed(rsp, rnp)))
1879 ret = rcu_start_future_gp(rnp, rdp, NULL);
1881 /* Trace depending on how much we were able to accelerate. */
1882 if (rcu_segcblist_restempty(&rdp->cblist, RCU_WAIT_TAIL))
1883 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("AccWaitCB"));
1885 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("AccReadyCB"));
1890 * Move any callbacks whose grace period has completed to the
1891 * RCU_DONE_TAIL sublist, then compact the remaining sublists and
1892 * assign ->completed numbers to any callbacks in the RCU_NEXT_TAIL
1893 * sublist. This function is idempotent, so it does not hurt to
1894 * invoke it repeatedly. As long as it is not invoked -too- often...
1895 * Returns true if the RCU grace-period kthread needs to be awakened.
1897 * The caller must hold rnp->lock with interrupts disabled.
1899 static bool rcu_advance_cbs(struct rcu_state *rsp, struct rcu_node *rnp,
1900 struct rcu_data *rdp)
1902 lockdep_assert_held(&rnp->lock);
1904 /* If no pending (not yet ready to invoke) callbacks, nothing to do. */
1905 if (!rcu_segcblist_pend_cbs(&rdp->cblist))
1909 * Find all callbacks whose ->completed numbers indicate that they
1910 * are ready to invoke, and put them into the RCU_DONE_TAIL sublist.
1912 rcu_segcblist_advance(&rdp->cblist, rnp->completed);
1914 /* Classify any remaining callbacks. */
1915 return rcu_accelerate_cbs(rsp, rnp, rdp);
1919 * Update CPU-local rcu_data state to record the beginnings and ends of
1920 * grace periods. The caller must hold the ->lock of the leaf rcu_node
1921 * structure corresponding to the current CPU, and must have irqs disabled.
1922 * Returns true if the grace-period kthread needs to be awakened.
1924 static bool __note_gp_changes(struct rcu_state *rsp, struct rcu_node *rnp,
1925 struct rcu_data *rdp)
1930 lockdep_assert_held(&rnp->lock);
1932 /* Handle the ends of any preceding grace periods first. */
1933 if (rdp->completed == rnp->completed &&
1934 !unlikely(READ_ONCE(rdp->gpwrap))) {
1936 /* No grace period end, so just accelerate recent callbacks. */
1937 ret = rcu_accelerate_cbs(rsp, rnp, rdp);
1941 /* Advance callbacks. */
1942 ret = rcu_advance_cbs(rsp, rnp, rdp);
1944 /* Remember that we saw this grace-period completion. */
1945 rdp->completed = rnp->completed;
1946 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpuend"));
1949 if (rdp->gpnum != rnp->gpnum || unlikely(READ_ONCE(rdp->gpwrap))) {
1951 * If the current grace period is waiting for this CPU,
1952 * set up to detect a quiescent state, otherwise don't
1953 * go looking for one.
1955 rdp->gpnum = rnp->gpnum;
1956 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpustart"));
1957 need_gp = !!(rnp->qsmask & rdp->grpmask);
1958 rdp->cpu_no_qs.b.norm = need_gp;
1959 rdp->rcu_qs_ctr_snap = __this_cpu_read(rcu_dynticks.rcu_qs_ctr);
1960 rdp->core_needs_qs = need_gp;
1961 zero_cpu_stall_ticks(rdp);
1962 WRITE_ONCE(rdp->gpwrap, false);
1963 rcu_gpnum_ovf(rnp, rdp);
1968 static void note_gp_changes(struct rcu_state *rsp, struct rcu_data *rdp)
1970 unsigned long flags;
1972 struct rcu_node *rnp;
1974 local_irq_save(flags);
1976 if ((rdp->gpnum == READ_ONCE(rnp->gpnum) &&
1977 rdp->completed == READ_ONCE(rnp->completed) &&
1978 !unlikely(READ_ONCE(rdp->gpwrap))) || /* w/out lock. */
1979 !raw_spin_trylock_rcu_node(rnp)) { /* irqs already off, so later. */
1980 local_irq_restore(flags);
1983 needwake = __note_gp_changes(rsp, rnp, rdp);
1984 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
1986 rcu_gp_kthread_wake(rsp);
1989 static void rcu_gp_slow(struct rcu_state *rsp, int delay)
1992 !(rsp->gpnum % (rcu_num_nodes * PER_RCU_NODE_PERIOD * delay)))
1993 schedule_timeout_uninterruptible(delay);
1997 * Initialize a new grace period. Return false if no grace period required.
1999 static bool rcu_gp_init(struct rcu_state *rsp)
2001 unsigned long oldmask;
2002 struct rcu_data *rdp;
2003 struct rcu_node *rnp = rcu_get_root(rsp);
2005 WRITE_ONCE(rsp->gp_activity, jiffies);
2006 raw_spin_lock_irq_rcu_node(rnp);
2007 if (!READ_ONCE(rsp->gp_flags)) {
2008 /* Spurious wakeup, tell caller to go back to sleep. */
2009 raw_spin_unlock_irq_rcu_node(rnp);
2012 WRITE_ONCE(rsp->gp_flags, 0); /* Clear all flags: New grace period. */
2014 if (WARN_ON_ONCE(rcu_gp_in_progress(rsp))) {
2016 * Grace period already in progress, don't start another.
2017 * Not supposed to be able to happen.
2019 raw_spin_unlock_irq_rcu_node(rnp);
2023 /* Advance to a new grace period and initialize state. */
2024 record_gp_stall_check_time(rsp);
2025 /* Record GP times before starting GP, hence smp_store_release(). */
2026 smp_store_release(&rsp->gpnum, rsp->gpnum + 1);
2027 trace_rcu_grace_period(rsp->name, rsp->gpnum, TPS("start"));
2028 raw_spin_unlock_irq_rcu_node(rnp);
2031 * Apply per-leaf buffered online and offline operations to the
2032 * rcu_node tree. Note that this new grace period need not wait
2033 * for subsequent online CPUs, and that quiescent-state forcing
2034 * will handle subsequent offline CPUs.
2036 rcu_for_each_leaf_node(rsp, rnp) {
2037 rcu_gp_slow(rsp, gp_preinit_delay);
2038 raw_spin_lock_irq_rcu_node(rnp);
2039 if (rnp->qsmaskinit == rnp->qsmaskinitnext &&
2040 !rnp->wait_blkd_tasks) {
2041 /* Nothing to do on this leaf rcu_node structure. */
2042 raw_spin_unlock_irq_rcu_node(rnp);
2046 /* Record old state, apply changes to ->qsmaskinit field. */
2047 oldmask = rnp->qsmaskinit;
2048 rnp->qsmaskinit = rnp->qsmaskinitnext;
2050 /* If zero-ness of ->qsmaskinit changed, propagate up tree. */
2051 if (!oldmask != !rnp->qsmaskinit) {
2052 if (!oldmask) /* First online CPU for this rcu_node. */
2053 rcu_init_new_rnp(rnp);
2054 else if (rcu_preempt_has_tasks(rnp)) /* blocked tasks */
2055 rnp->wait_blkd_tasks = true;
2056 else /* Last offline CPU and can propagate. */
2057 rcu_cleanup_dead_rnp(rnp);
2061 * If all waited-on tasks from prior grace period are
2062 * done, and if all this rcu_node structure's CPUs are
2063 * still offline, propagate up the rcu_node tree and
2064 * clear ->wait_blkd_tasks. Otherwise, if one of this
2065 * rcu_node structure's CPUs has since come back online,
2066 * simply clear ->wait_blkd_tasks (but rcu_cleanup_dead_rnp()
2067 * checks for this, so just call it unconditionally).
2069 if (rnp->wait_blkd_tasks &&
2070 (!rcu_preempt_has_tasks(rnp) ||
2072 rnp->wait_blkd_tasks = false;
2073 rcu_cleanup_dead_rnp(rnp);
2076 raw_spin_unlock_irq_rcu_node(rnp);
2080 * Set the quiescent-state-needed bits in all the rcu_node
2081 * structures for all currently online CPUs in breadth-first order,
2082 * starting from the root rcu_node structure, relying on the layout
2083 * of the tree within the rsp->node[] array. Note that other CPUs
2084 * will access only the leaves of the hierarchy, thus seeing that no
2085 * grace period is in progress, at least until the corresponding
2086 * leaf node has been initialized.
2088 * The grace period cannot complete until the initialization
2089 * process finishes, because this kthread handles both.
2091 rcu_for_each_node_breadth_first(rsp, rnp) {
2092 rcu_gp_slow(rsp, gp_init_delay);
2093 raw_spin_lock_irq_rcu_node(rnp);
2094 rdp = this_cpu_ptr(rsp->rda);
2095 rcu_preempt_check_blocked_tasks(rnp);
2096 rnp->qsmask = rnp->qsmaskinit;
2097 WRITE_ONCE(rnp->gpnum, rsp->gpnum);
2098 if (WARN_ON_ONCE(rnp->completed != rsp->completed))
2099 WRITE_ONCE(rnp->completed, rsp->completed);
2100 if (rnp == rdp->mynode)
2101 (void)__note_gp_changes(rsp, rnp, rdp);
2102 rcu_preempt_boost_start_gp(rnp);
2103 trace_rcu_grace_period_init(rsp->name, rnp->gpnum,
2104 rnp->level, rnp->grplo,
2105 rnp->grphi, rnp->qsmask);
2106 raw_spin_unlock_irq_rcu_node(rnp);
2107 cond_resched_rcu_qs();
2108 WRITE_ONCE(rsp->gp_activity, jiffies);
2115 * Helper function for swait_event_idle() wakeup at force-quiescent-state
2118 static bool rcu_gp_fqs_check_wake(struct rcu_state *rsp, int *gfp)
2120 struct rcu_node *rnp = rcu_get_root(rsp);
2122 /* Someone like call_rcu() requested a force-quiescent-state scan. */
2123 *gfp = READ_ONCE(rsp->gp_flags);
2124 if (*gfp & RCU_GP_FLAG_FQS)
2127 /* The current grace period has completed. */
2128 if (!READ_ONCE(rnp->qsmask) && !rcu_preempt_blocked_readers_cgp(rnp))
2135 * Do one round of quiescent-state forcing.
2137 static void rcu_gp_fqs(struct rcu_state *rsp, bool first_time)
2139 struct rcu_node *rnp = rcu_get_root(rsp);
2141 WRITE_ONCE(rsp->gp_activity, jiffies);
2144 /* Collect dyntick-idle snapshots. */
2145 force_qs_rnp(rsp, dyntick_save_progress_counter);
2147 /* Handle dyntick-idle and offline CPUs. */
2148 force_qs_rnp(rsp, rcu_implicit_dynticks_qs);
2150 /* Clear flag to prevent immediate re-entry. */
2151 if (READ_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) {
2152 raw_spin_lock_irq_rcu_node(rnp);
2153 WRITE_ONCE(rsp->gp_flags,
2154 READ_ONCE(rsp->gp_flags) & ~RCU_GP_FLAG_FQS);
2155 raw_spin_unlock_irq_rcu_node(rnp);
2160 * Clean up after the old grace period.
2162 static void rcu_gp_cleanup(struct rcu_state *rsp)
2164 unsigned long gp_duration;
2165 bool needgp = false;
2167 struct rcu_data *rdp;
2168 struct rcu_node *rnp = rcu_get_root(rsp);
2169 struct swait_queue_head *sq;
2171 WRITE_ONCE(rsp->gp_activity, jiffies);
2172 raw_spin_lock_irq_rcu_node(rnp);
2173 gp_duration = jiffies - rsp->gp_start;
2174 if (gp_duration > rsp->gp_max)
2175 rsp->gp_max = gp_duration;
2178 * We know the grace period is complete, but to everyone else
2179 * it appears to still be ongoing. But it is also the case
2180 * that to everyone else it looks like there is nothing that
2181 * they can do to advance the grace period. It is therefore
2182 * safe for us to drop the lock in order to mark the grace
2183 * period as completed in all of the rcu_node structures.
2185 raw_spin_unlock_irq_rcu_node(rnp);
2188 * Propagate new ->completed value to rcu_node structures so
2189 * that other CPUs don't have to wait until the start of the next
2190 * grace period to process their callbacks. This also avoids
2191 * some nasty RCU grace-period initialization races by forcing
2192 * the end of the current grace period to be completely recorded in
2193 * all of the rcu_node structures before the beginning of the next
2194 * grace period is recorded in any of the rcu_node structures.
2196 rcu_for_each_node_breadth_first(rsp, rnp) {
2197 raw_spin_lock_irq_rcu_node(rnp);
2198 WARN_ON_ONCE(rcu_preempt_blocked_readers_cgp(rnp));
2199 WARN_ON_ONCE(rnp->qsmask);
2200 WRITE_ONCE(rnp->completed, rsp->gpnum);
2201 rdp = this_cpu_ptr(rsp->rda);
2202 if (rnp == rdp->mynode)
2203 needgp = __note_gp_changes(rsp, rnp, rdp) || needgp;
2204 /* smp_mb() provided by prior unlock-lock pair. */
2205 nocb += rcu_future_gp_cleanup(rsp, rnp);
2206 sq = rcu_nocb_gp_get(rnp);
2207 raw_spin_unlock_irq_rcu_node(rnp);
2208 rcu_nocb_gp_cleanup(sq);
2209 cond_resched_rcu_qs();
2210 WRITE_ONCE(rsp->gp_activity, jiffies);
2211 rcu_gp_slow(rsp, gp_cleanup_delay);
2213 rnp = rcu_get_root(rsp);
2214 raw_spin_lock_irq_rcu_node(rnp); /* Order GP before ->completed update. */
2215 rcu_nocb_gp_set(rnp, nocb);
2217 /* Declare grace period done. */
2218 WRITE_ONCE(rsp->completed, rsp->gpnum);
2219 trace_rcu_grace_period(rsp->name, rsp->completed, TPS("end"));
2220 rsp->gp_state = RCU_GP_IDLE;
2221 rdp = this_cpu_ptr(rsp->rda);
2222 /* Advance CBs to reduce false positives below. */
2223 needgp = rcu_advance_cbs(rsp, rnp, rdp) || needgp;
2224 if (needgp || cpu_needs_another_gp(rsp, rdp)) {
2225 WRITE_ONCE(rsp->gp_flags, RCU_GP_FLAG_INIT);
2226 trace_rcu_grace_period(rsp->name,
2227 READ_ONCE(rsp->gpnum),
2230 raw_spin_unlock_irq_rcu_node(rnp);
2234 * Body of kthread that handles grace periods.
2236 static int __noreturn rcu_gp_kthread(void *arg)
2242 struct rcu_state *rsp = arg;
2243 struct rcu_node *rnp = rcu_get_root(rsp);
2245 rcu_bind_gp_kthread();
2248 /* Handle grace-period start. */
2250 trace_rcu_grace_period(rsp->name,
2251 READ_ONCE(rsp->gpnum),
2253 rsp->gp_state = RCU_GP_WAIT_GPS;
2254 swait_event_idle(rsp->gp_wq, READ_ONCE(rsp->gp_flags) &
2256 rsp->gp_state = RCU_GP_DONE_GPS;
2257 /* Locking provides needed memory barrier. */
2258 if (rcu_gp_init(rsp))
2260 cond_resched_rcu_qs();
2261 WRITE_ONCE(rsp->gp_activity, jiffies);
2262 WARN_ON(signal_pending(current));
2263 trace_rcu_grace_period(rsp->name,
2264 READ_ONCE(rsp->gpnum),
2268 /* Handle quiescent-state forcing. */
2269 first_gp_fqs = true;
2270 j = jiffies_till_first_fqs;
2273 jiffies_till_first_fqs = HZ;
2278 rsp->jiffies_force_qs = jiffies + j;
2279 WRITE_ONCE(rsp->jiffies_kick_kthreads,
2282 trace_rcu_grace_period(rsp->name,
2283 READ_ONCE(rsp->gpnum),
2285 rsp->gp_state = RCU_GP_WAIT_FQS;
2286 ret = swait_event_idle_timeout(rsp->gp_wq,
2287 rcu_gp_fqs_check_wake(rsp, &gf), j);
2288 rsp->gp_state = RCU_GP_DOING_FQS;
2289 /* Locking provides needed memory barriers. */
2290 /* If grace period done, leave loop. */
2291 if (!READ_ONCE(rnp->qsmask) &&
2292 !rcu_preempt_blocked_readers_cgp(rnp))
2294 /* If time for quiescent-state forcing, do it. */
2295 if (ULONG_CMP_GE(jiffies, rsp->jiffies_force_qs) ||
2296 (gf & RCU_GP_FLAG_FQS)) {
2297 trace_rcu_grace_period(rsp->name,
2298 READ_ONCE(rsp->gpnum),
2300 rcu_gp_fqs(rsp, first_gp_fqs);
2301 first_gp_fqs = false;
2302 trace_rcu_grace_period(rsp->name,
2303 READ_ONCE(rsp->gpnum),
2305 cond_resched_rcu_qs();
2306 WRITE_ONCE(rsp->gp_activity, jiffies);
2307 ret = 0; /* Force full wait till next FQS. */
2308 j = jiffies_till_next_fqs;
2311 jiffies_till_next_fqs = HZ;
2314 jiffies_till_next_fqs = 1;
2317 /* Deal with stray signal. */
2318 cond_resched_rcu_qs();
2319 WRITE_ONCE(rsp->gp_activity, jiffies);
2320 WARN_ON(signal_pending(current));
2321 trace_rcu_grace_period(rsp->name,
2322 READ_ONCE(rsp->gpnum),
2324 ret = 1; /* Keep old FQS timing. */
2326 if (time_after(jiffies, rsp->jiffies_force_qs))
2329 j = rsp->jiffies_force_qs - j;
2333 /* Handle grace-period end. */
2334 rsp->gp_state = RCU_GP_CLEANUP;
2335 rcu_gp_cleanup(rsp);
2336 rsp->gp_state = RCU_GP_CLEANED;
2341 * Start a new RCU grace period if warranted, re-initializing the hierarchy
2342 * in preparation for detecting the next grace period. The caller must hold
2343 * the root node's ->lock and hard irqs must be disabled.
2345 * Note that it is legal for a dying CPU (which is marked as offline) to
2346 * invoke this function. This can happen when the dying CPU reports its
2349 * Returns true if the grace-period kthread must be awakened.
2352 rcu_start_gp_advanced(struct rcu_state *rsp, struct rcu_node *rnp,
2353 struct rcu_data *rdp)
2355 lockdep_assert_held(&rnp->lock);
2356 if (!rsp->gp_kthread || !cpu_needs_another_gp(rsp, rdp)) {
2358 * Either we have not yet spawned the grace-period
2359 * task, this CPU does not need another grace period,
2360 * or a grace period is already in progress.
2361 * Either way, don't start a new grace period.
2365 WRITE_ONCE(rsp->gp_flags, RCU_GP_FLAG_INIT);
2366 trace_rcu_grace_period(rsp->name, READ_ONCE(rsp->gpnum),
2370 * We can't do wakeups while holding the rnp->lock, as that
2371 * could cause possible deadlocks with the rq->lock. Defer
2372 * the wakeup to our caller.
2378 * Similar to rcu_start_gp_advanced(), but also advance the calling CPU's
2379 * callbacks. Note that rcu_start_gp_advanced() cannot do this because it
2380 * is invoked indirectly from rcu_advance_cbs(), which would result in
2381 * endless recursion -- or would do so if it wasn't for the self-deadlock
2382 * that is encountered beforehand.
2384 * Returns true if the grace-period kthread needs to be awakened.
2386 static bool rcu_start_gp(struct rcu_state *rsp)
2388 struct rcu_data *rdp = this_cpu_ptr(rsp->rda);
2389 struct rcu_node *rnp = rcu_get_root(rsp);
2393 * If there is no grace period in progress right now, any
2394 * callbacks we have up to this point will be satisfied by the
2395 * next grace period. Also, advancing the callbacks reduces the
2396 * probability of false positives from cpu_needs_another_gp()
2397 * resulting in pointless grace periods. So, advance callbacks
2398 * then start the grace period!
2400 ret = rcu_advance_cbs(rsp, rnp, rdp) || ret;
2401 ret = rcu_start_gp_advanced(rsp, rnp, rdp) || ret;
2406 * Report a full set of quiescent states to the specified rcu_state data
2407 * structure. Invoke rcu_gp_kthread_wake() to awaken the grace-period
2408 * kthread if another grace period is required. Whether we wake
2409 * the grace-period kthread or it awakens itself for the next round
2410 * of quiescent-state forcing, that kthread will clean up after the
2411 * just-completed grace period. Note that the caller must hold rnp->lock,
2412 * which is released before return.
2414 static void rcu_report_qs_rsp(struct rcu_state *rsp, unsigned long flags)
2415 __releases(rcu_get_root(rsp)->lock)
2417 lockdep_assert_held(&rcu_get_root(rsp)->lock);
2418 WARN_ON_ONCE(!rcu_gp_in_progress(rsp));
2419 WRITE_ONCE(rsp->gp_flags, READ_ONCE(rsp->gp_flags) | RCU_GP_FLAG_FQS);
2420 raw_spin_unlock_irqrestore_rcu_node(rcu_get_root(rsp), flags);
2421 rcu_gp_kthread_wake(rsp);
2425 * Similar to rcu_report_qs_rdp(), for which it is a helper function.
2426 * Allows quiescent states for a group of CPUs to be reported at one go
2427 * to the specified rcu_node structure, though all the CPUs in the group
2428 * must be represented by the same rcu_node structure (which need not be a
2429 * leaf rcu_node structure, though it often will be). The gps parameter
2430 * is the grace-period snapshot, which means that the quiescent states
2431 * are valid only if rnp->gpnum is equal to gps. That structure's lock
2432 * must be held upon entry, and it is released before return.
2435 rcu_report_qs_rnp(unsigned long mask, struct rcu_state *rsp,
2436 struct rcu_node *rnp, unsigned long gps, unsigned long flags)
2437 __releases(rnp->lock)
2439 unsigned long oldmask = 0;
2440 struct rcu_node *rnp_c;
2442 lockdep_assert_held(&rnp->lock);
2444 /* Walk up the rcu_node hierarchy. */
2446 if (!(rnp->qsmask & mask) || rnp->gpnum != gps) {
2449 * Our bit has already been cleared, or the
2450 * relevant grace period is already over, so done.
2452 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2455 WARN_ON_ONCE(oldmask); /* Any child must be all zeroed! */
2456 WARN_ON_ONCE(rnp->level != rcu_num_lvls - 1 &&
2457 rcu_preempt_blocked_readers_cgp(rnp));
2458 rnp->qsmask &= ~mask;
2459 trace_rcu_quiescent_state_report(rsp->name, rnp->gpnum,
2460 mask, rnp->qsmask, rnp->level,
2461 rnp->grplo, rnp->grphi,
2463 if (rnp->qsmask != 0 || rcu_preempt_blocked_readers_cgp(rnp)) {
2465 /* Other bits still set at this level, so done. */
2466 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2469 mask = rnp->grpmask;
2470 if (rnp->parent == NULL) {
2472 /* No more levels. Exit loop holding root lock. */
2476 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2479 raw_spin_lock_irqsave_rcu_node(rnp, flags);
2480 oldmask = rnp_c->qsmask;
2484 * Get here if we are the last CPU to pass through a quiescent
2485 * state for this grace period. Invoke rcu_report_qs_rsp()
2486 * to clean up and start the next grace period if one is needed.
2488 rcu_report_qs_rsp(rsp, flags); /* releases rnp->lock. */
2492 * Record a quiescent state for all tasks that were previously queued
2493 * on the specified rcu_node structure and that were blocking the current
2494 * RCU grace period. The caller must hold the specified rnp->lock with
2495 * irqs disabled, and this lock is released upon return, but irqs remain
2498 static void rcu_report_unblock_qs_rnp(struct rcu_state *rsp,
2499 struct rcu_node *rnp, unsigned long flags)
2500 __releases(rnp->lock)
2504 struct rcu_node *rnp_p;
2506 lockdep_assert_held(&rnp->lock);
2507 if (rcu_state_p == &rcu_sched_state || rsp != rcu_state_p ||
2508 rnp->qsmask != 0 || rcu_preempt_blocked_readers_cgp(rnp)) {
2509 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2510 return; /* Still need more quiescent states! */
2513 rnp_p = rnp->parent;
2514 if (rnp_p == NULL) {
2516 * Only one rcu_node structure in the tree, so don't
2517 * try to report up to its nonexistent parent!
2519 rcu_report_qs_rsp(rsp, flags);
2523 /* Report up the rest of the hierarchy, tracking current ->gpnum. */
2525 mask = rnp->grpmask;
2526 raw_spin_unlock_rcu_node(rnp); /* irqs remain disabled. */
2527 raw_spin_lock_rcu_node(rnp_p); /* irqs already disabled. */
2528 rcu_report_qs_rnp(mask, rsp, rnp_p, gps, flags);
2532 * Record a quiescent state for the specified CPU to that CPU's rcu_data
2533 * structure. This must be called from the specified CPU.
2536 rcu_report_qs_rdp(int cpu, struct rcu_state *rsp, struct rcu_data *rdp)
2538 unsigned long flags;
2541 struct rcu_node *rnp;
2544 raw_spin_lock_irqsave_rcu_node(rnp, flags);
2545 if (rdp->cpu_no_qs.b.norm || rdp->gpnum != rnp->gpnum ||
2546 rnp->completed == rnp->gpnum || rdp->gpwrap) {
2549 * The grace period in which this quiescent state was
2550 * recorded has ended, so don't report it upwards.
2551 * We will instead need a new quiescent state that lies
2552 * within the current grace period.
2554 rdp->cpu_no_qs.b.norm = true; /* need qs for new gp. */
2555 rdp->rcu_qs_ctr_snap = __this_cpu_read(rcu_dynticks.rcu_qs_ctr);
2556 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2559 mask = rdp->grpmask;
2560 if ((rnp->qsmask & mask) == 0) {
2561 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2563 rdp->core_needs_qs = false;
2566 * This GP can't end until cpu checks in, so all of our
2567 * callbacks can be processed during the next GP.
2569 needwake = rcu_accelerate_cbs(rsp, rnp, rdp);
2571 rcu_report_qs_rnp(mask, rsp, rnp, rnp->gpnum, flags);
2572 /* ^^^ Released rnp->lock */
2574 rcu_gp_kthread_wake(rsp);
2579 * Check to see if there is a new grace period of which this CPU
2580 * is not yet aware, and if so, set up local rcu_data state for it.
2581 * Otherwise, see if this CPU has just passed through its first
2582 * quiescent state for this grace period, and record that fact if so.
2585 rcu_check_quiescent_state(struct rcu_state *rsp, struct rcu_data *rdp)
2587 /* Check for grace-period ends and beginnings. */
2588 note_gp_changes(rsp, rdp);
2591 * Does this CPU still need to do its part for current grace period?
2592 * If no, return and let the other CPUs do their part as well.
2594 if (!rdp->core_needs_qs)
2598 * Was there a quiescent state since the beginning of the grace
2599 * period? If no, then exit and wait for the next call.
2601 if (rdp->cpu_no_qs.b.norm)
2605 * Tell RCU we are done (but rcu_report_qs_rdp() will be the
2608 rcu_report_qs_rdp(rdp->cpu, rsp, rdp);
2612 * Trace the fact that this CPU is going offline.
2614 static void rcu_cleanup_dying_cpu(struct rcu_state *rsp)
2616 RCU_TRACE(unsigned long mask;)
2617 RCU_TRACE(struct rcu_data *rdp = this_cpu_ptr(rsp->rda);)
2618 RCU_TRACE(struct rcu_node *rnp = rdp->mynode;)
2620 if (!IS_ENABLED(CONFIG_HOTPLUG_CPU))
2623 RCU_TRACE(mask = rdp->grpmask;)
2624 trace_rcu_grace_period(rsp->name,
2625 rnp->gpnum + 1 - !!(rnp->qsmask & mask),
2630 * All CPUs for the specified rcu_node structure have gone offline,
2631 * and all tasks that were preempted within an RCU read-side critical
2632 * section while running on one of those CPUs have since exited their RCU
2633 * read-side critical section. Some other CPU is reporting this fact with
2634 * the specified rcu_node structure's ->lock held and interrupts disabled.
2635 * This function therefore goes up the tree of rcu_node structures,
2636 * clearing the corresponding bits in the ->qsmaskinit fields. Note that
2637 * the leaf rcu_node structure's ->qsmaskinit field has already been
2640 * This function does check that the specified rcu_node structure has
2641 * all CPUs offline and no blocked tasks, so it is OK to invoke it
2642 * prematurely. That said, invoking it after the fact will cost you
2643 * a needless lock acquisition. So once it has done its work, don't
2646 static void rcu_cleanup_dead_rnp(struct rcu_node *rnp_leaf)
2649 struct rcu_node *rnp = rnp_leaf;
2651 lockdep_assert_held(&rnp->lock);
2652 if (!IS_ENABLED(CONFIG_HOTPLUG_CPU) ||
2653 rnp->qsmaskinit || rcu_preempt_has_tasks(rnp))
2656 mask = rnp->grpmask;
2660 raw_spin_lock_rcu_node(rnp); /* irqs already disabled. */
2661 rnp->qsmaskinit &= ~mask;
2662 rnp->qsmask &= ~mask;
2663 if (rnp->qsmaskinit) {
2664 raw_spin_unlock_rcu_node(rnp);
2665 /* irqs remain disabled. */
2668 raw_spin_unlock_rcu_node(rnp); /* irqs remain disabled. */
2673 * The CPU has been completely removed, and some other CPU is reporting
2674 * this fact from process context. Do the remainder of the cleanup.
2675 * There can only be one CPU hotplug operation at a time, so no need for
2678 static void rcu_cleanup_dead_cpu(int cpu, struct rcu_state *rsp)
2680 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
2681 struct rcu_node *rnp = rdp->mynode; /* Outgoing CPU's rdp & rnp. */
2683 if (!IS_ENABLED(CONFIG_HOTPLUG_CPU))
2686 /* Adjust any no-longer-needed kthreads. */
2687 rcu_boost_kthread_setaffinity(rnp, -1);
2691 * Invoke any RCU callbacks that have made it to the end of their grace
2692 * period. Thottle as specified by rdp->blimit.
2694 static void rcu_do_batch(struct rcu_state *rsp, struct rcu_data *rdp)
2696 unsigned long flags;
2697 struct rcu_head *rhp;
2698 struct rcu_cblist rcl = RCU_CBLIST_INITIALIZER(rcl);
2701 /* If no callbacks are ready, just return. */
2702 if (!rcu_segcblist_ready_cbs(&rdp->cblist)) {
2703 trace_rcu_batch_start(rsp->name,
2704 rcu_segcblist_n_lazy_cbs(&rdp->cblist),
2705 rcu_segcblist_n_cbs(&rdp->cblist), 0);
2706 trace_rcu_batch_end(rsp->name, 0,
2707 !rcu_segcblist_empty(&rdp->cblist),
2708 need_resched(), is_idle_task(current),
2709 rcu_is_callbacks_kthread());
2714 * Extract the list of ready callbacks, disabling to prevent
2715 * races with call_rcu() from interrupt handlers. Leave the
2716 * callback counts, as rcu_barrier() needs to be conservative.
2718 local_irq_save(flags);
2719 WARN_ON_ONCE(cpu_is_offline(smp_processor_id()));
2721 trace_rcu_batch_start(rsp->name, rcu_segcblist_n_lazy_cbs(&rdp->cblist),
2722 rcu_segcblist_n_cbs(&rdp->cblist), bl);
2723 rcu_segcblist_extract_done_cbs(&rdp->cblist, &rcl);
2724 local_irq_restore(flags);
2726 /* Invoke callbacks. */
2727 rhp = rcu_cblist_dequeue(&rcl);
2728 for (; rhp; rhp = rcu_cblist_dequeue(&rcl)) {
2729 debug_rcu_head_unqueue(rhp);
2730 if (__rcu_reclaim(rsp->name, rhp))
2731 rcu_cblist_dequeued_lazy(&rcl);
2733 * Stop only if limit reached and CPU has something to do.
2734 * Note: The rcl structure counts down from zero.
2736 if (-rcl.len >= bl &&
2738 (!is_idle_task(current) && !rcu_is_callbacks_kthread())))
2742 local_irq_save(flags);
2744 trace_rcu_batch_end(rsp->name, count, !!rcl.head, need_resched(),
2745 is_idle_task(current), rcu_is_callbacks_kthread());
2747 /* Update counts and requeue any remaining callbacks. */
2748 rcu_segcblist_insert_done_cbs(&rdp->cblist, &rcl);
2749 smp_mb(); /* List handling before counting for rcu_barrier(). */
2750 rdp->n_cbs_invoked += count;
2751 rcu_segcblist_insert_count(&rdp->cblist, &rcl);
2753 /* Reinstate batch limit if we have worked down the excess. */
2754 count = rcu_segcblist_n_cbs(&rdp->cblist);
2755 if (rdp->blimit == LONG_MAX && count <= qlowmark)
2756 rdp->blimit = blimit;
2758 /* Reset ->qlen_last_fqs_check trigger if enough CBs have drained. */
2759 if (count == 0 && rdp->qlen_last_fqs_check != 0) {
2760 rdp->qlen_last_fqs_check = 0;
2761 rdp->n_force_qs_snap = rsp->n_force_qs;
2762 } else if (count < rdp->qlen_last_fqs_check - qhimark)
2763 rdp->qlen_last_fqs_check = count;
2764 WARN_ON_ONCE(rcu_segcblist_empty(&rdp->cblist) != (count == 0));
2766 local_irq_restore(flags);
2768 /* Re-invoke RCU core processing if there are callbacks remaining. */
2769 if (rcu_segcblist_ready_cbs(&rdp->cblist))
2774 * Check to see if this CPU is in a non-context-switch quiescent state
2775 * (user mode or idle loop for rcu, non-softirq execution for rcu_bh).
2776 * Also schedule RCU core processing.
2778 * This function must be called from hardirq context. It is normally
2779 * invoked from the scheduling-clock interrupt.
2781 void rcu_check_callbacks(int user)
2783 trace_rcu_utilization(TPS("Start scheduler-tick"));
2784 increment_cpu_stall_ticks();
2785 if (user || rcu_is_cpu_rrupt_from_idle()) {
2788 * Get here if this CPU took its interrupt from user
2789 * mode or from the idle loop, and if this is not a
2790 * nested interrupt. In this case, the CPU is in
2791 * a quiescent state, so note it.
2793 * No memory barrier is required here because both
2794 * rcu_sched_qs() and rcu_bh_qs() reference only CPU-local
2795 * variables that other CPUs neither access nor modify,
2796 * at least not while the corresponding CPU is online.
2802 } else if (!in_softirq()) {
2805 * Get here if this CPU did not take its interrupt from
2806 * softirq, in other words, if it is not interrupting
2807 * a rcu_bh read-side critical section. This is an _bh
2808 * critical section, so note it.
2813 rcu_preempt_check_callbacks();
2817 rcu_note_voluntary_context_switch(current);
2818 trace_rcu_utilization(TPS("End scheduler-tick"));
2822 * Scan the leaf rcu_node structures, processing dyntick state for any that
2823 * have not yet encountered a quiescent state, using the function specified.
2824 * Also initiate boosting for any threads blocked on the root rcu_node.
2826 * The caller must have suppressed start of new grace periods.
2828 static void force_qs_rnp(struct rcu_state *rsp, int (*f)(struct rcu_data *rsp))
2831 unsigned long flags;
2833 struct rcu_node *rnp;
2835 rcu_for_each_leaf_node(rsp, rnp) {
2836 cond_resched_rcu_qs();
2838 raw_spin_lock_irqsave_rcu_node(rnp, flags);
2839 if (rnp->qsmask == 0) {
2840 if (rcu_state_p == &rcu_sched_state ||
2841 rsp != rcu_state_p ||
2842 rcu_preempt_blocked_readers_cgp(rnp)) {
2844 * No point in scanning bits because they
2845 * are all zero. But we might need to
2846 * priority-boost blocked readers.
2848 rcu_initiate_boost(rnp, flags);
2849 /* rcu_initiate_boost() releases rnp->lock */
2853 (rnp->parent->qsmask & rnp->grpmask)) {
2855 * Race between grace-period
2856 * initialization and task exiting RCU
2857 * read-side critical section: Report.
2859 rcu_report_unblock_qs_rnp(rsp, rnp, flags);
2860 /* rcu_report_unblock_qs_rnp() rlses ->lock */
2864 for_each_leaf_node_possible_cpu(rnp, cpu) {
2865 unsigned long bit = leaf_node_cpu_bit(rnp, cpu);
2866 if ((rnp->qsmask & bit) != 0) {
2867 if (f(per_cpu_ptr(rsp->rda, cpu)))
2872 /* Idle/offline CPUs, report (releases rnp->lock. */
2873 rcu_report_qs_rnp(mask, rsp, rnp, rnp->gpnum, flags);
2875 /* Nothing to do here, so just drop the lock. */
2876 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
2882 * Force quiescent states on reluctant CPUs, and also detect which
2883 * CPUs are in dyntick-idle mode.
2885 static void force_quiescent_state(struct rcu_state *rsp)
2887 unsigned long flags;
2889 struct rcu_node *rnp;
2890 struct rcu_node *rnp_old = NULL;
2892 /* Funnel through hierarchy to reduce memory contention. */
2893 rnp = __this_cpu_read(rsp->rda->mynode);
2894 for (; rnp != NULL; rnp = rnp->parent) {
2895 ret = (READ_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) ||
2896 !raw_spin_trylock(&rnp->fqslock);
2897 if (rnp_old != NULL)
2898 raw_spin_unlock(&rnp_old->fqslock);
2900 rsp->n_force_qs_lh++;
2905 /* rnp_old == rcu_get_root(rsp), rnp == NULL. */
2907 /* Reached the root of the rcu_node tree, acquire lock. */
2908 raw_spin_lock_irqsave_rcu_node(rnp_old, flags);
2909 raw_spin_unlock(&rnp_old->fqslock);
2910 if (READ_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) {
2911 rsp->n_force_qs_lh++;
2912 raw_spin_unlock_irqrestore_rcu_node(rnp_old, flags);
2913 return; /* Someone beat us to it. */
2915 WRITE_ONCE(rsp->gp_flags, READ_ONCE(rsp->gp_flags) | RCU_GP_FLAG_FQS);
2916 raw_spin_unlock_irqrestore_rcu_node(rnp_old, flags);
2917 rcu_gp_kthread_wake(rsp);
2921 * This does the RCU core processing work for the specified rcu_state
2922 * and rcu_data structures. This may be called only from the CPU to
2923 * whom the rdp belongs.
2926 __rcu_process_callbacks(struct rcu_state *rsp)
2928 unsigned long flags;
2930 struct rcu_data *rdp = raw_cpu_ptr(rsp->rda);
2932 WARN_ON_ONCE(!rdp->beenonline);
2934 /* Update RCU state based on any recent quiescent states. */
2935 rcu_check_quiescent_state(rsp, rdp);
2937 /* Does this CPU require a not-yet-started grace period? */
2938 local_irq_save(flags);
2939 if (cpu_needs_another_gp(rsp, rdp)) {
2940 raw_spin_lock_rcu_node(rcu_get_root(rsp)); /* irqs disabled. */
2941 needwake = rcu_start_gp(rsp);
2942 raw_spin_unlock_irqrestore_rcu_node(rcu_get_root(rsp), flags);
2944 rcu_gp_kthread_wake(rsp);
2946 local_irq_restore(flags);
2949 /* If there are callbacks ready, invoke them. */
2950 if (rcu_segcblist_ready_cbs(&rdp->cblist))
2951 invoke_rcu_callbacks(rsp, rdp);
2953 /* Do any needed deferred wakeups of rcuo kthreads. */
2954 do_nocb_deferred_wakeup(rdp);
2958 * Do RCU core processing for the current CPU.
2960 static __latent_entropy void rcu_process_callbacks(struct softirq_action *unused)
2962 struct rcu_state *rsp;
2964 if (cpu_is_offline(smp_processor_id()))
2966 trace_rcu_utilization(TPS("Start RCU core"));
2967 for_each_rcu_flavor(rsp)
2968 __rcu_process_callbacks(rsp);
2969 trace_rcu_utilization(TPS("End RCU core"));
2973 * Schedule RCU callback invocation. If the specified type of RCU
2974 * does not support RCU priority boosting, just do a direct call,
2975 * otherwise wake up the per-CPU kernel kthread. Note that because we
2976 * are running on the current CPU with softirqs disabled, the
2977 * rcu_cpu_kthread_task cannot disappear out from under us.
2979 static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp)
2981 if (unlikely(!READ_ONCE(rcu_scheduler_fully_active)))
2983 if (likely(!rsp->boost)) {
2984 rcu_do_batch(rsp, rdp);
2987 invoke_rcu_callbacks_kthread();
2990 static void invoke_rcu_core(void)
2992 if (cpu_online(smp_processor_id()))
2993 raise_softirq(RCU_SOFTIRQ);
2997 * Handle any core-RCU processing required by a call_rcu() invocation.
2999 static void __call_rcu_core(struct rcu_state *rsp, struct rcu_data *rdp,
3000 struct rcu_head *head, unsigned long flags)
3005 * If called from an extended quiescent state, invoke the RCU
3006 * core in order to force a re-evaluation of RCU's idleness.
3008 if (!rcu_is_watching())
3011 /* If interrupts were disabled or CPU offline, don't invoke RCU core. */
3012 if (irqs_disabled_flags(flags) || cpu_is_offline(smp_processor_id()))
3016 * Force the grace period if too many callbacks or too long waiting.
3017 * Enforce hysteresis, and don't invoke force_quiescent_state()
3018 * if some other CPU has recently done so. Also, don't bother
3019 * invoking force_quiescent_state() if the newly enqueued callback
3020 * is the only one waiting for a grace period to complete.
3022 if (unlikely(rcu_segcblist_n_cbs(&rdp->cblist) >
3023 rdp->qlen_last_fqs_check + qhimark)) {
3025 /* Are we ignoring a completed grace period? */
3026 note_gp_changes(rsp, rdp);
3028 /* Start a new grace period if one not already started. */
3029 if (!rcu_gp_in_progress(rsp)) {
3030 struct rcu_node *rnp_root = rcu_get_root(rsp);
3032 raw_spin_lock_rcu_node(rnp_root);
3033 needwake = rcu_start_gp(rsp);
3034 raw_spin_unlock_rcu_node(rnp_root);
3036 rcu_gp_kthread_wake(rsp);
3038 /* Give the grace period a kick. */
3039 rdp->blimit = LONG_MAX;
3040 if (rsp->n_force_qs == rdp->n_force_qs_snap &&
3041 rcu_segcblist_first_pend_cb(&rdp->cblist) != head)
3042 force_quiescent_state(rsp);
3043 rdp->n_force_qs_snap = rsp->n_force_qs;
3044 rdp->qlen_last_fqs_check = rcu_segcblist_n_cbs(&rdp->cblist);
3050 * RCU callback function to leak a callback.
3052 static void rcu_leak_callback(struct rcu_head *rhp)
3057 * Helper function for call_rcu() and friends. The cpu argument will
3058 * normally be -1, indicating "currently running CPU". It may specify
3059 * a CPU only if that CPU is a no-CBs CPU. Currently, only _rcu_barrier()
3060 * is expected to specify a CPU.
3063 __call_rcu(struct rcu_head *head, rcu_callback_t func,
3064 struct rcu_state *rsp, int cpu, bool lazy)
3066 unsigned long flags;
3067 struct rcu_data *rdp;
3069 /* Misaligned rcu_head! */
3070 WARN_ON_ONCE((unsigned long)head & (sizeof(void *) - 1));
3072 if (debug_rcu_head_queue(head)) {
3074 * Probable double call_rcu(), so leak the callback.
3075 * Use rcu:rcu_callback trace event to find the previous
3076 * time callback was passed to __call_rcu().
3078 WARN_ONCE(1, "__call_rcu(): Double-freed CB %p->%pF()!!!\n",
3080 WRITE_ONCE(head->func, rcu_leak_callback);
3085 local_irq_save(flags);
3086 rdp = this_cpu_ptr(rsp->rda);
3088 /* Add the callback to our list. */
3089 if (unlikely(!rcu_segcblist_is_enabled(&rdp->cblist)) || cpu != -1) {
3093 rdp = per_cpu_ptr(rsp->rda, cpu);
3094 if (likely(rdp->mynode)) {
3095 /* Post-boot, so this should be for a no-CBs CPU. */
3096 offline = !__call_rcu_nocb(rdp, head, lazy, flags);
3097 WARN_ON_ONCE(offline);
3098 /* Offline CPU, _call_rcu() illegal, leak callback. */
3099 local_irq_restore(flags);
3103 * Very early boot, before rcu_init(). Initialize if needed
3104 * and then drop through to queue the callback.
3107 WARN_ON_ONCE(!rcu_is_watching());
3108 if (rcu_segcblist_empty(&rdp->cblist))
3109 rcu_segcblist_init(&rdp->cblist);
3111 rcu_segcblist_enqueue(&rdp->cblist, head, lazy);
3113 rcu_idle_count_callbacks_posted();
3115 if (__is_kfree_rcu_offset((unsigned long)func))
3116 trace_rcu_kfree_callback(rsp->name, head, (unsigned long)func,
3117 rcu_segcblist_n_lazy_cbs(&rdp->cblist),
3118 rcu_segcblist_n_cbs(&rdp->cblist));
3120 trace_rcu_callback(rsp->name, head,
3121 rcu_segcblist_n_lazy_cbs(&rdp->cblist),
3122 rcu_segcblist_n_cbs(&rdp->cblist));
3124 /* Go handle any RCU core processing required. */
3125 __call_rcu_core(rsp, rdp, head, flags);
3126 local_irq_restore(flags);
3130 * call_rcu_sched() - Queue an RCU for invocation after sched grace period.
3131 * @head: structure to be used for queueing the RCU updates.
3132 * @func: actual callback function to be invoked after the grace period
3134 * The callback function will be invoked some time after a full grace
3135 * period elapses, in other words after all currently executing RCU
3136 * read-side critical sections have completed. call_rcu_sched() assumes
3137 * that the read-side critical sections end on enabling of preemption
3138 * or on voluntary preemption.
3139 * RCU read-side critical sections are delimited by:
3141 * - rcu_read_lock_sched() and rcu_read_unlock_sched(), OR
3142 * - anything that disables preemption.
3144 * These may be nested.
3146 * See the description of call_rcu() for more detailed information on
3147 * memory ordering guarantees.
3149 void call_rcu_sched(struct rcu_head *head, rcu_callback_t func)
3151 __call_rcu(head, func, &rcu_sched_state, -1, 0);
3153 EXPORT_SYMBOL_GPL(call_rcu_sched);
3156 * call_rcu_bh() - Queue an RCU for invocation after a quicker grace period.
3157 * @head: structure to be used for queueing the RCU updates.
3158 * @func: actual callback function to be invoked after the grace period
3160 * The callback function will be invoked some time after a full grace
3161 * period elapses, in other words after all currently executing RCU
3162 * read-side critical sections have completed. call_rcu_bh() assumes
3163 * that the read-side critical sections end on completion of a softirq
3164 * handler. This means that read-side critical sections in process
3165 * context must not be interrupted by softirqs. This interface is to be
3166 * used when most of the read-side critical sections are in softirq context.
3167 * RCU read-side critical sections are delimited by:
3169 * - rcu_read_lock() and rcu_read_unlock(), if in interrupt context, OR
3170 * - rcu_read_lock_bh() and rcu_read_unlock_bh(), if in process context.
3172 * These may be nested.
3174 * See the description of call_rcu() for more detailed information on
3175 * memory ordering guarantees.
3177 void call_rcu_bh(struct rcu_head *head, rcu_callback_t func)
3179 __call_rcu(head, func, &rcu_bh_state, -1, 0);
3181 EXPORT_SYMBOL_GPL(call_rcu_bh);
3184 * Queue an RCU callback for lazy invocation after a grace period.
3185 * This will likely be later named something like "call_rcu_lazy()",
3186 * but this change will require some way of tagging the lazy RCU
3187 * callbacks in the list of pending callbacks. Until then, this
3188 * function may only be called from __kfree_rcu().
3190 void kfree_call_rcu(struct rcu_head *head,
3191 rcu_callback_t func)
3193 __call_rcu(head, func, rcu_state_p, -1, 1);
3195 EXPORT_SYMBOL_GPL(kfree_call_rcu);
3198 * Because a context switch is a grace period for RCU-sched and RCU-bh,
3199 * any blocking grace-period wait automatically implies a grace period
3200 * if there is only one CPU online at any point time during execution
3201 * of either synchronize_sched() or synchronize_rcu_bh(). It is OK to
3202 * occasionally incorrectly indicate that there are multiple CPUs online
3203 * when there was in fact only one the whole time, as this just adds
3204 * some overhead: RCU still operates correctly.
3206 static inline int rcu_blocking_is_gp(void)
3210 might_sleep(); /* Check for RCU read-side critical section. */
3212 ret = num_online_cpus() <= 1;
3218 * synchronize_sched - wait until an rcu-sched grace period has elapsed.
3220 * Control will return to the caller some time after a full rcu-sched
3221 * grace period has elapsed, in other words after all currently executing
3222 * rcu-sched read-side critical sections have completed. These read-side
3223 * critical sections are delimited by rcu_read_lock_sched() and
3224 * rcu_read_unlock_sched(), and may be nested. Note that preempt_disable(),
3225 * local_irq_disable(), and so on may be used in place of
3226 * rcu_read_lock_sched().
3228 * This means that all preempt_disable code sequences, including NMI and
3229 * non-threaded hardware-interrupt handlers, in progress on entry will
3230 * have completed before this primitive returns. However, this does not
3231 * guarantee that softirq handlers will have completed, since in some
3232 * kernels, these handlers can run in process context, and can block.
3234 * Note that this guarantee implies further memory-ordering guarantees.
3235 * On systems with more than one CPU, when synchronize_sched() returns,
3236 * each CPU is guaranteed to have executed a full memory barrier since the
3237 * end of its last RCU-sched read-side critical section whose beginning
3238 * preceded the call to synchronize_sched(). In addition, each CPU having
3239 * an RCU read-side critical section that extends beyond the return from
3240 * synchronize_sched() is guaranteed to have executed a full memory barrier
3241 * after the beginning of synchronize_sched() and before the beginning of
3242 * that RCU read-side critical section. Note that these guarantees include
3243 * CPUs that are offline, idle, or executing in user mode, as well as CPUs
3244 * that are executing in the kernel.
3246 * Furthermore, if CPU A invoked synchronize_sched(), which returned
3247 * to its caller on CPU B, then both CPU A and CPU B are guaranteed
3248 * to have executed a full memory barrier during the execution of
3249 * synchronize_sched() -- even if CPU A and CPU B are the same CPU (but
3250 * again only if the system has more than one CPU).
3252 void synchronize_sched(void)
3254 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map) ||
3255 lock_is_held(&rcu_lock_map) ||
3256 lock_is_held(&rcu_sched_lock_map),
3257 "Illegal synchronize_sched() in RCU-sched read-side critical section");
3258 if (rcu_blocking_is_gp())
3260 if (rcu_gp_is_expedited())
3261 synchronize_sched_expedited();
3263 wait_rcu_gp(call_rcu_sched);
3265 EXPORT_SYMBOL_GPL(synchronize_sched);
3268 * synchronize_rcu_bh - wait until an rcu_bh grace period has elapsed.
3270 * Control will return to the caller some time after a full rcu_bh grace
3271 * period has elapsed, in other words after all currently executing rcu_bh
3272 * read-side critical sections have completed. RCU read-side critical
3273 * sections are delimited by rcu_read_lock_bh() and rcu_read_unlock_bh(),
3274 * and may be nested.
3276 * See the description of synchronize_sched() for more detailed information
3277 * on memory ordering guarantees.
3279 void synchronize_rcu_bh(void)
3281 RCU_LOCKDEP_WARN(lock_is_held(&rcu_bh_lock_map) ||
3282 lock_is_held(&rcu_lock_map) ||
3283 lock_is_held(&rcu_sched_lock_map),
3284 "Illegal synchronize_rcu_bh() in RCU-bh read-side critical section");
3285 if (rcu_blocking_is_gp())
3287 if (rcu_gp_is_expedited())
3288 synchronize_rcu_bh_expedited();
3290 wait_rcu_gp(call_rcu_bh);
3292 EXPORT_SYMBOL_GPL(synchronize_rcu_bh);
3295 * get_state_synchronize_rcu - Snapshot current RCU state
3297 * Returns a cookie that is used by a later call to cond_synchronize_rcu()
3298 * to determine whether or not a full grace period has elapsed in the
3301 unsigned long get_state_synchronize_rcu(void)
3304 * Any prior manipulation of RCU-protected data must happen
3305 * before the load from ->gpnum.
3310 * Make sure this load happens before the purportedly
3311 * time-consuming work between get_state_synchronize_rcu()
3312 * and cond_synchronize_rcu().
3314 return smp_load_acquire(&rcu_state_p->gpnum);
3316 EXPORT_SYMBOL_GPL(get_state_synchronize_rcu);
3319 * cond_synchronize_rcu - Conditionally wait for an RCU grace period
3321 * @oldstate: return value from earlier call to get_state_synchronize_rcu()
3323 * If a full RCU grace period has elapsed since the earlier call to
3324 * get_state_synchronize_rcu(), just return. Otherwise, invoke
3325 * synchronize_rcu() to wait for a full grace period.
3327 * Yes, this function does not take counter wrap into account. But
3328 * counter wrap is harmless. If the counter wraps, we have waited for
3329 * more than 2 billion grace periods (and way more on a 64-bit system!),
3330 * so waiting for one additional grace period should be just fine.
3332 void cond_synchronize_rcu(unsigned long oldstate)
3334 unsigned long newstate;
3337 * Ensure that this load happens before any RCU-destructive
3338 * actions the caller might carry out after we return.
3340 newstate = smp_load_acquire(&rcu_state_p->completed);
3341 if (ULONG_CMP_GE(oldstate, newstate))
3344 EXPORT_SYMBOL_GPL(cond_synchronize_rcu);
3347 * get_state_synchronize_sched - Snapshot current RCU-sched state
3349 * Returns a cookie that is used by a later call to cond_synchronize_sched()
3350 * to determine whether or not a full grace period has elapsed in the
3353 unsigned long get_state_synchronize_sched(void)
3356 * Any prior manipulation of RCU-protected data must happen
3357 * before the load from ->gpnum.
3362 * Make sure this load happens before the purportedly
3363 * time-consuming work between get_state_synchronize_sched()
3364 * and cond_synchronize_sched().
3366 return smp_load_acquire(&rcu_sched_state.gpnum);
3368 EXPORT_SYMBOL_GPL(get_state_synchronize_sched);
3371 * cond_synchronize_sched - Conditionally wait for an RCU-sched grace period
3373 * @oldstate: return value from earlier call to get_state_synchronize_sched()
3375 * If a full RCU-sched grace period has elapsed since the earlier call to
3376 * get_state_synchronize_sched(), just return. Otherwise, invoke
3377 * synchronize_sched() to wait for a full grace period.
3379 * Yes, this function does not take counter wrap into account. But
3380 * counter wrap is harmless. If the counter wraps, we have waited for
3381 * more than 2 billion grace periods (and way more on a 64-bit system!),
3382 * so waiting for one additional grace period should be just fine.
3384 void cond_synchronize_sched(unsigned long oldstate)
3386 unsigned long newstate;
3389 * Ensure that this load happens before any RCU-destructive
3390 * actions the caller might carry out after we return.
3392 newstate = smp_load_acquire(&rcu_sched_state.completed);
3393 if (ULONG_CMP_GE(oldstate, newstate))
3394 synchronize_sched();
3396 EXPORT_SYMBOL_GPL(cond_synchronize_sched);
3399 * Check to see if there is any immediate RCU-related work to be done
3400 * by the current CPU, for the specified type of RCU, returning 1 if so.
3401 * The checks are in order of increasing expense: checks that can be
3402 * carried out against CPU-local state are performed first. However,
3403 * we must check for CPU stalls first, else we might not get a chance.
3405 static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp)
3407 struct rcu_node *rnp = rdp->mynode;
3409 rdp->n_rcu_pending++;
3411 /* Check for CPU stalls, if enabled. */
3412 check_cpu_stall(rsp, rdp);
3414 /* Is this CPU a NO_HZ_FULL CPU that should ignore RCU? */
3415 if (rcu_nohz_full_cpu(rsp))
3418 /* Is the RCU core waiting for a quiescent state from this CPU? */
3419 if (rcu_scheduler_fully_active &&
3420 rdp->core_needs_qs && rdp->cpu_no_qs.b.norm &&
3421 rdp->rcu_qs_ctr_snap == __this_cpu_read(rcu_dynticks.rcu_qs_ctr)) {
3422 rdp->n_rp_core_needs_qs++;
3423 } else if (rdp->core_needs_qs && !rdp->cpu_no_qs.b.norm) {
3424 rdp->n_rp_report_qs++;
3428 /* Does this CPU have callbacks ready to invoke? */
3429 if (rcu_segcblist_ready_cbs(&rdp->cblist)) {
3430 rdp->n_rp_cb_ready++;
3434 /* Has RCU gone idle with this CPU needing another grace period? */
3435 if (cpu_needs_another_gp(rsp, rdp)) {
3436 rdp->n_rp_cpu_needs_gp++;
3440 /* Has another RCU grace period completed? */
3441 if (READ_ONCE(rnp->completed) != rdp->completed) { /* outside lock */
3442 rdp->n_rp_gp_completed++;
3446 /* Has a new RCU grace period started? */
3447 if (READ_ONCE(rnp->gpnum) != rdp->gpnum ||
3448 unlikely(READ_ONCE(rdp->gpwrap))) { /* outside lock */
3449 rdp->n_rp_gp_started++;
3453 /* Does this CPU need a deferred NOCB wakeup? */
3454 if (rcu_nocb_need_deferred_wakeup(rdp)) {
3455 rdp->n_rp_nocb_defer_wakeup++;
3460 rdp->n_rp_need_nothing++;
3465 * Check to see if there is any immediate RCU-related work to be done
3466 * by the current CPU, returning 1 if so. This function is part of the
3467 * RCU implementation; it is -not- an exported member of the RCU API.
3469 static int rcu_pending(void)
3471 struct rcu_state *rsp;
3473 for_each_rcu_flavor(rsp)
3474 if (__rcu_pending(rsp, this_cpu_ptr(rsp->rda)))
3480 * Return true if the specified CPU has any callback. If all_lazy is
3481 * non-NULL, store an indication of whether all callbacks are lazy.
3482 * (If there are no callbacks, all of them are deemed to be lazy.)
3484 static bool __maybe_unused rcu_cpu_has_callbacks(bool *all_lazy)
3488 struct rcu_data *rdp;
3489 struct rcu_state *rsp;
3491 for_each_rcu_flavor(rsp) {
3492 rdp = this_cpu_ptr(rsp->rda);
3493 if (rcu_segcblist_empty(&rdp->cblist))
3496 if (rcu_segcblist_n_nonlazy_cbs(&rdp->cblist) || !all_lazy) {
3507 * Helper function for _rcu_barrier() tracing. If tracing is disabled,
3508 * the compiler is expected to optimize this away.
3510 static void _rcu_barrier_trace(struct rcu_state *rsp, const char *s,
3511 int cpu, unsigned long done)
3513 trace_rcu_barrier(rsp->name, s, cpu,
3514 atomic_read(&rsp->barrier_cpu_count), done);
3518 * RCU callback function for _rcu_barrier(). If we are last, wake
3519 * up the task executing _rcu_barrier().
3521 static void rcu_barrier_callback(struct rcu_head *rhp)
3523 struct rcu_data *rdp = container_of(rhp, struct rcu_data, barrier_head);
3524 struct rcu_state *rsp = rdp->rsp;
3526 if (atomic_dec_and_test(&rsp->barrier_cpu_count)) {
3527 _rcu_barrier_trace(rsp, TPS("LastCB"), -1,
3528 rsp->barrier_sequence);
3529 complete(&rsp->barrier_completion);
3531 _rcu_barrier_trace(rsp, TPS("CB"), -1, rsp->barrier_sequence);
3536 * Called with preemption disabled, and from cross-cpu IRQ context.
3538 static void rcu_barrier_func(void *type)
3540 struct rcu_state *rsp = type;
3541 struct rcu_data *rdp = raw_cpu_ptr(rsp->rda);
3543 _rcu_barrier_trace(rsp, TPS("IRQ"), -1, rsp->barrier_sequence);
3544 rdp->barrier_head.func = rcu_barrier_callback;
3545 debug_rcu_head_queue(&rdp->barrier_head);
3546 if (rcu_segcblist_entrain(&rdp->cblist, &rdp->barrier_head, 0)) {
3547 atomic_inc(&rsp->barrier_cpu_count);
3549 debug_rcu_head_unqueue(&rdp->barrier_head);
3550 _rcu_barrier_trace(rsp, TPS("IRQNQ"), -1,
3551 rsp->barrier_sequence);
3556 * Orchestrate the specified type of RCU barrier, waiting for all
3557 * RCU callbacks of the specified type to complete.
3559 static void _rcu_barrier(struct rcu_state *rsp)
3562 struct rcu_data *rdp;
3563 unsigned long s = rcu_seq_snap(&rsp->barrier_sequence);
3565 _rcu_barrier_trace(rsp, TPS("Begin"), -1, s);
3567 /* Take mutex to serialize concurrent rcu_barrier() requests. */
3568 mutex_lock(&rsp->barrier_mutex);
3570 /* Did someone else do our work for us? */
3571 if (rcu_seq_done(&rsp->barrier_sequence, s)) {
3572 _rcu_barrier_trace(rsp, TPS("EarlyExit"), -1,
3573 rsp->barrier_sequence);
3574 smp_mb(); /* caller's subsequent code after above check. */
3575 mutex_unlock(&rsp->barrier_mutex);
3579 /* Mark the start of the barrier operation. */
3580 rcu_seq_start(&rsp->barrier_sequence);
3581 _rcu_barrier_trace(rsp, TPS("Inc1"), -1, rsp->barrier_sequence);
3584 * Initialize the count to one rather than to zero in order to
3585 * avoid a too-soon return to zero in case of a short grace period
3586 * (or preemption of this task). Exclude CPU-hotplug operations
3587 * to ensure that no offline CPU has callbacks queued.
3589 init_completion(&rsp->barrier_completion);
3590 atomic_set(&rsp->barrier_cpu_count, 1);
3594 * Force each CPU with callbacks to register a new callback.
3595 * When that callback is invoked, we will know that all of the
3596 * corresponding CPU's preceding callbacks have been invoked.
3598 for_each_possible_cpu(cpu) {
3599 if (!cpu_online(cpu) && !rcu_is_nocb_cpu(cpu))
3601 rdp = per_cpu_ptr(rsp->rda, cpu);
3602 if (rcu_is_nocb_cpu(cpu)) {
3603 if (!rcu_nocb_cpu_needs_barrier(rsp, cpu)) {
3604 _rcu_barrier_trace(rsp, TPS("OfflineNoCB"), cpu,
3605 rsp->barrier_sequence);
3607 _rcu_barrier_trace(rsp, TPS("OnlineNoCB"), cpu,
3608 rsp->barrier_sequence);
3609 smp_mb__before_atomic();
3610 atomic_inc(&rsp->barrier_cpu_count);
3611 __call_rcu(&rdp->barrier_head,
3612 rcu_barrier_callback, rsp, cpu, 0);
3614 } else if (rcu_segcblist_n_cbs(&rdp->cblist)) {
3615 _rcu_barrier_trace(rsp, TPS("OnlineQ"), cpu,
3616 rsp->barrier_sequence);
3617 smp_call_function_single(cpu, rcu_barrier_func, rsp, 1);
3619 _rcu_barrier_trace(rsp, TPS("OnlineNQ"), cpu,
3620 rsp->barrier_sequence);
3626 * Now that we have an rcu_barrier_callback() callback on each
3627 * CPU, and thus each counted, remove the initial count.
3629 if (atomic_dec_and_test(&rsp->barrier_cpu_count))
3630 complete(&rsp->barrier_completion);
3632 /* Wait for all rcu_barrier_callback() callbacks to be invoked. */
3633 wait_for_completion(&rsp->barrier_completion);
3635 /* Mark the end of the barrier operation. */
3636 _rcu_barrier_trace(rsp, TPS("Inc2"), -1, rsp->barrier_sequence);
3637 rcu_seq_end(&rsp->barrier_sequence);
3639 /* Other rcu_barrier() invocations can now safely proceed. */
3640 mutex_unlock(&rsp->barrier_mutex);
3644 * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete.
3646 void rcu_barrier_bh(void)
3648 _rcu_barrier(&rcu_bh_state);
3650 EXPORT_SYMBOL_GPL(rcu_barrier_bh);
3653 * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks.
3655 void rcu_barrier_sched(void)
3657 _rcu_barrier(&rcu_sched_state);
3659 EXPORT_SYMBOL_GPL(rcu_barrier_sched);
3662 * Propagate ->qsinitmask bits up the rcu_node tree to account for the
3663 * first CPU in a given leaf rcu_node structure coming online. The caller
3664 * must hold the corresponding leaf rcu_node ->lock with interrrupts
3667 static void rcu_init_new_rnp(struct rcu_node *rnp_leaf)
3670 struct rcu_node *rnp = rnp_leaf;
3672 lockdep_assert_held(&rnp->lock);
3674 mask = rnp->grpmask;
3678 raw_spin_lock_rcu_node(rnp); /* Interrupts already disabled. */
3679 rnp->qsmaskinit |= mask;
3680 raw_spin_unlock_rcu_node(rnp); /* Interrupts remain disabled. */
3685 * Do boot-time initialization of a CPU's per-CPU RCU data.
3688 rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp)
3690 unsigned long flags;
3691 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3692 struct rcu_node *rnp = rcu_get_root(rsp);
3694 /* Set up local state, ensuring consistent view of global state. */
3695 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3696 rdp->grpmask = leaf_node_cpu_bit(rdp->mynode, cpu);
3697 rdp->dynticks = &per_cpu(rcu_dynticks, cpu);
3698 WARN_ON_ONCE(rdp->dynticks->dynticks_nesting != 1);
3699 WARN_ON_ONCE(rcu_dynticks_in_eqs(rcu_dynticks_snap(rdp->dynticks)));
3702 rcu_boot_init_nocb_percpu_data(rdp);
3703 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3707 * Initialize a CPU's per-CPU RCU data. Note that only one online or
3708 * offline event can be happening at a given time. Note also that we
3709 * can accept some slop in the rsp->completed access due to the fact
3710 * that this CPU cannot possibly have any RCU callbacks in flight yet.
3713 rcu_init_percpu_data(int cpu, struct rcu_state *rsp)
3715 unsigned long flags;
3716 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3717 struct rcu_node *rnp = rcu_get_root(rsp);
3719 /* Set up local state, ensuring consistent view of global state. */
3720 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3721 rdp->qlen_last_fqs_check = 0;
3722 rdp->n_force_qs_snap = rsp->n_force_qs;
3723 rdp->blimit = blimit;
3724 if (rcu_segcblist_empty(&rdp->cblist) && /* No early-boot CBs? */
3725 !init_nocb_callback_list(rdp))
3726 rcu_segcblist_init(&rdp->cblist); /* Re-enable callbacks. */
3727 rdp->dynticks->dynticks_nesting = 1;
3728 rcu_dynticks_eqs_online();
3729 raw_spin_unlock_rcu_node(rnp); /* irqs remain disabled. */
3732 * Add CPU to leaf rcu_node pending-online bitmask. Any needed
3733 * propagation up the rcu_node tree will happen at the beginning
3734 * of the next grace period.
3737 raw_spin_lock_rcu_node(rnp); /* irqs already disabled. */
3738 rdp->beenonline = true; /* We have now been online. */
3739 rdp->gpnum = rnp->completed; /* Make CPU later note any new GP. */
3740 rdp->completed = rnp->completed;
3741 rdp->cpu_no_qs.b.norm = true;
3742 rdp->rcu_qs_ctr_snap = per_cpu(rcu_dynticks.rcu_qs_ctr, cpu);
3743 rdp->core_needs_qs = false;
3744 rdp->rcu_iw_pending = false;
3745 rdp->rcu_iw_gpnum = rnp->gpnum - 1;
3746 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpuonl"));
3747 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3751 * Invoked early in the CPU-online process, when pretty much all
3752 * services are available. The incoming CPU is not present.
3754 int rcutree_prepare_cpu(unsigned int cpu)
3756 struct rcu_state *rsp;
3758 for_each_rcu_flavor(rsp)
3759 rcu_init_percpu_data(cpu, rsp);
3761 rcu_prepare_kthreads(cpu);
3762 rcu_spawn_all_nocb_kthreads(cpu);
3768 * Update RCU priority boot kthread affinity for CPU-hotplug changes.
3770 static void rcutree_affinity_setting(unsigned int cpu, int outgoing)
3772 struct rcu_data *rdp = per_cpu_ptr(rcu_state_p->rda, cpu);
3774 rcu_boost_kthread_setaffinity(rdp->mynode, outgoing);
3778 * Near the end of the CPU-online process. Pretty much all services
3779 * enabled, and the CPU is now very much alive.
3781 int rcutree_online_cpu(unsigned int cpu)
3783 unsigned long flags;
3784 struct rcu_data *rdp;
3785 struct rcu_node *rnp;
3786 struct rcu_state *rsp;
3788 for_each_rcu_flavor(rsp) {
3789 rdp = per_cpu_ptr(rsp->rda, cpu);
3791 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3792 rnp->ffmask |= rdp->grpmask;
3793 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3795 if (IS_ENABLED(CONFIG_TREE_SRCU))
3796 srcu_online_cpu(cpu);
3797 if (rcu_scheduler_active == RCU_SCHEDULER_INACTIVE)
3798 return 0; /* Too early in boot for scheduler work. */
3799 sync_sched_exp_online_cleanup(cpu);
3800 rcutree_affinity_setting(cpu, -1);
3805 * Near the beginning of the process. The CPU is still very much alive
3806 * with pretty much all services enabled.
3808 int rcutree_offline_cpu(unsigned int cpu)
3810 unsigned long flags;
3811 struct rcu_data *rdp;
3812 struct rcu_node *rnp;
3813 struct rcu_state *rsp;
3815 for_each_rcu_flavor(rsp) {
3816 rdp = per_cpu_ptr(rsp->rda, cpu);
3818 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3819 rnp->ffmask &= ~rdp->grpmask;
3820 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3823 rcutree_affinity_setting(cpu, cpu);
3824 if (IS_ENABLED(CONFIG_TREE_SRCU))
3825 srcu_offline_cpu(cpu);
3830 * Near the end of the offline process. We do only tracing here.
3832 int rcutree_dying_cpu(unsigned int cpu)
3834 struct rcu_state *rsp;
3836 for_each_rcu_flavor(rsp)
3837 rcu_cleanup_dying_cpu(rsp);
3842 * The outgoing CPU is gone and we are running elsewhere.
3844 int rcutree_dead_cpu(unsigned int cpu)
3846 struct rcu_state *rsp;
3848 for_each_rcu_flavor(rsp) {
3849 rcu_cleanup_dead_cpu(cpu, rsp);
3850 do_nocb_deferred_wakeup(per_cpu_ptr(rsp->rda, cpu));
3856 * Mark the specified CPU as being online so that subsequent grace periods
3857 * (both expedited and normal) will wait on it. Note that this means that
3858 * incoming CPUs are not allowed to use RCU read-side critical sections
3859 * until this function is called. Failing to observe this restriction
3860 * will result in lockdep splats.
3862 * Note that this function is special in that it is invoked directly
3863 * from the incoming CPU rather than from the cpuhp_step mechanism.
3864 * This is because this function must be invoked at a precise location.
3866 void rcu_cpu_starting(unsigned int cpu)
3868 unsigned long flags;
3871 unsigned long oldmask;
3872 struct rcu_data *rdp;
3873 struct rcu_node *rnp;
3874 struct rcu_state *rsp;
3876 for_each_rcu_flavor(rsp) {
3877 rdp = per_cpu_ptr(rsp->rda, cpu);
3879 mask = rdp->grpmask;
3880 raw_spin_lock_irqsave_rcu_node(rnp, flags);
3881 rnp->qsmaskinitnext |= mask;
3882 oldmask = rnp->expmaskinitnext;
3883 rnp->expmaskinitnext |= mask;
3884 oldmask ^= rnp->expmaskinitnext;
3885 nbits = bitmap_weight(&oldmask, BITS_PER_LONG);
3886 /* Allow lockless access for expedited grace periods. */
3887 smp_store_release(&rsp->ncpus, rsp->ncpus + nbits); /* ^^^ */
3888 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3890 smp_mb(); /* Ensure RCU read-side usage follows above initialization. */
3893 #ifdef CONFIG_HOTPLUG_CPU
3895 * The CPU is exiting the idle loop into the arch_cpu_idle_dead()
3896 * function. We now remove it from the rcu_node tree's ->qsmaskinit
3899 static void rcu_cleanup_dying_idle_cpu(int cpu, struct rcu_state *rsp)
3901 unsigned long flags;
3903 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3904 struct rcu_node *rnp = rdp->mynode; /* Outgoing CPU's rdp & rnp. */
3906 /* Remove outgoing CPU from mask in the leaf rcu_node structure. */
3907 mask = rdp->grpmask;
3908 raw_spin_lock_irqsave_rcu_node(rnp, flags); /* Enforce GP memory-order guarantee. */
3909 rnp->qsmaskinitnext &= ~mask;
3910 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
3914 * The outgoing function has no further need of RCU, so remove it from
3915 * the list of CPUs that RCU must track.
3917 * Note that this function is special in that it is invoked directly
3918 * from the outgoing CPU rather than from the cpuhp_step mechanism.
3919 * This is because this function must be invoked at a precise location.
3921 void rcu_report_dead(unsigned int cpu)
3923 struct rcu_state *rsp;
3925 /* QS for any half-done expedited RCU-sched GP. */
3927 rcu_report_exp_rdp(&rcu_sched_state,
3928 this_cpu_ptr(rcu_sched_state.rda), true);
3930 for_each_rcu_flavor(rsp)
3931 rcu_cleanup_dying_idle_cpu(cpu, rsp);
3934 /* Migrate the dead CPU's callbacks to the current CPU. */
3935 static void rcu_migrate_callbacks(int cpu, struct rcu_state *rsp)
3937 unsigned long flags;
3938 struct rcu_data *my_rdp;
3939 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3940 struct rcu_node *rnp_root = rcu_get_root(rdp->rsp);
3942 if (rcu_is_nocb_cpu(cpu) || rcu_segcblist_empty(&rdp->cblist))
3943 return; /* No callbacks to migrate. */
3945 local_irq_save(flags);
3946 my_rdp = this_cpu_ptr(rsp->rda);
3947 if (rcu_nocb_adopt_orphan_cbs(my_rdp, rdp, flags)) {
3948 local_irq_restore(flags);
3951 raw_spin_lock_rcu_node(rnp_root); /* irqs already disabled. */
3952 rcu_advance_cbs(rsp, rnp_root, rdp); /* Leverage recent GPs. */
3953 rcu_advance_cbs(rsp, rnp_root, my_rdp); /* Assign GP to pending CBs. */
3954 rcu_segcblist_merge(&my_rdp->cblist, &rdp->cblist);
3955 WARN_ON_ONCE(rcu_segcblist_empty(&my_rdp->cblist) !=
3956 !rcu_segcblist_n_cbs(&my_rdp->cblist));
3957 raw_spin_unlock_irqrestore_rcu_node(rnp_root, flags);
3958 WARN_ONCE(rcu_segcblist_n_cbs(&rdp->cblist) != 0 ||
3959 !rcu_segcblist_empty(&rdp->cblist),
3960 "rcu_cleanup_dead_cpu: Callbacks on offline CPU %d: qlen=%lu, 1stCB=%p\n",
3961 cpu, rcu_segcblist_n_cbs(&rdp->cblist),
3962 rcu_segcblist_first_cb(&rdp->cblist));
3966 * The outgoing CPU has just passed through the dying-idle state,
3967 * and we are being invoked from the CPU that was IPIed to continue the
3968 * offline operation. We need to migrate the outgoing CPU's callbacks.
3970 void rcutree_migrate_callbacks(int cpu)
3972 struct rcu_state *rsp;
3974 for_each_rcu_flavor(rsp)
3975 rcu_migrate_callbacks(cpu, rsp);
3980 * On non-huge systems, use expedited RCU grace periods to make suspend
3981 * and hibernation run faster.
3983 static int rcu_pm_notify(struct notifier_block *self,
3984 unsigned long action, void *hcpu)
3987 case PM_HIBERNATION_PREPARE:
3988 case PM_SUSPEND_PREPARE:
3989 if (nr_cpu_ids <= 256) /* Expediting bad for large systems. */
3992 case PM_POST_HIBERNATION:
3993 case PM_POST_SUSPEND:
3994 if (nr_cpu_ids <= 256) /* Expediting bad for large systems. */
3995 rcu_unexpedite_gp();
4004 * Spawn the kthreads that handle each RCU flavor's grace periods.
4006 static int __init rcu_spawn_gp_kthread(void)
4008 unsigned long flags;
4009 int kthread_prio_in = kthread_prio;
4010 struct rcu_node *rnp;
4011 struct rcu_state *rsp;
4012 struct sched_param sp;
4013 struct task_struct *t;
4015 /* Force priority into range. */
4016 if (IS_ENABLED(CONFIG_RCU_BOOST) && kthread_prio < 1)
4018 else if (kthread_prio < 0)
4020 else if (kthread_prio > 99)
4022 if (kthread_prio != kthread_prio_in)
4023 pr_alert("rcu_spawn_gp_kthread(): Limited prio to %d from %d\n",
4024 kthread_prio, kthread_prio_in);
4026 rcu_scheduler_fully_active = 1;
4027 for_each_rcu_flavor(rsp) {
4028 t = kthread_create(rcu_gp_kthread, rsp, "%s", rsp->name);
4030 rnp = rcu_get_root(rsp);
4031 raw_spin_lock_irqsave_rcu_node(rnp, flags);
4032 rsp->gp_kthread = t;
4034 sp.sched_priority = kthread_prio;
4035 sched_setscheduler_nocheck(t, SCHED_FIFO, &sp);
4037 raw_spin_unlock_irqrestore_rcu_node(rnp, flags);
4040 rcu_spawn_nocb_kthreads();
4041 rcu_spawn_boost_kthreads();
4044 early_initcall(rcu_spawn_gp_kthread);
4047 * This function is invoked towards the end of the scheduler's
4048 * initialization process. Before this is called, the idle task might
4049 * contain synchronous grace-period primitives (during which time, this idle
4050 * task is booting the system, and such primitives are no-ops). After this
4051 * function is called, any synchronous grace-period primitives are run as
4052 * expedited, with the requesting task driving the grace period forward.
4053 * A later core_initcall() rcu_set_runtime_mode() will switch to full
4054 * runtime RCU functionality.
4056 void rcu_scheduler_starting(void)
4058 WARN_ON(num_online_cpus() != 1);
4059 WARN_ON(nr_context_switches() > 0);
4060 rcu_test_sync_prims();
4061 rcu_scheduler_active = RCU_SCHEDULER_INIT;
4062 rcu_test_sync_prims();
4066 * Helper function for rcu_init() that initializes one rcu_state structure.
4068 static void __init rcu_init_one(struct rcu_state *rsp)
4070 static const char * const buf[] = RCU_NODE_NAME_INIT;
4071 static const char * const fqs[] = RCU_FQS_NAME_INIT;
4072 static struct lock_class_key rcu_node_class[RCU_NUM_LVLS];
4073 static struct lock_class_key rcu_fqs_class[RCU_NUM_LVLS];
4075 int levelspread[RCU_NUM_LVLS]; /* kids/node in each level. */
4079 struct rcu_node *rnp;
4081 BUILD_BUG_ON(RCU_NUM_LVLS > ARRAY_SIZE(buf)); /* Fix buf[] init! */
4083 /* Silence gcc 4.8 false positive about array index out of range. */
4084 if (rcu_num_lvls <= 0 || rcu_num_lvls > RCU_NUM_LVLS)
4085 panic("rcu_init_one: rcu_num_lvls out of range");
4087 /* Initialize the level-tracking arrays. */
4089 for (i = 1; i < rcu_num_lvls; i++)
4090 rsp->level[i] = rsp->level[i - 1] + num_rcu_lvl[i - 1];
4091 rcu_init_levelspread(levelspread, num_rcu_lvl);
4093 /* Initialize the elements themselves, starting from the leaves. */
4095 for (i = rcu_num_lvls - 1; i >= 0; i--) {
4096 cpustride *= levelspread[i];
4097 rnp = rsp->level[i];
4098 for (j = 0; j < num_rcu_lvl[i]; j++, rnp++) {
4099 raw_spin_lock_init(&ACCESS_PRIVATE(rnp, lock));
4100 lockdep_set_class_and_name(&ACCESS_PRIVATE(rnp, lock),
4101 &rcu_node_class[i], buf[i]);
4102 raw_spin_lock_init(&rnp->fqslock);
4103 lockdep_set_class_and_name(&rnp->fqslock,
4104 &rcu_fqs_class[i], fqs[i]);
4105 rnp->gpnum = rsp->gpnum;
4106 rnp->completed = rsp->completed;
4108 rnp->qsmaskinit = 0;
4109 rnp->grplo = j * cpustride;
4110 rnp->grphi = (j + 1) * cpustride - 1;
4111 if (rnp->grphi >= nr_cpu_ids)
4112 rnp->grphi = nr_cpu_ids - 1;
4118 rnp->grpnum = j % levelspread[i - 1];
4119 rnp->grpmask = 1UL << rnp->grpnum;
4120 rnp->parent = rsp->level[i - 1] +
4121 j / levelspread[i - 1];
4124 INIT_LIST_HEAD(&rnp->blkd_tasks);
4125 rcu_init_one_nocb(rnp);
4126 init_waitqueue_head(&rnp->exp_wq[0]);
4127 init_waitqueue_head(&rnp->exp_wq[1]);
4128 init_waitqueue_head(&rnp->exp_wq[2]);
4129 init_waitqueue_head(&rnp->exp_wq[3]);
4130 spin_lock_init(&rnp->exp_lock);
4134 init_swait_queue_head(&rsp->gp_wq);
4135 init_swait_queue_head(&rsp->expedited_wq);
4136 rnp = rsp->level[rcu_num_lvls - 1];
4137 for_each_possible_cpu(i) {
4138 while (i > rnp->grphi)
4140 per_cpu_ptr(rsp->rda, i)->mynode = rnp;
4141 rcu_boot_init_percpu_data(i, rsp);
4143 list_add(&rsp->flavors, &rcu_struct_flavors);
4147 * Compute the rcu_node tree geometry from kernel parameters. This cannot
4148 * replace the definitions in tree.h because those are needed to size
4149 * the ->node array in the rcu_state structure.
4151 static void __init rcu_init_geometry(void)
4155 int rcu_capacity[RCU_NUM_LVLS];
4158 * Initialize any unspecified boot parameters.
4159 * The default values of jiffies_till_first_fqs and
4160 * jiffies_till_next_fqs are set to the RCU_JIFFIES_TILL_FORCE_QS
4161 * value, which is a function of HZ, then adding one for each
4162 * RCU_JIFFIES_FQS_DIV CPUs that might be on the system.
4164 d = RCU_JIFFIES_TILL_FORCE_QS + nr_cpu_ids / RCU_JIFFIES_FQS_DIV;
4165 if (jiffies_till_first_fqs == ULONG_MAX)
4166 jiffies_till_first_fqs = d;
4167 if (jiffies_till_next_fqs == ULONG_MAX)
4168 jiffies_till_next_fqs = d;
4170 /* If the compile-time values are accurate, just leave. */
4171 if (rcu_fanout_leaf == RCU_FANOUT_LEAF &&
4172 nr_cpu_ids == NR_CPUS)
4174 pr_info("RCU: Adjusting geometry for rcu_fanout_leaf=%d, nr_cpu_ids=%u\n",
4175 rcu_fanout_leaf, nr_cpu_ids);
4178 * The boot-time rcu_fanout_leaf parameter must be at least two
4179 * and cannot exceed the number of bits in the rcu_node masks.
4180 * Complain and fall back to the compile-time values if this
4181 * limit is exceeded.
4183 if (rcu_fanout_leaf < 2 ||
4184 rcu_fanout_leaf > sizeof(unsigned long) * 8) {
4185 rcu_fanout_leaf = RCU_FANOUT_LEAF;
4191 * Compute number of nodes that can be handled an rcu_node tree
4192 * with the given number of levels.
4194 rcu_capacity[0] = rcu_fanout_leaf;
4195 for (i = 1; i < RCU_NUM_LVLS; i++)
4196 rcu_capacity[i] = rcu_capacity[i - 1] * RCU_FANOUT;
4199 * The tree must be able to accommodate the configured number of CPUs.
4200 * If this limit is exceeded, fall back to the compile-time values.
4202 if (nr_cpu_ids > rcu_capacity[RCU_NUM_LVLS - 1]) {
4203 rcu_fanout_leaf = RCU_FANOUT_LEAF;
4208 /* Calculate the number of levels in the tree. */
4209 for (i = 0; nr_cpu_ids > rcu_capacity[i]; i++) {
4211 rcu_num_lvls = i + 1;
4213 /* Calculate the number of rcu_nodes at each level of the tree. */
4214 for (i = 0; i < rcu_num_lvls; i++) {
4215 int cap = rcu_capacity[(rcu_num_lvls - 1) - i];
4216 num_rcu_lvl[i] = DIV_ROUND_UP(nr_cpu_ids, cap);
4219 /* Calculate the total number of rcu_node structures. */
4221 for (i = 0; i < rcu_num_lvls; i++)
4222 rcu_num_nodes += num_rcu_lvl[i];
4226 * Dump out the structure of the rcu_node combining tree associated
4227 * with the rcu_state structure referenced by rsp.
4229 static void __init rcu_dump_rcu_node_tree(struct rcu_state *rsp)
4232 struct rcu_node *rnp;
4234 pr_info("rcu_node tree layout dump\n");
4236 rcu_for_each_node_breadth_first(rsp, rnp) {
4237 if (rnp->level != level) {
4242 pr_cont("%d:%d ^%d ", rnp->grplo, rnp->grphi, rnp->grpnum);
4247 void __init rcu_init(void)
4251 rcu_early_boot_tests();
4253 rcu_bootup_announce();
4254 rcu_init_geometry();
4255 rcu_init_one(&rcu_bh_state);
4256 rcu_init_one(&rcu_sched_state);
4258 rcu_dump_rcu_node_tree(&rcu_sched_state);
4259 __rcu_init_preempt();
4260 open_softirq(RCU_SOFTIRQ, rcu_process_callbacks);
4263 * We don't need protection against CPU-hotplug here because
4264 * this is called early in boot, before either interrupts
4265 * or the scheduler are operational.
4267 pm_notifier(rcu_pm_notify, 0);
4268 for_each_online_cpu(cpu) {
4269 rcutree_prepare_cpu(cpu);
4270 rcu_cpu_starting(cpu);
4271 rcutree_online_cpu(cpu);
4275 #include "tree_exp.h"
4276 #include "tree_plugin.h"